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 */
1272 #if defined(NAN_COMPARE_BROKEN) && defined(Perl_isnan)
1273 !Perl_isnan(nl) && nl == (NV)(il = (IV)nl)
1274 && !Perl_isnan(nr) && nr == (NV)(ir = (IV)nr)
1276 nl == (NV)(il = (IV)nl) && nr == (NV)(ir = (IV)nr)
1279 /* nothing was lost by converting to IVs */
1283 # if defined(__sgi) && defined(USE_LONG_DOUBLE) && LONG_DOUBLEKIND == LONG_DOUBLE_IS_DOUBLEDOUBLE_128_BIT_BE_BE && NVSIZE == 16
1284 if (Perl_isinf(result)) {
1285 Zero((U8*)&result + 8, 8, U8);
1288 TARGn(result, 0); /* args not GMG, so can't be tainted */
1296 if (SvIV_please_nomg(svr)) {
1297 /* Unless the left argument is integer in range we are going to have to
1298 use NV maths. Hence only attempt to coerce the right argument if
1299 we know the left is integer. */
1300 /* Left operand is defined, so is it IV? */
1301 if (SvIV_please_nomg(svl)) {
1302 bool auvok = SvUOK(svl);
1303 bool buvok = SvUOK(svr);
1304 const UV topmask = (~ (UV)0) << (4 * sizeof (UV));
1305 const UV botmask = ~((~ (UV)0) << (4 * sizeof (UV)));
1314 const IV aiv = SvIVX(svl);
1317 auvok = TRUE; /* effectively it's a UV now */
1319 /* abs, auvok == false records sign; Using 0- here and
1320 * later to silence bogus warning from MS VC */
1321 alow = (UV) (0 - (UV) aiv);
1327 const IV biv = SvIVX(svr);
1330 buvok = TRUE; /* effectively it's a UV now */
1332 /* abs, buvok == false records sign */
1333 blow = (UV) (0 - (UV) biv);
1337 /* If this does sign extension on unsigned it's time for plan B */
1338 ahigh = alow >> (4 * sizeof (UV));
1340 bhigh = blow >> (4 * sizeof (UV));
1342 if (ahigh && bhigh) {
1344 /* eg 32 bit is at least 0x10000 * 0x10000 == 0x100000000
1345 which is overflow. Drop to NVs below. */
1346 } else if (!ahigh && !bhigh) {
1347 /* eg 32 bit is at most 0xFFFF * 0xFFFF == 0xFFFE0001
1348 so the unsigned multiply cannot overflow. */
1349 const UV product = alow * blow;
1350 if (auvok == buvok) {
1351 /* -ve * -ve or +ve * +ve gives a +ve result. */
1355 } else if (product <= (UV)IV_MIN) {
1356 /* 2s complement assumption that (UV)-IV_MIN is correct. */
1357 /* -ve result, which could overflow an IV */
1359 /* can't negate IV_MIN, but there are aren't two
1360 * integers such that !ahigh && !bhigh, where the
1361 * product equals 0x800....000 */
1362 assert(product != (UV)IV_MIN);
1363 SETi( -(IV)product );
1365 } /* else drop to NVs below. */
1367 /* One operand is large, 1 small */
1370 /* swap the operands */
1372 bhigh = blow; /* bhigh now the temp var for the swap */
1376 /* now, ((ahigh * blow) << half_UV_len) + (alow * blow)
1377 multiplies can't overflow. shift can, add can, -ve can. */
1378 product_middle = ahigh * blow;
1379 if (!(product_middle & topmask)) {
1380 /* OK, (ahigh * blow) won't lose bits when we shift it. */
1382 product_middle <<= (4 * sizeof (UV));
1383 product_low = alow * blow;
1385 /* as for pp_add, UV + something mustn't get smaller.
1386 IIRC ANSI mandates this wrapping *behaviour* for
1387 unsigned whatever the actual representation*/
1388 product_low += product_middle;
1389 if (product_low >= product_middle) {
1390 /* didn't overflow */
1391 if (auvok == buvok) {
1392 /* -ve * -ve or +ve * +ve gives a +ve result. */
1394 SETu( product_low );
1396 } else if (product_low <= (UV)IV_MIN) {
1397 /* 2s complement assumption again */
1398 /* -ve result, which could overflow an IV */
1400 SETi(product_low == (UV)IV_MIN
1401 ? IV_MIN : -(IV)product_low);
1403 } /* else drop to NVs below. */
1405 } /* product_middle too large */
1406 } /* ahigh && bhigh */
1411 NV right = SvNV_nomg(svr);
1412 NV left = SvNV_nomg(svl);
1413 NV result = left * right;
1416 #if defined(__sgi) && defined(USE_LONG_DOUBLE) && LONG_DOUBLEKIND == LONG_DOUBLE_IS_DOUBLEDOUBLE_128_BIT_BE_BE && NVSIZE == 16
1417 if (Perl_isinf(result)) {
1418 Zero((U8*)&result + 8, 8, U8);
1428 dSP; dATARGET; SV *svl, *svr;
1429 tryAMAGICbin_MG(div_amg, AMGf_assign|AMGf_numeric);
1432 /* Only try to do UV divide first
1433 if ((SLOPPYDIVIDE is true) or
1434 (PERL_PRESERVE_IVUV is true and one or both SV is a UV too large
1436 The assumption is that it is better to use floating point divide
1437 whenever possible, only doing integer divide first if we can't be sure.
1438 If NV_PRESERVES_UV is true then we know at compile time that no UV
1439 can be too large to preserve, so don't need to compile the code to
1440 test the size of UVs. */
1442 #if defined(SLOPPYDIVIDE) || (defined(PERL_PRESERVE_IVUV) && !defined(NV_PRESERVES_UV))
1443 # define PERL_TRY_UV_DIVIDE
1444 /* ensure that 20./5. == 4. */
1447 #ifdef PERL_TRY_UV_DIVIDE
1448 if (SvIV_please_nomg(svr) && SvIV_please_nomg(svl)) {
1449 bool left_non_neg = SvUOK(svl);
1450 bool right_non_neg = SvUOK(svr);
1454 if (right_non_neg) {
1458 const IV biv = SvIVX(svr);
1461 right_non_neg = TRUE; /* effectively it's a UV now */
1467 /* historically undef()/0 gives a "Use of uninitialized value"
1468 warning before dieing, hence this test goes here.
1469 If it were immediately before the second SvIV_please, then
1470 DIE() would be invoked before left was even inspected, so
1471 no inspection would give no warning. */
1473 DIE(aTHX_ "Illegal division by zero");
1479 const IV aiv = SvIVX(svl);
1482 left_non_neg = TRUE; /* effectively it's a UV now */
1491 /* For sloppy divide we always attempt integer division. */
1493 /* Otherwise we only attempt it if either or both operands
1494 would not be preserved by an NV. If both fit in NVs
1495 we fall through to the NV divide code below. However,
1496 as left >= right to ensure integer result here, we know that
1497 we can skip the test on the right operand - right big
1498 enough not to be preserved can't get here unless left is
1501 && (left > ((UV)1 << NV_PRESERVES_UV_BITS))
1504 /* Integer division can't overflow, but it can be imprecise. */
1506 /* Modern compilers optimize division followed by
1507 * modulo into a single div instruction */
1508 const UV result = left / right;
1509 if (left % right == 0) {
1510 SP--; /* result is valid */
1511 if (left_non_neg == right_non_neg) {
1512 /* signs identical, result is positive. */
1516 /* 2s complement assumption */
1517 if (result <= (UV)IV_MIN)
1518 SETi(result == (UV)IV_MIN ? IV_MIN : -(IV)result);
1520 /* It's exact but too negative for IV. */
1521 SETn( -(NV)result );
1524 } /* tried integer divide but it was not an integer result */
1525 } /* else (PERL_ABS(result) < 1.0) or (both UVs in range for NV) */
1526 } /* one operand wasn't SvIOK */
1527 #endif /* PERL_TRY_UV_DIVIDE */
1529 NV right = SvNV_nomg(svr);
1530 NV left = SvNV_nomg(svl);
1531 (void)POPs;(void)POPs;
1532 #if defined(NAN_COMPARE_BROKEN) && defined(Perl_isnan)
1533 if (! Perl_isnan(right) && right == 0.0)
1537 DIE(aTHX_ "Illegal division by zero");
1538 PUSHn( left / right );
1546 tryAMAGICbin_MG(modulo_amg, AMGf_assign|AMGf_numeric);
1550 bool left_neg = FALSE;
1551 bool right_neg = FALSE;
1552 bool use_double = FALSE;
1553 bool dright_valid = FALSE;
1556 SV * const svr = TOPs;
1557 SV * const svl = TOPm1s;
1558 if (SvIV_please_nomg(svr)) {
1559 right_neg = !SvUOK(svr);
1563 const IV biv = SvIVX(svr);
1566 right_neg = FALSE; /* effectively it's a UV now */
1568 right = (UV) (0 - (UV) biv);
1573 dright = SvNV_nomg(svr);
1574 right_neg = dright < 0;
1577 if (dright < UV_MAX_P1) {
1578 right = U_V(dright);
1579 dright_valid = TRUE; /* In case we need to use double below. */
1585 /* At this point use_double is only true if right is out of range for
1586 a UV. In range NV has been rounded down to nearest UV and
1587 use_double false. */
1588 if (!use_double && SvIV_please_nomg(svl)) {
1589 left_neg = !SvUOK(svl);
1593 const IV aiv = SvIVX(svl);
1596 left_neg = FALSE; /* effectively it's a UV now */
1598 left = (UV) (0 - (UV) aiv);
1603 dleft = SvNV_nomg(svl);
1604 left_neg = dleft < 0;
1608 /* This should be exactly the 5.6 behaviour - if left and right are
1609 both in range for UV then use U_V() rather than floor. */
1611 if (dleft < UV_MAX_P1) {
1612 /* right was in range, so is dleft, so use UVs not double.
1616 /* left is out of range for UV, right was in range, so promote
1617 right (back) to double. */
1619 /* The +0.5 is used in 5.6 even though it is not strictly
1620 consistent with the implicit +0 floor in the U_V()
1621 inside the #if 1. */
1622 dleft = Perl_floor(dleft + 0.5);
1625 dright = Perl_floor(dright + 0.5);
1636 DIE(aTHX_ "Illegal modulus zero");
1638 dans = Perl_fmod(dleft, dright);
1639 if ((left_neg != right_neg) && dans)
1640 dans = dright - dans;
1643 sv_setnv(TARG, dans);
1649 DIE(aTHX_ "Illegal modulus zero");
1652 if ((left_neg != right_neg) && ans)
1655 /* XXX may warn: unary minus operator applied to unsigned type */
1656 /* could change -foo to be (~foo)+1 instead */
1657 if (ans <= ~((UV)IV_MAX)+1)
1658 sv_setiv(TARG, ~ans+1);
1660 sv_setnv(TARG, -(NV)ans);
1663 sv_setuv(TARG, ans);
1675 bool infnan = FALSE;
1676 const U8 gimme = GIMME_V;
1678 if (gimme == G_ARRAY && PL_op->op_private & OPpREPEAT_DOLIST) {
1679 /* TODO: think of some way of doing list-repeat overloading ??? */
1684 if (UNLIKELY(PL_op->op_private & OPpREPEAT_DOLIST)) {
1685 /* The parser saw this as a list repeat, and there
1686 are probably several items on the stack. But we're
1687 in scalar/void context, and there's no pp_list to save us
1688 now. So drop the rest of the items -- robin@kitsite.com
1691 if (MARK + 1 < SP) {
1697 ASSUME(MARK + 1 == SP);
1700 MARK[1] = &PL_sv_undef;
1704 tryAMAGICbin_MG(repeat_amg, AMGf_assign);
1710 const UV uv = SvUV_nomg(sv);
1712 count = IV_MAX; /* The best we can do? */
1716 count = SvIV_nomg(sv);
1719 else if (SvNOKp(sv)) {
1720 const NV nv = SvNV_nomg(sv);
1721 infnan = Perl_isinfnan(nv);
1722 if (UNLIKELY(infnan)) {
1726 count = -1; /* An arbitrary negative integer */
1732 count = SvIV_nomg(sv);
1735 Perl_ck_warner(aTHX_ packWARN(WARN_NUMERIC),
1736 "Non-finite repeat count does nothing");
1737 } else if (count < 0) {
1739 Perl_ck_warner(aTHX_ packWARN(WARN_NUMERIC),
1740 "Negative repeat count does nothing");
1743 if (gimme == G_ARRAY && PL_op->op_private & OPpREPEAT_DOLIST) {
1745 const SSize_t items = SP - MARK;
1746 const U8 mod = PL_op->op_flags & OPf_MOD;
1751 if ( items > SSize_t_MAX / count /* max would overflow */
1752 /* repeatcpy would overflow */
1753 || items > I32_MAX / (I32)sizeof(SV *)
1755 Perl_croak(aTHX_ "%s","Out of memory during list extend");
1756 max = items * count;
1761 if (mod && SvPADTMP(*SP)) {
1762 *SP = sv_mortalcopy(*SP);
1769 repeatcpy((char*)(MARK + items), (char*)MARK,
1770 items * sizeof(const SV *), count - 1);
1773 else if (count <= 0)
1776 else { /* Note: mark already snarfed by pp_list */
1777 SV * const tmpstr = POPs;
1782 sv_setsv_nomg(TARG, tmpstr);
1783 SvPV_force_nomg(TARG, len);
1784 isutf = DO_UTF8(TARG);
1791 if ( len > (MEM_SIZE_MAX-1) / (UV)count /* max would overflow */
1792 || len > (U32)I32_MAX /* repeatcpy would overflow */
1794 Perl_croak(aTHX_ "%s",
1795 "Out of memory during string extend");
1796 max = (UV)count * len + 1;
1799 repeatcpy(SvPVX(TARG) + len, SvPVX(TARG), len, count - 1);
1800 SvCUR_set(TARG, SvCUR(TARG) * count);
1802 *SvEND(TARG) = '\0';
1805 (void)SvPOK_only_UTF8(TARG);
1807 (void)SvPOK_only(TARG);
1816 dSP; dATARGET; bool useleft; SV *svl, *svr;
1817 tryAMAGICbin_MG(subtr_amg, AMGf_assign|AMGf_numeric);
1821 #ifdef PERL_PRESERVE_IVUV
1823 /* special-case some simple common cases */
1824 if (!((svl->sv_flags|svr->sv_flags) & (SVf_IVisUV|SVs_GMG))) {
1826 U32 flags = (svl->sv_flags & svr->sv_flags);
1827 if (flags & SVf_IOK) {
1828 /* both args are simple IVs */
1833 topl = ((UV)il) >> (UVSIZE * 8 - 2);
1834 topr = ((UV)ir) >> (UVSIZE * 8 - 2);
1836 /* if both are in a range that can't under/overflow, do a
1837 * simple integer subtract: if the top of both numbers
1838 * are 00 or 11, then it's safe */
1839 if (!( ((topl+1) | (topr+1)) & 2)) {
1841 TARGi(il - ir, 0); /* args not GMG, so can't be tainted */
1847 else if (flags & SVf_NOK) {
1848 /* both args are NVs */
1853 #if defined(NAN_COMPARE_BROKEN) && defined(Perl_isnan)
1854 !Perl_isnan(nl) && nl == (NV)(il = (IV)nl)
1855 && !Perl_isnan(nr) && nr == (NV)(ir = (IV)nr)
1857 nl == (NV)(il = (IV)nl) && nr == (NV)(ir = (IV)nr)
1860 /* nothing was lost by converting to IVs */
1863 TARGn(nl - nr, 0); /* args not GMG, so can't be tainted */
1871 useleft = USE_LEFT(svl);
1872 /* See comments in pp_add (in pp_hot.c) about Overflow, and how
1873 "bad things" happen if you rely on signed integers wrapping. */
1874 if (SvIV_please_nomg(svr)) {
1875 /* Unless the left argument is integer in range we are going to have to
1876 use NV maths. Hence only attempt to coerce the right argument if
1877 we know the left is integer. */
1884 a_valid = auvok = 1;
1885 /* left operand is undef, treat as zero. */
1887 /* Left operand is defined, so is it IV? */
1888 if (SvIV_please_nomg(svl)) {
1889 if ((auvok = SvUOK(svl)))
1892 const IV aiv = SvIVX(svl);
1895 auvok = 1; /* Now acting as a sign flag. */
1897 auv = (UV) (0 - (UV) aiv);
1904 bool result_good = 0;
1907 bool buvok = SvUOK(svr);
1912 const IV biv = SvIVX(svr);
1917 buv = (UV) (0 - (UV) biv);
1919 /* ?uvok if value is >= 0. basically, flagged as UV if it's +ve,
1920 else "IV" now, independent of how it came in.
1921 if a, b represents positive, A, B negative, a maps to -A etc
1926 all UV maths. negate result if A negative.
1927 subtract if signs same, add if signs differ. */
1929 if (auvok ^ buvok) {
1938 /* Must get smaller */
1943 if (result <= buv) {
1944 /* result really should be -(auv-buv). as its negation
1945 of true value, need to swap our result flag */
1957 if (result <= (UV)IV_MIN)
1958 SETi(result == (UV)IV_MIN
1959 ? IV_MIN : -(IV)result);
1961 /* result valid, but out of range for IV. */
1962 SETn( -(NV)result );
1966 } /* Overflow, drop through to NVs. */
1970 useleft = USE_LEFT(svl);
1973 NV value = SvNV_nomg(svr);
1977 /* left operand is undef, treat as zero - value */
1981 SETn( SvNV_nomg(svl) - value );
1986 #define IV_BITS (IVSIZE * 8)
1988 static UV S_uv_shift(UV uv, int shift, bool left)
1994 if (shift >= IV_BITS) {
1997 return left ? uv << shift : uv >> shift;
2000 static IV S_iv_shift(IV iv, int shift, bool left)
2006 if (shift >= IV_BITS) {
2007 return iv < 0 && !left ? -1 : 0;
2009 return left ? iv << shift : iv >> shift;
2012 #define UV_LEFT_SHIFT(uv, shift) S_uv_shift(uv, shift, TRUE)
2013 #define UV_RIGHT_SHIFT(uv, shift) S_uv_shift(uv, shift, FALSE)
2014 #define IV_LEFT_SHIFT(iv, shift) S_iv_shift(iv, shift, TRUE)
2015 #define IV_RIGHT_SHIFT(iv, shift) S_iv_shift(iv, shift, FALSE)
2019 dSP; dATARGET; SV *svl, *svr;
2020 tryAMAGICbin_MG(lshift_amg, AMGf_assign|AMGf_numeric);
2024 const IV shift = SvIV_nomg(svr);
2025 if (PL_op->op_private & HINT_INTEGER) {
2026 SETi(IV_LEFT_SHIFT(SvIV_nomg(svl), shift));
2029 SETu(UV_LEFT_SHIFT(SvUV_nomg(svl), shift));
2037 dSP; dATARGET; SV *svl, *svr;
2038 tryAMAGICbin_MG(rshift_amg, AMGf_assign|AMGf_numeric);
2042 const IV shift = SvIV_nomg(svr);
2043 if (PL_op->op_private & HINT_INTEGER) {
2044 SETi(IV_RIGHT_SHIFT(SvIV_nomg(svl), shift));
2047 SETu(UV_RIGHT_SHIFT(SvUV_nomg(svl), shift));
2058 tryAMAGICbin_MG(lt_amg, AMGf_numeric);
2062 (SvIOK_notUV(left) && SvIOK_notUV(right))
2063 ? (SvIVX(left) < SvIVX(right))
2064 : (do_ncmp(left, right) == -1)
2074 tryAMAGICbin_MG(gt_amg, AMGf_numeric);
2078 (SvIOK_notUV(left) && SvIOK_notUV(right))
2079 ? (SvIVX(left) > SvIVX(right))
2080 : (do_ncmp(left, right) == 1)
2090 tryAMAGICbin_MG(le_amg, AMGf_numeric);
2094 (SvIOK_notUV(left) && SvIOK_notUV(right))
2095 ? (SvIVX(left) <= SvIVX(right))
2096 : (do_ncmp(left, right) <= 0)
2106 tryAMAGICbin_MG(ge_amg, AMGf_numeric);
2110 (SvIOK_notUV(left) && SvIOK_notUV(right))
2111 ? (SvIVX(left) >= SvIVX(right))
2112 : ( (do_ncmp(left, right) & 2) == 0)
2122 tryAMAGICbin_MG(ne_amg, AMGf_numeric);
2126 (SvIOK_notUV(left) && SvIOK_notUV(right))
2127 ? (SvIVX(left) != SvIVX(right))
2128 : (do_ncmp(left, right) != 0)
2133 /* compare left and right SVs. Returns:
2137 * 2: left or right was a NaN
2140 Perl_do_ncmp(pTHX_ SV* const left, SV * const right)
2142 PERL_ARGS_ASSERT_DO_NCMP;
2143 #ifdef PERL_PRESERVE_IVUV
2144 /* Fortunately it seems NaN isn't IOK */
2145 if (SvIV_please_nomg(right) && SvIV_please_nomg(left)) {
2147 const IV leftiv = SvIVX(left);
2148 if (!SvUOK(right)) {
2149 /* ## IV <=> IV ## */
2150 const IV rightiv = SvIVX(right);
2151 return (leftiv > rightiv) - (leftiv < rightiv);
2153 /* ## IV <=> UV ## */
2155 /* As (b) is a UV, it's >=0, so it must be < */
2158 const UV rightuv = SvUVX(right);
2159 return ((UV)leftiv > rightuv) - ((UV)leftiv < rightuv);
2164 /* ## UV <=> UV ## */
2165 const UV leftuv = SvUVX(left);
2166 const UV rightuv = SvUVX(right);
2167 return (leftuv > rightuv) - (leftuv < rightuv);
2169 /* ## UV <=> IV ## */
2171 const IV rightiv = SvIVX(right);
2173 /* As (a) is a UV, it's >=0, so it cannot be < */
2176 const UV leftuv = SvUVX(left);
2177 return (leftuv > (UV)rightiv) - (leftuv < (UV)rightiv);
2180 NOT_REACHED; /* NOTREACHED */
2184 NV const rnv = SvNV_nomg(right);
2185 NV const lnv = SvNV_nomg(left);
2187 #if defined(NAN_COMPARE_BROKEN) && defined(Perl_isnan)
2188 if (Perl_isnan(lnv) || Perl_isnan(rnv)) {
2191 return (lnv > rnv) - (lnv < rnv);
2210 tryAMAGICbin_MG(ncmp_amg, AMGf_numeric);
2213 value = do_ncmp(left, right);
2225 /* also used for: pp_sge() pp_sgt() pp_slt() */
2231 int amg_type = sle_amg;
2235 switch (PL_op->op_type) {
2254 tryAMAGICbin_MG(amg_type, 0);
2258 #ifdef USE_LOCALE_COLLATE
2259 (IN_LC_RUNTIME(LC_COLLATE))
2260 ? sv_cmp_locale_flags(left, right, 0)
2263 sv_cmp_flags(left, right, 0);
2264 SETs(boolSV(cmp * multiplier < rhs));
2272 tryAMAGICbin_MG(seq_amg, 0);
2275 SETs(boolSV(sv_eq_flags(left, right, 0)));
2283 tryAMAGICbin_MG(sne_amg, 0);
2286 SETs(boolSV(!sv_eq_flags(left, right, 0)));
2294 tryAMAGICbin_MG(scmp_amg, 0);
2298 #ifdef USE_LOCALE_COLLATE
2299 (IN_LC_RUNTIME(LC_COLLATE))
2300 ? sv_cmp_locale_flags(left, right, 0)
2303 sv_cmp_flags(left, right, 0);
2312 tryAMAGICbin_MG(band_amg, AMGf_assign);
2315 if (SvNIOKp(left) || SvNIOKp(right)) {
2316 const bool left_ro_nonnum = !SvNIOKp(left) && SvREADONLY(left);
2317 const bool right_ro_nonnum = !SvNIOKp(right) && SvREADONLY(right);
2318 if (PL_op->op_private & HINT_INTEGER) {
2319 const IV i = SvIV_nomg(left) & SvIV_nomg(right);
2323 const UV u = SvUV_nomg(left) & SvUV_nomg(right);
2326 if (left_ro_nonnum && left != TARG) SvNIOK_off(left);
2327 if (right_ro_nonnum) SvNIOK_off(right);
2330 do_vop(PL_op->op_type, TARG, left, right);
2340 tryAMAGICbin_MG(band_amg, AMGf_assign|AMGf_numarg);
2342 dATARGET; dPOPTOPssrl;
2343 if (PL_op->op_private & HINT_INTEGER) {
2344 const IV i = SvIV_nomg(left) & SvIV_nomg(right);
2348 const UV u = SvUV_nomg(left) & SvUV_nomg(right);
2358 tryAMAGICbin_MG(sband_amg, AMGf_assign);
2360 dATARGET; dPOPTOPssrl;
2361 do_vop(OP_BIT_AND, TARG, left, right);
2366 /* also used for: pp_bit_xor() */
2371 const int op_type = PL_op->op_type;
2373 tryAMAGICbin_MG((op_type == OP_BIT_OR ? bor_amg : bxor_amg), AMGf_assign);
2376 if (SvNIOKp(left) || SvNIOKp(right)) {
2377 const bool left_ro_nonnum = !SvNIOKp(left) && SvREADONLY(left);
2378 const bool right_ro_nonnum = !SvNIOKp(right) && SvREADONLY(right);
2379 if (PL_op->op_private & HINT_INTEGER) {
2380 const IV l = (USE_LEFT(left) ? SvIV_nomg(left) : 0);
2381 const IV r = SvIV_nomg(right);
2382 const IV result = op_type == OP_BIT_OR ? (l | r) : (l ^ r);
2386 const UV l = (USE_LEFT(left) ? SvUV_nomg(left) : 0);
2387 const UV r = SvUV_nomg(right);
2388 const UV result = op_type == OP_BIT_OR ? (l | r) : (l ^ r);
2391 if (left_ro_nonnum && left != TARG) SvNIOK_off(left);
2392 if (right_ro_nonnum) SvNIOK_off(right);
2395 do_vop(op_type, TARG, left, right);
2402 /* also used for: pp_nbit_xor() */
2407 const int op_type = PL_op->op_type;
2409 tryAMAGICbin_MG((op_type == OP_NBIT_OR ? bor_amg : bxor_amg),
2410 AMGf_assign|AMGf_numarg);
2412 dATARGET; dPOPTOPssrl;
2413 if (PL_op->op_private & HINT_INTEGER) {
2414 const IV l = (USE_LEFT(left) ? SvIV_nomg(left) : 0);
2415 const IV r = SvIV_nomg(right);
2416 const IV result = op_type == OP_NBIT_OR ? (l | r) : (l ^ r);
2420 const UV l = (USE_LEFT(left) ? SvUV_nomg(left) : 0);
2421 const UV r = SvUV_nomg(right);
2422 const UV result = op_type == OP_NBIT_OR ? (l | r) : (l ^ r);
2429 /* also used for: pp_sbit_xor() */
2434 const int op_type = PL_op->op_type;
2436 tryAMAGICbin_MG((op_type == OP_SBIT_OR ? sbor_amg : sbxor_amg),
2439 dATARGET; dPOPTOPssrl;
2440 do_vop(op_type == OP_SBIT_OR ? OP_BIT_OR : OP_BIT_XOR, TARG, left,
2446 PERL_STATIC_INLINE bool
2447 S_negate_string(pTHX)
2452 SV * const sv = TOPs;
2453 if (!SvPOKp(sv) || SvNIOK(sv) || (!SvPOK(sv) && SvNIOKp(sv)))
2455 s = SvPV_nomg_const(sv, len);
2456 if (isIDFIRST(*s)) {
2457 sv_setpvs(TARG, "-");
2460 else if (*s == '+' || (*s == '-' && !looks_like_number(sv))) {
2461 sv_setsv_nomg(TARG, sv);
2462 *SvPV_force_nomg(TARG, len) = *s == '-' ? '+' : '-';
2472 tryAMAGICun_MG(neg_amg, AMGf_numeric);
2473 if (S_negate_string(aTHX)) return NORMAL;
2475 SV * const sv = TOPs;
2478 /* It's publicly an integer */
2481 if (SvIVX(sv) == IV_MIN) {
2482 /* 2s complement assumption. */
2483 SETi(SvIVX(sv)); /* special case: -((UV)IV_MAX+1) ==
2487 else if (SvUVX(sv) <= IV_MAX) {
2492 else if (SvIVX(sv) != IV_MIN) {
2496 #ifdef PERL_PRESERVE_IVUV
2503 if (SvNIOKp(sv) && (SvNIOK(sv) || !SvPOK(sv)))
2504 SETn(-SvNV_nomg(sv));
2505 else if (SvPOKp(sv) && SvIV_please_nomg(sv))
2506 goto oops_its_an_int;
2508 SETn(-SvNV_nomg(sv));
2518 tryAMAGICun_MG(not_amg, 0);
2520 *PL_stack_sp = boolSV(!SvTRUE_nomg_NN(sv));
2525 S_scomplement(pTHX_ SV *targ, SV *sv)
2531 sv_copypv_nomg(TARG, sv);
2532 tmps = (U8*)SvPV_nomg(TARG, len);
2535 if (len && ! utf8_to_bytes(tmps, &len)) {
2536 Perl_croak(aTHX_ FATAL_ABOVE_FF_MSG, PL_op_desc[PL_op->op_type]);
2547 for ( ; anum && (unsigned long)tmps % sizeof(long); anum--, tmps++)
2550 for ( ; anum >= (I32)sizeof(long); anum -= (I32)sizeof(long), tmpl++)
2555 for ( ; anum > 0; anum--, tmps++)
2562 tryAMAGICun_MG(compl_amg, AMGf_numeric);
2566 if (PL_op->op_private & HINT_INTEGER) {
2567 const IV i = ~SvIV_nomg(sv);
2571 const UV u = ~SvUV_nomg(sv);
2576 S_scomplement(aTHX_ TARG, sv);
2586 tryAMAGICun_MG(compl_amg, AMGf_numeric|AMGf_numarg);
2589 if (PL_op->op_private & HINT_INTEGER) {
2590 const IV i = ~SvIV_nomg(sv);
2594 const UV u = ~SvUV_nomg(sv);
2604 tryAMAGICun_MG(scompl_amg, AMGf_numeric);
2607 S_scomplement(aTHX_ TARG, sv);
2613 /* integer versions of some of the above */
2618 tryAMAGICbin_MG(mult_amg, AMGf_assign);
2621 SETi( left * right );
2630 tryAMAGICbin_MG(div_amg, AMGf_assign);
2633 IV value = SvIV_nomg(right);
2635 DIE(aTHX_ "Illegal division by zero");
2636 num = SvIV_nomg(left);
2638 /* avoid FPE_INTOVF on some platforms when num is IV_MIN */
2642 value = num / value;
2650 /* This is the vanilla old i_modulo. */
2652 tryAMAGICbin_MG(modulo_amg, AMGf_assign);
2656 DIE(aTHX_ "Illegal modulus zero");
2657 /* avoid FPE_INTOVF on some platforms when left is IV_MIN */
2661 SETi( left % right );
2666 #if defined(__GLIBC__) && IVSIZE == 8 \
2667 && ( __GLIBC__ < 2 || (__GLIBC__ == 2 && __GLIBC_MINOR__ < 8))
2669 PP(pp_i_modulo_glibc_bugfix)
2671 /* This is the i_modulo with the workaround for the _moddi3 bug
2672 * in (at least) glibc 2.2.5 (the PERL_ABS() the workaround).
2673 * See below for pp_i_modulo. */
2675 tryAMAGICbin_MG(modulo_amg, AMGf_assign);
2679 DIE(aTHX_ "Illegal modulus zero");
2680 /* avoid FPE_INTOVF on some platforms when left is IV_MIN */
2684 SETi( left % PERL_ABS(right) );
2693 tryAMAGICbin_MG(add_amg, AMGf_assign);
2695 dPOPTOPiirl_ul_nomg;
2696 SETi( left + right );
2704 tryAMAGICbin_MG(subtr_amg, AMGf_assign);
2706 dPOPTOPiirl_ul_nomg;
2707 SETi( left - right );
2715 tryAMAGICbin_MG(lt_amg, 0);
2718 SETs(boolSV(left < right));
2726 tryAMAGICbin_MG(gt_amg, 0);
2729 SETs(boolSV(left > right));
2737 tryAMAGICbin_MG(le_amg, 0);
2740 SETs(boolSV(left <= right));
2748 tryAMAGICbin_MG(ge_amg, 0);
2751 SETs(boolSV(left >= right));
2759 tryAMAGICbin_MG(eq_amg, 0);
2762 SETs(boolSV(left == right));
2770 tryAMAGICbin_MG(ne_amg, 0);
2773 SETs(boolSV(left != right));
2781 tryAMAGICbin_MG(ncmp_amg, 0);
2788 else if (left < right)
2800 tryAMAGICun_MG(neg_amg, 0);
2801 if (S_negate_string(aTHX)) return NORMAL;
2803 SV * const sv = TOPs;
2804 IV const i = SvIV_nomg(sv);
2810 /* High falutin' math. */
2815 tryAMAGICbin_MG(atan2_amg, 0);
2818 SETn(Perl_atan2(left, right));
2824 /* also used for: pp_cos() pp_exp() pp_log() pp_sqrt() */
2829 int amg_type = fallback_amg;
2830 const char *neg_report = NULL;
2831 const int op_type = PL_op->op_type;
2834 case OP_SIN: amg_type = sin_amg; break;
2835 case OP_COS: amg_type = cos_amg; break;
2836 case OP_EXP: amg_type = exp_amg; break;
2837 case OP_LOG: amg_type = log_amg; neg_report = "log"; break;
2838 case OP_SQRT: amg_type = sqrt_amg; neg_report = "sqrt"; break;
2841 assert(amg_type != fallback_amg);
2843 tryAMAGICun_MG(amg_type, 0);
2845 SV * const arg = TOPs;
2846 const NV value = SvNV_nomg(arg);
2852 if (neg_report) { /* log or sqrt */
2854 #if defined(NAN_COMPARE_BROKEN) && defined(Perl_isnan)
2855 ! Perl_isnan(value) &&
2857 (op_type == OP_LOG ? (value <= 0.0) : (value < 0.0))) {
2858 SET_NUMERIC_STANDARD();
2859 /* diag_listed_as: Can't take log of %g */
2860 DIE(aTHX_ "Can't take %s of %" NVgf, neg_report, value);
2865 case OP_SIN: result = Perl_sin(value); break;
2866 case OP_COS: result = Perl_cos(value); break;
2867 case OP_EXP: result = Perl_exp(value); break;
2868 case OP_LOG: result = Perl_log(value); break;
2869 case OP_SQRT: result = Perl_sqrt(value); break;
2876 /* Support Configure command-line overrides for rand() functions.
2877 After 5.005, perhaps we should replace this by Configure support
2878 for drand48(), random(), or rand(). For 5.005, though, maintain
2879 compatibility by calling rand() but allow the user to override it.
2880 See INSTALL for details. --Andy Dougherty 15 July 1998
2882 /* Now it's after 5.005, and Configure supports drand48() and random(),
2883 in addition to rand(). So the overrides should not be needed any more.
2884 --Jarkko Hietaniemi 27 September 1998
2889 if (!PL_srand_called) {
2890 (void)seedDrand01((Rand_seed_t)seed());
2891 PL_srand_called = TRUE;
2903 SV * const sv = POPs;
2909 /* 1 of 2 things can be carried through SvNV, SP or TARG, SP was carried */
2910 #if defined(NAN_COMPARE_BROKEN) && defined(Perl_isnan)
2911 if (! Perl_isnan(value) && value == 0.0)
2921 sv_setnv_mg(TARG, value);
2932 if (MAXARG >= 1 && (TOPs || POPs)) {
2939 pv = SvPV(top, len);
2940 flags = grok_number(pv, len, &anum);
2942 if (!(flags & IS_NUMBER_IN_UV)) {
2943 Perl_ck_warner_d(aTHX_ packWARN(WARN_OVERFLOW),
2944 "Integer overflow in srand");
2952 (void)seedDrand01((Rand_seed_t)anum);
2953 PL_srand_called = TRUE;
2957 /* Historically srand always returned true. We can avoid breaking
2959 sv_setpvs(TARG, "0 but true");
2968 tryAMAGICun_MG(int_amg, AMGf_numeric);
2970 SV * const sv = TOPs;
2971 const IV iv = SvIV_nomg(sv);
2972 /* XXX it's arguable that compiler casting to IV might be subtly
2973 different from modf (for numbers inside (IV_MIN,UV_MAX)) in which
2974 else preferring IV has introduced a subtle behaviour change bug. OTOH
2975 relying on floating point to be accurate is a bug. */
2980 else if (SvIOK(sv)) {
2982 SETu(SvUV_nomg(sv));
2987 const NV value = SvNV_nomg(sv);
2988 if (UNLIKELY(Perl_isinfnan(value)))
2990 else if (value >= 0.0) {
2991 if (value < (NV)UV_MAX + 0.5) {
2994 SETn(Perl_floor(value));
2998 if (value > (NV)IV_MIN - 0.5) {
3001 SETn(Perl_ceil(value));
3012 tryAMAGICun_MG(abs_amg, AMGf_numeric);
3014 SV * const sv = TOPs;
3015 /* This will cache the NV value if string isn't actually integer */
3016 const IV iv = SvIV_nomg(sv);
3021 else if (SvIOK(sv)) {
3022 /* IVX is precise */
3024 SETu(SvUV_nomg(sv)); /* force it to be numeric only */
3032 /* 2s complement assumption. Also, not really needed as
3033 IV_MIN and -IV_MIN should both be %100...00 and NV-able */
3039 const NV value = SvNV_nomg(sv);
3050 /* also used for: pp_hex() */
3056 I32 flags = PERL_SCAN_ALLOW_UNDERSCORES;
3060 SV* const sv = TOPs;
3062 tmps = (SvPV_const(sv, len));
3064 /* If Unicode, try to downgrade
3065 * If not possible, croak. */
3066 SV* const tsv = sv_2mortal(newSVsv(sv));
3069 sv_utf8_downgrade(tsv, FALSE);
3070 tmps = SvPV_const(tsv, len);
3072 if (PL_op->op_type == OP_HEX)
3075 while (*tmps && len && isSPACE(*tmps))
3079 if (isALPHA_FOLD_EQ(*tmps, 'x')) {
3081 result_uv = grok_hex (tmps, &len, &flags, &result_nv);
3083 else if (isALPHA_FOLD_EQ(*tmps, 'b'))
3084 result_uv = grok_bin (tmps, &len, &flags, &result_nv);
3086 result_uv = grok_oct (tmps, &len, &flags, &result_nv);
3088 if (flags & PERL_SCAN_GREATER_THAN_UV_MAX) {
3103 SV * const sv = TOPs;
3105 U32 in_bytes = IN_BYTES;
3106 /* Simplest case shortcut:
3107 * set svflags to just the SVf_POK|SVs_GMG|SVf_UTF8 from the SV,
3108 * with the SVf_UTF8 flag inverted if under 'use bytes' (HINT_BYTES
3111 U32 svflags = (SvFLAGS(sv) ^ (in_bytes << 26)) & (SVf_POK|SVs_GMG|SVf_UTF8);
3113 STATIC_ASSERT_STMT(SVf_UTF8 == (HINT_BYTES << 26));
3116 if (LIKELY(svflags == SVf_POK))
3119 if (svflags & SVs_GMG)
3124 if (!IN_BYTES) { /* reread to avoid using an C auto/register */
3125 if ((SvFLAGS(sv) & (SVf_POK|SVf_UTF8)) == SVf_POK)
3127 if ( SvPOK(sv) && (PL_op->op_private & OPpTRUEBOOL)) {
3128 /* no need to convert from bytes to chars */
3132 len = sv_len_utf8_nomg(sv);
3135 /* unrolled SvPV_nomg_const(sv,len) */
3136 if (SvPOK_nog(sv)) {
3139 if (PL_op->op_private & OPpTRUEBOOL) {
3141 SETs(len ? &PL_sv_yes : &PL_sv_zero);
3146 (void)sv_2pv_flags(sv, &len, 0|SV_CONST_RETURN);
3149 TARGi((IV)(len), 1);
3152 if (!SvPADTMP(TARG)) {
3153 /* OPpTARGET_MY: targ is var in '$lex = length()' */
3158 /* TARG is on stack at this point and is overwriten by SETs.
3159 * This branch is the odd one out, so put TARG by default on
3160 * stack earlier to let local SP go out of liveness sooner */
3163 return NORMAL; /* no putback, SP didn't move in this opcode */
3167 /* Returns false if substring is completely outside original string.
3168 No length is indicated by len_iv = 0 and len_is_uv = 0. len_is_uv must
3169 always be true for an explicit 0.
3172 Perl_translate_substr_offsets( STRLEN curlen, IV pos1_iv,
3173 bool pos1_is_uv, IV len_iv,
3174 bool len_is_uv, STRLEN *posp,
3180 PERL_ARGS_ASSERT_TRANSLATE_SUBSTR_OFFSETS;
3182 if (!pos1_is_uv && pos1_iv < 0 && curlen) {
3183 pos1_is_uv = curlen-1 > ~(UV)pos1_iv;
3186 if ((pos1_is_uv || pos1_iv > 0) && (UV)pos1_iv > curlen)
3189 if (len_iv || len_is_uv) {
3190 if (!len_is_uv && len_iv < 0) {
3191 pos2_iv = curlen + len_iv;
3193 pos2_is_uv = curlen-1 > ~(UV)len_iv;
3196 } else { /* len_iv >= 0 */
3197 if (!pos1_is_uv && pos1_iv < 0) {
3198 pos2_iv = pos1_iv + len_iv;
3199 pos2_is_uv = (UV)len_iv > (UV)IV_MAX;
3201 if ((UV)len_iv > curlen-(UV)pos1_iv)
3204 pos2_iv = pos1_iv+len_iv;
3214 if (!pos2_is_uv && pos2_iv < 0) {
3215 if (!pos1_is_uv && pos1_iv < 0)
3219 else if (!pos1_is_uv && pos1_iv < 0)
3222 if ((UV)pos2_iv < (UV)pos1_iv)
3224 if ((UV)pos2_iv > curlen)
3227 /* pos1_iv and pos2_iv both in 0..curlen, so the cast is safe */
3228 *posp = (STRLEN)( (UV)pos1_iv );
3229 *lenp = (STRLEN)( (UV)pos2_iv - (UV)pos1_iv );
3246 I32 lvalue = PL_op->op_flags & OPf_MOD || LVRET;
3247 const bool rvalue = (GIMME_V != G_VOID);
3250 const char *repl = NULL;
3252 int num_args = PL_op->op_private & 7;
3253 bool repl_need_utf8_upgrade = FALSE;
3257 if(!(repl_sv = POPs)) num_args--;
3259 if ((len_sv = POPs)) {
3260 len_iv = SvIV(len_sv);
3261 len_is_uv = len_iv ? SvIOK_UV(len_sv) : 1;
3266 pos1_iv = SvIV(pos_sv);
3267 pos1_is_uv = SvIOK_UV(pos_sv);
3269 if (PL_op->op_private & OPpSUBSTR_REPL_FIRST) {
3273 if (lvalue && !repl_sv) {
3275 ret = sv_2mortal(newSV_type(SVt_PVLV)); /* Not TARG RT#67838 */
3276 sv_magic(ret, NULL, PERL_MAGIC_substr, NULL, 0);
3278 LvTARG(ret) = SvREFCNT_inc_simple(sv);
3280 pos1_is_uv || pos1_iv >= 0
3281 ? (STRLEN)(UV)pos1_iv
3282 : (LvFLAGS(ret) |= LVf_NEG_OFF, (STRLEN)(UV)-pos1_iv);
3284 len_is_uv || len_iv > 0
3285 ? (STRLEN)(UV)len_iv
3286 : (LvFLAGS(ret) |= LVf_NEG_LEN, (STRLEN)(UV)-len_iv);
3288 PUSHs(ret); /* avoid SvSETMAGIC here */
3292 repl = SvPV_const(repl_sv, repl_len);
3295 Perl_ck_warner(aTHX_ packWARN(WARN_SUBSTR),
3296 "Attempt to use reference as lvalue in substr"
3298 tmps = SvPV_force_nomg(sv, curlen);
3299 if (DO_UTF8(repl_sv) && repl_len) {
3301 /* Upgrade the dest, and recalculate tmps in case the buffer
3302 * got reallocated; curlen may also have been changed */
3303 sv_utf8_upgrade_nomg(sv);
3304 tmps = SvPV_nomg(sv, curlen);
3307 else if (DO_UTF8(sv))
3308 repl_need_utf8_upgrade = TRUE;
3310 else tmps = SvPV_const(sv, curlen);
3312 utf8_curlen = sv_or_pv_len_utf8(sv, tmps, curlen);
3313 if (utf8_curlen == curlen)
3316 curlen = utf8_curlen;
3322 STRLEN pos, len, byte_len, byte_pos;
3324 if (!translate_substr_offsets(
3325 curlen, pos1_iv, pos1_is_uv, len_iv, len_is_uv, &pos, &len
3329 byte_pos = utf8_curlen
3330 ? sv_or_pv_pos_u2b(sv, tmps, pos, &byte_len) : pos;
3335 SvTAINTED_off(TARG); /* decontaminate */
3336 SvUTF8_off(TARG); /* decontaminate */
3337 sv_setpvn(TARG, tmps, byte_len);
3338 #ifdef USE_LOCALE_COLLATE
3339 sv_unmagic(TARG, PERL_MAGIC_collxfrm);
3346 SV* repl_sv_copy = NULL;
3348 if (repl_need_utf8_upgrade) {
3349 repl_sv_copy = newSVsv(repl_sv);
3350 sv_utf8_upgrade(repl_sv_copy);
3351 repl = SvPV_const(repl_sv_copy, repl_len);
3355 sv_insert_flags(sv, byte_pos, byte_len, repl, repl_len, 0);
3356 SvREFCNT_dec(repl_sv_copy);
3359 if (PL_op->op_private & OPpSUBSTR_REPL_FIRST)
3369 Perl_croak(aTHX_ "substr outside of string");
3370 Perl_ck_warner(aTHX_ packWARN(WARN_SUBSTR), "substr outside of string");
3377 const IV size = POPi;
3378 SV* offsetsv = POPs;
3379 SV * const src = POPs;
3380 const I32 lvalue = PL_op->op_flags & OPf_MOD || LVRET;
3386 /* extract a STRLEN-ranged integer value from offsetsv into offset,
3387 * or flag that its out of range */
3389 IV iv = SvIV(offsetsv);
3391 /* avoid a large UV being wrapped to a negative value */
3392 if (SvIOK_UV(offsetsv) && SvUVX(offsetsv) > (UV)IV_MAX)
3393 errflags = LVf_OUT_OF_RANGE;
3395 errflags = (LVf_NEG_OFF|LVf_OUT_OF_RANGE);
3396 #if PTRSIZE < IVSIZE
3397 else if (iv > Size_t_MAX)
3398 errflags = LVf_OUT_OF_RANGE;
3401 offset = (STRLEN)iv;
3404 retuv = errflags ? 0 : do_vecget(src, offset, size);
3406 if (lvalue) { /* it's an lvalue! */
3407 ret = sv_2mortal(newSV_type(SVt_PVLV)); /* Not TARG RT#67838 */
3408 sv_magic(ret, NULL, PERL_MAGIC_vec, NULL, 0);
3410 LvTARG(ret) = SvREFCNT_inc_simple(src);
3411 LvTARGOFF(ret) = offset;
3412 LvTARGLEN(ret) = size;
3413 LvFLAGS(ret) = errflags;
3417 SvTAINTED_off(TARG); /* decontaminate */
3421 sv_setuv(ret, retuv);
3429 /* also used for: pp_rindex() */
3442 const char *little_p;
3445 const bool is_index = PL_op->op_type == OP_INDEX;
3446 const bool threeargs = MAXARG >= 3 && (TOPs || ((void)POPs,0));
3452 big_p = SvPV_const(big, biglen);
3453 little_p = SvPV_const(little, llen);
3455 big_utf8 = DO_UTF8(big);
3456 little_utf8 = DO_UTF8(little);
3457 if (big_utf8 ^ little_utf8) {
3458 /* One needs to be upgraded. */
3460 /* Well, maybe instead we might be able to downgrade the small
3462 char * const pv = (char*)bytes_from_utf8((U8 *)little_p, &llen,
3465 /* If the large string is ISO-8859-1, and it's not possible to
3466 convert the small string to ISO-8859-1, then there is no
3467 way that it could be found anywhere by index. */
3472 /* At this point, pv is a malloc()ed string. So donate it to temp
3473 to ensure it will get free()d */
3474 little = temp = newSV(0);
3475 sv_usepvn(temp, pv, llen);
3476 little_p = SvPVX(little);
3478 temp = newSVpvn(little_p, llen);
3480 sv_utf8_upgrade(temp);
3482 little_p = SvPV_const(little, llen);
3485 if (SvGAMAGIC(big)) {
3486 /* Life just becomes a lot easier if I use a temporary here.
3487 Otherwise I need to avoid calls to sv_pos_u2b(), which (dangerously)
3488 will trigger magic and overloading again, as will fbm_instr()
3490 big = newSVpvn_flags(big_p, biglen,
3491 SVs_TEMP | (big_utf8 ? SVf_UTF8 : 0));
3494 if (SvGAMAGIC(little) || (is_index && !SvOK(little))) {
3495 /* index && SvOK() is a hack. fbm_instr() calls SvPV_const, which will
3496 warn on undef, and we've already triggered a warning with the
3497 SvPV_const some lines above. We can't remove that, as we need to
3498 call some SvPV to trigger overloading early and find out if the
3500 This is all getting too messy. The API isn't quite clean enough,
3501 because data access has side effects.
3503 little = newSVpvn_flags(little_p, llen,
3504 SVs_TEMP | (little_utf8 ? SVf_UTF8 : 0));
3505 little_p = SvPVX(little);
3509 offset = is_index ? 0 : biglen;
3511 if (big_utf8 && offset > 0)
3512 offset = sv_pos_u2b_flags(big, offset, 0, SV_CONST_RETURN);
3518 else if (offset > (SSize_t)biglen)
3520 if (!(little_p = is_index
3521 ? fbm_instr((unsigned char*)big_p + offset,
3522 (unsigned char*)big_p + biglen, little, 0)
3523 : rninstr(big_p, big_p + offset,
3524 little_p, little_p + llen)))
3527 retval = little_p - big_p;
3528 if (retval > 1 && big_utf8)
3529 retval = sv_pos_b2u_flags(big, retval, SV_CONST_RETURN);
3534 /* OPpTRUEBOOL indicates an '== -1' has been optimised away */
3535 if (PL_op->op_private & OPpTRUEBOOL) {
3536 PUSHs( ((retval != -1) ^ cBOOL(PL_op->op_private & OPpINDEX_BOOLNEG))
3537 ? &PL_sv_yes : &PL_sv_no);
3538 if (PL_op->op_private & OPpTARGET_MY)
3539 /* $lex = (index() == -1) */
3540 sv_setsv(TARG, TOPs);
3549 dSP; dMARK; dORIGMARK; dTARGET;
3550 SvTAINTED_off(TARG);
3551 do_sprintf(TARG, SP-MARK, MARK+1);
3552 TAINT_IF(SvTAINTED(TARG));
3564 const U8 *s = (U8*)SvPV_const(argsv, len);
3567 ? (len ? utf8n_to_uvchr(s, len, 0, UTF8_ALLOW_ANYUV) : 0)
3581 if (UNLIKELY(SvAMAGIC(top)))
3583 if (UNLIKELY(isinfnansv(top)))
3584 Perl_croak(aTHX_ "Cannot chr %" NVgf, SvNV(top));
3586 if (!IN_BYTES /* under bytes, chr(-1) eq chr(0xff), etc. */
3587 && ((SvIOKp(top) && !SvIsUV(top) && SvIV_nomg(top) < 0)
3589 ((SvNOKp(top) || (SvOK(top) && !SvIsUV(top)))
3590 && SvNV_nomg(top) < 0.0)))
3592 if (ckWARN(WARN_UTF8)) {
3593 if (SvGMAGICAL(top)) {
3594 SV *top2 = sv_newmortal();
3595 sv_setsv_nomg(top2, top);
3598 Perl_warner(aTHX_ packWARN(WARN_UTF8),
3599 "Invalid negative number (%" SVf ") in chr", SVfARG(top));
3601 value = UNICODE_REPLACEMENT;
3603 value = SvUV_nomg(top);
3607 SvUPGRADE(TARG,SVt_PV);
3609 if (value > 255 && !IN_BYTES) {
3610 SvGROW(TARG, (STRLEN)UVCHR_SKIP(value)+1);
3611 tmps = (char*)uvchr_to_utf8_flags((U8*)SvPVX(TARG), value, 0);
3612 SvCUR_set(TARG, tmps - SvPVX_const(TARG));
3614 (void)SvPOK_only(TARG);
3623 *tmps++ = (char)value;
3625 (void)SvPOK_only(TARG);
3637 const char *tmps = SvPV_const(left, len);
3639 if (DO_UTF8(left)) {
3640 /* If Unicode, try to downgrade.
3641 * If not possible, croak.
3642 * Yes, we made this up. */
3643 SV* const tsv = newSVpvn_flags(tmps, len, SVf_UTF8|SVs_TEMP);
3645 sv_utf8_downgrade(tsv, FALSE);
3646 tmps = SvPV_const(tsv, len);
3648 # ifdef USE_ITHREADS
3650 if (!PL_reentrant_buffer->_crypt_struct_buffer) {
3651 /* This should be threadsafe because in ithreads there is only
3652 * one thread per interpreter. If this would not be true,
3653 * we would need a mutex to protect this malloc. */
3654 PL_reentrant_buffer->_crypt_struct_buffer =
3655 (struct crypt_data *)safemalloc(sizeof(struct crypt_data));
3656 #if defined(__GLIBC__) || defined(__EMX__)
3657 if (PL_reentrant_buffer->_crypt_struct_buffer) {
3658 PL_reentrant_buffer->_crypt_struct_buffer->initialized = 0;
3659 #if (defined(__GLIBC__) && __GLIBC__ == 2) && \
3660 (defined(__GLIBC_MINOR__) && __GLIBC_MINOR__ >= 2 && __GLIBC_MINOR__ < 4)
3661 /* work around glibc-2.2.5 bug, has been fixed at some
3662 * time in glibc-2.3.X */
3663 PL_reentrant_buffer->_crypt_struct_buffer->current_saltbits = 0;
3668 # endif /* HAS_CRYPT_R */
3669 # endif /* USE_ITHREADS */
3671 sv_setpv(TARG, fcrypt(tmps, SvPV_nolen_const(right)));
3673 sv_setpv(TARG, PerlProc_crypt(tmps, SvPV_nolen_const(right)));
3680 "The crypt() function is unimplemented due to excessive paranoia.");
3684 /* Generally UTF-8 and UTF-EBCDIC are indistinguishable at this level. So
3685 * most comments below say UTF-8, when in fact they mean UTF-EBCDIC as well */
3688 /* also used for: pp_lcfirst() */
3692 /* Actually is both lcfirst() and ucfirst(). Only the first character
3693 * changes. This means that possibly we can change in-place, ie., just
3694 * take the source and change that one character and store it back, but not
3695 * if read-only etc, or if the length changes */
3699 STRLEN slen; /* slen is the byte length of the whole SV. */
3702 bool inplace; /* ? Convert first char only, in-place */
3703 bool doing_utf8 = FALSE; /* ? using utf8 */
3704 bool convert_source_to_utf8 = FALSE; /* ? need to convert */
3705 const int op_type = PL_op->op_type;
3708 U8 tmpbuf[UTF8_MAXBYTES_CASE+1];
3709 STRLEN ulen; /* ulen is the byte length of the original Unicode character
3710 * stored as UTF-8 at s. */
3711 STRLEN tculen; /* tculen is the byte length of the freshly titlecased (or
3712 * lowercased) character stored in tmpbuf. May be either
3713 * UTF-8 or not, but in either case is the number of bytes */
3714 bool remove_dot_above = FALSE;
3716 s = (const U8*)SvPV_const(source, slen);
3718 /* We may be able to get away with changing only the first character, in
3719 * place, but not if read-only, etc. Later we may discover more reasons to
3720 * not convert in-place. */
3721 inplace = !SvREADONLY(source) && SvPADTMP(source);
3723 #ifdef USE_LOCALE_CTYPE
3725 if (IN_LC_RUNTIME(LC_CTYPE)) {
3726 _CHECK_AND_WARN_PROBLEMATIC_LOCALE;
3731 /* First calculate what the changed first character should be. This affects
3732 * whether we can just swap it out, leaving the rest of the string unchanged,
3733 * or even if have to convert the dest to UTF-8 when the source isn't */
3735 if (! slen) { /* If empty */
3736 need = 1; /* still need a trailing NUL */
3740 else if (DO_UTF8(source)) { /* Is the source utf8? */
3743 if (op_type == OP_UCFIRST) {
3744 #ifdef USE_LOCALE_CTYPE
3745 _toTITLE_utf8_flags(s, s +slen, tmpbuf, &tculen, IN_LC_RUNTIME(LC_CTYPE));
3747 _toTITLE_utf8_flags(s, s +slen, tmpbuf, &tculen, 0);
3752 #ifdef USE_LOCALE_CTYPE
3754 _toLOWER_utf8_flags(s, s + slen, tmpbuf, &tculen, IN_LC_RUNTIME(LC_CTYPE));
3756 /* In turkic locales, lower casing an 'I' normally yields U+0131,
3757 * LATIN SMALL LETTER DOTLESS I, but not if the grapheme also
3758 * contains a COMBINING DOT ABOVE. Instead it is treated like
3759 * LATIN CAPITAL LETTER I WITH DOT ABOVE lowercased to 'i'. The
3760 * call to lowercase above has handled this. But SpecialCasing.txt
3761 * says we are supposed to remove the COMBINING DOT ABOVE. We can
3762 * tell if we have this situation if I ==> i in a turkic locale. */
3763 if ( UNLIKELY(PL_in_utf8_turkic_locale)
3764 && IN_LC_RUNTIME(LC_CTYPE)
3765 && (UNLIKELY(*s == 'I' && tmpbuf[0] == 'i')))
3767 /* Here, we know there was a COMBINING DOT ABOVE. We won't be
3768 * able to handle this in-place. */
3771 /* It seems likely that the DOT will immediately follow the
3772 * 'I'. If so, we can remove it simply by indicating to the
3773 * code below to start copying the source just beyond the DOT.
3774 * We know its length is 2 */
3775 if (LIKELY(memBEGINs(s + 1, s + slen, COMBINING_DOT_ABOVE_UTF8))) {
3778 else { /* But if it doesn't follow immediately, set a flag for
3780 remove_dot_above = TRUE;
3784 PERL_UNUSED_VAR(remove_dot_above);
3786 _toLOWER_utf8_flags(s, s + slen, tmpbuf, &tculen, 0);
3791 /* we can't do in-place if the length changes. */
3792 if (ulen != tculen) inplace = FALSE;
3793 need = slen + 1 - ulen + tculen;
3795 else { /* Non-zero length, non-UTF-8, Need to consider locale and if
3796 * latin1 is treated as caseless. Note that a locale takes
3798 ulen = 1; /* Original character is 1 byte */
3799 tculen = 1; /* Most characters will require one byte, but this will
3800 * need to be overridden for the tricky ones */
3804 #ifdef USE_LOCALE_CTYPE
3806 if (IN_LC_RUNTIME(LC_CTYPE)) {
3807 if ( UNLIKELY(PL_in_utf8_turkic_locale)
3808 && ( (op_type == OP_LCFIRST && UNLIKELY(*s == 'I'))
3809 || (op_type == OP_UCFIRST && UNLIKELY(*s == 'i'))))
3811 if (*s == 'I') { /* lcfirst('I') */
3812 tmpbuf[0] = UTF8_TWO_BYTE_HI(LATIN_SMALL_LETTER_DOTLESS_I);
3813 tmpbuf[1] = UTF8_TWO_BYTE_LO(LATIN_SMALL_LETTER_DOTLESS_I);
3815 else { /* ucfirst('i') */
3816 tmpbuf[0] = UTF8_TWO_BYTE_HI(LATIN_CAPITAL_LETTER_I_WITH_DOT_ABOVE);
3817 tmpbuf[1] = UTF8_TWO_BYTE_LO(LATIN_CAPITAL_LETTER_I_WITH_DOT_ABOVE);
3822 convert_source_to_utf8 = TRUE;
3823 need += variant_under_utf8_count(s, s + slen);
3825 else if (op_type == OP_LCFIRST) {
3827 /* For lc, there are no gotchas for UTF-8 locales (other than
3828 * the turkish ones already handled above) */
3829 *tmpbuf = toLOWER_LC(*s);
3831 else { /* ucfirst */
3833 /* But for uc, some characters require special handling */
3834 if (IN_UTF8_CTYPE_LOCALE) {
3838 /* This would be a bug if any locales have upper and title case
3840 *tmpbuf = (U8) toUPPER_LC(*s);
3845 /* Here, not in locale. If not using Unicode rules, is a simple
3846 * lower/upper, depending */
3847 if (! IN_UNI_8_BIT) {
3848 *tmpbuf = (op_type == OP_LCFIRST)
3852 else if (op_type == OP_LCFIRST) {
3853 /* lower case the first letter: no trickiness for any character */
3854 *tmpbuf = toLOWER_LATIN1(*s);
3857 /* Here, is ucfirst non-UTF-8, not in locale (unless that locale is
3858 * non-turkic UTF-8, which we treat as not in locale), and cased
3861 #ifdef USE_LOCALE_CTYPE
3865 title_ord = _to_upper_title_latin1(*s, tmpbuf, &tculen, 's');
3867 assert(tculen == 2);
3869 /* If the result is an upper Latin1-range character, it can
3870 * still be represented in one byte, which is its ordinal */
3871 if (UTF8_IS_DOWNGRADEABLE_START(*tmpbuf)) {
3872 *tmpbuf = (U8) title_ord;
3876 /* Otherwise it became more than one ASCII character (in
3877 * the case of LATIN_SMALL_LETTER_SHARP_S) or changed to
3878 * beyond Latin1, so the number of bytes changed, so can't
3879 * replace just the first character in place. */
3882 /* If the result won't fit in a byte, the entire result
3883 * will have to be in UTF-8. Allocate enough space for the
3884 * expanded first byte, and if UTF-8, the rest of the input
3885 * string, some or all of which may also expand to two
3886 * bytes, plus the terminating NUL. */
3887 if (title_ord > 255) {
3889 convert_source_to_utf8 = TRUE;
3891 + variant_under_utf8_count(s, s + slen)
3894 /* The (converted) UTF-8 and UTF-EBCDIC lengths of all
3895 * characters whose title case is above 255 is
3899 else { /* LATIN_SMALL_LETTER_SHARP_S expands by 1 byte */
3900 need = slen + 1 + 1;
3904 } /* End of use Unicode (Latin1) semantics */
3905 } /* End of changing the case of the first character */
3907 /* Here, have the first character's changed case stored in tmpbuf. Ready to
3908 * generate the result */
3911 /* We can convert in place. This means we change just the first
3912 * character without disturbing the rest; no need to grow */
3914 s = d = (U8*)SvPV_force_nomg(source, slen);
3920 /* Here, we can't convert in place; we earlier calculated how much
3921 * space we will need, so grow to accommodate that */
3922 SvUPGRADE(dest, SVt_PV);
3923 d = (U8*)SvGROW(dest, need);
3924 (void)SvPOK_only(dest);
3931 if (! convert_source_to_utf8) {
3933 /* Here both source and dest are in UTF-8, but have to create
3934 * the entire output. We initialize the result to be the
3935 * title/lower cased first character, and then append the rest
3937 sv_setpvn(dest, (char*)tmpbuf, tculen);
3940 /* But this boolean being set means we are in a turkic
3941 * locale, and there is a DOT character that needs to be
3942 * removed, and it isn't immediately after the current
3943 * character. Keep concatenating characters to the output
3944 * one at a time, until we find the DOT, which we simply
3946 if (UNLIKELY(remove_dot_above)) {
3948 Size_t this_len = UTF8SKIP(s + ulen);
3950 sv_catpvn(dest, (char*)(s + ulen), this_len);
3953 if (memBEGINs(s + ulen, s + slen, COMBINING_DOT_ABOVE_UTF8)) {
3957 } while (s + ulen < s + slen);
3960 /* The rest of the string can be concatenated unchanged,
3962 sv_catpvn(dest, (char*)(s + ulen), slen - ulen);
3966 const U8 *const send = s + slen;
3968 /* Here the dest needs to be in UTF-8, but the source isn't,
3969 * except we earlier UTF-8'd the first character of the source
3970 * into tmpbuf. First put that into dest, and then append the
3971 * rest of the source, converting it to UTF-8 as we go. */
3973 /* Assert tculen is 2 here because the only characters that
3974 * get to this part of the code have 2-byte UTF-8 equivalents */
3975 assert(tculen == 2);
3977 *d++ = *(tmpbuf + 1);
3978 s++; /* We have just processed the 1st char */
3981 append_utf8_from_native_byte(*s, &d);
3986 SvCUR_set(dest, d - (U8*)SvPVX_const(dest));
3990 else { /* in-place UTF-8. Just overwrite the first character */
3991 Copy(tmpbuf, d, tculen, U8);
3992 SvCUR_set(dest, need - 1);
3996 else { /* Neither source nor dest are, nor need to be UTF-8 */
3998 if (inplace) { /* in-place, only need to change the 1st char */
4001 else { /* Not in-place */
4003 /* Copy the case-changed character(s) from tmpbuf */
4004 Copy(tmpbuf, d, tculen, U8);
4005 d += tculen - 1; /* Code below expects d to point to final
4006 * character stored */
4009 else { /* empty source */
4010 /* See bug #39028: Don't taint if empty */
4014 /* In a "use bytes" we don't treat the source as UTF-8, but, still want
4015 * the destination to retain that flag */
4016 if (DO_UTF8(source))
4019 if (!inplace) { /* Finish the rest of the string, unchanged */
4020 /* This will copy the trailing NUL */
4021 Copy(s + 1, d + 1, slen, U8);
4022 SvCUR_set(dest, need - 1);
4025 #ifdef USE_LOCALE_CTYPE
4026 if (IN_LC_RUNTIME(LC_CTYPE)) {
4031 if (dest != source && SvTAINTED(source))
4050 if ( SvPADTMP(source)
4051 && !SvREADONLY(source) && SvPOK(source)
4054 #ifdef USE_LOCALE_CTYPE
4055 (IN_LC_RUNTIME(LC_CTYPE))
4056 ? ! IN_UTF8_CTYPE_LOCALE
4062 /* We can convert in place. The reason we can't if in UNI_8_BIT is to
4063 * make the loop tight, so we overwrite the source with the dest before
4064 * looking at it, and we need to look at the original source
4065 * afterwards. There would also need to be code added to handle
4066 * switching to not in-place in midstream if we run into characters
4067 * that change the length. Since being in locale overrides UNI_8_BIT,
4068 * that latter becomes irrelevant in the above test; instead for
4069 * locale, the size can't normally change, except if the locale is a
4072 s = d = (U8*)SvPV_force_nomg(source, len);
4079 s = (const U8*)SvPV_nomg_const(source, len);
4082 SvUPGRADE(dest, SVt_PV);
4083 d = (U8*)SvGROW(dest, min);
4084 (void)SvPOK_only(dest);
4089 #ifdef USE_LOCALE_CTYPE
4091 if (IN_LC_RUNTIME(LC_CTYPE)) {
4092 _CHECK_AND_WARN_PROBLEMATIC_LOCALE;
4097 /* Overloaded values may have toggled the UTF-8 flag on source, so we need
4098 to check DO_UTF8 again here. */
4100 if (DO_UTF8(source)) {
4101 const U8 *const send = s + len;
4102 U8 tmpbuf[UTF8_MAXBYTES_CASE+1];
4104 #define GREEK_CAPITAL_LETTER_IOTA 0x0399
4105 #define COMBINING_GREEK_YPOGEGRAMMENI 0x0345
4106 /* All occurrences of these are to be moved to follow any other marks.
4107 * This is context-dependent. We may not be passed enough context to
4108 * move the iota subscript beyond all of them, but we do the best we can
4109 * with what we're given. The result is always better than if we
4110 * hadn't done this. And, the problem would only arise if we are
4111 * passed a character without all its combining marks, which would be
4112 * the caller's mistake. The information this is based on comes from a
4113 * comment in Unicode SpecialCasing.txt, (and the Standard's text
4114 * itself) and so can't be checked properly to see if it ever gets
4115 * revised. But the likelihood of it changing is remote */
4116 bool in_iota_subscript = FALSE;
4122 if (UNLIKELY(in_iota_subscript)) {
4123 UV cp = utf8_to_uvchr_buf(s, send, NULL);
4125 if (! _invlist_contains_cp(PL_utf8_mark, cp)) {
4127 /* A non-mark. Time to output the iota subscript */
4128 *d++ = UTF8_TWO_BYTE_HI(GREEK_CAPITAL_LETTER_IOTA);
4129 *d++ = UTF8_TWO_BYTE_LO(GREEK_CAPITAL_LETTER_IOTA);
4130 in_iota_subscript = FALSE;
4134 /* Then handle the current character. Get the changed case value
4135 * and copy it to the output buffer */
4138 #ifdef USE_LOCALE_CTYPE
4139 uv = _toUPPER_utf8_flags(s, send, tmpbuf, &ulen, IN_LC_RUNTIME(LC_CTYPE));
4141 uv = _toUPPER_utf8_flags(s, send, tmpbuf, &ulen, 0);
4143 if (uv == GREEK_CAPITAL_LETTER_IOTA
4144 && utf8_to_uvchr_buf(s, send, 0) == COMBINING_GREEK_YPOGEGRAMMENI)
4146 in_iota_subscript = TRUE;
4149 if (ulen > u && (SvLEN(dest) < (min += ulen - u))) {
4150 /* If the eventually required minimum size outgrows the
4151 * available space, we need to grow. */
4152 const UV o = d - (U8*)SvPVX_const(dest);
4154 /* If someone uppercases one million U+03B0s we SvGROW()
4155 * one million times. Or we could try guessing how much to
4156 * allocate without allocating too much. But we can't
4157 * really guess without examining the rest of the string.
4158 * Such is life. See corresponding comment in lc code for
4160 d = o + (U8*) SvGROW(dest, min);
4162 Copy(tmpbuf, d, ulen, U8);
4167 if (in_iota_subscript) {
4168 *d++ = UTF8_TWO_BYTE_HI(GREEK_CAPITAL_LETTER_IOTA);
4169 *d++ = UTF8_TWO_BYTE_LO(GREEK_CAPITAL_LETTER_IOTA);
4174 SvCUR_set(dest, d - (U8*)SvPVX_const(dest));
4176 else { /* Not UTF-8 */
4178 const U8 *const send = s + len;
4180 /* Use locale casing if in locale; regular style if not treating
4181 * latin1 as having case; otherwise the latin1 casing. Do the
4182 * whole thing in a tight loop, for speed, */
4183 #ifdef USE_LOCALE_CTYPE
4184 if (IN_LC_RUNTIME(LC_CTYPE)) {
4185 if (IN_UTF8_CTYPE_LOCALE) {
4188 for (; s < send; d++, s++)
4189 *d = (U8) toUPPER_LC(*s);
4193 if (! IN_UNI_8_BIT) {
4194 for (; s < send; d++, s++) {
4199 #ifdef USE_LOCALE_CTYPE
4202 for (; s < send; d++, s++) {
4205 *d = toUPPER_LATIN1_MOD(*s);
4206 if ( LIKELY(*d != LATIN_SMALL_LETTER_Y_WITH_DIAERESIS)
4208 #ifdef USE_LOCALE_CTYPE
4210 && (LIKELY( ! PL_in_utf8_turkic_locale
4211 || ! IN_LC_RUNTIME(LC_CTYPE))
4219 /* The mainstream case is the tight loop above. To avoid
4220 * extra tests in that, all three characters that always
4221 * require special handling are mapped by the MOD to the
4222 * one tested just above. Use the source to distinguish
4223 * between those cases */
4225 #if UNICODE_MAJOR_VERSION > 2 \
4226 || (UNICODE_MAJOR_VERSION == 2 && UNICODE_DOT_VERSION >= 1 \
4227 && UNICODE_DOT_DOT_VERSION >= 8)
4228 if (*s == LATIN_SMALL_LETTER_SHARP_S) {
4230 /* uc() of this requires 2 characters, but they are
4231 * ASCII. If not enough room, grow the string */
4232 if (SvLEN(dest) < ++min) {
4233 const UV o = d - (U8*)SvPVX_const(dest);
4234 d = o + (U8*) SvGROW(dest, min);
4236 *d++ = 'S'; *d = 'S'; /* upper case is 'SS' */
4237 continue; /* Back to the tight loop; still in ASCII */
4241 /* The other special handling characters have their
4242 * upper cases outside the latin1 range, hence need to be
4243 * in UTF-8, so the whole result needs to be in UTF-8.
4245 * So, here we are somewhere in the middle of processing a
4246 * non-UTF-8 string, and realize that we will have to
4247 * convert the whole thing to UTF-8. What to do? There
4248 * are several possibilities. The simplest to code is to
4249 * convert what we have so far, set a flag, and continue on
4250 * in the loop. The flag would be tested each time through
4251 * the loop, and if set, the next character would be
4252 * converted to UTF-8 and stored. But, I (khw) didn't want
4253 * to slow down the mainstream case at all for this fairly
4254 * rare case, so I didn't want to add a test that didn't
4255 * absolutely have to be there in the loop, besides the
4256 * possibility that it would get too complicated for
4257 * optimizers to deal with. Another possibility is to just
4258 * give up, convert the source to UTF-8, and restart the
4259 * function that way. Another possibility is to convert
4260 * both what has already been processed and what is yet to
4261 * come separately to UTF-8, then jump into the loop that
4262 * handles UTF-8. But the most efficient time-wise of the
4263 * ones I could think of is what follows, and turned out to
4264 * not require much extra code.
4266 * First, calculate the extra space needed for the
4267 * remainder of the source needing to be in UTF-8. Except
4268 * for the 'i' in Turkic locales, in UTF-8 strings, the
4269 * uppercase of a character below 256 occupies the same
4270 * number of bytes as the original. Therefore, the space
4271 * needed is the that number plus the number of characters
4272 * that become two bytes when converted to UTF-8, plus, in
4273 * turkish locales, the number of 'i's. */
4275 extra = send - s + variant_under_utf8_count(s, send);
4277 #ifdef USE_LOCALE_CTYPE
4279 if (UNLIKELY(*s == 'i')) { /* We wouldn't get an 'i' here
4280 unless are in a Turkic
4282 const U8 * s_peek = s;
4287 s_peek = (U8 *) memchr(s_peek + 1, 'i',
4288 send - (s_peek + 1));
4289 } while (s_peek != NULL);
4293 /* Convert what we have so far into UTF-8, telling the
4294 * function that we know it should be converted, and to
4295 * allow extra space for what we haven't processed yet.
4297 * This may cause the string pointer to move, so need to
4298 * save and re-find it. */
4300 len = d - (U8*)SvPVX_const(dest);
4301 SvCUR_set(dest, len);
4302 len = sv_utf8_upgrade_flags_grow(dest,
4303 SV_GMAGIC|SV_FORCE_UTF8_UPGRADE,
4305 + 1 /* trailing NUL */ );
4306 d = (U8*)SvPVX(dest) + len;
4308 /* Now process the remainder of the source, simultaneously
4309 * converting to upper and UTF-8.
4311 * To avoid extra tests in the loop body, and since the
4312 * loop is so simple, split out the rare Turkic case into
4315 #ifdef USE_LOCALE_CTYPE
4316 if ( UNLIKELY(PL_in_utf8_turkic_locale)
4317 && UNLIKELY(IN_LC_RUNTIME(LC_CTYPE)))
4319 for (; s < send; s++) {
4321 *d++ = UTF8_TWO_BYTE_HI(LATIN_CAPITAL_LETTER_I_WITH_DOT_ABOVE);
4322 *d++ = UTF8_TWO_BYTE_LO(LATIN_CAPITAL_LETTER_I_WITH_DOT_ABOVE);
4325 (void) _to_upper_title_latin1(*s, d, &len, 'S');
4332 for (; s < send; s++) {
4333 (void) _to_upper_title_latin1(*s, d, &len, 'S');
4337 /* Here have processed the whole source; no need to
4338 * continue with the outer loop. Each character has been
4339 * converted to upper case and converted to UTF-8. */
4341 } /* End of processing all latin1-style chars */
4342 } /* End of processing all chars */
4343 } /* End of source is not empty */
4345 if (source != dest) {
4346 *d = '\0'; /* Here d points to 1 after last char, add NUL */
4347 SvCUR_set(dest, d - (U8*)SvPVX_const(dest));
4349 } /* End of isn't utf8 */
4350 #ifdef USE_LOCALE_CTYPE
4351 if (IN_LC_RUNTIME(LC_CTYPE)) {
4356 if (dest != source && SvTAINTED(source))
4371 bool has_turkic_I = FALSE;
4375 if ( SvPADTMP(source)
4376 && !SvREADONLY(source) && SvPOK(source)
4379 #ifdef USE_LOCALE_CTYPE
4381 && ( LIKELY(! IN_LC_RUNTIME(LC_CTYPE))
4382 || LIKELY(! PL_in_utf8_turkic_locale))
4388 /* We can convert in place, as, outside of Turkic UTF-8 locales,
4389 * lowercasing anything in the latin1 range (or else DO_UTF8 would have
4390 * been on) doesn't lengthen it. */
4392 s = d = (U8*)SvPV_force_nomg(source, len);
4399 s = (const U8*)SvPV_nomg_const(source, len);
4402 SvUPGRADE(dest, SVt_PV);
4403 d = (U8*)SvGROW(dest, min);
4404 (void)SvPOK_only(dest);
4409 #ifdef USE_LOCALE_CTYPE
4411 if (IN_LC_RUNTIME(LC_CTYPE)) {
4414 _CHECK_AND_WARN_PROBLEMATIC_LOCALE;
4416 /* Lowercasing in a Turkic locale can cause non-UTF-8 to need to become
4417 * UTF-8 for the single case of the character 'I' */
4418 if ( UNLIKELY(PL_in_utf8_turkic_locale)
4419 && ! DO_UTF8(source)
4420 && (next_I = (U8 *) memchr(s, 'I', len)))
4423 const U8 *const send = s + len;
4428 next_I = (U8 *) memchr(next_I + 1, 'I',
4429 send - (next_I + 1));
4430 } while (next_I != NULL);
4432 /* Except for the 'I', in UTF-8 strings, the lower case of a
4433 * character below 256 occupies the same number of bytes as the
4434 * original. Therefore, the space needed is the original length
4435 * plus I_count plus the number of characters that become two bytes
4436 * when converted to UTF-8 */
4437 sv_utf8_upgrade_flags_grow(dest, 0, len
4439 + variant_under_utf8_count(s, send)
4440 + 1 /* Trailing NUL */ );
4441 d = (U8*)SvPVX(dest);
4442 has_turkic_I = TRUE;
4448 /* Overloaded values may have toggled the UTF-8 flag on source, so we need
4449 to check DO_UTF8 again here. */
4451 if (DO_UTF8(source)) {
4452 const U8 *const send = s + len;
4453 U8 tmpbuf[UTF8_MAXBYTES_CASE+1];
4454 bool remove_dot_above = FALSE;
4457 const STRLEN u = UTF8SKIP(s);
4460 #ifdef USE_LOCALE_CTYPE
4462 _toLOWER_utf8_flags(s, send, tmpbuf, &ulen, IN_LC_RUNTIME(LC_CTYPE));
4464 /* If we are in a Turkic locale, we have to do more work. As noted
4465 * in the comments for lcfirst, there is a special case if a 'I'
4466 * is in a grapheme with COMBINING DOT ABOVE UTF8. It turns into a
4467 * 'i', and the DOT must be removed. We check for that situation,
4468 * and set a flag if the DOT is there. Then each time through the
4469 * loop, we have to see if we need to remove the next DOT above,
4470 * and if so, do it. We know that there is a DOT because
4471 * _toLOWER_utf8_flags() wouldn't have returned 'i' unless there
4472 * was one in a proper position. */
4473 if ( UNLIKELY(PL_in_utf8_turkic_locale)
4474 && IN_LC_RUNTIME(LC_CTYPE))
4476 if ( UNLIKELY(remove_dot_above)
4477 && memBEGINs(tmpbuf, sizeof(tmpbuf), COMBINING_DOT_ABOVE_UTF8))
4480 remove_dot_above = FALSE;
4483 else if (UNLIKELY(*s == 'I' && tmpbuf[0] == 'i')) {
4484 remove_dot_above = TRUE;
4488 PERL_UNUSED_VAR(remove_dot_above);
4490 _toLOWER_utf8_flags(s, send, tmpbuf, &ulen, 0);
4493 /* Here is where we would do context-sensitive actions for the
4494 * Greek final sigma. See the commit message for 86510fb15 for why
4495 * there isn't any */
4497 if (ulen > u && (SvLEN(dest) < (min += ulen - u))) {
4499 /* If the eventually required minimum size outgrows the
4500 * available space, we need to grow. */
4501 const UV o = d - (U8*)SvPVX_const(dest);
4503 /* If someone lowercases one million U+0130s we SvGROW() one
4504 * million times. Or we could try guessing how much to
4505 * allocate without allocating too much. Such is life.
4506 * Another option would be to grow an extra byte or two more
4507 * each time we need to grow, which would cut down the million
4508 * to 500K, with little waste */
4509 d = o + (U8*) SvGROW(dest, min);
4512 /* Copy the newly lowercased letter to the output buffer we're
4514 Copy(tmpbuf, d, ulen, U8);
4517 } /* End of looping through the source string */
4520 SvCUR_set(dest, d - (U8*)SvPVX_const(dest));
4521 } else { /* 'source' not utf8 */
4523 const U8 *const send = s + len;
4525 /* Use locale casing if in locale; regular style if not treating
4526 * latin1 as having case; otherwise the latin1 casing. Do the
4527 * whole thing in a tight loop, for speed, */
4528 #ifdef USE_LOCALE_CTYPE
4529 if (IN_LC_RUNTIME(LC_CTYPE)) {
4530 if (LIKELY( ! has_turkic_I)) {
4531 for (; s < send; d++, s++)
4532 *d = toLOWER_LC(*s);
4534 else { /* This is the only case where lc() converts 'dest'
4535 into UTF-8 from a non-UTF-8 'source' */
4536 for (; s < send; s++) {
4538 *d++ = UTF8_TWO_BYTE_HI(LATIN_SMALL_LETTER_DOTLESS_I);
4539 *d++ = UTF8_TWO_BYTE_LO(LATIN_SMALL_LETTER_DOTLESS_I);
4542 append_utf8_from_native_byte(toLOWER_LATIN1(*s), &d);
4549 if (! IN_UNI_8_BIT) {
4550 for (; s < send; d++, s++) {
4555 for (; s < send; d++, s++) {
4556 *d = toLOWER_LATIN1(*s);
4560 if (source != dest) {
4562 SvCUR_set(dest, d - (U8*)SvPVX_const(dest));
4565 #ifdef USE_LOCALE_CTYPE
4566 if (IN_LC_RUNTIME(LC_CTYPE)) {
4571 if (dest != source && SvTAINTED(source))
4580 SV * const sv = TOPs;
4582 const char *s = SvPV_const(sv,len);
4584 SvUTF8_off(TARG); /* decontaminate */
4587 SvUPGRADE(TARG, SVt_PV);
4588 SvGROW(TARG, (len * 2) + 1);
4592 STRLEN ulen = UTF8SKIP(s);
4593 bool to_quote = FALSE;
4595 if (UTF8_IS_INVARIANT(*s)) {
4596 if (_isQUOTEMETA(*s)) {
4600 else if (UTF8_IS_NEXT_CHAR_DOWNGRADEABLE(s, s + len)) {
4602 #ifdef USE_LOCALE_CTYPE
4603 /* In locale, we quote all non-ASCII Latin1 chars.
4604 * Otherwise use the quoting rules */
4606 IN_LC_RUNTIME(LC_CTYPE)
4609 _isQUOTEMETA(EIGHT_BIT_UTF8_TO_NATIVE(*s, *(s + 1))))
4614 else if (is_QUOTEMETA_high(s)) {
4629 else if (IN_UNI_8_BIT) {
4631 if (_isQUOTEMETA(*s))
4637 /* For non UNI_8_BIT (and hence in locale) just quote all \W
4638 * including everything above ASCII */
4640 if (!isWORDCHAR_A(*s))
4646 SvCUR_set(TARG, d - SvPVX_const(TARG));
4647 (void)SvPOK_only_UTF8(TARG);
4650 sv_setpvn(TARG, s, len);
4666 U8 tmpbuf[UTF8_MAXBYTES_CASE + 1];
4667 #if UNICODE_MAJOR_VERSION > 3 /* no multifolds in early Unicode */ \
4668 || (UNICODE_MAJOR_VERSION == 3 && ( UNICODE_DOT_VERSION > 0) \
4669 || UNICODE_DOT_DOT_VERSION > 0)
4670 const bool full_folding = TRUE; /* This variable is here so we can easily
4671 move to more generality later */
4673 const bool full_folding = FALSE;
4675 const U8 flags = ( full_folding ? FOLD_FLAGS_FULL : 0 )
4676 #ifdef USE_LOCALE_CTYPE
4677 | ( IN_LC_RUNTIME(LC_CTYPE) ? FOLD_FLAGS_LOCALE : 0 )
4681 /* This is a facsimile of pp_lc, but with a thousand bugs thanks to me.
4682 * You are welcome(?) -Hugmeir
4690 s = (const U8*)SvPV_nomg_const(source, len);
4692 if (ckWARN(WARN_UNINITIALIZED))
4693 report_uninit(source);
4700 SvUPGRADE(dest, SVt_PV);
4701 d = (U8*)SvGROW(dest, min);
4702 (void)SvPOK_only(dest);
4708 #ifdef USE_LOCALE_CTYPE
4710 if ( IN_LC_RUNTIME(LC_CTYPE) ) { /* Under locale */
4711 _CHECK_AND_WARN_PROBLEMATIC_LOCALE;
4716 if (DO_UTF8(source)) { /* UTF-8 flagged string. */
4718 const STRLEN u = UTF8SKIP(s);
4721 _toFOLD_utf8_flags(s, send, tmpbuf, &ulen, flags);
4723 if (ulen > u && (SvLEN(dest) < (min += ulen - u))) {
4724 const UV o = d - (U8*)SvPVX_const(dest);
4725 d = o + (U8*) SvGROW(dest, min);
4728 Copy(tmpbuf, d, ulen, U8);
4733 } /* Unflagged string */
4735 #ifdef USE_LOCALE_CTYPE
4736 if ( IN_LC_RUNTIME(LC_CTYPE) ) { /* Under locale */
4737 if (IN_UTF8_CTYPE_LOCALE) {
4738 goto do_uni_folding;
4740 for (; s < send; d++, s++)
4741 *d = (U8) toFOLD_LC(*s);
4745 if ( !IN_UNI_8_BIT ) { /* Under nothing, or bytes */
4746 for (; s < send; d++, s++)
4750 #ifdef USE_LOCALE_CTYPE
4753 /* For ASCII and the Latin-1 range, there's potentially three
4754 * troublesome folds:
4755 * \x{DF} (\N{LATIN SMALL LETTER SHARP S}), which under full
4756 * casefolding becomes 'ss';
4757 * \x{B5} (\N{MICRO SIGN}), which under any fold becomes
4758 * \x{3BC} (\N{GREEK SMALL LETTER MU})
4759 * I only in Turkic locales, this folds to \x{131}
4760 * \N{LATIN SMALL LETTER DOTLESS I}
4761 * For the rest, the casefold is their lowercase. */
4762 for (; s < send; d++, s++) {
4763 if ( UNLIKELY(*s == MICRO_SIGN)
4764 #ifdef USE_LOCALE_CTYPE
4765 || ( UNLIKELY(PL_in_utf8_turkic_locale)
4766 && UNLIKELY(IN_LC_RUNTIME(LC_CTYPE))
4767 && UNLIKELY(*s == 'I'))
4770 Size_t extra = send - s
4771 + variant_under_utf8_count(s, send);
4773 /* \N{MICRO SIGN}'s casefold is \N{GREEK SMALL LETTER MU},
4774 * and 'I' in Turkic locales is \N{LATIN SMALL LETTER
4775 * DOTLESS I} both of which are outside of the latin-1
4776 * range. There's a couple of ways to deal with this -- khw
4777 * discusses them in pp_lc/uc, so go there :) What we do
4778 * here is upgrade what we had already casefolded, then
4779 * enter an inner loop that appends the rest of the
4780 * characters as UTF-8.
4782 * First we calculate the needed size of the upgraded dest
4783 * beyond what's been processed already (the upgrade
4784 * function figures that out). Except for the 'I' in
4785 * Turkic locales, in UTF-8 strings, the fold case of a
4786 * character below 256 occupies the same number of bytes as
4787 * the original (even the Sharp S). Therefore, the space
4788 * needed is the number of bytes remaining plus the number
4789 * of characters that become two bytes when converted to
4790 * UTF-8 plus, in turkish locales, the number of 'I's */
4792 if (UNLIKELY(*s == 'I')) {
4793 const U8 * s_peek = s;
4798 s_peek = (U8 *) memchr(s_peek + 1, 'i',
4799 send - (s_peek + 1));
4800 } while (s_peek != NULL);
4803 /* Growing may move things, so have to save and recalculate
4805 len = d - (U8*)SvPVX_const(dest);
4806 SvCUR_set(dest, len);
4807 len = sv_utf8_upgrade_flags_grow(dest,
4808 SV_GMAGIC|SV_FORCE_UTF8_UPGRADE,
4810 + 1 /* Trailing NUL */ );
4811 d = (U8*)SvPVX(dest) + len;
4813 *d++ = UTF8_TWO_BYTE_HI(GREEK_SMALL_LETTER_MU);
4814 *d++ = UTF8_TWO_BYTE_LO(GREEK_SMALL_LETTER_MU);
4817 for (; s < send; s++) {
4819 _to_uni_fold_flags(*s, d, &ulen, flags);
4824 else if ( UNLIKELY(*s == LATIN_SMALL_LETTER_SHARP_S)
4827 /* Under full casefolding, LATIN SMALL LETTER SHARP S
4828 * becomes "ss", which may require growing the SV. */
4829 if (SvLEN(dest) < ++min) {
4830 const UV o = d - (U8*)SvPVX_const(dest);
4831 d = o + (U8*) SvGROW(dest, min);
4836 else { /* Else, the fold is the lower case */
4837 *d = toLOWER_LATIN1(*s);
4843 SvCUR_set(dest, d - (U8*)SvPVX_const(dest));
4845 #ifdef USE_LOCALE_CTYPE
4846 if (IN_LC_RUNTIME(LC_CTYPE)) {
4851 if (SvTAINTED(source))
4861 dSP; dMARK; dORIGMARK;
4862 AV *const av = MUTABLE_AV(POPs);
4863 const I32 lval = (PL_op->op_flags & OPf_MOD || LVRET);
4865 if (SvTYPE(av) == SVt_PVAV) {
4866 const bool localizing = PL_op->op_private & OPpLVAL_INTRO;
4867 bool can_preserve = FALSE;
4873 can_preserve = SvCANEXISTDELETE(av);
4876 if (lval && localizing) {
4879 for (svp = MARK + 1; svp <= SP; svp++) {
4880 const SSize_t elem = SvIV(*svp);
4884 if (max > AvMAX(av))
4888 while (++MARK <= SP) {
4890 SSize_t elem = SvIV(*MARK);
4891 bool preeminent = TRUE;
4893 if (localizing && can_preserve) {
4894 /* If we can determine whether the element exist,
4895 * Try to preserve the existenceness of a tied array
4896 * element by using EXISTS and DELETE if possible.
4897 * Fallback to FETCH and STORE otherwise. */
4898 preeminent = av_exists(av, elem);
4901 svp = av_fetch(av, elem, lval);
4904 DIE(aTHX_ PL_no_aelem, elem);
4907 save_aelem(av, elem, svp);
4909 SAVEADELETE(av, elem);
4912 *MARK = svp ? *svp : &PL_sv_undef;
4915 if (GIMME_V != G_ARRAY) {
4917 *++MARK = SP > ORIGMARK ? *SP : &PL_sv_undef;
4926 AV *const av = MUTABLE_AV(POPs);
4927 I32 lval = (PL_op->op_flags & OPf_MOD);
4928 SSize_t items = SP - MARK;
4930 if (PL_op->op_private & OPpMAYBE_LVSUB) {
4931 const I32 flags = is_lvalue_sub();
4933 if (!(flags & OPpENTERSUB_INARGS))
4934 /* diag_listed_as: Can't modify %s in %s */
4935 Perl_croak(aTHX_ "Can't modify index/value array slice in list assignment");
4942 *(MARK+items*2-1) = *(MARK+items);
4948 while (++MARK <= SP) {
4951 svp = av_fetch(av, SvIV(*MARK), lval);
4953 if (!svp || !*svp || *svp == &PL_sv_undef) {
4954 DIE(aTHX_ PL_no_aelem, SvIV(*MARK));
4956 *MARK = sv_mortalcopy(*MARK);
4958 *++MARK = svp ? *svp : &PL_sv_undef;
4960 if (GIMME_V != G_ARRAY) {
4961 MARK = SP - items*2;
4962 *++MARK = items > 0 ? *SP : &PL_sv_undef;
4972 AV *array = MUTABLE_AV(POPs);
4973 const U8 gimme = GIMME_V;
4974 IV *iterp = Perl_av_iter_p(aTHX_ array);
4975 const IV current = (*iterp)++;
4977 if (current > av_tindex(array)) {
4979 if (gimme == G_SCALAR)
4987 if (gimme == G_ARRAY) {
4988 SV **const element = av_fetch(array, current, 0);
4989 PUSHs(element ? *element : &PL_sv_undef);
4994 /* also used for: pp_avalues()*/
4998 AV *array = MUTABLE_AV(POPs);
4999 const U8 gimme = GIMME_V;
5001 *Perl_av_iter_p(aTHX_ array) = 0;
5003 if (gimme == G_SCALAR) {
5005 PUSHi(av_tindex(array) + 1);
5007 else if (gimme == G_ARRAY) {
5008 if (UNLIKELY(PL_op->op_private & OPpMAYBE_LVSUB)) {
5009 const I32 flags = is_lvalue_sub();
5010 if (flags && !(flags & OPpENTERSUB_INARGS))
5011 /* diag_listed_as: Can't modify %s in %s */
5013 "Can't modify keys on array in list assignment");
5016 IV n = Perl_av_len(aTHX_ array);
5021 if ( PL_op->op_type == OP_AKEYS
5022 || ( PL_op->op_type == OP_AVHVSWITCH
5023 && (PL_op->op_private & 3) + OP_AEACH == OP_AKEYS ))
5025 for (i = 0; i <= n; i++) {
5030 for (i = 0; i <= n; i++) {
5031 SV *const *const elem = Perl_av_fetch(aTHX_ array, i, 0);
5032 PUSHs(elem ? *elem : &PL_sv_undef);
5040 /* Associative arrays. */
5045 HV * hash = MUTABLE_HV(POPs);
5047 const U8 gimme = GIMME_V;
5049 entry = hv_iternext(hash);
5053 SV* const sv = hv_iterkeysv(entry);
5055 if (gimme == G_ARRAY) {
5057 val = hv_iterval(hash, entry);
5061 else if (gimme == G_SCALAR)
5068 S_do_delete_local(pTHX)
5071 const U8 gimme = GIMME_V;
5074 const bool sliced = !!(PL_op->op_private & OPpSLICE);
5075 SV **unsliced_keysv = sliced ? NULL : sp--;
5076 SV * const osv = POPs;
5077 SV **mark = sliced ? PL_stack_base + POPMARK : unsliced_keysv-1;
5079 const bool tied = SvRMAGICAL(osv)
5080 && mg_find((const SV *)osv, PERL_MAGIC_tied);
5081 const bool can_preserve = SvCANEXISTDELETE(osv);
5082 const U32 type = SvTYPE(osv);
5083 SV ** const end = sliced ? SP : unsliced_keysv;
5085 if (type == SVt_PVHV) { /* hash element */
5086 HV * const hv = MUTABLE_HV(osv);
5087 while (++MARK <= end) {
5088 SV * const keysv = *MARK;
5090 bool preeminent = TRUE;
5092 preeminent = hv_exists_ent(hv, keysv, 0);
5094 HE *he = hv_fetch_ent(hv, keysv, 1, 0);
5101 sv = hv_delete_ent(hv, keysv, 0, 0);
5103 SvREFCNT_inc_simple_void(sv); /* De-mortalize */
5106 if (!sv) DIE(aTHX_ PL_no_helem_sv, SVfARG(keysv));
5107 save_helem_flags(hv, keysv, &sv, SAVEf_KEEPOLDELEM);
5109 *MARK = sv_mortalcopy(sv);
5115 SAVEHDELETE(hv, keysv);
5116 *MARK = &PL_sv_undef;
5120 else if (type == SVt_PVAV) { /* array element */
5121 if (PL_op->op_flags & OPf_SPECIAL) {
5122 AV * const av = MUTABLE_AV(osv);
5123 while (++MARK <= end) {
5124 SSize_t idx = SvIV(*MARK);
5126 bool preeminent = TRUE;
5128 preeminent = av_exists(av, idx);
5130 SV **svp = av_fetch(av, idx, 1);
5137 sv = av_delete(av, idx, 0);
5139 SvREFCNT_inc_simple_void(sv); /* De-mortalize */
5142 save_aelem_flags(av, idx, &sv, SAVEf_KEEPOLDELEM);
5144 *MARK = sv_mortalcopy(sv);
5150 SAVEADELETE(av, idx);
5151 *MARK = &PL_sv_undef;
5156 DIE(aTHX_ "panic: avhv_delete no longer supported");
5159 DIE(aTHX_ "Not a HASH reference");
5161 if (gimme == G_VOID)
5163 else if (gimme == G_SCALAR) {
5168 *++MARK = &PL_sv_undef;
5172 else if (gimme != G_VOID)
5173 PUSHs(*unsliced_keysv);
5184 if (PL_op->op_private & OPpLVAL_INTRO)
5185 return do_delete_local();
5188 discard = (gimme == G_VOID) ? G_DISCARD : 0;
5190 if (PL_op->op_private & (OPpSLICE|OPpKVSLICE)) {
5192 HV * const hv = MUTABLE_HV(POPs);
5193 const U32 hvtype = SvTYPE(hv);
5195 if (PL_op->op_private & OPpKVSLICE) {
5196 SSize_t items = SP - MARK;
5200 *(MARK+items*2-1) = *(MARK+items);
5207 if (hvtype == SVt_PVHV) { /* hash element */
5208 while ((MARK += (1+skip)) <= SP) {
5209 SV * const sv = hv_delete_ent(hv, *(MARK-skip), discard, 0);
5210 *MARK = sv ? sv : &PL_sv_undef;
5213 else if (hvtype == SVt_PVAV) { /* array element */
5214 if (PL_op->op_flags & OPf_SPECIAL) {
5215 while ((MARK += (1+skip)) <= SP) {
5216 SV * const sv = av_delete(MUTABLE_AV(hv), SvIV(*(MARK-skip)), discard);
5217 *MARK = sv ? sv : &PL_sv_undef;
5222 DIE(aTHX_ "Not a HASH reference");
5225 else if (gimme == G_SCALAR) {
5230 *++MARK = &PL_sv_undef;
5236 HV * const hv = MUTABLE_HV(POPs);
5238 if (SvTYPE(hv) == SVt_PVHV)
5239 sv = hv_delete_ent(hv, keysv, discard, 0);
5240 else if (SvTYPE(hv) == SVt_PVAV) {
5241 if (PL_op->op_flags & OPf_SPECIAL)
5242 sv = av_delete(MUTABLE_AV(hv), SvIV(keysv), discard);
5244 DIE(aTHX_ "panic: avhv_delete no longer supported");
5247 DIE(aTHX_ "Not a HASH reference");
5262 if (UNLIKELY( PL_op->op_private & OPpEXISTS_SUB )) {
5264 SV * const sv = POPs;
5265 CV * const cv = sv_2cv(sv, &hv, &gv, 0);
5268 if (gv && isGV(gv) && GvCV(gv) && !GvCVGEN(gv))
5273 hv = MUTABLE_HV(POPs);
5274 if (LIKELY( SvTYPE(hv) == SVt_PVHV )) {
5275 if (hv_exists_ent(hv, tmpsv, 0))
5278 else if (SvTYPE(hv) == SVt_PVAV) {
5279 if (PL_op->op_flags & OPf_SPECIAL) { /* array element */
5280 if (av_exists(MUTABLE_AV(hv), SvIV(tmpsv)))
5285 DIE(aTHX_ "Not a HASH reference");
5292 dSP; dMARK; dORIGMARK;
5293 HV * const hv = MUTABLE_HV(POPs);
5294 const I32 lval = (PL_op->op_flags & OPf_MOD || LVRET);
5295 const bool localizing = PL_op->op_private & OPpLVAL_INTRO;
5296 bool can_preserve = FALSE;
5302 if (SvCANEXISTDELETE(hv))
5303 can_preserve = TRUE;
5306 while (++MARK <= SP) {
5307 SV * const keysv = *MARK;
5310 bool preeminent = TRUE;
5312 if (localizing && can_preserve) {
5313 /* If we can determine whether the element exist,
5314 * try to preserve the existenceness of a tied hash
5315 * element by using EXISTS and DELETE if possible.
5316 * Fallback to FETCH and STORE otherwise. */
5317 preeminent = hv_exists_ent(hv, keysv, 0);
5320 he = hv_fetch_ent(hv, keysv, lval, 0);
5321 svp = he ? &HeVAL(he) : NULL;
5324 if (!svp || !*svp || *svp == &PL_sv_undef) {
5325 DIE(aTHX_ PL_no_helem_sv, SVfARG(keysv));
5328 if (HvNAME_get(hv) && isGV_or_RVCV(*svp))
5329 save_gp(MUTABLE_GV(*svp), !(PL_op->op_flags & OPf_SPECIAL));
5330 else if (preeminent)
5331 save_helem_flags(hv, keysv, svp,
5332 (PL_op->op_flags & OPf_SPECIAL) ? 0 : SAVEf_SETMAGIC);
5334 SAVEHDELETE(hv, keysv);
5337 *MARK = svp && *svp ? *svp : &PL_sv_undef;
5339 if (GIMME_V != G_ARRAY) {
5341 *++MARK = SP > ORIGMARK ? *SP : &PL_sv_undef;
5350 HV * const hv = MUTABLE_HV(POPs);
5351 I32 lval = (PL_op->op_flags & OPf_MOD);
5352 SSize_t items = SP - MARK;
5354 if (PL_op->op_private & OPpMAYBE_LVSUB) {
5355 const I32 flags = is_lvalue_sub();
5357 if (!(flags & OPpENTERSUB_INARGS))
5358 /* diag_listed_as: Can't modify %s in %s */
5359 Perl_croak(aTHX_ "Can't modify key/value hash slice in %s assignment",
5360 GIMME_V == G_ARRAY ? "list" : "scalar");
5367 *(MARK+items*2-1) = *(MARK+items);
5373 while (++MARK <= SP) {
5374 SV * const keysv = *MARK;
5378 he = hv_fetch_ent(hv, keysv, lval, 0);
5379 svp = he ? &HeVAL(he) : NULL;
5382 if (!svp || !*svp || *svp == &PL_sv_undef) {
5383 DIE(aTHX_ PL_no_helem_sv, SVfARG(keysv));
5385 *MARK = sv_mortalcopy(*MARK);
5387 *++MARK = svp && *svp ? *svp : &PL_sv_undef;
5389 if (GIMME_V != G_ARRAY) {
5390 MARK = SP - items*2;
5391 *++MARK = items > 0 ? *SP : &PL_sv_undef;
5397 /* List operators. */
5401 I32 markidx = POPMARK;
5402 if (GIMME_V != G_ARRAY) {
5403 /* don't initialize mark here, EXTEND() may move the stack */
5406 EXTEND(SP, 1); /* in case no arguments, as in @empty */
5407 mark = PL_stack_base + markidx;
5409 *MARK = *SP; /* unwanted list, return last item */
5411 *MARK = &PL_sv_undef;
5421 SV ** const lastrelem = PL_stack_sp;
5422 SV ** const lastlelem = PL_stack_base + POPMARK;
5423 SV ** const firstlelem = PL_stack_base + POPMARK + 1;
5424 SV ** const firstrelem = lastlelem + 1;
5425 const U8 mod = PL_op->op_flags & OPf_MOD;
5427 const I32 max = lastrelem - lastlelem;
5430 if (GIMME_V != G_ARRAY) {
5431 if (lastlelem < firstlelem) {
5433 *firstlelem = &PL_sv_undef;
5436 I32 ix = SvIV(*lastlelem);
5439 if (ix < 0 || ix >= max)
5440 *firstlelem = &PL_sv_undef;
5442 *firstlelem = firstrelem[ix];
5449 SP = firstlelem - 1;
5453 for (lelem = firstlelem; lelem <= lastlelem; lelem++) {
5454 I32 ix = SvIV(*lelem);
5457 if (ix < 0 || ix >= max)
5458 *lelem = &PL_sv_undef;
5460 if (!(*lelem = firstrelem[ix]))
5461 *lelem = &PL_sv_undef;
5462 else if (mod && SvPADTMP(*lelem)) {
5463 *lelem = firstrelem[ix] = sv_mortalcopy(*lelem);
5474 const I32 items = SP - MARK;
5475 SV * const av = MUTABLE_SV(av_make(items, MARK+1));
5477 mXPUSHs((PL_op->op_flags & OPf_SPECIAL)
5478 ? newRV_noinc(av) : av);
5484 dSP; dMARK; dORIGMARK;
5485 HV* const hv = newHV();
5486 SV* const retval = sv_2mortal( PL_op->op_flags & OPf_SPECIAL
5487 ? newRV_noinc(MUTABLE_SV(hv))
5492 (MARK++, SvGMAGICAL(*MARK) ? sv_mortalcopy(*MARK) : *MARK);
5499 sv_setsv_nomg(val, *MARK);
5503 Perl_ck_warner(aTHX_ packWARN(WARN_MISC), "Odd number of elements in anonymous hash");
5506 (void)hv_store_ent(hv,key,val,0);
5515 dSP; dMARK; dORIGMARK;
5516 int num_args = (SP - MARK);
5517 AV *ary = MUTABLE_AV(*++MARK);
5526 const MAGIC * const mg = SvTIED_mg((const SV *)ary, PERL_MAGIC_tied);
5529 return Perl_tied_method(aTHX_ SV_CONST(SPLICE), mark - 1, MUTABLE_SV(ary), mg,
5530 GIMME_V | TIED_METHOD_ARGUMENTS_ON_STACK,
5534 if (SvREADONLY(ary))
5535 Perl_croak_no_modify();
5540 offset = i = SvIV(*MARK);
5542 offset += AvFILLp(ary) + 1;
5544 DIE(aTHX_ PL_no_aelem, i);
5546 length = SvIVx(*MARK++);
5548 length += AvFILLp(ary) - offset + 1;
5554 length = AvMAX(ary) + 1; /* close enough to infinity */
5558 length = AvMAX(ary) + 1;
5560 if (offset > AvFILLp(ary) + 1) {
5562 Perl_ck_warner(aTHX_ packWARN(WARN_MISC), "splice() offset past end of array" );
5563 offset = AvFILLp(ary) + 1;
5565 after = AvFILLp(ary) + 1 - (offset + length);
5566 if (after < 0) { /* not that much array */
5567 length += after; /* offset+length now in array */
5573 /* At this point, MARK .. SP-1 is our new LIST */
5576 diff = newlen - length;
5577 if (newlen && !AvREAL(ary) && AvREIFY(ary))
5580 /* make new elements SVs now: avoid problems if they're from the array */
5581 for (dst = MARK, i = newlen; i; i--) {
5582 SV * const h = *dst;
5583 *dst++ = newSVsv(h);
5586 if (diff < 0) { /* shrinking the area */
5587 SV **tmparyval = NULL;
5589 Newx(tmparyval, newlen, SV*); /* so remember insertion */
5590 Copy(MARK, tmparyval, newlen, SV*);
5593 MARK = ORIGMARK + 1;
5594 if (GIMME_V == G_ARRAY) { /* copy return vals to stack */
5595 const bool real = cBOOL(AvREAL(ary));
5596 MEXTEND(MARK, length);
5598 EXTEND_MORTAL(length);
5599 for (i = 0, dst = MARK; i < length; i++) {
5600 if ((*dst = AvARRAY(ary)[i+offset])) {
5602 sv_2mortal(*dst); /* free them eventually */
5605 *dst = &PL_sv_undef;
5611 *MARK = AvARRAY(ary)[offset+length-1];
5614 for (i = length - 1, dst = &AvARRAY(ary)[offset]; i > 0; i--)
5615 SvREFCNT_dec(*dst++); /* free them now */
5618 *MARK = &PL_sv_undef;
5620 AvFILLp(ary) += diff;
5622 /* pull up or down? */
5624 if (offset < after) { /* easier to pull up */
5625 if (offset) { /* esp. if nothing to pull */
5626 src = &AvARRAY(ary)[offset-1];
5627 dst = src - diff; /* diff is negative */
5628 for (i = offset; i > 0; i--) /* can't trust Copy */
5632 AvARRAY(ary) = AvARRAY(ary) - diff; /* diff is negative */
5636 if (after) { /* anything to pull down? */
5637 src = AvARRAY(ary) + offset + length;
5638 dst = src + diff; /* diff is negative */
5639 Move(src, dst, after, SV*);
5641 dst = &AvARRAY(ary)[AvFILLp(ary)+1];
5642 /* avoid later double free */
5649 Copy( tmparyval, AvARRAY(ary) + offset, newlen, SV* );
5650 Safefree(tmparyval);
5653 else { /* no, expanding (or same) */
5654 SV** tmparyval = NULL;
5656 Newx(tmparyval, length, SV*); /* so remember deletion */
5657 Copy(AvARRAY(ary)+offset, tmparyval, length, SV*);
5660 if (diff > 0) { /* expanding */
5661 /* push up or down? */
5662 if (offset < after && diff <= AvARRAY(ary) - AvALLOC(ary)) {
5666 Move(src, dst, offset, SV*);
5668 AvARRAY(ary) = AvARRAY(ary) - diff;/* diff is positive */
5670 AvFILLp(ary) += diff;
5673 if (AvFILLp(ary) + diff >= AvMAX(ary)) /* oh, well */
5674 av_extend(ary, AvFILLp(ary) + diff);
5675 AvFILLp(ary) += diff;
5678 dst = AvARRAY(ary) + AvFILLp(ary);
5680 for (i = after; i; i--) {
5688 Copy( MARK, AvARRAY(ary) + offset, newlen, SV* );
5691 MARK = ORIGMARK + 1;
5692 if (GIMME_V == G_ARRAY) { /* copy return vals to stack */
5694 const bool real = cBOOL(AvREAL(ary));
5696 EXTEND_MORTAL(length);
5697 for (i = 0, dst = MARK; i < length; i++) {
5698 if ((*dst = tmparyval[i])) {
5700 sv_2mortal(*dst); /* free them eventually */
5702 else *dst = &PL_sv_undef;
5708 else if (length--) {
5709 *MARK = tmparyval[length];
5712 while (length-- > 0)
5713 SvREFCNT_dec(tmparyval[length]);
5716 *MARK = &PL_sv_undef;
5719 *MARK = &PL_sv_undef;
5720 Safefree(tmparyval);
5724 mg_set(MUTABLE_SV(ary));
5732 dSP; dMARK; dORIGMARK; dTARGET;
5733 AV * const ary = MUTABLE_AV(*++MARK);
5734 const MAGIC * const mg = SvTIED_mg((const SV *)ary, PERL_MAGIC_tied);
5737 *MARK-- = SvTIED_obj(MUTABLE_SV(ary), mg);
5740 ENTER_with_name("call_PUSH");
5741 call_sv(SV_CONST(PUSH),G_SCALAR|G_DISCARD|G_METHOD_NAMED);
5742 LEAVE_with_name("call_PUSH");
5743 /* SPAGAIN; not needed: SP is assigned to immediately below */
5746 /* PL_delaymagic is restored by JUMPENV_POP on dieing, so we
5747 * only need to save locally, not on the save stack */
5748 U16 old_delaymagic = PL_delaymagic;
5750 if (SvREADONLY(ary) && MARK < SP) Perl_croak_no_modify();
5751 PL_delaymagic = DM_DELAY;
5752 for (++MARK; MARK <= SP; MARK++) {
5754 if (*MARK) SvGETMAGIC(*MARK);
5757 sv_setsv_nomg(sv, *MARK);
5758 av_store(ary, AvFILLp(ary)+1, sv);
5760 if (PL_delaymagic & DM_ARRAY_ISA)
5761 mg_set(MUTABLE_SV(ary));
5762 PL_delaymagic = old_delaymagic;
5765 if (OP_GIMME(PL_op, 0) != G_VOID) {
5766 PUSHi( AvFILL(ary) + 1 );
5771 /* also used for: pp_pop()*/
5775 AV * const av = PL_op->op_flags & OPf_SPECIAL
5776 ? MUTABLE_AV(GvAVn(PL_defgv)) : MUTABLE_AV(POPs);
5777 SV * const sv = PL_op->op_type == OP_SHIFT ? av_shift(av) : av_pop(av);
5781 (void)sv_2mortal(sv);
5788 dSP; dMARK; dORIGMARK; dTARGET;
5789 AV *ary = MUTABLE_AV(*++MARK);
5790 const MAGIC * const mg = SvTIED_mg((const SV *)ary, PERL_MAGIC_tied);
5793 *MARK-- = SvTIED_obj(MUTABLE_SV(ary), mg);
5796 ENTER_with_name("call_UNSHIFT");
5797 call_sv(SV_CONST(UNSHIFT),G_SCALAR|G_DISCARD|G_METHOD_NAMED);
5798 LEAVE_with_name("call_UNSHIFT");
5799 /* SPAGAIN; not needed: SP is assigned to immediately below */
5802 /* PL_delaymagic is restored by JUMPENV_POP on dieing, so we
5803 * only need to save locally, not on the save stack */
5804 U16 old_delaymagic = PL_delaymagic;
5807 av_unshift(ary, SP - MARK);
5808 PL_delaymagic = DM_DELAY;
5810 SV * const sv = newSVsv(*++MARK);
5811 (void)av_store(ary, i++, sv);
5813 if (PL_delaymagic & DM_ARRAY_ISA)
5814 mg_set(MUTABLE_SV(ary));
5815 PL_delaymagic = old_delaymagic;
5818 if (OP_GIMME(PL_op, 0) != G_VOID) {
5819 PUSHi( AvFILL(ary) + 1 );
5828 if (GIMME_V == G_ARRAY) {
5829 if (PL_op->op_private & OPpREVERSE_INPLACE) {
5833 assert( MARK+1 == SP && *SP && SvTYPE(*SP) == SVt_PVAV);
5834 (void)POPMARK; /* remove mark associated with ex-OP_AASSIGN */
5835 av = MUTABLE_AV((*SP));
5836 /* In-place reversing only happens in void context for the array
5837 * assignment. We don't need to push anything on the stack. */
5840 if (SvMAGICAL(av)) {
5842 SV *tmp = sv_newmortal();
5843 /* For SvCANEXISTDELETE */
5846 bool can_preserve = SvCANEXISTDELETE(av);
5848 for (i = 0, j = av_tindex(av); i < j; ++i, --j) {
5852 if (!av_exists(av, i)) {
5853 if (av_exists(av, j)) {
5854 SV *sv = av_delete(av, j, 0);
5855 begin = *av_fetch(av, i, TRUE);
5856 sv_setsv_mg(begin, sv);
5860 else if (!av_exists(av, j)) {
5861 SV *sv = av_delete(av, i, 0);
5862 end = *av_fetch(av, j, TRUE);
5863 sv_setsv_mg(end, sv);
5868 begin = *av_fetch(av, i, TRUE);
5869 end = *av_fetch(av, j, TRUE);
5870 sv_setsv(tmp, begin);
5871 sv_setsv_mg(begin, end);
5872 sv_setsv_mg(end, tmp);
5876 SV **begin = AvARRAY(av);
5879 SV **end = begin + AvFILLp(av);
5881 while (begin < end) {
5882 SV * const tmp = *begin;
5893 SV * const tmp = *MARK;
5897 /* safe as long as stack cannot get extended in the above */
5906 SvUTF8_off(TARG); /* decontaminate */
5907 if (SP - MARK > 1) {
5908 do_join(TARG, &PL_sv_no, MARK, SP);
5911 } else if (SP > MARK) {
5912 sv_setsv(TARG, *SP);
5915 sv_setsv(TARG, DEFSV);
5919 up = SvPV_force(TARG, len);
5922 if (DO_UTF8(TARG)) { /* first reverse each character */
5923 U8* s = (U8*)SvPVX(TARG);
5924 const U8* send = (U8*)(s + len);
5926 if (UTF8_IS_INVARIANT(*s)) {
5931 if (!utf8_to_uvchr_buf(s, send, 0))
5935 down = (char*)(s - 1);
5936 /* reverse this character */
5938 const char tmp = *up;
5946 down = SvPVX(TARG) + len - 1;
5948 const char tmp = *up;
5952 (void)SvPOK_only_UTF8(TARG);
5961 AV *ary = ( (PL_op->op_private & OPpSPLIT_ASSIGN) /* @a = split */
5962 && (PL_op->op_flags & OPf_STACKED)) /* @{expr} = split */
5963 ? (AV *)POPs : NULL;
5964 IV limit = POPi; /* note, negative is forever */
5965 SV * const sv = POPs;
5967 const char *s = SvPV_const(sv, len);
5968 const bool do_utf8 = DO_UTF8(sv);
5969 const bool in_uni_8_bit = IN_UNI_8_BIT;
5970 const char *strend = s + len;
5971 PMOP *pm = cPMOPx(PL_op);
5976 const STRLEN slen = do_utf8
5977 ? utf8_length((U8*)s, (U8*)strend)
5978 : (STRLEN)(strend - s);
5979 SSize_t maxiters = slen + 10;
5980 I32 trailing_empty = 0;
5982 const IV origlimit = limit;
5985 const U8 gimme = GIMME_V;
5987 I32 oldsave = PL_savestack_ix;
5988 U32 make_mortal = SVs_TEMP;
5994 TAINT_IF(get_regex_charset(RX_EXTFLAGS(rx)) == REGEX_LOCALE_CHARSET &&
5995 (RX_EXTFLAGS(rx) & (RXf_WHITE | RXf_SKIPWHITE)));
5997 /* handle @ary = split(...) optimisation */
5998 if (PL_op->op_private & OPpSPLIT_ASSIGN) {
5999 if (!(PL_op->op_flags & OPf_STACKED)) {
6000 if (PL_op->op_private & OPpSPLIT_LEX) {
6001 if (PL_op->op_private & OPpLVAL_INTRO)
6002 SAVECLEARSV(PAD_SVl(pm->op_pmreplrootu.op_pmtargetoff));
6003 ary = (AV *)PAD_SVl(pm->op_pmreplrootu.op_pmtargetoff);
6008 MUTABLE_GV(PAD_SVl(pm->op_pmreplrootu.op_pmtargetoff));
6010 pm->op_pmreplrootu.op_pmtargetgv;
6012 if (PL_op->op_private & OPpLVAL_INTRO)
6017 /* skip anything pushed by OPpLVAL_INTRO above */
6018 oldsave = PL_savestack_ix;
6024 (void)sv_2mortal(SvREFCNT_inc_simple_NN(sv));
6027 if ((mg = SvTIED_mg((const SV *)ary, PERL_MAGIC_tied))) {
6029 XPUSHs(SvTIED_obj(MUTABLE_SV(ary), mg));
6036 for (i = AvFILLp(ary); i >= 0; i--)
6037 AvARRAY(ary)[i] = &PL_sv_undef; /* don't free mere refs */
6039 /* temporarily switch stacks */
6040 SAVESWITCHSTACK(PL_curstack, ary);
6045 base = SP - PL_stack_base;
6047 if (RX_EXTFLAGS(rx) & RXf_SKIPWHITE) {
6049 while (s < strend && isSPACE_utf8_safe(s, strend))
6052 else if (get_regex_charset(RX_EXTFLAGS(rx)) == REGEX_LOCALE_CHARSET) {
6053 while (s < strend && isSPACE_LC(*s))
6056 else if (in_uni_8_bit) {
6057 while (s < strend && isSPACE_L1(*s))
6061 while (s < strend && isSPACE(*s))
6065 if (RX_EXTFLAGS(rx) & RXf_PMf_MULTILINE) {
6069 gimme_scalar = gimme == G_SCALAR && !ary;
6072 limit = maxiters + 2;
6073 if (RX_EXTFLAGS(rx) & RXf_WHITE) {
6076 /* this one uses 'm' and is a negative test */
6078 while (m < strend && ! isSPACE_utf8_safe(m, strend) ) {
6079 const int t = UTF8SKIP(m);
6080 /* isSPACE_utf8_safe returns FALSE for malform utf8 */
6087 else if (get_regex_charset(RX_EXTFLAGS(rx)) == REGEX_LOCALE_CHARSET)
6089 while (m < strend && !isSPACE_LC(*m))
6092 else if (in_uni_8_bit) {
6093 while (m < strend && !isSPACE_L1(*m))
6096 while (m < strend && !isSPACE(*m))
6109 dstr = newSVpvn_flags(s, m-s,
6110 (do_utf8 ? SVf_UTF8 : 0) | make_mortal);
6114 /* skip the whitespace found last */
6116 s = m + UTF8SKIP(m);
6120 /* this one uses 's' and is a positive test */
6122 while (s < strend && isSPACE_utf8_safe(s, strend) )
6125 else if (get_regex_charset(RX_EXTFLAGS(rx)) == REGEX_LOCALE_CHARSET)
6127 while (s < strend && isSPACE_LC(*s))
6130 else if (in_uni_8_bit) {
6131 while (s < strend && isSPACE_L1(*s))
6134 while (s < strend && isSPACE(*s))
6139 else if (RX_EXTFLAGS(rx) & RXf_START_ONLY) {
6141 for (m = s; m < strend && *m != '\n'; m++)
6154 dstr = newSVpvn_flags(s, m-s,
6155 (do_utf8 ? SVf_UTF8 : 0) | make_mortal);
6161 else if (RX_EXTFLAGS(rx) & RXf_NULL && !(s >= strend)) {
6163 Pre-extend the stack, either the number of bytes or
6164 characters in the string or a limited amount, triggered by:
6166 my ($x, $y) = split //, $str;
6170 if (!gimme_scalar) {
6171 const IV items = limit - 1;
6172 /* setting it to -1 will trigger a panic in EXTEND() */
6173 const SSize_t sslen = slen > SSize_t_MAX ? -1 : (SSize_t)slen;
6174 if (items >=0 && items < sslen)
6182 /* keep track of how many bytes we skip over */
6192 dstr = newSVpvn_flags(m, s-m, SVf_UTF8 | make_mortal);
6205 dstr = newSVpvn(s, 1);
6221 else if (do_utf8 == (RX_UTF8(rx) != 0) &&
6222 (RX_EXTFLAGS(rx) & RXf_USE_INTUIT) && !RX_NPARENS(rx)
6223 && (RX_EXTFLAGS(rx) & RXf_CHECK_ALL)
6224 && !(RX_EXTFLAGS(rx) & RXf_IS_ANCHORED)) {
6225 const int tail = (RX_EXTFLAGS(rx) & RXf_INTUIT_TAIL);
6226 SV * const csv = CALLREG_INTUIT_STRING(rx);
6228 len = RX_MINLENRET(rx);
6229 if (len == 1 && !RX_UTF8(rx) && !tail) {
6230 const char c = *SvPV_nolen_const(csv);
6232 for (m = s; m < strend && *m != c; m++)
6243 dstr = newSVpvn_flags(s, m-s,
6244 (do_utf8 ? SVf_UTF8 : 0) | make_mortal);
6247 /* The rx->minlen is in characters but we want to step
6248 * s ahead by bytes. */
6250 s = (char*)utf8_hop_forward((U8*) m, len, (U8*) strend);
6252 s = m + len; /* Fake \n at the end */
6256 while (s < strend && --limit &&
6257 (m = fbm_instr((unsigned char*)s, (unsigned char*)strend,
6258 csv, multiline ? FBMrf_MULTILINE : 0)) )
6267 dstr = newSVpvn_flags(s, m-s,
6268 (do_utf8 ? SVf_UTF8 : 0) | make_mortal);
6271 /* The rx->minlen is in characters but we want to step
6272 * s ahead by bytes. */
6274 s = (char*)utf8_hop_forward((U8*)m, len, (U8 *) strend);
6276 s = m + len; /* Fake \n at the end */
6281 maxiters += slen * RX_NPARENS(rx);
6282 while (s < strend && --limit)
6286 rex_return = CALLREGEXEC(rx, (char*)s, (char*)strend, (char*)orig, 1,
6289 if (rex_return == 0)
6291 TAINT_IF(RX_MATCH_TAINTED(rx));
6292 /* we never pass the REXEC_COPY_STR flag, so it should
6293 * never get copied */
6294 assert(!RX_MATCH_COPIED(rx));
6295 m = RX_OFFS(rx)[0].start + orig;
6304 dstr = newSVpvn_flags(s, m-s,
6305 (do_utf8 ? SVf_UTF8 : 0) | make_mortal);
6308 if (RX_NPARENS(rx)) {
6310 for (i = 1; i <= (I32)RX_NPARENS(rx); i++) {
6311 s = RX_OFFS(rx)[i].start + orig;
6312 m = RX_OFFS(rx)[i].end + orig;
6314 /* japhy (07/27/01) -- the (m && s) test doesn't catch
6315 parens that didn't match -- they should be set to
6316 undef, not the empty string */
6324 if (m >= orig && s >= orig) {
6325 dstr = newSVpvn_flags(s, m-s,
6326 (do_utf8 ? SVf_UTF8 : 0)
6330 dstr = &PL_sv_undef; /* undef, not "" */
6336 s = RX_OFFS(rx)[0].end + orig;
6340 if (!gimme_scalar) {
6341 iters = (SP - PL_stack_base) - base;
6343 if (iters > maxiters)
6344 DIE(aTHX_ "Split loop");
6346 /* keep field after final delim? */
6347 if (s < strend || (iters && origlimit)) {
6348 if (!gimme_scalar) {
6349 const STRLEN l = strend - s;
6350 dstr = newSVpvn_flags(s, l, (do_utf8 ? SVf_UTF8 : 0) | make_mortal);
6355 else if (!origlimit) {
6357 iters -= trailing_empty;
6359 while (iters > 0 && (!TOPs || !SvANY(TOPs) || SvCUR(TOPs) == 0)) {
6360 if (TOPs && !make_mortal)
6369 LEAVE_SCOPE(oldsave); /* may undo an earlier SWITCHSTACK */
6373 if (SvSMAGICAL(ary)) {
6375 mg_set(MUTABLE_SV(ary));
6378 if (gimme == G_ARRAY) {
6380 Copy(AvARRAY(ary), SP + 1, iters, SV*);
6387 ENTER_with_name("call_PUSH");
6388 call_sv(SV_CONST(PUSH),G_SCALAR|G_DISCARD|G_METHOD_NAMED);
6389 LEAVE_with_name("call_PUSH");
6391 if (gimme == G_ARRAY) {
6393 /* EXTEND should not be needed - we just popped them */
6395 for (i=0; i < iters; i++) {
6396 SV **svp = av_fetch(ary, i, FALSE);
6397 PUSHs((svp) ? *svp : &PL_sv_undef);
6404 if (gimme == G_ARRAY)
6416 SV *const sv = PAD_SVl(PL_op->op_targ);
6418 if (SvPADSTALE(sv)) {
6421 RETURNOP(cLOGOP->op_other);
6423 RETURNOP(cLOGOP->op_next);
6432 if (SvTYPE(retsv) == SVt_PVAV || SvTYPE(retsv) == SVt_PVHV
6433 || SvTYPE(retsv) == SVt_PVCV) {
6434 retsv = refto(retsv);
6441 /* used for: pp_padany(), pp_custom(); plus any system ops
6442 * that aren't implemented on a particular platform */
6444 PP(unimplemented_op)
6446 const Optype op_type = PL_op->op_type;
6447 /* Using OP_NAME() isn't going to be helpful here. Firstly, it doesn't cope
6448 with out of range op numbers - it only "special" cases op_custom.
6449 Secondly, as the three ops we "panic" on are padmy, mapstart and custom,
6450 if we get here for a custom op then that means that the custom op didn't
6451 have an implementation. Given that OP_NAME() looks up the custom op
6452 by its pp_addr, likely it will return NULL, unless someone (unhelpfully)
6453 registers &PL_unimplemented_op as the address of their custom op.
6454 NULL doesn't generate a useful error message. "custom" does. */
6455 const char *const name = op_type >= OP_max
6456 ? "[out of range]" : PL_op_name[PL_op->op_type];
6457 if(OP_IS_SOCKET(op_type))
6458 DIE(aTHX_ PL_no_sock_func, name);
6459 DIE(aTHX_ "panic: unimplemented op %s (#%d) called", name, op_type);
6463 S_maybe_unwind_defav(pTHX)
6465 if (CX_CUR()->cx_type & CXp_HASARGS) {
6466 PERL_CONTEXT *cx = CX_CUR();
6468 assert(CxHASARGS(cx));
6470 cx->cx_type &= ~CXp_HASARGS;
6474 /* For sorting out arguments passed to a &CORE:: subroutine */
6478 int opnum = SvIOK(cSVOP_sv) ? (int)SvUV(cSVOP_sv) : 0;
6479 int defgv = PL_opargs[opnum] & OA_DEFGV ||opnum==OP_GLOB, whicharg = 0;
6480 AV * const at_ = GvAV(PL_defgv);
6481 SV **svp = at_ ? AvARRAY(at_) : NULL;
6482 I32 minargs = 0, maxargs = 0, numargs = at_ ? AvFILLp(at_)+1 : 0;
6483 I32 oa = opnum ? PL_opargs[opnum] >> OASHIFT : 0;
6484 bool seen_question = 0;
6485 const char *err = NULL;
6486 const bool pushmark = PL_op->op_private & OPpCOREARGS_PUSHMARK;
6488 /* Count how many args there are first, to get some idea how far to
6489 extend the stack. */
6491 if ((oa & 7) == OA_LIST) { maxargs = I32_MAX; break; }
6493 if (oa & OA_OPTIONAL) seen_question = 1;
6494 if (!seen_question) minargs++;
6498 if(numargs < minargs) err = "Not enough";
6499 else if(numargs > maxargs) err = "Too many";
6501 /* diag_listed_as: Too many arguments for %s */
6503 "%s arguments for %s", err,
6504 opnum ? PL_op_desc[opnum] : SvPV_nolen_const(cSVOP_sv)
6507 /* Reset the stack pointer. Without this, we end up returning our own
6508 arguments in list context, in addition to the values we are supposed
6509 to return. nextstate usually does this on sub entry, but we need
6510 to run the next op with the caller's hints, so we cannot have a
6512 SP = PL_stack_base + CX_CUR()->blk_oldsp;
6514 if(!maxargs) RETURN;
6516 /* We do this here, rather than with a separate pushmark op, as it has
6517 to come in between two things this function does (stack reset and
6518 arg pushing). This seems the easiest way to do it. */
6521 (void)Perl_pp_pushmark(aTHX);
6524 EXTEND(SP, maxargs == I32_MAX ? numargs : maxargs);
6525 PUTBACK; /* The code below can die in various places. */
6527 oa = PL_opargs[opnum] >> OASHIFT;
6528 for (; oa&&(numargs||!pushmark); (void)(numargs&&(++svp,--numargs))) {
6533 if (!numargs && defgv && whicharg == minargs + 1) {
6536 else PUSHs(numargs ? svp && *svp ? *svp : &PL_sv_undef : NULL);
6540 PUSHs(svp && *svp ? *svp : &PL_sv_undef);
6547 if (CvUNIQUE(find_runcv_where(FIND_RUNCV_level_eq,1,NULL)))
6550 S_maybe_unwind_defav(aTHX);
6553 PUSHs((SV *)GvAVn(gv));
6556 if (!svp || !*svp || !SvROK(*svp)
6557 || SvTYPE(SvRV(*svp)) != SVt_PVAV)
6559 /* diag_listed_as: Type of arg %d to &CORE::%s must be %s*/
6560 "Type of arg %d to &CORE::%s must be array reference",
6561 whicharg, PL_op_desc[opnum]
6566 if (!svp || !*svp || !SvROK(*svp)
6567 || ( SvTYPE(SvRV(*svp)) != SVt_PVHV
6568 && ( opnum == OP_DBMCLOSE || opnum == OP_DBMOPEN
6569 || SvTYPE(SvRV(*svp)) != SVt_PVAV )))
6571 /* diag_listed_as: Type of arg %d to &CORE::%s must be %s*/
6572 "Type of arg %d to &CORE::%s must be hash%s reference",
6573 whicharg, PL_op_desc[opnum],
6574 opnum == OP_DBMCLOSE || opnum == OP_DBMOPEN
6581 if (!numargs) PUSHs(NULL);
6582 else if(svp && *svp && SvROK(*svp) && isGV_with_GP(SvRV(*svp)))
6583 /* no magic here, as the prototype will have added an extra
6584 refgen and we just want what was there before that */
6587 const bool constr = PL_op->op_private & whicharg;
6589 svp && *svp ? *svp : &PL_sv_undef,
6590 constr, cBOOL(CopHINTS_get(PL_curcop) & HINT_STRICT_REFS),
6596 if (!numargs) goto try_defsv;
6598 const bool wantscalar =
6599 PL_op->op_private & OPpCOREARGS_SCALARMOD;
6600 if (!svp || !*svp || !SvROK(*svp)
6601 /* We have to permit globrefs even for the \$ proto, as
6602 *foo is indistinguishable from ${\*foo}, and the proto-
6603 type permits the latter. */
6604 || SvTYPE(SvRV(*svp)) > (
6605 wantscalar ? SVt_PVLV
6606 : opnum == OP_LOCK || opnum == OP_UNDEF
6612 "Type of arg %d to &CORE::%s must be %s",
6613 whicharg, PL_op_name[opnum],
6615 ? "scalar reference"
6616 : opnum == OP_LOCK || opnum == OP_UNDEF
6617 ? "reference to one of [$@%&*]"
6618 : "reference to one of [$@%*]"
6621 if (opnum == OP_UNDEF && SvRV(*svp) == (SV *)PL_defgv) {
6622 /* Undo @_ localisation, so that sub exit does not undo
6623 part of our undeffing. */
6624 S_maybe_unwind_defav(aTHX);
6629 DIE(aTHX_ "panic: unknown OA_*: %x", (unsigned)(oa&7));
6637 /* Implement CORE::keys(),values(),each().
6639 * We won't know until run-time whether the arg is an array or hash,
6642 * pp_keys/pp_values/pp_each
6644 * pp_akeys/pp_avalues/pp_aeach
6646 * as appropriate (or whatever pp function actually implements the OP_FOO
6647 * functionality for each FOO).
6654 (SvTYPE(TOPs) == SVt_PVAV ? OP_AEACH : OP_EACH)
6655 + (PL_op->op_private & OPpAVHVSWITCH_MASK)
6663 if (PL_op->op_private & OPpOFFBYONE) {
6664 cv = find_runcv_where(FIND_RUNCV_level_eq, 1, NULL);
6666 else cv = find_runcv(NULL);
6667 XPUSHs(CvEVAL(cv) ? &PL_sv_undef : sv_2mortal(newRV((SV *)cv)));
6672 S_localise_aelem_lval(pTHX_ AV * const av, SV * const keysv,
6673 const bool can_preserve)
6675 const SSize_t ix = SvIV(keysv);
6676 if (can_preserve ? av_exists(av, ix) : TRUE) {
6677 SV ** const svp = av_fetch(av, ix, 1);
6679 Perl_croak(aTHX_ PL_no_aelem, ix);
6680 save_aelem(av, ix, svp);
6683 SAVEADELETE(av, ix);
6687 S_localise_helem_lval(pTHX_ HV * const hv, SV * const keysv,
6688 const bool can_preserve)
6690 if (can_preserve ? hv_exists_ent(hv, keysv, 0) : TRUE) {
6691 HE * const he = hv_fetch_ent(hv, keysv, 1, 0);
6692 SV ** const svp = he ? &HeVAL(he) : NULL;
6694 Perl_croak(aTHX_ PL_no_helem_sv, SVfARG(keysv));
6695 save_helem_flags(hv, keysv, svp, 0);
6698 SAVEHDELETE(hv, keysv);
6702 S_localise_gv_slot(pTHX_ GV *gv, U8 type)
6704 if (type == OPpLVREF_SV) {
6705 save_pushptrptr(gv, SvREFCNT_inc_simple(GvSV(gv)), SAVEt_GVSV);
6708 else if (type == OPpLVREF_AV)
6709 /* XXX Inefficient, as it creates a new AV, which we are
6710 about to clobber. */
6713 assert(type == OPpLVREF_HV);
6714 /* XXX Likewise inefficient. */
6723 SV * const key = PL_op->op_private & OPpLVREF_ELEM ? POPs : NULL;
6724 SV * const left = PL_op->op_flags & OPf_STACKED ? POPs : NULL;
6726 const char *bad = NULL;
6727 const U8 type = PL_op->op_private & OPpLVREF_TYPE;
6728 if (!SvROK(sv)) DIE(aTHX_ "Assigned value is not a reference");
6731 if (SvTYPE(SvRV(sv)) > SVt_PVLV)
6735 if (SvTYPE(SvRV(sv)) != SVt_PVAV)
6739 if (SvTYPE(SvRV(sv)) != SVt_PVHV)
6743 if (SvTYPE(SvRV(sv)) != SVt_PVCV)
6747 /* diag_listed_as: Assigned value is not %s reference */
6748 DIE(aTHX_ "Assigned value is not a%s reference", bad);
6752 switch (left ? SvTYPE(left) : 0) {
6755 SV * const old = PAD_SV(ARGTARG);
6756 PAD_SETSV(ARGTARG, SvREFCNT_inc_NN(SvRV(sv)));
6758 if ((PL_op->op_private & (OPpLVAL_INTRO|OPpPAD_STATE))
6760 SAVECLEARSV(PAD_SVl(ARGTARG));
6764 if (PL_op->op_private & OPpLVAL_INTRO) {
6765 S_localise_gv_slot(aTHX_ (GV *)left, type);
6767 gv_setref(left, sv);
6772 if (UNLIKELY(PL_op->op_private & OPpLVAL_INTRO)) {
6773 S_localise_aelem_lval(aTHX_ (AV *)left, key,
6774 SvCANEXISTDELETE(left));
6776 av_store((AV *)left, SvIV(key), SvREFCNT_inc_simple_NN(SvRV(sv)));
6779 if (UNLIKELY(PL_op->op_private & OPpLVAL_INTRO)) {
6781 S_localise_helem_lval(aTHX_ (HV *)left, key,
6782 SvCANEXISTDELETE(left));
6784 (void)hv_store_ent((HV *)left, key, SvREFCNT_inc_simple_NN(SvRV(sv)), 0);
6786 if (PL_op->op_flags & OPf_MOD)
6787 SETs(sv_2mortal(newSVsv(sv)));
6788 /* XXX else can weak references go stale before they are read, e.g.,
6797 SV * const ret = sv_2mortal(newSV_type(SVt_PVMG));
6798 SV * const elem = PL_op->op_private & OPpLVREF_ELEM ? POPs : NULL;
6799 SV * const arg = PL_op->op_flags & OPf_STACKED ? POPs : NULL;
6800 MAGIC * const mg = sv_magicext(ret, arg, PERL_MAGIC_lvref,
6801 &PL_vtbl_lvref, (char *)elem,
6802 elem ? HEf_SVKEY : (I32)ARGTARG);
6803 mg->mg_private = PL_op->op_private;
6804 if (PL_op->op_private & OPpLVREF_ITER)
6805 mg->mg_flags |= MGf_PERSIST;
6806 if (UNLIKELY(PL_op->op_private & OPpLVAL_INTRO)) {
6812 const bool can_preserve = SvCANEXISTDELETE(arg);
6813 if (SvTYPE(arg) == SVt_PVAV)
6814 S_localise_aelem_lval(aTHX_ (AV *)arg, elem, can_preserve);
6816 S_localise_helem_lval(aTHX_ (HV *)arg, elem, can_preserve);
6820 S_localise_gv_slot(aTHX_ (GV *)arg,
6821 PL_op->op_private & OPpLVREF_TYPE);
6823 else if (!(PL_op->op_private & OPpPAD_STATE))
6824 SAVECLEARSV(PAD_SVl(ARGTARG));
6833 AV * const av = (AV *)POPs;
6834 const bool localizing = PL_op->op_private & OPpLVAL_INTRO;
6835 bool can_preserve = FALSE;
6837 if (UNLIKELY(localizing)) {
6842 can_preserve = SvCANEXISTDELETE(av);
6844 if (SvTYPE(av) == SVt_PVAV) {
6847 for (svp = MARK + 1; svp <= SP; svp++) {
6848 const SSize_t elem = SvIV(*svp);
6852 if (max > AvMAX(av))
6857 while (++MARK <= SP) {
6858 SV * const elemsv = *MARK;
6859 if (UNLIKELY(localizing)) {
6860 if (SvTYPE(av) == SVt_PVAV)
6861 S_localise_aelem_lval(aTHX_ av, elemsv, can_preserve);
6863 S_localise_helem_lval(aTHX_ (HV *)av, elemsv, can_preserve);
6865 *MARK = sv_2mortal(newSV_type(SVt_PVMG));
6866 sv_magic(*MARK,(SV *)av,PERL_MAGIC_lvref,(char *)elemsv,HEf_SVKEY);
6873 if (PL_op->op_flags & OPf_STACKED)
6874 Perl_pp_rv2av(aTHX);
6876 Perl_pp_padav(aTHX);
6880 SETs(0); /* special alias marker that aassign recognises */
6890 SETs(sv_2mortal((SV *)newCONSTSUB(SvTYPE(CopSTASH(PL_curcop))==SVt_PVHV
6891 ? CopSTASH(PL_curcop)
6893 NULL, SvREFCNT_inc_simple_NN(sv))));
6898 /* process one subroutine argument - typically when the sub has a signature:
6899 * introduce PL_curpad[op_targ] and assign to it the value
6900 * for $: (OPf_STACKED ? *sp : $_[N])
6901 * for @/%: @_[N..$#_]
6903 * It's equivalent to
6906 * my $foo = (value-on-stack)
6908 * my @foo = @_[N..$#_]
6918 AV *defav = GvAV(PL_defgv); /* @_ */
6919 IV ix = PTR2IV(cUNOP_AUXo->op_aux);
6922 /* do 'my $var, @var or %var' action */
6923 padentry = &(PAD_SVl(o->op_targ));
6924 save_clearsv(padentry);
6927 if ((o->op_private & OPpARGELEM_MASK) == OPpARGELEM_SV) {
6928 if (o->op_flags & OPf_STACKED) {
6935 /* should already have been checked */
6937 #if IVSIZE > PTRSIZE
6938 assert(ix <= SSize_t_MAX);
6941 svp = av_fetch(defav, ix, FALSE);
6942 val = svp ? *svp : &PL_sv_undef;
6947 /* cargo-culted from pp_sassign */
6948 assert(TAINTING_get || !TAINT_get);
6949 if (UNLIKELY(TAINT_get) && !SvTAINTED(val))
6952 SvSetMagicSV(targ, val);
6956 /* must be AV or HV */
6958 assert(!(o->op_flags & OPf_STACKED));
6959 argc = ((IV)AvFILL(defav) + 1) - ix;
6961 /* This is a copy of the relevant parts of pp_aassign().
6963 if ((o->op_private & OPpARGELEM_MASK) == OPpARGELEM_AV) {
6966 if (AvFILL((AV*)targ) > -1) {
6967 /* target should usually be empty. If we get get
6968 * here, someone's been doing some weird closure tricks.
6969 * Make a copy of all args before clearing the array,
6970 * to avoid the equivalent of @a = ($a[0]) prematurely freeing
6971 * elements. See similar code in pp_aassign.
6973 for (i = 0; i < argc; i++) {
6974 SV **svp = av_fetch(defav, ix + i, FALSE);
6975 SV *newsv = newSV(0);
6976 sv_setsv_flags(newsv,
6977 svp ? *svp : &PL_sv_undef,
6978 (SV_DO_COW_SVSETSV|SV_NOSTEAL));
6979 if (!av_store(defav, ix + i, newsv))
6980 SvREFCNT_dec_NN(newsv);
6982 av_clear((AV*)targ);
6988 av_extend((AV*)targ, argc);
6993 SV **svp = av_fetch(defav, ix + i, FALSE);
6994 SV *val = svp ? *svp : &PL_sv_undef;
6996 sv_setsv(tmpsv, val);
6997 av_store((AV*)targ, i++, tmpsv);
7005 assert((o->op_private & OPpARGELEM_MASK) == OPpARGELEM_HV);
7007 if (SvRMAGICAL(targ) || HvUSEDKEYS((HV*)targ)) {
7008 /* see "target should usually be empty" comment above */
7009 for (i = 0; i < argc; i++) {
7010 SV **svp = av_fetch(defav, ix + i, FALSE);
7011 SV *newsv = newSV(0);
7012 sv_setsv_flags(newsv,
7013 svp ? *svp : &PL_sv_undef,
7014 (SV_DO_COW_SVSETSV|SV_NOSTEAL));
7015 if (!av_store(defav, ix + i, newsv))
7016 SvREFCNT_dec_NN(newsv);
7018 hv_clear((HV*)targ);
7023 assert(argc % 2 == 0);
7032 svp = av_fetch(defav, ix + i++, FALSE);
7033 key = svp ? *svp : &PL_sv_undef;
7034 svp = av_fetch(defav, ix + i++, FALSE);
7035 val = svp ? *svp : &PL_sv_undef;
7038 if (UNLIKELY(SvGMAGICAL(key)))
7039 key = sv_mortalcopy(key);
7041 sv_setsv(tmpsv, val);
7042 hv_store_ent((HV*)targ, key, tmpsv, 0);
7050 /* Handle a default value for one subroutine argument (typically as part
7051 * of a subroutine signature).
7052 * It's equivalent to
7053 * @_ > op_targ ? $_[op_targ] : result_of(op_other)
7055 * Intended to be used where op_next is an OP_ARGELEM
7057 * We abuse the op_targ field slightly: it's an index into @_ rather than
7063 OP * const o = PL_op;
7064 AV *defav = GvAV(PL_defgv); /* @_ */
7065 IV ix = (IV)o->op_targ;
7068 #if IVSIZE > PTRSIZE
7069 assert(ix <= SSize_t_MAX);
7072 if (AvFILL(defav) >= ix) {
7074 SV **svp = av_fetch(defav, ix, FALSE);
7075 SV *val = svp ? *svp : &PL_sv_undef;
7079 return cLOGOPo->op_other;
7084 S_find_runcv_name(void)
7099 sv = sv_2mortal(newSV(0));
7100 gv_fullname4(sv, gv, NULL, TRUE);
7104 /* Check a a subs arguments - i.e. that it has the correct number of args
7105 * (and anything else we might think of in future). Typically used with
7111 OP * const o = PL_op;
7112 UNOP_AUX_item *aux = cUNOP_AUXo->op_aux;
7113 IV params = aux[0].iv;
7114 IV opt_params = aux[1].iv;
7115 char slurpy = (char)(aux[2].iv);
7116 AV *defav = GvAV(PL_defgv); /* @_ */
7120 assert(!SvMAGICAL(defav));
7121 argc = (AvFILLp(defav) + 1);
7122 too_few = (argc < (params - opt_params));
7124 if (UNLIKELY(too_few || (!slurpy && argc > params)))
7125 /* diag_listed_as: Too few arguments for subroutine '%s' */
7126 /* diag_listed_as: Too many arguments for subroutine '%s' */
7127 Perl_croak_caller("Too %s arguments for subroutine '%" SVf "'",
7128 too_few ? "few" : "many", S_find_runcv_name());
7130 if (UNLIKELY(slurpy == '%' && argc > params && (argc - params) % 2))
7131 /* diag_listed_as: Odd name/value argument for subroutine '%s' */
7132 Perl_croak_caller("Odd name/value argument for subroutine '%" SVf "'",
7133 S_find_runcv_name());
7139 * ex: set ts=8 sts=4 sw=4 et: