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 */
1326 const IV biv = SvIVX(svr);
1329 buvok = TRUE; /* effectively it's a UV now */
1331 /* abs, buvok == false records sign */
1336 /* If this does sign extension on unsigned it's time for plan B */
1337 ahigh = alow >> (4 * sizeof (UV));
1339 bhigh = blow >> (4 * sizeof (UV));
1341 if (ahigh && bhigh) {
1343 /* eg 32 bit is at least 0x10000 * 0x10000 == 0x100000000
1344 which is overflow. Drop to NVs below. */
1345 } else if (!ahigh && !bhigh) {
1346 /* eg 32 bit is at most 0xFFFF * 0xFFFF == 0xFFFE0001
1347 so the unsigned multiply cannot overflow. */
1348 const UV product = alow * blow;
1349 if (auvok == buvok) {
1350 /* -ve * -ve or +ve * +ve gives a +ve result. */
1354 } else if (product <= (UV)IV_MIN) {
1355 /* 2s complement assumption that (UV)-IV_MIN is correct. */
1356 /* -ve result, which could overflow an IV */
1358 /* can't negate IV_MIN, but there are aren't two
1359 * integers such that !ahigh && !bhigh, where the
1360 * product equals 0x800....000 */
1361 assert(product != (UV)IV_MIN);
1362 SETi( -(IV)product );
1364 } /* else drop to NVs below. */
1366 /* One operand is large, 1 small */
1369 /* swap the operands */
1371 bhigh = blow; /* bhigh now the temp var for the swap */
1375 /* now, ((ahigh * blow) << half_UV_len) + (alow * blow)
1376 multiplies can't overflow. shift can, add can, -ve can. */
1377 product_middle = ahigh * blow;
1378 if (!(product_middle & topmask)) {
1379 /* OK, (ahigh * blow) won't lose bits when we shift it. */
1381 product_middle <<= (4 * sizeof (UV));
1382 product_low = alow * blow;
1384 /* as for pp_add, UV + something mustn't get smaller.
1385 IIRC ANSI mandates this wrapping *behaviour* for
1386 unsigned whatever the actual representation*/
1387 product_low += product_middle;
1388 if (product_low >= product_middle) {
1389 /* didn't overflow */
1390 if (auvok == buvok) {
1391 /* -ve * -ve or +ve * +ve gives a +ve result. */
1393 SETu( product_low );
1395 } else if (product_low <= (UV)IV_MIN) {
1396 /* 2s complement assumption again */
1397 /* -ve result, which could overflow an IV */
1399 SETi(product_low == (UV)IV_MIN
1400 ? IV_MIN : -(IV)product_low);
1402 } /* else drop to NVs below. */
1404 } /* product_middle too large */
1405 } /* ahigh && bhigh */
1410 NV right = SvNV_nomg(svr);
1411 NV left = SvNV_nomg(svl);
1412 NV result = left * right;
1415 #if defined(__sgi) && defined(USE_LONG_DOUBLE) && LONG_DOUBLEKIND == LONG_DOUBLE_IS_DOUBLEDOUBLE_128_BIT_BE_BE && NVSIZE == 16
1416 if (Perl_isinf(result)) {
1417 Zero((U8*)&result + 8, 8, U8);
1427 dSP; dATARGET; SV *svl, *svr;
1428 tryAMAGICbin_MG(div_amg, AMGf_assign|AMGf_numeric);
1431 /* Only try to do UV divide first
1432 if ((SLOPPYDIVIDE is true) or
1433 (PERL_PRESERVE_IVUV is true and one or both SV is a UV too large
1435 The assumption is that it is better to use floating point divide
1436 whenever possible, only doing integer divide first if we can't be sure.
1437 If NV_PRESERVES_UV is true then we know at compile time that no UV
1438 can be too large to preserve, so don't need to compile the code to
1439 test the size of UVs. */
1441 #if defined(SLOPPYDIVIDE) || (defined(PERL_PRESERVE_IVUV) && !defined(NV_PRESERVES_UV))
1442 # define PERL_TRY_UV_DIVIDE
1443 /* ensure that 20./5. == 4. */
1446 #ifdef PERL_TRY_UV_DIVIDE
1447 if (SvIV_please_nomg(svr) && SvIV_please_nomg(svl)) {
1448 bool left_non_neg = SvUOK(svl);
1449 bool right_non_neg = SvUOK(svr);
1453 if (right_non_neg) {
1457 const IV biv = SvIVX(svr);
1460 right_non_neg = TRUE; /* effectively it's a UV now */
1466 /* historically undef()/0 gives a "Use of uninitialized value"
1467 warning before dieing, hence this test goes here.
1468 If it were immediately before the second SvIV_please, then
1469 DIE() would be invoked before left was even inspected, so
1470 no inspection would give no warning. */
1472 DIE(aTHX_ "Illegal division by zero");
1478 const IV aiv = SvIVX(svl);
1481 left_non_neg = TRUE; /* effectively it's a UV now */
1490 /* For sloppy divide we always attempt integer division. */
1492 /* Otherwise we only attempt it if either or both operands
1493 would not be preserved by an NV. If both fit in NVs
1494 we fall through to the NV divide code below. However,
1495 as left >= right to ensure integer result here, we know that
1496 we can skip the test on the right operand - right big
1497 enough not to be preserved can't get here unless left is
1500 && (left > ((UV)1 << NV_PRESERVES_UV_BITS))
1503 /* Integer division can't overflow, but it can be imprecise. */
1505 /* Modern compilers optimize division followed by
1506 * modulo into a single div instruction */
1507 const UV result = left / right;
1508 if (left % right == 0) {
1509 SP--; /* result is valid */
1510 if (left_non_neg == right_non_neg) {
1511 /* signs identical, result is positive. */
1515 /* 2s complement assumption */
1516 if (result <= (UV)IV_MIN)
1517 SETi(result == (UV)IV_MIN ? IV_MIN : -(IV)result);
1519 /* It's exact but too negative for IV. */
1520 SETn( -(NV)result );
1523 } /* tried integer divide but it was not an integer result */
1524 } /* else (PERL_ABS(result) < 1.0) or (both UVs in range for NV) */
1525 } /* one operand wasn't SvIOK */
1526 #endif /* PERL_TRY_UV_DIVIDE */
1528 NV right = SvNV_nomg(svr);
1529 NV left = SvNV_nomg(svl);
1530 (void)POPs;(void)POPs;
1531 #if defined(NAN_COMPARE_BROKEN) && defined(Perl_isnan)
1532 if (! Perl_isnan(right) && right == 0.0)
1536 DIE(aTHX_ "Illegal division by zero");
1537 PUSHn( left / right );
1545 tryAMAGICbin_MG(modulo_amg, AMGf_assign|AMGf_numeric);
1549 bool left_neg = FALSE;
1550 bool right_neg = FALSE;
1551 bool use_double = FALSE;
1552 bool dright_valid = FALSE;
1555 SV * const svr = TOPs;
1556 SV * const svl = TOPm1s;
1557 if (SvIV_please_nomg(svr)) {
1558 right_neg = !SvUOK(svr);
1562 const IV biv = SvIVX(svr);
1565 right_neg = FALSE; /* effectively it's a UV now */
1572 dright = SvNV_nomg(svr);
1573 right_neg = dright < 0;
1576 if (dright < UV_MAX_P1) {
1577 right = U_V(dright);
1578 dright_valid = TRUE; /* In case we need to use double below. */
1584 /* At this point use_double is only true if right is out of range for
1585 a UV. In range NV has been rounded down to nearest UV and
1586 use_double false. */
1587 if (!use_double && SvIV_please_nomg(svl)) {
1588 left_neg = !SvUOK(svl);
1592 const IV aiv = SvIVX(svl);
1595 left_neg = FALSE; /* effectively it's a UV now */
1602 dleft = SvNV_nomg(svl);
1603 left_neg = dleft < 0;
1607 /* This should be exactly the 5.6 behaviour - if left and right are
1608 both in range for UV then use U_V() rather than floor. */
1610 if (dleft < UV_MAX_P1) {
1611 /* right was in range, so is dleft, so use UVs not double.
1615 /* left is out of range for UV, right was in range, so promote
1616 right (back) to double. */
1618 /* The +0.5 is used in 5.6 even though it is not strictly
1619 consistent with the implicit +0 floor in the U_V()
1620 inside the #if 1. */
1621 dleft = Perl_floor(dleft + 0.5);
1624 dright = Perl_floor(dright + 0.5);
1635 DIE(aTHX_ "Illegal modulus zero");
1637 dans = Perl_fmod(dleft, dright);
1638 if ((left_neg != right_neg) && dans)
1639 dans = dright - dans;
1642 sv_setnv(TARG, dans);
1648 DIE(aTHX_ "Illegal modulus zero");
1651 if ((left_neg != right_neg) && ans)
1654 /* XXX may warn: unary minus operator applied to unsigned type */
1655 /* could change -foo to be (~foo)+1 instead */
1656 if (ans <= ~((UV)IV_MAX)+1)
1657 sv_setiv(TARG, ~ans+1);
1659 sv_setnv(TARG, -(NV)ans);
1662 sv_setuv(TARG, ans);
1674 bool infnan = FALSE;
1675 const U8 gimme = GIMME_V;
1677 if (gimme == G_ARRAY && PL_op->op_private & OPpREPEAT_DOLIST) {
1678 /* TODO: think of some way of doing list-repeat overloading ??? */
1683 if (UNLIKELY(PL_op->op_private & OPpREPEAT_DOLIST)) {
1684 /* The parser saw this as a list repeat, and there
1685 are probably several items on the stack. But we're
1686 in scalar/void context, and there's no pp_list to save us
1687 now. So drop the rest of the items -- robin@kitsite.com
1690 if (MARK + 1 < SP) {
1696 ASSUME(MARK + 1 == SP);
1698 MARK[1] = &PL_sv_undef;
1702 tryAMAGICbin_MG(repeat_amg, AMGf_assign);
1708 const UV uv = SvUV_nomg(sv);
1710 count = IV_MAX; /* The best we can do? */
1714 count = SvIV_nomg(sv);
1717 else if (SvNOKp(sv)) {
1718 const NV nv = SvNV_nomg(sv);
1719 infnan = Perl_isinfnan(nv);
1720 if (UNLIKELY(infnan)) {
1724 count = -1; /* An arbitrary negative integer */
1730 count = SvIV_nomg(sv);
1733 Perl_ck_warner(aTHX_ packWARN(WARN_NUMERIC),
1734 "Non-finite repeat count does nothing");
1735 } else if (count < 0) {
1737 Perl_ck_warner(aTHX_ packWARN(WARN_NUMERIC),
1738 "Negative repeat count does nothing");
1741 if (gimme == G_ARRAY && PL_op->op_private & OPpREPEAT_DOLIST) {
1743 const SSize_t items = SP - MARK;
1744 const U8 mod = PL_op->op_flags & OPf_MOD;
1749 if ( items > SSize_t_MAX / count /* max would overflow */
1750 /* repeatcpy would overflow */
1751 || items > I32_MAX / (I32)sizeof(SV *)
1753 Perl_croak(aTHX_ "%s","Out of memory during list extend");
1754 max = items * count;
1759 if (mod && SvPADTMP(*SP)) {
1760 *SP = sv_mortalcopy(*SP);
1767 repeatcpy((char*)(MARK + items), (char*)MARK,
1768 items * sizeof(const SV *), count - 1);
1771 else if (count <= 0)
1774 else { /* Note: mark already snarfed by pp_list */
1775 SV * const tmpstr = POPs;
1780 sv_setsv_nomg(TARG, tmpstr);
1781 SvPV_force_nomg(TARG, len);
1782 isutf = DO_UTF8(TARG);
1789 if ( len > (MEM_SIZE_MAX-1) / (UV)count /* max would overflow */
1790 || len > (U32)I32_MAX /* repeatcpy would overflow */
1792 Perl_croak(aTHX_ "%s",
1793 "Out of memory during string extend");
1794 max = (UV)count * len + 1;
1797 repeatcpy(SvPVX(TARG) + len, SvPVX(TARG), len, count - 1);
1798 SvCUR_set(TARG, SvCUR(TARG) * count);
1800 *SvEND(TARG) = '\0';
1803 (void)SvPOK_only_UTF8(TARG);
1805 (void)SvPOK_only(TARG);
1814 dSP; dATARGET; bool useleft; SV *svl, *svr;
1815 tryAMAGICbin_MG(subtr_amg, AMGf_assign|AMGf_numeric);
1819 #ifdef PERL_PRESERVE_IVUV
1821 /* special-case some simple common cases */
1822 if (!((svl->sv_flags|svr->sv_flags) & (SVf_IVisUV|SVs_GMG))) {
1824 U32 flags = (svl->sv_flags & svr->sv_flags);
1825 if (flags & SVf_IOK) {
1826 /* both args are simple IVs */
1831 topl = ((UV)il) >> (UVSIZE * 8 - 2);
1832 topr = ((UV)ir) >> (UVSIZE * 8 - 2);
1834 /* if both are in a range that can't under/overflow, do a
1835 * simple integer subtract: if the top of both numbers
1836 * are 00 or 11, then it's safe */
1837 if (!( ((topl+1) | (topr+1)) & 2)) {
1839 TARGi(il - ir, 0); /* args not GMG, so can't be tainted */
1845 else if (flags & SVf_NOK) {
1846 /* both args are NVs */
1851 #if defined(NAN_COMPARE_BROKEN) && defined(Perl_isnan)
1852 !Perl_isnan(nl) && nl == (NV)(il = (IV)nl)
1853 && !Perl_isnan(nr) && nr == (NV)(ir = (IV)nr)
1855 nl == (NV)(il = (IV)nl) && nr == (NV)(ir = (IV)nr)
1858 /* nothing was lost by converting to IVs */
1861 TARGn(nl - nr, 0); /* args not GMG, so can't be tainted */
1869 useleft = USE_LEFT(svl);
1870 /* See comments in pp_add (in pp_hot.c) about Overflow, and how
1871 "bad things" happen if you rely on signed integers wrapping. */
1872 if (SvIV_please_nomg(svr)) {
1873 /* Unless the left argument is integer in range we are going to have to
1874 use NV maths. Hence only attempt to coerce the right argument if
1875 we know the left is integer. */
1882 a_valid = auvok = 1;
1883 /* left operand is undef, treat as zero. */
1885 /* Left operand is defined, so is it IV? */
1886 if (SvIV_please_nomg(svl)) {
1887 if ((auvok = SvUOK(svl)))
1890 const IV aiv = SvIVX(svl);
1893 auvok = 1; /* Now acting as a sign flag. */
1902 bool result_good = 0;
1905 bool buvok = SvUOK(svr);
1910 const IV biv = SvIVX(svr);
1917 /* ?uvok if value is >= 0. basically, flagged as UV if it's +ve,
1918 else "IV" now, independent of how it came in.
1919 if a, b represents positive, A, B negative, a maps to -A etc
1924 all UV maths. negate result if A negative.
1925 subtract if signs same, add if signs differ. */
1927 if (auvok ^ buvok) {
1936 /* Must get smaller */
1941 if (result <= buv) {
1942 /* result really should be -(auv-buv). as its negation
1943 of true value, need to swap our result flag */
1955 if (result <= (UV)IV_MIN)
1956 SETi(result == (UV)IV_MIN
1957 ? IV_MIN : -(IV)result);
1959 /* result valid, but out of range for IV. */
1960 SETn( -(NV)result );
1964 } /* Overflow, drop through to NVs. */
1968 useleft = USE_LEFT(svl);
1971 NV value = SvNV_nomg(svr);
1975 /* left operand is undef, treat as zero - value */
1979 SETn( SvNV_nomg(svl) - value );
1984 #define IV_BITS (IVSIZE * 8)
1986 static UV S_uv_shift(UV uv, int shift, bool left)
1992 if (shift >= IV_BITS) {
1995 return left ? uv << shift : uv >> shift;
1998 static IV S_iv_shift(IV iv, int shift, bool left)
2004 if (shift >= IV_BITS) {
2005 return iv < 0 && !left ? -1 : 0;
2007 return left ? iv << shift : iv >> shift;
2010 #define UV_LEFT_SHIFT(uv, shift) S_uv_shift(uv, shift, TRUE)
2011 #define UV_RIGHT_SHIFT(uv, shift) S_uv_shift(uv, shift, FALSE)
2012 #define IV_LEFT_SHIFT(iv, shift) S_iv_shift(iv, shift, TRUE)
2013 #define IV_RIGHT_SHIFT(iv, shift) S_iv_shift(iv, shift, FALSE)
2017 dSP; dATARGET; SV *svl, *svr;
2018 tryAMAGICbin_MG(lshift_amg, AMGf_assign|AMGf_numeric);
2022 const IV shift = SvIV_nomg(svr);
2023 if (PL_op->op_private & HINT_INTEGER) {
2024 SETi(IV_LEFT_SHIFT(SvIV_nomg(svl), shift));
2027 SETu(UV_LEFT_SHIFT(SvUV_nomg(svl), shift));
2035 dSP; dATARGET; SV *svl, *svr;
2036 tryAMAGICbin_MG(rshift_amg, AMGf_assign|AMGf_numeric);
2040 const IV shift = SvIV_nomg(svr);
2041 if (PL_op->op_private & HINT_INTEGER) {
2042 SETi(IV_RIGHT_SHIFT(SvIV_nomg(svl), shift));
2045 SETu(UV_RIGHT_SHIFT(SvUV_nomg(svl), shift));
2056 tryAMAGICbin_MG(lt_amg, AMGf_numeric);
2060 (SvIOK_notUV(left) && SvIOK_notUV(right))
2061 ? (SvIVX(left) < SvIVX(right))
2062 : (do_ncmp(left, right) == -1)
2072 tryAMAGICbin_MG(gt_amg, AMGf_numeric);
2076 (SvIOK_notUV(left) && SvIOK_notUV(right))
2077 ? (SvIVX(left) > SvIVX(right))
2078 : (do_ncmp(left, right) == 1)
2088 tryAMAGICbin_MG(le_amg, AMGf_numeric);
2092 (SvIOK_notUV(left) && SvIOK_notUV(right))
2093 ? (SvIVX(left) <= SvIVX(right))
2094 : (do_ncmp(left, right) <= 0)
2104 tryAMAGICbin_MG(ge_amg, AMGf_numeric);
2108 (SvIOK_notUV(left) && SvIOK_notUV(right))
2109 ? (SvIVX(left) >= SvIVX(right))
2110 : ( (do_ncmp(left, right) & 2) == 0)
2120 tryAMAGICbin_MG(ne_amg, AMGf_numeric);
2124 (SvIOK_notUV(left) && SvIOK_notUV(right))
2125 ? (SvIVX(left) != SvIVX(right))
2126 : (do_ncmp(left, right) != 0)
2131 /* compare left and right SVs. Returns:
2135 * 2: left or right was a NaN
2138 Perl_do_ncmp(pTHX_ SV* const left, SV * const right)
2140 PERL_ARGS_ASSERT_DO_NCMP;
2141 #ifdef PERL_PRESERVE_IVUV
2142 /* Fortunately it seems NaN isn't IOK */
2143 if (SvIV_please_nomg(right) && SvIV_please_nomg(left)) {
2145 const IV leftiv = SvIVX(left);
2146 if (!SvUOK(right)) {
2147 /* ## IV <=> IV ## */
2148 const IV rightiv = SvIVX(right);
2149 return (leftiv > rightiv) - (leftiv < rightiv);
2151 /* ## IV <=> UV ## */
2153 /* As (b) is a UV, it's >=0, so it must be < */
2156 const UV rightuv = SvUVX(right);
2157 return ((UV)leftiv > rightuv) - ((UV)leftiv < rightuv);
2162 /* ## UV <=> UV ## */
2163 const UV leftuv = SvUVX(left);
2164 const UV rightuv = SvUVX(right);
2165 return (leftuv > rightuv) - (leftuv < rightuv);
2167 /* ## UV <=> IV ## */
2169 const IV rightiv = SvIVX(right);
2171 /* As (a) is a UV, it's >=0, so it cannot be < */
2174 const UV leftuv = SvUVX(left);
2175 return (leftuv > (UV)rightiv) - (leftuv < (UV)rightiv);
2178 NOT_REACHED; /* NOTREACHED */
2182 NV const rnv = SvNV_nomg(right);
2183 NV const lnv = SvNV_nomg(left);
2185 #if defined(NAN_COMPARE_BROKEN) && defined(Perl_isnan)
2186 if (Perl_isnan(lnv) || Perl_isnan(rnv)) {
2189 return (lnv > rnv) - (lnv < rnv);
2208 tryAMAGICbin_MG(ncmp_amg, AMGf_numeric);
2211 value = do_ncmp(left, right);
2223 /* also used for: pp_sge() pp_sgt() pp_slt() */
2229 int amg_type = sle_amg;
2233 switch (PL_op->op_type) {
2252 tryAMAGICbin_MG(amg_type, 0);
2256 #ifdef USE_LOCALE_COLLATE
2257 (IN_LC_RUNTIME(LC_COLLATE))
2258 ? sv_cmp_locale_flags(left, right, 0)
2261 sv_cmp_flags(left, right, 0);
2262 SETs(boolSV(cmp * multiplier < rhs));
2270 tryAMAGICbin_MG(seq_amg, 0);
2273 SETs(boolSV(sv_eq_flags(left, right, 0)));
2281 tryAMAGICbin_MG(sne_amg, 0);
2284 SETs(boolSV(!sv_eq_flags(left, right, 0)));
2292 tryAMAGICbin_MG(scmp_amg, 0);
2296 #ifdef USE_LOCALE_COLLATE
2297 (IN_LC_RUNTIME(LC_COLLATE))
2298 ? sv_cmp_locale_flags(left, right, 0)
2301 sv_cmp_flags(left, right, 0);
2310 tryAMAGICbin_MG(band_amg, AMGf_assign);
2313 if (SvNIOKp(left) || SvNIOKp(right)) {
2314 const bool left_ro_nonnum = !SvNIOKp(left) && SvREADONLY(left);
2315 const bool right_ro_nonnum = !SvNIOKp(right) && SvREADONLY(right);
2316 if (PL_op->op_private & HINT_INTEGER) {
2317 const IV i = SvIV_nomg(left) & SvIV_nomg(right);
2321 const UV u = SvUV_nomg(left) & SvUV_nomg(right);
2324 if (left_ro_nonnum && left != TARG) SvNIOK_off(left);
2325 if (right_ro_nonnum) SvNIOK_off(right);
2328 do_vop(PL_op->op_type, TARG, left, right);
2338 tryAMAGICbin_MG(band_amg, AMGf_assign|AMGf_numarg);
2340 dATARGET; dPOPTOPssrl;
2341 if (PL_op->op_private & HINT_INTEGER) {
2342 const IV i = SvIV_nomg(left) & SvIV_nomg(right);
2346 const UV u = SvUV_nomg(left) & SvUV_nomg(right);
2356 tryAMAGICbin_MG(sband_amg, AMGf_assign);
2358 dATARGET; dPOPTOPssrl;
2359 do_vop(OP_BIT_AND, TARG, left, right);
2364 /* also used for: pp_bit_xor() */
2369 const int op_type = PL_op->op_type;
2371 tryAMAGICbin_MG((op_type == OP_BIT_OR ? bor_amg : bxor_amg), AMGf_assign);
2374 if (SvNIOKp(left) || SvNIOKp(right)) {
2375 const bool left_ro_nonnum = !SvNIOKp(left) && SvREADONLY(left);
2376 const bool right_ro_nonnum = !SvNIOKp(right) && SvREADONLY(right);
2377 if (PL_op->op_private & HINT_INTEGER) {
2378 const IV l = (USE_LEFT(left) ? SvIV_nomg(left) : 0);
2379 const IV r = SvIV_nomg(right);
2380 const IV result = op_type == OP_BIT_OR ? (l | r) : (l ^ r);
2384 const UV l = (USE_LEFT(left) ? SvUV_nomg(left) : 0);
2385 const UV r = SvUV_nomg(right);
2386 const UV result = op_type == OP_BIT_OR ? (l | r) : (l ^ r);
2389 if (left_ro_nonnum && left != TARG) SvNIOK_off(left);
2390 if (right_ro_nonnum) SvNIOK_off(right);
2393 do_vop(op_type, TARG, left, right);
2400 /* also used for: pp_nbit_xor() */
2405 const int op_type = PL_op->op_type;
2407 tryAMAGICbin_MG((op_type == OP_NBIT_OR ? bor_amg : bxor_amg),
2408 AMGf_assign|AMGf_numarg);
2410 dATARGET; dPOPTOPssrl;
2411 if (PL_op->op_private & HINT_INTEGER) {
2412 const IV l = (USE_LEFT(left) ? SvIV_nomg(left) : 0);
2413 const IV r = SvIV_nomg(right);
2414 const IV result = op_type == OP_NBIT_OR ? (l | r) : (l ^ r);
2418 const UV l = (USE_LEFT(left) ? SvUV_nomg(left) : 0);
2419 const UV r = SvUV_nomg(right);
2420 const UV result = op_type == OP_NBIT_OR ? (l | r) : (l ^ r);
2427 /* also used for: pp_sbit_xor() */
2432 const int op_type = PL_op->op_type;
2434 tryAMAGICbin_MG((op_type == OP_SBIT_OR ? sbor_amg : sbxor_amg),
2437 dATARGET; dPOPTOPssrl;
2438 do_vop(op_type == OP_SBIT_OR ? OP_BIT_OR : OP_BIT_XOR, TARG, left,
2444 PERL_STATIC_INLINE bool
2445 S_negate_string(pTHX)
2450 SV * const sv = TOPs;
2451 if (!SvPOKp(sv) || SvNIOK(sv) || (!SvPOK(sv) && SvNIOKp(sv)))
2453 s = SvPV_nomg_const(sv, len);
2454 if (isIDFIRST(*s)) {
2455 sv_setpvs(TARG, "-");
2458 else if (*s == '+' || (*s == '-' && !looks_like_number(sv))) {
2459 sv_setsv_nomg(TARG, sv);
2460 *SvPV_force_nomg(TARG, len) = *s == '-' ? '+' : '-';
2470 tryAMAGICun_MG(neg_amg, AMGf_numeric);
2471 if (S_negate_string(aTHX)) return NORMAL;
2473 SV * const sv = TOPs;
2476 /* It's publicly an integer */
2479 if (SvIVX(sv) == IV_MIN) {
2480 /* 2s complement assumption. */
2481 SETi(SvIVX(sv)); /* special case: -((UV)IV_MAX+1) ==
2485 else if (SvUVX(sv) <= IV_MAX) {
2490 else if (SvIVX(sv) != IV_MIN) {
2494 #ifdef PERL_PRESERVE_IVUV
2501 if (SvNIOKp(sv) && (SvNIOK(sv) || !SvPOK(sv)))
2502 SETn(-SvNV_nomg(sv));
2503 else if (SvPOKp(sv) && SvIV_please_nomg(sv))
2504 goto oops_its_an_int;
2506 SETn(-SvNV_nomg(sv));
2516 tryAMAGICun_MG(not_amg, 0);
2518 *PL_stack_sp = boolSV(!SvTRUE_nomg_NN(sv));
2523 S_scomplement(pTHX_ SV *targ, SV *sv)
2529 sv_copypv_nomg(TARG, sv);
2530 tmps = (U8*)SvPV_nomg(TARG, len);
2533 if (len && ! utf8_to_bytes(tmps, &len)) {
2534 Perl_croak(aTHX_ FATAL_ABOVE_FF_MSG, PL_op_desc[PL_op->op_type]);
2545 for ( ; anum && (unsigned long)tmps % sizeof(long); anum--, tmps++)
2548 for ( ; anum >= (I32)sizeof(long); anum -= (I32)sizeof(long), tmpl++)
2553 for ( ; anum > 0; anum--, tmps++)
2560 tryAMAGICun_MG(compl_amg, AMGf_numeric);
2564 if (PL_op->op_private & HINT_INTEGER) {
2565 const IV i = ~SvIV_nomg(sv);
2569 const UV u = ~SvUV_nomg(sv);
2574 S_scomplement(aTHX_ TARG, sv);
2584 tryAMAGICun_MG(compl_amg, AMGf_numeric|AMGf_numarg);
2587 if (PL_op->op_private & HINT_INTEGER) {
2588 const IV i = ~SvIV_nomg(sv);
2592 const UV u = ~SvUV_nomg(sv);
2602 tryAMAGICun_MG(scompl_amg, AMGf_numeric);
2605 S_scomplement(aTHX_ TARG, sv);
2611 /* integer versions of some of the above */
2616 tryAMAGICbin_MG(mult_amg, AMGf_assign);
2619 SETi( left * right );
2628 tryAMAGICbin_MG(div_amg, AMGf_assign);
2631 IV value = SvIV_nomg(right);
2633 DIE(aTHX_ "Illegal division by zero");
2634 num = SvIV_nomg(left);
2636 /* avoid FPE_INTOVF on some platforms when num is IV_MIN */
2640 value = num / value;
2648 /* This is the vanilla old i_modulo. */
2650 tryAMAGICbin_MG(modulo_amg, AMGf_assign);
2654 DIE(aTHX_ "Illegal modulus zero");
2655 /* avoid FPE_INTOVF on some platforms when left is IV_MIN */
2659 SETi( left % right );
2664 #if defined(__GLIBC__) && IVSIZE == 8 \
2665 && ( __GLIBC__ < 2 || (__GLIBC__ == 2 && __GLIBC_MINOR__ < 8))
2667 PP(pp_i_modulo_glibc_bugfix)
2669 /* This is the i_modulo with the workaround for the _moddi3 bug
2670 * in (at least) glibc 2.2.5 (the PERL_ABS() the workaround).
2671 * See below for pp_i_modulo. */
2673 tryAMAGICbin_MG(modulo_amg, AMGf_assign);
2677 DIE(aTHX_ "Illegal modulus zero");
2678 /* avoid FPE_INTOVF on some platforms when left is IV_MIN */
2682 SETi( left % PERL_ABS(right) );
2691 tryAMAGICbin_MG(add_amg, AMGf_assign);
2693 dPOPTOPiirl_ul_nomg;
2694 SETi( left + right );
2702 tryAMAGICbin_MG(subtr_amg, AMGf_assign);
2704 dPOPTOPiirl_ul_nomg;
2705 SETi( left - right );
2713 tryAMAGICbin_MG(lt_amg, 0);
2716 SETs(boolSV(left < right));
2724 tryAMAGICbin_MG(gt_amg, 0);
2727 SETs(boolSV(left > right));
2735 tryAMAGICbin_MG(le_amg, 0);
2738 SETs(boolSV(left <= right));
2746 tryAMAGICbin_MG(ge_amg, 0);
2749 SETs(boolSV(left >= right));
2757 tryAMAGICbin_MG(eq_amg, 0);
2760 SETs(boolSV(left == right));
2768 tryAMAGICbin_MG(ne_amg, 0);
2771 SETs(boolSV(left != right));
2779 tryAMAGICbin_MG(ncmp_amg, 0);
2786 else if (left < right)
2798 tryAMAGICun_MG(neg_amg, 0);
2799 if (S_negate_string(aTHX)) return NORMAL;
2801 SV * const sv = TOPs;
2802 IV const i = SvIV_nomg(sv);
2808 /* High falutin' math. */
2813 tryAMAGICbin_MG(atan2_amg, 0);
2816 SETn(Perl_atan2(left, right));
2822 /* also used for: pp_cos() pp_exp() pp_log() pp_sqrt() */
2827 int amg_type = fallback_amg;
2828 const char *neg_report = NULL;
2829 const int op_type = PL_op->op_type;
2832 case OP_SIN: amg_type = sin_amg; break;
2833 case OP_COS: amg_type = cos_amg; break;
2834 case OP_EXP: amg_type = exp_amg; break;
2835 case OP_LOG: amg_type = log_amg; neg_report = "log"; break;
2836 case OP_SQRT: amg_type = sqrt_amg; neg_report = "sqrt"; break;
2839 assert(amg_type != fallback_amg);
2841 tryAMAGICun_MG(amg_type, 0);
2843 SV * const arg = TOPs;
2844 const NV value = SvNV_nomg(arg);
2850 if (neg_report) { /* log or sqrt */
2852 #if defined(NAN_COMPARE_BROKEN) && defined(Perl_isnan)
2853 ! Perl_isnan(value) &&
2855 (op_type == OP_LOG ? (value <= 0.0) : (value < 0.0))) {
2856 SET_NUMERIC_STANDARD();
2857 /* diag_listed_as: Can't take log of %g */
2858 DIE(aTHX_ "Can't take %s of %" NVgf, neg_report, value);
2863 case OP_SIN: result = Perl_sin(value); break;
2864 case OP_COS: result = Perl_cos(value); break;
2865 case OP_EXP: result = Perl_exp(value); break;
2866 case OP_LOG: result = Perl_log(value); break;
2867 case OP_SQRT: result = Perl_sqrt(value); break;
2874 /* Support Configure command-line overrides for rand() functions.
2875 After 5.005, perhaps we should replace this by Configure support
2876 for drand48(), random(), or rand(). For 5.005, though, maintain
2877 compatibility by calling rand() but allow the user to override it.
2878 See INSTALL for details. --Andy Dougherty 15 July 1998
2880 /* Now it's after 5.005, and Configure supports drand48() and random(),
2881 in addition to rand(). So the overrides should not be needed any more.
2882 --Jarkko Hietaniemi 27 September 1998
2887 if (!PL_srand_called) {
2888 (void)seedDrand01((Rand_seed_t)seed());
2889 PL_srand_called = TRUE;
2901 SV * const sv = POPs;
2907 /* 1 of 2 things can be carried through SvNV, SP or TARG, SP was carried */
2908 #if defined(NAN_COMPARE_BROKEN) && defined(Perl_isnan)
2909 if (! Perl_isnan(value) && value == 0.0)
2919 sv_setnv_mg(TARG, value);
2930 if (MAXARG >= 1 && (TOPs || POPs)) {
2937 pv = SvPV(top, len);
2938 flags = grok_number(pv, len, &anum);
2940 if (!(flags & IS_NUMBER_IN_UV)) {
2941 Perl_ck_warner_d(aTHX_ packWARN(WARN_OVERFLOW),
2942 "Integer overflow in srand");
2950 (void)seedDrand01((Rand_seed_t)anum);
2951 PL_srand_called = TRUE;
2955 /* Historically srand always returned true. We can avoid breaking
2957 sv_setpvs(TARG, "0 but true");
2966 tryAMAGICun_MG(int_amg, AMGf_numeric);
2968 SV * const sv = TOPs;
2969 const IV iv = SvIV_nomg(sv);
2970 /* XXX it's arguable that compiler casting to IV might be subtly
2971 different from modf (for numbers inside (IV_MIN,UV_MAX)) in which
2972 else preferring IV has introduced a subtle behaviour change bug. OTOH
2973 relying on floating point to be accurate is a bug. */
2978 else if (SvIOK(sv)) {
2980 SETu(SvUV_nomg(sv));
2985 const NV value = SvNV_nomg(sv);
2986 if (UNLIKELY(Perl_isinfnan(value)))
2988 else if (value >= 0.0) {
2989 if (value < (NV)UV_MAX + 0.5) {
2992 SETn(Perl_floor(value));
2996 if (value > (NV)IV_MIN - 0.5) {
2999 SETn(Perl_ceil(value));
3010 tryAMAGICun_MG(abs_amg, AMGf_numeric);
3012 SV * const sv = TOPs;
3013 /* This will cache the NV value if string isn't actually integer */
3014 const IV iv = SvIV_nomg(sv);
3019 else if (SvIOK(sv)) {
3020 /* IVX is precise */
3022 SETu(SvUV_nomg(sv)); /* force it to be numeric only */
3030 /* 2s complement assumption. Also, not really needed as
3031 IV_MIN and -IV_MIN should both be %100...00 and NV-able */
3037 const NV value = SvNV_nomg(sv);
3048 /* also used for: pp_hex() */
3054 I32 flags = PERL_SCAN_ALLOW_UNDERSCORES;
3058 SV* const sv = TOPs;
3060 tmps = (SvPV_const(sv, len));
3062 /* If Unicode, try to downgrade
3063 * If not possible, croak. */
3064 SV* const tsv = sv_2mortal(newSVsv(sv));
3067 sv_utf8_downgrade(tsv, FALSE);
3068 tmps = SvPV_const(tsv, len);
3070 if (PL_op->op_type == OP_HEX)
3073 while (*tmps && len && isSPACE(*tmps))
3077 if (isALPHA_FOLD_EQ(*tmps, 'x')) {
3079 result_uv = grok_hex (tmps, &len, &flags, &result_nv);
3081 else if (isALPHA_FOLD_EQ(*tmps, 'b'))
3082 result_uv = grok_bin (tmps, &len, &flags, &result_nv);
3084 result_uv = grok_oct (tmps, &len, &flags, &result_nv);
3086 if (flags & PERL_SCAN_GREATER_THAN_UV_MAX) {
3101 SV * const sv = TOPs;
3103 U32 in_bytes = IN_BYTES;
3104 /* Simplest case shortcut:
3105 * set svflags to just the SVf_POK|SVs_GMG|SVf_UTF8 from the SV,
3106 * with the SVf_UTF8 flag inverted if under 'use bytes' (HINT_BYTES
3109 U32 svflags = (SvFLAGS(sv) ^ (in_bytes << 26)) & (SVf_POK|SVs_GMG|SVf_UTF8);
3111 STATIC_ASSERT_STMT(SVf_UTF8 == (HINT_BYTES << 26));
3114 if (LIKELY(svflags == SVf_POK))
3117 if (svflags & SVs_GMG)
3122 if (!IN_BYTES) { /* reread to avoid using an C auto/register */
3123 if ((SvFLAGS(sv) & (SVf_POK|SVf_UTF8)) == SVf_POK)
3125 if ( SvPOK(sv) && (PL_op->op_private & OPpTRUEBOOL)) {
3126 /* no need to convert from bytes to chars */
3130 len = sv_len_utf8_nomg(sv);
3133 /* unrolled SvPV_nomg_const(sv,len) */
3134 if (SvPOK_nog(sv)) {
3137 if (PL_op->op_private & OPpTRUEBOOL) {
3139 SETs(len ? &PL_sv_yes : &PL_sv_zero);
3144 (void)sv_2pv_flags(sv, &len, 0|SV_CONST_RETURN);
3147 TARGi((IV)(len), 1);
3150 if (!SvPADTMP(TARG)) {
3151 /* OPpTARGET_MY: targ is var in '$lex = length()' */
3156 /* TARG is on stack at this point and is overwriten by SETs.
3157 * This branch is the odd one out, so put TARG by default on
3158 * stack earlier to let local SP go out of liveness sooner */
3161 return NORMAL; /* no putback, SP didn't move in this opcode */
3165 /* Returns false if substring is completely outside original string.
3166 No length is indicated by len_iv = 0 and len_is_uv = 0. len_is_uv must
3167 always be true for an explicit 0.
3170 Perl_translate_substr_offsets( STRLEN curlen, IV pos1_iv,
3171 bool pos1_is_uv, IV len_iv,
3172 bool len_is_uv, STRLEN *posp,
3178 PERL_ARGS_ASSERT_TRANSLATE_SUBSTR_OFFSETS;
3180 if (!pos1_is_uv && pos1_iv < 0 && curlen) {
3181 pos1_is_uv = curlen-1 > ~(UV)pos1_iv;
3184 if ((pos1_is_uv || pos1_iv > 0) && (UV)pos1_iv > curlen)
3187 if (len_iv || len_is_uv) {
3188 if (!len_is_uv && len_iv < 0) {
3189 pos2_iv = curlen + len_iv;
3191 pos2_is_uv = curlen-1 > ~(UV)len_iv;
3194 } else { /* len_iv >= 0 */
3195 if (!pos1_is_uv && pos1_iv < 0) {
3196 pos2_iv = pos1_iv + len_iv;
3197 pos2_is_uv = (UV)len_iv > (UV)IV_MAX;
3199 if ((UV)len_iv > curlen-(UV)pos1_iv)
3202 pos2_iv = pos1_iv+len_iv;
3212 if (!pos2_is_uv && pos2_iv < 0) {
3213 if (!pos1_is_uv && pos1_iv < 0)
3217 else if (!pos1_is_uv && pos1_iv < 0)
3220 if ((UV)pos2_iv < (UV)pos1_iv)
3222 if ((UV)pos2_iv > curlen)
3225 /* pos1_iv and pos2_iv both in 0..curlen, so the cast is safe */
3226 *posp = (STRLEN)( (UV)pos1_iv );
3227 *lenp = (STRLEN)( (UV)pos2_iv - (UV)pos1_iv );
3244 I32 lvalue = PL_op->op_flags & OPf_MOD || LVRET;
3245 const bool rvalue = (GIMME_V != G_VOID);
3248 const char *repl = NULL;
3250 int num_args = PL_op->op_private & 7;
3251 bool repl_need_utf8_upgrade = FALSE;
3255 if(!(repl_sv = POPs)) num_args--;
3257 if ((len_sv = POPs)) {
3258 len_iv = SvIV(len_sv);
3259 len_is_uv = len_iv ? SvIOK_UV(len_sv) : 1;
3264 pos1_iv = SvIV(pos_sv);
3265 pos1_is_uv = SvIOK_UV(pos_sv);
3267 if (PL_op->op_private & OPpSUBSTR_REPL_FIRST) {
3271 if (lvalue && !repl_sv) {
3273 ret = sv_2mortal(newSV_type(SVt_PVLV)); /* Not TARG RT#67838 */
3274 sv_magic(ret, NULL, PERL_MAGIC_substr, NULL, 0);
3276 LvTARG(ret) = SvREFCNT_inc_simple(sv);
3278 pos1_is_uv || pos1_iv >= 0
3279 ? (STRLEN)(UV)pos1_iv
3280 : (LvFLAGS(ret) |= LVf_NEG_OFF, (STRLEN)(UV)-pos1_iv);
3282 len_is_uv || len_iv > 0
3283 ? (STRLEN)(UV)len_iv
3284 : (LvFLAGS(ret) |= LVf_NEG_LEN, (STRLEN)(UV)-len_iv);
3286 PUSHs(ret); /* avoid SvSETMAGIC here */
3290 repl = SvPV_const(repl_sv, repl_len);
3293 Perl_ck_warner(aTHX_ packWARN(WARN_SUBSTR),
3294 "Attempt to use reference as lvalue in substr"
3296 tmps = SvPV_force_nomg(sv, curlen);
3297 if (DO_UTF8(repl_sv) && repl_len) {
3299 /* Upgrade the dest, and recalculate tmps in case the buffer
3300 * got reallocated; curlen may also have been changed */
3301 sv_utf8_upgrade_nomg(sv);
3302 tmps = SvPV_nomg(sv, curlen);
3305 else if (DO_UTF8(sv))
3306 repl_need_utf8_upgrade = TRUE;
3308 else tmps = SvPV_const(sv, curlen);
3310 utf8_curlen = sv_or_pv_len_utf8(sv, tmps, curlen);
3311 if (utf8_curlen == curlen)
3314 curlen = utf8_curlen;
3320 STRLEN pos, len, byte_len, byte_pos;
3322 if (!translate_substr_offsets(
3323 curlen, pos1_iv, pos1_is_uv, len_iv, len_is_uv, &pos, &len
3327 byte_pos = utf8_curlen
3328 ? sv_or_pv_pos_u2b(sv, tmps, pos, &byte_len) : pos;
3333 SvTAINTED_off(TARG); /* decontaminate */
3334 SvUTF8_off(TARG); /* decontaminate */
3335 sv_setpvn(TARG, tmps, byte_len);
3336 #ifdef USE_LOCALE_COLLATE
3337 sv_unmagic(TARG, PERL_MAGIC_collxfrm);
3344 SV* repl_sv_copy = NULL;
3346 if (repl_need_utf8_upgrade) {
3347 repl_sv_copy = newSVsv(repl_sv);
3348 sv_utf8_upgrade(repl_sv_copy);
3349 repl = SvPV_const(repl_sv_copy, repl_len);
3353 sv_insert_flags(sv, byte_pos, byte_len, repl, repl_len, 0);
3354 SvREFCNT_dec(repl_sv_copy);
3357 if (PL_op->op_private & OPpSUBSTR_REPL_FIRST)
3367 Perl_croak(aTHX_ "substr outside of string");
3368 Perl_ck_warner(aTHX_ packWARN(WARN_SUBSTR), "substr outside of string");
3375 const IV size = POPi;
3376 SV* offsetsv = POPs;
3377 SV * const src = POPs;
3378 const I32 lvalue = PL_op->op_flags & OPf_MOD || LVRET;
3384 /* extract a STRLEN-ranged integer value from offsetsv into offset,
3385 * or flag that its out of range */
3387 IV iv = SvIV(offsetsv);
3389 /* avoid a large UV being wrapped to a negative value */
3390 if (SvIOK_UV(offsetsv) && SvUVX(offsetsv) > (UV)IV_MAX)
3391 errflags = LVf_OUT_OF_RANGE;
3393 errflags = (LVf_NEG_OFF|LVf_OUT_OF_RANGE);
3394 #if PTRSIZE < IVSIZE
3395 else if (iv > Size_t_MAX)
3396 errflags = LVf_OUT_OF_RANGE;
3399 offset = (STRLEN)iv;
3402 retuv = errflags ? 0 : do_vecget(src, offset, size);
3404 if (lvalue) { /* it's an lvalue! */
3405 ret = sv_2mortal(newSV_type(SVt_PVLV)); /* Not TARG RT#67838 */
3406 sv_magic(ret, NULL, PERL_MAGIC_vec, NULL, 0);
3408 LvTARG(ret) = SvREFCNT_inc_simple(src);
3409 LvTARGOFF(ret) = offset;
3410 LvTARGLEN(ret) = size;
3411 LvFLAGS(ret) = errflags;
3415 SvTAINTED_off(TARG); /* decontaminate */
3419 sv_setuv(ret, retuv);
3427 /* also used for: pp_rindex() */
3440 const char *little_p;
3443 const bool is_index = PL_op->op_type == OP_INDEX;
3444 const bool threeargs = MAXARG >= 3 && (TOPs || ((void)POPs,0));
3450 big_p = SvPV_const(big, biglen);
3451 little_p = SvPV_const(little, llen);
3453 big_utf8 = DO_UTF8(big);
3454 little_utf8 = DO_UTF8(little);
3455 if (big_utf8 ^ little_utf8) {
3456 /* One needs to be upgraded. */
3458 /* Well, maybe instead we might be able to downgrade the small
3460 char * const pv = (char*)bytes_from_utf8((U8 *)little_p, &llen,
3463 /* If the large string is ISO-8859-1, and it's not possible to
3464 convert the small string to ISO-8859-1, then there is no
3465 way that it could be found anywhere by index. */
3470 /* At this point, pv is a malloc()ed string. So donate it to temp
3471 to ensure it will get free()d */
3472 little = temp = newSV(0);
3473 sv_usepvn(temp, pv, llen);
3474 little_p = SvPVX(little);
3476 temp = newSVpvn(little_p, llen);
3478 sv_utf8_upgrade(temp);
3480 little_p = SvPV_const(little, llen);
3483 if (SvGAMAGIC(big)) {
3484 /* Life just becomes a lot easier if I use a temporary here.
3485 Otherwise I need to avoid calls to sv_pos_u2b(), which (dangerously)
3486 will trigger magic and overloading again, as will fbm_instr()
3488 big = newSVpvn_flags(big_p, biglen,
3489 SVs_TEMP | (big_utf8 ? SVf_UTF8 : 0));
3492 if (SvGAMAGIC(little) || (is_index && !SvOK(little))) {
3493 /* index && SvOK() is a hack. fbm_instr() calls SvPV_const, which will
3494 warn on undef, and we've already triggered a warning with the
3495 SvPV_const some lines above. We can't remove that, as we need to
3496 call some SvPV to trigger overloading early and find out if the
3498 This is all getting too messy. The API isn't quite clean enough,
3499 because data access has side effects.
3501 little = newSVpvn_flags(little_p, llen,
3502 SVs_TEMP | (little_utf8 ? SVf_UTF8 : 0));
3503 little_p = SvPVX(little);
3507 offset = is_index ? 0 : biglen;
3509 if (big_utf8 && offset > 0)
3510 offset = sv_pos_u2b_flags(big, offset, 0, SV_CONST_RETURN);
3516 else if (offset > (SSize_t)biglen)
3518 if (!(little_p = is_index
3519 ? fbm_instr((unsigned char*)big_p + offset,
3520 (unsigned char*)big_p + biglen, little, 0)
3521 : rninstr(big_p, big_p + offset,
3522 little_p, little_p + llen)))
3525 retval = little_p - big_p;
3526 if (retval > 1 && big_utf8)
3527 retval = sv_pos_b2u_flags(big, retval, SV_CONST_RETURN);
3532 /* OPpTRUEBOOL indicates an '== -1' has been optimised away */
3533 if (PL_op->op_private & OPpTRUEBOOL) {
3534 PUSHs( ((retval != -1) ^ cBOOL(PL_op->op_private & OPpINDEX_BOOLNEG))
3535 ? &PL_sv_yes : &PL_sv_no);
3536 if (PL_op->op_private & OPpTARGET_MY)
3537 /* $lex = (index() == -1) */
3538 sv_setsv(TARG, TOPs);
3547 dSP; dMARK; dORIGMARK; dTARGET;
3548 SvTAINTED_off(TARG);
3549 do_sprintf(TARG, SP-MARK, MARK+1);
3550 TAINT_IF(SvTAINTED(TARG));
3562 const U8 *s = (U8*)SvPV_const(argsv, len);
3565 ? (len ? utf8n_to_uvchr(s, len, 0, UTF8_ALLOW_ANYUV) : 0)
3579 if (UNLIKELY(SvAMAGIC(top)))
3581 if (UNLIKELY(isinfnansv(top)))
3582 Perl_croak(aTHX_ "Cannot chr %" NVgf, SvNV(top));
3584 if (!IN_BYTES /* under bytes, chr(-1) eq chr(0xff), etc. */
3585 && ((SvIOKp(top) && !SvIsUV(top) && SvIV_nomg(top) < 0)
3587 ((SvNOKp(top) || (SvOK(top) && !SvIsUV(top)))
3588 && SvNV_nomg(top) < 0.0)))
3590 if (ckWARN(WARN_UTF8)) {
3591 if (SvGMAGICAL(top)) {
3592 SV *top2 = sv_newmortal();
3593 sv_setsv_nomg(top2, top);
3596 Perl_warner(aTHX_ packWARN(WARN_UTF8),
3597 "Invalid negative number (%" SVf ") in chr", SVfARG(top));
3599 value = UNICODE_REPLACEMENT;
3601 value = SvUV_nomg(top);
3605 SvUPGRADE(TARG,SVt_PV);
3607 if (value > 255 && !IN_BYTES) {
3608 SvGROW(TARG, (STRLEN)UVCHR_SKIP(value)+1);
3609 tmps = (char*)uvchr_to_utf8_flags((U8*)SvPVX(TARG), value, 0);
3610 SvCUR_set(TARG, tmps - SvPVX_const(TARG));
3612 (void)SvPOK_only(TARG);
3621 *tmps++ = (char)value;
3623 (void)SvPOK_only(TARG);
3635 const char *tmps = SvPV_const(left, len);
3637 if (DO_UTF8(left)) {
3638 /* If Unicode, try to downgrade.
3639 * If not possible, croak.
3640 * Yes, we made this up. */
3641 SV* const tsv = newSVpvn_flags(tmps, len, SVf_UTF8|SVs_TEMP);
3643 sv_utf8_downgrade(tsv, FALSE);
3644 tmps = SvPV_const(tsv, len);
3646 # ifdef USE_ITHREADS
3648 if (!PL_reentrant_buffer->_crypt_struct_buffer) {
3649 /* This should be threadsafe because in ithreads there is only
3650 * one thread per interpreter. If this would not be true,
3651 * we would need a mutex to protect this malloc. */
3652 PL_reentrant_buffer->_crypt_struct_buffer =
3653 (struct crypt_data *)safemalloc(sizeof(struct crypt_data));
3654 #if defined(__GLIBC__) || defined(__EMX__)
3655 if (PL_reentrant_buffer->_crypt_struct_buffer) {
3656 PL_reentrant_buffer->_crypt_struct_buffer->initialized = 0;
3657 #if (defined(__GLIBC__) && __GLIBC__ == 2) && \
3658 (defined(__GLIBC_MINOR__) && __GLIBC_MINOR__ >= 2 && __GLIBC_MINOR__ < 4)
3659 /* work around glibc-2.2.5 bug, has been fixed at some
3660 * time in glibc-2.3.X */
3661 PL_reentrant_buffer->_crypt_struct_buffer->current_saltbits = 0;
3666 # endif /* HAS_CRYPT_R */
3667 # endif /* USE_ITHREADS */
3669 sv_setpv(TARG, fcrypt(tmps, SvPV_nolen_const(right)));
3671 sv_setpv(TARG, PerlProc_crypt(tmps, SvPV_nolen_const(right)));
3678 "The crypt() function is unimplemented due to excessive paranoia.");
3682 /* Generally UTF-8 and UTF-EBCDIC are indistinguishable at this level. So
3683 * most comments below say UTF-8, when in fact they mean UTF-EBCDIC as well */
3686 /* also used for: pp_lcfirst() */
3690 /* Actually is both lcfirst() and ucfirst(). Only the first character
3691 * changes. This means that possibly we can change in-place, ie., just
3692 * take the source and change that one character and store it back, but not
3693 * if read-only etc, or if the length changes */
3697 STRLEN slen; /* slen is the byte length of the whole SV. */
3700 bool inplace; /* ? Convert first char only, in-place */
3701 bool doing_utf8 = FALSE; /* ? using utf8 */
3702 bool convert_source_to_utf8 = FALSE; /* ? need to convert */
3703 const int op_type = PL_op->op_type;
3706 U8 tmpbuf[UTF8_MAXBYTES_CASE+1];
3707 STRLEN ulen; /* ulen is the byte length of the original Unicode character
3708 * stored as UTF-8 at s. */
3709 STRLEN tculen; /* tculen is the byte length of the freshly titlecased (or
3710 * lowercased) character stored in tmpbuf. May be either
3711 * UTF-8 or not, but in either case is the number of bytes */
3712 bool remove_dot_above = FALSE;
3714 s = (const U8*)SvPV_const(source, slen);
3716 /* We may be able to get away with changing only the first character, in
3717 * place, but not if read-only, etc. Later we may discover more reasons to
3718 * not convert in-place. */
3719 inplace = !SvREADONLY(source) && SvPADTMP(source);
3721 #ifdef USE_LOCALE_CTYPE
3723 if (IN_LC_RUNTIME(LC_CTYPE)) {
3724 _CHECK_AND_WARN_PROBLEMATIC_LOCALE;
3729 /* First calculate what the changed first character should be. This affects
3730 * whether we can just swap it out, leaving the rest of the string unchanged,
3731 * or even if have to convert the dest to UTF-8 when the source isn't */
3733 if (! slen) { /* If empty */
3734 need = 1; /* still need a trailing NUL */
3738 else if (DO_UTF8(source)) { /* Is the source utf8? */
3741 if (op_type == OP_UCFIRST) {
3742 #ifdef USE_LOCALE_CTYPE
3743 _toTITLE_utf8_flags(s, s +slen, tmpbuf, &tculen, IN_LC_RUNTIME(LC_CTYPE));
3745 _toTITLE_utf8_flags(s, s +slen, tmpbuf, &tculen, 0);
3750 #ifdef USE_LOCALE_CTYPE
3752 _toLOWER_utf8_flags(s, s + slen, tmpbuf, &tculen, IN_LC_RUNTIME(LC_CTYPE));
3754 /* In turkic locales, lower casing an 'I' normally yields U+0131,
3755 * LATIN SMALL LETTER DOTLESS I, but not if the grapheme also
3756 * contains a COMBINING DOT ABOVE. Instead it is treated like
3757 * LATIN CAPITAL LETTER I WITH DOT ABOVE lowercased to 'i'. The
3758 * call to lowercase above has handled this. But SpecialCasing.txt
3759 * says we are supposed to remove the COMBINING DOT ABOVE. We can
3760 * tell if we have this situation if I ==> i in a turkic locale. */
3761 if ( UNLIKELY(PL_in_utf8_turkic_locale)
3762 && IN_LC_RUNTIME(LC_CTYPE)
3763 && (UNLIKELY(*s == 'I' && tmpbuf[0] == 'i')))
3765 /* Here, we know there was a COMBINING DOT ABOVE. We won't be
3766 * able to handle this in-place. */
3769 /* It seems likely that the DOT will immediately follow the
3770 * 'I'. If so, we can remove it simply by indicating to the
3771 * code below to start copying the source just beyond the DOT.
3772 * We know its length is 2 */
3773 if (LIKELY(memBEGINs(s + 1, s + slen, COMBINING_DOT_ABOVE_UTF8))) {
3776 else { /* But if it doesn't follow immediately, set a flag for
3778 remove_dot_above = TRUE;
3782 PERL_UNUSED_VAR(remove_dot_above);
3784 _toLOWER_utf8_flags(s, s + slen, tmpbuf, &tculen, 0);
3789 /* we can't do in-place if the length changes. */
3790 if (ulen != tculen) inplace = FALSE;
3791 need = slen + 1 - ulen + tculen;
3793 else { /* Non-zero length, non-UTF-8, Need to consider locale and if
3794 * latin1 is treated as caseless. Note that a locale takes
3796 ulen = 1; /* Original character is 1 byte */
3797 tculen = 1; /* Most characters will require one byte, but this will
3798 * need to be overridden for the tricky ones */
3802 #ifdef USE_LOCALE_CTYPE
3804 if (IN_LC_RUNTIME(LC_CTYPE)) {
3805 if ( UNLIKELY(PL_in_utf8_turkic_locale)
3806 && ( (op_type == OP_LCFIRST && UNLIKELY(*s == 'I'))
3807 || (op_type == OP_UCFIRST && UNLIKELY(*s == 'i'))))
3809 if (*s == 'I') { /* lcfirst('I') */
3810 tmpbuf[0] = UTF8_TWO_BYTE_HI(LATIN_SMALL_LETTER_DOTLESS_I);
3811 tmpbuf[1] = UTF8_TWO_BYTE_LO(LATIN_SMALL_LETTER_DOTLESS_I);
3813 else { /* ucfirst('i') */
3814 tmpbuf[0] = UTF8_TWO_BYTE_HI(LATIN_CAPITAL_LETTER_I_WITH_DOT_ABOVE);
3815 tmpbuf[1] = UTF8_TWO_BYTE_LO(LATIN_CAPITAL_LETTER_I_WITH_DOT_ABOVE);
3820 convert_source_to_utf8 = TRUE;
3821 need += variant_under_utf8_count(s, s + slen);
3823 else if (op_type == OP_LCFIRST) {
3825 /* For lc, there are no gotchas for UTF-8 locales (other than
3826 * the turkish ones already handled above) */
3827 *tmpbuf = toLOWER_LC(*s);
3829 else { /* ucfirst */
3831 /* But for uc, some characters require special handling */
3832 if (IN_UTF8_CTYPE_LOCALE) {
3836 /* This would be a bug if any locales have upper and title case
3838 *tmpbuf = (U8) toUPPER_LC(*s);
3843 /* Here, not in locale. If not using Unicode rules, is a simple
3844 * lower/upper, depending */
3845 if (! IN_UNI_8_BIT) {
3846 *tmpbuf = (op_type == OP_LCFIRST)
3850 else if (op_type == OP_LCFIRST) {
3851 /* lower case the first letter: no trickiness for any character */
3852 *tmpbuf = toLOWER_LATIN1(*s);
3855 /* Here, is ucfirst non-UTF-8, not in locale (unless that locale is
3856 * non-turkic UTF-8, which we treat as not in locale), and cased
3859 #ifdef USE_LOCALE_CTYPE
3863 title_ord = _to_upper_title_latin1(*s, tmpbuf, &tculen, 's');
3865 assert(tculen == 2);
3867 /* If the result is an upper Latin1-range character, it can
3868 * still be represented in one byte, which is its ordinal */
3869 if (UTF8_IS_DOWNGRADEABLE_START(*tmpbuf)) {
3870 *tmpbuf = (U8) title_ord;
3874 /* Otherwise it became more than one ASCII character (in
3875 * the case of LATIN_SMALL_LETTER_SHARP_S) or changed to
3876 * beyond Latin1, so the number of bytes changed, so can't
3877 * replace just the first character in place. */
3880 /* If the result won't fit in a byte, the entire result
3881 * will have to be in UTF-8. Allocate enough space for the
3882 * expanded first byte, and if UTF-8, the rest of the input
3883 * string, some or all of which may also expand to two
3884 * bytes, plus the terminating NUL. */
3885 if (title_ord > 255) {
3887 convert_source_to_utf8 = TRUE;
3889 + variant_under_utf8_count(s, s + slen)
3892 /* The (converted) UTF-8 and UTF-EBCDIC lengths of all
3893 * characters whose title case is above 255 is
3897 else { /* LATIN_SMALL_LETTER_SHARP_S expands by 1 byte */
3898 need = slen + 1 + 1;
3902 } /* End of use Unicode (Latin1) semantics */
3903 } /* End of changing the case of the first character */
3905 /* Here, have the first character's changed case stored in tmpbuf. Ready to
3906 * generate the result */
3909 /* We can convert in place. This means we change just the first
3910 * character without disturbing the rest; no need to grow */
3912 s = d = (U8*)SvPV_force_nomg(source, slen);
3918 /* Here, we can't convert in place; we earlier calculated how much
3919 * space we will need, so grow to accommodate that */
3920 SvUPGRADE(dest, SVt_PV);
3921 d = (U8*)SvGROW(dest, need);
3922 (void)SvPOK_only(dest);
3929 if (! convert_source_to_utf8) {
3931 /* Here both source and dest are in UTF-8, but have to create
3932 * the entire output. We initialize the result to be the
3933 * title/lower cased first character, and then append the rest
3935 sv_setpvn(dest, (char*)tmpbuf, tculen);
3938 /* But this boolean being set means we are in a turkic
3939 * locale, and there is a DOT character that needs to be
3940 * removed, and it isn't immediately after the current
3941 * character. Keep concatenating characters to the output
3942 * one at a time, until we find the DOT, which we simply
3944 if (UNLIKELY(remove_dot_above)) {
3946 Size_t this_len = UTF8SKIP(s + ulen);
3948 sv_catpvn(dest, (char*)(s + ulen), this_len);
3951 if (memBEGINs(s + ulen, s + slen, COMBINING_DOT_ABOVE_UTF8)) {
3955 } while (s + ulen < s + slen);
3958 /* The rest of the string can be concatenated unchanged,
3960 sv_catpvn(dest, (char*)(s + ulen), slen - ulen);
3964 const U8 *const send = s + slen;
3966 /* Here the dest needs to be in UTF-8, but the source isn't,
3967 * except we earlier UTF-8'd the first character of the source
3968 * into tmpbuf. First put that into dest, and then append the
3969 * rest of the source, converting it to UTF-8 as we go. */
3971 /* Assert tculen is 2 here because the only characters that
3972 * get to this part of the code have 2-byte UTF-8 equivalents */
3973 assert(tculen == 2);
3975 *d++ = *(tmpbuf + 1);
3976 s++; /* We have just processed the 1st char */
3979 append_utf8_from_native_byte(*s, &d);
3984 SvCUR_set(dest, d - (U8*)SvPVX_const(dest));
3988 else { /* in-place UTF-8. Just overwrite the first character */
3989 Copy(tmpbuf, d, tculen, U8);
3990 SvCUR_set(dest, need - 1);
3994 else { /* Neither source nor dest are, nor need to be UTF-8 */
3996 if (inplace) { /* in-place, only need to change the 1st char */
3999 else { /* Not in-place */
4001 /* Copy the case-changed character(s) from tmpbuf */
4002 Copy(tmpbuf, d, tculen, U8);
4003 d += tculen - 1; /* Code below expects d to point to final
4004 * character stored */
4007 else { /* empty source */
4008 /* See bug #39028: Don't taint if empty */
4012 /* In a "use bytes" we don't treat the source as UTF-8, but, still want
4013 * the destination to retain that flag */
4014 if (SvUTF8(source) && ! IN_BYTES)
4017 if (!inplace) { /* Finish the rest of the string, unchanged */
4018 /* This will copy the trailing NUL */
4019 Copy(s + 1, d + 1, slen, U8);
4020 SvCUR_set(dest, need - 1);
4023 #ifdef USE_LOCALE_CTYPE
4024 if (IN_LC_RUNTIME(LC_CTYPE)) {
4029 if (dest != source && SvTAINTED(source))
4047 if ( SvPADTMP(source)
4048 && !SvREADONLY(source) && SvPOK(source)
4051 #ifdef USE_LOCALE_CTYPE
4052 (IN_LC_RUNTIME(LC_CTYPE))
4053 ? ! IN_UTF8_CTYPE_LOCALE
4059 /* We can convert in place. The reason we can't if in UNI_8_BIT is to
4060 * make the loop tight, so we overwrite the source with the dest before
4061 * looking at it, and we need to look at the original source
4062 * afterwards. There would also need to be code added to handle
4063 * switching to not in-place in midstream if we run into characters
4064 * that change the length. Since being in locale overrides UNI_8_BIT,
4065 * that latter becomes irrelevant in the above test; instead for
4066 * locale, the size can't normally change, except if the locale is a
4069 s = d = (U8*)SvPV_force_nomg(source, len);
4076 s = (const U8*)SvPV_nomg_const(source, len);
4079 SvUPGRADE(dest, SVt_PV);
4080 d = (U8*)SvGROW(dest, min);
4081 (void)SvPOK_only(dest);
4086 #ifdef USE_LOCALE_CTYPE
4088 if (IN_LC_RUNTIME(LC_CTYPE)) {
4089 _CHECK_AND_WARN_PROBLEMATIC_LOCALE;
4094 /* Overloaded values may have toggled the UTF-8 flag on source, so we need
4095 to check DO_UTF8 again here. */
4097 if (DO_UTF8(source)) {
4098 const U8 *const send = s + len;
4099 U8 tmpbuf[UTF8_MAXBYTES_CASE+1];
4101 #define GREEK_CAPITAL_LETTER_IOTA 0x0399
4102 #define COMBINING_GREEK_YPOGEGRAMMENI 0x0345
4103 /* All occurrences of these are to be moved to follow any other marks.
4104 * This is context-dependent. We may not be passed enough context to
4105 * move the iota subscript beyond all of them, but we do the best we can
4106 * with what we're given. The result is always better than if we
4107 * hadn't done this. And, the problem would only arise if we are
4108 * passed a character without all its combining marks, which would be
4109 * the caller's mistake. The information this is based on comes from a
4110 * comment in Unicode SpecialCasing.txt, (and the Standard's text
4111 * itself) and so can't be checked properly to see if it ever gets
4112 * revised. But the likelihood of it changing is remote */
4113 bool in_iota_subscript = FALSE;
4119 if (UNLIKELY(in_iota_subscript)) {
4120 UV cp = utf8_to_uvchr_buf(s, send, NULL);
4122 if (! _invlist_contains_cp(PL_utf8_mark, cp)) {
4124 /* A non-mark. Time to output the iota subscript */
4125 *d++ = UTF8_TWO_BYTE_HI(GREEK_CAPITAL_LETTER_IOTA);
4126 *d++ = UTF8_TWO_BYTE_LO(GREEK_CAPITAL_LETTER_IOTA);
4127 in_iota_subscript = FALSE;
4131 /* Then handle the current character. Get the changed case value
4132 * and copy it to the output buffer */
4135 #ifdef USE_LOCALE_CTYPE
4136 uv = _toUPPER_utf8_flags(s, send, tmpbuf, &ulen, IN_LC_RUNTIME(LC_CTYPE));
4138 uv = _toUPPER_utf8_flags(s, send, tmpbuf, &ulen, 0);
4140 if (uv == GREEK_CAPITAL_LETTER_IOTA
4141 && utf8_to_uvchr_buf(s, send, 0) == COMBINING_GREEK_YPOGEGRAMMENI)
4143 in_iota_subscript = TRUE;
4146 if (ulen > u && (SvLEN(dest) < (min += ulen - u))) {
4147 /* If the eventually required minimum size outgrows the
4148 * available space, we need to grow. */
4149 const UV o = d - (U8*)SvPVX_const(dest);
4151 /* If someone uppercases one million U+03B0s we SvGROW()
4152 * one million times. Or we could try guessing how much to
4153 * allocate without allocating too much. But we can't
4154 * really guess without examining the rest of the string.
4155 * Such is life. See corresponding comment in lc code for
4157 d = o + (U8*) SvGROW(dest, min);
4159 Copy(tmpbuf, d, ulen, U8);
4164 if (in_iota_subscript) {
4165 *d++ = UTF8_TWO_BYTE_HI(GREEK_CAPITAL_LETTER_IOTA);
4166 *d++ = UTF8_TWO_BYTE_LO(GREEK_CAPITAL_LETTER_IOTA);
4171 SvCUR_set(dest, d - (U8*)SvPVX_const(dest));
4173 else { /* Not UTF-8 */
4175 const U8 *const send = s + len;
4177 /* Use locale casing if in locale; regular style if not treating
4178 * latin1 as having case; otherwise the latin1 casing. Do the
4179 * whole thing in a tight loop, for speed, */
4180 #ifdef USE_LOCALE_CTYPE
4181 if (IN_LC_RUNTIME(LC_CTYPE)) {
4182 if (IN_UTF8_CTYPE_LOCALE) {
4185 for (; s < send; d++, s++)
4186 *d = (U8) toUPPER_LC(*s);
4190 if (! IN_UNI_8_BIT) {
4191 for (; s < send; d++, s++) {
4196 #ifdef USE_LOCALE_CTYPE
4199 for (; s < send; d++, s++) {
4202 *d = toUPPER_LATIN1_MOD(*s);
4203 if ( LIKELY(*d != LATIN_SMALL_LETTER_Y_WITH_DIAERESIS)
4205 #ifdef USE_LOCALE_CTYPE
4207 && (LIKELY( ! PL_in_utf8_turkic_locale
4208 || ! IN_LC_RUNTIME(LC_CTYPE))
4216 /* The mainstream case is the tight loop above. To avoid
4217 * extra tests in that, all three characters that always
4218 * require special handling are mapped by the MOD to the
4219 * one tested just above. Use the source to distinguish
4220 * between those cases */
4222 #if UNICODE_MAJOR_VERSION > 2 \
4223 || (UNICODE_MAJOR_VERSION == 2 && UNICODE_DOT_VERSION >= 1 \
4224 && UNICODE_DOT_DOT_VERSION >= 8)
4225 if (*s == LATIN_SMALL_LETTER_SHARP_S) {
4227 /* uc() of this requires 2 characters, but they are
4228 * ASCII. If not enough room, grow the string */
4229 if (SvLEN(dest) < ++min) {
4230 const UV o = d - (U8*)SvPVX_const(dest);
4231 d = o + (U8*) SvGROW(dest, min);
4233 *d++ = 'S'; *d = 'S'; /* upper case is 'SS' */
4234 continue; /* Back to the tight loop; still in ASCII */
4238 /* The other special handling characters have their
4239 * upper cases outside the latin1 range, hence need to be
4240 * in UTF-8, so the whole result needs to be in UTF-8.
4242 * So, here we are somewhere in the middle of processing a
4243 * non-UTF-8 string, and realize that we will have to
4244 * convert the whole thing to UTF-8. What to do? There
4245 * are several possibilities. The simplest to code is to
4246 * convert what we have so far, set a flag, and continue on
4247 * in the loop. The flag would be tested each time through
4248 * the loop, and if set, the next character would be
4249 * converted to UTF-8 and stored. But, I (khw) didn't want
4250 * to slow down the mainstream case at all for this fairly
4251 * rare case, so I didn't want to add a test that didn't
4252 * absolutely have to be there in the loop, besides the
4253 * possibility that it would get too complicated for
4254 * optimizers to deal with. Another possibility is to just
4255 * give up, convert the source to UTF-8, and restart the
4256 * function that way. Another possibility is to convert
4257 * both what has already been processed and what is yet to
4258 * come separately to UTF-8, then jump into the loop that
4259 * handles UTF-8. But the most efficient time-wise of the
4260 * ones I could think of is what follows, and turned out to
4261 * not require much extra code.
4263 * First, calculate the extra space needed for the
4264 * remainder of the source needing to be in UTF-8. Except
4265 * for the 'i' in Turkic locales, in UTF-8 strings, the
4266 * uppercase of a character below 256 occupies the same
4267 * number of bytes as the original. Therefore, the space
4268 * needed is the that number plus the number of characters
4269 * that become two bytes when converted to UTF-8, plus, in
4270 * turkish locales, the number of 'i's. */
4272 extra = send - s + variant_under_utf8_count(s, send);
4274 #ifdef USE_LOCALE_CTYPE
4276 if (UNLIKELY(*s == 'i')) { /* We wouldn't get an 'i' here
4277 unless are in a Turkic
4279 const U8 * s_peek = s;
4284 s_peek = (U8 *) memchr(s_peek + 1, 'i',
4285 send - (s_peek + 1));
4286 } while (s_peek != NULL);
4290 /* Convert what we have so far into UTF-8, telling the
4291 * function that we know it should be converted, and to
4292 * allow extra space for what we haven't processed yet.
4294 * This may cause the string pointer to move, so need to
4295 * save and re-find it. */
4297 len = d - (U8*)SvPVX_const(dest);
4298 SvCUR_set(dest, len);
4299 len = sv_utf8_upgrade_flags_grow(dest,
4300 SV_GMAGIC|SV_FORCE_UTF8_UPGRADE,
4302 d = (U8*)SvPVX(dest) + len;
4304 /* Now process the remainder of the source, simultaneously
4305 * converting to upper and UTF-8.
4307 * To avoid extra tests in the loop body, and since the
4308 * loop is so simple, split out the rare Turkic case into
4311 #ifdef USE_LOCALE_CTYPE
4312 if ( UNLIKELY(PL_in_utf8_turkic_locale)
4313 && UNLIKELY(IN_LC_RUNTIME(LC_CTYPE)))
4315 for (; s < send; s++) {
4317 *d++ = UTF8_TWO_BYTE_HI(LATIN_CAPITAL_LETTER_I_WITH_DOT_ABOVE);
4318 *d++ = UTF8_TWO_BYTE_LO(LATIN_CAPITAL_LETTER_I_WITH_DOT_ABOVE);
4321 (void) _to_upper_title_latin1(*s, d, &len, 'S');
4328 for (; s < send; s++) {
4329 (void) _to_upper_title_latin1(*s, d, &len, 'S');
4333 /* Here have processed the whole source; no need to
4334 * continue with the outer loop. Each character has been
4335 * converted to upper case and converted to UTF-8. */
4337 } /* End of processing all latin1-style chars */
4338 } /* End of processing all chars */
4339 } /* End of source is not empty */
4341 if (source != dest) {
4342 *d = '\0'; /* Here d points to 1 after last char, add NUL */
4343 SvCUR_set(dest, d - (U8*)SvPVX_const(dest));
4345 } /* End of isn't utf8 */
4346 #ifdef USE_LOCALE_CTYPE
4347 if (IN_LC_RUNTIME(LC_CTYPE)) {
4352 if (dest != source && SvTAINTED(source))
4367 bool has_turkic_I = FALSE;
4371 if ( SvPADTMP(source)
4372 && !SvREADONLY(source) && SvPOK(source)
4375 #ifdef USE_LOCALE_CTYPE
4377 && ( LIKELY(! IN_LC_RUNTIME(LC_CTYPE))
4378 || LIKELY(! PL_in_utf8_turkic_locale))
4384 /* We can convert in place, as, outside of Turkic UTF-8 locales,
4385 * lowercasing anything in the latin1 range (or else DO_UTF8 would have
4386 * been on) doesn't lengthen it. */
4388 s = d = (U8*)SvPV_force_nomg(source, len);
4395 s = (const U8*)SvPV_nomg_const(source, len);
4398 SvUPGRADE(dest, SVt_PV);
4399 d = (U8*)SvGROW(dest, min);
4400 (void)SvPOK_only(dest);
4405 #ifdef USE_LOCALE_CTYPE
4407 if (IN_LC_RUNTIME(LC_CTYPE)) {
4410 _CHECK_AND_WARN_PROBLEMATIC_LOCALE;
4412 /* Lowercasing in a Turkic locale can cause non-UTF-8 to need to become
4413 * UTF-8 for the single case of the character 'I' */
4414 if ( UNLIKELY(PL_in_utf8_turkic_locale)
4415 && ! DO_UTF8(source)
4416 && (next_I = (U8 *) memchr(s, 'I', len)))
4419 const U8 *const send = s + len;
4424 next_I = (U8 *) memchr(next_I + 1, 'I',
4425 send - (next_I + 1));
4426 } while (next_I != NULL);
4428 /* Except for the 'I', in UTF-8 strings, the lower case of a
4429 * character below 256 occupies the same number of bytes as the
4430 * original. Therefore, the space needed is the original length
4431 * plus I_count plus the number of characters that become two bytes
4432 * when converted to UTF-8 */
4433 sv_utf8_upgrade_flags_grow(dest, 0, len
4435 + variant_under_utf8_count(s, send));
4436 d = (U8*)SvPVX(dest);
4437 has_turkic_I = TRUE;
4443 /* Overloaded values may have toggled the UTF-8 flag on source, so we need
4444 to check DO_UTF8 again here. */
4446 if (DO_UTF8(source)) {
4447 const U8 *const send = s + len;
4448 U8 tmpbuf[UTF8_MAXBYTES_CASE+1];
4449 bool remove_dot_above = FALSE;
4452 const STRLEN u = UTF8SKIP(s);
4455 #ifdef USE_LOCALE_CTYPE
4457 _toLOWER_utf8_flags(s, send, tmpbuf, &ulen, IN_LC_RUNTIME(LC_CTYPE));
4459 /* If we are in a Turkic locale, we have to do more work. As noted
4460 * in the comments for lcfirst, there is a special case if a 'I'
4461 * is in a grapheme with COMBINING DOT ABOVE UTF8. It turns into a
4462 * 'i', and the DOT must be removed. We check for that situation,
4463 * and set a flag if the DOT is there. Then each time through the
4464 * loop, we have to see if we need to remove the next DOT above,
4465 * and if so, do it. We know that there is a DOT because
4466 * _toLOWER_utf8_flags() wouldn't have returned 'i' unless there
4467 * was one in a proper position. */
4468 if ( UNLIKELY(PL_in_utf8_turkic_locale)
4469 && IN_LC_RUNTIME(LC_CTYPE))
4471 if ( UNLIKELY(remove_dot_above)
4472 && memBEGINs(tmpbuf, sizeof(tmpbuf), COMBINING_DOT_ABOVE_UTF8))
4475 remove_dot_above = FALSE;
4478 else if (UNLIKELY(*s == 'I' && tmpbuf[0] == 'i')) {
4479 remove_dot_above = TRUE;
4483 PERL_UNUSED_VAR(remove_dot_above);
4485 _toLOWER_utf8_flags(s, send, tmpbuf, &ulen, 0);
4488 /* Here is where we would do context-sensitive actions for the
4489 * Greek final sigma. See the commit message for 86510fb15 for why
4490 * there isn't any */
4492 if (ulen > u && (SvLEN(dest) < (min += ulen - u))) {
4494 /* If the eventually required minimum size outgrows the
4495 * available space, we need to grow. */
4496 const UV o = d - (U8*)SvPVX_const(dest);
4498 /* If someone lowercases one million U+0130s we SvGROW() one
4499 * million times. Or we could try guessing how much to
4500 * allocate without allocating too much. Such is life.
4501 * Another option would be to grow an extra byte or two more
4502 * each time we need to grow, which would cut down the million
4503 * to 500K, with little waste */
4504 d = o + (U8*) SvGROW(dest, min);
4507 /* Copy the newly lowercased letter to the output buffer we're
4509 Copy(tmpbuf, d, ulen, U8);
4512 } /* End of looping through the source string */
4515 SvCUR_set(dest, d - (U8*)SvPVX_const(dest));
4516 } else { /* 'source' not utf8 */
4518 const U8 *const send = s + len;
4520 /* Use locale casing if in locale; regular style if not treating
4521 * latin1 as having case; otherwise the latin1 casing. Do the
4522 * whole thing in a tight loop, for speed, */
4523 #ifdef USE_LOCALE_CTYPE
4524 if (IN_LC_RUNTIME(LC_CTYPE)) {
4525 if (LIKELY( ! has_turkic_I)) {
4526 for (; s < send; d++, s++)
4527 *d = toLOWER_LC(*s);
4529 else { /* This is the only case where lc() converts 'dest'
4530 into UTF-8 from a non-UTF-8 'source' */
4531 for (; s < send; s++) {
4533 *d++ = UTF8_TWO_BYTE_HI(LATIN_SMALL_LETTER_DOTLESS_I);
4534 *d++ = UTF8_TWO_BYTE_LO(LATIN_SMALL_LETTER_DOTLESS_I);
4537 append_utf8_from_native_byte(toLOWER_LATIN1(*s), &d);
4544 if (! IN_UNI_8_BIT) {
4545 for (; s < send; d++, s++) {
4550 for (; s < send; d++, s++) {
4551 *d = toLOWER_LATIN1(*s);
4555 if (source != dest) {
4557 SvCUR_set(dest, d - (U8*)SvPVX_const(dest));
4560 #ifdef USE_LOCALE_CTYPE
4561 if (IN_LC_RUNTIME(LC_CTYPE)) {
4566 if (dest != source && SvTAINTED(source))
4575 SV * const sv = TOPs;
4577 const char *s = SvPV_const(sv,len);
4579 SvUTF8_off(TARG); /* decontaminate */
4582 SvUPGRADE(TARG, SVt_PV);
4583 SvGROW(TARG, (len * 2) + 1);
4587 STRLEN ulen = UTF8SKIP(s);
4588 bool to_quote = FALSE;
4590 if (UTF8_IS_INVARIANT(*s)) {
4591 if (_isQUOTEMETA(*s)) {
4595 else if (UTF8_IS_NEXT_CHAR_DOWNGRADEABLE(s, s + len)) {
4597 #ifdef USE_LOCALE_CTYPE
4598 /* In locale, we quote all non-ASCII Latin1 chars.
4599 * Otherwise use the quoting rules */
4601 IN_LC_RUNTIME(LC_CTYPE)
4604 _isQUOTEMETA(EIGHT_BIT_UTF8_TO_NATIVE(*s, *(s + 1))))
4609 else if (is_QUOTEMETA_high(s)) {
4624 else if (IN_UNI_8_BIT) {
4626 if (_isQUOTEMETA(*s))
4632 /* For non UNI_8_BIT (and hence in locale) just quote all \W
4633 * including everything above ASCII */
4635 if (!isWORDCHAR_A(*s))
4641 SvCUR_set(TARG, d - SvPVX_const(TARG));
4642 (void)SvPOK_only_UTF8(TARG);
4645 sv_setpvn(TARG, s, len);
4661 U8 tmpbuf[UTF8_MAXBYTES_CASE + 1];
4662 #if UNICODE_MAJOR_VERSION > 3 /* no multifolds in early Unicode */ \
4663 || (UNICODE_MAJOR_VERSION == 3 && ( UNICODE_DOT_VERSION > 0) \
4664 || UNICODE_DOT_DOT_VERSION > 0)
4665 const bool full_folding = TRUE; /* This variable is here so we can easily
4666 move to more generality later */
4668 const bool full_folding = FALSE;
4670 const U8 flags = ( full_folding ? FOLD_FLAGS_FULL : 0 )
4671 #ifdef USE_LOCALE_CTYPE
4672 | ( IN_LC_RUNTIME(LC_CTYPE) ? FOLD_FLAGS_LOCALE : 0 )
4676 /* This is a facsimile of pp_lc, but with a thousand bugs thanks to me.
4677 * You are welcome(?) -Hugmeir
4685 s = (const U8*)SvPV_nomg_const(source, len);
4687 if (ckWARN(WARN_UNINITIALIZED))
4688 report_uninit(source);
4695 SvUPGRADE(dest, SVt_PV);
4696 d = (U8*)SvGROW(dest, min);
4697 (void)SvPOK_only(dest);
4703 #ifdef USE_LOCALE_CTYPE
4705 if ( IN_LC_RUNTIME(LC_CTYPE) ) { /* Under locale */
4706 _CHECK_AND_WARN_PROBLEMATIC_LOCALE;
4711 if (DO_UTF8(source)) { /* UTF-8 flagged string. */
4713 const STRLEN u = UTF8SKIP(s);
4716 _toFOLD_utf8_flags(s, send, tmpbuf, &ulen, flags);
4718 if (ulen > u && (SvLEN(dest) < (min += ulen - u))) {
4719 const UV o = d - (U8*)SvPVX_const(dest);
4720 d = o + (U8*) SvGROW(dest, min);
4723 Copy(tmpbuf, d, ulen, U8);
4728 } /* Unflagged string */
4730 #ifdef USE_LOCALE_CTYPE
4731 if ( IN_LC_RUNTIME(LC_CTYPE) ) { /* Under locale */
4732 if (IN_UTF8_CTYPE_LOCALE) {
4733 goto do_uni_folding;
4735 for (; s < send; d++, s++)
4736 *d = (U8) toFOLD_LC(*s);
4740 if ( !IN_UNI_8_BIT ) { /* Under nothing, or bytes */
4741 for (; s < send; d++, s++)
4745 #ifdef USE_LOCALE_CTYPE
4748 /* For ASCII and the Latin-1 range, there's potentially three
4749 * troublesome folds:
4750 * \x{DF} (\N{LATIN SMALL LETTER SHARP S}), which under full
4751 * casefolding becomes 'ss';
4752 * \x{B5} (\N{MICRO SIGN}), which under any fold becomes
4753 * \x{3BC} (\N{GREEK SMALL LETTER MU})
4754 * I only in Turkic locales, this folds to \x{131}
4755 * \N{LATIN SMALL LETTER DOTLESS I}
4756 * For the rest, the casefold is their lowercase. */
4757 for (; s < send; d++, s++) {
4758 if ( UNLIKELY(*s == MICRO_SIGN)
4759 #ifdef USE_LOCALE_CTYPE
4760 || ( UNLIKELY(PL_in_utf8_turkic_locale)
4761 && UNLIKELY(IN_LC_RUNTIME(LC_CTYPE))
4762 && UNLIKELY(*s == 'I'))
4765 Size_t extra = send - s
4766 + variant_under_utf8_count(s, send);
4768 /* \N{MICRO SIGN}'s casefold is \N{GREEK SMALL LETTER MU},
4769 * and 'I' in Turkic locales is \N{LATIN SMALL LETTER
4770 * DOTLESS I} both of which are outside of the latin-1
4771 * range. There's a couple of ways to deal with this -- khw
4772 * discusses them in pp_lc/uc, so go there :) What we do
4773 * here is upgrade what we had already casefolded, then
4774 * enter an inner loop that appends the rest of the
4775 * characters as UTF-8.
4777 * First we calculate the needed size of the upgraded dest
4778 * beyond what's been processed already (the upgrade
4779 * function figures that out). Except for the 'I' in
4780 * Turkic locales, in UTF-8 strings, the fold case of a
4781 * character below 256 occupies the same number of bytes as
4782 * the original (even the Sharp S). Therefore, the space
4783 * needed is the number of bytes remaining plus the number
4784 * of characters that become two bytes when converted to
4785 * UTF-8 plus, in turkish locales, the number of 'I's */
4787 if (UNLIKELY(*s == 'I')) {
4788 const U8 * s_peek = s;
4793 s_peek = (U8 *) memchr(s_peek + 1, 'i',
4794 send - (s_peek + 1));
4795 } while (s_peek != NULL);
4798 /* Growing may move things, so have to save and recalculate
4800 len = d - (U8*)SvPVX_const(dest);
4801 SvCUR_set(dest, len);
4802 len = sv_utf8_upgrade_flags_grow(dest,
4803 SV_GMAGIC|SV_FORCE_UTF8_UPGRADE,
4805 d = (U8*)SvPVX(dest) + len;
4807 *d++ = UTF8_TWO_BYTE_HI(GREEK_SMALL_LETTER_MU);
4808 *d++ = UTF8_TWO_BYTE_LO(GREEK_SMALL_LETTER_MU);
4811 for (; s < send; s++) {
4813 _to_uni_fold_flags(*s, d, &ulen, flags);
4818 else if ( UNLIKELY(*s == LATIN_SMALL_LETTER_SHARP_S)
4821 /* Under full casefolding, LATIN SMALL LETTER SHARP S
4822 * becomes "ss", which may require growing the SV. */
4823 if (SvLEN(dest) < ++min) {
4824 const UV o = d - (U8*)SvPVX_const(dest);
4825 d = o + (U8*) SvGROW(dest, min);
4830 else { /* Else, the fold is the lower case */
4831 *d = toLOWER_LATIN1(*s);
4837 SvCUR_set(dest, d - (U8*)SvPVX_const(dest));
4839 #ifdef USE_LOCALE_CTYPE
4840 if (IN_LC_RUNTIME(LC_CTYPE)) {
4845 if (SvTAINTED(source))
4855 dSP; dMARK; dORIGMARK;
4856 AV *const av = MUTABLE_AV(POPs);
4857 const I32 lval = (PL_op->op_flags & OPf_MOD || LVRET);
4859 if (SvTYPE(av) == SVt_PVAV) {
4860 const bool localizing = PL_op->op_private & OPpLVAL_INTRO;
4861 bool can_preserve = FALSE;
4867 can_preserve = SvCANEXISTDELETE(av);
4870 if (lval && localizing) {
4873 for (svp = MARK + 1; svp <= SP; svp++) {
4874 const SSize_t elem = SvIV(*svp);
4878 if (max > AvMAX(av))
4882 while (++MARK <= SP) {
4884 SSize_t elem = SvIV(*MARK);
4885 bool preeminent = TRUE;
4887 if (localizing && can_preserve) {
4888 /* If we can determine whether the element exist,
4889 * Try to preserve the existenceness of a tied array
4890 * element by using EXISTS and DELETE if possible.
4891 * Fallback to FETCH and STORE otherwise. */
4892 preeminent = av_exists(av, elem);
4895 svp = av_fetch(av, elem, lval);
4898 DIE(aTHX_ PL_no_aelem, elem);
4901 save_aelem(av, elem, svp);
4903 SAVEADELETE(av, elem);
4906 *MARK = svp ? *svp : &PL_sv_undef;
4909 if (GIMME_V != G_ARRAY) {
4911 *++MARK = SP > ORIGMARK ? *SP : &PL_sv_undef;
4920 AV *const av = MUTABLE_AV(POPs);
4921 I32 lval = (PL_op->op_flags & OPf_MOD);
4922 SSize_t items = SP - MARK;
4924 if (PL_op->op_private & OPpMAYBE_LVSUB) {
4925 const I32 flags = is_lvalue_sub();
4927 if (!(flags & OPpENTERSUB_INARGS))
4928 /* diag_listed_as: Can't modify %s in %s */
4929 Perl_croak(aTHX_ "Can't modify index/value array slice in list assignment");
4936 *(MARK+items*2-1) = *(MARK+items);
4942 while (++MARK <= SP) {
4945 svp = av_fetch(av, SvIV(*MARK), lval);
4947 if (!svp || !*svp || *svp == &PL_sv_undef) {
4948 DIE(aTHX_ PL_no_aelem, SvIV(*MARK));
4950 *MARK = sv_mortalcopy(*MARK);
4952 *++MARK = svp ? *svp : &PL_sv_undef;
4954 if (GIMME_V != G_ARRAY) {
4955 MARK = SP - items*2;
4956 *++MARK = items > 0 ? *SP : &PL_sv_undef;
4966 AV *array = MUTABLE_AV(POPs);
4967 const U8 gimme = GIMME_V;
4968 IV *iterp = Perl_av_iter_p(aTHX_ array);
4969 const IV current = (*iterp)++;
4971 if (current > av_tindex(array)) {
4973 if (gimme == G_SCALAR)
4981 if (gimme == G_ARRAY) {
4982 SV **const element = av_fetch(array, current, 0);
4983 PUSHs(element ? *element : &PL_sv_undef);
4988 /* also used for: pp_avalues()*/
4992 AV *array = MUTABLE_AV(POPs);
4993 const U8 gimme = GIMME_V;
4995 *Perl_av_iter_p(aTHX_ array) = 0;
4997 if (gimme == G_SCALAR) {
4999 PUSHi(av_tindex(array) + 1);
5001 else if (gimme == G_ARRAY) {
5002 if (UNLIKELY(PL_op->op_private & OPpMAYBE_LVSUB)) {
5003 const I32 flags = is_lvalue_sub();
5004 if (flags && !(flags & OPpENTERSUB_INARGS))
5005 /* diag_listed_as: Can't modify %s in %s */
5007 "Can't modify keys on array in list assignment");
5010 IV n = Perl_av_len(aTHX_ array);
5015 if ( PL_op->op_type == OP_AKEYS
5016 || ( PL_op->op_type == OP_AVHVSWITCH
5017 && (PL_op->op_private & 3) + OP_AEACH == OP_AKEYS ))
5019 for (i = 0; i <= n; i++) {
5024 for (i = 0; i <= n; i++) {
5025 SV *const *const elem = Perl_av_fetch(aTHX_ array, i, 0);
5026 PUSHs(elem ? *elem : &PL_sv_undef);
5034 /* Associative arrays. */
5039 HV * hash = MUTABLE_HV(POPs);
5041 const U8 gimme = GIMME_V;
5043 entry = hv_iternext(hash);
5047 SV* const sv = hv_iterkeysv(entry);
5049 if (gimme == G_ARRAY) {
5051 val = hv_iterval(hash, entry);
5055 else if (gimme == G_SCALAR)
5062 S_do_delete_local(pTHX)
5065 const U8 gimme = GIMME_V;
5068 const bool sliced = !!(PL_op->op_private & OPpSLICE);
5069 SV **unsliced_keysv = sliced ? NULL : sp--;
5070 SV * const osv = POPs;
5071 SV **mark = sliced ? PL_stack_base + POPMARK : unsliced_keysv-1;
5073 const bool tied = SvRMAGICAL(osv)
5074 && mg_find((const SV *)osv, PERL_MAGIC_tied);
5075 const bool can_preserve = SvCANEXISTDELETE(osv);
5076 const U32 type = SvTYPE(osv);
5077 SV ** const end = sliced ? SP : unsliced_keysv;
5079 if (type == SVt_PVHV) { /* hash element */
5080 HV * const hv = MUTABLE_HV(osv);
5081 while (++MARK <= end) {
5082 SV * const keysv = *MARK;
5084 bool preeminent = TRUE;
5086 preeminent = hv_exists_ent(hv, keysv, 0);
5088 HE *he = hv_fetch_ent(hv, keysv, 1, 0);
5095 sv = hv_delete_ent(hv, keysv, 0, 0);
5097 SvREFCNT_inc_simple_void(sv); /* De-mortalize */
5100 if (!sv) DIE(aTHX_ PL_no_helem_sv, SVfARG(keysv));
5101 save_helem_flags(hv, keysv, &sv, SAVEf_KEEPOLDELEM);
5103 *MARK = sv_mortalcopy(sv);
5109 SAVEHDELETE(hv, keysv);
5110 *MARK = &PL_sv_undef;
5114 else if (type == SVt_PVAV) { /* array element */
5115 if (PL_op->op_flags & OPf_SPECIAL) {
5116 AV * const av = MUTABLE_AV(osv);
5117 while (++MARK <= end) {
5118 SSize_t idx = SvIV(*MARK);
5120 bool preeminent = TRUE;
5122 preeminent = av_exists(av, idx);
5124 SV **svp = av_fetch(av, idx, 1);
5131 sv = av_delete(av, idx, 0);
5133 SvREFCNT_inc_simple_void(sv); /* De-mortalize */
5136 save_aelem_flags(av, idx, &sv, SAVEf_KEEPOLDELEM);
5138 *MARK = sv_mortalcopy(sv);
5144 SAVEADELETE(av, idx);
5145 *MARK = &PL_sv_undef;
5150 DIE(aTHX_ "panic: avhv_delete no longer supported");
5153 DIE(aTHX_ "Not a HASH reference");
5155 if (gimme == G_VOID)
5157 else if (gimme == G_SCALAR) {
5162 *++MARK = &PL_sv_undef;
5166 else if (gimme != G_VOID)
5167 PUSHs(*unsliced_keysv);
5178 if (PL_op->op_private & OPpLVAL_INTRO)
5179 return do_delete_local();
5182 discard = (gimme == G_VOID) ? G_DISCARD : 0;
5184 if (PL_op->op_private & (OPpSLICE|OPpKVSLICE)) {
5186 HV * const hv = MUTABLE_HV(POPs);
5187 const U32 hvtype = SvTYPE(hv);
5189 if (PL_op->op_private & OPpKVSLICE) {
5190 SSize_t items = SP - MARK;
5194 *(MARK+items*2-1) = *(MARK+items);
5201 if (hvtype == SVt_PVHV) { /* hash element */
5202 while ((MARK += (1+skip)) <= SP) {
5203 SV * const sv = hv_delete_ent(hv, *(MARK-skip), discard, 0);
5204 *MARK = sv ? sv : &PL_sv_undef;
5207 else if (hvtype == SVt_PVAV) { /* array element */
5208 if (PL_op->op_flags & OPf_SPECIAL) {
5209 while ((MARK += (1+skip)) <= SP) {
5210 SV * const sv = av_delete(MUTABLE_AV(hv), SvIV(*(MARK-skip)), discard);
5211 *MARK = sv ? sv : &PL_sv_undef;
5216 DIE(aTHX_ "Not a HASH reference");
5219 else if (gimme == G_SCALAR) {
5224 *++MARK = &PL_sv_undef;
5230 HV * const hv = MUTABLE_HV(POPs);
5232 if (SvTYPE(hv) == SVt_PVHV)
5233 sv = hv_delete_ent(hv, keysv, discard, 0);
5234 else if (SvTYPE(hv) == SVt_PVAV) {
5235 if (PL_op->op_flags & OPf_SPECIAL)
5236 sv = av_delete(MUTABLE_AV(hv), SvIV(keysv), discard);
5238 DIE(aTHX_ "panic: avhv_delete no longer supported");
5241 DIE(aTHX_ "Not a HASH reference");
5256 if (UNLIKELY( PL_op->op_private & OPpEXISTS_SUB )) {
5258 SV * const sv = POPs;
5259 CV * const cv = sv_2cv(sv, &hv, &gv, 0);
5262 if (gv && isGV(gv) && GvCV(gv) && !GvCVGEN(gv))
5267 hv = MUTABLE_HV(POPs);
5268 if (LIKELY( SvTYPE(hv) == SVt_PVHV )) {
5269 if (hv_exists_ent(hv, tmpsv, 0))
5272 else if (SvTYPE(hv) == SVt_PVAV) {
5273 if (PL_op->op_flags & OPf_SPECIAL) { /* array element */
5274 if (av_exists(MUTABLE_AV(hv), SvIV(tmpsv)))
5279 DIE(aTHX_ "Not a HASH reference");
5286 dSP; dMARK; dORIGMARK;
5287 HV * const hv = MUTABLE_HV(POPs);
5288 const I32 lval = (PL_op->op_flags & OPf_MOD || LVRET);
5289 const bool localizing = PL_op->op_private & OPpLVAL_INTRO;
5290 bool can_preserve = FALSE;
5296 if (SvCANEXISTDELETE(hv))
5297 can_preserve = TRUE;
5300 while (++MARK <= SP) {
5301 SV * const keysv = *MARK;
5304 bool preeminent = TRUE;
5306 if (localizing && can_preserve) {
5307 /* If we can determine whether the element exist,
5308 * try to preserve the existenceness of a tied hash
5309 * element by using EXISTS and DELETE if possible.
5310 * Fallback to FETCH and STORE otherwise. */
5311 preeminent = hv_exists_ent(hv, keysv, 0);
5314 he = hv_fetch_ent(hv, keysv, lval, 0);
5315 svp = he ? &HeVAL(he) : NULL;
5318 if (!svp || !*svp || *svp == &PL_sv_undef) {
5319 DIE(aTHX_ PL_no_helem_sv, SVfARG(keysv));
5322 if (HvNAME_get(hv) && isGV_or_RVCV(*svp))
5323 save_gp(MUTABLE_GV(*svp), !(PL_op->op_flags & OPf_SPECIAL));
5324 else if (preeminent)
5325 save_helem_flags(hv, keysv, svp,
5326 (PL_op->op_flags & OPf_SPECIAL) ? 0 : SAVEf_SETMAGIC);
5328 SAVEHDELETE(hv, keysv);
5331 *MARK = svp && *svp ? *svp : &PL_sv_undef;
5333 if (GIMME_V != G_ARRAY) {
5335 *++MARK = SP > ORIGMARK ? *SP : &PL_sv_undef;
5344 HV * const hv = MUTABLE_HV(POPs);
5345 I32 lval = (PL_op->op_flags & OPf_MOD);
5346 SSize_t items = SP - MARK;
5348 if (PL_op->op_private & OPpMAYBE_LVSUB) {
5349 const I32 flags = is_lvalue_sub();
5351 if (!(flags & OPpENTERSUB_INARGS))
5352 /* diag_listed_as: Can't modify %s in %s */
5353 Perl_croak(aTHX_ "Can't modify key/value hash slice in %s assignment",
5354 GIMME_V == G_ARRAY ? "list" : "scalar");
5361 *(MARK+items*2-1) = *(MARK+items);
5367 while (++MARK <= SP) {
5368 SV * const keysv = *MARK;
5372 he = hv_fetch_ent(hv, keysv, lval, 0);
5373 svp = he ? &HeVAL(he) : NULL;
5376 if (!svp || !*svp || *svp == &PL_sv_undef) {
5377 DIE(aTHX_ PL_no_helem_sv, SVfARG(keysv));
5379 *MARK = sv_mortalcopy(*MARK);
5381 *++MARK = svp && *svp ? *svp : &PL_sv_undef;
5383 if (GIMME_V != G_ARRAY) {
5384 MARK = SP - items*2;
5385 *++MARK = items > 0 ? *SP : &PL_sv_undef;
5391 /* List operators. */
5395 I32 markidx = POPMARK;
5396 if (GIMME_V != G_ARRAY) {
5397 /* don't initialize mark here, EXTEND() may move the stack */
5400 EXTEND(SP, 1); /* in case no arguments, as in @empty */
5401 mark = PL_stack_base + markidx;
5403 *MARK = *SP; /* unwanted list, return last item */
5405 *MARK = &PL_sv_undef;
5415 SV ** const lastrelem = PL_stack_sp;
5416 SV ** const lastlelem = PL_stack_base + POPMARK;
5417 SV ** const firstlelem = PL_stack_base + POPMARK + 1;
5418 SV ** const firstrelem = lastlelem + 1;
5419 const U8 mod = PL_op->op_flags & OPf_MOD;
5421 const I32 max = lastrelem - lastlelem;
5424 if (GIMME_V != G_ARRAY) {
5425 if (lastlelem < firstlelem) {
5427 *firstlelem = &PL_sv_undef;
5430 I32 ix = SvIV(*lastlelem);
5433 if (ix < 0 || ix >= max)
5434 *firstlelem = &PL_sv_undef;
5436 *firstlelem = firstrelem[ix];
5443 SP = firstlelem - 1;
5447 for (lelem = firstlelem; lelem <= lastlelem; lelem++) {
5448 I32 ix = SvIV(*lelem);
5451 if (ix < 0 || ix >= max)
5452 *lelem = &PL_sv_undef;
5454 if (!(*lelem = firstrelem[ix]))
5455 *lelem = &PL_sv_undef;
5456 else if (mod && SvPADTMP(*lelem)) {
5457 *lelem = firstrelem[ix] = sv_mortalcopy(*lelem);
5468 const I32 items = SP - MARK;
5469 SV * const av = MUTABLE_SV(av_make(items, MARK+1));
5471 mXPUSHs((PL_op->op_flags & OPf_SPECIAL)
5472 ? newRV_noinc(av) : av);
5478 dSP; dMARK; dORIGMARK;
5479 HV* const hv = newHV();
5480 SV* const retval = sv_2mortal( PL_op->op_flags & OPf_SPECIAL
5481 ? newRV_noinc(MUTABLE_SV(hv))
5486 (MARK++, SvGMAGICAL(*MARK) ? sv_mortalcopy(*MARK) : *MARK);
5493 sv_setsv_nomg(val, *MARK);
5497 Perl_ck_warner(aTHX_ packWARN(WARN_MISC), "Odd number of elements in anonymous hash");
5500 (void)hv_store_ent(hv,key,val,0);
5509 dSP; dMARK; dORIGMARK;
5510 int num_args = (SP - MARK);
5511 AV *ary = MUTABLE_AV(*++MARK);
5520 const MAGIC * const mg = SvTIED_mg((const SV *)ary, PERL_MAGIC_tied);
5523 return Perl_tied_method(aTHX_ SV_CONST(SPLICE), mark - 1, MUTABLE_SV(ary), mg,
5524 GIMME_V | TIED_METHOD_ARGUMENTS_ON_STACK,
5528 if (SvREADONLY(ary))
5529 Perl_croak_no_modify();
5534 offset = i = SvIV(*MARK);
5536 offset += AvFILLp(ary) + 1;
5538 DIE(aTHX_ PL_no_aelem, i);
5540 length = SvIVx(*MARK++);
5542 length += AvFILLp(ary) - offset + 1;
5548 length = AvMAX(ary) + 1; /* close enough to infinity */
5552 length = AvMAX(ary) + 1;
5554 if (offset > AvFILLp(ary) + 1) {
5556 Perl_ck_warner(aTHX_ packWARN(WARN_MISC), "splice() offset past end of array" );
5557 offset = AvFILLp(ary) + 1;
5559 after = AvFILLp(ary) + 1 - (offset + length);
5560 if (after < 0) { /* not that much array */
5561 length += after; /* offset+length now in array */
5567 /* At this point, MARK .. SP-1 is our new LIST */
5570 diff = newlen - length;
5571 if (newlen && !AvREAL(ary) && AvREIFY(ary))
5574 /* make new elements SVs now: avoid problems if they're from the array */
5575 for (dst = MARK, i = newlen; i; i--) {
5576 SV * const h = *dst;
5577 *dst++ = newSVsv(h);
5580 if (diff < 0) { /* shrinking the area */
5581 SV **tmparyval = NULL;
5583 Newx(tmparyval, newlen, SV*); /* so remember insertion */
5584 Copy(MARK, tmparyval, newlen, SV*);
5587 MARK = ORIGMARK + 1;
5588 if (GIMME_V == G_ARRAY) { /* copy return vals to stack */
5589 const bool real = cBOOL(AvREAL(ary));
5590 MEXTEND(MARK, length);
5592 EXTEND_MORTAL(length);
5593 for (i = 0, dst = MARK; i < length; i++) {
5594 if ((*dst = AvARRAY(ary)[i+offset])) {
5596 sv_2mortal(*dst); /* free them eventually */
5599 *dst = &PL_sv_undef;
5605 *MARK = AvARRAY(ary)[offset+length-1];
5608 for (i = length - 1, dst = &AvARRAY(ary)[offset]; i > 0; i--)
5609 SvREFCNT_dec(*dst++); /* free them now */
5612 *MARK = &PL_sv_undef;
5614 AvFILLp(ary) += diff;
5616 /* pull up or down? */
5618 if (offset < after) { /* easier to pull up */
5619 if (offset) { /* esp. if nothing to pull */
5620 src = &AvARRAY(ary)[offset-1];
5621 dst = src - diff; /* diff is negative */
5622 for (i = offset; i > 0; i--) /* can't trust Copy */
5626 AvARRAY(ary) = AvARRAY(ary) - diff; /* diff is negative */
5630 if (after) { /* anything to pull down? */
5631 src = AvARRAY(ary) + offset + length;
5632 dst = src + diff; /* diff is negative */
5633 Move(src, dst, after, SV*);
5635 dst = &AvARRAY(ary)[AvFILLp(ary)+1];
5636 /* avoid later double free */
5643 Copy( tmparyval, AvARRAY(ary) + offset, newlen, SV* );
5644 Safefree(tmparyval);
5647 else { /* no, expanding (or same) */
5648 SV** tmparyval = NULL;
5650 Newx(tmparyval, length, SV*); /* so remember deletion */
5651 Copy(AvARRAY(ary)+offset, tmparyval, length, SV*);
5654 if (diff > 0) { /* expanding */
5655 /* push up or down? */
5656 if (offset < after && diff <= AvARRAY(ary) - AvALLOC(ary)) {
5660 Move(src, dst, offset, SV*);
5662 AvARRAY(ary) = AvARRAY(ary) - diff;/* diff is positive */
5664 AvFILLp(ary) += diff;
5667 if (AvFILLp(ary) + diff >= AvMAX(ary)) /* oh, well */
5668 av_extend(ary, AvFILLp(ary) + diff);
5669 AvFILLp(ary) += diff;
5672 dst = AvARRAY(ary) + AvFILLp(ary);
5674 for (i = after; i; i--) {
5682 Copy( MARK, AvARRAY(ary) + offset, newlen, SV* );
5685 MARK = ORIGMARK + 1;
5686 if (GIMME_V == G_ARRAY) { /* copy return vals to stack */
5688 const bool real = cBOOL(AvREAL(ary));
5690 EXTEND_MORTAL(length);
5691 for (i = 0, dst = MARK; i < length; i++) {
5692 if ((*dst = tmparyval[i])) {
5694 sv_2mortal(*dst); /* free them eventually */
5696 else *dst = &PL_sv_undef;
5702 else if (length--) {
5703 *MARK = tmparyval[length];
5706 while (length-- > 0)
5707 SvREFCNT_dec(tmparyval[length]);
5710 *MARK = &PL_sv_undef;
5713 *MARK = &PL_sv_undef;
5714 Safefree(tmparyval);
5718 mg_set(MUTABLE_SV(ary));
5726 dSP; dMARK; dORIGMARK; dTARGET;
5727 AV * const ary = MUTABLE_AV(*++MARK);
5728 const MAGIC * const mg = SvTIED_mg((const SV *)ary, PERL_MAGIC_tied);
5731 *MARK-- = SvTIED_obj(MUTABLE_SV(ary), mg);
5734 ENTER_with_name("call_PUSH");
5735 call_sv(SV_CONST(PUSH),G_SCALAR|G_DISCARD|G_METHOD_NAMED);
5736 LEAVE_with_name("call_PUSH");
5737 /* SPAGAIN; not needed: SP is assigned to immediately below */
5740 /* PL_delaymagic is restored by JUMPENV_POP on dieing, so we
5741 * only need to save locally, not on the save stack */
5742 U16 old_delaymagic = PL_delaymagic;
5744 if (SvREADONLY(ary) && MARK < SP) Perl_croak_no_modify();
5745 PL_delaymagic = DM_DELAY;
5746 for (++MARK; MARK <= SP; MARK++) {
5748 if (*MARK) SvGETMAGIC(*MARK);
5751 sv_setsv_nomg(sv, *MARK);
5752 av_store(ary, AvFILLp(ary)+1, sv);
5754 if (PL_delaymagic & DM_ARRAY_ISA)
5755 mg_set(MUTABLE_SV(ary));
5756 PL_delaymagic = old_delaymagic;
5759 if (OP_GIMME(PL_op, 0) != G_VOID) {
5760 PUSHi( AvFILL(ary) + 1 );
5765 /* also used for: pp_pop()*/
5769 AV * const av = PL_op->op_flags & OPf_SPECIAL
5770 ? MUTABLE_AV(GvAVn(PL_defgv)) : MUTABLE_AV(POPs);
5771 SV * const sv = PL_op->op_type == OP_SHIFT ? av_shift(av) : av_pop(av);
5775 (void)sv_2mortal(sv);
5782 dSP; dMARK; dORIGMARK; dTARGET;
5783 AV *ary = MUTABLE_AV(*++MARK);
5784 const MAGIC * const mg = SvTIED_mg((const SV *)ary, PERL_MAGIC_tied);
5787 *MARK-- = SvTIED_obj(MUTABLE_SV(ary), mg);
5790 ENTER_with_name("call_UNSHIFT");
5791 call_sv(SV_CONST(UNSHIFT),G_SCALAR|G_DISCARD|G_METHOD_NAMED);
5792 LEAVE_with_name("call_UNSHIFT");
5793 /* SPAGAIN; not needed: SP is assigned to immediately below */
5796 /* PL_delaymagic is restored by JUMPENV_POP on dieing, so we
5797 * only need to save locally, not on the save stack */
5798 U16 old_delaymagic = PL_delaymagic;
5801 av_unshift(ary, SP - MARK);
5802 PL_delaymagic = DM_DELAY;
5804 SV * const sv = newSVsv(*++MARK);
5805 (void)av_store(ary, i++, sv);
5807 if (PL_delaymagic & DM_ARRAY_ISA)
5808 mg_set(MUTABLE_SV(ary));
5809 PL_delaymagic = old_delaymagic;
5812 if (OP_GIMME(PL_op, 0) != G_VOID) {
5813 PUSHi( AvFILL(ary) + 1 );
5822 if (GIMME_V == G_ARRAY) {
5823 if (PL_op->op_private & OPpREVERSE_INPLACE) {
5827 assert( MARK+1 == SP && *SP && SvTYPE(*SP) == SVt_PVAV);
5828 (void)POPMARK; /* remove mark associated with ex-OP_AASSIGN */
5829 av = MUTABLE_AV((*SP));
5830 /* In-place reversing only happens in void context for the array
5831 * assignment. We don't need to push anything on the stack. */
5834 if (SvMAGICAL(av)) {
5836 SV *tmp = sv_newmortal();
5837 /* For SvCANEXISTDELETE */
5840 bool can_preserve = SvCANEXISTDELETE(av);
5842 for (i = 0, j = av_tindex(av); i < j; ++i, --j) {
5846 if (!av_exists(av, i)) {
5847 if (av_exists(av, j)) {
5848 SV *sv = av_delete(av, j, 0);
5849 begin = *av_fetch(av, i, TRUE);
5850 sv_setsv_mg(begin, sv);
5854 else if (!av_exists(av, j)) {
5855 SV *sv = av_delete(av, i, 0);
5856 end = *av_fetch(av, j, TRUE);
5857 sv_setsv_mg(end, sv);
5862 begin = *av_fetch(av, i, TRUE);
5863 end = *av_fetch(av, j, TRUE);
5864 sv_setsv(tmp, begin);
5865 sv_setsv_mg(begin, end);
5866 sv_setsv_mg(end, tmp);
5870 SV **begin = AvARRAY(av);
5873 SV **end = begin + AvFILLp(av);
5875 while (begin < end) {
5876 SV * const tmp = *begin;
5887 SV * const tmp = *MARK;
5891 /* safe as long as stack cannot get extended in the above */
5900 SvUTF8_off(TARG); /* decontaminate */
5901 if (SP - MARK > 1) {
5902 do_join(TARG, &PL_sv_no, MARK, SP);
5905 } else if (SP > MARK) {
5906 sv_setsv(TARG, *SP);
5909 sv_setsv(TARG, DEFSV);
5913 up = SvPV_force(TARG, len);
5916 if (DO_UTF8(TARG)) { /* first reverse each character */
5917 U8* s = (U8*)SvPVX(TARG);
5918 const U8* send = (U8*)(s + len);
5920 if (UTF8_IS_INVARIANT(*s)) {
5925 if (!utf8_to_uvchr_buf(s, send, 0))
5929 down = (char*)(s - 1);
5930 /* reverse this character */
5932 const char tmp = *up;
5940 down = SvPVX(TARG) + len - 1;
5942 const char tmp = *up;
5946 (void)SvPOK_only_UTF8(TARG);
5955 AV *ary = ( (PL_op->op_private & OPpSPLIT_ASSIGN) /* @a = split */
5956 && (PL_op->op_flags & OPf_STACKED)) /* @{expr} = split */
5957 ? (AV *)POPs : NULL;
5958 IV limit = POPi; /* note, negative is forever */
5959 SV * const sv = POPs;
5961 const char *s = SvPV_const(sv, len);
5962 const bool do_utf8 = DO_UTF8(sv);
5963 const bool in_uni_8_bit = IN_UNI_8_BIT;
5964 const char *strend = s + len;
5965 PMOP *pm = cPMOPx(PL_op);
5970 const STRLEN slen = do_utf8
5971 ? utf8_length((U8*)s, (U8*)strend)
5972 : (STRLEN)(strend - s);
5973 SSize_t maxiters = slen + 10;
5974 I32 trailing_empty = 0;
5976 const IV origlimit = limit;
5979 const U8 gimme = GIMME_V;
5981 I32 oldsave = PL_savestack_ix;
5982 U32 make_mortal = SVs_TEMP;
5988 TAINT_IF(get_regex_charset(RX_EXTFLAGS(rx)) == REGEX_LOCALE_CHARSET &&
5989 (RX_EXTFLAGS(rx) & (RXf_WHITE | RXf_SKIPWHITE)));
5991 /* handle @ary = split(...) optimisation */
5992 if (PL_op->op_private & OPpSPLIT_ASSIGN) {
5993 if (!(PL_op->op_flags & OPf_STACKED)) {
5994 if (PL_op->op_private & OPpSPLIT_LEX) {
5995 if (PL_op->op_private & OPpLVAL_INTRO)
5996 SAVECLEARSV(PAD_SVl(pm->op_pmreplrootu.op_pmtargetoff));
5997 ary = (AV *)PAD_SVl(pm->op_pmreplrootu.op_pmtargetoff);
6002 MUTABLE_GV(PAD_SVl(pm->op_pmreplrootu.op_pmtargetoff));
6004 pm->op_pmreplrootu.op_pmtargetgv;
6006 if (PL_op->op_private & OPpLVAL_INTRO)
6011 /* skip anything pushed by OPpLVAL_INTRO above */
6012 oldsave = PL_savestack_ix;
6018 (void)sv_2mortal(SvREFCNT_inc_simple_NN(sv));
6021 if ((mg = SvTIED_mg((const SV *)ary, PERL_MAGIC_tied))) {
6023 XPUSHs(SvTIED_obj(MUTABLE_SV(ary), mg));
6030 for (i = AvFILLp(ary); i >= 0; i--)
6031 AvARRAY(ary)[i] = &PL_sv_undef; /* don't free mere refs */
6033 /* temporarily switch stacks */
6034 SAVESWITCHSTACK(PL_curstack, ary);
6039 base = SP - PL_stack_base;
6041 if (RX_EXTFLAGS(rx) & RXf_SKIPWHITE) {
6043 while (s < strend && isSPACE_utf8_safe(s, strend))
6046 else if (get_regex_charset(RX_EXTFLAGS(rx)) == REGEX_LOCALE_CHARSET) {
6047 while (s < strend && isSPACE_LC(*s))
6050 else if (in_uni_8_bit) {
6051 while (s < strend && isSPACE_L1(*s))
6055 while (s < strend && isSPACE(*s))
6059 if (RX_EXTFLAGS(rx) & RXf_PMf_MULTILINE) {
6063 gimme_scalar = gimme == G_SCALAR && !ary;
6066 limit = maxiters + 2;
6067 if (RX_EXTFLAGS(rx) & RXf_WHITE) {
6070 /* this one uses 'm' and is a negative test */
6072 while (m < strend && ! isSPACE_utf8_safe(m, strend) ) {
6073 const int t = UTF8SKIP(m);
6074 /* isSPACE_utf8_safe returns FALSE for malform utf8 */
6081 else if (get_regex_charset(RX_EXTFLAGS(rx)) == REGEX_LOCALE_CHARSET)
6083 while (m < strend && !isSPACE_LC(*m))
6086 else if (in_uni_8_bit) {
6087 while (m < strend && !isSPACE_L1(*m))
6090 while (m < strend && !isSPACE(*m))
6103 dstr = newSVpvn_flags(s, m-s,
6104 (do_utf8 ? SVf_UTF8 : 0) | make_mortal);
6108 /* skip the whitespace found last */
6110 s = m + UTF8SKIP(m);
6114 /* this one uses 's' and is a positive test */
6116 while (s < strend && isSPACE_utf8_safe(s, strend) )
6119 else if (get_regex_charset(RX_EXTFLAGS(rx)) == REGEX_LOCALE_CHARSET)
6121 while (s < strend && isSPACE_LC(*s))
6124 else if (in_uni_8_bit) {
6125 while (s < strend && isSPACE_L1(*s))
6128 while (s < strend && isSPACE(*s))
6133 else if (RX_EXTFLAGS(rx) & RXf_START_ONLY) {
6135 for (m = s; m < strend && *m != '\n'; m++)
6148 dstr = newSVpvn_flags(s, m-s,
6149 (do_utf8 ? SVf_UTF8 : 0) | make_mortal);
6155 else if (RX_EXTFLAGS(rx) & RXf_NULL && !(s >= strend)) {
6157 Pre-extend the stack, either the number of bytes or
6158 characters in the string or a limited amount, triggered by:
6160 my ($x, $y) = split //, $str;
6164 if (!gimme_scalar) {
6165 const IV items = limit - 1;
6166 /* setting it to -1 will trigger a panic in EXTEND() */
6167 const SSize_t sslen = slen > SSize_t_MAX ? -1 : (SSize_t)slen;
6168 if (items >=0 && items < sslen)
6176 /* keep track of how many bytes we skip over */
6186 dstr = newSVpvn_flags(m, s-m, SVf_UTF8 | make_mortal);
6199 dstr = newSVpvn(s, 1);
6215 else if (do_utf8 == (RX_UTF8(rx) != 0) &&
6216 (RX_EXTFLAGS(rx) & RXf_USE_INTUIT) && !RX_NPARENS(rx)
6217 && (RX_EXTFLAGS(rx) & RXf_CHECK_ALL)
6218 && !(RX_EXTFLAGS(rx) & RXf_IS_ANCHORED)) {
6219 const int tail = (RX_EXTFLAGS(rx) & RXf_INTUIT_TAIL);
6220 SV * const csv = CALLREG_INTUIT_STRING(rx);
6222 len = RX_MINLENRET(rx);
6223 if (len == 1 && !RX_UTF8(rx) && !tail) {
6224 const char c = *SvPV_nolen_const(csv);
6226 for (m = s; m < strend && *m != c; m++)
6237 dstr = newSVpvn_flags(s, m-s,
6238 (do_utf8 ? SVf_UTF8 : 0) | make_mortal);
6241 /* The rx->minlen is in characters but we want to step
6242 * s ahead by bytes. */
6244 s = (char*)utf8_hop((U8*)m, len);
6246 s = m + len; /* Fake \n at the end */
6250 while (s < strend && --limit &&
6251 (m = fbm_instr((unsigned char*)s, (unsigned char*)strend,
6252 csv, multiline ? FBMrf_MULTILINE : 0)) )
6261 dstr = newSVpvn_flags(s, m-s,
6262 (do_utf8 ? SVf_UTF8 : 0) | make_mortal);
6265 /* The rx->minlen is in characters but we want to step
6266 * s ahead by bytes. */
6268 s = (char*)utf8_hop((U8*)m, len);
6270 s = m + len; /* Fake \n at the end */
6275 maxiters += slen * RX_NPARENS(rx);
6276 while (s < strend && --limit)
6280 rex_return = CALLREGEXEC(rx, (char*)s, (char*)strend, (char*)orig, 1,
6283 if (rex_return == 0)
6285 TAINT_IF(RX_MATCH_TAINTED(rx));
6286 /* we never pass the REXEC_COPY_STR flag, so it should
6287 * never get copied */
6288 assert(!RX_MATCH_COPIED(rx));
6289 m = RX_OFFS(rx)[0].start + orig;
6298 dstr = newSVpvn_flags(s, m-s,
6299 (do_utf8 ? SVf_UTF8 : 0) | make_mortal);
6302 if (RX_NPARENS(rx)) {
6304 for (i = 1; i <= (I32)RX_NPARENS(rx); i++) {
6305 s = RX_OFFS(rx)[i].start + orig;
6306 m = RX_OFFS(rx)[i].end + orig;
6308 /* japhy (07/27/01) -- the (m && s) test doesn't catch
6309 parens that didn't match -- they should be set to
6310 undef, not the empty string */
6318 if (m >= orig && s >= orig) {
6319 dstr = newSVpvn_flags(s, m-s,
6320 (do_utf8 ? SVf_UTF8 : 0)
6324 dstr = &PL_sv_undef; /* undef, not "" */
6330 s = RX_OFFS(rx)[0].end + orig;
6334 if (!gimme_scalar) {
6335 iters = (SP - PL_stack_base) - base;
6337 if (iters > maxiters)
6338 DIE(aTHX_ "Split loop");
6340 /* keep field after final delim? */
6341 if (s < strend || (iters && origlimit)) {
6342 if (!gimme_scalar) {
6343 const STRLEN l = strend - s;
6344 dstr = newSVpvn_flags(s, l, (do_utf8 ? SVf_UTF8 : 0) | make_mortal);
6349 else if (!origlimit) {
6351 iters -= trailing_empty;
6353 while (iters > 0 && (!TOPs || !SvANY(TOPs) || SvCUR(TOPs) == 0)) {
6354 if (TOPs && !make_mortal)
6363 LEAVE_SCOPE(oldsave); /* may undo an earlier SWITCHSTACK */
6367 if (SvSMAGICAL(ary)) {
6369 mg_set(MUTABLE_SV(ary));
6372 if (gimme == G_ARRAY) {
6374 Copy(AvARRAY(ary), SP + 1, iters, SV*);
6381 ENTER_with_name("call_PUSH");
6382 call_sv(SV_CONST(PUSH),G_SCALAR|G_DISCARD|G_METHOD_NAMED);
6383 LEAVE_with_name("call_PUSH");
6385 if (gimme == G_ARRAY) {
6387 /* EXTEND should not be needed - we just popped them */
6389 for (i=0; i < iters; i++) {
6390 SV **svp = av_fetch(ary, i, FALSE);
6391 PUSHs((svp) ? *svp : &PL_sv_undef);
6398 if (gimme == G_ARRAY)
6410 SV *const sv = PAD_SVl(PL_op->op_targ);
6412 if (SvPADSTALE(sv)) {
6415 RETURNOP(cLOGOP->op_other);
6417 RETURNOP(cLOGOP->op_next);
6426 if (SvTYPE(retsv) == SVt_PVAV || SvTYPE(retsv) == SVt_PVHV
6427 || SvTYPE(retsv) == SVt_PVCV) {
6428 retsv = refto(retsv);
6435 /* used for: pp_padany(), pp_custom(); plus any system ops
6436 * that aren't implemented on a particular platform */
6438 PP(unimplemented_op)
6440 const Optype op_type = PL_op->op_type;
6441 /* Using OP_NAME() isn't going to be helpful here. Firstly, it doesn't cope
6442 with out of range op numbers - it only "special" cases op_custom.
6443 Secondly, as the three ops we "panic" on are padmy, mapstart and custom,
6444 if we get here for a custom op then that means that the custom op didn't
6445 have an implementation. Given that OP_NAME() looks up the custom op
6446 by its pp_addr, likely it will return NULL, unless someone (unhelpfully)
6447 registers &PL_unimplemented_op as the address of their custom op.
6448 NULL doesn't generate a useful error message. "custom" does. */
6449 const char *const name = op_type >= OP_max
6450 ? "[out of range]" : PL_op_name[PL_op->op_type];
6451 if(OP_IS_SOCKET(op_type))
6452 DIE(aTHX_ PL_no_sock_func, name);
6453 DIE(aTHX_ "panic: unimplemented op %s (#%d) called", name, op_type);
6457 S_maybe_unwind_defav(pTHX)
6459 if (CX_CUR()->cx_type & CXp_HASARGS) {
6460 PERL_CONTEXT *cx = CX_CUR();
6462 assert(CxHASARGS(cx));
6464 cx->cx_type &= ~CXp_HASARGS;
6468 /* For sorting out arguments passed to a &CORE:: subroutine */
6472 int opnum = SvIOK(cSVOP_sv) ? (int)SvUV(cSVOP_sv) : 0;
6473 int defgv = PL_opargs[opnum] & OA_DEFGV ||opnum==OP_GLOB, whicharg = 0;
6474 AV * const at_ = GvAV(PL_defgv);
6475 SV **svp = at_ ? AvARRAY(at_) : NULL;
6476 I32 minargs = 0, maxargs = 0, numargs = at_ ? AvFILLp(at_)+1 : 0;
6477 I32 oa = opnum ? PL_opargs[opnum] >> OASHIFT : 0;
6478 bool seen_question = 0;
6479 const char *err = NULL;
6480 const bool pushmark = PL_op->op_private & OPpCOREARGS_PUSHMARK;
6482 /* Count how many args there are first, to get some idea how far to
6483 extend the stack. */
6485 if ((oa & 7) == OA_LIST) { maxargs = I32_MAX; break; }
6487 if (oa & OA_OPTIONAL) seen_question = 1;
6488 if (!seen_question) minargs++;
6492 if(numargs < minargs) err = "Not enough";
6493 else if(numargs > maxargs) err = "Too many";
6495 /* diag_listed_as: Too many arguments for %s */
6497 "%s arguments for %s", err,
6498 opnum ? PL_op_desc[opnum] : SvPV_nolen_const(cSVOP_sv)
6501 /* Reset the stack pointer. Without this, we end up returning our own
6502 arguments in list context, in addition to the values we are supposed
6503 to return. nextstate usually does this on sub entry, but we need
6504 to run the next op with the caller's hints, so we cannot have a
6506 SP = PL_stack_base + CX_CUR()->blk_oldsp;
6508 if(!maxargs) RETURN;
6510 /* We do this here, rather than with a separate pushmark op, as it has
6511 to come in between two things this function does (stack reset and
6512 arg pushing). This seems the easiest way to do it. */
6515 (void)Perl_pp_pushmark(aTHX);
6518 EXTEND(SP, maxargs == I32_MAX ? numargs : maxargs);
6519 PUTBACK; /* The code below can die in various places. */
6521 oa = PL_opargs[opnum] >> OASHIFT;
6522 for (; oa&&(numargs||!pushmark); (void)(numargs&&(++svp,--numargs))) {
6527 if (!numargs && defgv && whicharg == minargs + 1) {
6530 else PUSHs(numargs ? svp && *svp ? *svp : &PL_sv_undef : NULL);
6534 PUSHs(svp && *svp ? *svp : &PL_sv_undef);
6541 if (CvUNIQUE(find_runcv_where(FIND_RUNCV_level_eq,1,NULL)))
6544 S_maybe_unwind_defav(aTHX);
6547 PUSHs((SV *)GvAVn(gv));
6550 if (!svp || !*svp || !SvROK(*svp)
6551 || SvTYPE(SvRV(*svp)) != SVt_PVAV)
6553 /* diag_listed_as: Type of arg %d to &CORE::%s must be %s*/
6554 "Type of arg %d to &CORE::%s must be array reference",
6555 whicharg, PL_op_desc[opnum]
6560 if (!svp || !*svp || !SvROK(*svp)
6561 || ( SvTYPE(SvRV(*svp)) != SVt_PVHV
6562 && ( opnum == OP_DBMCLOSE || opnum == OP_DBMOPEN
6563 || SvTYPE(SvRV(*svp)) != SVt_PVAV )))
6565 /* diag_listed_as: Type of arg %d to &CORE::%s must be %s*/
6566 "Type of arg %d to &CORE::%s must be hash%s reference",
6567 whicharg, PL_op_desc[opnum],
6568 opnum == OP_DBMCLOSE || opnum == OP_DBMOPEN
6575 if (!numargs) PUSHs(NULL);
6576 else if(svp && *svp && SvROK(*svp) && isGV_with_GP(SvRV(*svp)))
6577 /* no magic here, as the prototype will have added an extra
6578 refgen and we just want what was there before that */
6581 const bool constr = PL_op->op_private & whicharg;
6583 svp && *svp ? *svp : &PL_sv_undef,
6584 constr, cBOOL(CopHINTS_get(PL_curcop) & HINT_STRICT_REFS),
6590 if (!numargs) goto try_defsv;
6592 const bool wantscalar =
6593 PL_op->op_private & OPpCOREARGS_SCALARMOD;
6594 if (!svp || !*svp || !SvROK(*svp)
6595 /* We have to permit globrefs even for the \$ proto, as
6596 *foo is indistinguishable from ${\*foo}, and the proto-
6597 type permits the latter. */
6598 || SvTYPE(SvRV(*svp)) > (
6599 wantscalar ? SVt_PVLV
6600 : opnum == OP_LOCK || opnum == OP_UNDEF
6606 "Type of arg %d to &CORE::%s must be %s",
6607 whicharg, PL_op_name[opnum],
6609 ? "scalar reference"
6610 : opnum == OP_LOCK || opnum == OP_UNDEF
6611 ? "reference to one of [$@%&*]"
6612 : "reference to one of [$@%*]"
6615 if (opnum == OP_UNDEF && SvRV(*svp) == (SV *)PL_defgv) {
6616 /* Undo @_ localisation, so that sub exit does not undo
6617 part of our undeffing. */
6618 S_maybe_unwind_defav(aTHX);
6623 DIE(aTHX_ "panic: unknown OA_*: %x", (unsigned)(oa&7));
6631 /* Implement CORE::keys(),values(),each().
6633 * We won't know until run-time whether the arg is an array or hash,
6636 * pp_keys/pp_values/pp_each
6638 * pp_akeys/pp_avalues/pp_aeach
6640 * as appropriate (or whatever pp function actually implements the OP_FOO
6641 * functionality for each FOO).
6648 (SvTYPE(TOPs) == SVt_PVAV ? OP_AEACH : OP_EACH)
6649 + (PL_op->op_private & OPpAVHVSWITCH_MASK)
6657 if (PL_op->op_private & OPpOFFBYONE) {
6658 cv = find_runcv_where(FIND_RUNCV_level_eq, 1, NULL);
6660 else cv = find_runcv(NULL);
6661 XPUSHs(CvEVAL(cv) ? &PL_sv_undef : sv_2mortal(newRV((SV *)cv)));
6666 S_localise_aelem_lval(pTHX_ AV * const av, SV * const keysv,
6667 const bool can_preserve)
6669 const SSize_t ix = SvIV(keysv);
6670 if (can_preserve ? av_exists(av, ix) : TRUE) {
6671 SV ** const svp = av_fetch(av, ix, 1);
6673 Perl_croak(aTHX_ PL_no_aelem, ix);
6674 save_aelem(av, ix, svp);
6677 SAVEADELETE(av, ix);
6681 S_localise_helem_lval(pTHX_ HV * const hv, SV * const keysv,
6682 const bool can_preserve)
6684 if (can_preserve ? hv_exists_ent(hv, keysv, 0) : TRUE) {
6685 HE * const he = hv_fetch_ent(hv, keysv, 1, 0);
6686 SV ** const svp = he ? &HeVAL(he) : NULL;
6688 Perl_croak(aTHX_ PL_no_helem_sv, SVfARG(keysv));
6689 save_helem_flags(hv, keysv, svp, 0);
6692 SAVEHDELETE(hv, keysv);
6696 S_localise_gv_slot(pTHX_ GV *gv, U8 type)
6698 if (type == OPpLVREF_SV) {
6699 save_pushptrptr(gv, SvREFCNT_inc_simple(GvSV(gv)), SAVEt_GVSV);
6702 else if (type == OPpLVREF_AV)
6703 /* XXX Inefficient, as it creates a new AV, which we are
6704 about to clobber. */
6707 assert(type == OPpLVREF_HV);
6708 /* XXX Likewise inefficient. */
6717 SV * const key = PL_op->op_private & OPpLVREF_ELEM ? POPs : NULL;
6718 SV * const left = PL_op->op_flags & OPf_STACKED ? POPs : NULL;
6720 const char *bad = NULL;
6721 const U8 type = PL_op->op_private & OPpLVREF_TYPE;
6722 if (!SvROK(sv)) DIE(aTHX_ "Assigned value is not a reference");
6725 if (SvTYPE(SvRV(sv)) > SVt_PVLV)
6729 if (SvTYPE(SvRV(sv)) != SVt_PVAV)
6733 if (SvTYPE(SvRV(sv)) != SVt_PVHV)
6737 if (SvTYPE(SvRV(sv)) != SVt_PVCV)
6741 /* diag_listed_as: Assigned value is not %s reference */
6742 DIE(aTHX_ "Assigned value is not a%s reference", bad);
6746 switch (left ? SvTYPE(left) : 0) {
6749 SV * const old = PAD_SV(ARGTARG);
6750 PAD_SETSV(ARGTARG, SvREFCNT_inc_NN(SvRV(sv)));
6752 if ((PL_op->op_private & (OPpLVAL_INTRO|OPpPAD_STATE))
6754 SAVECLEARSV(PAD_SVl(ARGTARG));
6758 if (PL_op->op_private & OPpLVAL_INTRO) {
6759 S_localise_gv_slot(aTHX_ (GV *)left, type);
6761 gv_setref(left, sv);
6766 if (UNLIKELY(PL_op->op_private & OPpLVAL_INTRO)) {
6767 S_localise_aelem_lval(aTHX_ (AV *)left, key,
6768 SvCANEXISTDELETE(left));
6770 av_store((AV *)left, SvIV(key), SvREFCNT_inc_simple_NN(SvRV(sv)));
6773 if (UNLIKELY(PL_op->op_private & OPpLVAL_INTRO)) {
6775 S_localise_helem_lval(aTHX_ (HV *)left, key,
6776 SvCANEXISTDELETE(left));
6778 (void)hv_store_ent((HV *)left, key, SvREFCNT_inc_simple_NN(SvRV(sv)), 0);
6780 if (PL_op->op_flags & OPf_MOD)
6781 SETs(sv_2mortal(newSVsv(sv)));
6782 /* XXX else can weak references go stale before they are read, e.g.,
6791 SV * const ret = sv_2mortal(newSV_type(SVt_PVMG));
6792 SV * const elem = PL_op->op_private & OPpLVREF_ELEM ? POPs : NULL;
6793 SV * const arg = PL_op->op_flags & OPf_STACKED ? POPs : NULL;
6794 MAGIC * const mg = sv_magicext(ret, arg, PERL_MAGIC_lvref,
6795 &PL_vtbl_lvref, (char *)elem,
6796 elem ? HEf_SVKEY : (I32)ARGTARG);
6797 mg->mg_private = PL_op->op_private;
6798 if (PL_op->op_private & OPpLVREF_ITER)
6799 mg->mg_flags |= MGf_PERSIST;
6800 if (UNLIKELY(PL_op->op_private & OPpLVAL_INTRO)) {
6806 const bool can_preserve = SvCANEXISTDELETE(arg);
6807 if (SvTYPE(arg) == SVt_PVAV)
6808 S_localise_aelem_lval(aTHX_ (AV *)arg, elem, can_preserve);
6810 S_localise_helem_lval(aTHX_ (HV *)arg, elem, can_preserve);
6814 S_localise_gv_slot(aTHX_ (GV *)arg,
6815 PL_op->op_private & OPpLVREF_TYPE);
6817 else if (!(PL_op->op_private & OPpPAD_STATE))
6818 SAVECLEARSV(PAD_SVl(ARGTARG));
6827 AV * const av = (AV *)POPs;
6828 const bool localizing = PL_op->op_private & OPpLVAL_INTRO;
6829 bool can_preserve = FALSE;
6831 if (UNLIKELY(localizing)) {
6836 can_preserve = SvCANEXISTDELETE(av);
6838 if (SvTYPE(av) == SVt_PVAV) {
6841 for (svp = MARK + 1; svp <= SP; svp++) {
6842 const SSize_t elem = SvIV(*svp);
6846 if (max > AvMAX(av))
6851 while (++MARK <= SP) {
6852 SV * const elemsv = *MARK;
6853 if (UNLIKELY(localizing)) {
6854 if (SvTYPE(av) == SVt_PVAV)
6855 S_localise_aelem_lval(aTHX_ av, elemsv, can_preserve);
6857 S_localise_helem_lval(aTHX_ (HV *)av, elemsv, can_preserve);
6859 *MARK = sv_2mortal(newSV_type(SVt_PVMG));
6860 sv_magic(*MARK,(SV *)av,PERL_MAGIC_lvref,(char *)elemsv,HEf_SVKEY);
6867 if (PL_op->op_flags & OPf_STACKED)
6868 Perl_pp_rv2av(aTHX);
6870 Perl_pp_padav(aTHX);
6874 SETs(0); /* special alias marker that aassign recognises */
6884 SETs(sv_2mortal((SV *)newCONSTSUB(SvTYPE(CopSTASH(PL_curcop))==SVt_PVHV
6885 ? CopSTASH(PL_curcop)
6887 NULL, SvREFCNT_inc_simple_NN(sv))));
6892 /* process one subroutine argument - typically when the sub has a signature:
6893 * introduce PL_curpad[op_targ] and assign to it the value
6894 * for $: (OPf_STACKED ? *sp : $_[N])
6895 * for @/%: @_[N..$#_]
6897 * It's equivalent to
6900 * my $foo = (value-on-stack)
6902 * my @foo = @_[N..$#_]
6912 AV *defav = GvAV(PL_defgv); /* @_ */
6913 IV ix = PTR2IV(cUNOP_AUXo->op_aux);
6916 /* do 'my $var, @var or %var' action */
6917 padentry = &(PAD_SVl(o->op_targ));
6918 save_clearsv(padentry);
6921 if ((o->op_private & OPpARGELEM_MASK) == OPpARGELEM_SV) {
6922 if (o->op_flags & OPf_STACKED) {
6929 /* should already have been checked */
6931 #if IVSIZE > PTRSIZE
6932 assert(ix <= SSize_t_MAX);
6935 svp = av_fetch(defav, ix, FALSE);
6936 val = svp ? *svp : &PL_sv_undef;
6941 /* cargo-culted from pp_sassign */
6942 assert(TAINTING_get || !TAINT_get);
6943 if (UNLIKELY(TAINT_get) && !SvTAINTED(val))
6946 SvSetMagicSV(targ, val);
6950 /* must be AV or HV */
6952 assert(!(o->op_flags & OPf_STACKED));
6953 argc = ((IV)AvFILL(defav) + 1) - ix;
6955 /* This is a copy of the relevant parts of pp_aassign().
6957 if ((o->op_private & OPpARGELEM_MASK) == OPpARGELEM_AV) {
6960 if (AvFILL((AV*)targ) > -1) {
6961 /* target should usually be empty. If we get get
6962 * here, someone's been doing some weird closure tricks.
6963 * Make a copy of all args before clearing the array,
6964 * to avoid the equivalent of @a = ($a[0]) prematurely freeing
6965 * elements. See similar code in pp_aassign.
6967 for (i = 0; i < argc; i++) {
6968 SV **svp = av_fetch(defav, ix + i, FALSE);
6969 SV *newsv = newSV(0);
6970 sv_setsv_flags(newsv,
6971 svp ? *svp : &PL_sv_undef,
6972 (SV_DO_COW_SVSETSV|SV_NOSTEAL));
6973 if (!av_store(defav, ix + i, newsv))
6974 SvREFCNT_dec_NN(newsv);
6976 av_clear((AV*)targ);
6982 av_extend((AV*)targ, argc);
6987 SV **svp = av_fetch(defav, ix + i, FALSE);
6988 SV *val = svp ? *svp : &PL_sv_undef;
6990 sv_setsv(tmpsv, val);
6991 av_store((AV*)targ, i++, tmpsv);
6999 assert((o->op_private & OPpARGELEM_MASK) == OPpARGELEM_HV);
7001 if (SvRMAGICAL(targ) || HvUSEDKEYS((HV*)targ)) {
7002 /* see "target should usually be empty" comment above */
7003 for (i = 0; i < argc; i++) {
7004 SV **svp = av_fetch(defav, ix + i, FALSE);
7005 SV *newsv = newSV(0);
7006 sv_setsv_flags(newsv,
7007 svp ? *svp : &PL_sv_undef,
7008 (SV_DO_COW_SVSETSV|SV_NOSTEAL));
7009 if (!av_store(defav, ix + i, newsv))
7010 SvREFCNT_dec_NN(newsv);
7012 hv_clear((HV*)targ);
7017 assert(argc % 2 == 0);
7026 svp = av_fetch(defav, ix + i++, FALSE);
7027 key = svp ? *svp : &PL_sv_undef;
7028 svp = av_fetch(defav, ix + i++, FALSE);
7029 val = svp ? *svp : &PL_sv_undef;
7032 if (UNLIKELY(SvGMAGICAL(key)))
7033 key = sv_mortalcopy(key);
7035 sv_setsv(tmpsv, val);
7036 hv_store_ent((HV*)targ, key, tmpsv, 0);
7044 /* Handle a default value for one subroutine argument (typically as part
7045 * of a subroutine signature).
7046 * It's equivalent to
7047 * @_ > op_targ ? $_[op_targ] : result_of(op_other)
7049 * Intended to be used where op_next is an OP_ARGELEM
7051 * We abuse the op_targ field slightly: it's an index into @_ rather than
7057 OP * const o = PL_op;
7058 AV *defav = GvAV(PL_defgv); /* @_ */
7059 IV ix = (IV)o->op_targ;
7062 #if IVSIZE > PTRSIZE
7063 assert(ix <= SSize_t_MAX);
7066 if (AvFILL(defav) >= ix) {
7068 SV **svp = av_fetch(defav, ix, FALSE);
7069 SV *val = svp ? *svp : &PL_sv_undef;
7073 return cLOGOPo->op_other;
7078 S_find_runcv_name(void)
7093 sv = sv_2mortal(newSV(0));
7094 gv_fullname4(sv, gv, NULL, TRUE);
7098 /* Check a a subs arguments - i.e. that it has the correct number of args
7099 * (and anything else we might think of in future). Typically used with
7105 OP * const o = PL_op;
7106 UNOP_AUX_item *aux = cUNOP_AUXo->op_aux;
7107 IV params = aux[0].iv;
7108 IV opt_params = aux[1].iv;
7109 char slurpy = (char)(aux[2].iv);
7110 AV *defav = GvAV(PL_defgv); /* @_ */
7114 assert(!SvMAGICAL(defav));
7115 argc = (AvFILLp(defav) + 1);
7116 too_few = (argc < (params - opt_params));
7118 if (UNLIKELY(too_few || (!slurpy && argc > params)))
7119 /* diag_listed_as: Too few arguments for subroutine '%s' */
7120 /* diag_listed_as: Too many arguments for subroutine '%s' */
7121 Perl_croak_caller("Too %s arguments for subroutine '%" SVf "'",
7122 too_few ? "few" : "many", S_find_runcv_name());
7124 if (UNLIKELY(slurpy == '%' && argc > params && (argc - params) % 2))
7125 /* diag_listed_as: Odd name/value argument for subroutine '%s' */
7126 Perl_croak_caller("Odd name/value argument for subroutine '%" SVf "'",
7127 S_find_runcv_name());
7133 * ex: set ts=8 sts=4 sw=4 et: