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);
1699 MARK[1] = &PL_sv_undef;
1703 tryAMAGICbin_MG(repeat_amg, AMGf_assign);
1709 const UV uv = SvUV_nomg(sv);
1711 count = IV_MAX; /* The best we can do? */
1715 count = SvIV_nomg(sv);
1718 else if (SvNOKp(sv)) {
1719 const NV nv = SvNV_nomg(sv);
1720 infnan = Perl_isinfnan(nv);
1721 if (UNLIKELY(infnan)) {
1725 count = -1; /* An arbitrary negative integer */
1731 count = SvIV_nomg(sv);
1734 Perl_ck_warner(aTHX_ packWARN(WARN_NUMERIC),
1735 "Non-finite repeat count does nothing");
1736 } else if (count < 0) {
1738 Perl_ck_warner(aTHX_ packWARN(WARN_NUMERIC),
1739 "Negative repeat count does nothing");
1742 if (gimme == G_ARRAY && PL_op->op_private & OPpREPEAT_DOLIST) {
1744 const SSize_t items = SP - MARK;
1745 const U8 mod = PL_op->op_flags & OPf_MOD;
1750 if ( items > SSize_t_MAX / count /* max would overflow */
1751 /* repeatcpy would overflow */
1752 || items > I32_MAX / (I32)sizeof(SV *)
1754 Perl_croak(aTHX_ "%s","Out of memory during list extend");
1755 max = items * count;
1760 if (mod && SvPADTMP(*SP)) {
1761 *SP = sv_mortalcopy(*SP);
1768 repeatcpy((char*)(MARK + items), (char*)MARK,
1769 items * sizeof(const SV *), count - 1);
1772 else if (count <= 0)
1775 else { /* Note: mark already snarfed by pp_list */
1776 SV * const tmpstr = POPs;
1781 sv_setsv_nomg(TARG, tmpstr);
1782 SvPV_force_nomg(TARG, len);
1783 isutf = DO_UTF8(TARG);
1790 if ( len > (MEM_SIZE_MAX-1) / (UV)count /* max would overflow */
1791 || len > (U32)I32_MAX /* repeatcpy would overflow */
1793 Perl_croak(aTHX_ "%s",
1794 "Out of memory during string extend");
1795 max = (UV)count * len + 1;
1798 repeatcpy(SvPVX(TARG) + len, SvPVX(TARG), len, count - 1);
1799 SvCUR_set(TARG, SvCUR(TARG) * count);
1801 *SvEND(TARG) = '\0';
1804 (void)SvPOK_only_UTF8(TARG);
1806 (void)SvPOK_only(TARG);
1815 dSP; dATARGET; bool useleft; SV *svl, *svr;
1816 tryAMAGICbin_MG(subtr_amg, AMGf_assign|AMGf_numeric);
1820 #ifdef PERL_PRESERVE_IVUV
1822 /* special-case some simple common cases */
1823 if (!((svl->sv_flags|svr->sv_flags) & (SVf_IVisUV|SVs_GMG))) {
1825 U32 flags = (svl->sv_flags & svr->sv_flags);
1826 if (flags & SVf_IOK) {
1827 /* both args are simple IVs */
1832 topl = ((UV)il) >> (UVSIZE * 8 - 2);
1833 topr = ((UV)ir) >> (UVSIZE * 8 - 2);
1835 /* if both are in a range that can't under/overflow, do a
1836 * simple integer subtract: if the top of both numbers
1837 * are 00 or 11, then it's safe */
1838 if (!( ((topl+1) | (topr+1)) & 2)) {
1840 TARGi(il - ir, 0); /* args not GMG, so can't be tainted */
1846 else if (flags & SVf_NOK) {
1847 /* both args are NVs */
1852 #if defined(NAN_COMPARE_BROKEN) && defined(Perl_isnan)
1853 !Perl_isnan(nl) && nl == (NV)(il = (IV)nl)
1854 && !Perl_isnan(nr) && nr == (NV)(ir = (IV)nr)
1856 nl == (NV)(il = (IV)nl) && nr == (NV)(ir = (IV)nr)
1859 /* nothing was lost by converting to IVs */
1862 TARGn(nl - nr, 0); /* args not GMG, so can't be tainted */
1870 useleft = USE_LEFT(svl);
1871 /* See comments in pp_add (in pp_hot.c) about Overflow, and how
1872 "bad things" happen if you rely on signed integers wrapping. */
1873 if (SvIV_please_nomg(svr)) {
1874 /* Unless the left argument is integer in range we are going to have to
1875 use NV maths. Hence only attempt to coerce the right argument if
1876 we know the left is integer. */
1883 a_valid = auvok = 1;
1884 /* left operand is undef, treat as zero. */
1886 /* Left operand is defined, so is it IV? */
1887 if (SvIV_please_nomg(svl)) {
1888 if ((auvok = SvUOK(svl)))
1891 const IV aiv = SvIVX(svl);
1894 auvok = 1; /* Now acting as a sign flag. */
1903 bool result_good = 0;
1906 bool buvok = SvUOK(svr);
1911 const IV biv = SvIVX(svr);
1918 /* ?uvok if value is >= 0. basically, flagged as UV if it's +ve,
1919 else "IV" now, independent of how it came in.
1920 if a, b represents positive, A, B negative, a maps to -A etc
1925 all UV maths. negate result if A negative.
1926 subtract if signs same, add if signs differ. */
1928 if (auvok ^ buvok) {
1937 /* Must get smaller */
1942 if (result <= buv) {
1943 /* result really should be -(auv-buv). as its negation
1944 of true value, need to swap our result flag */
1956 if (result <= (UV)IV_MIN)
1957 SETi(result == (UV)IV_MIN
1958 ? IV_MIN : -(IV)result);
1960 /* result valid, but out of range for IV. */
1961 SETn( -(NV)result );
1965 } /* Overflow, drop through to NVs. */
1969 useleft = USE_LEFT(svl);
1972 NV value = SvNV_nomg(svr);
1976 /* left operand is undef, treat as zero - value */
1980 SETn( SvNV_nomg(svl) - value );
1985 #define IV_BITS (IVSIZE * 8)
1987 static UV S_uv_shift(UV uv, int shift, bool left)
1993 if (shift >= IV_BITS) {
1996 return left ? uv << shift : uv >> shift;
1999 static IV S_iv_shift(IV iv, int shift, bool left)
2005 if (shift >= IV_BITS) {
2006 return iv < 0 && !left ? -1 : 0;
2008 return left ? iv << shift : iv >> shift;
2011 #define UV_LEFT_SHIFT(uv, shift) S_uv_shift(uv, shift, TRUE)
2012 #define UV_RIGHT_SHIFT(uv, shift) S_uv_shift(uv, shift, FALSE)
2013 #define IV_LEFT_SHIFT(iv, shift) S_iv_shift(iv, shift, TRUE)
2014 #define IV_RIGHT_SHIFT(iv, shift) S_iv_shift(iv, shift, FALSE)
2018 dSP; dATARGET; SV *svl, *svr;
2019 tryAMAGICbin_MG(lshift_amg, AMGf_assign|AMGf_numeric);
2023 const IV shift = SvIV_nomg(svr);
2024 if (PL_op->op_private & HINT_INTEGER) {
2025 SETi(IV_LEFT_SHIFT(SvIV_nomg(svl), shift));
2028 SETu(UV_LEFT_SHIFT(SvUV_nomg(svl), shift));
2036 dSP; dATARGET; SV *svl, *svr;
2037 tryAMAGICbin_MG(rshift_amg, AMGf_assign|AMGf_numeric);
2041 const IV shift = SvIV_nomg(svr);
2042 if (PL_op->op_private & HINT_INTEGER) {
2043 SETi(IV_RIGHT_SHIFT(SvIV_nomg(svl), shift));
2046 SETu(UV_RIGHT_SHIFT(SvUV_nomg(svl), shift));
2057 tryAMAGICbin_MG(lt_amg, AMGf_numeric);
2061 (SvIOK_notUV(left) && SvIOK_notUV(right))
2062 ? (SvIVX(left) < SvIVX(right))
2063 : (do_ncmp(left, right) == -1)
2073 tryAMAGICbin_MG(gt_amg, AMGf_numeric);
2077 (SvIOK_notUV(left) && SvIOK_notUV(right))
2078 ? (SvIVX(left) > SvIVX(right))
2079 : (do_ncmp(left, right) == 1)
2089 tryAMAGICbin_MG(le_amg, AMGf_numeric);
2093 (SvIOK_notUV(left) && SvIOK_notUV(right))
2094 ? (SvIVX(left) <= SvIVX(right))
2095 : (do_ncmp(left, right) <= 0)
2105 tryAMAGICbin_MG(ge_amg, AMGf_numeric);
2109 (SvIOK_notUV(left) && SvIOK_notUV(right))
2110 ? (SvIVX(left) >= SvIVX(right))
2111 : ( (do_ncmp(left, right) & 2) == 0)
2121 tryAMAGICbin_MG(ne_amg, AMGf_numeric);
2125 (SvIOK_notUV(left) && SvIOK_notUV(right))
2126 ? (SvIVX(left) != SvIVX(right))
2127 : (do_ncmp(left, right) != 0)
2132 /* compare left and right SVs. Returns:
2136 * 2: left or right was a NaN
2139 Perl_do_ncmp(pTHX_ SV* const left, SV * const right)
2141 PERL_ARGS_ASSERT_DO_NCMP;
2142 #ifdef PERL_PRESERVE_IVUV
2143 /* Fortunately it seems NaN isn't IOK */
2144 if (SvIV_please_nomg(right) && SvIV_please_nomg(left)) {
2146 const IV leftiv = SvIVX(left);
2147 if (!SvUOK(right)) {
2148 /* ## IV <=> IV ## */
2149 const IV rightiv = SvIVX(right);
2150 return (leftiv > rightiv) - (leftiv < rightiv);
2152 /* ## IV <=> UV ## */
2154 /* As (b) is a UV, it's >=0, so it must be < */
2157 const UV rightuv = SvUVX(right);
2158 return ((UV)leftiv > rightuv) - ((UV)leftiv < rightuv);
2163 /* ## UV <=> UV ## */
2164 const UV leftuv = SvUVX(left);
2165 const UV rightuv = SvUVX(right);
2166 return (leftuv > rightuv) - (leftuv < rightuv);
2168 /* ## UV <=> IV ## */
2170 const IV rightiv = SvIVX(right);
2172 /* As (a) is a UV, it's >=0, so it cannot be < */
2175 const UV leftuv = SvUVX(left);
2176 return (leftuv > (UV)rightiv) - (leftuv < (UV)rightiv);
2179 NOT_REACHED; /* NOTREACHED */
2183 NV const rnv = SvNV_nomg(right);
2184 NV const lnv = SvNV_nomg(left);
2186 #if defined(NAN_COMPARE_BROKEN) && defined(Perl_isnan)
2187 if (Perl_isnan(lnv) || Perl_isnan(rnv)) {
2190 return (lnv > rnv) - (lnv < rnv);
2209 tryAMAGICbin_MG(ncmp_amg, AMGf_numeric);
2212 value = do_ncmp(left, right);
2224 /* also used for: pp_sge() pp_sgt() pp_slt() */
2230 int amg_type = sle_amg;
2234 switch (PL_op->op_type) {
2253 tryAMAGICbin_MG(amg_type, 0);
2257 #ifdef USE_LOCALE_COLLATE
2258 (IN_LC_RUNTIME(LC_COLLATE))
2259 ? sv_cmp_locale_flags(left, right, 0)
2262 sv_cmp_flags(left, right, 0);
2263 SETs(boolSV(cmp * multiplier < rhs));
2271 tryAMAGICbin_MG(seq_amg, 0);
2274 SETs(boolSV(sv_eq_flags(left, right, 0)));
2282 tryAMAGICbin_MG(sne_amg, 0);
2285 SETs(boolSV(!sv_eq_flags(left, right, 0)));
2293 tryAMAGICbin_MG(scmp_amg, 0);
2297 #ifdef USE_LOCALE_COLLATE
2298 (IN_LC_RUNTIME(LC_COLLATE))
2299 ? sv_cmp_locale_flags(left, right, 0)
2302 sv_cmp_flags(left, right, 0);
2311 tryAMAGICbin_MG(band_amg, AMGf_assign);
2314 if (SvNIOKp(left) || SvNIOKp(right)) {
2315 const bool left_ro_nonnum = !SvNIOKp(left) && SvREADONLY(left);
2316 const bool right_ro_nonnum = !SvNIOKp(right) && SvREADONLY(right);
2317 if (PL_op->op_private & HINT_INTEGER) {
2318 const IV i = SvIV_nomg(left) & SvIV_nomg(right);
2322 const UV u = SvUV_nomg(left) & SvUV_nomg(right);
2325 if (left_ro_nonnum && left != TARG) SvNIOK_off(left);
2326 if (right_ro_nonnum) SvNIOK_off(right);
2329 do_vop(PL_op->op_type, TARG, left, right);
2339 tryAMAGICbin_MG(band_amg, AMGf_assign|AMGf_numarg);
2341 dATARGET; dPOPTOPssrl;
2342 if (PL_op->op_private & HINT_INTEGER) {
2343 const IV i = SvIV_nomg(left) & SvIV_nomg(right);
2347 const UV u = SvUV_nomg(left) & SvUV_nomg(right);
2357 tryAMAGICbin_MG(sband_amg, AMGf_assign);
2359 dATARGET; dPOPTOPssrl;
2360 do_vop(OP_BIT_AND, TARG, left, right);
2365 /* also used for: pp_bit_xor() */
2370 const int op_type = PL_op->op_type;
2372 tryAMAGICbin_MG((op_type == OP_BIT_OR ? bor_amg : bxor_amg), AMGf_assign);
2375 if (SvNIOKp(left) || SvNIOKp(right)) {
2376 const bool left_ro_nonnum = !SvNIOKp(left) && SvREADONLY(left);
2377 const bool right_ro_nonnum = !SvNIOKp(right) && SvREADONLY(right);
2378 if (PL_op->op_private & HINT_INTEGER) {
2379 const IV l = (USE_LEFT(left) ? SvIV_nomg(left) : 0);
2380 const IV r = SvIV_nomg(right);
2381 const IV result = op_type == OP_BIT_OR ? (l | r) : (l ^ r);
2385 const UV l = (USE_LEFT(left) ? SvUV_nomg(left) : 0);
2386 const UV r = SvUV_nomg(right);
2387 const UV result = op_type == OP_BIT_OR ? (l | r) : (l ^ r);
2390 if (left_ro_nonnum && left != TARG) SvNIOK_off(left);
2391 if (right_ro_nonnum) SvNIOK_off(right);
2394 do_vop(op_type, TARG, left, right);
2401 /* also used for: pp_nbit_xor() */
2406 const int op_type = PL_op->op_type;
2408 tryAMAGICbin_MG((op_type == OP_NBIT_OR ? bor_amg : bxor_amg),
2409 AMGf_assign|AMGf_numarg);
2411 dATARGET; dPOPTOPssrl;
2412 if (PL_op->op_private & HINT_INTEGER) {
2413 const IV l = (USE_LEFT(left) ? SvIV_nomg(left) : 0);
2414 const IV r = SvIV_nomg(right);
2415 const IV result = op_type == OP_NBIT_OR ? (l | r) : (l ^ r);
2419 const UV l = (USE_LEFT(left) ? SvUV_nomg(left) : 0);
2420 const UV r = SvUV_nomg(right);
2421 const UV result = op_type == OP_NBIT_OR ? (l | r) : (l ^ r);
2428 /* also used for: pp_sbit_xor() */
2433 const int op_type = PL_op->op_type;
2435 tryAMAGICbin_MG((op_type == OP_SBIT_OR ? sbor_amg : sbxor_amg),
2438 dATARGET; dPOPTOPssrl;
2439 do_vop(op_type == OP_SBIT_OR ? OP_BIT_OR : OP_BIT_XOR, TARG, left,
2445 PERL_STATIC_INLINE bool
2446 S_negate_string(pTHX)
2451 SV * const sv = TOPs;
2452 if (!SvPOKp(sv) || SvNIOK(sv) || (!SvPOK(sv) && SvNIOKp(sv)))
2454 s = SvPV_nomg_const(sv, len);
2455 if (isIDFIRST(*s)) {
2456 sv_setpvs(TARG, "-");
2459 else if (*s == '+' || (*s == '-' && !looks_like_number(sv))) {
2460 sv_setsv_nomg(TARG, sv);
2461 *SvPV_force_nomg(TARG, len) = *s == '-' ? '+' : '-';
2471 tryAMAGICun_MG(neg_amg, AMGf_numeric);
2472 if (S_negate_string(aTHX)) return NORMAL;
2474 SV * const sv = TOPs;
2477 /* It's publicly an integer */
2480 if (SvIVX(sv) == IV_MIN) {
2481 /* 2s complement assumption. */
2482 SETi(SvIVX(sv)); /* special case: -((UV)IV_MAX+1) ==
2486 else if (SvUVX(sv) <= IV_MAX) {
2491 else if (SvIVX(sv) != IV_MIN) {
2495 #ifdef PERL_PRESERVE_IVUV
2502 if (SvNIOKp(sv) && (SvNIOK(sv) || !SvPOK(sv)))
2503 SETn(-SvNV_nomg(sv));
2504 else if (SvPOKp(sv) && SvIV_please_nomg(sv))
2505 goto oops_its_an_int;
2507 SETn(-SvNV_nomg(sv));
2517 tryAMAGICun_MG(not_amg, 0);
2519 *PL_stack_sp = boolSV(!SvTRUE_nomg_NN(sv));
2524 S_scomplement(pTHX_ SV *targ, SV *sv)
2530 sv_copypv_nomg(TARG, sv);
2531 tmps = (U8*)SvPV_nomg(TARG, len);
2534 if (len && ! utf8_to_bytes(tmps, &len)) {
2535 Perl_croak(aTHX_ FATAL_ABOVE_FF_MSG, PL_op_desc[PL_op->op_type]);
2546 for ( ; anum && (unsigned long)tmps % sizeof(long); anum--, tmps++)
2549 for ( ; anum >= (I32)sizeof(long); anum -= (I32)sizeof(long), tmpl++)
2554 for ( ; anum > 0; anum--, tmps++)
2561 tryAMAGICun_MG(compl_amg, AMGf_numeric);
2565 if (PL_op->op_private & HINT_INTEGER) {
2566 const IV i = ~SvIV_nomg(sv);
2570 const UV u = ~SvUV_nomg(sv);
2575 S_scomplement(aTHX_ TARG, sv);
2585 tryAMAGICun_MG(compl_amg, AMGf_numeric|AMGf_numarg);
2588 if (PL_op->op_private & HINT_INTEGER) {
2589 const IV i = ~SvIV_nomg(sv);
2593 const UV u = ~SvUV_nomg(sv);
2603 tryAMAGICun_MG(scompl_amg, AMGf_numeric);
2606 S_scomplement(aTHX_ TARG, sv);
2612 /* integer versions of some of the above */
2617 tryAMAGICbin_MG(mult_amg, AMGf_assign);
2620 SETi( left * right );
2629 tryAMAGICbin_MG(div_amg, AMGf_assign);
2632 IV value = SvIV_nomg(right);
2634 DIE(aTHX_ "Illegal division by zero");
2635 num = SvIV_nomg(left);
2637 /* avoid FPE_INTOVF on some platforms when num is IV_MIN */
2641 value = num / value;
2649 /* This is the vanilla old i_modulo. */
2651 tryAMAGICbin_MG(modulo_amg, AMGf_assign);
2655 DIE(aTHX_ "Illegal modulus zero");
2656 /* avoid FPE_INTOVF on some platforms when left is IV_MIN */
2660 SETi( left % right );
2665 #if defined(__GLIBC__) && IVSIZE == 8 \
2666 && ( __GLIBC__ < 2 || (__GLIBC__ == 2 && __GLIBC_MINOR__ < 8))
2668 PP(pp_i_modulo_glibc_bugfix)
2670 /* This is the i_modulo with the workaround for the _moddi3 bug
2671 * in (at least) glibc 2.2.5 (the PERL_ABS() the workaround).
2672 * See below for pp_i_modulo. */
2674 tryAMAGICbin_MG(modulo_amg, AMGf_assign);
2678 DIE(aTHX_ "Illegal modulus zero");
2679 /* avoid FPE_INTOVF on some platforms when left is IV_MIN */
2683 SETi( left % PERL_ABS(right) );
2692 tryAMAGICbin_MG(add_amg, AMGf_assign);
2694 dPOPTOPiirl_ul_nomg;
2695 SETi( left + right );
2703 tryAMAGICbin_MG(subtr_amg, AMGf_assign);
2705 dPOPTOPiirl_ul_nomg;
2706 SETi( left - right );
2714 tryAMAGICbin_MG(lt_amg, 0);
2717 SETs(boolSV(left < right));
2725 tryAMAGICbin_MG(gt_amg, 0);
2728 SETs(boolSV(left > right));
2736 tryAMAGICbin_MG(le_amg, 0);
2739 SETs(boolSV(left <= right));
2747 tryAMAGICbin_MG(ge_amg, 0);
2750 SETs(boolSV(left >= right));
2758 tryAMAGICbin_MG(eq_amg, 0);
2761 SETs(boolSV(left == right));
2769 tryAMAGICbin_MG(ne_amg, 0);
2772 SETs(boolSV(left != right));
2780 tryAMAGICbin_MG(ncmp_amg, 0);
2787 else if (left < right)
2799 tryAMAGICun_MG(neg_amg, 0);
2800 if (S_negate_string(aTHX)) return NORMAL;
2802 SV * const sv = TOPs;
2803 IV const i = SvIV_nomg(sv);
2809 /* High falutin' math. */
2814 tryAMAGICbin_MG(atan2_amg, 0);
2817 SETn(Perl_atan2(left, right));
2823 /* also used for: pp_cos() pp_exp() pp_log() pp_sqrt() */
2828 int amg_type = fallback_amg;
2829 const char *neg_report = NULL;
2830 const int op_type = PL_op->op_type;
2833 case OP_SIN: amg_type = sin_amg; break;
2834 case OP_COS: amg_type = cos_amg; break;
2835 case OP_EXP: amg_type = exp_amg; break;
2836 case OP_LOG: amg_type = log_amg; neg_report = "log"; break;
2837 case OP_SQRT: amg_type = sqrt_amg; neg_report = "sqrt"; break;
2840 assert(amg_type != fallback_amg);
2842 tryAMAGICun_MG(amg_type, 0);
2844 SV * const arg = TOPs;
2845 const NV value = SvNV_nomg(arg);
2851 if (neg_report) { /* log or sqrt */
2853 #if defined(NAN_COMPARE_BROKEN) && defined(Perl_isnan)
2854 ! Perl_isnan(value) &&
2856 (op_type == OP_LOG ? (value <= 0.0) : (value < 0.0))) {
2857 SET_NUMERIC_STANDARD();
2858 /* diag_listed_as: Can't take log of %g */
2859 DIE(aTHX_ "Can't take %s of %" NVgf, neg_report, value);
2864 case OP_SIN: result = Perl_sin(value); break;
2865 case OP_COS: result = Perl_cos(value); break;
2866 case OP_EXP: result = Perl_exp(value); break;
2867 case OP_LOG: result = Perl_log(value); break;
2868 case OP_SQRT: result = Perl_sqrt(value); break;
2875 /* Support Configure command-line overrides for rand() functions.
2876 After 5.005, perhaps we should replace this by Configure support
2877 for drand48(), random(), or rand(). For 5.005, though, maintain
2878 compatibility by calling rand() but allow the user to override it.
2879 See INSTALL for details. --Andy Dougherty 15 July 1998
2881 /* Now it's after 5.005, and Configure supports drand48() and random(),
2882 in addition to rand(). So the overrides should not be needed any more.
2883 --Jarkko Hietaniemi 27 September 1998
2888 if (!PL_srand_called) {
2889 (void)seedDrand01((Rand_seed_t)seed());
2890 PL_srand_called = TRUE;
2902 SV * const sv = POPs;
2908 /* 1 of 2 things can be carried through SvNV, SP or TARG, SP was carried */
2909 #if defined(NAN_COMPARE_BROKEN) && defined(Perl_isnan)
2910 if (! Perl_isnan(value) && value == 0.0)
2920 sv_setnv_mg(TARG, value);
2931 if (MAXARG >= 1 && (TOPs || POPs)) {
2938 pv = SvPV(top, len);
2939 flags = grok_number(pv, len, &anum);
2941 if (!(flags & IS_NUMBER_IN_UV)) {
2942 Perl_ck_warner_d(aTHX_ packWARN(WARN_OVERFLOW),
2943 "Integer overflow in srand");
2951 (void)seedDrand01((Rand_seed_t)anum);
2952 PL_srand_called = TRUE;
2956 /* Historically srand always returned true. We can avoid breaking
2958 sv_setpvs(TARG, "0 but true");
2967 tryAMAGICun_MG(int_amg, AMGf_numeric);
2969 SV * const sv = TOPs;
2970 const IV iv = SvIV_nomg(sv);
2971 /* XXX it's arguable that compiler casting to IV might be subtly
2972 different from modf (for numbers inside (IV_MIN,UV_MAX)) in which
2973 else preferring IV has introduced a subtle behaviour change bug. OTOH
2974 relying on floating point to be accurate is a bug. */
2979 else if (SvIOK(sv)) {
2981 SETu(SvUV_nomg(sv));
2986 const NV value = SvNV_nomg(sv);
2987 if (UNLIKELY(Perl_isinfnan(value)))
2989 else if (value >= 0.0) {
2990 if (value < (NV)UV_MAX + 0.5) {
2993 SETn(Perl_floor(value));
2997 if (value > (NV)IV_MIN - 0.5) {
3000 SETn(Perl_ceil(value));
3011 tryAMAGICun_MG(abs_amg, AMGf_numeric);
3013 SV * const sv = TOPs;
3014 /* This will cache the NV value if string isn't actually integer */
3015 const IV iv = SvIV_nomg(sv);
3020 else if (SvIOK(sv)) {
3021 /* IVX is precise */
3023 SETu(SvUV_nomg(sv)); /* force it to be numeric only */
3031 /* 2s complement assumption. Also, not really needed as
3032 IV_MIN and -IV_MIN should both be %100...00 and NV-able */
3038 const NV value = SvNV_nomg(sv);
3049 /* also used for: pp_hex() */
3055 I32 flags = PERL_SCAN_ALLOW_UNDERSCORES;
3059 SV* const sv = TOPs;
3061 tmps = (SvPV_const(sv, len));
3063 /* If Unicode, try to downgrade
3064 * If not possible, croak. */
3065 SV* const tsv = sv_2mortal(newSVsv(sv));
3068 sv_utf8_downgrade(tsv, FALSE);
3069 tmps = SvPV_const(tsv, len);
3071 if (PL_op->op_type == OP_HEX)
3074 while (*tmps && len && isSPACE(*tmps))
3078 if (isALPHA_FOLD_EQ(*tmps, 'x')) {
3080 result_uv = grok_hex (tmps, &len, &flags, &result_nv);
3082 else if (isALPHA_FOLD_EQ(*tmps, 'b'))
3083 result_uv = grok_bin (tmps, &len, &flags, &result_nv);
3085 result_uv = grok_oct (tmps, &len, &flags, &result_nv);
3087 if (flags & PERL_SCAN_GREATER_THAN_UV_MAX) {
3102 SV * const sv = TOPs;
3104 U32 in_bytes = IN_BYTES;
3105 /* Simplest case shortcut:
3106 * set svflags to just the SVf_POK|SVs_GMG|SVf_UTF8 from the SV,
3107 * with the SVf_UTF8 flag inverted if under 'use bytes' (HINT_BYTES
3110 U32 svflags = (SvFLAGS(sv) ^ (in_bytes << 26)) & (SVf_POK|SVs_GMG|SVf_UTF8);
3112 STATIC_ASSERT_STMT(SVf_UTF8 == (HINT_BYTES << 26));
3115 if (LIKELY(svflags == SVf_POK))
3118 if (svflags & SVs_GMG)
3123 if (!IN_BYTES) { /* reread to avoid using an C auto/register */
3124 if ((SvFLAGS(sv) & (SVf_POK|SVf_UTF8)) == SVf_POK)
3126 if ( SvPOK(sv) && (PL_op->op_private & OPpTRUEBOOL)) {
3127 /* no need to convert from bytes to chars */
3131 len = sv_len_utf8_nomg(sv);
3134 /* unrolled SvPV_nomg_const(sv,len) */
3135 if (SvPOK_nog(sv)) {
3138 if (PL_op->op_private & OPpTRUEBOOL) {
3140 SETs(len ? &PL_sv_yes : &PL_sv_zero);
3145 (void)sv_2pv_flags(sv, &len, 0|SV_CONST_RETURN);
3148 TARGi((IV)(len), 1);
3151 if (!SvPADTMP(TARG)) {
3152 /* OPpTARGET_MY: targ is var in '$lex = length()' */
3157 /* TARG is on stack at this point and is overwriten by SETs.
3158 * This branch is the odd one out, so put TARG by default on
3159 * stack earlier to let local SP go out of liveness sooner */
3162 return NORMAL; /* no putback, SP didn't move in this opcode */
3166 /* Returns false if substring is completely outside original string.
3167 No length is indicated by len_iv = 0 and len_is_uv = 0. len_is_uv must
3168 always be true for an explicit 0.
3171 Perl_translate_substr_offsets( STRLEN curlen, IV pos1_iv,
3172 bool pos1_is_uv, IV len_iv,
3173 bool len_is_uv, STRLEN *posp,
3179 PERL_ARGS_ASSERT_TRANSLATE_SUBSTR_OFFSETS;
3181 if (!pos1_is_uv && pos1_iv < 0 && curlen) {
3182 pos1_is_uv = curlen-1 > ~(UV)pos1_iv;
3185 if ((pos1_is_uv || pos1_iv > 0) && (UV)pos1_iv > curlen)
3188 if (len_iv || len_is_uv) {
3189 if (!len_is_uv && len_iv < 0) {
3190 pos2_iv = curlen + len_iv;
3192 pos2_is_uv = curlen-1 > ~(UV)len_iv;
3195 } else { /* len_iv >= 0 */
3196 if (!pos1_is_uv && pos1_iv < 0) {
3197 pos2_iv = pos1_iv + len_iv;
3198 pos2_is_uv = (UV)len_iv > (UV)IV_MAX;
3200 if ((UV)len_iv > curlen-(UV)pos1_iv)
3203 pos2_iv = pos1_iv+len_iv;
3213 if (!pos2_is_uv && pos2_iv < 0) {
3214 if (!pos1_is_uv && pos1_iv < 0)
3218 else if (!pos1_is_uv && pos1_iv < 0)
3221 if ((UV)pos2_iv < (UV)pos1_iv)
3223 if ((UV)pos2_iv > curlen)
3226 /* pos1_iv and pos2_iv both in 0..curlen, so the cast is safe */
3227 *posp = (STRLEN)( (UV)pos1_iv );
3228 *lenp = (STRLEN)( (UV)pos2_iv - (UV)pos1_iv );
3245 I32 lvalue = PL_op->op_flags & OPf_MOD || LVRET;
3246 const bool rvalue = (GIMME_V != G_VOID);
3249 const char *repl = NULL;
3251 int num_args = PL_op->op_private & 7;
3252 bool repl_need_utf8_upgrade = FALSE;
3256 if(!(repl_sv = POPs)) num_args--;
3258 if ((len_sv = POPs)) {
3259 len_iv = SvIV(len_sv);
3260 len_is_uv = len_iv ? SvIOK_UV(len_sv) : 1;
3265 pos1_iv = SvIV(pos_sv);
3266 pos1_is_uv = SvIOK_UV(pos_sv);
3268 if (PL_op->op_private & OPpSUBSTR_REPL_FIRST) {
3272 if (lvalue && !repl_sv) {
3274 ret = sv_2mortal(newSV_type(SVt_PVLV)); /* Not TARG RT#67838 */
3275 sv_magic(ret, NULL, PERL_MAGIC_substr, NULL, 0);
3277 LvTARG(ret) = SvREFCNT_inc_simple(sv);
3279 pos1_is_uv || pos1_iv >= 0
3280 ? (STRLEN)(UV)pos1_iv
3281 : (LvFLAGS(ret) |= LVf_NEG_OFF, (STRLEN)(UV)-pos1_iv);
3283 len_is_uv || len_iv > 0
3284 ? (STRLEN)(UV)len_iv
3285 : (LvFLAGS(ret) |= LVf_NEG_LEN, (STRLEN)(UV)-len_iv);
3287 PUSHs(ret); /* avoid SvSETMAGIC here */
3291 repl = SvPV_const(repl_sv, repl_len);
3294 Perl_ck_warner(aTHX_ packWARN(WARN_SUBSTR),
3295 "Attempt to use reference as lvalue in substr"
3297 tmps = SvPV_force_nomg(sv, curlen);
3298 if (DO_UTF8(repl_sv) && repl_len) {
3300 /* Upgrade the dest, and recalculate tmps in case the buffer
3301 * got reallocated; curlen may also have been changed */
3302 sv_utf8_upgrade_nomg(sv);
3303 tmps = SvPV_nomg(sv, curlen);
3306 else if (DO_UTF8(sv))
3307 repl_need_utf8_upgrade = TRUE;
3309 else tmps = SvPV_const(sv, curlen);
3311 utf8_curlen = sv_or_pv_len_utf8(sv, tmps, curlen);
3312 if (utf8_curlen == curlen)
3315 curlen = utf8_curlen;
3321 STRLEN pos, len, byte_len, byte_pos;
3323 if (!translate_substr_offsets(
3324 curlen, pos1_iv, pos1_is_uv, len_iv, len_is_uv, &pos, &len
3328 byte_pos = utf8_curlen
3329 ? sv_or_pv_pos_u2b(sv, tmps, pos, &byte_len) : pos;
3334 SvTAINTED_off(TARG); /* decontaminate */
3335 SvUTF8_off(TARG); /* decontaminate */
3336 sv_setpvn(TARG, tmps, byte_len);
3337 #ifdef USE_LOCALE_COLLATE
3338 sv_unmagic(TARG, PERL_MAGIC_collxfrm);
3345 SV* repl_sv_copy = NULL;
3347 if (repl_need_utf8_upgrade) {
3348 repl_sv_copy = newSVsv(repl_sv);
3349 sv_utf8_upgrade(repl_sv_copy);
3350 repl = SvPV_const(repl_sv_copy, repl_len);
3354 sv_insert_flags(sv, byte_pos, byte_len, repl, repl_len, 0);
3355 SvREFCNT_dec(repl_sv_copy);
3358 if (PL_op->op_private & OPpSUBSTR_REPL_FIRST)
3368 Perl_croak(aTHX_ "substr outside of string");
3369 Perl_ck_warner(aTHX_ packWARN(WARN_SUBSTR), "substr outside of string");
3376 const IV size = POPi;
3377 SV* offsetsv = POPs;
3378 SV * const src = POPs;
3379 const I32 lvalue = PL_op->op_flags & OPf_MOD || LVRET;
3385 /* extract a STRLEN-ranged integer value from offsetsv into offset,
3386 * or flag that its out of range */
3388 IV iv = SvIV(offsetsv);
3390 /* avoid a large UV being wrapped to a negative value */
3391 if (SvIOK_UV(offsetsv) && SvUVX(offsetsv) > (UV)IV_MAX)
3392 errflags = LVf_OUT_OF_RANGE;
3394 errflags = (LVf_NEG_OFF|LVf_OUT_OF_RANGE);
3395 #if PTRSIZE < IVSIZE
3396 else if (iv > Size_t_MAX)
3397 errflags = LVf_OUT_OF_RANGE;
3400 offset = (STRLEN)iv;
3403 retuv = errflags ? 0 : do_vecget(src, offset, size);
3405 if (lvalue) { /* it's an lvalue! */
3406 ret = sv_2mortal(newSV_type(SVt_PVLV)); /* Not TARG RT#67838 */
3407 sv_magic(ret, NULL, PERL_MAGIC_vec, NULL, 0);
3409 LvTARG(ret) = SvREFCNT_inc_simple(src);
3410 LvTARGOFF(ret) = offset;
3411 LvTARGLEN(ret) = size;
3412 LvFLAGS(ret) = errflags;
3416 SvTAINTED_off(TARG); /* decontaminate */
3420 sv_setuv(ret, retuv);
3428 /* also used for: pp_rindex() */
3441 const char *little_p;
3444 const bool is_index = PL_op->op_type == OP_INDEX;
3445 const bool threeargs = MAXARG >= 3 && (TOPs || ((void)POPs,0));
3451 big_p = SvPV_const(big, biglen);
3452 little_p = SvPV_const(little, llen);
3454 big_utf8 = DO_UTF8(big);
3455 little_utf8 = DO_UTF8(little);
3456 if (big_utf8 ^ little_utf8) {
3457 /* One needs to be upgraded. */
3459 /* Well, maybe instead we might be able to downgrade the small
3461 char * const pv = (char*)bytes_from_utf8((U8 *)little_p, &llen,
3464 /* If the large string is ISO-8859-1, and it's not possible to
3465 convert the small string to ISO-8859-1, then there is no
3466 way that it could be found anywhere by index. */
3471 /* At this point, pv is a malloc()ed string. So donate it to temp
3472 to ensure it will get free()d */
3473 little = temp = newSV(0);
3474 sv_usepvn(temp, pv, llen);
3475 little_p = SvPVX(little);
3477 temp = newSVpvn(little_p, llen);
3479 sv_utf8_upgrade(temp);
3481 little_p = SvPV_const(little, llen);
3484 if (SvGAMAGIC(big)) {
3485 /* Life just becomes a lot easier if I use a temporary here.
3486 Otherwise I need to avoid calls to sv_pos_u2b(), which (dangerously)
3487 will trigger magic and overloading again, as will fbm_instr()
3489 big = newSVpvn_flags(big_p, biglen,
3490 SVs_TEMP | (big_utf8 ? SVf_UTF8 : 0));
3493 if (SvGAMAGIC(little) || (is_index && !SvOK(little))) {
3494 /* index && SvOK() is a hack. fbm_instr() calls SvPV_const, which will
3495 warn on undef, and we've already triggered a warning with the
3496 SvPV_const some lines above. We can't remove that, as we need to
3497 call some SvPV to trigger overloading early and find out if the
3499 This is all getting too messy. The API isn't quite clean enough,
3500 because data access has side effects.
3502 little = newSVpvn_flags(little_p, llen,
3503 SVs_TEMP | (little_utf8 ? SVf_UTF8 : 0));
3504 little_p = SvPVX(little);
3508 offset = is_index ? 0 : biglen;
3510 if (big_utf8 && offset > 0)
3511 offset = sv_pos_u2b_flags(big, offset, 0, SV_CONST_RETURN);
3517 else if (offset > (SSize_t)biglen)
3519 if (!(little_p = is_index
3520 ? fbm_instr((unsigned char*)big_p + offset,
3521 (unsigned char*)big_p + biglen, little, 0)
3522 : rninstr(big_p, big_p + offset,
3523 little_p, little_p + llen)))
3526 retval = little_p - big_p;
3527 if (retval > 1 && big_utf8)
3528 retval = sv_pos_b2u_flags(big, retval, SV_CONST_RETURN);
3533 /* OPpTRUEBOOL indicates an '== -1' has been optimised away */
3534 if (PL_op->op_private & OPpTRUEBOOL) {
3535 PUSHs( ((retval != -1) ^ cBOOL(PL_op->op_private & OPpINDEX_BOOLNEG))
3536 ? &PL_sv_yes : &PL_sv_no);
3537 if (PL_op->op_private & OPpTARGET_MY)
3538 /* $lex = (index() == -1) */
3539 sv_setsv(TARG, TOPs);
3548 dSP; dMARK; dORIGMARK; dTARGET;
3549 SvTAINTED_off(TARG);
3550 do_sprintf(TARG, SP-MARK, MARK+1);
3551 TAINT_IF(SvTAINTED(TARG));
3563 const U8 *s = (U8*)SvPV_const(argsv, len);
3566 ? (len ? utf8n_to_uvchr(s, len, 0, UTF8_ALLOW_ANYUV) : 0)
3580 if (UNLIKELY(SvAMAGIC(top)))
3582 if (UNLIKELY(isinfnansv(top)))
3583 Perl_croak(aTHX_ "Cannot chr %" NVgf, SvNV(top));
3585 if (!IN_BYTES /* under bytes, chr(-1) eq chr(0xff), etc. */
3586 && ((SvIOKp(top) && !SvIsUV(top) && SvIV_nomg(top) < 0)
3588 ((SvNOKp(top) || (SvOK(top) && !SvIsUV(top)))
3589 && SvNV_nomg(top) < 0.0)))
3591 if (ckWARN(WARN_UTF8)) {
3592 if (SvGMAGICAL(top)) {
3593 SV *top2 = sv_newmortal();
3594 sv_setsv_nomg(top2, top);
3597 Perl_warner(aTHX_ packWARN(WARN_UTF8),
3598 "Invalid negative number (%" SVf ") in chr", SVfARG(top));
3600 value = UNICODE_REPLACEMENT;
3602 value = SvUV_nomg(top);
3606 SvUPGRADE(TARG,SVt_PV);
3608 if (value > 255 && !IN_BYTES) {
3609 SvGROW(TARG, (STRLEN)UVCHR_SKIP(value)+1);
3610 tmps = (char*)uvchr_to_utf8_flags((U8*)SvPVX(TARG), value, 0);
3611 SvCUR_set(TARG, tmps - SvPVX_const(TARG));
3613 (void)SvPOK_only(TARG);
3622 *tmps++ = (char)value;
3624 (void)SvPOK_only(TARG);
3636 const char *tmps = SvPV_const(left, len);
3638 if (DO_UTF8(left)) {
3639 /* If Unicode, try to downgrade.
3640 * If not possible, croak.
3641 * Yes, we made this up. */
3642 SV* const tsv = newSVpvn_flags(tmps, len, SVf_UTF8|SVs_TEMP);
3644 sv_utf8_downgrade(tsv, FALSE);
3645 tmps = SvPV_const(tsv, len);
3647 # ifdef USE_ITHREADS
3649 if (!PL_reentrant_buffer->_crypt_struct_buffer) {
3650 /* This should be threadsafe because in ithreads there is only
3651 * one thread per interpreter. If this would not be true,
3652 * we would need a mutex to protect this malloc. */
3653 PL_reentrant_buffer->_crypt_struct_buffer =
3654 (struct crypt_data *)safemalloc(sizeof(struct crypt_data));
3655 #if defined(__GLIBC__) || defined(__EMX__)
3656 if (PL_reentrant_buffer->_crypt_struct_buffer) {
3657 PL_reentrant_buffer->_crypt_struct_buffer->initialized = 0;
3658 #if (defined(__GLIBC__) && __GLIBC__ == 2) && \
3659 (defined(__GLIBC_MINOR__) && __GLIBC_MINOR__ >= 2 && __GLIBC_MINOR__ < 4)
3660 /* work around glibc-2.2.5 bug, has been fixed at some
3661 * time in glibc-2.3.X */
3662 PL_reentrant_buffer->_crypt_struct_buffer->current_saltbits = 0;
3667 # endif /* HAS_CRYPT_R */
3668 # endif /* USE_ITHREADS */
3670 sv_setpv(TARG, fcrypt(tmps, SvPV_nolen_const(right)));
3672 sv_setpv(TARG, PerlProc_crypt(tmps, SvPV_nolen_const(right)));
3679 "The crypt() function is unimplemented due to excessive paranoia.");
3683 /* Generally UTF-8 and UTF-EBCDIC are indistinguishable at this level. So
3684 * most comments below say UTF-8, when in fact they mean UTF-EBCDIC as well */
3687 /* also used for: pp_lcfirst() */
3691 /* Actually is both lcfirst() and ucfirst(). Only the first character
3692 * changes. This means that possibly we can change in-place, ie., just
3693 * take the source and change that one character and store it back, but not
3694 * if read-only etc, or if the length changes */
3698 STRLEN slen; /* slen is the byte length of the whole SV. */
3701 bool inplace; /* ? Convert first char only, in-place */
3702 bool doing_utf8 = FALSE; /* ? using utf8 */
3703 bool convert_source_to_utf8 = FALSE; /* ? need to convert */
3704 const int op_type = PL_op->op_type;
3707 U8 tmpbuf[UTF8_MAXBYTES_CASE+1];
3708 STRLEN ulen; /* ulen is the byte length of the original Unicode character
3709 * stored as UTF-8 at s. */
3710 STRLEN tculen; /* tculen is the byte length of the freshly titlecased (or
3711 * lowercased) character stored in tmpbuf. May be either
3712 * UTF-8 or not, but in either case is the number of bytes */
3713 bool remove_dot_above = FALSE;
3715 s = (const U8*)SvPV_const(source, slen);
3717 /* We may be able to get away with changing only the first character, in
3718 * place, but not if read-only, etc. Later we may discover more reasons to
3719 * not convert in-place. */
3720 inplace = !SvREADONLY(source) && SvPADTMP(source);
3722 #ifdef USE_LOCALE_CTYPE
3724 if (IN_LC_RUNTIME(LC_CTYPE)) {
3725 _CHECK_AND_WARN_PROBLEMATIC_LOCALE;
3730 /* First calculate what the changed first character should be. This affects
3731 * whether we can just swap it out, leaving the rest of the string unchanged,
3732 * or even if have to convert the dest to UTF-8 when the source isn't */
3734 if (! slen) { /* If empty */
3735 need = 1; /* still need a trailing NUL */
3739 else if (DO_UTF8(source)) { /* Is the source utf8? */
3742 if (op_type == OP_UCFIRST) {
3743 #ifdef USE_LOCALE_CTYPE
3744 _toTITLE_utf8_flags(s, s +slen, tmpbuf, &tculen, IN_LC_RUNTIME(LC_CTYPE));
3746 _toTITLE_utf8_flags(s, s +slen, tmpbuf, &tculen, 0);
3751 #ifdef USE_LOCALE_CTYPE
3753 _toLOWER_utf8_flags(s, s + slen, tmpbuf, &tculen, IN_LC_RUNTIME(LC_CTYPE));
3755 /* In turkic locales, lower casing an 'I' normally yields U+0131,
3756 * LATIN SMALL LETTER DOTLESS I, but not if the grapheme also
3757 * contains a COMBINING DOT ABOVE. Instead it is treated like
3758 * LATIN CAPITAL LETTER I WITH DOT ABOVE lowercased to 'i'. The
3759 * call to lowercase above has handled this. But SpecialCasing.txt
3760 * says we are supposed to remove the COMBINING DOT ABOVE. We can
3761 * tell if we have this situation if I ==> i in a turkic locale. */
3762 if ( UNLIKELY(PL_in_utf8_turkic_locale)
3763 && IN_LC_RUNTIME(LC_CTYPE)
3764 && (UNLIKELY(*s == 'I' && tmpbuf[0] == 'i')))
3766 /* Here, we know there was a COMBINING DOT ABOVE. We won't be
3767 * able to handle this in-place. */
3770 /* It seems likely that the DOT will immediately follow the
3771 * 'I'. If so, we can remove it simply by indicating to the
3772 * code below to start copying the source just beyond the DOT.
3773 * We know its length is 2 */
3774 if (LIKELY(memBEGINs(s + 1, s + slen, COMBINING_DOT_ABOVE_UTF8))) {
3777 else { /* But if it doesn't follow immediately, set a flag for
3779 remove_dot_above = TRUE;
3783 PERL_UNUSED_VAR(remove_dot_above);
3785 _toLOWER_utf8_flags(s, s + slen, tmpbuf, &tculen, 0);
3790 /* we can't do in-place if the length changes. */
3791 if (ulen != tculen) inplace = FALSE;
3792 need = slen + 1 - ulen + tculen;
3794 else { /* Non-zero length, non-UTF-8, Need to consider locale and if
3795 * latin1 is treated as caseless. Note that a locale takes
3797 ulen = 1; /* Original character is 1 byte */
3798 tculen = 1; /* Most characters will require one byte, but this will
3799 * need to be overridden for the tricky ones */
3803 #ifdef USE_LOCALE_CTYPE
3805 if (IN_LC_RUNTIME(LC_CTYPE)) {
3806 if ( UNLIKELY(PL_in_utf8_turkic_locale)
3807 && ( (op_type == OP_LCFIRST && UNLIKELY(*s == 'I'))
3808 || (op_type == OP_UCFIRST && UNLIKELY(*s == 'i'))))
3810 if (*s == 'I') { /* lcfirst('I') */
3811 tmpbuf[0] = UTF8_TWO_BYTE_HI(LATIN_SMALL_LETTER_DOTLESS_I);
3812 tmpbuf[1] = UTF8_TWO_BYTE_LO(LATIN_SMALL_LETTER_DOTLESS_I);
3814 else { /* ucfirst('i') */
3815 tmpbuf[0] = UTF8_TWO_BYTE_HI(LATIN_CAPITAL_LETTER_I_WITH_DOT_ABOVE);
3816 tmpbuf[1] = UTF8_TWO_BYTE_LO(LATIN_CAPITAL_LETTER_I_WITH_DOT_ABOVE);
3821 convert_source_to_utf8 = TRUE;
3822 need += variant_under_utf8_count(s, s + slen);
3824 else if (op_type == OP_LCFIRST) {
3826 /* For lc, there are no gotchas for UTF-8 locales (other than
3827 * the turkish ones already handled above) */
3828 *tmpbuf = toLOWER_LC(*s);
3830 else { /* ucfirst */
3832 /* But for uc, some characters require special handling */
3833 if (IN_UTF8_CTYPE_LOCALE) {
3837 /* This would be a bug if any locales have upper and title case
3839 *tmpbuf = (U8) toUPPER_LC(*s);
3844 /* Here, not in locale. If not using Unicode rules, is a simple
3845 * lower/upper, depending */
3846 if (! IN_UNI_8_BIT) {
3847 *tmpbuf = (op_type == OP_LCFIRST)
3851 else if (op_type == OP_LCFIRST) {
3852 /* lower case the first letter: no trickiness for any character */
3853 *tmpbuf = toLOWER_LATIN1(*s);
3856 /* Here, is ucfirst non-UTF-8, not in locale (unless that locale is
3857 * non-turkic UTF-8, which we treat as not in locale), and cased
3860 #ifdef USE_LOCALE_CTYPE
3864 title_ord = _to_upper_title_latin1(*s, tmpbuf, &tculen, 's');
3866 assert(tculen == 2);
3868 /* If the result is an upper Latin1-range character, it can
3869 * still be represented in one byte, which is its ordinal */
3870 if (UTF8_IS_DOWNGRADEABLE_START(*tmpbuf)) {
3871 *tmpbuf = (U8) title_ord;
3875 /* Otherwise it became more than one ASCII character (in
3876 * the case of LATIN_SMALL_LETTER_SHARP_S) or changed to
3877 * beyond Latin1, so the number of bytes changed, so can't
3878 * replace just the first character in place. */
3881 /* If the result won't fit in a byte, the entire result
3882 * will have to be in UTF-8. Allocate enough space for the
3883 * expanded first byte, and if UTF-8, the rest of the input
3884 * string, some or all of which may also expand to two
3885 * bytes, plus the terminating NUL. */
3886 if (title_ord > 255) {
3888 convert_source_to_utf8 = TRUE;
3890 + variant_under_utf8_count(s, s + slen)
3893 /* The (converted) UTF-8 and UTF-EBCDIC lengths of all
3894 * characters whose title case is above 255 is
3898 else { /* LATIN_SMALL_LETTER_SHARP_S expands by 1 byte */
3899 need = slen + 1 + 1;
3903 } /* End of use Unicode (Latin1) semantics */
3904 } /* End of changing the case of the first character */
3906 /* Here, have the first character's changed case stored in tmpbuf. Ready to
3907 * generate the result */
3910 /* We can convert in place. This means we change just the first
3911 * character without disturbing the rest; no need to grow */
3913 s = d = (U8*)SvPV_force_nomg(source, slen);
3919 /* Here, we can't convert in place; we earlier calculated how much
3920 * space we will need, so grow to accommodate that */
3921 SvUPGRADE(dest, SVt_PV);
3922 d = (U8*)SvGROW(dest, need);
3923 (void)SvPOK_only(dest);
3930 if (! convert_source_to_utf8) {
3932 /* Here both source and dest are in UTF-8, but have to create
3933 * the entire output. We initialize the result to be the
3934 * title/lower cased first character, and then append the rest
3936 sv_setpvn(dest, (char*)tmpbuf, tculen);
3939 /* But this boolean being set means we are in a turkic
3940 * locale, and there is a DOT character that needs to be
3941 * removed, and it isn't immediately after the current
3942 * character. Keep concatenating characters to the output
3943 * one at a time, until we find the DOT, which we simply
3945 if (UNLIKELY(remove_dot_above)) {
3947 Size_t this_len = UTF8SKIP(s + ulen);
3949 sv_catpvn(dest, (char*)(s + ulen), this_len);
3952 if (memBEGINs(s + ulen, s + slen, COMBINING_DOT_ABOVE_UTF8)) {
3956 } while (s + ulen < s + slen);
3959 /* The rest of the string can be concatenated unchanged,
3961 sv_catpvn(dest, (char*)(s + ulen), slen - ulen);
3965 const U8 *const send = s + slen;
3967 /* Here the dest needs to be in UTF-8, but the source isn't,
3968 * except we earlier UTF-8'd the first character of the source
3969 * into tmpbuf. First put that into dest, and then append the
3970 * rest of the source, converting it to UTF-8 as we go. */
3972 /* Assert tculen is 2 here because the only characters that
3973 * get to this part of the code have 2-byte UTF-8 equivalents */
3974 assert(tculen == 2);
3976 *d++ = *(tmpbuf + 1);
3977 s++; /* We have just processed the 1st char */
3980 append_utf8_from_native_byte(*s, &d);
3985 SvCUR_set(dest, d - (U8*)SvPVX_const(dest));
3989 else { /* in-place UTF-8. Just overwrite the first character */
3990 Copy(tmpbuf, d, tculen, U8);
3991 SvCUR_set(dest, need - 1);
3995 else { /* Neither source nor dest are, nor need to be UTF-8 */
3997 if (inplace) { /* in-place, only need to change the 1st char */
4000 else { /* Not in-place */
4002 /* Copy the case-changed character(s) from tmpbuf */
4003 Copy(tmpbuf, d, tculen, U8);
4004 d += tculen - 1; /* Code below expects d to point to final
4005 * character stored */
4008 else { /* empty source */
4009 /* See bug #39028: Don't taint if empty */
4013 /* In a "use bytes" we don't treat the source as UTF-8, but, still want
4014 * the destination to retain that flag */
4015 if (SvUTF8(source) && ! IN_BYTES)
4018 if (!inplace) { /* Finish the rest of the string, unchanged */
4019 /* This will copy the trailing NUL */
4020 Copy(s + 1, d + 1, slen, U8);
4021 SvCUR_set(dest, need - 1);
4024 #ifdef USE_LOCALE_CTYPE
4025 if (IN_LC_RUNTIME(LC_CTYPE)) {
4030 if (dest != source && SvTAINTED(source))
4049 if ( SvPADTMP(source)
4050 && !SvREADONLY(source) && SvPOK(source)
4053 #ifdef USE_LOCALE_CTYPE
4054 (IN_LC_RUNTIME(LC_CTYPE))
4055 ? ! IN_UTF8_CTYPE_LOCALE
4061 /* We can convert in place. The reason we can't if in UNI_8_BIT is to
4062 * make the loop tight, so we overwrite the source with the dest before
4063 * looking at it, and we need to look at the original source
4064 * afterwards. There would also need to be code added to handle
4065 * switching to not in-place in midstream if we run into characters
4066 * that change the length. Since being in locale overrides UNI_8_BIT,
4067 * that latter becomes irrelevant in the above test; instead for
4068 * locale, the size can't normally change, except if the locale is a
4071 s = d = (U8*)SvPV_force_nomg(source, len);
4078 s = (const U8*)SvPV_nomg_const(source, len);
4081 SvUPGRADE(dest, SVt_PV);
4082 d = (U8*)SvGROW(dest, min);
4083 (void)SvPOK_only(dest);
4088 #ifdef USE_LOCALE_CTYPE
4090 if (IN_LC_RUNTIME(LC_CTYPE)) {
4091 _CHECK_AND_WARN_PROBLEMATIC_LOCALE;
4096 /* Overloaded values may have toggled the UTF-8 flag on source, so we need
4097 to check DO_UTF8 again here. */
4099 if (DO_UTF8(source)) {
4100 const U8 *const send = s + len;
4101 U8 tmpbuf[UTF8_MAXBYTES_CASE+1];
4103 #define GREEK_CAPITAL_LETTER_IOTA 0x0399
4104 #define COMBINING_GREEK_YPOGEGRAMMENI 0x0345
4105 /* All occurrences of these are to be moved to follow any other marks.
4106 * This is context-dependent. We may not be passed enough context to
4107 * move the iota subscript beyond all of them, but we do the best we can
4108 * with what we're given. The result is always better than if we
4109 * hadn't done this. And, the problem would only arise if we are
4110 * passed a character without all its combining marks, which would be
4111 * the caller's mistake. The information this is based on comes from a
4112 * comment in Unicode SpecialCasing.txt, (and the Standard's text
4113 * itself) and so can't be checked properly to see if it ever gets
4114 * revised. But the likelihood of it changing is remote */
4115 bool in_iota_subscript = FALSE;
4121 if (UNLIKELY(in_iota_subscript)) {
4122 UV cp = utf8_to_uvchr_buf(s, send, NULL);
4124 if (! _invlist_contains_cp(PL_utf8_mark, cp)) {
4126 /* A non-mark. Time to output the iota subscript */
4127 *d++ = UTF8_TWO_BYTE_HI(GREEK_CAPITAL_LETTER_IOTA);
4128 *d++ = UTF8_TWO_BYTE_LO(GREEK_CAPITAL_LETTER_IOTA);
4129 in_iota_subscript = FALSE;
4133 /* Then handle the current character. Get the changed case value
4134 * and copy it to the output buffer */
4137 #ifdef USE_LOCALE_CTYPE
4138 uv = _toUPPER_utf8_flags(s, send, tmpbuf, &ulen, IN_LC_RUNTIME(LC_CTYPE));
4140 uv = _toUPPER_utf8_flags(s, send, tmpbuf, &ulen, 0);
4142 if (uv == GREEK_CAPITAL_LETTER_IOTA
4143 && utf8_to_uvchr_buf(s, send, 0) == COMBINING_GREEK_YPOGEGRAMMENI)
4145 in_iota_subscript = TRUE;
4148 if (ulen > u && (SvLEN(dest) < (min += ulen - u))) {
4149 /* If the eventually required minimum size outgrows the
4150 * available space, we need to grow. */
4151 const UV o = d - (U8*)SvPVX_const(dest);
4153 /* If someone uppercases one million U+03B0s we SvGROW()
4154 * one million times. Or we could try guessing how much to
4155 * allocate without allocating too much. But we can't
4156 * really guess without examining the rest of the string.
4157 * Such is life. See corresponding comment in lc code for
4159 d = o + (U8*) SvGROW(dest, min);
4161 Copy(tmpbuf, d, ulen, U8);
4166 if (in_iota_subscript) {
4167 *d++ = UTF8_TWO_BYTE_HI(GREEK_CAPITAL_LETTER_IOTA);
4168 *d++ = UTF8_TWO_BYTE_LO(GREEK_CAPITAL_LETTER_IOTA);
4173 SvCUR_set(dest, d - (U8*)SvPVX_const(dest));
4175 else { /* Not UTF-8 */
4177 const U8 *const send = s + len;
4179 /* Use locale casing if in locale; regular style if not treating
4180 * latin1 as having case; otherwise the latin1 casing. Do the
4181 * whole thing in a tight loop, for speed, */
4182 #ifdef USE_LOCALE_CTYPE
4183 if (IN_LC_RUNTIME(LC_CTYPE)) {
4184 if (IN_UTF8_CTYPE_LOCALE) {
4187 for (; s < send; d++, s++)
4188 *d = (U8) toUPPER_LC(*s);
4192 if (! IN_UNI_8_BIT) {
4193 for (; s < send; d++, s++) {
4198 #ifdef USE_LOCALE_CTYPE
4201 for (; s < send; d++, s++) {
4204 *d = toUPPER_LATIN1_MOD(*s);
4205 if ( LIKELY(*d != LATIN_SMALL_LETTER_Y_WITH_DIAERESIS)
4207 #ifdef USE_LOCALE_CTYPE
4209 && (LIKELY( ! PL_in_utf8_turkic_locale
4210 || ! IN_LC_RUNTIME(LC_CTYPE))
4218 /* The mainstream case is the tight loop above. To avoid
4219 * extra tests in that, all three characters that always
4220 * require special handling are mapped by the MOD to the
4221 * one tested just above. Use the source to distinguish
4222 * between those cases */
4224 #if UNICODE_MAJOR_VERSION > 2 \
4225 || (UNICODE_MAJOR_VERSION == 2 && UNICODE_DOT_VERSION >= 1 \
4226 && UNICODE_DOT_DOT_VERSION >= 8)
4227 if (*s == LATIN_SMALL_LETTER_SHARP_S) {
4229 /* uc() of this requires 2 characters, but they are
4230 * ASCII. If not enough room, grow the string */
4231 if (SvLEN(dest) < ++min) {
4232 const UV o = d - (U8*)SvPVX_const(dest);
4233 d = o + (U8*) SvGROW(dest, min);
4235 *d++ = 'S'; *d = 'S'; /* upper case is 'SS' */
4236 continue; /* Back to the tight loop; still in ASCII */
4240 /* The other special handling characters have their
4241 * upper cases outside the latin1 range, hence need to be
4242 * in UTF-8, so the whole result needs to be in UTF-8.
4244 * So, here we are somewhere in the middle of processing a
4245 * non-UTF-8 string, and realize that we will have to
4246 * convert the whole thing to UTF-8. What to do? There
4247 * are several possibilities. The simplest to code is to
4248 * convert what we have so far, set a flag, and continue on
4249 * in the loop. The flag would be tested each time through
4250 * the loop, and if set, the next character would be
4251 * converted to UTF-8 and stored. But, I (khw) didn't want
4252 * to slow down the mainstream case at all for this fairly
4253 * rare case, so I didn't want to add a test that didn't
4254 * absolutely have to be there in the loop, besides the
4255 * possibility that it would get too complicated for
4256 * optimizers to deal with. Another possibility is to just
4257 * give up, convert the source to UTF-8, and restart the
4258 * function that way. Another possibility is to convert
4259 * both what has already been processed and what is yet to
4260 * come separately to UTF-8, then jump into the loop that
4261 * handles UTF-8. But the most efficient time-wise of the
4262 * ones I could think of is what follows, and turned out to
4263 * not require much extra code.
4265 * First, calculate the extra space needed for the
4266 * remainder of the source needing to be in UTF-8. Except
4267 * for the 'i' in Turkic locales, in UTF-8 strings, the
4268 * uppercase of a character below 256 occupies the same
4269 * number of bytes as the original. Therefore, the space
4270 * needed is the that number plus the number of characters
4271 * that become two bytes when converted to UTF-8, plus, in
4272 * turkish locales, the number of 'i's. */
4274 extra = send - s + variant_under_utf8_count(s, send);
4276 #ifdef USE_LOCALE_CTYPE
4278 if (UNLIKELY(*s == 'i')) { /* We wouldn't get an 'i' here
4279 unless are in a Turkic
4281 const U8 * s_peek = s;
4286 s_peek = (U8 *) memchr(s_peek + 1, 'i',
4287 send - (s_peek + 1));
4288 } while (s_peek != NULL);
4292 /* Convert what we have so far into UTF-8, telling the
4293 * function that we know it should be converted, and to
4294 * allow extra space for what we haven't processed yet.
4296 * This may cause the string pointer to move, so need to
4297 * save and re-find it. */
4299 len = d - (U8*)SvPVX_const(dest);
4300 SvCUR_set(dest, len);
4301 len = sv_utf8_upgrade_flags_grow(dest,
4302 SV_GMAGIC|SV_FORCE_UTF8_UPGRADE,
4304 d = (U8*)SvPVX(dest) + len;
4306 /* Now process the remainder of the source, simultaneously
4307 * converting to upper and UTF-8.
4309 * To avoid extra tests in the loop body, and since the
4310 * loop is so simple, split out the rare Turkic case into
4313 #ifdef USE_LOCALE_CTYPE
4314 if ( UNLIKELY(PL_in_utf8_turkic_locale)
4315 && UNLIKELY(IN_LC_RUNTIME(LC_CTYPE)))
4317 for (; s < send; s++) {
4319 *d++ = UTF8_TWO_BYTE_HI(LATIN_CAPITAL_LETTER_I_WITH_DOT_ABOVE);
4320 *d++ = UTF8_TWO_BYTE_LO(LATIN_CAPITAL_LETTER_I_WITH_DOT_ABOVE);
4323 (void) _to_upper_title_latin1(*s, d, &len, 'S');
4330 for (; s < send; s++) {
4331 (void) _to_upper_title_latin1(*s, d, &len, 'S');
4335 /* Here have processed the whole source; no need to
4336 * continue with the outer loop. Each character has been
4337 * converted to upper case and converted to UTF-8. */
4339 } /* End of processing all latin1-style chars */
4340 } /* End of processing all chars */
4341 } /* End of source is not empty */
4343 if (source != dest) {
4344 *d = '\0'; /* Here d points to 1 after last char, add NUL */
4345 SvCUR_set(dest, d - (U8*)SvPVX_const(dest));
4347 } /* End of isn't utf8 */
4348 #ifdef USE_LOCALE_CTYPE
4349 if (IN_LC_RUNTIME(LC_CTYPE)) {
4354 if (dest != source && SvTAINTED(source))
4369 bool has_turkic_I = FALSE;
4373 if ( SvPADTMP(source)
4374 && !SvREADONLY(source) && SvPOK(source)
4377 #ifdef USE_LOCALE_CTYPE
4379 && ( LIKELY(! IN_LC_RUNTIME(LC_CTYPE))
4380 || LIKELY(! PL_in_utf8_turkic_locale))
4386 /* We can convert in place, as, outside of Turkic UTF-8 locales,
4387 * lowercasing anything in the latin1 range (or else DO_UTF8 would have
4388 * been on) doesn't lengthen it. */
4390 s = d = (U8*)SvPV_force_nomg(source, len);
4397 s = (const U8*)SvPV_nomg_const(source, len);
4400 SvUPGRADE(dest, SVt_PV);
4401 d = (U8*)SvGROW(dest, min);
4402 (void)SvPOK_only(dest);
4407 #ifdef USE_LOCALE_CTYPE
4409 if (IN_LC_RUNTIME(LC_CTYPE)) {
4412 _CHECK_AND_WARN_PROBLEMATIC_LOCALE;
4414 /* Lowercasing in a Turkic locale can cause non-UTF-8 to need to become
4415 * UTF-8 for the single case of the character 'I' */
4416 if ( UNLIKELY(PL_in_utf8_turkic_locale)
4417 && ! DO_UTF8(source)
4418 && (next_I = (U8 *) memchr(s, 'I', len)))
4421 const U8 *const send = s + len;
4426 next_I = (U8 *) memchr(next_I + 1, 'I',
4427 send - (next_I + 1));
4428 } while (next_I != NULL);
4430 /* Except for the 'I', in UTF-8 strings, the lower case of a
4431 * character below 256 occupies the same number of bytes as the
4432 * original. Therefore, the space needed is the original length
4433 * plus I_count plus the number of characters that become two bytes
4434 * when converted to UTF-8 */
4435 sv_utf8_upgrade_flags_grow(dest, 0, len
4437 + variant_under_utf8_count(s, send));
4438 d = (U8*)SvPVX(dest);
4439 has_turkic_I = TRUE;
4445 /* Overloaded values may have toggled the UTF-8 flag on source, so we need
4446 to check DO_UTF8 again here. */
4448 if (DO_UTF8(source)) {
4449 const U8 *const send = s + len;
4450 U8 tmpbuf[UTF8_MAXBYTES_CASE+1];
4451 bool remove_dot_above = FALSE;
4454 const STRLEN u = UTF8SKIP(s);
4457 #ifdef USE_LOCALE_CTYPE
4459 _toLOWER_utf8_flags(s, send, tmpbuf, &ulen, IN_LC_RUNTIME(LC_CTYPE));
4461 /* If we are in a Turkic locale, we have to do more work. As noted
4462 * in the comments for lcfirst, there is a special case if a 'I'
4463 * is in a grapheme with COMBINING DOT ABOVE UTF8. It turns into a
4464 * 'i', and the DOT must be removed. We check for that situation,
4465 * and set a flag if the DOT is there. Then each time through the
4466 * loop, we have to see if we need to remove the next DOT above,
4467 * and if so, do it. We know that there is a DOT because
4468 * _toLOWER_utf8_flags() wouldn't have returned 'i' unless there
4469 * was one in a proper position. */
4470 if ( UNLIKELY(PL_in_utf8_turkic_locale)
4471 && IN_LC_RUNTIME(LC_CTYPE))
4473 if ( UNLIKELY(remove_dot_above)
4474 && memBEGINs(tmpbuf, sizeof(tmpbuf), COMBINING_DOT_ABOVE_UTF8))
4477 remove_dot_above = FALSE;
4480 else if (UNLIKELY(*s == 'I' && tmpbuf[0] == 'i')) {
4481 remove_dot_above = TRUE;
4485 PERL_UNUSED_VAR(remove_dot_above);
4487 _toLOWER_utf8_flags(s, send, tmpbuf, &ulen, 0);
4490 /* Here is where we would do context-sensitive actions for the
4491 * Greek final sigma. See the commit message for 86510fb15 for why
4492 * there isn't any */
4494 if (ulen > u && (SvLEN(dest) < (min += ulen - u))) {
4496 /* If the eventually required minimum size outgrows the
4497 * available space, we need to grow. */
4498 const UV o = d - (U8*)SvPVX_const(dest);
4500 /* If someone lowercases one million U+0130s we SvGROW() one
4501 * million times. Or we could try guessing how much to
4502 * allocate without allocating too much. Such is life.
4503 * Another option would be to grow an extra byte or two more
4504 * each time we need to grow, which would cut down the million
4505 * to 500K, with little waste */
4506 d = o + (U8*) SvGROW(dest, min);
4509 /* Copy the newly lowercased letter to the output buffer we're
4511 Copy(tmpbuf, d, ulen, U8);
4514 } /* End of looping through the source string */
4517 SvCUR_set(dest, d - (U8*)SvPVX_const(dest));
4518 } else { /* 'source' not utf8 */
4520 const U8 *const send = s + len;
4522 /* Use locale casing if in locale; regular style if not treating
4523 * latin1 as having case; otherwise the latin1 casing. Do the
4524 * whole thing in a tight loop, for speed, */
4525 #ifdef USE_LOCALE_CTYPE
4526 if (IN_LC_RUNTIME(LC_CTYPE)) {
4527 if (LIKELY( ! has_turkic_I)) {
4528 for (; s < send; d++, s++)
4529 *d = toLOWER_LC(*s);
4531 else { /* This is the only case where lc() converts 'dest'
4532 into UTF-8 from a non-UTF-8 'source' */
4533 for (; s < send; s++) {
4535 *d++ = UTF8_TWO_BYTE_HI(LATIN_SMALL_LETTER_DOTLESS_I);
4536 *d++ = UTF8_TWO_BYTE_LO(LATIN_SMALL_LETTER_DOTLESS_I);
4539 append_utf8_from_native_byte(toLOWER_LATIN1(*s), &d);
4546 if (! IN_UNI_8_BIT) {
4547 for (; s < send; d++, s++) {
4552 for (; s < send; d++, s++) {
4553 *d = toLOWER_LATIN1(*s);
4557 if (source != dest) {
4559 SvCUR_set(dest, d - (U8*)SvPVX_const(dest));
4562 #ifdef USE_LOCALE_CTYPE
4563 if (IN_LC_RUNTIME(LC_CTYPE)) {
4568 if (dest != source && SvTAINTED(source))
4577 SV * const sv = TOPs;
4579 const char *s = SvPV_const(sv,len);
4581 SvUTF8_off(TARG); /* decontaminate */
4584 SvUPGRADE(TARG, SVt_PV);
4585 SvGROW(TARG, (len * 2) + 1);
4589 STRLEN ulen = UTF8SKIP(s);
4590 bool to_quote = FALSE;
4592 if (UTF8_IS_INVARIANT(*s)) {
4593 if (_isQUOTEMETA(*s)) {
4597 else if (UTF8_IS_NEXT_CHAR_DOWNGRADEABLE(s, s + len)) {
4599 #ifdef USE_LOCALE_CTYPE
4600 /* In locale, we quote all non-ASCII Latin1 chars.
4601 * Otherwise use the quoting rules */
4603 IN_LC_RUNTIME(LC_CTYPE)
4606 _isQUOTEMETA(EIGHT_BIT_UTF8_TO_NATIVE(*s, *(s + 1))))
4611 else if (is_QUOTEMETA_high(s)) {
4626 else if (IN_UNI_8_BIT) {
4628 if (_isQUOTEMETA(*s))
4634 /* For non UNI_8_BIT (and hence in locale) just quote all \W
4635 * including everything above ASCII */
4637 if (!isWORDCHAR_A(*s))
4643 SvCUR_set(TARG, d - SvPVX_const(TARG));
4644 (void)SvPOK_only_UTF8(TARG);
4647 sv_setpvn(TARG, s, len);
4663 U8 tmpbuf[UTF8_MAXBYTES_CASE + 1];
4664 #if UNICODE_MAJOR_VERSION > 3 /* no multifolds in early Unicode */ \
4665 || (UNICODE_MAJOR_VERSION == 3 && ( UNICODE_DOT_VERSION > 0) \
4666 || UNICODE_DOT_DOT_VERSION > 0)
4667 const bool full_folding = TRUE; /* This variable is here so we can easily
4668 move to more generality later */
4670 const bool full_folding = FALSE;
4672 const U8 flags = ( full_folding ? FOLD_FLAGS_FULL : 0 )
4673 #ifdef USE_LOCALE_CTYPE
4674 | ( IN_LC_RUNTIME(LC_CTYPE) ? FOLD_FLAGS_LOCALE : 0 )
4678 /* This is a facsimile of pp_lc, but with a thousand bugs thanks to me.
4679 * You are welcome(?) -Hugmeir
4687 s = (const U8*)SvPV_nomg_const(source, len);
4689 if (ckWARN(WARN_UNINITIALIZED))
4690 report_uninit(source);
4697 SvUPGRADE(dest, SVt_PV);
4698 d = (U8*)SvGROW(dest, min);
4699 (void)SvPOK_only(dest);
4705 #ifdef USE_LOCALE_CTYPE
4707 if ( IN_LC_RUNTIME(LC_CTYPE) ) { /* Under locale */
4708 _CHECK_AND_WARN_PROBLEMATIC_LOCALE;
4713 if (DO_UTF8(source)) { /* UTF-8 flagged string. */
4715 const STRLEN u = UTF8SKIP(s);
4718 _toFOLD_utf8_flags(s, send, tmpbuf, &ulen, flags);
4720 if (ulen > u && (SvLEN(dest) < (min += ulen - u))) {
4721 const UV o = d - (U8*)SvPVX_const(dest);
4722 d = o + (U8*) SvGROW(dest, min);
4725 Copy(tmpbuf, d, ulen, U8);
4730 } /* Unflagged string */
4732 #ifdef USE_LOCALE_CTYPE
4733 if ( IN_LC_RUNTIME(LC_CTYPE) ) { /* Under locale */
4734 if (IN_UTF8_CTYPE_LOCALE) {
4735 goto do_uni_folding;
4737 for (; s < send; d++, s++)
4738 *d = (U8) toFOLD_LC(*s);
4742 if ( !IN_UNI_8_BIT ) { /* Under nothing, or bytes */
4743 for (; s < send; d++, s++)
4747 #ifdef USE_LOCALE_CTYPE
4750 /* For ASCII and the Latin-1 range, there's potentially three
4751 * troublesome folds:
4752 * \x{DF} (\N{LATIN SMALL LETTER SHARP S}), which under full
4753 * casefolding becomes 'ss';
4754 * \x{B5} (\N{MICRO SIGN}), which under any fold becomes
4755 * \x{3BC} (\N{GREEK SMALL LETTER MU})
4756 * I only in Turkic locales, this folds to \x{131}
4757 * \N{LATIN SMALL LETTER DOTLESS I}
4758 * For the rest, the casefold is their lowercase. */
4759 for (; s < send; d++, s++) {
4760 if ( UNLIKELY(*s == MICRO_SIGN)
4761 #ifdef USE_LOCALE_CTYPE
4762 || ( UNLIKELY(PL_in_utf8_turkic_locale)
4763 && UNLIKELY(IN_LC_RUNTIME(LC_CTYPE))
4764 && UNLIKELY(*s == 'I'))
4767 Size_t extra = send - s
4768 + variant_under_utf8_count(s, send);
4770 /* \N{MICRO SIGN}'s casefold is \N{GREEK SMALL LETTER MU},
4771 * and 'I' in Turkic locales is \N{LATIN SMALL LETTER
4772 * DOTLESS I} both of which are outside of the latin-1
4773 * range. There's a couple of ways to deal with this -- khw
4774 * discusses them in pp_lc/uc, so go there :) What we do
4775 * here is upgrade what we had already casefolded, then
4776 * enter an inner loop that appends the rest of the
4777 * characters as UTF-8.
4779 * First we calculate the needed size of the upgraded dest
4780 * beyond what's been processed already (the upgrade
4781 * function figures that out). Except for the 'I' in
4782 * Turkic locales, in UTF-8 strings, the fold case of a
4783 * character below 256 occupies the same number of bytes as
4784 * the original (even the Sharp S). Therefore, the space
4785 * needed is the number of bytes remaining plus the number
4786 * of characters that become two bytes when converted to
4787 * UTF-8 plus, in turkish locales, the number of 'I's */
4789 if (UNLIKELY(*s == 'I')) {
4790 const U8 * s_peek = s;
4795 s_peek = (U8 *) memchr(s_peek + 1, 'i',
4796 send - (s_peek + 1));
4797 } while (s_peek != NULL);
4800 /* Growing may move things, so have to save and recalculate
4802 len = d - (U8*)SvPVX_const(dest);
4803 SvCUR_set(dest, len);
4804 len = sv_utf8_upgrade_flags_grow(dest,
4805 SV_GMAGIC|SV_FORCE_UTF8_UPGRADE,
4807 d = (U8*)SvPVX(dest) + len;
4809 *d++ = UTF8_TWO_BYTE_HI(GREEK_SMALL_LETTER_MU);
4810 *d++ = UTF8_TWO_BYTE_LO(GREEK_SMALL_LETTER_MU);
4813 for (; s < send; s++) {
4815 _to_uni_fold_flags(*s, d, &ulen, flags);
4820 else if ( UNLIKELY(*s == LATIN_SMALL_LETTER_SHARP_S)
4823 /* Under full casefolding, LATIN SMALL LETTER SHARP S
4824 * becomes "ss", which may require growing the SV. */
4825 if (SvLEN(dest) < ++min) {
4826 const UV o = d - (U8*)SvPVX_const(dest);
4827 d = o + (U8*) SvGROW(dest, min);
4832 else { /* Else, the fold is the lower case */
4833 *d = toLOWER_LATIN1(*s);
4839 SvCUR_set(dest, d - (U8*)SvPVX_const(dest));
4841 #ifdef USE_LOCALE_CTYPE
4842 if (IN_LC_RUNTIME(LC_CTYPE)) {
4847 if (SvTAINTED(source))
4857 dSP; dMARK; dORIGMARK;
4858 AV *const av = MUTABLE_AV(POPs);
4859 const I32 lval = (PL_op->op_flags & OPf_MOD || LVRET);
4861 if (SvTYPE(av) == SVt_PVAV) {
4862 const bool localizing = PL_op->op_private & OPpLVAL_INTRO;
4863 bool can_preserve = FALSE;
4869 can_preserve = SvCANEXISTDELETE(av);
4872 if (lval && localizing) {
4875 for (svp = MARK + 1; svp <= SP; svp++) {
4876 const SSize_t elem = SvIV(*svp);
4880 if (max > AvMAX(av))
4884 while (++MARK <= SP) {
4886 SSize_t elem = SvIV(*MARK);
4887 bool preeminent = TRUE;
4889 if (localizing && can_preserve) {
4890 /* If we can determine whether the element exist,
4891 * Try to preserve the existenceness of a tied array
4892 * element by using EXISTS and DELETE if possible.
4893 * Fallback to FETCH and STORE otherwise. */
4894 preeminent = av_exists(av, elem);
4897 svp = av_fetch(av, elem, lval);
4900 DIE(aTHX_ PL_no_aelem, elem);
4903 save_aelem(av, elem, svp);
4905 SAVEADELETE(av, elem);
4908 *MARK = svp ? *svp : &PL_sv_undef;
4911 if (GIMME_V != G_ARRAY) {
4913 *++MARK = SP > ORIGMARK ? *SP : &PL_sv_undef;
4922 AV *const av = MUTABLE_AV(POPs);
4923 I32 lval = (PL_op->op_flags & OPf_MOD);
4924 SSize_t items = SP - MARK;
4926 if (PL_op->op_private & OPpMAYBE_LVSUB) {
4927 const I32 flags = is_lvalue_sub();
4929 if (!(flags & OPpENTERSUB_INARGS))
4930 /* diag_listed_as: Can't modify %s in %s */
4931 Perl_croak(aTHX_ "Can't modify index/value array slice in list assignment");
4938 *(MARK+items*2-1) = *(MARK+items);
4944 while (++MARK <= SP) {
4947 svp = av_fetch(av, SvIV(*MARK), lval);
4949 if (!svp || !*svp || *svp == &PL_sv_undef) {
4950 DIE(aTHX_ PL_no_aelem, SvIV(*MARK));
4952 *MARK = sv_mortalcopy(*MARK);
4954 *++MARK = svp ? *svp : &PL_sv_undef;
4956 if (GIMME_V != G_ARRAY) {
4957 MARK = SP - items*2;
4958 *++MARK = items > 0 ? *SP : &PL_sv_undef;
4968 AV *array = MUTABLE_AV(POPs);
4969 const U8 gimme = GIMME_V;
4970 IV *iterp = Perl_av_iter_p(aTHX_ array);
4971 const IV current = (*iterp)++;
4973 if (current > av_tindex(array)) {
4975 if (gimme == G_SCALAR)
4983 if (gimme == G_ARRAY) {
4984 SV **const element = av_fetch(array, current, 0);
4985 PUSHs(element ? *element : &PL_sv_undef);
4990 /* also used for: pp_avalues()*/
4994 AV *array = MUTABLE_AV(POPs);
4995 const U8 gimme = GIMME_V;
4997 *Perl_av_iter_p(aTHX_ array) = 0;
4999 if (gimme == G_SCALAR) {
5001 PUSHi(av_tindex(array) + 1);
5003 else if (gimme == G_ARRAY) {
5004 if (UNLIKELY(PL_op->op_private & OPpMAYBE_LVSUB)) {
5005 const I32 flags = is_lvalue_sub();
5006 if (flags && !(flags & OPpENTERSUB_INARGS))
5007 /* diag_listed_as: Can't modify %s in %s */
5009 "Can't modify keys on array in list assignment");
5012 IV n = Perl_av_len(aTHX_ array);
5017 if ( PL_op->op_type == OP_AKEYS
5018 || ( PL_op->op_type == OP_AVHVSWITCH
5019 && (PL_op->op_private & 3) + OP_AEACH == OP_AKEYS ))
5021 for (i = 0; i <= n; i++) {
5026 for (i = 0; i <= n; i++) {
5027 SV *const *const elem = Perl_av_fetch(aTHX_ array, i, 0);
5028 PUSHs(elem ? *elem : &PL_sv_undef);
5036 /* Associative arrays. */
5041 HV * hash = MUTABLE_HV(POPs);
5043 const U8 gimme = GIMME_V;
5045 entry = hv_iternext(hash);
5049 SV* const sv = hv_iterkeysv(entry);
5051 if (gimme == G_ARRAY) {
5053 val = hv_iterval(hash, entry);
5057 else if (gimme == G_SCALAR)
5064 S_do_delete_local(pTHX)
5067 const U8 gimme = GIMME_V;
5070 const bool sliced = !!(PL_op->op_private & OPpSLICE);
5071 SV **unsliced_keysv = sliced ? NULL : sp--;
5072 SV * const osv = POPs;
5073 SV **mark = sliced ? PL_stack_base + POPMARK : unsliced_keysv-1;
5075 const bool tied = SvRMAGICAL(osv)
5076 && mg_find((const SV *)osv, PERL_MAGIC_tied);
5077 const bool can_preserve = SvCANEXISTDELETE(osv);
5078 const U32 type = SvTYPE(osv);
5079 SV ** const end = sliced ? SP : unsliced_keysv;
5081 if (type == SVt_PVHV) { /* hash element */
5082 HV * const hv = MUTABLE_HV(osv);
5083 while (++MARK <= end) {
5084 SV * const keysv = *MARK;
5086 bool preeminent = TRUE;
5088 preeminent = hv_exists_ent(hv, keysv, 0);
5090 HE *he = hv_fetch_ent(hv, keysv, 1, 0);
5097 sv = hv_delete_ent(hv, keysv, 0, 0);
5099 SvREFCNT_inc_simple_void(sv); /* De-mortalize */
5102 if (!sv) DIE(aTHX_ PL_no_helem_sv, SVfARG(keysv));
5103 save_helem_flags(hv, keysv, &sv, SAVEf_KEEPOLDELEM);
5105 *MARK = sv_mortalcopy(sv);
5111 SAVEHDELETE(hv, keysv);
5112 *MARK = &PL_sv_undef;
5116 else if (type == SVt_PVAV) { /* array element */
5117 if (PL_op->op_flags & OPf_SPECIAL) {
5118 AV * const av = MUTABLE_AV(osv);
5119 while (++MARK <= end) {
5120 SSize_t idx = SvIV(*MARK);
5122 bool preeminent = TRUE;
5124 preeminent = av_exists(av, idx);
5126 SV **svp = av_fetch(av, idx, 1);
5133 sv = av_delete(av, idx, 0);
5135 SvREFCNT_inc_simple_void(sv); /* De-mortalize */
5138 save_aelem_flags(av, idx, &sv, SAVEf_KEEPOLDELEM);
5140 *MARK = sv_mortalcopy(sv);
5146 SAVEADELETE(av, idx);
5147 *MARK = &PL_sv_undef;
5152 DIE(aTHX_ "panic: avhv_delete no longer supported");
5155 DIE(aTHX_ "Not a HASH reference");
5157 if (gimme == G_VOID)
5159 else if (gimme == G_SCALAR) {
5164 *++MARK = &PL_sv_undef;
5168 else if (gimme != G_VOID)
5169 PUSHs(*unsliced_keysv);
5180 if (PL_op->op_private & OPpLVAL_INTRO)
5181 return do_delete_local();
5184 discard = (gimme == G_VOID) ? G_DISCARD : 0;
5186 if (PL_op->op_private & (OPpSLICE|OPpKVSLICE)) {
5188 HV * const hv = MUTABLE_HV(POPs);
5189 const U32 hvtype = SvTYPE(hv);
5191 if (PL_op->op_private & OPpKVSLICE) {
5192 SSize_t items = SP - MARK;
5196 *(MARK+items*2-1) = *(MARK+items);
5203 if (hvtype == SVt_PVHV) { /* hash element */
5204 while ((MARK += (1+skip)) <= SP) {
5205 SV * const sv = hv_delete_ent(hv, *(MARK-skip), discard, 0);
5206 *MARK = sv ? sv : &PL_sv_undef;
5209 else if (hvtype == SVt_PVAV) { /* array element */
5210 if (PL_op->op_flags & OPf_SPECIAL) {
5211 while ((MARK += (1+skip)) <= SP) {
5212 SV * const sv = av_delete(MUTABLE_AV(hv), SvIV(*(MARK-skip)), discard);
5213 *MARK = sv ? sv : &PL_sv_undef;
5218 DIE(aTHX_ "Not a HASH reference");
5221 else if (gimme == G_SCALAR) {
5226 *++MARK = &PL_sv_undef;
5232 HV * const hv = MUTABLE_HV(POPs);
5234 if (SvTYPE(hv) == SVt_PVHV)
5235 sv = hv_delete_ent(hv, keysv, discard, 0);
5236 else if (SvTYPE(hv) == SVt_PVAV) {
5237 if (PL_op->op_flags & OPf_SPECIAL)
5238 sv = av_delete(MUTABLE_AV(hv), SvIV(keysv), discard);
5240 DIE(aTHX_ "panic: avhv_delete no longer supported");
5243 DIE(aTHX_ "Not a HASH reference");
5258 if (UNLIKELY( PL_op->op_private & OPpEXISTS_SUB )) {
5260 SV * const sv = POPs;
5261 CV * const cv = sv_2cv(sv, &hv, &gv, 0);
5264 if (gv && isGV(gv) && GvCV(gv) && !GvCVGEN(gv))
5269 hv = MUTABLE_HV(POPs);
5270 if (LIKELY( SvTYPE(hv) == SVt_PVHV )) {
5271 if (hv_exists_ent(hv, tmpsv, 0))
5274 else if (SvTYPE(hv) == SVt_PVAV) {
5275 if (PL_op->op_flags & OPf_SPECIAL) { /* array element */
5276 if (av_exists(MUTABLE_AV(hv), SvIV(tmpsv)))
5281 DIE(aTHX_ "Not a HASH reference");
5288 dSP; dMARK; dORIGMARK;
5289 HV * const hv = MUTABLE_HV(POPs);
5290 const I32 lval = (PL_op->op_flags & OPf_MOD || LVRET);
5291 const bool localizing = PL_op->op_private & OPpLVAL_INTRO;
5292 bool can_preserve = FALSE;
5298 if (SvCANEXISTDELETE(hv))
5299 can_preserve = TRUE;
5302 while (++MARK <= SP) {
5303 SV * const keysv = *MARK;
5306 bool preeminent = TRUE;
5308 if (localizing && can_preserve) {
5309 /* If we can determine whether the element exist,
5310 * try to preserve the existenceness of a tied hash
5311 * element by using EXISTS and DELETE if possible.
5312 * Fallback to FETCH and STORE otherwise. */
5313 preeminent = hv_exists_ent(hv, keysv, 0);
5316 he = hv_fetch_ent(hv, keysv, lval, 0);
5317 svp = he ? &HeVAL(he) : NULL;
5320 if (!svp || !*svp || *svp == &PL_sv_undef) {
5321 DIE(aTHX_ PL_no_helem_sv, SVfARG(keysv));
5324 if (HvNAME_get(hv) && isGV_or_RVCV(*svp))
5325 save_gp(MUTABLE_GV(*svp), !(PL_op->op_flags & OPf_SPECIAL));
5326 else if (preeminent)
5327 save_helem_flags(hv, keysv, svp,
5328 (PL_op->op_flags & OPf_SPECIAL) ? 0 : SAVEf_SETMAGIC);
5330 SAVEHDELETE(hv, keysv);
5333 *MARK = svp && *svp ? *svp : &PL_sv_undef;
5335 if (GIMME_V != G_ARRAY) {
5337 *++MARK = SP > ORIGMARK ? *SP : &PL_sv_undef;
5346 HV * const hv = MUTABLE_HV(POPs);
5347 I32 lval = (PL_op->op_flags & OPf_MOD);
5348 SSize_t items = SP - MARK;
5350 if (PL_op->op_private & OPpMAYBE_LVSUB) {
5351 const I32 flags = is_lvalue_sub();
5353 if (!(flags & OPpENTERSUB_INARGS))
5354 /* diag_listed_as: Can't modify %s in %s */
5355 Perl_croak(aTHX_ "Can't modify key/value hash slice in %s assignment",
5356 GIMME_V == G_ARRAY ? "list" : "scalar");
5363 *(MARK+items*2-1) = *(MARK+items);
5369 while (++MARK <= SP) {
5370 SV * const keysv = *MARK;
5374 he = hv_fetch_ent(hv, keysv, lval, 0);
5375 svp = he ? &HeVAL(he) : NULL;
5378 if (!svp || !*svp || *svp == &PL_sv_undef) {
5379 DIE(aTHX_ PL_no_helem_sv, SVfARG(keysv));
5381 *MARK = sv_mortalcopy(*MARK);
5383 *++MARK = svp && *svp ? *svp : &PL_sv_undef;
5385 if (GIMME_V != G_ARRAY) {
5386 MARK = SP - items*2;
5387 *++MARK = items > 0 ? *SP : &PL_sv_undef;
5393 /* List operators. */
5397 I32 markidx = POPMARK;
5398 if (GIMME_V != G_ARRAY) {
5399 /* don't initialize mark here, EXTEND() may move the stack */
5402 EXTEND(SP, 1); /* in case no arguments, as in @empty */
5403 mark = PL_stack_base + markidx;
5405 *MARK = *SP; /* unwanted list, return last item */
5407 *MARK = &PL_sv_undef;
5417 SV ** const lastrelem = PL_stack_sp;
5418 SV ** const lastlelem = PL_stack_base + POPMARK;
5419 SV ** const firstlelem = PL_stack_base + POPMARK + 1;
5420 SV ** const firstrelem = lastlelem + 1;
5421 const U8 mod = PL_op->op_flags & OPf_MOD;
5423 const I32 max = lastrelem - lastlelem;
5426 if (GIMME_V != G_ARRAY) {
5427 if (lastlelem < firstlelem) {
5429 *firstlelem = &PL_sv_undef;
5432 I32 ix = SvIV(*lastlelem);
5435 if (ix < 0 || ix >= max)
5436 *firstlelem = &PL_sv_undef;
5438 *firstlelem = firstrelem[ix];
5445 SP = firstlelem - 1;
5449 for (lelem = firstlelem; lelem <= lastlelem; lelem++) {
5450 I32 ix = SvIV(*lelem);
5453 if (ix < 0 || ix >= max)
5454 *lelem = &PL_sv_undef;
5456 if (!(*lelem = firstrelem[ix]))
5457 *lelem = &PL_sv_undef;
5458 else if (mod && SvPADTMP(*lelem)) {
5459 *lelem = firstrelem[ix] = sv_mortalcopy(*lelem);
5470 const I32 items = SP - MARK;
5471 SV * const av = MUTABLE_SV(av_make(items, MARK+1));
5473 mXPUSHs((PL_op->op_flags & OPf_SPECIAL)
5474 ? newRV_noinc(av) : av);
5480 dSP; dMARK; dORIGMARK;
5481 HV* const hv = newHV();
5482 SV* const retval = sv_2mortal( PL_op->op_flags & OPf_SPECIAL
5483 ? newRV_noinc(MUTABLE_SV(hv))
5488 (MARK++, SvGMAGICAL(*MARK) ? sv_mortalcopy(*MARK) : *MARK);
5495 sv_setsv_nomg(val, *MARK);
5499 Perl_ck_warner(aTHX_ packWARN(WARN_MISC), "Odd number of elements in anonymous hash");
5502 (void)hv_store_ent(hv,key,val,0);
5511 dSP; dMARK; dORIGMARK;
5512 int num_args = (SP - MARK);
5513 AV *ary = MUTABLE_AV(*++MARK);
5522 const MAGIC * const mg = SvTIED_mg((const SV *)ary, PERL_MAGIC_tied);
5525 return Perl_tied_method(aTHX_ SV_CONST(SPLICE), mark - 1, MUTABLE_SV(ary), mg,
5526 GIMME_V | TIED_METHOD_ARGUMENTS_ON_STACK,
5530 if (SvREADONLY(ary))
5531 Perl_croak_no_modify();
5536 offset = i = SvIV(*MARK);
5538 offset += AvFILLp(ary) + 1;
5540 DIE(aTHX_ PL_no_aelem, i);
5542 length = SvIVx(*MARK++);
5544 length += AvFILLp(ary) - offset + 1;
5550 length = AvMAX(ary) + 1; /* close enough to infinity */
5554 length = AvMAX(ary) + 1;
5556 if (offset > AvFILLp(ary) + 1) {
5558 Perl_ck_warner(aTHX_ packWARN(WARN_MISC), "splice() offset past end of array" );
5559 offset = AvFILLp(ary) + 1;
5561 after = AvFILLp(ary) + 1 - (offset + length);
5562 if (after < 0) { /* not that much array */
5563 length += after; /* offset+length now in array */
5569 /* At this point, MARK .. SP-1 is our new LIST */
5572 diff = newlen - length;
5573 if (newlen && !AvREAL(ary) && AvREIFY(ary))
5576 /* make new elements SVs now: avoid problems if they're from the array */
5577 for (dst = MARK, i = newlen; i; i--) {
5578 SV * const h = *dst;
5579 *dst++ = newSVsv(h);
5582 if (diff < 0) { /* shrinking the area */
5583 SV **tmparyval = NULL;
5585 Newx(tmparyval, newlen, SV*); /* so remember insertion */
5586 Copy(MARK, tmparyval, newlen, SV*);
5589 MARK = ORIGMARK + 1;
5590 if (GIMME_V == G_ARRAY) { /* copy return vals to stack */
5591 const bool real = cBOOL(AvREAL(ary));
5592 MEXTEND(MARK, length);
5594 EXTEND_MORTAL(length);
5595 for (i = 0, dst = MARK; i < length; i++) {
5596 if ((*dst = AvARRAY(ary)[i+offset])) {
5598 sv_2mortal(*dst); /* free them eventually */
5601 *dst = &PL_sv_undef;
5607 *MARK = AvARRAY(ary)[offset+length-1];
5610 for (i = length - 1, dst = &AvARRAY(ary)[offset]; i > 0; i--)
5611 SvREFCNT_dec(*dst++); /* free them now */
5614 *MARK = &PL_sv_undef;
5616 AvFILLp(ary) += diff;
5618 /* pull up or down? */
5620 if (offset < after) { /* easier to pull up */
5621 if (offset) { /* esp. if nothing to pull */
5622 src = &AvARRAY(ary)[offset-1];
5623 dst = src - diff; /* diff is negative */
5624 for (i = offset; i > 0; i--) /* can't trust Copy */
5628 AvARRAY(ary) = AvARRAY(ary) - diff; /* diff is negative */
5632 if (after) { /* anything to pull down? */
5633 src = AvARRAY(ary) + offset + length;
5634 dst = src + diff; /* diff is negative */
5635 Move(src, dst, after, SV*);
5637 dst = &AvARRAY(ary)[AvFILLp(ary)+1];
5638 /* avoid later double free */
5645 Copy( tmparyval, AvARRAY(ary) + offset, newlen, SV* );
5646 Safefree(tmparyval);
5649 else { /* no, expanding (or same) */
5650 SV** tmparyval = NULL;
5652 Newx(tmparyval, length, SV*); /* so remember deletion */
5653 Copy(AvARRAY(ary)+offset, tmparyval, length, SV*);
5656 if (diff > 0) { /* expanding */
5657 /* push up or down? */
5658 if (offset < after && diff <= AvARRAY(ary) - AvALLOC(ary)) {
5662 Move(src, dst, offset, SV*);
5664 AvARRAY(ary) = AvARRAY(ary) - diff;/* diff is positive */
5666 AvFILLp(ary) += diff;
5669 if (AvFILLp(ary) + diff >= AvMAX(ary)) /* oh, well */
5670 av_extend(ary, AvFILLp(ary) + diff);
5671 AvFILLp(ary) += diff;
5674 dst = AvARRAY(ary) + AvFILLp(ary);
5676 for (i = after; i; i--) {
5684 Copy( MARK, AvARRAY(ary) + offset, newlen, SV* );
5687 MARK = ORIGMARK + 1;
5688 if (GIMME_V == G_ARRAY) { /* copy return vals to stack */
5690 const bool real = cBOOL(AvREAL(ary));
5692 EXTEND_MORTAL(length);
5693 for (i = 0, dst = MARK; i < length; i++) {
5694 if ((*dst = tmparyval[i])) {
5696 sv_2mortal(*dst); /* free them eventually */
5698 else *dst = &PL_sv_undef;
5704 else if (length--) {
5705 *MARK = tmparyval[length];
5708 while (length-- > 0)
5709 SvREFCNT_dec(tmparyval[length]);
5712 *MARK = &PL_sv_undef;
5715 *MARK = &PL_sv_undef;
5716 Safefree(tmparyval);
5720 mg_set(MUTABLE_SV(ary));
5728 dSP; dMARK; dORIGMARK; dTARGET;
5729 AV * const ary = MUTABLE_AV(*++MARK);
5730 const MAGIC * const mg = SvTIED_mg((const SV *)ary, PERL_MAGIC_tied);
5733 *MARK-- = SvTIED_obj(MUTABLE_SV(ary), mg);
5736 ENTER_with_name("call_PUSH");
5737 call_sv(SV_CONST(PUSH),G_SCALAR|G_DISCARD|G_METHOD_NAMED);
5738 LEAVE_with_name("call_PUSH");
5739 /* SPAGAIN; not needed: SP is assigned to immediately below */
5742 /* PL_delaymagic is restored by JUMPENV_POP on dieing, so we
5743 * only need to save locally, not on the save stack */
5744 U16 old_delaymagic = PL_delaymagic;
5746 if (SvREADONLY(ary) && MARK < SP) Perl_croak_no_modify();
5747 PL_delaymagic = DM_DELAY;
5748 for (++MARK; MARK <= SP; MARK++) {
5750 if (*MARK) SvGETMAGIC(*MARK);
5753 sv_setsv_nomg(sv, *MARK);
5754 av_store(ary, AvFILLp(ary)+1, sv);
5756 if (PL_delaymagic & DM_ARRAY_ISA)
5757 mg_set(MUTABLE_SV(ary));
5758 PL_delaymagic = old_delaymagic;
5761 if (OP_GIMME(PL_op, 0) != G_VOID) {
5762 PUSHi( AvFILL(ary) + 1 );
5767 /* also used for: pp_pop()*/
5771 AV * const av = PL_op->op_flags & OPf_SPECIAL
5772 ? MUTABLE_AV(GvAVn(PL_defgv)) : MUTABLE_AV(POPs);
5773 SV * const sv = PL_op->op_type == OP_SHIFT ? av_shift(av) : av_pop(av);
5777 (void)sv_2mortal(sv);
5784 dSP; dMARK; dORIGMARK; dTARGET;
5785 AV *ary = MUTABLE_AV(*++MARK);
5786 const MAGIC * const mg = SvTIED_mg((const SV *)ary, PERL_MAGIC_tied);
5789 *MARK-- = SvTIED_obj(MUTABLE_SV(ary), mg);
5792 ENTER_with_name("call_UNSHIFT");
5793 call_sv(SV_CONST(UNSHIFT),G_SCALAR|G_DISCARD|G_METHOD_NAMED);
5794 LEAVE_with_name("call_UNSHIFT");
5795 /* SPAGAIN; not needed: SP is assigned to immediately below */
5798 /* PL_delaymagic is restored by JUMPENV_POP on dieing, so we
5799 * only need to save locally, not on the save stack */
5800 U16 old_delaymagic = PL_delaymagic;
5803 av_unshift(ary, SP - MARK);
5804 PL_delaymagic = DM_DELAY;
5806 SV * const sv = newSVsv(*++MARK);
5807 (void)av_store(ary, i++, sv);
5809 if (PL_delaymagic & DM_ARRAY_ISA)
5810 mg_set(MUTABLE_SV(ary));
5811 PL_delaymagic = old_delaymagic;
5814 if (OP_GIMME(PL_op, 0) != G_VOID) {
5815 PUSHi( AvFILL(ary) + 1 );
5824 if (GIMME_V == G_ARRAY) {
5825 if (PL_op->op_private & OPpREVERSE_INPLACE) {
5829 assert( MARK+1 == SP && *SP && SvTYPE(*SP) == SVt_PVAV);
5830 (void)POPMARK; /* remove mark associated with ex-OP_AASSIGN */
5831 av = MUTABLE_AV((*SP));
5832 /* In-place reversing only happens in void context for the array
5833 * assignment. We don't need to push anything on the stack. */
5836 if (SvMAGICAL(av)) {
5838 SV *tmp = sv_newmortal();
5839 /* For SvCANEXISTDELETE */
5842 bool can_preserve = SvCANEXISTDELETE(av);
5844 for (i = 0, j = av_tindex(av); i < j; ++i, --j) {
5848 if (!av_exists(av, i)) {
5849 if (av_exists(av, j)) {
5850 SV *sv = av_delete(av, j, 0);
5851 begin = *av_fetch(av, i, TRUE);
5852 sv_setsv_mg(begin, sv);
5856 else if (!av_exists(av, j)) {
5857 SV *sv = av_delete(av, i, 0);
5858 end = *av_fetch(av, j, TRUE);
5859 sv_setsv_mg(end, sv);
5864 begin = *av_fetch(av, i, TRUE);
5865 end = *av_fetch(av, j, TRUE);
5866 sv_setsv(tmp, begin);
5867 sv_setsv_mg(begin, end);
5868 sv_setsv_mg(end, tmp);
5872 SV **begin = AvARRAY(av);
5875 SV **end = begin + AvFILLp(av);
5877 while (begin < end) {
5878 SV * const tmp = *begin;
5889 SV * const tmp = *MARK;
5893 /* safe as long as stack cannot get extended in the above */
5902 SvUTF8_off(TARG); /* decontaminate */
5903 if (SP - MARK > 1) {
5904 do_join(TARG, &PL_sv_no, MARK, SP);
5907 } else if (SP > MARK) {
5908 sv_setsv(TARG, *SP);
5911 sv_setsv(TARG, DEFSV);
5915 up = SvPV_force(TARG, len);
5918 if (DO_UTF8(TARG)) { /* first reverse each character */
5919 U8* s = (U8*)SvPVX(TARG);
5920 const U8* send = (U8*)(s + len);
5922 if (UTF8_IS_INVARIANT(*s)) {
5927 if (!utf8_to_uvchr_buf(s, send, 0))
5931 down = (char*)(s - 1);
5932 /* reverse this character */
5934 const char tmp = *up;
5942 down = SvPVX(TARG) + len - 1;
5944 const char tmp = *up;
5948 (void)SvPOK_only_UTF8(TARG);
5957 AV *ary = ( (PL_op->op_private & OPpSPLIT_ASSIGN) /* @a = split */
5958 && (PL_op->op_flags & OPf_STACKED)) /* @{expr} = split */
5959 ? (AV *)POPs : NULL;
5960 IV limit = POPi; /* note, negative is forever */
5961 SV * const sv = POPs;
5963 const char *s = SvPV_const(sv, len);
5964 const bool do_utf8 = DO_UTF8(sv);
5965 const bool in_uni_8_bit = IN_UNI_8_BIT;
5966 const char *strend = s + len;
5967 PMOP *pm = cPMOPx(PL_op);
5972 const STRLEN slen = do_utf8
5973 ? utf8_length((U8*)s, (U8*)strend)
5974 : (STRLEN)(strend - s);
5975 SSize_t maxiters = slen + 10;
5976 I32 trailing_empty = 0;
5978 const IV origlimit = limit;
5981 const U8 gimme = GIMME_V;
5983 I32 oldsave = PL_savestack_ix;
5984 U32 make_mortal = SVs_TEMP;
5990 TAINT_IF(get_regex_charset(RX_EXTFLAGS(rx)) == REGEX_LOCALE_CHARSET &&
5991 (RX_EXTFLAGS(rx) & (RXf_WHITE | RXf_SKIPWHITE)));
5993 /* handle @ary = split(...) optimisation */
5994 if (PL_op->op_private & OPpSPLIT_ASSIGN) {
5995 if (!(PL_op->op_flags & OPf_STACKED)) {
5996 if (PL_op->op_private & OPpSPLIT_LEX) {
5997 if (PL_op->op_private & OPpLVAL_INTRO)
5998 SAVECLEARSV(PAD_SVl(pm->op_pmreplrootu.op_pmtargetoff));
5999 ary = (AV *)PAD_SVl(pm->op_pmreplrootu.op_pmtargetoff);
6004 MUTABLE_GV(PAD_SVl(pm->op_pmreplrootu.op_pmtargetoff));
6006 pm->op_pmreplrootu.op_pmtargetgv;
6008 if (PL_op->op_private & OPpLVAL_INTRO)
6013 /* skip anything pushed by OPpLVAL_INTRO above */
6014 oldsave = PL_savestack_ix;
6020 (void)sv_2mortal(SvREFCNT_inc_simple_NN(sv));
6023 if ((mg = SvTIED_mg((const SV *)ary, PERL_MAGIC_tied))) {
6025 XPUSHs(SvTIED_obj(MUTABLE_SV(ary), mg));
6032 for (i = AvFILLp(ary); i >= 0; i--)
6033 AvARRAY(ary)[i] = &PL_sv_undef; /* don't free mere refs */
6035 /* temporarily switch stacks */
6036 SAVESWITCHSTACK(PL_curstack, ary);
6041 base = SP - PL_stack_base;
6043 if (RX_EXTFLAGS(rx) & RXf_SKIPWHITE) {
6045 while (s < strend && isSPACE_utf8_safe(s, strend))
6048 else if (get_regex_charset(RX_EXTFLAGS(rx)) == REGEX_LOCALE_CHARSET) {
6049 while (s < strend && isSPACE_LC(*s))
6052 else if (in_uni_8_bit) {
6053 while (s < strend && isSPACE_L1(*s))
6057 while (s < strend && isSPACE(*s))
6061 if (RX_EXTFLAGS(rx) & RXf_PMf_MULTILINE) {
6065 gimme_scalar = gimme == G_SCALAR && !ary;
6068 limit = maxiters + 2;
6069 if (RX_EXTFLAGS(rx) & RXf_WHITE) {
6072 /* this one uses 'm' and is a negative test */
6074 while (m < strend && ! isSPACE_utf8_safe(m, strend) ) {
6075 const int t = UTF8SKIP(m);
6076 /* isSPACE_utf8_safe returns FALSE for malform utf8 */
6083 else if (get_regex_charset(RX_EXTFLAGS(rx)) == REGEX_LOCALE_CHARSET)
6085 while (m < strend && !isSPACE_LC(*m))
6088 else if (in_uni_8_bit) {
6089 while (m < strend && !isSPACE_L1(*m))
6092 while (m < strend && !isSPACE(*m))
6105 dstr = newSVpvn_flags(s, m-s,
6106 (do_utf8 ? SVf_UTF8 : 0) | make_mortal);
6110 /* skip the whitespace found last */
6112 s = m + UTF8SKIP(m);
6116 /* this one uses 's' and is a positive test */
6118 while (s < strend && isSPACE_utf8_safe(s, strend) )
6121 else if (get_regex_charset(RX_EXTFLAGS(rx)) == REGEX_LOCALE_CHARSET)
6123 while (s < strend && isSPACE_LC(*s))
6126 else if (in_uni_8_bit) {
6127 while (s < strend && isSPACE_L1(*s))
6130 while (s < strend && isSPACE(*s))
6135 else if (RX_EXTFLAGS(rx) & RXf_START_ONLY) {
6137 for (m = s; m < strend && *m != '\n'; m++)
6150 dstr = newSVpvn_flags(s, m-s,
6151 (do_utf8 ? SVf_UTF8 : 0) | make_mortal);
6157 else if (RX_EXTFLAGS(rx) & RXf_NULL && !(s >= strend)) {
6159 Pre-extend the stack, either the number of bytes or
6160 characters in the string or a limited amount, triggered by:
6162 my ($x, $y) = split //, $str;
6166 if (!gimme_scalar) {
6167 const IV items = limit - 1;
6168 /* setting it to -1 will trigger a panic in EXTEND() */
6169 const SSize_t sslen = slen > SSize_t_MAX ? -1 : (SSize_t)slen;
6170 if (items >=0 && items < sslen)
6178 /* keep track of how many bytes we skip over */
6188 dstr = newSVpvn_flags(m, s-m, SVf_UTF8 | make_mortal);
6201 dstr = newSVpvn(s, 1);
6217 else if (do_utf8 == (RX_UTF8(rx) != 0) &&
6218 (RX_EXTFLAGS(rx) & RXf_USE_INTUIT) && !RX_NPARENS(rx)
6219 && (RX_EXTFLAGS(rx) & RXf_CHECK_ALL)
6220 && !(RX_EXTFLAGS(rx) & RXf_IS_ANCHORED)) {
6221 const int tail = (RX_EXTFLAGS(rx) & RXf_INTUIT_TAIL);
6222 SV * const csv = CALLREG_INTUIT_STRING(rx);
6224 len = RX_MINLENRET(rx);
6225 if (len == 1 && !RX_UTF8(rx) && !tail) {
6226 const char c = *SvPV_nolen_const(csv);
6228 for (m = s; m < strend && *m != c; m++)
6239 dstr = newSVpvn_flags(s, m-s,
6240 (do_utf8 ? SVf_UTF8 : 0) | make_mortal);
6243 /* The rx->minlen is in characters but we want to step
6244 * s ahead by bytes. */
6246 s = (char*)utf8_hop((U8*)m, len);
6248 s = m + len; /* Fake \n at the end */
6252 while (s < strend && --limit &&
6253 (m = fbm_instr((unsigned char*)s, (unsigned char*)strend,
6254 csv, multiline ? FBMrf_MULTILINE : 0)) )
6263 dstr = newSVpvn_flags(s, m-s,
6264 (do_utf8 ? SVf_UTF8 : 0) | make_mortal);
6267 /* The rx->minlen is in characters but we want to step
6268 * s ahead by bytes. */
6270 s = (char*)utf8_hop((U8*)m, len);
6272 s = m + len; /* Fake \n at the end */
6277 maxiters += slen * RX_NPARENS(rx);
6278 while (s < strend && --limit)
6282 rex_return = CALLREGEXEC(rx, (char*)s, (char*)strend, (char*)orig, 1,
6285 if (rex_return == 0)
6287 TAINT_IF(RX_MATCH_TAINTED(rx));
6288 /* we never pass the REXEC_COPY_STR flag, so it should
6289 * never get copied */
6290 assert(!RX_MATCH_COPIED(rx));
6291 m = RX_OFFS(rx)[0].start + orig;
6300 dstr = newSVpvn_flags(s, m-s,
6301 (do_utf8 ? SVf_UTF8 : 0) | make_mortal);
6304 if (RX_NPARENS(rx)) {
6306 for (i = 1; i <= (I32)RX_NPARENS(rx); i++) {
6307 s = RX_OFFS(rx)[i].start + orig;
6308 m = RX_OFFS(rx)[i].end + orig;
6310 /* japhy (07/27/01) -- the (m && s) test doesn't catch
6311 parens that didn't match -- they should be set to
6312 undef, not the empty string */
6320 if (m >= orig && s >= orig) {
6321 dstr = newSVpvn_flags(s, m-s,
6322 (do_utf8 ? SVf_UTF8 : 0)
6326 dstr = &PL_sv_undef; /* undef, not "" */
6332 s = RX_OFFS(rx)[0].end + orig;
6336 if (!gimme_scalar) {
6337 iters = (SP - PL_stack_base) - base;
6339 if (iters > maxiters)
6340 DIE(aTHX_ "Split loop");
6342 /* keep field after final delim? */
6343 if (s < strend || (iters && origlimit)) {
6344 if (!gimme_scalar) {
6345 const STRLEN l = strend - s;
6346 dstr = newSVpvn_flags(s, l, (do_utf8 ? SVf_UTF8 : 0) | make_mortal);
6351 else if (!origlimit) {
6353 iters -= trailing_empty;
6355 while (iters > 0 && (!TOPs || !SvANY(TOPs) || SvCUR(TOPs) == 0)) {
6356 if (TOPs && !make_mortal)
6365 LEAVE_SCOPE(oldsave); /* may undo an earlier SWITCHSTACK */
6369 if (SvSMAGICAL(ary)) {
6371 mg_set(MUTABLE_SV(ary));
6374 if (gimme == G_ARRAY) {
6376 Copy(AvARRAY(ary), SP + 1, iters, SV*);
6383 ENTER_with_name("call_PUSH");
6384 call_sv(SV_CONST(PUSH),G_SCALAR|G_DISCARD|G_METHOD_NAMED);
6385 LEAVE_with_name("call_PUSH");
6387 if (gimme == G_ARRAY) {
6389 /* EXTEND should not be needed - we just popped them */
6391 for (i=0; i < iters; i++) {
6392 SV **svp = av_fetch(ary, i, FALSE);
6393 PUSHs((svp) ? *svp : &PL_sv_undef);
6400 if (gimme == G_ARRAY)
6412 SV *const sv = PAD_SVl(PL_op->op_targ);
6414 if (SvPADSTALE(sv)) {
6417 RETURNOP(cLOGOP->op_other);
6419 RETURNOP(cLOGOP->op_next);
6428 if (SvTYPE(retsv) == SVt_PVAV || SvTYPE(retsv) == SVt_PVHV
6429 || SvTYPE(retsv) == SVt_PVCV) {
6430 retsv = refto(retsv);
6437 /* used for: pp_padany(), pp_custom(); plus any system ops
6438 * that aren't implemented on a particular platform */
6440 PP(unimplemented_op)
6442 const Optype op_type = PL_op->op_type;
6443 /* Using OP_NAME() isn't going to be helpful here. Firstly, it doesn't cope
6444 with out of range op numbers - it only "special" cases op_custom.
6445 Secondly, as the three ops we "panic" on are padmy, mapstart and custom,
6446 if we get here for a custom op then that means that the custom op didn't
6447 have an implementation. Given that OP_NAME() looks up the custom op
6448 by its pp_addr, likely it will return NULL, unless someone (unhelpfully)
6449 registers &PL_unimplemented_op as the address of their custom op.
6450 NULL doesn't generate a useful error message. "custom" does. */
6451 const char *const name = op_type >= OP_max
6452 ? "[out of range]" : PL_op_name[PL_op->op_type];
6453 if(OP_IS_SOCKET(op_type))
6454 DIE(aTHX_ PL_no_sock_func, name);
6455 DIE(aTHX_ "panic: unimplemented op %s (#%d) called", name, op_type);
6459 S_maybe_unwind_defav(pTHX)
6461 if (CX_CUR()->cx_type & CXp_HASARGS) {
6462 PERL_CONTEXT *cx = CX_CUR();
6464 assert(CxHASARGS(cx));
6466 cx->cx_type &= ~CXp_HASARGS;
6470 /* For sorting out arguments passed to a &CORE:: subroutine */
6474 int opnum = SvIOK(cSVOP_sv) ? (int)SvUV(cSVOP_sv) : 0;
6475 int defgv = PL_opargs[opnum] & OA_DEFGV ||opnum==OP_GLOB, whicharg = 0;
6476 AV * const at_ = GvAV(PL_defgv);
6477 SV **svp = at_ ? AvARRAY(at_) : NULL;
6478 I32 minargs = 0, maxargs = 0, numargs = at_ ? AvFILLp(at_)+1 : 0;
6479 I32 oa = opnum ? PL_opargs[opnum] >> OASHIFT : 0;
6480 bool seen_question = 0;
6481 const char *err = NULL;
6482 const bool pushmark = PL_op->op_private & OPpCOREARGS_PUSHMARK;
6484 /* Count how many args there are first, to get some idea how far to
6485 extend the stack. */
6487 if ((oa & 7) == OA_LIST) { maxargs = I32_MAX; break; }
6489 if (oa & OA_OPTIONAL) seen_question = 1;
6490 if (!seen_question) minargs++;
6494 if(numargs < minargs) err = "Not enough";
6495 else if(numargs > maxargs) err = "Too many";
6497 /* diag_listed_as: Too many arguments for %s */
6499 "%s arguments for %s", err,
6500 opnum ? PL_op_desc[opnum] : SvPV_nolen_const(cSVOP_sv)
6503 /* Reset the stack pointer. Without this, we end up returning our own
6504 arguments in list context, in addition to the values we are supposed
6505 to return. nextstate usually does this on sub entry, but we need
6506 to run the next op with the caller's hints, so we cannot have a
6508 SP = PL_stack_base + CX_CUR()->blk_oldsp;
6510 if(!maxargs) RETURN;
6512 /* We do this here, rather than with a separate pushmark op, as it has
6513 to come in between two things this function does (stack reset and
6514 arg pushing). This seems the easiest way to do it. */
6517 (void)Perl_pp_pushmark(aTHX);
6520 EXTEND(SP, maxargs == I32_MAX ? numargs : maxargs);
6521 PUTBACK; /* The code below can die in various places. */
6523 oa = PL_opargs[opnum] >> OASHIFT;
6524 for (; oa&&(numargs||!pushmark); (void)(numargs&&(++svp,--numargs))) {
6529 if (!numargs && defgv && whicharg == minargs + 1) {
6532 else PUSHs(numargs ? svp && *svp ? *svp : &PL_sv_undef : NULL);
6536 PUSHs(svp && *svp ? *svp : &PL_sv_undef);
6543 if (CvUNIQUE(find_runcv_where(FIND_RUNCV_level_eq,1,NULL)))
6546 S_maybe_unwind_defav(aTHX);
6549 PUSHs((SV *)GvAVn(gv));
6552 if (!svp || !*svp || !SvROK(*svp)
6553 || SvTYPE(SvRV(*svp)) != SVt_PVAV)
6555 /* diag_listed_as: Type of arg %d to &CORE::%s must be %s*/
6556 "Type of arg %d to &CORE::%s must be array reference",
6557 whicharg, PL_op_desc[opnum]
6562 if (!svp || !*svp || !SvROK(*svp)
6563 || ( SvTYPE(SvRV(*svp)) != SVt_PVHV
6564 && ( opnum == OP_DBMCLOSE || opnum == OP_DBMOPEN
6565 || SvTYPE(SvRV(*svp)) != SVt_PVAV )))
6567 /* diag_listed_as: Type of arg %d to &CORE::%s must be %s*/
6568 "Type of arg %d to &CORE::%s must be hash%s reference",
6569 whicharg, PL_op_desc[opnum],
6570 opnum == OP_DBMCLOSE || opnum == OP_DBMOPEN
6577 if (!numargs) PUSHs(NULL);
6578 else if(svp && *svp && SvROK(*svp) && isGV_with_GP(SvRV(*svp)))
6579 /* no magic here, as the prototype will have added an extra
6580 refgen and we just want what was there before that */
6583 const bool constr = PL_op->op_private & whicharg;
6585 svp && *svp ? *svp : &PL_sv_undef,
6586 constr, cBOOL(CopHINTS_get(PL_curcop) & HINT_STRICT_REFS),
6592 if (!numargs) goto try_defsv;
6594 const bool wantscalar =
6595 PL_op->op_private & OPpCOREARGS_SCALARMOD;
6596 if (!svp || !*svp || !SvROK(*svp)
6597 /* We have to permit globrefs even for the \$ proto, as
6598 *foo is indistinguishable from ${\*foo}, and the proto-
6599 type permits the latter. */
6600 || SvTYPE(SvRV(*svp)) > (
6601 wantscalar ? SVt_PVLV
6602 : opnum == OP_LOCK || opnum == OP_UNDEF
6608 "Type of arg %d to &CORE::%s must be %s",
6609 whicharg, PL_op_name[opnum],
6611 ? "scalar reference"
6612 : opnum == OP_LOCK || opnum == OP_UNDEF
6613 ? "reference to one of [$@%&*]"
6614 : "reference to one of [$@%*]"
6617 if (opnum == OP_UNDEF && SvRV(*svp) == (SV *)PL_defgv) {
6618 /* Undo @_ localisation, so that sub exit does not undo
6619 part of our undeffing. */
6620 S_maybe_unwind_defav(aTHX);
6625 DIE(aTHX_ "panic: unknown OA_*: %x", (unsigned)(oa&7));
6633 /* Implement CORE::keys(),values(),each().
6635 * We won't know until run-time whether the arg is an array or hash,
6638 * pp_keys/pp_values/pp_each
6640 * pp_akeys/pp_avalues/pp_aeach
6642 * as appropriate (or whatever pp function actually implements the OP_FOO
6643 * functionality for each FOO).
6650 (SvTYPE(TOPs) == SVt_PVAV ? OP_AEACH : OP_EACH)
6651 + (PL_op->op_private & OPpAVHVSWITCH_MASK)
6659 if (PL_op->op_private & OPpOFFBYONE) {
6660 cv = find_runcv_where(FIND_RUNCV_level_eq, 1, NULL);
6662 else cv = find_runcv(NULL);
6663 XPUSHs(CvEVAL(cv) ? &PL_sv_undef : sv_2mortal(newRV((SV *)cv)));
6668 S_localise_aelem_lval(pTHX_ AV * const av, SV * const keysv,
6669 const bool can_preserve)
6671 const SSize_t ix = SvIV(keysv);
6672 if (can_preserve ? av_exists(av, ix) : TRUE) {
6673 SV ** const svp = av_fetch(av, ix, 1);
6675 Perl_croak(aTHX_ PL_no_aelem, ix);
6676 save_aelem(av, ix, svp);
6679 SAVEADELETE(av, ix);
6683 S_localise_helem_lval(pTHX_ HV * const hv, SV * const keysv,
6684 const bool can_preserve)
6686 if (can_preserve ? hv_exists_ent(hv, keysv, 0) : TRUE) {
6687 HE * const he = hv_fetch_ent(hv, keysv, 1, 0);
6688 SV ** const svp = he ? &HeVAL(he) : NULL;
6690 Perl_croak(aTHX_ PL_no_helem_sv, SVfARG(keysv));
6691 save_helem_flags(hv, keysv, svp, 0);
6694 SAVEHDELETE(hv, keysv);
6698 S_localise_gv_slot(pTHX_ GV *gv, U8 type)
6700 if (type == OPpLVREF_SV) {
6701 save_pushptrptr(gv, SvREFCNT_inc_simple(GvSV(gv)), SAVEt_GVSV);
6704 else if (type == OPpLVREF_AV)
6705 /* XXX Inefficient, as it creates a new AV, which we are
6706 about to clobber. */
6709 assert(type == OPpLVREF_HV);
6710 /* XXX Likewise inefficient. */
6719 SV * const key = PL_op->op_private & OPpLVREF_ELEM ? POPs : NULL;
6720 SV * const left = PL_op->op_flags & OPf_STACKED ? POPs : NULL;
6722 const char *bad = NULL;
6723 const U8 type = PL_op->op_private & OPpLVREF_TYPE;
6724 if (!SvROK(sv)) DIE(aTHX_ "Assigned value is not a reference");
6727 if (SvTYPE(SvRV(sv)) > SVt_PVLV)
6731 if (SvTYPE(SvRV(sv)) != SVt_PVAV)
6735 if (SvTYPE(SvRV(sv)) != SVt_PVHV)
6739 if (SvTYPE(SvRV(sv)) != SVt_PVCV)
6743 /* diag_listed_as: Assigned value is not %s reference */
6744 DIE(aTHX_ "Assigned value is not a%s reference", bad);
6748 switch (left ? SvTYPE(left) : 0) {
6751 SV * const old = PAD_SV(ARGTARG);
6752 PAD_SETSV(ARGTARG, SvREFCNT_inc_NN(SvRV(sv)));
6754 if ((PL_op->op_private & (OPpLVAL_INTRO|OPpPAD_STATE))
6756 SAVECLEARSV(PAD_SVl(ARGTARG));
6760 if (PL_op->op_private & OPpLVAL_INTRO) {
6761 S_localise_gv_slot(aTHX_ (GV *)left, type);
6763 gv_setref(left, sv);
6768 if (UNLIKELY(PL_op->op_private & OPpLVAL_INTRO)) {
6769 S_localise_aelem_lval(aTHX_ (AV *)left, key,
6770 SvCANEXISTDELETE(left));
6772 av_store((AV *)left, SvIV(key), SvREFCNT_inc_simple_NN(SvRV(sv)));
6775 if (UNLIKELY(PL_op->op_private & OPpLVAL_INTRO)) {
6777 S_localise_helem_lval(aTHX_ (HV *)left, key,
6778 SvCANEXISTDELETE(left));
6780 (void)hv_store_ent((HV *)left, key, SvREFCNT_inc_simple_NN(SvRV(sv)), 0);
6782 if (PL_op->op_flags & OPf_MOD)
6783 SETs(sv_2mortal(newSVsv(sv)));
6784 /* XXX else can weak references go stale before they are read, e.g.,
6793 SV * const ret = sv_2mortal(newSV_type(SVt_PVMG));
6794 SV * const elem = PL_op->op_private & OPpLVREF_ELEM ? POPs : NULL;
6795 SV * const arg = PL_op->op_flags & OPf_STACKED ? POPs : NULL;
6796 MAGIC * const mg = sv_magicext(ret, arg, PERL_MAGIC_lvref,
6797 &PL_vtbl_lvref, (char *)elem,
6798 elem ? HEf_SVKEY : (I32)ARGTARG);
6799 mg->mg_private = PL_op->op_private;
6800 if (PL_op->op_private & OPpLVREF_ITER)
6801 mg->mg_flags |= MGf_PERSIST;
6802 if (UNLIKELY(PL_op->op_private & OPpLVAL_INTRO)) {
6808 const bool can_preserve = SvCANEXISTDELETE(arg);
6809 if (SvTYPE(arg) == SVt_PVAV)
6810 S_localise_aelem_lval(aTHX_ (AV *)arg, elem, can_preserve);
6812 S_localise_helem_lval(aTHX_ (HV *)arg, elem, can_preserve);
6816 S_localise_gv_slot(aTHX_ (GV *)arg,
6817 PL_op->op_private & OPpLVREF_TYPE);
6819 else if (!(PL_op->op_private & OPpPAD_STATE))
6820 SAVECLEARSV(PAD_SVl(ARGTARG));
6829 AV * const av = (AV *)POPs;
6830 const bool localizing = PL_op->op_private & OPpLVAL_INTRO;
6831 bool can_preserve = FALSE;
6833 if (UNLIKELY(localizing)) {
6838 can_preserve = SvCANEXISTDELETE(av);
6840 if (SvTYPE(av) == SVt_PVAV) {
6843 for (svp = MARK + 1; svp <= SP; svp++) {
6844 const SSize_t elem = SvIV(*svp);
6848 if (max > AvMAX(av))
6853 while (++MARK <= SP) {
6854 SV * const elemsv = *MARK;
6855 if (UNLIKELY(localizing)) {
6856 if (SvTYPE(av) == SVt_PVAV)
6857 S_localise_aelem_lval(aTHX_ av, elemsv, can_preserve);
6859 S_localise_helem_lval(aTHX_ (HV *)av, elemsv, can_preserve);
6861 *MARK = sv_2mortal(newSV_type(SVt_PVMG));
6862 sv_magic(*MARK,(SV *)av,PERL_MAGIC_lvref,(char *)elemsv,HEf_SVKEY);
6869 if (PL_op->op_flags & OPf_STACKED)
6870 Perl_pp_rv2av(aTHX);
6872 Perl_pp_padav(aTHX);
6876 SETs(0); /* special alias marker that aassign recognises */
6886 SETs(sv_2mortal((SV *)newCONSTSUB(SvTYPE(CopSTASH(PL_curcop))==SVt_PVHV
6887 ? CopSTASH(PL_curcop)
6889 NULL, SvREFCNT_inc_simple_NN(sv))));
6894 /* process one subroutine argument - typically when the sub has a signature:
6895 * introduce PL_curpad[op_targ] and assign to it the value
6896 * for $: (OPf_STACKED ? *sp : $_[N])
6897 * for @/%: @_[N..$#_]
6899 * It's equivalent to
6902 * my $foo = (value-on-stack)
6904 * my @foo = @_[N..$#_]
6914 AV *defav = GvAV(PL_defgv); /* @_ */
6915 IV ix = PTR2IV(cUNOP_AUXo->op_aux);
6918 /* do 'my $var, @var or %var' action */
6919 padentry = &(PAD_SVl(o->op_targ));
6920 save_clearsv(padentry);
6923 if ((o->op_private & OPpARGELEM_MASK) == OPpARGELEM_SV) {
6924 if (o->op_flags & OPf_STACKED) {
6931 /* should already have been checked */
6933 #if IVSIZE > PTRSIZE
6934 assert(ix <= SSize_t_MAX);
6937 svp = av_fetch(defav, ix, FALSE);
6938 val = svp ? *svp : &PL_sv_undef;
6943 /* cargo-culted from pp_sassign */
6944 assert(TAINTING_get || !TAINT_get);
6945 if (UNLIKELY(TAINT_get) && !SvTAINTED(val))
6948 SvSetMagicSV(targ, val);
6952 /* must be AV or HV */
6954 assert(!(o->op_flags & OPf_STACKED));
6955 argc = ((IV)AvFILL(defav) + 1) - ix;
6957 /* This is a copy of the relevant parts of pp_aassign().
6959 if ((o->op_private & OPpARGELEM_MASK) == OPpARGELEM_AV) {
6962 if (AvFILL((AV*)targ) > -1) {
6963 /* target should usually be empty. If we get get
6964 * here, someone's been doing some weird closure tricks.
6965 * Make a copy of all args before clearing the array,
6966 * to avoid the equivalent of @a = ($a[0]) prematurely freeing
6967 * elements. See similar code in pp_aassign.
6969 for (i = 0; i < argc; i++) {
6970 SV **svp = av_fetch(defav, ix + i, FALSE);
6971 SV *newsv = newSV(0);
6972 sv_setsv_flags(newsv,
6973 svp ? *svp : &PL_sv_undef,
6974 (SV_DO_COW_SVSETSV|SV_NOSTEAL));
6975 if (!av_store(defav, ix + i, newsv))
6976 SvREFCNT_dec_NN(newsv);
6978 av_clear((AV*)targ);
6984 av_extend((AV*)targ, argc);
6989 SV **svp = av_fetch(defav, ix + i, FALSE);
6990 SV *val = svp ? *svp : &PL_sv_undef;
6992 sv_setsv(tmpsv, val);
6993 av_store((AV*)targ, i++, tmpsv);
7001 assert((o->op_private & OPpARGELEM_MASK) == OPpARGELEM_HV);
7003 if (SvRMAGICAL(targ) || HvUSEDKEYS((HV*)targ)) {
7004 /* see "target should usually be empty" comment above */
7005 for (i = 0; i < argc; i++) {
7006 SV **svp = av_fetch(defav, ix + i, FALSE);
7007 SV *newsv = newSV(0);
7008 sv_setsv_flags(newsv,
7009 svp ? *svp : &PL_sv_undef,
7010 (SV_DO_COW_SVSETSV|SV_NOSTEAL));
7011 if (!av_store(defav, ix + i, newsv))
7012 SvREFCNT_dec_NN(newsv);
7014 hv_clear((HV*)targ);
7019 assert(argc % 2 == 0);
7028 svp = av_fetch(defav, ix + i++, FALSE);
7029 key = svp ? *svp : &PL_sv_undef;
7030 svp = av_fetch(defav, ix + i++, FALSE);
7031 val = svp ? *svp : &PL_sv_undef;
7034 if (UNLIKELY(SvGMAGICAL(key)))
7035 key = sv_mortalcopy(key);
7037 sv_setsv(tmpsv, val);
7038 hv_store_ent((HV*)targ, key, tmpsv, 0);
7046 /* Handle a default value for one subroutine argument (typically as part
7047 * of a subroutine signature).
7048 * It's equivalent to
7049 * @_ > op_targ ? $_[op_targ] : result_of(op_other)
7051 * Intended to be used where op_next is an OP_ARGELEM
7053 * We abuse the op_targ field slightly: it's an index into @_ rather than
7059 OP * const o = PL_op;
7060 AV *defav = GvAV(PL_defgv); /* @_ */
7061 IV ix = (IV)o->op_targ;
7064 #if IVSIZE > PTRSIZE
7065 assert(ix <= SSize_t_MAX);
7068 if (AvFILL(defav) >= ix) {
7070 SV **svp = av_fetch(defav, ix, FALSE);
7071 SV *val = svp ? *svp : &PL_sv_undef;
7075 return cLOGOPo->op_other;
7080 S_find_runcv_name(void)
7095 sv = sv_2mortal(newSV(0));
7096 gv_fullname4(sv, gv, NULL, TRUE);
7100 /* Check a a subs arguments - i.e. that it has the correct number of args
7101 * (and anything else we might think of in future). Typically used with
7107 OP * const o = PL_op;
7108 UNOP_AUX_item *aux = cUNOP_AUXo->op_aux;
7109 IV params = aux[0].iv;
7110 IV opt_params = aux[1].iv;
7111 char slurpy = (char)(aux[2].iv);
7112 AV *defav = GvAV(PL_defgv); /* @_ */
7116 assert(!SvMAGICAL(defav));
7117 argc = (AvFILLp(defav) + 1);
7118 too_few = (argc < (params - opt_params));
7120 if (UNLIKELY(too_few || (!slurpy && argc > params)))
7121 /* diag_listed_as: Too few arguments for subroutine '%s' */
7122 /* diag_listed_as: Too many arguments for subroutine '%s' */
7123 Perl_croak_caller("Too %s arguments for subroutine '%" SVf "'",
7124 too_few ? "few" : "many", S_find_runcv_name());
7126 if (UNLIKELY(slurpy == '%' && argc > params && (argc - params) % 2))
7127 /* diag_listed_as: Odd name/value argument for subroutine '%s' */
7128 Perl_croak_caller("Odd name/value argument for subroutine '%" SVf "'",
7129 S_find_runcv_name());
7135 * ex: set ts=8 sts=4 sw=4 et: