3 * Copyright (C) 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000,
4 * 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008 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
13 * to discover, and no knowing what you'll find round a corner.
14 * And Elves, sir!' --Samwise Gamgee
16 * [p.225 of _The Lord of the Rings_, II/i: "Many Meetings"]
19 /* This file contains general pp ("push/pop") functions that execute the
20 * opcodes that make up a perl program. A typical pp function expects to
21 * find its arguments on the stack, and usually pushes its results onto
22 * the stack, hence the 'pp' terminology. Each OP structure contains
23 * a pointer to the relevant pp_foo() function.
31 #include "invlist_inline.h"
33 #include "regcharclass.h"
35 /* variations on pp_null */
40 if (GIMME_V == G_SCALAR)
52 assert(SvTYPE(TARG) == SVt_PVCV);
67 CV * const protocv = PadnamePROTOCV(
68 PadlistNAMESARRAY(CvPADLIST(find_runcv(NULL)))[ARGTARG]
70 assert(SvTYPE(TARG) == SVt_PVCV);
72 if (CvISXSUB(protocv)) { /* constant */
73 /* XXX Should we clone it here? */
74 /* If this changes to use SAVECLEARSV, we can move the SAVECLEARSV
75 to introcv and remove the SvPADSTALE_off. */
76 SAVEPADSVANDMORTALIZE(ARGTARG);
77 PAD_SVl(ARGTARG) = SvREFCNT_inc_simple_NN(protocv);
80 if (CvROOT(protocv)) {
81 assert(CvCLONE(protocv));
82 assert(!CvCLONED(protocv));
84 cv_clone_into(protocv,(CV *)TARG);
85 SAVECLEARSV(PAD_SVl(ARGTARG));
92 /* In some cases this function inspects PL_op. If this function is called
93 for new op types, more bool parameters may need to be added in place of
96 When noinit is true, the absence of a gv will cause a retval of undef.
97 This is unrelated to the cv-to-gv assignment case.
101 S_rv2gv(pTHX_ SV *sv, const bool vivify_sv, const bool strict,
104 if (!isGV(sv) || SvFAKE(sv)) SvGETMAGIC(sv);
107 sv = amagic_deref_call(sv, to_gv_amg);
111 if (SvTYPE(sv) == SVt_PVIO) {
112 GV * const gv = MUTABLE_GV(sv_newmortal());
113 gv_init(gv, 0, "__ANONIO__", 10, 0);
114 GvIOp(gv) = MUTABLE_IO(sv);
115 SvREFCNT_inc_void_NN(sv);
118 else if (!isGV_with_GP(sv)) {
119 Perl_die(aTHX_ "Not a GLOB reference");
123 if (!isGV_with_GP(sv)) {
125 /* If this is a 'my' scalar and flag is set then vivify
128 if (vivify_sv && sv != &PL_sv_undef) {
132 Perl_croak_no_modify();
133 gv = MUTABLE_GV(newSV(0));
134 stash = CopSTASH(PL_curcop);
135 if (SvTYPE(stash) != SVt_PVHV) stash = NULL;
136 if (cUNOP->op_targ) {
137 SV * const namesv = PAD_SV(cUNOP->op_targ);
138 gv_init_sv(gv, stash, namesv, 0);
141 gv_init_pv(gv, stash, "__ANONIO__", 0);
143 prepare_SV_for_RV(sv);
144 SvRV_set(sv, MUTABLE_SV(gv));
149 if (PL_op->op_flags & OPf_REF || strict) {
150 Perl_die(aTHX_ PL_no_usym, "a symbol");
152 if (ckWARN(WARN_UNINITIALIZED))
158 if (!(sv = MUTABLE_SV(gv_fetchsv_nomg(
159 sv, GV_ADDMG, SVt_PVGV
168 (SvPOKp(sv) && SvCUR(sv)>32 ? "..." : ""),
172 if ((PL_op->op_private & (OPpLVAL_INTRO|OPpDONT_INIT_GV))
173 == OPpDONT_INIT_GV) {
174 /* We are the target of a coderef assignment. Return
175 the scalar unchanged, and let pp_sasssign deal with
179 sv = MUTABLE_SV(gv_fetchsv_nomg(sv, GV_ADD, SVt_PVGV));
181 /* FAKE globs in the symbol table cause weird bugs (#77810) */
185 if (SvFAKE(sv) && !(PL_op->op_private & OPpALLOW_FAKE)) {
186 SV *newsv = sv_newmortal();
187 sv_setsv_flags(newsv, sv, 0);
199 sv, PL_op->op_private & OPpDEREF,
200 PL_op->op_private & HINT_STRICT_REFS,
201 ((PL_op->op_flags & OPf_SPECIAL) && !(PL_op->op_flags & OPf_MOD))
202 || PL_op->op_type == OP_READLINE
204 if (PL_op->op_private & OPpLVAL_INTRO)
205 save_gp(MUTABLE_GV(sv), !(PL_op->op_flags & OPf_SPECIAL));
210 /* Helper function for pp_rv2sv and pp_rv2av */
212 Perl_softref2xv(pTHX_ SV *const sv, const char *const what,
213 const svtype type, SV ***spp)
217 PERL_ARGS_ASSERT_SOFTREF2XV;
219 if (PL_op->op_private & HINT_STRICT_REFS) {
221 Perl_die(aTHX_ PL_no_symref_sv, sv,
222 (SvPOKp(sv) && SvCUR(sv)>32 ? "..." : ""), what);
224 Perl_die(aTHX_ PL_no_usym, what);
228 PL_op->op_flags & OPf_REF
230 Perl_die(aTHX_ PL_no_usym, what);
231 if (ckWARN(WARN_UNINITIALIZED))
233 if (type != SVt_PV && GIMME_V == G_ARRAY) {
237 **spp = &PL_sv_undef;
240 if ((PL_op->op_flags & OPf_SPECIAL) &&
241 !(PL_op->op_flags & OPf_MOD))
243 if (!(gv = gv_fetchsv_nomg(sv, GV_ADDMG, type)))
245 **spp = &PL_sv_undef;
250 gv = gv_fetchsv_nomg(sv, GV_ADD, type);
263 sv = amagic_deref_call(sv, to_sv_amg);
267 if (SvTYPE(sv) >= SVt_PVAV)
268 DIE(aTHX_ "Not a SCALAR reference");
273 if (!isGV_with_GP(gv)) {
274 gv = Perl_softref2xv(aTHX_ sv, "a SCALAR", SVt_PV, &sp);
280 if (PL_op->op_flags & OPf_MOD) {
281 if (PL_op->op_private & OPpLVAL_INTRO) {
282 if (cUNOP->op_first->op_type == OP_NULL)
283 sv = save_scalar(MUTABLE_GV(TOPs));
285 sv = save_scalar(gv);
287 Perl_croak(aTHX_ "%s", PL_no_localize_ref);
289 else if (PL_op->op_private & OPpDEREF)
290 sv = vivify_ref(sv, PL_op->op_private & OPpDEREF);
292 SPAGAIN; /* in case chasing soft refs reallocated the stack */
300 AV * const av = MUTABLE_AV(TOPs);
301 const I32 lvalue = PL_op->op_flags & OPf_MOD || LVRET;
303 SV ** const svp = Perl_av_arylen_p(aTHX_ MUTABLE_AV(av));
305 *svp = newSV_type(SVt_PVMG);
306 sv_magic(*svp, MUTABLE_SV(av), PERL_MAGIC_arylen, NULL, 0);
310 SETs(sv_2mortal(newSViv(AvFILL(MUTABLE_AV(av)))));
319 if (PL_op->op_flags & OPf_MOD || LVRET) {
320 SV * const ret = sv_2mortal(newSV_type(SVt_PVLV));/* Not TARG RT#67838 */
321 sv_magic(ret, NULL, PERL_MAGIC_pos, NULL, 0);
323 LvTARG(ret) = SvREFCNT_inc_simple(sv);
324 SETs(ret); /* no SvSETMAGIC */
327 const MAGIC * const mg = mg_find_mglob(sv);
328 if (mg && mg->mg_len != -1) {
329 STRLEN i = mg->mg_len;
330 if (PL_op->op_private & OPpTRUEBOOL)
331 SETs(i ? &PL_sv_yes : &PL_sv_zero);
334 if (mg->mg_flags & MGf_BYTES && DO_UTF8(sv))
335 i = sv_pos_b2u_flags(sv, i, SV_GMAGIC|SV_CONST_RETURN);
350 const I32 flags = (PL_op->op_flags & OPf_SPECIAL)
352 : ((PL_op->op_private & (OPpLVAL_INTRO|OPpMAY_RETURN_CONSTANT))
353 == OPpMAY_RETURN_CONSTANT)
356 /* We usually try to add a non-existent subroutine in case of AUTOLOAD. */
357 /* (But not in defined().) */
359 CV *cv = sv_2cv(TOPs, &stash_unused, &gv, flags);
361 else if ((flags == (GV_ADD|GV_NOEXPAND)) && gv && SvROK(gv)) {
362 cv = SvTYPE(SvRV(gv)) == SVt_PVCV
363 ? MUTABLE_CV(SvRV(gv))
367 cv = MUTABLE_CV(&PL_sv_undef);
368 SETs(MUTABLE_SV(cv));
378 SV *ret = &PL_sv_undef;
380 if (SvGMAGICAL(TOPs)) SETs(sv_mortalcopy(TOPs));
381 if (SvPOK(TOPs) && SvCUR(TOPs) >= 7) {
382 const char * s = SvPVX_const(TOPs);
383 if (memBEGINs(s, SvCUR(TOPs), "CORE::")) {
384 const int code = keyword(s + 6, SvCUR(TOPs) - 6, 1);
386 DIE(aTHX_ "Can't find an opnumber for \"%" UTF8f "\"",
387 UTF8fARG(SvFLAGS(TOPs) & SVf_UTF8, SvCUR(TOPs)-6, s+6));
389 SV * const sv = core_prototype(NULL, s + 6, code, NULL);
395 cv = sv_2cv(TOPs, &stash, &gv, 0);
397 ret = newSVpvn_flags(
398 CvPROTO(cv), CvPROTOLEN(cv), SVs_TEMP | SvUTF8(cv)
408 CV *cv = MUTABLE_CV(PAD_SV(PL_op->op_targ));
410 cv = MUTABLE_CV(sv_2mortal(MUTABLE_SV(cv_clone(cv))));
412 PUSHs(MUTABLE_SV(cv));
426 if (GIMME_V != G_ARRAY) {
432 *MARK = &PL_sv_undef;
434 *MARK = refto(*MARK);
438 EXTEND_MORTAL(SP - MARK);
440 *MARK = refto(*MARK);
445 S_refto(pTHX_ SV *sv)
449 PERL_ARGS_ASSERT_REFTO;
451 if (SvTYPE(sv) == SVt_PVLV && LvTYPE(sv) == 'y') {
454 if (!(sv = LvTARG(sv)))
457 SvREFCNT_inc_void_NN(sv);
459 else if (SvTYPE(sv) == SVt_PVAV) {
460 if (!AvREAL((const AV *)sv) && AvREIFY((const AV *)sv))
461 av_reify(MUTABLE_AV(sv));
463 SvREFCNT_inc_void_NN(sv);
465 else if (SvPADTMP(sv)) {
468 else if (UNLIKELY(SvSMAGICAL(sv) && mg_find(sv, PERL_MAGIC_nonelem)))
469 sv_unmagic(SvREFCNT_inc_simple_NN(sv), PERL_MAGIC_nonelem);
472 SvREFCNT_inc_void_NN(sv);
475 sv_upgrade(rv, SVt_IV);
484 SV * const sv = TOPs;
492 /* op is in boolean context? */
493 if ( (PL_op->op_private & OPpTRUEBOOL)
494 || ( (PL_op->op_private & OPpMAYBE_TRUEBOOL)
495 && block_gimme() == G_VOID))
497 /* refs are always true - unless it's to an object blessed into a
498 * class with a false name, i.e. "0". So we have to check for
499 * that remote possibility. The following is is basically an
500 * unrolled SvTRUE(sv_reftype(rv)) */
501 SV * const rv = SvRV(sv);
503 HV *stash = SvSTASH(rv);
504 HEK *hek = HvNAME_HEK(stash);
506 I32 len = HEK_LEN(hek);
507 /* bail out and do it the hard way? */
510 || (len == 1 && HEK_KEY(hek)[0] == '0')
523 sv_ref(TARG, SvRV(sv), TRUE);
539 stash = CopSTASH(PL_curcop);
540 if (SvTYPE(stash) != SVt_PVHV)
541 Perl_croak(aTHX_ "Attempt to bless into a freed package");
544 SV * const ssv = POPs;
548 if (!ssv) goto curstash;
551 if (!SvAMAGIC(ssv)) {
553 Perl_croak(aTHX_ "Attempt to bless into a reference");
555 /* SvAMAGIC is on here, but it only means potentially overloaded,
556 so after stringification: */
557 ptr = SvPV_nomg_const(ssv,len);
558 /* We need to check the flag again: */
559 if (!SvAMAGIC(ssv)) goto frog;
561 else ptr = SvPV_nomg_const(ssv,len);
563 Perl_ck_warner(aTHX_ packWARN(WARN_MISC),
564 "Explicit blessing to '' (assuming package main)");
565 stash = gv_stashpvn(ptr, len, GV_ADD|SvUTF8(ssv));
568 (void)sv_bless(TOPs, stash);
578 const char * const elem = SvPV_const(sv, len);
579 GV * const gv = MUTABLE_GV(TOPs);
584 /* elem will always be NUL terminated. */
587 if (memEQs(elem, len, "ARRAY"))
589 tmpRef = MUTABLE_SV(GvAV(gv));
590 if (tmpRef && !AvREAL((const AV *)tmpRef)
591 && AvREIFY((const AV *)tmpRef))
592 av_reify(MUTABLE_AV(tmpRef));
596 if (memEQs(elem, len, "CODE"))
597 tmpRef = MUTABLE_SV(GvCVu(gv));
600 if (memEQs(elem, len, "FILEHANDLE")) {
601 tmpRef = MUTABLE_SV(GvIOp(gv));
604 if (memEQs(elem, len, "FORMAT"))
605 tmpRef = MUTABLE_SV(GvFORM(gv));
608 if (memEQs(elem, len, "GLOB"))
609 tmpRef = MUTABLE_SV(gv);
612 if (memEQs(elem, len, "HASH"))
613 tmpRef = MUTABLE_SV(GvHV(gv));
616 if (memEQs(elem, len, "IO"))
617 tmpRef = MUTABLE_SV(GvIOp(gv));
620 if (memEQs(elem, len, "NAME"))
621 sv = newSVhek(GvNAME_HEK(gv));
624 if (memEQs(elem, len, "PACKAGE")) {
625 const HV * const stash = GvSTASH(gv);
626 const HEK * const hek = stash ? HvNAME_HEK(stash) : NULL;
627 sv = hek ? newSVhek(hek) : newSVpvs("__ANON__");
631 if (memEQs(elem, len, "SCALAR"))
646 /* Pattern matching */
654 if (len == 0 || len > I32_MAX || !SvPOK(sv) || SvUTF8(sv) || SvVALID(sv)) {
655 /* Historically, study was skipped in these cases. */
660 /* Make study a no-op. It's no longer useful and its existence
661 complicates matters elsewhere. */
667 /* also used for: pp_transr() */
674 if (PL_op->op_flags & OPf_STACKED)
679 sv = PAD_SV(ARGTARG);
684 if(PL_op->op_type == OP_TRANSR) {
686 const char * const pv = SvPV(sv,len);
687 SV * const newsv = newSVpvn_flags(pv, len, SVs_TEMP|SvUTF8(sv));
692 Size_t i = do_trans(sv);
698 /* Lvalue operators. */
701 S_do_chomp(pTHX_ SV *retval, SV *sv, bool chomping)
707 PERL_ARGS_ASSERT_DO_CHOMP;
709 if (chomping && (RsSNARF(PL_rs) || RsRECORD(PL_rs)))
711 if (SvTYPE(sv) == SVt_PVAV) {
713 AV *const av = MUTABLE_AV(sv);
714 const I32 max = AvFILL(av);
716 for (i = 0; i <= max; i++) {
717 sv = MUTABLE_SV(av_fetch(av, i, FALSE));
718 if (sv && ((sv = *(SV**)sv), sv != &PL_sv_undef))
719 count += do_chomp(retval, sv, chomping);
723 else if (SvTYPE(sv) == SVt_PVHV) {
724 HV* const hv = MUTABLE_HV(sv);
726 (void)hv_iterinit(hv);
727 while ((entry = hv_iternext(hv)))
728 count += do_chomp(retval, hv_iterval(hv,entry), chomping);
731 else if (SvREADONLY(sv)) {
732 Perl_croak_no_modify();
738 char *temp_buffer = NULL;
743 goto nope_free_nothing;
745 while (len && s[-1] == '\n') {
752 STRLEN rslen, rs_charlen;
753 const char *rsptr = SvPV_const(PL_rs, rslen);
755 rs_charlen = SvUTF8(PL_rs)
759 if (SvUTF8(PL_rs) != SvUTF8(sv)) {
760 /* Assumption is that rs is shorter than the scalar. */
762 /* RS is utf8, scalar is 8 bit. */
764 temp_buffer = (char*)bytes_from_utf8((U8*)rsptr,
767 /* Cannot downgrade, therefore cannot possibly match.
768 At this point, temp_buffer is not alloced, and
769 is the buffer inside PL_rs, so dont free it.
771 assert (temp_buffer == rsptr);
777 /* RS is 8 bit, scalar is utf8. */
778 temp_buffer = (char*)bytes_to_utf8((U8*)rsptr, &rslen);
792 if (memNE(s, rsptr, rslen))
797 SvPV_force_nomg_nolen(sv);
804 Safefree(temp_buffer);
806 SvREFCNT_dec(svrecode);
810 if (len && (!SvPOK(sv) || SvIsCOW(sv)))
811 s = SvPV_force_nomg(sv, len);
814 char * const send = s + len;
815 char * const start = s;
817 while (s > start && UTF8_IS_CONTINUATION(*s))
819 if (is_utf8_string((U8*)s, send - s)) {
820 sv_setpvn(retval, s, send - s);
822 SvCUR_set(sv, s - start);
832 sv_setpvn(retval, s, 1);
846 /* also used for: pp_schomp() */
851 const bool chomping = PL_op->op_type == OP_SCHOMP;
853 const size_t count = do_chomp(TARG, TOPs, chomping);
855 sv_setiv(TARG, count);
861 /* also used for: pp_chomp() */
865 dSP; dMARK; dTARGET; dORIGMARK;
866 const bool chomping = PL_op->op_type == OP_CHOMP;
870 count += do_chomp(TARG, *++MARK, chomping);
872 sv_setiv(TARG, count);
883 if (!PL_op->op_private) {
895 if (SvTHINKFIRST(sv))
896 sv_force_normal_flags(sv, SV_COW_DROP_PV|SV_IMMEDIATE_UNREF);
898 switch (SvTYPE(sv)) {
902 av_undef(MUTABLE_AV(sv));
905 hv_undef(MUTABLE_HV(sv));
908 if (cv_const_sv((const CV *)sv))
909 Perl_ck_warner(aTHX_ packWARN(WARN_MISC),
910 "Constant subroutine %" SVf " undefined",
911 SVfARG(CvANON((const CV *)sv)
912 ? newSVpvs_flags("(anonymous)", SVs_TEMP)
913 : sv_2mortal(newSVhek(
915 ? CvNAME_HEK((CV *)sv)
916 : GvENAME_HEK(CvGV((const CV *)sv))
921 /* let user-undef'd sub keep its identity */
922 cv_undef_flags(MUTABLE_CV(sv), CV_UNDEF_KEEP_NAME);
925 assert(isGV_with_GP(sv));
931 /* undef *Pkg::meth_name ... */
933 = GvCVu((const GV *)sv) && (stash = GvSTASH((const GV *)sv))
934 && HvENAME_get(stash);
936 if((stash = GvHV((const GV *)sv))) {
937 if(HvENAME_get(stash))
938 SvREFCNT_inc_simple_void_NN(sv_2mortal((SV *)stash));
942 SvREFCNT_inc_simple_void_NN(sv_2mortal(sv));
943 gp_free(MUTABLE_GV(sv));
945 GvGP_set(sv, gp_ref(gp));
946 #ifndef PERL_DONT_CREATE_GVSV
949 GvLINE(sv) = CopLINE(PL_curcop);
950 GvEGV(sv) = MUTABLE_GV(sv);
954 mro_package_moved(NULL, stash, (const GV *)sv, 0);
956 /* undef *Foo::ISA */
957 if( strEQ(GvNAME((const GV *)sv), "ISA")
958 && (stash = GvSTASH((const GV *)sv))
959 && (method_changed || HvENAME(stash)) )
960 mro_isa_changed_in(stash);
961 else if(method_changed)
962 mro_method_changed_in(
963 GvSTASH((const GV *)sv)
969 if (SvTYPE(sv) >= SVt_PV && SvPVX_const(sv) && SvLEN(sv)) {
983 /* common "slow" code for pp_postinc and pp_postdec */
986 S_postincdec_common(pTHX_ SV *sv, SV *targ)
990 PL_op->op_type == OP_POSTINC || PL_op->op_type == OP_I_POSTINC;
993 TARG = sv_newmortal();
1000 /* special case for undef: see thread at 2003-03/msg00536.html in archive */
1001 if (inc && !SvOK(TARG))
1008 /* also used for: pp_i_postinc() */
1015 /* special-case sv being a simple integer */
1016 if (LIKELY(((sv->sv_flags &
1017 (SVf_THINKFIRST|SVs_GMG|SVf_IVisUV|
1018 SVf_IOK|SVf_NOK|SVf_POK|SVp_NOK|SVp_POK|SVf_ROK))
1020 && SvIVX(sv) != IV_MAX)
1023 SvIV_set(sv, iv + 1);
1024 TARGi(iv, 0); /* arg not GMG, so can't be tainted */
1029 return S_postincdec_common(aTHX_ sv, TARG);
1033 /* also used for: pp_i_postdec() */
1040 /* special-case sv being a simple integer */
1041 if (LIKELY(((sv->sv_flags &
1042 (SVf_THINKFIRST|SVs_GMG|SVf_IVisUV|
1043 SVf_IOK|SVf_NOK|SVf_POK|SVp_NOK|SVp_POK|SVf_ROK))
1045 && SvIVX(sv) != IV_MIN)
1048 SvIV_set(sv, iv - 1);
1049 TARGi(iv, 0); /* arg not GMG, so can't be tainted */
1054 return S_postincdec_common(aTHX_ sv, TARG);
1058 /* Ordinary operators. */
1062 dSP; dATARGET; SV *svl, *svr;
1063 #ifdef PERL_PRESERVE_IVUV
1066 tryAMAGICbin_MG(pow_amg, AMGf_assign|AMGf_numeric);
1069 #ifdef PERL_PRESERVE_IVUV
1070 /* For integer to integer power, we do the calculation by hand wherever
1071 we're sure it is safe; otherwise we call pow() and try to convert to
1072 integer afterwards. */
1073 if (SvIV_please_nomg(svr) && SvIV_please_nomg(svl)) {
1081 const IV iv = SvIVX(svr);
1085 goto float_it; /* Can't do negative powers this way. */
1089 baseuok = SvUOK(svl);
1091 baseuv = SvUVX(svl);
1093 const IV iv = SvIVX(svl);
1096 baseuok = TRUE; /* effectively it's a UV now */
1098 baseuv = -iv; /* abs, baseuok == false records sign */
1101 /* now we have integer ** positive integer. */
1104 /* foo & (foo - 1) is zero only for a power of 2. */
1105 if (!(baseuv & (baseuv - 1))) {
1106 /* We are raising power-of-2 to a positive integer.
1107 The logic here will work for any base (even non-integer
1108 bases) but it can be less accurate than
1109 pow (base,power) or exp (power * log (base)) when the
1110 intermediate values start to spill out of the mantissa.
1111 With powers of 2 we know this can't happen.
1112 And powers of 2 are the favourite thing for perl
1113 programmers to notice ** not doing what they mean. */
1115 NV base = baseuok ? baseuv : -(NV)baseuv;
1120 while (power >>= 1) {
1128 SvIV_please_nomg(svr);
1131 unsigned int highbit = 8 * sizeof(UV);
1132 unsigned int diff = 8 * sizeof(UV);
1133 while (diff >>= 1) {
1135 if (baseuv >> highbit) {
1139 /* we now have baseuv < 2 ** highbit */
1140 if (power * highbit <= 8 * sizeof(UV)) {
1141 /* result will definitely fit in UV, so use UV math
1142 on same algorithm as above */
1145 const bool odd_power = cBOOL(power & 1);
1149 while (power >>= 1) {
1156 if (baseuok || !odd_power)
1157 /* answer is positive */
1159 else if (result <= (UV)IV_MAX)
1160 /* answer negative, fits in IV */
1161 SETi( -(IV)result );
1162 else if (result == (UV)IV_MIN)
1163 /* 2's complement assumption: special case IV_MIN */
1166 /* answer negative, doesn't fit */
1167 SETn( -(NV)result );
1175 NV right = SvNV_nomg(svr);
1176 NV left = SvNV_nomg(svl);
1179 #if defined(USE_LONG_DOUBLE) && defined(HAS_AIX_POWL_NEG_BASE_BUG)
1181 We are building perl with long double support and are on an AIX OS
1182 afflicted with a powl() function that wrongly returns NaNQ for any
1183 negative base. This was reported to IBM as PMR #23047-379 on
1184 03/06/2006. The problem exists in at least the following versions
1185 of AIX and the libm fileset, and no doubt others as well:
1187 AIX 4.3.3-ML10 bos.adt.libm 4.3.3.50
1188 AIX 5.1.0-ML04 bos.adt.libm 5.1.0.29
1189 AIX 5.2.0 bos.adt.libm 5.2.0.85
1191 So, until IBM fixes powl(), we provide the following workaround to
1192 handle the problem ourselves. Our logic is as follows: for
1193 negative bases (left), we use fmod(right, 2) to check if the
1194 exponent is an odd or even integer:
1196 - if odd, powl(left, right) == -powl(-left, right)
1197 - if even, powl(left, right) == powl(-left, right)
1199 If the exponent is not an integer, the result is rightly NaNQ, so
1200 we just return that (as NV_NAN).
1204 NV mod2 = Perl_fmod( right, 2.0 );
1205 if (mod2 == 1.0 || mod2 == -1.0) { /* odd integer */
1206 SETn( -Perl_pow( -left, right) );
1207 } else if (mod2 == 0.0) { /* even integer */
1208 SETn( Perl_pow( -left, right) );
1209 } else { /* fractional power */
1213 SETn( Perl_pow( left, right) );
1216 SETn( Perl_pow( left, right) );
1217 #endif /* HAS_AIX_POWL_NEG_BASE_BUG */
1219 #ifdef PERL_PRESERVE_IVUV
1221 SvIV_please_nomg(svr);
1229 dSP; dATARGET; SV *svl, *svr;
1230 tryAMAGICbin_MG(mult_amg, AMGf_assign|AMGf_numeric);
1234 #ifdef PERL_PRESERVE_IVUV
1236 /* special-case some simple common cases */
1237 if (!((svl->sv_flags|svr->sv_flags) & (SVf_IVisUV|SVs_GMG))) {
1239 U32 flags = (svl->sv_flags & svr->sv_flags);
1240 if (flags & SVf_IOK) {
1241 /* both args are simple IVs */
1246 topl = ((UV)il) >> (UVSIZE * 4 - 1);
1247 topr = ((UV)ir) >> (UVSIZE * 4 - 1);
1249 /* if both are in a range that can't under/overflow, do a
1250 * simple integer multiply: if the top halves(*) of both numbers
1251 * are 00...00 or 11...11, then it's safe.
1252 * (*) for 32-bits, the "top half" is the top 17 bits,
1253 * for 64-bits, its 33 bits */
1255 ((topl+1) | (topr+1))
1256 & ( (((UV)1) << (UVSIZE * 4 + 1)) - 2) /* 11..110 */
1259 TARGi(il * ir, 0); /* args not GMG, so can't be tainted */
1265 else if (flags & SVf_NOK) {
1266 /* both args are NVs */
1271 if (lossless_NV_to_IV(nl, &il) && lossless_NV_to_IV(nr, &ir)) {
1272 /* nothing was lost by converting to IVs */
1277 # if defined(__sgi) && defined(USE_LONG_DOUBLE) && LONG_DOUBLEKIND == LONG_DOUBLE_IS_DOUBLEDOUBLE_128_BIT_BE_BE && NVSIZE == 16
1278 if (Perl_isinf(result)) {
1279 Zero((U8*)&result + 8, 8, U8);
1282 TARGn(result, 0); /* args not GMG, so can't be tainted */
1290 if (SvIV_please_nomg(svr)) {
1291 /* Unless the left argument is integer in range we are going to have to
1292 use NV maths. Hence only attempt to coerce the right argument if
1293 we know the left is integer. */
1294 /* Left operand is defined, so is it IV? */
1295 if (SvIV_please_nomg(svl)) {
1296 bool auvok = SvUOK(svl);
1297 bool buvok = SvUOK(svr);
1298 const UV topmask = (~ (UV)0) << (4 * sizeof (UV));
1299 const UV botmask = ~((~ (UV)0) << (4 * sizeof (UV)));
1308 const IV aiv = SvIVX(svl);
1311 auvok = TRUE; /* effectively it's a UV now */
1313 /* abs, auvok == false records sign; Using 0- here and
1314 * later to silence bogus warning from MS VC */
1315 alow = (UV) (0 - (UV) aiv);
1321 const IV biv = SvIVX(svr);
1324 buvok = TRUE; /* effectively it's a UV now */
1326 /* abs, buvok == false records sign */
1327 blow = (UV) (0 - (UV) biv);
1331 /* If this does sign extension on unsigned it's time for plan B */
1332 ahigh = alow >> (4 * sizeof (UV));
1334 bhigh = blow >> (4 * sizeof (UV));
1336 if (ahigh && bhigh) {
1338 /* eg 32 bit is at least 0x10000 * 0x10000 == 0x100000000
1339 which is overflow. Drop to NVs below. */
1340 } else if (!ahigh && !bhigh) {
1341 /* eg 32 bit is at most 0xFFFF * 0xFFFF == 0xFFFE0001
1342 so the unsigned multiply cannot overflow. */
1343 const UV product = alow * blow;
1344 if (auvok == buvok) {
1345 /* -ve * -ve or +ve * +ve gives a +ve result. */
1349 } else if (product <= (UV)IV_MIN) {
1350 /* 2s complement assumption that (UV)-IV_MIN is correct. */
1351 /* -ve result, which could overflow an IV */
1353 /* can't negate IV_MIN, but there are aren't two
1354 * integers such that !ahigh && !bhigh, where the
1355 * product equals 0x800....000 */
1356 assert(product != (UV)IV_MIN);
1357 SETi( -(IV)product );
1359 } /* else drop to NVs below. */
1361 /* One operand is large, 1 small */
1364 /* swap the operands */
1366 bhigh = blow; /* bhigh now the temp var for the swap */
1370 /* now, ((ahigh * blow) << half_UV_len) + (alow * blow)
1371 multiplies can't overflow. shift can, add can, -ve can. */
1372 product_middle = ahigh * blow;
1373 if (!(product_middle & topmask)) {
1374 /* OK, (ahigh * blow) won't lose bits when we shift it. */
1376 product_middle <<= (4 * sizeof (UV));
1377 product_low = alow * blow;
1379 /* as for pp_add, UV + something mustn't get smaller.
1380 IIRC ANSI mandates this wrapping *behaviour* for
1381 unsigned whatever the actual representation*/
1382 product_low += product_middle;
1383 if (product_low >= product_middle) {
1384 /* didn't overflow */
1385 if (auvok == buvok) {
1386 /* -ve * -ve or +ve * +ve gives a +ve result. */
1388 SETu( product_low );
1390 } else if (product_low <= (UV)IV_MIN) {
1391 /* 2s complement assumption again */
1392 /* -ve result, which could overflow an IV */
1394 SETi(product_low == (UV)IV_MIN
1395 ? IV_MIN : -(IV)product_low);
1397 } /* else drop to NVs below. */
1399 } /* product_middle too large */
1400 } /* ahigh && bhigh */
1405 NV right = SvNV_nomg(svr);
1406 NV left = SvNV_nomg(svl);
1407 NV result = left * right;
1410 #if defined(__sgi) && defined(USE_LONG_DOUBLE) && LONG_DOUBLEKIND == LONG_DOUBLE_IS_DOUBLEDOUBLE_128_BIT_BE_BE && NVSIZE == 16
1411 if (Perl_isinf(result)) {
1412 Zero((U8*)&result + 8, 8, U8);
1422 dSP; dATARGET; SV *svl, *svr;
1423 tryAMAGICbin_MG(div_amg, AMGf_assign|AMGf_numeric);
1426 /* Only try to do UV divide first
1427 if ((SLOPPYDIVIDE is true) or
1428 (PERL_PRESERVE_IVUV is true and one or both SV is a UV too large
1430 The assumption is that it is better to use floating point divide
1431 whenever possible, only doing integer divide first if we can't be sure.
1432 If NV_PRESERVES_UV is true then we know at compile time that no UV
1433 can be too large to preserve, so don't need to compile the code to
1434 test the size of UVs. */
1436 #if defined(SLOPPYDIVIDE) || (defined(PERL_PRESERVE_IVUV) && !defined(NV_PRESERVES_UV))
1437 # define PERL_TRY_UV_DIVIDE
1438 /* ensure that 20./5. == 4. */
1441 #ifdef PERL_TRY_UV_DIVIDE
1442 if (SvIV_please_nomg(svr) && SvIV_please_nomg(svl)) {
1443 bool left_non_neg = SvUOK(svl);
1444 bool right_non_neg = SvUOK(svr);
1448 if (right_non_neg) {
1452 const IV biv = SvIVX(svr);
1455 right_non_neg = TRUE; /* effectively it's a UV now */
1461 /* historically undef()/0 gives a "Use of uninitialized value"
1462 warning before dieing, hence this test goes here.
1463 If it were immediately before the second SvIV_please, then
1464 DIE() would be invoked before left was even inspected, so
1465 no inspection would give no warning. */
1467 DIE(aTHX_ "Illegal division by zero");
1473 const IV aiv = SvIVX(svl);
1476 left_non_neg = TRUE; /* effectively it's a UV now */
1485 /* For sloppy divide we always attempt integer division. */
1487 /* Otherwise we only attempt it if either or both operands
1488 would not be preserved by an NV. If both fit in NVs
1489 we fall through to the NV divide code below. However,
1490 as left >= right to ensure integer result here, we know that
1491 we can skip the test on the right operand - right big
1492 enough not to be preserved can't get here unless left is
1495 && (left > ((UV)1 << NV_PRESERVES_UV_BITS))
1498 /* Integer division can't overflow, but it can be imprecise. */
1500 /* Modern compilers optimize division followed by
1501 * modulo into a single div instruction */
1502 const UV result = left / right;
1503 if (left % right == 0) {
1504 SP--; /* result is valid */
1505 if (left_non_neg == right_non_neg) {
1506 /* signs identical, result is positive. */
1510 /* 2s complement assumption */
1511 if (result <= (UV)IV_MIN)
1512 SETi(result == (UV)IV_MIN ? IV_MIN : -(IV)result);
1514 /* It's exact but too negative for IV. */
1515 SETn( -(NV)result );
1518 } /* tried integer divide but it was not an integer result */
1519 } /* else (PERL_ABS(result) < 1.0) or (both UVs in range for NV) */
1520 } /* one operand wasn't SvIOK */
1521 #endif /* PERL_TRY_UV_DIVIDE */
1523 NV right = SvNV_nomg(svr);
1524 NV left = SvNV_nomg(svl);
1525 (void)POPs;(void)POPs;
1526 #if defined(NAN_COMPARE_BROKEN) && defined(Perl_isnan)
1527 if (! Perl_isnan(right) && right == 0.0)
1531 DIE(aTHX_ "Illegal division by zero");
1532 PUSHn( left / right );
1540 tryAMAGICbin_MG(modulo_amg, AMGf_assign|AMGf_numeric);
1544 bool left_neg = FALSE;
1545 bool right_neg = FALSE;
1546 bool use_double = FALSE;
1547 bool dright_valid = FALSE;
1550 SV * const svr = TOPs;
1551 SV * const svl = TOPm1s;
1552 if (SvIV_please_nomg(svr)) {
1553 right_neg = !SvUOK(svr);
1557 const IV biv = SvIVX(svr);
1560 right_neg = FALSE; /* effectively it's a UV now */
1562 right = (UV) (0 - (UV) biv);
1567 dright = SvNV_nomg(svr);
1568 right_neg = dright < 0;
1571 if (dright < UV_MAX_P1) {
1572 right = U_V(dright);
1573 dright_valid = TRUE; /* In case we need to use double below. */
1579 /* At this point use_double is only true if right is out of range for
1580 a UV. In range NV has been rounded down to nearest UV and
1581 use_double false. */
1582 if (!use_double && SvIV_please_nomg(svl)) {
1583 left_neg = !SvUOK(svl);
1587 const IV aiv = SvIVX(svl);
1590 left_neg = FALSE; /* effectively it's a UV now */
1592 left = (UV) (0 - (UV) aiv);
1597 dleft = SvNV_nomg(svl);
1598 left_neg = dleft < 0;
1602 /* This should be exactly the 5.6 behaviour - if left and right are
1603 both in range for UV then use U_V() rather than floor. */
1605 if (dleft < UV_MAX_P1) {
1606 /* right was in range, so is dleft, so use UVs not double.
1610 /* left is out of range for UV, right was in range, so promote
1611 right (back) to double. */
1613 /* The +0.5 is used in 5.6 even though it is not strictly
1614 consistent with the implicit +0 floor in the U_V()
1615 inside the #if 1. */
1616 dleft = Perl_floor(dleft + 0.5);
1619 dright = Perl_floor(dright + 0.5);
1630 DIE(aTHX_ "Illegal modulus zero");
1632 dans = Perl_fmod(dleft, dright);
1633 if ((left_neg != right_neg) && dans)
1634 dans = dright - dans;
1637 sv_setnv(TARG, dans);
1643 DIE(aTHX_ "Illegal modulus zero");
1646 if ((left_neg != right_neg) && ans)
1649 /* XXX may warn: unary minus operator applied to unsigned type */
1650 /* could change -foo to be (~foo)+1 instead */
1651 if (ans <= ~((UV)IV_MAX)+1)
1652 sv_setiv(TARG, ~ans+1);
1654 sv_setnv(TARG, -(NV)ans);
1657 sv_setuv(TARG, ans);
1669 bool infnan = FALSE;
1670 const U8 gimme = GIMME_V;
1672 if (gimme == G_ARRAY && PL_op->op_private & OPpREPEAT_DOLIST) {
1673 /* TODO: think of some way of doing list-repeat overloading ??? */
1678 if (UNLIKELY(PL_op->op_private & OPpREPEAT_DOLIST)) {
1679 /* The parser saw this as a list repeat, and there
1680 are probably several items on the stack. But we're
1681 in scalar/void context, and there's no pp_list to save us
1682 now. So drop the rest of the items -- robin@kitsite.com
1685 if (MARK + 1 < SP) {
1691 ASSUME(MARK + 1 == SP);
1694 MARK[1] = &PL_sv_undef;
1698 tryAMAGICbin_MG(repeat_amg, AMGf_assign);
1704 const UV uv = SvUV_nomg(sv);
1706 count = IV_MAX; /* The best we can do? */
1710 count = SvIV_nomg(sv);
1713 else if (SvNOKp(sv)) {
1714 const NV nv = SvNV_nomg(sv);
1715 infnan = Perl_isinfnan(nv);
1716 if (UNLIKELY(infnan)) {
1720 count = -1; /* An arbitrary negative integer */
1726 count = SvIV_nomg(sv);
1729 Perl_ck_warner(aTHX_ packWARN(WARN_NUMERIC),
1730 "Non-finite repeat count does nothing");
1731 } else if (count < 0) {
1733 Perl_ck_warner(aTHX_ packWARN(WARN_NUMERIC),
1734 "Negative repeat count does nothing");
1737 if (gimme == G_ARRAY && PL_op->op_private & OPpREPEAT_DOLIST) {
1739 const SSize_t items = SP - MARK;
1740 const U8 mod = PL_op->op_flags & OPf_MOD;
1745 if ( items > SSize_t_MAX / count /* max would overflow */
1746 /* repeatcpy would overflow */
1747 || items > I32_MAX / (I32)sizeof(SV *)
1749 Perl_croak(aTHX_ "%s","Out of memory during list extend");
1750 max = items * count;
1755 if (mod && SvPADTMP(*SP)) {
1756 *SP = sv_mortalcopy(*SP);
1763 repeatcpy((char*)(MARK + items), (char*)MARK,
1764 items * sizeof(const SV *), count - 1);
1767 else if (count <= 0)
1770 else { /* Note: mark already snarfed by pp_list */
1771 SV * const tmpstr = POPs;
1776 sv_setsv_nomg(TARG, tmpstr);
1777 SvPV_force_nomg(TARG, len);
1778 isutf = DO_UTF8(TARG);
1785 if ( len > (MEM_SIZE_MAX-1) / (UV)count /* max would overflow */
1786 || len > (U32)I32_MAX /* repeatcpy would overflow */
1788 Perl_croak(aTHX_ "%s",
1789 "Out of memory during string extend");
1790 max = (UV)count * len + 1;
1793 repeatcpy(SvPVX(TARG) + len, SvPVX(TARG), len, count - 1);
1794 SvCUR_set(TARG, SvCUR(TARG) * count);
1796 *SvEND(TARG) = '\0';
1799 (void)SvPOK_only_UTF8(TARG);
1801 (void)SvPOK_only(TARG);
1810 dSP; dATARGET; bool useleft; SV *svl, *svr;
1811 tryAMAGICbin_MG(subtr_amg, AMGf_assign|AMGf_numeric);
1815 #ifdef PERL_PRESERVE_IVUV
1817 /* special-case some simple common cases */
1818 if (!((svl->sv_flags|svr->sv_flags) & (SVf_IVisUV|SVs_GMG))) {
1820 U32 flags = (svl->sv_flags & svr->sv_flags);
1821 if (flags & SVf_IOK) {
1822 /* both args are simple IVs */
1827 topl = ((UV)il) >> (UVSIZE * 8 - 2);
1828 topr = ((UV)ir) >> (UVSIZE * 8 - 2);
1830 /* if both are in a range that can't under/overflow, do a
1831 * simple integer subtract: if the top of both numbers
1832 * are 00 or 11, then it's safe */
1833 if (!( ((topl+1) | (topr+1)) & 2)) {
1835 TARGi(il - ir, 0); /* args not GMG, so can't be tainted */
1841 else if (flags & SVf_NOK) {
1842 /* both args are NVs */
1846 if (lossless_NV_to_IV(nl, &il) && lossless_NV_to_IV(nr, &ir)) {
1847 /* nothing was lost by converting to IVs */
1851 TARGn(nl - nr, 0); /* args not GMG, so can't be tainted */
1859 useleft = USE_LEFT(svl);
1860 /* See comments in pp_add (in pp_hot.c) about Overflow, and how
1861 "bad things" happen if you rely on signed integers wrapping. */
1862 if (SvIV_please_nomg(svr)) {
1863 /* Unless the left argument is integer in range we are going to have to
1864 use NV maths. Hence only attempt to coerce the right argument if
1865 we know the left is integer. */
1872 a_valid = auvok = 1;
1873 /* left operand is undef, treat as zero. */
1875 /* Left operand is defined, so is it IV? */
1876 if (SvIV_please_nomg(svl)) {
1877 if ((auvok = SvUOK(svl)))
1880 const IV aiv = SvIVX(svl);
1883 auvok = 1; /* Now acting as a sign flag. */
1885 auv = (UV) (0 - (UV) aiv);
1892 bool result_good = 0;
1895 bool buvok = SvUOK(svr);
1900 const IV biv = SvIVX(svr);
1905 buv = (UV) (0 - (UV) biv);
1907 /* ?uvok if value is >= 0. basically, flagged as UV if it's +ve,
1908 else "IV" now, independent of how it came in.
1909 if a, b represents positive, A, B negative, a maps to -A etc
1914 all UV maths. negate result if A negative.
1915 subtract if signs same, add if signs differ. */
1917 if (auvok ^ buvok) {
1926 /* Must get smaller */
1931 if (result <= buv) {
1932 /* result really should be -(auv-buv). as its negation
1933 of true value, need to swap our result flag */
1945 if (result <= (UV)IV_MIN)
1946 SETi(result == (UV)IV_MIN
1947 ? IV_MIN : -(IV)result);
1949 /* result valid, but out of range for IV. */
1950 SETn( -(NV)result );
1954 } /* Overflow, drop through to NVs. */
1958 useleft = USE_LEFT(svl);
1961 NV value = SvNV_nomg(svr);
1965 /* left operand is undef, treat as zero - value */
1969 SETn( SvNV_nomg(svl) - value );
1974 #define IV_BITS (IVSIZE * 8)
1976 static UV S_uv_shift(UV uv, int shift, bool left)
1982 if (UNLIKELY(shift >= IV_BITS)) {
1985 return left ? uv << shift : uv >> shift;
1988 static IV S_iv_shift(IV iv, int shift, bool left)
1995 if (UNLIKELY(shift >= IV_BITS)) {
1996 return iv < 0 && !left ? -1 : 0;
1999 /* For left shifts, perl 5 has chosen to treat the value as unsigned for
2000 * the * purposes of shifting, then cast back to signed. This is very
2001 * different from Raku:
2003 * $ raku -e 'say -2 +< 5'
2006 * $ ./perl -le 'print -2 << 5'
2007 * 18446744073709551552
2010 if (iv == IV_MIN) { /* Casting this to a UV is undefined behavior */
2013 return (IV) (((UV) iv) << shift);
2016 /* Here is right shift */
2020 #define UV_LEFT_SHIFT(uv, shift) S_uv_shift(uv, shift, TRUE)
2021 #define UV_RIGHT_SHIFT(uv, shift) S_uv_shift(uv, shift, FALSE)
2022 #define IV_LEFT_SHIFT(iv, shift) S_iv_shift(iv, shift, TRUE)
2023 #define IV_RIGHT_SHIFT(iv, shift) S_iv_shift(iv, shift, FALSE)
2027 dSP; dATARGET; SV *svl, *svr;
2028 tryAMAGICbin_MG(lshift_amg, AMGf_assign|AMGf_numeric);
2032 const IV shift = SvIV_nomg(svr);
2033 if (PL_op->op_private & HINT_INTEGER) {
2034 SETi(IV_LEFT_SHIFT(SvIV_nomg(svl), shift));
2037 SETu(UV_LEFT_SHIFT(SvUV_nomg(svl), shift));
2045 dSP; dATARGET; SV *svl, *svr;
2046 tryAMAGICbin_MG(rshift_amg, AMGf_assign|AMGf_numeric);
2050 const IV shift = SvIV_nomg(svr);
2051 if (PL_op->op_private & HINT_INTEGER) {
2052 SETi(IV_RIGHT_SHIFT(SvIV_nomg(svl), shift));
2055 SETu(UV_RIGHT_SHIFT(SvUV_nomg(svl), shift));
2065 U32 flags_and, flags_or;
2067 tryAMAGICbin_MG(lt_amg, AMGf_numeric);
2070 flags_and = SvFLAGS(left) & SvFLAGS(right);
2071 flags_or = SvFLAGS(left) | SvFLAGS(right);
2074 ( (flags_and & SVf_IOK) && ((flags_or & SVf_IVisUV) ==0 ) )
2075 ? (SvIVX(left) < SvIVX(right))
2076 : (flags_and & SVf_NOK)
2077 ? (SvNVX(left) < SvNVX(right))
2078 : (do_ncmp(left, right) == -1)
2087 U32 flags_and, flags_or;
2089 tryAMAGICbin_MG(gt_amg, AMGf_numeric);
2092 flags_and = SvFLAGS(left) & SvFLAGS(right);
2093 flags_or = SvFLAGS(left) | SvFLAGS(right);
2096 ( (flags_and & SVf_IOK) && ((flags_or & SVf_IVisUV) ==0 ) )
2097 ? (SvIVX(left) > SvIVX(right))
2098 : (flags_and & SVf_NOK)
2099 ? (SvNVX(left) > SvNVX(right))
2100 : (do_ncmp(left, right) == 1)
2109 U32 flags_and, flags_or;
2111 tryAMAGICbin_MG(le_amg, AMGf_numeric);
2114 flags_and = SvFLAGS(left) & SvFLAGS(right);
2115 flags_or = SvFLAGS(left) | SvFLAGS(right);
2118 ( (flags_and & SVf_IOK) && ((flags_or & SVf_IVisUV) ==0 ) )
2119 ? (SvIVX(left) <= SvIVX(right))
2120 : (flags_and & SVf_NOK)
2121 ? (SvNVX(left) <= SvNVX(right))
2122 : (do_ncmp(left, right) <= 0)
2131 U32 flags_and, flags_or;
2133 tryAMAGICbin_MG(ge_amg, AMGf_numeric);
2136 flags_and = SvFLAGS(left) & SvFLAGS(right);
2137 flags_or = SvFLAGS(left) | SvFLAGS(right);
2140 ( (flags_and & SVf_IOK) && ((flags_or & SVf_IVisUV) ==0 ) )
2141 ? (SvIVX(left) >= SvIVX(right))
2142 : (flags_and & SVf_NOK)
2143 ? (SvNVX(left) >= SvNVX(right))
2144 : ( (do_ncmp(left, right) & 2) == 0)
2153 U32 flags_and, flags_or;
2155 tryAMAGICbin_MG(ne_amg, AMGf_numeric);
2158 flags_and = SvFLAGS(left) & SvFLAGS(right);
2159 flags_or = SvFLAGS(left) | SvFLAGS(right);
2162 ( (flags_and & SVf_IOK) && ((flags_or & SVf_IVisUV) ==0 ) )
2163 ? (SvIVX(left) != SvIVX(right))
2164 : (flags_and & SVf_NOK)
2165 ? (SvNVX(left) != SvNVX(right))
2166 : (do_ncmp(left, right) != 0)
2171 /* compare left and right SVs. Returns:
2175 * 2: left or right was a NaN
2178 Perl_do_ncmp(pTHX_ SV* const left, SV * const right)
2180 PERL_ARGS_ASSERT_DO_NCMP;
2181 #ifdef PERL_PRESERVE_IVUV
2182 /* Fortunately it seems NaN isn't IOK */
2183 if (SvIV_please_nomg(right) && SvIV_please_nomg(left)) {
2185 const IV leftiv = SvIVX(left);
2186 if (!SvUOK(right)) {
2187 /* ## IV <=> IV ## */
2188 const IV rightiv = SvIVX(right);
2189 return (leftiv > rightiv) - (leftiv < rightiv);
2191 /* ## IV <=> UV ## */
2193 /* As (b) is a UV, it's >=0, so it must be < */
2196 const UV rightuv = SvUVX(right);
2197 return ((UV)leftiv > rightuv) - ((UV)leftiv < rightuv);
2202 /* ## UV <=> UV ## */
2203 const UV leftuv = SvUVX(left);
2204 const UV rightuv = SvUVX(right);
2205 return (leftuv > rightuv) - (leftuv < rightuv);
2207 /* ## UV <=> IV ## */
2209 const IV rightiv = SvIVX(right);
2211 /* As (a) is a UV, it's >=0, so it cannot be < */
2214 const UV leftuv = SvUVX(left);
2215 return (leftuv > (UV)rightiv) - (leftuv < (UV)rightiv);
2218 NOT_REACHED; /* NOTREACHED */
2222 NV const rnv = SvNV_nomg(right);
2223 NV const lnv = SvNV_nomg(left);
2225 #if defined(NAN_COMPARE_BROKEN) && defined(Perl_isnan)
2226 if (Perl_isnan(lnv) || Perl_isnan(rnv)) {
2229 return (lnv > rnv) - (lnv < rnv);
2248 tryAMAGICbin_MG(ncmp_amg, AMGf_numeric);
2251 value = do_ncmp(left, right);
2263 /* also used for: pp_sge() pp_sgt() pp_slt() */
2269 int amg_type = sle_amg;
2273 switch (PL_op->op_type) {
2292 tryAMAGICbin_MG(amg_type, 0);
2296 #ifdef USE_LOCALE_COLLATE
2297 (IN_LC_RUNTIME(LC_COLLATE))
2298 ? sv_cmp_locale_flags(left, right, 0)
2301 sv_cmp_flags(left, right, 0);
2302 SETs(boolSV(cmp * multiplier < rhs));
2310 tryAMAGICbin_MG(seq_amg, 0);
2313 SETs(boolSV(sv_eq_flags(left, right, 0)));
2321 tryAMAGICbin_MG(sne_amg, 0);
2324 SETs(boolSV(!sv_eq_flags(left, right, 0)));
2332 tryAMAGICbin_MG(scmp_amg, 0);
2336 #ifdef USE_LOCALE_COLLATE
2337 (IN_LC_RUNTIME(LC_COLLATE))
2338 ? sv_cmp_locale_flags(left, right, 0)
2341 sv_cmp_flags(left, right, 0);
2350 tryAMAGICbin_MG(band_amg, AMGf_assign);
2353 if (SvNIOKp(left) || SvNIOKp(right)) {
2354 const bool left_ro_nonnum = !SvNIOKp(left) && SvREADONLY(left);
2355 const bool right_ro_nonnum = !SvNIOKp(right) && SvREADONLY(right);
2356 if (PL_op->op_private & HINT_INTEGER) {
2357 const IV i = SvIV_nomg(left) & SvIV_nomg(right);
2361 const UV u = SvUV_nomg(left) & SvUV_nomg(right);
2364 if (left_ro_nonnum && left != TARG) SvNIOK_off(left);
2365 if (right_ro_nonnum) SvNIOK_off(right);
2368 do_vop(PL_op->op_type, TARG, left, right);
2378 tryAMAGICbin_MG(band_amg, AMGf_assign|AMGf_numarg);
2380 dATARGET; dPOPTOPssrl;
2381 if (PL_op->op_private & HINT_INTEGER) {
2382 const IV i = SvIV_nomg(left) & SvIV_nomg(right);
2386 const UV u = SvUV_nomg(left) & SvUV_nomg(right);
2396 tryAMAGICbin_MG(sband_amg, AMGf_assign);
2398 dATARGET; dPOPTOPssrl;
2399 do_vop(OP_BIT_AND, TARG, left, right);
2404 /* also used for: pp_bit_xor() */
2409 const int op_type = PL_op->op_type;
2411 tryAMAGICbin_MG((op_type == OP_BIT_OR ? bor_amg : bxor_amg), AMGf_assign);
2414 if (SvNIOKp(left) || SvNIOKp(right)) {
2415 const bool left_ro_nonnum = !SvNIOKp(left) && SvREADONLY(left);
2416 const bool right_ro_nonnum = !SvNIOKp(right) && SvREADONLY(right);
2417 if (PL_op->op_private & HINT_INTEGER) {
2418 const IV l = (USE_LEFT(left) ? SvIV_nomg(left) : 0);
2419 const IV r = SvIV_nomg(right);
2420 const IV result = op_type == OP_BIT_OR ? (l | r) : (l ^ r);
2424 const UV l = (USE_LEFT(left) ? SvUV_nomg(left) : 0);
2425 const UV r = SvUV_nomg(right);
2426 const UV result = op_type == OP_BIT_OR ? (l | r) : (l ^ r);
2429 if (left_ro_nonnum && left != TARG) SvNIOK_off(left);
2430 if (right_ro_nonnum) SvNIOK_off(right);
2433 do_vop(op_type, TARG, left, right);
2440 /* also used for: pp_nbit_xor() */
2445 const int op_type = PL_op->op_type;
2447 tryAMAGICbin_MG((op_type == OP_NBIT_OR ? bor_amg : bxor_amg),
2448 AMGf_assign|AMGf_numarg);
2450 dATARGET; dPOPTOPssrl;
2451 if (PL_op->op_private & HINT_INTEGER) {
2452 const IV l = (USE_LEFT(left) ? SvIV_nomg(left) : 0);
2453 const IV r = SvIV_nomg(right);
2454 const IV result = op_type == OP_NBIT_OR ? (l | r) : (l ^ r);
2458 const UV l = (USE_LEFT(left) ? SvUV_nomg(left) : 0);
2459 const UV r = SvUV_nomg(right);
2460 const UV result = op_type == OP_NBIT_OR ? (l | r) : (l ^ r);
2467 /* also used for: pp_sbit_xor() */
2472 const int op_type = PL_op->op_type;
2474 tryAMAGICbin_MG((op_type == OP_SBIT_OR ? sbor_amg : sbxor_amg),
2477 dATARGET; dPOPTOPssrl;
2478 do_vop(op_type == OP_SBIT_OR ? OP_BIT_OR : OP_BIT_XOR, TARG, left,
2484 PERL_STATIC_INLINE bool
2485 S_negate_string(pTHX)
2490 SV * const sv = TOPs;
2491 if (!SvPOKp(sv) || SvNIOK(sv) || (!SvPOK(sv) && SvNIOKp(sv)))
2493 s = SvPV_nomg_const(sv, len);
2494 if (isIDFIRST(*s)) {
2495 sv_setpvs(TARG, "-");
2498 else if (*s == '+' || (*s == '-' && !looks_like_number(sv))) {
2499 sv_setsv_nomg(TARG, sv);
2500 *SvPV_force_nomg(TARG, len) = *s == '-' ? '+' : '-';
2510 tryAMAGICun_MG(neg_amg, AMGf_numeric);
2511 if (S_negate_string(aTHX)) return NORMAL;
2513 SV * const sv = TOPs;
2516 /* It's publicly an integer */
2519 if (SvIVX(sv) == IV_MIN) {
2520 /* 2s complement assumption. */
2521 SETi(SvIVX(sv)); /* special case: -((UV)IV_MAX+1) ==
2525 else if (SvUVX(sv) <= IV_MAX) {
2530 else if (SvIVX(sv) != IV_MIN) {
2534 #ifdef PERL_PRESERVE_IVUV
2541 if (SvNIOKp(sv) && (SvNIOK(sv) || !SvPOK(sv)))
2542 SETn(-SvNV_nomg(sv));
2543 else if (SvPOKp(sv) && SvIV_please_nomg(sv))
2544 goto oops_its_an_int;
2546 SETn(-SvNV_nomg(sv));
2556 tryAMAGICun_MG(not_amg, 0);
2558 *PL_stack_sp = boolSV(!SvTRUE_nomg_NN(sv));
2563 S_scomplement(pTHX_ SV *targ, SV *sv)
2569 sv_copypv_nomg(TARG, sv);
2570 tmps = (U8*)SvPV_nomg(TARG, len);
2573 if (len && ! utf8_to_bytes(tmps, &len)) {
2574 Perl_croak(aTHX_ FATAL_ABOVE_FF_MSG, PL_op_desc[PL_op->op_type]);
2576 SvCUR_set(TARG, len);
2584 for ( ; anum && PTR2nat(tmps) % sizeof(long); anum--, tmps++)
2587 for ( ; anum >= (I32)sizeof(long); anum -= (I32)sizeof(long), tmpl++)
2592 for ( ; anum > 0; anum--, tmps++)
2599 tryAMAGICun_MG(compl_amg, AMGf_numeric);
2603 if (PL_op->op_private & HINT_INTEGER) {
2604 const IV i = ~SvIV_nomg(sv);
2608 const UV u = ~SvUV_nomg(sv);
2613 S_scomplement(aTHX_ TARG, sv);
2623 tryAMAGICun_MG(compl_amg, AMGf_numeric|AMGf_numarg);
2626 if (PL_op->op_private & HINT_INTEGER) {
2627 const IV i = ~SvIV_nomg(sv);
2631 const UV u = ~SvUV_nomg(sv);
2641 tryAMAGICun_MG(scompl_amg, AMGf_numeric);
2644 S_scomplement(aTHX_ TARG, sv);
2650 /* integer versions of some of the above */
2655 tryAMAGICbin_MG(mult_amg, AMGf_assign);
2658 SETi( left * right );
2667 tryAMAGICbin_MG(div_amg, AMGf_assign);
2670 IV value = SvIV_nomg(right);
2672 DIE(aTHX_ "Illegal division by zero");
2673 num = SvIV_nomg(left);
2675 /* avoid FPE_INTOVF on some platforms when num is IV_MIN */
2679 value = num / value;
2688 tryAMAGICbin_MG(modulo_amg, AMGf_assign);
2692 DIE(aTHX_ "Illegal modulus zero");
2693 /* avoid FPE_INTOVF on some platforms when left is IV_MIN */
2697 SETi( left % right );
2705 tryAMAGICbin_MG(add_amg, AMGf_assign);
2707 dPOPTOPiirl_ul_nomg;
2708 SETi( left + right );
2716 tryAMAGICbin_MG(subtr_amg, AMGf_assign);
2718 dPOPTOPiirl_ul_nomg;
2719 SETi( left - right );
2727 tryAMAGICbin_MG(lt_amg, 0);
2730 SETs(boolSV(left < right));
2738 tryAMAGICbin_MG(gt_amg, 0);
2741 SETs(boolSV(left > right));
2749 tryAMAGICbin_MG(le_amg, 0);
2752 SETs(boolSV(left <= right));
2760 tryAMAGICbin_MG(ge_amg, 0);
2763 SETs(boolSV(left >= right));
2771 tryAMAGICbin_MG(eq_amg, 0);
2774 SETs(boolSV(left == right));
2782 tryAMAGICbin_MG(ne_amg, 0);
2785 SETs(boolSV(left != right));
2793 tryAMAGICbin_MG(ncmp_amg, 0);
2800 else if (left < right)
2812 tryAMAGICun_MG(neg_amg, 0);
2813 if (S_negate_string(aTHX)) return NORMAL;
2815 SV * const sv = TOPs;
2816 IV const i = SvIV_nomg(sv);
2822 /* High falutin' math. */
2827 tryAMAGICbin_MG(atan2_amg, 0);
2830 SETn(Perl_atan2(left, right));
2836 /* also used for: pp_cos() pp_exp() pp_log() pp_sqrt() */
2841 int amg_type = fallback_amg;
2842 const char *neg_report = NULL;
2843 const int op_type = PL_op->op_type;
2846 case OP_SIN: amg_type = sin_amg; break;
2847 case OP_COS: amg_type = cos_amg; break;
2848 case OP_EXP: amg_type = exp_amg; break;
2849 case OP_LOG: amg_type = log_amg; neg_report = "log"; break;
2850 case OP_SQRT: amg_type = sqrt_amg; neg_report = "sqrt"; break;
2853 assert(amg_type != fallback_amg);
2855 tryAMAGICun_MG(amg_type, 0);
2857 SV * const arg = TOPs;
2858 const NV value = SvNV_nomg(arg);
2864 if (neg_report) { /* log or sqrt */
2866 #if defined(NAN_COMPARE_BROKEN) && defined(Perl_isnan)
2867 ! Perl_isnan(value) &&
2869 (op_type == OP_LOG ? (value <= 0.0) : (value < 0.0))) {
2870 SET_NUMERIC_STANDARD();
2871 /* diag_listed_as: Can't take log of %g */
2872 DIE(aTHX_ "Can't take %s of %" NVgf, neg_report, value);
2877 case OP_SIN: result = Perl_sin(value); break;
2878 case OP_COS: result = Perl_cos(value); break;
2879 case OP_EXP: result = Perl_exp(value); break;
2880 case OP_LOG: result = Perl_log(value); break;
2881 case OP_SQRT: result = Perl_sqrt(value); break;
2888 /* Support Configure command-line overrides for rand() functions.
2889 After 5.005, perhaps we should replace this by Configure support
2890 for drand48(), random(), or rand(). For 5.005, though, maintain
2891 compatibility by calling rand() but allow the user to override it.
2892 See INSTALL for details. --Andy Dougherty 15 July 1998
2894 /* Now it's after 5.005, and Configure supports drand48() and random(),
2895 in addition to rand(). So the overrides should not be needed any more.
2896 --Jarkko Hietaniemi 27 September 1998
2901 if (!PL_srand_called) {
2902 (void)seedDrand01((Rand_seed_t)seed());
2903 PL_srand_called = TRUE;
2915 SV * const sv = POPs;
2921 /* 1 of 2 things can be carried through SvNV, SP or TARG, SP was carried */
2922 #if defined(NAN_COMPARE_BROKEN) && defined(Perl_isnan)
2923 if (! Perl_isnan(value) && value == 0.0)
2933 sv_setnv_mg(TARG, value);
2944 if (MAXARG >= 1 && (TOPs || POPs)) {
2951 pv = SvPV(top, len);
2952 flags = grok_number(pv, len, &anum);
2954 if (!(flags & IS_NUMBER_IN_UV)) {
2955 Perl_ck_warner_d(aTHX_ packWARN(WARN_OVERFLOW),
2956 "Integer overflow in srand");
2964 (void)seedDrand01((Rand_seed_t)anum);
2965 PL_srand_called = TRUE;
2969 /* Historically srand always returned true. We can avoid breaking
2971 sv_setpvs(TARG, "0 but true");
2980 tryAMAGICun_MG(int_amg, AMGf_numeric);
2982 SV * const sv = TOPs;
2983 const IV iv = SvIV_nomg(sv);
2984 /* XXX it's arguable that compiler casting to IV might be subtly
2985 different from modf (for numbers inside (IV_MIN,UV_MAX)) in which
2986 else preferring IV has introduced a subtle behaviour change bug. OTOH
2987 relying on floating point to be accurate is a bug. */
2992 else if (SvIOK(sv)) {
2994 SETu(SvUV_nomg(sv));
2999 const NV value = SvNV_nomg(sv);
3000 if (UNLIKELY(Perl_isinfnan(value)))
3002 else if (value >= 0.0) {
3003 if (value < (NV)UV_MAX + 0.5) {
3006 SETn(Perl_floor(value));
3010 if (value > (NV)IV_MIN - 0.5) {
3013 SETn(Perl_ceil(value));
3024 tryAMAGICun_MG(abs_amg, AMGf_numeric);
3026 SV * const sv = TOPs;
3027 /* This will cache the NV value if string isn't actually integer */
3028 const IV iv = SvIV_nomg(sv);
3033 else if (SvIOK(sv)) {
3034 /* IVX is precise */
3036 SETu(SvUV_nomg(sv)); /* force it to be numeric only */
3044 /* 2s complement assumption. Also, not really needed as
3045 IV_MIN and -IV_MIN should both be %100...00 and NV-able */
3051 const NV value = SvNV_nomg(sv);
3062 /* also used for: pp_hex() */
3068 I32 flags = PERL_SCAN_ALLOW_UNDERSCORES;
3072 SV* const sv = TOPs;
3074 tmps = (SvPV_const(sv, len));
3076 /* If Unicode, try to downgrade
3077 * If not possible, croak. */
3078 SV* const tsv = sv_2mortal(newSVsv(sv));
3081 sv_utf8_downgrade(tsv, FALSE);
3082 tmps = SvPV_const(tsv, len);
3084 if (PL_op->op_type == OP_HEX)
3087 while (*tmps && len && isSPACE(*tmps))
3091 if (isALPHA_FOLD_EQ(*tmps, 'x')) {
3093 flags |= PERL_SCAN_DISALLOW_PREFIX;
3095 result_uv = grok_hex (tmps, &len, &flags, &result_nv);
3097 else if (isALPHA_FOLD_EQ(*tmps, 'b')) {
3099 flags |= PERL_SCAN_DISALLOW_PREFIX;
3100 result_uv = grok_bin (tmps, &len, &flags, &result_nv);
3103 result_uv = grok_oct (tmps, &len, &flags, &result_nv);
3105 if (flags & PERL_SCAN_GREATER_THAN_UV_MAX) {
3120 SV * const sv = TOPs;
3122 U32 in_bytes = IN_BYTES;
3123 /* Simplest case shortcut:
3124 * set svflags to just the SVf_POK|SVs_GMG|SVf_UTF8 from the SV,
3125 * with the SVf_UTF8 flag inverted if under 'use bytes' (HINT_BYTES
3128 U32 svflags = (SvFLAGS(sv) ^ (in_bytes << 26)) & (SVf_POK|SVs_GMG|SVf_UTF8);
3130 STATIC_ASSERT_STMT(SVf_UTF8 == (HINT_BYTES << 26));
3133 if (LIKELY(svflags == SVf_POK))
3136 if (svflags & SVs_GMG)
3141 if (!IN_BYTES) { /* reread to avoid using an C auto/register */
3142 if ((SvFLAGS(sv) & (SVf_POK|SVf_UTF8)) == SVf_POK)
3144 if ( SvPOK(sv) && (PL_op->op_private & OPpTRUEBOOL)) {
3145 /* no need to convert from bytes to chars */
3149 len = sv_len_utf8_nomg(sv);
3152 /* unrolled SvPV_nomg_const(sv,len) */
3153 if (SvPOK_nog(sv)) {
3156 if (PL_op->op_private & OPpTRUEBOOL) {
3158 SETs(len ? &PL_sv_yes : &PL_sv_zero);
3163 (void)sv_2pv_flags(sv, &len, 0|SV_CONST_RETURN);
3166 TARGi((IV)(len), 1);
3169 if (!SvPADTMP(TARG)) {
3170 /* OPpTARGET_MY: targ is var in '$lex = length()' */
3175 /* TARG is on stack at this point and is overwriten by SETs.
3176 * This branch is the odd one out, so put TARG by default on
3177 * stack earlier to let local SP go out of liveness sooner */
3180 return NORMAL; /* no putback, SP didn't move in this opcode */
3184 /* Returns false if substring is completely outside original string.
3185 No length is indicated by len_iv = 0 and len_is_uv = 0. len_is_uv must
3186 always be true for an explicit 0.
3189 Perl_translate_substr_offsets( STRLEN curlen, IV pos1_iv,
3190 bool pos1_is_uv, IV len_iv,
3191 bool len_is_uv, STRLEN *posp,
3197 PERL_ARGS_ASSERT_TRANSLATE_SUBSTR_OFFSETS;
3199 if (!pos1_is_uv && pos1_iv < 0 && curlen) {
3200 pos1_is_uv = curlen-1 > ~(UV)pos1_iv;
3203 if ((pos1_is_uv || pos1_iv > 0) && (UV)pos1_iv > curlen)
3206 if (len_iv || len_is_uv) {
3207 if (!len_is_uv && len_iv < 0) {
3208 pos2_iv = curlen + len_iv;
3210 pos2_is_uv = curlen-1 > ~(UV)len_iv;
3213 } else { /* len_iv >= 0 */
3214 if (!pos1_is_uv && pos1_iv < 0) {
3215 pos2_iv = pos1_iv + len_iv;
3216 pos2_is_uv = (UV)len_iv > (UV)IV_MAX;
3218 if ((UV)len_iv > curlen-(UV)pos1_iv)
3221 pos2_iv = pos1_iv+len_iv;
3231 if (!pos2_is_uv && pos2_iv < 0) {
3232 if (!pos1_is_uv && pos1_iv < 0)
3236 else if (!pos1_is_uv && pos1_iv < 0)
3239 if ((UV)pos2_iv < (UV)pos1_iv)
3241 if ((UV)pos2_iv > curlen)
3244 /* pos1_iv and pos2_iv both in 0..curlen, so the cast is safe */
3245 *posp = (STRLEN)( (UV)pos1_iv );
3246 *lenp = (STRLEN)( (UV)pos2_iv - (UV)pos1_iv );
3263 I32 lvalue = PL_op->op_flags & OPf_MOD || LVRET;
3264 const bool rvalue = (GIMME_V != G_VOID);
3267 const char *repl = NULL;
3269 int num_args = PL_op->op_private & 7;
3270 bool repl_need_utf8_upgrade = FALSE;
3274 if(!(repl_sv = POPs)) num_args--;
3276 if ((len_sv = POPs)) {
3277 len_iv = SvIV(len_sv);
3278 len_is_uv = len_iv ? SvIOK_UV(len_sv) : 1;
3283 pos1_iv = SvIV(pos_sv);
3284 pos1_is_uv = SvIOK_UV(pos_sv);
3286 if (PL_op->op_private & OPpSUBSTR_REPL_FIRST) {
3290 if (lvalue && !repl_sv) {
3292 ret = sv_2mortal(newSV_type(SVt_PVLV)); /* Not TARG RT#67838 */
3293 sv_magic(ret, NULL, PERL_MAGIC_substr, NULL, 0);
3295 LvTARG(ret) = SvREFCNT_inc_simple(sv);
3297 pos1_is_uv || pos1_iv >= 0
3298 ? (STRLEN)(UV)pos1_iv
3299 : (LvFLAGS(ret) |= LVf_NEG_OFF, (STRLEN)(UV)-pos1_iv);
3301 len_is_uv || len_iv > 0
3302 ? (STRLEN)(UV)len_iv
3303 : (LvFLAGS(ret) |= LVf_NEG_LEN, (STRLEN)(UV)-len_iv);
3305 PUSHs(ret); /* avoid SvSETMAGIC here */
3309 repl = SvPV_const(repl_sv, repl_len);
3312 Perl_ck_warner(aTHX_ packWARN(WARN_SUBSTR),
3313 "Attempt to use reference as lvalue in substr"
3315 tmps = SvPV_force_nomg(sv, curlen);
3316 if (DO_UTF8(repl_sv) && repl_len) {
3318 /* Upgrade the dest, and recalculate tmps in case the buffer
3319 * got reallocated; curlen may also have been changed */
3320 sv_utf8_upgrade_nomg(sv);
3321 tmps = SvPV_nomg(sv, curlen);
3324 else if (DO_UTF8(sv))
3325 repl_need_utf8_upgrade = TRUE;
3327 else tmps = SvPV_const(sv, curlen);
3329 utf8_curlen = sv_or_pv_len_utf8(sv, tmps, curlen);
3330 if (utf8_curlen == curlen)
3333 curlen = utf8_curlen;
3339 STRLEN pos, len, byte_len, byte_pos;
3341 if (!translate_substr_offsets(
3342 curlen, pos1_iv, pos1_is_uv, len_iv, len_is_uv, &pos, &len
3346 byte_pos = utf8_curlen
3347 ? sv_or_pv_pos_u2b(sv, tmps, pos, &byte_len) : pos;
3352 SvTAINTED_off(TARG); /* decontaminate */
3353 SvUTF8_off(TARG); /* decontaminate */
3354 sv_setpvn(TARG, tmps, byte_len);
3355 #ifdef USE_LOCALE_COLLATE
3356 sv_unmagic(TARG, PERL_MAGIC_collxfrm);
3363 SV* repl_sv_copy = NULL;
3365 if (repl_need_utf8_upgrade) {
3366 repl_sv_copy = newSVsv(repl_sv);
3367 sv_utf8_upgrade(repl_sv_copy);
3368 repl = SvPV_const(repl_sv_copy, repl_len);
3372 sv_insert_flags(sv, byte_pos, byte_len, repl, repl_len, 0);
3373 SvREFCNT_dec(repl_sv_copy);
3376 if (PL_op->op_private & OPpSUBSTR_REPL_FIRST)
3386 Perl_croak(aTHX_ "substr outside of string");
3387 Perl_ck_warner(aTHX_ packWARN(WARN_SUBSTR), "substr outside of string");
3394 const IV size = POPi;
3395 SV* offsetsv = POPs;
3396 SV * const src = POPs;
3397 const I32 lvalue = PL_op->op_flags & OPf_MOD || LVRET;
3403 /* extract a STRLEN-ranged integer value from offsetsv into offset,
3404 * or flag that its out of range */
3406 IV iv = SvIV(offsetsv);
3408 /* avoid a large UV being wrapped to a negative value */
3409 if (SvIOK_UV(offsetsv) && SvUVX(offsetsv) > (UV)IV_MAX)
3410 errflags = LVf_OUT_OF_RANGE;
3412 errflags = (LVf_NEG_OFF|LVf_OUT_OF_RANGE);
3413 #if PTRSIZE < IVSIZE
3414 else if (iv > Size_t_MAX)
3415 errflags = LVf_OUT_OF_RANGE;
3418 offset = (STRLEN)iv;
3421 retuv = errflags ? 0 : do_vecget(src, offset, size);
3423 if (lvalue) { /* it's an lvalue! */
3424 ret = sv_2mortal(newSV_type(SVt_PVLV)); /* Not TARG RT#67838 */
3425 sv_magic(ret, NULL, PERL_MAGIC_vec, NULL, 0);
3427 LvTARG(ret) = SvREFCNT_inc_simple(src);
3428 LvTARGOFF(ret) = offset;
3429 LvTARGLEN(ret) = size;
3430 LvFLAGS(ret) = errflags;
3434 SvTAINTED_off(TARG); /* decontaminate */
3438 sv_setuv(ret, retuv);
3446 /* also used for: pp_rindex() */
3459 const char *little_p;
3462 const bool is_index = PL_op->op_type == OP_INDEX;
3463 const bool threeargs = MAXARG >= 3 && (TOPs || ((void)POPs,0));
3469 big_p = SvPV_const(big, biglen);
3470 little_p = SvPV_const(little, llen);
3472 big_utf8 = DO_UTF8(big);
3473 little_utf8 = DO_UTF8(little);
3474 if (big_utf8 ^ little_utf8) {
3475 /* One needs to be upgraded. */
3477 /* Well, maybe instead we might be able to downgrade the small
3479 char * const pv = (char*)bytes_from_utf8((U8 *)little_p, &llen,
3482 /* If the large string is ISO-8859-1, and it's not possible to
3483 convert the small string to ISO-8859-1, then there is no
3484 way that it could be found anywhere by index. */
3489 /* At this point, pv is a malloc()ed string. So donate it to temp
3490 to ensure it will get free()d */
3491 little = temp = newSV(0);
3492 sv_usepvn(temp, pv, llen);
3493 little_p = SvPVX(little);
3495 temp = newSVpvn(little_p, llen);
3497 sv_utf8_upgrade(temp);
3499 little_p = SvPV_const(little, llen);
3502 if (SvGAMAGIC(big)) {
3503 /* Life just becomes a lot easier if I use a temporary here.
3504 Otherwise I need to avoid calls to sv_pos_u2b(), which (dangerously)
3505 will trigger magic and overloading again, as will fbm_instr()
3507 big = newSVpvn_flags(big_p, biglen,
3508 SVs_TEMP | (big_utf8 ? SVf_UTF8 : 0));
3511 if (SvGAMAGIC(little) || (is_index && !SvOK(little))) {
3512 /* index && SvOK() is a hack. fbm_instr() calls SvPV_const, which will
3513 warn on undef, and we've already triggered a warning with the
3514 SvPV_const some lines above. We can't remove that, as we need to
3515 call some SvPV to trigger overloading early and find out if the
3517 This is all getting too messy. The API isn't quite clean enough,
3518 because data access has side effects.
3520 little = newSVpvn_flags(little_p, llen,
3521 SVs_TEMP | (little_utf8 ? SVf_UTF8 : 0));
3522 little_p = SvPVX(little);
3526 offset = is_index ? 0 : biglen;
3528 if (big_utf8 && offset > 0)
3529 offset = sv_pos_u2b_flags(big, offset, 0, SV_CONST_RETURN);
3535 else if (offset > (SSize_t)biglen)
3537 if (!(little_p = is_index
3538 ? fbm_instr((unsigned char*)big_p + offset,
3539 (unsigned char*)big_p + biglen, little, 0)
3540 : rninstr(big_p, big_p + offset,
3541 little_p, little_p + llen)))
3544 retval = little_p - big_p;
3545 if (retval > 1 && big_utf8)
3546 retval = sv_pos_b2u_flags(big, retval, SV_CONST_RETURN);
3551 /* OPpTRUEBOOL indicates an '== -1' has been optimised away */
3552 if (PL_op->op_private & OPpTRUEBOOL) {
3553 SV *result = ((retval != -1) ^ cBOOL(PL_op->op_private & OPpINDEX_BOOLNEG))
3554 ? &PL_sv_yes : &PL_sv_no;
3555 if (PL_op->op_private & OPpTARGET_MY) {
3556 /* $lex = (index() == -1) */
3557 sv_setsv_mg(TARG, result);
3571 dSP; dMARK; dORIGMARK; dTARGET;
3572 SvTAINTED_off(TARG);
3573 do_sprintf(TARG, SP-MARK, MARK+1);
3574 TAINT_IF(SvTAINTED(TARG));
3586 const U8 *s = (U8*)SvPV_const(argsv, len);
3589 ? (len ? utf8n_to_uvchr(s, len, 0, UTF8_ALLOW_ANYUV) : 0)
3603 if (UNLIKELY(SvAMAGIC(top)))
3605 if (UNLIKELY(isinfnansv(top)))
3606 Perl_croak(aTHX_ "Cannot chr %" NVgf, SvNV(top));
3608 if (!IN_BYTES /* under bytes, chr(-1) eq chr(0xff), etc. */
3609 && ((SvIOKp(top) && !SvIsUV(top) && SvIV_nomg(top) < 0)
3611 ((SvNOKp(top) || (SvOK(top) && !SvIsUV(top)))
3612 && SvNV_nomg(top) < 0.0)))
3614 if (ckWARN(WARN_UTF8)) {
3615 if (SvGMAGICAL(top)) {
3616 SV *top2 = sv_newmortal();
3617 sv_setsv_nomg(top2, top);
3620 Perl_warner(aTHX_ packWARN(WARN_UTF8),
3621 "Invalid negative number (%" SVf ") in chr", SVfARG(top));
3623 value = UNICODE_REPLACEMENT;
3625 value = SvUV_nomg(top);
3629 SvUPGRADE(TARG,SVt_PV);
3631 if (value > 255 && !IN_BYTES) {
3632 SvGROW(TARG, (STRLEN)UVCHR_SKIP(value)+1);
3633 tmps = (char*)uvchr_to_utf8_flags((U8*)SvPVX(TARG), value, 0);
3634 SvCUR_set(TARG, tmps - SvPVX_const(TARG));
3636 (void)SvPOK_only(TARG);
3645 *tmps++ = (char)value;
3647 (void)SvPOK_only(TARG);
3659 const char *tmps = SvPV_const(left, len);
3661 if (DO_UTF8(left)) {
3662 /* If Unicode, try to downgrade.
3663 * If not possible, croak.
3664 * Yes, we made this up. */
3665 SV* const tsv = newSVpvn_flags(tmps, len, SVf_UTF8|SVs_TEMP);
3667 sv_utf8_downgrade(tsv, FALSE);
3668 tmps = SvPV_const(tsv, len);
3670 # ifdef USE_ITHREADS
3672 if (!PL_reentrant_buffer->_crypt_struct_buffer) {
3673 /* This should be threadsafe because in ithreads there is only
3674 * one thread per interpreter. If this would not be true,
3675 * we would need a mutex to protect this malloc. */
3676 PL_reentrant_buffer->_crypt_struct_buffer =
3677 (struct crypt_data *)safemalloc(sizeof(struct crypt_data));
3678 # if defined(__GLIBC__) || defined(__EMX__)
3679 if (PL_reentrant_buffer->_crypt_struct_buffer) {
3680 PL_reentrant_buffer->_crypt_struct_buffer->initialized = 0;
3684 # endif /* HAS_CRYPT_R */
3685 # endif /* USE_ITHREADS */
3687 sv_setpv(TARG, PerlProc_crypt(tmps, SvPV_nolen_const(right)));
3694 "The crypt() function is unimplemented due to excessive paranoia.");
3698 /* Generally UTF-8 and UTF-EBCDIC are indistinguishable at this level. So
3699 * most comments below say UTF-8, when in fact they mean UTF-EBCDIC as well */
3702 /* also used for: pp_lcfirst() */
3706 /* Actually is both lcfirst() and ucfirst(). Only the first character
3707 * changes. This means that possibly we can change in-place, ie., just
3708 * take the source and change that one character and store it back, but not
3709 * if read-only etc, or if the length changes */
3713 STRLEN slen; /* slen is the byte length of the whole SV. */
3716 bool inplace; /* ? Convert first char only, in-place */
3717 bool doing_utf8 = FALSE; /* ? using utf8 */
3718 bool convert_source_to_utf8 = FALSE; /* ? need to convert */
3719 const int op_type = PL_op->op_type;
3722 U8 tmpbuf[UTF8_MAXBYTES_CASE+1];
3723 STRLEN ulen; /* ulen is the byte length of the original Unicode character
3724 * stored as UTF-8 at s. */
3725 STRLEN tculen; /* tculen is the byte length of the freshly titlecased (or
3726 * lowercased) character stored in tmpbuf. May be either
3727 * UTF-8 or not, but in either case is the number of bytes */
3728 bool remove_dot_above = FALSE;
3730 s = (const U8*)SvPV_const(source, slen);
3732 /* We may be able to get away with changing only the first character, in
3733 * place, but not if read-only, etc. Later we may discover more reasons to
3734 * not convert in-place. */
3735 inplace = !SvREADONLY(source) && SvPADTMP(source);
3737 #ifdef USE_LOCALE_CTYPE
3739 if (IN_LC_RUNTIME(LC_CTYPE)) {
3740 _CHECK_AND_WARN_PROBLEMATIC_LOCALE;
3745 /* First calculate what the changed first character should be. This affects
3746 * whether we can just swap it out, leaving the rest of the string unchanged,
3747 * or even if have to convert the dest to UTF-8 when the source isn't */
3749 if (! slen) { /* If empty */
3750 need = 1; /* still need a trailing NUL */
3754 else if (DO_UTF8(source)) { /* Is the source utf8? */
3758 if (op_type == OP_UCFIRST) {
3759 #ifdef USE_LOCALE_CTYPE
3760 _toTITLE_utf8_flags(s, s +slen, tmpbuf, &tculen, IN_LC_RUNTIME(LC_CTYPE));
3762 _toTITLE_utf8_flags(s, s +slen, tmpbuf, &tculen, 0);
3767 #ifdef USE_LOCALE_CTYPE
3769 _toLOWER_utf8_flags(s, s + slen, tmpbuf, &tculen, IN_LC_RUNTIME(LC_CTYPE));
3771 /* In turkic locales, lower casing an 'I' normally yields U+0131,
3772 * LATIN SMALL LETTER DOTLESS I, but not if the grapheme also
3773 * contains a COMBINING DOT ABOVE. Instead it is treated like
3774 * LATIN CAPITAL LETTER I WITH DOT ABOVE lowercased to 'i'. The
3775 * call to lowercase above has handled this. But SpecialCasing.txt
3776 * says we are supposed to remove the COMBINING DOT ABOVE. We can
3777 * tell if we have this situation if I ==> i in a turkic locale. */
3778 if ( UNLIKELY(PL_in_utf8_turkic_locale)
3779 && IN_LC_RUNTIME(LC_CTYPE)
3780 && (UNLIKELY(*s == 'I' && tmpbuf[0] == 'i')))
3782 /* Here, we know there was a COMBINING DOT ABOVE. We won't be
3783 * able to handle this in-place. */
3786 /* It seems likely that the DOT will immediately follow the
3787 * 'I'. If so, we can remove it simply by indicating to the
3788 * code below to start copying the source just beyond the DOT.
3789 * We know its length is 2 */
3790 if (LIKELY(memBEGINs(s + 1, s + slen, COMBINING_DOT_ABOVE_UTF8))) {
3793 else { /* But if it doesn't follow immediately, set a flag for
3795 remove_dot_above = TRUE;
3799 PERL_UNUSED_VAR(remove_dot_above);
3801 _toLOWER_utf8_flags(s, s + slen, tmpbuf, &tculen, 0);
3806 /* we can't do in-place if the length changes. */
3807 if (ulen != tculen) inplace = FALSE;
3808 need = slen + 1 - ulen + tculen;
3810 else { /* Non-zero length, non-UTF-8, Need to consider locale and if
3811 * latin1 is treated as caseless. Note that a locale takes
3813 ulen = 1; /* Original character is 1 byte */
3814 tculen = 1; /* Most characters will require one byte, but this will
3815 * need to be overridden for the tricky ones */
3819 #ifdef USE_LOCALE_CTYPE
3821 if (IN_LC_RUNTIME(LC_CTYPE)) {
3822 if ( UNLIKELY(PL_in_utf8_turkic_locale)
3823 && ( (op_type == OP_LCFIRST && UNLIKELY(*s == 'I'))
3824 || (op_type == OP_UCFIRST && UNLIKELY(*s == 'i'))))
3826 if (*s == 'I') { /* lcfirst('I') */
3827 tmpbuf[0] = UTF8_TWO_BYTE_HI(LATIN_SMALL_LETTER_DOTLESS_I);
3828 tmpbuf[1] = UTF8_TWO_BYTE_LO(LATIN_SMALL_LETTER_DOTLESS_I);
3830 else { /* ucfirst('i') */
3831 tmpbuf[0] = UTF8_TWO_BYTE_HI(LATIN_CAPITAL_LETTER_I_WITH_DOT_ABOVE);
3832 tmpbuf[1] = UTF8_TWO_BYTE_LO(LATIN_CAPITAL_LETTER_I_WITH_DOT_ABOVE);
3837 convert_source_to_utf8 = TRUE;
3838 need += variant_under_utf8_count(s, s + slen);
3840 else if (op_type == OP_LCFIRST) {
3842 /* For lc, there are no gotchas for UTF-8 locales (other than
3843 * the turkish ones already handled above) */
3844 *tmpbuf = toLOWER_LC(*s);
3846 else { /* ucfirst */
3848 /* But for uc, some characters require special handling */
3849 if (IN_UTF8_CTYPE_LOCALE) {
3853 /* This would be a bug if any locales have upper and title case
3855 *tmpbuf = (U8) toUPPER_LC(*s);
3860 /* Here, not in locale. If not using Unicode rules, is a simple
3861 * lower/upper, depending */
3862 if (! IN_UNI_8_BIT) {
3863 *tmpbuf = (op_type == OP_LCFIRST)
3867 else if (op_type == OP_LCFIRST) {
3868 /* lower case the first letter: no trickiness for any character */
3869 *tmpbuf = toLOWER_LATIN1(*s);
3872 /* Here, is ucfirst non-UTF-8, not in locale (unless that locale is
3873 * non-turkic UTF-8, which we treat as not in locale), and cased
3876 #ifdef USE_LOCALE_CTYPE
3880 title_ord = _to_upper_title_latin1(*s, tmpbuf, &tculen, 's');
3882 assert(tculen == 2);
3884 /* If the result is an upper Latin1-range character, it can
3885 * still be represented in one byte, which is its ordinal */
3886 if (UTF8_IS_DOWNGRADEABLE_START(*tmpbuf)) {
3887 *tmpbuf = (U8) title_ord;
3891 /* Otherwise it became more than one ASCII character (in
3892 * the case of LATIN_SMALL_LETTER_SHARP_S) or changed to
3893 * beyond Latin1, so the number of bytes changed, so can't
3894 * replace just the first character in place. */
3897 /* If the result won't fit in a byte, the entire result
3898 * will have to be in UTF-8. Allocate enough space for the
3899 * expanded first byte, and if UTF-8, the rest of the input
3900 * string, some or all of which may also expand to two
3901 * bytes, plus the terminating NUL. */
3902 if (title_ord > 255) {
3904 convert_source_to_utf8 = TRUE;
3906 + variant_under_utf8_count(s, s + slen)
3909 /* The (converted) UTF-8 and UTF-EBCDIC lengths of all
3910 * characters whose title case is above 255 is
3914 else { /* LATIN_SMALL_LETTER_SHARP_S expands by 1 byte */
3915 need = slen + 1 + 1;
3919 } /* End of use Unicode (Latin1) semantics */
3920 } /* End of changing the case of the first character */
3922 /* Here, have the first character's changed case stored in tmpbuf. Ready to
3923 * generate the result */
3926 /* We can convert in place. This means we change just the first
3927 * character without disturbing the rest; no need to grow */
3929 s = d = (U8*)SvPV_force_nomg(source, slen);
3935 /* Here, we can't convert in place; we earlier calculated how much
3936 * space we will need, so grow to accommodate that */
3937 SvUPGRADE(dest, SVt_PV);
3938 d = (U8*)SvGROW(dest, need);
3939 (void)SvPOK_only(dest);
3946 if (! convert_source_to_utf8) {
3948 /* Here both source and dest are in UTF-8, but have to create
3949 * the entire output. We initialize the result to be the
3950 * title/lower cased first character, and then append the rest
3952 sv_setpvn(dest, (char*)tmpbuf, tculen);
3955 /* But this boolean being set means we are in a turkic
3956 * locale, and there is a DOT character that needs to be
3957 * removed, and it isn't immediately after the current
3958 * character. Keep concatenating characters to the output
3959 * one at a time, until we find the DOT, which we simply
3961 if (UNLIKELY(remove_dot_above)) {
3963 Size_t this_len = UTF8SKIP(s + ulen);
3965 sv_catpvn(dest, (char*)(s + ulen), this_len);
3968 if (memBEGINs(s + ulen, s + slen, COMBINING_DOT_ABOVE_UTF8)) {
3972 } while (s + ulen < s + slen);
3975 /* The rest of the string can be concatenated unchanged,
3977 sv_catpvn(dest, (char*)(s + ulen), slen - ulen);
3981 const U8 *const send = s + slen;
3983 /* Here the dest needs to be in UTF-8, but the source isn't,
3984 * except we earlier UTF-8'd the first character of the source
3985 * into tmpbuf. First put that into dest, and then append the
3986 * rest of the source, converting it to UTF-8 as we go. */
3988 /* Assert tculen is 2 here because the only characters that
3989 * get to this part of the code have 2-byte UTF-8 equivalents */
3990 assert(tculen == 2);
3992 *d++ = *(tmpbuf + 1);
3993 s++; /* We have just processed the 1st char */
3996 append_utf8_from_native_byte(*s, &d);
4001 SvCUR_set(dest, d - (U8*)SvPVX_const(dest));
4005 else { /* in-place UTF-8. Just overwrite the first character */
4006 Copy(tmpbuf, d, tculen, U8);
4007 SvCUR_set(dest, need - 1);
4011 else { /* Neither source nor dest are, nor need to be UTF-8 */
4013 if (inplace) { /* in-place, only need to change the 1st char */
4016 else { /* Not in-place */
4018 /* Copy the case-changed character(s) from tmpbuf */
4019 Copy(tmpbuf, d, tculen, U8);
4020 d += tculen - 1; /* Code below expects d to point to final
4021 * character stored */
4024 else { /* empty source */
4025 /* See bug #39028: Don't taint if empty */
4029 /* In a "use bytes" we don't treat the source as UTF-8, but, still want
4030 * the destination to retain that flag */
4031 if (DO_UTF8(source))
4034 if (!inplace) { /* Finish the rest of the string, unchanged */
4035 /* This will copy the trailing NUL */
4036 Copy(s + 1, d + 1, slen, U8);
4037 SvCUR_set(dest, need - 1);
4040 #ifdef USE_LOCALE_CTYPE
4041 if (IN_LC_RUNTIME(LC_CTYPE)) {
4046 if (dest != source && SvTAINTED(source))
4064 if ( SvPADTMP(source)
4065 && !SvREADONLY(source) && SvPOK(source)
4068 #ifdef USE_LOCALE_CTYPE
4069 (IN_LC_RUNTIME(LC_CTYPE))
4070 ? ! IN_UTF8_CTYPE_LOCALE
4076 /* We can convert in place. The reason we can't if in UNI_8_BIT is to
4077 * make the loop tight, so we overwrite the source with the dest before
4078 * looking at it, and we need to look at the original source
4079 * afterwards. There would also need to be code added to handle
4080 * switching to not in-place in midstream if we run into characters
4081 * that change the length. Since being in locale overrides UNI_8_BIT,
4082 * that latter becomes irrelevant in the above test; instead for
4083 * locale, the size can't normally change, except if the locale is a
4086 s = d = (U8*)SvPV_force_nomg(source, len);
4093 s = (const U8*)SvPV_nomg_const(source, len);
4096 SvUPGRADE(dest, SVt_PV);
4097 d = (U8*)SvGROW(dest, min);
4098 (void)SvPOK_only(dest);
4103 #ifdef USE_LOCALE_CTYPE
4105 if (IN_LC_RUNTIME(LC_CTYPE)) {
4106 _CHECK_AND_WARN_PROBLEMATIC_LOCALE;
4111 /* Overloaded values may have toggled the UTF-8 flag on source, so we need
4112 to check DO_UTF8 again here. */
4114 if (DO_UTF8(source)) {
4115 const U8 *const send = s + len;
4116 U8 tmpbuf[UTF8_MAXBYTES_CASE+1];
4118 #define GREEK_CAPITAL_LETTER_IOTA 0x0399
4119 #define COMBINING_GREEK_YPOGEGRAMMENI 0x0345
4120 /* All occurrences of these are to be moved to follow any other marks.
4121 * This is context-dependent. We may not be passed enough context to
4122 * move the iota subscript beyond all of them, but we do the best we can
4123 * with what we're given. The result is always better than if we
4124 * hadn't done this. And, the problem would only arise if we are
4125 * passed a character without all its combining marks, which would be
4126 * the caller's mistake. The information this is based on comes from a
4127 * comment in Unicode SpecialCasing.txt, (and the Standard's text
4128 * itself) and so can't be checked properly to see if it ever gets
4129 * revised. But the likelihood of it changing is remote */
4130 bool in_iota_subscript = FALSE;
4136 if (UNLIKELY(in_iota_subscript)) {
4137 UV cp = utf8_to_uvchr_buf(s, send, NULL);
4139 if (! _invlist_contains_cp(PL_utf8_mark, cp)) {
4141 /* A non-mark. Time to output the iota subscript */
4142 *d++ = UTF8_TWO_BYTE_HI(GREEK_CAPITAL_LETTER_IOTA);
4143 *d++ = UTF8_TWO_BYTE_LO(GREEK_CAPITAL_LETTER_IOTA);
4144 in_iota_subscript = FALSE;
4148 /* Then handle the current character. Get the changed case value
4149 * and copy it to the output buffer */
4152 #ifdef USE_LOCALE_CTYPE
4153 uv = _toUPPER_utf8_flags(s, send, tmpbuf, &ulen, IN_LC_RUNTIME(LC_CTYPE));
4155 uv = _toUPPER_utf8_flags(s, send, tmpbuf, &ulen, 0);
4157 if (uv == GREEK_CAPITAL_LETTER_IOTA
4158 && utf8_to_uvchr_buf(s, send, 0) == COMBINING_GREEK_YPOGEGRAMMENI)
4160 in_iota_subscript = TRUE;
4163 if (ulen > u && (SvLEN(dest) < (min += ulen - u))) {
4164 /* If the eventually required minimum size outgrows the
4165 * available space, we need to grow. */
4166 const UV o = d - (U8*)SvPVX_const(dest);
4168 /* If someone uppercases one million U+03B0s we SvGROW()
4169 * one million times. Or we could try guessing how much to
4170 * allocate without allocating too much. But we can't
4171 * really guess without examining the rest of the string.
4172 * Such is life. See corresponding comment in lc code for
4174 d = o + (U8*) SvGROW(dest, min);
4176 Copy(tmpbuf, d, ulen, U8);
4181 if (in_iota_subscript) {
4182 *d++ = UTF8_TWO_BYTE_HI(GREEK_CAPITAL_LETTER_IOTA);
4183 *d++ = UTF8_TWO_BYTE_LO(GREEK_CAPITAL_LETTER_IOTA);
4188 SvCUR_set(dest, d - (U8*)SvPVX_const(dest));
4190 else { /* Not UTF-8 */
4192 const U8 *const send = s + len;
4194 /* Use locale casing if in locale; regular style if not treating
4195 * latin1 as having case; otherwise the latin1 casing. Do the
4196 * whole thing in a tight loop, for speed, */
4197 #ifdef USE_LOCALE_CTYPE
4198 if (IN_LC_RUNTIME(LC_CTYPE)) {
4199 if (IN_UTF8_CTYPE_LOCALE) {
4202 for (; s < send; d++, s++)
4203 *d = (U8) toUPPER_LC(*s);
4207 if (! IN_UNI_8_BIT) {
4208 for (; s < send; d++, s++) {
4213 #ifdef USE_LOCALE_CTYPE
4216 for (; s < send; d++, s++) {
4219 *d = toUPPER_LATIN1_MOD(*s);
4220 if ( LIKELY(*d != LATIN_SMALL_LETTER_Y_WITH_DIAERESIS)
4222 #ifdef USE_LOCALE_CTYPE
4224 && (LIKELY( ! PL_in_utf8_turkic_locale
4225 || ! IN_LC_RUNTIME(LC_CTYPE))
4233 /* The mainstream case is the tight loop above. To avoid
4234 * extra tests in that, all three characters that always
4235 * require special handling are mapped by the MOD to the
4236 * one tested just above. Use the source to distinguish
4237 * between those cases */
4239 #if UNICODE_MAJOR_VERSION > 2 \
4240 || (UNICODE_MAJOR_VERSION == 2 && UNICODE_DOT_VERSION >= 1 \
4241 && UNICODE_DOT_DOT_VERSION >= 8)
4242 if (*s == LATIN_SMALL_LETTER_SHARP_S) {
4244 /* uc() of this requires 2 characters, but they are
4245 * ASCII. If not enough room, grow the string */
4246 if (SvLEN(dest) < ++min) {
4247 const UV o = d - (U8*)SvPVX_const(dest);
4248 d = o + (U8*) SvGROW(dest, min);
4250 *d++ = 'S'; *d = 'S'; /* upper case is 'SS' */
4251 continue; /* Back to the tight loop; still in ASCII */
4255 /* The other special handling characters have their
4256 * upper cases outside the latin1 range, hence need to be
4257 * in UTF-8, so the whole result needs to be in UTF-8.
4259 * So, here we are somewhere in the middle of processing a
4260 * non-UTF-8 string, and realize that we will have to
4261 * convert the whole thing to UTF-8. What to do? There
4262 * are several possibilities. The simplest to code is to
4263 * convert what we have so far, set a flag, and continue on
4264 * in the loop. The flag would be tested each time through
4265 * the loop, and if set, the next character would be
4266 * converted to UTF-8 and stored. But, I (khw) didn't want
4267 * to slow down the mainstream case at all for this fairly
4268 * rare case, so I didn't want to add a test that didn't
4269 * absolutely have to be there in the loop, besides the
4270 * possibility that it would get too complicated for
4271 * optimizers to deal with. Another possibility is to just
4272 * give up, convert the source to UTF-8, and restart the
4273 * function that way. Another possibility is to convert
4274 * both what has already been processed and what is yet to
4275 * come separately to UTF-8, then jump into the loop that
4276 * handles UTF-8. But the most efficient time-wise of the
4277 * ones I could think of is what follows, and turned out to
4278 * not require much extra code.
4280 * First, calculate the extra space needed for the
4281 * remainder of the source needing to be in UTF-8. Except
4282 * for the 'i' in Turkic locales, in UTF-8 strings, the
4283 * uppercase of a character below 256 occupies the same
4284 * number of bytes as the original. Therefore, the space
4285 * needed is the that number plus the number of characters
4286 * that become two bytes when converted to UTF-8, plus, in
4287 * turkish locales, the number of 'i's. */
4289 extra = send - s + variant_under_utf8_count(s, send);
4291 #ifdef USE_LOCALE_CTYPE
4293 if (UNLIKELY(*s == 'i')) { /* We wouldn't get an 'i' here
4294 unless are in a Turkic
4296 const U8 * s_peek = s;
4301 s_peek = (U8 *) memchr(s_peek + 1, 'i',
4302 send - (s_peek + 1));
4303 } while (s_peek != NULL);
4307 /* Convert what we have so far into UTF-8, telling the
4308 * function that we know it should be converted, and to
4309 * allow extra space for what we haven't processed yet.
4311 * This may cause the string pointer to move, so need to
4312 * save and re-find it. */
4314 len = d - (U8*)SvPVX_const(dest);
4315 SvCUR_set(dest, len);
4316 len = sv_utf8_upgrade_flags_grow(dest,
4317 SV_GMAGIC|SV_FORCE_UTF8_UPGRADE,
4319 + 1 /* trailing NUL */ );
4320 d = (U8*)SvPVX(dest) + len;
4322 /* Now process the remainder of the source, simultaneously
4323 * converting to upper and UTF-8.
4325 * To avoid extra tests in the loop body, and since the
4326 * loop is so simple, split out the rare Turkic case into
4329 #ifdef USE_LOCALE_CTYPE
4330 if ( UNLIKELY(PL_in_utf8_turkic_locale)
4331 && UNLIKELY(IN_LC_RUNTIME(LC_CTYPE)))
4333 for (; s < send; s++) {
4335 *d++ = UTF8_TWO_BYTE_HI(LATIN_CAPITAL_LETTER_I_WITH_DOT_ABOVE);
4336 *d++ = UTF8_TWO_BYTE_LO(LATIN_CAPITAL_LETTER_I_WITH_DOT_ABOVE);
4339 (void) _to_upper_title_latin1(*s, d, &len, 'S');
4346 for (; s < send; s++) {
4347 (void) _to_upper_title_latin1(*s, d, &len, 'S');
4351 /* Here have processed the whole source; no need to
4352 * continue with the outer loop. Each character has been
4353 * converted to upper case and converted to UTF-8. */
4355 } /* End of processing all latin1-style chars */
4356 } /* End of processing all chars */
4357 } /* End of source is not empty */
4359 if (source != dest) {
4360 *d = '\0'; /* Here d points to 1 after last char, add NUL */
4361 SvCUR_set(dest, d - (U8*)SvPVX_const(dest));
4363 } /* End of isn't utf8 */
4364 #ifdef USE_LOCALE_CTYPE
4365 if (IN_LC_RUNTIME(LC_CTYPE)) {
4370 if (dest != source && SvTAINTED(source))
4385 bool has_turkic_I = FALSE;
4389 if ( SvPADTMP(source)
4390 && !SvREADONLY(source) && SvPOK(source)
4393 #ifdef USE_LOCALE_CTYPE
4395 && ( LIKELY(! IN_LC_RUNTIME(LC_CTYPE))
4396 || LIKELY(! PL_in_utf8_turkic_locale))
4402 /* We can convert in place, as, outside of Turkic UTF-8 locales,
4403 * lowercasing anything in the latin1 range (or else DO_UTF8 would have
4404 * been on) doesn't lengthen it. */
4406 s = d = (U8*)SvPV_force_nomg(source, len);
4413 s = (const U8*)SvPV_nomg_const(source, len);
4416 SvUPGRADE(dest, SVt_PV);
4417 d = (U8*)SvGROW(dest, min);
4418 (void)SvPOK_only(dest);
4423 #ifdef USE_LOCALE_CTYPE
4425 if (IN_LC_RUNTIME(LC_CTYPE)) {
4428 _CHECK_AND_WARN_PROBLEMATIC_LOCALE;
4430 /* Lowercasing in a Turkic locale can cause non-UTF-8 to need to become
4431 * UTF-8 for the single case of the character 'I' */
4432 if ( UNLIKELY(PL_in_utf8_turkic_locale)
4433 && ! DO_UTF8(source)
4434 && (next_I = (U8 *) memchr(s, 'I', len)))
4437 const U8 *const send = s + len;
4442 next_I = (U8 *) memchr(next_I + 1, 'I',
4443 send - (next_I + 1));
4444 } while (next_I != NULL);
4446 /* Except for the 'I', in UTF-8 strings, the lower case of a
4447 * character below 256 occupies the same number of bytes as the
4448 * original. Therefore, the space needed is the original length
4449 * plus I_count plus the number of characters that become two bytes
4450 * when converted to UTF-8 */
4451 sv_utf8_upgrade_flags_grow(dest, 0, len
4453 + variant_under_utf8_count(s, send)
4454 + 1 /* Trailing NUL */ );
4455 d = (U8*)SvPVX(dest);
4456 has_turkic_I = TRUE;
4462 /* Overloaded values may have toggled the UTF-8 flag on source, so we need
4463 to check DO_UTF8 again here. */
4465 if (DO_UTF8(source)) {
4466 const U8 *const send = s + len;
4467 U8 tmpbuf[UTF8_MAXBYTES_CASE+1];
4468 bool remove_dot_above = FALSE;
4471 const STRLEN u = UTF8SKIP(s);
4474 #ifdef USE_LOCALE_CTYPE
4476 _toLOWER_utf8_flags(s, send, tmpbuf, &ulen, IN_LC_RUNTIME(LC_CTYPE));
4478 /* If we are in a Turkic locale, we have to do more work. As noted
4479 * in the comments for lcfirst, there is a special case if a 'I'
4480 * is in a grapheme with COMBINING DOT ABOVE UTF8. It turns into a
4481 * 'i', and the DOT must be removed. We check for that situation,
4482 * and set a flag if the DOT is there. Then each time through the
4483 * loop, we have to see if we need to remove the next DOT above,
4484 * and if so, do it. We know that there is a DOT because
4485 * _toLOWER_utf8_flags() wouldn't have returned 'i' unless there
4486 * was one in a proper position. */
4487 if ( UNLIKELY(PL_in_utf8_turkic_locale)
4488 && IN_LC_RUNTIME(LC_CTYPE))
4490 if ( UNLIKELY(remove_dot_above)
4491 && memBEGINs(tmpbuf, sizeof(tmpbuf), COMBINING_DOT_ABOVE_UTF8))
4494 remove_dot_above = FALSE;
4497 else if (UNLIKELY(*s == 'I' && tmpbuf[0] == 'i')) {
4498 remove_dot_above = TRUE;
4502 PERL_UNUSED_VAR(remove_dot_above);
4504 _toLOWER_utf8_flags(s, send, tmpbuf, &ulen, 0);
4507 /* Here is where we would do context-sensitive actions for the
4508 * Greek final sigma. See the commit message for 86510fb15 for why
4509 * there isn't any */
4511 if (ulen > u && (SvLEN(dest) < (min += ulen - u))) {
4513 /* If the eventually required minimum size outgrows the
4514 * available space, we need to grow. */
4515 const UV o = d - (U8*)SvPVX_const(dest);
4517 /* If someone lowercases one million U+0130s we SvGROW() one
4518 * million times. Or we could try guessing how much to
4519 * allocate without allocating too much. Such is life.
4520 * Another option would be to grow an extra byte or two more
4521 * each time we need to grow, which would cut down the million
4522 * to 500K, with little waste */
4523 d = o + (U8*) SvGROW(dest, min);
4526 /* Copy the newly lowercased letter to the output buffer we're
4528 Copy(tmpbuf, d, ulen, U8);
4531 } /* End of looping through the source string */
4534 SvCUR_set(dest, d - (U8*)SvPVX_const(dest));
4535 } else { /* 'source' not utf8 */
4537 const U8 *const send = s + len;
4539 /* Use locale casing if in locale; regular style if not treating
4540 * latin1 as having case; otherwise the latin1 casing. Do the
4541 * whole thing in a tight loop, for speed, */
4542 #ifdef USE_LOCALE_CTYPE
4543 if (IN_LC_RUNTIME(LC_CTYPE)) {
4544 if (LIKELY( ! has_turkic_I)) {
4545 for (; s < send; d++, s++)
4546 *d = toLOWER_LC(*s);
4548 else { /* This is the only case where lc() converts 'dest'
4549 into UTF-8 from a non-UTF-8 'source' */
4550 for (; s < send; s++) {
4552 *d++ = UTF8_TWO_BYTE_HI(LATIN_SMALL_LETTER_DOTLESS_I);
4553 *d++ = UTF8_TWO_BYTE_LO(LATIN_SMALL_LETTER_DOTLESS_I);
4556 append_utf8_from_native_byte(toLOWER_LATIN1(*s), &d);
4563 if (! IN_UNI_8_BIT) {
4564 for (; s < send; d++, s++) {
4569 for (; s < send; d++, s++) {
4570 *d = toLOWER_LATIN1(*s);
4574 if (source != dest) {
4576 SvCUR_set(dest, d - (U8*)SvPVX_const(dest));
4579 #ifdef USE_LOCALE_CTYPE
4580 if (IN_LC_RUNTIME(LC_CTYPE)) {
4585 if (dest != source && SvTAINTED(source))
4594 SV * const sv = TOPs;
4596 const char *s = SvPV_const(sv,len);
4598 SvUTF8_off(TARG); /* decontaminate */
4601 SvUPGRADE(TARG, SVt_PV);
4602 SvGROW(TARG, (len * 2) + 1);
4606 STRLEN ulen = UTF8SKIP(s);
4607 bool to_quote = FALSE;
4609 if (UTF8_IS_INVARIANT(*s)) {
4610 if (_isQUOTEMETA(*s)) {
4614 else if (UTF8_IS_NEXT_CHAR_DOWNGRADEABLE(s, s + len)) {
4616 #ifdef USE_LOCALE_CTYPE
4617 /* In locale, we quote all non-ASCII Latin1 chars.
4618 * Otherwise use the quoting rules */
4620 IN_LC_RUNTIME(LC_CTYPE)
4623 _isQUOTEMETA(EIGHT_BIT_UTF8_TO_NATIVE(*s, *(s + 1))))
4628 else if (is_QUOTEMETA_high(s)) {
4643 else if (IN_UNI_8_BIT) {
4645 if (_isQUOTEMETA(*s))
4651 /* For non UNI_8_BIT (and hence in locale) just quote all \W
4652 * including everything above ASCII */
4654 if (!isWORDCHAR_A(*s))
4660 SvCUR_set(TARG, d - SvPVX_const(TARG));
4661 (void)SvPOK_only_UTF8(TARG);
4664 sv_setpvn(TARG, s, len);
4680 U8 tmpbuf[UTF8_MAXBYTES_CASE + 1];
4681 #if UNICODE_MAJOR_VERSION > 3 /* no multifolds in early Unicode */ \
4682 || (UNICODE_MAJOR_VERSION == 3 && ( UNICODE_DOT_VERSION > 0) \
4683 || UNICODE_DOT_DOT_VERSION > 0)
4684 const bool full_folding = TRUE; /* This variable is here so we can easily
4685 move to more generality later */
4687 const bool full_folding = FALSE;
4689 const U8 flags = ( full_folding ? FOLD_FLAGS_FULL : 0 )
4690 #ifdef USE_LOCALE_CTYPE
4691 | ( IN_LC_RUNTIME(LC_CTYPE) ? FOLD_FLAGS_LOCALE : 0 )
4695 /* This is a facsimile of pp_lc, but with a thousand bugs thanks to me.
4696 * You are welcome(?) -Hugmeir
4704 s = (const U8*)SvPV_nomg_const(source, len);
4706 if (ckWARN(WARN_UNINITIALIZED))
4707 report_uninit(source);
4714 SvUPGRADE(dest, SVt_PV);
4715 d = (U8*)SvGROW(dest, min);
4716 (void)SvPOK_only(dest);
4722 #ifdef USE_LOCALE_CTYPE
4724 if ( IN_LC_RUNTIME(LC_CTYPE) ) { /* Under locale */
4725 _CHECK_AND_WARN_PROBLEMATIC_LOCALE;
4730 if (DO_UTF8(source)) { /* UTF-8 flagged string. */
4732 const STRLEN u = UTF8SKIP(s);
4735 _toFOLD_utf8_flags(s, send, tmpbuf, &ulen, flags);
4737 if (ulen > u && (SvLEN(dest) < (min += ulen - u))) {
4738 const UV o = d - (U8*)SvPVX_const(dest);
4739 d = o + (U8*) SvGROW(dest, min);
4742 Copy(tmpbuf, d, ulen, U8);
4747 } /* Unflagged string */
4749 #ifdef USE_LOCALE_CTYPE
4750 if ( IN_LC_RUNTIME(LC_CTYPE) ) { /* Under locale */
4751 if (IN_UTF8_CTYPE_LOCALE) {
4752 goto do_uni_folding;
4754 for (; s < send; d++, s++)
4755 *d = (U8) toFOLD_LC(*s);
4759 if ( !IN_UNI_8_BIT ) { /* Under nothing, or bytes */
4760 for (; s < send; d++, s++)
4764 #ifdef USE_LOCALE_CTYPE
4767 /* For ASCII and the Latin-1 range, there's potentially three
4768 * troublesome folds:
4769 * \x{DF} (\N{LATIN SMALL LETTER SHARP S}), which under full
4770 * casefolding becomes 'ss';
4771 * \x{B5} (\N{MICRO SIGN}), which under any fold becomes
4772 * \x{3BC} (\N{GREEK SMALL LETTER MU})
4773 * I only in Turkic locales, this folds to \x{131}
4774 * \N{LATIN SMALL LETTER DOTLESS I}
4775 * For the rest, the casefold is their lowercase. */
4776 for (; s < send; d++, s++) {
4777 if ( UNLIKELY(*s == MICRO_SIGN)
4778 #ifdef USE_LOCALE_CTYPE
4779 || ( UNLIKELY(PL_in_utf8_turkic_locale)
4780 && UNLIKELY(IN_LC_RUNTIME(LC_CTYPE))
4781 && UNLIKELY(*s == 'I'))
4784 Size_t extra = send - s
4785 + variant_under_utf8_count(s, send);
4787 /* \N{MICRO SIGN}'s casefold is \N{GREEK SMALL LETTER MU},
4788 * and 'I' in Turkic locales is \N{LATIN SMALL LETTER
4789 * DOTLESS I} both of which are outside of the latin-1
4790 * range. There's a couple of ways to deal with this -- khw
4791 * discusses them in pp_lc/uc, so go there :) What we do
4792 * here is upgrade what we had already casefolded, then
4793 * enter an inner loop that appends the rest of the
4794 * characters as UTF-8.
4796 * First we calculate the needed size of the upgraded dest
4797 * beyond what's been processed already (the upgrade
4798 * function figures that out). Except for the 'I' in
4799 * Turkic locales, in UTF-8 strings, the fold case of a
4800 * character below 256 occupies the same number of bytes as
4801 * the original (even the Sharp S). Therefore, the space
4802 * needed is the number of bytes remaining plus the number
4803 * of characters that become two bytes when converted to
4804 * UTF-8 plus, in turkish locales, the number of 'I's */
4806 if (UNLIKELY(*s == 'I')) {
4807 const U8 * s_peek = s;
4812 s_peek = (U8 *) memchr(s_peek + 1, 'i',
4813 send - (s_peek + 1));
4814 } while (s_peek != NULL);
4817 /* Growing may move things, so have to save and recalculate
4819 len = d - (U8*)SvPVX_const(dest);
4820 SvCUR_set(dest, len);
4821 len = sv_utf8_upgrade_flags_grow(dest,
4822 SV_GMAGIC|SV_FORCE_UTF8_UPGRADE,
4824 + 1 /* Trailing NUL */ );
4825 d = (U8*)SvPVX(dest) + len;
4827 *d++ = UTF8_TWO_BYTE_HI(GREEK_SMALL_LETTER_MU);
4828 *d++ = UTF8_TWO_BYTE_LO(GREEK_SMALL_LETTER_MU);
4831 for (; s < send; s++) {
4833 _to_uni_fold_flags(*s, d, &ulen, flags);
4838 else if ( UNLIKELY(*s == LATIN_SMALL_LETTER_SHARP_S)
4841 /* Under full casefolding, LATIN SMALL LETTER SHARP S
4842 * becomes "ss", which may require growing the SV. */
4843 if (SvLEN(dest) < ++min) {
4844 const UV o = d - (U8*)SvPVX_const(dest);
4845 d = o + (U8*) SvGROW(dest, min);
4850 else { /* Else, the fold is the lower case */
4851 *d = toLOWER_LATIN1(*s);
4857 SvCUR_set(dest, d - (U8*)SvPVX_const(dest));
4859 #ifdef USE_LOCALE_CTYPE
4860 if (IN_LC_RUNTIME(LC_CTYPE)) {
4865 if (SvTAINTED(source))
4875 dSP; dMARK; dORIGMARK;
4876 AV *const av = MUTABLE_AV(POPs);
4877 const I32 lval = (PL_op->op_flags & OPf_MOD || LVRET);
4879 if (SvTYPE(av) == SVt_PVAV) {
4880 const bool localizing = PL_op->op_private & OPpLVAL_INTRO;
4881 bool can_preserve = FALSE;
4887 can_preserve = SvCANEXISTDELETE(av);
4890 if (lval && localizing) {
4893 for (svp = MARK + 1; svp <= SP; svp++) {
4894 const SSize_t elem = SvIV(*svp);
4898 if (max > AvMAX(av))
4902 while (++MARK <= SP) {
4904 SSize_t elem = SvIV(*MARK);
4905 bool preeminent = TRUE;
4907 if (localizing && can_preserve) {
4908 /* If we can determine whether the element exist,
4909 * Try to preserve the existenceness of a tied array
4910 * element by using EXISTS and DELETE if possible.
4911 * Fallback to FETCH and STORE otherwise. */
4912 preeminent = av_exists(av, elem);
4915 svp = av_fetch(av, elem, lval);
4918 DIE(aTHX_ PL_no_aelem, elem);
4921 save_aelem(av, elem, svp);
4923 SAVEADELETE(av, elem);
4926 *MARK = svp ? *svp : &PL_sv_undef;
4929 if (GIMME_V != G_ARRAY) {
4931 *++MARK = SP > ORIGMARK ? *SP : &PL_sv_undef;
4940 AV *const av = MUTABLE_AV(POPs);
4941 I32 lval = (PL_op->op_flags & OPf_MOD);
4942 SSize_t items = SP - MARK;
4944 if (PL_op->op_private & OPpMAYBE_LVSUB) {
4945 const I32 flags = is_lvalue_sub();
4947 if (!(flags & OPpENTERSUB_INARGS))
4948 /* diag_listed_as: Can't modify %s in %s */
4949 Perl_croak(aTHX_ "Can't modify index/value array slice in list assignment");
4956 *(MARK+items*2-1) = *(MARK+items);
4962 while (++MARK <= SP) {
4965 svp = av_fetch(av, SvIV(*MARK), lval);
4967 if (!svp || !*svp || *svp == &PL_sv_undef) {
4968 DIE(aTHX_ PL_no_aelem, SvIV(*MARK));
4970 *MARK = sv_mortalcopy(*MARK);
4972 *++MARK = svp ? *svp : &PL_sv_undef;
4974 if (GIMME_V != G_ARRAY) {
4975 MARK = SP - items*2;
4976 *++MARK = items > 0 ? *SP : &PL_sv_undef;
4986 AV *array = MUTABLE_AV(POPs);
4987 const U8 gimme = GIMME_V;
4988 IV *iterp = Perl_av_iter_p(aTHX_ array);
4989 const IV current = (*iterp)++;
4991 if (current > av_top_index(array)) {
4993 if (gimme == G_SCALAR)
5001 if (gimme == G_ARRAY) {
5002 SV **const element = av_fetch(array, current, 0);
5003 PUSHs(element ? *element : &PL_sv_undef);
5008 /* also used for: pp_avalues()*/
5012 AV *array = MUTABLE_AV(POPs);
5013 const U8 gimme = GIMME_V;
5015 *Perl_av_iter_p(aTHX_ array) = 0;
5017 if (gimme == G_SCALAR) {
5019 PUSHi(av_count(array));
5021 else if (gimme == G_ARRAY) {
5022 if (UNLIKELY(PL_op->op_private & OPpMAYBE_LVSUB)) {
5023 const I32 flags = is_lvalue_sub();
5024 if (flags && !(flags & OPpENTERSUB_INARGS))
5025 /* diag_listed_as: Can't modify %s in %s */
5027 "Can't modify keys on array in list assignment");
5030 IV n = av_top_index(array);
5035 if ( PL_op->op_type == OP_AKEYS
5036 || ( PL_op->op_type == OP_AVHVSWITCH
5037 && (PL_op->op_private & 3) + OP_AEACH == OP_AKEYS ))
5039 for (i = 0; i <= n; i++) {
5044 for (i = 0; i <= n; i++) {
5045 SV *const *const elem = Perl_av_fetch(aTHX_ array, i, 0);
5046 PUSHs(elem ? *elem : &PL_sv_undef);
5054 /* Associative arrays. */
5059 HV * hash = MUTABLE_HV(POPs);
5061 const U8 gimme = GIMME_V;
5063 entry = hv_iternext(hash);
5067 SV* const sv = hv_iterkeysv(entry);
5069 if (gimme == G_ARRAY) {
5071 val = hv_iterval(hash, entry);
5075 else if (gimme == G_SCALAR)
5082 S_do_delete_local(pTHX)
5085 const U8 gimme = GIMME_V;
5088 const bool sliced = !!(PL_op->op_private & OPpSLICE);
5089 SV **unsliced_keysv = sliced ? NULL : sp--;
5090 SV * const osv = POPs;
5091 SV **mark = sliced ? PL_stack_base + POPMARK : unsliced_keysv-1;
5093 const bool tied = SvRMAGICAL(osv)
5094 && mg_find((const SV *)osv, PERL_MAGIC_tied);
5095 const bool can_preserve = SvCANEXISTDELETE(osv);
5096 const U32 type = SvTYPE(osv);
5097 SV ** const end = sliced ? SP : unsliced_keysv;
5099 if (type == SVt_PVHV) { /* hash element */
5100 HV * const hv = MUTABLE_HV(osv);
5101 while (++MARK <= end) {
5102 SV * const keysv = *MARK;
5104 bool preeminent = TRUE;
5106 preeminent = hv_exists_ent(hv, keysv, 0);
5108 HE *he = hv_fetch_ent(hv, keysv, 1, 0);
5115 sv = hv_delete_ent(hv, keysv, 0, 0);
5117 SvREFCNT_inc_simple_void(sv); /* De-mortalize */
5120 if (!sv) DIE(aTHX_ PL_no_helem_sv, SVfARG(keysv));
5121 save_helem_flags(hv, keysv, &sv, SAVEf_KEEPOLDELEM);
5123 *MARK = sv_mortalcopy(sv);
5129 SAVEHDELETE(hv, keysv);
5130 *MARK = &PL_sv_undef;
5134 else if (type == SVt_PVAV) { /* array element */
5135 if (PL_op->op_flags & OPf_SPECIAL) {
5136 AV * const av = MUTABLE_AV(osv);
5137 while (++MARK <= end) {
5138 SSize_t idx = SvIV(*MARK);
5140 bool preeminent = TRUE;
5142 preeminent = av_exists(av, idx);
5144 SV **svp = av_fetch(av, idx, 1);
5151 sv = av_delete(av, idx, 0);
5153 SvREFCNT_inc_simple_void(sv); /* De-mortalize */
5156 save_aelem_flags(av, idx, &sv, SAVEf_KEEPOLDELEM);
5158 *MARK = sv_mortalcopy(sv);
5164 SAVEADELETE(av, idx);
5165 *MARK = &PL_sv_undef;
5170 DIE(aTHX_ "panic: avhv_delete no longer supported");
5173 DIE(aTHX_ "Not a HASH reference");
5175 if (gimme == G_VOID)
5177 else if (gimme == G_SCALAR) {
5182 *++MARK = &PL_sv_undef;
5186 else if (gimme != G_VOID)
5187 PUSHs(*unsliced_keysv);
5198 if (PL_op->op_private & OPpLVAL_INTRO)
5199 return do_delete_local();
5202 discard = (gimme == G_VOID) ? G_DISCARD : 0;
5204 if (PL_op->op_private & (OPpSLICE|OPpKVSLICE)) {
5206 HV * const hv = MUTABLE_HV(POPs);
5207 const U32 hvtype = SvTYPE(hv);
5209 if (PL_op->op_private & OPpKVSLICE) {
5210 SSize_t items = SP - MARK;
5214 *(MARK+items*2-1) = *(MARK+items);
5221 if (hvtype == SVt_PVHV) { /* hash element */
5222 while ((MARK += (1+skip)) <= SP) {
5223 SV * const sv = hv_delete_ent(hv, *(MARK-skip), discard, 0);
5224 *MARK = sv ? sv : &PL_sv_undef;
5227 else if (hvtype == SVt_PVAV) { /* array element */
5228 if (PL_op->op_flags & OPf_SPECIAL) {
5229 while ((MARK += (1+skip)) <= SP) {
5230 SV * const sv = av_delete(MUTABLE_AV(hv), SvIV(*(MARK-skip)), discard);
5231 *MARK = sv ? sv : &PL_sv_undef;
5236 DIE(aTHX_ "Not a HASH reference");
5239 else if (gimme == G_SCALAR) {
5244 *++MARK = &PL_sv_undef;
5250 HV * const hv = MUTABLE_HV(POPs);
5252 if (SvTYPE(hv) == SVt_PVHV)
5253 sv = hv_delete_ent(hv, keysv, discard, 0);
5254 else if (SvTYPE(hv) == SVt_PVAV) {
5255 if (PL_op->op_flags & OPf_SPECIAL)
5256 sv = av_delete(MUTABLE_AV(hv), SvIV(keysv), discard);
5258 DIE(aTHX_ "panic: avhv_delete no longer supported");
5261 DIE(aTHX_ "Not a HASH reference");
5276 if (UNLIKELY( PL_op->op_private & OPpEXISTS_SUB )) {
5278 SV * const sv = POPs;
5279 CV * const cv = sv_2cv(sv, &hv, &gv, 0);
5282 if (gv && isGV(gv) && GvCV(gv) && !GvCVGEN(gv))
5287 hv = MUTABLE_HV(POPs);
5288 if (LIKELY( SvTYPE(hv) == SVt_PVHV )) {
5289 if (hv_exists_ent(hv, tmpsv, 0))
5292 else if (SvTYPE(hv) == SVt_PVAV) {
5293 if (PL_op->op_flags & OPf_SPECIAL) { /* array element */
5294 if (av_exists(MUTABLE_AV(hv), SvIV(tmpsv)))
5299 DIE(aTHX_ "Not a HASH reference");
5306 dSP; dMARK; dORIGMARK;
5307 HV * const hv = MUTABLE_HV(POPs);
5308 const I32 lval = (PL_op->op_flags & OPf_MOD || LVRET);
5309 const bool localizing = PL_op->op_private & OPpLVAL_INTRO;
5310 bool can_preserve = FALSE;
5316 if (SvCANEXISTDELETE(hv))
5317 can_preserve = TRUE;
5320 while (++MARK <= SP) {
5321 SV * const keysv = *MARK;
5324 bool preeminent = TRUE;
5326 if (localizing && can_preserve) {
5327 /* If we can determine whether the element exist,
5328 * try to preserve the existenceness of a tied hash
5329 * element by using EXISTS and DELETE if possible.
5330 * Fallback to FETCH and STORE otherwise. */
5331 preeminent = hv_exists_ent(hv, keysv, 0);
5334 he = hv_fetch_ent(hv, keysv, lval, 0);
5335 svp = he ? &HeVAL(he) : NULL;
5338 if (!svp || !*svp || *svp == &PL_sv_undef) {
5339 DIE(aTHX_ PL_no_helem_sv, SVfARG(keysv));
5342 if (HvNAME_get(hv) && isGV_or_RVCV(*svp))
5343 save_gp(MUTABLE_GV(*svp), !(PL_op->op_flags & OPf_SPECIAL));
5344 else if (preeminent)
5345 save_helem_flags(hv, keysv, svp,
5346 (PL_op->op_flags & OPf_SPECIAL) ? 0 : SAVEf_SETMAGIC);
5348 SAVEHDELETE(hv, keysv);
5351 *MARK = svp && *svp ? *svp : &PL_sv_undef;
5353 if (GIMME_V != G_ARRAY) {
5355 *++MARK = SP > ORIGMARK ? *SP : &PL_sv_undef;
5364 HV * const hv = MUTABLE_HV(POPs);
5365 I32 lval = (PL_op->op_flags & OPf_MOD);
5366 SSize_t items = SP - MARK;
5368 if (PL_op->op_private & OPpMAYBE_LVSUB) {
5369 const I32 flags = is_lvalue_sub();
5371 if (!(flags & OPpENTERSUB_INARGS))
5372 /* diag_listed_as: Can't modify %s in %s */
5373 Perl_croak(aTHX_ "Can't modify key/value hash slice in %s assignment",
5374 GIMME_V == G_ARRAY ? "list" : "scalar");
5381 *(MARK+items*2-1) = *(MARK+items);
5387 while (++MARK <= SP) {
5388 SV * const keysv = *MARK;
5392 he = hv_fetch_ent(hv, keysv, lval, 0);
5393 svp = he ? &HeVAL(he) : NULL;
5396 if (!svp || !*svp || *svp == &PL_sv_undef) {
5397 DIE(aTHX_ PL_no_helem_sv, SVfARG(keysv));
5399 *MARK = sv_mortalcopy(*MARK);
5401 *++MARK = svp && *svp ? *svp : &PL_sv_undef;
5403 if (GIMME_V != G_ARRAY) {
5404 MARK = SP - items*2;
5405 *++MARK = items > 0 ? *SP : &PL_sv_undef;
5411 /* List operators. */
5415 I32 markidx = POPMARK;
5416 if (GIMME_V != G_ARRAY) {
5417 /* don't initialize mark here, EXTEND() may move the stack */
5420 EXTEND(SP, 1); /* in case no arguments, as in @empty */
5421 mark = PL_stack_base + markidx;
5423 *MARK = *SP; /* unwanted list, return last item */
5425 *MARK = &PL_sv_undef;
5435 SV ** const lastrelem = PL_stack_sp;
5436 SV ** const lastlelem = PL_stack_base + POPMARK;
5437 SV ** const firstlelem = PL_stack_base + POPMARK + 1;
5438 SV ** const firstrelem = lastlelem + 1;
5439 const U8 mod = PL_op->op_flags & OPf_MOD;
5441 const I32 max = lastrelem - lastlelem;
5444 if (GIMME_V != G_ARRAY) {
5445 if (lastlelem < firstlelem) {
5447 *firstlelem = &PL_sv_undef;
5450 I32 ix = SvIV(*lastlelem);
5453 if (ix < 0 || ix >= max)
5454 *firstlelem = &PL_sv_undef;
5456 *firstlelem = firstrelem[ix];
5463 SP = firstlelem - 1;
5467 for (lelem = firstlelem; lelem <= lastlelem; lelem++) {
5468 I32 ix = SvIV(*lelem);
5471 if (ix < 0 || ix >= max)
5472 *lelem = &PL_sv_undef;
5474 if (!(*lelem = firstrelem[ix]))
5475 *lelem = &PL_sv_undef;
5476 else if (mod && SvPADTMP(*lelem)) {
5477 *lelem = firstrelem[ix] = sv_mortalcopy(*lelem);
5488 const I32 items = SP - MARK;
5489 SV * const av = MUTABLE_SV(av_make(items, MARK+1));
5491 mXPUSHs((PL_op->op_flags & OPf_SPECIAL)
5492 ? newRV_noinc(av) : av);
5498 dSP; dMARK; dORIGMARK;
5499 HV* const hv = newHV();
5500 SV* const retval = sv_2mortal( PL_op->op_flags & OPf_SPECIAL
5501 ? newRV_noinc(MUTABLE_SV(hv))
5506 (MARK++, SvGMAGICAL(*MARK) ? sv_mortalcopy(*MARK) : *MARK);
5513 sv_setsv_nomg(val, *MARK);
5517 Perl_ck_warner(aTHX_ packWARN(WARN_MISC), "Odd number of elements in anonymous hash");
5520 (void)hv_store_ent(hv,key,val,0);
5529 dSP; dMARK; dORIGMARK;
5530 int num_args = (SP - MARK);
5531 AV *ary = MUTABLE_AV(*++MARK);
5540 const MAGIC * const mg = SvTIED_mg((const SV *)ary, PERL_MAGIC_tied);
5543 return Perl_tied_method(aTHX_ SV_CONST(SPLICE), mark - 1, MUTABLE_SV(ary), mg,
5544 GIMME_V | TIED_METHOD_ARGUMENTS_ON_STACK,
5548 if (SvREADONLY(ary))
5549 Perl_croak_no_modify();
5554 offset = i = SvIV(*MARK);
5556 offset += AvFILLp(ary) + 1;
5558 DIE(aTHX_ PL_no_aelem, i);
5560 length = SvIVx(*MARK++);
5562 length += AvFILLp(ary) - offset + 1;
5568 length = AvMAX(ary) + 1; /* close enough to infinity */
5572 length = AvMAX(ary) + 1;
5574 if (offset > AvFILLp(ary) + 1) {
5576 Perl_ck_warner(aTHX_ packWARN(WARN_MISC), "splice() offset past end of array" );
5577 offset = AvFILLp(ary) + 1;
5579 after = AvFILLp(ary) + 1 - (offset + length);
5580 if (after < 0) { /* not that much array */
5581 length += after; /* offset+length now in array */
5587 /* At this point, MARK .. SP-1 is our new LIST */
5590 diff = newlen - length;
5591 if (newlen && !AvREAL(ary) && AvREIFY(ary))
5594 /* make new elements SVs now: avoid problems if they're from the array */
5595 for (dst = MARK, i = newlen; i; i--) {
5596 SV * const h = *dst;
5597 *dst++ = newSVsv(h);
5600 if (diff < 0) { /* shrinking the area */
5601 SV **tmparyval = NULL;
5603 Newx(tmparyval, newlen, SV*); /* so remember insertion */
5604 Copy(MARK, tmparyval, newlen, SV*);
5607 MARK = ORIGMARK + 1;
5608 if (GIMME_V == G_ARRAY) { /* copy return vals to stack */
5609 const bool real = cBOOL(AvREAL(ary));
5610 MEXTEND(MARK, length);
5612 EXTEND_MORTAL(length);
5613 for (i = 0, dst = MARK; i < length; i++) {
5614 if ((*dst = AvARRAY(ary)[i+offset])) {
5616 sv_2mortal(*dst); /* free them eventually */
5619 *dst = &PL_sv_undef;
5625 *MARK = AvARRAY(ary)[offset+length-1];
5628 for (i = length - 1, dst = &AvARRAY(ary)[offset]; i > 0; i--)
5629 SvREFCNT_dec(*dst++); /* free them now */
5632 *MARK = &PL_sv_undef;
5634 AvFILLp(ary) += diff;
5636 /* pull up or down? */
5638 if (offset < after) { /* easier to pull up */
5639 if (offset) { /* esp. if nothing to pull */
5640 src = &AvARRAY(ary)[offset-1];
5641 dst = src - diff; /* diff is negative */
5642 for (i = offset; i > 0; i--) /* can't trust Copy */
5646 AvARRAY(ary) = AvARRAY(ary) - diff; /* diff is negative */
5650 if (after) { /* anything to pull down? */
5651 src = AvARRAY(ary) + offset + length;
5652 dst = src + diff; /* diff is negative */
5653 Move(src, dst, after, SV*);
5655 dst = &AvARRAY(ary)[AvFILLp(ary)+1];
5656 /* avoid later double free */
5663 Copy( tmparyval, AvARRAY(ary) + offset, newlen, SV* );
5664 Safefree(tmparyval);
5667 else { /* no, expanding (or same) */
5668 SV** tmparyval = NULL;
5670 Newx(tmparyval, length, SV*); /* so remember deletion */
5671 Copy(AvARRAY(ary)+offset, tmparyval, length, SV*);
5674 if (diff > 0) { /* expanding */
5675 /* push up or down? */
5676 if (offset < after && diff <= AvARRAY(ary) - AvALLOC(ary)) {
5680 Move(src, dst, offset, SV*);
5682 AvARRAY(ary) = AvARRAY(ary) - diff;/* diff is positive */
5684 AvFILLp(ary) += diff;
5687 if (AvFILLp(ary) + diff >= AvMAX(ary)) /* oh, well */
5688 av_extend(ary, AvFILLp(ary) + diff);
5689 AvFILLp(ary) += diff;
5692 dst = AvARRAY(ary) + AvFILLp(ary);
5694 for (i = after; i; i--) {
5702 Copy( MARK, AvARRAY(ary) + offset, newlen, SV* );
5705 MARK = ORIGMARK + 1;
5706 if (GIMME_V == G_ARRAY) { /* copy return vals to stack */
5708 const bool real = cBOOL(AvREAL(ary));
5710 EXTEND_MORTAL(length);
5711 for (i = 0, dst = MARK; i < length; i++) {
5712 if ((*dst = tmparyval[i])) {
5714 sv_2mortal(*dst); /* free them eventually */
5716 else *dst = &PL_sv_undef;
5722 else if (length--) {
5723 *MARK = tmparyval[length];
5726 while (length-- > 0)
5727 SvREFCNT_dec(tmparyval[length]);
5730 *MARK = &PL_sv_undef;
5733 *MARK = &PL_sv_undef;
5734 Safefree(tmparyval);
5738 mg_set(MUTABLE_SV(ary));
5746 dSP; dMARK; dORIGMARK; dTARGET;
5747 AV * const ary = MUTABLE_AV(*++MARK);
5748 const MAGIC * const mg = SvTIED_mg((const SV *)ary, PERL_MAGIC_tied);
5751 *MARK-- = SvTIED_obj(MUTABLE_SV(ary), mg);
5754 ENTER_with_name("call_PUSH");
5755 call_sv(SV_CONST(PUSH),G_SCALAR|G_DISCARD|G_METHOD_NAMED);
5756 LEAVE_with_name("call_PUSH");
5757 /* SPAGAIN; not needed: SP is assigned to immediately below */
5760 /* PL_delaymagic is restored by JUMPENV_POP on dieing, so we
5761 * only need to save locally, not on the save stack */
5762 U16 old_delaymagic = PL_delaymagic;
5764 if (SvREADONLY(ary) && MARK < SP) Perl_croak_no_modify();
5765 PL_delaymagic = DM_DELAY;
5766 for (++MARK; MARK <= SP; MARK++) {
5768 if (*MARK) SvGETMAGIC(*MARK);
5771 sv_setsv_nomg(sv, *MARK);
5772 av_store(ary, AvFILLp(ary)+1, sv);
5774 if (PL_delaymagic & DM_ARRAY_ISA)
5775 mg_set(MUTABLE_SV(ary));
5776 PL_delaymagic = old_delaymagic;
5779 if (OP_GIMME(PL_op, 0) != G_VOID) {
5780 PUSHi( AvFILL(ary) + 1 );
5785 /* also used for: pp_pop()*/
5789 AV * const av = PL_op->op_flags & OPf_SPECIAL
5790 ? MUTABLE_AV(GvAVn(PL_defgv)) : MUTABLE_AV(POPs);
5791 SV * const sv = PL_op->op_type == OP_SHIFT ? av_shift(av) : av_pop(av);
5795 (void)sv_2mortal(sv);
5802 dSP; dMARK; dORIGMARK; dTARGET;
5803 AV *ary = MUTABLE_AV(*++MARK);
5804 const MAGIC * const mg = SvTIED_mg((const SV *)ary, PERL_MAGIC_tied);
5807 *MARK-- = SvTIED_obj(MUTABLE_SV(ary), mg);
5810 ENTER_with_name("call_UNSHIFT");
5811 call_sv(SV_CONST(UNSHIFT),G_SCALAR|G_DISCARD|G_METHOD_NAMED);
5812 LEAVE_with_name("call_UNSHIFT");
5813 /* SPAGAIN; not needed: SP is assigned to immediately below */
5816 /* PL_delaymagic is restored by JUMPENV_POP on dieing, so we
5817 * only need to save locally, not on the save stack */
5818 U16 old_delaymagic = PL_delaymagic;
5821 av_unshift(ary, SP - MARK);
5822 PL_delaymagic = DM_DELAY;
5824 SV * const sv = newSVsv(*++MARK);
5825 (void)av_store(ary, i++, sv);
5827 if (PL_delaymagic & DM_ARRAY_ISA)
5828 mg_set(MUTABLE_SV(ary));
5829 PL_delaymagic = old_delaymagic;
5832 if (OP_GIMME(PL_op, 0) != G_VOID) {
5833 PUSHi( AvFILL(ary) + 1 );
5842 if (GIMME_V == G_ARRAY) {
5843 if (PL_op->op_private & OPpREVERSE_INPLACE) {
5847 assert( MARK+1 == SP && *SP && SvTYPE(*SP) == SVt_PVAV);
5848 (void)POPMARK; /* remove mark associated with ex-OP_AASSIGN */
5849 av = MUTABLE_AV((*SP));
5850 /* In-place reversing only happens in void context for the array
5851 * assignment. We don't need to push anything on the stack. */
5854 if (SvMAGICAL(av)) {
5856 SV *tmp = sv_newmortal();
5857 /* For SvCANEXISTDELETE */
5860 bool can_preserve = SvCANEXISTDELETE(av);
5862 for (i = 0, j = av_top_index(av); i < j; ++i, --j) {
5866 if (!av_exists(av, i)) {
5867 if (av_exists(av, j)) {
5868 SV *sv = av_delete(av, j, 0);
5869 begin = *av_fetch(av, i, TRUE);
5870 sv_setsv_mg(begin, sv);
5874 else if (!av_exists(av, j)) {
5875 SV *sv = av_delete(av, i, 0);
5876 end = *av_fetch(av, j, TRUE);
5877 sv_setsv_mg(end, sv);
5882 begin = *av_fetch(av, i, TRUE);
5883 end = *av_fetch(av, j, TRUE);
5884 sv_setsv(tmp, begin);
5885 sv_setsv_mg(begin, end);
5886 sv_setsv_mg(end, tmp);
5890 SV **begin = AvARRAY(av);
5893 SV **end = begin + AvFILLp(av);
5895 while (begin < end) {
5896 SV * const tmp = *begin;
5907 SV * const tmp = *MARK;
5911 /* safe as long as stack cannot get extended in the above */
5920 SvUTF8_off(TARG); /* decontaminate */
5921 if (SP - MARK > 1) {
5922 do_join(TARG, &PL_sv_no, MARK, SP);
5925 } else if (SP > MARK) {
5926 sv_setsv(TARG, *SP);
5929 sv_setsv(TARG, DEFSV);
5932 SvSETMAGIC(TARG); /* remove any utf8 length magic */
5934 up = SvPV_force(TARG, len);
5937 if (DO_UTF8(TARG)) { /* first reverse each character */
5938 U8* s = (U8*)SvPVX(TARG);
5939 const U8* send = (U8*)(s + len);
5941 if (UTF8_IS_INVARIANT(*s)) {
5946 if (!utf8_to_uvchr_buf(s, send, 0))
5950 down = (char*)(s - 1);
5951 /* reverse this character */
5953 const char tmp = *up;
5961 down = SvPVX(TARG) + len - 1;
5963 const char tmp = *up;
5967 (void)SvPOK_only_UTF8(TARG);
5976 AV *ary = ( (PL_op->op_private & OPpSPLIT_ASSIGN) /* @a = split */
5977 && (PL_op->op_flags & OPf_STACKED)) /* @{expr} = split */
5978 ? (AV *)POPs : NULL;
5979 IV limit = POPi; /* note, negative is forever */
5980 SV * const sv = POPs;
5982 const char *s = SvPV_const(sv, len);
5983 const bool do_utf8 = DO_UTF8(sv);
5984 const bool in_uni_8_bit = IN_UNI_8_BIT;
5985 const char *strend = s + len;
5986 PMOP *pm = cPMOPx(PL_op);
5991 const STRLEN slen = do_utf8
5992 ? utf8_length((U8*)s, (U8*)strend)
5993 : (STRLEN)(strend - s);
5994 SSize_t maxiters = slen + 10;
5995 I32 trailing_empty = 0;
5997 const IV origlimit = limit;
6000 const U8 gimme = GIMME_V;
6002 I32 oldsave = PL_savestack_ix;
6003 U32 make_mortal = SVs_TEMP;
6009 TAINT_IF(get_regex_charset(RX_EXTFLAGS(rx)) == REGEX_LOCALE_CHARSET &&
6010 (RX_EXTFLAGS(rx) & (RXf_WHITE | RXf_SKIPWHITE)));
6012 /* handle @ary = split(...) optimisation */
6013 if (PL_op->op_private & OPpSPLIT_ASSIGN) {
6014 if (!(PL_op->op_flags & OPf_STACKED)) {
6015 if (PL_op->op_private & OPpSPLIT_LEX) {
6016 if (PL_op->op_private & OPpLVAL_INTRO)
6017 SAVECLEARSV(PAD_SVl(pm->op_pmreplrootu.op_pmtargetoff));
6018 ary = (AV *)PAD_SVl(pm->op_pmreplrootu.op_pmtargetoff);
6023 MUTABLE_GV(PAD_SVl(pm->op_pmreplrootu.op_pmtargetoff));
6025 pm->op_pmreplrootu.op_pmtargetgv;
6027 if (PL_op->op_private & OPpLVAL_INTRO)
6032 /* skip anything pushed by OPpLVAL_INTRO above */
6033 oldsave = PL_savestack_ix;
6039 (void)sv_2mortal(SvREFCNT_inc_simple_NN(sv));
6042 if ((mg = SvTIED_mg((const SV *)ary, PERL_MAGIC_tied))) {
6044 XPUSHs(SvTIED_obj(MUTABLE_SV(ary), mg));
6051 /* Note: the above av_clear(ary) above should */
6052 /* have set AvFILLp(ary) = -1, so this Zero() */
6053 /* may well be superfluous. */
6055 /* don't free mere refs */
6056 Zero(AvARRAY(ary), AvFILLp(ary) + 1, SV*);
6058 /* temporarily switch stacks */
6059 SAVESWITCHSTACK(PL_curstack, ary);
6064 base = SP - PL_stack_base;
6066 if (RX_EXTFLAGS(rx) & RXf_SKIPWHITE) {
6068 while (s < strend && isSPACE_utf8_safe(s, strend))
6071 else if (get_regex_charset(RX_EXTFLAGS(rx)) == REGEX_LOCALE_CHARSET) {
6072 while (s < strend && isSPACE_LC(*s))
6075 else if (in_uni_8_bit) {
6076 while (s < strend && isSPACE_L1(*s))
6080 while (s < strend && isSPACE(*s))
6084 if (RX_EXTFLAGS(rx) & RXf_PMf_MULTILINE) {
6088 gimme_scalar = gimme == G_SCALAR && !ary;
6091 limit = maxiters + 2;
6092 if (RX_EXTFLAGS(rx) & RXf_WHITE) {
6095 /* this one uses 'm' and is a negative test */
6097 while (m < strend && ! isSPACE_utf8_safe(m, strend) ) {
6098 const int t = UTF8SKIP(m);
6099 /* isSPACE_utf8_safe returns FALSE for malform utf8 */
6106 else if (get_regex_charset(RX_EXTFLAGS(rx)) == REGEX_LOCALE_CHARSET)
6108 while (m < strend && !isSPACE_LC(*m))
6111 else if (in_uni_8_bit) {
6112 while (m < strend && !isSPACE_L1(*m))
6115 while (m < strend && !isSPACE(*m))
6128 dstr = newSVpvn_flags(s, m-s,
6129 (do_utf8 ? SVf_UTF8 : 0) | make_mortal);
6133 /* skip the whitespace found last */
6135 s = m + UTF8SKIP(m);
6139 /* this one uses 's' and is a positive test */
6141 while (s < strend && isSPACE_utf8_safe(s, strend) )
6144 else if (get_regex_charset(RX_EXTFLAGS(rx)) == REGEX_LOCALE_CHARSET)
6146 while (s < strend && isSPACE_LC(*s))
6149 else if (in_uni_8_bit) {
6150 while (s < strend && isSPACE_L1(*s))
6153 while (s < strend && isSPACE(*s))
6158 else if (RX_EXTFLAGS(rx) & RXf_START_ONLY) {
6160 for (m = s; m < strend && *m != '\n'; m++)
6173 dstr = newSVpvn_flags(s, m-s,
6174 (do_utf8 ? SVf_UTF8 : 0) | make_mortal);
6180 else if (RX_EXTFLAGS(rx) & RXf_NULL && !(s >= strend)) {
6181 /* This case boils down to deciding which is the smaller of:
6182 * limit - effectively a number of characters
6183 * slen - which already contains the number of characters in s
6185 * The resulting number is the number of iters (for gimme_scalar)
6186 * or the number of SVs to create (!gimme_scalar). */
6188 /* setting it to -1 will trigger a panic in EXTEND() */
6189 const SSize_t sslen = slen > SSize_t_MAX ? -1 : (SSize_t)slen;
6190 const IV items = limit - 1;
6191 if (sslen < items || items < 0) {
6194 /* Note: The same result is returned if the following block
6195 * is removed, because of the "keep field after final delim?"
6196 * adjustment, but having the following makes the "correct"
6197 * behaviour more apparent. */
6205 if (!gimme_scalar) {
6207 Pre-extend the stack, either the number of bytes or
6208 characters in the string or a limited amount, triggered by:
6209 my ($x, $y) = split //, $str;
6218 dstr = newSVpvn_flags(m, s-m, SVf_UTF8 | make_mortal);
6223 dstr = newSVpvn_flags(s, 1, make_mortal);
6230 else if (do_utf8 == (RX_UTF8(rx) != 0) &&
6231 (RX_EXTFLAGS(rx) & RXf_USE_INTUIT) && !RX_NPARENS(rx)
6232 && (RX_EXTFLAGS(rx) & RXf_CHECK_ALL)
6233 && !(RX_EXTFLAGS(rx) & RXf_IS_ANCHORED)) {
6234 const int tail = (RX_EXTFLAGS(rx) & RXf_INTUIT_TAIL);
6235 SV * const csv = CALLREG_INTUIT_STRING(rx);
6237 len = RX_MINLENRET(rx);
6238 if (len == 1 && !RX_UTF8(rx) && !tail) {
6239 const char c = *SvPV_nolen_const(csv);
6241 for (m = s; m < strend && *m != c; m++)
6252 dstr = newSVpvn_flags(s, m-s,
6253 (do_utf8 ? SVf_UTF8 : 0) | make_mortal);
6256 /* The rx->minlen is in characters but we want to step
6257 * s ahead by bytes. */
6259 s = (char*)utf8_hop_forward((U8*) m, len, (U8*) strend);
6261 s = m + len; /* Fake \n at the end */
6265 while (s < strend && --limit &&
6266 (m = fbm_instr((unsigned char*)s, (unsigned char*)strend,
6267 csv, multiline ? FBMrf_MULTILINE : 0)) )
6276 dstr = newSVpvn_flags(s, m-s,
6277 (do_utf8 ? SVf_UTF8 : 0) | make_mortal);
6280 /* The rx->minlen is in characters but we want to step
6281 * s ahead by bytes. */
6283 s = (char*)utf8_hop_forward((U8*)m, len, (U8 *) strend);
6285 s = m + len; /* Fake \n at the end */
6290 maxiters += slen * RX_NPARENS(rx);
6291 while (s < strend && --limit)
6295 rex_return = CALLREGEXEC(rx, (char*)s, (char*)strend, (char*)orig, 1,
6298 if (rex_return == 0)
6300 TAINT_IF(RX_MATCH_TAINTED(rx));
6301 /* we never pass the REXEC_COPY_STR flag, so it should
6302 * never get copied */
6303 assert(!RX_MATCH_COPIED(rx));
6304 m = RX_OFFS(rx)[0].start + orig;
6313 dstr = newSVpvn_flags(s, m-s,
6314 (do_utf8 ? SVf_UTF8 : 0) | make_mortal);
6317 if (RX_NPARENS(rx)) {
6319 for (i = 1; i <= (I32)RX_NPARENS(rx); i++) {
6320 s = RX_OFFS(rx)[i].start + orig;
6321 m = RX_OFFS(rx)[i].end + orig;
6323 /* japhy (07/27/01) -- the (m && s) test doesn't catch
6324 parens that didn't match -- they should be set to
6325 undef, not the empty string */
6333 if (m >= orig && s >= orig) {
6334 dstr = newSVpvn_flags(s, m-s,
6335 (do_utf8 ? SVf_UTF8 : 0)
6339 dstr = &PL_sv_undef; /* undef, not "" */
6345 s = RX_OFFS(rx)[0].end + orig;
6349 if (!gimme_scalar) {
6350 iters = (SP - PL_stack_base) - base;
6352 if (iters > maxiters)
6353 DIE(aTHX_ "Split loop");
6355 /* keep field after final delim? */
6356 if (s < strend || (iters && origlimit)) {
6357 if (!gimme_scalar) {
6358 const STRLEN l = strend - s;
6359 dstr = newSVpvn_flags(s, l, (do_utf8 ? SVf_UTF8 : 0) | make_mortal);
6364 else if (!origlimit) {
6366 iters -= trailing_empty;
6368 while (iters > 0 && (!TOPs || !SvANY(TOPs) || SvCUR(TOPs) == 0)) {
6369 if (TOPs && !make_mortal)
6378 LEAVE_SCOPE(oldsave); /* may undo an earlier SWITCHSTACK */
6382 if (SvSMAGICAL(ary)) {
6384 mg_set(MUTABLE_SV(ary));
6387 if (gimme == G_ARRAY) {
6389 Copy(AvARRAY(ary), SP + 1, iters, SV*);
6396 ENTER_with_name("call_PUSH");
6397 call_sv(SV_CONST(PUSH),G_SCALAR|G_DISCARD|G_METHOD_NAMED);
6398 LEAVE_with_name("call_PUSH");
6400 if (gimme == G_ARRAY) {
6402 /* EXTEND should not be needed - we just popped them */
6404 for (i=0; i < iters; i++) {
6405 SV **svp = av_fetch(ary, i, FALSE);
6406 PUSHs((svp) ? *svp : &PL_sv_undef);
6413 if (gimme == G_ARRAY)
6425 SV *const sv = PAD_SVl(PL_op->op_targ);
6427 if (SvPADSTALE(sv)) {
6430 RETURNOP(cLOGOP->op_other);
6432 RETURNOP(cLOGOP->op_next);
6441 if (SvTYPE(retsv) == SVt_PVAV || SvTYPE(retsv) == SVt_PVHV
6442 || SvTYPE(retsv) == SVt_PVCV) {
6443 retsv = refto(retsv);
6450 /* used for: pp_padany(), pp_custom(); plus any system ops
6451 * that aren't implemented on a particular platform */
6453 PP(unimplemented_op)
6455 const Optype op_type = PL_op->op_type;
6456 /* Using OP_NAME() isn't going to be helpful here. Firstly, it doesn't cope
6457 with out of range op numbers - it only "special" cases op_custom.
6458 Secondly, as the three ops we "panic" on are padmy, mapstart and custom,
6459 if we get here for a custom op then that means that the custom op didn't
6460 have an implementation. Given that OP_NAME() looks up the custom op
6461 by its op_ppaddr, likely it will return NULL, unless someone (unhelpfully)
6462 registers &Perl_unimplemented_op as the address of their custom op.
6463 NULL doesn't generate a useful error message. "custom" does. */
6464 const char *const name = op_type >= OP_max
6465 ? "[out of range]" : PL_op_name[op_type];
6466 if(OP_IS_SOCKET(op_type))
6467 DIE(aTHX_ PL_no_sock_func, name);
6468 DIE(aTHX_ "panic: unimplemented op %s (#%d) called", name, op_type);
6472 S_maybe_unwind_defav(pTHX)
6474 if (CX_CUR()->cx_type & CXp_HASARGS) {
6475 PERL_CONTEXT *cx = CX_CUR();
6477 assert(CxHASARGS(cx));
6479 cx->cx_type &= ~CXp_HASARGS;
6483 /* For sorting out arguments passed to a &CORE:: subroutine */
6487 int opnum = SvIOK(cSVOP_sv) ? (int)SvUV(cSVOP_sv) : 0;
6488 int defgv = PL_opargs[opnum] & OA_DEFGV ||opnum==OP_GLOB, whicharg = 0;
6489 AV * const at_ = GvAV(PL_defgv);
6490 SV **svp = at_ ? AvARRAY(at_) : NULL;
6491 I32 minargs = 0, maxargs = 0, numargs = at_ ? AvFILLp(at_)+1 : 0;
6492 I32 oa = opnum ? PL_opargs[opnum] >> OASHIFT : 0;
6493 bool seen_question = 0;
6494 const char *err = NULL;
6495 const bool pushmark = PL_op->op_private & OPpCOREARGS_PUSHMARK;
6497 /* Count how many args there are first, to get some idea how far to
6498 extend the stack. */
6500 if ((oa & 7) == OA_LIST) { maxargs = I32_MAX; break; }
6502 if (oa & OA_OPTIONAL) seen_question = 1;
6503 if (!seen_question) minargs++;
6507 if(numargs < minargs) err = "Not enough";
6508 else if(numargs > maxargs) err = "Too many";
6510 /* diag_listed_as: Too many arguments for %s */
6512 "%s arguments for %s", err,
6513 opnum ? PL_op_desc[opnum] : SvPV_nolen_const(cSVOP_sv)
6516 /* Reset the stack pointer. Without this, we end up returning our own
6517 arguments in list context, in addition to the values we are supposed
6518 to return. nextstate usually does this on sub entry, but we need
6519 to run the next op with the caller's hints, so we cannot have a
6521 SP = PL_stack_base + CX_CUR()->blk_oldsp;
6523 if(!maxargs) RETURN;
6525 /* We do this here, rather than with a separate pushmark op, as it has
6526 to come in between two things this function does (stack reset and
6527 arg pushing). This seems the easiest way to do it. */
6530 (void)Perl_pp_pushmark(aTHX);
6533 EXTEND(SP, maxargs == I32_MAX ? numargs : maxargs);
6534 PUTBACK; /* The code below can die in various places. */
6536 oa = PL_opargs[opnum] >> OASHIFT;
6537 for (; oa&&(numargs||!pushmark); (void)(numargs&&(++svp,--numargs))) {
6542 if (!numargs && defgv && whicharg == minargs + 1) {
6545 else PUSHs(numargs ? svp && *svp ? *svp : &PL_sv_undef : NULL);
6549 PUSHs(svp && *svp ? *svp : &PL_sv_undef);
6556 if (CvUNIQUE(find_runcv_where(FIND_RUNCV_level_eq,1,NULL)))
6559 S_maybe_unwind_defav(aTHX);
6562 PUSHs((SV *)GvAVn(gv));
6565 if (!svp || !*svp || !SvROK(*svp)
6566 || SvTYPE(SvRV(*svp)) != SVt_PVAV)
6568 /* diag_listed_as: Type of arg %d to &CORE::%s must be %s*/
6569 "Type of arg %d to &CORE::%s must be array reference",
6570 whicharg, PL_op_desc[opnum]
6575 if (!svp || !*svp || !SvROK(*svp)
6576 || ( SvTYPE(SvRV(*svp)) != SVt_PVHV
6577 && ( opnum == OP_DBMCLOSE || opnum == OP_DBMOPEN
6578 || SvTYPE(SvRV(*svp)) != SVt_PVAV )))
6580 /* diag_listed_as: Type of arg %d to &CORE::%s must be %s*/
6581 "Type of arg %d to &CORE::%s must be hash%s reference",
6582 whicharg, PL_op_desc[opnum],
6583 opnum == OP_DBMCLOSE || opnum == OP_DBMOPEN
6590 if (!numargs) PUSHs(NULL);
6591 else if(svp && *svp && SvROK(*svp) && isGV_with_GP(SvRV(*svp)))
6592 /* no magic here, as the prototype will have added an extra
6593 refgen and we just want what was there before that */
6596 const bool constr = PL_op->op_private & whicharg;
6598 svp && *svp ? *svp : &PL_sv_undef,
6599 constr, cBOOL(CopHINTS_get(PL_curcop) & HINT_STRICT_REFS),
6605 if (!numargs) goto try_defsv;
6607 const bool wantscalar =
6608 PL_op->op_private & OPpCOREARGS_SCALARMOD;
6609 if (!svp || !*svp || !SvROK(*svp)
6610 /* We have to permit globrefs even for the \$ proto, as
6611 *foo is indistinguishable from ${\*foo}, and the proto-
6612 type permits the latter. */
6613 || SvTYPE(SvRV(*svp)) > (
6614 wantscalar ? SVt_PVLV
6615 : opnum == OP_LOCK || opnum == OP_UNDEF
6621 "Type of arg %d to &CORE::%s must be %s",
6622 whicharg, PL_op_name[opnum],
6624 ? "scalar reference"
6625 : opnum == OP_LOCK || opnum == OP_UNDEF
6626 ? "reference to one of [$@%&*]"
6627 : "reference to one of [$@%*]"
6630 if (opnum == OP_UNDEF && SvRV(*svp) == (SV *)PL_defgv) {
6631 /* Undo @_ localisation, so that sub exit does not undo
6632 part of our undeffing. */
6633 S_maybe_unwind_defav(aTHX);
6638 DIE(aTHX_ "panic: unknown OA_*: %x", (unsigned)(oa&7));
6646 /* Implement CORE::keys(),values(),each().
6648 * We won't know until run-time whether the arg is an array or hash,
6651 * pp_keys/pp_values/pp_each
6653 * pp_akeys/pp_avalues/pp_aeach
6655 * as appropriate (or whatever pp function actually implements the OP_FOO
6656 * functionality for each FOO).
6663 (SvTYPE(TOPs) == SVt_PVAV ? OP_AEACH : OP_EACH)
6664 + (PL_op->op_private & OPpAVHVSWITCH_MASK)
6672 if (PL_op->op_private & OPpOFFBYONE) {
6673 cv = find_runcv_where(FIND_RUNCV_level_eq, 1, NULL);
6675 else cv = find_runcv(NULL);
6676 XPUSHs(CvEVAL(cv) ? &PL_sv_undef : sv_2mortal(newRV((SV *)cv)));
6681 S_localise_aelem_lval(pTHX_ AV * const av, SV * const keysv,
6682 const bool can_preserve)
6684 const SSize_t ix = SvIV(keysv);
6685 if (can_preserve ? av_exists(av, ix) : TRUE) {
6686 SV ** const svp = av_fetch(av, ix, 1);
6688 Perl_croak(aTHX_ PL_no_aelem, ix);
6689 save_aelem(av, ix, svp);
6692 SAVEADELETE(av, ix);
6696 S_localise_helem_lval(pTHX_ HV * const hv, SV * const keysv,
6697 const bool can_preserve)
6699 if (can_preserve ? hv_exists_ent(hv, keysv, 0) : TRUE) {
6700 HE * const he = hv_fetch_ent(hv, keysv, 1, 0);
6701 SV ** const svp = he ? &HeVAL(he) : NULL;
6703 Perl_croak(aTHX_ PL_no_helem_sv, SVfARG(keysv));
6704 save_helem_flags(hv, keysv, svp, 0);
6707 SAVEHDELETE(hv, keysv);
6711 S_localise_gv_slot(pTHX_ GV *gv, U8 type)
6713 if (type == OPpLVREF_SV) {
6714 save_pushptrptr(gv, SvREFCNT_inc_simple(GvSV(gv)), SAVEt_GVSV);
6717 else if (type == OPpLVREF_AV)
6718 /* XXX Inefficient, as it creates a new AV, which we are
6719 about to clobber. */
6722 assert(type == OPpLVREF_HV);
6723 /* XXX Likewise inefficient. */
6732 SV * const key = PL_op->op_private & OPpLVREF_ELEM ? POPs : NULL;
6733 SV * const left = PL_op->op_flags & OPf_STACKED ? POPs : NULL;
6735 const char *bad = NULL;
6736 const U8 type = PL_op->op_private & OPpLVREF_TYPE;
6737 if (!SvROK(sv)) DIE(aTHX_ "Assigned value is not a reference");
6740 if (SvTYPE(SvRV(sv)) > SVt_PVLV)
6744 if (SvTYPE(SvRV(sv)) != SVt_PVAV)
6748 if (SvTYPE(SvRV(sv)) != SVt_PVHV)
6752 if (SvTYPE(SvRV(sv)) != SVt_PVCV)
6756 /* diag_listed_as: Assigned value is not %s reference */
6757 DIE(aTHX_ "Assigned value is not a%s reference", bad);
6761 switch (left ? SvTYPE(left) : 0) {
6764 SV * const old = PAD_SV(ARGTARG);
6765 PAD_SETSV(ARGTARG, SvREFCNT_inc_NN(SvRV(sv)));
6767 if ((PL_op->op_private & (OPpLVAL_INTRO|OPpPAD_STATE))
6769 SAVECLEARSV(PAD_SVl(ARGTARG));
6773 if (PL_op->op_private & OPpLVAL_INTRO) {
6774 S_localise_gv_slot(aTHX_ (GV *)left, type);
6776 gv_setref(left, sv);
6781 if (UNLIKELY(PL_op->op_private & OPpLVAL_INTRO)) {
6782 S_localise_aelem_lval(aTHX_ (AV *)left, key,
6783 SvCANEXISTDELETE(left));
6785 av_store((AV *)left, SvIV(key), SvREFCNT_inc_simple_NN(SvRV(sv)));
6788 if (UNLIKELY(PL_op->op_private & OPpLVAL_INTRO)) {
6790 S_localise_helem_lval(aTHX_ (HV *)left, key,
6791 SvCANEXISTDELETE(left));
6793 (void)hv_store_ent((HV *)left, key, SvREFCNT_inc_simple_NN(SvRV(sv)), 0);
6795 if (PL_op->op_flags & OPf_MOD)
6796 SETs(sv_2mortal(newSVsv(sv)));
6797 /* XXX else can weak references go stale before they are read, e.g.,
6806 SV * const ret = sv_2mortal(newSV_type(SVt_PVMG));
6807 SV * const elem = PL_op->op_private & OPpLVREF_ELEM ? POPs : NULL;
6808 SV * const arg = PL_op->op_flags & OPf_STACKED ? POPs : NULL;
6809 MAGIC * const mg = sv_magicext(ret, arg, PERL_MAGIC_lvref,
6810 &PL_vtbl_lvref, (char *)elem,
6811 elem ? HEf_SVKEY : (I32)ARGTARG);
6812 mg->mg_private = PL_op->op_private;
6813 if (PL_op->op_private & OPpLVREF_ITER)
6814 mg->mg_flags |= MGf_PERSIST;
6815 if (UNLIKELY(PL_op->op_private & OPpLVAL_INTRO)) {
6821 const bool can_preserve = SvCANEXISTDELETE(arg);
6822 if (SvTYPE(arg) == SVt_PVAV)
6823 S_localise_aelem_lval(aTHX_ (AV *)arg, elem, can_preserve);
6825 S_localise_helem_lval(aTHX_ (HV *)arg, elem, can_preserve);
6829 S_localise_gv_slot(aTHX_ (GV *)arg,
6830 PL_op->op_private & OPpLVREF_TYPE);
6832 else if (!(PL_op->op_private & OPpPAD_STATE))
6833 SAVECLEARSV(PAD_SVl(ARGTARG));
6842 AV * const av = (AV *)POPs;
6843 const bool localizing = PL_op->op_private & OPpLVAL_INTRO;
6844 bool can_preserve = FALSE;
6846 if (UNLIKELY(localizing)) {
6851 can_preserve = SvCANEXISTDELETE(av);
6853 if (SvTYPE(av) == SVt_PVAV) {
6856 for (svp = MARK + 1; svp <= SP; svp++) {
6857 const SSize_t elem = SvIV(*svp);
6861 if (max > AvMAX(av))
6866 while (++MARK <= SP) {
6867 SV * const elemsv = *MARK;
6868 if (UNLIKELY(localizing)) {
6869 if (SvTYPE(av) == SVt_PVAV)
6870 S_localise_aelem_lval(aTHX_ av, elemsv, can_preserve);
6872 S_localise_helem_lval(aTHX_ (HV *)av, elemsv, can_preserve);
6874 *MARK = sv_2mortal(newSV_type(SVt_PVMG));
6875 sv_magic(*MARK,(SV *)av,PERL_MAGIC_lvref,(char *)elemsv,HEf_SVKEY);
6882 if (PL_op->op_flags & OPf_STACKED)
6883 Perl_pp_rv2av(aTHX);
6885 Perl_pp_padav(aTHX);
6889 SETs(0); /* special alias marker that aassign recognises */
6899 SETs(sv_2mortal((SV *)newCONSTSUB(SvTYPE(CopSTASH(PL_curcop))==SVt_PVHV
6900 ? CopSTASH(PL_curcop)
6902 NULL, SvREFCNT_inc_simple_NN(sv))));
6907 /* process one subroutine argument - typically when the sub has a signature:
6908 * introduce PL_curpad[op_targ] and assign to it the value
6909 * for $: (OPf_STACKED ? *sp : $_[N])
6910 * for @/%: @_[N..$#_]
6912 * It's equivalent to
6915 * my $foo = (value-on-stack)
6917 * my @foo = @_[N..$#_]
6927 AV *defav = GvAV(PL_defgv); /* @_ */
6928 IV ix = PTR2IV(cUNOP_AUXo->op_aux);
6931 /* do 'my $var, @var or %var' action */
6932 padentry = &(PAD_SVl(o->op_targ));
6933 save_clearsv(padentry);
6936 if ((o->op_private & OPpARGELEM_MASK) == OPpARGELEM_SV) {
6937 if (o->op_flags & OPf_STACKED) {
6944 /* should already have been checked */
6946 #if IVSIZE > PTRSIZE
6947 assert(ix <= SSize_t_MAX);
6950 svp = av_fetch(defav, ix, FALSE);
6951 val = svp ? *svp : &PL_sv_undef;
6956 /* cargo-culted from pp_sassign */
6957 assert(TAINTING_get || !TAINT_get);
6958 if (UNLIKELY(TAINT_get) && !SvTAINTED(val))
6961 SvSetMagicSV(targ, val);
6965 /* must be AV or HV */
6967 assert(!(o->op_flags & OPf_STACKED));
6968 argc = ((IV)AvFILL(defav) + 1) - ix;
6970 /* This is a copy of the relevant parts of pp_aassign().
6972 if ((o->op_private & OPpARGELEM_MASK) == OPpARGELEM_AV) {
6975 if (AvFILL((AV*)targ) > -1) {
6976 /* target should usually be empty. If we get get
6977 * here, someone's been doing some weird closure tricks.
6978 * Make a copy of all args before clearing the array,
6979 * to avoid the equivalent of @a = ($a[0]) prematurely freeing
6980 * elements. See similar code in pp_aassign.
6982 for (i = 0; i < argc; i++) {
6983 SV **svp = av_fetch(defav, ix + i, FALSE);
6984 SV *newsv = newSV(0);
6985 sv_setsv_flags(newsv,
6986 svp ? *svp : &PL_sv_undef,
6987 (SV_DO_COW_SVSETSV|SV_NOSTEAL));
6988 if (!av_store(defav, ix + i, newsv))
6989 SvREFCNT_dec_NN(newsv);
6991 av_clear((AV*)targ);
6997 av_extend((AV*)targ, argc);
7002 SV **svp = av_fetch(defav, ix + i, FALSE);
7003 SV *val = svp ? *svp : &PL_sv_undef;
7005 sv_setsv(tmpsv, val);
7006 av_store((AV*)targ, i++, tmpsv);
7014 assert((o->op_private & OPpARGELEM_MASK) == OPpARGELEM_HV);
7016 if (SvRMAGICAL(targ) || HvUSEDKEYS((HV*)targ)) {
7017 /* see "target should usually be empty" comment above */
7018 for (i = 0; i < argc; i++) {
7019 SV **svp = av_fetch(defav, ix + i, FALSE);
7020 SV *newsv = newSV(0);
7021 sv_setsv_flags(newsv,
7022 svp ? *svp : &PL_sv_undef,
7023 (SV_DO_COW_SVSETSV|SV_NOSTEAL));
7024 if (!av_store(defav, ix + i, newsv))
7025 SvREFCNT_dec_NN(newsv);
7027 hv_clear((HV*)targ);
7032 assert(argc % 2 == 0);
7041 svp = av_fetch(defav, ix + i++, FALSE);
7042 key = svp ? *svp : &PL_sv_undef;
7043 svp = av_fetch(defav, ix + i++, FALSE);
7044 val = svp ? *svp : &PL_sv_undef;
7047 if (UNLIKELY(SvGMAGICAL(key)))
7048 key = sv_mortalcopy(key);
7050 sv_setsv(tmpsv, val);
7051 hv_store_ent((HV*)targ, key, tmpsv, 0);
7059 /* Handle a default value for one subroutine argument (typically as part
7060 * of a subroutine signature).
7061 * It's equivalent to
7062 * @_ > op_targ ? $_[op_targ] : result_of(op_other)
7064 * Intended to be used where op_next is an OP_ARGELEM
7066 * We abuse the op_targ field slightly: it's an index into @_ rather than
7072 OP * const o = PL_op;
7073 AV *defav = GvAV(PL_defgv); /* @_ */
7074 IV ix = (IV)o->op_targ;
7077 #if IVSIZE > PTRSIZE
7078 assert(ix <= SSize_t_MAX);
7081 if (AvFILL(defav) >= ix) {
7083 SV **svp = av_fetch(defav, ix, FALSE);
7084 SV *val = svp ? *svp : &PL_sv_undef;
7088 return cLOGOPo->op_other;
7093 S_find_runcv_name(void)
7108 sv = sv_2mortal(newSV(0));
7109 gv_fullname4(sv, gv, NULL, TRUE);
7113 /* Check a sub's arguments - i.e. that it has the correct number of args
7114 * (and anything else we might think of in future). Typically used with
7120 OP * const o = PL_op;
7121 struct op_argcheck_aux *aux = (struct op_argcheck_aux *)cUNOP_AUXo->op_aux;
7122 UV params = aux->params;
7123 UV opt_params = aux->opt_params;
7124 char slurpy = aux->slurpy;
7125 AV *defav = GvAV(PL_defgv); /* @_ */
7129 assert(!SvMAGICAL(defav));
7130 argc = (UV)(AvFILLp(defav) + 1);
7131 too_few = (argc < (params - opt_params));
7133 if (UNLIKELY(too_few || (!slurpy && argc > params)))
7134 /* diag_listed_as: Too few arguments for subroutine '%s' */
7135 /* diag_listed_as: Too many arguments for subroutine '%s' */
7136 Perl_croak_caller("Too %s arguments for subroutine '%" SVf "'",
7137 too_few ? "few" : "many", S_find_runcv_name());
7139 if (UNLIKELY(slurpy == '%' && argc > params && (argc - params) % 2))
7140 /* diag_listed_as: Odd name/value argument for subroutine '%s' */
7141 Perl_croak_caller("Odd name/value argument for subroutine '%" SVf "'",
7142 S_find_runcv_name());
7155 SETs(boolSV(sv_isa_sv(left, right)));
7164 if (SvTRUE_NN(result)) {
7165 return cLOGOP->op_other;
7184 * ex: set ts=8 sts=4 sw=4 et: