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);
2310 (!SvPOKp(sv) || !strchr(SvPVX(sv),'.') || !looks_like_number(sv)))
2312 SvNVX(sv) = SvIsUV(sv) ? (NV)SvUVX(sv) : (NV)SvIVX(sv);
2313 #ifdef NV_PRESERVES_UV
2316 /* Only set the public NV OK flag if this NV preserves the IV */
2317 /* Check it's not 0xFFFFFFFFFFFFFFFF */
2318 if (SvIsUV(sv) ? ((SvUVX(sv) != UV_MAX)&&(SvUVX(sv) == U_V(SvNVX(sv))))
2319 : (SvIVX(sv) == I_V(SvNVX(sv))))
2325 else if (SvPOKp(sv) && SvLEN(sv)) {
2326 if (ckWARN(WARN_NUMERIC) && !SvIOKp(sv) && !looks_like_number(sv))
2328 SvNVX(sv) = Atof(SvPVX(sv));
2329 #ifdef NV_PRESERVES_UV
2332 /* Only set the public NV OK flag if this NV preserves the value in
2333 the PV at least as well as an IV/UV would.
2334 Not sure how to do this 100% reliably. */
2335 /* if that shift count is out of range then Configure's test is
2336 wonky. We shouldn't be in here with NV_PRESERVES_UV_BITS ==
2338 if (((UV)1 << NV_PRESERVES_UV_BITS) >
2339 U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv)))
2340 SvNOK_on(sv); /* Definitely small enough to preserve all bits */
2341 else if (SvNVX(sv) < (NV)IV_MIN || SvNVX(sv) > (NV)UV_MAX) {
2342 /* Definitely too large/small to fit in an integer, so no loss
2343 of precision going to integer in the future via NV */
2346 /* Is it something we can run through strtol etc (ie no
2347 trailing exponent part)? */
2348 int numtype = looks_like_number(sv);
2349 /* XXX probably should cache this if called above */
2352 (IS_NUMBER_TO_INT_BY_ATOL | IS_NUMBER_TO_INT_BY_STRTOL))) {
2353 /* Can't use strtol etc to convert this string, so don't try */
2356 sv_2inuv_non_preserve (sv, numtype);
2358 #endif /* NV_PRESERVES_UV */
2361 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing && !(SvFLAGS(sv) & SVs_PADTMP))
2363 if (SvTYPE(sv) < SVt_NV)
2364 /* Typically the caller expects that sv_any is not NULL now. */
2365 /* XXX Ilya implies that this is a bug in callers that assume this
2366 and ideally should be fixed. */
2367 sv_upgrade(sv, SVt_NV);
2370 #if defined(USE_LONG_DOUBLE)
2372 STORE_NUMERIC_LOCAL_SET_STANDARD();
2373 PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2nv(%" PERL_PRIgldbl ")\n",
2374 PTR2UV(sv), SvNVX(sv));
2375 RESTORE_NUMERIC_LOCAL();
2379 STORE_NUMERIC_LOCAL_SET_STANDARD();
2380 PerlIO_printf(Perl_debug_log, "0x%"UVxf" 1nv(%g)\n",
2381 PTR2UV(sv), SvNVX(sv));
2382 RESTORE_NUMERIC_LOCAL();
2389 S_asIV(pTHX_ SV *sv)
2391 I32 numtype = looks_like_number(sv);
2394 if (numtype & IS_NUMBER_TO_INT_BY_ATOL)
2395 return Atol(SvPVX(sv));
2397 if (ckWARN(WARN_NUMERIC))
2400 d = Atof(SvPVX(sv));
2405 S_asUV(pTHX_ SV *sv)
2407 I32 numtype = looks_like_number(sv);
2410 if (numtype & IS_NUMBER_TO_INT_BY_ATOL)
2411 return Strtoul(SvPVX(sv), Null(char**), 10);
2414 if (ckWARN(WARN_NUMERIC))
2417 return U_V(Atof(SvPVX(sv)));
2421 * Returns a combination of (advisory only - can get false negatives)
2422 * IS_NUMBER_TO_INT_BY_ATOL, IS_NUMBER_TO_INT_BY_ATOF
2423 * IS_NUMBER_LONGER_THAN_IV_MAX, IS_NUMBER_AS_LONG_AS_IV_MAX
2424 * IS_NUMBER_NOT_INT, IS_NUMBER_NEG, IS_NUMBER_INFINITY
2425 * 0 if does not look like number.
2427 * (atol and strtol stop when they hit a decimal point. strtol will return
2428 * LONG_MAX and LONG_MIN when given out of range values. ANSI says they should
2429 * do this, and vendors have had 11 years to get it right.
2430 * However, will try to make it still work with only atol
2432 * IS_NUMBER_TO_INT_BY_ATOL 123456789 or 123456789.3 definitely < IV_MAX
2433 * IS_NUMBER_TO_INT_BY_STRTOL 123456789 or 123456789.3 if digits = IV_MAX
2434 * IS_NUMBER_TO_INT_BY_ATOF 123456789e0 or >> IV_MAX
2435 * IS_NUMBER_LONGER_THAN_IV_MAX lots of digits, don't bother with atol
2436 * IS_NUMBER_AS_LONG_AS_IV_MAX atol might hit LONG_MAX, might not.
2437 * IS_NUMBER_NOT_INT saw "." or "e"
2439 * IS_NUMBER_INFINITY
2443 =for apidoc looks_like_number
2445 Test if an the content of an SV looks like a number (or is a
2446 number). C<Inf> and C<Infinity> are treated as numbers (so will not
2447 issue a non-numeric warning), even if your atof() doesn't grok them.
2453 Perl_looks_like_number(pTHX_ SV *sv)
2456 register char *send;
2457 register char *sbegin;
2458 register char *nbegin;
2462 #ifdef USE_LOCALE_NUMERIC
2463 bool specialradix = FALSE;
2470 else if (SvPOKp(sv))
2471 sbegin = SvPV(sv, len);
2474 send = sbegin + len;
2481 numtype = IS_NUMBER_NEG;
2488 * we return IS_NUMBER_TO_INT_BY_ATOL if the number can converted to
2489 * integer with atol() without overflow, IS_NUMBER_TO_INT_BY_STRTOL if
2490 * possibly slightly larger than max int, IS_NUMBER_TO_INT_BY_ATOF if you
2491 * will need (int)atof().
2494 /* next must be digit or the radix separator or beginning of infinity */
2498 } while (isDIGIT(*s));
2500 /* Aaargh. long long really is irritating.
2501 In the gospel according to ANSI 1989, it is an axiom that "long"
2502 is the longest integer type, and that if you don't know how long
2503 something is you can cast it to long, and nothing will be lost
2504 (except possibly speed of execution if long is slower than the
2506 Now, one can't be sure if the old rules apply, or long long
2507 (or some other newfangled thing) is actually longer than the
2508 (formerly) longest thing.
2510 /* This lot will work for 64 bit *as long as* either
2511 either long is 64 bit
2512 or we can find both strtol/strtoq and strtoul/strtouq
2513 If not, we really should refuse to let the user use 64 bit IVs
2514 By "64 bit" I really mean IVs that don't get preserved by NVs
2515 It also should work for 128 bit IVs. Can any lend me a machine to
2518 if (s - nbegin > TYPE_DIGITS(UV)) /* Cannot cache ato[ul]() */
2519 numtype |= IS_NUMBER_TO_INT_BY_ATOF | IS_NUMBER_LONGER_THAN_IV_MAX;
2520 else if (s - nbegin < BIT_DIGITS(((sizeof (IV)>sizeof (long))
2521 ? sizeof(long) : sizeof (IV))*8-1))
2522 numtype |= IS_NUMBER_TO_INT_BY_ATOL;
2524 /* Can't be sure either way. (For 64 bit UV, 63 bit IV is 1 decimal
2525 digit less (IV_MAX= 9223372036854775807,
2526 UV_MAX= 18446744073709551615) so be cautious */
2527 numtype |= IS_NUMBER_TO_INT_BY_STRTOL | IS_NUMBER_AS_LONG_AS_IV_MAX;
2530 #ifdef USE_LOCALE_NUMERIC
2531 || (specialradix = IS_NUMERIC_RADIX(s))
2534 #ifdef USE_LOCALE_NUMERIC
2536 s += SvCUR(PL_numeric_radix_sv);
2540 numtype |= IS_NUMBER_NOT_INT;
2541 while (isDIGIT(*s)) /* optional digits after the radix */
2546 #ifdef USE_LOCALE_NUMERIC
2547 || (specialradix = IS_NUMERIC_RADIX(s))
2550 #ifdef USE_LOCALE_NUMERIC
2552 s += SvCUR(PL_numeric_radix_sv);
2556 numtype |= IS_NUMBER_TO_INT_BY_ATOL | IS_NUMBER_NOT_INT;
2557 /* no digits before the radix means we need digits after it */
2561 } while (isDIGIT(*s));
2566 else if (*s == 'I' || *s == 'i') {
2567 s++; if (*s != 'N' && *s != 'n') return 0;
2568 s++; if (*s != 'F' && *s != 'f') return 0;
2569 s++; if (*s == 'I' || *s == 'i') {
2570 s++; if (*s != 'N' && *s != 'n') return 0;
2571 s++; if (*s != 'I' && *s != 'i') return 0;
2572 s++; if (*s != 'T' && *s != 't') return 0;
2573 s++; if (*s != 'Y' && *s != 'y') return 0;
2582 numtype = (numtype & IS_NUMBER_NEG) /* Keep track of sign */
2583 | IS_NUMBER_INFINITY | IS_NUMBER_NOT_INT;
2585 /* we can have an optional exponent part */
2586 if (*s == 'e' || *s == 'E') {
2587 numtype &= IS_NUMBER_NEG;
2588 numtype |= IS_NUMBER_TO_INT_BY_ATOF | IS_NUMBER_NOT_INT;
2590 if (*s == '+' || *s == '-')
2595 } while (isDIGIT(*s));
2605 if (len == 10 && memEQ(sbegin, "0 but true", 10))
2606 return IS_NUMBER_TO_INT_BY_ATOL;
2611 Perl_sv_2pv_nolen(pTHX_ register SV *sv)
2614 return sv_2pv(sv, &n_a);
2617 /* We assume that buf is at least TYPE_CHARS(UV) long. */
2619 uiv_2buf(char *buf, IV iv, UV uv, int is_uv, char **peob)
2621 char *ptr = buf + TYPE_CHARS(UV);
2635 *--ptr = '0' + (uv % 10);
2644 Perl_sv_2pv(pTHX_ register SV *sv, STRLEN *lp)
2646 sv_2pv_flags(sv, lp, SV_GMAGIC);
2650 Perl_sv_2pv_flags(pTHX_ register SV *sv, STRLEN *lp, I32 flags)
2655 char tbuf[64]; /* Must fit sprintf/Gconvert of longest IV/NV */
2656 char *tmpbuf = tbuf;
2662 if (SvGMAGICAL(sv)) {
2663 if (flags & SV_GMAGIC)
2671 (void)sprintf(tmpbuf,"%"UVuf, (UV)SvUVX(sv));
2673 (void)sprintf(tmpbuf,"%"IVdf, (IV)SvIVX(sv));
2678 Gconvert(SvNVX(sv), NV_DIG, 0, tmpbuf);
2683 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
2684 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
2691 if (SvTHINKFIRST(sv)) {
2694 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv,string)) &&
2695 (SvTYPE(tmpstr) != SVt_RV || (SvRV(tmpstr) != SvRV(sv))))
2696 return SvPV(tmpstr,*lp);
2703 switch (SvTYPE(sv)) {
2705 if ( ((SvFLAGS(sv) &
2706 (SVs_OBJECT|SVf_OK|SVs_GMG|SVs_SMG|SVs_RMG))
2707 == (SVs_OBJECT|SVs_RMG))
2708 && strEQ(s=HvNAME(SvSTASH(sv)), "Regexp")
2709 && (mg = mg_find(sv, PERL_MAGIC_qr))) {
2710 regexp *re = (regexp *)mg->mg_obj;
2713 char *fptr = "msix";
2718 U16 reganch = (re->reganch & PMf_COMPILETIME) >> 12;
2720 while((ch = *fptr++)) {
2722 reflags[left++] = ch;
2725 reflags[right--] = ch;
2730 reflags[left] = '-';
2734 mg->mg_len = re->prelen + 4 + left;
2735 New(616, mg->mg_ptr, mg->mg_len + 1 + left, char);
2736 Copy("(?", mg->mg_ptr, 2, char);
2737 Copy(reflags, mg->mg_ptr+2, left, char);
2738 Copy(":", mg->mg_ptr+left+2, 1, char);
2739 Copy(re->precomp, mg->mg_ptr+3+left, re->prelen, char);
2740 mg->mg_ptr[mg->mg_len - 1] = ')';
2741 mg->mg_ptr[mg->mg_len] = 0;
2743 PL_reginterp_cnt += re->program[0].next_off;
2755 case SVt_PVBM: if (SvROK(sv))
2758 s = "SCALAR"; break;
2759 case SVt_PVLV: s = "LVALUE"; break;
2760 case SVt_PVAV: s = "ARRAY"; break;
2761 case SVt_PVHV: s = "HASH"; break;
2762 case SVt_PVCV: s = "CODE"; break;
2763 case SVt_PVGV: s = "GLOB"; break;
2764 case SVt_PVFM: s = "FORMAT"; break;
2765 case SVt_PVIO: s = "IO"; break;
2766 default: s = "UNKNOWN"; break;
2770 Perl_sv_setpvf(aTHX_ tsv, "%s=%s", HvNAME(SvSTASH(sv)), s);
2773 Perl_sv_catpvf(aTHX_ tsv, "(0x%"UVxf")", PTR2UV(sv));
2779 if (SvREADONLY(sv) && !SvOK(sv)) {
2780 if (ckWARN(WARN_UNINITIALIZED))
2786 if (SvIOK(sv) || ((SvIOKp(sv) && !SvNOKp(sv)))) {
2787 /* I'm assuming that if both IV and NV are equally valid then
2788 converting the IV is going to be more efficient */
2789 U32 isIOK = SvIOK(sv);
2790 U32 isUIOK = SvIsUV(sv);
2791 char buf[TYPE_CHARS(UV)];
2794 if (SvTYPE(sv) < SVt_PVIV)
2795 sv_upgrade(sv, SVt_PVIV);
2797 ptr = uiv_2buf(buf, 0, SvUVX(sv), 1, &ebuf);
2799 ptr = uiv_2buf(buf, SvIVX(sv), 0, 0, &ebuf);
2800 SvGROW(sv, ebuf - ptr + 1); /* inlined from sv_setpvn */
2801 Move(ptr,SvPVX(sv),ebuf - ptr,char);
2802 SvCUR_set(sv, ebuf - ptr);
2812 else if (SvNOKp(sv)) {
2813 if (SvTYPE(sv) < SVt_PVNV)
2814 sv_upgrade(sv, SVt_PVNV);
2815 /* The +20 is pure guesswork. Configure test needed. --jhi */
2816 SvGROW(sv, NV_DIG + 20);
2818 olderrno = errno; /* some Xenix systems wipe out errno here */
2820 if (SvNVX(sv) == 0.0)
2821 (void)strcpy(s,"0");
2825 Gconvert(SvNVX(sv), NV_DIG, 0, s);
2828 #ifdef FIXNEGATIVEZERO
2829 if (*s == '-' && s[1] == '0' && !s[2])
2839 if (ckWARN(WARN_UNINITIALIZED)
2840 && !PL_localizing && !(SvFLAGS(sv) & SVs_PADTMP))
2843 if (SvTYPE(sv) < SVt_PV)
2844 /* Typically the caller expects that sv_any is not NULL now. */
2845 sv_upgrade(sv, SVt_PV);
2848 *lp = s - SvPVX(sv);
2851 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2pv(%s)\n",
2852 PTR2UV(sv),SvPVX(sv)));
2856 if (SvROK(sv)) { /* XXX Skip this when sv_pvn_force calls */
2857 /* Sneaky stuff here */
2861 tsv = newSVpv(tmpbuf, 0);
2877 len = strlen(tmpbuf);
2879 #ifdef FIXNEGATIVEZERO
2880 if (len == 2 && t[0] == '-' && t[1] == '0') {
2885 (void)SvUPGRADE(sv, SVt_PV);
2887 s = SvGROW(sv, len + 1);
2896 Perl_sv_2pvbyte_nolen(pTHX_ register SV *sv)
2899 return sv_2pvbyte(sv, &n_a);
2903 Perl_sv_2pvbyte(pTHX_ register SV *sv, STRLEN *lp)
2905 sv_utf8_downgrade(sv,0);
2906 return SvPV(sv,*lp);
2910 Perl_sv_2pvutf8_nolen(pTHX_ register SV *sv)
2913 return sv_2pvutf8(sv, &n_a);
2917 Perl_sv_2pvutf8(pTHX_ register SV *sv, STRLEN *lp)
2919 sv_utf8_upgrade(sv);
2920 return SvPV(sv,*lp);
2923 /* This function is only called on magical items */
2925 Perl_sv_2bool(pTHX_ register SV *sv)
2934 if (SvAMAGIC(sv) && (tmpsv=AMG_CALLun(sv,bool_)) &&
2935 (SvTYPE(tmpsv) != SVt_RV || (SvRV(tmpsv) != SvRV(sv))))
2936 return SvTRUE(tmpsv);
2937 return SvRV(sv) != 0;
2940 register XPV* Xpvtmp;
2941 if ((Xpvtmp = (XPV*)SvANY(sv)) &&
2942 (*Xpvtmp->xpv_pv > '0' ||
2943 Xpvtmp->xpv_cur > 1 ||
2944 (Xpvtmp->xpv_cur && *Xpvtmp->xpv_pv != '0')))
2951 return SvIVX(sv) != 0;
2954 return SvNVX(sv) != 0.0;
2962 =for apidoc sv_utf8_upgrade
2964 Convert the PV of an SV to its UTF8-encoded form.
2965 Forces the SV to string form it it is not already.
2966 Always sets the SvUTF8 flag to avoid future validity checks even
2967 if all the bytes have hibit clear.
2973 Perl_sv_utf8_upgrade(pTHX_ register SV *sv)
2975 sv_utf8_upgrade_flags(sv, SV_GMAGIC);
2979 =for apidoc sv_utf8_upgrade_flags
2981 Convert the PV of an SV to its UTF8-encoded form.
2982 Forces the SV to string form it it is not already.
2983 Always sets the SvUTF8 flag to avoid future validity checks even
2984 if all the bytes have hibit clear. If C<flags> has C<SV_GMAGIC> bit set,
2985 will C<mg_get> on C<sv> if appropriate, else not. C<sv_utf8_upgrade> and
2986 C<sv_utf8_upgrade_nomg> are implemented in terms of this function.
2992 Perl_sv_utf8_upgrade_flags(pTHX_ register SV *sv, I32 flags)
3002 (void) sv_2pv_flags(sv,&len, flags);
3010 if (SvREADONLY(sv) && SvFAKE(sv)) {
3011 sv_force_normal(sv);
3014 /* This function could be much more efficient if we had a FLAG in SVs
3015 * to signal if there are any hibit chars in the PV.
3016 * Given that there isn't make loop fast as possible
3018 s = (U8 *) SvPVX(sv);
3019 e = (U8 *) SvEND(sv);
3023 if ((hibit = !NATIVE_IS_INVARIANT(ch)))
3029 len = SvCUR(sv) + 1; /* Plus the \0 */
3030 SvPVX(sv) = (char*)bytes_to_utf8((U8*)s, &len);
3031 SvCUR(sv) = len - 1;
3033 Safefree(s); /* No longer using what was there before. */
3034 SvLEN(sv) = len; /* No longer know the real size. */
3036 /* Mark as UTF-8 even if no hibit - saves scanning loop */
3042 =for apidoc sv_utf8_downgrade
3044 Attempt to convert the PV of an SV from UTF8-encoded to byte encoding.
3045 This may not be possible if the PV contains non-byte encoding characters;
3046 if this is the case, either returns false or, if C<fail_ok> is not
3053 Perl_sv_utf8_downgrade(pTHX_ register SV* sv, bool fail_ok)
3055 if (SvPOK(sv) && SvUTF8(sv)) {
3060 if (SvREADONLY(sv) && SvFAKE(sv))
3061 sv_force_normal(sv);
3062 s = (U8 *) SvPV(sv, len);
3063 if (!utf8_to_bytes(s, &len)) {
3066 #ifdef USE_BYTES_DOWNGRADES
3069 U8 *e = (U8 *) SvEND(sv);
3072 UV ch = utf8n_to_uvchr(s,(e-s),&len,0);
3073 if (first && ch > 255) {
3075 Perl_warner(aTHX_ WARN_UTF8, "Wide character in byte %s",
3076 PL_op_desc[PL_op->op_type]);
3078 Perl_warner(aTHX_ WARN_UTF8, "Wide character in byte");
3085 len = (d - (U8 *) SvPVX(sv));
3090 Perl_croak(aTHX_ "Wide character in %s",
3091 PL_op_desc[PL_op->op_type]);
3093 Perl_croak(aTHX_ "Wide character");
3104 =for apidoc sv_utf8_encode
3106 Convert the PV of an SV to UTF8-encoded, but then turn off the C<SvUTF8>
3107 flag so that it looks like octets again. Used as a building block
3108 for encode_utf8 in Encode.xs
3114 Perl_sv_utf8_encode(pTHX_ register SV *sv)
3116 (void) sv_utf8_upgrade(sv);
3121 =for apidoc sv_utf8_decode
3123 Convert the octets in the PV from UTF-8 to chars. Scan for validity and then
3124 turn of SvUTF8 if needed so that we see characters. Used as a building block
3125 for decode_utf8 in Encode.xs
3133 Perl_sv_utf8_decode(pTHX_ register SV *sv)
3139 /* The octets may have got themselves encoded - get them back as bytes */
3140 if (!sv_utf8_downgrade(sv, TRUE))
3143 /* it is actually just a matter of turning the utf8 flag on, but
3144 * we want to make sure everything inside is valid utf8 first.
3146 c = (U8 *) SvPVX(sv);
3147 if (!is_utf8_string(c, SvCUR(sv)+1))
3149 e = (U8 *) SvEND(sv);
3152 if (!UTF8_IS_INVARIANT(ch)) {
3162 /* Note: sv_setsv() should not be called with a source string that needs
3163 * to be reused, since it may destroy the source string if it is marked
3168 =for apidoc sv_setsv
3170 Copies the contents of the source SV C<ssv> into the destination SV C<dsv>.
3171 The source SV may be destroyed if it is mortal. Does not handle 'set'
3172 magic. See the macro forms C<SvSetSV>, C<SvSetSV_nosteal> and
3178 /* sv_setsv() is aliased to Perl_sv_setsv_macro; this function provided
3179 for binary compatibility only
3182 Perl_sv_setsv(pTHX_ SV *dstr, register SV *sstr)
3184 sv_setsv_flags(dstr, sstr, SV_GMAGIC);
3188 =for apidoc sv_setsv_flags
3190 Copies the contents of the source SV C<ssv> into the destination SV C<dsv>.
3191 The source SV may be destroyed if it is mortal. Does not handle 'set'
3192 magic. If C<flags> has C<SV_GMAGIC> bit set, will C<mg_get> on C<ssv> if
3193 appropriate, else not. C<sv_setsv> and C<sv_setsv_nomg> are implemented
3194 in terms of this function.
3200 Perl_sv_setsv_flags(pTHX_ SV *dstr, register SV *sstr, I32 flags)
3202 register U32 sflags;
3208 SV_CHECK_THINKFIRST(dstr);
3210 sstr = &PL_sv_undef;
3211 stype = SvTYPE(sstr);
3212 dtype = SvTYPE(dstr);
3216 /* There's a lot of redundancy below but we're going for speed here */
3221 if (dtype != SVt_PVGV) {
3222 (void)SvOK_off(dstr);
3230 sv_upgrade(dstr, SVt_IV);
3233 sv_upgrade(dstr, SVt_PVNV);
3237 sv_upgrade(dstr, SVt_PVIV);
3240 (void)SvIOK_only(dstr);
3241 SvIVX(dstr) = SvIVX(sstr);
3244 if (SvTAINTED(sstr))
3255 sv_upgrade(dstr, SVt_NV);
3260 sv_upgrade(dstr, SVt_PVNV);
3263 SvNVX(dstr) = SvNVX(sstr);
3264 (void)SvNOK_only(dstr);
3265 if (SvTAINTED(sstr))
3273 sv_upgrade(dstr, SVt_RV);
3274 else if (dtype == SVt_PVGV &&
3275 SvTYPE(SvRV(sstr)) == SVt_PVGV) {
3278 if (GvIMPORTED(dstr) != GVf_IMPORTED
3279 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3281 GvIMPORTED_on(dstr);
3292 sv_upgrade(dstr, SVt_PV);
3295 if (dtype < SVt_PVIV)
3296 sv_upgrade(dstr, SVt_PVIV);
3299 if (dtype < SVt_PVNV)
3300 sv_upgrade(dstr, SVt_PVNV);
3307 Perl_croak(aTHX_ "Bizarre copy of %s in %s", sv_reftype(sstr, 0),
3308 PL_op_name[PL_op->op_type]);
3310 Perl_croak(aTHX_ "Bizarre copy of %s", sv_reftype(sstr, 0));
3314 if (dtype <= SVt_PVGV) {
3316 if (dtype != SVt_PVGV) {
3317 char *name = GvNAME(sstr);
3318 STRLEN len = GvNAMELEN(sstr);
3319 sv_upgrade(dstr, SVt_PVGV);
3320 sv_magic(dstr, dstr, PERL_MAGIC_glob, Nullch, 0);
3321 GvSTASH(dstr) = (HV*)SvREFCNT_inc(GvSTASH(sstr));
3322 GvNAME(dstr) = savepvn(name, len);
3323 GvNAMELEN(dstr) = len;
3324 SvFAKE_on(dstr); /* can coerce to non-glob */
3326 /* ahem, death to those who redefine active sort subs */
3327 else if (PL_curstackinfo->si_type == PERLSI_SORT
3328 && GvCV(dstr) && PL_sortcop == CvSTART(GvCV(dstr)))
3329 Perl_croak(aTHX_ "Can't redefine active sort subroutine %s",
3332 #ifdef GV_SHARED_CHECK
3333 if (GvSHARED((GV*)dstr)) {
3334 Perl_croak(aTHX_ PL_no_modify);
3338 (void)SvOK_off(dstr);
3339 GvINTRO_off(dstr); /* one-shot flag */
3341 GvGP(dstr) = gp_ref(GvGP(sstr));
3342 if (SvTAINTED(sstr))
3344 if (GvIMPORTED(dstr) != GVf_IMPORTED
3345 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3347 GvIMPORTED_on(dstr);
3355 if (SvGMAGICAL(sstr) && (flags & SV_GMAGIC)) {
3357 if (SvTYPE(sstr) != stype) {
3358 stype = SvTYPE(sstr);
3359 if (stype == SVt_PVGV && dtype <= SVt_PVGV)
3363 if (stype == SVt_PVLV)
3364 (void)SvUPGRADE(dstr, SVt_PVNV);
3366 (void)SvUPGRADE(dstr, stype);
3369 sflags = SvFLAGS(sstr);
3371 if (sflags & SVf_ROK) {
3372 if (dtype >= SVt_PV) {
3373 if (dtype == SVt_PVGV) {
3374 SV *sref = SvREFCNT_inc(SvRV(sstr));
3376 int intro = GvINTRO(dstr);
3378 #ifdef GV_SHARED_CHECK
3379 if (GvSHARED((GV*)dstr)) {
3380 Perl_croak(aTHX_ PL_no_modify);
3387 GvINTRO_off(dstr); /* one-shot flag */
3388 Newz(602,gp, 1, GP);
3389 GvGP(dstr) = gp_ref(gp);
3390 GvSV(dstr) = NEWSV(72,0);
3391 GvLINE(dstr) = CopLINE(PL_curcop);
3392 GvEGV(dstr) = (GV*)dstr;
3395 switch (SvTYPE(sref)) {
3398 SAVESPTR(GvAV(dstr));
3400 dref = (SV*)GvAV(dstr);
3401 GvAV(dstr) = (AV*)sref;
3402 if (!GvIMPORTED_AV(dstr)
3403 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3405 GvIMPORTED_AV_on(dstr);
3410 SAVESPTR(GvHV(dstr));
3412 dref = (SV*)GvHV(dstr);
3413 GvHV(dstr) = (HV*)sref;
3414 if (!GvIMPORTED_HV(dstr)
3415 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3417 GvIMPORTED_HV_on(dstr);
3422 if (GvCVGEN(dstr) && GvCV(dstr) != (CV*)sref) {
3423 SvREFCNT_dec(GvCV(dstr));
3424 GvCV(dstr) = Nullcv;
3425 GvCVGEN(dstr) = 0; /* Switch off cacheness. */
3426 PL_sub_generation++;
3428 SAVESPTR(GvCV(dstr));
3431 dref = (SV*)GvCV(dstr);
3432 if (GvCV(dstr) != (CV*)sref) {
3433 CV* cv = GvCV(dstr);
3435 if (!GvCVGEN((GV*)dstr) &&
3436 (CvROOT(cv) || CvXSUB(cv)))
3438 /* ahem, death to those who redefine
3439 * active sort subs */
3440 if (PL_curstackinfo->si_type == PERLSI_SORT &&
3441 PL_sortcop == CvSTART(cv))
3443 "Can't redefine active sort subroutine %s",
3444 GvENAME((GV*)dstr));
3445 /* Redefining a sub - warning is mandatory if
3446 it was a const and its value changed. */
3447 if (ckWARN(WARN_REDEFINE)
3449 && (!CvCONST((CV*)sref)
3450 || sv_cmp(cv_const_sv(cv),
3451 cv_const_sv((CV*)sref)))))
3453 Perl_warner(aTHX_ WARN_REDEFINE,
3455 ? "Constant subroutine %s redefined"
3456 : "Subroutine %s redefined",
3457 GvENAME((GV*)dstr));
3460 cv_ckproto(cv, (GV*)dstr,
3461 SvPOK(sref) ? SvPVX(sref) : Nullch);
3463 GvCV(dstr) = (CV*)sref;
3464 GvCVGEN(dstr) = 0; /* Switch off cacheness. */
3465 GvASSUMECV_on(dstr);
3466 PL_sub_generation++;
3468 if (!GvIMPORTED_CV(dstr)
3469 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3471 GvIMPORTED_CV_on(dstr);
3476 SAVESPTR(GvIOp(dstr));
3478 dref = (SV*)GvIOp(dstr);
3479 GvIOp(dstr) = (IO*)sref;
3483 SAVESPTR(GvFORM(dstr));
3485 dref = (SV*)GvFORM(dstr);
3486 GvFORM(dstr) = (CV*)sref;
3490 SAVESPTR(GvSV(dstr));
3492 dref = (SV*)GvSV(dstr);
3494 if (!GvIMPORTED_SV(dstr)
3495 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3497 GvIMPORTED_SV_on(dstr);
3505 if (SvTAINTED(sstr))
3510 (void)SvOOK_off(dstr); /* backoff */
3512 Safefree(SvPVX(dstr));
3513 SvLEN(dstr)=SvCUR(dstr)=0;
3516 (void)SvOK_off(dstr);
3517 SvRV(dstr) = SvREFCNT_inc(SvRV(sstr));
3519 if (sflags & SVp_NOK) {
3521 /* Only set the public OK flag if the source has public OK. */
3522 if (sflags & SVf_NOK)
3523 SvFLAGS(dstr) |= SVf_NOK;
3524 SvNVX(dstr) = SvNVX(sstr);
3526 if (sflags & SVp_IOK) {
3527 (void)SvIOKp_on(dstr);
3528 if (sflags & SVf_IOK)
3529 SvFLAGS(dstr) |= SVf_IOK;
3530 if (sflags & SVf_IVisUV)
3532 SvIVX(dstr) = SvIVX(sstr);
3534 if (SvAMAGIC(sstr)) {
3538 else if (sflags & SVp_POK) {
3541 * Check to see if we can just swipe the string. If so, it's a
3542 * possible small lose on short strings, but a big win on long ones.
3543 * It might even be a win on short strings if SvPVX(dstr)
3544 * has to be allocated and SvPVX(sstr) has to be freed.
3547 if (SvTEMP(sstr) && /* slated for free anyway? */
3548 SvREFCNT(sstr) == 1 && /* and no other references to it? */
3549 !(sflags & SVf_OOK) && /* and not involved in OOK hack? */
3550 SvLEN(sstr) && /* and really is a string */
3551 !(PL_op && PL_op->op_type == OP_AASSIGN)) /* and won't be needed again, potentially */
3553 if (SvPVX(dstr)) { /* we know that dtype >= SVt_PV */
3555 SvFLAGS(dstr) &= ~SVf_OOK;
3556 Safefree(SvPVX(dstr) - SvIVX(dstr));
3558 else if (SvLEN(dstr))
3559 Safefree(SvPVX(dstr));
3561 (void)SvPOK_only(dstr);
3562 SvPV_set(dstr, SvPVX(sstr));
3563 SvLEN_set(dstr, SvLEN(sstr));
3564 SvCUR_set(dstr, SvCUR(sstr));
3567 (void)SvOK_off(sstr); /* NOTE: nukes most SvFLAGS on sstr */
3568 SvPV_set(sstr, Nullch);
3573 else { /* have to copy actual string */
3574 STRLEN len = SvCUR(sstr);
3576 SvGROW(dstr, len + 1); /* inlined from sv_setpvn */
3577 Move(SvPVX(sstr),SvPVX(dstr),len,char);
3578 SvCUR_set(dstr, len);
3579 *SvEND(dstr) = '\0';
3580 (void)SvPOK_only(dstr);
3582 if (sflags & SVf_UTF8)
3585 if (sflags & SVp_NOK) {
3587 if (sflags & SVf_NOK)
3588 SvFLAGS(dstr) |= SVf_NOK;
3589 SvNVX(dstr) = SvNVX(sstr);
3591 if (sflags & SVp_IOK) {
3592 (void)SvIOKp_on(dstr);
3593 if (sflags & SVf_IOK)
3594 SvFLAGS(dstr) |= SVf_IOK;
3595 if (sflags & SVf_IVisUV)
3597 SvIVX(dstr) = SvIVX(sstr);
3600 else if (sflags & SVp_IOK) {
3601 if (sflags & SVf_IOK)
3602 (void)SvIOK_only(dstr);
3604 (void)SvOK_off(dstr);
3605 (void)SvIOKp_on(dstr);
3607 /* XXXX Do we want to set IsUV for IV(ROK)? Be extra safe... */
3608 if (sflags & SVf_IVisUV)
3610 SvIVX(dstr) = SvIVX(sstr);
3611 if (sflags & SVp_NOK) {
3612 if (sflags & SVf_NOK)
3613 (void)SvNOK_on(dstr);
3615 (void)SvNOKp_on(dstr);
3616 SvNVX(dstr) = SvNVX(sstr);
3619 else if (sflags & SVp_NOK) {
3620 if (sflags & SVf_NOK)
3621 (void)SvNOK_only(dstr);
3623 (void)SvOK_off(dstr);
3626 SvNVX(dstr) = SvNVX(sstr);
3629 if (dtype == SVt_PVGV) {
3630 if (ckWARN(WARN_MISC))
3631 Perl_warner(aTHX_ WARN_MISC, "Undefined value assigned to typeglob");
3634 (void)SvOK_off(dstr);
3636 if (SvTAINTED(sstr))
3641 =for apidoc sv_setsv_mg
3643 Like C<sv_setsv>, but also handles 'set' magic.
3649 Perl_sv_setsv_mg(pTHX_ SV *dstr, register SV *sstr)
3651 sv_setsv(dstr,sstr);
3656 =for apidoc sv_setpvn
3658 Copies a string into an SV. The C<len> parameter indicates the number of
3659 bytes to be copied. Does not handle 'set' magic. See C<sv_setpvn_mg>.
3665 Perl_sv_setpvn(pTHX_ register SV *sv, register const char *ptr, register STRLEN len)
3667 register char *dptr;
3669 SV_CHECK_THINKFIRST(sv);
3675 /* len is STRLEN which is unsigned, need to copy to signed */
3679 (void)SvUPGRADE(sv, SVt_PV);
3681 SvGROW(sv, len + 1);
3683 Move(ptr,dptr,len,char);
3686 (void)SvPOK_only_UTF8(sv); /* validate pointer */
3691 =for apidoc sv_setpvn_mg
3693 Like C<sv_setpvn>, but also handles 'set' magic.
3699 Perl_sv_setpvn_mg(pTHX_ register SV *sv, register const char *ptr, register STRLEN len)
3701 sv_setpvn(sv,ptr,len);
3706 =for apidoc sv_setpv
3708 Copies a string into an SV. The string must be null-terminated. Does not
3709 handle 'set' magic. See C<sv_setpv_mg>.
3715 Perl_sv_setpv(pTHX_ register SV *sv, register const char *ptr)
3717 register STRLEN len;
3719 SV_CHECK_THINKFIRST(sv);
3725 (void)SvUPGRADE(sv, SVt_PV);
3727 SvGROW(sv, len + 1);
3728 Move(ptr,SvPVX(sv),len+1,char);
3730 (void)SvPOK_only_UTF8(sv); /* validate pointer */
3735 =for apidoc sv_setpv_mg
3737 Like C<sv_setpv>, but also handles 'set' magic.
3743 Perl_sv_setpv_mg(pTHX_ register SV *sv, register const char *ptr)
3750 =for apidoc sv_usepvn
3752 Tells an SV to use C<ptr> to find its string value. Normally the string is
3753 stored inside the SV but sv_usepvn allows the SV to use an outside string.
3754 The C<ptr> should point to memory that was allocated by C<malloc>. The
3755 string length, C<len>, must be supplied. This function will realloc the
3756 memory pointed to by C<ptr>, so that pointer should not be freed or used by
3757 the programmer after giving it to sv_usepvn. Does not handle 'set' magic.
3758 See C<sv_usepvn_mg>.
3764 Perl_sv_usepvn(pTHX_ register SV *sv, register char *ptr, register STRLEN len)
3766 SV_CHECK_THINKFIRST(sv);
3767 (void)SvUPGRADE(sv, SVt_PV);
3772 (void)SvOOK_off(sv);
3773 if (SvPVX(sv) && SvLEN(sv))
3774 Safefree(SvPVX(sv));
3775 Renew(ptr, len+1, char);
3778 SvLEN_set(sv, len+1);
3780 (void)SvPOK_only_UTF8(sv); /* validate pointer */
3785 =for apidoc sv_usepvn_mg
3787 Like C<sv_usepvn>, but also handles 'set' magic.
3793 Perl_sv_usepvn_mg(pTHX_ register SV *sv, register char *ptr, register STRLEN len)
3795 sv_usepvn(sv,ptr,len);
3800 Perl_sv_force_normal_flags(pTHX_ register SV *sv, U32 flags)
3802 if (SvREADONLY(sv)) {
3804 char *pvx = SvPVX(sv);
3805 STRLEN len = SvCUR(sv);
3806 U32 hash = SvUVX(sv);
3807 SvGROW(sv, len + 1);
3808 Move(pvx,SvPVX(sv),len,char);
3812 unsharepvn(pvx,SvUTF8(sv)?-len:len,hash);
3814 else if (PL_curcop != &PL_compiling)
3815 Perl_croak(aTHX_ PL_no_modify);
3818 sv_unref_flags(sv, flags);
3819 else if (SvFAKE(sv) && SvTYPE(sv) == SVt_PVGV)
3824 Perl_sv_force_normal(pTHX_ register SV *sv)
3826 sv_force_normal_flags(sv, 0);
3832 Efficient removal of characters from the beginning of the string buffer.
3833 SvPOK(sv) must be true and the C<ptr> must be a pointer to somewhere inside
3834 the string buffer. The C<ptr> becomes the first character of the adjusted
3841 Perl_sv_chop(pTHX_ register SV *sv, register char *ptr) /* like set but assuming ptr is in sv */
3845 register STRLEN delta;
3847 if (!ptr || !SvPOKp(sv))
3849 SV_CHECK_THINKFIRST(sv);
3850 if (SvTYPE(sv) < SVt_PVIV)
3851 sv_upgrade(sv,SVt_PVIV);
3854 if (!SvLEN(sv)) { /* make copy of shared string */
3855 char *pvx = SvPVX(sv);
3856 STRLEN len = SvCUR(sv);
3857 SvGROW(sv, len + 1);
3858 Move(pvx,SvPVX(sv),len,char);
3862 SvFLAGS(sv) |= SVf_OOK;
3864 SvFLAGS(sv) &= ~(SVf_IOK|SVf_NOK|SVp_IOK|SVp_NOK|SVf_IVisUV);
3865 delta = ptr - SvPVX(sv);
3873 =for apidoc sv_catpvn
3875 Concatenates the string onto the end of the string which is in the SV. The
3876 C<len> indicates number of bytes to copy. If the SV has the UTF8
3877 status set, then the bytes appended should be valid UTF8.
3878 Handles 'get' magic, but not 'set' magic. See C<sv_catpvn_mg>.
3883 /* sv_catpvn() is aliased to Perl_sv_catpvn_macro; this function provided
3884 for binary compatibility only
3887 Perl_sv_catpvn(pTHX_ SV *dsv, const char* sstr, STRLEN slen)
3889 sv_catpvn_flags(dsv, sstr, slen, SV_GMAGIC);
3893 =for apidoc sv_catpvn_flags
3895 Concatenates the string onto the end of the string which is in the SV. The
3896 C<len> indicates number of bytes to copy. If the SV has the UTF8
3897 status set, then the bytes appended should be valid UTF8.
3898 If C<flags> has C<SV_GMAGIC> bit set, will C<mg_get> on C<dsv> if
3899 appropriate, else not. C<sv_catpvn> and C<sv_catpvn_nomg> are implemented
3900 in terms of this function.
3906 Perl_sv_catpvn_flags(pTHX_ register SV *dsv, register const char *sstr, register STRLEN slen, I32 flags)
3911 dstr = SvPV_force_flags(dsv, dlen, flags);
3912 SvGROW(dsv, dlen + slen + 1);
3915 Move(sstr, SvPVX(dsv) + dlen, slen, char);
3918 (void)SvPOK_only_UTF8(dsv); /* validate pointer */
3923 =for apidoc sv_catpvn_mg
3925 Like C<sv_catpvn>, but also handles 'set' magic.
3931 Perl_sv_catpvn_mg(pTHX_ register SV *sv, register const char *ptr, register STRLEN len)
3933 sv_catpvn(sv,ptr,len);
3938 =for apidoc sv_catsv
3940 Concatenates the string from SV C<ssv> onto the end of the string in
3941 SV C<dsv>. Modifies C<dsv> but not C<ssv>. Handles 'get' magic, but
3942 not 'set' magic. See C<sv_catsv_mg>.
3946 /* sv_catsv() is aliased to Perl_sv_catsv_macro; this function provided
3947 for binary compatibility only
3950 Perl_sv_catsv(pTHX_ SV *dstr, register SV *sstr)
3952 sv_catsv_flags(dstr, sstr, SV_GMAGIC);
3956 =for apidoc sv_catsv_flags
3958 Concatenates the string from SV C<ssv> onto the end of the string in
3959 SV C<dsv>. Modifies C<dsv> but not C<ssv>. If C<flags> has C<SV_GMAGIC>
3960 bit set, will C<mg_get> on the SVs if appropriate, else not. C<sv_catsv>
3961 and C<sv_catsv_nomg> are implemented in terms of this function.
3966 Perl_sv_catsv_flags(pTHX_ SV *dsv, register SV *ssv, I32 flags)
3972 if ((spv = SvPV(ssv, slen))) {
3973 bool sutf8 = DO_UTF8(ssv);
3976 if (SvGMAGICAL(dsv) && (flags & SV_GMAGIC))
3978 dutf8 = DO_UTF8(dsv);
3980 if (dutf8 != sutf8) {
3982 /* Not modifying source SV, so taking a temporary copy. */
3983 SV* csv = sv_2mortal(newSVpvn(spv, slen));
3985 sv_utf8_upgrade(csv);
3986 spv = SvPV(csv, slen);
3989 sv_utf8_upgrade_nomg(dsv);
3991 sv_catpvn_nomg(dsv, spv, slen);
3996 =for apidoc sv_catsv_mg
3998 Like C<sv_catsv>, but also handles 'set' magic.
4004 Perl_sv_catsv_mg(pTHX_ SV *dsv, register SV *ssv)
4011 =for apidoc sv_catpv
4013 Concatenates the string onto the end of the string which is in the SV.
4014 If the SV has the UTF8 status set, then the bytes appended should be
4015 valid UTF8. Handles 'get' magic, but not 'set' magic. See C<sv_catpv_mg>.
4020 Perl_sv_catpv(pTHX_ register SV *sv, register const char *ptr)
4022 register STRLEN len;
4028 junk = SvPV_force(sv, tlen);
4030 SvGROW(sv, tlen + len + 1);
4033 Move(ptr,SvPVX(sv)+tlen,len+1,char);
4035 (void)SvPOK_only_UTF8(sv); /* validate pointer */
4040 =for apidoc sv_catpv_mg
4042 Like C<sv_catpv>, but also handles 'set' magic.
4048 Perl_sv_catpv_mg(pTHX_ register SV *sv, register const char *ptr)
4055 Perl_newSV(pTHX_ STRLEN len)
4061 sv_upgrade(sv, SVt_PV);
4062 SvGROW(sv, len + 1);
4067 /* name is assumed to contain an SV* if (name && namelen == HEf_SVKEY) */
4070 =for apidoc sv_magic
4072 Adds magic to an SV.
4078 Perl_sv_magic(pTHX_ register SV *sv, SV *obj, int how, const char *name, I32 namlen)
4082 if (SvREADONLY(sv)) {
4083 if (PL_curcop != &PL_compiling
4084 /* XXX this used to be !strchr("gBf", how), which seems to
4085 * implicity be equal to !strchr("gBf\0", how), ie \0 matches
4086 * too. I find this suprising, but have hadded PERL_MAGIC_sv
4087 * to the list of things to check - DAPM 19-May-01 */
4088 && how != PERL_MAGIC_regex_global
4089 && how != PERL_MAGIC_bm
4090 && how != PERL_MAGIC_fm
4091 && how != PERL_MAGIC_sv
4094 Perl_croak(aTHX_ PL_no_modify);
4097 if (SvMAGICAL(sv) || (how == PERL_MAGIC_taint && SvTYPE(sv) >= SVt_PVMG)) {
4098 if (SvMAGIC(sv) && (mg = mg_find(sv, how))) {
4099 if (how == PERL_MAGIC_taint)
4105 (void)SvUPGRADE(sv, SVt_PVMG);
4107 Newz(702,mg, 1, MAGIC);
4108 mg->mg_moremagic = SvMAGIC(sv);
4111 /* Some magic sontains a reference loop, where the sv and object refer to
4112 each other. To prevent a avoid a reference loop that would prevent such
4113 objects being freed, we look for such loops and if we find one we avoid
4114 incrementing the object refcount. */
4115 if (!obj || obj == sv ||
4116 how == PERL_MAGIC_arylen ||
4117 how == PERL_MAGIC_qr ||
4118 (SvTYPE(obj) == SVt_PVGV &&
4119 (GvSV(obj) == sv || GvHV(obj) == (HV*)sv || GvAV(obj) == (AV*)sv ||
4120 GvCV(obj) == (CV*)sv || GvIOp(obj) == (IO*)sv ||
4121 GvFORM(obj) == (CV*)sv)))
4126 mg->mg_obj = SvREFCNT_inc(obj);
4127 mg->mg_flags |= MGf_REFCOUNTED;
4130 mg->mg_len = namlen;
4133 mg->mg_ptr = savepvn(name, namlen);
4134 else if (namlen == HEf_SVKEY)
4135 mg->mg_ptr = (char*)SvREFCNT_inc((SV*)name);
4140 mg->mg_virtual = &PL_vtbl_sv;
4142 case PERL_MAGIC_overload:
4143 mg->mg_virtual = &PL_vtbl_amagic;
4145 case PERL_MAGIC_overload_elem:
4146 mg->mg_virtual = &PL_vtbl_amagicelem;
4148 case PERL_MAGIC_overload_table:
4149 mg->mg_virtual = &PL_vtbl_ovrld;
4152 mg->mg_virtual = &PL_vtbl_bm;
4154 case PERL_MAGIC_regdata:
4155 mg->mg_virtual = &PL_vtbl_regdata;
4157 case PERL_MAGIC_regdatum:
4158 mg->mg_virtual = &PL_vtbl_regdatum;
4160 case PERL_MAGIC_env:
4161 mg->mg_virtual = &PL_vtbl_env;
4164 mg->mg_virtual = &PL_vtbl_fm;
4166 case PERL_MAGIC_envelem:
4167 mg->mg_virtual = &PL_vtbl_envelem;
4169 case PERL_MAGIC_regex_global:
4170 mg->mg_virtual = &PL_vtbl_mglob;
4172 case PERL_MAGIC_isa:
4173 mg->mg_virtual = &PL_vtbl_isa;
4175 case PERL_MAGIC_isaelem:
4176 mg->mg_virtual = &PL_vtbl_isaelem;
4178 case PERL_MAGIC_nkeys:
4179 mg->mg_virtual = &PL_vtbl_nkeys;
4181 case PERL_MAGIC_dbfile:
4185 case PERL_MAGIC_dbline:
4186 mg->mg_virtual = &PL_vtbl_dbline;
4189 case PERL_MAGIC_mutex:
4190 mg->mg_virtual = &PL_vtbl_mutex;
4192 #endif /* USE_THREADS */
4193 #ifdef USE_LOCALE_COLLATE
4194 case PERL_MAGIC_collxfrm:
4195 mg->mg_virtual = &PL_vtbl_collxfrm;
4197 #endif /* USE_LOCALE_COLLATE */
4198 case PERL_MAGIC_tied:
4199 mg->mg_virtual = &PL_vtbl_pack;
4201 case PERL_MAGIC_tiedelem:
4202 case PERL_MAGIC_tiedscalar:
4203 mg->mg_virtual = &PL_vtbl_packelem;
4206 mg->mg_virtual = &PL_vtbl_regexp;
4208 case PERL_MAGIC_sig:
4209 mg->mg_virtual = &PL_vtbl_sig;
4211 case PERL_MAGIC_sigelem:
4212 mg->mg_virtual = &PL_vtbl_sigelem;
4214 case PERL_MAGIC_taint:
4215 mg->mg_virtual = &PL_vtbl_taint;
4218 case PERL_MAGIC_uvar:
4219 mg->mg_virtual = &PL_vtbl_uvar;
4221 case PERL_MAGIC_vec:
4222 mg->mg_virtual = &PL_vtbl_vec;
4224 case PERL_MAGIC_substr:
4225 mg->mg_virtual = &PL_vtbl_substr;
4227 case PERL_MAGIC_defelem:
4228 mg->mg_virtual = &PL_vtbl_defelem;
4230 case PERL_MAGIC_glob:
4231 mg->mg_virtual = &PL_vtbl_glob;
4233 case PERL_MAGIC_arylen:
4234 mg->mg_virtual = &PL_vtbl_arylen;
4236 case PERL_MAGIC_pos:
4237 mg->mg_virtual = &PL_vtbl_pos;
4239 case PERL_MAGIC_backref:
4240 mg->mg_virtual = &PL_vtbl_backref;
4242 case PERL_MAGIC_ext:
4243 /* Reserved for use by extensions not perl internals. */
4244 /* Useful for attaching extension internal data to perl vars. */
4245 /* Note that multiple extensions may clash if magical scalars */
4246 /* etc holding private data from one are passed to another. */
4250 Perl_croak(aTHX_ "Don't know how to handle magic of type \\%o", how);
4254 SvFLAGS(sv) &= ~(SVf_IOK|SVf_NOK|SVf_POK);
4258 =for apidoc sv_unmagic
4260 Removes magic from an SV.
4266 Perl_sv_unmagic(pTHX_ SV *sv, int type)
4270 if (SvTYPE(sv) < SVt_PVMG || !SvMAGIC(sv))
4273 for (mg = *mgp; mg; mg = *mgp) {
4274 if (mg->mg_type == type) {
4275 MGVTBL* vtbl = mg->mg_virtual;
4276 *mgp = mg->mg_moremagic;
4277 if (vtbl && vtbl->svt_free)
4278 CALL_FPTR(vtbl->svt_free)(aTHX_ sv, mg);
4279 if (mg->mg_ptr && mg->mg_type != PERL_MAGIC_regex_global) {
4280 if (mg->mg_len >= 0)
4281 Safefree(mg->mg_ptr);
4282 else if (mg->mg_len == HEf_SVKEY)
4283 SvREFCNT_dec((SV*)mg->mg_ptr);
4285 if (mg->mg_flags & MGf_REFCOUNTED)
4286 SvREFCNT_dec(mg->mg_obj);
4290 mgp = &mg->mg_moremagic;
4294 SvFLAGS(sv) |= (SvFLAGS(sv) & (SVp_NOK|SVp_POK)) >> PRIVSHIFT;
4301 =for apidoc sv_rvweaken
4309 Perl_sv_rvweaken(pTHX_ SV *sv)
4312 if (!SvOK(sv)) /* let undefs pass */
4315 Perl_croak(aTHX_ "Can't weaken a nonreference");
4316 else if (SvWEAKREF(sv)) {
4317 if (ckWARN(WARN_MISC))
4318 Perl_warner(aTHX_ WARN_MISC, "Reference is already weak");
4322 sv_add_backref(tsv, sv);
4329 S_sv_add_backref(pTHX_ SV *tsv, SV *sv)
4333 if (SvMAGICAL(tsv) && (mg = mg_find(tsv, PERL_MAGIC_backref)))
4334 av = (AV*)mg->mg_obj;
4337 sv_magic(tsv, (SV*)av, PERL_MAGIC_backref, NULL, 0);
4338 SvREFCNT_dec(av); /* for sv_magic */
4344 S_sv_del_backref(pTHX_ SV *sv)
4351 if (!SvMAGICAL(tsv) || !(mg = mg_find(tsv, PERL_MAGIC_backref)))
4352 Perl_croak(aTHX_ "panic: del_backref");
4353 av = (AV *)mg->mg_obj;
4358 svp[i] = &PL_sv_undef; /* XXX */
4365 =for apidoc sv_insert
4367 Inserts a string at the specified offset/length within the SV. Similar to
4368 the Perl substr() function.
4374 Perl_sv_insert(pTHX_ SV *bigstr, STRLEN offset, STRLEN len, char *little, STRLEN littlelen)
4378 register char *midend;
4379 register char *bigend;
4385 Perl_croak(aTHX_ "Can't modify non-existent substring");
4386 SvPV_force(bigstr, curlen);
4387 (void)SvPOK_only_UTF8(bigstr);
4388 if (offset + len > curlen) {
4389 SvGROW(bigstr, offset+len+1);
4390 Zero(SvPVX(bigstr)+curlen, offset+len-curlen, char);
4391 SvCUR_set(bigstr, offset+len);
4395 i = littlelen - len;
4396 if (i > 0) { /* string might grow */
4397 big = SvGROW(bigstr, SvCUR(bigstr) + i + 1);
4398 mid = big + offset + len;
4399 midend = bigend = big + SvCUR(bigstr);
4402 while (midend > mid) /* shove everything down */
4403 *--bigend = *--midend;
4404 Move(little,big+offset,littlelen,char);
4410 Move(little,SvPVX(bigstr)+offset,len,char);
4415 big = SvPVX(bigstr);
4418 bigend = big + SvCUR(bigstr);
4420 if (midend > bigend)
4421 Perl_croak(aTHX_ "panic: sv_insert");
4423 if (mid - big > bigend - midend) { /* faster to shorten from end */
4425 Move(little, mid, littlelen,char);
4428 i = bigend - midend;
4430 Move(midend, mid, i,char);
4434 SvCUR_set(bigstr, mid - big);
4437 else if ((i = mid - big)) { /* faster from front */
4438 midend -= littlelen;
4440 sv_chop(bigstr,midend-i);
4445 Move(little, mid, littlelen,char);
4447 else if (littlelen) {
4448 midend -= littlelen;
4449 sv_chop(bigstr,midend);
4450 Move(little,midend,littlelen,char);
4453 sv_chop(bigstr,midend);
4459 =for apidoc sv_replace
4461 Make the first argument a copy of the second, then delete the original.
4467 Perl_sv_replace(pTHX_ register SV *sv, register SV *nsv)
4469 U32 refcnt = SvREFCNT(sv);
4470 SV_CHECK_THINKFIRST(sv);
4471 if (SvREFCNT(nsv) != 1 && ckWARN_d(WARN_INTERNAL))
4472 Perl_warner(aTHX_ WARN_INTERNAL, "Reference miscount in sv_replace()");
4473 if (SvMAGICAL(sv)) {
4477 sv_upgrade(nsv, SVt_PVMG);
4478 SvMAGIC(nsv) = SvMAGIC(sv);
4479 SvFLAGS(nsv) |= SvMAGICAL(sv);
4485 assert(!SvREFCNT(sv));
4486 StructCopy(nsv,sv,SV);
4487 SvREFCNT(sv) = refcnt;
4488 SvFLAGS(nsv) |= SVTYPEMASK; /* Mark as freed */
4493 =for apidoc sv_clear
4495 Clear an SV, making it empty. Does not free the memory used by the SV
4502 Perl_sv_clear(pTHX_ register SV *sv)
4506 assert(SvREFCNT(sv) == 0);
4509 if (PL_defstash) { /* Still have a symbol table? */
4514 Zero(&tmpref, 1, SV);
4515 sv_upgrade(&tmpref, SVt_RV);
4517 SvREADONLY_on(&tmpref); /* DESTROY() could be naughty */
4518 SvREFCNT(&tmpref) = 1;
4521 stash = SvSTASH(sv);
4522 destructor = StashHANDLER(stash,DESTROY);
4525 PUSHSTACKi(PERLSI_DESTROY);
4526 SvRV(&tmpref) = SvREFCNT_inc(sv);
4531 call_sv((SV*)destructor, G_DISCARD|G_EVAL|G_KEEPERR);
4537 } while (SvOBJECT(sv) && SvSTASH(sv) != stash);
4539 del_XRV(SvANY(&tmpref));
4542 if (PL_in_clean_objs)
4543 Perl_croak(aTHX_ "DESTROY created new reference to dead object '%s'",
4545 /* DESTROY gave object new lease on life */
4551 SvREFCNT_dec(SvSTASH(sv)); /* possibly of changed persuasion */
4552 SvOBJECT_off(sv); /* Curse the object. */
4553 if (SvTYPE(sv) != SVt_PVIO)
4554 --PL_sv_objcount; /* XXX Might want something more general */
4557 if (SvTYPE(sv) >= SVt_PVMG && SvMAGIC(sv))
4560 switch (SvTYPE(sv)) {
4563 IoIFP(sv) != PerlIO_stdin() &&
4564 IoIFP(sv) != PerlIO_stdout() &&
4565 IoIFP(sv) != PerlIO_stderr())
4567 io_close((IO*)sv, FALSE);
4569 if (IoDIRP(sv) && !(IoFLAGS(sv) & IOf_FAKE_DIRP))
4570 PerlDir_close(IoDIRP(sv));
4571 IoDIRP(sv) = (DIR*)NULL;
4572 Safefree(IoTOP_NAME(sv));
4573 Safefree(IoFMT_NAME(sv));
4574 Safefree(IoBOTTOM_NAME(sv));
4589 SvREFCNT_dec(LvTARG(sv));
4593 Safefree(GvNAME(sv));
4594 /* cannot decrease stash refcount yet, as we might recursively delete
4595 ourselves when the refcnt drops to zero. Delay SvREFCNT_dec
4596 of stash until current sv is completely gone.
4597 -- JohnPC, 27 Mar 1998 */
4598 stash = GvSTASH(sv);
4604 (void)SvOOK_off(sv);
4612 SvREFCNT_dec(SvRV(sv));
4614 else if (SvPVX(sv) && SvLEN(sv))
4615 Safefree(SvPVX(sv));
4616 else if (SvPVX(sv) && SvREADONLY(sv) && SvFAKE(sv)) {
4617 unsharepvn(SvPVX(sv),SvUTF8(sv)?-SvCUR(sv):SvCUR(sv),SvUVX(sv));
4629 switch (SvTYPE(sv)) {
4645 del_XPVIV(SvANY(sv));
4648 del_XPVNV(SvANY(sv));
4651 del_XPVMG(SvANY(sv));
4654 del_XPVLV(SvANY(sv));
4657 del_XPVAV(SvANY(sv));
4660 del_XPVHV(SvANY(sv));
4663 del_XPVCV(SvANY(sv));
4666 del_XPVGV(SvANY(sv));
4667 /* code duplication for increased performance. */
4668 SvFLAGS(sv) &= SVf_BREAK;
4669 SvFLAGS(sv) |= SVTYPEMASK;
4670 /* decrease refcount of the stash that owns this GV, if any */
4672 SvREFCNT_dec(stash);
4673 return; /* not break, SvFLAGS reset already happened */
4675 del_XPVBM(SvANY(sv));
4678 del_XPVFM(SvANY(sv));
4681 del_XPVIO(SvANY(sv));
4684 SvFLAGS(sv) &= SVf_BREAK;
4685 SvFLAGS(sv) |= SVTYPEMASK;
4689 Perl_sv_newref(pTHX_ SV *sv)
4692 ATOMIC_INC(SvREFCNT(sv));
4699 Free the memory used by an SV.
4705 Perl_sv_free(pTHX_ SV *sv)
4707 int refcount_is_zero;
4711 if (SvREFCNT(sv) == 0) {
4712 if (SvFLAGS(sv) & SVf_BREAK)
4714 if (PL_in_clean_all) /* All is fair */
4716 if (SvREADONLY(sv) && SvIMMORTAL(sv)) {
4717 /* make sure SvREFCNT(sv)==0 happens very seldom */
4718 SvREFCNT(sv) = (~(U32)0)/2;
4721 if (ckWARN_d(WARN_INTERNAL))
4722 Perl_warner(aTHX_ WARN_INTERNAL, "Attempt to free unreferenced scalar");
4725 ATOMIC_DEC_AND_TEST(refcount_is_zero, SvREFCNT(sv));
4726 if (!refcount_is_zero)
4730 if (ckWARN_d(WARN_DEBUGGING))
4731 Perl_warner(aTHX_ WARN_DEBUGGING,
4732 "Attempt to free temp prematurely: SV 0x%"UVxf,
4737 if (SvREADONLY(sv) && SvIMMORTAL(sv)) {
4738 /* make sure SvREFCNT(sv)==0 happens very seldom */
4739 SvREFCNT(sv) = (~(U32)0)/2;
4750 Returns the length of the string in the SV. See also C<SvCUR>.
4756 Perl_sv_len(pTHX_ register SV *sv)
4765 len = mg_length(sv);
4767 junk = SvPV(sv, len);
4772 =for apidoc sv_len_utf8
4774 Returns the number of characters in the string in an SV, counting wide
4775 UTF8 bytes as a single character.
4781 Perl_sv_len_utf8(pTHX_ register SV *sv)
4787 return mg_length(sv);
4791 U8 *s = (U8*)SvPV(sv, len);
4793 return Perl_utf8_length(aTHX_ s, s + len);
4798 Perl_sv_pos_u2b(pTHX_ register SV *sv, I32* offsetp, I32* lenp)
4803 I32 uoffset = *offsetp;
4809 start = s = (U8*)SvPV(sv, len);
4811 while (s < send && uoffset--)
4815 *offsetp = s - start;
4819 while (s < send && ulen--)
4829 Perl_sv_pos_b2u(pTHX_ register SV *sv, I32* offsetp)
4838 s = (U8*)SvPV(sv, len);
4840 Perl_croak(aTHX_ "panic: sv_pos_b2u: bad byte offset");
4841 send = s + *offsetp;
4845 /* Call utf8n_to_uvchr() to validate the sequence */
4846 utf8n_to_uvchr(s, UTF8SKIP(s), &n, 0);
4861 Returns a boolean indicating whether the strings in the two SVs are
4868 Perl_sv_eq(pTHX_ register SV *sv1, register SV *sv2)
4882 pv1 = SvPV(sv1, cur1);
4889 pv2 = SvPV(sv2, cur2);
4891 /* do not utf8ize the comparands as a side-effect */
4892 if (cur1 && cur2 && SvUTF8(sv1) != SvUTF8(sv2) && !IN_BYTE) {
4893 bool is_utf8 = TRUE;
4894 /* UTF-8ness differs */
4895 if (PL_hints & HINT_UTF8_DISTINCT)
4899 /* sv1 is the UTF-8 one , If is equal it must be downgrade-able */
4900 char *pv = (char*)bytes_from_utf8((U8*)pv1, &cur1, &is_utf8);
4905 /* sv2 is the UTF-8 one , If is equal it must be downgrade-able */
4906 char *pv = (char *)bytes_from_utf8((U8*)pv2, &cur2, &is_utf8);
4911 /* Downgrade not possible - cannot be eq */
4917 eq = memEQ(pv1, pv2, cur1);
4928 Compares the strings in two SVs. Returns -1, 0, or 1 indicating whether the
4929 string in C<sv1> is less than, equal to, or greater than the string in
4936 Perl_sv_cmp(pTHX_ register SV *sv1, register SV *sv2)
4941 bool pv1tmp = FALSE;
4942 bool pv2tmp = FALSE;
4949 pv1 = SvPV(sv1, cur1);
4956 pv2 = SvPV(sv2, cur2);
4958 /* do not utf8ize the comparands as a side-effect */
4959 if (cur1 && cur2 && SvUTF8(sv1) != SvUTF8(sv2) && !IN_BYTE) {
4960 if (PL_hints & HINT_UTF8_DISTINCT)
4961 return SvUTF8(sv1) ? 1 : -1;
4964 pv2 = (char*)bytes_to_utf8((U8*)pv2, &cur2);
4968 pv1 = (char*)bytes_to_utf8((U8*)pv1, &cur1);
4974 cmp = cur2 ? -1 : 0;
4978 I32 retval = memcmp((void*)pv1, (void*)pv2, cur1 < cur2 ? cur1 : cur2);
4981 cmp = retval < 0 ? -1 : 1;
4982 } else if (cur1 == cur2) {
4985 cmp = cur1 < cur2 ? -1 : 1;
4998 =for apidoc sv_cmp_locale
5000 Compares the strings in two SVs in a locale-aware manner. See
5007 Perl_sv_cmp_locale(pTHX_ register SV *sv1, register SV *sv2)
5009 #ifdef USE_LOCALE_COLLATE
5015 if (PL_collation_standard)
5019 pv1 = sv1 ? sv_collxfrm(sv1, &len1) : (char *) NULL;
5021 pv2 = sv2 ? sv_collxfrm(sv2, &len2) : (char *) NULL;
5023 if (!pv1 || !len1) {
5034 retval = memcmp((void*)pv1, (void*)pv2, len1 < len2 ? len1 : len2);
5037 return retval < 0 ? -1 : 1;
5040 * When the result of collation is equality, that doesn't mean
5041 * that there are no differences -- some locales exclude some
5042 * characters from consideration. So to avoid false equalities,
5043 * we use the raw string as a tiebreaker.
5049 #endif /* USE_LOCALE_COLLATE */
5051 return sv_cmp(sv1, sv2);
5054 #ifdef USE_LOCALE_COLLATE
5056 * Any scalar variable may carry PERL_MAGIC_collxfrm magic that contains the
5057 * scalar data of the variable transformed to such a format that
5058 * a normal memory comparison can be used to compare the data
5059 * according to the locale settings.
5062 Perl_sv_collxfrm(pTHX_ SV *sv, STRLEN *nxp)
5066 mg = SvMAGICAL(sv) ? mg_find(sv, PERL_MAGIC_collxfrm) : (MAGIC *) NULL;
5067 if (!mg || !mg->mg_ptr || *(U32*)mg->mg_ptr != PL_collation_ix) {
5072 Safefree(mg->mg_ptr);
5074 if ((xf = mem_collxfrm(s, len, &xlen))) {
5075 if (SvREADONLY(sv)) {
5078 return xf + sizeof(PL_collation_ix);
5081 sv_magic(sv, 0, PERL_MAGIC_collxfrm, 0, 0);
5082 mg = mg_find(sv, PERL_MAGIC_collxfrm);
5095 if (mg && mg->mg_ptr) {
5097 return mg->mg_ptr + sizeof(PL_collation_ix);
5105 #endif /* USE_LOCALE_COLLATE */
5110 Get a line from the filehandle and store it into the SV, optionally
5111 appending to the currently-stored string.
5117 Perl_sv_gets(pTHX_ register SV *sv, register PerlIO *fp, I32 append)
5121 register STDCHAR rslast;
5122 register STDCHAR *bp;
5126 SV_CHECK_THINKFIRST(sv);
5127 (void)SvUPGRADE(sv, SVt_PV);
5131 if (RsSNARF(PL_rs)) {
5135 else if (RsRECORD(PL_rs)) {
5136 I32 recsize, bytesread;
5139 /* Grab the size of the record we're getting */
5140 recsize = SvIV(SvRV(PL_rs));
5141 (void)SvPOK_only(sv); /* Validate pointer */
5142 buffer = SvGROW(sv, recsize + 1);
5145 /* VMS wants read instead of fread, because fread doesn't respect */
5146 /* RMS record boundaries. This is not necessarily a good thing to be */
5147 /* doing, but we've got no other real choice */
5148 bytesread = PerlLIO_read(PerlIO_fileno(fp), buffer, recsize);
5150 bytesread = PerlIO_read(fp, buffer, recsize);
5152 SvCUR_set(sv, bytesread);
5153 buffer[bytesread] = '\0';
5154 if (PerlIO_isutf8(fp))
5158 return(SvCUR(sv) ? SvPVX(sv) : Nullch);
5160 else if (RsPARA(PL_rs)) {
5165 /* Get $/ i.e. PL_rs into same encoding as stream wants */
5166 if (PerlIO_isutf8(fp)) {
5167 rsptr = SvPVutf8(PL_rs, rslen);
5170 if (SvUTF8(PL_rs)) {
5171 if (!sv_utf8_downgrade(PL_rs, TRUE)) {
5172 Perl_croak(aTHX_ "Wide character in $/");
5175 rsptr = SvPV(PL_rs, rslen);
5179 rslast = rslen ? rsptr[rslen - 1] : '\0';
5181 if (RsPARA(PL_rs)) { /* have to do this both before and after */
5182 do { /* to make sure file boundaries work right */
5185 i = PerlIO_getc(fp);
5189 PerlIO_ungetc(fp,i);
5195 /* See if we know enough about I/O mechanism to cheat it ! */
5197 /* This used to be #ifdef test - it is made run-time test for ease
5198 of abstracting out stdio interface. One call should be cheap
5199 enough here - and may even be a macro allowing compile
5203 if (PerlIO_fast_gets(fp)) {
5206 * We're going to steal some values from the stdio struct
5207 * and put EVERYTHING in the innermost loop into registers.
5209 register STDCHAR *ptr;
5213 #if defined(VMS) && defined(PERLIO_IS_STDIO)
5214 /* An ungetc()d char is handled separately from the regular
5215 * buffer, so we getc() it back out and stuff it in the buffer.
5217 i = PerlIO_getc(fp);
5218 if (i == EOF) return 0;
5219 *(--((*fp)->_ptr)) = (unsigned char) i;
5223 /* Here is some breathtakingly efficient cheating */
5225 cnt = PerlIO_get_cnt(fp); /* get count into register */
5226 (void)SvPOK_only(sv); /* validate pointer */
5227 if (SvLEN(sv) - append <= cnt + 1) { /* make sure we have the room */
5228 if (cnt > 80 && SvLEN(sv) > append) {
5229 shortbuffered = cnt - SvLEN(sv) + append + 1;
5230 cnt -= shortbuffered;
5234 /* remember that cnt can be negative */
5235 SvGROW(sv, append + (cnt <= 0 ? 2 : (cnt + 1)));
5240 bp = (STDCHAR*)SvPVX(sv) + append; /* move these two too to registers */
5241 ptr = (STDCHAR*)PerlIO_get_ptr(fp);
5242 DEBUG_P(PerlIO_printf(Perl_debug_log,
5243 "Screamer: entering, ptr=%"UVuf", cnt=%ld\n",PTR2UV(ptr),(long)cnt));
5244 DEBUG_P(PerlIO_printf(Perl_debug_log,
5245 "Screamer: entering: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
5246 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
5247 PTR2UV(PerlIO_has_base(fp) ? PerlIO_get_base(fp) : 0)));
5252 while (cnt > 0) { /* this | eat */
5254 if ((*bp++ = *ptr++) == rslast) /* really | dust */
5255 goto thats_all_folks; /* screams | sed :-) */
5259 Copy(ptr, bp, cnt, char); /* this | eat */
5260 bp += cnt; /* screams | dust */
5261 ptr += cnt; /* louder | sed :-) */
5266 if (shortbuffered) { /* oh well, must extend */
5267 cnt = shortbuffered;
5269 bpx = bp - (STDCHAR*)SvPVX(sv); /* box up before relocation */
5271 SvGROW(sv, SvLEN(sv) + append + cnt + 2);
5272 bp = (STDCHAR*)SvPVX(sv) + bpx; /* unbox after relocation */
5276 DEBUG_P(PerlIO_printf(Perl_debug_log,
5277 "Screamer: going to getc, ptr=%"UVuf", cnt=%ld\n",
5278 PTR2UV(ptr),(long)cnt));
5279 PerlIO_set_ptrcnt(fp, ptr, cnt); /* deregisterize cnt and ptr */
5280 DEBUG_P(PerlIO_printf(Perl_debug_log,
5281 "Screamer: pre: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
5282 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
5283 PTR2UV(PerlIO_has_base (fp) ? PerlIO_get_base(fp) : 0)));
5284 /* This used to call 'filbuf' in stdio form, but as that behaves like
5285 getc when cnt <= 0 we use PerlIO_getc here to avoid introducing
5286 another abstraction. */
5287 i = PerlIO_getc(fp); /* get more characters */
5288 DEBUG_P(PerlIO_printf(Perl_debug_log,
5289 "Screamer: post: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
5290 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
5291 PTR2UV(PerlIO_has_base (fp) ? PerlIO_get_base(fp) : 0)));
5292 cnt = PerlIO_get_cnt(fp);
5293 ptr = (STDCHAR*)PerlIO_get_ptr(fp); /* reregisterize cnt and ptr */
5294 DEBUG_P(PerlIO_printf(Perl_debug_log,
5295 "Screamer: after getc, ptr=%"UVuf", cnt=%ld\n",PTR2UV(ptr),(long)cnt));
5297 if (i == EOF) /* all done for ever? */
5298 goto thats_really_all_folks;
5300 bpx = bp - (STDCHAR*)SvPVX(sv); /* box up before relocation */
5302 SvGROW(sv, bpx + cnt + 2);
5303 bp = (STDCHAR*)SvPVX(sv) + bpx; /* unbox after relocation */
5305 *bp++ = i; /* store character from PerlIO_getc */
5307 if (rslen && (STDCHAR)i == rslast) /* all done for now? */
5308 goto thats_all_folks;
5312 if ((rslen > 1 && (bp - (STDCHAR*)SvPVX(sv) < rslen)) ||
5313 memNE((char*)bp - rslen, rsptr, rslen))
5314 goto screamer; /* go back to the fray */
5315 thats_really_all_folks:
5317 cnt += shortbuffered;
5318 DEBUG_P(PerlIO_printf(Perl_debug_log,
5319 "Screamer: quitting, ptr=%"UVuf", cnt=%ld\n",PTR2UV(ptr),(long)cnt));
5320 PerlIO_set_ptrcnt(fp, ptr, cnt); /* put these back or we're in trouble */
5321 DEBUG_P(PerlIO_printf(Perl_debug_log,
5322 "Screamer: end: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
5323 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
5324 PTR2UV(PerlIO_has_base (fp) ? PerlIO_get_base(fp) : 0)));
5326 SvCUR_set(sv, bp - (STDCHAR*)SvPVX(sv)); /* set length */
5327 DEBUG_P(PerlIO_printf(Perl_debug_log,
5328 "Screamer: done, len=%ld, string=|%.*s|\n",
5329 (long)SvCUR(sv),(int)SvCUR(sv),SvPVX(sv)));
5334 /*The big, slow, and stupid way */
5337 /* Need to work around EPOC SDK features */
5338 /* On WINS: MS VC5 generates calls to _chkstk, */
5339 /* if a `large' stack frame is allocated */
5340 /* gcc on MARM does not generate calls like these */
5346 register STDCHAR *bpe = buf + sizeof(buf);
5348 while ((i = PerlIO_getc(fp)) != EOF && (*bp++ = i) != rslast && bp < bpe)
5349 ; /* keep reading */
5353 cnt = PerlIO_read(fp,(char*)buf, sizeof(buf));
5354 /* Accomodate broken VAXC compiler, which applies U8 cast to
5355 * both args of ?: operator, causing EOF to change into 255
5357 if (cnt) { i = (U8)buf[cnt - 1]; } else { i = EOF; }
5361 sv_catpvn(sv, (char *) buf, cnt);
5363 sv_setpvn(sv, (char *) buf, cnt);
5365 if (i != EOF && /* joy */
5367 SvCUR(sv) < rslen ||
5368 memNE(SvPVX(sv) + SvCUR(sv) - rslen, rsptr, rslen)))
5372 * If we're reading from a TTY and we get a short read,
5373 * indicating that the user hit his EOF character, we need
5374 * to notice it now, because if we try to read from the TTY
5375 * again, the EOF condition will disappear.
5377 * The comparison of cnt to sizeof(buf) is an optimization
5378 * that prevents unnecessary calls to feof().
5382 if (!(cnt < sizeof(buf) && PerlIO_eof(fp)))
5387 if (RsPARA(PL_rs)) { /* have to do this both before and after */
5388 while (i != EOF) { /* to make sure file boundaries work right */
5389 i = PerlIO_getc(fp);
5391 PerlIO_ungetc(fp,i);
5397 if (PerlIO_isutf8(fp))
5402 return (SvCUR(sv) - append) ? SvPVX(sv) : Nullch;
5409 Auto-increment of the value in the SV.
5415 Perl_sv_inc(pTHX_ register SV *sv)
5424 if (SvTHINKFIRST(sv)) {
5425 if (SvREADONLY(sv)) {
5426 if (PL_curcop != &PL_compiling)
5427 Perl_croak(aTHX_ PL_no_modify);
5431 if (SvAMAGIC(sv) && AMG_CALLun(sv,inc))
5433 i = PTR2IV(SvRV(sv));
5438 flags = SvFLAGS(sv);
5439 if ((flags & (SVp_NOK|SVp_IOK)) == SVp_NOK) {
5440 /* It's (privately or publicly) a float, but not tested as an
5441 integer, so test it to see. */
5443 flags = SvFLAGS(sv);
5445 if ((flags & SVf_IOK) || ((flags & (SVp_IOK | SVp_NOK)) == SVp_IOK)) {
5446 /* It's publicly an integer, or privately an integer-not-float */
5449 if (SvUVX(sv) == UV_MAX)
5450 sv_setnv(sv, (NV)UV_MAX + 1.0);
5452 (void)SvIOK_only_UV(sv);
5455 if (SvIVX(sv) == IV_MAX)
5456 sv_setuv(sv, (UV)IV_MAX + 1);
5458 (void)SvIOK_only(sv);
5464 if (flags & SVp_NOK) {
5465 (void)SvNOK_only(sv);
5470 if (!(flags & SVp_POK) || !*SvPVX(sv)) {
5471 if ((flags & SVTYPEMASK) < SVt_PVIV)
5472 sv_upgrade(sv, SVt_IV);
5473 (void)SvIOK_only(sv);
5478 while (isALPHA(*d)) d++;
5479 while (isDIGIT(*d)) d++;
5481 #ifdef PERL_PRESERVE_IVUV
5482 /* Got to punt this an an integer if needs be, but we don't issue
5483 warnings. Probably ought to make the sv_iv_please() that does
5484 the conversion if possible, and silently. */
5485 I32 numtype = looks_like_number(sv);
5486 if (numtype && !(numtype & IS_NUMBER_INFINITY)) {
5487 /* Need to try really hard to see if it's an integer.
5488 9.22337203685478e+18 is an integer.
5489 but "9.22337203685478e+18" + 0 is UV=9223372036854779904
5490 so $a="9.22337203685478e+18"; $a+0; $a++
5491 needs to be the same as $a="9.22337203685478e+18"; $a++
5498 /* sv_2iv *should* have made this an NV */
5499 if (flags & SVp_NOK) {
5500 (void)SvNOK_only(sv);
5504 /* I don't think we can get here. Maybe I should assert this
5505 And if we do get here I suspect that sv_setnv will croak. NWC
5507 #if defined(USE_LONG_DOUBLE)
5508 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",
5509 SvPVX(sv), SvIVX(sv), SvNVX(sv)));
5511 DEBUG_c(PerlIO_printf(Perl_debug_log,"sv_inc punt failed to convert '%s' to IOK or NOKp, UV=0x%"UVxf" NV=%g\n",
5512 SvPVX(sv), SvIVX(sv), SvNVX(sv)));
5515 #endif /* PERL_PRESERVE_IVUV */
5516 sv_setnv(sv,Atof(SvPVX(sv)) + 1.0);
5520 while (d >= SvPVX(sv)) {
5528 /* MKS: The original code here died if letters weren't consecutive.
5529 * at least it didn't have to worry about non-C locales. The
5530 * new code assumes that ('z'-'a')==('Z'-'A'), letters are
5531 * arranged in order (although not consecutively) and that only
5532 * [A-Za-z] are accepted by isALPHA in the C locale.
5534 if (*d != 'z' && *d != 'Z') {
5535 do { ++*d; } while (!isALPHA(*d));
5538 *(d--) -= 'z' - 'a';
5543 *(d--) -= 'z' - 'a' + 1;
5547 /* oh,oh, the number grew */
5548 SvGROW(sv, SvCUR(sv) + 2);
5550 for (d = SvPVX(sv) + SvCUR(sv); d > SvPVX(sv); d--)
5561 Auto-decrement of the value in the SV.
5567 Perl_sv_dec(pTHX_ register SV *sv)
5575 if (SvTHINKFIRST(sv)) {
5576 if (SvREADONLY(sv)) {
5577 if (PL_curcop != &PL_compiling)
5578 Perl_croak(aTHX_ PL_no_modify);
5582 if (SvAMAGIC(sv) && AMG_CALLun(sv,dec))
5584 i = PTR2IV(SvRV(sv));
5589 /* Unlike sv_inc we don't have to worry about string-never-numbers
5590 and keeping them magic. But we mustn't warn on punting */
5591 flags = SvFLAGS(sv);
5592 if ((flags & SVf_IOK) || ((flags & (SVp_IOK | SVp_NOK)) == SVp_IOK)) {
5593 /* It's publicly an integer, or privately an integer-not-float */
5596 if (SvUVX(sv) == 0) {
5597 (void)SvIOK_only(sv);
5601 (void)SvIOK_only_UV(sv);
5605 if (SvIVX(sv) == IV_MIN)
5606 sv_setnv(sv, (NV)IV_MIN - 1.0);
5608 (void)SvIOK_only(sv);
5614 if (flags & SVp_NOK) {
5616 (void)SvNOK_only(sv);
5619 if (!(flags & SVp_POK)) {
5620 if ((flags & SVTYPEMASK) < SVt_PVNV)
5621 sv_upgrade(sv, SVt_NV);
5623 (void)SvNOK_only(sv);
5626 #ifdef PERL_PRESERVE_IVUV
5628 I32 numtype = looks_like_number(sv);
5629 if (numtype && !(numtype & IS_NUMBER_INFINITY)) {
5630 /* Need to try really hard to see if it's an integer.
5631 9.22337203685478e+18 is an integer.
5632 but "9.22337203685478e+18" + 0 is UV=9223372036854779904
5633 so $a="9.22337203685478e+18"; $a+0; $a--
5634 needs to be the same as $a="9.22337203685478e+18"; $a--
5641 /* sv_2iv *should* have made this an NV */
5642 if (flags & SVp_NOK) {
5643 (void)SvNOK_only(sv);
5647 /* I don't think we can get here. Maybe I should assert this
5648 And if we do get here I suspect that sv_setnv will croak. NWC
5650 #if defined(USE_LONG_DOUBLE)
5651 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",
5652 SvPVX(sv), SvIVX(sv), SvNVX(sv)));
5654 DEBUG_c(PerlIO_printf(Perl_debug_log,"sv_dec punt failed to convert '%s' to IOK or NOKp, UV=0x%"UVxf" NV=%g\n",
5655 SvPVX(sv), SvIVX(sv), SvNVX(sv)));
5659 #endif /* PERL_PRESERVE_IVUV */
5660 sv_setnv(sv,Atof(SvPVX(sv)) - 1.0); /* punt */
5664 =for apidoc sv_mortalcopy
5666 Creates a new SV which is a copy of the original SV. The new SV is marked
5672 /* Make a string that will exist for the duration of the expression
5673 * evaluation. Actually, it may have to last longer than that, but
5674 * hopefully we won't free it until it has been assigned to a
5675 * permanent location. */
5678 Perl_sv_mortalcopy(pTHX_ SV *oldstr)
5683 sv_setsv(sv,oldstr);
5685 PL_tmps_stack[++PL_tmps_ix] = sv;
5691 =for apidoc sv_newmortal
5693 Creates a new SV which is mortal. The reference count of the SV is set to 1.
5699 Perl_sv_newmortal(pTHX)
5704 SvFLAGS(sv) = SVs_TEMP;
5706 PL_tmps_stack[++PL_tmps_ix] = sv;
5711 =for apidoc sv_2mortal
5713 Marks an SV as mortal. The SV will be destroyed when the current context
5719 /* same thing without the copying */
5722 Perl_sv_2mortal(pTHX_ register SV *sv)
5726 if (SvREADONLY(sv) && SvIMMORTAL(sv))
5729 PL_tmps_stack[++PL_tmps_ix] = sv;
5737 Creates a new SV and copies a string into it. The reference count for the
5738 SV is set to 1. If C<len> is zero, Perl will compute the length using
5739 strlen(). For efficiency, consider using C<newSVpvn> instead.
5745 Perl_newSVpv(pTHX_ const char *s, STRLEN len)
5752 sv_setpvn(sv,s,len);
5757 =for apidoc newSVpvn
5759 Creates a new SV and copies a string into it. The reference count for the
5760 SV is set to 1. Note that if C<len> is zero, Perl will create a zero length
5761 string. You are responsible for ensuring that the source string is at least
5768 Perl_newSVpvn(pTHX_ const char *s, STRLEN len)
5773 sv_setpvn(sv,s,len);
5778 =for apidoc newSVpvn_share
5780 Creates a new SV and populates it with a string from
5781 the string table. Turns on READONLY and FAKE.
5782 The idea here is that as string table is used for shared hash
5783 keys these strings will have SvPVX == HeKEY and hash lookup
5784 will avoid string compare.
5790 Perl_newSVpvn_share(pTHX_ const char *src, I32 len, U32 hash)
5793 bool is_utf8 = FALSE;
5798 if (is_utf8 && !(PL_hints & HINT_UTF8_DISTINCT)) {
5799 STRLEN tmplen = len;
5800 /* See the note in hv.c:hv_fetch() --jhi */
5801 src = (char*)bytes_from_utf8((U8*)src, &tmplen, &is_utf8);
5805 PERL_HASH(hash, src, len);
5807 sv_upgrade(sv, SVt_PVIV);
5808 SvPVX(sv) = sharepvn(src, is_utf8?-len:len, hash);
5820 #if defined(PERL_IMPLICIT_CONTEXT)
5822 Perl_newSVpvf_nocontext(const char* pat, ...)
5827 va_start(args, pat);
5828 sv = vnewSVpvf(pat, &args);
5835 =for apidoc newSVpvf
5837 Creates a new SV an initialize it with the string formatted like
5844 Perl_newSVpvf(pTHX_ const char* pat, ...)
5848 va_start(args, pat);
5849 sv = vnewSVpvf(pat, &args);
5855 Perl_vnewSVpvf(pTHX_ const char* pat, va_list* args)
5859 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
5866 Creates a new SV and copies a floating point value into it.
5867 The reference count for the SV is set to 1.
5873 Perl_newSVnv(pTHX_ NV n)
5885 Creates a new SV and copies an integer into it. The reference count for the
5892 Perl_newSViv(pTHX_ IV i)
5904 Creates a new SV and copies an unsigned integer into it.
5905 The reference count for the SV is set to 1.
5911 Perl_newSVuv(pTHX_ UV u)
5921 =for apidoc newRV_noinc
5923 Creates an RV wrapper for an SV. The reference count for the original
5924 SV is B<not> incremented.
5930 Perl_newRV_noinc(pTHX_ SV *tmpRef)
5935 sv_upgrade(sv, SVt_RV);
5942 /* newRV_inc is #defined to newRV in sv.h */
5944 Perl_newRV(pTHX_ SV *tmpRef)
5946 return newRV_noinc(SvREFCNT_inc(tmpRef));
5952 Creates a new SV which is an exact duplicate of the original SV.
5957 /* make an exact duplicate of old */
5960 Perl_newSVsv(pTHX_ register SV *old)
5966 if (SvTYPE(old) == SVTYPEMASK) {
5967 if (ckWARN_d(WARN_INTERNAL))
5968 Perl_warner(aTHX_ WARN_INTERNAL, "semi-panic: attempt to dup freed string");
5983 Perl_sv_reset(pTHX_ register char *s, HV *stash)
5991 char todo[PERL_UCHAR_MAX+1];
5996 if (!*s) { /* reset ?? searches */
5997 for (pm = HvPMROOT(stash); pm; pm = pm->op_pmnext) {
5998 pm->op_pmdynflags &= ~PMdf_USED;
6003 /* reset variables */
6005 if (!HvARRAY(stash))
6008 Zero(todo, 256, char);
6010 i = (unsigned char)*s;
6014 max = (unsigned char)*s++;
6015 for ( ; i <= max; i++) {
6018 for (i = 0; i <= (I32) HvMAX(stash); i++) {
6019 for (entry = HvARRAY(stash)[i];
6021 entry = HeNEXT(entry))
6023 if (!todo[(U8)*HeKEY(entry)])
6025 gv = (GV*)HeVAL(entry);
6027 if (SvTHINKFIRST(sv)) {
6028 if (!SvREADONLY(sv) && SvROK(sv))
6033 if (SvTYPE(sv) >= SVt_PV) {
6035 if (SvPVX(sv) != Nullch)
6042 if (GvHV(gv) && !HvNAME(GvHV(gv))) {
6044 #ifdef USE_ENVIRON_ARRAY
6046 environ[0] = Nullch;
6055 Perl_sv_2io(pTHX_ SV *sv)
6061 switch (SvTYPE(sv)) {
6069 Perl_croak(aTHX_ "Bad filehandle: %s", GvNAME(gv));
6073 Perl_croak(aTHX_ PL_no_usym, "filehandle");
6075 return sv_2io(SvRV(sv));
6076 gv = gv_fetchpv(SvPV(sv,n_a), FALSE, SVt_PVIO);
6082 Perl_croak(aTHX_ "Bad filehandle: %s", SvPV(sv,n_a));
6089 Perl_sv_2cv(pTHX_ SV *sv, HV **st, GV **gvp, I32 lref)
6096 return *gvp = Nullgv, Nullcv;
6097 switch (SvTYPE(sv)) {
6116 SV **sp = &sv; /* Used in tryAMAGICunDEREF macro. */
6117 tryAMAGICunDEREF(to_cv);
6120 if (SvTYPE(sv) == SVt_PVCV) {
6129 Perl_croak(aTHX_ "Not a subroutine reference");
6134 gv = gv_fetchpv(SvPV(sv, n_a), lref, SVt_PVCV);
6140 if (lref && !GvCVu(gv)) {
6143 tmpsv = NEWSV(704,0);
6144 gv_efullname3(tmpsv, gv, Nullch);
6145 /* XXX this is probably not what they think they're getting.
6146 * It has the same effect as "sub name;", i.e. just a forward
6148 newSUB(start_subparse(FALSE, 0),
6149 newSVOP(OP_CONST, 0, tmpsv),
6154 Perl_croak(aTHX_ "Unable to create sub named \"%s\"", SvPV(sv,n_a));
6163 Returns true if the SV has a true value by Perl's rules.
6169 Perl_sv_true(pTHX_ register SV *sv)
6175 if ((tXpv = (XPV*)SvANY(sv)) &&
6176 (tXpv->xpv_cur > 1 ||
6177 (tXpv->xpv_cur && *tXpv->xpv_pv != '0')))
6184 return SvIVX(sv) != 0;
6187 return SvNVX(sv) != 0.0;
6189 return sv_2bool(sv);
6195 Perl_sv_iv(pTHX_ register SV *sv)
6199 return (IV)SvUVX(sv);
6206 Perl_sv_uv(pTHX_ register SV *sv)
6211 return (UV)SvIVX(sv);
6217 Perl_sv_nv(pTHX_ register SV *sv)
6225 Perl_sv_pv(pTHX_ SV *sv)
6232 return sv_2pv(sv, &n_a);
6236 Perl_sv_pvn(pTHX_ SV *sv, STRLEN *lp)
6242 return sv_2pv(sv, lp);
6246 =for apidoc sv_pvn_force
6248 Get a sensible string out of the SV somehow.
6254 Perl_sv_pvn_force(pTHX_ SV *sv, STRLEN *lp)
6256 sv_pvn_force_flags(sv, lp, SV_GMAGIC);
6260 =for apidoc sv_pvn_force_flags
6262 Get a sensible string out of the SV somehow.
6263 If C<flags> has C<SV_GMAGIC> bit set, will C<mg_get> on C<sv> if
6264 appropriate, else not. C<sv_pvn_force> and C<sv_pvn_force_nomg> are
6265 implemented in terms of this function.
6271 Perl_sv_pvn_force_flags(pTHX_ SV *sv, STRLEN *lp, I32 flags)
6275 if (SvTHINKFIRST(sv) && !SvROK(sv))
6276 sv_force_normal(sv);
6282 if (SvTYPE(sv) > SVt_PVLV && SvTYPE(sv) != SVt_PVFM) {
6283 Perl_croak(aTHX_ "Can't coerce %s to string in %s", sv_reftype(sv,0),
6284 PL_op_name[PL_op->op_type]);
6287 s = sv_2pv_flags(sv, lp, flags);
6288 if (s != SvPVX(sv)) { /* Almost, but not quite, sv_setpvn() */
6293 (void)SvUPGRADE(sv, SVt_PV); /* Never FALSE */
6294 SvGROW(sv, len + 1);
6295 Move(s,SvPVX(sv),len,char);
6300 SvPOK_on(sv); /* validate pointer */
6302 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2pv(%s)\n",
6303 PTR2UV(sv),SvPVX(sv)));
6310 Perl_sv_pvbyte(pTHX_ SV *sv)
6312 sv_utf8_downgrade(sv,0);
6317 Perl_sv_pvbyten(pTHX_ SV *sv, STRLEN *lp)
6319 sv_utf8_downgrade(sv,0);
6320 return sv_pvn(sv,lp);
6324 Perl_sv_pvbyten_force(pTHX_ SV *sv, STRLEN *lp)
6326 sv_utf8_downgrade(sv,0);
6327 return sv_pvn_force(sv,lp);
6331 Perl_sv_pvutf8(pTHX_ SV *sv)
6333 sv_utf8_upgrade(sv);
6338 Perl_sv_pvutf8n(pTHX_ SV *sv, STRLEN *lp)
6340 sv_utf8_upgrade(sv);
6341 return sv_pvn(sv,lp);
6345 =for apidoc sv_pvutf8n_force
6347 Get a sensible UTF8-encoded string out of the SV somehow. See
6354 Perl_sv_pvutf8n_force(pTHX_ SV *sv, STRLEN *lp)
6356 sv_utf8_upgrade(sv);
6357 return sv_pvn_force(sv,lp);
6361 =for apidoc sv_reftype
6363 Returns a string describing what the SV is a reference to.
6369 Perl_sv_reftype(pTHX_ SV *sv, int ob)
6371 if (ob && SvOBJECT(sv))
6372 return HvNAME(SvSTASH(sv));
6374 switch (SvTYPE(sv)) {
6388 case SVt_PVLV: return "LVALUE";
6389 case SVt_PVAV: return "ARRAY";
6390 case SVt_PVHV: return "HASH";
6391 case SVt_PVCV: return "CODE";
6392 case SVt_PVGV: return "GLOB";
6393 case SVt_PVFM: return "FORMAT";
6394 case SVt_PVIO: return "IO";
6395 default: return "UNKNOWN";
6401 =for apidoc sv_isobject
6403 Returns a boolean indicating whether the SV is an RV pointing to a blessed
6404 object. If the SV is not an RV, or if the object is not blessed, then this
6411 Perl_sv_isobject(pTHX_ SV *sv)
6428 Returns a boolean indicating whether the SV is blessed into the specified
6429 class. This does not check for subtypes; use C<sv_derived_from> to verify
6430 an inheritance relationship.
6436 Perl_sv_isa(pTHX_ SV *sv, const char *name)
6448 return strEQ(HvNAME(SvSTASH(sv)), name);
6454 Creates a new SV for the RV, C<rv>, to point to. If C<rv> is not an RV then
6455 it will be upgraded to one. If C<classname> is non-null then the new SV will
6456 be blessed in the specified package. The new SV is returned and its
6457 reference count is 1.
6463 Perl_newSVrv(pTHX_ SV *rv, const char *classname)
6469 SV_CHECK_THINKFIRST(rv);
6472 if (SvTYPE(rv) >= SVt_PVMG) {
6473 U32 refcnt = SvREFCNT(rv);
6477 SvREFCNT(rv) = refcnt;
6480 if (SvTYPE(rv) < SVt_RV)
6481 sv_upgrade(rv, SVt_RV);
6482 else if (SvTYPE(rv) > SVt_RV) {
6483 (void)SvOOK_off(rv);
6484 if (SvPVX(rv) && SvLEN(rv))
6485 Safefree(SvPVX(rv));
6495 HV* stash = gv_stashpv(classname, TRUE);
6496 (void)sv_bless(rv, stash);
6502 =for apidoc sv_setref_pv
6504 Copies a pointer into a new SV, optionally blessing the SV. The C<rv>
6505 argument will be upgraded to an RV. That RV will be modified to point to
6506 the new SV. If the C<pv> argument is NULL then C<PL_sv_undef> will be placed
6507 into the SV. The C<classname> argument indicates the package for the
6508 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
6509 will be returned and will have a reference count of 1.
6511 Do not use with other Perl types such as HV, AV, SV, CV, because those
6512 objects will become corrupted by the pointer copy process.
6514 Note that C<sv_setref_pvn> copies the string while this copies the pointer.
6520 Perl_sv_setref_pv(pTHX_ SV *rv, const char *classname, void *pv)
6523 sv_setsv(rv, &PL_sv_undef);
6527 sv_setiv(newSVrv(rv,classname), PTR2IV(pv));
6532 =for apidoc sv_setref_iv
6534 Copies an integer into a new SV, optionally blessing the SV. The C<rv>
6535 argument will be upgraded to an RV. That RV will be modified to point to
6536 the new SV. The C<classname> argument indicates the package for the
6537 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
6538 will be returned and will have a reference count of 1.
6544 Perl_sv_setref_iv(pTHX_ SV *rv, const char *classname, IV iv)
6546 sv_setiv(newSVrv(rv,classname), iv);
6551 =for apidoc sv_setref_uv
6553 Copies an unsigned integer into a new SV, optionally blessing the SV. The C<rv>
6554 argument will be upgraded to an RV. That RV will be modified to point to
6555 the new SV. The C<classname> argument indicates the package for the
6556 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
6557 will be returned and will have a reference count of 1.
6563 Perl_sv_setref_uv(pTHX_ SV *rv, const char *classname, UV uv)
6565 sv_setuv(newSVrv(rv,classname), uv);
6570 =for apidoc sv_setref_nv
6572 Copies a double into a new SV, optionally blessing the SV. The C<rv>
6573 argument will be upgraded to an RV. That RV will be modified to point to
6574 the new SV. The C<classname> argument indicates the package for the
6575 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
6576 will be returned and will have a reference count of 1.
6582 Perl_sv_setref_nv(pTHX_ SV *rv, const char *classname, NV nv)
6584 sv_setnv(newSVrv(rv,classname), nv);
6589 =for apidoc sv_setref_pvn
6591 Copies a string into a new SV, optionally blessing the SV. The length of the
6592 string must be specified with C<n>. The C<rv> argument will be upgraded to
6593 an RV. That RV will be modified to point to the new SV. The C<classname>
6594 argument indicates the package for the blessing. Set C<classname> to
6595 C<Nullch> to avoid the blessing. The new SV will be returned and will have
6596 a reference count of 1.
6598 Note that C<sv_setref_pv> copies the pointer while this copies the string.
6604 Perl_sv_setref_pvn(pTHX_ SV *rv, const char *classname, char *pv, STRLEN n)
6606 sv_setpvn(newSVrv(rv,classname), pv, n);
6611 =for apidoc sv_bless
6613 Blesses an SV into a specified package. The SV must be an RV. The package
6614 must be designated by its stash (see C<gv_stashpv()>). The reference count
6615 of the SV is unaffected.
6621 Perl_sv_bless(pTHX_ SV *sv, HV *stash)
6625 Perl_croak(aTHX_ "Can't bless non-reference value");
6627 if (SvFLAGS(tmpRef) & (SVs_OBJECT|SVf_READONLY)) {
6628 if (SvREADONLY(tmpRef))
6629 Perl_croak(aTHX_ PL_no_modify);
6630 if (SvOBJECT(tmpRef)) {
6631 if (SvTYPE(tmpRef) != SVt_PVIO)
6633 SvREFCNT_dec(SvSTASH(tmpRef));
6636 SvOBJECT_on(tmpRef);
6637 if (SvTYPE(tmpRef) != SVt_PVIO)
6639 (void)SvUPGRADE(tmpRef, SVt_PVMG);
6640 SvSTASH(tmpRef) = (HV*)SvREFCNT_inc(stash);
6651 S_sv_unglob(pTHX_ SV *sv)
6655 assert(SvTYPE(sv) == SVt_PVGV);
6660 SvREFCNT_dec(GvSTASH(sv));
6661 GvSTASH(sv) = Nullhv;
6663 sv_unmagic(sv, PERL_MAGIC_glob);
6664 Safefree(GvNAME(sv));
6667 /* need to keep SvANY(sv) in the right arena */
6668 xpvmg = new_XPVMG();
6669 StructCopy(SvANY(sv), xpvmg, XPVMG);
6670 del_XPVGV(SvANY(sv));
6673 SvFLAGS(sv) &= ~SVTYPEMASK;
6674 SvFLAGS(sv) |= SVt_PVMG;
6678 =for apidoc sv_unref_flags
6680 Unsets the RV status of the SV, and decrements the reference count of
6681 whatever was being referenced by the RV. This can almost be thought of
6682 as a reversal of C<newSVrv>. The C<cflags> argument can contain
6683 C<SV_IMMEDIATE_UNREF> to force the reference count to be decremented
6684 (otherwise the decrementing is conditional on the reference count being
6685 different from one or the reference being a readonly SV).
6692 Perl_sv_unref_flags(pTHX_ SV *sv, U32 flags)
6696 if (SvWEAKREF(sv)) {
6704 if (SvREFCNT(rv) != 1 || SvREADONLY(rv) || flags) /* SV_IMMEDIATE_UNREF */
6706 else /* XXX Hack, but hard to make $a=$a->[1] work otherwise */
6707 sv_2mortal(rv); /* Schedule for freeing later */
6711 =for apidoc sv_unref
6713 Unsets the RV status of the SV, and decrements the reference count of
6714 whatever was being referenced by the RV. This can almost be thought of
6715 as a reversal of C<newSVrv>. This is C<sv_unref_flags> with the C<flag>
6716 being zero. See C<SvROK_off>.
6722 Perl_sv_unref(pTHX_ SV *sv)
6724 sv_unref_flags(sv, 0);
6728 Perl_sv_taint(pTHX_ SV *sv)
6730 sv_magic((sv), Nullsv, PERL_MAGIC_taint, Nullch, 0);
6734 Perl_sv_untaint(pTHX_ SV *sv)
6736 if (SvTYPE(sv) >= SVt_PVMG && SvMAGIC(sv)) {
6737 MAGIC *mg = mg_find(sv, PERL_MAGIC_taint);
6744 Perl_sv_tainted(pTHX_ SV *sv)
6746 if (SvTYPE(sv) >= SVt_PVMG && SvMAGIC(sv)) {
6747 MAGIC *mg = mg_find(sv, PERL_MAGIC_taint);
6748 if (mg && ((mg->mg_len & 1) || ((mg->mg_len & 2) && mg->mg_obj == sv)))
6755 =for apidoc sv_setpviv
6757 Copies an integer into the given SV, also updating its string value.
6758 Does not handle 'set' magic. See C<sv_setpviv_mg>.
6764 Perl_sv_setpviv(pTHX_ SV *sv, IV iv)
6766 char buf[TYPE_CHARS(UV)];
6768 char *ptr = uiv_2buf(buf, iv, 0, 0, &ebuf);
6770 sv_setpvn(sv, ptr, ebuf - ptr);
6775 =for apidoc sv_setpviv_mg
6777 Like C<sv_setpviv>, but also handles 'set' magic.
6783 Perl_sv_setpviv_mg(pTHX_ SV *sv, IV iv)
6785 char buf[TYPE_CHARS(UV)];
6787 char *ptr = uiv_2buf(buf, iv, 0, 0, &ebuf);
6789 sv_setpvn(sv, ptr, ebuf - ptr);
6793 #if defined(PERL_IMPLICIT_CONTEXT)
6795 Perl_sv_setpvf_nocontext(SV *sv, const char* pat, ...)
6799 va_start(args, pat);
6800 sv_vsetpvf(sv, pat, &args);
6806 Perl_sv_setpvf_mg_nocontext(SV *sv, const char* pat, ...)
6810 va_start(args, pat);
6811 sv_vsetpvf_mg(sv, pat, &args);
6817 =for apidoc sv_setpvf
6819 Processes its arguments like C<sprintf> and sets an SV to the formatted
6820 output. Does not handle 'set' magic. See C<sv_setpvf_mg>.
6826 Perl_sv_setpvf(pTHX_ SV *sv, const char* pat, ...)
6829 va_start(args, pat);
6830 sv_vsetpvf(sv, pat, &args);
6835 Perl_sv_vsetpvf(pTHX_ SV *sv, const char* pat, va_list* args)
6837 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
6841 =for apidoc sv_setpvf_mg
6843 Like C<sv_setpvf>, but also handles 'set' magic.
6849 Perl_sv_setpvf_mg(pTHX_ SV *sv, const char* pat, ...)
6852 va_start(args, pat);
6853 sv_vsetpvf_mg(sv, pat, &args);
6858 Perl_sv_vsetpvf_mg(pTHX_ SV *sv, const char* pat, va_list* args)
6860 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
6864 #if defined(PERL_IMPLICIT_CONTEXT)
6866 Perl_sv_catpvf_nocontext(SV *sv, const char* pat, ...)
6870 va_start(args, pat);
6871 sv_vcatpvf(sv, pat, &args);
6876 Perl_sv_catpvf_mg_nocontext(SV *sv, const char* pat, ...)
6880 va_start(args, pat);
6881 sv_vcatpvf_mg(sv, pat, &args);
6887 =for apidoc sv_catpvf
6889 Processes its arguments like C<sprintf> and appends the formatted
6890 output to an SV. If the appended data contains "wide" characters
6891 (including, but not limited to, SVs with a UTF-8 PV formatted with %s,
6892 and characters >255 formatted with %c), the original SV might get
6893 upgraded to UTF-8. Handles 'get' magic, but not 'set' magic.
6894 C<SvSETMAGIC()> must typically be called after calling this function
6895 to handle 'set' magic.
6900 Perl_sv_catpvf(pTHX_ SV *sv, const char* pat, ...)
6903 va_start(args, pat);
6904 sv_vcatpvf(sv, pat, &args);
6909 Perl_sv_vcatpvf(pTHX_ SV *sv, const char* pat, va_list* args)
6911 sv_vcatpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
6915 =for apidoc sv_catpvf_mg
6917 Like C<sv_catpvf>, but also handles 'set' magic.
6923 Perl_sv_catpvf_mg(pTHX_ SV *sv, const char* pat, ...)
6926 va_start(args, pat);
6927 sv_vcatpvf_mg(sv, pat, &args);
6932 Perl_sv_vcatpvf_mg(pTHX_ SV *sv, const char* pat, va_list* args)
6934 sv_vcatpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
6939 =for apidoc sv_vsetpvfn
6941 Works like C<vcatpvfn> but copies the text into the SV instead of
6948 Perl_sv_vsetpvfn(pTHX_ SV *sv, const char *pat, STRLEN patlen, va_list *args, SV **svargs, I32 svmax, bool *maybe_tainted)
6950 sv_setpvn(sv, "", 0);
6951 sv_vcatpvfn(sv, pat, patlen, args, svargs, svmax, maybe_tainted);
6955 S_expect_number(pTHX_ char** pattern)
6958 switch (**pattern) {
6959 case '1': case '2': case '3':
6960 case '4': case '5': case '6':
6961 case '7': case '8': case '9':
6962 while (isDIGIT(**pattern))
6963 var = var * 10 + (*(*pattern)++ - '0');
6967 #define EXPECT_NUMBER(pattern, var) (var = S_expect_number(aTHX_ &pattern))
6970 =for apidoc sv_vcatpvfn
6972 Processes its arguments like C<vsprintf> and appends the formatted output
6973 to an SV. Uses an array of SVs if the C style variable argument list is
6974 missing (NULL). When running with taint checks enabled, indicates via
6975 C<maybe_tainted> if results are untrustworthy (often due to the use of
6982 Perl_sv_vcatpvfn(pTHX_ SV *sv, const char *pat, STRLEN patlen, va_list *args, SV **svargs, I32 svmax, bool *maybe_tainted)
6989 static char nullstr[] = "(null)";
6992 /* no matter what, this is a string now */
6993 (void)SvPV_force(sv, origlen);
6995 /* special-case "", "%s", and "%_" */
6998 if (patlen == 2 && pat[0] == '%') {
7002 char *s = va_arg(*args, char*);
7003 sv_catpv(sv, s ? s : nullstr);
7005 else if (svix < svmax) {
7006 sv_catsv(sv, *svargs);
7007 if (DO_UTF8(*svargs))
7013 argsv = va_arg(*args, SV*);
7014 sv_catsv(sv, argsv);
7019 /* See comment on '_' below */
7024 patend = (char*)pat + patlen;
7025 for (p = (char*)pat; p < patend; p = q) {
7028 bool vectorize = FALSE;
7029 bool vectorarg = FALSE;
7030 bool vec_utf = FALSE;
7036 bool has_precis = FALSE;
7038 bool is_utf = FALSE;
7041 U8 utf8buf[UTF8_MAXLEN+1];
7042 STRLEN esignlen = 0;
7044 char *eptr = Nullch;
7046 /* Times 4: a decimal digit takes more than 3 binary digits.
7047 * NV_DIG: mantissa takes than many decimal digits.
7048 * Plus 32: Playing safe. */
7049 char ebuf[IV_DIG * 4 + NV_DIG + 32];
7050 /* large enough for "%#.#f" --chip */
7051 /* what about long double NVs? --jhi */
7054 U8 *vecstr = Null(U8*);
7066 STRLEN dotstrlen = 1;
7067 I32 efix = 0; /* explicit format parameter index */
7068 I32 ewix = 0; /* explicit width index */
7069 I32 epix = 0; /* explicit precision index */
7070 I32 evix = 0; /* explicit vector index */
7071 bool asterisk = FALSE;
7073 /* echo everything up to the next format specification */
7074 for (q = p; q < patend && *q != '%'; ++q) ;
7076 sv_catpvn(sv, p, q - p);
7083 We allow format specification elements in this order:
7084 \d+\$ explicit format parameter index
7086 \*?(\d+\$)?v vector with optional (optionally specified) arg
7087 \d+|\*(\d+\$)? width using optional (optionally specified) arg
7088 \.(\d*|\*(\d+\$)?) precision using optional (optionally specified) arg
7090 [%bcdefginopsux_DFOUX] format (mandatory)
7092 if (EXPECT_NUMBER(q, width)) {
7133 if (EXPECT_NUMBER(q, ewix))
7142 if ((vectorarg = asterisk)) {
7152 EXPECT_NUMBER(q, width);
7157 vecsv = va_arg(*args, SV*);
7159 vecsv = (evix ? evix <= svmax : svix < svmax) ?
7160 svargs[ewix ? ewix-1 : svix++] : &PL_sv_undef;
7161 dotstr = SvPVx(vecsv, dotstrlen);
7166 vecsv = va_arg(*args, SV*);
7167 vecstr = (U8*)SvPVx(vecsv,veclen);
7168 vec_utf = DO_UTF8(vecsv);
7170 else if (efix ? efix <= svmax : svix < svmax) {
7171 vecsv = svargs[efix ? efix-1 : svix++];
7172 vecstr = (U8*)SvPVx(vecsv,veclen);
7173 vec_utf = DO_UTF8(vecsv);
7183 i = va_arg(*args, int);
7185 i = (ewix ? ewix <= svmax : svix < svmax) ?
7186 SvIVx(svargs[ewix ? ewix-1 : svix++]) : 0;
7188 width = (i < 0) ? -i : i;
7198 if (EXPECT_NUMBER(q, epix) && *q++ != '$')
7201 i = va_arg(*args, int);
7203 i = (ewix ? ewix <= svmax : svix < svmax)
7204 ? SvIVx(svargs[ewix ? ewix-1 : svix++]) : 0;
7205 precis = (i < 0) ? 0 : i;
7210 precis = precis * 10 + (*q++ - '0');
7218 #if defined(HAS_QUAD) || (defined(HAS_LONG_DOUBLE) && defined(USE_LONG_DOUBLE))
7229 #if defined(HAS_QUAD) || (defined(HAS_LONG_DOUBLE) && defined(USE_LONG_DOUBLE))
7230 if (*(q + 1) == 'l') { /* lld, llf */
7253 argsv = (efix ? efix <= svmax : svix < svmax) ?
7254 svargs[efix ? efix-1 : svix++] : &PL_sv_undef;
7261 uv = args ? va_arg(*args, int) : SvIVx(argsv);
7263 (!UNI_IS_INVARIANT(uv) && SvUTF8(sv)))
7265 eptr = (char*)utf8buf;
7266 elen = uvchr_to_utf8((U8*)eptr, uv) - utf8buf;
7278 eptr = va_arg(*args, char*);
7280 #ifdef MACOS_TRADITIONAL
7281 /* On MacOS, %#s format is used for Pascal strings */
7286 elen = strlen(eptr);
7289 elen = sizeof nullstr - 1;
7293 eptr = SvPVx(argsv, elen);
7294 if (DO_UTF8(argsv)) {
7295 if (has_precis && precis < elen) {
7297 sv_pos_u2b(argsv, &p, 0); /* sticks at end */
7300 if (width) { /* fudge width (can't fudge elen) */
7301 width += elen - sv_len_utf8(argsv);
7310 * The "%_" hack might have to be changed someday,
7311 * if ISO or ANSI decide to use '_' for something.
7312 * So we keep it hidden from users' code.
7316 argsv = va_arg(*args, SV*);
7317 eptr = SvPVx(argsv, elen);
7323 if (has_precis && elen > precis)
7332 uv = PTR2UV(args ? va_arg(*args, void*) : argsv);
7350 iv = (IV)utf8n_to_uvchr(vecstr, veclen, &ulen, 0);
7360 case 'h': iv = (short)va_arg(*args, int); break;
7361 default: iv = va_arg(*args, int); break;
7362 case 'l': iv = va_arg(*args, long); break;
7363 case 'V': iv = va_arg(*args, IV); break;
7365 case 'q': iv = va_arg(*args, Quad_t); break;
7372 case 'h': iv = (short)iv; break;
7374 case 'l': iv = (long)iv; break;
7377 case 'q': iv = (Quad_t)iv; break;
7384 esignbuf[esignlen++] = plus;
7388 esignbuf[esignlen++] = '-';
7430 uv = utf8n_to_uvchr(vecstr, veclen, &ulen, 0);
7440 case 'h': uv = (unsigned short)va_arg(*args, unsigned); break;
7441 default: uv = va_arg(*args, unsigned); break;
7442 case 'l': uv = va_arg(*args, unsigned long); break;
7443 case 'V': uv = va_arg(*args, UV); break;
7445 case 'q': uv = va_arg(*args, Quad_t); break;
7452 case 'h': uv = (unsigned short)uv; break;
7454 case 'l': uv = (unsigned long)uv; break;
7457 case 'q': uv = (Quad_t)uv; break;
7463 eptr = ebuf + sizeof ebuf;
7469 p = (char*)((c == 'X')
7470 ? "0123456789ABCDEF" : "0123456789abcdef");
7476 esignbuf[esignlen++] = '0';
7477 esignbuf[esignlen++] = c; /* 'x' or 'X' */
7483 *--eptr = '0' + dig;
7485 if (alt && *eptr != '0')
7491 *--eptr = '0' + dig;
7494 esignbuf[esignlen++] = '0';
7495 esignbuf[esignlen++] = 'b';
7498 default: /* it had better be ten or less */
7499 #if defined(PERL_Y2KWARN)
7500 if (ckWARN(WARN_Y2K)) {
7502 char *s = SvPV(sv,n);
7503 if (n >= 2 && s[n-2] == '1' && s[n-1] == '9'
7504 && (n == 2 || !isDIGIT(s[n-3])))
7506 Perl_warner(aTHX_ WARN_Y2K,
7507 "Possible Y2K bug: %%%c %s",
7508 c, "format string following '19'");
7514 *--eptr = '0' + dig;
7515 } while (uv /= base);
7518 elen = (ebuf + sizeof ebuf) - eptr;
7521 zeros = precis - elen;
7522 else if (precis == 0 && elen == 1 && *eptr == '0')
7527 /* FLOATING POINT */
7530 c = 'f'; /* maybe %F isn't supported here */
7536 /* This is evil, but floating point is even more evil */
7539 nv = args ? va_arg(*args, NV) : SvNVx(argsv);
7542 if (c != 'e' && c != 'E') {
7544 (void)Perl_frexp(nv, &i);
7545 if (i == PERL_INT_MIN)
7546 Perl_die(aTHX_ "panic: frexp");
7548 need = BIT_DIGITS(i);
7550 need += has_precis ? precis : 6; /* known default */
7554 need += 20; /* fudge factor */
7555 if (PL_efloatsize < need) {
7556 Safefree(PL_efloatbuf);
7557 PL_efloatsize = need + 20; /* more fudge */
7558 New(906, PL_efloatbuf, PL_efloatsize, char);
7559 PL_efloatbuf[0] = '\0';
7562 eptr = ebuf + sizeof ebuf;
7565 #if defined(USE_LONG_DOUBLE) && defined(PERL_PRIfldbl)
7567 /* Copy the one or more characters in a long double
7568 * format before the 'base' ([efgEFG]) character to
7569 * the format string. */
7570 static char const prifldbl[] = PERL_PRIfldbl;
7571 char const *p = prifldbl + sizeof(prifldbl) - 3;
7572 while (p >= prifldbl) { *--eptr = *p--; }
7577 do { *--eptr = '0' + (base % 10); } while (base /= 10);
7582 do { *--eptr = '0' + (base % 10); } while (base /= 10);
7594 /* No taint. Otherwise we are in the strange situation
7595 * where printf() taints but print($float) doesn't.
7597 (void)sprintf(PL_efloatbuf, eptr, nv);
7599 eptr = PL_efloatbuf;
7600 elen = strlen(PL_efloatbuf);
7607 i = SvCUR(sv) - origlen;
7610 case 'h': *(va_arg(*args, short*)) = i; break;
7611 default: *(va_arg(*args, int*)) = i; break;
7612 case 'l': *(va_arg(*args, long*)) = i; break;
7613 case 'V': *(va_arg(*args, IV*)) = i; break;
7615 case 'q': *(va_arg(*args, Quad_t*)) = i; break;
7620 sv_setuv_mg(argsv, (UV)i);
7621 continue; /* not "break" */
7628 if (!args && ckWARN(WARN_PRINTF) &&
7629 (PL_op->op_type == OP_PRTF || PL_op->op_type == OP_SPRINTF)) {
7630 SV *msg = sv_newmortal();
7631 Perl_sv_setpvf(aTHX_ msg, "Invalid conversion in %s: ",
7632 (PL_op->op_type == OP_PRTF) ? "printf" : "sprintf");
7635 Perl_sv_catpvf(aTHX_ msg,
7636 "\"%%%c\"", c & 0xFF);
7638 Perl_sv_catpvf(aTHX_ msg,
7639 "\"%%\\%03"UVof"\"",
7642 sv_catpv(msg, "end of string");
7643 Perl_warner(aTHX_ WARN_PRINTF, "%"SVf, msg); /* yes, this is reentrant */
7646 /* output mangled stuff ... */
7652 /* ... right here, because formatting flags should not apply */
7653 SvGROW(sv, SvCUR(sv) + elen + 1);
7655 Copy(eptr, p, elen, char);
7658 SvCUR(sv) = p - SvPVX(sv);
7659 continue; /* not "break" */
7662 have = esignlen + zeros + elen;
7663 need = (have > width ? have : width);
7666 SvGROW(sv, SvCUR(sv) + need + dotstrlen + 1);
7668 if (esignlen && fill == '0') {
7669 for (i = 0; i < esignlen; i++)
7673 memset(p, fill, gap);
7676 if (esignlen && fill != '0') {
7677 for (i = 0; i < esignlen; i++)
7681 for (i = zeros; i; i--)
7685 Copy(eptr, p, elen, char);
7689 memset(p, ' ', gap);
7694 Copy(dotstr, p, dotstrlen, char);
7698 vectorize = FALSE; /* done iterating over vecstr */
7703 SvCUR(sv) = p - SvPVX(sv);
7711 #if defined(USE_ITHREADS)
7713 #if defined(USE_THREADS)
7714 # include "error: USE_THREADS and USE_ITHREADS are incompatible"
7717 #ifndef GpREFCNT_inc
7718 # define GpREFCNT_inc(gp) ((gp) ? (++(gp)->gp_refcnt, (gp)) : (GP*)NULL)
7722 #define sv_dup_inc(s) SvREFCNT_inc(sv_dup(s))
7723 #define av_dup(s) (AV*)sv_dup((SV*)s)
7724 #define av_dup_inc(s) (AV*)SvREFCNT_inc(sv_dup((SV*)s))
7725 #define hv_dup(s) (HV*)sv_dup((SV*)s)
7726 #define hv_dup_inc(s) (HV*)SvREFCNT_inc(sv_dup((SV*)s))
7727 #define cv_dup(s) (CV*)sv_dup((SV*)s)
7728 #define cv_dup_inc(s) (CV*)SvREFCNT_inc(sv_dup((SV*)s))
7729 #define io_dup(s) (IO*)sv_dup((SV*)s)
7730 #define io_dup_inc(s) (IO*)SvREFCNT_inc(sv_dup((SV*)s))
7731 #define gv_dup(s) (GV*)sv_dup((SV*)s)
7732 #define gv_dup_inc(s) (GV*)SvREFCNT_inc(sv_dup((SV*)s))
7733 #define SAVEPV(p) (p ? savepv(p) : Nullch)
7734 #define SAVEPVN(p,n) (p ? savepvn(p,n) : Nullch)
7737 Perl_re_dup(pTHX_ REGEXP *r)
7739 /* XXX fix when pmop->op_pmregexp becomes shared */
7740 return ReREFCNT_inc(r);
7744 Perl_fp_dup(pTHX_ PerlIO *fp, char type)
7748 return (PerlIO*)NULL;
7750 /* look for it in the table first */
7751 ret = (PerlIO*)ptr_table_fetch(PL_ptr_table, fp);
7755 /* create anew and remember what it is */
7756 ret = PerlIO_fdupopen(aTHX_ fp);
7757 ptr_table_store(PL_ptr_table, fp, ret);
7762 Perl_dirp_dup(pTHX_ DIR *dp)
7771 Perl_gp_dup(pTHX_ GP *gp)
7776 /* look for it in the table first */
7777 ret = (GP*)ptr_table_fetch(PL_ptr_table, gp);
7781 /* create anew and remember what it is */
7782 Newz(0, ret, 1, GP);
7783 ptr_table_store(PL_ptr_table, gp, ret);
7786 ret->gp_refcnt = 0; /* must be before any other dups! */
7787 ret->gp_sv = sv_dup_inc(gp->gp_sv);
7788 ret->gp_io = io_dup_inc(gp->gp_io);
7789 ret->gp_form = cv_dup_inc(gp->gp_form);
7790 ret->gp_av = av_dup_inc(gp->gp_av);
7791 ret->gp_hv = hv_dup_inc(gp->gp_hv);
7792 ret->gp_egv = gv_dup(gp->gp_egv); /* GvEGV is not refcounted */
7793 ret->gp_cv = cv_dup_inc(gp->gp_cv);
7794 ret->gp_cvgen = gp->gp_cvgen;
7795 ret->gp_flags = gp->gp_flags;
7796 ret->gp_line = gp->gp_line;
7797 ret->gp_file = gp->gp_file; /* points to COP.cop_file */
7802 Perl_mg_dup(pTHX_ MAGIC *mg)
7804 MAGIC *mgprev = (MAGIC*)NULL;
7807 return (MAGIC*)NULL;
7808 /* look for it in the table first */
7809 mgret = (MAGIC*)ptr_table_fetch(PL_ptr_table, mg);
7813 for (; mg; mg = mg->mg_moremagic) {
7815 Newz(0, nmg, 1, MAGIC);
7817 mgprev->mg_moremagic = nmg;
7820 nmg->mg_virtual = mg->mg_virtual; /* XXX copy dynamic vtable? */
7821 nmg->mg_private = mg->mg_private;
7822 nmg->mg_type = mg->mg_type;
7823 nmg->mg_flags = mg->mg_flags;
7824 if (mg->mg_type == PERL_MAGIC_qr) {
7825 nmg->mg_obj = (SV*)re_dup((REGEXP*)mg->mg_obj);
7828 nmg->mg_obj = (mg->mg_flags & MGf_REFCOUNTED)
7829 ? sv_dup_inc(mg->mg_obj)
7830 : sv_dup(mg->mg_obj);
7832 nmg->mg_len = mg->mg_len;
7833 nmg->mg_ptr = mg->mg_ptr; /* XXX random ptr? */
7834 if (mg->mg_ptr && mg->mg_type != PERL_MAGIC_regex_global) {
7835 if (mg->mg_len >= 0) {
7836 nmg->mg_ptr = SAVEPVN(mg->mg_ptr, mg->mg_len);
7837 if (mg->mg_type == PERL_MAGIC_overload_table &&
7838 AMT_AMAGIC((AMT*)mg->mg_ptr))
7840 AMT *amtp = (AMT*)mg->mg_ptr;
7841 AMT *namtp = (AMT*)nmg->mg_ptr;
7843 for (i = 1; i < NofAMmeth; i++) {
7844 namtp->table[i] = cv_dup_inc(amtp->table[i]);
7848 else if (mg->mg_len == HEf_SVKEY)
7849 nmg->mg_ptr = (char*)sv_dup_inc((SV*)mg->mg_ptr);
7857 Perl_ptr_table_new(pTHX)
7860 Newz(0, tbl, 1, PTR_TBL_t);
7863 Newz(0, tbl->tbl_ary, tbl->tbl_max + 1, PTR_TBL_ENT_t*);
7868 Perl_ptr_table_fetch(pTHX_ PTR_TBL_t *tbl, void *sv)
7870 PTR_TBL_ENT_t *tblent;
7871 UV hash = PTR2UV(sv);
7873 tblent = tbl->tbl_ary[hash & tbl->tbl_max];
7874 for (; tblent; tblent = tblent->next) {
7875 if (tblent->oldval == sv)
7876 return tblent->newval;
7882 Perl_ptr_table_store(pTHX_ PTR_TBL_t *tbl, void *oldv, void *newv)
7884 PTR_TBL_ENT_t *tblent, **otblent;
7885 /* XXX this may be pessimal on platforms where pointers aren't good
7886 * hash values e.g. if they grow faster in the most significant
7888 UV hash = PTR2UV(oldv);
7892 otblent = &tbl->tbl_ary[hash & tbl->tbl_max];
7893 for (tblent = *otblent; tblent; i=0, tblent = tblent->next) {
7894 if (tblent->oldval == oldv) {
7895 tblent->newval = newv;
7900 Newz(0, tblent, 1, PTR_TBL_ENT_t);
7901 tblent->oldval = oldv;
7902 tblent->newval = newv;
7903 tblent->next = *otblent;
7906 if (i && tbl->tbl_items > tbl->tbl_max)
7907 ptr_table_split(tbl);
7911 Perl_ptr_table_split(pTHX_ PTR_TBL_t *tbl)
7913 PTR_TBL_ENT_t **ary = tbl->tbl_ary;
7914 UV oldsize = tbl->tbl_max + 1;
7915 UV newsize = oldsize * 2;
7918 Renew(ary, newsize, PTR_TBL_ENT_t*);
7919 Zero(&ary[oldsize], newsize-oldsize, PTR_TBL_ENT_t*);
7920 tbl->tbl_max = --newsize;
7922 for (i=0; i < oldsize; i++, ary++) {
7923 PTR_TBL_ENT_t **curentp, **entp, *ent;
7926 curentp = ary + oldsize;
7927 for (entp = ary, ent = *ary; ent; ent = *entp) {
7928 if ((newsize & PTR2UV(ent->oldval)) != i) {
7930 ent->next = *curentp;
7941 Perl_ptr_table_clear(pTHX_ PTR_TBL_t *tbl)
7943 register PTR_TBL_ENT_t **array;
7944 register PTR_TBL_ENT_t *entry;
7945 register PTR_TBL_ENT_t *oentry = Null(PTR_TBL_ENT_t*);
7949 if (!tbl || !tbl->tbl_items) {
7953 array = tbl->tbl_ary;
7960 entry = entry->next;
7964 if (++riter > max) {
7967 entry = array[riter];
7975 Perl_ptr_table_free(pTHX_ PTR_TBL_t *tbl)
7980 ptr_table_clear(tbl);
7981 Safefree(tbl->tbl_ary);
7990 S_gv_share(pTHX_ SV *sstr)
7993 SV *sv = &PL_sv_no; /* just need SvREADONLY-ness */
7995 if (GvIO(gv) || GvFORM(gv)) {
7996 GvSHARED_off(gv); /* GvIOs cannot be shared. nor can GvFORMs */
7998 else if (!GvCV(gv)) {
8002 /* CvPADLISTs cannot be shared */
8003 if (!CvXSUB(GvCV(gv))) {
8008 if (!GvSHARED(gv)) {
8010 PerlIO_printf(Perl_debug_log, "gv_share: unable to share %s::%s\n",
8011 HvNAME(GvSTASH(gv)), GvNAME(gv));
8017 * write attempts will die with
8018 * "Modification of a read-only value attempted"
8024 SvREADONLY_on(GvSV(gv));
8031 SvREADONLY_on(GvAV(gv));
8038 SvREADONLY_on(GvAV(gv));
8041 return sstr; /* he_dup() will SvREFCNT_inc() */
8045 Perl_sv_dup(pTHX_ SV *sstr)
8049 if (!sstr || SvTYPE(sstr) == SVTYPEMASK)
8051 /* look for it in the table first */
8052 dstr = (SV*)ptr_table_fetch(PL_ptr_table, sstr);
8056 /* create anew and remember what it is */
8058 ptr_table_store(PL_ptr_table, sstr, dstr);
8061 SvFLAGS(dstr) = SvFLAGS(sstr);
8062 SvFLAGS(dstr) &= ~SVf_OOK; /* don't propagate OOK hack */
8063 SvREFCNT(dstr) = 0; /* must be before any other dups! */
8066 if (SvANY(sstr) && PL_watch_pvx && SvPVX(sstr) == PL_watch_pvx)
8067 PerlIO_printf(Perl_debug_log, "watch at %p hit, found string \"%s\"\n",
8068 PL_watch_pvx, SvPVX(sstr));
8071 switch (SvTYPE(sstr)) {
8076 SvANY(dstr) = new_XIV();
8077 SvIVX(dstr) = SvIVX(sstr);
8080 SvANY(dstr) = new_XNV();
8081 SvNVX(dstr) = SvNVX(sstr);
8084 SvANY(dstr) = new_XRV();
8085 SvRV(dstr) = SvRV(sstr) && SvWEAKREF(SvRV(sstr))
8086 ? sv_dup(SvRV(sstr))
8087 : sv_dup_inc(SvRV(sstr));
8090 SvANY(dstr) = new_XPV();
8091 SvCUR(dstr) = SvCUR(sstr);
8092 SvLEN(dstr) = SvLEN(sstr);
8094 SvRV(dstr) = SvWEAKREF(SvRV(sstr))
8095 ? sv_dup(SvRV(sstr))
8096 : sv_dup_inc(SvRV(sstr));
8097 else if (SvPVX(sstr) && SvLEN(sstr))
8098 SvPVX(dstr) = SAVEPVN(SvPVX(sstr), SvLEN(sstr)-1);
8100 SvPVX(dstr) = SvPVX(sstr); /* XXX shared string/random ptr? */
8103 SvANY(dstr) = new_XPVIV();
8104 SvCUR(dstr) = SvCUR(sstr);
8105 SvLEN(dstr) = SvLEN(sstr);
8106 SvIVX(dstr) = SvIVX(sstr);
8108 SvRV(dstr) = SvWEAKREF(SvRV(sstr))
8109 ? sv_dup(SvRV(sstr))
8110 : sv_dup_inc(SvRV(sstr));
8111 else if (SvPVX(sstr) && SvLEN(sstr))
8112 SvPVX(dstr) = SAVEPVN(SvPVX(sstr), SvLEN(sstr)-1);
8114 SvPVX(dstr) = SvPVX(sstr); /* XXX shared string/random ptr? */
8117 SvANY(dstr) = new_XPVNV();
8118 SvCUR(dstr) = SvCUR(sstr);
8119 SvLEN(dstr) = SvLEN(sstr);
8120 SvIVX(dstr) = SvIVX(sstr);
8121 SvNVX(dstr) = SvNVX(sstr);
8123 SvRV(dstr) = SvWEAKREF(SvRV(sstr))
8124 ? sv_dup(SvRV(sstr))
8125 : sv_dup_inc(SvRV(sstr));
8126 else if (SvPVX(sstr) && SvLEN(sstr))
8127 SvPVX(dstr) = SAVEPVN(SvPVX(sstr), SvLEN(sstr)-1);
8129 SvPVX(dstr) = SvPVX(sstr); /* XXX shared string/random ptr? */
8132 SvANY(dstr) = new_XPVMG();
8133 SvCUR(dstr) = SvCUR(sstr);
8134 SvLEN(dstr) = SvLEN(sstr);
8135 SvIVX(dstr) = SvIVX(sstr);
8136 SvNVX(dstr) = SvNVX(sstr);
8137 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr));
8138 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr));
8140 SvRV(dstr) = SvWEAKREF(SvRV(sstr))
8141 ? sv_dup(SvRV(sstr))
8142 : sv_dup_inc(SvRV(sstr));
8143 else if (SvPVX(sstr) && SvLEN(sstr))
8144 SvPVX(dstr) = SAVEPVN(SvPVX(sstr), SvLEN(sstr)-1);
8146 SvPVX(dstr) = SvPVX(sstr); /* XXX shared string/random ptr? */
8149 SvANY(dstr) = new_XPVBM();
8150 SvCUR(dstr) = SvCUR(sstr);
8151 SvLEN(dstr) = SvLEN(sstr);
8152 SvIVX(dstr) = SvIVX(sstr);
8153 SvNVX(dstr) = SvNVX(sstr);
8154 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr));
8155 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr));
8157 SvRV(dstr) = SvWEAKREF(SvRV(sstr))
8158 ? sv_dup(SvRV(sstr))
8159 : sv_dup_inc(SvRV(sstr));
8160 else if (SvPVX(sstr) && SvLEN(sstr))
8161 SvPVX(dstr) = SAVEPVN(SvPVX(sstr), SvLEN(sstr)-1);
8163 SvPVX(dstr) = SvPVX(sstr); /* XXX shared string/random ptr? */
8164 BmRARE(dstr) = BmRARE(sstr);
8165 BmUSEFUL(dstr) = BmUSEFUL(sstr);
8166 BmPREVIOUS(dstr)= BmPREVIOUS(sstr);
8169 SvANY(dstr) = new_XPVLV();
8170 SvCUR(dstr) = SvCUR(sstr);
8171 SvLEN(dstr) = SvLEN(sstr);
8172 SvIVX(dstr) = SvIVX(sstr);
8173 SvNVX(dstr) = SvNVX(sstr);
8174 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr));
8175 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr));
8177 SvRV(dstr) = SvWEAKREF(SvRV(sstr))
8178 ? sv_dup(SvRV(sstr))
8179 : sv_dup_inc(SvRV(sstr));
8180 else if (SvPVX(sstr) && SvLEN(sstr))
8181 SvPVX(dstr) = SAVEPVN(SvPVX(sstr), SvLEN(sstr)-1);
8183 SvPVX(dstr) = SvPVX(sstr); /* XXX shared string/random ptr? */
8184 LvTARGOFF(dstr) = LvTARGOFF(sstr); /* XXX sometimes holds PMOP* when DEBUGGING */
8185 LvTARGLEN(dstr) = LvTARGLEN(sstr);
8186 LvTARG(dstr) = sv_dup_inc(LvTARG(sstr));
8187 LvTYPE(dstr) = LvTYPE(sstr);
8190 if (GvSHARED((GV*)sstr)) {
8192 if ((share = gv_share(sstr))) {
8196 PerlIO_printf(Perl_debug_log, "sv_dup: sharing %s::%s\n",
8197 HvNAME(GvSTASH(share)), GvNAME(share));
8202 SvANY(dstr) = new_XPVGV();
8203 SvCUR(dstr) = SvCUR(sstr);
8204 SvLEN(dstr) = SvLEN(sstr);
8205 SvIVX(dstr) = SvIVX(sstr);
8206 SvNVX(dstr) = SvNVX(sstr);
8207 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr));
8208 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr));
8210 SvRV(dstr) = SvWEAKREF(SvRV(sstr))
8211 ? sv_dup(SvRV(sstr))
8212 : sv_dup_inc(SvRV(sstr));
8213 else if (SvPVX(sstr) && SvLEN(sstr))
8214 SvPVX(dstr) = SAVEPVN(SvPVX(sstr), SvLEN(sstr)-1);
8216 SvPVX(dstr) = SvPVX(sstr); /* XXX shared string/random ptr? */
8217 GvNAMELEN(dstr) = GvNAMELEN(sstr);
8218 GvNAME(dstr) = SAVEPVN(GvNAME(sstr), GvNAMELEN(sstr));
8219 GvSTASH(dstr) = hv_dup_inc(GvSTASH(sstr));
8220 GvFLAGS(dstr) = GvFLAGS(sstr);
8221 GvGP(dstr) = gp_dup(GvGP(sstr));
8222 (void)GpREFCNT_inc(GvGP(dstr));
8225 SvANY(dstr) = new_XPVIO();
8226 SvCUR(dstr) = SvCUR(sstr);
8227 SvLEN(dstr) = SvLEN(sstr);
8228 SvIVX(dstr) = SvIVX(sstr);
8229 SvNVX(dstr) = SvNVX(sstr);
8230 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr));
8231 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr));
8233 SvRV(dstr) = SvWEAKREF(SvRV(sstr))
8234 ? sv_dup(SvRV(sstr))
8235 : sv_dup_inc(SvRV(sstr));
8236 else if (SvPVX(sstr) && SvLEN(sstr))
8237 SvPVX(dstr) = SAVEPVN(SvPVX(sstr), SvLEN(sstr)-1);
8239 SvPVX(dstr) = SvPVX(sstr); /* XXX shared string/random ptr? */
8240 IoIFP(dstr) = fp_dup(IoIFP(sstr), IoTYPE(sstr));
8241 if (IoOFP(sstr) == IoIFP(sstr))
8242 IoOFP(dstr) = IoIFP(dstr);
8244 IoOFP(dstr) = fp_dup(IoOFP(sstr), IoTYPE(sstr));
8245 /* PL_rsfp_filters entries have fake IoDIRP() */
8246 if (IoDIRP(sstr) && !(IoFLAGS(sstr) & IOf_FAKE_DIRP))
8247 IoDIRP(dstr) = dirp_dup(IoDIRP(sstr));
8249 IoDIRP(dstr) = IoDIRP(sstr);
8250 IoLINES(dstr) = IoLINES(sstr);
8251 IoPAGE(dstr) = IoPAGE(sstr);
8252 IoPAGE_LEN(dstr) = IoPAGE_LEN(sstr);
8253 IoLINES_LEFT(dstr) = IoLINES_LEFT(sstr);
8254 IoTOP_NAME(dstr) = SAVEPV(IoTOP_NAME(sstr));
8255 IoTOP_GV(dstr) = gv_dup(IoTOP_GV(sstr));
8256 IoFMT_NAME(dstr) = SAVEPV(IoFMT_NAME(sstr));
8257 IoFMT_GV(dstr) = gv_dup(IoFMT_GV(sstr));
8258 IoBOTTOM_NAME(dstr) = SAVEPV(IoBOTTOM_NAME(sstr));
8259 IoBOTTOM_GV(dstr) = gv_dup(IoBOTTOM_GV(sstr));
8260 IoSUBPROCESS(dstr) = IoSUBPROCESS(sstr);
8261 IoTYPE(dstr) = IoTYPE(sstr);
8262 IoFLAGS(dstr) = IoFLAGS(sstr);
8265 SvANY(dstr) = new_XPVAV();
8266 SvCUR(dstr) = SvCUR(sstr);
8267 SvLEN(dstr) = SvLEN(sstr);
8268 SvIVX(dstr) = SvIVX(sstr);
8269 SvNVX(dstr) = SvNVX(sstr);
8270 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr));
8271 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr));
8272 AvARYLEN((AV*)dstr) = sv_dup_inc(AvARYLEN((AV*)sstr));
8273 AvFLAGS((AV*)dstr) = AvFLAGS((AV*)sstr);
8274 if (AvARRAY((AV*)sstr)) {
8275 SV **dst_ary, **src_ary;
8276 SSize_t items = AvFILLp((AV*)sstr) + 1;
8278 src_ary = AvARRAY((AV*)sstr);
8279 Newz(0, dst_ary, AvMAX((AV*)sstr)+1, SV*);
8280 ptr_table_store(PL_ptr_table, src_ary, dst_ary);
8281 SvPVX(dstr) = (char*)dst_ary;
8282 AvALLOC((AV*)dstr) = dst_ary;
8283 if (AvREAL((AV*)sstr)) {
8285 *dst_ary++ = sv_dup_inc(*src_ary++);
8289 *dst_ary++ = sv_dup(*src_ary++);
8291 items = AvMAX((AV*)sstr) - AvFILLp((AV*)sstr);
8292 while (items-- > 0) {
8293 *dst_ary++ = &PL_sv_undef;
8297 SvPVX(dstr) = Nullch;
8298 AvALLOC((AV*)dstr) = (SV**)NULL;
8302 SvANY(dstr) = new_XPVHV();
8303 SvCUR(dstr) = SvCUR(sstr);
8304 SvLEN(dstr) = SvLEN(sstr);
8305 SvIVX(dstr) = SvIVX(sstr);
8306 SvNVX(dstr) = SvNVX(sstr);
8307 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr));
8308 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr));
8309 HvRITER((HV*)dstr) = HvRITER((HV*)sstr);
8310 if (HvARRAY((HV*)sstr)) {
8312 XPVHV *dxhv = (XPVHV*)SvANY(dstr);
8313 XPVHV *sxhv = (XPVHV*)SvANY(sstr);
8314 Newz(0, dxhv->xhv_array,
8315 PERL_HV_ARRAY_ALLOC_BYTES(dxhv->xhv_max+1), char);
8316 while (i <= sxhv->xhv_max) {
8317 ((HE**)dxhv->xhv_array)[i] = he_dup(((HE**)sxhv->xhv_array)[i],
8318 !!HvSHAREKEYS(sstr));
8321 dxhv->xhv_eiter = he_dup(sxhv->xhv_eiter, !!HvSHAREKEYS(sstr));
8324 SvPVX(dstr) = Nullch;
8325 HvEITER((HV*)dstr) = (HE*)NULL;
8327 HvPMROOT((HV*)dstr) = HvPMROOT((HV*)sstr); /* XXX */
8328 HvNAME((HV*)dstr) = SAVEPV(HvNAME((HV*)sstr));
8331 SvANY(dstr) = new_XPVFM();
8332 FmLINES(dstr) = FmLINES(sstr);
8336 SvANY(dstr) = new_XPVCV();
8338 SvCUR(dstr) = SvCUR(sstr);
8339 SvLEN(dstr) = SvLEN(sstr);
8340 SvIVX(dstr) = SvIVX(sstr);
8341 SvNVX(dstr) = SvNVX(sstr);
8342 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr));
8343 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr));
8344 if (SvPVX(sstr) && SvLEN(sstr))
8345 SvPVX(dstr) = SAVEPVN(SvPVX(sstr), SvLEN(sstr)-1);
8347 SvPVX(dstr) = SvPVX(sstr); /* XXX shared string/random ptr? */
8348 CvSTASH(dstr) = hv_dup(CvSTASH(sstr));/* NOTE: not refcounted */
8349 CvSTART(dstr) = CvSTART(sstr);
8350 CvROOT(dstr) = OpREFCNT_inc(CvROOT(sstr));
8351 CvXSUB(dstr) = CvXSUB(sstr);
8352 CvXSUBANY(dstr) = CvXSUBANY(sstr);
8353 CvGV(dstr) = gv_dup(CvGV(sstr));
8354 CvDEPTH(dstr) = CvDEPTH(sstr);
8355 if (CvPADLIST(sstr) && !AvREAL(CvPADLIST(sstr))) {
8356 /* XXX padlists are real, but pretend to be not */
8357 AvREAL_on(CvPADLIST(sstr));
8358 CvPADLIST(dstr) = av_dup_inc(CvPADLIST(sstr));
8359 AvREAL_off(CvPADLIST(sstr));
8360 AvREAL_off(CvPADLIST(dstr));
8363 CvPADLIST(dstr) = av_dup_inc(CvPADLIST(sstr));
8364 if (!CvANON(sstr) || CvCLONED(sstr))
8365 CvOUTSIDE(dstr) = cv_dup_inc(CvOUTSIDE(sstr));
8367 CvOUTSIDE(dstr) = cv_dup(CvOUTSIDE(sstr));
8368 CvFLAGS(dstr) = CvFLAGS(sstr);
8371 Perl_croak(aTHX_ "Bizarre SvTYPE [%d]", SvTYPE(sstr));
8375 if (SvOBJECT(dstr) && SvTYPE(dstr) != SVt_PVIO)
8382 Perl_cx_dup(pTHX_ PERL_CONTEXT *cxs, I32 ix, I32 max)
8387 return (PERL_CONTEXT*)NULL;
8389 /* look for it in the table first */
8390 ncxs = (PERL_CONTEXT*)ptr_table_fetch(PL_ptr_table, cxs);
8394 /* create anew and remember what it is */
8395 Newz(56, ncxs, max + 1, PERL_CONTEXT);
8396 ptr_table_store(PL_ptr_table, cxs, ncxs);
8399 PERL_CONTEXT *cx = &cxs[ix];
8400 PERL_CONTEXT *ncx = &ncxs[ix];
8401 ncx->cx_type = cx->cx_type;
8402 if (CxTYPE(cx) == CXt_SUBST) {
8403 Perl_croak(aTHX_ "Cloning substitution context is unimplemented");
8406 ncx->blk_oldsp = cx->blk_oldsp;
8407 ncx->blk_oldcop = cx->blk_oldcop;
8408 ncx->blk_oldretsp = cx->blk_oldretsp;
8409 ncx->blk_oldmarksp = cx->blk_oldmarksp;
8410 ncx->blk_oldscopesp = cx->blk_oldscopesp;
8411 ncx->blk_oldpm = cx->blk_oldpm;
8412 ncx->blk_gimme = cx->blk_gimme;
8413 switch (CxTYPE(cx)) {
8415 ncx->blk_sub.cv = (cx->blk_sub.olddepth == 0
8416 ? cv_dup_inc(cx->blk_sub.cv)
8417 : cv_dup(cx->blk_sub.cv));
8418 ncx->blk_sub.argarray = (cx->blk_sub.hasargs
8419 ? av_dup_inc(cx->blk_sub.argarray)
8421 ncx->blk_sub.savearray = av_dup_inc(cx->blk_sub.savearray);
8422 ncx->blk_sub.olddepth = cx->blk_sub.olddepth;
8423 ncx->blk_sub.hasargs = cx->blk_sub.hasargs;
8424 ncx->blk_sub.lval = cx->blk_sub.lval;
8427 ncx->blk_eval.old_in_eval = cx->blk_eval.old_in_eval;
8428 ncx->blk_eval.old_op_type = cx->blk_eval.old_op_type;
8429 ncx->blk_eval.old_namesv = sv_dup_inc(cx->blk_eval.old_namesv);
8430 ncx->blk_eval.old_eval_root = cx->blk_eval.old_eval_root;
8431 ncx->blk_eval.cur_text = sv_dup(cx->blk_eval.cur_text);
8434 ncx->blk_loop.label = cx->blk_loop.label;
8435 ncx->blk_loop.resetsp = cx->blk_loop.resetsp;
8436 ncx->blk_loop.redo_op = cx->blk_loop.redo_op;
8437 ncx->blk_loop.next_op = cx->blk_loop.next_op;
8438 ncx->blk_loop.last_op = cx->blk_loop.last_op;
8439 ncx->blk_loop.iterdata = (CxPADLOOP(cx)
8440 ? cx->blk_loop.iterdata
8441 : gv_dup((GV*)cx->blk_loop.iterdata));
8442 ncx->blk_loop.oldcurpad
8443 = (SV**)ptr_table_fetch(PL_ptr_table,
8444 cx->blk_loop.oldcurpad);
8445 ncx->blk_loop.itersave = sv_dup_inc(cx->blk_loop.itersave);
8446 ncx->blk_loop.iterlval = sv_dup_inc(cx->blk_loop.iterlval);
8447 ncx->blk_loop.iterary = av_dup_inc(cx->blk_loop.iterary);
8448 ncx->blk_loop.iterix = cx->blk_loop.iterix;
8449 ncx->blk_loop.itermax = cx->blk_loop.itermax;
8452 ncx->blk_sub.cv = cv_dup(cx->blk_sub.cv);
8453 ncx->blk_sub.gv = gv_dup(cx->blk_sub.gv);
8454 ncx->blk_sub.dfoutgv = gv_dup_inc(cx->blk_sub.dfoutgv);
8455 ncx->blk_sub.hasargs = cx->blk_sub.hasargs;
8468 Perl_si_dup(pTHX_ PERL_SI *si)
8473 return (PERL_SI*)NULL;
8475 /* look for it in the table first */
8476 nsi = (PERL_SI*)ptr_table_fetch(PL_ptr_table, si);
8480 /* create anew and remember what it is */
8481 Newz(56, nsi, 1, PERL_SI);
8482 ptr_table_store(PL_ptr_table, si, nsi);
8484 nsi->si_stack = av_dup_inc(si->si_stack);
8485 nsi->si_cxix = si->si_cxix;
8486 nsi->si_cxmax = si->si_cxmax;
8487 nsi->si_cxstack = cx_dup(si->si_cxstack, si->si_cxix, si->si_cxmax);
8488 nsi->si_type = si->si_type;
8489 nsi->si_prev = si_dup(si->si_prev);
8490 nsi->si_next = si_dup(si->si_next);
8491 nsi->si_markoff = si->si_markoff;
8496 #define POPINT(ss,ix) ((ss)[--(ix)].any_i32)
8497 #define TOPINT(ss,ix) ((ss)[ix].any_i32)
8498 #define POPLONG(ss,ix) ((ss)[--(ix)].any_long)
8499 #define TOPLONG(ss,ix) ((ss)[ix].any_long)
8500 #define POPIV(ss,ix) ((ss)[--(ix)].any_iv)
8501 #define TOPIV(ss,ix) ((ss)[ix].any_iv)
8502 #define POPPTR(ss,ix) ((ss)[--(ix)].any_ptr)
8503 #define TOPPTR(ss,ix) ((ss)[ix].any_ptr)
8504 #define POPDPTR(ss,ix) ((ss)[--(ix)].any_dptr)
8505 #define TOPDPTR(ss,ix) ((ss)[ix].any_dptr)
8506 #define POPDXPTR(ss,ix) ((ss)[--(ix)].any_dxptr)
8507 #define TOPDXPTR(ss,ix) ((ss)[ix].any_dxptr)
8510 #define pv_dup_inc(p) SAVEPV(p)
8511 #define pv_dup(p) SAVEPV(p)
8512 #define svp_dup_inc(p,pp) any_dup(p,pp)
8515 Perl_any_dup(pTHX_ void *v, PerlInterpreter *proto_perl)
8522 /* look for it in the table first */
8523 ret = ptr_table_fetch(PL_ptr_table, v);
8527 /* see if it is part of the interpreter structure */
8528 if (v >= (void*)proto_perl && v < (void*)(proto_perl+1))
8529 ret = (void*)(((char*)aTHXo) + (((char*)v) - (char*)proto_perl));
8537 Perl_ss_dup(pTHX_ PerlInterpreter *proto_perl)
8539 ANY *ss = proto_perl->Tsavestack;
8540 I32 ix = proto_perl->Tsavestack_ix;
8541 I32 max = proto_perl->Tsavestack_max;
8554 void (*dptr) (void*);
8555 void (*dxptr) (pTHXo_ void*);
8558 Newz(54, nss, max, ANY);
8564 case SAVEt_ITEM: /* normal string */
8565 sv = (SV*)POPPTR(ss,ix);
8566 TOPPTR(nss,ix) = sv_dup_inc(sv);
8567 sv = (SV*)POPPTR(ss,ix);
8568 TOPPTR(nss,ix) = sv_dup_inc(sv);
8570 case SAVEt_SV: /* scalar reference */
8571 sv = (SV*)POPPTR(ss,ix);
8572 TOPPTR(nss,ix) = sv_dup_inc(sv);
8573 gv = (GV*)POPPTR(ss,ix);
8574 TOPPTR(nss,ix) = gv_dup_inc(gv);
8576 case SAVEt_GENERIC_PVREF: /* generic char* */
8577 c = (char*)POPPTR(ss,ix);
8578 TOPPTR(nss,ix) = pv_dup(c);
8579 ptr = POPPTR(ss,ix);
8580 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
8582 case SAVEt_GENERIC_SVREF: /* generic sv */
8583 case SAVEt_SVREF: /* scalar reference */
8584 sv = (SV*)POPPTR(ss,ix);
8585 TOPPTR(nss,ix) = sv_dup_inc(sv);
8586 ptr = POPPTR(ss,ix);
8587 TOPPTR(nss,ix) = svp_dup_inc((SV**)ptr, proto_perl);/* XXXXX */
8589 case SAVEt_AV: /* array reference */
8590 av = (AV*)POPPTR(ss,ix);
8591 TOPPTR(nss,ix) = av_dup_inc(av);
8592 gv = (GV*)POPPTR(ss,ix);
8593 TOPPTR(nss,ix) = gv_dup(gv);
8595 case SAVEt_HV: /* hash reference */
8596 hv = (HV*)POPPTR(ss,ix);
8597 TOPPTR(nss,ix) = hv_dup_inc(hv);
8598 gv = (GV*)POPPTR(ss,ix);
8599 TOPPTR(nss,ix) = gv_dup(gv);
8601 case SAVEt_INT: /* int reference */
8602 ptr = POPPTR(ss,ix);
8603 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
8604 intval = (int)POPINT(ss,ix);
8605 TOPINT(nss,ix) = intval;
8607 case SAVEt_LONG: /* long reference */
8608 ptr = POPPTR(ss,ix);
8609 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
8610 longval = (long)POPLONG(ss,ix);
8611 TOPLONG(nss,ix) = longval;
8613 case SAVEt_I32: /* I32 reference */
8614 case SAVEt_I16: /* I16 reference */
8615 case SAVEt_I8: /* I8 reference */
8616 ptr = POPPTR(ss,ix);
8617 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
8621 case SAVEt_IV: /* IV reference */
8622 ptr = POPPTR(ss,ix);
8623 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
8627 case SAVEt_SPTR: /* SV* reference */
8628 ptr = POPPTR(ss,ix);
8629 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
8630 sv = (SV*)POPPTR(ss,ix);
8631 TOPPTR(nss,ix) = sv_dup(sv);
8633 case SAVEt_VPTR: /* random* reference */
8634 ptr = POPPTR(ss,ix);
8635 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
8636 ptr = POPPTR(ss,ix);
8637 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
8639 case SAVEt_PPTR: /* char* reference */
8640 ptr = POPPTR(ss,ix);
8641 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
8642 c = (char*)POPPTR(ss,ix);
8643 TOPPTR(nss,ix) = pv_dup(c);
8645 case SAVEt_HPTR: /* HV* reference */
8646 ptr = POPPTR(ss,ix);
8647 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
8648 hv = (HV*)POPPTR(ss,ix);
8649 TOPPTR(nss,ix) = hv_dup(hv);
8651 case SAVEt_APTR: /* AV* reference */
8652 ptr = POPPTR(ss,ix);
8653 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
8654 av = (AV*)POPPTR(ss,ix);
8655 TOPPTR(nss,ix) = av_dup(av);
8658 gv = (GV*)POPPTR(ss,ix);
8659 TOPPTR(nss,ix) = gv_dup(gv);
8661 case SAVEt_GP: /* scalar reference */
8662 gp = (GP*)POPPTR(ss,ix);
8663 TOPPTR(nss,ix) = gp = gp_dup(gp);
8664 (void)GpREFCNT_inc(gp);
8665 gv = (GV*)POPPTR(ss,ix);
8666 TOPPTR(nss,ix) = gv_dup_inc(c);
8667 c = (char*)POPPTR(ss,ix);
8668 TOPPTR(nss,ix) = pv_dup(c);
8675 case SAVEt_MORTALIZESV:
8676 sv = (SV*)POPPTR(ss,ix);
8677 TOPPTR(nss,ix) = sv_dup_inc(sv);
8680 ptr = POPPTR(ss,ix);
8681 if (ptr && (((OP*)ptr)->op_private & OPpREFCOUNTED)) {
8682 /* these are assumed to be refcounted properly */
8683 switch (((OP*)ptr)->op_type) {
8690 TOPPTR(nss,ix) = ptr;
8695 TOPPTR(nss,ix) = Nullop;
8700 TOPPTR(nss,ix) = Nullop;
8703 c = (char*)POPPTR(ss,ix);
8704 TOPPTR(nss,ix) = pv_dup_inc(c);
8707 longval = POPLONG(ss,ix);
8708 TOPLONG(nss,ix) = longval;
8711 hv = (HV*)POPPTR(ss,ix);
8712 TOPPTR(nss,ix) = hv_dup_inc(hv);
8713 c = (char*)POPPTR(ss,ix);
8714 TOPPTR(nss,ix) = pv_dup_inc(c);
8718 case SAVEt_DESTRUCTOR:
8719 ptr = POPPTR(ss,ix);
8720 TOPPTR(nss,ix) = any_dup(ptr, proto_perl); /* XXX quite arbitrary */
8721 dptr = POPDPTR(ss,ix);
8722 TOPDPTR(nss,ix) = (void (*)(void*))any_dup((void *)dptr, proto_perl);
8724 case SAVEt_DESTRUCTOR_X:
8725 ptr = POPPTR(ss,ix);
8726 TOPPTR(nss,ix) = any_dup(ptr, proto_perl); /* XXX quite arbitrary */
8727 dxptr = POPDXPTR(ss,ix);
8728 TOPDXPTR(nss,ix) = (void (*)(pTHXo_ void*))any_dup((void *)dxptr, proto_perl);
8730 case SAVEt_REGCONTEXT:
8736 case SAVEt_STACK_POS: /* Position on Perl stack */
8740 case SAVEt_AELEM: /* array element */
8741 sv = (SV*)POPPTR(ss,ix);
8742 TOPPTR(nss,ix) = sv_dup_inc(sv);
8745 av = (AV*)POPPTR(ss,ix);
8746 TOPPTR(nss,ix) = av_dup_inc(av);
8748 case SAVEt_HELEM: /* hash element */
8749 sv = (SV*)POPPTR(ss,ix);
8750 TOPPTR(nss,ix) = sv_dup_inc(sv);
8751 sv = (SV*)POPPTR(ss,ix);
8752 TOPPTR(nss,ix) = sv_dup_inc(sv);
8753 hv = (HV*)POPPTR(ss,ix);
8754 TOPPTR(nss,ix) = hv_dup_inc(hv);
8757 ptr = POPPTR(ss,ix);
8758 TOPPTR(nss,ix) = ptr;
8765 av = (AV*)POPPTR(ss,ix);
8766 TOPPTR(nss,ix) = av_dup(av);
8769 longval = (long)POPLONG(ss,ix);
8770 TOPLONG(nss,ix) = longval;
8771 ptr = POPPTR(ss,ix);
8772 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
8773 sv = (SV*)POPPTR(ss,ix);
8774 TOPPTR(nss,ix) = sv_dup(sv);
8777 Perl_croak(aTHX_ "panic: ss_dup inconsistency");
8789 perl_clone(PerlInterpreter *proto_perl, UV flags)
8792 CPerlObj *pPerl = (CPerlObj*)proto_perl;
8795 #ifdef PERL_IMPLICIT_SYS
8796 return perl_clone_using(proto_perl, flags,
8798 proto_perl->IMemShared,
8799 proto_perl->IMemParse,
8809 perl_clone_using(PerlInterpreter *proto_perl, UV flags,
8810 struct IPerlMem* ipM, struct IPerlMem* ipMS,
8811 struct IPerlMem* ipMP, struct IPerlEnv* ipE,
8812 struct IPerlStdIO* ipStd, struct IPerlLIO* ipLIO,
8813 struct IPerlDir* ipD, struct IPerlSock* ipS,
8814 struct IPerlProc* ipP)
8816 /* XXX many of the string copies here can be optimized if they're
8817 * constants; they need to be allocated as common memory and just
8818 * their pointers copied. */
8822 CPerlObj *pPerl = new(ipM) CPerlObj(ipM, ipMS, ipMP, ipE, ipStd, ipLIO,
8824 PERL_SET_THX(pPerl);
8825 # else /* !PERL_OBJECT */
8826 PerlInterpreter *my_perl = (PerlInterpreter*)(*ipM->pMalloc)(ipM, sizeof(PerlInterpreter));
8827 PERL_SET_THX(my_perl);
8830 memset(my_perl, 0xab, sizeof(PerlInterpreter));
8836 # else /* !DEBUGGING */
8837 Zero(my_perl, 1, PerlInterpreter);
8838 # endif /* DEBUGGING */
8842 PL_MemShared = ipMS;
8850 # endif /* PERL_OBJECT */
8851 #else /* !PERL_IMPLICIT_SYS */
8853 PerlInterpreter *my_perl = (PerlInterpreter*)PerlMem_malloc(sizeof(PerlInterpreter));
8854 PERL_SET_THX(my_perl);
8857 memset(my_perl, 0xab, sizeof(PerlInterpreter));
8863 # else /* !DEBUGGING */
8864 Zero(my_perl, 1, PerlInterpreter);
8865 # endif /* DEBUGGING */
8866 #endif /* PERL_IMPLICIT_SYS */
8869 PL_xiv_arenaroot = NULL;
8871 PL_xnv_arenaroot = NULL;
8873 PL_xrv_arenaroot = NULL;
8875 PL_xpv_arenaroot = NULL;
8877 PL_xpviv_arenaroot = NULL;
8878 PL_xpviv_root = NULL;
8879 PL_xpvnv_arenaroot = NULL;
8880 PL_xpvnv_root = NULL;
8881 PL_xpvcv_arenaroot = NULL;
8882 PL_xpvcv_root = NULL;
8883 PL_xpvav_arenaroot = NULL;
8884 PL_xpvav_root = NULL;
8885 PL_xpvhv_arenaroot = NULL;
8886 PL_xpvhv_root = NULL;
8887 PL_xpvmg_arenaroot = NULL;
8888 PL_xpvmg_root = NULL;
8889 PL_xpvlv_arenaroot = NULL;
8890 PL_xpvlv_root = NULL;
8891 PL_xpvbm_arenaroot = NULL;
8892 PL_xpvbm_root = NULL;
8893 PL_he_arenaroot = NULL;
8895 PL_nice_chunk = NULL;
8896 PL_nice_chunk_size = 0;
8899 PL_sv_root = Nullsv;
8900 PL_sv_arenaroot = Nullsv;
8902 PL_debug = proto_perl->Idebug;
8904 /* create SV map for pointer relocation */
8905 PL_ptr_table = ptr_table_new();
8907 /* initialize these special pointers as early as possible */
8908 SvANY(&PL_sv_undef) = NULL;
8909 SvREFCNT(&PL_sv_undef) = (~(U32)0)/2;
8910 SvFLAGS(&PL_sv_undef) = SVf_READONLY|SVt_NULL;
8911 ptr_table_store(PL_ptr_table, &proto_perl->Isv_undef, &PL_sv_undef);
8914 SvUPGRADE(&PL_sv_no, SVt_PVNV);
8916 SvANY(&PL_sv_no) = new_XPVNV();
8918 SvREFCNT(&PL_sv_no) = (~(U32)0)/2;
8919 SvFLAGS(&PL_sv_no) = SVp_NOK|SVf_NOK|SVp_POK|SVf_POK|SVf_READONLY|SVt_PVNV;
8920 SvPVX(&PL_sv_no) = SAVEPVN(PL_No, 0);
8921 SvCUR(&PL_sv_no) = 0;
8922 SvLEN(&PL_sv_no) = 1;
8923 SvNVX(&PL_sv_no) = 0;
8924 ptr_table_store(PL_ptr_table, &proto_perl->Isv_no, &PL_sv_no);
8927 SvUPGRADE(&PL_sv_yes, SVt_PVNV);
8929 SvANY(&PL_sv_yes) = new_XPVNV();
8931 SvREFCNT(&PL_sv_yes) = (~(U32)0)/2;
8932 SvFLAGS(&PL_sv_yes) = SVp_NOK|SVf_NOK|SVp_POK|SVf_POK|SVf_READONLY|SVt_PVNV;
8933 SvPVX(&PL_sv_yes) = SAVEPVN(PL_Yes, 1);
8934 SvCUR(&PL_sv_yes) = 1;
8935 SvLEN(&PL_sv_yes) = 2;
8936 SvNVX(&PL_sv_yes) = 1;
8937 ptr_table_store(PL_ptr_table, &proto_perl->Isv_yes, &PL_sv_yes);
8939 /* create shared string table */
8940 PL_strtab = newHV();
8941 HvSHAREKEYS_off(PL_strtab);
8942 hv_ksplit(PL_strtab, 512);
8943 ptr_table_store(PL_ptr_table, proto_perl->Istrtab, PL_strtab);
8945 PL_compiling = proto_perl->Icompiling;
8946 PL_compiling.cop_stashpv = SAVEPV(PL_compiling.cop_stashpv);
8947 PL_compiling.cop_file = SAVEPV(PL_compiling.cop_file);
8948 ptr_table_store(PL_ptr_table, &proto_perl->Icompiling, &PL_compiling);
8949 if (!specialWARN(PL_compiling.cop_warnings))
8950 PL_compiling.cop_warnings = sv_dup_inc(PL_compiling.cop_warnings);
8951 if (!specialCopIO(PL_compiling.cop_io))
8952 PL_compiling.cop_io = sv_dup_inc(PL_compiling.cop_io);
8953 PL_curcop = (COP*)any_dup(proto_perl->Tcurcop, proto_perl);
8955 /* pseudo environmental stuff */
8956 PL_origargc = proto_perl->Iorigargc;
8958 New(0, PL_origargv, i+1, char*);
8959 PL_origargv[i] = '\0';
8961 PL_origargv[i] = SAVEPV(proto_perl->Iorigargv[i]);
8963 PL_envgv = gv_dup(proto_perl->Ienvgv);
8964 PL_incgv = gv_dup(proto_perl->Iincgv);
8965 PL_hintgv = gv_dup(proto_perl->Ihintgv);
8966 PL_origfilename = SAVEPV(proto_perl->Iorigfilename);
8967 PL_diehook = sv_dup_inc(proto_perl->Idiehook);
8968 PL_warnhook = sv_dup_inc(proto_perl->Iwarnhook);
8971 PL_minus_c = proto_perl->Iminus_c;
8972 PL_patchlevel = sv_dup_inc(proto_perl->Ipatchlevel);
8973 PL_localpatches = proto_perl->Ilocalpatches;
8974 PL_splitstr = proto_perl->Isplitstr;
8975 PL_preprocess = proto_perl->Ipreprocess;
8976 PL_minus_n = proto_perl->Iminus_n;
8977 PL_minus_p = proto_perl->Iminus_p;
8978 PL_minus_l = proto_perl->Iminus_l;
8979 PL_minus_a = proto_perl->Iminus_a;
8980 PL_minus_F = proto_perl->Iminus_F;
8981 PL_doswitches = proto_perl->Idoswitches;
8982 PL_dowarn = proto_perl->Idowarn;
8983 PL_doextract = proto_perl->Idoextract;
8984 PL_sawampersand = proto_perl->Isawampersand;
8985 PL_unsafe = proto_perl->Iunsafe;
8986 PL_inplace = SAVEPV(proto_perl->Iinplace);
8987 PL_e_script = sv_dup_inc(proto_perl->Ie_script);
8988 PL_perldb = proto_perl->Iperldb;
8989 PL_perl_destruct_level = proto_perl->Iperl_destruct_level;
8991 /* magical thingies */
8992 /* XXX time(&PL_basetime) when asked for? */
8993 PL_basetime = proto_perl->Ibasetime;
8994 PL_formfeed = sv_dup(proto_perl->Iformfeed);
8996 PL_maxsysfd = proto_perl->Imaxsysfd;
8997 PL_multiline = proto_perl->Imultiline;
8998 PL_statusvalue = proto_perl->Istatusvalue;
9000 PL_statusvalue_vms = proto_perl->Istatusvalue_vms;
9003 /* shortcuts to various I/O objects */
9004 PL_stdingv = gv_dup(proto_perl->Istdingv);
9005 PL_stderrgv = gv_dup(proto_perl->Istderrgv);
9006 PL_defgv = gv_dup(proto_perl->Idefgv);
9007 PL_argvgv = gv_dup(proto_perl->Iargvgv);
9008 PL_argvoutgv = gv_dup(proto_perl->Iargvoutgv);
9009 PL_argvout_stack = av_dup_inc(proto_perl->Iargvout_stack);
9011 /* shortcuts to regexp stuff */
9012 PL_replgv = gv_dup(proto_perl->Ireplgv);
9014 /* shortcuts to misc objects */
9015 PL_errgv = gv_dup(proto_perl->Ierrgv);
9017 /* shortcuts to debugging objects */
9018 PL_DBgv = gv_dup(proto_perl->IDBgv);
9019 PL_DBline = gv_dup(proto_perl->IDBline);
9020 PL_DBsub = gv_dup(proto_perl->IDBsub);
9021 PL_DBsingle = sv_dup(proto_perl->IDBsingle);
9022 PL_DBtrace = sv_dup(proto_perl->IDBtrace);
9023 PL_DBsignal = sv_dup(proto_perl->IDBsignal);
9024 PL_lineary = av_dup(proto_perl->Ilineary);
9025 PL_dbargs = av_dup(proto_perl->Idbargs);
9028 PL_defstash = hv_dup_inc(proto_perl->Tdefstash);
9029 PL_curstash = hv_dup(proto_perl->Tcurstash);
9030 PL_debstash = hv_dup(proto_perl->Idebstash);
9031 PL_globalstash = hv_dup(proto_perl->Iglobalstash);
9032 PL_curstname = sv_dup_inc(proto_perl->Icurstname);
9034 PL_beginav = av_dup_inc(proto_perl->Ibeginav);
9035 PL_endav = av_dup_inc(proto_perl->Iendav);
9036 PL_checkav = av_dup_inc(proto_perl->Icheckav);
9037 PL_initav = av_dup_inc(proto_perl->Iinitav);
9039 PL_sub_generation = proto_perl->Isub_generation;
9041 /* funky return mechanisms */
9042 PL_forkprocess = proto_perl->Iforkprocess;
9044 /* subprocess state */
9045 PL_fdpid = av_dup_inc(proto_perl->Ifdpid);
9047 /* internal state */
9048 PL_tainting = proto_perl->Itainting;
9049 PL_maxo = proto_perl->Imaxo;
9050 if (proto_perl->Iop_mask)
9051 PL_op_mask = SAVEPVN(proto_perl->Iop_mask, PL_maxo);
9053 PL_op_mask = Nullch;
9055 /* current interpreter roots */
9056 PL_main_cv = cv_dup_inc(proto_perl->Imain_cv);
9057 PL_main_root = OpREFCNT_inc(proto_perl->Imain_root);
9058 PL_main_start = proto_perl->Imain_start;
9059 PL_eval_root = proto_perl->Ieval_root;
9060 PL_eval_start = proto_perl->Ieval_start;
9062 /* runtime control stuff */
9063 PL_curcopdb = (COP*)any_dup(proto_perl->Icurcopdb, proto_perl);
9064 PL_copline = proto_perl->Icopline;
9066 PL_filemode = proto_perl->Ifilemode;
9067 PL_lastfd = proto_perl->Ilastfd;
9068 PL_oldname = proto_perl->Ioldname; /* XXX not quite right */
9071 PL_gensym = proto_perl->Igensym;
9072 PL_preambled = proto_perl->Ipreambled;
9073 PL_preambleav = av_dup_inc(proto_perl->Ipreambleav);
9074 PL_laststatval = proto_perl->Ilaststatval;
9075 PL_laststype = proto_perl->Ilaststype;
9076 PL_mess_sv = Nullsv;
9078 PL_ors_sv = sv_dup_inc(proto_perl->Iors_sv);
9079 PL_ofmt = SAVEPV(proto_perl->Iofmt);
9081 /* interpreter atexit processing */
9082 PL_exitlistlen = proto_perl->Iexitlistlen;
9083 if (PL_exitlistlen) {
9084 New(0, PL_exitlist, PL_exitlistlen, PerlExitListEntry);
9085 Copy(proto_perl->Iexitlist, PL_exitlist, PL_exitlistlen, PerlExitListEntry);
9088 PL_exitlist = (PerlExitListEntry*)NULL;
9089 PL_modglobal = hv_dup_inc(proto_perl->Imodglobal);
9091 PL_profiledata = NULL;
9092 PL_rsfp = fp_dup(proto_perl->Irsfp, '<');
9093 /* PL_rsfp_filters entries have fake IoDIRP() */
9094 PL_rsfp_filters = av_dup_inc(proto_perl->Irsfp_filters);
9096 PL_compcv = cv_dup(proto_perl->Icompcv);
9097 PL_comppad = av_dup(proto_perl->Icomppad);
9098 PL_comppad_name = av_dup(proto_perl->Icomppad_name);
9099 PL_comppad_name_fill = proto_perl->Icomppad_name_fill;
9100 PL_comppad_name_floor = proto_perl->Icomppad_name_floor;
9101 PL_curpad = (SV**)ptr_table_fetch(PL_ptr_table,
9102 proto_perl->Tcurpad);
9104 #ifdef HAVE_INTERP_INTERN
9105 sys_intern_dup(&proto_perl->Isys_intern, &PL_sys_intern);
9108 /* more statics moved here */
9109 PL_generation = proto_perl->Igeneration;
9110 PL_DBcv = cv_dup(proto_perl->IDBcv);
9112 PL_in_clean_objs = proto_perl->Iin_clean_objs;
9113 PL_in_clean_all = proto_perl->Iin_clean_all;
9115 PL_uid = proto_perl->Iuid;
9116 PL_euid = proto_perl->Ieuid;
9117 PL_gid = proto_perl->Igid;
9118 PL_egid = proto_perl->Iegid;
9119 PL_nomemok = proto_perl->Inomemok;
9120 PL_an = proto_perl->Ian;
9121 PL_cop_seqmax = proto_perl->Icop_seqmax;
9122 PL_op_seqmax = proto_perl->Iop_seqmax;
9123 PL_evalseq = proto_perl->Ievalseq;
9124 PL_origenviron = proto_perl->Iorigenviron; /* XXX not quite right */
9125 PL_origalen = proto_perl->Iorigalen;
9126 PL_pidstatus = newHV(); /* XXX flag for cloning? */
9127 PL_osname = SAVEPV(proto_perl->Iosname);
9128 PL_sh_path = SAVEPV(proto_perl->Ish_path);
9129 PL_sighandlerp = proto_perl->Isighandlerp;
9132 PL_runops = proto_perl->Irunops;
9134 Copy(proto_perl->Itokenbuf, PL_tokenbuf, 256, char);
9137 PL_cshlen = proto_perl->Icshlen;
9138 PL_cshname = SAVEPVN(proto_perl->Icshname, PL_cshlen);
9141 PL_lex_state = proto_perl->Ilex_state;
9142 PL_lex_defer = proto_perl->Ilex_defer;
9143 PL_lex_expect = proto_perl->Ilex_expect;
9144 PL_lex_formbrack = proto_perl->Ilex_formbrack;
9145 PL_lex_dojoin = proto_perl->Ilex_dojoin;
9146 PL_lex_starts = proto_perl->Ilex_starts;
9147 PL_lex_stuff = sv_dup_inc(proto_perl->Ilex_stuff);
9148 PL_lex_repl = sv_dup_inc(proto_perl->Ilex_repl);
9149 PL_lex_op = proto_perl->Ilex_op;
9150 PL_lex_inpat = proto_perl->Ilex_inpat;
9151 PL_lex_inwhat = proto_perl->Ilex_inwhat;
9152 PL_lex_brackets = proto_perl->Ilex_brackets;
9153 i = (PL_lex_brackets < 120 ? 120 : PL_lex_brackets);
9154 PL_lex_brackstack = SAVEPVN(proto_perl->Ilex_brackstack,i);
9155 PL_lex_casemods = proto_perl->Ilex_casemods;
9156 i = (PL_lex_casemods < 12 ? 12 : PL_lex_casemods);
9157 PL_lex_casestack = SAVEPVN(proto_perl->Ilex_casestack,i);
9159 Copy(proto_perl->Inextval, PL_nextval, 5, YYSTYPE);
9160 Copy(proto_perl->Inexttype, PL_nexttype, 5, I32);
9161 PL_nexttoke = proto_perl->Inexttoke;
9163 PL_linestr = sv_dup_inc(proto_perl->Ilinestr);
9164 i = proto_perl->Ibufptr - SvPVX(proto_perl->Ilinestr);
9165 PL_bufptr = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
9166 i = proto_perl->Ioldbufptr - SvPVX(proto_perl->Ilinestr);
9167 PL_oldbufptr = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
9168 i = proto_perl->Ioldoldbufptr - SvPVX(proto_perl->Ilinestr);
9169 PL_oldoldbufptr = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
9170 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
9171 i = proto_perl->Ilinestart - SvPVX(proto_perl->Ilinestr);
9172 PL_linestart = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
9173 PL_pending_ident = proto_perl->Ipending_ident;
9174 PL_sublex_info = proto_perl->Isublex_info; /* XXX not quite right */
9176 PL_expect = proto_perl->Iexpect;
9178 PL_multi_start = proto_perl->Imulti_start;
9179 PL_multi_end = proto_perl->Imulti_end;
9180 PL_multi_open = proto_perl->Imulti_open;
9181 PL_multi_close = proto_perl->Imulti_close;
9183 PL_error_count = proto_perl->Ierror_count;
9184 PL_subline = proto_perl->Isubline;
9185 PL_subname = sv_dup_inc(proto_perl->Isubname);
9187 PL_min_intro_pending = proto_perl->Imin_intro_pending;
9188 PL_max_intro_pending = proto_perl->Imax_intro_pending;
9189 PL_padix = proto_perl->Ipadix;
9190 PL_padix_floor = proto_perl->Ipadix_floor;
9191 PL_pad_reset_pending = proto_perl->Ipad_reset_pending;
9193 i = proto_perl->Ilast_uni - SvPVX(proto_perl->Ilinestr);
9194 PL_last_uni = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
9195 i = proto_perl->Ilast_lop - SvPVX(proto_perl->Ilinestr);
9196 PL_last_lop = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
9197 PL_last_lop_op = proto_perl->Ilast_lop_op;
9198 PL_in_my = proto_perl->Iin_my;
9199 PL_in_my_stash = hv_dup(proto_perl->Iin_my_stash);
9201 PL_cryptseen = proto_perl->Icryptseen;
9204 PL_hints = proto_perl->Ihints;
9206 PL_amagic_generation = proto_perl->Iamagic_generation;
9208 #ifdef USE_LOCALE_COLLATE
9209 PL_collation_ix = proto_perl->Icollation_ix;
9210 PL_collation_name = SAVEPV(proto_perl->Icollation_name);
9211 PL_collation_standard = proto_perl->Icollation_standard;
9212 PL_collxfrm_base = proto_perl->Icollxfrm_base;
9213 PL_collxfrm_mult = proto_perl->Icollxfrm_mult;
9214 #endif /* USE_LOCALE_COLLATE */
9216 #ifdef USE_LOCALE_NUMERIC
9217 PL_numeric_name = SAVEPV(proto_perl->Inumeric_name);
9218 PL_numeric_standard = proto_perl->Inumeric_standard;
9219 PL_numeric_local = proto_perl->Inumeric_local;
9220 PL_numeric_radix_sv = sv_dup_inc(proto_perl->Inumeric_radix_sv);
9221 #endif /* !USE_LOCALE_NUMERIC */
9223 /* utf8 character classes */
9224 PL_utf8_alnum = sv_dup_inc(proto_perl->Iutf8_alnum);
9225 PL_utf8_alnumc = sv_dup_inc(proto_perl->Iutf8_alnumc);
9226 PL_utf8_ascii = sv_dup_inc(proto_perl->Iutf8_ascii);
9227 PL_utf8_alpha = sv_dup_inc(proto_perl->Iutf8_alpha);
9228 PL_utf8_space = sv_dup_inc(proto_perl->Iutf8_space);
9229 PL_utf8_cntrl = sv_dup_inc(proto_perl->Iutf8_cntrl);
9230 PL_utf8_graph = sv_dup_inc(proto_perl->Iutf8_graph);
9231 PL_utf8_digit = sv_dup_inc(proto_perl->Iutf8_digit);
9232 PL_utf8_upper = sv_dup_inc(proto_perl->Iutf8_upper);
9233 PL_utf8_lower = sv_dup_inc(proto_perl->Iutf8_lower);
9234 PL_utf8_print = sv_dup_inc(proto_perl->Iutf8_print);
9235 PL_utf8_punct = sv_dup_inc(proto_perl->Iutf8_punct);
9236 PL_utf8_xdigit = sv_dup_inc(proto_perl->Iutf8_xdigit);
9237 PL_utf8_mark = sv_dup_inc(proto_perl->Iutf8_mark);
9238 PL_utf8_toupper = sv_dup_inc(proto_perl->Iutf8_toupper);
9239 PL_utf8_totitle = sv_dup_inc(proto_perl->Iutf8_totitle);
9240 PL_utf8_tolower = sv_dup_inc(proto_perl->Iutf8_tolower);
9243 PL_last_swash_hv = Nullhv; /* reinits on demand */
9244 PL_last_swash_klen = 0;
9245 PL_last_swash_key[0]= '\0';
9246 PL_last_swash_tmps = (U8*)NULL;
9247 PL_last_swash_slen = 0;
9249 /* perly.c globals */
9250 PL_yydebug = proto_perl->Iyydebug;
9251 PL_yynerrs = proto_perl->Iyynerrs;
9252 PL_yyerrflag = proto_perl->Iyyerrflag;
9253 PL_yychar = proto_perl->Iyychar;
9254 PL_yyval = proto_perl->Iyyval;
9255 PL_yylval = proto_perl->Iyylval;
9257 PL_glob_index = proto_perl->Iglob_index;
9258 PL_srand_called = proto_perl->Isrand_called;
9259 PL_uudmap['M'] = 0; /* reinits on demand */
9260 PL_bitcount = Nullch; /* reinits on demand */
9262 if (proto_perl->Ipsig_pend) {
9263 Newz(0, PL_psig_pend, SIG_SIZE, int);
9266 PL_psig_pend = (int*)NULL;
9269 if (proto_perl->Ipsig_ptr) {
9270 Newz(0, PL_psig_ptr, SIG_SIZE, SV*);
9271 Newz(0, PL_psig_name, SIG_SIZE, SV*);
9272 for (i = 1; i < SIG_SIZE; i++) {
9273 PL_psig_ptr[i] = sv_dup_inc(proto_perl->Ipsig_ptr[i]);
9274 PL_psig_name[i] = sv_dup_inc(proto_perl->Ipsig_name[i]);
9278 PL_psig_ptr = (SV**)NULL;
9279 PL_psig_name = (SV**)NULL;
9282 /* thrdvar.h stuff */
9284 if (flags & CLONEf_COPY_STACKS) {
9285 /* next allocation will be PL_tmps_stack[PL_tmps_ix+1] */
9286 PL_tmps_ix = proto_perl->Ttmps_ix;
9287 PL_tmps_max = proto_perl->Ttmps_max;
9288 PL_tmps_floor = proto_perl->Ttmps_floor;
9289 Newz(50, PL_tmps_stack, PL_tmps_max, SV*);
9291 while (i <= PL_tmps_ix) {
9292 PL_tmps_stack[i] = sv_dup_inc(proto_perl->Ttmps_stack[i]);
9296 /* next PUSHMARK() sets *(PL_markstack_ptr+1) */
9297 i = proto_perl->Tmarkstack_max - proto_perl->Tmarkstack;
9298 Newz(54, PL_markstack, i, I32);
9299 PL_markstack_max = PL_markstack + (proto_perl->Tmarkstack_max
9300 - proto_perl->Tmarkstack);
9301 PL_markstack_ptr = PL_markstack + (proto_perl->Tmarkstack_ptr
9302 - proto_perl->Tmarkstack);
9303 Copy(proto_perl->Tmarkstack, PL_markstack,
9304 PL_markstack_ptr - PL_markstack + 1, I32);
9306 /* next push_scope()/ENTER sets PL_scopestack[PL_scopestack_ix]
9307 * NOTE: unlike the others! */
9308 PL_scopestack_ix = proto_perl->Tscopestack_ix;
9309 PL_scopestack_max = proto_perl->Tscopestack_max;
9310 Newz(54, PL_scopestack, PL_scopestack_max, I32);
9311 Copy(proto_perl->Tscopestack, PL_scopestack, PL_scopestack_ix, I32);
9313 /* next push_return() sets PL_retstack[PL_retstack_ix]
9314 * NOTE: unlike the others! */
9315 PL_retstack_ix = proto_perl->Tretstack_ix;
9316 PL_retstack_max = proto_perl->Tretstack_max;
9317 Newz(54, PL_retstack, PL_retstack_max, OP*);
9318 Copy(proto_perl->Tretstack, PL_retstack, PL_retstack_ix, I32);
9320 /* NOTE: si_dup() looks at PL_markstack */
9321 PL_curstackinfo = si_dup(proto_perl->Tcurstackinfo);
9323 /* PL_curstack = PL_curstackinfo->si_stack; */
9324 PL_curstack = av_dup(proto_perl->Tcurstack);
9325 PL_mainstack = av_dup(proto_perl->Tmainstack);
9327 /* next PUSHs() etc. set *(PL_stack_sp+1) */
9328 PL_stack_base = AvARRAY(PL_curstack);
9329 PL_stack_sp = PL_stack_base + (proto_perl->Tstack_sp
9330 - proto_perl->Tstack_base);
9331 PL_stack_max = PL_stack_base + AvMAX(PL_curstack);
9333 /* next SSPUSHFOO() sets PL_savestack[PL_savestack_ix]
9334 * NOTE: unlike the others! */
9335 PL_savestack_ix = proto_perl->Tsavestack_ix;
9336 PL_savestack_max = proto_perl->Tsavestack_max;
9337 /*Newz(54, PL_savestack, PL_savestack_max, ANY);*/
9338 PL_savestack = ss_dup(proto_perl);
9342 ENTER; /* perl_destruct() wants to LEAVE; */
9345 PL_start_env = proto_perl->Tstart_env; /* XXXXXX */
9346 PL_top_env = &PL_start_env;
9348 PL_op = proto_perl->Top;
9351 PL_Xpv = (XPV*)NULL;
9352 PL_na = proto_perl->Tna;
9354 PL_statbuf = proto_perl->Tstatbuf;
9355 PL_statcache = proto_perl->Tstatcache;
9356 PL_statgv = gv_dup(proto_perl->Tstatgv);
9357 PL_statname = sv_dup_inc(proto_perl->Tstatname);
9359 PL_timesbuf = proto_perl->Ttimesbuf;
9362 PL_tainted = proto_perl->Ttainted;
9363 PL_curpm = proto_perl->Tcurpm; /* XXX No PMOP ref count */
9364 PL_nrs = sv_dup_inc(proto_perl->Tnrs);
9365 PL_rs = sv_dup_inc(proto_perl->Trs);
9366 PL_last_in_gv = gv_dup(proto_perl->Tlast_in_gv);
9367 PL_ofs_sv = sv_dup_inc(proto_perl->Tofs_sv);
9368 PL_defoutgv = gv_dup_inc(proto_perl->Tdefoutgv);
9369 PL_chopset = proto_perl->Tchopset; /* XXX never deallocated */
9370 PL_toptarget = sv_dup_inc(proto_perl->Ttoptarget);
9371 PL_bodytarget = sv_dup_inc(proto_perl->Tbodytarget);
9372 PL_formtarget = sv_dup(proto_perl->Tformtarget);
9374 PL_restartop = proto_perl->Trestartop;
9375 PL_in_eval = proto_perl->Tin_eval;
9376 PL_delaymagic = proto_perl->Tdelaymagic;
9377 PL_dirty = proto_perl->Tdirty;
9378 PL_localizing = proto_perl->Tlocalizing;
9380 #ifdef PERL_FLEXIBLE_EXCEPTIONS
9381 PL_protect = proto_perl->Tprotect;
9383 PL_errors = sv_dup_inc(proto_perl->Terrors);
9384 PL_av_fetch_sv = Nullsv;
9385 PL_hv_fetch_sv = Nullsv;
9386 Zero(&PL_hv_fetch_ent_mh, 1, HE); /* XXX */
9387 PL_modcount = proto_perl->Tmodcount;
9388 PL_lastgotoprobe = Nullop;
9389 PL_dumpindent = proto_perl->Tdumpindent;
9391 PL_sortcop = (OP*)any_dup(proto_perl->Tsortcop, proto_perl);
9392 PL_sortstash = hv_dup(proto_perl->Tsortstash);
9393 PL_firstgv = gv_dup(proto_perl->Tfirstgv);
9394 PL_secondgv = gv_dup(proto_perl->Tsecondgv);
9395 PL_sortcxix = proto_perl->Tsortcxix;
9396 PL_efloatbuf = Nullch; /* reinits on demand */
9397 PL_efloatsize = 0; /* reinits on demand */
9401 PL_screamfirst = NULL;
9402 PL_screamnext = NULL;
9403 PL_maxscream = -1; /* reinits on demand */
9404 PL_lastscream = Nullsv;
9406 PL_watchaddr = NULL;
9407 PL_watchok = Nullch;
9409 PL_regdummy = proto_perl->Tregdummy;
9410 PL_regcomp_parse = Nullch;
9411 PL_regxend = Nullch;
9412 PL_regcode = (regnode*)NULL;
9415 PL_regprecomp = Nullch;
9420 PL_seen_zerolen = 0;
9422 PL_regcomp_rx = (regexp*)NULL;
9424 PL_colorset = 0; /* reinits PL_colors[] */
9425 /*PL_colors[6] = {0,0,0,0,0,0};*/
9426 PL_reg_whilem_seen = 0;
9427 PL_reginput = Nullch;
9430 PL_regstartp = (I32*)NULL;
9431 PL_regendp = (I32*)NULL;
9432 PL_reglastparen = (U32*)NULL;
9433 PL_regtill = Nullch;
9434 PL_reg_start_tmp = (char**)NULL;
9435 PL_reg_start_tmpl = 0;
9436 PL_regdata = (struct reg_data*)NULL;
9439 PL_reg_eval_set = 0;
9441 PL_regprogram = (regnode*)NULL;
9443 PL_regcc = (CURCUR*)NULL;
9444 PL_reg_call_cc = (struct re_cc_state*)NULL;
9445 PL_reg_re = (regexp*)NULL;
9446 PL_reg_ganch = Nullch;
9448 PL_reg_magic = (MAGIC*)NULL;
9450 PL_reg_oldcurpm = (PMOP*)NULL;
9451 PL_reg_curpm = (PMOP*)NULL;
9452 PL_reg_oldsaved = Nullch;
9453 PL_reg_oldsavedlen = 0;
9455 PL_reg_leftiter = 0;
9456 PL_reg_poscache = Nullch;
9457 PL_reg_poscache_size= 0;
9459 /* RE engine - function pointers */
9460 PL_regcompp = proto_perl->Tregcompp;
9461 PL_regexecp = proto_perl->Tregexecp;
9462 PL_regint_start = proto_perl->Tregint_start;
9463 PL_regint_string = proto_perl->Tregint_string;
9464 PL_regfree = proto_perl->Tregfree;
9466 PL_reginterp_cnt = 0;
9467 PL_reg_starttry = 0;
9469 if (!(flags & CLONEf_KEEP_PTR_TABLE)) {
9470 ptr_table_free(PL_ptr_table);
9471 PL_ptr_table = NULL;
9475 return (PerlInterpreter*)pPerl;
9481 #else /* !USE_ITHREADS */
9487 #endif /* USE_ITHREADS */
9490 do_report_used(pTHXo_ SV *sv)
9492 if (SvTYPE(sv) != SVTYPEMASK) {
9493 PerlIO_printf(Perl_debug_log, "****\n");
9499 do_clean_objs(pTHXo_ SV *sv)
9503 if (SvROK(sv) && SvOBJECT(rv = SvRV(sv))) {
9504 DEBUG_D((PerlIO_printf(Perl_debug_log, "Cleaning object ref:\n "), sv_dump(sv));)
9505 if (SvWEAKREF(sv)) {
9516 /* XXX Might want to check arrays, etc. */
9519 #ifndef DISABLE_DESTRUCTOR_KLUDGE
9521 do_clean_named_objs(pTHXo_ SV *sv)
9523 if (SvTYPE(sv) == SVt_PVGV && GvGP(sv)) {
9524 if ( SvOBJECT(GvSV(sv)) ||
9525 (GvAV(sv) && SvOBJECT(GvAV(sv))) ||
9526 (GvHV(sv) && SvOBJECT(GvHV(sv))) ||
9527 (GvIO(sv) && SvOBJECT(GvIO(sv))) ||
9528 (GvCV(sv) && SvOBJECT(GvCV(sv))) )
9530 DEBUG_D((PerlIO_printf(Perl_debug_log, "Cleaning named glob object:\n "), sv_dump(sv));)
9538 do_clean_all(pTHXo_ SV *sv)
9540 DEBUG_D((PerlIO_printf(Perl_debug_log, "Cleaning loops: SV at 0x%"UVxf"\n", PTR2UV(sv)) );)
9541 SvFLAGS(sv) |= SVf_BREAK;