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.
32 #include "regcharclass.h"
34 /* XXX I can't imagine anyone who doesn't have this actually _needs_
35 it, since pid_t is an integral type.
38 #ifdef NEED_GETPID_PROTO
39 extern Pid_t getpid (void);
43 * Some BSDs and Cygwin default to POSIX math instead of IEEE.
44 * This switches them over to IEEE.
46 #if defined(LIBM_LIB_VERSION)
47 _LIB_VERSION_TYPE _LIB_VERSION = _IEEE_;
50 static const STRLEN small_mu_len = sizeof(GREEK_SMALL_LETTER_MU_UTF8) - 1;
51 static const STRLEN capital_iota_len = sizeof(GREEK_CAPITAL_LETTER_IOTA_UTF8) - 1;
53 /* variations on pp_null */
58 if (GIMME_V == G_SCALAR)
65 /* This is also called directly by pp_lvavref. */
70 assert(SvTYPE(TARG) == SVt_PVAV);
71 if (UNLIKELY( PL_op->op_private & OPpLVAL_INTRO ))
72 if (LIKELY( !(PL_op->op_private & OPpPAD_STATE) ))
73 SAVECLEARSV(PAD_SVl(PL_op->op_targ));
75 if (PL_op->op_flags & OPf_REF) {
78 } else if (PL_op->op_private & OPpMAYBE_LVSUB) {
79 const I32 flags = is_lvalue_sub();
80 if (flags && !(flags & OPpENTERSUB_INARGS)) {
81 if (GIMME_V == G_SCALAR)
82 /* diag_listed_as: Can't return %s to lvalue scalar context */
83 Perl_croak(aTHX_ "Can't return array to lvalue scalar context");
89 if (gimme == G_ARRAY) {
90 /* XXX see also S_pushav in pp_hot.c */
91 const Size_t maxarg = AvFILL(MUTABLE_AV(TARG)) + 1;
93 if (SvMAGICAL(TARG)) {
95 for (i=0; i < maxarg; i++) {
96 SV * const * const svp = av_fetch(MUTABLE_AV(TARG), i, FALSE);
97 SP[i+1] = (svp) ? *svp : &PL_sv_undef;
102 for (i=0; i < (PADOFFSET)maxarg; i++) {
103 SV * const sv = AvARRAY((const AV *)TARG)[i];
104 SP[i+1] = sv ? sv : &PL_sv_undef;
109 else if (gimme == G_SCALAR) {
110 SV* const sv = sv_newmortal();
111 const SSize_t maxarg = AvFILL(MUTABLE_AV(TARG)) + 1;
112 sv_setiv(sv, maxarg);
123 assert(SvTYPE(TARG) == SVt_PVHV);
125 if (UNLIKELY( PL_op->op_private & OPpLVAL_INTRO ))
126 if (LIKELY( !(PL_op->op_private & OPpPAD_STATE) ))
127 SAVECLEARSV(PAD_SVl(PL_op->op_targ));
128 if (PL_op->op_flags & OPf_REF)
130 else if (PL_op->op_private & OPpMAYBE_LVSUB) {
131 const I32 flags = is_lvalue_sub();
132 if (flags && !(flags & OPpENTERSUB_INARGS)) {
133 if (GIMME_V == G_SCALAR)
134 /* diag_listed_as: Can't return %s to lvalue scalar context */
135 Perl_croak(aTHX_ "Can't return hash to lvalue scalar context");
140 if (gimme == G_ARRAY) {
141 RETURNOP(Perl_do_kv(aTHX));
143 else if ((PL_op->op_private & OPpTRUEBOOL
144 || ( PL_op->op_private & OPpMAYBE_TRUEBOOL
145 && block_gimme() == G_VOID ))
146 && (!SvRMAGICAL(TARG) || !mg_find(TARG, PERL_MAGIC_tied)))
147 SETs(HvUSEDKEYS(TARG) ? &PL_sv_yes : sv_2mortal(newSViv(0)));
148 else if (gimme == G_SCALAR) {
149 SV* const sv = Perl_hv_scalar(aTHX_ MUTABLE_HV(TARG));
158 assert(SvTYPE(TARG) == SVt_PVCV);
166 SvPADSTALE_off(TARG);
173 CV * const protocv = PadnamePROTOCV(
174 PadlistNAMESARRAY(CvPADLIST(find_runcv(NULL)))[ARGTARG]
176 assert(SvTYPE(TARG) == SVt_PVCV);
178 if (CvISXSUB(protocv)) { /* constant */
179 /* XXX Should we clone it here? */
180 /* If this changes to use SAVECLEARSV, we can move the SAVECLEARSV
181 to introcv and remove the SvPADSTALE_off. */
182 SAVEPADSVANDMORTALIZE(ARGTARG);
183 PAD_SVl(ARGTARG) = SvREFCNT_inc_simple_NN(protocv);
186 if (CvROOT(protocv)) {
187 assert(CvCLONE(protocv));
188 assert(!CvCLONED(protocv));
190 cv_clone_into(protocv,(CV *)TARG);
191 SAVECLEARSV(PAD_SVl(ARGTARG));
198 /* In some cases this function inspects PL_op. If this function is called
199 for new op types, more bool parameters may need to be added in place of
202 When noinit is true, the absence of a gv will cause a retval of undef.
203 This is unrelated to the cv-to-gv assignment case.
207 S_rv2gv(pTHX_ SV *sv, const bool vivify_sv, const bool strict,
210 if (!isGV(sv) || SvFAKE(sv)) SvGETMAGIC(sv);
213 sv = amagic_deref_call(sv, to_gv_amg);
217 if (SvTYPE(sv) == SVt_PVIO) {
218 GV * const gv = MUTABLE_GV(sv_newmortal());
219 gv_init(gv, 0, "__ANONIO__", 10, 0);
220 GvIOp(gv) = MUTABLE_IO(sv);
221 SvREFCNT_inc_void_NN(sv);
224 else if (!isGV_with_GP(sv)) {
225 Perl_die(aTHX_ "Not a GLOB reference");
229 if (!isGV_with_GP(sv)) {
231 /* If this is a 'my' scalar and flag is set then vivify
234 if (vivify_sv && sv != &PL_sv_undef) {
237 Perl_croak_no_modify();
238 if (cUNOP->op_targ) {
239 SV * const namesv = PAD_SV(cUNOP->op_targ);
240 HV *stash = CopSTASH(PL_curcop);
241 if (SvTYPE(stash) != SVt_PVHV) stash = NULL;
242 gv = MUTABLE_GV(newSV(0));
243 gv_init_sv(gv, stash, namesv, 0);
246 const char * const name = CopSTASHPV(PL_curcop);
247 gv = newGVgen_flags(name,
248 HvNAMEUTF8(CopSTASH(PL_curcop)) ? SVf_UTF8 : 0 );
249 SvREFCNT_inc_simple_void_NN(gv);
251 prepare_SV_for_RV(sv);
252 SvRV_set(sv, MUTABLE_SV(gv));
257 if (PL_op->op_flags & OPf_REF || strict) {
258 Perl_die(aTHX_ PL_no_usym, "a symbol");
260 if (ckWARN(WARN_UNINITIALIZED))
266 if (!(sv = MUTABLE_SV(gv_fetchsv_nomg(
267 sv, GV_ADDMG, SVt_PVGV
276 (SvPOKp(sv) && SvCUR(sv)>32 ? "..." : ""),
280 if ((PL_op->op_private & (OPpLVAL_INTRO|OPpDONT_INIT_GV))
281 == OPpDONT_INIT_GV) {
282 /* We are the target of a coderef assignment. Return
283 the scalar unchanged, and let pp_sasssign deal with
287 sv = MUTABLE_SV(gv_fetchsv_nomg(sv, GV_ADD, SVt_PVGV));
289 /* FAKE globs in the symbol table cause weird bugs (#77810) */
293 if (SvFAKE(sv) && !(PL_op->op_private & OPpALLOW_FAKE)) {
294 SV *newsv = sv_newmortal();
295 sv_setsv_flags(newsv, sv, 0);
307 sv, PL_op->op_private & OPpDEREF,
308 PL_op->op_private & HINT_STRICT_REFS,
309 ((PL_op->op_flags & OPf_SPECIAL) && !(PL_op->op_flags & OPf_MOD))
310 || PL_op->op_type == OP_READLINE
312 if (PL_op->op_private & OPpLVAL_INTRO)
313 save_gp(MUTABLE_GV(sv), !(PL_op->op_flags & OPf_SPECIAL));
318 /* Helper function for pp_rv2sv and pp_rv2av */
320 Perl_softref2xv(pTHX_ SV *const sv, const char *const what,
321 const svtype type, SV ***spp)
325 PERL_ARGS_ASSERT_SOFTREF2XV;
327 if (PL_op->op_private & HINT_STRICT_REFS) {
329 Perl_die(aTHX_ PL_no_symref_sv, sv,
330 (SvPOKp(sv) && SvCUR(sv)>32 ? "..." : ""), what);
332 Perl_die(aTHX_ PL_no_usym, what);
336 PL_op->op_flags & OPf_REF
338 Perl_die(aTHX_ PL_no_usym, what);
339 if (ckWARN(WARN_UNINITIALIZED))
341 if (type != SVt_PV && GIMME_V == G_ARRAY) {
345 **spp = &PL_sv_undef;
348 if ((PL_op->op_flags & OPf_SPECIAL) &&
349 !(PL_op->op_flags & OPf_MOD))
351 if (!(gv = gv_fetchsv_nomg(sv, GV_ADDMG, type)))
353 **spp = &PL_sv_undef;
358 gv = gv_fetchsv_nomg(sv, GV_ADD, type);
371 sv = amagic_deref_call(sv, to_sv_amg);
375 if (SvTYPE(sv) >= SVt_PVAV)
376 DIE(aTHX_ "Not a SCALAR reference");
381 if (!isGV_with_GP(gv)) {
382 gv = Perl_softref2xv(aTHX_ sv, "a SCALAR", SVt_PV, &sp);
388 if (PL_op->op_flags & OPf_MOD) {
389 if (PL_op->op_private & OPpLVAL_INTRO) {
390 if (cUNOP->op_first->op_type == OP_NULL)
391 sv = save_scalar(MUTABLE_GV(TOPs));
393 sv = save_scalar(gv);
395 Perl_croak(aTHX_ "%s", PL_no_localize_ref);
397 else if (PL_op->op_private & OPpDEREF)
398 sv = vivify_ref(sv, PL_op->op_private & OPpDEREF);
407 AV * const av = MUTABLE_AV(TOPs);
408 const I32 lvalue = PL_op->op_flags & OPf_MOD || LVRET;
410 SV ** const svp = Perl_av_arylen_p(aTHX_ MUTABLE_AV(av));
412 *svp = newSV_type(SVt_PVMG);
413 sv_magic(*svp, MUTABLE_SV(av), PERL_MAGIC_arylen, NULL, 0);
417 SETs(sv_2mortal(newSViv(AvFILL(MUTABLE_AV(av)))));
426 if (PL_op->op_flags & OPf_MOD || LVRET) {
427 SV * const ret = sv_2mortal(newSV_type(SVt_PVLV));/* Not TARG RT#67838 */
428 sv_magic(ret, NULL, PERL_MAGIC_pos, NULL, 0);
430 LvTARG(ret) = SvREFCNT_inc_simple(sv);
431 SETs(ret); /* no SvSETMAGIC */
434 const MAGIC * const mg = mg_find_mglob(sv);
435 if (mg && mg->mg_len != -1) {
437 STRLEN i = mg->mg_len;
438 if (mg->mg_flags & MGf_BYTES && DO_UTF8(sv))
439 i = sv_pos_b2u_flags(sv, i, SV_GMAGIC|SV_CONST_RETURN);
453 const I32 flags = (PL_op->op_flags & OPf_SPECIAL)
455 : ((PL_op->op_private & (OPpLVAL_INTRO|OPpMAY_RETURN_CONSTANT))
456 == OPpMAY_RETURN_CONSTANT)
459 /* We usually try to add a non-existent subroutine in case of AUTOLOAD. */
460 /* (But not in defined().) */
462 CV *cv = sv_2cv(TOPs, &stash_unused, &gv, flags);
464 else if ((flags == (GV_ADD|GV_NOEXPAND)) && gv && SvROK(gv)) {
465 cv = SvTYPE(SvRV(gv)) == SVt_PVCV
466 ? MUTABLE_CV(SvRV(gv))
470 cv = MUTABLE_CV(&PL_sv_undef);
471 SETs(MUTABLE_SV(cv));
481 SV *ret = &PL_sv_undef;
483 if (SvGMAGICAL(TOPs)) SETs(sv_mortalcopy(TOPs));
484 if (SvPOK(TOPs) && SvCUR(TOPs) >= 7) {
485 const char * s = SvPVX_const(TOPs);
486 if (strnEQ(s, "CORE::", 6)) {
487 const int code = keyword(s + 6, SvCUR(TOPs) - 6, 1);
489 DIE(aTHX_ "Can't find an opnumber for \"%"UTF8f"\"",
490 UTF8fARG(SvFLAGS(TOPs) & SVf_UTF8, SvCUR(TOPs)-6, s+6));
492 SV * const sv = core_prototype(NULL, s + 6, code, NULL);
498 cv = sv_2cv(TOPs, &stash, &gv, 0);
500 ret = newSVpvn_flags(
501 CvPROTO(cv), CvPROTOLEN(cv), SVs_TEMP | SvUTF8(cv)
511 CV *cv = MUTABLE_CV(PAD_SV(PL_op->op_targ));
513 cv = MUTABLE_CV(sv_2mortal(MUTABLE_SV(cv_clone(cv))));
515 PUSHs(MUTABLE_SV(cv));
529 if (GIMME_V != G_ARRAY) {
535 *MARK = &PL_sv_undef;
537 *MARK = refto(*MARK);
541 EXTEND_MORTAL(SP - MARK);
543 *MARK = refto(*MARK);
548 S_refto(pTHX_ SV *sv)
552 PERL_ARGS_ASSERT_REFTO;
554 if (SvTYPE(sv) == SVt_PVLV && LvTYPE(sv) == 'y') {
557 if (!(sv = LvTARG(sv)))
560 SvREFCNT_inc_void_NN(sv);
562 else if (SvTYPE(sv) == SVt_PVAV) {
563 if (!AvREAL((const AV *)sv) && AvREIFY((const AV *)sv))
564 av_reify(MUTABLE_AV(sv));
566 SvREFCNT_inc_void_NN(sv);
568 else if (SvPADTMP(sv)) {
573 SvREFCNT_inc_void_NN(sv);
576 sv_upgrade(rv, SVt_IV);
585 SV * const sv = TOPs;
593 /* use the return value that is in a register, its the same as TARG */
594 TARG = sv_ref(TARG,SvRV(sv),TRUE);
609 stash = CopSTASH(PL_curcop);
610 if (SvTYPE(stash) != SVt_PVHV)
611 Perl_croak(aTHX_ "Attempt to bless into a freed package");
614 SV * const ssv = POPs;
618 if (!ssv) goto curstash;
621 if (!SvAMAGIC(ssv)) {
623 Perl_croak(aTHX_ "Attempt to bless into a reference");
625 /* SvAMAGIC is on here, but it only means potentially overloaded,
626 so after stringification: */
627 ptr = SvPV_nomg_const(ssv,len);
628 /* We need to check the flag again: */
629 if (!SvAMAGIC(ssv)) goto frog;
631 else ptr = SvPV_nomg_const(ssv,len);
633 Perl_ck_warner(aTHX_ packWARN(WARN_MISC),
634 "Explicit blessing to '' (assuming package main)");
635 stash = gv_stashpvn(ptr, len, GV_ADD|SvUTF8(ssv));
638 (void)sv_bless(TOPs, stash);
648 const char * const elem = SvPV_const(sv, len);
649 GV * const gv = MUTABLE_GV(TOPs);
654 /* elem will always be NUL terminated. */
655 const char * const second_letter = elem + 1;
658 if (len == 5 && strEQ(second_letter, "RRAY"))
660 tmpRef = MUTABLE_SV(GvAV(gv));
661 if (tmpRef && !AvREAL((const AV *)tmpRef)
662 && AvREIFY((const AV *)tmpRef))
663 av_reify(MUTABLE_AV(tmpRef));
667 if (len == 4 && strEQ(second_letter, "ODE"))
668 tmpRef = MUTABLE_SV(GvCVu(gv));
671 if (len == 10 && strEQ(second_letter, "ILEHANDLE")) {
672 /* finally deprecated in 5.8.0 */
673 deprecate("*glob{FILEHANDLE}");
674 tmpRef = MUTABLE_SV(GvIOp(gv));
677 if (len == 6 && strEQ(second_letter, "ORMAT"))
678 tmpRef = MUTABLE_SV(GvFORM(gv));
681 if (len == 4 && strEQ(second_letter, "LOB"))
682 tmpRef = MUTABLE_SV(gv);
685 if (len == 4 && strEQ(second_letter, "ASH"))
686 tmpRef = MUTABLE_SV(GvHV(gv));
689 if (*second_letter == 'O' && !elem[2] && len == 2)
690 tmpRef = MUTABLE_SV(GvIOp(gv));
693 if (len == 4 && strEQ(second_letter, "AME"))
694 sv = newSVhek(GvNAME_HEK(gv));
697 if (len == 7 && strEQ(second_letter, "ACKAGE")) {
698 const HV * const stash = GvSTASH(gv);
699 const HEK * const hek = stash ? HvNAME_HEK(stash) : NULL;
700 sv = hek ? newSVhek(hek) : newSVpvs("__ANON__");
704 if (len == 6 && strEQ(second_letter, "CALAR"))
719 /* Pattern matching */
727 if (len == 0 || len > I32_MAX || !SvPOK(sv) || SvUTF8(sv) || SvVALID(sv)) {
728 /* Historically, study was skipped in these cases. */
733 /* Make study a no-op. It's no longer useful and its existence
734 complicates matters elsewhere. */
740 /* also used for: pp_transr() */
747 if (PL_op->op_flags & OPf_STACKED)
752 sv = PAD_SV(ARGTARG);
757 if(PL_op->op_type == OP_TRANSR) {
759 const char * const pv = SvPV(sv,len);
760 SV * const newsv = newSVpvn_flags(pv, len, SVs_TEMP|SvUTF8(sv));
765 mPUSHi(do_trans(sv));
770 /* Lvalue operators. */
773 S_do_chomp(pTHX_ SV *retval, SV *sv, bool chomping)
779 PERL_ARGS_ASSERT_DO_CHOMP;
781 if (chomping && (RsSNARF(PL_rs) || RsRECORD(PL_rs)))
783 if (SvTYPE(sv) == SVt_PVAV) {
785 AV *const av = MUTABLE_AV(sv);
786 const I32 max = AvFILL(av);
788 for (i = 0; i <= max; i++) {
789 sv = MUTABLE_SV(av_fetch(av, i, FALSE));
790 if (sv && ((sv = *(SV**)sv), sv != &PL_sv_undef))
791 count += do_chomp(retval, sv, chomping);
795 else if (SvTYPE(sv) == SVt_PVHV) {
796 HV* const hv = MUTABLE_HV(sv);
798 (void)hv_iterinit(hv);
799 while ((entry = hv_iternext(hv)))
800 count += do_chomp(retval, hv_iterval(hv,entry), chomping);
803 else if (SvREADONLY(sv)) {
804 Perl_croak_no_modify();
809 /* XXX, here sv is utf8-ized as a side-effect!
810 If encoding.pm is used properly, almost string-generating
811 operations, including literal strings, chr(), input data, etc.
812 should have been utf8-ized already, right?
814 sv_recode_to_utf8(sv, _get_encoding());
820 char *temp_buffer = NULL;
829 while (len && s[-1] == '\n') {
836 STRLEN rslen, rs_charlen;
837 const char *rsptr = SvPV_const(PL_rs, rslen);
839 rs_charlen = SvUTF8(PL_rs)
843 if (SvUTF8(PL_rs) != SvUTF8(sv)) {
844 /* Assumption is that rs is shorter than the scalar. */
846 /* RS is utf8, scalar is 8 bit. */
848 temp_buffer = (char*)bytes_from_utf8((U8*)rsptr,
851 /* Cannot downgrade, therefore cannot possibly match
853 assert (temp_buffer == rsptr);
859 else if (IN_ENCODING) {
860 /* RS is 8 bit, encoding.pm is used.
861 * Do not recode PL_rs as a side-effect. */
862 svrecode = newSVpvn(rsptr, rslen);
863 sv_recode_to_utf8(svrecode, _get_encoding());
864 rsptr = SvPV_const(svrecode, rslen);
865 rs_charlen = sv_len_utf8(svrecode);
868 /* RS is 8 bit, scalar is utf8. */
869 temp_buffer = (char*)bytes_to_utf8((U8*)rsptr, &rslen);
883 if (memNE(s, rsptr, rslen))
888 SvPV_force_nomg_nolen(sv);
896 SvREFCNT_dec(svrecode);
898 Safefree(temp_buffer);
900 if (len && (!SvPOK(sv) || SvIsCOW(sv)))
901 s = SvPV_force_nomg(sv, len);
904 char * const send = s + len;
905 char * const start = s;
907 while (s > start && UTF8_IS_CONTINUATION(*s))
909 if (is_utf8_string((U8*)s, send - s)) {
910 sv_setpvn(retval, s, send - s);
912 SvCUR_set(sv, s - start);
918 sv_setpvs(retval, "");
922 sv_setpvn(retval, s, 1);
929 sv_setpvs(retval, "");
936 /* also used for: pp_schomp() */
941 const bool chomping = PL_op->op_type == OP_SCHOMP;
943 const size_t count = do_chomp(TARG, TOPs, chomping);
945 sv_setiv(TARG, count);
951 /* also used for: pp_chomp() */
955 dSP; dMARK; dTARGET; dORIGMARK;
956 const bool chomping = PL_op->op_type == OP_CHOMP;
960 count += do_chomp(TARG, *++MARK, chomping);
962 sv_setiv(TARG, count);
973 if (!PL_op->op_private) {
985 if (SvTHINKFIRST(sv))
986 sv_force_normal_flags(sv, SV_COW_DROP_PV|SV_IMMEDIATE_UNREF);
988 switch (SvTYPE(sv)) {
992 av_undef(MUTABLE_AV(sv));
995 hv_undef(MUTABLE_HV(sv));
998 if (cv_const_sv((const CV *)sv))
999 Perl_ck_warner(aTHX_ packWARN(WARN_MISC),
1000 "Constant subroutine %"SVf" undefined",
1001 SVfARG(CvANON((const CV *)sv)
1002 ? newSVpvs_flags("(anonymous)", SVs_TEMP)
1003 : sv_2mortal(newSVhek(
1005 ? CvNAME_HEK((CV *)sv)
1006 : GvENAME_HEK(CvGV((const CV *)sv))
1011 /* let user-undef'd sub keep its identity */
1012 cv_undef_flags(MUTABLE_CV(sv), CV_UNDEF_KEEP_NAME);
1015 assert(isGV_with_GP(sv));
1016 assert(!SvFAKE(sv));
1021 /* undef *Pkg::meth_name ... */
1023 = GvCVu((const GV *)sv) && (stash = GvSTASH((const GV *)sv))
1024 && HvENAME_get(stash);
1026 if((stash = GvHV((const GV *)sv))) {
1027 if(HvENAME_get(stash))
1028 SvREFCNT_inc_simple_void_NN(sv_2mortal((SV *)stash));
1032 SvREFCNT_inc_simple_void_NN(sv_2mortal(sv));
1033 gp_free(MUTABLE_GV(sv));
1035 GvGP_set(sv, gp_ref(gp));
1036 #ifndef PERL_DONT_CREATE_GVSV
1037 GvSV(sv) = newSV(0);
1039 GvLINE(sv) = CopLINE(PL_curcop);
1040 GvEGV(sv) = MUTABLE_GV(sv);
1044 mro_package_moved(NULL, stash, (const GV *)sv, 0);
1046 /* undef *Foo::ISA */
1047 if( strEQ(GvNAME((const GV *)sv), "ISA")
1048 && (stash = GvSTASH((const GV *)sv))
1049 && (method_changed || HvENAME(stash)) )
1050 mro_isa_changed_in(stash);
1051 else if(method_changed)
1052 mro_method_changed_in(
1053 GvSTASH((const GV *)sv)
1059 if (SvTYPE(sv) >= SVt_PV && SvPVX_const(sv) && SvLEN(sv)) {
1073 /* also used for: pp_i_postdec() pp_i_postinc() pp_postdec() */
1079 PL_op->op_type == OP_POSTINC || PL_op->op_type == OP_I_POSTINC;
1080 if (SvTYPE(TOPs) >= SVt_PVAV || (isGV_with_GP(TOPs) && !SvFAKE(TOPs)))
1081 Perl_croak_no_modify();
1083 TARG = sv_newmortal();
1084 sv_setsv(TARG, TOPs);
1085 if (!SvREADONLY(TOPs) && !SvGMAGICAL(TOPs) && SvIOK_notUV(TOPs) && !SvNOK(TOPs) && !SvPOK(TOPs)
1086 && SvIVX(TOPs) != (inc ? IV_MAX : IV_MIN))
1088 SvIV_set(TOPs, SvIVX(TOPs) + (inc ? 1 : -1));
1089 SvFLAGS(TOPs) &= ~(SVp_NOK|SVp_POK);
1093 else sv_dec_nomg(TOPs);
1095 /* special case for undef: see thread at 2003-03/msg00536.html in archive */
1096 if (inc && !SvOK(TARG))
1102 /* Ordinary operators. */
1106 dSP; dATARGET; SV *svl, *svr;
1107 #ifdef PERL_PRESERVE_IVUV
1110 tryAMAGICbin_MG(pow_amg, AMGf_assign|AMGf_numeric);
1113 #ifdef PERL_PRESERVE_IVUV
1114 /* For integer to integer power, we do the calculation by hand wherever
1115 we're sure it is safe; otherwise we call pow() and try to convert to
1116 integer afterwards. */
1117 if (SvIV_please_nomg(svr) && SvIV_please_nomg(svl)) {
1125 const IV iv = SvIVX(svr);
1129 goto float_it; /* Can't do negative powers this way. */
1133 baseuok = SvUOK(svl);
1135 baseuv = SvUVX(svl);
1137 const IV iv = SvIVX(svl);
1140 baseuok = TRUE; /* effectively it's a UV now */
1142 baseuv = -iv; /* abs, baseuok == false records sign */
1145 /* now we have integer ** positive integer. */
1148 /* foo & (foo - 1) is zero only for a power of 2. */
1149 if (!(baseuv & (baseuv - 1))) {
1150 /* We are raising power-of-2 to a positive integer.
1151 The logic here will work for any base (even non-integer
1152 bases) but it can be less accurate than
1153 pow (base,power) or exp (power * log (base)) when the
1154 intermediate values start to spill out of the mantissa.
1155 With powers of 2 we know this can't happen.
1156 And powers of 2 are the favourite thing for perl
1157 programmers to notice ** not doing what they mean. */
1159 NV base = baseuok ? baseuv : -(NV)baseuv;
1164 while (power >>= 1) {
1172 SvIV_please_nomg(svr);
1175 unsigned int highbit = 8 * sizeof(UV);
1176 unsigned int diff = 8 * sizeof(UV);
1177 while (diff >>= 1) {
1179 if (baseuv >> highbit) {
1183 /* we now have baseuv < 2 ** highbit */
1184 if (power * highbit <= 8 * sizeof(UV)) {
1185 /* result will definitely fit in UV, so use UV math
1186 on same algorithm as above */
1189 const bool odd_power = cBOOL(power & 1);
1193 while (power >>= 1) {
1200 if (baseuok || !odd_power)
1201 /* answer is positive */
1203 else if (result <= (UV)IV_MAX)
1204 /* answer negative, fits in IV */
1205 SETi( -(IV)result );
1206 else if (result == (UV)IV_MIN)
1207 /* 2's complement assumption: special case IV_MIN */
1210 /* answer negative, doesn't fit */
1211 SETn( -(NV)result );
1219 NV right = SvNV_nomg(svr);
1220 NV left = SvNV_nomg(svl);
1223 #if defined(USE_LONG_DOUBLE) && defined(HAS_AIX_POWL_NEG_BASE_BUG)
1225 We are building perl with long double support and are on an AIX OS
1226 afflicted with a powl() function that wrongly returns NaNQ for any
1227 negative base. This was reported to IBM as PMR #23047-379 on
1228 03/06/2006. The problem exists in at least the following versions
1229 of AIX and the libm fileset, and no doubt others as well:
1231 AIX 4.3.3-ML10 bos.adt.libm 4.3.3.50
1232 AIX 5.1.0-ML04 bos.adt.libm 5.1.0.29
1233 AIX 5.2.0 bos.adt.libm 5.2.0.85
1235 So, until IBM fixes powl(), we provide the following workaround to
1236 handle the problem ourselves. Our logic is as follows: for
1237 negative bases (left), we use fmod(right, 2) to check if the
1238 exponent is an odd or even integer:
1240 - if odd, powl(left, right) == -powl(-left, right)
1241 - if even, powl(left, right) == powl(-left, right)
1243 If the exponent is not an integer, the result is rightly NaNQ, so
1244 we just return that (as NV_NAN).
1248 NV mod2 = Perl_fmod( right, 2.0 );
1249 if (mod2 == 1.0 || mod2 == -1.0) { /* odd integer */
1250 SETn( -Perl_pow( -left, right) );
1251 } else if (mod2 == 0.0) { /* even integer */
1252 SETn( Perl_pow( -left, right) );
1253 } else { /* fractional power */
1257 SETn( Perl_pow( left, right) );
1260 SETn( Perl_pow( left, right) );
1261 #endif /* HAS_AIX_POWL_NEG_BASE_BUG */
1263 #ifdef PERL_PRESERVE_IVUV
1265 SvIV_please_nomg(svr);
1273 dSP; dATARGET; SV *svl, *svr;
1274 tryAMAGICbin_MG(mult_amg, AMGf_assign|AMGf_numeric);
1277 #ifdef PERL_PRESERVE_IVUV
1278 if (SvIV_please_nomg(svr)) {
1279 /* Unless the left argument is integer in range we are going to have to
1280 use NV maths. Hence only attempt to coerce the right argument if
1281 we know the left is integer. */
1282 /* Left operand is defined, so is it IV? */
1283 if (SvIV_please_nomg(svl)) {
1284 bool auvok = SvUOK(svl);
1285 bool buvok = SvUOK(svr);
1286 const UV topmask = (~ (UV)0) << (4 * sizeof (UV));
1287 const UV botmask = ~((~ (UV)0) << (4 * sizeof (UV)));
1296 const IV aiv = SvIVX(svl);
1299 auvok = TRUE; /* effectively it's a UV now */
1301 /* abs, auvok == false records sign */
1302 alow = (aiv == IV_MIN) ? (UV)aiv : (UV)(-aiv);
1308 const IV biv = SvIVX(svr);
1311 buvok = TRUE; /* effectively it's a UV now */
1313 /* abs, buvok == false records sign */
1314 blow = (biv == IV_MIN) ? (UV)biv : (UV)(-biv);
1318 /* If this does sign extension on unsigned it's time for plan B */
1319 ahigh = alow >> (4 * sizeof (UV));
1321 bhigh = blow >> (4 * sizeof (UV));
1323 if (ahigh && bhigh) {
1325 /* eg 32 bit is at least 0x10000 * 0x10000 == 0x100000000
1326 which is overflow. Drop to NVs below. */
1327 } else if (!ahigh && !bhigh) {
1328 /* eg 32 bit is at most 0xFFFF * 0xFFFF == 0xFFFE0001
1329 so the unsigned multiply cannot overflow. */
1330 const UV product = alow * blow;
1331 if (auvok == buvok) {
1332 /* -ve * -ve or +ve * +ve gives a +ve result. */
1336 } else if (product <= (UV)IV_MIN) {
1337 /* 2s complement assumption that (UV)-IV_MIN is correct. */
1338 /* -ve result, which could overflow an IV */
1340 /* can't negate IV_MIN, but there are aren't two
1341 * integers such that !ahigh && !bhigh, where the
1342 * product equals 0x800....000 */
1343 assert(product != (UV)IV_MIN);
1344 SETi( -(IV)product );
1346 } /* else drop to NVs below. */
1348 /* One operand is large, 1 small */
1351 /* swap the operands */
1353 bhigh = blow; /* bhigh now the temp var for the swap */
1357 /* now, ((ahigh * blow) << half_UV_len) + (alow * blow)
1358 multiplies can't overflow. shift can, add can, -ve can. */
1359 product_middle = ahigh * blow;
1360 if (!(product_middle & topmask)) {
1361 /* OK, (ahigh * blow) won't lose bits when we shift it. */
1363 product_middle <<= (4 * sizeof (UV));
1364 product_low = alow * blow;
1366 /* as for pp_add, UV + something mustn't get smaller.
1367 IIRC ANSI mandates this wrapping *behaviour* for
1368 unsigned whatever the actual representation*/
1369 product_low += product_middle;
1370 if (product_low >= product_middle) {
1371 /* didn't overflow */
1372 if (auvok == buvok) {
1373 /* -ve * -ve or +ve * +ve gives a +ve result. */
1375 SETu( product_low );
1377 } else if (product_low <= (UV)IV_MIN) {
1378 /* 2s complement assumption again */
1379 /* -ve result, which could overflow an IV */
1381 SETi(product_low == (UV)IV_MIN
1382 ? IV_MIN : -(IV)product_low);
1384 } /* else drop to NVs below. */
1386 } /* product_middle too large */
1387 } /* ahigh && bhigh */
1392 NV right = SvNV_nomg(svr);
1393 NV left = SvNV_nomg(svl);
1395 SETn( left * right );
1402 dSP; dATARGET; SV *svl, *svr;
1403 tryAMAGICbin_MG(div_amg, AMGf_assign|AMGf_numeric);
1406 /* Only try to do UV divide first
1407 if ((SLOPPYDIVIDE is true) or
1408 (PERL_PRESERVE_IVUV is true and one or both SV is a UV too large
1410 The assumption is that it is better to use floating point divide
1411 whenever possible, only doing integer divide first if we can't be sure.
1412 If NV_PRESERVES_UV is true then we know at compile time that no UV
1413 can be too large to preserve, so don't need to compile the code to
1414 test the size of UVs. */
1417 # define PERL_TRY_UV_DIVIDE
1418 /* ensure that 20./5. == 4. */
1420 # ifdef PERL_PRESERVE_IVUV
1421 # ifndef NV_PRESERVES_UV
1422 # define PERL_TRY_UV_DIVIDE
1427 #ifdef PERL_TRY_UV_DIVIDE
1428 if (SvIV_please_nomg(svr) && SvIV_please_nomg(svl)) {
1429 bool left_non_neg = SvUOK(svl);
1430 bool right_non_neg = SvUOK(svr);
1434 if (right_non_neg) {
1438 const IV biv = SvIVX(svr);
1441 right_non_neg = TRUE; /* effectively it's a UV now */
1444 right = (biv == IV_MIN) ? (UV)biv : (UV)(-biv);
1447 /* historically undef()/0 gives a "Use of uninitialized value"
1448 warning before dieing, hence this test goes here.
1449 If it were immediately before the second SvIV_please, then
1450 DIE() would be invoked before left was even inspected, so
1451 no inspection would give no warning. */
1453 DIE(aTHX_ "Illegal division by zero");
1459 const IV aiv = SvIVX(svl);
1462 left_non_neg = TRUE; /* effectively it's a UV now */
1465 left = (aiv == IV_MIN) ? (UV)aiv : (UV)(-aiv);
1471 /* For sloppy divide we always attempt integer division. */
1473 /* Otherwise we only attempt it if either or both operands
1474 would not be preserved by an NV. If both fit in NVs
1475 we fall through to the NV divide code below. However,
1476 as left >= right to ensure integer result here, we know that
1477 we can skip the test on the right operand - right big
1478 enough not to be preserved can't get here unless left is
1481 && (left > ((UV)1 << NV_PRESERVES_UV_BITS))
1484 /* Integer division can't overflow, but it can be imprecise. */
1485 const UV result = left / right;
1486 if (result * right == left) {
1487 SP--; /* result is valid */
1488 if (left_non_neg == right_non_neg) {
1489 /* signs identical, result is positive. */
1493 /* 2s complement assumption */
1494 if (result <= (UV)IV_MIN)
1495 SETi(result == (UV)IV_MIN ? IV_MIN : -(IV)result);
1497 /* It's exact but too negative for IV. */
1498 SETn( -(NV)result );
1501 } /* tried integer divide but it was not an integer result */
1502 } /* else (PERL_ABS(result) < 1.0) or (both UVs in range for NV) */
1503 } /* one operand wasn't SvIOK */
1504 #endif /* PERL_TRY_UV_DIVIDE */
1506 NV right = SvNV_nomg(svr);
1507 NV left = SvNV_nomg(svl);
1508 (void)POPs;(void)POPs;
1509 #if defined(NAN_COMPARE_BROKEN) && defined(Perl_isnan)
1510 if (! Perl_isnan(right) && right == 0.0)
1514 DIE(aTHX_ "Illegal division by zero");
1515 PUSHn( left / right );
1523 tryAMAGICbin_MG(modulo_amg, AMGf_assign|AMGf_numeric);
1527 bool left_neg = FALSE;
1528 bool right_neg = FALSE;
1529 bool use_double = FALSE;
1530 bool dright_valid = FALSE;
1533 SV * const svr = TOPs;
1534 SV * const svl = TOPm1s;
1535 if (SvIV_please_nomg(svr)) {
1536 right_neg = !SvUOK(svr);
1540 const IV biv = SvIVX(svr);
1543 right_neg = FALSE; /* effectively it's a UV now */
1545 right = (biv == IV_MIN) ? (UV)biv : (UV)(-biv);
1550 dright = SvNV_nomg(svr);
1551 right_neg = dright < 0;
1554 if (dright < UV_MAX_P1) {
1555 right = U_V(dright);
1556 dright_valid = TRUE; /* In case we need to use double below. */
1562 /* At this point use_double is only true if right is out of range for
1563 a UV. In range NV has been rounded down to nearest UV and
1564 use_double false. */
1565 if (!use_double && SvIV_please_nomg(svl)) {
1566 left_neg = !SvUOK(svl);
1570 const IV aiv = SvIVX(svl);
1573 left_neg = FALSE; /* effectively it's a UV now */
1575 left = (aiv == IV_MIN) ? (UV)aiv : (UV)(-aiv);
1580 dleft = SvNV_nomg(svl);
1581 left_neg = dleft < 0;
1585 /* This should be exactly the 5.6 behaviour - if left and right are
1586 both in range for UV then use U_V() rather than floor. */
1588 if (dleft < UV_MAX_P1) {
1589 /* right was in range, so is dleft, so use UVs not double.
1593 /* left is out of range for UV, right was in range, so promote
1594 right (back) to double. */
1596 /* The +0.5 is used in 5.6 even though it is not strictly
1597 consistent with the implicit +0 floor in the U_V()
1598 inside the #if 1. */
1599 dleft = Perl_floor(dleft + 0.5);
1602 dright = Perl_floor(dright + 0.5);
1613 DIE(aTHX_ "Illegal modulus zero");
1615 dans = Perl_fmod(dleft, dright);
1616 if ((left_neg != right_neg) && dans)
1617 dans = dright - dans;
1620 sv_setnv(TARG, dans);
1626 DIE(aTHX_ "Illegal modulus zero");
1629 if ((left_neg != right_neg) && ans)
1632 /* XXX may warn: unary minus operator applied to unsigned type */
1633 /* could change -foo to be (~foo)+1 instead */
1634 if (ans <= ~((UV)IV_MAX)+1)
1635 sv_setiv(TARG, ~ans+1);
1637 sv_setnv(TARG, -(NV)ans);
1640 sv_setuv(TARG, ans);
1652 bool infnan = FALSE;
1654 if (GIMME_V == G_ARRAY && PL_op->op_private & OPpREPEAT_DOLIST) {
1655 /* TODO: think of some way of doing list-repeat overloading ??? */
1660 if (UNLIKELY(PL_op->op_private & OPpREPEAT_DOLIST)) {
1661 /* The parser saw this as a list repeat, and there
1662 are probably several items on the stack. But we're
1663 in scalar/void context, and there's no pp_list to save us
1664 now. So drop the rest of the items -- robin@kitsite.com
1667 if (MARK + 1 < SP) {
1673 ASSUME(MARK + 1 == SP);
1675 MARK[1] = &PL_sv_undef;
1679 tryAMAGICbin_MG(repeat_amg, AMGf_assign);
1685 const UV uv = SvUV_nomg(sv);
1687 count = IV_MAX; /* The best we can do? */
1691 count = SvIV_nomg(sv);
1694 else if (SvNOKp(sv)) {
1695 const NV nv = SvNV_nomg(sv);
1696 infnan = Perl_isinfnan(nv);
1697 if (UNLIKELY(infnan)) {
1701 count = -1; /* An arbitrary negative integer */
1707 count = SvIV_nomg(sv);
1710 Perl_ck_warner(aTHX_ packWARN(WARN_NUMERIC),
1711 "Non-finite repeat count does nothing");
1712 } else if (count < 0) {
1714 Perl_ck_warner(aTHX_ packWARN(WARN_NUMERIC),
1715 "Negative repeat count does nothing");
1718 if (GIMME_V == G_ARRAY && PL_op->op_private & OPpREPEAT_DOLIST) {
1720 const Size_t items = SP - MARK;
1721 const U8 mod = PL_op->op_flags & OPf_MOD;
1726 if ( items > MEM_SIZE_MAX / (UV)count /* max would overflow */
1727 || items > (U32)I32_MAX / sizeof(SV *) /* repeatcpy would overflow */
1729 Perl_croak(aTHX_ "%s","Out of memory during list extend");
1730 max = items * count;
1735 if (mod && SvPADTMP(*SP)) {
1736 *SP = sv_mortalcopy(*SP);
1743 repeatcpy((char*)(MARK + items), (char*)MARK,
1744 items * sizeof(const SV *), count - 1);
1747 else if (count <= 0)
1750 else { /* Note: mark already snarfed by pp_list */
1751 SV * const tmpstr = POPs;
1756 sv_setsv_nomg(TARG, tmpstr);
1757 SvPV_force_nomg(TARG, len);
1758 isutf = DO_UTF8(TARG);
1765 if ( len > (MEM_SIZE_MAX-1) / (UV)count /* max would overflow */
1766 || len > (U32)I32_MAX /* repeatcpy would overflow */
1768 Perl_croak(aTHX_ "%s",
1769 "Out of memory during string extend");
1770 max = (UV)count * len + 1;
1773 repeatcpy(SvPVX(TARG) + len, SvPVX(TARG), len, count - 1);
1774 SvCUR_set(TARG, SvCUR(TARG) * count);
1776 *SvEND(TARG) = '\0';
1779 (void)SvPOK_only_UTF8(TARG);
1781 (void)SvPOK_only(TARG);
1790 dSP; dATARGET; bool useleft; SV *svl, *svr;
1791 tryAMAGICbin_MG(subtr_amg, AMGf_assign|AMGf_numeric);
1794 useleft = USE_LEFT(svl);
1795 #ifdef PERL_PRESERVE_IVUV
1796 /* See comments in pp_add (in pp_hot.c) about Overflow, and how
1797 "bad things" happen if you rely on signed integers wrapping. */
1798 if (SvIV_please_nomg(svr)) {
1799 /* Unless the left argument is integer in range we are going to have to
1800 use NV maths. Hence only attempt to coerce the right argument if
1801 we know the left is integer. */
1808 a_valid = auvok = 1;
1809 /* left operand is undef, treat as zero. */
1811 /* Left operand is defined, so is it IV? */
1812 if (SvIV_please_nomg(svl)) {
1813 if ((auvok = SvUOK(svl)))
1816 const IV aiv = SvIVX(svl);
1819 auvok = 1; /* Now acting as a sign flag. */
1820 } else { /* 2s complement assumption for IV_MIN */
1821 auv = (aiv == IV_MIN) ? (UV)aiv : (UV)-aiv;
1828 bool result_good = 0;
1831 bool buvok = SvUOK(svr);
1836 const IV biv = SvIVX(svr);
1841 buv = (biv == IV_MIN) ? (UV)biv : (UV)-biv;
1843 /* ?uvok if value is >= 0. basically, flagged as UV if it's +ve,
1844 else "IV" now, independent of how it came in.
1845 if a, b represents positive, A, B negative, a maps to -A etc
1850 all UV maths. negate result if A negative.
1851 subtract if signs same, add if signs differ. */
1853 if (auvok ^ buvok) {
1862 /* Must get smaller */
1867 if (result <= buv) {
1868 /* result really should be -(auv-buv). as its negation
1869 of true value, need to swap our result flag */
1881 if (result <= (UV)IV_MIN)
1882 SETi(result == (UV)IV_MIN
1883 ? IV_MIN : -(IV)result);
1885 /* result valid, but out of range for IV. */
1886 SETn( -(NV)result );
1890 } /* Overflow, drop through to NVs. */
1895 NV value = SvNV_nomg(svr);
1899 /* left operand is undef, treat as zero - value */
1903 SETn( SvNV_nomg(svl) - value );
1908 #define IV_BITS (IVSIZE * 8)
1910 static UV S_uv_shift(UV uv, int shift, bool left)
1916 if (shift >= IV_BITS) {
1919 return left ? uv << shift : uv >> shift;
1922 static IV S_iv_shift(IV iv, int shift, bool left)
1928 if (shift >= IV_BITS) {
1929 return iv < 0 && !left ? -1 : 0;
1931 return left ? iv << shift : iv >> shift;
1934 #define UV_LEFT_SHIFT(uv, shift) S_uv_shift(uv, shift, TRUE)
1935 #define UV_RIGHT_SHIFT(uv, shift) S_uv_shift(uv, shift, FALSE)
1936 #define IV_LEFT_SHIFT(iv, shift) S_iv_shift(iv, shift, TRUE)
1937 #define IV_RIGHT_SHIFT(iv, shift) S_iv_shift(iv, shift, FALSE)
1941 dSP; dATARGET; SV *svl, *svr;
1942 tryAMAGICbin_MG(lshift_amg, AMGf_assign|AMGf_numeric);
1946 const IV shift = SvIV_nomg(svr);
1947 if (PL_op->op_private & HINT_INTEGER) {
1948 SETi(IV_LEFT_SHIFT(SvIV_nomg(svl), shift));
1951 SETu(UV_LEFT_SHIFT(SvUV_nomg(svl), shift));
1959 dSP; dATARGET; SV *svl, *svr;
1960 tryAMAGICbin_MG(rshift_amg, AMGf_assign|AMGf_numeric);
1964 const IV shift = SvIV_nomg(svr);
1965 if (PL_op->op_private & HINT_INTEGER) {
1966 SETi(IV_RIGHT_SHIFT(SvIV_nomg(svl), shift));
1969 SETu(UV_RIGHT_SHIFT(SvUV_nomg(svl), shift));
1980 tryAMAGICbin_MG(lt_amg, AMGf_set|AMGf_numeric);
1984 (SvIOK_notUV(left) && SvIOK_notUV(right))
1985 ? (SvIVX(left) < SvIVX(right))
1986 : (do_ncmp(left, right) == -1)
1996 tryAMAGICbin_MG(gt_amg, AMGf_set|AMGf_numeric);
2000 (SvIOK_notUV(left) && SvIOK_notUV(right))
2001 ? (SvIVX(left) > SvIVX(right))
2002 : (do_ncmp(left, right) == 1)
2012 tryAMAGICbin_MG(le_amg, AMGf_set|AMGf_numeric);
2016 (SvIOK_notUV(left) && SvIOK_notUV(right))
2017 ? (SvIVX(left) <= SvIVX(right))
2018 : (do_ncmp(left, right) <= 0)
2028 tryAMAGICbin_MG(ge_amg, AMGf_set|AMGf_numeric);
2032 (SvIOK_notUV(left) && SvIOK_notUV(right))
2033 ? (SvIVX(left) >= SvIVX(right))
2034 : ( (do_ncmp(left, right) & 2) == 0)
2044 tryAMAGICbin_MG(ne_amg, AMGf_set|AMGf_numeric);
2048 (SvIOK_notUV(left) && SvIOK_notUV(right))
2049 ? (SvIVX(left) != SvIVX(right))
2050 : (do_ncmp(left, right) != 0)
2055 /* compare left and right SVs. Returns:
2059 * 2: left or right was a NaN
2062 Perl_do_ncmp(pTHX_ SV* const left, SV * const right)
2064 PERL_ARGS_ASSERT_DO_NCMP;
2065 #ifdef PERL_PRESERVE_IVUV
2066 /* Fortunately it seems NaN isn't IOK */
2067 if (SvIV_please_nomg(right) && SvIV_please_nomg(left)) {
2069 const IV leftiv = SvIVX(left);
2070 if (!SvUOK(right)) {
2071 /* ## IV <=> IV ## */
2072 const IV rightiv = SvIVX(right);
2073 return (leftiv > rightiv) - (leftiv < rightiv);
2075 /* ## IV <=> UV ## */
2077 /* As (b) is a UV, it's >=0, so it must be < */
2080 const UV rightuv = SvUVX(right);
2081 return ((UV)leftiv > rightuv) - ((UV)leftiv < rightuv);
2086 /* ## UV <=> UV ## */
2087 const UV leftuv = SvUVX(left);
2088 const UV rightuv = SvUVX(right);
2089 return (leftuv > rightuv) - (leftuv < rightuv);
2091 /* ## UV <=> IV ## */
2093 const IV rightiv = SvIVX(right);
2095 /* As (a) is a UV, it's >=0, so it cannot be < */
2098 const UV leftuv = SvUVX(left);
2099 return (leftuv > (UV)rightiv) - (leftuv < (UV)rightiv);
2102 NOT_REACHED; /* NOTREACHED */
2106 NV const rnv = SvNV_nomg(right);
2107 NV const lnv = SvNV_nomg(left);
2109 #if defined(NAN_COMPARE_BROKEN) && defined(Perl_isnan)
2110 if (Perl_isnan(lnv) || Perl_isnan(rnv)) {
2113 return (lnv > rnv) - (lnv < rnv);
2132 tryAMAGICbin_MG(ncmp_amg, AMGf_numeric);
2135 value = do_ncmp(left, right);
2147 /* also used for: pp_sge() pp_sgt() pp_slt() */
2153 int amg_type = sle_amg;
2157 switch (PL_op->op_type) {
2176 tryAMAGICbin_MG(amg_type, AMGf_set);
2180 #ifdef USE_LOCALE_COLLATE
2181 (IN_LC_RUNTIME(LC_COLLATE))
2182 ? sv_cmp_locale_flags(left, right, 0)
2185 sv_cmp_flags(left, right, 0);
2186 SETs(boolSV(cmp * multiplier < rhs));
2194 tryAMAGICbin_MG(seq_amg, AMGf_set);
2197 SETs(boolSV(sv_eq_flags(left, right, 0)));
2205 tryAMAGICbin_MG(sne_amg, AMGf_set);
2208 SETs(boolSV(!sv_eq_flags(left, right, 0)));
2216 tryAMAGICbin_MG(scmp_amg, 0);
2220 #ifdef USE_LOCALE_COLLATE
2221 (IN_LC_RUNTIME(LC_COLLATE))
2222 ? sv_cmp_locale_flags(left, right, 0)
2225 sv_cmp_flags(left, right, 0);
2234 tryAMAGICbin_MG(band_amg, AMGf_assign);
2237 if (SvNIOKp(left) || SvNIOKp(right)) {
2238 const bool left_ro_nonnum = !SvNIOKp(left) && SvREADONLY(left);
2239 const bool right_ro_nonnum = !SvNIOKp(right) && SvREADONLY(right);
2240 if (PL_op->op_private & HINT_INTEGER) {
2241 const IV i = SvIV_nomg(left) & SvIV_nomg(right);
2245 const UV u = SvUV_nomg(left) & SvUV_nomg(right);
2248 if (left_ro_nonnum && left != TARG) SvNIOK_off(left);
2249 if (right_ro_nonnum) SvNIOK_off(right);
2252 do_vop(PL_op->op_type, TARG, left, right);
2262 tryAMAGICbin_MG(band_amg, AMGf_assign|AMGf_numarg);
2264 dATARGET; dPOPTOPssrl;
2265 if (PL_op->op_private & HINT_INTEGER) {
2266 const IV i = SvIV_nomg(left) & SvIV_nomg(right);
2270 const UV u = SvUV_nomg(left) & SvUV_nomg(right);
2280 tryAMAGICbin_MG(sband_amg, AMGf_assign);
2282 dATARGET; dPOPTOPssrl;
2283 do_vop(OP_BIT_AND, TARG, left, right);
2288 /* also used for: pp_bit_xor() */
2293 const int op_type = PL_op->op_type;
2295 tryAMAGICbin_MG((op_type == OP_BIT_OR ? bor_amg : bxor_amg), AMGf_assign);
2298 if (SvNIOKp(left) || SvNIOKp(right)) {
2299 const bool left_ro_nonnum = !SvNIOKp(left) && SvREADONLY(left);
2300 const bool right_ro_nonnum = !SvNIOKp(right) && SvREADONLY(right);
2301 if (PL_op->op_private & HINT_INTEGER) {
2302 const IV l = (USE_LEFT(left) ? SvIV_nomg(left) : 0);
2303 const IV r = SvIV_nomg(right);
2304 const IV result = op_type == OP_BIT_OR ? (l | r) : (l ^ r);
2308 const UV l = (USE_LEFT(left) ? SvUV_nomg(left) : 0);
2309 const UV r = SvUV_nomg(right);
2310 const UV result = op_type == OP_BIT_OR ? (l | r) : (l ^ r);
2313 if (left_ro_nonnum && left != TARG) SvNIOK_off(left);
2314 if (right_ro_nonnum) SvNIOK_off(right);
2317 do_vop(op_type, TARG, left, right);
2324 /* also used for: pp_nbit_xor() */
2329 const int op_type = PL_op->op_type;
2331 tryAMAGICbin_MG((op_type == OP_NBIT_OR ? bor_amg : bxor_amg),
2332 AMGf_assign|AMGf_numarg);
2334 dATARGET; dPOPTOPssrl;
2335 if (PL_op->op_private & HINT_INTEGER) {
2336 const IV l = (USE_LEFT(left) ? SvIV_nomg(left) : 0);
2337 const IV r = SvIV_nomg(right);
2338 const IV result = op_type == OP_NBIT_OR ? (l | r) : (l ^ r);
2342 const UV l = (USE_LEFT(left) ? SvUV_nomg(left) : 0);
2343 const UV r = SvUV_nomg(right);
2344 const UV result = op_type == OP_NBIT_OR ? (l | r) : (l ^ r);
2351 /* also used for: pp_sbit_xor() */
2356 const int op_type = PL_op->op_type;
2358 tryAMAGICbin_MG((op_type == OP_SBIT_OR ? sbor_amg : sbxor_amg),
2361 dATARGET; dPOPTOPssrl;
2362 do_vop(op_type == OP_SBIT_OR ? OP_BIT_OR : OP_BIT_XOR, TARG, left,
2368 PERL_STATIC_INLINE bool
2369 S_negate_string(pTHX)
2374 SV * const sv = TOPs;
2375 if (!SvPOKp(sv) || SvNIOK(sv) || (!SvPOK(sv) && SvNIOKp(sv)))
2377 s = SvPV_nomg_const(sv, len);
2378 if (isIDFIRST(*s)) {
2379 sv_setpvs(TARG, "-");
2382 else if (*s == '+' || (*s == '-' && !looks_like_number(sv))) {
2383 sv_setsv_nomg(TARG, sv);
2384 *SvPV_force_nomg(TARG, len) = *s == '-' ? '+' : '-';
2394 tryAMAGICun_MG(neg_amg, AMGf_numeric);
2395 if (S_negate_string(aTHX)) return NORMAL;
2397 SV * const sv = TOPs;
2400 /* It's publicly an integer */
2403 if (SvIVX(sv) == IV_MIN) {
2404 /* 2s complement assumption. */
2405 SETi(SvIVX(sv)); /* special case: -((UV)IV_MAX+1) ==
2409 else if (SvUVX(sv) <= IV_MAX) {
2414 else if (SvIVX(sv) != IV_MIN) {
2418 #ifdef PERL_PRESERVE_IVUV
2425 if (SvNIOKp(sv) && (SvNIOK(sv) || !SvPOK(sv)))
2426 SETn(-SvNV_nomg(sv));
2427 else if (SvPOKp(sv) && SvIV_please_nomg(sv))
2428 goto oops_its_an_int;
2430 SETn(-SvNV_nomg(sv));
2438 tryAMAGICun_MG(not_amg, AMGf_set);
2439 *PL_stack_sp = boolSV(!SvTRUE_nomg(*PL_stack_sp));
2444 S_scomplement(pTHX_ SV *targ, SV *sv)
2450 sv_copypv_nomg(TARG, sv);
2451 tmps = (U8*)SvPV_nomg(TARG, len);
2454 /* Calculate exact length, let's not estimate. */
2459 U8 * const send = tmps + len;
2460 U8 * const origtmps = tmps;
2461 const UV utf8flags = UTF8_ALLOW_ANYUV;
2463 while (tmps < send) {
2464 const UV c = utf8n_to_uvchr(tmps, send-tmps, &l, utf8flags);
2466 targlen += UNISKIP(~c);
2472 /* Now rewind strings and write them. */
2479 Newx(result, targlen + 1, U8);
2481 while (tmps < send) {
2482 const UV c = utf8n_to_uvchr(tmps, send-tmps, &l, utf8flags);
2484 p = uvchr_to_utf8_flags(p, ~c, UNICODE_ALLOW_ANY);
2487 sv_usepvn_flags(TARG, (char*)result, targlen,
2488 SV_HAS_TRAILING_NUL);
2495 Newx(result, nchar + 1, U8);
2497 while (tmps < send) {
2498 const U8 c = (U8)utf8n_to_uvchr(tmps, send-tmps, &l, utf8flags);
2503 sv_usepvn_flags(TARG, (char*)result, nchar, SV_HAS_TRAILING_NUL);
2511 for ( ; anum && (unsigned long)tmps % sizeof(long); anum--, tmps++)
2514 for ( ; anum >= (I32)sizeof(long); anum -= (I32)sizeof(long), tmpl++)
2519 for ( ; anum > 0; anum--, tmps++)
2526 tryAMAGICun_MG(compl_amg, AMGf_numeric);
2530 if (PL_op->op_private & HINT_INTEGER) {
2531 const IV i = ~SvIV_nomg(sv);
2535 const UV u = ~SvUV_nomg(sv);
2540 S_scomplement(aTHX_ TARG, sv);
2550 tryAMAGICun_MG(compl_amg, AMGf_numeric|AMGf_numarg);
2553 if (PL_op->op_private & HINT_INTEGER) {
2554 const IV i = ~SvIV_nomg(sv);
2558 const UV u = ~SvUV_nomg(sv);
2568 tryAMAGICun_MG(scompl_amg, AMGf_numeric);
2571 S_scomplement(aTHX_ TARG, sv);
2577 /* integer versions of some of the above */
2582 tryAMAGICbin_MG(mult_amg, AMGf_assign);
2585 SETi( left * right );
2594 tryAMAGICbin_MG(div_amg, AMGf_assign);
2597 IV value = SvIV_nomg(right);
2599 DIE(aTHX_ "Illegal division by zero");
2600 num = SvIV_nomg(left);
2602 /* avoid FPE_INTOVF on some platforms when num is IV_MIN */
2606 value = num / value;
2612 #if defined(__GLIBC__) && IVSIZE == 8 && !defined(PERL_DEBUG_READONLY_OPS) \
2613 && ( __GLIBC__ < 2 || (__GLIBC__ == 2 && __GLIBC_MINOR__ < 8))
2620 /* This is the vanilla old i_modulo. */
2622 tryAMAGICbin_MG(modulo_amg, AMGf_assign);
2626 DIE(aTHX_ "Illegal modulus zero");
2627 /* avoid FPE_INTOVF on some platforms when left is IV_MIN */
2631 SETi( left % right );
2636 #if defined(__GLIBC__) && IVSIZE == 8 && !defined(PERL_DEBUG_READONLY_OPS) \
2637 && ( __GLIBC__ < 2 || (__GLIBC__ == 2 && __GLIBC_MINOR__ < 8))
2642 /* This is the i_modulo with the workaround for the _moddi3 bug
2643 * in (at least) glibc 2.2.5 (the PERL_ABS() the workaround).
2644 * See below for pp_i_modulo. */
2646 tryAMAGICbin_MG(modulo_amg, AMGf_assign);
2650 DIE(aTHX_ "Illegal modulus zero");
2651 /* avoid FPE_INTOVF on some platforms when left is IV_MIN */
2655 SETi( left % PERL_ABS(right) );
2662 dVAR; dSP; dATARGET;
2663 tryAMAGICbin_MG(modulo_amg, AMGf_assign);
2667 DIE(aTHX_ "Illegal modulus zero");
2668 /* The assumption is to use hereafter the old vanilla version... */
2670 PL_ppaddr[OP_I_MODULO] =
2672 /* .. but if we have glibc, we might have a buggy _moddi3
2673 * (at least glibc 2.2.5 is known to have this bug), in other
2674 * words our integer modulus with negative quad as the second
2675 * argument might be broken. Test for this and re-patch the
2676 * opcode dispatch table if that is the case, remembering to
2677 * also apply the workaround so that this first round works
2678 * right, too. See [perl #9402] for more information. */
2682 /* Cannot do this check with inlined IV constants since
2683 * that seems to work correctly even with the buggy glibc. */
2685 /* Yikes, we have the bug.
2686 * Patch in the workaround version. */
2688 PL_ppaddr[OP_I_MODULO] =
2689 &Perl_pp_i_modulo_1;
2690 /* Make certain we work right this time, too. */
2691 right = PERL_ABS(right);
2694 /* avoid FPE_INTOVF on some platforms when left is IV_MIN */
2698 SETi( left % right );
2707 tryAMAGICbin_MG(add_amg, AMGf_assign);
2709 dPOPTOPiirl_ul_nomg;
2710 SETi( left + right );
2718 tryAMAGICbin_MG(subtr_amg, AMGf_assign);
2720 dPOPTOPiirl_ul_nomg;
2721 SETi( left - right );
2729 tryAMAGICbin_MG(lt_amg, AMGf_set);
2732 SETs(boolSV(left < right));
2740 tryAMAGICbin_MG(gt_amg, AMGf_set);
2743 SETs(boolSV(left > right));
2751 tryAMAGICbin_MG(le_amg, AMGf_set);
2754 SETs(boolSV(left <= right));
2762 tryAMAGICbin_MG(ge_amg, AMGf_set);
2765 SETs(boolSV(left >= right));
2773 tryAMAGICbin_MG(eq_amg, AMGf_set);
2776 SETs(boolSV(left == right));
2784 tryAMAGICbin_MG(ne_amg, AMGf_set);
2787 SETs(boolSV(left != right));
2795 tryAMAGICbin_MG(ncmp_amg, 0);
2802 else if (left < right)
2814 tryAMAGICun_MG(neg_amg, 0);
2815 if (S_negate_string(aTHX)) return NORMAL;
2817 SV * const sv = TOPs;
2818 IV const i = SvIV_nomg(sv);
2824 /* High falutin' math. */
2829 tryAMAGICbin_MG(atan2_amg, 0);
2832 SETn(Perl_atan2(left, right));
2838 /* also used for: pp_cos() pp_exp() pp_log() pp_sqrt() */
2843 int amg_type = fallback_amg;
2844 const char *neg_report = NULL;
2845 const int op_type = PL_op->op_type;
2848 case OP_SIN: amg_type = sin_amg; break;
2849 case OP_COS: amg_type = cos_amg; break;
2850 case OP_EXP: amg_type = exp_amg; break;
2851 case OP_LOG: amg_type = log_amg; neg_report = "log"; break;
2852 case OP_SQRT: amg_type = sqrt_amg; neg_report = "sqrt"; break;
2855 assert(amg_type != fallback_amg);
2857 tryAMAGICun_MG(amg_type, 0);
2859 SV * const arg = TOPs;
2860 const NV value = SvNV_nomg(arg);
2862 if (neg_report) { /* log or sqrt */
2864 #if defined(NAN_COMPARE_BROKEN) && defined(Perl_isnan)
2865 ! Perl_isnan(value) &&
2867 (op_type == OP_LOG ? (value <= 0.0) : (value < 0.0))) {
2868 SET_NUMERIC_STANDARD();
2869 /* diag_listed_as: Can't take log of %g */
2870 DIE(aTHX_ "Can't take %s of %"NVgf, neg_report, value);
2875 case OP_SIN: result = Perl_sin(value); break;
2876 case OP_COS: result = Perl_cos(value); break;
2877 case OP_EXP: result = Perl_exp(value); break;
2878 case OP_LOG: result = Perl_log(value); break;
2879 case OP_SQRT: result = Perl_sqrt(value); break;
2886 /* Support Configure command-line overrides for rand() functions.
2887 After 5.005, perhaps we should replace this by Configure support
2888 for drand48(), random(), or rand(). For 5.005, though, maintain
2889 compatibility by calling rand() but allow the user to override it.
2890 See INSTALL for details. --Andy Dougherty 15 July 1998
2892 /* Now it's after 5.005, and Configure supports drand48() and random(),
2893 in addition to rand(). So the overrides should not be needed any more.
2894 --Jarkko Hietaniemi 27 September 1998
2899 if (!PL_srand_called) {
2900 (void)seedDrand01((Rand_seed_t)seed());
2901 PL_srand_called = TRUE;
2913 SV * const sv = POPs;
2919 /* 1 of 2 things can be carried through SvNV, SP or TARG, SP was carried */
2920 #if defined(NAN_COMPARE_BROKEN) && defined(Perl_isnan)
2921 if (! Perl_isnan(value) && value == 0.0)
2931 sv_setnv_mg(TARG, value);
2942 if (MAXARG >= 1 && (TOPs || POPs)) {
2949 pv = SvPV(top, len);
2950 flags = grok_number(pv, len, &anum);
2952 if (!(flags & IS_NUMBER_IN_UV)) {
2953 Perl_ck_warner_d(aTHX_ packWARN(WARN_OVERFLOW),
2954 "Integer overflow in srand");
2962 (void)seedDrand01((Rand_seed_t)anum);
2963 PL_srand_called = TRUE;
2967 /* Historically srand always returned true. We can avoid breaking
2969 sv_setpvs(TARG, "0 but true");
2978 tryAMAGICun_MG(int_amg, AMGf_numeric);
2980 SV * const sv = TOPs;
2981 const IV iv = SvIV_nomg(sv);
2982 /* XXX it's arguable that compiler casting to IV might be subtly
2983 different from modf (for numbers inside (IV_MIN,UV_MAX)) in which
2984 else preferring IV has introduced a subtle behaviour change bug. OTOH
2985 relying on floating point to be accurate is a bug. */
2990 else if (SvIOK(sv)) {
2992 SETu(SvUV_nomg(sv));
2997 const NV value = SvNV_nomg(sv);
2998 if (UNLIKELY(Perl_isinfnan(value)))
3000 else if (value >= 0.0) {
3001 if (value < (NV)UV_MAX + 0.5) {
3004 SETn(Perl_floor(value));
3008 if (value > (NV)IV_MIN - 0.5) {
3011 SETn(Perl_ceil(value));
3022 tryAMAGICun_MG(abs_amg, AMGf_numeric);
3024 SV * const sv = TOPs;
3025 /* This will cache the NV value if string isn't actually integer */
3026 const IV iv = SvIV_nomg(sv);
3031 else if (SvIOK(sv)) {
3032 /* IVX is precise */
3034 SETu(SvUV_nomg(sv)); /* force it to be numeric only */
3042 /* 2s complement assumption. Also, not really needed as
3043 IV_MIN and -IV_MIN should both be %100...00 and NV-able */
3049 const NV value = SvNV_nomg(sv);
3060 /* also used for: pp_hex() */
3066 I32 flags = PERL_SCAN_ALLOW_UNDERSCORES;
3070 SV* const sv = TOPs;
3072 tmps = (SvPV_const(sv, len));
3074 /* If Unicode, try to downgrade
3075 * If not possible, croak. */
3076 SV* const tsv = sv_2mortal(newSVsv(sv));
3079 sv_utf8_downgrade(tsv, FALSE);
3080 tmps = SvPV_const(tsv, len);
3082 if (PL_op->op_type == OP_HEX)
3085 while (*tmps && len && isSPACE(*tmps))
3089 if (isALPHA_FOLD_EQ(*tmps, 'x')) {
3091 result_uv = grok_hex (tmps, &len, &flags, &result_nv);
3093 else if (isALPHA_FOLD_EQ(*tmps, 'b'))
3094 result_uv = grok_bin (tmps, &len, &flags, &result_nv);
3096 result_uv = grok_oct (tmps, &len, &flags, &result_nv);
3098 if (flags & PERL_SCAN_GREATER_THAN_UV_MAX) {
3112 SV * const sv = TOPs;
3114 U32 in_bytes = IN_BYTES;
3115 /* simplest case shortcut */
3116 /* turn off SVf_UTF8 in tmp flags if HINT_BYTES on*/
3117 U32 svflags = (SvFLAGS(sv) ^ (in_bytes << 26)) & (SVf_POK|SVs_GMG|SVf_UTF8);
3118 STATIC_ASSERT_STMT(HINT_BYTES == 0x00000008 && SVf_UTF8 == 0x20000000 && (SVf_UTF8 == HINT_BYTES << 26));
3121 if(LIKELY(svflags == SVf_POK))
3123 if(svflags & SVs_GMG)
3126 if (!IN_BYTES) /* reread to avoid using an C auto/register */
3127 sv_setiv(TARG, (IV)sv_len_utf8_nomg(sv));
3131 /* unrolled SvPV_nomg_const(sv,len) */
3136 (void)sv_2pv_flags(sv, &len, 0|SV_CONST_RETURN);
3138 sv_setiv(TARG, (IV)(len));
3141 if (!SvPADTMP(TARG)) {
3142 sv_setsv_nomg(TARG, &PL_sv_undef);
3143 } else { /* TARG is on stack at this point and is overwriten by SETs.
3144 This branch is the odd one out, so put TARG by default on
3145 stack earlier to let local SP go out of liveness sooner */
3152 return NORMAL; /* no putback, SP didn't move in this opcode */
3155 /* Returns false if substring is completely outside original string.
3156 No length is indicated by len_iv = 0 and len_is_uv = 0. len_is_uv must
3157 always be true for an explicit 0.
3160 Perl_translate_substr_offsets( STRLEN curlen, IV pos1_iv,
3161 bool pos1_is_uv, IV len_iv,
3162 bool len_is_uv, STRLEN *posp,
3168 PERL_ARGS_ASSERT_TRANSLATE_SUBSTR_OFFSETS;
3170 if (!pos1_is_uv && pos1_iv < 0 && curlen) {
3171 pos1_is_uv = curlen-1 > ~(UV)pos1_iv;
3174 if ((pos1_is_uv || pos1_iv > 0) && (UV)pos1_iv > curlen)
3177 if (len_iv || len_is_uv) {
3178 if (!len_is_uv && len_iv < 0) {
3179 pos2_iv = curlen + len_iv;
3181 pos2_is_uv = curlen-1 > ~(UV)len_iv;
3184 } else { /* len_iv >= 0 */
3185 if (!pos1_is_uv && pos1_iv < 0) {
3186 pos2_iv = pos1_iv + len_iv;
3187 pos2_is_uv = (UV)len_iv > (UV)IV_MAX;
3189 if ((UV)len_iv > curlen-(UV)pos1_iv)
3192 pos2_iv = pos1_iv+len_iv;
3202 if (!pos2_is_uv && pos2_iv < 0) {
3203 if (!pos1_is_uv && pos1_iv < 0)
3207 else if (!pos1_is_uv && pos1_iv < 0)
3210 if ((UV)pos2_iv < (UV)pos1_iv)
3212 if ((UV)pos2_iv > curlen)
3215 /* pos1_iv and pos2_iv both in 0..curlen, so the cast is safe */
3216 *posp = (STRLEN)( (UV)pos1_iv );
3217 *lenp = (STRLEN)( (UV)pos2_iv - (UV)pos1_iv );
3234 I32 lvalue = PL_op->op_flags & OPf_MOD || LVRET;
3235 const bool rvalue = (GIMME_V != G_VOID);
3238 const char *repl = NULL;
3240 int num_args = PL_op->op_private & 7;
3241 bool repl_need_utf8_upgrade = FALSE;
3245 if(!(repl_sv = POPs)) num_args--;
3247 if ((len_sv = POPs)) {
3248 len_iv = SvIV(len_sv);
3249 len_is_uv = len_iv ? SvIOK_UV(len_sv) : 1;
3254 pos1_iv = SvIV(pos_sv);
3255 pos1_is_uv = SvIOK_UV(pos_sv);
3257 if (PL_op->op_private & OPpSUBSTR_REPL_FIRST) {
3261 if (lvalue && !repl_sv) {
3263 ret = sv_2mortal(newSV_type(SVt_PVLV)); /* Not TARG RT#67838 */
3264 sv_magic(ret, NULL, PERL_MAGIC_substr, NULL, 0);
3266 LvTARG(ret) = SvREFCNT_inc_simple(sv);
3268 pos1_is_uv || pos1_iv >= 0
3269 ? (STRLEN)(UV)pos1_iv
3270 : (LvFLAGS(ret) |= 1, (STRLEN)(UV)-pos1_iv);
3272 len_is_uv || len_iv > 0
3273 ? (STRLEN)(UV)len_iv
3274 : (LvFLAGS(ret) |= 2, (STRLEN)(UV)-len_iv);
3276 PUSHs(ret); /* avoid SvSETMAGIC here */
3280 repl = SvPV_const(repl_sv, repl_len);
3283 Perl_ck_warner(aTHX_ packWARN(WARN_SUBSTR),
3284 "Attempt to use reference as lvalue in substr"
3286 tmps = SvPV_force_nomg(sv, curlen);
3287 if (DO_UTF8(repl_sv) && repl_len) {
3289 sv_utf8_upgrade_nomg(sv);
3293 else if (DO_UTF8(sv))
3294 repl_need_utf8_upgrade = TRUE;
3296 else tmps = SvPV_const(sv, curlen);
3298 utf8_curlen = sv_or_pv_len_utf8(sv, tmps, curlen);
3299 if (utf8_curlen == curlen)
3302 curlen = utf8_curlen;
3308 STRLEN pos, len, byte_len, byte_pos;
3310 if (!translate_substr_offsets(
3311 curlen, pos1_iv, pos1_is_uv, len_iv, len_is_uv, &pos, &len
3315 byte_pos = utf8_curlen
3316 ? sv_or_pv_pos_u2b(sv, tmps, pos, &byte_len) : pos;
3321 SvTAINTED_off(TARG); /* decontaminate */
3322 SvUTF8_off(TARG); /* decontaminate */
3323 sv_setpvn(TARG, tmps, byte_len);
3324 #ifdef USE_LOCALE_COLLATE
3325 sv_unmagic(TARG, PERL_MAGIC_collxfrm);
3332 SV* repl_sv_copy = NULL;
3334 if (repl_need_utf8_upgrade) {
3335 repl_sv_copy = newSVsv(repl_sv);
3336 sv_utf8_upgrade(repl_sv_copy);
3337 repl = SvPV_const(repl_sv_copy, repl_len);
3341 sv_insert_flags(sv, byte_pos, byte_len, repl, repl_len, 0);
3342 SvREFCNT_dec(repl_sv_copy);
3345 if (PL_op->op_private & OPpSUBSTR_REPL_FIRST)
3355 Perl_croak(aTHX_ "substr outside of string");
3356 Perl_ck_warner(aTHX_ packWARN(WARN_SUBSTR), "substr outside of string");
3363 const IV size = POPi;
3364 const IV offset = POPi;
3365 SV * const src = POPs;
3366 const I32 lvalue = PL_op->op_flags & OPf_MOD || LVRET;
3369 if (lvalue) { /* it's an lvalue! */
3370 ret = sv_2mortal(newSV_type(SVt_PVLV)); /* Not TARG RT#67838 */
3371 sv_magic(ret, NULL, PERL_MAGIC_vec, NULL, 0);
3373 LvTARG(ret) = SvREFCNT_inc_simple(src);
3374 LvTARGOFF(ret) = offset;
3375 LvTARGLEN(ret) = size;
3379 SvTAINTED_off(TARG); /* decontaminate */
3383 sv_setuv(ret, do_vecget(src, offset, size));
3391 /* also used for: pp_rindex() */
3404 const char *little_p;
3407 const bool is_index = PL_op->op_type == OP_INDEX;
3408 const bool threeargs = MAXARG >= 3 && (TOPs || ((void)POPs,0));
3414 big_p = SvPV_const(big, biglen);
3415 little_p = SvPV_const(little, llen);
3417 big_utf8 = DO_UTF8(big);
3418 little_utf8 = DO_UTF8(little);
3419 if (big_utf8 ^ little_utf8) {
3420 /* One needs to be upgraded. */
3421 if (little_utf8 && !IN_ENCODING) {
3422 /* Well, maybe instead we might be able to downgrade the small
3424 char * const pv = (char*)bytes_from_utf8((U8 *)little_p, &llen,
3427 /* If the large string is ISO-8859-1, and it's not possible to
3428 convert the small string to ISO-8859-1, then there is no
3429 way that it could be found anywhere by index. */
3434 /* At this point, pv is a malloc()ed string. So donate it to temp
3435 to ensure it will get free()d */
3436 little = temp = newSV(0);
3437 sv_usepvn(temp, pv, llen);
3438 little_p = SvPVX(little);
3441 ? newSVpvn(big_p, biglen) : newSVpvn(little_p, llen);
3444 sv_recode_to_utf8(temp, _get_encoding());
3446 sv_utf8_upgrade(temp);
3451 big_p = SvPV_const(big, biglen);
3454 little_p = SvPV_const(little, llen);
3458 if (SvGAMAGIC(big)) {
3459 /* Life just becomes a lot easier if I use a temporary here.
3460 Otherwise I need to avoid calls to sv_pos_u2b(), which (dangerously)
3461 will trigger magic and overloading again, as will fbm_instr()
3463 big = newSVpvn_flags(big_p, biglen,
3464 SVs_TEMP | (big_utf8 ? SVf_UTF8 : 0));
3467 if (SvGAMAGIC(little) || (is_index && !SvOK(little))) {
3468 /* index && SvOK() is a hack. fbm_instr() calls SvPV_const, which will
3469 warn on undef, and we've already triggered a warning with the
3470 SvPV_const some lines above. We can't remove that, as we need to
3471 call some SvPV to trigger overloading early and find out if the
3473 This is all getting to messy. The API isn't quite clean enough,
3474 because data access has side effects.
3476 little = newSVpvn_flags(little_p, llen,
3477 SVs_TEMP | (little_utf8 ? SVf_UTF8 : 0));
3478 little_p = SvPVX(little);
3482 offset = is_index ? 0 : biglen;
3484 if (big_utf8 && offset > 0)
3485 offset = sv_pos_u2b_flags(big, offset, 0, SV_CONST_RETURN);
3491 else if (offset > (SSize_t)biglen)
3493 if (!(little_p = is_index
3494 ? fbm_instr((unsigned char*)big_p + offset,
3495 (unsigned char*)big_p + biglen, little, 0)
3496 : rninstr(big_p, big_p + offset,
3497 little_p, little_p + llen)))
3500 retval = little_p - big_p;
3501 if (retval > 1 && big_utf8)
3502 retval = sv_pos_b2u_flags(big, retval, SV_CONST_RETURN);
3512 dSP; dMARK; dORIGMARK; dTARGET;
3513 SvTAINTED_off(TARG);
3514 do_sprintf(TARG, SP-MARK, MARK+1);
3515 TAINT_IF(SvTAINTED(TARG));
3527 const U8 *s = (U8*)SvPV_const(argsv, len);
3529 if (IN_ENCODING && SvPOK(argsv) && !DO_UTF8(argsv)) {
3530 SV * const tmpsv = sv_2mortal(newSVsv(argsv));
3531 s = (U8*)sv_recode_to_utf8(tmpsv, _get_encoding());
3532 len = UTF8SKIP(s); /* Should be well-formed; so this is its length */
3537 ? utf8n_to_uvchr(s, len, 0, UTF8_ALLOW_ANYUV)
3551 if (UNLIKELY(SvAMAGIC(top)))
3553 if (UNLIKELY(isinfnansv(top)))
3554 Perl_croak(aTHX_ "Cannot chr %"NVgf, SvNV(top));
3556 if (!IN_BYTES /* under bytes, chr(-1) eq chr(0xff), etc. */
3557 && ((SvIOKp(top) && !SvIsUV(top) && SvIV_nomg(top) < 0)
3559 ((SvNOKp(top) || (SvOK(top) && !SvIsUV(top)))
3560 && SvNV_nomg(top) < 0.0))) {
3561 if (ckWARN(WARN_UTF8)) {
3562 if (SvGMAGICAL(top)) {
3563 SV *top2 = sv_newmortal();
3564 sv_setsv_nomg(top2, top);
3567 Perl_warner(aTHX_ packWARN(WARN_UTF8),
3568 "Invalid negative number (%"SVf") in chr", SVfARG(top));
3570 value = UNICODE_REPLACEMENT;
3572 value = SvUV_nomg(top);
3576 SvUPGRADE(TARG,SVt_PV);
3578 if (value > 255 && !IN_BYTES) {
3579 SvGROW(TARG, (STRLEN)UNISKIP(value)+1);
3580 tmps = (char*)uvchr_to_utf8_flags((U8*)SvPVX(TARG), value, 0);
3581 SvCUR_set(TARG, tmps - SvPVX_const(TARG));
3583 (void)SvPOK_only(TARG);
3592 *tmps++ = (char)value;
3594 (void)SvPOK_only(TARG);
3596 if (IN_ENCODING && !IN_BYTES) {
3597 sv_recode_to_utf8(TARG, _get_encoding());
3599 if (SvCUR(TARG) == 0
3600 || ! is_utf8_string((U8*)tmps, SvCUR(TARG))
3601 || UTF8_IS_REPLACEMENT((U8*) tmps, (U8*) tmps + SvCUR(TARG)))
3606 *tmps++ = (char)value;
3622 const char *tmps = SvPV_const(left, len);
3624 if (DO_UTF8(left)) {
3625 /* If Unicode, try to downgrade.
3626 * If not possible, croak.
3627 * Yes, we made this up. */
3628 SV* const tsv = newSVpvn_flags(tmps, len, SVf_UTF8|SVs_TEMP);
3630 sv_utf8_downgrade(tsv, FALSE);
3631 tmps = SvPV_const(tsv, len);
3633 # ifdef USE_ITHREADS
3635 if (!PL_reentrant_buffer->_crypt_struct_buffer) {
3636 /* This should be threadsafe because in ithreads there is only
3637 * one thread per interpreter. If this would not be true,
3638 * we would need a mutex to protect this malloc. */
3639 PL_reentrant_buffer->_crypt_struct_buffer =
3640 (struct crypt_data *)safemalloc(sizeof(struct crypt_data));
3641 #if defined(__GLIBC__) || defined(__EMX__)
3642 if (PL_reentrant_buffer->_crypt_struct_buffer) {
3643 PL_reentrant_buffer->_crypt_struct_buffer->initialized = 0;
3644 /* work around glibc-2.2.5 bug */
3645 PL_reentrant_buffer->_crypt_struct_buffer->current_saltbits = 0;
3649 # endif /* HAS_CRYPT_R */
3650 # endif /* USE_ITHREADS */
3652 sv_setpv(TARG, fcrypt(tmps, SvPV_nolen_const(right)));
3654 sv_setpv(TARG, PerlProc_crypt(tmps, SvPV_nolen_const(right)));
3661 "The crypt() function is unimplemented due to excessive paranoia.");
3665 /* Generally UTF-8 and UTF-EBCDIC are indistinguishable at this level. So
3666 * most comments below say UTF-8, when in fact they mean UTF-EBCDIC as well */
3669 /* also used for: pp_lcfirst() */
3673 /* Actually is both lcfirst() and ucfirst(). Only the first character
3674 * changes. This means that possibly we can change in-place, ie., just
3675 * take the source and change that one character and store it back, but not
3676 * if read-only etc, or if the length changes */
3680 STRLEN slen; /* slen is the byte length of the whole SV. */
3683 bool inplace; /* ? Convert first char only, in-place */
3684 bool doing_utf8 = FALSE; /* ? using utf8 */
3685 bool convert_source_to_utf8 = FALSE; /* ? need to convert */
3686 const int op_type = PL_op->op_type;
3689 U8 tmpbuf[UTF8_MAXBYTES_CASE+1];
3690 STRLEN ulen; /* ulen is the byte length of the original Unicode character
3691 * stored as UTF-8 at s. */
3692 STRLEN tculen; /* tculen is the byte length of the freshly titlecased (or
3693 * lowercased) character stored in tmpbuf. May be either
3694 * UTF-8 or not, but in either case is the number of bytes */
3696 s = (const U8*)SvPV_const(source, slen);
3698 /* We may be able to get away with changing only the first character, in
3699 * place, but not if read-only, etc. Later we may discover more reasons to
3700 * not convert in-place. */
3701 inplace = !SvREADONLY(source)
3702 && ( SvPADTMP(source)
3703 || ( SvTEMP(source) && !SvSMAGICAL(source)
3704 && SvREFCNT(source) == 1));
3706 /* First calculate what the changed first character should be. This affects
3707 * whether we can just swap it out, leaving the rest of the string unchanged,
3708 * or even if have to convert the dest to UTF-8 when the source isn't */
3710 if (! slen) { /* If empty */
3711 need = 1; /* still need a trailing NUL */
3714 else if (DO_UTF8(source)) { /* Is the source utf8? */
3717 if (op_type == OP_UCFIRST) {
3718 #ifdef USE_LOCALE_CTYPE
3719 _to_utf8_title_flags(s, tmpbuf, &tculen, IN_LC_RUNTIME(LC_CTYPE));
3721 _to_utf8_title_flags(s, tmpbuf, &tculen, 0);
3725 #ifdef USE_LOCALE_CTYPE
3726 _to_utf8_lower_flags(s, tmpbuf, &tculen, IN_LC_RUNTIME(LC_CTYPE));
3728 _to_utf8_lower_flags(s, tmpbuf, &tculen, 0);
3732 /* we can't do in-place if the length changes. */
3733 if (ulen != tculen) inplace = FALSE;
3734 need = slen + 1 - ulen + tculen;
3736 else { /* Non-zero length, non-UTF-8, Need to consider locale and if
3737 * latin1 is treated as caseless. Note that a locale takes
3739 ulen = 1; /* Original character is 1 byte */
3740 tculen = 1; /* Most characters will require one byte, but this will
3741 * need to be overridden for the tricky ones */
3744 if (op_type == OP_LCFIRST) {
3746 /* lower case the first letter: no trickiness for any character */
3747 #ifdef USE_LOCALE_CTYPE
3748 if (IN_LC_RUNTIME(LC_CTYPE)) {
3749 _CHECK_AND_WARN_PROBLEMATIC_LOCALE;
3750 *tmpbuf = toLOWER_LC(*s);
3755 *tmpbuf = (IN_UNI_8_BIT)
3756 ? toLOWER_LATIN1(*s)
3760 #ifdef USE_LOCALE_CTYPE
3762 else if (IN_LC_RUNTIME(LC_CTYPE)) {
3763 if (IN_UTF8_CTYPE_LOCALE) {
3767 _CHECK_AND_WARN_PROBLEMATIC_LOCALE;
3768 *tmpbuf = (U8) toUPPER_LC(*s); /* This would be a bug if any
3769 locales have upper and title case
3773 else if (! IN_UNI_8_BIT) {
3774 *tmpbuf = toUPPER(*s); /* Returns caseless for non-ascii, or
3775 * on EBCDIC machines whatever the
3776 * native function does */
3779 /* Here, is ucfirst non-UTF-8, not in locale (unless that locale is
3780 * UTF-8, which we treat as not in locale), and cased latin1 */
3782 #ifdef USE_LOCALE_CTYPE
3786 title_ord = _to_upper_title_latin1(*s, tmpbuf, &tculen, 's');
3788 assert(tculen == 2);
3790 /* If the result is an upper Latin1-range character, it can
3791 * still be represented in one byte, which is its ordinal */
3792 if (UTF8_IS_DOWNGRADEABLE_START(*tmpbuf)) {
3793 *tmpbuf = (U8) title_ord;
3797 /* Otherwise it became more than one ASCII character (in
3798 * the case of LATIN_SMALL_LETTER_SHARP_S) or changed to
3799 * beyond Latin1, so the number of bytes changed, so can't
3800 * replace just the first character in place. */
3803 /* If the result won't fit in a byte, the entire result
3804 * will have to be in UTF-8. Assume worst case sizing in
3805 * conversion. (all latin1 characters occupy at most two
3807 if (title_ord > 255) {
3809 convert_source_to_utf8 = TRUE;
3810 need = slen * 2 + 1;
3812 /* The (converted) UTF-8 and UTF-EBCDIC lengths of all
3813 * (both) characters whose title case is above 255 is
3817 else { /* LATIN_SMALL_LETTER_SHARP_S expands by 1 byte */
3818 need = slen + 1 + 1;
3822 } /* End of use Unicode (Latin1) semantics */
3823 } /* End of changing the case of the first character */
3825 /* Here, have the first character's changed case stored in tmpbuf. Ready to
3826 * generate the result */
3829 /* We can convert in place. This means we change just the first
3830 * character without disturbing the rest; no need to grow */
3832 s = d = (U8*)SvPV_force_nomg(source, slen);
3838 /* Here, we can't convert in place; we earlier calculated how much
3839 * space we will need, so grow to accommodate that */
3840 SvUPGRADE(dest, SVt_PV);
3841 d = (U8*)SvGROW(dest, need);
3842 (void)SvPOK_only(dest);
3849 if (! convert_source_to_utf8) {
3851 /* Here both source and dest are in UTF-8, but have to create
3852 * the entire output. We initialize the result to be the
3853 * title/lower cased first character, and then append the rest
3855 sv_setpvn(dest, (char*)tmpbuf, tculen);
3857 sv_catpvn(dest, (char*)(s + ulen), slen - ulen);
3861 const U8 *const send = s + slen;
3863 /* Here the dest needs to be in UTF-8, but the source isn't,
3864 * except we earlier UTF-8'd the first character of the source
3865 * into tmpbuf. First put that into dest, and then append the
3866 * rest of the source, converting it to UTF-8 as we go. */
3868 /* Assert tculen is 2 here because the only two characters that
3869 * get to this part of the code have 2-byte UTF-8 equivalents */
3871 *d++ = *(tmpbuf + 1);
3872 s++; /* We have just processed the 1st char */
3874 for (; s < send; s++) {
3875 d = uvchr_to_utf8(d, *s);
3878 SvCUR_set(dest, d - (U8*)SvPVX_const(dest));
3882 else { /* in-place UTF-8. Just overwrite the first character */
3883 Copy(tmpbuf, d, tculen, U8);
3884 SvCUR_set(dest, need - 1);
3888 else { /* Neither source nor dest are in or need to be UTF-8 */
3890 if (inplace) { /* in-place, only need to change the 1st char */
3893 else { /* Not in-place */
3895 /* Copy the case-changed character(s) from tmpbuf */
3896 Copy(tmpbuf, d, tculen, U8);
3897 d += tculen - 1; /* Code below expects d to point to final
3898 * character stored */
3901 else { /* empty source */
3902 /* See bug #39028: Don't taint if empty */
3906 /* In a "use bytes" we don't treat the source as UTF-8, but, still want
3907 * the destination to retain that flag */
3908 if (SvUTF8(source) && ! IN_BYTES)
3911 if (!inplace) { /* Finish the rest of the string, unchanged */
3912 /* This will copy the trailing NUL */
3913 Copy(s + 1, d + 1, slen, U8);
3914 SvCUR_set(dest, need - 1);
3917 #ifdef USE_LOCALE_CTYPE
3918 if (IN_LC_RUNTIME(LC_CTYPE)) {
3923 if (dest != source && SvTAINTED(source))
3929 /* There's so much setup/teardown code common between uc and lc, I wonder if
3930 it would be worth merging the two, and just having a switch outside each
3931 of the three tight loops. There is less and less commonality though */
3944 if ((SvPADTMP(source)
3946 (SvTEMP(source) && !SvSMAGICAL(source) && SvREFCNT(source) == 1))
3947 && !SvREADONLY(source) && SvPOK(source)
3950 #ifdef USE_LOCALE_CTYPE
3951 (IN_LC_RUNTIME(LC_CTYPE))
3952 ? ! IN_UTF8_CTYPE_LOCALE
3958 /* We can convert in place. The reason we can't if in UNI_8_BIT is to
3959 * make the loop tight, so we overwrite the source with the dest before
3960 * looking at it, and we need to look at the original source
3961 * afterwards. There would also need to be code added to handle
3962 * switching to not in-place in midstream if we run into characters
3963 * that change the length. Since being in locale overrides UNI_8_BIT,
3964 * that latter becomes irrelevant in the above test; instead for
3965 * locale, the size can't normally change, except if the locale is a
3968 s = d = (U8*)SvPV_force_nomg(source, len);
3975 s = (const U8*)SvPV_nomg_const(source, len);
3978 SvUPGRADE(dest, SVt_PV);
3979 d = (U8*)SvGROW(dest, min);
3980 (void)SvPOK_only(dest);
3985 /* Overloaded values may have toggled the UTF-8 flag on source, so we need
3986 to check DO_UTF8 again here. */
3988 if (DO_UTF8(source)) {
3989 const U8 *const send = s + len;
3990 U8 tmpbuf[UTF8_MAXBYTES_CASE+1];
3992 /* All occurrences of these are to be moved to follow any other marks.
3993 * This is context-dependent. We may not be passed enough context to
3994 * move the iota subscript beyond all of them, but we do the best we can
3995 * with what we're given. The result is always better than if we
3996 * hadn't done this. And, the problem would only arise if we are
3997 * passed a character without all its combining marks, which would be
3998 * the caller's mistake. The information this is based on comes from a
3999 * comment in Unicode SpecialCasing.txt, (and the Standard's text
4000 * itself) and so can't be checked properly to see if it ever gets
4001 * revised. But the likelihood of it changing is remote */
4002 bool in_iota_subscript = FALSE;
4008 if (in_iota_subscript && ! _is_utf8_mark(s)) {
4010 /* A non-mark. Time to output the iota subscript */
4011 Copy(GREEK_CAPITAL_LETTER_IOTA_UTF8, d, capital_iota_len, U8);
4012 d += capital_iota_len;
4013 in_iota_subscript = FALSE;
4016 /* Then handle the current character. Get the changed case value
4017 * and copy it to the output buffer */
4020 #ifdef USE_LOCALE_CTYPE
4021 uv = _to_utf8_upper_flags(s, tmpbuf, &ulen, IN_LC_RUNTIME(LC_CTYPE));
4023 uv = _to_utf8_upper_flags(s, tmpbuf, &ulen, 0);
4025 #define GREEK_CAPITAL_LETTER_IOTA 0x0399
4026 #define COMBINING_GREEK_YPOGEGRAMMENI 0x0345
4027 if (uv == GREEK_CAPITAL_LETTER_IOTA
4028 && utf8_to_uvchr_buf(s, send, 0) == COMBINING_GREEK_YPOGEGRAMMENI)
4030 in_iota_subscript = TRUE;
4033 if (ulen > u && (SvLEN(dest) < (min += ulen - u))) {
4034 /* If the eventually required minimum size outgrows the
4035 * available space, we need to grow. */
4036 const UV o = d - (U8*)SvPVX_const(dest);
4038 /* If someone uppercases one million U+03B0s we SvGROW()
4039 * one million times. Or we could try guessing how much to
4040 * allocate without allocating too much. Such is life.
4041 * See corresponding comment in lc code for another option
4044 d = (U8*)SvPVX(dest) + o;
4046 Copy(tmpbuf, d, ulen, U8);
4051 if (in_iota_subscript) {
4052 Copy(GREEK_CAPITAL_LETTER_IOTA_UTF8, d, capital_iota_len, U8);
4053 d += capital_iota_len;
4058 SvCUR_set(dest, d - (U8*)SvPVX_const(dest));
4060 else { /* Not UTF-8 */
4062 const U8 *const send = s + len;
4064 /* Use locale casing if in locale; regular style if not treating
4065 * latin1 as having case; otherwise the latin1 casing. Do the
4066 * whole thing in a tight loop, for speed, */
4067 #ifdef USE_LOCALE_CTYPE
4068 if (IN_LC_RUNTIME(LC_CTYPE)) {
4069 if (IN_UTF8_CTYPE_LOCALE) {
4072 _CHECK_AND_WARN_PROBLEMATIC_LOCALE;
4073 for (; s < send; d++, s++)
4074 *d = (U8) toUPPER_LC(*s);
4078 if (! IN_UNI_8_BIT) {
4079 for (; s < send; d++, s++) {
4084 #ifdef USE_LOCALE_CTYPE
4087 for (; s < send; d++, s++) {
4088 *d = toUPPER_LATIN1_MOD(*s);
4089 if (LIKELY(*d != LATIN_SMALL_LETTER_Y_WITH_DIAERESIS)) {
4093 /* The mainstream case is the tight loop above. To avoid
4094 * extra tests in that, all three characters that require
4095 * special handling are mapped by the MOD to the one tested
4097 * Use the source to distinguish between the three cases */
4099 #if UNICODE_MAJOR_VERSION > 2 \
4100 || (UNICODE_MAJOR_VERSION == 2 && UNICODE_DOT_VERSION >= 1 \
4101 && UNICODE_DOT_DOT_VERSION >= 8)
4102 if (*s == LATIN_SMALL_LETTER_SHARP_S) {
4104 /* uc() of this requires 2 characters, but they are
4105 * ASCII. If not enough room, grow the string */
4106 if (SvLEN(dest) < ++min) {
4107 const UV o = d - (U8*)SvPVX_const(dest);
4109 d = (U8*)SvPVX(dest) + o;
4111 *d++ = 'S'; *d = 'S'; /* upper case is 'SS' */
4112 continue; /* Back to the tight loop; still in ASCII */
4116 /* The other two special handling characters have their
4117 * upper cases outside the latin1 range, hence need to be
4118 * in UTF-8, so the whole result needs to be in UTF-8. So,
4119 * here we are somewhere in the middle of processing a
4120 * non-UTF-8 string, and realize that we will have to convert
4121 * the whole thing to UTF-8. What to do? There are
4122 * several possibilities. The simplest to code is to
4123 * convert what we have so far, set a flag, and continue on
4124 * in the loop. The flag would be tested each time through
4125 * the loop, and if set, the next character would be
4126 * converted to UTF-8 and stored. But, I (khw) didn't want
4127 * to slow down the mainstream case at all for this fairly
4128 * rare case, so I didn't want to add a test that didn't
4129 * absolutely have to be there in the loop, besides the
4130 * possibility that it would get too complicated for
4131 * optimizers to deal with. Another possibility is to just
4132 * give up, convert the source to UTF-8, and restart the
4133 * function that way. Another possibility is to convert
4134 * both what has already been processed and what is yet to
4135 * come separately to UTF-8, then jump into the loop that
4136 * handles UTF-8. But the most efficient time-wise of the
4137 * ones I could think of is what follows, and turned out to
4138 * not require much extra code. */
4140 /* Convert what we have so far into UTF-8, telling the
4141 * function that we know it should be converted, and to
4142 * allow extra space for what we haven't processed yet.
4143 * Assume the worst case space requirements for converting
4144 * what we haven't processed so far: that it will require
4145 * two bytes for each remaining source character, plus the
4146 * NUL at the end. This may cause the string pointer to
4147 * move, so re-find it. */
4149 len = d - (U8*)SvPVX_const(dest);
4150 SvCUR_set(dest, len);
4151 len = sv_utf8_upgrade_flags_grow(dest,
4152 SV_GMAGIC|SV_FORCE_UTF8_UPGRADE,
4154 d = (U8*)SvPVX(dest) + len;
4156 /* Now process the remainder of the source, converting to
4157 * upper and UTF-8. If a resulting byte is invariant in
4158 * UTF-8, output it as-is, otherwise convert to UTF-8 and
4159 * append it to the output. */
4160 for (; s < send; s++) {
4161 (void) _to_upper_title_latin1(*s, d, &len, 'S');
4165 /* Here have processed the whole source; no need to continue
4166 * with the outer loop. Each character has been converted
4167 * to upper case and converted to UTF-8 */
4170 } /* End of processing all latin1-style chars */
4171 } /* End of processing all chars */
4172 } /* End of source is not empty */
4174 if (source != dest) {
4175 *d = '\0'; /* Here d points to 1 after last char, add NUL */
4176 SvCUR_set(dest, d - (U8*)SvPVX_const(dest));
4178 } /* End of isn't utf8 */
4179 #ifdef USE_LOCALE_CTYPE
4180 if (IN_LC_RUNTIME(LC_CTYPE)) {
4185 if (dest != source && SvTAINTED(source))
4203 if ( ( SvPADTMP(source)
4204 || ( SvTEMP(source) && !SvSMAGICAL(source)
4205 && SvREFCNT(source) == 1 )
4207 && !SvREADONLY(source) && SvPOK(source)
4208 && !DO_UTF8(source)) {
4210 /* We can convert in place, as lowercasing anything in the latin1 range
4211 * (or else DO_UTF8 would have been on) doesn't lengthen it */
4213 s = d = (U8*)SvPV_force_nomg(source, len);
4220 s = (const U8*)SvPV_nomg_const(source, len);
4223 SvUPGRADE(dest, SVt_PV);
4224 d = (U8*)SvGROW(dest, min);
4225 (void)SvPOK_only(dest);
4230 /* Overloaded values may have toggled the UTF-8 flag on source, so we need
4231 to check DO_UTF8 again here. */
4233 if (DO_UTF8(source)) {
4234 const U8 *const send = s + len;
4235 U8 tmpbuf[UTF8_MAXBYTES_CASE+1];
4238 const STRLEN u = UTF8SKIP(s);
4241 #ifdef USE_LOCALE_CTYPE
4242 _to_utf8_lower_flags(s, tmpbuf, &ulen, IN_LC_RUNTIME(LC_CTYPE));
4244 _to_utf8_lower_flags(s, tmpbuf, &ulen, 0);
4247 /* Here is where we would do context-sensitive actions. See the
4248 * commit message for 86510fb15 for why there isn't any */
4250 if (ulen > u && (SvLEN(dest) < (min += ulen - u))) {
4252 /* If the eventually required minimum size outgrows the
4253 * available space, we need to grow. */
4254 const UV o = d - (U8*)SvPVX_const(dest);
4256 /* If someone lowercases one million U+0130s we SvGROW() one
4257 * million times. Or we could try guessing how much to
4258 * allocate without allocating too much. Such is life.
4259 * Another option would be to grow an extra byte or two more
4260 * each time we need to grow, which would cut down the million
4261 * to 500K, with little waste */
4263 d = (U8*)SvPVX(dest) + o;
4266 /* Copy the newly lowercased letter to the output buffer we're
4268 Copy(tmpbuf, d, ulen, U8);
4271 } /* End of looping through the source string */
4274 SvCUR_set(dest, d - (U8*)SvPVX_const(dest));
4275 } else { /* Not utf8 */
4277 const U8 *const send = s + len;
4279 /* Use locale casing if in locale; regular style if not treating
4280 * latin1 as having case; otherwise the latin1 casing. Do the
4281 * whole thing in a tight loop, for speed, */
4282 #ifdef USE_LOCALE_CTYPE
4283 if (IN_LC_RUNTIME(LC_CTYPE)) {
4284 _CHECK_AND_WARN_PROBLEMATIC_LOCALE;
4285 for (; s < send; d++, s++)
4286 *d = toLOWER_LC(*s);
4290 if (! IN_UNI_8_BIT) {
4291 for (; s < send; d++, s++) {
4296 for (; s < send; d++, s++) {
4297 *d = toLOWER_LATIN1(*s);
4301 if (source != dest) {
4303 SvCUR_set(dest, d - (U8*)SvPVX_const(dest));
4306 #ifdef USE_LOCALE_CTYPE
4307 if (IN_LC_RUNTIME(LC_CTYPE)) {
4312 if (dest != source && SvTAINTED(source))
4321 SV * const sv = TOPs;
4323 const char *s = SvPV_const(sv,len);
4325 SvUTF8_off(TARG); /* decontaminate */
4328 SvUPGRADE(TARG, SVt_PV);
4329 SvGROW(TARG, (len * 2) + 1);
4333 STRLEN ulen = UTF8SKIP(s);
4334 bool to_quote = FALSE;
4336 if (UTF8_IS_INVARIANT(*s)) {
4337 if (_isQUOTEMETA(*s)) {
4341 else if (UTF8_IS_DOWNGRADEABLE_START(*s)) {
4343 #ifdef USE_LOCALE_CTYPE
4344 /* In locale, we quote all non-ASCII Latin1 chars.
4345 * Otherwise use the quoting rules */
4347 IN_LC_RUNTIME(LC_CTYPE)
4350 _isQUOTEMETA(TWO_BYTE_UTF8_TO_NATIVE(*s, *(s + 1))))
4355 else if (is_QUOTEMETA_high(s)) {
4370 else if (IN_UNI_8_BIT) {
4372 if (_isQUOTEMETA(*s))
4378 /* For non UNI_8_BIT (and hence in locale) just quote all \W
4379 * including everything above ASCII */
4381 if (!isWORDCHAR_A(*s))
4387 SvCUR_set(TARG, d - SvPVX_const(TARG));
4388 (void)SvPOK_only_UTF8(TARG);
4391 sv_setpvn(TARG, s, len);
4407 U8 tmpbuf[UTF8_MAXBYTES_CASE + 1];
4408 #if UNICODE_MAJOR_VERSION > 3 /* no multifolds in early Unicode */ \
4409 || (UNICODE_MAJOR_VERSION == 3 && ( UNICODE_DOT_VERSION > 0) \
4410 || UNICODE_DOT_DOT_VERSION > 0)
4411 const bool full_folding = TRUE; /* This variable is here so we can easily
4412 move to more generality later */
4414 const bool full_folding = FALSE;
4416 const U8 flags = ( full_folding ? FOLD_FLAGS_FULL : 0 )
4417 #ifdef USE_LOCALE_CTYPE
4418 | ( IN_LC_RUNTIME(LC_CTYPE) ? FOLD_FLAGS_LOCALE : 0 )
4422 /* This is a facsimile of pp_lc, but with a thousand bugs thanks to me.
4423 * You are welcome(?) -Hugmeir
4431 s = (const U8*)SvPV_nomg_const(source, len);
4433 if (ckWARN(WARN_UNINITIALIZED))
4434 report_uninit(source);
4441 SvUPGRADE(dest, SVt_PV);
4442 d = (U8*)SvGROW(dest, min);
4443 (void)SvPOK_only(dest);
4448 if (DO_UTF8(source)) { /* UTF-8 flagged string. */
4450 const STRLEN u = UTF8SKIP(s);
4453 _to_utf8_fold_flags(s, tmpbuf, &ulen, flags);
4455 if (ulen > u && (SvLEN(dest) < (min += ulen - u))) {
4456 const UV o = d - (U8*)SvPVX_const(dest);
4458 d = (U8*)SvPVX(dest) + o;
4461 Copy(tmpbuf, d, ulen, U8);
4466 } /* Unflagged string */
4468 #ifdef USE_LOCALE_CTYPE
4469 if ( IN_LC_RUNTIME(LC_CTYPE) ) { /* Under locale */
4470 if (IN_UTF8_CTYPE_LOCALE) {
4471 goto do_uni_folding;
4473 _CHECK_AND_WARN_PROBLEMATIC_LOCALE;
4474 for (; s < send; d++, s++)
4475 *d = (U8) toFOLD_LC(*s);
4479 if ( !IN_UNI_8_BIT ) { /* Under nothing, or bytes */
4480 for (; s < send; d++, s++)
4484 #ifdef USE_LOCALE_CTYPE
4487 /* For ASCII and the Latin-1 range, there's only two troublesome
4488 * folds, \x{DF} (\N{LATIN SMALL LETTER SHARP S}), which under full
4489 * casefolding becomes 'ss'; and \x{B5} (\N{MICRO SIGN}), which
4490 * under any fold becomes \x{3BC} (\N{GREEK SMALL LETTER MU}) --
4491 * For the rest, the casefold is their lowercase. */
4492 for (; s < send; d++, s++) {
4493 if (*s == MICRO_SIGN) {
4494 /* \N{MICRO SIGN}'s casefold is \N{GREEK SMALL LETTER MU},
4495 * which is outside of the latin-1 range. There's a couple
4496 * of ways to deal with this -- khw discusses them in
4497 * pp_lc/uc, so go there :) What we do here is upgrade what
4498 * we had already casefolded, then enter an inner loop that
4499 * appends the rest of the characters as UTF-8. */
4500 len = d - (U8*)SvPVX_const(dest);
4501 SvCUR_set(dest, len);
4502 len = sv_utf8_upgrade_flags_grow(dest,
4503 SV_GMAGIC|SV_FORCE_UTF8_UPGRADE,
4504 /* The max expansion for latin1
4505 * chars is 1 byte becomes 2 */
4507 d = (U8*)SvPVX(dest) + len;
4509 Copy(GREEK_SMALL_LETTER_MU_UTF8, d, small_mu_len, U8);
4512 for (; s < send; s++) {
4514 UV fc = _to_uni_fold_flags(*s, tmpbuf, &ulen, flags);
4515 if UVCHR_IS_INVARIANT(fc) {
4517 && *s == LATIN_SMALL_LETTER_SHARP_S)
4526 Copy(tmpbuf, d, ulen, U8);
4532 else if (full_folding && *s == LATIN_SMALL_LETTER_SHARP_S) {
4533 /* Under full casefolding, LATIN SMALL LETTER SHARP S
4534 * becomes "ss", which may require growing the SV. */
4535 if (SvLEN(dest) < ++min) {
4536 const UV o = d - (U8*)SvPVX_const(dest);
4538 d = (U8*)SvPVX(dest) + o;
4543 else { /* If it's not one of those two, the fold is their lower
4545 *d = toLOWER_LATIN1(*s);
4551 SvCUR_set(dest, d - (U8*)SvPVX_const(dest));
4553 #ifdef USE_LOCALE_CTYPE
4554 if (IN_LC_RUNTIME(LC_CTYPE)) {
4559 if (SvTAINTED(source))
4569 dSP; dMARK; dORIGMARK;
4570 AV *const av = MUTABLE_AV(POPs);
4571 const I32 lval = (PL_op->op_flags & OPf_MOD || LVRET);
4573 if (SvTYPE(av) == SVt_PVAV) {
4574 const bool localizing = PL_op->op_private & OPpLVAL_INTRO;
4575 bool can_preserve = FALSE;
4581 can_preserve = SvCANEXISTDELETE(av);
4584 if (lval && localizing) {
4587 for (svp = MARK + 1; svp <= SP; svp++) {
4588 const SSize_t elem = SvIV(*svp);
4592 if (max > AvMAX(av))
4596 while (++MARK <= SP) {
4598 SSize_t elem = SvIV(*MARK);
4599 bool preeminent = TRUE;
4601 if (localizing && can_preserve) {
4602 /* If we can determine whether the element exist,
4603 * Try to preserve the existenceness of a tied array
4604 * element by using EXISTS and DELETE if possible.
4605 * Fallback to FETCH and STORE otherwise. */
4606 preeminent = av_exists(av, elem);
4609 svp = av_fetch(av, elem, lval);
4612 DIE(aTHX_ PL_no_aelem, elem);
4615 save_aelem(av, elem, svp);
4617 SAVEADELETE(av, elem);
4620 *MARK = svp ? *svp : &PL_sv_undef;
4623 if (GIMME_V != G_ARRAY) {
4625 *++MARK = SP > ORIGMARK ? *SP : &PL_sv_undef;
4634 AV *const av = MUTABLE_AV(POPs);
4635 I32 lval = (PL_op->op_flags & OPf_MOD);
4636 SSize_t items = SP - MARK;
4638 if (PL_op->op_private & OPpMAYBE_LVSUB) {
4639 const I32 flags = is_lvalue_sub();
4641 if (!(flags & OPpENTERSUB_INARGS))
4642 /* diag_listed_as: Can't modify %s in %s */
4643 Perl_croak(aTHX_ "Can't modify index/value array slice in list assignment");
4650 *(MARK+items*2-1) = *(MARK+items);
4656 while (++MARK <= SP) {
4659 svp = av_fetch(av, SvIV(*MARK), lval);
4661 if (!svp || !*svp || *svp == &PL_sv_undef) {
4662 DIE(aTHX_ PL_no_aelem, SvIV(*MARK));
4664 *MARK = sv_mortalcopy(*MARK);
4666 *++MARK = svp ? *svp : &PL_sv_undef;
4668 if (GIMME_V != G_ARRAY) {
4669 MARK = SP - items*2;
4670 *++MARK = items > 0 ? *SP : &PL_sv_undef;
4680 AV *array = MUTABLE_AV(POPs);
4681 const I32 gimme = GIMME_V;
4682 IV *iterp = Perl_av_iter_p(aTHX_ array);
4683 const IV current = (*iterp)++;
4685 if (current > av_tindex(array)) {
4687 if (gimme == G_SCALAR)
4695 if (gimme == G_ARRAY) {
4696 SV **const element = av_fetch(array, current, 0);
4697 PUSHs(element ? *element : &PL_sv_undef);
4702 /* also used for: pp_avalues()*/
4706 AV *array = MUTABLE_AV(POPs);
4707 const I32 gimme = GIMME_V;
4709 *Perl_av_iter_p(aTHX_ array) = 0;
4711 if (gimme == G_SCALAR) {
4713 PUSHi(av_tindex(array) + 1);
4715 else if (gimme == G_ARRAY) {
4716 IV n = Perl_av_len(aTHX_ array);
4721 if (PL_op->op_type == OP_AKEYS) {
4722 for (i = 0; i <= n; i++) {
4727 for (i = 0; i <= n; i++) {
4728 SV *const *const elem = Perl_av_fetch(aTHX_ array, i, 0);
4729 PUSHs(elem ? *elem : &PL_sv_undef);
4736 /* Associative arrays. */
4741 HV * hash = MUTABLE_HV(POPs);
4743 const I32 gimme = GIMME_V;
4745 entry = hv_iternext(hash);
4749 SV* const sv = hv_iterkeysv(entry);
4751 if (gimme == G_ARRAY) {
4753 val = hv_iterval(hash, entry);
4757 else if (gimme == G_SCALAR)
4764 S_do_delete_local(pTHX)
4767 const I32 gimme = GIMME_V;
4770 const bool sliced = !!(PL_op->op_private & OPpSLICE);
4771 SV **unsliced_keysv = sliced ? NULL : sp--;
4772 SV * const osv = POPs;
4773 SV **mark = sliced ? PL_stack_base + POPMARK : unsliced_keysv-1;
4775 const bool tied = SvRMAGICAL(osv)
4776 && mg_find((const SV *)osv, PERL_MAGIC_tied);
4777 const bool can_preserve = SvCANEXISTDELETE(osv);
4778 const U32 type = SvTYPE(osv);
4779 SV ** const end = sliced ? SP : unsliced_keysv;
4781 if (type == SVt_PVHV) { /* hash element */
4782 HV * const hv = MUTABLE_HV(osv);
4783 while (++MARK <= end) {
4784 SV * const keysv = *MARK;
4786 bool preeminent = TRUE;
4788 preeminent = hv_exists_ent(hv, keysv, 0);
4790 HE *he = hv_fetch_ent(hv, keysv, 1, 0);
4797 sv = hv_delete_ent(hv, keysv, 0, 0);
4799 SvREFCNT_inc_simple_void(sv); /* De-mortalize */
4802 if (!sv) DIE(aTHX_ PL_no_helem_sv, SVfARG(keysv));
4803 save_helem_flags(hv, keysv, &sv, SAVEf_KEEPOLDELEM);
4805 *MARK = sv_mortalcopy(sv);
4811 SAVEHDELETE(hv, keysv);
4812 *MARK = &PL_sv_undef;
4816 else if (type == SVt_PVAV) { /* array element */
4817 if (PL_op->op_flags & OPf_SPECIAL) {
4818 AV * const av = MUTABLE_AV(osv);
4819 while (++MARK <= end) {
4820 SSize_t idx = SvIV(*MARK);
4822 bool preeminent = TRUE;
4824 preeminent = av_exists(av, idx);
4826 SV **svp = av_fetch(av, idx, 1);
4833 sv = av_delete(av, idx, 0);
4835 SvREFCNT_inc_simple_void(sv); /* De-mortalize */
4838 save_aelem_flags(av, idx, &sv, SAVEf_KEEPOLDELEM);
4840 *MARK = sv_mortalcopy(sv);
4846 SAVEADELETE(av, idx);
4847 *MARK = &PL_sv_undef;
4852 DIE(aTHX_ "panic: avhv_delete no longer supported");
4855 DIE(aTHX_ "Not a HASH reference");
4857 if (gimme == G_VOID)
4859 else if (gimme == G_SCALAR) {
4864 *++MARK = &PL_sv_undef;
4868 else if (gimme != G_VOID)
4869 PUSHs(*unsliced_keysv);
4880 if (PL_op->op_private & OPpLVAL_INTRO)
4881 return do_delete_local();
4884 discard = (gimme == G_VOID) ? G_DISCARD : 0;
4886 if (PL_op->op_private & OPpSLICE) {
4888 HV * const hv = MUTABLE_HV(POPs);
4889 const U32 hvtype = SvTYPE(hv);
4890 if (hvtype == SVt_PVHV) { /* hash element */
4891 while (++MARK <= SP) {
4892 SV * const sv = hv_delete_ent(hv, *MARK, discard, 0);
4893 *MARK = sv ? sv : &PL_sv_undef;
4896 else if (hvtype == SVt_PVAV) { /* array element */
4897 if (PL_op->op_flags & OPf_SPECIAL) {
4898 while (++MARK <= SP) {
4899 SV * const sv = av_delete(MUTABLE_AV(hv), SvIV(*MARK), discard);
4900 *MARK = sv ? sv : &PL_sv_undef;
4905 DIE(aTHX_ "Not a HASH reference");
4908 else if (gimme == G_SCALAR) {
4913 *++MARK = &PL_sv_undef;
4919 HV * const hv = MUTABLE_HV(POPs);
4921 if (SvTYPE(hv) == SVt_PVHV)
4922 sv = hv_delete_ent(hv, keysv, discard, 0);
4923 else if (SvTYPE(hv) == SVt_PVAV) {
4924 if (PL_op->op_flags & OPf_SPECIAL)
4925 sv = av_delete(MUTABLE_AV(hv), SvIV(keysv), discard);
4927 DIE(aTHX_ "panic: avhv_delete no longer supported");
4930 DIE(aTHX_ "Not a HASH reference");
4945 if (UNLIKELY( PL_op->op_private & OPpEXISTS_SUB )) {
4947 SV * const sv = POPs;
4948 CV * const cv = sv_2cv(sv, &hv, &gv, 0);
4951 if (gv && isGV(gv) && GvCV(gv) && !GvCVGEN(gv))
4956 hv = MUTABLE_HV(POPs);
4957 if (LIKELY( SvTYPE(hv) == SVt_PVHV )) {
4958 if (hv_exists_ent(hv, tmpsv, 0))
4961 else if (SvTYPE(hv) == SVt_PVAV) {
4962 if (PL_op->op_flags & OPf_SPECIAL) { /* array element */
4963 if (av_exists(MUTABLE_AV(hv), SvIV(tmpsv)))
4968 DIE(aTHX_ "Not a HASH reference");
4975 dSP; dMARK; dORIGMARK;
4976 HV * const hv = MUTABLE_HV(POPs);
4977 const I32 lval = (PL_op->op_flags & OPf_MOD || LVRET);
4978 const bool localizing = PL_op->op_private & OPpLVAL_INTRO;
4979 bool can_preserve = FALSE;
4985 if (SvCANEXISTDELETE(hv))
4986 can_preserve = TRUE;
4989 while (++MARK <= SP) {
4990 SV * const keysv = *MARK;
4993 bool preeminent = TRUE;
4995 if (localizing && can_preserve) {
4996 /* If we can determine whether the element exist,
4997 * try to preserve the existenceness of a tied hash
4998 * element by using EXISTS and DELETE if possible.
4999 * Fallback to FETCH and STORE otherwise. */
5000 preeminent = hv_exists_ent(hv, keysv, 0);
5003 he = hv_fetch_ent(hv, keysv, lval, 0);
5004 svp = he ? &HeVAL(he) : NULL;
5007 if (!svp || !*svp || *svp == &PL_sv_undef) {
5008 DIE(aTHX_ PL_no_helem_sv, SVfARG(keysv));
5011 if (HvNAME_get(hv) && isGV(*svp))
5012 save_gp(MUTABLE_GV(*svp), !(PL_op->op_flags & OPf_SPECIAL));
5013 else if (preeminent)
5014 save_helem_flags(hv, keysv, svp,
5015 (PL_op->op_flags & OPf_SPECIAL) ? 0 : SAVEf_SETMAGIC);
5017 SAVEHDELETE(hv, keysv);
5020 *MARK = svp && *svp ? *svp : &PL_sv_undef;
5022 if (GIMME_V != G_ARRAY) {
5024 *++MARK = SP > ORIGMARK ? *SP : &PL_sv_undef;
5033 HV * const hv = MUTABLE_HV(POPs);
5034 I32 lval = (PL_op->op_flags & OPf_MOD);
5035 SSize_t items = SP - MARK;
5037 if (PL_op->op_private & OPpMAYBE_LVSUB) {
5038 const I32 flags = is_lvalue_sub();
5040 if (!(flags & OPpENTERSUB_INARGS))
5041 /* diag_listed_as: Can't modify %s in %s */
5042 Perl_croak(aTHX_ "Can't modify key/value hash slice in list assignment");
5049 *(MARK+items*2-1) = *(MARK+items);
5055 while (++MARK <= SP) {
5056 SV * const keysv = *MARK;
5060 he = hv_fetch_ent(hv, keysv, lval, 0);
5061 svp = he ? &HeVAL(he) : NULL;
5064 if (!svp || !*svp || *svp == &PL_sv_undef) {
5065 DIE(aTHX_ PL_no_helem_sv, SVfARG(keysv));
5067 *MARK = sv_mortalcopy(*MARK);
5069 *++MARK = svp && *svp ? *svp : &PL_sv_undef;
5071 if (GIMME_V != G_ARRAY) {
5072 MARK = SP - items*2;
5073 *++MARK = items > 0 ? *SP : &PL_sv_undef;
5079 /* List operators. */
5083 I32 markidx = POPMARK;
5084 if (GIMME_V != G_ARRAY) {
5085 SV **mark = PL_stack_base + markidx;
5088 *MARK = *SP; /* unwanted list, return last item */
5090 *MARK = &PL_sv_undef;
5100 SV ** const lastrelem = PL_stack_sp;
5101 SV ** const lastlelem = PL_stack_base + POPMARK;
5102 SV ** const firstlelem = PL_stack_base + POPMARK + 1;
5103 SV ** const firstrelem = lastlelem + 1;
5104 const U8 mod = PL_op->op_flags & OPf_MOD;
5106 const I32 max = lastrelem - lastlelem;
5109 if (GIMME_V != G_ARRAY) {
5110 I32 ix = SvIV(*lastlelem);
5113 if (ix < 0 || ix >= max)
5114 *firstlelem = &PL_sv_undef;
5116 *firstlelem = firstrelem[ix];
5122 SP = firstlelem - 1;
5126 for (lelem = firstlelem; lelem <= lastlelem; lelem++) {
5127 I32 ix = SvIV(*lelem);
5130 if (ix < 0 || ix >= max)
5131 *lelem = &PL_sv_undef;
5133 if (!(*lelem = firstrelem[ix]))
5134 *lelem = &PL_sv_undef;
5135 else if (mod && SvPADTMP(*lelem)) {
5136 *lelem = firstrelem[ix] = sv_mortalcopy(*lelem);
5147 const I32 items = SP - MARK;
5148 SV * const av = MUTABLE_SV(av_make(items, MARK+1));
5150 mXPUSHs((PL_op->op_flags & OPf_SPECIAL)
5151 ? newRV_noinc(av) : av);
5157 dSP; dMARK; dORIGMARK;
5158 HV* const hv = newHV();
5159 SV* const retval = sv_2mortal( PL_op->op_flags & OPf_SPECIAL
5160 ? newRV_noinc(MUTABLE_SV(hv))
5165 (MARK++, SvGMAGICAL(*MARK) ? sv_mortalcopy(*MARK) : *MARK);
5172 sv_setsv_nomg(val, *MARK);
5176 Perl_ck_warner(aTHX_ packWARN(WARN_MISC), "Odd number of elements in anonymous hash");
5179 (void)hv_store_ent(hv,key,val,0);
5187 S_deref_plain_array(pTHX_ AV *ary)
5189 if (SvTYPE(ary) == SVt_PVAV) return ary;
5190 SvGETMAGIC((SV *)ary);
5191 if (!SvROK(ary) || SvTYPE(SvRV(ary)) != SVt_PVAV)
5192 Perl_die(aTHX_ "Not an ARRAY reference");
5193 else if (SvOBJECT(SvRV(ary)))
5194 Perl_die(aTHX_ "Not an unblessed ARRAY reference");
5195 return (AV *)SvRV(ary);
5198 #if defined(__GNUC__) && !defined(PERL_GCC_BRACE_GROUPS_FORBIDDEN)
5199 # define DEREF_PLAIN_ARRAY(ary) \
5202 SvTYPE(aRrRay) == SVt_PVAV \
5204 : S_deref_plain_array(aTHX_ aRrRay); \
5207 # define DEREF_PLAIN_ARRAY(ary) \
5209 PL_Sv = (SV *)(ary), \
5210 SvTYPE(PL_Sv) == SVt_PVAV \
5212 : S_deref_plain_array(aTHX_ (AV *)PL_Sv) \
5218 dSP; dMARK; dORIGMARK;
5219 int num_args = (SP - MARK);
5220 AV *ary = DEREF_PLAIN_ARRAY(MUTABLE_AV(*++MARK));
5229 const MAGIC * const mg = SvTIED_mg((const SV *)ary, PERL_MAGIC_tied);
5232 return Perl_tied_method(aTHX_ SV_CONST(SPLICE), mark - 1, MUTABLE_SV(ary), mg,
5233 GIMME_V | TIED_METHOD_ARGUMENTS_ON_STACK,
5240 offset = i = SvIV(*MARK);
5242 offset += AvFILLp(ary) + 1;
5244 DIE(aTHX_ PL_no_aelem, i);
5246 length = SvIVx(*MARK++);
5248 length += AvFILLp(ary) - offset + 1;
5254 length = AvMAX(ary) + 1; /* close enough to infinity */
5258 length = AvMAX(ary) + 1;
5260 if (offset > AvFILLp(ary) + 1) {
5262 Perl_ck_warner(aTHX_ packWARN(WARN_MISC), "splice() offset past end of array" );
5263 offset = AvFILLp(ary) + 1;
5265 after = AvFILLp(ary) + 1 - (offset + length);
5266 if (after < 0) { /* not that much array */
5267 length += after; /* offset+length now in array */
5273 /* At this point, MARK .. SP-1 is our new LIST */
5276 diff = newlen - length;
5277 if (newlen && !AvREAL(ary) && AvREIFY(ary))
5280 /* make new elements SVs now: avoid problems if they're from the array */
5281 for (dst = MARK, i = newlen; i; i--) {
5282 SV * const h = *dst;
5283 *dst++ = newSVsv(h);
5286 if (diff < 0) { /* shrinking the area */
5287 SV **tmparyval = NULL;
5289 Newx(tmparyval, newlen, SV*); /* so remember insertion */
5290 Copy(MARK, tmparyval, newlen, SV*);
5293 MARK = ORIGMARK + 1;
5294 if (GIMME_V == G_ARRAY) { /* copy return vals to stack */
5295 const bool real = cBOOL(AvREAL(ary));
5296 MEXTEND(MARK, length);
5298 EXTEND_MORTAL(length);
5299 for (i = 0, dst = MARK; i < length; i++) {
5300 if ((*dst = AvARRAY(ary)[i+offset])) {
5302 sv_2mortal(*dst); /* free them eventually */
5305 *dst = &PL_sv_undef;
5311 *MARK = AvARRAY(ary)[offset+length-1];
5314 for (i = length - 1, dst = &AvARRAY(ary)[offset]; i > 0; i--)
5315 SvREFCNT_dec(*dst++); /* free them now */
5318 AvFILLp(ary) += diff;
5320 /* pull up or down? */
5322 if (offset < after) { /* easier to pull up */
5323 if (offset) { /* esp. if nothing to pull */
5324 src = &AvARRAY(ary)[offset-1];
5325 dst = src - diff; /* diff is negative */
5326 for (i = offset; i > 0; i--) /* can't trust Copy */
5330 AvARRAY(ary) = AvARRAY(ary) - diff; /* diff is negative */
5334 if (after) { /* anything to pull down? */
5335 src = AvARRAY(ary) + offset + length;
5336 dst = src + diff; /* diff is negative */
5337 Move(src, dst, after, SV*);
5339 dst = &AvARRAY(ary)[AvFILLp(ary)+1];
5340 /* avoid later double free */
5347 Copy( tmparyval, AvARRAY(ary) + offset, newlen, SV* );
5348 Safefree(tmparyval);
5351 else { /* no, expanding (or same) */
5352 SV** tmparyval = NULL;
5354 Newx(tmparyval, length, SV*); /* so remember deletion */
5355 Copy(AvARRAY(ary)+offset, tmparyval, length, SV*);
5358 if (diff > 0) { /* expanding */
5359 /* push up or down? */
5360 if (offset < after && diff <= AvARRAY(ary) - AvALLOC(ary)) {
5364 Move(src, dst, offset, SV*);
5366 AvARRAY(ary) = AvARRAY(ary) - diff;/* diff is positive */
5368 AvFILLp(ary) += diff;
5371 if (AvFILLp(ary) + diff >= AvMAX(ary)) /* oh, well */
5372 av_extend(ary, AvFILLp(ary) + diff);
5373 AvFILLp(ary) += diff;
5376 dst = AvARRAY(ary) + AvFILLp(ary);
5378 for (i = after; i; i--) {
5386 Copy( MARK, AvARRAY(ary) + offset, newlen, SV* );
5389 MARK = ORIGMARK + 1;
5390 if (GIMME_V == G_ARRAY) { /* copy return vals to stack */
5392 const bool real = cBOOL(AvREAL(ary));
5394 EXTEND_MORTAL(length);
5395 for (i = 0, dst = MARK; i < length; i++) {
5396 if ((*dst = tmparyval[i])) {
5398 sv_2mortal(*dst); /* free them eventually */
5400 else *dst = &PL_sv_undef;
5406 else if (length--) {
5407 *MARK = tmparyval[length];
5410 while (length-- > 0)
5411 SvREFCNT_dec(tmparyval[length]);
5415 *MARK = &PL_sv_undef;
5416 Safefree(tmparyval);
5420 mg_set(MUTABLE_SV(ary));
5428 dSP; dMARK; dORIGMARK; dTARGET;
5429 AV * const ary = DEREF_PLAIN_ARRAY(MUTABLE_AV(*++MARK));
5430 const MAGIC * const mg = SvTIED_mg((const SV *)ary, PERL_MAGIC_tied);
5433 *MARK-- = SvTIED_obj(MUTABLE_SV(ary), mg);
5436 ENTER_with_name("call_PUSH");
5437 call_sv(SV_CONST(PUSH),G_SCALAR|G_DISCARD|G_METHOD_NAMED);
5438 LEAVE_with_name("call_PUSH");
5439 /* SPAGAIN; not needed: SP is assigned to immediately below */
5442 if (SvREADONLY(ary) && MARK < SP) Perl_croak_no_modify();
5443 PL_delaymagic = DM_DELAY;
5444 for (++MARK; MARK <= SP; MARK++) {
5446 if (*MARK) SvGETMAGIC(*MARK);
5449 sv_setsv_nomg(sv, *MARK);
5450 av_store(ary, AvFILLp(ary)+1, sv);
5452 if (PL_delaymagic & DM_ARRAY_ISA)
5453 mg_set(MUTABLE_SV(ary));
5458 if (OP_GIMME(PL_op, 0) != G_VOID) {
5459 PUSHi( AvFILL(ary) + 1 );
5464 /* also used for: pp_pop()*/
5468 AV * const av = PL_op->op_flags & OPf_SPECIAL
5469 ? MUTABLE_AV(GvAV(PL_defgv)) : DEREF_PLAIN_ARRAY(MUTABLE_AV(POPs));
5470 SV * const sv = PL_op->op_type == OP_SHIFT ? av_shift(av) : av_pop(av);
5474 (void)sv_2mortal(sv);
5481 dSP; dMARK; dORIGMARK; dTARGET;
5482 AV *ary = DEREF_PLAIN_ARRAY(MUTABLE_AV(*++MARK));
5483 const MAGIC * const mg = SvTIED_mg((const SV *)ary, PERL_MAGIC_tied);
5486 *MARK-- = SvTIED_obj(MUTABLE_SV(ary), mg);
5489 ENTER_with_name("call_UNSHIFT");
5490 call_sv(SV_CONST(UNSHIFT),G_SCALAR|G_DISCARD|G_METHOD_NAMED);
5491 LEAVE_with_name("call_UNSHIFT");
5492 /* SPAGAIN; not needed: SP is assigned to immediately below */
5496 av_unshift(ary, SP - MARK);
5498 SV * const sv = newSVsv(*++MARK);
5499 (void)av_store(ary, i++, sv);
5503 if (OP_GIMME(PL_op, 0) != G_VOID) {
5504 PUSHi( AvFILL(ary) + 1 );
5513 if (GIMME_V == G_ARRAY) {
5514 if (PL_op->op_private & OPpREVERSE_INPLACE) {
5518 assert( MARK+1 == SP && *SP && SvTYPE(*SP) == SVt_PVAV);
5519 (void)POPMARK; /* remove mark associated with ex-OP_AASSIGN */
5520 av = MUTABLE_AV((*SP));
5521 /* In-place reversing only happens in void context for the array
5522 * assignment. We don't need to push anything on the stack. */
5525 if (SvMAGICAL(av)) {
5527 SV *tmp = sv_newmortal();
5528 /* For SvCANEXISTDELETE */
5531 bool can_preserve = SvCANEXISTDELETE(av);
5533 for (i = 0, j = av_tindex(av); i < j; ++i, --j) {
5537 if (!av_exists(av, i)) {
5538 if (av_exists(av, j)) {
5539 SV *sv = av_delete(av, j, 0);
5540 begin = *av_fetch(av, i, TRUE);
5541 sv_setsv_mg(begin, sv);
5545 else if (!av_exists(av, j)) {
5546 SV *sv = av_delete(av, i, 0);
5547 end = *av_fetch(av, j, TRUE);
5548 sv_setsv_mg(end, sv);
5553 begin = *av_fetch(av, i, TRUE);
5554 end = *av_fetch(av, j, TRUE);
5555 sv_setsv(tmp, begin);
5556 sv_setsv_mg(begin, end);
5557 sv_setsv_mg(end, tmp);
5561 SV **begin = AvARRAY(av);
5564 SV **end = begin + AvFILLp(av);
5566 while (begin < end) {
5567 SV * const tmp = *begin;
5578 SV * const tmp = *MARK;
5582 /* safe as long as stack cannot get extended in the above */
5593 SvUTF8_off(TARG); /* decontaminate */
5595 do_join(TARG, &PL_sv_no, MARK, SP);
5597 sv_setsv(TARG, SP > MARK ? *SP : find_rundefsv());
5600 up = SvPV_force(TARG, len);
5602 if (DO_UTF8(TARG)) { /* first reverse each character */
5603 U8* s = (U8*)SvPVX(TARG);
5604 const U8* send = (U8*)(s + len);
5606 if (UTF8_IS_INVARIANT(*s)) {
5611 if (!utf8_to_uvchr_buf(s, send, 0))
5615 down = (char*)(s - 1);
5616 /* reverse this character */
5620 *down-- = (char)tmp;
5626 down = SvPVX(TARG) + len - 1;
5630 *down-- = (char)tmp;
5632 (void)SvPOK_only_UTF8(TARG);
5643 AV *ary = PL_op->op_flags & OPf_STACKED ? (AV *)POPs : NULL;
5644 IV limit = POPi; /* note, negative is forever */
5645 SV * const sv = POPs;
5647 const char *s = SvPV_const(sv, len);
5648 const bool do_utf8 = DO_UTF8(sv);
5649 const char *strend = s + len;
5655 const STRLEN slen = do_utf8
5656 ? utf8_length((U8*)s, (U8*)strend)
5657 : (STRLEN)(strend - s);
5658 SSize_t maxiters = slen + 10;
5659 I32 trailing_empty = 0;
5661 const I32 origlimit = limit;
5664 const I32 gimme = GIMME_V;
5666 const I32 oldsave = PL_savestack_ix;
5667 U32 make_mortal = SVs_TEMP;
5672 Copy(&LvTARGOFF(POPs), &pm, 1, PMOP*);
5677 DIE(aTHX_ "panic: pp_split, pm=%p, s=%p", pm, s);
5680 TAINT_IF(get_regex_charset(RX_EXTFLAGS(rx)) == REGEX_LOCALE_CHARSET &&
5681 (RX_EXTFLAGS(rx) & (RXf_WHITE | RXf_SKIPWHITE)));
5684 if (pm->op_pmreplrootu.op_pmtargetoff) {
5685 ary = GvAVn(MUTABLE_GV(PAD_SVl(pm->op_pmreplrootu.op_pmtargetoff)));
5689 if (pm->op_pmreplrootu.op_pmtargetgv) {
5690 ary = GvAVn(pm->op_pmreplrootu.op_pmtargetgv);
5694 else if (pm->op_targ)
5695 ary = (AV *)PAD_SVl(pm->op_targ);
5701 (void)sv_2mortal(SvREFCNT_inc_simple_NN(sv));
5704 if ((mg = SvTIED_mg((const SV *)ary, PERL_MAGIC_tied))) {
5706 XPUSHs(SvTIED_obj(MUTABLE_SV(ary), mg));
5713 for (i = AvFILLp(ary); i >= 0; i--)
5714 AvARRAY(ary)[i] = &PL_sv_undef; /* don't free mere refs */
5716 /* temporarily switch stacks */
5717 SAVESWITCHSTACK(PL_curstack, ary);
5721 base = SP - PL_stack_base;
5723 if (RX_EXTFLAGS(rx) & RXf_SKIPWHITE) {
5725 while (isSPACE_utf8(s))
5728 else if (get_regex_charset(RX_EXTFLAGS(rx)) == REGEX_LOCALE_CHARSET) {
5729 while (isSPACE_LC(*s))
5737 if (RX_EXTFLAGS(rx) & RXf_PMf_MULTILINE) {
5741 gimme_scalar = gimme == G_SCALAR && !ary;
5744 limit = maxiters + 2;
5745 if (RX_EXTFLAGS(rx) & RXf_WHITE) {
5748 /* this one uses 'm' and is a negative test */
5750 while (m < strend && ! isSPACE_utf8(m) ) {
5751 const int t = UTF8SKIP(m);
5752 /* isSPACE_utf8 returns FALSE for malform utf8 */
5759 else if (get_regex_charset(RX_EXTFLAGS(rx)) == REGEX_LOCALE_CHARSET)
5761 while (m < strend && !isSPACE_LC(*m))
5764 while (m < strend && !isSPACE(*m))
5777 dstr = newSVpvn_flags(s, m-s,
5778 (do_utf8 ? SVf_UTF8 : 0) | make_mortal);
5782 /* skip the whitespace found last */
5784 s = m + UTF8SKIP(m);
5788 /* this one uses 's' and is a positive test */
5790 while (s < strend && isSPACE_utf8(s) )
5793 else if (get_regex_charset(RX_EXTFLAGS(rx)) == REGEX_LOCALE_CHARSET)
5795 while (s < strend && isSPACE_LC(*s))
5798 while (s < strend && isSPACE(*s))
5803 else if (RX_EXTFLAGS(rx) & RXf_START_ONLY) {
5805 for (m = s; m < strend && *m != '\n'; m++)
5818 dstr = newSVpvn_flags(s, m-s,
5819 (do_utf8 ? SVf_UTF8 : 0) | make_mortal);
5825 else if (RX_EXTFLAGS(rx) & RXf_NULL && !(s >= strend)) {
5827 Pre-extend the stack, either the number of bytes or
5828 characters in the string or a limited amount, triggered by:
5830 my ($x, $y) = split //, $str;
5834 if (!gimme_scalar) {
5835 const U32 items = limit - 1;
5844 /* keep track of how many bytes we skip over */
5854 dstr = newSVpvn_flags(m, s-m, SVf_UTF8 | make_mortal);
5867 dstr = newSVpvn(s, 1);
5883 else if (do_utf8 == (RX_UTF8(rx) != 0) &&
5884 (RX_EXTFLAGS(rx) & RXf_USE_INTUIT) && !RX_NPARENS(rx)
5885 && (RX_EXTFLAGS(rx) & RXf_CHECK_ALL)
5886 && !(RX_EXTFLAGS(rx) & RXf_IS_ANCHORED)) {
5887 const int tail = (RX_EXTFLAGS(rx) & RXf_INTUIT_TAIL);
5888 SV * const csv = CALLREG_INTUIT_STRING(rx);
5890 len = RX_MINLENRET(rx);
5891 if (len == 1 && !RX_UTF8(rx) && !tail) {
5892 const char c = *SvPV_nolen_const(csv);
5894 for (m = s; m < strend && *m != c; m++)
5905 dstr = newSVpvn_flags(s, m-s,
5906 (do_utf8 ? SVf_UTF8 : 0) | make_mortal);
5909 /* The rx->minlen is in characters but we want to step
5910 * s ahead by bytes. */
5912 s = (char*)utf8_hop((U8*)m, len);
5914 s = m + len; /* Fake \n at the end */
5918 while (s < strend && --limit &&
5919 (m = fbm_instr((unsigned char*)s, (unsigned char*)strend,
5920 csv, multiline ? FBMrf_MULTILINE : 0)) )
5929 dstr = newSVpvn_flags(s, m-s,
5930 (do_utf8 ? SVf_UTF8 : 0) | make_mortal);
5933 /* The rx->minlen is in characters but we want to step
5934 * s ahead by bytes. */
5936 s = (char*)utf8_hop((U8*)m, len);
5938 s = m + len; /* Fake \n at the end */
5943 maxiters += slen * RX_NPARENS(rx);
5944 while (s < strend && --limit)
5948 rex_return = CALLREGEXEC(rx, (char*)s, (char*)strend, (char*)orig, 1,
5951 if (rex_return == 0)
5953 TAINT_IF(RX_MATCH_TAINTED(rx));
5954 /* we never pass the REXEC_COPY_STR flag, so it should
5955 * never get copied */
5956 assert(!RX_MATCH_COPIED(rx));
5957 m = RX_OFFS(rx)[0].start + orig;
5966 dstr = newSVpvn_flags(s, m-s,
5967 (do_utf8 ? SVf_UTF8 : 0) | make_mortal);
5970 if (RX_NPARENS(rx)) {
5972 for (i = 1; i <= (I32)RX_NPARENS(rx); i++) {
5973 s = RX_OFFS(rx)[i].start + orig;
5974 m = RX_OFFS(rx)[i].end + orig;
5976 /* japhy (07/27/01) -- the (m && s) test doesn't catch
5977 parens that didn't match -- they should be set to
5978 undef, not the empty string */
5986 if (m >= orig && s >= orig) {
5987 dstr = newSVpvn_flags(s, m-s,
5988 (do_utf8 ? SVf_UTF8 : 0)
5992 dstr = &PL_sv_undef; /* undef, not "" */
5998 s = RX_OFFS(rx)[0].end + orig;
6002 if (!gimme_scalar) {
6003 iters = (SP - PL_stack_base) - base;
6005 if (iters > maxiters)
6006 DIE(aTHX_ "Split loop");
6008 /* keep field after final delim? */
6009 if (s < strend || (iters && origlimit)) {
6010 if (!gimme_scalar) {
6011 const STRLEN l = strend - s;
6012 dstr = newSVpvn_flags(s, l, (do_utf8 ? SVf_UTF8 : 0) | make_mortal);
6017 else if (!origlimit) {
6019 iters -= trailing_empty;
6021 while (iters > 0 && (!TOPs || !SvANY(TOPs) || SvCUR(TOPs) == 0)) {
6022 if (TOPs && !make_mortal)
6024 *SP-- = &PL_sv_undef;
6031 LEAVE_SCOPE(oldsave); /* may undo an earlier SWITCHSTACK */
6035 if (SvSMAGICAL(ary)) {
6037 mg_set(MUTABLE_SV(ary));
6040 if (gimme == G_ARRAY) {
6042 Copy(AvARRAY(ary), SP + 1, iters, SV*);
6049 ENTER_with_name("call_PUSH");
6050 call_sv(SV_CONST(PUSH),G_SCALAR|G_DISCARD|G_METHOD_NAMED);
6051 LEAVE_with_name("call_PUSH");
6053 if (gimme == G_ARRAY) {
6055 /* EXTEND should not be needed - we just popped them */
6057 for (i=0; i < iters; i++) {
6058 SV **svp = av_fetch(ary, i, FALSE);
6059 PUSHs((svp) ? *svp : &PL_sv_undef);
6066 if (gimme == G_ARRAY)
6078 SV *const sv = PAD_SVl(PL_op->op_targ);
6080 if (SvPADSTALE(sv)) {
6083 RETURNOP(cLOGOP->op_other);
6085 RETURNOP(cLOGOP->op_next);
6094 if (SvTYPE(retsv) == SVt_PVAV || SvTYPE(retsv) == SVt_PVHV
6095 || SvTYPE(retsv) == SVt_PVCV) {
6096 retsv = refto(retsv);
6103 /* used for: pp_padany(), pp_mapstart(), pp_custom(); plus any system ops
6104 * that aren't implemented on a particular platform */
6106 PP(unimplemented_op)
6108 const Optype op_type = PL_op->op_type;
6109 /* Using OP_NAME() isn't going to be helpful here. Firstly, it doesn't cope
6110 with out of range op numbers - it only "special" cases op_custom.
6111 Secondly, as the three ops we "panic" on are padmy, mapstart and custom,
6112 if we get here for a custom op then that means that the custom op didn't
6113 have an implementation. Given that OP_NAME() looks up the custom op
6114 by its pp_addr, likely it will return NULL, unless someone (unhelpfully)
6115 registers &PL_unimplemented_op as the address of their custom op.
6116 NULL doesn't generate a useful error message. "custom" does. */
6117 const char *const name = op_type >= OP_max
6118 ? "[out of range]" : PL_op_name[PL_op->op_type];
6119 if(OP_IS_SOCKET(op_type))
6120 DIE(aTHX_ PL_no_sock_func, name);
6121 DIE(aTHX_ "panic: unimplemented op %s (#%d) called", name, op_type);
6124 /* For sorting out arguments passed to a &CORE:: subroutine */
6128 int opnum = SvIOK(cSVOP_sv) ? (int)SvUV(cSVOP_sv) : 0;
6129 int defgv = PL_opargs[opnum] & OA_DEFGV ||opnum==OP_GLOB, whicharg = 0;
6130 AV * const at_ = GvAV(PL_defgv);
6131 SV **svp = at_ ? AvARRAY(at_) : NULL;
6132 I32 minargs = 0, maxargs = 0, numargs = at_ ? AvFILLp(at_)+1 : 0;
6133 I32 oa = opnum ? PL_opargs[opnum] >> OASHIFT : 0;
6134 bool seen_question = 0;
6135 const char *err = NULL;
6136 const bool pushmark = PL_op->op_private & OPpCOREARGS_PUSHMARK;
6138 /* Count how many args there are first, to get some idea how far to
6139 extend the stack. */
6141 if ((oa & 7) == OA_LIST) { maxargs = I32_MAX; break; }
6143 if (oa & OA_OPTIONAL) seen_question = 1;
6144 if (!seen_question) minargs++;
6148 if(numargs < minargs) err = "Not enough";
6149 else if(numargs > maxargs) err = "Too many";
6151 /* diag_listed_as: Too many arguments for %s */
6153 "%s arguments for %s", err,
6154 opnum ? PL_op_desc[opnum] : SvPV_nolen_const(cSVOP_sv)
6157 /* Reset the stack pointer. Without this, we end up returning our own
6158 arguments in list context, in addition to the values we are supposed
6159 to return. nextstate usually does this on sub entry, but we need
6160 to run the next op with the caller's hints, so we cannot have a
6162 SP = PL_stack_base + cxstack[cxstack_ix].blk_oldsp;
6164 if(!maxargs) RETURN;
6166 /* We do this here, rather than with a separate pushmark op, as it has
6167 to come in between two things this function does (stack reset and
6168 arg pushing). This seems the easiest way to do it. */
6171 (void)Perl_pp_pushmark(aTHX);
6174 EXTEND(SP, maxargs == I32_MAX ? numargs : maxargs);
6175 PUTBACK; /* The code below can die in various places. */
6177 oa = PL_opargs[opnum] >> OASHIFT;
6178 for (; oa&&(numargs||!pushmark); (void)(numargs&&(++svp,--numargs))) {
6183 if (!numargs && defgv && whicharg == minargs + 1) {
6184 PUSHs(find_rundefsv2(
6185 find_runcv_where(FIND_RUNCV_level_eq, 1, NULL),
6186 cxstack[cxstack_ix].blk_oldcop->cop_seq
6189 else PUSHs(numargs ? svp && *svp ? *svp : &PL_sv_undef : NULL);
6193 PUSHs(svp && *svp ? *svp : &PL_sv_undef);
6198 if (!svp || !*svp || !SvROK(*svp)
6199 || SvTYPE(SvRV(*svp)) != SVt_PVHV)
6201 /* diag_listed_as: Type of arg %d to &CORE::%s must be %s*/
6202 "Type of arg %d to &CORE::%s must be hash reference",
6203 whicharg, OP_DESC(PL_op->op_next)
6208 if (!numargs) PUSHs(NULL);
6209 else if(svp && *svp && SvROK(*svp) && isGV_with_GP(SvRV(*svp)))
6210 /* no magic here, as the prototype will have added an extra
6211 refgen and we just want what was there before that */
6214 const bool constr = PL_op->op_private & whicharg;
6216 svp && *svp ? *svp : &PL_sv_undef,
6217 constr, cBOOL(CopHINTS_get(PL_curcop) & HINT_STRICT_REFS),
6223 if (!numargs) goto try_defsv;
6225 const bool wantscalar =
6226 PL_op->op_private & OPpCOREARGS_SCALARMOD;
6227 if (!svp || !*svp || !SvROK(*svp)
6228 /* We have to permit globrefs even for the \$ proto, as
6229 *foo is indistinguishable from ${\*foo}, and the proto-
6230 type permits the latter. */
6231 || SvTYPE(SvRV(*svp)) > (
6232 wantscalar ? SVt_PVLV
6233 : opnum == OP_LOCK || opnum == OP_UNDEF
6239 "Type of arg %d to &CORE::%s must be %s",
6240 whicharg, PL_op_name[opnum],
6242 ? "scalar reference"
6243 : opnum == OP_LOCK || opnum == OP_UNDEF
6244 ? "reference to one of [$@%&*]"
6245 : "reference to one of [$@%*]"
6248 if (opnum == OP_UNDEF && SvRV(*svp) == (SV *)PL_defgv
6249 && cxstack[cxstack_ix].cx_type & CXp_HASARGS) {
6250 /* Undo @_ localisation, so that sub exit does not undo
6251 part of our undeffing. */
6252 PERL_CONTEXT *cx = &cxstack[cxstack_ix];
6254 cx->cx_type &= ~ CXp_HASARGS;
6255 assert(!AvREAL(cx->blk_sub.argarray));
6260 DIE(aTHX_ "panic: unknown OA_*: %x", (unsigned)(oa&7));
6272 if (PL_op->op_private & OPpOFFBYONE) {
6273 cv = find_runcv_where(FIND_RUNCV_level_eq, 1, NULL);
6275 else cv = find_runcv(NULL);
6276 XPUSHs(CvEVAL(cv) ? &PL_sv_undef : sv_2mortal(newRV((SV *)cv)));
6281 S_localise_aelem_lval(pTHX_ AV * const av, SV * const keysv,
6282 const bool can_preserve)
6284 const SSize_t ix = SvIV(keysv);
6285 if (can_preserve ? av_exists(av, ix) : TRUE) {
6286 SV ** const svp = av_fetch(av, ix, 1);
6288 Perl_croak(aTHX_ PL_no_aelem, ix);
6289 save_aelem(av, ix, svp);
6292 SAVEADELETE(av, ix);
6296 S_localise_helem_lval(pTHX_ HV * const hv, SV * const keysv,
6297 const bool can_preserve)
6299 if (can_preserve ? hv_exists_ent(hv, keysv, 0) : TRUE) {
6300 HE * const he = hv_fetch_ent(hv, keysv, 1, 0);
6301 SV ** const svp = he ? &HeVAL(he) : NULL;
6303 Perl_croak(aTHX_ PL_no_helem_sv, SVfARG(keysv));
6304 save_helem_flags(hv, keysv, svp, 0);
6307 SAVEHDELETE(hv, keysv);
6311 S_localise_gv_slot(pTHX_ GV *gv, U8 type)
6313 if (type == OPpLVREF_SV) {
6314 save_pushptrptr(gv, SvREFCNT_inc_simple(GvSV(gv)), SAVEt_GVSV);
6317 else if (type == OPpLVREF_AV)
6318 /* XXX Inefficient, as it creates a new AV, which we are
6319 about to clobber. */
6322 assert(type == OPpLVREF_HV);
6323 /* XXX Likewise inefficient. */
6332 SV * const key = PL_op->op_private & OPpLVREF_ELEM ? POPs : NULL;
6333 SV * const left = PL_op->op_flags & OPf_STACKED ? POPs : NULL;
6335 const char *bad = NULL;
6336 const U8 type = PL_op->op_private & OPpLVREF_TYPE;
6337 if (!SvROK(sv)) DIE(aTHX_ "Assigned value is not a reference");
6340 if (SvTYPE(SvRV(sv)) > SVt_PVLV)
6344 if (SvTYPE(SvRV(sv)) != SVt_PVAV)
6348 if (SvTYPE(SvRV(sv)) != SVt_PVHV)
6352 if (SvTYPE(SvRV(sv)) != SVt_PVCV)
6356 /* diag_listed_as: Assigned value is not %s reference */
6357 DIE(aTHX_ "Assigned value is not a%s reference", bad);
6361 switch (left ? SvTYPE(left) : 0) {
6364 SV * const old = PAD_SV(ARGTARG);
6365 PAD_SETSV(ARGTARG, SvREFCNT_inc_NN(SvRV(sv)));
6367 if ((PL_op->op_private & (OPpLVAL_INTRO|OPpPAD_STATE))
6369 SAVECLEARSV(PAD_SVl(ARGTARG));
6373 if (PL_op->op_private & OPpLVAL_INTRO) {
6374 S_localise_gv_slot(aTHX_ (GV *)left, type);
6376 gv_setref(left, sv);
6381 if (UNLIKELY(PL_op->op_private & OPpLVAL_INTRO)) {
6382 S_localise_aelem_lval(aTHX_ (AV *)left, key,
6383 SvCANEXISTDELETE(left));
6385 av_store((AV *)left, SvIV(key), SvREFCNT_inc_simple_NN(SvRV(sv)));
6388 if (UNLIKELY(PL_op->op_private & OPpLVAL_INTRO)) {
6390 S_localise_helem_lval(aTHX_ (HV *)left, key,
6391 SvCANEXISTDELETE(left));
6393 (void)hv_store_ent((HV *)left, key, SvREFCNT_inc_simple_NN(SvRV(sv)), 0);
6395 if (PL_op->op_flags & OPf_MOD)
6396 SETs(sv_2mortal(newSVsv(sv)));
6397 /* XXX else can weak references go stale before they are read, e.g.,
6406 SV * const ret = sv_2mortal(newSV_type(SVt_PVMG));
6407 SV * const elem = PL_op->op_private & OPpLVREF_ELEM ? POPs : NULL;
6408 SV * const arg = PL_op->op_flags & OPf_STACKED ? POPs : NULL;
6409 MAGIC * const mg = sv_magicext(ret, arg, PERL_MAGIC_lvref,
6410 &PL_vtbl_lvref, (char *)elem,
6411 elem ? HEf_SVKEY : (I32)ARGTARG);
6412 mg->mg_private = PL_op->op_private;
6413 if (PL_op->op_private & OPpLVREF_ITER)
6414 mg->mg_flags |= MGf_PERSIST;
6415 if (UNLIKELY(PL_op->op_private & OPpLVAL_INTRO)) {
6421 const bool can_preserve = SvCANEXISTDELETE(arg);
6422 if (SvTYPE(arg) == SVt_PVAV)
6423 S_localise_aelem_lval(aTHX_ (AV *)arg, elem, can_preserve);
6425 S_localise_helem_lval(aTHX_ (HV *)arg, elem, can_preserve);
6429 S_localise_gv_slot(aTHX_ (GV *)arg,
6430 PL_op->op_private & OPpLVREF_TYPE);
6432 else if (!(PL_op->op_private & OPpPAD_STATE))
6433 SAVECLEARSV(PAD_SVl(ARGTARG));
6442 AV * const av = (AV *)POPs;
6443 const bool localizing = PL_op->op_private & OPpLVAL_INTRO;
6444 bool can_preserve = FALSE;
6446 if (UNLIKELY(localizing)) {
6451 can_preserve = SvCANEXISTDELETE(av);
6453 if (SvTYPE(av) == SVt_PVAV) {
6456 for (svp = MARK + 1; svp <= SP; svp++) {
6457 const SSize_t elem = SvIV(*svp);
6461 if (max > AvMAX(av))
6466 while (++MARK <= SP) {
6467 SV * const elemsv = *MARK;
6468 if (SvTYPE(av) == SVt_PVAV)
6469 S_localise_aelem_lval(aTHX_ av, elemsv, can_preserve);
6471 S_localise_helem_lval(aTHX_ (HV *)av, elemsv, can_preserve);
6472 *MARK = sv_2mortal(newSV_type(SVt_PVMG));
6473 sv_magic(*MARK,(SV *)av,PERL_MAGIC_lvref,(char *)elemsv,HEf_SVKEY);
6480 if (PL_op->op_flags & OPf_STACKED)
6481 Perl_pp_rv2av(aTHX);
6483 Perl_pp_padav(aTHX);
6487 SETs(0); /* special alias marker that aassign recognises */
6497 SETs(sv_2mortal((SV *)newCONSTSUB(SvTYPE(CopSTASH(PL_curcop))==SVt_PVHV
6498 ? CopSTASH(PL_curcop)
6500 NULL, SvREFCNT_inc_simple_NN(sv))));
6505 * ex: set ts=8 sts=4 sw=4 et: