3 * Copyright (c) 1991-2001, Larry Wall
5 * You may distribute under the terms of either the GNU General Public
6 * License or the Artistic License, as specified in the README file.
11 * "I wonder what the Entish is for 'yes' and 'no'," he thought.
19 #define SV_CHECK_THINKFIRST(sv) if (SvTHINKFIRST(sv)) sv_force_normal(sv)
21 static void do_report_used(pTHXo_ SV *sv);
22 static void do_clean_objs(pTHXo_ SV *sv);
23 #ifndef DISABLE_DESTRUCTOR_KLUDGE
24 static void do_clean_named_objs(pTHXo_ SV *sv);
26 static void do_clean_all(pTHXo_ SV *sv);
29 * "A time to plant, and a time to uproot what was planted..."
34 SvANY(p) = (void *)PL_sv_root; \
35 SvFLAGS(p) = SVTYPEMASK; \
40 /* sv_mutex must be held while calling uproot_SV() */
41 #define uproot_SV(p) \
44 PL_sv_root = (SV*)SvANY(p); \
81 for (sva = PL_sv_arenaroot; sva; sva = (SV *) SvANY(sva)) {
83 svend = &sva[SvREFCNT(sva)];
84 if (p >= sv && p < svend)
88 if (ckWARN_d(WARN_INTERNAL))
89 Perl_warner(aTHX_ WARN_INTERNAL,
90 "Attempt to free non-arena SV: 0x%"UVxf,
98 #else /* ! DEBUGGING */
100 #define del_SV(p) plant_SV(p)
102 #endif /* DEBUGGING */
105 Perl_sv_add_arena(pTHX_ char *ptr, U32 size, U32 flags)
110 Zero(ptr, size, char);
112 /* The first SV in an arena isn't an SV. */
113 SvANY(sva) = (void *) PL_sv_arenaroot; /* ptr to next arena */
114 SvREFCNT(sva) = size / sizeof(SV); /* number of SV slots */
115 SvFLAGS(sva) = flags; /* FAKE if not to be freed */
117 PL_sv_arenaroot = sva;
118 PL_sv_root = sva + 1;
120 svend = &sva[SvREFCNT(sva) - 1];
123 SvANY(sv) = (void *)(SV*)(sv + 1);
124 SvFLAGS(sv) = SVTYPEMASK;
128 SvFLAGS(sv) = SVTYPEMASK;
131 /* sv_mutex must be held while calling more_sv() */
138 sv_add_arena(PL_nice_chunk, PL_nice_chunk_size, 0);
139 PL_nice_chunk = Nullch;
140 PL_nice_chunk_size = 0;
143 char *chunk; /* must use New here to match call to */
144 New(704,chunk,1008,char); /* Safefree() in sv_free_arenas() */
145 sv_add_arena(chunk, 1008, 0);
152 S_visit(pTHX_ SVFUNC_t f)
159 for (sva = PL_sv_arenaroot; sva; sva = (SV*)SvANY(sva)) {
160 svend = &sva[SvREFCNT(sva)];
161 for (sv = sva + 1; sv < svend; ++sv) {
162 if (SvTYPE(sv) != SVTYPEMASK && SvREFCNT(sv)) {
172 Perl_sv_report_used(pTHX)
174 visit(do_report_used);
178 Perl_sv_clean_objs(pTHX)
180 PL_in_clean_objs = TRUE;
181 visit(do_clean_objs);
182 #ifndef DISABLE_DESTRUCTOR_KLUDGE
183 /* some barnacles may yet remain, clinging to typeglobs */
184 visit(do_clean_named_objs);
186 PL_in_clean_objs = FALSE;
190 Perl_sv_clean_all(pTHX)
193 PL_in_clean_all = TRUE;
194 cleaned = visit(do_clean_all);
195 PL_in_clean_all = FALSE;
200 Perl_sv_free_arenas(pTHX)
204 XPV *arena, *arenanext;
206 /* Free arenas here, but be careful about fake ones. (We assume
207 contiguity of the fake ones with the corresponding real ones.) */
209 for (sva = PL_sv_arenaroot; sva; sva = svanext) {
210 svanext = (SV*) SvANY(sva);
211 while (svanext && SvFAKE(svanext))
212 svanext = (SV*) SvANY(svanext);
215 Safefree((void *)sva);
218 for (arena = PL_xiv_arenaroot; arena; arena = arenanext) {
219 arenanext = (XPV*)arena->xpv_pv;
222 PL_xiv_arenaroot = 0;
224 for (arena = PL_xnv_arenaroot; arena; arena = arenanext) {
225 arenanext = (XPV*)arena->xpv_pv;
228 PL_xnv_arenaroot = 0;
230 for (arena = PL_xrv_arenaroot; arena; arena = arenanext) {
231 arenanext = (XPV*)arena->xpv_pv;
234 PL_xrv_arenaroot = 0;
236 for (arena = PL_xpv_arenaroot; arena; arena = arenanext) {
237 arenanext = (XPV*)arena->xpv_pv;
240 PL_xpv_arenaroot = 0;
242 for (arena = (XPV*)PL_xpviv_arenaroot; arena; arena = arenanext) {
243 arenanext = (XPV*)arena->xpv_pv;
246 PL_xpviv_arenaroot = 0;
248 for (arena = (XPV*)PL_xpvnv_arenaroot; arena; arena = arenanext) {
249 arenanext = (XPV*)arena->xpv_pv;
252 PL_xpvnv_arenaroot = 0;
254 for (arena = (XPV*)PL_xpvcv_arenaroot; arena; arena = arenanext) {
255 arenanext = (XPV*)arena->xpv_pv;
258 PL_xpvcv_arenaroot = 0;
260 for (arena = (XPV*)PL_xpvav_arenaroot; arena; arena = arenanext) {
261 arenanext = (XPV*)arena->xpv_pv;
264 PL_xpvav_arenaroot = 0;
266 for (arena = (XPV*)PL_xpvhv_arenaroot; arena; arena = arenanext) {
267 arenanext = (XPV*)arena->xpv_pv;
270 PL_xpvhv_arenaroot = 0;
272 for (arena = (XPV*)PL_xpvmg_arenaroot; arena; arena = arenanext) {
273 arenanext = (XPV*)arena->xpv_pv;
276 PL_xpvmg_arenaroot = 0;
278 for (arena = (XPV*)PL_xpvlv_arenaroot; arena; arena = arenanext) {
279 arenanext = (XPV*)arena->xpv_pv;
282 PL_xpvlv_arenaroot = 0;
284 for (arena = (XPV*)PL_xpvbm_arenaroot; arena; arena = arenanext) {
285 arenanext = (XPV*)arena->xpv_pv;
288 PL_xpvbm_arenaroot = 0;
290 for (arena = (XPV*)PL_he_arenaroot; arena; arena = arenanext) {
291 arenanext = (XPV*)arena->xpv_pv;
297 Safefree(PL_nice_chunk);
298 PL_nice_chunk = Nullch;
299 PL_nice_chunk_size = 0;
305 Perl_report_uninit(pTHX)
308 Perl_warner(aTHX_ WARN_UNINITIALIZED, PL_warn_uninit,
309 " in ", PL_op_desc[PL_op->op_type]);
311 Perl_warner(aTHX_ WARN_UNINITIALIZED, PL_warn_uninit, "", "");
323 * See comment in more_xiv() -- RAM.
325 PL_xiv_root = *(IV**)xiv;
327 return (XPVIV*)((char*)xiv - STRUCT_OFFSET(XPVIV, xiv_iv));
331 S_del_xiv(pTHX_ XPVIV *p)
333 IV* xiv = (IV*)((char*)(p) + STRUCT_OFFSET(XPVIV, xiv_iv));
335 *(IV**)xiv = PL_xiv_root;
346 New(705, ptr, 1008/sizeof(XPV), XPV);
347 ptr->xpv_pv = (char*)PL_xiv_arenaroot; /* linked list of xiv arenas */
348 PL_xiv_arenaroot = ptr; /* to keep Purify happy */
351 xivend = &xiv[1008 / sizeof(IV) - 1];
352 xiv += (sizeof(XPV) - 1) / sizeof(IV) + 1; /* fudge by size of XPV */
354 while (xiv < xivend) {
355 *(IV**)xiv = (IV *)(xiv + 1);
369 PL_xnv_root = *(NV**)xnv;
371 return (XPVNV*)((char*)xnv - STRUCT_OFFSET(XPVNV, xnv_nv));
375 S_del_xnv(pTHX_ XPVNV *p)
377 NV* xnv = (NV*)((char*)(p) + STRUCT_OFFSET(XPVNV, xnv_nv));
379 *(NV**)xnv = PL_xnv_root;
390 New(711, ptr, 1008/sizeof(XPV), XPV);
391 ptr->xpv_pv = (char*)PL_xnv_arenaroot;
392 PL_xnv_arenaroot = ptr;
395 xnvend = &xnv[1008 / sizeof(NV) - 1];
396 xnv += (sizeof(XPVIV) - 1) / sizeof(NV) + 1; /* fudge by sizeof XPVIV */
398 while (xnv < xnvend) {
399 *(NV**)xnv = (NV*)(xnv + 1);
413 PL_xrv_root = (XRV*)xrv->xrv_rv;
419 S_del_xrv(pTHX_ XRV *p)
422 p->xrv_rv = (SV*)PL_xrv_root;
431 register XRV* xrvend;
433 New(712, ptr, 1008/sizeof(XPV), XPV);
434 ptr->xpv_pv = (char*)PL_xrv_arenaroot;
435 PL_xrv_arenaroot = ptr;
438 xrvend = &xrv[1008 / sizeof(XRV) - 1];
439 xrv += (sizeof(XPV) - 1) / sizeof(XRV) + 1;
441 while (xrv < xrvend) {
442 xrv->xrv_rv = (SV*)(xrv + 1);
456 PL_xpv_root = (XPV*)xpv->xpv_pv;
462 S_del_xpv(pTHX_ XPV *p)
465 p->xpv_pv = (char*)PL_xpv_root;
474 register XPV* xpvend;
475 New(713, xpv, 1008/sizeof(XPV), XPV);
476 xpv->xpv_pv = (char*)PL_xpv_arenaroot;
477 PL_xpv_arenaroot = xpv;
479 xpvend = &xpv[1008 / sizeof(XPV) - 1];
481 while (xpv < xpvend) {
482 xpv->xpv_pv = (char*)(xpv + 1);
495 xpviv = PL_xpviv_root;
496 PL_xpviv_root = (XPVIV*)xpviv->xpv_pv;
502 S_del_xpviv(pTHX_ XPVIV *p)
505 p->xpv_pv = (char*)PL_xpviv_root;
513 register XPVIV* xpviv;
514 register XPVIV* xpvivend;
515 New(714, xpviv, 1008/sizeof(XPVIV), XPVIV);
516 xpviv->xpv_pv = (char*)PL_xpviv_arenaroot;
517 PL_xpviv_arenaroot = xpviv;
519 xpvivend = &xpviv[1008 / sizeof(XPVIV) - 1];
520 PL_xpviv_root = ++xpviv;
521 while (xpviv < xpvivend) {
522 xpviv->xpv_pv = (char*)(xpviv + 1);
535 xpvnv = PL_xpvnv_root;
536 PL_xpvnv_root = (XPVNV*)xpvnv->xpv_pv;
542 S_del_xpvnv(pTHX_ XPVNV *p)
545 p->xpv_pv = (char*)PL_xpvnv_root;
553 register XPVNV* xpvnv;
554 register XPVNV* xpvnvend;
555 New(715, xpvnv, 1008/sizeof(XPVNV), XPVNV);
556 xpvnv->xpv_pv = (char*)PL_xpvnv_arenaroot;
557 PL_xpvnv_arenaroot = xpvnv;
559 xpvnvend = &xpvnv[1008 / sizeof(XPVNV) - 1];
560 PL_xpvnv_root = ++xpvnv;
561 while (xpvnv < xpvnvend) {
562 xpvnv->xpv_pv = (char*)(xpvnv + 1);
575 xpvcv = PL_xpvcv_root;
576 PL_xpvcv_root = (XPVCV*)xpvcv->xpv_pv;
582 S_del_xpvcv(pTHX_ XPVCV *p)
585 p->xpv_pv = (char*)PL_xpvcv_root;
593 register XPVCV* xpvcv;
594 register XPVCV* xpvcvend;
595 New(716, xpvcv, 1008/sizeof(XPVCV), XPVCV);
596 xpvcv->xpv_pv = (char*)PL_xpvcv_arenaroot;
597 PL_xpvcv_arenaroot = xpvcv;
599 xpvcvend = &xpvcv[1008 / sizeof(XPVCV) - 1];
600 PL_xpvcv_root = ++xpvcv;
601 while (xpvcv < xpvcvend) {
602 xpvcv->xpv_pv = (char*)(xpvcv + 1);
615 xpvav = PL_xpvav_root;
616 PL_xpvav_root = (XPVAV*)xpvav->xav_array;
622 S_del_xpvav(pTHX_ XPVAV *p)
625 p->xav_array = (char*)PL_xpvav_root;
633 register XPVAV* xpvav;
634 register XPVAV* xpvavend;
635 New(717, xpvav, 1008/sizeof(XPVAV), XPVAV);
636 xpvav->xav_array = (char*)PL_xpvav_arenaroot;
637 PL_xpvav_arenaroot = xpvav;
639 xpvavend = &xpvav[1008 / sizeof(XPVAV) - 1];
640 PL_xpvav_root = ++xpvav;
641 while (xpvav < xpvavend) {
642 xpvav->xav_array = (char*)(xpvav + 1);
645 xpvav->xav_array = 0;
655 xpvhv = PL_xpvhv_root;
656 PL_xpvhv_root = (XPVHV*)xpvhv->xhv_array;
662 S_del_xpvhv(pTHX_ XPVHV *p)
665 p->xhv_array = (char*)PL_xpvhv_root;
673 register XPVHV* xpvhv;
674 register XPVHV* xpvhvend;
675 New(718, xpvhv, 1008/sizeof(XPVHV), XPVHV);
676 xpvhv->xhv_array = (char*)PL_xpvhv_arenaroot;
677 PL_xpvhv_arenaroot = xpvhv;
679 xpvhvend = &xpvhv[1008 / sizeof(XPVHV) - 1];
680 PL_xpvhv_root = ++xpvhv;
681 while (xpvhv < xpvhvend) {
682 xpvhv->xhv_array = (char*)(xpvhv + 1);
685 xpvhv->xhv_array = 0;
695 xpvmg = PL_xpvmg_root;
696 PL_xpvmg_root = (XPVMG*)xpvmg->xpv_pv;
702 S_del_xpvmg(pTHX_ XPVMG *p)
705 p->xpv_pv = (char*)PL_xpvmg_root;
713 register XPVMG* xpvmg;
714 register XPVMG* xpvmgend;
715 New(719, xpvmg, 1008/sizeof(XPVMG), XPVMG);
716 xpvmg->xpv_pv = (char*)PL_xpvmg_arenaroot;
717 PL_xpvmg_arenaroot = xpvmg;
719 xpvmgend = &xpvmg[1008 / sizeof(XPVMG) - 1];
720 PL_xpvmg_root = ++xpvmg;
721 while (xpvmg < xpvmgend) {
722 xpvmg->xpv_pv = (char*)(xpvmg + 1);
735 xpvlv = PL_xpvlv_root;
736 PL_xpvlv_root = (XPVLV*)xpvlv->xpv_pv;
742 S_del_xpvlv(pTHX_ XPVLV *p)
745 p->xpv_pv = (char*)PL_xpvlv_root;
753 register XPVLV* xpvlv;
754 register XPVLV* xpvlvend;
755 New(720, xpvlv, 1008/sizeof(XPVLV), XPVLV);
756 xpvlv->xpv_pv = (char*)PL_xpvlv_arenaroot;
757 PL_xpvlv_arenaroot = xpvlv;
759 xpvlvend = &xpvlv[1008 / sizeof(XPVLV) - 1];
760 PL_xpvlv_root = ++xpvlv;
761 while (xpvlv < xpvlvend) {
762 xpvlv->xpv_pv = (char*)(xpvlv + 1);
775 xpvbm = PL_xpvbm_root;
776 PL_xpvbm_root = (XPVBM*)xpvbm->xpv_pv;
782 S_del_xpvbm(pTHX_ XPVBM *p)
785 p->xpv_pv = (char*)PL_xpvbm_root;
793 register XPVBM* xpvbm;
794 register XPVBM* xpvbmend;
795 New(721, xpvbm, 1008/sizeof(XPVBM), XPVBM);
796 xpvbm->xpv_pv = (char*)PL_xpvbm_arenaroot;
797 PL_xpvbm_arenaroot = xpvbm;
799 xpvbmend = &xpvbm[1008 / sizeof(XPVBM) - 1];
800 PL_xpvbm_root = ++xpvbm;
801 while (xpvbm < xpvbmend) {
802 xpvbm->xpv_pv = (char*)(xpvbm + 1);
809 # define my_safemalloc(s) (void*)safexmalloc(717,s)
810 # define my_safefree(p) safexfree((char*)p)
812 # define my_safemalloc(s) (void*)safemalloc(s)
813 # define my_safefree(p) safefree((char*)p)
818 #define new_XIV() my_safemalloc(sizeof(XPVIV))
819 #define del_XIV(p) my_safefree(p)
821 #define new_XNV() my_safemalloc(sizeof(XPVNV))
822 #define del_XNV(p) my_safefree(p)
824 #define new_XRV() my_safemalloc(sizeof(XRV))
825 #define del_XRV(p) my_safefree(p)
827 #define new_XPV() my_safemalloc(sizeof(XPV))
828 #define del_XPV(p) my_safefree(p)
830 #define new_XPVIV() my_safemalloc(sizeof(XPVIV))
831 #define del_XPVIV(p) my_safefree(p)
833 #define new_XPVNV() my_safemalloc(sizeof(XPVNV))
834 #define del_XPVNV(p) my_safefree(p)
836 #define new_XPVCV() my_safemalloc(sizeof(XPVCV))
837 #define del_XPVCV(p) my_safefree(p)
839 #define new_XPVAV() my_safemalloc(sizeof(XPVAV))
840 #define del_XPVAV(p) my_safefree(p)
842 #define new_XPVHV() my_safemalloc(sizeof(XPVHV))
843 #define del_XPVHV(p) my_safefree(p)
845 #define new_XPVMG() my_safemalloc(sizeof(XPVMG))
846 #define del_XPVMG(p) my_safefree(p)
848 #define new_XPVLV() my_safemalloc(sizeof(XPVLV))
849 #define del_XPVLV(p) my_safefree(p)
851 #define new_XPVBM() my_safemalloc(sizeof(XPVBM))
852 #define del_XPVBM(p) my_safefree(p)
856 #define new_XIV() (void*)new_xiv()
857 #define del_XIV(p) del_xiv((XPVIV*) p)
859 #define new_XNV() (void*)new_xnv()
860 #define del_XNV(p) del_xnv((XPVNV*) p)
862 #define new_XRV() (void*)new_xrv()
863 #define del_XRV(p) del_xrv((XRV*) p)
865 #define new_XPV() (void*)new_xpv()
866 #define del_XPV(p) del_xpv((XPV *)p)
868 #define new_XPVIV() (void*)new_xpviv()
869 #define del_XPVIV(p) del_xpviv((XPVIV *)p)
871 #define new_XPVNV() (void*)new_xpvnv()
872 #define del_XPVNV(p) del_xpvnv((XPVNV *)p)
874 #define new_XPVCV() (void*)new_xpvcv()
875 #define del_XPVCV(p) del_xpvcv((XPVCV *)p)
877 #define new_XPVAV() (void*)new_xpvav()
878 #define del_XPVAV(p) del_xpvav((XPVAV *)p)
880 #define new_XPVHV() (void*)new_xpvhv()
881 #define del_XPVHV(p) del_xpvhv((XPVHV *)p)
883 #define new_XPVMG() (void*)new_xpvmg()
884 #define del_XPVMG(p) del_xpvmg((XPVMG *)p)
886 #define new_XPVLV() (void*)new_xpvlv()
887 #define del_XPVLV(p) del_xpvlv((XPVLV *)p)
889 #define new_XPVBM() (void*)new_xpvbm()
890 #define del_XPVBM(p) del_xpvbm((XPVBM *)p)
894 #define new_XPVGV() my_safemalloc(sizeof(XPVGV))
895 #define del_XPVGV(p) my_safefree(p)
897 #define new_XPVFM() my_safemalloc(sizeof(XPVFM))
898 #define del_XPVFM(p) my_safefree(p)
900 #define new_XPVIO() my_safemalloc(sizeof(XPVIO))
901 #define del_XPVIO(p) my_safefree(p)
904 =for apidoc sv_upgrade
906 Upgrade an SV to a more complex form. Use C<SvUPGRADE>. See
913 Perl_sv_upgrade(pTHX_ register SV *sv, U32 mt)
923 if (mt != SVt_PV && SvREADONLY(sv) && SvFAKE(sv)) {
927 if (SvTYPE(sv) == mt)
933 switch (SvTYPE(sv)) {
954 else if (mt < SVt_PVIV)
971 pv = (char*)SvRV(sv);
991 else if (mt == SVt_NV)
1002 del_XPVIV(SvANY(sv));
1012 del_XPVNV(SvANY(sv));
1020 magic = SvMAGIC(sv);
1021 stash = SvSTASH(sv);
1022 del_XPVMG(SvANY(sv));
1025 Perl_croak(aTHX_ "Can't upgrade that kind of scalar");
1030 Perl_croak(aTHX_ "Can't upgrade to undef");
1032 SvANY(sv) = new_XIV();
1036 SvANY(sv) = new_XNV();
1040 SvANY(sv) = new_XRV();
1044 SvANY(sv) = new_XPV();
1050 SvANY(sv) = new_XPVIV();
1060 SvANY(sv) = new_XPVNV();
1068 SvANY(sv) = new_XPVMG();
1074 SvMAGIC(sv) = magic;
1075 SvSTASH(sv) = stash;
1078 SvANY(sv) = new_XPVLV();
1084 SvMAGIC(sv) = magic;
1085 SvSTASH(sv) = stash;
1092 SvANY(sv) = new_XPVAV();
1100 SvMAGIC(sv) = magic;
1101 SvSTASH(sv) = stash;
1107 SvANY(sv) = new_XPVHV();
1115 SvMAGIC(sv) = magic;
1116 SvSTASH(sv) = stash;
1123 SvANY(sv) = new_XPVCV();
1124 Zero(SvANY(sv), 1, XPVCV);
1130 SvMAGIC(sv) = magic;
1131 SvSTASH(sv) = stash;
1134 SvANY(sv) = new_XPVGV();
1140 SvMAGIC(sv) = magic;
1141 SvSTASH(sv) = stash;
1149 SvANY(sv) = new_XPVBM();
1155 SvMAGIC(sv) = magic;
1156 SvSTASH(sv) = stash;
1162 SvANY(sv) = new_XPVFM();
1163 Zero(SvANY(sv), 1, XPVFM);
1169 SvMAGIC(sv) = magic;
1170 SvSTASH(sv) = stash;
1173 SvANY(sv) = new_XPVIO();
1174 Zero(SvANY(sv), 1, XPVIO);
1180 SvMAGIC(sv) = magic;
1181 SvSTASH(sv) = stash;
1182 IoPAGE_LEN(sv) = 60;
1185 SvFLAGS(sv) &= ~SVTYPEMASK;
1191 Perl_sv_backoff(pTHX_ register SV *sv)
1195 char *s = SvPVX(sv);
1196 SvLEN(sv) += SvIVX(sv);
1197 SvPVX(sv) -= SvIVX(sv);
1199 Move(s, SvPVX(sv), SvCUR(sv)+1, char);
1201 SvFLAGS(sv) &= ~SVf_OOK;
1208 Expands the character buffer in the SV. This will use C<sv_unref> and will
1209 upgrade the SV to C<SVt_PV>. Returns a pointer to the character buffer.
1216 Perl_sv_grow(pTHX_ register SV *sv, register STRLEN newlen)
1220 #ifdef HAS_64K_LIMIT
1221 if (newlen >= 0x10000) {
1222 PerlIO_printf(Perl_debug_log,
1223 "Allocation too large: %"UVxf"\n", (UV)newlen);
1226 #endif /* HAS_64K_LIMIT */
1229 if (SvTYPE(sv) < SVt_PV) {
1230 sv_upgrade(sv, SVt_PV);
1233 else if (SvOOK(sv)) { /* pv is offset? */
1236 if (newlen > SvLEN(sv))
1237 newlen += 10 * (newlen - SvCUR(sv)); /* avoid copy each time */
1238 #ifdef HAS_64K_LIMIT
1239 if (newlen >= 0x10000)
1245 if (newlen > SvLEN(sv)) { /* need more room? */
1246 if (SvLEN(sv) && s) {
1247 #if defined(MYMALLOC) && !defined(LEAKTEST)
1248 STRLEN l = malloced_size((void*)SvPVX(sv));
1254 Renew(s,newlen,char);
1257 New(703,s,newlen,char);
1259 SvLEN_set(sv, newlen);
1265 =for apidoc sv_setiv
1267 Copies an integer into the given SV. Does not handle 'set' magic. See
1274 Perl_sv_setiv(pTHX_ register SV *sv, IV i)
1276 SV_CHECK_THINKFIRST(sv);
1277 switch (SvTYPE(sv)) {
1279 sv_upgrade(sv, SVt_IV);
1282 sv_upgrade(sv, SVt_PVNV);
1286 sv_upgrade(sv, SVt_PVIV);
1295 Perl_croak(aTHX_ "Can't coerce %s to integer in %s", sv_reftype(sv,0),
1296 PL_op_desc[PL_op->op_type]);
1298 (void)SvIOK_only(sv); /* validate number */
1304 =for apidoc sv_setiv_mg
1306 Like C<sv_setiv>, but also handles 'set' magic.
1312 Perl_sv_setiv_mg(pTHX_ register SV *sv, IV i)
1319 =for apidoc sv_setuv
1321 Copies an unsigned integer into the given SV. Does not handle 'set' magic.
1328 Perl_sv_setuv(pTHX_ register SV *sv, UV u)
1330 /* With these two if statements:
1331 u=1.49 s=0.52 cu=72.49 cs=10.64 scripts=270 tests=20865
1334 u=1.35 s=0.47 cu=73.45 cs=11.43 scripts=270 tests=20865
1336 If you wish to remove them, please benchmark to see what the effect is
1338 if (u <= (UV)IV_MAX) {
1339 sv_setiv(sv, (IV)u);
1348 =for apidoc sv_setuv_mg
1350 Like C<sv_setuv>, but also handles 'set' magic.
1356 Perl_sv_setuv_mg(pTHX_ register SV *sv, UV u)
1358 /* With these two if statements:
1359 u=1.49 s=0.52 cu=72.49 cs=10.64 scripts=270 tests=20865
1362 u=1.35 s=0.47 cu=73.45 cs=11.43 scripts=270 tests=20865
1364 If you wish to remove them, please benchmark to see what the effect is
1366 if (u <= (UV)IV_MAX) {
1367 sv_setiv(sv, (IV)u);
1377 =for apidoc sv_setnv
1379 Copies a double into the given SV. Does not handle 'set' magic. See
1386 Perl_sv_setnv(pTHX_ register SV *sv, NV num)
1388 SV_CHECK_THINKFIRST(sv);
1389 switch (SvTYPE(sv)) {
1392 sv_upgrade(sv, SVt_NV);
1397 sv_upgrade(sv, SVt_PVNV);
1406 Perl_croak(aTHX_ "Can't coerce %s to number in %s", sv_reftype(sv,0),
1407 PL_op_name[PL_op->op_type]);
1410 (void)SvNOK_only(sv); /* validate number */
1415 =for apidoc sv_setnv_mg
1417 Like C<sv_setnv>, but also handles 'set' magic.
1423 Perl_sv_setnv_mg(pTHX_ register SV *sv, NV num)
1430 S_not_a_number(pTHX_ SV *sv)
1434 char *limit = tmpbuf + sizeof(tmpbuf) - 8;
1435 /* each *s can expand to 4 chars + "...\0",
1436 i.e. need room for 8 chars */
1439 for (s = SvPVX(sv), end = s + SvCUR(sv); s < end && d < limit; s++) {
1441 if (ch & 128 && !isPRINT_LC(ch)) {
1450 else if (ch == '\r') {
1454 else if (ch == '\f') {
1458 else if (ch == '\\') {
1462 else if (ch == '\0') {
1466 else if (isPRINT_LC(ch))
1481 Perl_warner(aTHX_ WARN_NUMERIC,
1482 "Argument \"%s\" isn't numeric in %s", tmpbuf,
1483 PL_op_desc[PL_op->op_type]);
1485 Perl_warner(aTHX_ WARN_NUMERIC,
1486 "Argument \"%s\" isn't numeric", tmpbuf);
1489 /* the number can be converted to integer with atol() or atoll() although */
1490 #define IS_NUMBER_TO_INT_BY_ATOL 0x01 /* integer (may have decimals) */
1491 #define IS_NUMBER_TO_INT_BY_STRTOL 0x02 /* it may exceed IV_MAX */
1492 #define IS_NUMBER_TO_INT_BY_ATOF 0x04 /* seen something like 123e4 */
1493 #define IS_NUMBER_LONGER_THAN_IV_MAX 0x08 /* more digits than IV_MAX */
1494 #define IS_NUMBER_AS_LONG_AS_IV_MAX 0x10 /* may(be not) larger than IV_MAX */
1495 #define IS_NUMBER_NOT_INT 0x20 /* seen a decimal point or e */
1496 #define IS_NUMBER_NEG 0x40 /* seen a leading - */
1497 #define IS_NUMBER_INFINITY 0x80 /* /^\s*-?Infinity\s*$/i */
1499 /* Actually, ISO C leaves conversion of UV to IV undefined, but
1500 until proven guilty, assume that things are not that bad... */
1502 /* As 64 bit platforms often have an NV that doesn't preserve all bits of
1503 an IV (an assumption perl has been based on to date) it becomes necessary
1504 to remove the assumption that the NV always carries enough precision to
1505 recreate the IV whenever needed, and that the NV is the canonical form.
1506 Instead, IV/UV and NV need to be given equal rights. So as to not lose
1507 precision as an side effect of conversion (which would lead to insanity
1508 and the dragon(s) in t/op/numconvert.t getting very angry) the intent is
1509 1) to distinguish between IV/UV/NV slots that have cached a valid
1510 conversion where precision was lost and IV/UV/NV slots that have a
1511 valid conversion which has lost no precision
1512 2) to ensure that if a numeric conversion to one form is request that
1513 would lose precision, the precise conversion (or differently
1514 imprecise conversion) is also performed and cached, to prevent
1515 requests for different numeric formats on the same SV causing
1516 lossy conversion chains. (lossless conversion chains are perfectly
1521 SvIOKp is true if the IV slot contains a valid value
1522 SvIOK is true only if the IV value is accurate (UV if SvIOK_UV true)
1523 SvNOKp is true if the NV slot contains a valid value
1524 SvNOK is true only if the NV value is accurate
1527 while converting from PV to NV check to see if converting that NV to an
1528 IV(or UV) would lose accuracy over a direct conversion from PV to
1529 IV(or UV). If it would, cache both conversions, return NV, but mark
1530 SV as IOK NOKp (ie not NOK).
1532 while converting from PV to IV check to see if converting that IV to an
1533 NV would lose accuracy over a direct conversion from PV to NV. If it
1534 would, cache both conversions, flag similarly.
1536 Before, the SV value "3.2" could become NV=3.2 IV=3 NOK, IOK quite
1537 correctly because if IV & NV were set NV *always* overruled.
1538 Now, "3.2" will become NV=3.2 IV=3 NOK, IOKp, because the flags meaning
1539 changes - now IV and NV together means that the two are interchangeable
1540 SvIVX == (IV) SvNVX && SvNVX == (NV) SvIVX;
1542 The benefit of this is operations such as pp_add know that if SvIOK is
1543 true for both left and right operands, then integer addition can be
1544 used instead of floating point. (for cases where the result won't
1545 overflow) Before, floating point was always used, which could lead to
1546 loss of precision compared with integer addition.
1548 * making IV and NV equal status should make maths accurate on 64 bit
1550 * may speed up maths somewhat if pp_add and friends start to use
1551 integers when possible instead of fp. (hopefully the overhead in
1552 looking for SvIOK and checking for overflow will not outweigh the
1553 fp to integer speedup)
1554 * will slow down integer operations (callers of SvIV) on "inaccurate"
1555 values, as the change from SvIOK to SvIOKp will cause a call into
1556 sv_2iv each time rather than a macro access direct to the IV slot
1557 * should speed up number->string conversion on integers as IV is
1558 favoured when IV and NV equally accurate
1560 ####################################################################
1561 You had better be using SvIOK_notUV if you want an IV for arithmetic
1562 SvIOK is true if (IV or UV), so you might be getting (IV)SvUV
1563 SvUOK is true iff UV.
1564 ####################################################################
1566 Your mileage will vary depending your CPUs relative fp to integer
1570 #ifndef NV_PRESERVES_UV
1571 #define IS_NUMBER_UNDERFLOW_IV 1
1572 #define IS_NUMBER_UNDERFLOW_UV 2
1573 #define IS_NUMBER_IV_AND_UV 2
1574 #define IS_NUMBER_OVERFLOW_IV 4
1575 #define IS_NUMBER_OVERFLOW_UV 5
1576 /* Hopefully your optimiser will consider inlining these two functions. */
1578 S_sv_2inuv_non_preserve (pTHX_ register SV *sv, I32 numtype) {
1579 NV nv = SvNVX(sv); /* Code simpler and had compiler problems if */
1580 UV nv_as_uv = U_V(nv); /* these are not in simple variables. */
1581 DEBUG_c(PerlIO_printf(Perl_debug_log,"sv_2inuv_non '%s', IV=0x%"UVxf" NV=%g inttype=%"UVXf"\n", SvPVX(sv), SvIVX(sv), nv, (UV)numtype));
1582 if (nv_as_uv <= (UV)IV_MAX) {
1583 (void)SvIOKp_on(sv);
1584 (void)SvNOKp_on(sv);
1585 /* Within suitable range to fit in an IV, atol won't overflow */
1586 /* XXX quite sure? Is that your final answer? not really, I'm
1587 trusting that nv_as_uv to round down if NV is (IV_MAX + 1) */
1588 SvIVX(sv) = (IV)Atol(SvPVX(sv));
1589 if (numtype & IS_NUMBER_NOT_INT) {
1590 /* I believe that even if the original PV had decimals, they
1591 are lost beyond the limit of the FP precision.
1592 However, neither is canonical, so both only get p flags.
1594 /* Both already have p flags, so do nothing */
1595 } else if (SvIVX(sv) == I_V(nv)) {
1600 /* It had no "." so it must be integer. assert (get in here from
1601 sv_2iv and sv_2uv only for ndef HAS_STRTOL and
1602 IS_NUMBER_AS_LONG_AS_IV_MAX) or my logic is faulty and all
1603 conversion routines need audit. */
1605 return nv < 0 ? IS_NUMBER_UNDERFLOW_UV : IS_NUMBER_IV_AND_UV;
1607 /* between IV_MAX and NV(UV_MAX). Could be slightly> UV_MAX */
1608 (void)SvIOKp_on(sv);
1609 (void)SvNOKp_on(sv);
1612 int save_errno = errno;
1614 SvUVX(sv) = Strtoul(SvPVX(sv), Null(char**), 10);
1616 if (numtype & IS_NUMBER_NOT_INT) {
1617 /* UV and NV both imprecise. */
1619 } else if (SvUVX(sv) == nv_as_uv && SvUVX(sv) != UV_MAX) {
1628 return IS_NUMBER_OVERFLOW_IV;
1632 /* Must have just overflowed UV, but not enough that an NV could spot
1634 return IS_NUMBER_OVERFLOW_UV;
1637 /* We've just lost integer precision, nothing we could do. */
1638 SvUVX(sv) = nv_as_uv;
1639 DEBUG_c(PerlIO_printf(Perl_debug_log,"sv_2niuv_non UV? '%s', UV=0x%"UVxf" NV=%g U_V(NV)=0x%"UVxf" inttype=%"UVXf"\n", SvPVX(sv), SvIVX(sv), nv, nv_as_uv, (UV)numtype));
1640 /* UV and NV slots equally valid only if we have casting symmetry. */
1641 if (numtype & IS_NUMBER_NOT_INT) {
1643 } else if (SvUVX(sv) == nv_as_uv && SvUVX(sv) != UV_MAX) {
1644 /* UV_MAX can cast up to NV (UV_MAX+1), that NV casts down to UV_MAX
1645 UV_MAX ought to be 0xFF...FFF which won't preserve (We only
1646 get to this point if NVs don't preserve UVs) */
1651 /* As above, I believe UV at least as good as NV */
1654 #endif /* HAS_STRTOUL */
1655 return IS_NUMBER_OVERFLOW_IV;
1658 /* For sv_2nv these three cases are "SvNOK and don't bother casting" */
1660 S_sv_2iuv_non_preserve (pTHX_ register SV *sv, I32 numtype)
1662 DEBUG_c(PerlIO_printf(Perl_debug_log,"sv_2iuv_non '%s', IV=0x%"UVxf" NV=%g inttype=%"UVXf"\n", SvPVX(sv), SvIVX(sv), SvNVX(sv), (UV)numtype));
1663 if (SvNVX(sv) < (NV)IV_MIN) {
1664 (void)SvIOKp_on(sv);
1667 return IS_NUMBER_UNDERFLOW_IV;
1669 if (SvNVX(sv) > (NV)UV_MAX) {
1670 (void)SvIOKp_on(sv);
1674 return IS_NUMBER_OVERFLOW_UV;
1676 if (!(numtype & (IS_NUMBER_TO_INT_BY_ATOL | IS_NUMBER_TO_INT_BY_STRTOL))) {
1677 (void)SvIOKp_on(sv);
1679 /* Can't use strtol etc to convert this string */
1680 if (SvNVX(sv) <= (UV)IV_MAX) {
1681 SvIVX(sv) = I_V(SvNVX(sv));
1682 if ((NV)(SvIVX(sv)) == SvNVX(sv)) {
1683 SvIOK_on(sv); /* Integer is precise. NOK, IOK */
1685 /* Integer is imprecise. NOK, IOKp */
1687 return SvNVX(sv) < 0 ? IS_NUMBER_UNDERFLOW_UV : IS_NUMBER_IV_AND_UV;
1690 SvUVX(sv) = U_V(SvNVX(sv));
1691 if ((NV)(SvUVX(sv)) == SvNVX(sv)) {
1692 if (SvUVX(sv) == UV_MAX) {
1693 /* As we know that NVs don't preserve UVs, UV_MAX cannot
1694 possibly be preserved by NV. Hence, it must be overflow.
1696 return IS_NUMBER_OVERFLOW_UV;
1698 SvIOK_on(sv); /* Integer is precise. NOK, UOK */
1700 /* Integer is imprecise. NOK, IOKp */
1702 return IS_NUMBER_OVERFLOW_IV;
1704 return S_sv_2inuv_non_preserve(aTHX_ sv, numtype);
1706 #endif /* NV_PRESERVES_UV*/
1709 Perl_sv_2iv(pTHX_ register SV *sv)
1713 if (SvGMAGICAL(sv)) {
1718 return I_V(SvNVX(sv));
1720 if (SvPOKp(sv) && SvLEN(sv))
1723 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
1724 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
1730 if (SvTHINKFIRST(sv)) {
1733 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv,numer)) &&
1734 (SvTYPE(tmpstr) != SVt_RV || (SvRV(tmpstr) != SvRV(sv))))
1735 return SvIV(tmpstr);
1736 return PTR2IV(SvRV(sv));
1738 if (SvREADONLY(sv) && SvFAKE(sv)) {
1739 sv_force_normal(sv);
1741 if (SvREADONLY(sv) && !SvOK(sv)) {
1742 if (ckWARN(WARN_UNINITIALIZED))
1749 return (IV)(SvUVX(sv));
1756 /* erm. not sure. *should* never get NOKp (without NOK) from sv_2nv
1757 * without also getting a cached IV/UV from it at the same time
1758 * (ie PV->NV conversion should detect loss of accuracy and cache
1759 * IV or UV at same time to avoid this. NWC */
1761 if (SvTYPE(sv) == SVt_NV)
1762 sv_upgrade(sv, SVt_PVNV);
1764 (void)SvIOKp_on(sv); /* Must do this first, to clear any SvOOK */
1765 /* < not <= as for NV doesn't preserve UV, ((NV)IV_MAX+1) will almost
1766 certainly cast into the IV range at IV_MAX, whereas the correct
1767 answer is the UV IV_MAX +1. Hence < ensures that dodgy boundary
1769 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
1770 SvIVX(sv) = I_V(SvNVX(sv));
1771 if (SvNVX(sv) == (NV) SvIVX(sv)
1772 #ifndef NV_PRESERVES_UV
1773 && (((UV)1 << NV_PRESERVES_UV_BITS) >
1774 (UV)(SvIVX(sv) > 0 ? SvIVX(sv) : -SvIVX(sv)))
1775 /* Don't flag it as "accurately an integer" if the number
1776 came from a (by definition imprecise) NV operation, and
1777 we're outside the range of NV integer precision */
1780 SvIOK_on(sv); /* Can this go wrong with rounding? NWC */
1781 DEBUG_c(PerlIO_printf(Perl_debug_log,
1782 "0x%"UVxf" iv(%g => %"IVdf") (precise)\n",
1788 /* IV not precise. No need to convert from PV, as NV
1789 conversion would already have cached IV if it detected
1790 that PV->IV would be better than PV->NV->IV
1791 flags already correct - don't set public IOK. */
1792 DEBUG_c(PerlIO_printf(Perl_debug_log,
1793 "0x%"UVxf" iv(%g => %"IVdf") (imprecise)\n",
1798 /* Can the above go wrong if SvIVX == IV_MIN and SvNVX < IV_MIN,
1799 but the cast (NV)IV_MIN rounds to a the value less (more
1800 negative) than IV_MIN which happens to be equal to SvNVX ??
1801 Analogous to 0xFFFFFFFFFFFFFFFF rounding up to NV (2**64) and
1802 NV rounding back to 0xFFFFFFFFFFFFFFFF, so UVX == UV(NVX) and
1803 (NV)UVX == NVX are both true, but the values differ. :-(
1804 Hopefully for 2s complement IV_MIN is something like
1805 0x8000000000000000 which will be exact. NWC */
1808 SvUVX(sv) = U_V(SvNVX(sv));
1810 (SvNVX(sv) == (NV) SvUVX(sv))
1811 #ifndef NV_PRESERVES_UV
1812 /* Make sure it's not 0xFFFFFFFFFFFFFFFF */
1813 /*&& (SvUVX(sv) != UV_MAX) irrelevant with code below */
1814 && (((UV)1 << NV_PRESERVES_UV_BITS) > SvUVX(sv))
1815 /* Don't flag it as "accurately an integer" if the number
1816 came from a (by definition imprecise) NV operation, and
1817 we're outside the range of NV integer precision */
1823 DEBUG_c(PerlIO_printf(Perl_debug_log,
1824 "0x%"UVxf" 2iv(%"UVuf" => %"IVdf") (as unsigned)\n",
1828 return (IV)SvUVX(sv);
1831 else if (SvPOKp(sv) && SvLEN(sv)) {
1832 I32 numtype = looks_like_number(sv);
1834 /* We want to avoid a possible problem when we cache an IV which
1835 may be later translated to an NV, and the resulting NV is not
1836 the translation of the initial data.
1838 This means that if we cache such an IV, we need to cache the
1839 NV as well. Moreover, we trade speed for space, and do not
1840 cache the NV if we are sure it's not needed.
1843 if ((numtype & ~IS_NUMBER_NEG) == IS_NUMBER_TO_INT_BY_ATOL) {
1844 /* The NV may be reconstructed from IV - safe to cache IV,
1845 which may be calculated by atol(). */
1846 if (SvTYPE(sv) < SVt_PVIV)
1847 sv_upgrade(sv, SVt_PVIV);
1849 SvIVX(sv) = Atol(SvPVX(sv));
1853 int save_errno = errno;
1854 /* Is it an integer that we could convert with strtol?
1855 So try it, and if it doesn't set errno then it's pukka.
1856 This should be faster than going atof and then thinking. */
1857 if (((numtype & (IS_NUMBER_TO_INT_BY_STRTOL | IS_NUMBER_NOT_INT))
1858 == IS_NUMBER_TO_INT_BY_STRTOL)
1859 /* && is a sequence point. Without it not sure if I'm trying
1860 to do too much between sequence points and hence going
1862 && ((errno = 0), 1) /* , 1 so always true */
1863 && ((i = Strtol(SvPVX(sv), Null(char**), 10)), 1)
1865 if (SvTYPE(sv) < SVt_PVIV)
1866 sv_upgrade(sv, SVt_PVIV);
1875 /* Hopefully trace flow will optimise this away where possible
1879 /* It wasn't an integer, or it overflowed, or we don't have
1880 strtol. Do things the slow way - check if it's a UV etc. */
1881 d = Atof(SvPVX(sv));
1883 if (SvTYPE(sv) < SVt_PVNV)
1884 sv_upgrade(sv, SVt_PVNV);
1887 if (! numtype && ckWARN(WARN_NUMERIC))
1890 #if defined(USE_LONG_DOUBLE)
1891 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2iv(%" PERL_PRIgldbl ")\n",
1892 PTR2UV(sv), SvNVX(sv)));
1894 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2iv(%g)\n",
1895 PTR2UV(sv), SvNVX(sv)));
1899 #ifdef NV_PRESERVES_UV
1900 (void)SvIOKp_on(sv);
1902 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
1903 SvIVX(sv) = I_V(SvNVX(sv));
1904 if ((NV)(SvIVX(sv)) == SvNVX(sv)) {
1907 /* Integer is imprecise. NOK, IOKp */
1909 /* UV will not work better than IV */
1911 if (SvNVX(sv) > (NV)UV_MAX) {
1913 /* Integer is inaccurate. NOK, IOKp, is UV */
1917 SvUVX(sv) = U_V(SvNVX(sv));
1918 /* 0xFFFFFFFFFFFFFFFF not an issue in here */
1919 if ((NV)(SvUVX(sv)) == SvNVX(sv)) {
1923 /* Integer is imprecise. NOK, IOKp, is UV */
1929 #else /* NV_PRESERVES_UV */
1930 if (((UV)1 << NV_PRESERVES_UV_BITS) >
1931 U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))) {
1932 /* Small enough to preserve all bits. */
1933 (void)SvIOKp_on(sv);
1935 SvIVX(sv) = I_V(SvNVX(sv));
1936 if ((NV)(SvIVX(sv)) == SvNVX(sv))
1938 /* Assumption: first non-preserved integer is < IV_MAX,
1939 this NV is in the preserved range, therefore: */
1940 if (!(U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))
1942 Perl_croak(aTHX_ "sv_2iv assumed (U_V(fabs(SvNVX(sv))) < (UV)IV_MAX) but SvNVX(sv)=%g U_V is 0x%"UVxf", IV_MAX is 0x%"UVxf"\n", SvNVX(sv), U_V(SvNVX(sv)), (UV)IV_MAX);
1944 } else if (sv_2iuv_non_preserve (sv, numtype)
1945 >= IS_NUMBER_OVERFLOW_IV)
1947 #endif /* NV_PRESERVES_UV */
1951 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing && !(SvFLAGS(sv) & SVs_PADTMP))
1953 if (SvTYPE(sv) < SVt_IV)
1954 /* Typically the caller expects that sv_any is not NULL now. */
1955 sv_upgrade(sv, SVt_IV);
1958 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2iv(%"IVdf")\n",
1959 PTR2UV(sv),SvIVX(sv)));
1960 return SvIsUV(sv) ? (IV)SvUVX(sv) : SvIVX(sv);
1964 Perl_sv_2uv(pTHX_ register SV *sv)
1968 if (SvGMAGICAL(sv)) {
1973 return U_V(SvNVX(sv));
1974 if (SvPOKp(sv) && SvLEN(sv))
1977 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
1978 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
1984 if (SvTHINKFIRST(sv)) {
1987 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv,numer)) &&
1988 (SvTYPE(tmpstr) != SVt_RV || (SvRV(tmpstr) != SvRV(sv))))
1989 return SvUV(tmpstr);
1990 return PTR2UV(SvRV(sv));
1992 if (SvREADONLY(sv) && SvFAKE(sv)) {
1993 sv_force_normal(sv);
1995 if (SvREADONLY(sv) && !SvOK(sv)) {
1996 if (ckWARN(WARN_UNINITIALIZED))
2006 return (UV)SvIVX(sv);
2010 /* erm. not sure. *should* never get NOKp (without NOK) from sv_2nv
2011 * without also getting a cached IV/UV from it at the same time
2012 * (ie PV->NV conversion should detect loss of accuracy and cache
2013 * IV or UV at same time to avoid this. */
2014 /* IV-over-UV optimisation - choose to cache IV if possible */
2016 if (SvTYPE(sv) == SVt_NV)
2017 sv_upgrade(sv, SVt_PVNV);
2019 (void)SvIOKp_on(sv); /* Must do this first, to clear any SvOOK */
2020 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2021 SvIVX(sv) = I_V(SvNVX(sv));
2022 if (SvNVX(sv) == (NV) SvIVX(sv)
2023 #ifndef NV_PRESERVES_UV
2024 && (((UV)1 << NV_PRESERVES_UV_BITS) >
2025 (UV)(SvIVX(sv) > 0 ? SvIVX(sv) : -SvIVX(sv)))
2026 /* Don't flag it as "accurately an integer" if the number
2027 came from a (by definition imprecise) NV operation, and
2028 we're outside the range of NV integer precision */
2031 SvIOK_on(sv); /* Can this go wrong with rounding? NWC */
2032 DEBUG_c(PerlIO_printf(Perl_debug_log,
2033 "0x%"UVxf" uv(%g => %"IVdf") (precise)\n",
2039 /* IV not precise. No need to convert from PV, as NV
2040 conversion would already have cached IV if it detected
2041 that PV->IV would be better than PV->NV->IV
2042 flags already correct - don't set public IOK. */
2043 DEBUG_c(PerlIO_printf(Perl_debug_log,
2044 "0x%"UVxf" uv(%g => %"IVdf") (imprecise)\n",
2049 /* Can the above go wrong if SvIVX == IV_MIN and SvNVX < IV_MIN,
2050 but the cast (NV)IV_MIN rounds to a the value less (more
2051 negative) than IV_MIN which happens to be equal to SvNVX ??
2052 Analogous to 0xFFFFFFFFFFFFFFFF rounding up to NV (2**64) and
2053 NV rounding back to 0xFFFFFFFFFFFFFFFF, so UVX == UV(NVX) and
2054 (NV)UVX == NVX are both true, but the values differ. :-(
2055 Hopefully for 2s complement IV_MIN is something like
2056 0x8000000000000000 which will be exact. NWC */
2059 SvUVX(sv) = U_V(SvNVX(sv));
2061 (SvNVX(sv) == (NV) SvUVX(sv))
2062 #ifndef NV_PRESERVES_UV
2063 /* Make sure it's not 0xFFFFFFFFFFFFFFFF */
2064 /*&& (SvUVX(sv) != UV_MAX) irrelevant with code below */
2065 && (((UV)1 << NV_PRESERVES_UV_BITS) > SvUVX(sv))
2066 /* Don't flag it as "accurately an integer" if the number
2067 came from a (by definition imprecise) NV operation, and
2068 we're outside the range of NV integer precision */
2073 DEBUG_c(PerlIO_printf(Perl_debug_log,
2074 "0x%"UVxf" 2uv(%"UVuf" => %"IVdf") (as unsigned)\n",
2080 else if (SvPOKp(sv) && SvLEN(sv)) {
2081 I32 numtype = looks_like_number(sv);
2083 /* We want to avoid a possible problem when we cache a UV which
2084 may be later translated to an NV, and the resulting NV is not
2085 the translation of the initial data.
2087 This means that if we cache such a UV, we need to cache the
2088 NV as well. Moreover, we trade speed for space, and do not
2089 cache the NV if not needed.
2092 if ((numtype & ~IS_NUMBER_NEG) == IS_NUMBER_TO_INT_BY_ATOL) {
2093 /* The NV may be reconstructed from IV - safe to cache IV,
2094 which may be calculated by atol(). */
2095 if (SvTYPE(sv) < SVt_PVIV)
2096 sv_upgrade(sv, SVt_PVIV);
2098 SvIVX(sv) = Atol(SvPVX(sv));
2102 char *num_begin = SvPVX(sv);
2103 int save_errno = errno;
2105 /* seems that strtoul taking numbers that start with - is
2106 implementation dependant, and can't be relied upon. */
2107 if (numtype & IS_NUMBER_NEG) {
2108 /* Not totally defensive. assumine that looks_like_num
2109 didn't lie about a - sign */
2110 while (isSPACE(*num_begin))
2112 if (*num_begin == '-')
2116 /* Is it an integer that we could convert with strtoul?
2117 So try it, and if it doesn't set errno then it's pukka.
2118 This should be faster than going atof and then thinking. */
2119 if (((numtype & (IS_NUMBER_TO_INT_BY_STRTOL | IS_NUMBER_NOT_INT))
2120 == IS_NUMBER_TO_INT_BY_STRTOL)
2121 && ((errno = 0), 1) /* always true */
2122 && ((u = Strtoul(num_begin, Null(char**), 10)), 1) /* ditto */
2124 /* If known to be negative, check it didn't undeflow IV
2125 XXX possibly we should put more negative values as NVs
2126 direct rather than go via atof below */
2127 && ((numtype & IS_NUMBER_NEG) ? (u <= (UV)IV_MIN) : 1)) {
2130 if (SvTYPE(sv) < SVt_PVIV)
2131 sv_upgrade(sv, SVt_PVIV);
2134 /* If it's negative must use IV.
2135 IV-over-UV optimisation */
2136 if (numtype & IS_NUMBER_NEG) {
2138 } else if (u <= (UV) IV_MAX) {
2141 /* it didn't overflow, and it was positive. */
2150 /* Hopefully trace flow will optimise this away where possible
2154 /* It wasn't an integer, or it overflowed, or we don't have
2155 strtol. Do things the slow way - check if it's a IV etc. */
2156 d = Atof(SvPVX(sv));
2158 if (SvTYPE(sv) < SVt_PVNV)
2159 sv_upgrade(sv, SVt_PVNV);
2162 if (! numtype && ckWARN(WARN_NUMERIC))
2165 #if defined(USE_LONG_DOUBLE)
2166 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2uv(%" PERL_PRIgldbl ")\n",
2167 PTR2UV(sv), SvNVX(sv)));
2169 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2uv(%g)\n",
2170 PTR2UV(sv), SvNVX(sv)));
2173 #ifdef NV_PRESERVES_UV
2174 (void)SvIOKp_on(sv);
2176 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2177 SvIVX(sv) = I_V(SvNVX(sv));
2178 if ((NV)(SvIVX(sv)) == SvNVX(sv)) {
2181 /* Integer is imprecise. NOK, IOKp */
2183 /* UV will not work better than IV */
2185 if (SvNVX(sv) > (NV)UV_MAX) {
2187 /* Integer is inaccurate. NOK, IOKp, is UV */
2191 SvUVX(sv) = U_V(SvNVX(sv));
2192 /* 0xFFFFFFFFFFFFFFFF not an issue in here, NVs
2193 NV preservse UV so can do correct comparison. */
2194 if ((NV)(SvUVX(sv)) == SvNVX(sv)) {
2198 /* Integer is imprecise. NOK, IOKp, is UV */
2203 #else /* NV_PRESERVES_UV */
2204 if (((UV)1 << NV_PRESERVES_UV_BITS) >
2205 U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))) {
2206 /* Small enough to preserve all bits. */
2207 (void)SvIOKp_on(sv);
2209 SvIVX(sv) = I_V(SvNVX(sv));
2210 if ((NV)(SvIVX(sv)) == SvNVX(sv))
2212 /* Assumption: first non-preserved integer is < IV_MAX,
2213 this NV is in the preserved range, therefore: */
2214 if (!(U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))
2216 Perl_croak(aTHX_ "sv_2uv assumed (U_V(fabs(SvNVX(sv))) < (UV)IV_MAX) but SvNVX(sv)=%g U_V is 0x%"UVxf", IV_MAX is 0x%"UVxf"\n", SvNVX(sv), U_V(SvNVX(sv)), (UV)IV_MAX);
2219 sv_2iuv_non_preserve (sv, numtype);
2220 #endif /* NV_PRESERVES_UV */
2225 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
2226 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
2229 if (SvTYPE(sv) < SVt_IV)
2230 /* Typically the caller expects that sv_any is not NULL now. */
2231 sv_upgrade(sv, SVt_IV);
2235 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2uv(%"UVuf")\n",
2236 PTR2UV(sv),SvUVX(sv)));
2237 return SvIsUV(sv) ? SvUVX(sv) : (UV)SvIVX(sv);
2241 Perl_sv_2nv(pTHX_ register SV *sv)
2245 if (SvGMAGICAL(sv)) {
2249 if (SvPOKp(sv) && SvLEN(sv)) {
2250 if (ckWARN(WARN_NUMERIC) && !SvIOKp(sv) && !looks_like_number(sv))
2252 return Atof(SvPVX(sv));
2256 return (NV)SvUVX(sv);
2258 return (NV)SvIVX(sv);
2261 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
2262 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
2268 if (SvTHINKFIRST(sv)) {
2271 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv,numer)) &&
2272 (SvTYPE(tmpstr) != SVt_RV || (SvRV(tmpstr) != SvRV(sv))))
2273 return SvNV(tmpstr);
2274 return PTR2NV(SvRV(sv));
2276 if (SvREADONLY(sv) && SvFAKE(sv)) {
2277 sv_force_normal(sv);
2279 if (SvREADONLY(sv) && !SvOK(sv)) {
2280 if (ckWARN(WARN_UNINITIALIZED))
2285 if (SvTYPE(sv) < SVt_NV) {
2286 if (SvTYPE(sv) == SVt_IV)
2287 sv_upgrade(sv, SVt_PVNV);
2289 sv_upgrade(sv, SVt_NV);
2290 #if defined(USE_LONG_DOUBLE)
2292 STORE_NUMERIC_LOCAL_SET_STANDARD();
2293 PerlIO_printf(Perl_debug_log,
2294 "0x%"UVxf" num(%" PERL_PRIgldbl ")\n",
2295 PTR2UV(sv), SvNVX(sv));
2296 RESTORE_NUMERIC_LOCAL();
2300 STORE_NUMERIC_LOCAL_SET_STANDARD();
2301 PerlIO_printf(Perl_debug_log, "0x%"UVxf" num(%g)\n",
2302 PTR2UV(sv), SvNVX(sv));
2303 RESTORE_NUMERIC_LOCAL();
2307 else if (SvTYPE(sv) < SVt_PVNV)
2308 sv_upgrade(sv, SVt_PVNV);
2309 if (SvNOKp(sv) && !(SvIOK(sv) || SvPOK(sv))) {
2312 else if (SvIOKp(sv) &&
2313 (!SvPOKp(sv) || !strchr(SvPVX(sv),'.') || !looks_like_number(sv)))
2315 SvNVX(sv) = SvIsUV(sv) ? (NV)SvUVX(sv) : (NV)SvIVX(sv);
2316 #ifdef NV_PRESERVES_UV
2319 /* Only set the public NV OK flag if this NV preserves the IV */
2320 /* Check it's not 0xFFFFFFFFFFFFFFFF */
2321 if (SvIsUV(sv) ? ((SvUVX(sv) != UV_MAX)&&(SvUVX(sv) == U_V(SvNVX(sv))))
2322 : (SvIVX(sv) == I_V(SvNVX(sv))))
2328 else if (SvPOKp(sv) && SvLEN(sv)) {
2329 if (ckWARN(WARN_NUMERIC) && !SvIOKp(sv) && !looks_like_number(sv))
2331 SvNVX(sv) = Atof(SvPVX(sv));
2332 #ifdef NV_PRESERVES_UV
2335 /* Only set the public NV OK flag if this NV preserves the value in
2336 the PV at least as well as an IV/UV would.
2337 Not sure how to do this 100% reliably. */
2338 /* if that shift count is out of range then Configure's test is
2339 wonky. We shouldn't be in here with NV_PRESERVES_UV_BITS ==
2341 if (((UV)1 << NV_PRESERVES_UV_BITS) >
2342 U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv)))
2343 SvNOK_on(sv); /* Definitely small enough to preserve all bits */
2344 else if (SvNVX(sv) < (NV)IV_MIN || SvNVX(sv) > (NV)UV_MAX) {
2345 /* Definitely too large/small to fit in an integer, so no loss
2346 of precision going to integer in the future via NV */
2349 /* Is it something we can run through strtol etc (ie no
2350 trailing exponent part)? */
2351 int numtype = looks_like_number(sv);
2352 /* XXX probably should cache this if called above */
2355 (IS_NUMBER_TO_INT_BY_ATOL | IS_NUMBER_TO_INT_BY_STRTOL))) {
2356 /* Can't use strtol etc to convert this string, so don't try */
2359 sv_2inuv_non_preserve (sv, numtype);
2361 #endif /* NV_PRESERVES_UV */
2364 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing && !(SvFLAGS(sv) & SVs_PADTMP))
2366 if (SvTYPE(sv) < SVt_NV)
2367 /* Typically the caller expects that sv_any is not NULL now. */
2368 /* XXX Ilya implies that this is a bug in callers that assume this
2369 and ideally should be fixed. */
2370 sv_upgrade(sv, SVt_NV);
2373 #if defined(USE_LONG_DOUBLE)
2375 STORE_NUMERIC_LOCAL_SET_STANDARD();
2376 PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2nv(%" PERL_PRIgldbl ")\n",
2377 PTR2UV(sv), SvNVX(sv));
2378 RESTORE_NUMERIC_LOCAL();
2382 STORE_NUMERIC_LOCAL_SET_STANDARD();
2383 PerlIO_printf(Perl_debug_log, "0x%"UVxf" 1nv(%g)\n",
2384 PTR2UV(sv), SvNVX(sv));
2385 RESTORE_NUMERIC_LOCAL();
2392 S_asIV(pTHX_ SV *sv)
2394 I32 numtype = looks_like_number(sv);
2397 if (numtype & IS_NUMBER_TO_INT_BY_ATOL)
2398 return Atol(SvPVX(sv));
2400 if (ckWARN(WARN_NUMERIC))
2403 d = Atof(SvPVX(sv));
2408 S_asUV(pTHX_ SV *sv)
2410 I32 numtype = looks_like_number(sv);
2413 if (numtype & IS_NUMBER_TO_INT_BY_ATOL)
2414 return Strtoul(SvPVX(sv), Null(char**), 10);
2417 if (ckWARN(WARN_NUMERIC))
2420 return U_V(Atof(SvPVX(sv)));
2424 * Returns a combination of (advisory only - can get false negatives)
2425 * IS_NUMBER_TO_INT_BY_ATOL, IS_NUMBER_TO_INT_BY_ATOF
2426 * IS_NUMBER_LONGER_THAN_IV_MAX, IS_NUMBER_AS_LONG_AS_IV_MAX
2427 * IS_NUMBER_NOT_INT, IS_NUMBER_NEG, IS_NUMBER_INFINITY
2428 * 0 if does not look like number.
2430 * (atol and strtol stop when they hit a decimal point. strtol will return
2431 * LONG_MAX and LONG_MIN when given out of range values. ANSI says they should
2432 * do this, and vendors have had 11 years to get it right.
2433 * However, will try to make it still work with only atol
2435 * IS_NUMBER_TO_INT_BY_ATOL 123456789 or 123456789.3 definitely < IV_MAX
2436 * IS_NUMBER_TO_INT_BY_STRTOL 123456789 or 123456789.3 if digits = IV_MAX
2437 * IS_NUMBER_TO_INT_BY_ATOF 123456789e0 or >> IV_MAX
2438 * IS_NUMBER_LONGER_THAN_IV_MAX lots of digits, don't bother with atol
2439 * IS_NUMBER_AS_LONG_AS_IV_MAX atol might hit LONG_MAX, might not.
2440 * IS_NUMBER_NOT_INT saw "." or "e"
2442 * IS_NUMBER_INFINITY
2446 =for apidoc looks_like_number
2448 Test if an the content of an SV looks like a number (or is a
2449 number). C<Inf> and C<Infinity> are treated as numbers (so will not
2450 issue a non-numeric warning), even if your atof() doesn't grok them.
2456 Perl_looks_like_number(pTHX_ SV *sv)
2459 register char *send;
2460 register char *sbegin;
2461 register char *nbegin;
2465 #ifdef USE_LOCALE_NUMERIC
2466 bool specialradix = FALSE;
2473 else if (SvPOKp(sv))
2474 sbegin = SvPV(sv, len);
2477 send = sbegin + len;
2484 numtype = IS_NUMBER_NEG;
2491 * we return IS_NUMBER_TO_INT_BY_ATOL if the number can converted to
2492 * integer with atol() without overflow, IS_NUMBER_TO_INT_BY_STRTOL if
2493 * possibly slightly larger than max int, IS_NUMBER_TO_INT_BY_ATOF if you
2494 * will need (int)atof().
2497 /* next must be digit or the radix separator or beginning of infinity */
2501 } while (isDIGIT(*s));
2503 /* Aaargh. long long really is irritating.
2504 In the gospel according to ANSI 1989, it is an axiom that "long"
2505 is the longest integer type, and that if you don't know how long
2506 something is you can cast it to long, and nothing will be lost
2507 (except possibly speed of execution if long is slower than the
2509 Now, one can't be sure if the old rules apply, or long long
2510 (or some other newfangled thing) is actually longer than the
2511 (formerly) longest thing.
2513 /* This lot will work for 64 bit *as long as* either
2514 either long is 64 bit
2515 or we can find both strtol/strtoq and strtoul/strtouq
2516 If not, we really should refuse to let the user use 64 bit IVs
2517 By "64 bit" I really mean IVs that don't get preserved by NVs
2518 It also should work for 128 bit IVs. Can any lend me a machine to
2521 if (s - nbegin > TYPE_DIGITS(UV)) /* Cannot cache ato[ul]() */
2522 numtype |= IS_NUMBER_TO_INT_BY_ATOF | IS_NUMBER_LONGER_THAN_IV_MAX;
2523 else if (s - nbegin < BIT_DIGITS(((sizeof (IV)>sizeof (long))
2524 ? sizeof(long) : sizeof (IV))*8-1))
2525 numtype |= IS_NUMBER_TO_INT_BY_ATOL;
2527 /* Can't be sure either way. (For 64 bit UV, 63 bit IV is 1 decimal
2528 digit less (IV_MAX= 9223372036854775807,
2529 UV_MAX= 18446744073709551615) so be cautious */
2530 numtype |= IS_NUMBER_TO_INT_BY_STRTOL | IS_NUMBER_AS_LONG_AS_IV_MAX;
2533 #ifdef USE_LOCALE_NUMERIC
2534 || (specialradix = IS_NUMERIC_RADIX(s))
2537 #ifdef USE_LOCALE_NUMERIC
2539 s += SvCUR(PL_numeric_radix_sv);
2543 numtype |= IS_NUMBER_NOT_INT;
2544 while (isDIGIT(*s)) /* optional digits after the radix */
2549 #ifdef USE_LOCALE_NUMERIC
2550 || (specialradix = IS_NUMERIC_RADIX(s))
2553 #ifdef USE_LOCALE_NUMERIC
2555 s += SvCUR(PL_numeric_radix_sv);
2559 numtype |= IS_NUMBER_TO_INT_BY_ATOL | IS_NUMBER_NOT_INT;
2560 /* no digits before the radix means we need digits after it */
2564 } while (isDIGIT(*s));
2569 else if (*s == 'I' || *s == 'i') {
2570 s++; if (*s != 'N' && *s != 'n') return 0;
2571 s++; if (*s != 'F' && *s != 'f') return 0;
2572 s++; if (*s == 'I' || *s == 'i') {
2573 s++; if (*s != 'N' && *s != 'n') return 0;
2574 s++; if (*s != 'I' && *s != 'i') return 0;
2575 s++; if (*s != 'T' && *s != 't') return 0;
2576 s++; if (*s != 'Y' && *s != 'y') return 0;
2585 numtype = (numtype & IS_NUMBER_NEG) /* Keep track of sign */
2586 | IS_NUMBER_INFINITY | IS_NUMBER_NOT_INT;
2588 /* we can have an optional exponent part */
2589 if (*s == 'e' || *s == 'E') {
2590 numtype &= IS_NUMBER_NEG;
2591 numtype |= IS_NUMBER_TO_INT_BY_ATOF | IS_NUMBER_NOT_INT;
2593 if (*s == '+' || *s == '-')
2598 } while (isDIGIT(*s));
2608 if (len == 10 && memEQ(sbegin, "0 but true", 10))
2609 return IS_NUMBER_TO_INT_BY_ATOL;
2614 Perl_sv_2pv_nolen(pTHX_ register SV *sv)
2617 return sv_2pv(sv, &n_a);
2620 /* We assume that buf is at least TYPE_CHARS(UV) long. */
2622 uiv_2buf(char *buf, IV iv, UV uv, int is_uv, char **peob)
2624 char *ptr = buf + TYPE_CHARS(UV);
2638 *--ptr = '0' + (uv % 10);
2647 Perl_sv_2pv(pTHX_ register SV *sv, STRLEN *lp)
2649 return sv_2pv_flags(sv, lp, SV_GMAGIC);
2653 Perl_sv_2pv_flags(pTHX_ register SV *sv, STRLEN *lp, I32 flags)
2658 char tbuf[64]; /* Must fit sprintf/Gconvert of longest IV/NV */
2659 char *tmpbuf = tbuf;
2665 if (SvGMAGICAL(sv)) {
2666 if (flags & SV_GMAGIC)
2674 (void)sprintf(tmpbuf,"%"UVuf, (UV)SvUVX(sv));
2676 (void)sprintf(tmpbuf,"%"IVdf, (IV)SvIVX(sv));
2681 Gconvert(SvNVX(sv), NV_DIG, 0, tmpbuf);
2686 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
2687 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
2694 if (SvTHINKFIRST(sv)) {
2697 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv,string)) &&
2698 (SvTYPE(tmpstr) != SVt_RV || (SvRV(tmpstr) != SvRV(sv))))
2699 return SvPV(tmpstr,*lp);
2706 switch (SvTYPE(sv)) {
2708 if ( ((SvFLAGS(sv) &
2709 (SVs_OBJECT|SVf_OK|SVs_GMG|SVs_SMG|SVs_RMG))
2710 == (SVs_OBJECT|SVs_RMG))
2711 && strEQ(s=HvNAME(SvSTASH(sv)), "Regexp")
2712 && (mg = mg_find(sv, PERL_MAGIC_qr))) {
2713 regexp *re = (regexp *)mg->mg_obj;
2716 char *fptr = "msix";
2721 U16 reganch = (re->reganch & PMf_COMPILETIME) >> 12;
2723 while((ch = *fptr++)) {
2725 reflags[left++] = ch;
2728 reflags[right--] = ch;
2733 reflags[left] = '-';
2737 mg->mg_len = re->prelen + 4 + left;
2738 New(616, mg->mg_ptr, mg->mg_len + 1 + left, char);
2739 Copy("(?", mg->mg_ptr, 2, char);
2740 Copy(reflags, mg->mg_ptr+2, left, char);
2741 Copy(":", mg->mg_ptr+left+2, 1, char);
2742 Copy(re->precomp, mg->mg_ptr+3+left, re->prelen, char);
2743 mg->mg_ptr[mg->mg_len - 1] = ')';
2744 mg->mg_ptr[mg->mg_len] = 0;
2746 PL_reginterp_cnt += re->program[0].next_off;
2758 case SVt_PVBM: if (SvROK(sv))
2761 s = "SCALAR"; break;
2762 case SVt_PVLV: s = "LVALUE"; break;
2763 case SVt_PVAV: s = "ARRAY"; break;
2764 case SVt_PVHV: s = "HASH"; break;
2765 case SVt_PVCV: s = "CODE"; break;
2766 case SVt_PVGV: s = "GLOB"; break;
2767 case SVt_PVFM: s = "FORMAT"; break;
2768 case SVt_PVIO: s = "IO"; break;
2769 default: s = "UNKNOWN"; break;
2773 Perl_sv_setpvf(aTHX_ tsv, "%s=%s", HvNAME(SvSTASH(sv)), s);
2776 Perl_sv_catpvf(aTHX_ tsv, "(0x%"UVxf")", PTR2UV(sv));
2782 if (SvREADONLY(sv) && !SvOK(sv)) {
2783 if (ckWARN(WARN_UNINITIALIZED))
2789 if (SvIOK(sv) || ((SvIOKp(sv) && !SvNOKp(sv)))) {
2790 /* I'm assuming that if both IV and NV are equally valid then
2791 converting the IV is going to be more efficient */
2792 U32 isIOK = SvIOK(sv);
2793 U32 isUIOK = SvIsUV(sv);
2794 char buf[TYPE_CHARS(UV)];
2797 if (SvTYPE(sv) < SVt_PVIV)
2798 sv_upgrade(sv, SVt_PVIV);
2800 ptr = uiv_2buf(buf, 0, SvUVX(sv), 1, &ebuf);
2802 ptr = uiv_2buf(buf, SvIVX(sv), 0, 0, &ebuf);
2803 SvGROW(sv, ebuf - ptr + 1); /* inlined from sv_setpvn */
2804 Move(ptr,SvPVX(sv),ebuf - ptr,char);
2805 SvCUR_set(sv, ebuf - ptr);
2815 else if (SvNOKp(sv)) {
2816 if (SvTYPE(sv) < SVt_PVNV)
2817 sv_upgrade(sv, SVt_PVNV);
2818 /* The +20 is pure guesswork. Configure test needed. --jhi */
2819 SvGROW(sv, NV_DIG + 20);
2821 olderrno = errno; /* some Xenix systems wipe out errno here */
2823 if (SvNVX(sv) == 0.0)
2824 (void)strcpy(s,"0");
2828 Gconvert(SvNVX(sv), NV_DIG, 0, s);
2831 #ifdef FIXNEGATIVEZERO
2832 if (*s == '-' && s[1] == '0' && !s[2])
2842 if (ckWARN(WARN_UNINITIALIZED)
2843 && !PL_localizing && !(SvFLAGS(sv) & SVs_PADTMP))
2846 if (SvTYPE(sv) < SVt_PV)
2847 /* Typically the caller expects that sv_any is not NULL now. */
2848 sv_upgrade(sv, SVt_PV);
2851 *lp = s - SvPVX(sv);
2854 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2pv(%s)\n",
2855 PTR2UV(sv),SvPVX(sv)));
2859 if (SvROK(sv)) { /* XXX Skip this when sv_pvn_force calls */
2860 /* Sneaky stuff here */
2864 tsv = newSVpv(tmpbuf, 0);
2880 len = strlen(tmpbuf);
2882 #ifdef FIXNEGATIVEZERO
2883 if (len == 2 && t[0] == '-' && t[1] == '0') {
2888 (void)SvUPGRADE(sv, SVt_PV);
2890 s = SvGROW(sv, len + 1);
2899 Perl_sv_2pvbyte_nolen(pTHX_ register SV *sv)
2902 return sv_2pvbyte(sv, &n_a);
2906 Perl_sv_2pvbyte(pTHX_ register SV *sv, STRLEN *lp)
2908 sv_utf8_downgrade(sv,0);
2909 return SvPV(sv,*lp);
2913 Perl_sv_2pvutf8_nolen(pTHX_ register SV *sv)
2916 return sv_2pvutf8(sv, &n_a);
2920 Perl_sv_2pvutf8(pTHX_ register SV *sv, STRLEN *lp)
2922 sv_utf8_upgrade(sv);
2923 return SvPV(sv,*lp);
2926 /* This function is only called on magical items */
2928 Perl_sv_2bool(pTHX_ register SV *sv)
2937 if (SvAMAGIC(sv) && (tmpsv=AMG_CALLun(sv,bool_)) &&
2938 (SvTYPE(tmpsv) != SVt_RV || (SvRV(tmpsv) != SvRV(sv))))
2939 return SvTRUE(tmpsv);
2940 return SvRV(sv) != 0;
2943 register XPV* Xpvtmp;
2944 if ((Xpvtmp = (XPV*)SvANY(sv)) &&
2945 (*Xpvtmp->xpv_pv > '0' ||
2946 Xpvtmp->xpv_cur > 1 ||
2947 (Xpvtmp->xpv_cur && *Xpvtmp->xpv_pv != '0')))
2954 return SvIVX(sv) != 0;
2957 return SvNVX(sv) != 0.0;
2965 =for apidoc sv_utf8_upgrade
2967 Convert the PV of an SV to its UTF8-encoded form.
2968 Forces the SV to string form it it is not already.
2969 Always sets the SvUTF8 flag to avoid future validity checks even
2970 if all the bytes have hibit clear.
2976 Perl_sv_utf8_upgrade(pTHX_ register SV *sv)
2978 return sv_utf8_upgrade_flags(sv, SV_GMAGIC);
2982 =for apidoc sv_utf8_upgrade_flags
2984 Convert the PV of an SV to its UTF8-encoded form.
2985 Forces the SV to string form it it is not already.
2986 Always sets the SvUTF8 flag to avoid future validity checks even
2987 if all the bytes have hibit clear. If C<flags> has C<SV_GMAGIC> bit set,
2988 will C<mg_get> on C<sv> if appropriate, else not. C<sv_utf8_upgrade> and
2989 C<sv_utf8_upgrade_nomg> are implemented in terms of this function.
2995 Perl_sv_utf8_upgrade_flags(pTHX_ register SV *sv, I32 flags)
3005 (void) sv_2pv_flags(sv,&len, flags);
3013 if (SvREADONLY(sv) && SvFAKE(sv)) {
3014 sv_force_normal(sv);
3017 /* This function could be much more efficient if we had a FLAG in SVs
3018 * to signal if there are any hibit chars in the PV.
3019 * Given that there isn't make loop fast as possible
3021 s = (U8 *) SvPVX(sv);
3022 e = (U8 *) SvEND(sv);
3026 if ((hibit = !NATIVE_IS_INVARIANT(ch)))
3032 len = SvCUR(sv) + 1; /* Plus the \0 */
3033 SvPVX(sv) = (char*)bytes_to_utf8((U8*)s, &len);
3034 SvCUR(sv) = len - 1;
3036 Safefree(s); /* No longer using what was there before. */
3037 SvLEN(sv) = len; /* No longer know the real size. */
3039 /* Mark as UTF-8 even if no hibit - saves scanning loop */
3045 =for apidoc sv_utf8_downgrade
3047 Attempt to convert the PV of an SV from UTF8-encoded to byte encoding.
3048 This may not be possible if the PV contains non-byte encoding characters;
3049 if this is the case, either returns false or, if C<fail_ok> is not
3056 Perl_sv_utf8_downgrade(pTHX_ register SV* sv, bool fail_ok)
3058 if (SvPOK(sv) && SvUTF8(sv)) {
3063 if (SvREADONLY(sv) && SvFAKE(sv))
3064 sv_force_normal(sv);
3065 s = (U8 *) SvPV(sv, len);
3066 if (!utf8_to_bytes(s, &len)) {
3069 #ifdef USE_BYTES_DOWNGRADES
3072 U8 *e = (U8 *) SvEND(sv);
3075 UV ch = utf8n_to_uvchr(s,(e-s),&len,0);
3076 if (first && ch > 255) {
3078 Perl_warner(aTHX_ WARN_UTF8, "Wide character in byte %s",
3079 PL_op_desc[PL_op->op_type]);
3081 Perl_warner(aTHX_ WARN_UTF8, "Wide character in byte");
3088 len = (d - (U8 *) SvPVX(sv));
3093 Perl_croak(aTHX_ "Wide character in %s",
3094 PL_op_desc[PL_op->op_type]);
3096 Perl_croak(aTHX_ "Wide character");
3107 =for apidoc sv_utf8_encode
3109 Convert the PV of an SV to UTF8-encoded, but then turn off the C<SvUTF8>
3110 flag so that it looks like octets again. Used as a building block
3111 for encode_utf8 in Encode.xs
3117 Perl_sv_utf8_encode(pTHX_ register SV *sv)
3119 (void) sv_utf8_upgrade(sv);
3124 =for apidoc sv_utf8_decode
3126 Convert the octets in the PV from UTF-8 to chars. Scan for validity and then
3127 turn of SvUTF8 if needed so that we see characters. Used as a building block
3128 for decode_utf8 in Encode.xs
3136 Perl_sv_utf8_decode(pTHX_ register SV *sv)
3142 /* The octets may have got themselves encoded - get them back as bytes */
3143 if (!sv_utf8_downgrade(sv, TRUE))
3146 /* it is actually just a matter of turning the utf8 flag on, but
3147 * we want to make sure everything inside is valid utf8 first.
3149 c = (U8 *) SvPVX(sv);
3150 if (!is_utf8_string(c, SvCUR(sv)+1))
3152 e = (U8 *) SvEND(sv);
3155 if (!UTF8_IS_INVARIANT(ch)) {
3165 /* Note: sv_setsv() should not be called with a source string that needs
3166 * to be reused, since it may destroy the source string if it is marked
3171 =for apidoc sv_setsv
3173 Copies the contents of the source SV C<ssv> into the destination SV C<dsv>.
3174 The source SV may be destroyed if it is mortal. Does not handle 'set'
3175 magic. See the macro forms C<SvSetSV>, C<SvSetSV_nosteal> and
3181 /* sv_setsv() is aliased to Perl_sv_setsv_macro; this function provided
3182 for binary compatibility only
3185 Perl_sv_setsv(pTHX_ SV *dstr, register SV *sstr)
3187 sv_setsv_flags(dstr, sstr, SV_GMAGIC);
3191 =for apidoc sv_setsv_flags
3193 Copies the contents of the source SV C<ssv> into the destination SV C<dsv>.
3194 The source SV may be destroyed if it is mortal. Does not handle 'set'
3195 magic. If C<flags> has C<SV_GMAGIC> bit set, will C<mg_get> on C<ssv> if
3196 appropriate, else not. C<sv_setsv> and C<sv_setsv_nomg> are implemented
3197 in terms of this function.
3203 Perl_sv_setsv_flags(pTHX_ SV *dstr, register SV *sstr, I32 flags)
3205 register U32 sflags;
3211 SV_CHECK_THINKFIRST(dstr);
3213 sstr = &PL_sv_undef;
3214 stype = SvTYPE(sstr);
3215 dtype = SvTYPE(dstr);
3219 /* There's a lot of redundancy below but we're going for speed here */
3224 if (dtype != SVt_PVGV) {
3225 (void)SvOK_off(dstr);
3233 sv_upgrade(dstr, SVt_IV);
3236 sv_upgrade(dstr, SVt_PVNV);
3240 sv_upgrade(dstr, SVt_PVIV);
3243 (void)SvIOK_only(dstr);
3244 SvIVX(dstr) = SvIVX(sstr);
3247 if (SvTAINTED(sstr))
3258 sv_upgrade(dstr, SVt_NV);
3263 sv_upgrade(dstr, SVt_PVNV);
3266 SvNVX(dstr) = SvNVX(sstr);
3267 (void)SvNOK_only(dstr);
3268 if (SvTAINTED(sstr))
3276 sv_upgrade(dstr, SVt_RV);
3277 else if (dtype == SVt_PVGV &&
3278 SvTYPE(SvRV(sstr)) == SVt_PVGV) {
3281 if (GvIMPORTED(dstr) != GVf_IMPORTED
3282 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3284 GvIMPORTED_on(dstr);
3295 sv_upgrade(dstr, SVt_PV);
3298 if (dtype < SVt_PVIV)
3299 sv_upgrade(dstr, SVt_PVIV);
3302 if (dtype < SVt_PVNV)
3303 sv_upgrade(dstr, SVt_PVNV);
3310 Perl_croak(aTHX_ "Bizarre copy of %s in %s", sv_reftype(sstr, 0),
3311 PL_op_name[PL_op->op_type]);
3313 Perl_croak(aTHX_ "Bizarre copy of %s", sv_reftype(sstr, 0));
3317 if (dtype <= SVt_PVGV) {
3319 if (dtype != SVt_PVGV) {
3320 char *name = GvNAME(sstr);
3321 STRLEN len = GvNAMELEN(sstr);
3322 sv_upgrade(dstr, SVt_PVGV);
3323 sv_magic(dstr, dstr, PERL_MAGIC_glob, Nullch, 0);
3324 GvSTASH(dstr) = (HV*)SvREFCNT_inc(GvSTASH(sstr));
3325 GvNAME(dstr) = savepvn(name, len);
3326 GvNAMELEN(dstr) = len;
3327 SvFAKE_on(dstr); /* can coerce to non-glob */
3329 /* ahem, death to those who redefine active sort subs */
3330 else if (PL_curstackinfo->si_type == PERLSI_SORT
3331 && GvCV(dstr) && PL_sortcop == CvSTART(GvCV(dstr)))
3332 Perl_croak(aTHX_ "Can't redefine active sort subroutine %s",
3335 #ifdef GV_SHARED_CHECK
3336 if (GvSHARED((GV*)dstr)) {
3337 Perl_croak(aTHX_ PL_no_modify);
3341 (void)SvOK_off(dstr);
3342 GvINTRO_off(dstr); /* one-shot flag */
3344 GvGP(dstr) = gp_ref(GvGP(sstr));
3345 if (SvTAINTED(sstr))
3347 if (GvIMPORTED(dstr) != GVf_IMPORTED
3348 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3350 GvIMPORTED_on(dstr);
3358 if (SvGMAGICAL(sstr) && (flags & SV_GMAGIC)) {
3360 if (SvTYPE(sstr) != stype) {
3361 stype = SvTYPE(sstr);
3362 if (stype == SVt_PVGV && dtype <= SVt_PVGV)
3366 if (stype == SVt_PVLV)
3367 (void)SvUPGRADE(dstr, SVt_PVNV);
3369 (void)SvUPGRADE(dstr, stype);
3372 sflags = SvFLAGS(sstr);
3374 if (sflags & SVf_ROK) {
3375 if (dtype >= SVt_PV) {
3376 if (dtype == SVt_PVGV) {
3377 SV *sref = SvREFCNT_inc(SvRV(sstr));
3379 int intro = GvINTRO(dstr);
3381 #ifdef GV_SHARED_CHECK
3382 if (GvSHARED((GV*)dstr)) {
3383 Perl_croak(aTHX_ PL_no_modify);
3390 GvINTRO_off(dstr); /* one-shot flag */
3391 Newz(602,gp, 1, GP);
3392 GvGP(dstr) = gp_ref(gp);
3393 GvSV(dstr) = NEWSV(72,0);
3394 GvLINE(dstr) = CopLINE(PL_curcop);
3395 GvEGV(dstr) = (GV*)dstr;
3398 switch (SvTYPE(sref)) {
3401 SAVESPTR(GvAV(dstr));
3403 dref = (SV*)GvAV(dstr);
3404 GvAV(dstr) = (AV*)sref;
3405 if (!GvIMPORTED_AV(dstr)
3406 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3408 GvIMPORTED_AV_on(dstr);
3413 SAVESPTR(GvHV(dstr));
3415 dref = (SV*)GvHV(dstr);
3416 GvHV(dstr) = (HV*)sref;
3417 if (!GvIMPORTED_HV(dstr)
3418 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3420 GvIMPORTED_HV_on(dstr);
3425 if (GvCVGEN(dstr) && GvCV(dstr) != (CV*)sref) {
3426 SvREFCNT_dec(GvCV(dstr));
3427 GvCV(dstr) = Nullcv;
3428 GvCVGEN(dstr) = 0; /* Switch off cacheness. */
3429 PL_sub_generation++;
3431 SAVESPTR(GvCV(dstr));
3434 dref = (SV*)GvCV(dstr);
3435 if (GvCV(dstr) != (CV*)sref) {
3436 CV* cv = GvCV(dstr);
3438 if (!GvCVGEN((GV*)dstr) &&
3439 (CvROOT(cv) || CvXSUB(cv)))
3441 /* ahem, death to those who redefine
3442 * active sort subs */
3443 if (PL_curstackinfo->si_type == PERLSI_SORT &&
3444 PL_sortcop == CvSTART(cv))
3446 "Can't redefine active sort subroutine %s",
3447 GvENAME((GV*)dstr));
3448 /* Redefining a sub - warning is mandatory if
3449 it was a const and its value changed. */
3450 if (ckWARN(WARN_REDEFINE)
3452 && (!CvCONST((CV*)sref)
3453 || sv_cmp(cv_const_sv(cv),
3454 cv_const_sv((CV*)sref)))))
3456 Perl_warner(aTHX_ WARN_REDEFINE,
3458 ? "Constant subroutine %s redefined"
3459 : "Subroutine %s redefined",
3460 GvENAME((GV*)dstr));
3463 cv_ckproto(cv, (GV*)dstr,
3464 SvPOK(sref) ? SvPVX(sref) : Nullch);
3466 GvCV(dstr) = (CV*)sref;
3467 GvCVGEN(dstr) = 0; /* Switch off cacheness. */
3468 GvASSUMECV_on(dstr);
3469 PL_sub_generation++;
3471 if (!GvIMPORTED_CV(dstr)
3472 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3474 GvIMPORTED_CV_on(dstr);
3479 SAVESPTR(GvIOp(dstr));
3481 dref = (SV*)GvIOp(dstr);
3482 GvIOp(dstr) = (IO*)sref;
3486 SAVESPTR(GvFORM(dstr));
3488 dref = (SV*)GvFORM(dstr);
3489 GvFORM(dstr) = (CV*)sref;
3493 SAVESPTR(GvSV(dstr));
3495 dref = (SV*)GvSV(dstr);
3497 if (!GvIMPORTED_SV(dstr)
3498 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3500 GvIMPORTED_SV_on(dstr);
3508 if (SvTAINTED(sstr))
3513 (void)SvOOK_off(dstr); /* backoff */
3515 Safefree(SvPVX(dstr));
3516 SvLEN(dstr)=SvCUR(dstr)=0;
3519 (void)SvOK_off(dstr);
3520 SvRV(dstr) = SvREFCNT_inc(SvRV(sstr));
3522 if (sflags & SVp_NOK) {
3524 /* Only set the public OK flag if the source has public OK. */
3525 if (sflags & SVf_NOK)
3526 SvFLAGS(dstr) |= SVf_NOK;
3527 SvNVX(dstr) = SvNVX(sstr);
3529 if (sflags & SVp_IOK) {
3530 (void)SvIOKp_on(dstr);
3531 if (sflags & SVf_IOK)
3532 SvFLAGS(dstr) |= SVf_IOK;
3533 if (sflags & SVf_IVisUV)
3535 SvIVX(dstr) = SvIVX(sstr);
3537 if (SvAMAGIC(sstr)) {
3541 else if (sflags & SVp_POK) {
3544 * Check to see if we can just swipe the string. If so, it's a
3545 * possible small lose on short strings, but a big win on long ones.
3546 * It might even be a win on short strings if SvPVX(dstr)
3547 * has to be allocated and SvPVX(sstr) has to be freed.
3550 if (SvTEMP(sstr) && /* slated for free anyway? */
3551 SvREFCNT(sstr) == 1 && /* and no other references to it? */
3552 !(sflags & SVf_OOK) && /* and not involved in OOK hack? */
3553 SvLEN(sstr) && /* and really is a string */
3554 !(PL_op && PL_op->op_type == OP_AASSIGN)) /* and won't be needed again, potentially */
3556 if (SvPVX(dstr)) { /* we know that dtype >= SVt_PV */
3558 SvFLAGS(dstr) &= ~SVf_OOK;
3559 Safefree(SvPVX(dstr) - SvIVX(dstr));
3561 else if (SvLEN(dstr))
3562 Safefree(SvPVX(dstr));
3564 (void)SvPOK_only(dstr);
3565 SvPV_set(dstr, SvPVX(sstr));
3566 SvLEN_set(dstr, SvLEN(sstr));
3567 SvCUR_set(dstr, SvCUR(sstr));
3570 (void)SvOK_off(sstr); /* NOTE: nukes most SvFLAGS on sstr */
3571 SvPV_set(sstr, Nullch);
3576 else { /* have to copy actual string */
3577 STRLEN len = SvCUR(sstr);
3579 SvGROW(dstr, len + 1); /* inlined from sv_setpvn */
3580 Move(SvPVX(sstr),SvPVX(dstr),len,char);
3581 SvCUR_set(dstr, len);
3582 *SvEND(dstr) = '\0';
3583 (void)SvPOK_only(dstr);
3585 if (sflags & SVf_UTF8)
3588 if (sflags & SVp_NOK) {
3590 if (sflags & SVf_NOK)
3591 SvFLAGS(dstr) |= SVf_NOK;
3592 SvNVX(dstr) = SvNVX(sstr);
3594 if (sflags & SVp_IOK) {
3595 (void)SvIOKp_on(dstr);
3596 if (sflags & SVf_IOK)
3597 SvFLAGS(dstr) |= SVf_IOK;
3598 if (sflags & SVf_IVisUV)
3600 SvIVX(dstr) = SvIVX(sstr);
3603 else if (sflags & SVp_IOK) {
3604 if (sflags & SVf_IOK)
3605 (void)SvIOK_only(dstr);
3607 (void)SvOK_off(dstr);
3608 (void)SvIOKp_on(dstr);
3610 /* XXXX Do we want to set IsUV for IV(ROK)? Be extra safe... */
3611 if (sflags & SVf_IVisUV)
3613 SvIVX(dstr) = SvIVX(sstr);
3614 if (sflags & SVp_NOK) {
3615 if (sflags & SVf_NOK)
3616 (void)SvNOK_on(dstr);
3618 (void)SvNOKp_on(dstr);
3619 SvNVX(dstr) = SvNVX(sstr);
3622 else if (sflags & SVp_NOK) {
3623 if (sflags & SVf_NOK)
3624 (void)SvNOK_only(dstr);
3626 (void)SvOK_off(dstr);
3629 SvNVX(dstr) = SvNVX(sstr);
3632 if (dtype == SVt_PVGV) {
3633 if (ckWARN(WARN_MISC))
3634 Perl_warner(aTHX_ WARN_MISC, "Undefined value assigned to typeglob");
3637 (void)SvOK_off(dstr);
3639 if (SvTAINTED(sstr))
3644 =for apidoc sv_setsv_mg
3646 Like C<sv_setsv>, but also handles 'set' magic.
3652 Perl_sv_setsv_mg(pTHX_ SV *dstr, register SV *sstr)
3654 sv_setsv(dstr,sstr);
3659 =for apidoc sv_setpvn
3661 Copies a string into an SV. The C<len> parameter indicates the number of
3662 bytes to be copied. Does not handle 'set' magic. See C<sv_setpvn_mg>.
3668 Perl_sv_setpvn(pTHX_ register SV *sv, register const char *ptr, register STRLEN len)
3670 register char *dptr;
3672 SV_CHECK_THINKFIRST(sv);
3678 /* len is STRLEN which is unsigned, need to copy to signed */
3682 (void)SvUPGRADE(sv, SVt_PV);
3684 SvGROW(sv, len + 1);
3686 Move(ptr,dptr,len,char);
3689 (void)SvPOK_only_UTF8(sv); /* validate pointer */
3694 =for apidoc sv_setpvn_mg
3696 Like C<sv_setpvn>, but also handles 'set' magic.
3702 Perl_sv_setpvn_mg(pTHX_ register SV *sv, register const char *ptr, register STRLEN len)
3704 sv_setpvn(sv,ptr,len);
3709 =for apidoc sv_setpv
3711 Copies a string into an SV. The string must be null-terminated. Does not
3712 handle 'set' magic. See C<sv_setpv_mg>.
3718 Perl_sv_setpv(pTHX_ register SV *sv, register const char *ptr)
3720 register STRLEN len;
3722 SV_CHECK_THINKFIRST(sv);
3728 (void)SvUPGRADE(sv, SVt_PV);
3730 SvGROW(sv, len + 1);
3731 Move(ptr,SvPVX(sv),len+1,char);
3733 (void)SvPOK_only_UTF8(sv); /* validate pointer */
3738 =for apidoc sv_setpv_mg
3740 Like C<sv_setpv>, but also handles 'set' magic.
3746 Perl_sv_setpv_mg(pTHX_ register SV *sv, register const char *ptr)
3753 =for apidoc sv_usepvn
3755 Tells an SV to use C<ptr> to find its string value. Normally the string is
3756 stored inside the SV but sv_usepvn allows the SV to use an outside string.
3757 The C<ptr> should point to memory that was allocated by C<malloc>. The
3758 string length, C<len>, must be supplied. This function will realloc the
3759 memory pointed to by C<ptr>, so that pointer should not be freed or used by
3760 the programmer after giving it to sv_usepvn. Does not handle 'set' magic.
3761 See C<sv_usepvn_mg>.
3767 Perl_sv_usepvn(pTHX_ register SV *sv, register char *ptr, register STRLEN len)
3769 SV_CHECK_THINKFIRST(sv);
3770 (void)SvUPGRADE(sv, SVt_PV);
3775 (void)SvOOK_off(sv);
3776 if (SvPVX(sv) && SvLEN(sv))
3777 Safefree(SvPVX(sv));
3778 Renew(ptr, len+1, char);
3781 SvLEN_set(sv, len+1);
3783 (void)SvPOK_only_UTF8(sv); /* validate pointer */
3788 =for apidoc sv_usepvn_mg
3790 Like C<sv_usepvn>, but also handles 'set' magic.
3796 Perl_sv_usepvn_mg(pTHX_ register SV *sv, register char *ptr, register STRLEN len)
3798 sv_usepvn(sv,ptr,len);
3803 Perl_sv_force_normal_flags(pTHX_ register SV *sv, U32 flags)
3805 if (SvREADONLY(sv)) {
3807 char *pvx = SvPVX(sv);
3808 STRLEN len = SvCUR(sv);
3809 U32 hash = SvUVX(sv);
3810 SvGROW(sv, len + 1);
3811 Move(pvx,SvPVX(sv),len,char);
3815 unsharepvn(pvx,SvUTF8(sv)?-len:len,hash);
3817 else if (PL_curcop != &PL_compiling)
3818 Perl_croak(aTHX_ PL_no_modify);
3821 sv_unref_flags(sv, flags);
3822 else if (SvFAKE(sv) && SvTYPE(sv) == SVt_PVGV)
3827 Perl_sv_force_normal(pTHX_ register SV *sv)
3829 sv_force_normal_flags(sv, 0);
3835 Efficient removal of characters from the beginning of the string buffer.
3836 SvPOK(sv) must be true and the C<ptr> must be a pointer to somewhere inside
3837 the string buffer. The C<ptr> becomes the first character of the adjusted
3844 Perl_sv_chop(pTHX_ register SV *sv, register char *ptr) /* like set but assuming ptr is in sv */
3848 register STRLEN delta;
3850 if (!ptr || !SvPOKp(sv))
3852 SV_CHECK_THINKFIRST(sv);
3853 if (SvTYPE(sv) < SVt_PVIV)
3854 sv_upgrade(sv,SVt_PVIV);
3857 if (!SvLEN(sv)) { /* make copy of shared string */
3858 char *pvx = SvPVX(sv);
3859 STRLEN len = SvCUR(sv);
3860 SvGROW(sv, len + 1);
3861 Move(pvx,SvPVX(sv),len,char);
3865 SvFLAGS(sv) |= SVf_OOK;
3867 SvFLAGS(sv) &= ~(SVf_IOK|SVf_NOK|SVp_IOK|SVp_NOK|SVf_IVisUV);
3868 delta = ptr - SvPVX(sv);
3876 =for apidoc sv_catpvn
3878 Concatenates the string onto the end of the string which is in the SV. The
3879 C<len> indicates number of bytes to copy. If the SV has the UTF8
3880 status set, then the bytes appended should be valid UTF8.
3881 Handles 'get' magic, but not 'set' magic. See C<sv_catpvn_mg>.
3886 /* sv_catpvn() is aliased to Perl_sv_catpvn_macro; this function provided
3887 for binary compatibility only
3890 Perl_sv_catpvn(pTHX_ SV *dsv, const char* sstr, STRLEN slen)
3892 sv_catpvn_flags(dsv, sstr, slen, SV_GMAGIC);
3896 =for apidoc sv_catpvn_flags
3898 Concatenates the string onto the end of the string which is in the SV. The
3899 C<len> indicates number of bytes to copy. If the SV has the UTF8
3900 status set, then the bytes appended should be valid UTF8.
3901 If C<flags> has C<SV_GMAGIC> bit set, will C<mg_get> on C<dsv> if
3902 appropriate, else not. C<sv_catpvn> and C<sv_catpvn_nomg> are implemented
3903 in terms of this function.
3909 Perl_sv_catpvn_flags(pTHX_ register SV *dsv, register const char *sstr, register STRLEN slen, I32 flags)
3914 dstr = SvPV_force_flags(dsv, dlen, flags);
3915 SvGROW(dsv, dlen + slen + 1);
3918 Move(sstr, SvPVX(dsv) + dlen, slen, char);
3921 (void)SvPOK_only_UTF8(dsv); /* validate pointer */
3926 =for apidoc sv_catpvn_mg
3928 Like C<sv_catpvn>, but also handles 'set' magic.
3934 Perl_sv_catpvn_mg(pTHX_ register SV *sv, register const char *ptr, register STRLEN len)
3936 sv_catpvn(sv,ptr,len);
3941 =for apidoc sv_catsv
3943 Concatenates the string from SV C<ssv> onto the end of the string in
3944 SV C<dsv>. Modifies C<dsv> but not C<ssv>. Handles 'get' magic, but
3945 not 'set' magic. See C<sv_catsv_mg>.
3949 /* sv_catsv() is aliased to Perl_sv_catsv_macro; this function provided
3950 for binary compatibility only
3953 Perl_sv_catsv(pTHX_ SV *dstr, register SV *sstr)
3955 sv_catsv_flags(dstr, sstr, SV_GMAGIC);
3959 =for apidoc sv_catsv_flags
3961 Concatenates the string from SV C<ssv> onto the end of the string in
3962 SV C<dsv>. Modifies C<dsv> but not C<ssv>. If C<flags> has C<SV_GMAGIC>
3963 bit set, will C<mg_get> on the SVs if appropriate, else not. C<sv_catsv>
3964 and C<sv_catsv_nomg> are implemented in terms of this function.
3969 Perl_sv_catsv_flags(pTHX_ SV *dsv, register SV *ssv, I32 flags)
3975 if ((spv = SvPV(ssv, slen))) {
3976 bool sutf8 = DO_UTF8(ssv);
3979 if (SvGMAGICAL(dsv) && (flags & SV_GMAGIC))
3981 dutf8 = DO_UTF8(dsv);
3983 if (dutf8 != sutf8) {
3985 /* Not modifying source SV, so taking a temporary copy. */
3986 SV* csv = sv_2mortal(newSVpvn(spv, slen));
3988 sv_utf8_upgrade(csv);
3989 spv = SvPV(csv, slen);
3992 sv_utf8_upgrade_nomg(dsv);
3994 sv_catpvn_nomg(dsv, spv, slen);
3999 =for apidoc sv_catsv_mg
4001 Like C<sv_catsv>, but also handles 'set' magic.
4007 Perl_sv_catsv_mg(pTHX_ SV *dsv, register SV *ssv)
4014 =for apidoc sv_catpv
4016 Concatenates the string onto the end of the string which is in the SV.
4017 If the SV has the UTF8 status set, then the bytes appended should be
4018 valid UTF8. Handles 'get' magic, but not 'set' magic. See C<sv_catpv_mg>.
4023 Perl_sv_catpv(pTHX_ register SV *sv, register const char *ptr)
4025 register STRLEN len;
4031 junk = SvPV_force(sv, tlen);
4033 SvGROW(sv, tlen + len + 1);
4036 Move(ptr,SvPVX(sv)+tlen,len+1,char);
4038 (void)SvPOK_only_UTF8(sv); /* validate pointer */
4043 =for apidoc sv_catpv_mg
4045 Like C<sv_catpv>, but also handles 'set' magic.
4051 Perl_sv_catpv_mg(pTHX_ register SV *sv, register const char *ptr)
4058 Perl_newSV(pTHX_ STRLEN len)
4064 sv_upgrade(sv, SVt_PV);
4065 SvGROW(sv, len + 1);
4070 /* name is assumed to contain an SV* if (name && namelen == HEf_SVKEY) */
4073 =for apidoc sv_magic
4075 Adds magic to an SV.
4081 Perl_sv_magic(pTHX_ register SV *sv, SV *obj, int how, const char *name, I32 namlen)
4085 if (SvREADONLY(sv)) {
4086 if (PL_curcop != &PL_compiling
4087 /* XXX this used to be !strchr("gBf", how), which seems to
4088 * implicity be equal to !strchr("gBf\0", how), ie \0 matches
4089 * too. I find this suprising, but have hadded PERL_MAGIC_sv
4090 * to the list of things to check - DAPM 19-May-01 */
4091 && how != PERL_MAGIC_regex_global
4092 && how != PERL_MAGIC_bm
4093 && how != PERL_MAGIC_fm
4094 && how != PERL_MAGIC_sv
4097 Perl_croak(aTHX_ PL_no_modify);
4100 if (SvMAGICAL(sv) || (how == PERL_MAGIC_taint && SvTYPE(sv) >= SVt_PVMG)) {
4101 if (SvMAGIC(sv) && (mg = mg_find(sv, how))) {
4102 if (how == PERL_MAGIC_taint)
4108 (void)SvUPGRADE(sv, SVt_PVMG);
4110 Newz(702,mg, 1, MAGIC);
4111 mg->mg_moremagic = SvMAGIC(sv);
4114 /* Some magic sontains a reference loop, where the sv and object refer to
4115 each other. To prevent a avoid a reference loop that would prevent such
4116 objects being freed, we look for such loops and if we find one we avoid
4117 incrementing the object refcount. */
4118 if (!obj || obj == sv ||
4119 how == PERL_MAGIC_arylen ||
4120 how == PERL_MAGIC_qr ||
4121 (SvTYPE(obj) == SVt_PVGV &&
4122 (GvSV(obj) == sv || GvHV(obj) == (HV*)sv || GvAV(obj) == (AV*)sv ||
4123 GvCV(obj) == (CV*)sv || GvIOp(obj) == (IO*)sv ||
4124 GvFORM(obj) == (CV*)sv)))
4129 mg->mg_obj = SvREFCNT_inc(obj);
4130 mg->mg_flags |= MGf_REFCOUNTED;
4133 mg->mg_len = namlen;
4136 mg->mg_ptr = savepvn(name, namlen);
4137 else if (namlen == HEf_SVKEY)
4138 mg->mg_ptr = (char*)SvREFCNT_inc((SV*)name);
4143 mg->mg_virtual = &PL_vtbl_sv;
4145 case PERL_MAGIC_overload:
4146 mg->mg_virtual = &PL_vtbl_amagic;
4148 case PERL_MAGIC_overload_elem:
4149 mg->mg_virtual = &PL_vtbl_amagicelem;
4151 case PERL_MAGIC_overload_table:
4152 mg->mg_virtual = &PL_vtbl_ovrld;
4155 mg->mg_virtual = &PL_vtbl_bm;
4157 case PERL_MAGIC_regdata:
4158 mg->mg_virtual = &PL_vtbl_regdata;
4160 case PERL_MAGIC_regdatum:
4161 mg->mg_virtual = &PL_vtbl_regdatum;
4163 case PERL_MAGIC_env:
4164 mg->mg_virtual = &PL_vtbl_env;
4167 mg->mg_virtual = &PL_vtbl_fm;
4169 case PERL_MAGIC_envelem:
4170 mg->mg_virtual = &PL_vtbl_envelem;
4172 case PERL_MAGIC_regex_global:
4173 mg->mg_virtual = &PL_vtbl_mglob;
4175 case PERL_MAGIC_isa:
4176 mg->mg_virtual = &PL_vtbl_isa;
4178 case PERL_MAGIC_isaelem:
4179 mg->mg_virtual = &PL_vtbl_isaelem;
4181 case PERL_MAGIC_nkeys:
4182 mg->mg_virtual = &PL_vtbl_nkeys;
4184 case PERL_MAGIC_dbfile:
4188 case PERL_MAGIC_dbline:
4189 mg->mg_virtual = &PL_vtbl_dbline;
4192 case PERL_MAGIC_mutex:
4193 mg->mg_virtual = &PL_vtbl_mutex;
4195 #endif /* USE_THREADS */
4196 #ifdef USE_LOCALE_COLLATE
4197 case PERL_MAGIC_collxfrm:
4198 mg->mg_virtual = &PL_vtbl_collxfrm;
4200 #endif /* USE_LOCALE_COLLATE */
4201 case PERL_MAGIC_tied:
4202 mg->mg_virtual = &PL_vtbl_pack;
4204 case PERL_MAGIC_tiedelem:
4205 case PERL_MAGIC_tiedscalar:
4206 mg->mg_virtual = &PL_vtbl_packelem;
4209 mg->mg_virtual = &PL_vtbl_regexp;
4211 case PERL_MAGIC_sig:
4212 mg->mg_virtual = &PL_vtbl_sig;
4214 case PERL_MAGIC_sigelem:
4215 mg->mg_virtual = &PL_vtbl_sigelem;
4217 case PERL_MAGIC_taint:
4218 mg->mg_virtual = &PL_vtbl_taint;
4221 case PERL_MAGIC_uvar:
4222 mg->mg_virtual = &PL_vtbl_uvar;
4224 case PERL_MAGIC_vec:
4225 mg->mg_virtual = &PL_vtbl_vec;
4227 case PERL_MAGIC_substr:
4228 mg->mg_virtual = &PL_vtbl_substr;
4230 case PERL_MAGIC_defelem:
4231 mg->mg_virtual = &PL_vtbl_defelem;
4233 case PERL_MAGIC_glob:
4234 mg->mg_virtual = &PL_vtbl_glob;
4236 case PERL_MAGIC_arylen:
4237 mg->mg_virtual = &PL_vtbl_arylen;
4239 case PERL_MAGIC_pos:
4240 mg->mg_virtual = &PL_vtbl_pos;
4242 case PERL_MAGIC_backref:
4243 mg->mg_virtual = &PL_vtbl_backref;
4245 case PERL_MAGIC_ext:
4246 /* Reserved for use by extensions not perl internals. */
4247 /* Useful for attaching extension internal data to perl vars. */
4248 /* Note that multiple extensions may clash if magical scalars */
4249 /* etc holding private data from one are passed to another. */
4253 Perl_croak(aTHX_ "Don't know how to handle magic of type \\%o", how);
4257 SvFLAGS(sv) &= ~(SVf_IOK|SVf_NOK|SVf_POK);
4261 =for apidoc sv_unmagic
4263 Removes magic from an SV.
4269 Perl_sv_unmagic(pTHX_ SV *sv, int type)
4273 if (SvTYPE(sv) < SVt_PVMG || !SvMAGIC(sv))
4276 for (mg = *mgp; mg; mg = *mgp) {
4277 if (mg->mg_type == type) {
4278 MGVTBL* vtbl = mg->mg_virtual;
4279 *mgp = mg->mg_moremagic;
4280 if (vtbl && vtbl->svt_free)
4281 CALL_FPTR(vtbl->svt_free)(aTHX_ sv, mg);
4282 if (mg->mg_ptr && mg->mg_type != PERL_MAGIC_regex_global) {
4283 if (mg->mg_len >= 0)
4284 Safefree(mg->mg_ptr);
4285 else if (mg->mg_len == HEf_SVKEY)
4286 SvREFCNT_dec((SV*)mg->mg_ptr);
4288 if (mg->mg_flags & MGf_REFCOUNTED)
4289 SvREFCNT_dec(mg->mg_obj);
4293 mgp = &mg->mg_moremagic;
4297 SvFLAGS(sv) |= (SvFLAGS(sv) & (SVp_NOK|SVp_POK)) >> PRIVSHIFT;
4304 =for apidoc sv_rvweaken
4312 Perl_sv_rvweaken(pTHX_ SV *sv)
4315 if (!SvOK(sv)) /* let undefs pass */
4318 Perl_croak(aTHX_ "Can't weaken a nonreference");
4319 else if (SvWEAKREF(sv)) {
4320 if (ckWARN(WARN_MISC))
4321 Perl_warner(aTHX_ WARN_MISC, "Reference is already weak");
4325 sv_add_backref(tsv, sv);
4332 S_sv_add_backref(pTHX_ SV *tsv, SV *sv)
4336 if (SvMAGICAL(tsv) && (mg = mg_find(tsv, PERL_MAGIC_backref)))
4337 av = (AV*)mg->mg_obj;
4340 sv_magic(tsv, (SV*)av, PERL_MAGIC_backref, NULL, 0);
4341 SvREFCNT_dec(av); /* for sv_magic */
4347 S_sv_del_backref(pTHX_ SV *sv)
4354 if (!SvMAGICAL(tsv) || !(mg = mg_find(tsv, PERL_MAGIC_backref)))
4355 Perl_croak(aTHX_ "panic: del_backref");
4356 av = (AV *)mg->mg_obj;
4361 svp[i] = &PL_sv_undef; /* XXX */
4368 =for apidoc sv_insert
4370 Inserts a string at the specified offset/length within the SV. Similar to
4371 the Perl substr() function.
4377 Perl_sv_insert(pTHX_ SV *bigstr, STRLEN offset, STRLEN len, char *little, STRLEN littlelen)
4381 register char *midend;
4382 register char *bigend;
4388 Perl_croak(aTHX_ "Can't modify non-existent substring");
4389 SvPV_force(bigstr, curlen);
4390 (void)SvPOK_only_UTF8(bigstr);
4391 if (offset + len > curlen) {
4392 SvGROW(bigstr, offset+len+1);
4393 Zero(SvPVX(bigstr)+curlen, offset+len-curlen, char);
4394 SvCUR_set(bigstr, offset+len);
4398 i = littlelen - len;
4399 if (i > 0) { /* string might grow */
4400 big = SvGROW(bigstr, SvCUR(bigstr) + i + 1);
4401 mid = big + offset + len;
4402 midend = bigend = big + SvCUR(bigstr);
4405 while (midend > mid) /* shove everything down */
4406 *--bigend = *--midend;
4407 Move(little,big+offset,littlelen,char);
4413 Move(little,SvPVX(bigstr)+offset,len,char);
4418 big = SvPVX(bigstr);
4421 bigend = big + SvCUR(bigstr);
4423 if (midend > bigend)
4424 Perl_croak(aTHX_ "panic: sv_insert");
4426 if (mid - big > bigend - midend) { /* faster to shorten from end */
4428 Move(little, mid, littlelen,char);
4431 i = bigend - midend;
4433 Move(midend, mid, i,char);
4437 SvCUR_set(bigstr, mid - big);
4440 else if ((i = mid - big)) { /* faster from front */
4441 midend -= littlelen;
4443 sv_chop(bigstr,midend-i);
4448 Move(little, mid, littlelen,char);
4450 else if (littlelen) {
4451 midend -= littlelen;
4452 sv_chop(bigstr,midend);
4453 Move(little,midend,littlelen,char);
4456 sv_chop(bigstr,midend);
4462 =for apidoc sv_replace
4464 Make the first argument a copy of the second, then delete the original.
4470 Perl_sv_replace(pTHX_ register SV *sv, register SV *nsv)
4472 U32 refcnt = SvREFCNT(sv);
4473 SV_CHECK_THINKFIRST(sv);
4474 if (SvREFCNT(nsv) != 1 && ckWARN_d(WARN_INTERNAL))
4475 Perl_warner(aTHX_ WARN_INTERNAL, "Reference miscount in sv_replace()");
4476 if (SvMAGICAL(sv)) {
4480 sv_upgrade(nsv, SVt_PVMG);
4481 SvMAGIC(nsv) = SvMAGIC(sv);
4482 SvFLAGS(nsv) |= SvMAGICAL(sv);
4488 assert(!SvREFCNT(sv));
4489 StructCopy(nsv,sv,SV);
4490 SvREFCNT(sv) = refcnt;
4491 SvFLAGS(nsv) |= SVTYPEMASK; /* Mark as freed */
4496 =for apidoc sv_clear
4498 Clear an SV, making it empty. Does not free the memory used by the SV
4505 Perl_sv_clear(pTHX_ register SV *sv)
4509 assert(SvREFCNT(sv) == 0);
4512 if (PL_defstash) { /* Still have a symbol table? */
4517 Zero(&tmpref, 1, SV);
4518 sv_upgrade(&tmpref, SVt_RV);
4520 SvREADONLY_on(&tmpref); /* DESTROY() could be naughty */
4521 SvREFCNT(&tmpref) = 1;
4524 stash = SvSTASH(sv);
4525 destructor = StashHANDLER(stash,DESTROY);
4528 PUSHSTACKi(PERLSI_DESTROY);
4529 SvRV(&tmpref) = SvREFCNT_inc(sv);
4534 call_sv((SV*)destructor, G_DISCARD|G_EVAL|G_KEEPERR);
4540 } while (SvOBJECT(sv) && SvSTASH(sv) != stash);
4542 del_XRV(SvANY(&tmpref));
4545 if (PL_in_clean_objs)
4546 Perl_croak(aTHX_ "DESTROY created new reference to dead object '%s'",
4548 /* DESTROY gave object new lease on life */
4554 SvREFCNT_dec(SvSTASH(sv)); /* possibly of changed persuasion */
4555 SvOBJECT_off(sv); /* Curse the object. */
4556 if (SvTYPE(sv) != SVt_PVIO)
4557 --PL_sv_objcount; /* XXX Might want something more general */
4560 if (SvTYPE(sv) >= SVt_PVMG && SvMAGIC(sv))
4563 switch (SvTYPE(sv)) {
4566 IoIFP(sv) != PerlIO_stdin() &&
4567 IoIFP(sv) != PerlIO_stdout() &&
4568 IoIFP(sv) != PerlIO_stderr())
4570 io_close((IO*)sv, FALSE);
4572 if (IoDIRP(sv) && !(IoFLAGS(sv) & IOf_FAKE_DIRP))
4573 PerlDir_close(IoDIRP(sv));
4574 IoDIRP(sv) = (DIR*)NULL;
4575 Safefree(IoTOP_NAME(sv));
4576 Safefree(IoFMT_NAME(sv));
4577 Safefree(IoBOTTOM_NAME(sv));
4592 SvREFCNT_dec(LvTARG(sv));
4596 Safefree(GvNAME(sv));
4597 /* cannot decrease stash refcount yet, as we might recursively delete
4598 ourselves when the refcnt drops to zero. Delay SvREFCNT_dec
4599 of stash until current sv is completely gone.
4600 -- JohnPC, 27 Mar 1998 */
4601 stash = GvSTASH(sv);
4607 (void)SvOOK_off(sv);
4615 SvREFCNT_dec(SvRV(sv));
4617 else if (SvPVX(sv) && SvLEN(sv))
4618 Safefree(SvPVX(sv));
4619 else if (SvPVX(sv) && SvREADONLY(sv) && SvFAKE(sv)) {
4620 unsharepvn(SvPVX(sv),SvUTF8(sv)?-SvCUR(sv):SvCUR(sv),SvUVX(sv));
4632 switch (SvTYPE(sv)) {
4648 del_XPVIV(SvANY(sv));
4651 del_XPVNV(SvANY(sv));
4654 del_XPVMG(SvANY(sv));
4657 del_XPVLV(SvANY(sv));
4660 del_XPVAV(SvANY(sv));
4663 del_XPVHV(SvANY(sv));
4666 del_XPVCV(SvANY(sv));
4669 del_XPVGV(SvANY(sv));
4670 /* code duplication for increased performance. */
4671 SvFLAGS(sv) &= SVf_BREAK;
4672 SvFLAGS(sv) |= SVTYPEMASK;
4673 /* decrease refcount of the stash that owns this GV, if any */
4675 SvREFCNT_dec(stash);
4676 return; /* not break, SvFLAGS reset already happened */
4678 del_XPVBM(SvANY(sv));
4681 del_XPVFM(SvANY(sv));
4684 del_XPVIO(SvANY(sv));
4687 SvFLAGS(sv) &= SVf_BREAK;
4688 SvFLAGS(sv) |= SVTYPEMASK;
4692 Perl_sv_newref(pTHX_ SV *sv)
4695 ATOMIC_INC(SvREFCNT(sv));
4702 Free the memory used by an SV.
4708 Perl_sv_free(pTHX_ SV *sv)
4710 int refcount_is_zero;
4714 if (SvREFCNT(sv) == 0) {
4715 if (SvFLAGS(sv) & SVf_BREAK)
4717 if (PL_in_clean_all) /* All is fair */
4719 if (SvREADONLY(sv) && SvIMMORTAL(sv)) {
4720 /* make sure SvREFCNT(sv)==0 happens very seldom */
4721 SvREFCNT(sv) = (~(U32)0)/2;
4724 if (ckWARN_d(WARN_INTERNAL))
4725 Perl_warner(aTHX_ WARN_INTERNAL, "Attempt to free unreferenced scalar");
4728 ATOMIC_DEC_AND_TEST(refcount_is_zero, SvREFCNT(sv));
4729 if (!refcount_is_zero)
4733 if (ckWARN_d(WARN_DEBUGGING))
4734 Perl_warner(aTHX_ WARN_DEBUGGING,
4735 "Attempt to free temp prematurely: SV 0x%"UVxf,
4740 if (SvREADONLY(sv) && SvIMMORTAL(sv)) {
4741 /* make sure SvREFCNT(sv)==0 happens very seldom */
4742 SvREFCNT(sv) = (~(U32)0)/2;
4753 Returns the length of the string in the SV. See also C<SvCUR>.
4759 Perl_sv_len(pTHX_ register SV *sv)
4768 len = mg_length(sv);
4770 junk = SvPV(sv, len);
4775 =for apidoc sv_len_utf8
4777 Returns the number of characters in the string in an SV, counting wide
4778 UTF8 bytes as a single character.
4784 Perl_sv_len_utf8(pTHX_ register SV *sv)
4790 return mg_length(sv);
4794 U8 *s = (U8*)SvPV(sv, len);
4796 return Perl_utf8_length(aTHX_ s, s + len);
4801 Perl_sv_pos_u2b(pTHX_ register SV *sv, I32* offsetp, I32* lenp)
4806 I32 uoffset = *offsetp;
4812 start = s = (U8*)SvPV(sv, len);
4814 while (s < send && uoffset--)
4818 *offsetp = s - start;
4822 while (s < send && ulen--)
4832 Perl_sv_pos_b2u(pTHX_ register SV *sv, I32* offsetp)
4841 s = (U8*)SvPV(sv, len);
4843 Perl_croak(aTHX_ "panic: sv_pos_b2u: bad byte offset");
4844 send = s + *offsetp;
4848 /* Call utf8n_to_uvchr() to validate the sequence */
4849 utf8n_to_uvchr(s, UTF8SKIP(s), &n, 0);
4864 Returns a boolean indicating whether the strings in the two SVs are
4871 Perl_sv_eq(pTHX_ register SV *sv1, register SV *sv2)
4885 pv1 = SvPV(sv1, cur1);
4892 pv2 = SvPV(sv2, cur2);
4894 /* do not utf8ize the comparands as a side-effect */
4895 if (cur1 && cur2 && SvUTF8(sv1) != SvUTF8(sv2) && !IN_BYTE) {
4896 bool is_utf8 = TRUE;
4897 /* UTF-8ness differs */
4898 if (PL_hints & HINT_UTF8_DISTINCT)
4902 /* sv1 is the UTF-8 one , If is equal it must be downgrade-able */
4903 char *pv = (char*)bytes_from_utf8((U8*)pv1, &cur1, &is_utf8);
4908 /* sv2 is the UTF-8 one , If is equal it must be downgrade-able */
4909 char *pv = (char *)bytes_from_utf8((U8*)pv2, &cur2, &is_utf8);
4914 /* Downgrade not possible - cannot be eq */
4920 eq = memEQ(pv1, pv2, cur1);
4931 Compares the strings in two SVs. Returns -1, 0, or 1 indicating whether the
4932 string in C<sv1> is less than, equal to, or greater than the string in
4939 Perl_sv_cmp(pTHX_ register SV *sv1, register SV *sv2)
4944 bool pv1tmp = FALSE;
4945 bool pv2tmp = FALSE;
4952 pv1 = SvPV(sv1, cur1);
4959 pv2 = SvPV(sv2, cur2);
4961 /* do not utf8ize the comparands as a side-effect */
4962 if (cur1 && cur2 && SvUTF8(sv1) != SvUTF8(sv2) && !IN_BYTE) {
4963 if (PL_hints & HINT_UTF8_DISTINCT)
4964 return SvUTF8(sv1) ? 1 : -1;
4967 pv2 = (char*)bytes_to_utf8((U8*)pv2, &cur2);
4971 pv1 = (char*)bytes_to_utf8((U8*)pv1, &cur1);
4977 cmp = cur2 ? -1 : 0;
4981 I32 retval = memcmp((void*)pv1, (void*)pv2, cur1 < cur2 ? cur1 : cur2);
4984 cmp = retval < 0 ? -1 : 1;
4985 } else if (cur1 == cur2) {
4988 cmp = cur1 < cur2 ? -1 : 1;
5001 =for apidoc sv_cmp_locale
5003 Compares the strings in two SVs in a locale-aware manner. See
5010 Perl_sv_cmp_locale(pTHX_ register SV *sv1, register SV *sv2)
5012 #ifdef USE_LOCALE_COLLATE
5018 if (PL_collation_standard)
5022 pv1 = sv1 ? sv_collxfrm(sv1, &len1) : (char *) NULL;
5024 pv2 = sv2 ? sv_collxfrm(sv2, &len2) : (char *) NULL;
5026 if (!pv1 || !len1) {
5037 retval = memcmp((void*)pv1, (void*)pv2, len1 < len2 ? len1 : len2);
5040 return retval < 0 ? -1 : 1;
5043 * When the result of collation is equality, that doesn't mean
5044 * that there are no differences -- some locales exclude some
5045 * characters from consideration. So to avoid false equalities,
5046 * we use the raw string as a tiebreaker.
5052 #endif /* USE_LOCALE_COLLATE */
5054 return sv_cmp(sv1, sv2);
5057 #ifdef USE_LOCALE_COLLATE
5059 * Any scalar variable may carry PERL_MAGIC_collxfrm magic that contains the
5060 * scalar data of the variable transformed to such a format that
5061 * a normal memory comparison can be used to compare the data
5062 * according to the locale settings.
5065 Perl_sv_collxfrm(pTHX_ SV *sv, STRLEN *nxp)
5069 mg = SvMAGICAL(sv) ? mg_find(sv, PERL_MAGIC_collxfrm) : (MAGIC *) NULL;
5070 if (!mg || !mg->mg_ptr || *(U32*)mg->mg_ptr != PL_collation_ix) {
5075 Safefree(mg->mg_ptr);
5077 if ((xf = mem_collxfrm(s, len, &xlen))) {
5078 if (SvREADONLY(sv)) {
5081 return xf + sizeof(PL_collation_ix);
5084 sv_magic(sv, 0, PERL_MAGIC_collxfrm, 0, 0);
5085 mg = mg_find(sv, PERL_MAGIC_collxfrm);
5098 if (mg && mg->mg_ptr) {
5100 return mg->mg_ptr + sizeof(PL_collation_ix);
5108 #endif /* USE_LOCALE_COLLATE */
5113 Get a line from the filehandle and store it into the SV, optionally
5114 appending to the currently-stored string.
5120 Perl_sv_gets(pTHX_ register SV *sv, register PerlIO *fp, I32 append)
5124 register STDCHAR rslast;
5125 register STDCHAR *bp;
5129 SV_CHECK_THINKFIRST(sv);
5130 (void)SvUPGRADE(sv, SVt_PV);
5134 if (RsSNARF(PL_rs)) {
5138 else if (RsRECORD(PL_rs)) {
5139 I32 recsize, bytesread;
5142 /* Grab the size of the record we're getting */
5143 recsize = SvIV(SvRV(PL_rs));
5144 (void)SvPOK_only(sv); /* Validate pointer */
5145 buffer = SvGROW(sv, recsize + 1);
5148 /* VMS wants read instead of fread, because fread doesn't respect */
5149 /* RMS record boundaries. This is not necessarily a good thing to be */
5150 /* doing, but we've got no other real choice */
5151 bytesread = PerlLIO_read(PerlIO_fileno(fp), buffer, recsize);
5153 bytesread = PerlIO_read(fp, buffer, recsize);
5155 SvCUR_set(sv, bytesread);
5156 buffer[bytesread] = '\0';
5157 if (PerlIO_isutf8(fp))
5161 return(SvCUR(sv) ? SvPVX(sv) : Nullch);
5163 else if (RsPARA(PL_rs)) {
5168 /* Get $/ i.e. PL_rs into same encoding as stream wants */
5169 if (PerlIO_isutf8(fp)) {
5170 rsptr = SvPVutf8(PL_rs, rslen);
5173 if (SvUTF8(PL_rs)) {
5174 if (!sv_utf8_downgrade(PL_rs, TRUE)) {
5175 Perl_croak(aTHX_ "Wide character in $/");
5178 rsptr = SvPV(PL_rs, rslen);
5182 rslast = rslen ? rsptr[rslen - 1] : '\0';
5184 if (RsPARA(PL_rs)) { /* have to do this both before and after */
5185 do { /* to make sure file boundaries work right */
5188 i = PerlIO_getc(fp);
5192 PerlIO_ungetc(fp,i);
5198 /* See if we know enough about I/O mechanism to cheat it ! */
5200 /* This used to be #ifdef test - it is made run-time test for ease
5201 of abstracting out stdio interface. One call should be cheap
5202 enough here - and may even be a macro allowing compile
5206 if (PerlIO_fast_gets(fp)) {
5209 * We're going to steal some values from the stdio struct
5210 * and put EVERYTHING in the innermost loop into registers.
5212 register STDCHAR *ptr;
5216 #if defined(VMS) && defined(PERLIO_IS_STDIO)
5217 /* An ungetc()d char is handled separately from the regular
5218 * buffer, so we getc() it back out and stuff it in the buffer.
5220 i = PerlIO_getc(fp);
5221 if (i == EOF) return 0;
5222 *(--((*fp)->_ptr)) = (unsigned char) i;
5226 /* Here is some breathtakingly efficient cheating */
5228 cnt = PerlIO_get_cnt(fp); /* get count into register */
5229 (void)SvPOK_only(sv); /* validate pointer */
5230 if (SvLEN(sv) - append <= cnt + 1) { /* make sure we have the room */
5231 if (cnt > 80 && SvLEN(sv) > append) {
5232 shortbuffered = cnt - SvLEN(sv) + append + 1;
5233 cnt -= shortbuffered;
5237 /* remember that cnt can be negative */
5238 SvGROW(sv, append + (cnt <= 0 ? 2 : (cnt + 1)));
5243 bp = (STDCHAR*)SvPVX(sv) + append; /* move these two too to registers */
5244 ptr = (STDCHAR*)PerlIO_get_ptr(fp);
5245 DEBUG_P(PerlIO_printf(Perl_debug_log,
5246 "Screamer: entering, ptr=%"UVuf", cnt=%ld\n",PTR2UV(ptr),(long)cnt));
5247 DEBUG_P(PerlIO_printf(Perl_debug_log,
5248 "Screamer: entering: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
5249 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
5250 PTR2UV(PerlIO_has_base(fp) ? PerlIO_get_base(fp) : 0)));
5255 while (cnt > 0) { /* this | eat */
5257 if ((*bp++ = *ptr++) == rslast) /* really | dust */
5258 goto thats_all_folks; /* screams | sed :-) */
5262 Copy(ptr, bp, cnt, char); /* this | eat */
5263 bp += cnt; /* screams | dust */
5264 ptr += cnt; /* louder | sed :-) */
5269 if (shortbuffered) { /* oh well, must extend */
5270 cnt = shortbuffered;
5272 bpx = bp - (STDCHAR*)SvPVX(sv); /* box up before relocation */
5274 SvGROW(sv, SvLEN(sv) + append + cnt + 2);
5275 bp = (STDCHAR*)SvPVX(sv) + bpx; /* unbox after relocation */
5279 DEBUG_P(PerlIO_printf(Perl_debug_log,
5280 "Screamer: going to getc, ptr=%"UVuf", cnt=%ld\n",
5281 PTR2UV(ptr),(long)cnt));
5282 PerlIO_set_ptrcnt(fp, ptr, cnt); /* deregisterize cnt and ptr */
5283 DEBUG_P(PerlIO_printf(Perl_debug_log,
5284 "Screamer: pre: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
5285 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
5286 PTR2UV(PerlIO_has_base (fp) ? PerlIO_get_base(fp) : 0)));
5287 /* This used to call 'filbuf' in stdio form, but as that behaves like
5288 getc when cnt <= 0 we use PerlIO_getc here to avoid introducing
5289 another abstraction. */
5290 i = PerlIO_getc(fp); /* get more characters */
5291 DEBUG_P(PerlIO_printf(Perl_debug_log,
5292 "Screamer: post: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
5293 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
5294 PTR2UV(PerlIO_has_base (fp) ? PerlIO_get_base(fp) : 0)));
5295 cnt = PerlIO_get_cnt(fp);
5296 ptr = (STDCHAR*)PerlIO_get_ptr(fp); /* reregisterize cnt and ptr */
5297 DEBUG_P(PerlIO_printf(Perl_debug_log,
5298 "Screamer: after getc, ptr=%"UVuf", cnt=%ld\n",PTR2UV(ptr),(long)cnt));
5300 if (i == EOF) /* all done for ever? */
5301 goto thats_really_all_folks;
5303 bpx = bp - (STDCHAR*)SvPVX(sv); /* box up before relocation */
5305 SvGROW(sv, bpx + cnt + 2);
5306 bp = (STDCHAR*)SvPVX(sv) + bpx; /* unbox after relocation */
5308 *bp++ = i; /* store character from PerlIO_getc */
5310 if (rslen && (STDCHAR)i == rslast) /* all done for now? */
5311 goto thats_all_folks;
5315 if ((rslen > 1 && (bp - (STDCHAR*)SvPVX(sv) < rslen)) ||
5316 memNE((char*)bp - rslen, rsptr, rslen))
5317 goto screamer; /* go back to the fray */
5318 thats_really_all_folks:
5320 cnt += shortbuffered;
5321 DEBUG_P(PerlIO_printf(Perl_debug_log,
5322 "Screamer: quitting, ptr=%"UVuf", cnt=%ld\n",PTR2UV(ptr),(long)cnt));
5323 PerlIO_set_ptrcnt(fp, ptr, cnt); /* put these back or we're in trouble */
5324 DEBUG_P(PerlIO_printf(Perl_debug_log,
5325 "Screamer: end: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
5326 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
5327 PTR2UV(PerlIO_has_base (fp) ? PerlIO_get_base(fp) : 0)));
5329 SvCUR_set(sv, bp - (STDCHAR*)SvPVX(sv)); /* set length */
5330 DEBUG_P(PerlIO_printf(Perl_debug_log,
5331 "Screamer: done, len=%ld, string=|%.*s|\n",
5332 (long)SvCUR(sv),(int)SvCUR(sv),SvPVX(sv)));
5337 /*The big, slow, and stupid way */
5340 /* Need to work around EPOC SDK features */
5341 /* On WINS: MS VC5 generates calls to _chkstk, */
5342 /* if a `large' stack frame is allocated */
5343 /* gcc on MARM does not generate calls like these */
5349 register STDCHAR *bpe = buf + sizeof(buf);
5351 while ((i = PerlIO_getc(fp)) != EOF && (*bp++ = i) != rslast && bp < bpe)
5352 ; /* keep reading */
5356 cnt = PerlIO_read(fp,(char*)buf, sizeof(buf));
5357 /* Accomodate broken VAXC compiler, which applies U8 cast to
5358 * both args of ?: operator, causing EOF to change into 255
5360 if (cnt) { i = (U8)buf[cnt - 1]; } else { i = EOF; }
5364 sv_catpvn(sv, (char *) buf, cnt);
5366 sv_setpvn(sv, (char *) buf, cnt);
5368 if (i != EOF && /* joy */
5370 SvCUR(sv) < rslen ||
5371 memNE(SvPVX(sv) + SvCUR(sv) - rslen, rsptr, rslen)))
5375 * If we're reading from a TTY and we get a short read,
5376 * indicating that the user hit his EOF character, we need
5377 * to notice it now, because if we try to read from the TTY
5378 * again, the EOF condition will disappear.
5380 * The comparison of cnt to sizeof(buf) is an optimization
5381 * that prevents unnecessary calls to feof().
5385 if (!(cnt < sizeof(buf) && PerlIO_eof(fp)))
5390 if (RsPARA(PL_rs)) { /* have to do this both before and after */
5391 while (i != EOF) { /* to make sure file boundaries work right */
5392 i = PerlIO_getc(fp);
5394 PerlIO_ungetc(fp,i);
5400 if (PerlIO_isutf8(fp))
5405 return (SvCUR(sv) - append) ? SvPVX(sv) : Nullch;
5412 Auto-increment of the value in the SV.
5418 Perl_sv_inc(pTHX_ register SV *sv)
5427 if (SvTHINKFIRST(sv)) {
5428 if (SvREADONLY(sv)) {
5429 if (PL_curcop != &PL_compiling)
5430 Perl_croak(aTHX_ PL_no_modify);
5434 if (SvAMAGIC(sv) && AMG_CALLun(sv,inc))
5436 i = PTR2IV(SvRV(sv));
5441 flags = SvFLAGS(sv);
5442 if ((flags & (SVp_NOK|SVp_IOK)) == SVp_NOK) {
5443 /* It's (privately or publicly) a float, but not tested as an
5444 integer, so test it to see. */
5446 flags = SvFLAGS(sv);
5448 if ((flags & SVf_IOK) || ((flags & (SVp_IOK | SVp_NOK)) == SVp_IOK)) {
5449 /* It's publicly an integer, or privately an integer-not-float */
5452 if (SvUVX(sv) == UV_MAX)
5453 sv_setnv(sv, (NV)UV_MAX + 1.0);
5455 (void)SvIOK_only_UV(sv);
5458 if (SvIVX(sv) == IV_MAX)
5459 sv_setuv(sv, (UV)IV_MAX + 1);
5461 (void)SvIOK_only(sv);
5467 if (flags & SVp_NOK) {
5468 (void)SvNOK_only(sv);
5473 if (!(flags & SVp_POK) || !*SvPVX(sv)) {
5474 if ((flags & SVTYPEMASK) < SVt_PVIV)
5475 sv_upgrade(sv, SVt_IV);
5476 (void)SvIOK_only(sv);
5481 while (isALPHA(*d)) d++;
5482 while (isDIGIT(*d)) d++;
5484 #ifdef PERL_PRESERVE_IVUV
5485 /* Got to punt this an an integer if needs be, but we don't issue
5486 warnings. Probably ought to make the sv_iv_please() that does
5487 the conversion if possible, and silently. */
5488 I32 numtype = looks_like_number(sv);
5489 if (numtype && !(numtype & IS_NUMBER_INFINITY)) {
5490 /* Need to try really hard to see if it's an integer.
5491 9.22337203685478e+18 is an integer.
5492 but "9.22337203685478e+18" + 0 is UV=9223372036854779904
5493 so $a="9.22337203685478e+18"; $a+0; $a++
5494 needs to be the same as $a="9.22337203685478e+18"; $a++
5501 /* sv_2iv *should* have made this an NV */
5502 if (flags & SVp_NOK) {
5503 (void)SvNOK_only(sv);
5507 /* I don't think we can get here. Maybe I should assert this
5508 And if we do get here I suspect that sv_setnv will croak. NWC
5510 #if defined(USE_LONG_DOUBLE)
5511 DEBUG_c(PerlIO_printf(Perl_debug_log,"sv_inc punt failed to convert '%s' to IOK or NOKp, UV=0x%"UVxf" NV=%"PERL_PRIgldbl"\n",
5512 SvPVX(sv), SvIVX(sv), SvNVX(sv)));
5514 DEBUG_c(PerlIO_printf(Perl_debug_log,"sv_inc punt failed to convert '%s' to IOK or NOKp, UV=0x%"UVxf" NV=%g\n",
5515 SvPVX(sv), SvIVX(sv), SvNVX(sv)));
5518 #endif /* PERL_PRESERVE_IVUV */
5519 sv_setnv(sv,Atof(SvPVX(sv)) + 1.0);
5523 while (d >= SvPVX(sv)) {
5531 /* MKS: The original code here died if letters weren't consecutive.
5532 * at least it didn't have to worry about non-C locales. The
5533 * new code assumes that ('z'-'a')==('Z'-'A'), letters are
5534 * arranged in order (although not consecutively) and that only
5535 * [A-Za-z] are accepted by isALPHA in the C locale.
5537 if (*d != 'z' && *d != 'Z') {
5538 do { ++*d; } while (!isALPHA(*d));
5541 *(d--) -= 'z' - 'a';
5546 *(d--) -= 'z' - 'a' + 1;
5550 /* oh,oh, the number grew */
5551 SvGROW(sv, SvCUR(sv) + 2);
5553 for (d = SvPVX(sv) + SvCUR(sv); d > SvPVX(sv); d--)
5564 Auto-decrement of the value in the SV.
5570 Perl_sv_dec(pTHX_ register SV *sv)
5578 if (SvTHINKFIRST(sv)) {
5579 if (SvREADONLY(sv)) {
5580 if (PL_curcop != &PL_compiling)
5581 Perl_croak(aTHX_ PL_no_modify);
5585 if (SvAMAGIC(sv) && AMG_CALLun(sv,dec))
5587 i = PTR2IV(SvRV(sv));
5592 /* Unlike sv_inc we don't have to worry about string-never-numbers
5593 and keeping them magic. But we mustn't warn on punting */
5594 flags = SvFLAGS(sv);
5595 if ((flags & SVf_IOK) || ((flags & (SVp_IOK | SVp_NOK)) == SVp_IOK)) {
5596 /* It's publicly an integer, or privately an integer-not-float */
5599 if (SvUVX(sv) == 0) {
5600 (void)SvIOK_only(sv);
5604 (void)SvIOK_only_UV(sv);
5608 if (SvIVX(sv) == IV_MIN)
5609 sv_setnv(sv, (NV)IV_MIN - 1.0);
5611 (void)SvIOK_only(sv);
5617 if (flags & SVp_NOK) {
5619 (void)SvNOK_only(sv);
5622 if (!(flags & SVp_POK)) {
5623 if ((flags & SVTYPEMASK) < SVt_PVNV)
5624 sv_upgrade(sv, SVt_NV);
5626 (void)SvNOK_only(sv);
5629 #ifdef PERL_PRESERVE_IVUV
5631 I32 numtype = looks_like_number(sv);
5632 if (numtype && !(numtype & IS_NUMBER_INFINITY)) {
5633 /* Need to try really hard to see if it's an integer.
5634 9.22337203685478e+18 is an integer.
5635 but "9.22337203685478e+18" + 0 is UV=9223372036854779904
5636 so $a="9.22337203685478e+18"; $a+0; $a--
5637 needs to be the same as $a="9.22337203685478e+18"; $a--
5644 /* sv_2iv *should* have made this an NV */
5645 if (flags & SVp_NOK) {
5646 (void)SvNOK_only(sv);
5650 /* I don't think we can get here. Maybe I should assert this
5651 And if we do get here I suspect that sv_setnv will croak. NWC
5653 #if defined(USE_LONG_DOUBLE)
5654 DEBUG_c(PerlIO_printf(Perl_debug_log,"sv_dec punt failed to convert '%s' to IOK or NOKp, UV=0x%"UVxf" NV=%"PERL_PRIgldbl"\n",
5655 SvPVX(sv), SvIVX(sv), SvNVX(sv)));
5657 DEBUG_c(PerlIO_printf(Perl_debug_log,"sv_dec punt failed to convert '%s' to IOK or NOKp, UV=0x%"UVxf" NV=%g\n",
5658 SvPVX(sv), SvIVX(sv), SvNVX(sv)));
5662 #endif /* PERL_PRESERVE_IVUV */
5663 sv_setnv(sv,Atof(SvPVX(sv)) - 1.0); /* punt */
5667 =for apidoc sv_mortalcopy
5669 Creates a new SV which is a copy of the original SV. The new SV is marked
5675 /* Make a string that will exist for the duration of the expression
5676 * evaluation. Actually, it may have to last longer than that, but
5677 * hopefully we won't free it until it has been assigned to a
5678 * permanent location. */
5681 Perl_sv_mortalcopy(pTHX_ SV *oldstr)
5686 sv_setsv(sv,oldstr);
5688 PL_tmps_stack[++PL_tmps_ix] = sv;
5694 =for apidoc sv_newmortal
5696 Creates a new SV which is mortal. The reference count of the SV is set to 1.
5702 Perl_sv_newmortal(pTHX)
5707 SvFLAGS(sv) = SVs_TEMP;
5709 PL_tmps_stack[++PL_tmps_ix] = sv;
5714 =for apidoc sv_2mortal
5716 Marks an SV as mortal. The SV will be destroyed when the current context
5722 /* same thing without the copying */
5725 Perl_sv_2mortal(pTHX_ register SV *sv)
5729 if (SvREADONLY(sv) && SvIMMORTAL(sv))
5732 PL_tmps_stack[++PL_tmps_ix] = sv;
5740 Creates a new SV and copies a string into it. The reference count for the
5741 SV is set to 1. If C<len> is zero, Perl will compute the length using
5742 strlen(). For efficiency, consider using C<newSVpvn> instead.
5748 Perl_newSVpv(pTHX_ const char *s, STRLEN len)
5755 sv_setpvn(sv,s,len);
5760 =for apidoc newSVpvn
5762 Creates a new SV and copies a string into it. The reference count for the
5763 SV is set to 1. Note that if C<len> is zero, Perl will create a zero length
5764 string. You are responsible for ensuring that the source string is at least
5771 Perl_newSVpvn(pTHX_ const char *s, STRLEN len)
5776 sv_setpvn(sv,s,len);
5781 =for apidoc newSVpvn_share
5783 Creates a new SV and populates it with a string from
5784 the string table. Turns on READONLY and FAKE.
5785 The idea here is that as string table is used for shared hash
5786 keys these strings will have SvPVX == HeKEY and hash lookup
5787 will avoid string compare.
5793 Perl_newSVpvn_share(pTHX_ const char *src, I32 len, U32 hash)
5796 bool is_utf8 = FALSE;
5801 if (is_utf8 && !(PL_hints & HINT_UTF8_DISTINCT)) {
5802 STRLEN tmplen = len;
5803 /* See the note in hv.c:hv_fetch() --jhi */
5804 src = (char*)bytes_from_utf8((U8*)src, &tmplen, &is_utf8);
5808 PERL_HASH(hash, src, len);
5810 sv_upgrade(sv, SVt_PVIV);
5811 SvPVX(sv) = sharepvn(src, is_utf8?-len:len, hash);
5823 #if defined(PERL_IMPLICIT_CONTEXT)
5825 Perl_newSVpvf_nocontext(const char* pat, ...)
5830 va_start(args, pat);
5831 sv = vnewSVpvf(pat, &args);
5838 =for apidoc newSVpvf
5840 Creates a new SV an initialize it with the string formatted like
5847 Perl_newSVpvf(pTHX_ const char* pat, ...)
5851 va_start(args, pat);
5852 sv = vnewSVpvf(pat, &args);
5858 Perl_vnewSVpvf(pTHX_ const char* pat, va_list* args)
5862 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
5869 Creates a new SV and copies a floating point value into it.
5870 The reference count for the SV is set to 1.
5876 Perl_newSVnv(pTHX_ NV n)
5888 Creates a new SV and copies an integer into it. The reference count for the
5895 Perl_newSViv(pTHX_ IV i)
5907 Creates a new SV and copies an unsigned integer into it.
5908 The reference count for the SV is set to 1.
5914 Perl_newSVuv(pTHX_ UV u)
5924 =for apidoc newRV_noinc
5926 Creates an RV wrapper for an SV. The reference count for the original
5927 SV is B<not> incremented.
5933 Perl_newRV_noinc(pTHX_ SV *tmpRef)
5938 sv_upgrade(sv, SVt_RV);
5945 /* newRV_inc is #defined to newRV in sv.h */
5947 Perl_newRV(pTHX_ SV *tmpRef)
5949 return newRV_noinc(SvREFCNT_inc(tmpRef));
5955 Creates a new SV which is an exact duplicate of the original SV.
5960 /* make an exact duplicate of old */
5963 Perl_newSVsv(pTHX_ register SV *old)
5969 if (SvTYPE(old) == SVTYPEMASK) {
5970 if (ckWARN_d(WARN_INTERNAL))
5971 Perl_warner(aTHX_ WARN_INTERNAL, "semi-panic: attempt to dup freed string");
5986 Perl_sv_reset(pTHX_ register char *s, HV *stash)
5994 char todo[PERL_UCHAR_MAX+1];
5999 if (!*s) { /* reset ?? searches */
6000 for (pm = HvPMROOT(stash); pm; pm = pm->op_pmnext) {
6001 pm->op_pmdynflags &= ~PMdf_USED;
6006 /* reset variables */
6008 if (!HvARRAY(stash))
6011 Zero(todo, 256, char);
6013 i = (unsigned char)*s;
6017 max = (unsigned char)*s++;
6018 for ( ; i <= max; i++) {
6021 for (i = 0; i <= (I32) HvMAX(stash); i++) {
6022 for (entry = HvARRAY(stash)[i];
6024 entry = HeNEXT(entry))
6026 if (!todo[(U8)*HeKEY(entry)])
6028 gv = (GV*)HeVAL(entry);
6030 if (SvTHINKFIRST(sv)) {
6031 if (!SvREADONLY(sv) && SvROK(sv))
6036 if (SvTYPE(sv) >= SVt_PV) {
6038 if (SvPVX(sv) != Nullch)
6045 if (GvHV(gv) && !HvNAME(GvHV(gv))) {
6047 #ifdef USE_ENVIRON_ARRAY
6049 environ[0] = Nullch;
6058 Perl_sv_2io(pTHX_ SV *sv)
6064 switch (SvTYPE(sv)) {
6072 Perl_croak(aTHX_ "Bad filehandle: %s", GvNAME(gv));
6076 Perl_croak(aTHX_ PL_no_usym, "filehandle");
6078 return sv_2io(SvRV(sv));
6079 gv = gv_fetchpv(SvPV(sv,n_a), FALSE, SVt_PVIO);
6085 Perl_croak(aTHX_ "Bad filehandle: %s", SvPV(sv,n_a));
6092 Perl_sv_2cv(pTHX_ SV *sv, HV **st, GV **gvp, I32 lref)
6099 return *gvp = Nullgv, Nullcv;
6100 switch (SvTYPE(sv)) {
6119 SV **sp = &sv; /* Used in tryAMAGICunDEREF macro. */
6120 tryAMAGICunDEREF(to_cv);
6123 if (SvTYPE(sv) == SVt_PVCV) {
6132 Perl_croak(aTHX_ "Not a subroutine reference");
6137 gv = gv_fetchpv(SvPV(sv, n_a), lref, SVt_PVCV);
6143 if (lref && !GvCVu(gv)) {
6146 tmpsv = NEWSV(704,0);
6147 gv_efullname3(tmpsv, gv, Nullch);
6148 /* XXX this is probably not what they think they're getting.
6149 * It has the same effect as "sub name;", i.e. just a forward
6151 newSUB(start_subparse(FALSE, 0),
6152 newSVOP(OP_CONST, 0, tmpsv),
6157 Perl_croak(aTHX_ "Unable to create sub named \"%s\"", SvPV(sv,n_a));
6166 Returns true if the SV has a true value by Perl's rules.
6172 Perl_sv_true(pTHX_ register SV *sv)
6178 if ((tXpv = (XPV*)SvANY(sv)) &&
6179 (tXpv->xpv_cur > 1 ||
6180 (tXpv->xpv_cur && *tXpv->xpv_pv != '0')))
6187 return SvIVX(sv) != 0;
6190 return SvNVX(sv) != 0.0;
6192 return sv_2bool(sv);
6198 Perl_sv_iv(pTHX_ register SV *sv)
6202 return (IV)SvUVX(sv);
6209 Perl_sv_uv(pTHX_ register SV *sv)
6214 return (UV)SvIVX(sv);
6220 Perl_sv_nv(pTHX_ register SV *sv)
6228 Perl_sv_pv(pTHX_ SV *sv)
6235 return sv_2pv(sv, &n_a);
6239 Perl_sv_pvn(pTHX_ SV *sv, STRLEN *lp)
6245 return sv_2pv(sv, lp);
6249 =for apidoc sv_pvn_force
6251 Get a sensible string out of the SV somehow.
6257 Perl_sv_pvn_force(pTHX_ SV *sv, STRLEN *lp)
6259 return sv_pvn_force_flags(sv, lp, SV_GMAGIC);
6263 =for apidoc sv_pvn_force_flags
6265 Get a sensible string out of the SV somehow.
6266 If C<flags> has C<SV_GMAGIC> bit set, will C<mg_get> on C<sv> if
6267 appropriate, else not. C<sv_pvn_force> and C<sv_pvn_force_nomg> are
6268 implemented in terms of this function.
6274 Perl_sv_pvn_force_flags(pTHX_ SV *sv, STRLEN *lp, I32 flags)
6278 if (SvTHINKFIRST(sv) && !SvROK(sv))
6279 sv_force_normal(sv);
6285 if (SvTYPE(sv) > SVt_PVLV && SvTYPE(sv) != SVt_PVFM) {
6286 Perl_croak(aTHX_ "Can't coerce %s to string in %s", sv_reftype(sv,0),
6287 PL_op_name[PL_op->op_type]);
6290 s = sv_2pv_flags(sv, lp, flags);
6291 if (s != SvPVX(sv)) { /* Almost, but not quite, sv_setpvn() */
6296 (void)SvUPGRADE(sv, SVt_PV); /* Never FALSE */
6297 SvGROW(sv, len + 1);
6298 Move(s,SvPVX(sv),len,char);
6303 SvPOK_on(sv); /* validate pointer */
6305 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2pv(%s)\n",
6306 PTR2UV(sv),SvPVX(sv)));
6313 Perl_sv_pvbyte(pTHX_ SV *sv)
6315 sv_utf8_downgrade(sv,0);
6320 Perl_sv_pvbyten(pTHX_ SV *sv, STRLEN *lp)
6322 sv_utf8_downgrade(sv,0);
6323 return sv_pvn(sv,lp);
6327 Perl_sv_pvbyten_force(pTHX_ SV *sv, STRLEN *lp)
6329 sv_utf8_downgrade(sv,0);
6330 return sv_pvn_force(sv,lp);
6334 Perl_sv_pvutf8(pTHX_ SV *sv)
6336 sv_utf8_upgrade(sv);
6341 Perl_sv_pvutf8n(pTHX_ SV *sv, STRLEN *lp)
6343 sv_utf8_upgrade(sv);
6344 return sv_pvn(sv,lp);
6348 =for apidoc sv_pvutf8n_force
6350 Get a sensible UTF8-encoded string out of the SV somehow. See
6357 Perl_sv_pvutf8n_force(pTHX_ SV *sv, STRLEN *lp)
6359 sv_utf8_upgrade(sv);
6360 return sv_pvn_force(sv,lp);
6364 =for apidoc sv_reftype
6366 Returns a string describing what the SV is a reference to.
6372 Perl_sv_reftype(pTHX_ SV *sv, int ob)
6374 if (ob && SvOBJECT(sv))
6375 return HvNAME(SvSTASH(sv));
6377 switch (SvTYPE(sv)) {
6391 case SVt_PVLV: return "LVALUE";
6392 case SVt_PVAV: return "ARRAY";
6393 case SVt_PVHV: return "HASH";
6394 case SVt_PVCV: return "CODE";
6395 case SVt_PVGV: return "GLOB";
6396 case SVt_PVFM: return "FORMAT";
6397 case SVt_PVIO: return "IO";
6398 default: return "UNKNOWN";
6404 =for apidoc sv_isobject
6406 Returns a boolean indicating whether the SV is an RV pointing to a blessed
6407 object. If the SV is not an RV, or if the object is not blessed, then this
6414 Perl_sv_isobject(pTHX_ SV *sv)
6431 Returns a boolean indicating whether the SV is blessed into the specified
6432 class. This does not check for subtypes; use C<sv_derived_from> to verify
6433 an inheritance relationship.
6439 Perl_sv_isa(pTHX_ SV *sv, const char *name)
6451 return strEQ(HvNAME(SvSTASH(sv)), name);
6457 Creates a new SV for the RV, C<rv>, to point to. If C<rv> is not an RV then
6458 it will be upgraded to one. If C<classname> is non-null then the new SV will
6459 be blessed in the specified package. The new SV is returned and its
6460 reference count is 1.
6466 Perl_newSVrv(pTHX_ SV *rv, const char *classname)
6472 SV_CHECK_THINKFIRST(rv);
6475 if (SvTYPE(rv) >= SVt_PVMG) {
6476 U32 refcnt = SvREFCNT(rv);
6480 SvREFCNT(rv) = refcnt;
6483 if (SvTYPE(rv) < SVt_RV)
6484 sv_upgrade(rv, SVt_RV);
6485 else if (SvTYPE(rv) > SVt_RV) {
6486 (void)SvOOK_off(rv);
6487 if (SvPVX(rv) && SvLEN(rv))
6488 Safefree(SvPVX(rv));
6498 HV* stash = gv_stashpv(classname, TRUE);
6499 (void)sv_bless(rv, stash);
6505 =for apidoc sv_setref_pv
6507 Copies a pointer into a new SV, optionally blessing the SV. The C<rv>
6508 argument will be upgraded to an RV. That RV will be modified to point to
6509 the new SV. If the C<pv> argument is NULL then C<PL_sv_undef> will be placed
6510 into the SV. The C<classname> argument indicates the package for the
6511 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
6512 will be returned and will have a reference count of 1.
6514 Do not use with other Perl types such as HV, AV, SV, CV, because those
6515 objects will become corrupted by the pointer copy process.
6517 Note that C<sv_setref_pvn> copies the string while this copies the pointer.
6523 Perl_sv_setref_pv(pTHX_ SV *rv, const char *classname, void *pv)
6526 sv_setsv(rv, &PL_sv_undef);
6530 sv_setiv(newSVrv(rv,classname), PTR2IV(pv));
6535 =for apidoc sv_setref_iv
6537 Copies an integer into a new SV, optionally blessing the SV. The C<rv>
6538 argument will be upgraded to an RV. That RV will be modified to point to
6539 the new SV. The C<classname> argument indicates the package for the
6540 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
6541 will be returned and will have a reference count of 1.
6547 Perl_sv_setref_iv(pTHX_ SV *rv, const char *classname, IV iv)
6549 sv_setiv(newSVrv(rv,classname), iv);
6554 =for apidoc sv_setref_uv
6556 Copies an unsigned integer into a new SV, optionally blessing the SV. The C<rv>
6557 argument will be upgraded to an RV. That RV will be modified to point to
6558 the new SV. The C<classname> argument indicates the package for the
6559 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
6560 will be returned and will have a reference count of 1.
6566 Perl_sv_setref_uv(pTHX_ SV *rv, const char *classname, UV uv)
6568 sv_setuv(newSVrv(rv,classname), uv);
6573 =for apidoc sv_setref_nv
6575 Copies a double into a new SV, optionally blessing the SV. The C<rv>
6576 argument will be upgraded to an RV. That RV will be modified to point to
6577 the new SV. The C<classname> argument indicates the package for the
6578 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
6579 will be returned and will have a reference count of 1.
6585 Perl_sv_setref_nv(pTHX_ SV *rv, const char *classname, NV nv)
6587 sv_setnv(newSVrv(rv,classname), nv);
6592 =for apidoc sv_setref_pvn
6594 Copies a string into a new SV, optionally blessing the SV. The length of the
6595 string must be specified with C<n>. The C<rv> argument will be upgraded to
6596 an RV. That RV will be modified to point to the new SV. The C<classname>
6597 argument indicates the package for the blessing. Set C<classname> to
6598 C<Nullch> to avoid the blessing. The new SV will be returned and will have
6599 a reference count of 1.
6601 Note that C<sv_setref_pv> copies the pointer while this copies the string.
6607 Perl_sv_setref_pvn(pTHX_ SV *rv, const char *classname, char *pv, STRLEN n)
6609 sv_setpvn(newSVrv(rv,classname), pv, n);
6614 =for apidoc sv_bless
6616 Blesses an SV into a specified package. The SV must be an RV. The package
6617 must be designated by its stash (see C<gv_stashpv()>). The reference count
6618 of the SV is unaffected.
6624 Perl_sv_bless(pTHX_ SV *sv, HV *stash)
6628 Perl_croak(aTHX_ "Can't bless non-reference value");
6630 if (SvFLAGS(tmpRef) & (SVs_OBJECT|SVf_READONLY)) {
6631 if (SvREADONLY(tmpRef))
6632 Perl_croak(aTHX_ PL_no_modify);
6633 if (SvOBJECT(tmpRef)) {
6634 if (SvTYPE(tmpRef) != SVt_PVIO)
6636 SvREFCNT_dec(SvSTASH(tmpRef));
6639 SvOBJECT_on(tmpRef);
6640 if (SvTYPE(tmpRef) != SVt_PVIO)
6642 (void)SvUPGRADE(tmpRef, SVt_PVMG);
6643 SvSTASH(tmpRef) = (HV*)SvREFCNT_inc(stash);
6654 S_sv_unglob(pTHX_ SV *sv)
6658 assert(SvTYPE(sv) == SVt_PVGV);
6663 SvREFCNT_dec(GvSTASH(sv));
6664 GvSTASH(sv) = Nullhv;
6666 sv_unmagic(sv, PERL_MAGIC_glob);
6667 Safefree(GvNAME(sv));
6670 /* need to keep SvANY(sv) in the right arena */
6671 xpvmg = new_XPVMG();
6672 StructCopy(SvANY(sv), xpvmg, XPVMG);
6673 del_XPVGV(SvANY(sv));
6676 SvFLAGS(sv) &= ~SVTYPEMASK;
6677 SvFLAGS(sv) |= SVt_PVMG;
6681 =for apidoc sv_unref_flags
6683 Unsets the RV status of the SV, and decrements the reference count of
6684 whatever was being referenced by the RV. This can almost be thought of
6685 as a reversal of C<newSVrv>. The C<cflags> argument can contain
6686 C<SV_IMMEDIATE_UNREF> to force the reference count to be decremented
6687 (otherwise the decrementing is conditional on the reference count being
6688 different from one or the reference being a readonly SV).
6695 Perl_sv_unref_flags(pTHX_ SV *sv, U32 flags)
6699 if (SvWEAKREF(sv)) {
6707 if (SvREFCNT(rv) != 1 || SvREADONLY(rv) || flags) /* SV_IMMEDIATE_UNREF */
6709 else /* XXX Hack, but hard to make $a=$a->[1] work otherwise */
6710 sv_2mortal(rv); /* Schedule for freeing later */
6714 =for apidoc sv_unref
6716 Unsets the RV status of the SV, and decrements the reference count of
6717 whatever was being referenced by the RV. This can almost be thought of
6718 as a reversal of C<newSVrv>. This is C<sv_unref_flags> with the C<flag>
6719 being zero. See C<SvROK_off>.
6725 Perl_sv_unref(pTHX_ SV *sv)
6727 sv_unref_flags(sv, 0);
6731 Perl_sv_taint(pTHX_ SV *sv)
6733 sv_magic((sv), Nullsv, PERL_MAGIC_taint, Nullch, 0);
6737 Perl_sv_untaint(pTHX_ SV *sv)
6739 if (SvTYPE(sv) >= SVt_PVMG && SvMAGIC(sv)) {
6740 MAGIC *mg = mg_find(sv, PERL_MAGIC_taint);
6747 Perl_sv_tainted(pTHX_ SV *sv)
6749 if (SvTYPE(sv) >= SVt_PVMG && SvMAGIC(sv)) {
6750 MAGIC *mg = mg_find(sv, PERL_MAGIC_taint);
6751 if (mg && ((mg->mg_len & 1) || ((mg->mg_len & 2) && mg->mg_obj == sv)))
6758 =for apidoc sv_setpviv
6760 Copies an integer into the given SV, also updating its string value.
6761 Does not handle 'set' magic. See C<sv_setpviv_mg>.
6767 Perl_sv_setpviv(pTHX_ SV *sv, IV iv)
6769 char buf[TYPE_CHARS(UV)];
6771 char *ptr = uiv_2buf(buf, iv, 0, 0, &ebuf);
6773 sv_setpvn(sv, ptr, ebuf - ptr);
6778 =for apidoc sv_setpviv_mg
6780 Like C<sv_setpviv>, but also handles 'set' magic.
6786 Perl_sv_setpviv_mg(pTHX_ SV *sv, IV iv)
6788 char buf[TYPE_CHARS(UV)];
6790 char *ptr = uiv_2buf(buf, iv, 0, 0, &ebuf);
6792 sv_setpvn(sv, ptr, ebuf - ptr);
6796 #if defined(PERL_IMPLICIT_CONTEXT)
6798 Perl_sv_setpvf_nocontext(SV *sv, const char* pat, ...)
6802 va_start(args, pat);
6803 sv_vsetpvf(sv, pat, &args);
6809 Perl_sv_setpvf_mg_nocontext(SV *sv, const char* pat, ...)
6813 va_start(args, pat);
6814 sv_vsetpvf_mg(sv, pat, &args);
6820 =for apidoc sv_setpvf
6822 Processes its arguments like C<sprintf> and sets an SV to the formatted
6823 output. Does not handle 'set' magic. See C<sv_setpvf_mg>.
6829 Perl_sv_setpvf(pTHX_ SV *sv, const char* pat, ...)
6832 va_start(args, pat);
6833 sv_vsetpvf(sv, pat, &args);
6838 Perl_sv_vsetpvf(pTHX_ SV *sv, const char* pat, va_list* args)
6840 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
6844 =for apidoc sv_setpvf_mg
6846 Like C<sv_setpvf>, but also handles 'set' magic.
6852 Perl_sv_setpvf_mg(pTHX_ SV *sv, const char* pat, ...)
6855 va_start(args, pat);
6856 sv_vsetpvf_mg(sv, pat, &args);
6861 Perl_sv_vsetpvf_mg(pTHX_ SV *sv, const char* pat, va_list* args)
6863 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
6867 #if defined(PERL_IMPLICIT_CONTEXT)
6869 Perl_sv_catpvf_nocontext(SV *sv, const char* pat, ...)
6873 va_start(args, pat);
6874 sv_vcatpvf(sv, pat, &args);
6879 Perl_sv_catpvf_mg_nocontext(SV *sv, const char* pat, ...)
6883 va_start(args, pat);
6884 sv_vcatpvf_mg(sv, pat, &args);
6890 =for apidoc sv_catpvf
6892 Processes its arguments like C<sprintf> and appends the formatted
6893 output to an SV. If the appended data contains "wide" characters
6894 (including, but not limited to, SVs with a UTF-8 PV formatted with %s,
6895 and characters >255 formatted with %c), the original SV might get
6896 upgraded to UTF-8. Handles 'get' magic, but not 'set' magic.
6897 C<SvSETMAGIC()> must typically be called after calling this function
6898 to handle 'set' magic.
6903 Perl_sv_catpvf(pTHX_ SV *sv, const char* pat, ...)
6906 va_start(args, pat);
6907 sv_vcatpvf(sv, pat, &args);
6912 Perl_sv_vcatpvf(pTHX_ SV *sv, const char* pat, va_list* args)
6914 sv_vcatpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
6918 =for apidoc sv_catpvf_mg
6920 Like C<sv_catpvf>, but also handles 'set' magic.
6926 Perl_sv_catpvf_mg(pTHX_ SV *sv, const char* pat, ...)
6929 va_start(args, pat);
6930 sv_vcatpvf_mg(sv, pat, &args);
6935 Perl_sv_vcatpvf_mg(pTHX_ SV *sv, const char* pat, va_list* args)
6937 sv_vcatpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
6942 =for apidoc sv_vsetpvfn
6944 Works like C<vcatpvfn> but copies the text into the SV instead of
6951 Perl_sv_vsetpvfn(pTHX_ SV *sv, const char *pat, STRLEN patlen, va_list *args, SV **svargs, I32 svmax, bool *maybe_tainted)
6953 sv_setpvn(sv, "", 0);
6954 sv_vcatpvfn(sv, pat, patlen, args, svargs, svmax, maybe_tainted);
6958 S_expect_number(pTHX_ char** pattern)
6961 switch (**pattern) {
6962 case '1': case '2': case '3':
6963 case '4': case '5': case '6':
6964 case '7': case '8': case '9':
6965 while (isDIGIT(**pattern))
6966 var = var * 10 + (*(*pattern)++ - '0');
6970 #define EXPECT_NUMBER(pattern, var) (var = S_expect_number(aTHX_ &pattern))
6973 =for apidoc sv_vcatpvfn
6975 Processes its arguments like C<vsprintf> and appends the formatted output
6976 to an SV. Uses an array of SVs if the C style variable argument list is
6977 missing (NULL). When running with taint checks enabled, indicates via
6978 C<maybe_tainted> if results are untrustworthy (often due to the use of
6985 Perl_sv_vcatpvfn(pTHX_ SV *sv, const char *pat, STRLEN patlen, va_list *args, SV **svargs, I32 svmax, bool *maybe_tainted)
6992 static char nullstr[] = "(null)";
6995 /* no matter what, this is a string now */
6996 (void)SvPV_force(sv, origlen);
6998 /* special-case "", "%s", and "%_" */
7001 if (patlen == 2 && pat[0] == '%') {
7005 char *s = va_arg(*args, char*);
7006 sv_catpv(sv, s ? s : nullstr);
7008 else if (svix < svmax) {
7009 sv_catsv(sv, *svargs);
7010 if (DO_UTF8(*svargs))
7016 argsv = va_arg(*args, SV*);
7017 sv_catsv(sv, argsv);
7022 /* See comment on '_' below */
7027 patend = (char*)pat + patlen;
7028 for (p = (char*)pat; p < patend; p = q) {
7031 bool vectorize = FALSE;
7032 bool vectorarg = FALSE;
7033 bool vec_utf = FALSE;
7039 bool has_precis = FALSE;
7041 bool is_utf = FALSE;
7044 U8 utf8buf[UTF8_MAXLEN+1];
7045 STRLEN esignlen = 0;
7047 char *eptr = Nullch;
7049 /* Times 4: a decimal digit takes more than 3 binary digits.
7050 * NV_DIG: mantissa takes than many decimal digits.
7051 * Plus 32: Playing safe. */
7052 char ebuf[IV_DIG * 4 + NV_DIG + 32];
7053 /* large enough for "%#.#f" --chip */
7054 /* what about long double NVs? --jhi */
7057 U8 *vecstr = Null(U8*);
7069 STRLEN dotstrlen = 1;
7070 I32 efix = 0; /* explicit format parameter index */
7071 I32 ewix = 0; /* explicit width index */
7072 I32 epix = 0; /* explicit precision index */
7073 I32 evix = 0; /* explicit vector index */
7074 bool asterisk = FALSE;
7076 /* echo everything up to the next format specification */
7077 for (q = p; q < patend && *q != '%'; ++q) ;
7079 sv_catpvn(sv, p, q - p);
7086 We allow format specification elements in this order:
7087 \d+\$ explicit format parameter index
7089 \*?(\d+\$)?v vector with optional (optionally specified) arg
7090 \d+|\*(\d+\$)? width using optional (optionally specified) arg
7091 \.(\d*|\*(\d+\$)?) precision using optional (optionally specified) arg
7093 [%bcdefginopsux_DFOUX] format (mandatory)
7095 if (EXPECT_NUMBER(q, width)) {
7136 if (EXPECT_NUMBER(q, ewix))
7145 if ((vectorarg = asterisk)) {
7155 EXPECT_NUMBER(q, width);
7160 vecsv = va_arg(*args, SV*);
7162 vecsv = (evix ? evix <= svmax : svix < svmax) ?
7163 svargs[ewix ? ewix-1 : svix++] : &PL_sv_undef;
7164 dotstr = SvPVx(vecsv, dotstrlen);
7169 vecsv = va_arg(*args, SV*);
7170 vecstr = (U8*)SvPVx(vecsv,veclen);
7171 vec_utf = DO_UTF8(vecsv);
7173 else if (efix ? efix <= svmax : svix < svmax) {
7174 vecsv = svargs[efix ? efix-1 : svix++];
7175 vecstr = (U8*)SvPVx(vecsv,veclen);
7176 vec_utf = DO_UTF8(vecsv);
7186 i = va_arg(*args, int);
7188 i = (ewix ? ewix <= svmax : svix < svmax) ?
7189 SvIVx(svargs[ewix ? ewix-1 : svix++]) : 0;
7191 width = (i < 0) ? -i : i;
7201 if (EXPECT_NUMBER(q, epix) && *q++ != '$')
7204 i = va_arg(*args, int);
7206 i = (ewix ? ewix <= svmax : svix < svmax)
7207 ? SvIVx(svargs[ewix ? ewix-1 : svix++]) : 0;
7208 precis = (i < 0) ? 0 : i;
7213 precis = precis * 10 + (*q++ - '0');
7221 #if defined(HAS_QUAD) || (defined(HAS_LONG_DOUBLE) && defined(USE_LONG_DOUBLE))
7232 #if defined(HAS_QUAD) || (defined(HAS_LONG_DOUBLE) && defined(USE_LONG_DOUBLE))
7233 if (*(q + 1) == 'l') { /* lld, llf */
7256 argsv = (efix ? efix <= svmax : svix < svmax) ?
7257 svargs[efix ? efix-1 : svix++] : &PL_sv_undef;
7264 uv = args ? va_arg(*args, int) : SvIVx(argsv);
7266 (!UNI_IS_INVARIANT(uv) && SvUTF8(sv)))
7268 eptr = (char*)utf8buf;
7269 elen = uvchr_to_utf8((U8*)eptr, uv) - utf8buf;
7281 eptr = va_arg(*args, char*);
7283 #ifdef MACOS_TRADITIONAL
7284 /* On MacOS, %#s format is used for Pascal strings */
7289 elen = strlen(eptr);
7292 elen = sizeof nullstr - 1;
7296 eptr = SvPVx(argsv, elen);
7297 if (DO_UTF8(argsv)) {
7298 if (has_precis && precis < elen) {
7300 sv_pos_u2b(argsv, &p, 0); /* sticks at end */
7303 if (width) { /* fudge width (can't fudge elen) */
7304 width += elen - sv_len_utf8(argsv);
7313 * The "%_" hack might have to be changed someday,
7314 * if ISO or ANSI decide to use '_' for something.
7315 * So we keep it hidden from users' code.
7319 argsv = va_arg(*args, SV*);
7320 eptr = SvPVx(argsv, elen);
7326 if (has_precis && elen > precis)
7335 uv = PTR2UV(args ? va_arg(*args, void*) : argsv);
7353 iv = (IV)utf8n_to_uvchr(vecstr, veclen, &ulen, 0);
7363 case 'h': iv = (short)va_arg(*args, int); break;
7364 default: iv = va_arg(*args, int); break;
7365 case 'l': iv = va_arg(*args, long); break;
7366 case 'V': iv = va_arg(*args, IV); break;
7368 case 'q': iv = va_arg(*args, Quad_t); break;
7375 case 'h': iv = (short)iv; break;
7377 case 'l': iv = (long)iv; break;
7380 case 'q': iv = (Quad_t)iv; break;
7387 esignbuf[esignlen++] = plus;
7391 esignbuf[esignlen++] = '-';
7433 uv = utf8n_to_uvchr(vecstr, veclen, &ulen, 0);
7443 case 'h': uv = (unsigned short)va_arg(*args, unsigned); break;
7444 default: uv = va_arg(*args, unsigned); break;
7445 case 'l': uv = va_arg(*args, unsigned long); break;
7446 case 'V': uv = va_arg(*args, UV); break;
7448 case 'q': uv = va_arg(*args, Quad_t); break;
7455 case 'h': uv = (unsigned short)uv; break;
7457 case 'l': uv = (unsigned long)uv; break;
7460 case 'q': uv = (Quad_t)uv; break;
7466 eptr = ebuf + sizeof ebuf;
7472 p = (char*)((c == 'X')
7473 ? "0123456789ABCDEF" : "0123456789abcdef");
7479 esignbuf[esignlen++] = '0';
7480 esignbuf[esignlen++] = c; /* 'x' or 'X' */
7486 *--eptr = '0' + dig;
7488 if (alt && *eptr != '0')
7494 *--eptr = '0' + dig;
7497 esignbuf[esignlen++] = '0';
7498 esignbuf[esignlen++] = 'b';
7501 default: /* it had better be ten or less */
7502 #if defined(PERL_Y2KWARN)
7503 if (ckWARN(WARN_Y2K)) {
7505 char *s = SvPV(sv,n);
7506 if (n >= 2 && s[n-2] == '1' && s[n-1] == '9'
7507 && (n == 2 || !isDIGIT(s[n-3])))
7509 Perl_warner(aTHX_ WARN_Y2K,
7510 "Possible Y2K bug: %%%c %s",
7511 c, "format string following '19'");
7517 *--eptr = '0' + dig;
7518 } while (uv /= base);
7521 elen = (ebuf + sizeof ebuf) - eptr;
7524 zeros = precis - elen;
7525 else if (precis == 0 && elen == 1 && *eptr == '0')
7530 /* FLOATING POINT */
7533 c = 'f'; /* maybe %F isn't supported here */
7539 /* This is evil, but floating point is even more evil */
7542 nv = args ? va_arg(*args, NV) : SvNVx(argsv);
7545 if (c != 'e' && c != 'E') {
7547 (void)Perl_frexp(nv, &i);
7548 if (i == PERL_INT_MIN)
7549 Perl_die(aTHX_ "panic: frexp");
7551 need = BIT_DIGITS(i);
7553 need += has_precis ? precis : 6; /* known default */
7557 need += 20; /* fudge factor */
7558 if (PL_efloatsize < need) {
7559 Safefree(PL_efloatbuf);
7560 PL_efloatsize = need + 20; /* more fudge */
7561 New(906, PL_efloatbuf, PL_efloatsize, char);
7562 PL_efloatbuf[0] = '\0';
7565 eptr = ebuf + sizeof ebuf;
7568 #if defined(USE_LONG_DOUBLE) && defined(PERL_PRIfldbl)
7570 /* Copy the one or more characters in a long double
7571 * format before the 'base' ([efgEFG]) character to
7572 * the format string. */
7573 static char const prifldbl[] = PERL_PRIfldbl;
7574 char const *p = prifldbl + sizeof(prifldbl) - 3;
7575 while (p >= prifldbl) { *--eptr = *p--; }
7580 do { *--eptr = '0' + (base % 10); } while (base /= 10);
7585 do { *--eptr = '0' + (base % 10); } while (base /= 10);
7597 /* No taint. Otherwise we are in the strange situation
7598 * where printf() taints but print($float) doesn't.
7600 (void)sprintf(PL_efloatbuf, eptr, nv);
7602 eptr = PL_efloatbuf;
7603 elen = strlen(PL_efloatbuf);
7610 i = SvCUR(sv) - origlen;
7613 case 'h': *(va_arg(*args, short*)) = i; break;
7614 default: *(va_arg(*args, int*)) = i; break;
7615 case 'l': *(va_arg(*args, long*)) = i; break;
7616 case 'V': *(va_arg(*args, IV*)) = i; break;
7618 case 'q': *(va_arg(*args, Quad_t*)) = i; break;
7623 sv_setuv_mg(argsv, (UV)i);
7624 continue; /* not "break" */
7631 if (!args && ckWARN(WARN_PRINTF) &&
7632 (PL_op->op_type == OP_PRTF || PL_op->op_type == OP_SPRINTF)) {
7633 SV *msg = sv_newmortal();
7634 Perl_sv_setpvf(aTHX_ msg, "Invalid conversion in %s: ",
7635 (PL_op->op_type == OP_PRTF) ? "printf" : "sprintf");
7638 Perl_sv_catpvf(aTHX_ msg,
7639 "\"%%%c\"", c & 0xFF);
7641 Perl_sv_catpvf(aTHX_ msg,
7642 "\"%%\\%03"UVof"\"",
7645 sv_catpv(msg, "end of string");
7646 Perl_warner(aTHX_ WARN_PRINTF, "%"SVf, msg); /* yes, this is reentrant */
7649 /* output mangled stuff ... */
7655 /* ... right here, because formatting flags should not apply */
7656 SvGROW(sv, SvCUR(sv) + elen + 1);
7658 Copy(eptr, p, elen, char);
7661 SvCUR(sv) = p - SvPVX(sv);
7662 continue; /* not "break" */
7665 have = esignlen + zeros + elen;
7666 need = (have > width ? have : width);
7669 SvGROW(sv, SvCUR(sv) + need + dotstrlen + 1);
7671 if (esignlen && fill == '0') {
7672 for (i = 0; i < esignlen; i++)
7676 memset(p, fill, gap);
7679 if (esignlen && fill != '0') {
7680 for (i = 0; i < esignlen; i++)
7684 for (i = zeros; i; i--)
7688 Copy(eptr, p, elen, char);
7692 memset(p, ' ', gap);
7697 Copy(dotstr, p, dotstrlen, char);
7701 vectorize = FALSE; /* done iterating over vecstr */
7706 SvCUR(sv) = p - SvPVX(sv);
7714 #if defined(USE_ITHREADS)
7716 #if defined(USE_THREADS)
7717 # include "error: USE_THREADS and USE_ITHREADS are incompatible"
7720 #ifndef GpREFCNT_inc
7721 # define GpREFCNT_inc(gp) ((gp) ? (++(gp)->gp_refcnt, (gp)) : (GP*)NULL)
7725 #define sv_dup_inc(s) SvREFCNT_inc(sv_dup(s))
7726 #define av_dup(s) (AV*)sv_dup((SV*)s)
7727 #define av_dup_inc(s) (AV*)SvREFCNT_inc(sv_dup((SV*)s))
7728 #define hv_dup(s) (HV*)sv_dup((SV*)s)
7729 #define hv_dup_inc(s) (HV*)SvREFCNT_inc(sv_dup((SV*)s))
7730 #define cv_dup(s) (CV*)sv_dup((SV*)s)
7731 #define cv_dup_inc(s) (CV*)SvREFCNT_inc(sv_dup((SV*)s))
7732 #define io_dup(s) (IO*)sv_dup((SV*)s)
7733 #define io_dup_inc(s) (IO*)SvREFCNT_inc(sv_dup((SV*)s))
7734 #define gv_dup(s) (GV*)sv_dup((SV*)s)
7735 #define gv_dup_inc(s) (GV*)SvREFCNT_inc(sv_dup((SV*)s))
7736 #define SAVEPV(p) (p ? savepv(p) : Nullch)
7737 #define SAVEPVN(p,n) (p ? savepvn(p,n) : Nullch)
7740 Perl_re_dup(pTHX_ REGEXP *r)
7742 /* XXX fix when pmop->op_pmregexp becomes shared */
7743 return ReREFCNT_inc(r);
7747 Perl_fp_dup(pTHX_ PerlIO *fp, char type)
7751 return (PerlIO*)NULL;
7753 /* look for it in the table first */
7754 ret = (PerlIO*)ptr_table_fetch(PL_ptr_table, fp);
7758 /* create anew and remember what it is */
7759 ret = PerlIO_fdupopen(aTHX_ fp);
7760 ptr_table_store(PL_ptr_table, fp, ret);
7765 Perl_dirp_dup(pTHX_ DIR *dp)
7774 Perl_gp_dup(pTHX_ GP *gp)
7779 /* look for it in the table first */
7780 ret = (GP*)ptr_table_fetch(PL_ptr_table, gp);
7784 /* create anew and remember what it is */
7785 Newz(0, ret, 1, GP);
7786 ptr_table_store(PL_ptr_table, gp, ret);
7789 ret->gp_refcnt = 0; /* must be before any other dups! */
7790 ret->gp_sv = sv_dup_inc(gp->gp_sv);
7791 ret->gp_io = io_dup_inc(gp->gp_io);
7792 ret->gp_form = cv_dup_inc(gp->gp_form);
7793 ret->gp_av = av_dup_inc(gp->gp_av);
7794 ret->gp_hv = hv_dup_inc(gp->gp_hv);
7795 ret->gp_egv = gv_dup(gp->gp_egv); /* GvEGV is not refcounted */
7796 ret->gp_cv = cv_dup_inc(gp->gp_cv);
7797 ret->gp_cvgen = gp->gp_cvgen;
7798 ret->gp_flags = gp->gp_flags;
7799 ret->gp_line = gp->gp_line;
7800 ret->gp_file = gp->gp_file; /* points to COP.cop_file */
7805 Perl_mg_dup(pTHX_ MAGIC *mg)
7807 MAGIC *mgprev = (MAGIC*)NULL;
7810 return (MAGIC*)NULL;
7811 /* look for it in the table first */
7812 mgret = (MAGIC*)ptr_table_fetch(PL_ptr_table, mg);
7816 for (; mg; mg = mg->mg_moremagic) {
7818 Newz(0, nmg, 1, MAGIC);
7820 mgprev->mg_moremagic = nmg;
7823 nmg->mg_virtual = mg->mg_virtual; /* XXX copy dynamic vtable? */
7824 nmg->mg_private = mg->mg_private;
7825 nmg->mg_type = mg->mg_type;
7826 nmg->mg_flags = mg->mg_flags;
7827 if (mg->mg_type == PERL_MAGIC_qr) {
7828 nmg->mg_obj = (SV*)re_dup((REGEXP*)mg->mg_obj);
7831 nmg->mg_obj = (mg->mg_flags & MGf_REFCOUNTED)
7832 ? sv_dup_inc(mg->mg_obj)
7833 : sv_dup(mg->mg_obj);
7835 nmg->mg_len = mg->mg_len;
7836 nmg->mg_ptr = mg->mg_ptr; /* XXX random ptr? */
7837 if (mg->mg_ptr && mg->mg_type != PERL_MAGIC_regex_global) {
7838 if (mg->mg_len >= 0) {
7839 nmg->mg_ptr = SAVEPVN(mg->mg_ptr, mg->mg_len);
7840 if (mg->mg_type == PERL_MAGIC_overload_table &&
7841 AMT_AMAGIC((AMT*)mg->mg_ptr))
7843 AMT *amtp = (AMT*)mg->mg_ptr;
7844 AMT *namtp = (AMT*)nmg->mg_ptr;
7846 for (i = 1; i < NofAMmeth; i++) {
7847 namtp->table[i] = cv_dup_inc(amtp->table[i]);
7851 else if (mg->mg_len == HEf_SVKEY)
7852 nmg->mg_ptr = (char*)sv_dup_inc((SV*)mg->mg_ptr);
7860 Perl_ptr_table_new(pTHX)
7863 Newz(0, tbl, 1, PTR_TBL_t);
7866 Newz(0, tbl->tbl_ary, tbl->tbl_max + 1, PTR_TBL_ENT_t*);
7871 Perl_ptr_table_fetch(pTHX_ PTR_TBL_t *tbl, void *sv)
7873 PTR_TBL_ENT_t *tblent;
7874 UV hash = PTR2UV(sv);
7876 tblent = tbl->tbl_ary[hash & tbl->tbl_max];
7877 for (; tblent; tblent = tblent->next) {
7878 if (tblent->oldval == sv)
7879 return tblent->newval;
7885 Perl_ptr_table_store(pTHX_ PTR_TBL_t *tbl, void *oldv, void *newv)
7887 PTR_TBL_ENT_t *tblent, **otblent;
7888 /* XXX this may be pessimal on platforms where pointers aren't good
7889 * hash values e.g. if they grow faster in the most significant
7891 UV hash = PTR2UV(oldv);
7895 otblent = &tbl->tbl_ary[hash & tbl->tbl_max];
7896 for (tblent = *otblent; tblent; i=0, tblent = tblent->next) {
7897 if (tblent->oldval == oldv) {
7898 tblent->newval = newv;
7903 Newz(0, tblent, 1, PTR_TBL_ENT_t);
7904 tblent->oldval = oldv;
7905 tblent->newval = newv;
7906 tblent->next = *otblent;
7909 if (i && tbl->tbl_items > tbl->tbl_max)
7910 ptr_table_split(tbl);
7914 Perl_ptr_table_split(pTHX_ PTR_TBL_t *tbl)
7916 PTR_TBL_ENT_t **ary = tbl->tbl_ary;
7917 UV oldsize = tbl->tbl_max + 1;
7918 UV newsize = oldsize * 2;
7921 Renew(ary, newsize, PTR_TBL_ENT_t*);
7922 Zero(&ary[oldsize], newsize-oldsize, PTR_TBL_ENT_t*);
7923 tbl->tbl_max = --newsize;
7925 for (i=0; i < oldsize; i++, ary++) {
7926 PTR_TBL_ENT_t **curentp, **entp, *ent;
7929 curentp = ary + oldsize;
7930 for (entp = ary, ent = *ary; ent; ent = *entp) {
7931 if ((newsize & PTR2UV(ent->oldval)) != i) {
7933 ent->next = *curentp;
7944 Perl_ptr_table_clear(pTHX_ PTR_TBL_t *tbl)
7946 register PTR_TBL_ENT_t **array;
7947 register PTR_TBL_ENT_t *entry;
7948 register PTR_TBL_ENT_t *oentry = Null(PTR_TBL_ENT_t*);
7952 if (!tbl || !tbl->tbl_items) {
7956 array = tbl->tbl_ary;
7963 entry = entry->next;
7967 if (++riter > max) {
7970 entry = array[riter];
7978 Perl_ptr_table_free(pTHX_ PTR_TBL_t *tbl)
7983 ptr_table_clear(tbl);
7984 Safefree(tbl->tbl_ary);
7993 S_gv_share(pTHX_ SV *sstr)
7996 SV *sv = &PL_sv_no; /* just need SvREADONLY-ness */
7998 if (GvIO(gv) || GvFORM(gv)) {
7999 GvSHARED_off(gv); /* GvIOs cannot be shared. nor can GvFORMs */
8001 else if (!GvCV(gv)) {
8005 /* CvPADLISTs cannot be shared */
8006 if (!CvXSUB(GvCV(gv))) {
8011 if (!GvSHARED(gv)) {
8013 PerlIO_printf(Perl_debug_log, "gv_share: unable to share %s::%s\n",
8014 HvNAME(GvSTASH(gv)), GvNAME(gv));
8020 * write attempts will die with
8021 * "Modification of a read-only value attempted"
8027 SvREADONLY_on(GvSV(gv));
8034 SvREADONLY_on(GvAV(gv));
8041 SvREADONLY_on(GvAV(gv));
8044 return sstr; /* he_dup() will SvREFCNT_inc() */
8048 Perl_sv_dup(pTHX_ SV *sstr)
8052 if (!sstr || SvTYPE(sstr) == SVTYPEMASK)
8054 /* look for it in the table first */
8055 dstr = (SV*)ptr_table_fetch(PL_ptr_table, sstr);
8059 /* create anew and remember what it is */
8061 ptr_table_store(PL_ptr_table, sstr, dstr);
8064 SvFLAGS(dstr) = SvFLAGS(sstr);
8065 SvFLAGS(dstr) &= ~SVf_OOK; /* don't propagate OOK hack */
8066 SvREFCNT(dstr) = 0; /* must be before any other dups! */
8069 if (SvANY(sstr) && PL_watch_pvx && SvPVX(sstr) == PL_watch_pvx)
8070 PerlIO_printf(Perl_debug_log, "watch at %p hit, found string \"%s\"\n",
8071 PL_watch_pvx, SvPVX(sstr));
8074 switch (SvTYPE(sstr)) {
8079 SvANY(dstr) = new_XIV();
8080 SvIVX(dstr) = SvIVX(sstr);
8083 SvANY(dstr) = new_XNV();
8084 SvNVX(dstr) = SvNVX(sstr);
8087 SvANY(dstr) = new_XRV();
8088 SvRV(dstr) = SvRV(sstr) && SvWEAKREF(SvRV(sstr))
8089 ? sv_dup(SvRV(sstr))
8090 : sv_dup_inc(SvRV(sstr));
8093 SvANY(dstr) = new_XPV();
8094 SvCUR(dstr) = SvCUR(sstr);
8095 SvLEN(dstr) = SvLEN(sstr);
8097 SvRV(dstr) = SvWEAKREF(SvRV(sstr))
8098 ? sv_dup(SvRV(sstr))
8099 : sv_dup_inc(SvRV(sstr));
8100 else if (SvPVX(sstr) && SvLEN(sstr))
8101 SvPVX(dstr) = SAVEPVN(SvPVX(sstr), SvLEN(sstr)-1);
8103 SvPVX(dstr) = SvPVX(sstr); /* XXX shared string/random ptr? */
8106 SvANY(dstr) = new_XPVIV();
8107 SvCUR(dstr) = SvCUR(sstr);
8108 SvLEN(dstr) = SvLEN(sstr);
8109 SvIVX(dstr) = SvIVX(sstr);
8111 SvRV(dstr) = SvWEAKREF(SvRV(sstr))
8112 ? sv_dup(SvRV(sstr))
8113 : sv_dup_inc(SvRV(sstr));
8114 else if (SvPVX(sstr) && SvLEN(sstr))
8115 SvPVX(dstr) = SAVEPVN(SvPVX(sstr), SvLEN(sstr)-1);
8117 SvPVX(dstr) = SvPVX(sstr); /* XXX shared string/random ptr? */
8120 SvANY(dstr) = new_XPVNV();
8121 SvCUR(dstr) = SvCUR(sstr);
8122 SvLEN(dstr) = SvLEN(sstr);
8123 SvIVX(dstr) = SvIVX(sstr);
8124 SvNVX(dstr) = SvNVX(sstr);
8126 SvRV(dstr) = SvWEAKREF(SvRV(sstr))
8127 ? sv_dup(SvRV(sstr))
8128 : sv_dup_inc(SvRV(sstr));
8129 else if (SvPVX(sstr) && SvLEN(sstr))
8130 SvPVX(dstr) = SAVEPVN(SvPVX(sstr), SvLEN(sstr)-1);
8132 SvPVX(dstr) = SvPVX(sstr); /* XXX shared string/random ptr? */
8135 SvANY(dstr) = new_XPVMG();
8136 SvCUR(dstr) = SvCUR(sstr);
8137 SvLEN(dstr) = SvLEN(sstr);
8138 SvIVX(dstr) = SvIVX(sstr);
8139 SvNVX(dstr) = SvNVX(sstr);
8140 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr));
8141 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr));
8143 SvRV(dstr) = SvWEAKREF(SvRV(sstr))
8144 ? sv_dup(SvRV(sstr))
8145 : sv_dup_inc(SvRV(sstr));
8146 else if (SvPVX(sstr) && SvLEN(sstr))
8147 SvPVX(dstr) = SAVEPVN(SvPVX(sstr), SvLEN(sstr)-1);
8149 SvPVX(dstr) = SvPVX(sstr); /* XXX shared string/random ptr? */
8152 SvANY(dstr) = new_XPVBM();
8153 SvCUR(dstr) = SvCUR(sstr);
8154 SvLEN(dstr) = SvLEN(sstr);
8155 SvIVX(dstr) = SvIVX(sstr);
8156 SvNVX(dstr) = SvNVX(sstr);
8157 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr));
8158 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr));
8160 SvRV(dstr) = SvWEAKREF(SvRV(sstr))
8161 ? sv_dup(SvRV(sstr))
8162 : sv_dup_inc(SvRV(sstr));
8163 else if (SvPVX(sstr) && SvLEN(sstr))
8164 SvPVX(dstr) = SAVEPVN(SvPVX(sstr), SvLEN(sstr)-1);
8166 SvPVX(dstr) = SvPVX(sstr); /* XXX shared string/random ptr? */
8167 BmRARE(dstr) = BmRARE(sstr);
8168 BmUSEFUL(dstr) = BmUSEFUL(sstr);
8169 BmPREVIOUS(dstr)= BmPREVIOUS(sstr);
8172 SvANY(dstr) = new_XPVLV();
8173 SvCUR(dstr) = SvCUR(sstr);
8174 SvLEN(dstr) = SvLEN(sstr);
8175 SvIVX(dstr) = SvIVX(sstr);
8176 SvNVX(dstr) = SvNVX(sstr);
8177 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr));
8178 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr));
8180 SvRV(dstr) = SvWEAKREF(SvRV(sstr))
8181 ? sv_dup(SvRV(sstr))
8182 : sv_dup_inc(SvRV(sstr));
8183 else if (SvPVX(sstr) && SvLEN(sstr))
8184 SvPVX(dstr) = SAVEPVN(SvPVX(sstr), SvLEN(sstr)-1);
8186 SvPVX(dstr) = SvPVX(sstr); /* XXX shared string/random ptr? */
8187 LvTARGOFF(dstr) = LvTARGOFF(sstr); /* XXX sometimes holds PMOP* when DEBUGGING */
8188 LvTARGLEN(dstr) = LvTARGLEN(sstr);
8189 LvTARG(dstr) = sv_dup_inc(LvTARG(sstr));
8190 LvTYPE(dstr) = LvTYPE(sstr);
8193 if (GvSHARED((GV*)sstr)) {
8195 if ((share = gv_share(sstr))) {
8199 PerlIO_printf(Perl_debug_log, "sv_dup: sharing %s::%s\n",
8200 HvNAME(GvSTASH(share)), GvNAME(share));
8205 SvANY(dstr) = new_XPVGV();
8206 SvCUR(dstr) = SvCUR(sstr);
8207 SvLEN(dstr) = SvLEN(sstr);
8208 SvIVX(dstr) = SvIVX(sstr);
8209 SvNVX(dstr) = SvNVX(sstr);
8210 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr));
8211 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr));
8213 SvRV(dstr) = SvWEAKREF(SvRV(sstr))
8214 ? sv_dup(SvRV(sstr))
8215 : sv_dup_inc(SvRV(sstr));
8216 else if (SvPVX(sstr) && SvLEN(sstr))
8217 SvPVX(dstr) = SAVEPVN(SvPVX(sstr), SvLEN(sstr)-1);
8219 SvPVX(dstr) = SvPVX(sstr); /* XXX shared string/random ptr? */
8220 GvNAMELEN(dstr) = GvNAMELEN(sstr);
8221 GvNAME(dstr) = SAVEPVN(GvNAME(sstr), GvNAMELEN(sstr));
8222 GvSTASH(dstr) = hv_dup_inc(GvSTASH(sstr));
8223 GvFLAGS(dstr) = GvFLAGS(sstr);
8224 GvGP(dstr) = gp_dup(GvGP(sstr));
8225 (void)GpREFCNT_inc(GvGP(dstr));
8228 SvANY(dstr) = new_XPVIO();
8229 SvCUR(dstr) = SvCUR(sstr);
8230 SvLEN(dstr) = SvLEN(sstr);
8231 SvIVX(dstr) = SvIVX(sstr);
8232 SvNVX(dstr) = SvNVX(sstr);
8233 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr));
8234 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr));
8236 SvRV(dstr) = SvWEAKREF(SvRV(sstr))
8237 ? sv_dup(SvRV(sstr))
8238 : sv_dup_inc(SvRV(sstr));
8239 else if (SvPVX(sstr) && SvLEN(sstr))
8240 SvPVX(dstr) = SAVEPVN(SvPVX(sstr), SvLEN(sstr)-1);
8242 SvPVX(dstr) = SvPVX(sstr); /* XXX shared string/random ptr? */
8243 IoIFP(dstr) = fp_dup(IoIFP(sstr), IoTYPE(sstr));
8244 if (IoOFP(sstr) == IoIFP(sstr))
8245 IoOFP(dstr) = IoIFP(dstr);
8247 IoOFP(dstr) = fp_dup(IoOFP(sstr), IoTYPE(sstr));
8248 /* PL_rsfp_filters entries have fake IoDIRP() */
8249 if (IoDIRP(sstr) && !(IoFLAGS(sstr) & IOf_FAKE_DIRP))
8250 IoDIRP(dstr) = dirp_dup(IoDIRP(sstr));
8252 IoDIRP(dstr) = IoDIRP(sstr);
8253 IoLINES(dstr) = IoLINES(sstr);
8254 IoPAGE(dstr) = IoPAGE(sstr);
8255 IoPAGE_LEN(dstr) = IoPAGE_LEN(sstr);
8256 IoLINES_LEFT(dstr) = IoLINES_LEFT(sstr);
8257 IoTOP_NAME(dstr) = SAVEPV(IoTOP_NAME(sstr));
8258 IoTOP_GV(dstr) = gv_dup(IoTOP_GV(sstr));
8259 IoFMT_NAME(dstr) = SAVEPV(IoFMT_NAME(sstr));
8260 IoFMT_GV(dstr) = gv_dup(IoFMT_GV(sstr));
8261 IoBOTTOM_NAME(dstr) = SAVEPV(IoBOTTOM_NAME(sstr));
8262 IoBOTTOM_GV(dstr) = gv_dup(IoBOTTOM_GV(sstr));
8263 IoSUBPROCESS(dstr) = IoSUBPROCESS(sstr);
8264 IoTYPE(dstr) = IoTYPE(sstr);
8265 IoFLAGS(dstr) = IoFLAGS(sstr);
8268 SvANY(dstr) = new_XPVAV();
8269 SvCUR(dstr) = SvCUR(sstr);
8270 SvLEN(dstr) = SvLEN(sstr);
8271 SvIVX(dstr) = SvIVX(sstr);
8272 SvNVX(dstr) = SvNVX(sstr);
8273 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr));
8274 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr));
8275 AvARYLEN((AV*)dstr) = sv_dup_inc(AvARYLEN((AV*)sstr));
8276 AvFLAGS((AV*)dstr) = AvFLAGS((AV*)sstr);
8277 if (AvARRAY((AV*)sstr)) {
8278 SV **dst_ary, **src_ary;
8279 SSize_t items = AvFILLp((AV*)sstr) + 1;
8281 src_ary = AvARRAY((AV*)sstr);
8282 Newz(0, dst_ary, AvMAX((AV*)sstr)+1, SV*);
8283 ptr_table_store(PL_ptr_table, src_ary, dst_ary);
8284 SvPVX(dstr) = (char*)dst_ary;
8285 AvALLOC((AV*)dstr) = dst_ary;
8286 if (AvREAL((AV*)sstr)) {
8288 *dst_ary++ = sv_dup_inc(*src_ary++);
8292 *dst_ary++ = sv_dup(*src_ary++);
8294 items = AvMAX((AV*)sstr) - AvFILLp((AV*)sstr);
8295 while (items-- > 0) {
8296 *dst_ary++ = &PL_sv_undef;
8300 SvPVX(dstr) = Nullch;
8301 AvALLOC((AV*)dstr) = (SV**)NULL;
8305 SvANY(dstr) = new_XPVHV();
8306 SvCUR(dstr) = SvCUR(sstr);
8307 SvLEN(dstr) = SvLEN(sstr);
8308 SvIVX(dstr) = SvIVX(sstr);
8309 SvNVX(dstr) = SvNVX(sstr);
8310 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr));
8311 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr));
8312 HvRITER((HV*)dstr) = HvRITER((HV*)sstr);
8313 if (HvARRAY((HV*)sstr)) {
8315 XPVHV *dxhv = (XPVHV*)SvANY(dstr);
8316 XPVHV *sxhv = (XPVHV*)SvANY(sstr);
8317 Newz(0, dxhv->xhv_array,
8318 PERL_HV_ARRAY_ALLOC_BYTES(dxhv->xhv_max+1), char);
8319 while (i <= sxhv->xhv_max) {
8320 ((HE**)dxhv->xhv_array)[i] = he_dup(((HE**)sxhv->xhv_array)[i],
8321 !!HvSHAREKEYS(sstr));
8324 dxhv->xhv_eiter = he_dup(sxhv->xhv_eiter, !!HvSHAREKEYS(sstr));
8327 SvPVX(dstr) = Nullch;
8328 HvEITER((HV*)dstr) = (HE*)NULL;
8330 HvPMROOT((HV*)dstr) = HvPMROOT((HV*)sstr); /* XXX */
8331 HvNAME((HV*)dstr) = SAVEPV(HvNAME((HV*)sstr));
8334 SvANY(dstr) = new_XPVFM();
8335 FmLINES(dstr) = FmLINES(sstr);
8339 SvANY(dstr) = new_XPVCV();
8341 SvCUR(dstr) = SvCUR(sstr);
8342 SvLEN(dstr) = SvLEN(sstr);
8343 SvIVX(dstr) = SvIVX(sstr);
8344 SvNVX(dstr) = SvNVX(sstr);
8345 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr));
8346 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr));
8347 if (SvPVX(sstr) && SvLEN(sstr))
8348 SvPVX(dstr) = SAVEPVN(SvPVX(sstr), SvLEN(sstr)-1);
8350 SvPVX(dstr) = SvPVX(sstr); /* XXX shared string/random ptr? */
8351 CvSTASH(dstr) = hv_dup(CvSTASH(sstr));/* NOTE: not refcounted */
8352 CvSTART(dstr) = CvSTART(sstr);
8353 CvROOT(dstr) = OpREFCNT_inc(CvROOT(sstr));
8354 CvXSUB(dstr) = CvXSUB(sstr);
8355 CvXSUBANY(dstr) = CvXSUBANY(sstr);
8356 CvGV(dstr) = gv_dup(CvGV(sstr));
8357 CvDEPTH(dstr) = CvDEPTH(sstr);
8358 if (CvPADLIST(sstr) && !AvREAL(CvPADLIST(sstr))) {
8359 /* XXX padlists are real, but pretend to be not */
8360 AvREAL_on(CvPADLIST(sstr));
8361 CvPADLIST(dstr) = av_dup_inc(CvPADLIST(sstr));
8362 AvREAL_off(CvPADLIST(sstr));
8363 AvREAL_off(CvPADLIST(dstr));
8366 CvPADLIST(dstr) = av_dup_inc(CvPADLIST(sstr));
8367 if (!CvANON(sstr) || CvCLONED(sstr))
8368 CvOUTSIDE(dstr) = cv_dup_inc(CvOUTSIDE(sstr));
8370 CvOUTSIDE(dstr) = cv_dup(CvOUTSIDE(sstr));
8371 CvFLAGS(dstr) = CvFLAGS(sstr);
8374 Perl_croak(aTHX_ "Bizarre SvTYPE [%d]", SvTYPE(sstr));
8378 if (SvOBJECT(dstr) && SvTYPE(dstr) != SVt_PVIO)
8385 Perl_cx_dup(pTHX_ PERL_CONTEXT *cxs, I32 ix, I32 max)
8390 return (PERL_CONTEXT*)NULL;
8392 /* look for it in the table first */
8393 ncxs = (PERL_CONTEXT*)ptr_table_fetch(PL_ptr_table, cxs);
8397 /* create anew and remember what it is */
8398 Newz(56, ncxs, max + 1, PERL_CONTEXT);
8399 ptr_table_store(PL_ptr_table, cxs, ncxs);
8402 PERL_CONTEXT *cx = &cxs[ix];
8403 PERL_CONTEXT *ncx = &ncxs[ix];
8404 ncx->cx_type = cx->cx_type;
8405 if (CxTYPE(cx) == CXt_SUBST) {
8406 Perl_croak(aTHX_ "Cloning substitution context is unimplemented");
8409 ncx->blk_oldsp = cx->blk_oldsp;
8410 ncx->blk_oldcop = cx->blk_oldcop;
8411 ncx->blk_oldretsp = cx->blk_oldretsp;
8412 ncx->blk_oldmarksp = cx->blk_oldmarksp;
8413 ncx->blk_oldscopesp = cx->blk_oldscopesp;
8414 ncx->blk_oldpm = cx->blk_oldpm;
8415 ncx->blk_gimme = cx->blk_gimme;
8416 switch (CxTYPE(cx)) {
8418 ncx->blk_sub.cv = (cx->blk_sub.olddepth == 0
8419 ? cv_dup_inc(cx->blk_sub.cv)
8420 : cv_dup(cx->blk_sub.cv));
8421 ncx->blk_sub.argarray = (cx->blk_sub.hasargs
8422 ? av_dup_inc(cx->blk_sub.argarray)
8424 ncx->blk_sub.savearray = av_dup_inc(cx->blk_sub.savearray);
8425 ncx->blk_sub.olddepth = cx->blk_sub.olddepth;
8426 ncx->blk_sub.hasargs = cx->blk_sub.hasargs;
8427 ncx->blk_sub.lval = cx->blk_sub.lval;
8430 ncx->blk_eval.old_in_eval = cx->blk_eval.old_in_eval;
8431 ncx->blk_eval.old_op_type = cx->blk_eval.old_op_type;
8432 ncx->blk_eval.old_namesv = sv_dup_inc(cx->blk_eval.old_namesv);
8433 ncx->blk_eval.old_eval_root = cx->blk_eval.old_eval_root;
8434 ncx->blk_eval.cur_text = sv_dup(cx->blk_eval.cur_text);
8437 ncx->blk_loop.label = cx->blk_loop.label;
8438 ncx->blk_loop.resetsp = cx->blk_loop.resetsp;
8439 ncx->blk_loop.redo_op = cx->blk_loop.redo_op;
8440 ncx->blk_loop.next_op = cx->blk_loop.next_op;
8441 ncx->blk_loop.last_op = cx->blk_loop.last_op;
8442 ncx->blk_loop.iterdata = (CxPADLOOP(cx)
8443 ? cx->blk_loop.iterdata
8444 : gv_dup((GV*)cx->blk_loop.iterdata));
8445 ncx->blk_loop.oldcurpad
8446 = (SV**)ptr_table_fetch(PL_ptr_table,
8447 cx->blk_loop.oldcurpad);
8448 ncx->blk_loop.itersave = sv_dup_inc(cx->blk_loop.itersave);
8449 ncx->blk_loop.iterlval = sv_dup_inc(cx->blk_loop.iterlval);
8450 ncx->blk_loop.iterary = av_dup_inc(cx->blk_loop.iterary);
8451 ncx->blk_loop.iterix = cx->blk_loop.iterix;
8452 ncx->blk_loop.itermax = cx->blk_loop.itermax;
8455 ncx->blk_sub.cv = cv_dup(cx->blk_sub.cv);
8456 ncx->blk_sub.gv = gv_dup(cx->blk_sub.gv);
8457 ncx->blk_sub.dfoutgv = gv_dup_inc(cx->blk_sub.dfoutgv);
8458 ncx->blk_sub.hasargs = cx->blk_sub.hasargs;
8471 Perl_si_dup(pTHX_ PERL_SI *si)
8476 return (PERL_SI*)NULL;
8478 /* look for it in the table first */
8479 nsi = (PERL_SI*)ptr_table_fetch(PL_ptr_table, si);
8483 /* create anew and remember what it is */
8484 Newz(56, nsi, 1, PERL_SI);
8485 ptr_table_store(PL_ptr_table, si, nsi);
8487 nsi->si_stack = av_dup_inc(si->si_stack);
8488 nsi->si_cxix = si->si_cxix;
8489 nsi->si_cxmax = si->si_cxmax;
8490 nsi->si_cxstack = cx_dup(si->si_cxstack, si->si_cxix, si->si_cxmax);
8491 nsi->si_type = si->si_type;
8492 nsi->si_prev = si_dup(si->si_prev);
8493 nsi->si_next = si_dup(si->si_next);
8494 nsi->si_markoff = si->si_markoff;
8499 #define POPINT(ss,ix) ((ss)[--(ix)].any_i32)
8500 #define TOPINT(ss,ix) ((ss)[ix].any_i32)
8501 #define POPLONG(ss,ix) ((ss)[--(ix)].any_long)
8502 #define TOPLONG(ss,ix) ((ss)[ix].any_long)
8503 #define POPIV(ss,ix) ((ss)[--(ix)].any_iv)
8504 #define TOPIV(ss,ix) ((ss)[ix].any_iv)
8505 #define POPPTR(ss,ix) ((ss)[--(ix)].any_ptr)
8506 #define TOPPTR(ss,ix) ((ss)[ix].any_ptr)
8507 #define POPDPTR(ss,ix) ((ss)[--(ix)].any_dptr)
8508 #define TOPDPTR(ss,ix) ((ss)[ix].any_dptr)
8509 #define POPDXPTR(ss,ix) ((ss)[--(ix)].any_dxptr)
8510 #define TOPDXPTR(ss,ix) ((ss)[ix].any_dxptr)
8513 #define pv_dup_inc(p) SAVEPV(p)
8514 #define pv_dup(p) SAVEPV(p)
8515 #define svp_dup_inc(p,pp) any_dup(p,pp)
8518 Perl_any_dup(pTHX_ void *v, PerlInterpreter *proto_perl)
8525 /* look for it in the table first */
8526 ret = ptr_table_fetch(PL_ptr_table, v);
8530 /* see if it is part of the interpreter structure */
8531 if (v >= (void*)proto_perl && v < (void*)(proto_perl+1))
8532 ret = (void*)(((char*)aTHXo) + (((char*)v) - (char*)proto_perl));
8540 Perl_ss_dup(pTHX_ PerlInterpreter *proto_perl)
8542 ANY *ss = proto_perl->Tsavestack;
8543 I32 ix = proto_perl->Tsavestack_ix;
8544 I32 max = proto_perl->Tsavestack_max;
8557 void (*dptr) (void*);
8558 void (*dxptr) (pTHXo_ void*);
8561 Newz(54, nss, max, ANY);
8567 case SAVEt_ITEM: /* normal string */
8568 sv = (SV*)POPPTR(ss,ix);
8569 TOPPTR(nss,ix) = sv_dup_inc(sv);
8570 sv = (SV*)POPPTR(ss,ix);
8571 TOPPTR(nss,ix) = sv_dup_inc(sv);
8573 case SAVEt_SV: /* scalar reference */
8574 sv = (SV*)POPPTR(ss,ix);
8575 TOPPTR(nss,ix) = sv_dup_inc(sv);
8576 gv = (GV*)POPPTR(ss,ix);
8577 TOPPTR(nss,ix) = gv_dup_inc(gv);
8579 case SAVEt_GENERIC_PVREF: /* generic char* */
8580 c = (char*)POPPTR(ss,ix);
8581 TOPPTR(nss,ix) = pv_dup(c);
8582 ptr = POPPTR(ss,ix);
8583 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
8585 case SAVEt_GENERIC_SVREF: /* generic sv */
8586 case SAVEt_SVREF: /* scalar reference */
8587 sv = (SV*)POPPTR(ss,ix);
8588 TOPPTR(nss,ix) = sv_dup_inc(sv);
8589 ptr = POPPTR(ss,ix);
8590 TOPPTR(nss,ix) = svp_dup_inc((SV**)ptr, proto_perl);/* XXXXX */
8592 case SAVEt_AV: /* array reference */
8593 av = (AV*)POPPTR(ss,ix);
8594 TOPPTR(nss,ix) = av_dup_inc(av);
8595 gv = (GV*)POPPTR(ss,ix);
8596 TOPPTR(nss,ix) = gv_dup(gv);
8598 case SAVEt_HV: /* hash reference */
8599 hv = (HV*)POPPTR(ss,ix);
8600 TOPPTR(nss,ix) = hv_dup_inc(hv);
8601 gv = (GV*)POPPTR(ss,ix);
8602 TOPPTR(nss,ix) = gv_dup(gv);
8604 case SAVEt_INT: /* int reference */
8605 ptr = POPPTR(ss,ix);
8606 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
8607 intval = (int)POPINT(ss,ix);
8608 TOPINT(nss,ix) = intval;
8610 case SAVEt_LONG: /* long reference */
8611 ptr = POPPTR(ss,ix);
8612 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
8613 longval = (long)POPLONG(ss,ix);
8614 TOPLONG(nss,ix) = longval;
8616 case SAVEt_I32: /* I32 reference */
8617 case SAVEt_I16: /* I16 reference */
8618 case SAVEt_I8: /* I8 reference */
8619 ptr = POPPTR(ss,ix);
8620 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
8624 case SAVEt_IV: /* IV reference */
8625 ptr = POPPTR(ss,ix);
8626 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
8630 case SAVEt_SPTR: /* SV* reference */
8631 ptr = POPPTR(ss,ix);
8632 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
8633 sv = (SV*)POPPTR(ss,ix);
8634 TOPPTR(nss,ix) = sv_dup(sv);
8636 case SAVEt_VPTR: /* random* reference */
8637 ptr = POPPTR(ss,ix);
8638 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
8639 ptr = POPPTR(ss,ix);
8640 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
8642 case SAVEt_PPTR: /* char* reference */
8643 ptr = POPPTR(ss,ix);
8644 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
8645 c = (char*)POPPTR(ss,ix);
8646 TOPPTR(nss,ix) = pv_dup(c);
8648 case SAVEt_HPTR: /* HV* reference */
8649 ptr = POPPTR(ss,ix);
8650 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
8651 hv = (HV*)POPPTR(ss,ix);
8652 TOPPTR(nss,ix) = hv_dup(hv);
8654 case SAVEt_APTR: /* AV* reference */
8655 ptr = POPPTR(ss,ix);
8656 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
8657 av = (AV*)POPPTR(ss,ix);
8658 TOPPTR(nss,ix) = av_dup(av);
8661 gv = (GV*)POPPTR(ss,ix);
8662 TOPPTR(nss,ix) = gv_dup(gv);
8664 case SAVEt_GP: /* scalar reference */
8665 gp = (GP*)POPPTR(ss,ix);
8666 TOPPTR(nss,ix) = gp = gp_dup(gp);
8667 (void)GpREFCNT_inc(gp);
8668 gv = (GV*)POPPTR(ss,ix);
8669 TOPPTR(nss,ix) = gv_dup_inc(c);
8670 c = (char*)POPPTR(ss,ix);
8671 TOPPTR(nss,ix) = pv_dup(c);
8678 case SAVEt_MORTALIZESV:
8679 sv = (SV*)POPPTR(ss,ix);
8680 TOPPTR(nss,ix) = sv_dup_inc(sv);
8683 ptr = POPPTR(ss,ix);
8684 if (ptr && (((OP*)ptr)->op_private & OPpREFCOUNTED)) {
8685 /* these are assumed to be refcounted properly */
8686 switch (((OP*)ptr)->op_type) {
8693 TOPPTR(nss,ix) = ptr;
8698 TOPPTR(nss,ix) = Nullop;
8703 TOPPTR(nss,ix) = Nullop;
8706 c = (char*)POPPTR(ss,ix);
8707 TOPPTR(nss,ix) = pv_dup_inc(c);
8710 longval = POPLONG(ss,ix);
8711 TOPLONG(nss,ix) = longval;
8714 hv = (HV*)POPPTR(ss,ix);
8715 TOPPTR(nss,ix) = hv_dup_inc(hv);
8716 c = (char*)POPPTR(ss,ix);
8717 TOPPTR(nss,ix) = pv_dup_inc(c);
8721 case SAVEt_DESTRUCTOR:
8722 ptr = POPPTR(ss,ix);
8723 TOPPTR(nss,ix) = any_dup(ptr, proto_perl); /* XXX quite arbitrary */
8724 dptr = POPDPTR(ss,ix);
8725 TOPDPTR(nss,ix) = (void (*)(void*))any_dup((void *)dptr, proto_perl);
8727 case SAVEt_DESTRUCTOR_X:
8728 ptr = POPPTR(ss,ix);
8729 TOPPTR(nss,ix) = any_dup(ptr, proto_perl); /* XXX quite arbitrary */
8730 dxptr = POPDXPTR(ss,ix);
8731 TOPDXPTR(nss,ix) = (void (*)(pTHXo_ void*))any_dup((void *)dxptr, proto_perl);
8733 case SAVEt_REGCONTEXT:
8739 case SAVEt_STACK_POS: /* Position on Perl stack */
8743 case SAVEt_AELEM: /* array element */
8744 sv = (SV*)POPPTR(ss,ix);
8745 TOPPTR(nss,ix) = sv_dup_inc(sv);
8748 av = (AV*)POPPTR(ss,ix);
8749 TOPPTR(nss,ix) = av_dup_inc(av);
8751 case SAVEt_HELEM: /* hash element */
8752 sv = (SV*)POPPTR(ss,ix);
8753 TOPPTR(nss,ix) = sv_dup_inc(sv);
8754 sv = (SV*)POPPTR(ss,ix);
8755 TOPPTR(nss,ix) = sv_dup_inc(sv);
8756 hv = (HV*)POPPTR(ss,ix);
8757 TOPPTR(nss,ix) = hv_dup_inc(hv);
8760 ptr = POPPTR(ss,ix);
8761 TOPPTR(nss,ix) = ptr;
8768 av = (AV*)POPPTR(ss,ix);
8769 TOPPTR(nss,ix) = av_dup(av);
8772 longval = (long)POPLONG(ss,ix);
8773 TOPLONG(nss,ix) = longval;
8774 ptr = POPPTR(ss,ix);
8775 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
8776 sv = (SV*)POPPTR(ss,ix);
8777 TOPPTR(nss,ix) = sv_dup(sv);
8780 Perl_croak(aTHX_ "panic: ss_dup inconsistency");
8792 perl_clone(PerlInterpreter *proto_perl, UV flags)
8795 CPerlObj *pPerl = (CPerlObj*)proto_perl;
8798 #ifdef PERL_IMPLICIT_SYS
8799 return perl_clone_using(proto_perl, flags,
8801 proto_perl->IMemShared,
8802 proto_perl->IMemParse,
8812 perl_clone_using(PerlInterpreter *proto_perl, UV flags,
8813 struct IPerlMem* ipM, struct IPerlMem* ipMS,
8814 struct IPerlMem* ipMP, struct IPerlEnv* ipE,
8815 struct IPerlStdIO* ipStd, struct IPerlLIO* ipLIO,
8816 struct IPerlDir* ipD, struct IPerlSock* ipS,
8817 struct IPerlProc* ipP)
8819 /* XXX many of the string copies here can be optimized if they're
8820 * constants; they need to be allocated as common memory and just
8821 * their pointers copied. */
8825 CPerlObj *pPerl = new(ipM) CPerlObj(ipM, ipMS, ipMP, ipE, ipStd, ipLIO,
8827 PERL_SET_THX(pPerl);
8828 # else /* !PERL_OBJECT */
8829 PerlInterpreter *my_perl = (PerlInterpreter*)(*ipM->pMalloc)(ipM, sizeof(PerlInterpreter));
8830 PERL_SET_THX(my_perl);
8833 memset(my_perl, 0xab, sizeof(PerlInterpreter));
8839 # else /* !DEBUGGING */
8840 Zero(my_perl, 1, PerlInterpreter);
8841 # endif /* DEBUGGING */
8845 PL_MemShared = ipMS;
8853 # endif /* PERL_OBJECT */
8854 #else /* !PERL_IMPLICIT_SYS */
8856 PerlInterpreter *my_perl = (PerlInterpreter*)PerlMem_malloc(sizeof(PerlInterpreter));
8857 PERL_SET_THX(my_perl);
8860 memset(my_perl, 0xab, sizeof(PerlInterpreter));
8866 # else /* !DEBUGGING */
8867 Zero(my_perl, 1, PerlInterpreter);
8868 # endif /* DEBUGGING */
8869 #endif /* PERL_IMPLICIT_SYS */
8872 PL_xiv_arenaroot = NULL;
8874 PL_xnv_arenaroot = NULL;
8876 PL_xrv_arenaroot = NULL;
8878 PL_xpv_arenaroot = NULL;
8880 PL_xpviv_arenaroot = NULL;
8881 PL_xpviv_root = NULL;
8882 PL_xpvnv_arenaroot = NULL;
8883 PL_xpvnv_root = NULL;
8884 PL_xpvcv_arenaroot = NULL;
8885 PL_xpvcv_root = NULL;
8886 PL_xpvav_arenaroot = NULL;
8887 PL_xpvav_root = NULL;
8888 PL_xpvhv_arenaroot = NULL;
8889 PL_xpvhv_root = NULL;
8890 PL_xpvmg_arenaroot = NULL;
8891 PL_xpvmg_root = NULL;
8892 PL_xpvlv_arenaroot = NULL;
8893 PL_xpvlv_root = NULL;
8894 PL_xpvbm_arenaroot = NULL;
8895 PL_xpvbm_root = NULL;
8896 PL_he_arenaroot = NULL;
8898 PL_nice_chunk = NULL;
8899 PL_nice_chunk_size = 0;
8902 PL_sv_root = Nullsv;
8903 PL_sv_arenaroot = Nullsv;
8905 PL_debug = proto_perl->Idebug;
8907 /* create SV map for pointer relocation */
8908 PL_ptr_table = ptr_table_new();
8910 /* initialize these special pointers as early as possible */
8911 SvANY(&PL_sv_undef) = NULL;
8912 SvREFCNT(&PL_sv_undef) = (~(U32)0)/2;
8913 SvFLAGS(&PL_sv_undef) = SVf_READONLY|SVt_NULL;
8914 ptr_table_store(PL_ptr_table, &proto_perl->Isv_undef, &PL_sv_undef);
8917 SvUPGRADE(&PL_sv_no, SVt_PVNV);
8919 SvANY(&PL_sv_no) = new_XPVNV();
8921 SvREFCNT(&PL_sv_no) = (~(U32)0)/2;
8922 SvFLAGS(&PL_sv_no) = SVp_NOK|SVf_NOK|SVp_POK|SVf_POK|SVf_READONLY|SVt_PVNV;
8923 SvPVX(&PL_sv_no) = SAVEPVN(PL_No, 0);
8924 SvCUR(&PL_sv_no) = 0;
8925 SvLEN(&PL_sv_no) = 1;
8926 SvNVX(&PL_sv_no) = 0;
8927 ptr_table_store(PL_ptr_table, &proto_perl->Isv_no, &PL_sv_no);
8930 SvUPGRADE(&PL_sv_yes, SVt_PVNV);
8932 SvANY(&PL_sv_yes) = new_XPVNV();
8934 SvREFCNT(&PL_sv_yes) = (~(U32)0)/2;
8935 SvFLAGS(&PL_sv_yes) = SVp_NOK|SVf_NOK|SVp_POK|SVf_POK|SVf_READONLY|SVt_PVNV;
8936 SvPVX(&PL_sv_yes) = SAVEPVN(PL_Yes, 1);
8937 SvCUR(&PL_sv_yes) = 1;
8938 SvLEN(&PL_sv_yes) = 2;
8939 SvNVX(&PL_sv_yes) = 1;
8940 ptr_table_store(PL_ptr_table, &proto_perl->Isv_yes, &PL_sv_yes);
8942 /* create shared string table */
8943 PL_strtab = newHV();
8944 HvSHAREKEYS_off(PL_strtab);
8945 hv_ksplit(PL_strtab, 512);
8946 ptr_table_store(PL_ptr_table, proto_perl->Istrtab, PL_strtab);
8948 PL_compiling = proto_perl->Icompiling;
8949 PL_compiling.cop_stashpv = SAVEPV(PL_compiling.cop_stashpv);
8950 PL_compiling.cop_file = SAVEPV(PL_compiling.cop_file);
8951 ptr_table_store(PL_ptr_table, &proto_perl->Icompiling, &PL_compiling);
8952 if (!specialWARN(PL_compiling.cop_warnings))
8953 PL_compiling.cop_warnings = sv_dup_inc(PL_compiling.cop_warnings);
8954 if (!specialCopIO(PL_compiling.cop_io))
8955 PL_compiling.cop_io = sv_dup_inc(PL_compiling.cop_io);
8956 PL_curcop = (COP*)any_dup(proto_perl->Tcurcop, proto_perl);
8958 /* pseudo environmental stuff */
8959 PL_origargc = proto_perl->Iorigargc;
8961 New(0, PL_origargv, i+1, char*);
8962 PL_origargv[i] = '\0';
8964 PL_origargv[i] = SAVEPV(proto_perl->Iorigargv[i]);
8966 PL_envgv = gv_dup(proto_perl->Ienvgv);
8967 PL_incgv = gv_dup(proto_perl->Iincgv);
8968 PL_hintgv = gv_dup(proto_perl->Ihintgv);
8969 PL_origfilename = SAVEPV(proto_perl->Iorigfilename);
8970 PL_diehook = sv_dup_inc(proto_perl->Idiehook);
8971 PL_warnhook = sv_dup_inc(proto_perl->Iwarnhook);
8974 PL_minus_c = proto_perl->Iminus_c;
8975 PL_patchlevel = sv_dup_inc(proto_perl->Ipatchlevel);
8976 PL_localpatches = proto_perl->Ilocalpatches;
8977 PL_splitstr = proto_perl->Isplitstr;
8978 PL_preprocess = proto_perl->Ipreprocess;
8979 PL_minus_n = proto_perl->Iminus_n;
8980 PL_minus_p = proto_perl->Iminus_p;
8981 PL_minus_l = proto_perl->Iminus_l;
8982 PL_minus_a = proto_perl->Iminus_a;
8983 PL_minus_F = proto_perl->Iminus_F;
8984 PL_doswitches = proto_perl->Idoswitches;
8985 PL_dowarn = proto_perl->Idowarn;
8986 PL_doextract = proto_perl->Idoextract;
8987 PL_sawampersand = proto_perl->Isawampersand;
8988 PL_unsafe = proto_perl->Iunsafe;
8989 PL_inplace = SAVEPV(proto_perl->Iinplace);
8990 PL_e_script = sv_dup_inc(proto_perl->Ie_script);
8991 PL_perldb = proto_perl->Iperldb;
8992 PL_perl_destruct_level = proto_perl->Iperl_destruct_level;
8994 /* magical thingies */
8995 /* XXX time(&PL_basetime) when asked for? */
8996 PL_basetime = proto_perl->Ibasetime;
8997 PL_formfeed = sv_dup(proto_perl->Iformfeed);
8999 PL_maxsysfd = proto_perl->Imaxsysfd;
9000 PL_multiline = proto_perl->Imultiline;
9001 PL_statusvalue = proto_perl->Istatusvalue;
9003 PL_statusvalue_vms = proto_perl->Istatusvalue_vms;
9006 /* shortcuts to various I/O objects */
9007 PL_stdingv = gv_dup(proto_perl->Istdingv);
9008 PL_stderrgv = gv_dup(proto_perl->Istderrgv);
9009 PL_defgv = gv_dup(proto_perl->Idefgv);
9010 PL_argvgv = gv_dup(proto_perl->Iargvgv);
9011 PL_argvoutgv = gv_dup(proto_perl->Iargvoutgv);
9012 PL_argvout_stack = av_dup_inc(proto_perl->Iargvout_stack);
9014 /* shortcuts to regexp stuff */
9015 PL_replgv = gv_dup(proto_perl->Ireplgv);
9017 /* shortcuts to misc objects */
9018 PL_errgv = gv_dup(proto_perl->Ierrgv);
9020 /* shortcuts to debugging objects */
9021 PL_DBgv = gv_dup(proto_perl->IDBgv);
9022 PL_DBline = gv_dup(proto_perl->IDBline);
9023 PL_DBsub = gv_dup(proto_perl->IDBsub);
9024 PL_DBsingle = sv_dup(proto_perl->IDBsingle);
9025 PL_DBtrace = sv_dup(proto_perl->IDBtrace);
9026 PL_DBsignal = sv_dup(proto_perl->IDBsignal);
9027 PL_lineary = av_dup(proto_perl->Ilineary);
9028 PL_dbargs = av_dup(proto_perl->Idbargs);
9031 PL_defstash = hv_dup_inc(proto_perl->Tdefstash);
9032 PL_curstash = hv_dup(proto_perl->Tcurstash);
9033 PL_debstash = hv_dup(proto_perl->Idebstash);
9034 PL_globalstash = hv_dup(proto_perl->Iglobalstash);
9035 PL_curstname = sv_dup_inc(proto_perl->Icurstname);
9037 PL_beginav = av_dup_inc(proto_perl->Ibeginav);
9038 PL_endav = av_dup_inc(proto_perl->Iendav);
9039 PL_checkav = av_dup_inc(proto_perl->Icheckav);
9040 PL_initav = av_dup_inc(proto_perl->Iinitav);
9042 PL_sub_generation = proto_perl->Isub_generation;
9044 /* funky return mechanisms */
9045 PL_forkprocess = proto_perl->Iforkprocess;
9047 /* subprocess state */
9048 PL_fdpid = av_dup_inc(proto_perl->Ifdpid);
9050 /* internal state */
9051 PL_tainting = proto_perl->Itainting;
9052 PL_maxo = proto_perl->Imaxo;
9053 if (proto_perl->Iop_mask)
9054 PL_op_mask = SAVEPVN(proto_perl->Iop_mask, PL_maxo);
9056 PL_op_mask = Nullch;
9058 /* current interpreter roots */
9059 PL_main_cv = cv_dup_inc(proto_perl->Imain_cv);
9060 PL_main_root = OpREFCNT_inc(proto_perl->Imain_root);
9061 PL_main_start = proto_perl->Imain_start;
9062 PL_eval_root = proto_perl->Ieval_root;
9063 PL_eval_start = proto_perl->Ieval_start;
9065 /* runtime control stuff */
9066 PL_curcopdb = (COP*)any_dup(proto_perl->Icurcopdb, proto_perl);
9067 PL_copline = proto_perl->Icopline;
9069 PL_filemode = proto_perl->Ifilemode;
9070 PL_lastfd = proto_perl->Ilastfd;
9071 PL_oldname = proto_perl->Ioldname; /* XXX not quite right */
9074 PL_gensym = proto_perl->Igensym;
9075 PL_preambled = proto_perl->Ipreambled;
9076 PL_preambleav = av_dup_inc(proto_perl->Ipreambleav);
9077 PL_laststatval = proto_perl->Ilaststatval;
9078 PL_laststype = proto_perl->Ilaststype;
9079 PL_mess_sv = Nullsv;
9081 PL_ors_sv = sv_dup_inc(proto_perl->Iors_sv);
9082 PL_ofmt = SAVEPV(proto_perl->Iofmt);
9084 /* interpreter atexit processing */
9085 PL_exitlistlen = proto_perl->Iexitlistlen;
9086 if (PL_exitlistlen) {
9087 New(0, PL_exitlist, PL_exitlistlen, PerlExitListEntry);
9088 Copy(proto_perl->Iexitlist, PL_exitlist, PL_exitlistlen, PerlExitListEntry);
9091 PL_exitlist = (PerlExitListEntry*)NULL;
9092 PL_modglobal = hv_dup_inc(proto_perl->Imodglobal);
9094 PL_profiledata = NULL;
9095 PL_rsfp = fp_dup(proto_perl->Irsfp, '<');
9096 /* PL_rsfp_filters entries have fake IoDIRP() */
9097 PL_rsfp_filters = av_dup_inc(proto_perl->Irsfp_filters);
9099 PL_compcv = cv_dup(proto_perl->Icompcv);
9100 PL_comppad = av_dup(proto_perl->Icomppad);
9101 PL_comppad_name = av_dup(proto_perl->Icomppad_name);
9102 PL_comppad_name_fill = proto_perl->Icomppad_name_fill;
9103 PL_comppad_name_floor = proto_perl->Icomppad_name_floor;
9104 PL_curpad = (SV**)ptr_table_fetch(PL_ptr_table,
9105 proto_perl->Tcurpad);
9107 #ifdef HAVE_INTERP_INTERN
9108 sys_intern_dup(&proto_perl->Isys_intern, &PL_sys_intern);
9111 /* more statics moved here */
9112 PL_generation = proto_perl->Igeneration;
9113 PL_DBcv = cv_dup(proto_perl->IDBcv);
9115 PL_in_clean_objs = proto_perl->Iin_clean_objs;
9116 PL_in_clean_all = proto_perl->Iin_clean_all;
9118 PL_uid = proto_perl->Iuid;
9119 PL_euid = proto_perl->Ieuid;
9120 PL_gid = proto_perl->Igid;
9121 PL_egid = proto_perl->Iegid;
9122 PL_nomemok = proto_perl->Inomemok;
9123 PL_an = proto_perl->Ian;
9124 PL_cop_seqmax = proto_perl->Icop_seqmax;
9125 PL_op_seqmax = proto_perl->Iop_seqmax;
9126 PL_evalseq = proto_perl->Ievalseq;
9127 PL_origenviron = proto_perl->Iorigenviron; /* XXX not quite right */
9128 PL_origalen = proto_perl->Iorigalen;
9129 PL_pidstatus = newHV(); /* XXX flag for cloning? */
9130 PL_osname = SAVEPV(proto_perl->Iosname);
9131 PL_sh_path = SAVEPV(proto_perl->Ish_path);
9132 PL_sighandlerp = proto_perl->Isighandlerp;
9135 PL_runops = proto_perl->Irunops;
9137 Copy(proto_perl->Itokenbuf, PL_tokenbuf, 256, char);
9140 PL_cshlen = proto_perl->Icshlen;
9141 PL_cshname = SAVEPVN(proto_perl->Icshname, PL_cshlen);
9144 PL_lex_state = proto_perl->Ilex_state;
9145 PL_lex_defer = proto_perl->Ilex_defer;
9146 PL_lex_expect = proto_perl->Ilex_expect;
9147 PL_lex_formbrack = proto_perl->Ilex_formbrack;
9148 PL_lex_dojoin = proto_perl->Ilex_dojoin;
9149 PL_lex_starts = proto_perl->Ilex_starts;
9150 PL_lex_stuff = sv_dup_inc(proto_perl->Ilex_stuff);
9151 PL_lex_repl = sv_dup_inc(proto_perl->Ilex_repl);
9152 PL_lex_op = proto_perl->Ilex_op;
9153 PL_lex_inpat = proto_perl->Ilex_inpat;
9154 PL_lex_inwhat = proto_perl->Ilex_inwhat;
9155 PL_lex_brackets = proto_perl->Ilex_brackets;
9156 i = (PL_lex_brackets < 120 ? 120 : PL_lex_brackets);
9157 PL_lex_brackstack = SAVEPVN(proto_perl->Ilex_brackstack,i);
9158 PL_lex_casemods = proto_perl->Ilex_casemods;
9159 i = (PL_lex_casemods < 12 ? 12 : PL_lex_casemods);
9160 PL_lex_casestack = SAVEPVN(proto_perl->Ilex_casestack,i);
9162 Copy(proto_perl->Inextval, PL_nextval, 5, YYSTYPE);
9163 Copy(proto_perl->Inexttype, PL_nexttype, 5, I32);
9164 PL_nexttoke = proto_perl->Inexttoke;
9166 PL_linestr = sv_dup_inc(proto_perl->Ilinestr);
9167 i = proto_perl->Ibufptr - SvPVX(proto_perl->Ilinestr);
9168 PL_bufptr = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
9169 i = proto_perl->Ioldbufptr - SvPVX(proto_perl->Ilinestr);
9170 PL_oldbufptr = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
9171 i = proto_perl->Ioldoldbufptr - SvPVX(proto_perl->Ilinestr);
9172 PL_oldoldbufptr = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
9173 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
9174 i = proto_perl->Ilinestart - SvPVX(proto_perl->Ilinestr);
9175 PL_linestart = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
9176 PL_pending_ident = proto_perl->Ipending_ident;
9177 PL_sublex_info = proto_perl->Isublex_info; /* XXX not quite right */
9179 PL_expect = proto_perl->Iexpect;
9181 PL_multi_start = proto_perl->Imulti_start;
9182 PL_multi_end = proto_perl->Imulti_end;
9183 PL_multi_open = proto_perl->Imulti_open;
9184 PL_multi_close = proto_perl->Imulti_close;
9186 PL_error_count = proto_perl->Ierror_count;
9187 PL_subline = proto_perl->Isubline;
9188 PL_subname = sv_dup_inc(proto_perl->Isubname);
9190 PL_min_intro_pending = proto_perl->Imin_intro_pending;
9191 PL_max_intro_pending = proto_perl->Imax_intro_pending;
9192 PL_padix = proto_perl->Ipadix;
9193 PL_padix_floor = proto_perl->Ipadix_floor;
9194 PL_pad_reset_pending = proto_perl->Ipad_reset_pending;
9196 i = proto_perl->Ilast_uni - SvPVX(proto_perl->Ilinestr);
9197 PL_last_uni = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
9198 i = proto_perl->Ilast_lop - SvPVX(proto_perl->Ilinestr);
9199 PL_last_lop = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
9200 PL_last_lop_op = proto_perl->Ilast_lop_op;
9201 PL_in_my = proto_perl->Iin_my;
9202 PL_in_my_stash = hv_dup(proto_perl->Iin_my_stash);
9204 PL_cryptseen = proto_perl->Icryptseen;
9207 PL_hints = proto_perl->Ihints;
9209 PL_amagic_generation = proto_perl->Iamagic_generation;
9211 #ifdef USE_LOCALE_COLLATE
9212 PL_collation_ix = proto_perl->Icollation_ix;
9213 PL_collation_name = SAVEPV(proto_perl->Icollation_name);
9214 PL_collation_standard = proto_perl->Icollation_standard;
9215 PL_collxfrm_base = proto_perl->Icollxfrm_base;
9216 PL_collxfrm_mult = proto_perl->Icollxfrm_mult;
9217 #endif /* USE_LOCALE_COLLATE */
9219 #ifdef USE_LOCALE_NUMERIC
9220 PL_numeric_name = SAVEPV(proto_perl->Inumeric_name);
9221 PL_numeric_standard = proto_perl->Inumeric_standard;
9222 PL_numeric_local = proto_perl->Inumeric_local;
9223 PL_numeric_radix_sv = sv_dup_inc(proto_perl->Inumeric_radix_sv);
9224 #endif /* !USE_LOCALE_NUMERIC */
9226 /* utf8 character classes */
9227 PL_utf8_alnum = sv_dup_inc(proto_perl->Iutf8_alnum);
9228 PL_utf8_alnumc = sv_dup_inc(proto_perl->Iutf8_alnumc);
9229 PL_utf8_ascii = sv_dup_inc(proto_perl->Iutf8_ascii);
9230 PL_utf8_alpha = sv_dup_inc(proto_perl->Iutf8_alpha);
9231 PL_utf8_space = sv_dup_inc(proto_perl->Iutf8_space);
9232 PL_utf8_cntrl = sv_dup_inc(proto_perl->Iutf8_cntrl);
9233 PL_utf8_graph = sv_dup_inc(proto_perl->Iutf8_graph);
9234 PL_utf8_digit = sv_dup_inc(proto_perl->Iutf8_digit);
9235 PL_utf8_upper = sv_dup_inc(proto_perl->Iutf8_upper);
9236 PL_utf8_lower = sv_dup_inc(proto_perl->Iutf8_lower);
9237 PL_utf8_print = sv_dup_inc(proto_perl->Iutf8_print);
9238 PL_utf8_punct = sv_dup_inc(proto_perl->Iutf8_punct);
9239 PL_utf8_xdigit = sv_dup_inc(proto_perl->Iutf8_xdigit);
9240 PL_utf8_mark = sv_dup_inc(proto_perl->Iutf8_mark);
9241 PL_utf8_toupper = sv_dup_inc(proto_perl->Iutf8_toupper);
9242 PL_utf8_totitle = sv_dup_inc(proto_perl->Iutf8_totitle);
9243 PL_utf8_tolower = sv_dup_inc(proto_perl->Iutf8_tolower);
9246 PL_last_swash_hv = Nullhv; /* reinits on demand */
9247 PL_last_swash_klen = 0;
9248 PL_last_swash_key[0]= '\0';
9249 PL_last_swash_tmps = (U8*)NULL;
9250 PL_last_swash_slen = 0;
9252 /* perly.c globals */
9253 PL_yydebug = proto_perl->Iyydebug;
9254 PL_yynerrs = proto_perl->Iyynerrs;
9255 PL_yyerrflag = proto_perl->Iyyerrflag;
9256 PL_yychar = proto_perl->Iyychar;
9257 PL_yyval = proto_perl->Iyyval;
9258 PL_yylval = proto_perl->Iyylval;
9260 PL_glob_index = proto_perl->Iglob_index;
9261 PL_srand_called = proto_perl->Isrand_called;
9262 PL_uudmap['M'] = 0; /* reinits on demand */
9263 PL_bitcount = Nullch; /* reinits on demand */
9265 if (proto_perl->Ipsig_pend) {
9266 Newz(0, PL_psig_pend, SIG_SIZE, int);
9269 PL_psig_pend = (int*)NULL;
9272 if (proto_perl->Ipsig_ptr) {
9273 Newz(0, PL_psig_ptr, SIG_SIZE, SV*);
9274 Newz(0, PL_psig_name, SIG_SIZE, SV*);
9275 for (i = 1; i < SIG_SIZE; i++) {
9276 PL_psig_ptr[i] = sv_dup_inc(proto_perl->Ipsig_ptr[i]);
9277 PL_psig_name[i] = sv_dup_inc(proto_perl->Ipsig_name[i]);
9281 PL_psig_ptr = (SV**)NULL;
9282 PL_psig_name = (SV**)NULL;
9285 /* thrdvar.h stuff */
9287 if (flags & CLONEf_COPY_STACKS) {
9288 /* next allocation will be PL_tmps_stack[PL_tmps_ix+1] */
9289 PL_tmps_ix = proto_perl->Ttmps_ix;
9290 PL_tmps_max = proto_perl->Ttmps_max;
9291 PL_tmps_floor = proto_perl->Ttmps_floor;
9292 Newz(50, PL_tmps_stack, PL_tmps_max, SV*);
9294 while (i <= PL_tmps_ix) {
9295 PL_tmps_stack[i] = sv_dup_inc(proto_perl->Ttmps_stack[i]);
9299 /* next PUSHMARK() sets *(PL_markstack_ptr+1) */
9300 i = proto_perl->Tmarkstack_max - proto_perl->Tmarkstack;
9301 Newz(54, PL_markstack, i, I32);
9302 PL_markstack_max = PL_markstack + (proto_perl->Tmarkstack_max
9303 - proto_perl->Tmarkstack);
9304 PL_markstack_ptr = PL_markstack + (proto_perl->Tmarkstack_ptr
9305 - proto_perl->Tmarkstack);
9306 Copy(proto_perl->Tmarkstack, PL_markstack,
9307 PL_markstack_ptr - PL_markstack + 1, I32);
9309 /* next push_scope()/ENTER sets PL_scopestack[PL_scopestack_ix]
9310 * NOTE: unlike the others! */
9311 PL_scopestack_ix = proto_perl->Tscopestack_ix;
9312 PL_scopestack_max = proto_perl->Tscopestack_max;
9313 Newz(54, PL_scopestack, PL_scopestack_max, I32);
9314 Copy(proto_perl->Tscopestack, PL_scopestack, PL_scopestack_ix, I32);
9316 /* next push_return() sets PL_retstack[PL_retstack_ix]
9317 * NOTE: unlike the others! */
9318 PL_retstack_ix = proto_perl->Tretstack_ix;
9319 PL_retstack_max = proto_perl->Tretstack_max;
9320 Newz(54, PL_retstack, PL_retstack_max, OP*);
9321 Copy(proto_perl->Tretstack, PL_retstack, PL_retstack_ix, I32);
9323 /* NOTE: si_dup() looks at PL_markstack */
9324 PL_curstackinfo = si_dup(proto_perl->Tcurstackinfo);
9326 /* PL_curstack = PL_curstackinfo->si_stack; */
9327 PL_curstack = av_dup(proto_perl->Tcurstack);
9328 PL_mainstack = av_dup(proto_perl->Tmainstack);
9330 /* next PUSHs() etc. set *(PL_stack_sp+1) */
9331 PL_stack_base = AvARRAY(PL_curstack);
9332 PL_stack_sp = PL_stack_base + (proto_perl->Tstack_sp
9333 - proto_perl->Tstack_base);
9334 PL_stack_max = PL_stack_base + AvMAX(PL_curstack);
9336 /* next SSPUSHFOO() sets PL_savestack[PL_savestack_ix]
9337 * NOTE: unlike the others! */
9338 PL_savestack_ix = proto_perl->Tsavestack_ix;
9339 PL_savestack_max = proto_perl->Tsavestack_max;
9340 /*Newz(54, PL_savestack, PL_savestack_max, ANY);*/
9341 PL_savestack = ss_dup(proto_perl);
9345 ENTER; /* perl_destruct() wants to LEAVE; */
9348 PL_start_env = proto_perl->Tstart_env; /* XXXXXX */
9349 PL_top_env = &PL_start_env;
9351 PL_op = proto_perl->Top;
9354 PL_Xpv = (XPV*)NULL;
9355 PL_na = proto_perl->Tna;
9357 PL_statbuf = proto_perl->Tstatbuf;
9358 PL_statcache = proto_perl->Tstatcache;
9359 PL_statgv = gv_dup(proto_perl->Tstatgv);
9360 PL_statname = sv_dup_inc(proto_perl->Tstatname);
9362 PL_timesbuf = proto_perl->Ttimesbuf;
9365 PL_tainted = proto_perl->Ttainted;
9366 PL_curpm = proto_perl->Tcurpm; /* XXX No PMOP ref count */
9367 PL_nrs = sv_dup_inc(proto_perl->Tnrs);
9368 PL_rs = sv_dup_inc(proto_perl->Trs);
9369 PL_last_in_gv = gv_dup(proto_perl->Tlast_in_gv);
9370 PL_ofs_sv = sv_dup_inc(proto_perl->Tofs_sv);
9371 PL_defoutgv = gv_dup_inc(proto_perl->Tdefoutgv);
9372 PL_chopset = proto_perl->Tchopset; /* XXX never deallocated */
9373 PL_toptarget = sv_dup_inc(proto_perl->Ttoptarget);
9374 PL_bodytarget = sv_dup_inc(proto_perl->Tbodytarget);
9375 PL_formtarget = sv_dup(proto_perl->Tformtarget);
9377 PL_restartop = proto_perl->Trestartop;
9378 PL_in_eval = proto_perl->Tin_eval;
9379 PL_delaymagic = proto_perl->Tdelaymagic;
9380 PL_dirty = proto_perl->Tdirty;
9381 PL_localizing = proto_perl->Tlocalizing;
9383 #ifdef PERL_FLEXIBLE_EXCEPTIONS
9384 PL_protect = proto_perl->Tprotect;
9386 PL_errors = sv_dup_inc(proto_perl->Terrors);
9387 PL_av_fetch_sv = Nullsv;
9388 PL_hv_fetch_sv = Nullsv;
9389 Zero(&PL_hv_fetch_ent_mh, 1, HE); /* XXX */
9390 PL_modcount = proto_perl->Tmodcount;
9391 PL_lastgotoprobe = Nullop;
9392 PL_dumpindent = proto_perl->Tdumpindent;
9394 PL_sortcop = (OP*)any_dup(proto_perl->Tsortcop, proto_perl);
9395 PL_sortstash = hv_dup(proto_perl->Tsortstash);
9396 PL_firstgv = gv_dup(proto_perl->Tfirstgv);
9397 PL_secondgv = gv_dup(proto_perl->Tsecondgv);
9398 PL_sortcxix = proto_perl->Tsortcxix;
9399 PL_efloatbuf = Nullch; /* reinits on demand */
9400 PL_efloatsize = 0; /* reinits on demand */
9404 PL_screamfirst = NULL;
9405 PL_screamnext = NULL;
9406 PL_maxscream = -1; /* reinits on demand */
9407 PL_lastscream = Nullsv;
9409 PL_watchaddr = NULL;
9410 PL_watchok = Nullch;
9412 PL_regdummy = proto_perl->Tregdummy;
9413 PL_regcomp_parse = Nullch;
9414 PL_regxend = Nullch;
9415 PL_regcode = (regnode*)NULL;
9418 PL_regprecomp = Nullch;
9423 PL_seen_zerolen = 0;
9425 PL_regcomp_rx = (regexp*)NULL;
9427 PL_colorset = 0; /* reinits PL_colors[] */
9428 /*PL_colors[6] = {0,0,0,0,0,0};*/
9429 PL_reg_whilem_seen = 0;
9430 PL_reginput = Nullch;
9433 PL_regstartp = (I32*)NULL;
9434 PL_regendp = (I32*)NULL;
9435 PL_reglastparen = (U32*)NULL;
9436 PL_regtill = Nullch;
9437 PL_reg_start_tmp = (char**)NULL;
9438 PL_reg_start_tmpl = 0;
9439 PL_regdata = (struct reg_data*)NULL;
9442 PL_reg_eval_set = 0;
9444 PL_regprogram = (regnode*)NULL;
9446 PL_regcc = (CURCUR*)NULL;
9447 PL_reg_call_cc = (struct re_cc_state*)NULL;
9448 PL_reg_re = (regexp*)NULL;
9449 PL_reg_ganch = Nullch;
9451 PL_reg_magic = (MAGIC*)NULL;
9453 PL_reg_oldcurpm = (PMOP*)NULL;
9454 PL_reg_curpm = (PMOP*)NULL;
9455 PL_reg_oldsaved = Nullch;
9456 PL_reg_oldsavedlen = 0;
9458 PL_reg_leftiter = 0;
9459 PL_reg_poscache = Nullch;
9460 PL_reg_poscache_size= 0;
9462 /* RE engine - function pointers */
9463 PL_regcompp = proto_perl->Tregcompp;
9464 PL_regexecp = proto_perl->Tregexecp;
9465 PL_regint_start = proto_perl->Tregint_start;
9466 PL_regint_string = proto_perl->Tregint_string;
9467 PL_regfree = proto_perl->Tregfree;
9469 PL_reginterp_cnt = 0;
9470 PL_reg_starttry = 0;
9472 if (!(flags & CLONEf_KEEP_PTR_TABLE)) {
9473 ptr_table_free(PL_ptr_table);
9474 PL_ptr_table = NULL;
9478 return (PerlInterpreter*)pPerl;
9484 #else /* !USE_ITHREADS */
9490 #endif /* USE_ITHREADS */
9493 do_report_used(pTHXo_ SV *sv)
9495 if (SvTYPE(sv) != SVTYPEMASK) {
9496 PerlIO_printf(Perl_debug_log, "****\n");
9502 do_clean_objs(pTHXo_ SV *sv)
9506 if (SvROK(sv) && SvOBJECT(rv = SvRV(sv))) {
9507 DEBUG_D((PerlIO_printf(Perl_debug_log, "Cleaning object ref:\n "), sv_dump(sv));)
9508 if (SvWEAKREF(sv)) {
9519 /* XXX Might want to check arrays, etc. */
9522 #ifndef DISABLE_DESTRUCTOR_KLUDGE
9524 do_clean_named_objs(pTHXo_ SV *sv)
9526 if (SvTYPE(sv) == SVt_PVGV && GvGP(sv)) {
9527 if ( SvOBJECT(GvSV(sv)) ||
9528 (GvAV(sv) && SvOBJECT(GvAV(sv))) ||
9529 (GvHV(sv) && SvOBJECT(GvHV(sv))) ||
9530 (GvIO(sv) && SvOBJECT(GvIO(sv))) ||
9531 (GvCV(sv) && SvOBJECT(GvCV(sv))) )
9533 DEBUG_D((PerlIO_printf(Perl_debug_log, "Cleaning named glob object:\n "), sv_dump(sv));)
9541 do_clean_all(pTHXo_ SV *sv)
9543 DEBUG_D((PerlIO_printf(Perl_debug_log, "Cleaning loops: SV at 0x%"UVxf"\n", PTR2UV(sv)) );)
9544 SvFLAGS(sv) |= SVf_BREAK;