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); \
66 if (PL_debug & 32768) \
76 if (PL_debug & 32768) {
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;
142 char *chunk; /* must use New here to match call to */
143 New(704,chunk,1008,char); /* Safefree() in sv_free_arenas() */
144 sv_add_arena(chunk, 1008, 0);
151 S_visit(pTHX_ SVFUNC_t f)
157 for (sva = PL_sv_arenaroot; sva; sva = (SV*)SvANY(sva)) {
158 svend = &sva[SvREFCNT(sva)];
159 for (sv = sva + 1; sv < svend; ++sv) {
160 if (SvTYPE(sv) != SVTYPEMASK)
167 Perl_sv_report_used(pTHX)
169 visit(do_report_used);
173 Perl_sv_clean_objs(pTHX)
175 PL_in_clean_objs = TRUE;
176 visit(do_clean_objs);
177 #ifndef DISABLE_DESTRUCTOR_KLUDGE
178 /* some barnacles may yet remain, clinging to typeglobs */
179 visit(do_clean_named_objs);
181 PL_in_clean_objs = FALSE;
185 Perl_sv_clean_all(pTHX)
187 PL_in_clean_all = TRUE;
189 PL_in_clean_all = FALSE;
193 Perl_sv_free_arenas(pTHX)
197 XPV *arena, *arenanext;
199 /* Free arenas here, but be careful about fake ones. (We assume
200 contiguity of the fake ones with the corresponding real ones.) */
202 for (sva = PL_sv_arenaroot; sva; sva = svanext) {
203 svanext = (SV*) SvANY(sva);
204 while (svanext && SvFAKE(svanext))
205 svanext = (SV*) SvANY(svanext);
208 Safefree((void *)sva);
211 for (arena = PL_xiv_arenaroot; arena; arena = arenanext) {
212 arenanext = (XPV*)arena->xpv_pv;
215 PL_xiv_arenaroot = 0;
217 for (arena = PL_xnv_arenaroot; arena; arena = arenanext) {
218 arenanext = (XPV*)arena->xpv_pv;
221 PL_xnv_arenaroot = 0;
223 for (arena = PL_xrv_arenaroot; arena; arena = arenanext) {
224 arenanext = (XPV*)arena->xpv_pv;
227 PL_xrv_arenaroot = 0;
229 for (arena = PL_xpv_arenaroot; arena; arena = arenanext) {
230 arenanext = (XPV*)arena->xpv_pv;
233 PL_xpv_arenaroot = 0;
235 for (arena = (XPV*)PL_xpviv_arenaroot; arena; arena = arenanext) {
236 arenanext = (XPV*)arena->xpv_pv;
239 PL_xpviv_arenaroot = 0;
241 for (arena = (XPV*)PL_xpvnv_arenaroot; arena; arena = arenanext) {
242 arenanext = (XPV*)arena->xpv_pv;
245 PL_xpvnv_arenaroot = 0;
247 for (arena = (XPV*)PL_xpvcv_arenaroot; arena; arena = arenanext) {
248 arenanext = (XPV*)arena->xpv_pv;
251 PL_xpvcv_arenaroot = 0;
253 for (arena = (XPV*)PL_xpvav_arenaroot; arena; arena = arenanext) {
254 arenanext = (XPV*)arena->xpv_pv;
257 PL_xpvav_arenaroot = 0;
259 for (arena = (XPV*)PL_xpvhv_arenaroot; arena; arena = arenanext) {
260 arenanext = (XPV*)arena->xpv_pv;
263 PL_xpvhv_arenaroot = 0;
265 for (arena = (XPV*)PL_xpvmg_arenaroot; arena; arena = arenanext) {
266 arenanext = (XPV*)arena->xpv_pv;
269 PL_xpvmg_arenaroot = 0;
271 for (arena = (XPV*)PL_xpvlv_arenaroot; arena; arena = arenanext) {
272 arenanext = (XPV*)arena->xpv_pv;
275 PL_xpvlv_arenaroot = 0;
277 for (arena = (XPV*)PL_xpvbm_arenaroot; arena; arena = arenanext) {
278 arenanext = (XPV*)arena->xpv_pv;
281 PL_xpvbm_arenaroot = 0;
283 for (arena = (XPV*)PL_he_arenaroot; arena; arena = arenanext) {
284 arenanext = (XPV*)arena->xpv_pv;
290 Safefree(PL_nice_chunk);
291 PL_nice_chunk = Nullch;
292 PL_nice_chunk_size = 0;
298 Perl_report_uninit(pTHX)
301 Perl_warner(aTHX_ WARN_UNINITIALIZED, PL_warn_uninit,
302 " in ", PL_op_desc[PL_op->op_type]);
304 Perl_warner(aTHX_ WARN_UNINITIALIZED, PL_warn_uninit, "", "");
316 * See comment in more_xiv() -- RAM.
318 PL_xiv_root = *(IV**)xiv;
320 return (XPVIV*)((char*)xiv - STRUCT_OFFSET(XPVIV, xiv_iv));
324 S_del_xiv(pTHX_ XPVIV *p)
326 IV* xiv = (IV*)((char*)(p) + STRUCT_OFFSET(XPVIV, xiv_iv));
328 *(IV**)xiv = PL_xiv_root;
339 New(705, ptr, 1008/sizeof(XPV), XPV);
340 ptr->xpv_pv = (char*)PL_xiv_arenaroot; /* linked list of xiv arenas */
341 PL_xiv_arenaroot = ptr; /* to keep Purify happy */
344 xivend = &xiv[1008 / sizeof(IV) - 1];
345 xiv += (sizeof(XPV) - 1) / sizeof(IV) + 1; /* fudge by size of XPV */
347 while (xiv < xivend) {
348 *(IV**)xiv = (IV *)(xiv + 1);
362 PL_xnv_root = *(NV**)xnv;
364 return (XPVNV*)((char*)xnv - STRUCT_OFFSET(XPVNV, xnv_nv));
368 S_del_xnv(pTHX_ XPVNV *p)
370 NV* xnv = (NV*)((char*)(p) + STRUCT_OFFSET(XPVNV, xnv_nv));
372 *(NV**)xnv = PL_xnv_root;
383 New(711, ptr, 1008/sizeof(XPV), XPV);
384 ptr->xpv_pv = (char*)PL_xnv_arenaroot;
385 PL_xnv_arenaroot = ptr;
388 xnvend = &xnv[1008 / sizeof(NV) - 1];
389 xnv += (sizeof(XPVIV) - 1) / sizeof(NV) + 1; /* fudge by sizeof XPVIV */
391 while (xnv < xnvend) {
392 *(NV**)xnv = (NV*)(xnv + 1);
406 PL_xrv_root = (XRV*)xrv->xrv_rv;
412 S_del_xrv(pTHX_ XRV *p)
415 p->xrv_rv = (SV*)PL_xrv_root;
424 register XRV* xrvend;
426 New(712, ptr, 1008/sizeof(XPV), XPV);
427 ptr->xpv_pv = (char*)PL_xrv_arenaroot;
428 PL_xrv_arenaroot = ptr;
431 xrvend = &xrv[1008 / sizeof(XRV) - 1];
432 xrv += (sizeof(XPV) - 1) / sizeof(XRV) + 1;
434 while (xrv < xrvend) {
435 xrv->xrv_rv = (SV*)(xrv + 1);
449 PL_xpv_root = (XPV*)xpv->xpv_pv;
455 S_del_xpv(pTHX_ XPV *p)
458 p->xpv_pv = (char*)PL_xpv_root;
467 register XPV* xpvend;
468 New(713, xpv, 1008/sizeof(XPV), XPV);
469 xpv->xpv_pv = (char*)PL_xpv_arenaroot;
470 PL_xpv_arenaroot = xpv;
472 xpvend = &xpv[1008 / sizeof(XPV) - 1];
474 while (xpv < xpvend) {
475 xpv->xpv_pv = (char*)(xpv + 1);
488 xpviv = PL_xpviv_root;
489 PL_xpviv_root = (XPVIV*)xpviv->xpv_pv;
495 S_del_xpviv(pTHX_ XPVIV *p)
498 p->xpv_pv = (char*)PL_xpviv_root;
506 register XPVIV* xpviv;
507 register XPVIV* xpvivend;
508 New(714, xpviv, 1008/sizeof(XPVIV), XPVIV);
509 xpviv->xpv_pv = (char*)PL_xpviv_arenaroot;
510 PL_xpviv_arenaroot = xpviv;
512 xpvivend = &xpviv[1008 / sizeof(XPVIV) - 1];
513 PL_xpviv_root = ++xpviv;
514 while (xpviv < xpvivend) {
515 xpviv->xpv_pv = (char*)(xpviv + 1);
528 xpvnv = PL_xpvnv_root;
529 PL_xpvnv_root = (XPVNV*)xpvnv->xpv_pv;
535 S_del_xpvnv(pTHX_ XPVNV *p)
538 p->xpv_pv = (char*)PL_xpvnv_root;
546 register XPVNV* xpvnv;
547 register XPVNV* xpvnvend;
548 New(715, xpvnv, 1008/sizeof(XPVNV), XPVNV);
549 xpvnv->xpv_pv = (char*)PL_xpvnv_arenaroot;
550 PL_xpvnv_arenaroot = xpvnv;
552 xpvnvend = &xpvnv[1008 / sizeof(XPVNV) - 1];
553 PL_xpvnv_root = ++xpvnv;
554 while (xpvnv < xpvnvend) {
555 xpvnv->xpv_pv = (char*)(xpvnv + 1);
568 xpvcv = PL_xpvcv_root;
569 PL_xpvcv_root = (XPVCV*)xpvcv->xpv_pv;
575 S_del_xpvcv(pTHX_ XPVCV *p)
578 p->xpv_pv = (char*)PL_xpvcv_root;
586 register XPVCV* xpvcv;
587 register XPVCV* xpvcvend;
588 New(716, xpvcv, 1008/sizeof(XPVCV), XPVCV);
589 xpvcv->xpv_pv = (char*)PL_xpvcv_arenaroot;
590 PL_xpvcv_arenaroot = xpvcv;
592 xpvcvend = &xpvcv[1008 / sizeof(XPVCV) - 1];
593 PL_xpvcv_root = ++xpvcv;
594 while (xpvcv < xpvcvend) {
595 xpvcv->xpv_pv = (char*)(xpvcv + 1);
608 xpvav = PL_xpvav_root;
609 PL_xpvav_root = (XPVAV*)xpvav->xav_array;
615 S_del_xpvav(pTHX_ XPVAV *p)
618 p->xav_array = (char*)PL_xpvav_root;
626 register XPVAV* xpvav;
627 register XPVAV* xpvavend;
628 New(717, xpvav, 1008/sizeof(XPVAV), XPVAV);
629 xpvav->xav_array = (char*)PL_xpvav_arenaroot;
630 PL_xpvav_arenaroot = xpvav;
632 xpvavend = &xpvav[1008 / sizeof(XPVAV) - 1];
633 PL_xpvav_root = ++xpvav;
634 while (xpvav < xpvavend) {
635 xpvav->xav_array = (char*)(xpvav + 1);
638 xpvav->xav_array = 0;
648 xpvhv = PL_xpvhv_root;
649 PL_xpvhv_root = (XPVHV*)xpvhv->xhv_array;
655 S_del_xpvhv(pTHX_ XPVHV *p)
658 p->xhv_array = (char*)PL_xpvhv_root;
666 register XPVHV* xpvhv;
667 register XPVHV* xpvhvend;
668 New(718, xpvhv, 1008/sizeof(XPVHV), XPVHV);
669 xpvhv->xhv_array = (char*)PL_xpvhv_arenaroot;
670 PL_xpvhv_arenaroot = xpvhv;
672 xpvhvend = &xpvhv[1008 / sizeof(XPVHV) - 1];
673 PL_xpvhv_root = ++xpvhv;
674 while (xpvhv < xpvhvend) {
675 xpvhv->xhv_array = (char*)(xpvhv + 1);
678 xpvhv->xhv_array = 0;
688 xpvmg = PL_xpvmg_root;
689 PL_xpvmg_root = (XPVMG*)xpvmg->xpv_pv;
695 S_del_xpvmg(pTHX_ XPVMG *p)
698 p->xpv_pv = (char*)PL_xpvmg_root;
706 register XPVMG* xpvmg;
707 register XPVMG* xpvmgend;
708 New(719, xpvmg, 1008/sizeof(XPVMG), XPVMG);
709 xpvmg->xpv_pv = (char*)PL_xpvmg_arenaroot;
710 PL_xpvmg_arenaroot = xpvmg;
712 xpvmgend = &xpvmg[1008 / sizeof(XPVMG) - 1];
713 PL_xpvmg_root = ++xpvmg;
714 while (xpvmg < xpvmgend) {
715 xpvmg->xpv_pv = (char*)(xpvmg + 1);
728 xpvlv = PL_xpvlv_root;
729 PL_xpvlv_root = (XPVLV*)xpvlv->xpv_pv;
735 S_del_xpvlv(pTHX_ XPVLV *p)
738 p->xpv_pv = (char*)PL_xpvlv_root;
746 register XPVLV* xpvlv;
747 register XPVLV* xpvlvend;
748 New(720, xpvlv, 1008/sizeof(XPVLV), XPVLV);
749 xpvlv->xpv_pv = (char*)PL_xpvlv_arenaroot;
750 PL_xpvlv_arenaroot = xpvlv;
752 xpvlvend = &xpvlv[1008 / sizeof(XPVLV) - 1];
753 PL_xpvlv_root = ++xpvlv;
754 while (xpvlv < xpvlvend) {
755 xpvlv->xpv_pv = (char*)(xpvlv + 1);
768 xpvbm = PL_xpvbm_root;
769 PL_xpvbm_root = (XPVBM*)xpvbm->xpv_pv;
775 S_del_xpvbm(pTHX_ XPVBM *p)
778 p->xpv_pv = (char*)PL_xpvbm_root;
786 register XPVBM* xpvbm;
787 register XPVBM* xpvbmend;
788 New(721, xpvbm, 1008/sizeof(XPVBM), XPVBM);
789 xpvbm->xpv_pv = (char*)PL_xpvbm_arenaroot;
790 PL_xpvbm_arenaroot = xpvbm;
792 xpvbmend = &xpvbm[1008 / sizeof(XPVBM) - 1];
793 PL_xpvbm_root = ++xpvbm;
794 while (xpvbm < xpvbmend) {
795 xpvbm->xpv_pv = (char*)(xpvbm + 1);
802 # define my_safemalloc(s) (void*)safexmalloc(717,s)
803 # define my_safefree(p) safexfree((char*)p)
805 # define my_safemalloc(s) (void*)safemalloc(s)
806 # define my_safefree(p) safefree((char*)p)
811 #define new_XIV() my_safemalloc(sizeof(XPVIV))
812 #define del_XIV(p) my_safefree(p)
814 #define new_XNV() my_safemalloc(sizeof(XPVNV))
815 #define del_XNV(p) my_safefree(p)
817 #define new_XRV() my_safemalloc(sizeof(XRV))
818 #define del_XRV(p) my_safefree(p)
820 #define new_XPV() my_safemalloc(sizeof(XPV))
821 #define del_XPV(p) my_safefree(p)
823 #define new_XPVIV() my_safemalloc(sizeof(XPVIV))
824 #define del_XPVIV(p) my_safefree(p)
826 #define new_XPVNV() my_safemalloc(sizeof(XPVNV))
827 #define del_XPVNV(p) my_safefree(p)
829 #define new_XPVCV() my_safemalloc(sizeof(XPVCV))
830 #define del_XPVCV(p) my_safefree(p)
832 #define new_XPVAV() my_safemalloc(sizeof(XPVAV))
833 #define del_XPVAV(p) my_safefree(p)
835 #define new_XPVHV() my_safemalloc(sizeof(XPVHV))
836 #define del_XPVHV(p) my_safefree(p)
838 #define new_XPVMG() my_safemalloc(sizeof(XPVMG))
839 #define del_XPVMG(p) my_safefree(p)
841 #define new_XPVLV() my_safemalloc(sizeof(XPVLV))
842 #define del_XPVLV(p) my_safefree(p)
844 #define new_XPVBM() my_safemalloc(sizeof(XPVBM))
845 #define del_XPVBM(p) my_safefree(p)
849 #define new_XIV() (void*)new_xiv()
850 #define del_XIV(p) del_xiv((XPVIV*) p)
852 #define new_XNV() (void*)new_xnv()
853 #define del_XNV(p) del_xnv((XPVNV*) p)
855 #define new_XRV() (void*)new_xrv()
856 #define del_XRV(p) del_xrv((XRV*) p)
858 #define new_XPV() (void*)new_xpv()
859 #define del_XPV(p) del_xpv((XPV *)p)
861 #define new_XPVIV() (void*)new_xpviv()
862 #define del_XPVIV(p) del_xpviv((XPVIV *)p)
864 #define new_XPVNV() (void*)new_xpvnv()
865 #define del_XPVNV(p) del_xpvnv((XPVNV *)p)
867 #define new_XPVCV() (void*)new_xpvcv()
868 #define del_XPVCV(p) del_xpvcv((XPVCV *)p)
870 #define new_XPVAV() (void*)new_xpvav()
871 #define del_XPVAV(p) del_xpvav((XPVAV *)p)
873 #define new_XPVHV() (void*)new_xpvhv()
874 #define del_XPVHV(p) del_xpvhv((XPVHV *)p)
876 #define new_XPVMG() (void*)new_xpvmg()
877 #define del_XPVMG(p) del_xpvmg((XPVMG *)p)
879 #define new_XPVLV() (void*)new_xpvlv()
880 #define del_XPVLV(p) del_xpvlv((XPVLV *)p)
882 #define new_XPVBM() (void*)new_xpvbm()
883 #define del_XPVBM(p) del_xpvbm((XPVBM *)p)
887 #define new_XPVGV() my_safemalloc(sizeof(XPVGV))
888 #define del_XPVGV(p) my_safefree(p)
890 #define new_XPVFM() my_safemalloc(sizeof(XPVFM))
891 #define del_XPVFM(p) my_safefree(p)
893 #define new_XPVIO() my_safemalloc(sizeof(XPVIO))
894 #define del_XPVIO(p) my_safefree(p)
897 =for apidoc sv_upgrade
899 Upgrade an SV to a more complex form. Use C<SvUPGRADE>. See
906 Perl_sv_upgrade(pTHX_ register SV *sv, U32 mt)
916 if (mt != SVt_PV && SvREADONLY(sv) && SvFAKE(sv)) {
920 if (SvTYPE(sv) == mt)
926 switch (SvTYPE(sv)) {
947 else if (mt < SVt_PVIV)
964 pv = (char*)SvRV(sv);
984 else if (mt == SVt_NV)
995 del_XPVIV(SvANY(sv));
1005 del_XPVNV(SvANY(sv));
1013 magic = SvMAGIC(sv);
1014 stash = SvSTASH(sv);
1015 del_XPVMG(SvANY(sv));
1018 Perl_croak(aTHX_ "Can't upgrade that kind of scalar");
1023 Perl_croak(aTHX_ "Can't upgrade to undef");
1025 SvANY(sv) = new_XIV();
1029 SvANY(sv) = new_XNV();
1033 SvANY(sv) = new_XRV();
1037 SvANY(sv) = new_XPV();
1043 SvANY(sv) = new_XPVIV();
1053 SvANY(sv) = new_XPVNV();
1061 SvANY(sv) = new_XPVMG();
1067 SvMAGIC(sv) = magic;
1068 SvSTASH(sv) = stash;
1071 SvANY(sv) = new_XPVLV();
1077 SvMAGIC(sv) = magic;
1078 SvSTASH(sv) = stash;
1085 SvANY(sv) = new_XPVAV();
1093 SvMAGIC(sv) = magic;
1094 SvSTASH(sv) = stash;
1100 SvANY(sv) = new_XPVHV();
1108 SvMAGIC(sv) = magic;
1109 SvSTASH(sv) = stash;
1116 SvANY(sv) = new_XPVCV();
1117 Zero(SvANY(sv), 1, XPVCV);
1123 SvMAGIC(sv) = magic;
1124 SvSTASH(sv) = stash;
1127 SvANY(sv) = new_XPVGV();
1133 SvMAGIC(sv) = magic;
1134 SvSTASH(sv) = stash;
1142 SvANY(sv) = new_XPVBM();
1148 SvMAGIC(sv) = magic;
1149 SvSTASH(sv) = stash;
1155 SvANY(sv) = new_XPVFM();
1156 Zero(SvANY(sv), 1, XPVFM);
1162 SvMAGIC(sv) = magic;
1163 SvSTASH(sv) = stash;
1166 SvANY(sv) = new_XPVIO();
1167 Zero(SvANY(sv), 1, XPVIO);
1173 SvMAGIC(sv) = magic;
1174 SvSTASH(sv) = stash;
1175 IoPAGE_LEN(sv) = 60;
1178 SvFLAGS(sv) &= ~SVTYPEMASK;
1184 Perl_sv_backoff(pTHX_ register SV *sv)
1188 char *s = SvPVX(sv);
1189 SvLEN(sv) += SvIVX(sv);
1190 SvPVX(sv) -= SvIVX(sv);
1192 Move(s, SvPVX(sv), SvCUR(sv)+1, char);
1194 SvFLAGS(sv) &= ~SVf_OOK;
1201 Expands the character buffer in the SV. This will use C<sv_unref> and will
1202 upgrade the SV to C<SVt_PV>. Returns a pointer to the character buffer.
1209 Perl_sv_grow(pTHX_ register SV *sv, register STRLEN newlen)
1213 #ifdef HAS_64K_LIMIT
1214 if (newlen >= 0x10000) {
1215 PerlIO_printf(Perl_debug_log,
1216 "Allocation too large: %"UVxf"\n", (UV)newlen);
1219 #endif /* HAS_64K_LIMIT */
1222 if (SvTYPE(sv) < SVt_PV) {
1223 sv_upgrade(sv, SVt_PV);
1226 else if (SvOOK(sv)) { /* pv is offset? */
1229 if (newlen > SvLEN(sv))
1230 newlen += 10 * (newlen - SvCUR(sv)); /* avoid copy each time */
1231 #ifdef HAS_64K_LIMIT
1232 if (newlen >= 0x10000)
1238 if (newlen > SvLEN(sv)) { /* need more room? */
1239 if (SvLEN(sv) && s) {
1240 #if defined(MYMALLOC) && !defined(LEAKTEST)
1241 STRLEN l = malloced_size((void*)SvPVX(sv));
1247 Renew(s,newlen,char);
1250 New(703,s,newlen,char);
1252 SvLEN_set(sv, newlen);
1258 =for apidoc sv_setiv
1260 Copies an integer into the given SV. Does not handle 'set' magic. See
1267 Perl_sv_setiv(pTHX_ register SV *sv, IV i)
1269 SV_CHECK_THINKFIRST(sv);
1270 switch (SvTYPE(sv)) {
1272 sv_upgrade(sv, SVt_IV);
1275 sv_upgrade(sv, SVt_PVNV);
1279 sv_upgrade(sv, SVt_PVIV);
1288 Perl_croak(aTHX_ "Can't coerce %s to integer in %s", sv_reftype(sv,0),
1289 PL_op_desc[PL_op->op_type]);
1291 (void)SvIOK_only(sv); /* validate number */
1297 =for apidoc sv_setiv_mg
1299 Like C<sv_setiv>, but also handles 'set' magic.
1305 Perl_sv_setiv_mg(pTHX_ register SV *sv, IV i)
1312 =for apidoc sv_setuv
1314 Copies an unsigned integer into the given SV. Does not handle 'set' magic.
1321 Perl_sv_setuv(pTHX_ register SV *sv, UV u)
1323 /* With these two if statements:
1324 u=1.49 s=0.52 cu=72.49 cs=10.64 scripts=270 tests=20865
1327 u=1.35 s=0.47 cu=73.45 cs=11.43 scripts=270 tests=20865
1329 If you wish to remove them, please benchmark to see what the effect is
1331 if (u <= (UV)IV_MAX) {
1332 sv_setiv(sv, (IV)u);
1341 =for apidoc sv_setuv_mg
1343 Like C<sv_setuv>, but also handles 'set' magic.
1349 Perl_sv_setuv_mg(pTHX_ register SV *sv, UV u)
1351 /* With these two if statements:
1352 u=1.49 s=0.52 cu=72.49 cs=10.64 scripts=270 tests=20865
1355 u=1.35 s=0.47 cu=73.45 cs=11.43 scripts=270 tests=20865
1357 If you wish to remove them, please benchmark to see what the effect is
1359 if (u <= (UV)IV_MAX) {
1360 sv_setiv(sv, (IV)u);
1370 =for apidoc sv_setnv
1372 Copies a double into the given SV. Does not handle 'set' magic. See
1379 Perl_sv_setnv(pTHX_ register SV *sv, NV num)
1381 SV_CHECK_THINKFIRST(sv);
1382 switch (SvTYPE(sv)) {
1385 sv_upgrade(sv, SVt_NV);
1390 sv_upgrade(sv, SVt_PVNV);
1399 Perl_croak(aTHX_ "Can't coerce %s to number in %s", sv_reftype(sv,0),
1400 PL_op_name[PL_op->op_type]);
1403 (void)SvNOK_only(sv); /* validate number */
1408 =for apidoc sv_setnv_mg
1410 Like C<sv_setnv>, but also handles 'set' magic.
1416 Perl_sv_setnv_mg(pTHX_ register SV *sv, NV num)
1423 S_not_a_number(pTHX_ SV *sv)
1428 char *limit = tmpbuf + sizeof(tmpbuf) - 8;
1429 /* each *s can expand to 4 chars + "...\0",
1430 i.e. need room for 8 chars */
1432 for (s = SvPVX(sv); *s && d < limit; s++) {
1434 if (ch & 128 && !isPRINT_LC(ch)) {
1443 else if (ch == '\r') {
1447 else if (ch == '\f') {
1451 else if (ch == '\\') {
1455 else if (isPRINT_LC(ch))
1470 Perl_warner(aTHX_ WARN_NUMERIC,
1471 "Argument \"%s\" isn't numeric in %s", tmpbuf,
1472 PL_op_desc[PL_op->op_type]);
1474 Perl_warner(aTHX_ WARN_NUMERIC,
1475 "Argument \"%s\" isn't numeric", tmpbuf);
1478 /* the number can be converted to integer with atol() or atoll() although */
1479 #define IS_NUMBER_TO_INT_BY_ATOL 0x01 /* integer (may have decimals) */
1480 #define IS_NUMBER_TO_INT_BY_STRTOL 0x02 /* it may exceed IV_MAX */
1481 #define IS_NUMBER_TO_INT_BY_ATOF 0x04 /* seen something like 123e4 */
1482 #define IS_NUMBER_LONGER_THAN_IV_MAX 0x08 /* more digits than IV_MAX */
1483 #define IS_NUMBER_AS_LONG_AS_IV_MAX 0x10 /* may(be not) larger than IV_MAX */
1484 #define IS_NUMBER_NOT_INT 0x20 /* seen a decimal point or e */
1485 #define IS_NUMBER_NEG 0x40 /* seen a leading - */
1486 #define IS_NUMBER_INFINITY 0x80 /* /^\s*-?Infinity\s*$/i */
1488 /* Actually, ISO C leaves conversion of UV to IV undefined, but
1489 until proven guilty, assume that things are not that bad... */
1491 /* As 64 bit platforms often have an NV that doesn't preserve all bits of
1492 an IV (an assumption perl has been based on to date) it becomes necessary
1493 to remove the assumption that the NV always carries enough precision to
1494 recreate the IV whenever needed, and that the NV is the canonical form.
1495 Instead, IV/UV and NV need to be given equal rights. So as to not lose
1496 precision as an side effect of conversion (which would lead to insanity
1497 and the dragon(s) in t/op/numconvert.t getting very angry) the intent is
1498 1) to distinguish between IV/UV/NV slots that have cached a valid
1499 conversion where precision was lost and IV/UV/NV slots that have a
1500 valid conversion which has lost no precision
1501 2) to ensure that if a numeric conversion to one form is request that
1502 would lose precision, the precise conversion (or differently
1503 imprecise conversion) is also performed and cached, to prevent
1504 requests for different numeric formats on the same SV causing
1505 lossy conversion chains. (lossless conversion chains are perfectly
1510 SvIOKp is true if the IV slot contains a valid value
1511 SvIOK is true only if the IV value is accurate (UV if SvIOK_UV true)
1512 SvNOKp is true if the NV slot contains a valid value
1513 SvNOK is true only if the NV value is accurate
1516 while converting from PV to NV check to see if converting that NV to an
1517 IV(or UV) would lose accuracy over a direct conversion from PV to
1518 IV(or UV). If it would, cache both conversions, return NV, but mark
1519 SV as IOK NOKp (ie not NOK).
1521 while converting from PV to IV check to see if converting that IV to an
1522 NV would lose accuracy over a direct conversion from PV to NV. If it
1523 would, cache both conversions, flag similarly.
1525 Before, the SV value "3.2" could become NV=3.2 IV=3 NOK, IOK quite
1526 correctly because if IV & NV were set NV *always* overruled.
1527 Now, "3.2" will become NV=3.2 IV=3 NOK, IOKp, because the flags meaning
1528 changes - now IV and NV together means that the two are interchangeable
1529 SvIVX == (IV) SvNVX && SvNVX == (NV) SvIVX;
1531 The benefit of this is operations such as pp_add know that if SvIOK is
1532 true for both left and right operands, then integer addition can be
1533 used instead of floating point. (for cases where the result won't
1534 overflow) Before, floating point was always used, which could lead to
1535 loss of precision compared with integer addition.
1537 * making IV and NV equal status should make maths accurate on 64 bit
1539 * may speed up maths somewhat if pp_add and friends start to use
1540 integers when possible instead of fp. (hopefully the overhead in
1541 looking for SvIOK and checking for overflow will not outweigh the
1542 fp to integer speedup)
1543 * will slow down integer operations (callers of SvIV) on "inaccurate"
1544 values, as the change from SvIOK to SvIOKp will cause a call into
1545 sv_2iv each time rather than a macro access direct to the IV slot
1546 * should speed up number->string conversion on integers as IV is
1547 favoured when IV and NV equally accurate
1549 ####################################################################
1550 You had better be using SvIOK_notUV if you want an IV for arithmetic
1551 SvIOK is true if (IV or UV), so you might be getting (IV)SvUV
1552 SvUOK is true iff UV.
1553 ####################################################################
1555 Your mileage will vary depending your CPUs relative fp to integer
1559 #ifndef NV_PRESERVES_UV
1560 #define IS_NUMBER_UNDERFLOW_IV 1
1561 #define IS_NUMBER_UNDERFLOW_UV 2
1562 #define IS_NUMBER_IV_AND_UV 2
1563 #define IS_NUMBER_OVERFLOW_IV 4
1564 #define IS_NUMBER_OVERFLOW_UV 5
1565 /* Hopefully your optimiser will consider inlining these two functions. */
1567 S_sv_2inuv_non_preserve (pTHX_ register SV *sv, I32 numtype) {
1568 NV nv = SvNVX(sv); /* Code simpler and had compiler problems if */
1569 UV nv_as_uv = U_V(nv); /* these are not in simple variables. */
1570 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));
1571 if (nv_as_uv <= (UV)IV_MAX) {
1572 (void)SvIOKp_on(sv);
1573 (void)SvNOKp_on(sv);
1574 /* Within suitable range to fit in an IV, atol won't overflow */
1575 /* XXX quite sure? Is that your final answer? not really, I'm
1576 trusting that nv_as_uv to round down if NV is (IV_MAX + 1) */
1577 SvIVX(sv) = (IV)Atol(SvPVX(sv));
1578 if (numtype & IS_NUMBER_NOT_INT) {
1579 /* I believe that even if the original PV had decimals, they
1580 are lost beyond the limit of the FP precision.
1581 However, neither is canonical, so both only get p flags.
1583 /* Both already have p flags, so do nothing */
1584 } else if (SvIVX(sv) == I_V(nv)) {
1589 /* It had no "." so it must be integer. assert (get in here from
1590 sv_2iv and sv_2uv only for ndef HAS_STRTOL and
1591 IS_NUMBER_AS_LONG_AS_IV_MAX) or my logic is faulty and all
1592 conversion routines need audit. */
1594 return nv < 0 ? IS_NUMBER_UNDERFLOW_UV : IS_NUMBER_IV_AND_UV;
1596 /* between IV_MAX and NV(UV_MAX). Could be slightly> UV_MAX */
1597 (void)SvIOKp_on(sv);
1598 (void)SvNOKp_on(sv);
1601 int save_errno = errno;
1603 SvUVX(sv) = Strtoul(SvPVX(sv), Null(char**), 10);
1605 if (numtype & IS_NUMBER_NOT_INT) {
1606 /* UV and NV both imprecise. */
1608 } else if (SvUVX(sv) == nv_as_uv && SvUVX(sv) != UV_MAX) {
1617 return IS_NUMBER_OVERFLOW_IV;
1621 /* Must have just overflowed UV, but not enough that an NV could spot
1623 return IS_NUMBER_OVERFLOW_UV;
1626 /* We've just lost integer precision, nothing we could do. */
1627 SvUVX(sv) = nv_as_uv;
1628 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));
1629 /* UV and NV slots equally valid only if we have casting symmetry. */
1630 if (numtype & IS_NUMBER_NOT_INT) {
1632 } else if (SvUVX(sv) == nv_as_uv && SvUVX(sv) != UV_MAX) {
1633 /* UV_MAX can cast up to NV (UV_MAX+1), that NV casts down to UV_MAX
1634 UV_MAX ought to be 0xFF...FFF which won't preserve (We only
1635 get to this point if NVs don't preserve UVs) */
1640 /* As above, I believe UV at least as good as NV */
1643 #endif /* HAS_STRTOUL */
1644 return IS_NUMBER_OVERFLOW_IV;
1647 /* For sv_2nv these three cases are "SvNOK and don't bother casting" */
1649 S_sv_2iuv_non_preserve (pTHX_ register SV *sv, I32 numtype)
1651 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));
1652 if (SvNVX(sv) < (NV)IV_MIN) {
1653 (void)SvIOKp_on(sv);
1656 return IS_NUMBER_UNDERFLOW_IV;
1658 if (SvNVX(sv) > (NV)UV_MAX) {
1659 (void)SvIOKp_on(sv);
1663 return IS_NUMBER_OVERFLOW_UV;
1665 if (!(numtype & (IS_NUMBER_TO_INT_BY_ATOL | IS_NUMBER_TO_INT_BY_STRTOL))) {
1666 (void)SvIOKp_on(sv);
1668 /* Can't use strtol etc to convert this string */
1669 if (SvNVX(sv) <= (UV)IV_MAX) {
1670 SvIVX(sv) = I_V(SvNVX(sv));
1671 if ((NV)(SvIVX(sv)) == SvNVX(sv)) {
1672 SvIOK_on(sv); /* Integer is precise. NOK, IOK */
1674 /* Integer is imprecise. NOK, IOKp */
1676 return SvNVX(sv) < 0 ? IS_NUMBER_UNDERFLOW_UV : IS_NUMBER_IV_AND_UV;
1679 SvUVX(sv) = U_V(SvNVX(sv));
1680 if ((NV)(SvUVX(sv)) == SvNVX(sv)) {
1681 if (SvUVX(sv) == UV_MAX) {
1682 /* As we know that NVs don't preserve UVs, UV_MAX cannot
1683 possibly be preserved by NV. Hence, it must be overflow.
1685 return IS_NUMBER_OVERFLOW_UV;
1687 SvIOK_on(sv); /* Integer is precise. NOK, UOK */
1689 /* Integer is imprecise. NOK, IOKp */
1691 return IS_NUMBER_OVERFLOW_IV;
1693 return S_sv_2inuv_non_preserve(aTHX_ sv, numtype);
1695 #endif /* NV_PRESERVES_UV*/
1698 Perl_sv_2iv(pTHX_ register SV *sv)
1702 if (SvGMAGICAL(sv)) {
1707 return I_V(SvNVX(sv));
1709 if (SvPOKp(sv) && SvLEN(sv))
1712 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
1713 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
1719 if (SvTHINKFIRST(sv)) {
1722 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv,numer)) &&
1723 (SvRV(tmpstr) != SvRV(sv)))
1724 return SvIV(tmpstr);
1725 return PTR2IV(SvRV(sv));
1727 if (SvREADONLY(sv) && SvFAKE(sv)) {
1728 sv_force_normal(sv);
1730 if (SvREADONLY(sv) && !SvOK(sv)) {
1731 if (ckWARN(WARN_UNINITIALIZED))
1738 return (IV)(SvUVX(sv));
1745 /* erm. not sure. *should* never get NOKp (without NOK) from sv_2nv
1746 * without also getting a cached IV/UV from it at the same time
1747 * (ie PV->NV conversion should detect loss of accuracy and cache
1748 * IV or UV at same time to avoid this. NWC */
1750 if (SvTYPE(sv) == SVt_NV)
1751 sv_upgrade(sv, SVt_PVNV);
1753 (void)SvIOKp_on(sv); /* Must do this first, to clear any SvOOK */
1754 /* < not <= as for NV doesn't preserve UV, ((NV)IV_MAX+1) will almost
1755 certainly cast into the IV range at IV_MAX, whereas the correct
1756 answer is the UV IV_MAX +1. Hence < ensures that dodgy boundary
1758 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
1759 SvIVX(sv) = I_V(SvNVX(sv));
1760 if (SvNVX(sv) == (NV) SvIVX(sv)
1761 #ifndef NV_PRESERVES_UV
1762 && (((UV)1 << NV_PRESERVES_UV_BITS) >
1763 (UV)(SvIVX(sv) > 0 ? SvIVX(sv) : -SvIVX(sv)))
1764 /* Don't flag it as "accurately an integer" if the number
1765 came from a (by definition imprecise) NV operation, and
1766 we're outside the range of NV integer precision */
1769 SvIOK_on(sv); /* Can this go wrong with rounding? NWC */
1770 DEBUG_c(PerlIO_printf(Perl_debug_log,
1771 "0x%"UVxf" iv(%g => %"IVdf") (precise)\n",
1777 /* IV not precise. No need to convert from PV, as NV
1778 conversion would already have cached IV if it detected
1779 that PV->IV would be better than PV->NV->IV
1780 flags already correct - don't set public IOK. */
1781 DEBUG_c(PerlIO_printf(Perl_debug_log,
1782 "0x%"UVxf" iv(%g => %"IVdf") (imprecise)\n",
1787 /* Can the above go wrong if SvIVX == IV_MIN and SvNVX < IV_MIN,
1788 but the cast (NV)IV_MIN rounds to a the value less (more
1789 negative) than IV_MIN which happens to be equal to SvNVX ??
1790 Analogous to 0xFFFFFFFFFFFFFFFF rounding up to NV (2**64) and
1791 NV rounding back to 0xFFFFFFFFFFFFFFFF, so UVX == UV(NVX) and
1792 (NV)UVX == NVX are both true, but the values differ. :-(
1793 Hopefully for 2s complement IV_MIN is something like
1794 0x8000000000000000 which will be exact. NWC */
1797 SvUVX(sv) = U_V(SvNVX(sv));
1799 (SvNVX(sv) == (NV) SvUVX(sv))
1800 #ifndef NV_PRESERVES_UV
1801 /* Make sure it's not 0xFFFFFFFFFFFFFFFF */
1802 /*&& (SvUVX(sv) != UV_MAX) irrelevant with code below */
1803 && (((UV)1 << NV_PRESERVES_UV_BITS) > SvUVX(sv))
1804 /* Don't flag it as "accurately an integer" if the number
1805 came from a (by definition imprecise) NV operation, and
1806 we're outside the range of NV integer precision */
1812 DEBUG_c(PerlIO_printf(Perl_debug_log,
1813 "0x%"UVxf" 2iv(%"UVuf" => %"IVdf") (as unsigned)\n",
1817 return (IV)SvUVX(sv);
1820 else if (SvPOKp(sv) && SvLEN(sv)) {
1821 I32 numtype = looks_like_number(sv);
1823 /* We want to avoid a possible problem when we cache an IV which
1824 may be later translated to an NV, and the resulting NV is not
1825 the translation of the initial data.
1827 This means that if we cache such an IV, we need to cache the
1828 NV as well. Moreover, we trade speed for space, and do not
1829 cache the NV if we are sure it's not needed.
1832 if ((numtype & ~IS_NUMBER_NEG) == IS_NUMBER_TO_INT_BY_ATOL) {
1833 /* The NV may be reconstructed from IV - safe to cache IV,
1834 which may be calculated by atol(). */
1835 if (SvTYPE(sv) < SVt_PVIV)
1836 sv_upgrade(sv, SVt_PVIV);
1838 SvIVX(sv) = Atol(SvPVX(sv));
1842 int save_errno = errno;
1843 /* Is it an integer that we could convert with strtol?
1844 So try it, and if it doesn't set errno then it's pukka.
1845 This should be faster than going atof and then thinking. */
1846 if (((numtype & (IS_NUMBER_TO_INT_BY_STRTOL | IS_NUMBER_NOT_INT))
1847 == IS_NUMBER_TO_INT_BY_STRTOL)
1848 /* && is a sequence point. Without it not sure if I'm trying
1849 to do too much between sequence points and hence going
1851 && ((errno = 0), 1) /* , 1 so always true */
1852 && ((i = Strtol(SvPVX(sv), Null(char**), 10)), 1)
1854 if (SvTYPE(sv) < SVt_PVIV)
1855 sv_upgrade(sv, SVt_PVIV);
1864 /* Hopefully trace flow will optimise this away where possible
1868 /* It wasn't an integer, or it overflowed, or we don't have
1869 strtol. Do things the slow way - check if it's a UV etc. */
1870 d = Atof(SvPVX(sv));
1872 if (SvTYPE(sv) < SVt_PVNV)
1873 sv_upgrade(sv, SVt_PVNV);
1876 if (! numtype && ckWARN(WARN_NUMERIC))
1879 #if defined(USE_LONG_DOUBLE)
1880 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2iv(%" PERL_PRIgldbl ")\n",
1881 PTR2UV(sv), SvNVX(sv)));
1883 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2iv(%g)\n",
1884 PTR2UV(sv), SvNVX(sv)));
1888 #ifdef NV_PRESERVES_UV
1889 (void)SvIOKp_on(sv);
1891 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
1892 SvIVX(sv) = I_V(SvNVX(sv));
1893 if ((NV)(SvIVX(sv)) == SvNVX(sv)) {
1896 /* Integer is imprecise. NOK, IOKp */
1898 /* UV will not work better than IV */
1900 if (SvNVX(sv) > (NV)UV_MAX) {
1902 /* Integer is inaccurate. NOK, IOKp, is UV */
1906 SvUVX(sv) = U_V(SvNVX(sv));
1907 /* 0xFFFFFFFFFFFFFFFF not an issue in here */
1908 if ((NV)(SvUVX(sv)) == SvNVX(sv)) {
1912 /* Integer is imprecise. NOK, IOKp, is UV */
1918 #else /* NV_PRESERVES_UV */
1919 if (((UV)1 << NV_PRESERVES_UV_BITS) >
1920 U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))) {
1921 /* Small enough to preserve all bits. */
1922 (void)SvIOKp_on(sv);
1924 SvIVX(sv) = I_V(SvNVX(sv));
1925 if ((NV)(SvIVX(sv)) == SvNVX(sv))
1927 /* Assumption: first non-preserved integer is < IV_MAX,
1928 this NV is in the preserved range, therefore: */
1929 if (!(U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))
1931 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);
1933 } else if (sv_2iuv_non_preserve (sv, numtype)
1934 >= IS_NUMBER_OVERFLOW_IV)
1936 #endif /* NV_PRESERVES_UV */
1940 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing && !(SvFLAGS(sv) & SVs_PADTMP))
1942 if (SvTYPE(sv) < SVt_IV)
1943 /* Typically the caller expects that sv_any is not NULL now. */
1944 sv_upgrade(sv, SVt_IV);
1947 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2iv(%"IVdf")\n",
1948 PTR2UV(sv),SvIVX(sv)));
1949 return SvIsUV(sv) ? (IV)SvUVX(sv) : SvIVX(sv);
1953 Perl_sv_2uv(pTHX_ register SV *sv)
1957 if (SvGMAGICAL(sv)) {
1962 return U_V(SvNVX(sv));
1963 if (SvPOKp(sv) && SvLEN(sv))
1966 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
1967 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
1973 if (SvTHINKFIRST(sv)) {
1976 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv,numer)) &&
1977 (SvRV(tmpstr) != SvRV(sv)))
1978 return SvUV(tmpstr);
1979 return PTR2UV(SvRV(sv));
1981 if (SvREADONLY(sv) && SvFAKE(sv)) {
1982 sv_force_normal(sv);
1984 if (SvREADONLY(sv) && !SvOK(sv)) {
1985 if (ckWARN(WARN_UNINITIALIZED))
1995 return (UV)SvIVX(sv);
1999 /* erm. not sure. *should* never get NOKp (without NOK) from sv_2nv
2000 * without also getting a cached IV/UV from it at the same time
2001 * (ie PV->NV conversion should detect loss of accuracy and cache
2002 * IV or UV at same time to avoid this. */
2003 /* IV-over-UV optimisation - choose to cache IV if possible */
2005 if (SvTYPE(sv) == SVt_NV)
2006 sv_upgrade(sv, SVt_PVNV);
2008 (void)SvIOKp_on(sv); /* Must do this first, to clear any SvOOK */
2009 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2010 SvIVX(sv) = I_V(SvNVX(sv));
2011 if (SvNVX(sv) == (NV) SvIVX(sv)
2012 #ifndef NV_PRESERVES_UV
2013 && (((UV)1 << NV_PRESERVES_UV_BITS) >
2014 (UV)(SvIVX(sv) > 0 ? SvIVX(sv) : -SvIVX(sv)))
2015 /* Don't flag it as "accurately an integer" if the number
2016 came from a (by definition imprecise) NV operation, and
2017 we're outside the range of NV integer precision */
2020 SvIOK_on(sv); /* Can this go wrong with rounding? NWC */
2021 DEBUG_c(PerlIO_printf(Perl_debug_log,
2022 "0x%"UVxf" uv(%g => %"IVdf") (precise)\n",
2028 /* IV not precise. No need to convert from PV, as NV
2029 conversion would already have cached IV if it detected
2030 that PV->IV would be better than PV->NV->IV
2031 flags already correct - don't set public IOK. */
2032 DEBUG_c(PerlIO_printf(Perl_debug_log,
2033 "0x%"UVxf" uv(%g => %"IVdf") (imprecise)\n",
2038 /* Can the above go wrong if SvIVX == IV_MIN and SvNVX < IV_MIN,
2039 but the cast (NV)IV_MIN rounds to a the value less (more
2040 negative) than IV_MIN which happens to be equal to SvNVX ??
2041 Analogous to 0xFFFFFFFFFFFFFFFF rounding up to NV (2**64) and
2042 NV rounding back to 0xFFFFFFFFFFFFFFFF, so UVX == UV(NVX) and
2043 (NV)UVX == NVX are both true, but the values differ. :-(
2044 Hopefully for 2s complement IV_MIN is something like
2045 0x8000000000000000 which will be exact. NWC */
2048 SvUVX(sv) = U_V(SvNVX(sv));
2050 (SvNVX(sv) == (NV) SvUVX(sv))
2051 #ifndef NV_PRESERVES_UV
2052 /* Make sure it's not 0xFFFFFFFFFFFFFFFF */
2053 /*&& (SvUVX(sv) != UV_MAX) irrelevant with code below */
2054 && (((UV)1 << NV_PRESERVES_UV_BITS) > SvUVX(sv))
2055 /* Don't flag it as "accurately an integer" if the number
2056 came from a (by definition imprecise) NV operation, and
2057 we're outside the range of NV integer precision */
2062 DEBUG_c(PerlIO_printf(Perl_debug_log,
2063 "0x%"UVxf" 2uv(%"UVuf" => %"IVdf") (as unsigned)\n",
2069 else if (SvPOKp(sv) && SvLEN(sv)) {
2070 I32 numtype = looks_like_number(sv);
2072 /* We want to avoid a possible problem when we cache a UV which
2073 may be later translated to an NV, and the resulting NV is not
2074 the translation of the initial data.
2076 This means that if we cache such a UV, we need to cache the
2077 NV as well. Moreover, we trade speed for space, and do not
2078 cache the NV if not needed.
2081 if ((numtype & ~IS_NUMBER_NEG) == IS_NUMBER_TO_INT_BY_ATOL) {
2082 /* The NV may be reconstructed from IV - safe to cache IV,
2083 which may be calculated by atol(). */
2084 if (SvTYPE(sv) < SVt_PVIV)
2085 sv_upgrade(sv, SVt_PVIV);
2087 SvIVX(sv) = Atol(SvPVX(sv));
2091 char *num_begin = SvPVX(sv);
2092 int save_errno = errno;
2094 /* seems that strtoul taking numbers that start with - is
2095 implementation dependant, and can't be relied upon. */
2096 if (numtype & IS_NUMBER_NEG) {
2097 /* Not totally defensive. assumine that looks_like_num
2098 didn't lie about a - sign */
2099 while (isSPACE(*num_begin))
2101 if (*num_begin == '-')
2105 /* Is it an integer that we could convert with strtoul?
2106 So try it, and if it doesn't set errno then it's pukka.
2107 This should be faster than going atof and then thinking. */
2108 if (((numtype & (IS_NUMBER_TO_INT_BY_STRTOL | IS_NUMBER_NOT_INT))
2109 == IS_NUMBER_TO_INT_BY_STRTOL)
2110 && ((errno = 0), 1) /* always true */
2111 && ((u = Strtoul(num_begin, Null(char**), 10)), 1) /* ditto */
2113 /* If known to be negative, check it didn't undeflow IV
2114 XXX possibly we should put more negative values as NVs
2115 direct rather than go via atof below */
2116 && ((numtype & IS_NUMBER_NEG) ? (u <= (UV)IV_MIN) : 1)) {
2119 if (SvTYPE(sv) < SVt_PVIV)
2120 sv_upgrade(sv, SVt_PVIV);
2123 /* If it's negative must use IV.
2124 IV-over-UV optimisation */
2125 if (numtype & IS_NUMBER_NEG) {
2127 } else if (u <= (UV) IV_MAX) {
2130 /* it didn't overflow, and it was positive. */
2139 /* Hopefully trace flow will optimise this away where possible
2143 /* It wasn't an integer, or it overflowed, or we don't have
2144 strtol. Do things the slow way - check if it's a IV etc. */
2145 d = Atof(SvPVX(sv));
2147 if (SvTYPE(sv) < SVt_PVNV)
2148 sv_upgrade(sv, SVt_PVNV);
2151 if (! numtype && ckWARN(WARN_NUMERIC))
2154 #if defined(USE_LONG_DOUBLE)
2155 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2uv(%" PERL_PRIgldbl ")\n",
2156 PTR2UV(sv), SvNVX(sv)));
2158 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2uv(%g)\n",
2159 PTR2UV(sv), SvNVX(sv)));
2162 #ifdef NV_PRESERVES_UV
2163 (void)SvIOKp_on(sv);
2165 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2166 SvIVX(sv) = I_V(SvNVX(sv));
2167 if ((NV)(SvIVX(sv)) == SvNVX(sv)) {
2170 /* Integer is imprecise. NOK, IOKp */
2172 /* UV will not work better than IV */
2174 if (SvNVX(sv) > (NV)UV_MAX) {
2176 /* Integer is inaccurate. NOK, IOKp, is UV */
2180 SvUVX(sv) = U_V(SvNVX(sv));
2181 /* 0xFFFFFFFFFFFFFFFF not an issue in here, NVs
2182 NV preservse UV so can do correct comparison. */
2183 if ((NV)(SvUVX(sv)) == SvNVX(sv)) {
2187 /* Integer is imprecise. NOK, IOKp, is UV */
2192 #else /* NV_PRESERVES_UV */
2193 if (((UV)1 << NV_PRESERVES_UV_BITS) >
2194 U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))) {
2195 /* Small enough to preserve all bits. */
2196 (void)SvIOKp_on(sv);
2198 SvIVX(sv) = I_V(SvNVX(sv));
2199 if ((NV)(SvIVX(sv)) == SvNVX(sv))
2201 /* Assumption: first non-preserved integer is < IV_MAX,
2202 this NV is in the preserved range, therefore: */
2203 if (!(U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))
2205 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);
2208 sv_2iuv_non_preserve (sv, numtype);
2209 #endif /* NV_PRESERVES_UV */
2214 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
2215 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
2218 if (SvTYPE(sv) < SVt_IV)
2219 /* Typically the caller expects that sv_any is not NULL now. */
2220 sv_upgrade(sv, SVt_IV);
2224 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2uv(%"UVuf")\n",
2225 PTR2UV(sv),SvUVX(sv)));
2226 return SvIsUV(sv) ? SvUVX(sv) : (UV)SvIVX(sv);
2230 Perl_sv_2nv(pTHX_ register SV *sv)
2234 if (SvGMAGICAL(sv)) {
2238 if (SvPOKp(sv) && SvLEN(sv)) {
2239 if (ckWARN(WARN_NUMERIC) && !SvIOKp(sv) && !looks_like_number(sv))
2241 return Atof(SvPVX(sv));
2245 return (NV)SvUVX(sv);
2247 return (NV)SvIVX(sv);
2250 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
2251 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
2257 if (SvTHINKFIRST(sv)) {
2260 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv,numer)) &&
2261 (SvRV(tmpstr) != SvRV(sv)))
2262 return SvNV(tmpstr);
2263 return PTR2NV(SvRV(sv));
2265 if (SvREADONLY(sv) && SvFAKE(sv)) {
2266 sv_force_normal(sv);
2268 if (SvREADONLY(sv) && !SvOK(sv)) {
2269 if (ckWARN(WARN_UNINITIALIZED))
2274 if (SvTYPE(sv) < SVt_NV) {
2275 if (SvTYPE(sv) == SVt_IV)
2276 sv_upgrade(sv, SVt_PVNV);
2278 sv_upgrade(sv, SVt_NV);
2279 #if defined(USE_LONG_DOUBLE)
2281 STORE_NUMERIC_LOCAL_SET_STANDARD();
2282 PerlIO_printf(Perl_debug_log,
2283 "0x%"UVxf" num(%" PERL_PRIgldbl ")\n",
2284 PTR2UV(sv), SvNVX(sv));
2285 RESTORE_NUMERIC_LOCAL();
2289 STORE_NUMERIC_LOCAL_SET_STANDARD();
2290 PerlIO_printf(Perl_debug_log, "0x%"UVxf" num(%g)\n",
2291 PTR2UV(sv), SvNVX(sv));
2292 RESTORE_NUMERIC_LOCAL();
2296 else if (SvTYPE(sv) < SVt_PVNV)
2297 sv_upgrade(sv, SVt_PVNV);
2299 (!SvPOKp(sv) || !strchr(SvPVX(sv),'.') || !looks_like_number(sv)))
2301 SvNVX(sv) = SvIsUV(sv) ? (NV)SvUVX(sv) : (NV)SvIVX(sv);
2302 #ifdef NV_PRESERVES_UV
2305 /* Only set the public NV OK flag if this NV preserves the IV */
2306 /* Check it's not 0xFFFFFFFFFFFFFFFF */
2307 if (SvIsUV(sv) ? ((SvUVX(sv) != UV_MAX)&&(SvUVX(sv) == U_V(SvNVX(sv))))
2308 : (SvIVX(sv) == I_V(SvNVX(sv))))
2314 else if (SvPOKp(sv) && SvLEN(sv)) {
2315 if (ckWARN(WARN_NUMERIC) && !SvIOKp(sv) && !looks_like_number(sv))
2317 SvNVX(sv) = Atof(SvPVX(sv));
2318 #ifdef NV_PRESERVES_UV
2321 /* Only set the public NV OK flag if this NV preserves the value in
2322 the PV at least as well as an IV/UV would.
2323 Not sure how to do this 100% reliably. */
2324 /* if that shift count is out of range then Configure's test is
2325 wonky. We shouldn't be in here with NV_PRESERVES_UV_BITS ==
2327 if (((UV)1 << NV_PRESERVES_UV_BITS) >
2328 U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv)))
2329 SvNOK_on(sv); /* Definitely small enough to preserve all bits */
2330 else if (SvNVX(sv) < (NV)IV_MIN || SvNVX(sv) > (NV)UV_MAX) {
2331 /* Definitely too large/small to fit in an integer, so no loss
2332 of precision going to integer in the future via NV */
2335 /* Is it something we can run through strtol etc (ie no
2336 trailing exponent part)? */
2337 int numtype = looks_like_number(sv);
2338 /* XXX probably should cache this if called above */
2341 (IS_NUMBER_TO_INT_BY_ATOL | IS_NUMBER_TO_INT_BY_STRTOL))) {
2342 /* Can't use strtol etc to convert this string, so don't try */
2345 sv_2inuv_non_preserve (sv, numtype);
2347 #endif /* NV_PRESERVES_UV */
2350 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing && !(SvFLAGS(sv) & SVs_PADTMP))
2352 if (SvTYPE(sv) < SVt_NV)
2353 /* Typically the caller expects that sv_any is not NULL now. */
2354 /* XXX Ilya implies that this is a bug in callers that assume this
2355 and ideally should be fixed. */
2356 sv_upgrade(sv, SVt_NV);
2359 #if defined(USE_LONG_DOUBLE)
2361 STORE_NUMERIC_LOCAL_SET_STANDARD();
2362 PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2nv(%" PERL_PRIgldbl ")\n",
2363 PTR2UV(sv), SvNVX(sv));
2364 RESTORE_NUMERIC_LOCAL();
2368 STORE_NUMERIC_LOCAL_SET_STANDARD();
2369 PerlIO_printf(Perl_debug_log, "0x%"UVxf" 1nv(%g)\n",
2370 PTR2UV(sv), SvNVX(sv));
2371 RESTORE_NUMERIC_LOCAL();
2378 S_asIV(pTHX_ SV *sv)
2380 I32 numtype = looks_like_number(sv);
2383 if (numtype & IS_NUMBER_TO_INT_BY_ATOL)
2384 return Atol(SvPVX(sv));
2386 if (ckWARN(WARN_NUMERIC))
2389 d = Atof(SvPVX(sv));
2394 S_asUV(pTHX_ SV *sv)
2396 I32 numtype = looks_like_number(sv);
2399 if (numtype & IS_NUMBER_TO_INT_BY_ATOL)
2400 return Strtoul(SvPVX(sv), Null(char**), 10);
2403 if (ckWARN(WARN_NUMERIC))
2406 return U_V(Atof(SvPVX(sv)));
2410 * Returns a combination of (advisory only - can get false negatives)
2411 * IS_NUMBER_TO_INT_BY_ATOL, IS_NUMBER_TO_INT_BY_ATOF
2412 * IS_NUMBER_LONGER_THAN_IV_MAX, IS_NUMBER_AS_LONG_AS_IV_MAX
2413 * IS_NUMBER_NOT_INT, IS_NUMBER_NEG, IS_NUMBER_INFINITY
2414 * 0 if does not look like number.
2416 * (atol and strtol stop when they hit a decimal point. strtol will return
2417 * LONG_MAX and LONG_MIN when given out of range values. ANSI says they should
2418 * do this, and vendors have had 11 years to get it right.
2419 * However, will try to make it still work with only atol
2421 * IS_NUMBER_TO_INT_BY_ATOL 123456789 or 123456789.3 definitely < IV_MAX
2422 * IS_NUMBER_TO_INT_BY_STRTOL 123456789 or 123456789.3 if digits = IV_MAX
2423 * IS_NUMBER_TO_INT_BY_ATOF 123456789e0 or >> IV_MAX
2424 * IS_NUMBER_LONGER_THAN_IV_MAX lots of digits, don't bother with atol
2425 * IS_NUMBER_AS_LONG_AS_IV_MAX atol might hit LONG_MAX, might not.
2426 * IS_NUMBER_NOT_INT saw "." or "e"
2428 * IS_NUMBER_INFINITY
2432 =for apidoc looks_like_number
2434 Test if an the content of an SV looks like a number (or is a
2435 number). C<Inf> and C<Infinity> are treated as numbers (so will not
2436 issue a non-numeric warning), even if your atof() doesn't grok them.
2442 Perl_looks_like_number(pTHX_ SV *sv)
2445 register char *send;
2446 register char *sbegin;
2447 register char *nbegin;
2456 else if (SvPOKp(sv))
2457 sbegin = SvPV(sv, len);
2460 send = sbegin + len;
2467 numtype = IS_NUMBER_NEG;
2474 * we return IS_NUMBER_TO_INT_BY_ATOL if the number can converted to
2475 * integer with atol() without overflow, IS_NUMBER_TO_INT_BY_STRTOL if
2476 * possibly slightly larger than max int, IS_NUMBER_TO_INT_BY_ATOF if you
2477 * will need (int)atof().
2480 /* next must be digit or the radix separator or beginning of infinity */
2484 } while (isDIGIT(*s));
2486 /* Aaargh. long long really is irritating.
2487 In the gospel according to ANSI 1989, it is an axiom that "long"
2488 is the longest integer type, and that if you don't know how long
2489 something is you can cast it to long, and nothing will be lost
2490 (except possibly speed of execution if long is slower than the
2492 Now, one can't be sure if the old rules apply, or long long
2493 (or some other newfangled thing) is actually longer than the
2494 (formerly) longest thing.
2496 /* This lot will work for 64 bit *as long as* either
2497 either long is 64 bit
2498 or we can find both strtol/strtoq and strtoul/strtouq
2499 If not, we really should refuse to let the user use 64 bit IVs
2500 By "64 bit" I really mean IVs that don't get preserved by NVs
2501 It also should work for 128 bit IVs. Can any lend me a machine to
2504 if (s - nbegin > TYPE_DIGITS(UV)) /* Cannot cache ato[ul]() */
2505 numtype |= IS_NUMBER_TO_INT_BY_ATOF | IS_NUMBER_LONGER_THAN_IV_MAX;
2506 else if (s - nbegin < BIT_DIGITS(((sizeof (IV)>sizeof (long))
2507 ? sizeof(long) : sizeof (IV))*8-1))
2508 numtype |= IS_NUMBER_TO_INT_BY_ATOL;
2510 /* Can't be sure either way. (For 64 bit UV, 63 bit IV is 1 decimal
2511 digit less (IV_MAX= 9223372036854775807,
2512 UV_MAX= 18446744073709551615) so be cautious */
2513 numtype |= IS_NUMBER_TO_INT_BY_STRTOL | IS_NUMBER_AS_LONG_AS_IV_MAX;
2516 #ifdef USE_LOCALE_NUMERIC
2517 || IS_NUMERIC_RADIX(*s)
2521 numtype |= IS_NUMBER_NOT_INT;
2522 while (isDIGIT(*s)) /* optional digits after the radix */
2527 #ifdef USE_LOCALE_NUMERIC
2528 || IS_NUMERIC_RADIX(*s)
2532 numtype |= IS_NUMBER_TO_INT_BY_ATOL | IS_NUMBER_NOT_INT;
2533 /* no digits before the radix means we need digits after it */
2537 } while (isDIGIT(*s));
2542 else if (*s == 'I' || *s == 'i') {
2543 s++; if (*s != 'N' && *s != 'n') return 0;
2544 s++; if (*s != 'F' && *s != 'f') return 0;
2545 s++; if (*s == 'I' || *s == 'i') {
2546 s++; if (*s != 'N' && *s != 'n') return 0;
2547 s++; if (*s != 'I' && *s != 'i') return 0;
2548 s++; if (*s != 'T' && *s != 't') return 0;
2549 s++; if (*s != 'Y' && *s != 'y') return 0;
2558 numtype = (numtype & IS_NUMBER_NEG) /* Keep track of sign */
2559 | IS_NUMBER_INFINITY | IS_NUMBER_NOT_INT;
2561 /* we can have an optional exponent part */
2562 if (*s == 'e' || *s == 'E') {
2563 numtype &= IS_NUMBER_NEG;
2564 numtype |= IS_NUMBER_TO_INT_BY_ATOF | IS_NUMBER_NOT_INT;
2566 if (*s == '+' || *s == '-')
2571 } while (isDIGIT(*s));
2581 if (len == 10 && memEQ(sbegin, "0 but true", 10))
2582 return IS_NUMBER_TO_INT_BY_ATOL;
2587 Perl_sv_2pv_nolen(pTHX_ register SV *sv)
2590 return sv_2pv(sv, &n_a);
2593 /* We assume that buf is at least TYPE_CHARS(UV) long. */
2595 uiv_2buf(char *buf, IV iv, UV uv, int is_uv, char **peob)
2597 char *ptr = buf + TYPE_CHARS(UV);
2611 *--ptr = '0' + (uv % 10);
2620 Perl_sv_2pv(pTHX_ register SV *sv, STRLEN *lp)
2625 char tbuf[64]; /* Must fit sprintf/Gconvert of longest IV/NV */
2626 char *tmpbuf = tbuf;
2632 if (SvGMAGICAL(sv)) {
2640 (void)sprintf(tmpbuf,"%"UVuf, (UV)SvUVX(sv));
2642 (void)sprintf(tmpbuf,"%"IVdf, (IV)SvIVX(sv));
2647 Gconvert(SvNVX(sv), NV_DIG, 0, tmpbuf);
2652 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
2653 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
2660 if (SvTHINKFIRST(sv)) {
2663 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv,string)) &&
2664 (SvRV(tmpstr) != SvRV(sv)))
2665 return SvPV(tmpstr,*lp);
2672 switch (SvTYPE(sv)) {
2674 if ( ((SvFLAGS(sv) &
2675 (SVs_OBJECT|SVf_OK|SVs_GMG|SVs_SMG|SVs_RMG))
2676 == (SVs_OBJECT|SVs_RMG))
2677 && strEQ(s=HvNAME(SvSTASH(sv)), "Regexp")
2678 && (mg = mg_find(sv, 'r'))) {
2679 regexp *re = (regexp *)mg->mg_obj;
2682 char *fptr = "msix";
2687 U16 reganch = (re->reganch & PMf_COMPILETIME) >> 12;
2689 while((ch = *fptr++)) {
2691 reflags[left++] = ch;
2694 reflags[right--] = ch;
2699 reflags[left] = '-';
2703 mg->mg_len = re->prelen + 4 + left;
2704 New(616, mg->mg_ptr, mg->mg_len + 1 + left, char);
2705 Copy("(?", mg->mg_ptr, 2, char);
2706 Copy(reflags, mg->mg_ptr+2, left, char);
2707 Copy(":", mg->mg_ptr+left+2, 1, char);
2708 Copy(re->precomp, mg->mg_ptr+3+left, re->prelen, char);
2709 mg->mg_ptr[mg->mg_len - 1] = ')';
2710 mg->mg_ptr[mg->mg_len] = 0;
2712 PL_reginterp_cnt += re->program[0].next_off;
2724 case SVt_PVBM: if (SvROK(sv))
2727 s = "SCALAR"; break;
2728 case SVt_PVLV: s = "LVALUE"; break;
2729 case SVt_PVAV: s = "ARRAY"; break;
2730 case SVt_PVHV: s = "HASH"; break;
2731 case SVt_PVCV: s = "CODE"; break;
2732 case SVt_PVGV: s = "GLOB"; break;
2733 case SVt_PVFM: s = "FORMAT"; break;
2734 case SVt_PVIO: s = "IO"; break;
2735 default: s = "UNKNOWN"; break;
2739 Perl_sv_setpvf(aTHX_ tsv, "%s=%s", HvNAME(SvSTASH(sv)), s);
2742 Perl_sv_catpvf(aTHX_ tsv, "(0x%"UVxf")", PTR2UV(sv));
2748 if (SvREADONLY(sv) && !SvOK(sv)) {
2749 if (ckWARN(WARN_UNINITIALIZED))
2755 if (SvIOK(sv) || ((SvIOKp(sv) && !SvNOKp(sv)))) {
2756 /* I'm assuming that if both IV and NV are equally valid then
2757 converting the IV is going to be more efficient */
2758 U32 isIOK = SvIOK(sv);
2759 U32 isUIOK = SvIsUV(sv);
2760 char buf[TYPE_CHARS(UV)];
2763 if (SvTYPE(sv) < SVt_PVIV)
2764 sv_upgrade(sv, SVt_PVIV);
2766 ptr = uiv_2buf(buf, 0, SvUVX(sv), 1, &ebuf);
2768 ptr = uiv_2buf(buf, SvIVX(sv), 0, 0, &ebuf);
2769 SvGROW(sv, ebuf - ptr + 1); /* inlined from sv_setpvn */
2770 Move(ptr,SvPVX(sv),ebuf - ptr,char);
2771 SvCUR_set(sv, ebuf - ptr);
2781 else if (SvNOKp(sv)) {
2782 if (SvTYPE(sv) < SVt_PVNV)
2783 sv_upgrade(sv, SVt_PVNV);
2784 /* The +20 is pure guesswork. Configure test needed. --jhi */
2785 SvGROW(sv, NV_DIG + 20);
2787 olderrno = errno; /* some Xenix systems wipe out errno here */
2789 if (SvNVX(sv) == 0.0)
2790 (void)strcpy(s,"0");
2794 Gconvert(SvNVX(sv), NV_DIG, 0, s);
2797 #ifdef FIXNEGATIVEZERO
2798 if (*s == '-' && s[1] == '0' && !s[2])
2808 if (ckWARN(WARN_UNINITIALIZED)
2809 && !PL_localizing && !(SvFLAGS(sv) & SVs_PADTMP))
2812 if (SvTYPE(sv) < SVt_PV)
2813 /* Typically the caller expects that sv_any is not NULL now. */
2814 sv_upgrade(sv, SVt_PV);
2817 *lp = s - SvPVX(sv);
2820 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2pv(%s)\n",
2821 PTR2UV(sv),SvPVX(sv)));
2825 if (SvROK(sv)) { /* XXX Skip this when sv_pvn_force calls */
2826 /* Sneaky stuff here */
2830 tsv = newSVpv(tmpbuf, 0);
2846 len = strlen(tmpbuf);
2848 #ifdef FIXNEGATIVEZERO
2849 if (len == 2 && t[0] == '-' && t[1] == '0') {
2854 (void)SvUPGRADE(sv, SVt_PV);
2856 s = SvGROW(sv, len + 1);
2865 Perl_sv_2pvbyte_nolen(pTHX_ register SV *sv)
2868 return sv_2pvbyte(sv, &n_a);
2872 Perl_sv_2pvbyte(pTHX_ register SV *sv, STRLEN *lp)
2874 return sv_2pv(sv,lp);
2878 Perl_sv_2pvutf8_nolen(pTHX_ register SV *sv)
2881 return sv_2pvutf8(sv, &n_a);
2885 Perl_sv_2pvutf8(pTHX_ register SV *sv, STRLEN *lp)
2887 sv_utf8_upgrade(sv);
2888 return SvPV(sv,*lp);
2891 /* This function is only called on magical items */
2893 Perl_sv_2bool(pTHX_ register SV *sv)
2902 if (SvAMAGIC(sv) && (tmpsv=AMG_CALLun(sv,bool_)) &&
2903 (SvRV(tmpsv) != SvRV(sv)))
2904 return SvTRUE(tmpsv);
2905 return SvRV(sv) != 0;
2908 register XPV* Xpvtmp;
2909 if ((Xpvtmp = (XPV*)SvANY(sv)) &&
2910 (*Xpvtmp->xpv_pv > '0' ||
2911 Xpvtmp->xpv_cur > 1 ||
2912 (Xpvtmp->xpv_cur && *Xpvtmp->xpv_pv != '0')))
2919 return SvIVX(sv) != 0;
2922 return SvNVX(sv) != 0.0;
2930 =for apidoc sv_utf8_upgrade
2932 Convert the PV of an SV to its UTF8-encoded form.
2938 Perl_sv_utf8_upgrade(pTHX_ register SV *sv)
2943 if (!sv || !SvPOK(sv) || SvUTF8(sv))
2946 /* This function could be much more efficient if we had a FLAG in SVs
2947 * to signal if there are any hibit chars in the PV.
2948 * Given that there isn't make loop fast as possible
2954 if ((hibit = UTF8_IS_CONTINUED(*t++)))
2960 if (SvREADONLY(sv) && SvFAKE(sv)) {
2961 sv_force_normal(sv);
2964 len = SvCUR(sv) + 1; /* Plus the \0 */
2965 SvPVX(sv) = (char*)bytes_to_utf8((U8*)s, &len);
2966 SvCUR(sv) = len - 1;
2968 Safefree(s); /* No longer using what was there before. */
2969 SvLEN(sv) = len; /* No longer know the real size. */
2975 =for apidoc sv_utf8_downgrade
2977 Attempt to convert the PV of an SV from UTF8-encoded to byte encoding.
2978 This may not be possible if the PV contains non-byte encoding characters;
2979 if this is the case, either returns false or, if C<fail_ok> is not
2986 Perl_sv_utf8_downgrade(pTHX_ register SV* sv, bool fail_ok)
2988 if (SvPOK(sv) && SvUTF8(sv)) {
2990 char *c = SvPVX(sv);
2991 STRLEN len = SvCUR(sv);
2993 if (!utf8_to_bytes((U8*)c, &len)) {
2998 Perl_croak(aTHX_ "Wide character in %s",
2999 PL_op_desc[PL_op->op_type]);
3001 Perl_croak(aTHX_ "Wide character");
3013 =for apidoc sv_utf8_encode
3015 Convert the PV of an SV to UTF8-encoded, but then turn off the C<SvUTF8>
3016 flag so that it looks like bytes again. Nothing calls this.
3022 Perl_sv_utf8_encode(pTHX_ register SV *sv)
3024 sv_utf8_upgrade(sv);
3029 Perl_sv_utf8_decode(pTHX_ register SV *sv)
3034 bool has_utf = FALSE;
3035 if (!sv_utf8_downgrade(sv, TRUE))
3038 /* it is actually just a matter of turning the utf8 flag on, but
3039 * we want to make sure everything inside is valid utf8 first.
3042 if (!is_utf8_string((U8*)c, SvCUR(sv)+1))
3046 if (UTF8_IS_CONTINUED(*c++)) {
3056 /* Note: sv_setsv() should not be called with a source string that needs
3057 * to be reused, since it may destroy the source string if it is marked
3062 =for apidoc sv_setsv
3064 Copies the contents of the source SV C<ssv> into the destination SV C<dsv>.
3065 The source SV may be destroyed if it is mortal. Does not handle 'set'
3066 magic. See the macro forms C<SvSetSV>, C<SvSetSV_nosteal> and
3073 Perl_sv_setsv(pTHX_ SV *dstr, register SV *sstr)
3075 register U32 sflags;
3081 SV_CHECK_THINKFIRST(dstr);
3083 sstr = &PL_sv_undef;
3084 stype = SvTYPE(sstr);
3085 dtype = SvTYPE(dstr);
3089 /* There's a lot of redundancy below but we're going for speed here */
3094 if (dtype != SVt_PVGV) {
3095 (void)SvOK_off(dstr);
3103 sv_upgrade(dstr, SVt_IV);
3106 sv_upgrade(dstr, SVt_PVNV);
3110 sv_upgrade(dstr, SVt_PVIV);
3113 (void)SvIOK_only(dstr);
3114 SvIVX(dstr) = SvIVX(sstr);
3117 if (SvTAINTED(sstr))
3128 sv_upgrade(dstr, SVt_NV);
3133 sv_upgrade(dstr, SVt_PVNV);
3136 SvNVX(dstr) = SvNVX(sstr);
3137 (void)SvNOK_only(dstr);
3138 if (SvTAINTED(sstr))
3146 sv_upgrade(dstr, SVt_RV);
3147 else if (dtype == SVt_PVGV &&
3148 SvTYPE(SvRV(sstr)) == SVt_PVGV) {
3151 if (GvIMPORTED(dstr) != GVf_IMPORTED
3152 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3154 GvIMPORTED_on(dstr);
3165 sv_upgrade(dstr, SVt_PV);
3168 if (dtype < SVt_PVIV)
3169 sv_upgrade(dstr, SVt_PVIV);
3172 if (dtype < SVt_PVNV)
3173 sv_upgrade(dstr, SVt_PVNV);
3180 Perl_croak(aTHX_ "Bizarre copy of %s in %s", sv_reftype(sstr, 0),
3181 PL_op_name[PL_op->op_type]);
3183 Perl_croak(aTHX_ "Bizarre copy of %s", sv_reftype(sstr, 0));
3187 if (dtype <= SVt_PVGV) {
3189 if (dtype != SVt_PVGV) {
3190 char *name = GvNAME(sstr);
3191 STRLEN len = GvNAMELEN(sstr);
3192 sv_upgrade(dstr, SVt_PVGV);
3193 sv_magic(dstr, dstr, '*', Nullch, 0);
3194 GvSTASH(dstr) = (HV*)SvREFCNT_inc(GvSTASH(sstr));
3195 GvNAME(dstr) = savepvn(name, len);
3196 GvNAMELEN(dstr) = len;
3197 SvFAKE_on(dstr); /* can coerce to non-glob */
3199 /* ahem, death to those who redefine active sort subs */
3200 else if (PL_curstackinfo->si_type == PERLSI_SORT
3201 && GvCV(dstr) && PL_sortcop == CvSTART(GvCV(dstr)))
3202 Perl_croak(aTHX_ "Can't redefine active sort subroutine %s",
3204 (void)SvOK_off(dstr);
3205 GvINTRO_off(dstr); /* one-shot flag */
3207 GvGP(dstr) = gp_ref(GvGP(sstr));
3208 if (SvTAINTED(sstr))
3210 if (GvIMPORTED(dstr) != GVf_IMPORTED
3211 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3213 GvIMPORTED_on(dstr);
3221 if (SvGMAGICAL(sstr)) {
3223 if (SvTYPE(sstr) != stype) {
3224 stype = SvTYPE(sstr);
3225 if (stype == SVt_PVGV && dtype <= SVt_PVGV)
3229 if (stype == SVt_PVLV)
3230 (void)SvUPGRADE(dstr, SVt_PVNV);
3232 (void)SvUPGRADE(dstr, stype);
3235 sflags = SvFLAGS(sstr);
3237 if (sflags & SVf_ROK) {
3238 if (dtype >= SVt_PV) {
3239 if (dtype == SVt_PVGV) {
3240 SV *sref = SvREFCNT_inc(SvRV(sstr));
3242 int intro = GvINTRO(dstr);
3247 GvINTRO_off(dstr); /* one-shot flag */
3248 Newz(602,gp, 1, GP);
3249 GvGP(dstr) = gp_ref(gp);
3250 GvSV(dstr) = NEWSV(72,0);
3251 GvLINE(dstr) = CopLINE(PL_curcop);
3252 GvEGV(dstr) = (GV*)dstr;
3255 switch (SvTYPE(sref)) {
3258 SAVESPTR(GvAV(dstr));
3260 dref = (SV*)GvAV(dstr);
3261 GvAV(dstr) = (AV*)sref;
3262 if (!GvIMPORTED_AV(dstr)
3263 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3265 GvIMPORTED_AV_on(dstr);
3270 SAVESPTR(GvHV(dstr));
3272 dref = (SV*)GvHV(dstr);
3273 GvHV(dstr) = (HV*)sref;
3274 if (!GvIMPORTED_HV(dstr)
3275 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3277 GvIMPORTED_HV_on(dstr);
3282 if (GvCVGEN(dstr) && GvCV(dstr) != (CV*)sref) {
3283 SvREFCNT_dec(GvCV(dstr));
3284 GvCV(dstr) = Nullcv;
3285 GvCVGEN(dstr) = 0; /* Switch off cacheness. */
3286 PL_sub_generation++;
3288 SAVESPTR(GvCV(dstr));
3291 dref = (SV*)GvCV(dstr);
3292 if (GvCV(dstr) != (CV*)sref) {
3293 CV* cv = GvCV(dstr);
3295 if (!GvCVGEN((GV*)dstr) &&
3296 (CvROOT(cv) || CvXSUB(cv)))
3299 /* ahem, death to those who redefine
3300 * active sort subs */
3301 if (PL_curstackinfo->si_type == PERLSI_SORT &&
3302 PL_sortcop == CvSTART(cv))
3304 "Can't redefine active sort subroutine %s",
3305 GvENAME((GV*)dstr));
3306 /* Redefining a sub - warning is mandatory if
3307 it was a const and its value changed. */
3308 if (ckWARN(WARN_REDEFINE)
3310 && (!CvCONST((CV*)sref)
3311 || sv_cmp(cv_const_sv(cv),
3312 cv_const_sv((CV*)sref)))))
3314 Perl_warner(aTHX_ WARN_REDEFINE,
3316 ? "Constant subroutine %s redefined"
3317 : "Subroutine %s redefined",
3318 GvENAME((GV*)dstr));
3321 cv_ckproto(cv, (GV*)dstr,
3322 SvPOK(sref) ? SvPVX(sref) : Nullch);
3324 GvCV(dstr) = (CV*)sref;
3325 GvCVGEN(dstr) = 0; /* Switch off cacheness. */
3326 GvASSUMECV_on(dstr);
3327 PL_sub_generation++;
3329 if (!GvIMPORTED_CV(dstr)
3330 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3332 GvIMPORTED_CV_on(dstr);
3337 SAVESPTR(GvIOp(dstr));
3339 dref = (SV*)GvIOp(dstr);
3340 GvIOp(dstr) = (IO*)sref;
3344 SAVESPTR(GvFORM(dstr));
3346 dref = (SV*)GvFORM(dstr);
3347 GvFORM(dstr) = (CV*)sref;
3351 SAVESPTR(GvSV(dstr));
3353 dref = (SV*)GvSV(dstr);
3355 if (!GvIMPORTED_SV(dstr)
3356 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3358 GvIMPORTED_SV_on(dstr);
3366 if (SvTAINTED(sstr))
3371 (void)SvOOK_off(dstr); /* backoff */
3373 Safefree(SvPVX(dstr));
3374 SvLEN(dstr)=SvCUR(dstr)=0;
3377 (void)SvOK_off(dstr);
3378 SvRV(dstr) = SvREFCNT_inc(SvRV(sstr));
3380 if (sflags & SVp_NOK) {
3382 /* Only set the public OK flag if the source has public OK. */
3383 if (sflags & SVf_NOK)
3384 SvFLAGS(dstr) |= SVf_NOK;
3385 SvNVX(dstr) = SvNVX(sstr);
3387 if (sflags & SVp_IOK) {
3388 (void)SvIOKp_on(dstr);
3389 if (sflags & SVf_IOK)
3390 SvFLAGS(dstr) |= SVf_IOK;
3391 if (sflags & SVf_IVisUV)
3393 SvIVX(dstr) = SvIVX(sstr);
3395 if (SvAMAGIC(sstr)) {
3399 else if (sflags & SVp_POK) {
3402 * Check to see if we can just swipe the string. If so, it's a
3403 * possible small lose on short strings, but a big win on long ones.
3404 * It might even be a win on short strings if SvPVX(dstr)
3405 * has to be allocated and SvPVX(sstr) has to be freed.
3408 if (SvTEMP(sstr) && /* slated for free anyway? */
3409 SvREFCNT(sstr) == 1 && /* and no other references to it? */
3410 !(sflags & SVf_OOK) && /* and not involved in OOK hack? */
3411 SvLEN(sstr) && /* and really is a string */
3412 !(PL_op && PL_op->op_type == OP_AASSIGN)) /* and won't be needed again, potentially */
3414 if (SvPVX(dstr)) { /* we know that dtype >= SVt_PV */
3416 SvFLAGS(dstr) &= ~SVf_OOK;
3417 Safefree(SvPVX(dstr) - SvIVX(dstr));
3419 else if (SvLEN(dstr))
3420 Safefree(SvPVX(dstr));
3422 (void)SvPOK_only(dstr);
3423 SvPV_set(dstr, SvPVX(sstr));
3424 SvLEN_set(dstr, SvLEN(sstr));
3425 SvCUR_set(dstr, SvCUR(sstr));
3428 (void)SvOK_off(sstr); /* NOTE: nukes most SvFLAGS on sstr */
3429 SvPV_set(sstr, Nullch);
3434 else { /* have to copy actual string */
3435 STRLEN len = SvCUR(sstr);
3437 SvGROW(dstr, len + 1); /* inlined from sv_setpvn */
3438 Move(SvPVX(sstr),SvPVX(dstr),len,char);
3439 SvCUR_set(dstr, len);
3440 *SvEND(dstr) = '\0';
3441 (void)SvPOK_only(dstr);
3443 if (sflags & SVf_UTF8)
3446 if (sflags & SVp_NOK) {
3448 if (sflags & SVf_NOK)
3449 SvFLAGS(dstr) |= SVf_NOK;
3450 SvNVX(dstr) = SvNVX(sstr);
3452 if (sflags & SVp_IOK) {
3453 (void)SvIOKp_on(dstr);
3454 if (sflags & SVf_IOK)
3455 SvFLAGS(dstr) |= SVf_IOK;
3456 if (sflags & SVf_IVisUV)
3458 SvIVX(dstr) = SvIVX(sstr);
3461 else if (sflags & SVp_IOK) {
3462 if (sflags & SVf_IOK)
3463 (void)SvIOK_only(dstr);
3468 /* XXXX Do we want to set IsUV for IV(ROK)? Be extra safe... */
3469 if (sflags & SVf_IVisUV)
3471 SvIVX(dstr) = SvIVX(sstr);
3472 if (sflags & SVp_NOK) {
3473 if (sflags & SVf_NOK)
3474 (void)SvNOK_on(dstr);
3476 (void)SvNOKp_on(dstr);
3477 SvNVX(dstr) = SvNVX(sstr);
3480 else if (sflags & SVp_NOK) {
3481 if (sflags & SVf_NOK)
3482 (void)SvNOK_only(dstr);
3487 SvNVX(dstr) = SvNVX(sstr);
3490 if (dtype == SVt_PVGV) {
3491 if (ckWARN(WARN_MISC))
3492 Perl_warner(aTHX_ WARN_MISC, "Undefined value assigned to typeglob");
3495 (void)SvOK_off(dstr);
3497 if (SvTAINTED(sstr))
3502 =for apidoc sv_setsv_mg
3504 Like C<sv_setsv>, but also handles 'set' magic.
3510 Perl_sv_setsv_mg(pTHX_ SV *dstr, register SV *sstr)
3512 sv_setsv(dstr,sstr);
3517 =for apidoc sv_setpvn
3519 Copies a string into an SV. The C<len> parameter indicates the number of
3520 bytes to be copied. Does not handle 'set' magic. See C<sv_setpvn_mg>.
3526 Perl_sv_setpvn(pTHX_ register SV *sv, register const char *ptr, register STRLEN len)
3528 register char *dptr;
3530 /* len is STRLEN which is unsigned, need to copy to signed */
3534 SV_CHECK_THINKFIRST(sv);
3539 (void)SvUPGRADE(sv, SVt_PV);
3541 SvGROW(sv, len + 1);
3543 Move(ptr,dptr,len,char);
3546 (void)SvPOK_only_UTF8(sv); /* validate pointer */
3551 =for apidoc sv_setpvn_mg
3553 Like C<sv_setpvn>, but also handles 'set' magic.
3559 Perl_sv_setpvn_mg(pTHX_ register SV *sv, register const char *ptr, register STRLEN len)
3561 sv_setpvn(sv,ptr,len);
3566 =for apidoc sv_setpv
3568 Copies a string into an SV. The string must be null-terminated. Does not
3569 handle 'set' magic. See C<sv_setpv_mg>.
3575 Perl_sv_setpv(pTHX_ register SV *sv, register const char *ptr)
3577 register STRLEN len;
3579 SV_CHECK_THINKFIRST(sv);
3585 (void)SvUPGRADE(sv, SVt_PV);
3587 SvGROW(sv, len + 1);
3588 Move(ptr,SvPVX(sv),len+1,char);
3590 (void)SvPOK_only_UTF8(sv); /* validate pointer */
3595 =for apidoc sv_setpv_mg
3597 Like C<sv_setpv>, but also handles 'set' magic.
3603 Perl_sv_setpv_mg(pTHX_ register SV *sv, register const char *ptr)
3610 =for apidoc sv_usepvn
3612 Tells an SV to use C<ptr> to find its string value. Normally the string is
3613 stored inside the SV but sv_usepvn allows the SV to use an outside string.
3614 The C<ptr> should point to memory that was allocated by C<malloc>. The
3615 string length, C<len>, must be supplied. This function will realloc the
3616 memory pointed to by C<ptr>, so that pointer should not be freed or used by
3617 the programmer after giving it to sv_usepvn. Does not handle 'set' magic.
3618 See C<sv_usepvn_mg>.
3624 Perl_sv_usepvn(pTHX_ register SV *sv, register char *ptr, register STRLEN len)
3626 SV_CHECK_THINKFIRST(sv);
3627 (void)SvUPGRADE(sv, SVt_PV);
3632 (void)SvOOK_off(sv);
3633 if (SvPVX(sv) && SvLEN(sv))
3634 Safefree(SvPVX(sv));
3635 Renew(ptr, len+1, char);
3638 SvLEN_set(sv, len+1);
3640 (void)SvPOK_only_UTF8(sv); /* validate pointer */
3645 =for apidoc sv_usepvn_mg
3647 Like C<sv_usepvn>, but also handles 'set' magic.
3653 Perl_sv_usepvn_mg(pTHX_ register SV *sv, register char *ptr, register STRLEN len)
3655 sv_usepvn(sv,ptr,len);
3660 Perl_sv_force_normal_flags(pTHX_ register SV *sv, U32 flags)
3662 if (SvREADONLY(sv)) {
3664 char *pvx = SvPVX(sv);
3665 STRLEN len = SvCUR(sv);
3666 U32 hash = SvUVX(sv);
3667 SvGROW(sv, len + 1);
3668 Move(pvx,SvPVX(sv),len,char);
3672 unsharepvn(pvx,SvUTF8(sv)?-len:len,hash);
3674 else if (PL_curcop != &PL_compiling)
3675 Perl_croak(aTHX_ PL_no_modify);
3678 sv_unref_flags(sv, flags);
3679 else if (SvFAKE(sv) && SvTYPE(sv) == SVt_PVGV)
3684 Perl_sv_force_normal(pTHX_ register SV *sv)
3686 sv_force_normal_flags(sv, 0);
3692 Efficient removal of characters from the beginning of the string buffer.
3693 SvPOK(sv) must be true and the C<ptr> must be a pointer to somewhere inside
3694 the string buffer. The C<ptr> becomes the first character of the adjusted
3701 Perl_sv_chop(pTHX_ register SV *sv, register char *ptr) /* like set but assuming ptr is in sv */
3705 register STRLEN delta;
3707 if (!ptr || !SvPOKp(sv))
3709 SV_CHECK_THINKFIRST(sv);
3710 if (SvTYPE(sv) < SVt_PVIV)
3711 sv_upgrade(sv,SVt_PVIV);
3714 if (!SvLEN(sv)) { /* make copy of shared string */
3715 char *pvx = SvPVX(sv);
3716 STRLEN len = SvCUR(sv);
3717 SvGROW(sv, len + 1);
3718 Move(pvx,SvPVX(sv),len,char);
3722 SvFLAGS(sv) |= SVf_OOK;
3724 SvFLAGS(sv) &= ~(SVf_IOK|SVf_NOK|SVp_IOK|SVp_NOK|SVf_IVisUV);
3725 delta = ptr - SvPVX(sv);
3733 =for apidoc sv_catpvn
3735 Concatenates the string onto the end of the string which is in the SV. The
3736 C<len> indicates number of bytes to copy. Handles 'get' magic, but not
3737 'set' magic. See C<sv_catpvn_mg>.
3743 Perl_sv_catpvn(pTHX_ register SV *sv, register const char *ptr, register STRLEN len)
3748 junk = SvPV_force(sv, tlen);
3749 SvGROW(sv, tlen + len + 1);
3752 Move(ptr,SvPVX(sv)+tlen,len,char);
3755 (void)SvPOK_only_UTF8(sv); /* validate pointer */
3760 =for apidoc sv_catpvn_mg
3762 Like C<sv_catpvn>, but also handles 'set' magic.
3768 Perl_sv_catpvn_mg(pTHX_ register SV *sv, register const char *ptr, register STRLEN len)
3770 sv_catpvn(sv,ptr,len);
3775 =for apidoc sv_catsv
3777 Concatenates the string from SV C<ssv> onto the end of the string in
3778 SV C<dsv>. Modifies C<dsv> but not C<ssv>. Handles 'get' magic, but
3779 not 'set' magic. See C<sv_catsv_mg>.
3784 Perl_sv_catsv(pTHX_ SV *dsv, register SV *ssv)
3790 if ((spv = SvPV(ssv, slen))) {
3791 bool dutf8 = DO_UTF8(dsv);
3792 bool sutf8 = DO_UTF8(ssv);
3795 sv_catpvn(dsv,spv,slen);
3798 /* Not modifying source SV, so taking a temporary copy. */
3799 SV* csv = sv_2mortal(newSVsv(ssv));
3803 sv_utf8_upgrade(csv);
3804 cpv = SvPV(csv,clen);
3805 sv_catpvn(dsv,cpv,clen);
3808 sv_utf8_upgrade(dsv);
3809 sv_catpvn(dsv,spv,slen);
3810 SvUTF8_on(dsv); /* If dsv has no wide characters. */
3817 =for apidoc sv_catsv_mg
3819 Like C<sv_catsv>, but also handles 'set' magic.
3825 Perl_sv_catsv_mg(pTHX_ SV *dsv, register SV *ssv)
3832 =for apidoc sv_catpv
3834 Concatenates the string onto the end of the string which is in the SV.
3835 Handles 'get' magic, but not 'set' magic. See C<sv_catpv_mg>.
3841 Perl_sv_catpv(pTHX_ register SV *sv, register const char *ptr)
3843 register STRLEN len;
3849 junk = SvPV_force(sv, tlen);
3851 SvGROW(sv, tlen + len + 1);
3854 Move(ptr,SvPVX(sv)+tlen,len+1,char);
3856 (void)SvPOK_only_UTF8(sv); /* validate pointer */
3861 =for apidoc sv_catpv_mg
3863 Like C<sv_catpv>, but also handles 'set' magic.
3869 Perl_sv_catpv_mg(pTHX_ register SV *sv, register const char *ptr)
3876 Perl_newSV(pTHX_ STRLEN len)
3882 sv_upgrade(sv, SVt_PV);
3883 SvGROW(sv, len + 1);
3888 /* name is assumed to contain an SV* if (name && namelen == HEf_SVKEY) */
3891 =for apidoc sv_magic
3893 Adds magic to an SV.
3899 Perl_sv_magic(pTHX_ register SV *sv, SV *obj, int how, const char *name, I32 namlen)
3903 if (SvREADONLY(sv)) {
3904 if (PL_curcop != &PL_compiling && !strchr("gBf", how))
3905 Perl_croak(aTHX_ PL_no_modify);
3907 if (SvMAGICAL(sv) || (how == 't' && SvTYPE(sv) >= SVt_PVMG)) {
3908 if (SvMAGIC(sv) && (mg = mg_find(sv, how))) {
3915 (void)SvUPGRADE(sv, SVt_PVMG);
3917 Newz(702,mg, 1, MAGIC);
3918 mg->mg_moremagic = SvMAGIC(sv);
3921 if (!obj || obj == sv || how == '#' || how == 'r')
3924 mg->mg_obj = SvREFCNT_inc(obj);
3925 mg->mg_flags |= MGf_REFCOUNTED;
3928 mg->mg_len = namlen;
3931 mg->mg_ptr = savepvn(name, namlen);
3932 else if (namlen == HEf_SVKEY)
3933 mg->mg_ptr = (char*)SvREFCNT_inc((SV*)name);
3937 mg->mg_virtual = &PL_vtbl_sv;
3940 mg->mg_virtual = &PL_vtbl_amagic;
3943 mg->mg_virtual = &PL_vtbl_amagicelem;
3946 mg->mg_virtual = &PL_vtbl_ovrld;
3949 mg->mg_virtual = &PL_vtbl_bm;
3952 mg->mg_virtual = &PL_vtbl_regdata;
3955 mg->mg_virtual = &PL_vtbl_regdatum;
3958 mg->mg_virtual = &PL_vtbl_env;
3961 mg->mg_virtual = &PL_vtbl_fm;
3964 mg->mg_virtual = &PL_vtbl_envelem;
3967 mg->mg_virtual = &PL_vtbl_mglob;
3970 mg->mg_virtual = &PL_vtbl_isa;
3973 mg->mg_virtual = &PL_vtbl_isaelem;
3976 mg->mg_virtual = &PL_vtbl_nkeys;
3983 mg->mg_virtual = &PL_vtbl_dbline;
3987 mg->mg_virtual = &PL_vtbl_mutex;
3989 #endif /* USE_THREADS */
3990 #ifdef USE_LOCALE_COLLATE
3992 mg->mg_virtual = &PL_vtbl_collxfrm;
3994 #endif /* USE_LOCALE_COLLATE */
3996 mg->mg_virtual = &PL_vtbl_pack;
4000 mg->mg_virtual = &PL_vtbl_packelem;
4003 mg->mg_virtual = &PL_vtbl_regexp;
4006 mg->mg_virtual = &PL_vtbl_sig;
4009 mg->mg_virtual = &PL_vtbl_sigelem;
4012 mg->mg_virtual = &PL_vtbl_taint;
4016 mg->mg_virtual = &PL_vtbl_uvar;
4019 mg->mg_virtual = &PL_vtbl_vec;
4022 mg->mg_virtual = &PL_vtbl_substr;
4025 mg->mg_virtual = &PL_vtbl_defelem;
4028 mg->mg_virtual = &PL_vtbl_glob;
4031 mg->mg_virtual = &PL_vtbl_arylen;
4034 mg->mg_virtual = &PL_vtbl_pos;
4037 mg->mg_virtual = &PL_vtbl_backref;
4039 case '~': /* Reserved for use by extensions not perl internals. */
4040 /* Useful for attaching extension internal data to perl vars. */
4041 /* Note that multiple extensions may clash if magical scalars */
4042 /* etc holding private data from one are passed to another. */
4046 Perl_croak(aTHX_ "Don't know how to handle magic of type '%c'", how);
4050 SvFLAGS(sv) &= ~(SVf_IOK|SVf_NOK|SVf_POK);
4054 =for apidoc sv_unmagic
4056 Removes magic from an SV.
4062 Perl_sv_unmagic(pTHX_ SV *sv, int type)
4066 if (SvTYPE(sv) < SVt_PVMG || !SvMAGIC(sv))
4069 for (mg = *mgp; mg; mg = *mgp) {
4070 if (mg->mg_type == type) {
4071 MGVTBL* vtbl = mg->mg_virtual;
4072 *mgp = mg->mg_moremagic;
4073 if (vtbl && vtbl->svt_free)
4074 CALL_FPTR(vtbl->svt_free)(aTHX_ sv, mg);
4075 if (mg->mg_ptr && mg->mg_type != 'g')
4076 if (mg->mg_len >= 0)
4077 Safefree(mg->mg_ptr);
4078 else if (mg->mg_len == HEf_SVKEY)
4079 SvREFCNT_dec((SV*)mg->mg_ptr);
4080 if (mg->mg_flags & MGf_REFCOUNTED)
4081 SvREFCNT_dec(mg->mg_obj);
4085 mgp = &mg->mg_moremagic;
4089 SvFLAGS(sv) |= (SvFLAGS(sv) & (SVp_IOK|SVp_NOK|SVp_POK)) >> PRIVSHIFT;
4096 =for apidoc sv_rvweaken
4104 Perl_sv_rvweaken(pTHX_ SV *sv)
4107 if (!SvOK(sv)) /* let undefs pass */
4110 Perl_croak(aTHX_ "Can't weaken a nonreference");
4111 else if (SvWEAKREF(sv)) {
4112 if (ckWARN(WARN_MISC))
4113 Perl_warner(aTHX_ WARN_MISC, "Reference is already weak");
4117 sv_add_backref(tsv, sv);
4124 S_sv_add_backref(pTHX_ SV *tsv, SV *sv)
4128 if (SvMAGICAL(tsv) && (mg = mg_find(tsv, '<')))
4129 av = (AV*)mg->mg_obj;
4132 sv_magic(tsv, (SV*)av, '<', NULL, 0);
4133 SvREFCNT_dec(av); /* for sv_magic */
4139 S_sv_del_backref(pTHX_ SV *sv)
4146 if (!SvMAGICAL(tsv) || !(mg = mg_find(tsv, '<')))
4147 Perl_croak(aTHX_ "panic: del_backref");
4148 av = (AV *)mg->mg_obj;
4153 svp[i] = &PL_sv_undef; /* XXX */
4160 =for apidoc sv_insert
4162 Inserts a string at the specified offset/length within the SV. Similar to
4163 the Perl substr() function.
4169 Perl_sv_insert(pTHX_ SV *bigstr, STRLEN offset, STRLEN len, char *little, STRLEN littlelen)
4173 register char *midend;
4174 register char *bigend;
4180 Perl_croak(aTHX_ "Can't modify non-existent substring");
4181 SvPV_force(bigstr, curlen);
4182 (void)SvPOK_only_UTF8(bigstr);
4183 if (offset + len > curlen) {
4184 SvGROW(bigstr, offset+len+1);
4185 Zero(SvPVX(bigstr)+curlen, offset+len-curlen, char);
4186 SvCUR_set(bigstr, offset+len);
4190 i = littlelen - len;
4191 if (i > 0) { /* string might grow */
4192 big = SvGROW(bigstr, SvCUR(bigstr) + i + 1);
4193 mid = big + offset + len;
4194 midend = bigend = big + SvCUR(bigstr);
4197 while (midend > mid) /* shove everything down */
4198 *--bigend = *--midend;
4199 Move(little,big+offset,littlelen,char);
4205 Move(little,SvPVX(bigstr)+offset,len,char);
4210 big = SvPVX(bigstr);
4213 bigend = big + SvCUR(bigstr);
4215 if (midend > bigend)
4216 Perl_croak(aTHX_ "panic: sv_insert");
4218 if (mid - big > bigend - midend) { /* faster to shorten from end */
4220 Move(little, mid, littlelen,char);
4223 i = bigend - midend;
4225 Move(midend, mid, i,char);
4229 SvCUR_set(bigstr, mid - big);
4232 else if ((i = mid - big)) { /* faster from front */
4233 midend -= littlelen;
4235 sv_chop(bigstr,midend-i);
4240 Move(little, mid, littlelen,char);
4242 else if (littlelen) {
4243 midend -= littlelen;
4244 sv_chop(bigstr,midend);
4245 Move(little,midend,littlelen,char);
4248 sv_chop(bigstr,midend);
4254 =for apidoc sv_replace
4256 Make the first argument a copy of the second, then delete the original.
4262 Perl_sv_replace(pTHX_ register SV *sv, register SV *nsv)
4264 U32 refcnt = SvREFCNT(sv);
4265 SV_CHECK_THINKFIRST(sv);
4266 if (SvREFCNT(nsv) != 1 && ckWARN_d(WARN_INTERNAL))
4267 Perl_warner(aTHX_ WARN_INTERNAL, "Reference miscount in sv_replace()");
4268 if (SvMAGICAL(sv)) {
4272 sv_upgrade(nsv, SVt_PVMG);
4273 SvMAGIC(nsv) = SvMAGIC(sv);
4274 SvFLAGS(nsv) |= SvMAGICAL(sv);
4280 assert(!SvREFCNT(sv));
4281 StructCopy(nsv,sv,SV);
4282 SvREFCNT(sv) = refcnt;
4283 SvFLAGS(nsv) |= SVTYPEMASK; /* Mark as freed */
4288 =for apidoc sv_clear
4290 Clear an SV, making it empty. Does not free the memory used by the SV
4297 Perl_sv_clear(pTHX_ register SV *sv)
4301 assert(SvREFCNT(sv) == 0);
4304 if (PL_defstash) { /* Still have a symbol table? */
4309 Zero(&tmpref, 1, SV);
4310 sv_upgrade(&tmpref, SVt_RV);
4312 SvREADONLY_on(&tmpref); /* DESTROY() could be naughty */
4313 SvREFCNT(&tmpref) = 1;
4316 stash = SvSTASH(sv);
4317 destructor = StashHANDLER(stash,DESTROY);
4320 PUSHSTACKi(PERLSI_DESTROY);
4321 SvRV(&tmpref) = SvREFCNT_inc(sv);
4326 call_sv((SV*)destructor, G_DISCARD|G_EVAL|G_KEEPERR);
4332 } while (SvOBJECT(sv) && SvSTASH(sv) != stash);
4334 del_XRV(SvANY(&tmpref));
4337 if (PL_in_clean_objs)
4338 Perl_croak(aTHX_ "DESTROY created new reference to dead object '%s'",
4340 /* DESTROY gave object new lease on life */
4346 SvREFCNT_dec(SvSTASH(sv)); /* possibly of changed persuasion */
4347 SvOBJECT_off(sv); /* Curse the object. */
4348 if (SvTYPE(sv) != SVt_PVIO)
4349 --PL_sv_objcount; /* XXX Might want something more general */
4352 if (SvTYPE(sv) >= SVt_PVMG && SvMAGIC(sv))
4355 switch (SvTYPE(sv)) {
4358 IoIFP(sv) != PerlIO_stdin() &&
4359 IoIFP(sv) != PerlIO_stdout() &&
4360 IoIFP(sv) != PerlIO_stderr())
4362 io_close((IO*)sv, FALSE);
4364 if (IoDIRP(sv) && !(IoFLAGS(sv) & IOf_FAKE_DIRP))
4365 PerlDir_close(IoDIRP(sv));
4366 IoDIRP(sv) = (DIR*)NULL;
4367 Safefree(IoTOP_NAME(sv));
4368 Safefree(IoFMT_NAME(sv));
4369 Safefree(IoBOTTOM_NAME(sv));
4384 SvREFCNT_dec(LvTARG(sv));
4388 Safefree(GvNAME(sv));
4389 /* cannot decrease stash refcount yet, as we might recursively delete
4390 ourselves when the refcnt drops to zero. Delay SvREFCNT_dec
4391 of stash until current sv is completely gone.
4392 -- JohnPC, 27 Mar 1998 */
4393 stash = GvSTASH(sv);
4399 (void)SvOOK_off(sv);
4407 SvREFCNT_dec(SvRV(sv));
4409 else if (SvPVX(sv) && SvLEN(sv))
4410 Safefree(SvPVX(sv));
4411 else if (SvPVX(sv) && SvREADONLY(sv) && SvFAKE(sv)) {
4412 unsharepvn(SvPVX(sv),SvUTF8(sv)?-SvCUR(sv):SvCUR(sv),SvUVX(sv));
4424 switch (SvTYPE(sv)) {
4440 del_XPVIV(SvANY(sv));
4443 del_XPVNV(SvANY(sv));
4446 del_XPVMG(SvANY(sv));
4449 del_XPVLV(SvANY(sv));
4452 del_XPVAV(SvANY(sv));
4455 del_XPVHV(SvANY(sv));
4458 del_XPVCV(SvANY(sv));
4461 del_XPVGV(SvANY(sv));
4462 /* code duplication for increased performance. */
4463 SvFLAGS(sv) &= SVf_BREAK;
4464 SvFLAGS(sv) |= SVTYPEMASK;
4465 /* decrease refcount of the stash that owns this GV, if any */
4467 SvREFCNT_dec(stash);
4468 return; /* not break, SvFLAGS reset already happened */
4470 del_XPVBM(SvANY(sv));
4473 del_XPVFM(SvANY(sv));
4476 del_XPVIO(SvANY(sv));
4479 SvFLAGS(sv) &= SVf_BREAK;
4480 SvFLAGS(sv) |= SVTYPEMASK;
4484 Perl_sv_newref(pTHX_ SV *sv)
4487 ATOMIC_INC(SvREFCNT(sv));
4494 Free the memory used by an SV.
4500 Perl_sv_free(pTHX_ SV *sv)
4502 int refcount_is_zero;
4506 if (SvREFCNT(sv) == 0) {
4507 if (SvFLAGS(sv) & SVf_BREAK)
4509 if (PL_in_clean_all) /* All is fair */
4511 if (SvREADONLY(sv) && SvIMMORTAL(sv)) {
4512 /* make sure SvREFCNT(sv)==0 happens very seldom */
4513 SvREFCNT(sv) = (~(U32)0)/2;
4516 if (ckWARN_d(WARN_INTERNAL))
4517 Perl_warner(aTHX_ WARN_INTERNAL, "Attempt to free unreferenced scalar");
4520 ATOMIC_DEC_AND_TEST(refcount_is_zero, SvREFCNT(sv));
4521 if (!refcount_is_zero)
4525 if (ckWARN_d(WARN_DEBUGGING))
4526 Perl_warner(aTHX_ WARN_DEBUGGING,
4527 "Attempt to free temp prematurely: SV 0x%"UVxf,
4532 if (SvREADONLY(sv) && SvIMMORTAL(sv)) {
4533 /* make sure SvREFCNT(sv)==0 happens very seldom */
4534 SvREFCNT(sv) = (~(U32)0)/2;
4545 Returns the length of the string in the SV. See also C<SvCUR>.
4551 Perl_sv_len(pTHX_ register SV *sv)
4560 len = mg_length(sv);
4562 junk = SvPV(sv, len);
4567 =for apidoc sv_len_utf8
4569 Returns the number of characters in the string in an SV, counting wide
4570 UTF8 bytes as a single character.
4576 Perl_sv_len_utf8(pTHX_ register SV *sv)
4582 return mg_length(sv);
4586 U8 *s = (U8*)SvPV(sv, len);
4588 return Perl_utf8_length(aTHX_ s, s + len);
4593 Perl_sv_pos_u2b(pTHX_ register SV *sv, I32* offsetp, I32* lenp)
4598 I32 uoffset = *offsetp;
4604 start = s = (U8*)SvPV(sv, len);
4606 while (s < send && uoffset--)
4610 *offsetp = s - start;
4614 while (s < send && ulen--)
4624 Perl_sv_pos_b2u(pTHX_ register SV *sv, I32* offsetp)
4633 s = (U8*)SvPV(sv, len);
4635 Perl_croak(aTHX_ "panic: sv_pos_b2u: bad byte offset");
4636 send = s + *offsetp;
4641 if (utf8_to_uv(s, UTF8SKIP(s), &n, 0)) {
4655 Returns a boolean indicating whether the strings in the two SVs are
4662 Perl_sv_eq(pTHX_ register SV *sv1, register SV *sv2)
4669 bool pv1tmp = FALSE;
4670 bool pv2tmp = FALSE;
4677 pv1 = SvPV(sv1, cur1);
4684 pv2 = SvPV(sv2, cur2);
4686 /* do not utf8ize the comparands as a side-effect */
4687 if (cur1 && cur2 && SvUTF8(sv1) != SvUTF8(sv2) && !IN_BYTE) {
4688 if (PL_hints & HINT_UTF8_DISTINCT)
4692 (void)utf8_to_bytes((U8*)(pv1 = savepvn(pv1, cur1)), &cur1);
4703 (void)utf8_to_bytes((U8*)(pv2 = savepvn(pv2, cur2)), &cur2);
4716 eq = memEQ(pv1, pv2, cur1);
4729 Compares the strings in two SVs. Returns -1, 0, or 1 indicating whether the
4730 string in C<sv1> is less than, equal to, or greater than the string in
4737 Perl_sv_cmp(pTHX_ register SV *sv1, register SV *sv2)
4742 bool pv1tmp = FALSE;
4743 bool pv2tmp = FALSE;
4750 pv1 = SvPV(sv1, cur1);
4757 pv2 = SvPV(sv2, cur2);
4759 /* do not utf8ize the comparands as a side-effect */
4760 if (cur1 && cur2 && SvUTF8(sv1) != SvUTF8(sv2) && !IN_BYTE) {
4761 if (PL_hints & HINT_UTF8_DISTINCT)
4762 return SvUTF8(sv1) ? 1 : -1;
4765 pv2 = (char*)bytes_to_utf8((U8*)pv2, &cur2);
4769 pv1 = (char*)bytes_to_utf8((U8*)pv1, &cur1);
4775 cmp = cur2 ? -1 : 0;
4779 I32 retval = memcmp((void*)pv1, (void*)pv2, cur1 < cur2 ? cur1 : cur2);
4782 cmp = retval < 0 ? -1 : 1;
4783 } else if (cur1 == cur2) {
4786 cmp = cur1 < cur2 ? -1 : 1;
4799 =for apidoc sv_cmp_locale
4801 Compares the strings in two SVs in a locale-aware manner. See
4808 Perl_sv_cmp_locale(pTHX_ register SV *sv1, register SV *sv2)
4810 #ifdef USE_LOCALE_COLLATE
4816 if (PL_collation_standard)
4820 pv1 = sv1 ? sv_collxfrm(sv1, &len1) : (char *) NULL;
4822 pv2 = sv2 ? sv_collxfrm(sv2, &len2) : (char *) NULL;
4824 if (!pv1 || !len1) {
4835 retval = memcmp((void*)pv1, (void*)pv2, len1 < len2 ? len1 : len2);
4838 return retval < 0 ? -1 : 1;
4841 * When the result of collation is equality, that doesn't mean
4842 * that there are no differences -- some locales exclude some
4843 * characters from consideration. So to avoid false equalities,
4844 * we use the raw string as a tiebreaker.
4850 #endif /* USE_LOCALE_COLLATE */
4852 return sv_cmp(sv1, sv2);
4855 #ifdef USE_LOCALE_COLLATE
4857 * Any scalar variable may carry an 'o' magic that contains the
4858 * scalar data of the variable transformed to such a format that
4859 * a normal memory comparison can be used to compare the data
4860 * according to the locale settings.
4863 Perl_sv_collxfrm(pTHX_ SV *sv, STRLEN *nxp)
4867 mg = SvMAGICAL(sv) ? mg_find(sv, 'o') : (MAGIC *) NULL;
4868 if (!mg || !mg->mg_ptr || *(U32*)mg->mg_ptr != PL_collation_ix) {
4873 Safefree(mg->mg_ptr);
4875 if ((xf = mem_collxfrm(s, len, &xlen))) {
4876 if (SvREADONLY(sv)) {
4879 return xf + sizeof(PL_collation_ix);
4882 sv_magic(sv, 0, 'o', 0, 0);
4883 mg = mg_find(sv, 'o');
4896 if (mg && mg->mg_ptr) {
4898 return mg->mg_ptr + sizeof(PL_collation_ix);
4906 #endif /* USE_LOCALE_COLLATE */
4911 Get a line from the filehandle and store it into the SV, optionally
4912 appending to the currently-stored string.
4918 Perl_sv_gets(pTHX_ register SV *sv, register PerlIO *fp, I32 append)
4922 register STDCHAR rslast;
4923 register STDCHAR *bp;
4927 SV_CHECK_THINKFIRST(sv);
4928 (void)SvUPGRADE(sv, SVt_PV);
4932 if (RsSNARF(PL_rs)) {
4936 else if (RsRECORD(PL_rs)) {
4937 I32 recsize, bytesread;
4940 /* Grab the size of the record we're getting */
4941 recsize = SvIV(SvRV(PL_rs));
4942 (void)SvPOK_only(sv); /* Validate pointer */
4943 buffer = SvGROW(sv, recsize + 1);
4946 /* VMS wants read instead of fread, because fread doesn't respect */
4947 /* RMS record boundaries. This is not necessarily a good thing to be */
4948 /* doing, but we've got no other real choice */
4949 bytesread = PerlLIO_read(PerlIO_fileno(fp), buffer, recsize);
4951 bytesread = PerlIO_read(fp, buffer, recsize);
4953 SvCUR_set(sv, bytesread);
4954 buffer[bytesread] = '\0';
4955 if (PerlIO_isutf8(fp))
4959 return(SvCUR(sv) ? SvPVX(sv) : Nullch);
4961 else if (RsPARA(PL_rs)) {
4966 /* Get $/ i.e. PL_rs into same encoding as stream wants */
4967 if (PerlIO_isutf8(fp)) {
4968 rsptr = SvPVutf8(PL_rs, rslen);
4971 if (SvUTF8(PL_rs)) {
4972 if (!sv_utf8_downgrade(PL_rs, TRUE)) {
4973 Perl_croak(aTHX_ "Wide character in $/");
4976 rsptr = SvPV(PL_rs, rslen);
4980 rslast = rslen ? rsptr[rslen - 1] : '\0';
4982 if (RsPARA(PL_rs)) { /* have to do this both before and after */
4983 do { /* to make sure file boundaries work right */
4986 i = PerlIO_getc(fp);
4990 PerlIO_ungetc(fp,i);
4996 /* See if we know enough about I/O mechanism to cheat it ! */
4998 /* This used to be #ifdef test - it is made run-time test for ease
4999 of abstracting out stdio interface. One call should be cheap
5000 enough here - and may even be a macro allowing compile
5004 if (PerlIO_fast_gets(fp)) {
5007 * We're going to steal some values from the stdio struct
5008 * and put EVERYTHING in the innermost loop into registers.
5010 register STDCHAR *ptr;
5014 #if defined(VMS) && defined(PERLIO_IS_STDIO)
5015 /* An ungetc()d char is handled separately from the regular
5016 * buffer, so we getc() it back out and stuff it in the buffer.
5018 i = PerlIO_getc(fp);
5019 if (i == EOF) return 0;
5020 *(--((*fp)->_ptr)) = (unsigned char) i;
5024 /* Here is some breathtakingly efficient cheating */
5026 cnt = PerlIO_get_cnt(fp); /* get count into register */
5027 (void)SvPOK_only(sv); /* validate pointer */
5028 if (SvLEN(sv) - append <= cnt + 1) { /* make sure we have the room */
5029 if (cnt > 80 && SvLEN(sv) > append) {
5030 shortbuffered = cnt - SvLEN(sv) + append + 1;
5031 cnt -= shortbuffered;
5035 /* remember that cnt can be negative */
5036 SvGROW(sv, append + (cnt <= 0 ? 2 : (cnt + 1)));
5041 bp = (STDCHAR*)SvPVX(sv) + append; /* move these two too to registers */
5042 ptr = (STDCHAR*)PerlIO_get_ptr(fp);
5043 DEBUG_P(PerlIO_printf(Perl_debug_log,
5044 "Screamer: entering, ptr=%"UVuf", cnt=%ld\n",PTR2UV(ptr),(long)cnt));
5045 DEBUG_P(PerlIO_printf(Perl_debug_log,
5046 "Screamer: entering: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
5047 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
5048 PTR2UV(PerlIO_has_base(fp) ? PerlIO_get_base(fp) : 0)));
5053 while (cnt > 0) { /* this | eat */
5055 if ((*bp++ = *ptr++) == rslast) /* really | dust */
5056 goto thats_all_folks; /* screams | sed :-) */
5060 Copy(ptr, bp, cnt, char); /* this | eat */
5061 bp += cnt; /* screams | dust */
5062 ptr += cnt; /* louder | sed :-) */
5067 if (shortbuffered) { /* oh well, must extend */
5068 cnt = shortbuffered;
5070 bpx = bp - (STDCHAR*)SvPVX(sv); /* box up before relocation */
5072 SvGROW(sv, SvLEN(sv) + append + cnt + 2);
5073 bp = (STDCHAR*)SvPVX(sv) + bpx; /* unbox after relocation */
5077 DEBUG_P(PerlIO_printf(Perl_debug_log,
5078 "Screamer: going to getc, ptr=%"UVuf", cnt=%ld\n",
5079 PTR2UV(ptr),(long)cnt));
5080 PerlIO_set_ptrcnt(fp, ptr, cnt); /* deregisterize cnt and ptr */
5081 DEBUG_P(PerlIO_printf(Perl_debug_log,
5082 "Screamer: pre: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
5083 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
5084 PTR2UV(PerlIO_has_base (fp) ? PerlIO_get_base(fp) : 0)));
5085 /* This used to call 'filbuf' in stdio form, but as that behaves like
5086 getc when cnt <= 0 we use PerlIO_getc here to avoid introducing
5087 another abstraction. */
5088 i = PerlIO_getc(fp); /* get more characters */
5089 DEBUG_P(PerlIO_printf(Perl_debug_log,
5090 "Screamer: post: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
5091 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
5092 PTR2UV(PerlIO_has_base (fp) ? PerlIO_get_base(fp) : 0)));
5093 cnt = PerlIO_get_cnt(fp);
5094 ptr = (STDCHAR*)PerlIO_get_ptr(fp); /* reregisterize cnt and ptr */
5095 DEBUG_P(PerlIO_printf(Perl_debug_log,
5096 "Screamer: after getc, ptr=%"UVuf", cnt=%ld\n",PTR2UV(ptr),(long)cnt));
5098 if (i == EOF) /* all done for ever? */
5099 goto thats_really_all_folks;
5101 bpx = bp - (STDCHAR*)SvPVX(sv); /* box up before relocation */
5103 SvGROW(sv, bpx + cnt + 2);
5104 bp = (STDCHAR*)SvPVX(sv) + bpx; /* unbox after relocation */
5106 *bp++ = i; /* store character from PerlIO_getc */
5108 if (rslen && (STDCHAR)i == rslast) /* all done for now? */
5109 goto thats_all_folks;
5113 if ((rslen > 1 && (bp - (STDCHAR*)SvPVX(sv) < rslen)) ||
5114 memNE((char*)bp - rslen, rsptr, rslen))
5115 goto screamer; /* go back to the fray */
5116 thats_really_all_folks:
5118 cnt += shortbuffered;
5119 DEBUG_P(PerlIO_printf(Perl_debug_log,
5120 "Screamer: quitting, ptr=%"UVuf", cnt=%ld\n",PTR2UV(ptr),(long)cnt));
5121 PerlIO_set_ptrcnt(fp, ptr, cnt); /* put these back or we're in trouble */
5122 DEBUG_P(PerlIO_printf(Perl_debug_log,
5123 "Screamer: end: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
5124 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
5125 PTR2UV(PerlIO_has_base (fp) ? PerlIO_get_base(fp) : 0)));
5127 SvCUR_set(sv, bp - (STDCHAR*)SvPVX(sv)); /* set length */
5128 DEBUG_P(PerlIO_printf(Perl_debug_log,
5129 "Screamer: done, len=%ld, string=|%.*s|\n",
5130 (long)SvCUR(sv),(int)SvCUR(sv),SvPVX(sv)));
5135 /*The big, slow, and stupid way */
5138 /* Need to work around EPOC SDK features */
5139 /* On WINS: MS VC5 generates calls to _chkstk, */
5140 /* if a `large' stack frame is allocated */
5141 /* gcc on MARM does not generate calls like these */
5147 register STDCHAR *bpe = buf + sizeof(buf);
5149 while ((i = PerlIO_getc(fp)) != EOF && (*bp++ = i) != rslast && bp < bpe)
5150 ; /* keep reading */
5154 cnt = PerlIO_read(fp,(char*)buf, sizeof(buf));
5155 /* Accomodate broken VAXC compiler, which applies U8 cast to
5156 * both args of ?: operator, causing EOF to change into 255
5158 if (cnt) { i = (U8)buf[cnt - 1]; } else { i = EOF; }
5162 sv_catpvn(sv, (char *) buf, cnt);
5164 sv_setpvn(sv, (char *) buf, cnt);
5166 if (i != EOF && /* joy */
5168 SvCUR(sv) < rslen ||
5169 memNE(SvPVX(sv) + SvCUR(sv) - rslen, rsptr, rslen)))
5173 * If we're reading from a TTY and we get a short read,
5174 * indicating that the user hit his EOF character, we need
5175 * to notice it now, because if we try to read from the TTY
5176 * again, the EOF condition will disappear.
5178 * The comparison of cnt to sizeof(buf) is an optimization
5179 * that prevents unnecessary calls to feof().
5183 if (!(cnt < sizeof(buf) && PerlIO_eof(fp)))
5188 if (RsPARA(PL_rs)) { /* have to do this both before and after */
5189 while (i != EOF) { /* to make sure file boundaries work right */
5190 i = PerlIO_getc(fp);
5192 PerlIO_ungetc(fp,i);
5198 if (PerlIO_isutf8(fp))
5203 return (SvCUR(sv) - append) ? SvPVX(sv) : Nullch;
5210 Auto-increment of the value in the SV.
5216 Perl_sv_inc(pTHX_ register SV *sv)
5225 if (SvTHINKFIRST(sv)) {
5226 if (SvREADONLY(sv)) {
5227 if (PL_curcop != &PL_compiling)
5228 Perl_croak(aTHX_ PL_no_modify);
5232 if (SvAMAGIC(sv) && AMG_CALLun(sv,inc))
5234 i = PTR2IV(SvRV(sv));
5239 flags = SvFLAGS(sv);
5240 if ((flags & (SVp_NOK|SVp_IOK)) == SVp_NOK) {
5241 /* It's (privately or publicly) a float, but not tested as an
5242 integer, so test it to see. */
5244 flags = SvFLAGS(sv);
5246 if ((flags & SVf_IOK) || ((flags & (SVp_IOK | SVp_NOK)) == SVp_IOK)) {
5247 /* It's publicly an integer, or privately an integer-not-float */
5250 if (SvUVX(sv) == UV_MAX)
5251 sv_setnv(sv, (NV)UV_MAX + 1.0);
5253 (void)SvIOK_only_UV(sv);
5256 if (SvIVX(sv) == IV_MAX)
5257 sv_setuv(sv, (UV)IV_MAX + 1);
5259 (void)SvIOK_only(sv);
5265 if (flags & SVp_NOK) {
5266 (void)SvNOK_only(sv);
5271 if (!(flags & SVp_POK) || !*SvPVX(sv)) {
5272 if ((flags & SVTYPEMASK) < SVt_PVIV)
5273 sv_upgrade(sv, SVt_IV);
5274 (void)SvIOK_only(sv);
5279 while (isALPHA(*d)) d++;
5280 while (isDIGIT(*d)) d++;
5282 #ifdef PERL_PRESERVE_IVUV
5283 /* Got to punt this an an integer if needs be, but we don't issue
5284 warnings. Probably ought to make the sv_iv_please() that does
5285 the conversion if possible, and silently. */
5286 I32 numtype = looks_like_number(sv);
5287 if (numtype && !(numtype & IS_NUMBER_INFINITY)) {
5288 /* Need to try really hard to see if it's an integer.
5289 9.22337203685478e+18 is an integer.
5290 but "9.22337203685478e+18" + 0 is UV=9223372036854779904
5291 so $a="9.22337203685478e+18"; $a+0; $a++
5292 needs to be the same as $a="9.22337203685478e+18"; $a++
5299 /* sv_2iv *should* have made this an NV */
5300 if (flags & SVp_NOK) {
5301 (void)SvNOK_only(sv);
5305 /* I don't think we can get here. Maybe I should assert this
5306 And if we do get here I suspect that sv_setnv will croak. NWC
5308 #if defined(USE_LONG_DOUBLE)
5309 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",
5310 SvPVX(sv), SvIVX(sv), SvNVX(sv)));
5312 DEBUG_c(PerlIO_printf(Perl_debug_log,"sv_inc punt failed to convert '%s' to IOK or NOKp, UV=0x%"UVxf" NV=%g\n",
5313 SvPVX(sv), SvIVX(sv), SvNVX(sv)));
5316 #endif /* PERL_PRESERVE_IVUV */
5317 sv_setnv(sv,Atof(SvPVX(sv)) + 1.0);
5321 while (d >= SvPVX(sv)) {
5329 /* MKS: The original code here died if letters weren't consecutive.
5330 * at least it didn't have to worry about non-C locales. The
5331 * new code assumes that ('z'-'a')==('Z'-'A'), letters are
5332 * arranged in order (although not consecutively) and that only
5333 * [A-Za-z] are accepted by isALPHA in the C locale.
5335 if (*d != 'z' && *d != 'Z') {
5336 do { ++*d; } while (!isALPHA(*d));
5339 *(d--) -= 'z' - 'a';
5344 *(d--) -= 'z' - 'a' + 1;
5348 /* oh,oh, the number grew */
5349 SvGROW(sv, SvCUR(sv) + 2);
5351 for (d = SvPVX(sv) + SvCUR(sv); d > SvPVX(sv); d--)
5362 Auto-decrement of the value in the SV.
5368 Perl_sv_dec(pTHX_ register SV *sv)
5376 if (SvTHINKFIRST(sv)) {
5377 if (SvREADONLY(sv)) {
5378 if (PL_curcop != &PL_compiling)
5379 Perl_croak(aTHX_ PL_no_modify);
5383 if (SvAMAGIC(sv) && AMG_CALLun(sv,dec))
5385 i = PTR2IV(SvRV(sv));
5390 /* Unlike sv_inc we don't have to worry about string-never-numbers
5391 and keeping them magic. But we mustn't warn on punting */
5392 flags = SvFLAGS(sv);
5393 if ((flags & SVf_IOK) || ((flags & (SVp_IOK | SVp_NOK)) == SVp_IOK)) {
5394 /* It's publicly an integer, or privately an integer-not-float */
5397 if (SvUVX(sv) == 0) {
5398 (void)SvIOK_only(sv);
5402 (void)SvIOK_only_UV(sv);
5406 if (SvIVX(sv) == IV_MIN)
5407 sv_setnv(sv, (NV)IV_MIN - 1.0);
5409 (void)SvIOK_only(sv);
5415 if (flags & SVp_NOK) {
5417 (void)SvNOK_only(sv);
5420 if (!(flags & SVp_POK)) {
5421 if ((flags & SVTYPEMASK) < SVt_PVNV)
5422 sv_upgrade(sv, SVt_NV);
5424 (void)SvNOK_only(sv);
5427 #ifdef PERL_PRESERVE_IVUV
5429 I32 numtype = looks_like_number(sv);
5430 if (numtype && !(numtype & IS_NUMBER_INFINITY)) {
5431 /* Need to try really hard to see if it's an integer.
5432 9.22337203685478e+18 is an integer.
5433 but "9.22337203685478e+18" + 0 is UV=9223372036854779904
5434 so $a="9.22337203685478e+18"; $a+0; $a--
5435 needs to be the same as $a="9.22337203685478e+18"; $a--
5442 /* sv_2iv *should* have made this an NV */
5443 if (flags & SVp_NOK) {
5444 (void)SvNOK_only(sv);
5448 /* I don't think we can get here. Maybe I should assert this
5449 And if we do get here I suspect that sv_setnv will croak. NWC
5451 #if defined(USE_LONG_DOUBLE)
5452 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",
5453 SvPVX(sv), SvIVX(sv), SvNVX(sv)));
5455 DEBUG_c(PerlIO_printf(Perl_debug_log,"sv_dec punt failed to convert '%s' to IOK or NOKp, UV=0x%"UVxf" NV=%g\n",
5456 SvPVX(sv), SvIVX(sv), SvNVX(sv)));
5460 #endif /* PERL_PRESERVE_IVUV */
5461 sv_setnv(sv,Atof(SvPVX(sv)) - 1.0); /* punt */
5465 =for apidoc sv_mortalcopy
5467 Creates a new SV which is a copy of the original SV. The new SV is marked
5473 /* Make a string that will exist for the duration of the expression
5474 * evaluation. Actually, it may have to last longer than that, but
5475 * hopefully we won't free it until it has been assigned to a
5476 * permanent location. */
5479 Perl_sv_mortalcopy(pTHX_ SV *oldstr)
5484 sv_setsv(sv,oldstr);
5486 PL_tmps_stack[++PL_tmps_ix] = sv;
5492 =for apidoc sv_newmortal
5494 Creates a new SV which is mortal. The reference count of the SV is set to 1.
5500 Perl_sv_newmortal(pTHX)
5505 SvFLAGS(sv) = SVs_TEMP;
5507 PL_tmps_stack[++PL_tmps_ix] = sv;
5512 =for apidoc sv_2mortal
5514 Marks an SV as mortal. The SV will be destroyed when the current context
5520 /* same thing without the copying */
5523 Perl_sv_2mortal(pTHX_ register SV *sv)
5527 if (SvREADONLY(sv) && SvIMMORTAL(sv))
5530 PL_tmps_stack[++PL_tmps_ix] = sv;
5538 Creates a new SV and copies a string into it. The reference count for the
5539 SV is set to 1. If C<len> is zero, Perl will compute the length using
5540 strlen(). For efficiency, consider using C<newSVpvn> instead.
5546 Perl_newSVpv(pTHX_ const char *s, STRLEN len)
5553 sv_setpvn(sv,s,len);
5558 =for apidoc newSVpvn
5560 Creates a new SV and copies a string into it. The reference count for the
5561 SV is set to 1. Note that if C<len> is zero, Perl will create a zero length
5562 string. You are responsible for ensuring that the source string is at least
5569 Perl_newSVpvn(pTHX_ const char *s, STRLEN len)
5574 sv_setpvn(sv,s,len);
5579 =for apidoc newSVpvn_share
5581 Creates a new SV and populates it with a string from
5582 the string table. Turns on READONLY and FAKE.
5583 The idea here is that as string table is used for shared hash
5584 keys these strings will have SvPVX == HeKEY and hash lookup
5585 will avoid string compare.
5591 Perl_newSVpvn_share(pTHX_ const char *src, I32 len, U32 hash)
5594 bool is_utf8 = FALSE;
5600 PERL_HASH(hash, src, len);
5602 sv_upgrade(sv, SVt_PVIV);
5603 SvPVX(sv) = sharepvn(src, is_utf8?-len:len, hash);
5615 #if defined(PERL_IMPLICIT_CONTEXT)
5617 Perl_newSVpvf_nocontext(const char* pat, ...)
5622 va_start(args, pat);
5623 sv = vnewSVpvf(pat, &args);
5630 =for apidoc newSVpvf
5632 Creates a new SV an initialize it with the string formatted like
5639 Perl_newSVpvf(pTHX_ const char* pat, ...)
5643 va_start(args, pat);
5644 sv = vnewSVpvf(pat, &args);
5650 Perl_vnewSVpvf(pTHX_ const char* pat, va_list* args)
5654 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
5661 Creates a new SV and copies a floating point value into it.
5662 The reference count for the SV is set to 1.
5668 Perl_newSVnv(pTHX_ NV n)
5680 Creates a new SV and copies an integer into it. The reference count for the
5687 Perl_newSViv(pTHX_ IV i)
5699 Creates a new SV and copies an unsigned integer into it.
5700 The reference count for the SV is set to 1.
5706 Perl_newSVuv(pTHX_ UV u)
5716 =for apidoc newRV_noinc
5718 Creates an RV wrapper for an SV. The reference count for the original
5719 SV is B<not> incremented.
5725 Perl_newRV_noinc(pTHX_ SV *tmpRef)
5730 sv_upgrade(sv, SVt_RV);
5737 /* newRV_inc is #defined to newRV in sv.h */
5739 Perl_newRV(pTHX_ SV *tmpRef)
5741 return newRV_noinc(SvREFCNT_inc(tmpRef));
5747 Creates a new SV which is an exact duplicate of the original SV.
5752 /* make an exact duplicate of old */
5755 Perl_newSVsv(pTHX_ register SV *old)
5761 if (SvTYPE(old) == SVTYPEMASK) {
5762 if (ckWARN_d(WARN_INTERNAL))
5763 Perl_warner(aTHX_ WARN_INTERNAL, "semi-panic: attempt to dup freed string");
5778 Perl_sv_reset(pTHX_ register char *s, HV *stash)
5786 char todo[PERL_UCHAR_MAX+1];
5791 if (!*s) { /* reset ?? searches */
5792 for (pm = HvPMROOT(stash); pm; pm = pm->op_pmnext) {
5793 pm->op_pmdynflags &= ~PMdf_USED;
5798 /* reset variables */
5800 if (!HvARRAY(stash))
5803 Zero(todo, 256, char);
5805 i = (unsigned char)*s;
5809 max = (unsigned char)*s++;
5810 for ( ; i <= max; i++) {
5813 for (i = 0; i <= (I32) HvMAX(stash); i++) {
5814 for (entry = HvARRAY(stash)[i];
5816 entry = HeNEXT(entry))
5818 if (!todo[(U8)*HeKEY(entry)])
5820 gv = (GV*)HeVAL(entry);
5822 if (SvTHINKFIRST(sv)) {
5823 if (!SvREADONLY(sv) && SvROK(sv))
5828 if (SvTYPE(sv) >= SVt_PV) {
5830 if (SvPVX(sv) != Nullch)
5837 if (GvHV(gv) && !HvNAME(GvHV(gv))) {
5839 #ifdef USE_ENVIRON_ARRAY
5841 environ[0] = Nullch;
5850 Perl_sv_2io(pTHX_ SV *sv)
5856 switch (SvTYPE(sv)) {
5864 Perl_croak(aTHX_ "Bad filehandle: %s", GvNAME(gv));
5868 Perl_croak(aTHX_ PL_no_usym, "filehandle");
5870 return sv_2io(SvRV(sv));
5871 gv = gv_fetchpv(SvPV(sv,n_a), FALSE, SVt_PVIO);
5877 Perl_croak(aTHX_ "Bad filehandle: %s", SvPV(sv,n_a));
5884 Perl_sv_2cv(pTHX_ SV *sv, HV **st, GV **gvp, I32 lref)
5891 return *gvp = Nullgv, Nullcv;
5892 switch (SvTYPE(sv)) {
5911 SV **sp = &sv; /* Used in tryAMAGICunDEREF macro. */
5912 tryAMAGICunDEREF(to_cv);
5915 if (SvTYPE(sv) == SVt_PVCV) {
5924 Perl_croak(aTHX_ "Not a subroutine reference");
5929 gv = gv_fetchpv(SvPV(sv, n_a), lref, SVt_PVCV);
5935 if (lref && !GvCVu(gv)) {
5938 tmpsv = NEWSV(704,0);
5939 gv_efullname3(tmpsv, gv, Nullch);
5940 /* XXX this is probably not what they think they're getting.
5941 * It has the same effect as "sub name;", i.e. just a forward
5943 newSUB(start_subparse(FALSE, 0),
5944 newSVOP(OP_CONST, 0, tmpsv),
5949 Perl_croak(aTHX_ "Unable to create sub named \"%s\"", SvPV(sv,n_a));
5958 Returns true if the SV has a true value by Perl's rules.
5964 Perl_sv_true(pTHX_ register SV *sv)
5970 if ((tXpv = (XPV*)SvANY(sv)) &&
5971 (tXpv->xpv_cur > 1 ||
5972 (tXpv->xpv_cur && *tXpv->xpv_pv != '0')))
5979 return SvIVX(sv) != 0;
5982 return SvNVX(sv) != 0.0;
5984 return sv_2bool(sv);
5990 Perl_sv_iv(pTHX_ register SV *sv)
5994 return (IV)SvUVX(sv);
6001 Perl_sv_uv(pTHX_ register SV *sv)
6006 return (UV)SvIVX(sv);
6012 Perl_sv_nv(pTHX_ register SV *sv)
6020 Perl_sv_pv(pTHX_ SV *sv)
6027 return sv_2pv(sv, &n_a);
6031 Perl_sv_pvn(pTHX_ SV *sv, STRLEN *lp)
6037 return sv_2pv(sv, lp);
6041 =for apidoc sv_pvn_force
6043 Get a sensible string out of the SV somehow.
6049 Perl_sv_pvn_force(pTHX_ SV *sv, STRLEN *lp)
6053 if (SvTHINKFIRST(sv) && !SvROK(sv))
6054 sv_force_normal(sv);
6060 if (SvTYPE(sv) > SVt_PVLV && SvTYPE(sv) != SVt_PVFM) {
6061 Perl_croak(aTHX_ "Can't coerce %s to string in %s", sv_reftype(sv,0),
6062 PL_op_name[PL_op->op_type]);
6066 if (s != SvPVX(sv)) { /* Almost, but not quite, sv_setpvn() */
6071 (void)SvUPGRADE(sv, SVt_PV); /* Never FALSE */
6072 SvGROW(sv, len + 1);
6073 Move(s,SvPVX(sv),len,char);
6078 SvPOK_on(sv); /* validate pointer */
6080 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2pv(%s)\n",
6081 PTR2UV(sv),SvPVX(sv)));
6088 Perl_sv_pvbyte(pTHX_ SV *sv)
6094 Perl_sv_pvbyten(pTHX_ SV *sv, STRLEN *lp)
6096 return sv_pvn(sv,lp);
6100 Perl_sv_pvbyten_force(pTHX_ SV *sv, STRLEN *lp)
6102 return sv_pvn_force(sv,lp);
6106 Perl_sv_pvutf8(pTHX_ SV *sv)
6108 sv_utf8_upgrade(sv);
6113 Perl_sv_pvutf8n(pTHX_ SV *sv, STRLEN *lp)
6115 sv_utf8_upgrade(sv);
6116 return sv_pvn(sv,lp);
6120 =for apidoc sv_pvutf8n_force
6122 Get a sensible UTF8-encoded string out of the SV somehow. See
6129 Perl_sv_pvutf8n_force(pTHX_ SV *sv, STRLEN *lp)
6131 sv_utf8_upgrade(sv);
6132 return sv_pvn_force(sv,lp);
6136 =for apidoc sv_reftype
6138 Returns a string describing what the SV is a reference to.
6144 Perl_sv_reftype(pTHX_ SV *sv, int ob)
6146 if (ob && SvOBJECT(sv))
6147 return HvNAME(SvSTASH(sv));
6149 switch (SvTYPE(sv)) {
6163 case SVt_PVLV: return "LVALUE";
6164 case SVt_PVAV: return "ARRAY";
6165 case SVt_PVHV: return "HASH";
6166 case SVt_PVCV: return "CODE";
6167 case SVt_PVGV: return "GLOB";
6168 case SVt_PVFM: return "FORMAT";
6169 case SVt_PVIO: return "IO";
6170 default: return "UNKNOWN";
6176 =for apidoc sv_isobject
6178 Returns a boolean indicating whether the SV is an RV pointing to a blessed
6179 object. If the SV is not an RV, or if the object is not blessed, then this
6186 Perl_sv_isobject(pTHX_ SV *sv)
6203 Returns a boolean indicating whether the SV is blessed into the specified
6204 class. This does not check for subtypes; use C<sv_derived_from> to verify
6205 an inheritance relationship.
6211 Perl_sv_isa(pTHX_ SV *sv, const char *name)
6223 return strEQ(HvNAME(SvSTASH(sv)), name);
6229 Creates a new SV for the RV, C<rv>, to point to. If C<rv> is not an RV then
6230 it will be upgraded to one. If C<classname> is non-null then the new SV will
6231 be blessed in the specified package. The new SV is returned and its
6232 reference count is 1.
6238 Perl_newSVrv(pTHX_ SV *rv, const char *classname)
6244 SV_CHECK_THINKFIRST(rv);
6247 if (SvTYPE(rv) >= SVt_PVMG) {
6248 U32 refcnt = SvREFCNT(rv);
6252 SvREFCNT(rv) = refcnt;
6255 if (SvTYPE(rv) < SVt_RV)
6256 sv_upgrade(rv, SVt_RV);
6257 else if (SvTYPE(rv) > SVt_RV) {
6258 (void)SvOOK_off(rv);
6259 if (SvPVX(rv) && SvLEN(rv))
6260 Safefree(SvPVX(rv));
6270 HV* stash = gv_stashpv(classname, TRUE);
6271 (void)sv_bless(rv, stash);
6277 =for apidoc sv_setref_pv
6279 Copies a pointer into a new SV, optionally blessing the SV. The C<rv>
6280 argument will be upgraded to an RV. That RV will be modified to point to
6281 the new SV. If the C<pv> argument is NULL then C<PL_sv_undef> will be placed
6282 into the SV. The C<classname> argument indicates the package for the
6283 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
6284 will be returned and will have a reference count of 1.
6286 Do not use with other Perl types such as HV, AV, SV, CV, because those
6287 objects will become corrupted by the pointer copy process.
6289 Note that C<sv_setref_pvn> copies the string while this copies the pointer.
6295 Perl_sv_setref_pv(pTHX_ SV *rv, const char *classname, void *pv)
6298 sv_setsv(rv, &PL_sv_undef);
6302 sv_setiv(newSVrv(rv,classname), PTR2IV(pv));
6307 =for apidoc sv_setref_iv
6309 Copies an integer into a new SV, optionally blessing the SV. The C<rv>
6310 argument will be upgraded to an RV. That RV will be modified to point to
6311 the new SV. The C<classname> argument indicates the package for the
6312 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
6313 will be returned and will have a reference count of 1.
6319 Perl_sv_setref_iv(pTHX_ SV *rv, const char *classname, IV iv)
6321 sv_setiv(newSVrv(rv,classname), iv);
6326 =for apidoc sv_setref_nv
6328 Copies a double into a new SV, optionally blessing the SV. The C<rv>
6329 argument will be upgraded to an RV. That RV will be modified to point to
6330 the new SV. The C<classname> argument indicates the package for the
6331 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
6332 will be returned and will have a reference count of 1.
6338 Perl_sv_setref_nv(pTHX_ SV *rv, const char *classname, NV nv)
6340 sv_setnv(newSVrv(rv,classname), nv);
6345 =for apidoc sv_setref_pvn
6347 Copies a string into a new SV, optionally blessing the SV. The length of the
6348 string must be specified with C<n>. The C<rv> argument will be upgraded to
6349 an RV. That RV will be modified to point to the new SV. The C<classname>
6350 argument indicates the package for the blessing. Set C<classname> to
6351 C<Nullch> to avoid the blessing. The new SV will be returned and will have
6352 a reference count of 1.
6354 Note that C<sv_setref_pv> copies the pointer while this copies the string.
6360 Perl_sv_setref_pvn(pTHX_ SV *rv, const char *classname, char *pv, STRLEN n)
6362 sv_setpvn(newSVrv(rv,classname), pv, n);
6367 =for apidoc sv_bless
6369 Blesses an SV into a specified package. The SV must be an RV. The package
6370 must be designated by its stash (see C<gv_stashpv()>). The reference count
6371 of the SV is unaffected.
6377 Perl_sv_bless(pTHX_ SV *sv, HV *stash)
6381 Perl_croak(aTHX_ "Can't bless non-reference value");
6383 if (SvFLAGS(tmpRef) & (SVs_OBJECT|SVf_READONLY)) {
6384 if (SvREADONLY(tmpRef))
6385 Perl_croak(aTHX_ PL_no_modify);
6386 if (SvOBJECT(tmpRef)) {
6387 if (SvTYPE(tmpRef) != SVt_PVIO)
6389 SvREFCNT_dec(SvSTASH(tmpRef));
6392 SvOBJECT_on(tmpRef);
6393 if (SvTYPE(tmpRef) != SVt_PVIO)
6395 (void)SvUPGRADE(tmpRef, SVt_PVMG);
6396 SvSTASH(tmpRef) = (HV*)SvREFCNT_inc(stash);
6407 S_sv_unglob(pTHX_ SV *sv)
6411 assert(SvTYPE(sv) == SVt_PVGV);
6416 SvREFCNT_dec(GvSTASH(sv));
6417 GvSTASH(sv) = Nullhv;
6419 sv_unmagic(sv, '*');
6420 Safefree(GvNAME(sv));
6423 /* need to keep SvANY(sv) in the right arena */
6424 xpvmg = new_XPVMG();
6425 StructCopy(SvANY(sv), xpvmg, XPVMG);
6426 del_XPVGV(SvANY(sv));
6429 SvFLAGS(sv) &= ~SVTYPEMASK;
6430 SvFLAGS(sv) |= SVt_PVMG;
6434 =for apidoc sv_unref_flags
6436 Unsets the RV status of the SV, and decrements the reference count of
6437 whatever was being referenced by the RV. This can almost be thought of
6438 as a reversal of C<newSVrv>. The C<cflags> argument can contain
6439 C<SV_IMMEDIATE_UNREF> to force the reference count to be decremented
6440 (otherwise the decrementing is conditional on the reference count being
6441 different from one or the reference being a readonly SV).
6448 Perl_sv_unref_flags(pTHX_ SV *sv, U32 flags)
6452 if (SvWEAKREF(sv)) {
6460 if (SvREFCNT(rv) != 1 || SvREADONLY(rv) || flags) /* SV_IMMEDIATE_UNREF */
6462 else /* XXX Hack, but hard to make $a=$a->[1] work otherwise */
6463 sv_2mortal(rv); /* Schedule for freeing later */
6467 =for apidoc sv_unref
6469 Unsets the RV status of the SV, and decrements the reference count of
6470 whatever was being referenced by the RV. This can almost be thought of
6471 as a reversal of C<newSVrv>. This is C<sv_unref_flags> with the C<flag>
6472 being zero. See C<SvROK_off>.
6478 Perl_sv_unref(pTHX_ SV *sv)
6480 sv_unref_flags(sv, 0);
6484 Perl_sv_taint(pTHX_ SV *sv)
6486 sv_magic((sv), Nullsv, 't', Nullch, 0);
6490 Perl_sv_untaint(pTHX_ SV *sv)
6492 if (SvTYPE(sv) >= SVt_PVMG && SvMAGIC(sv)) {
6493 MAGIC *mg = mg_find(sv, 't');
6500 Perl_sv_tainted(pTHX_ SV *sv)
6502 if (SvTYPE(sv) >= SVt_PVMG && SvMAGIC(sv)) {
6503 MAGIC *mg = mg_find(sv, 't');
6504 if (mg && ((mg->mg_len & 1) || ((mg->mg_len & 2) && mg->mg_obj == sv)))
6511 =for apidoc sv_setpviv
6513 Copies an integer into the given SV, also updating its string value.
6514 Does not handle 'set' magic. See C<sv_setpviv_mg>.
6520 Perl_sv_setpviv(pTHX_ SV *sv, IV iv)
6522 char buf[TYPE_CHARS(UV)];
6524 char *ptr = uiv_2buf(buf, iv, 0, 0, &ebuf);
6526 sv_setpvn(sv, ptr, ebuf - ptr);
6531 =for apidoc sv_setpviv_mg
6533 Like C<sv_setpviv>, but also handles 'set' magic.
6539 Perl_sv_setpviv_mg(pTHX_ SV *sv, IV iv)
6541 char buf[TYPE_CHARS(UV)];
6543 char *ptr = uiv_2buf(buf, iv, 0, 0, &ebuf);
6545 sv_setpvn(sv, ptr, ebuf - ptr);
6549 #if defined(PERL_IMPLICIT_CONTEXT)
6551 Perl_sv_setpvf_nocontext(SV *sv, const char* pat, ...)
6555 va_start(args, pat);
6556 sv_vsetpvf(sv, pat, &args);
6562 Perl_sv_setpvf_mg_nocontext(SV *sv, const char* pat, ...)
6566 va_start(args, pat);
6567 sv_vsetpvf_mg(sv, pat, &args);
6573 =for apidoc sv_setpvf
6575 Processes its arguments like C<sprintf> and sets an SV to the formatted
6576 output. Does not handle 'set' magic. See C<sv_setpvf_mg>.
6582 Perl_sv_setpvf(pTHX_ SV *sv, const char* pat, ...)
6585 va_start(args, pat);
6586 sv_vsetpvf(sv, pat, &args);
6591 Perl_sv_vsetpvf(pTHX_ SV *sv, const char* pat, va_list* args)
6593 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
6597 =for apidoc sv_setpvf_mg
6599 Like C<sv_setpvf>, but also handles 'set' magic.
6605 Perl_sv_setpvf_mg(pTHX_ SV *sv, const char* pat, ...)
6608 va_start(args, pat);
6609 sv_vsetpvf_mg(sv, pat, &args);
6614 Perl_sv_vsetpvf_mg(pTHX_ SV *sv, const char* pat, va_list* args)
6616 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
6620 #if defined(PERL_IMPLICIT_CONTEXT)
6622 Perl_sv_catpvf_nocontext(SV *sv, const char* pat, ...)
6626 va_start(args, pat);
6627 sv_vcatpvf(sv, pat, &args);
6632 Perl_sv_catpvf_mg_nocontext(SV *sv, const char* pat, ...)
6636 va_start(args, pat);
6637 sv_vcatpvf_mg(sv, pat, &args);
6643 =for apidoc sv_catpvf
6645 Processes its arguments like C<sprintf> and appends the formatted output
6646 to an SV. Handles 'get' magic, but not 'set' magic. C<SvSETMAGIC()> must
6647 typically be called after calling this function to handle 'set' magic.
6653 Perl_sv_catpvf(pTHX_ SV *sv, const char* pat, ...)
6656 va_start(args, pat);
6657 sv_vcatpvf(sv, pat, &args);
6662 Perl_sv_vcatpvf(pTHX_ SV *sv, const char* pat, va_list* args)
6664 sv_vcatpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
6668 =for apidoc sv_catpvf_mg
6670 Like C<sv_catpvf>, but also handles 'set' magic.
6676 Perl_sv_catpvf_mg(pTHX_ SV *sv, const char* pat, ...)
6679 va_start(args, pat);
6680 sv_vcatpvf_mg(sv, pat, &args);
6685 Perl_sv_vcatpvf_mg(pTHX_ SV *sv, const char* pat, va_list* args)
6687 sv_vcatpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
6692 =for apidoc sv_vsetpvfn
6694 Works like C<vcatpvfn> but copies the text into the SV instead of
6701 Perl_sv_vsetpvfn(pTHX_ SV *sv, const char *pat, STRLEN patlen, va_list *args, SV **svargs, I32 svmax, bool *maybe_tainted)
6703 sv_setpvn(sv, "", 0);
6704 sv_vcatpvfn(sv, pat, patlen, args, svargs, svmax, maybe_tainted);
6708 =for apidoc sv_vcatpvfn
6710 Processes its arguments like C<vsprintf> and appends the formatted output
6711 to an SV. Uses an array of SVs if the C style variable argument list is
6712 missing (NULL). When running with taint checks enabled, indicates via
6713 C<maybe_tainted> if results are untrustworthy (often due to the use of
6720 Perl_sv_vcatpvfn(pTHX_ SV *sv, const char *pat, STRLEN patlen, va_list *args, SV **svargs, I32 svmax, bool *maybe_tainted)
6727 static char nullstr[] = "(null)";
6730 /* no matter what, this is a string now */
6731 (void)SvPV_force(sv, origlen);
6733 /* special-case "", "%s", and "%_" */
6736 if (patlen == 2 && pat[0] == '%') {
6740 char *s = va_arg(*args, char*);
6741 sv_catpv(sv, s ? s : nullstr);
6743 else if (svix < svmax) {
6744 sv_catsv(sv, *svargs);
6745 if (DO_UTF8(*svargs))
6751 argsv = va_arg(*args, SV*);
6752 sv_catsv(sv, argsv);
6757 /* See comment on '_' below */
6762 patend = (char*)pat + patlen;
6763 for (p = (char*)pat; p < patend; p = q) {
6766 bool vectorize = FALSE;
6773 bool has_precis = FALSE;
6775 bool is_utf = FALSE;
6778 U8 utf8buf[UTF8_MAXLEN+1];
6779 STRLEN esignlen = 0;
6781 char *eptr = Nullch;
6783 /* Times 4: a decimal digit takes more than 3 binary digits.
6784 * NV_DIG: mantissa takes than many decimal digits.
6785 * Plus 32: Playing safe. */
6786 char ebuf[IV_DIG * 4 + NV_DIG + 32];
6787 /* large enough for "%#.#f" --chip */
6788 /* what about long double NVs? --jhi */
6791 U8 *vecstr = Null(U8*);
6803 STRLEN dotstrlen = 1;
6804 I32 epix = 0; /* explicit parameter index */
6805 I32 ewix = 0; /* explicit width index */
6806 bool asterisk = FALSE;
6808 for (q = p; q < patend && *q != '%'; ++q) ;
6810 sv_catpvn(sv, p, q - p);
6839 case '*': /* printf("%*vX",":",$ipv6addr) */
6844 vecsv = va_arg(*args, SV*);
6845 else if (svix < svmax)
6846 vecsv = svargs[svix++];
6849 dotstr = SvPVx(vecsv,dotstrlen);
6877 case '1': case '2': case '3':
6878 case '4': case '5': case '6':
6879 case '7': case '8': case '9':
6882 width = width * 10 + (*q++ - '0');
6884 if (asterisk && ewix == 0) {
6889 } else if (epix == 0) {
6901 i = va_arg(*args, int);
6903 i = (ewix ? ewix <= svmax : svix < svmax) ?
6904 SvIVx(svargs[ewix ? ewix-1 : svix++]) : 0;
6906 width = (i < 0) ? -i : i;
6915 i = va_arg(*args, int);
6917 i = (ewix ? ewix <= svmax : svix < svmax)
6918 ? SvIVx(svargs[ewix ? ewix-1 : svix++]) : 0;
6919 precis = (i < 0) ? 0 : i;
6925 precis = precis * 10 + (*q++ - '0');
6932 vecsv = va_arg(*args, SV*);
6933 vecstr = (U8*)SvPVx(vecsv,veclen);
6934 utf = DO_UTF8(vecsv);
6936 else if (epix ? epix <= svmax : svix < svmax) {
6937 vecsv = svargs[epix ? epix-1 : svix++];
6938 vecstr = (U8*)SvPVx(vecsv,veclen);
6939 utf = DO_UTF8(vecsv);
6950 #if defined(HAS_QUAD) || (defined(HAS_LONG_DOUBLE) && defined(USE_LONG_DOUBLE))
6961 #if defined(HAS_QUAD) || (defined(HAS_LONG_DOUBLE) && defined(USE_LONG_DOUBLE))
6962 if (*(q + 1) == 'l') { /* lld, llf */
6989 uv = va_arg(*args, int);
6991 uv = (epix ? epix <= svmax : svix < svmax) ?
6992 SvIVx(svargs[epix ? epix-1 : svix++]) : 0;
6993 if ((uv > 255 || (uv > 127 && SvUTF8(sv))) && !IN_BYTE) {
6994 eptr = (char*)utf8buf;
6995 elen = uv_to_utf8((U8*)eptr, uv) - utf8buf;
7007 eptr = va_arg(*args, char*);
7009 #ifdef MACOS_TRADITIONAL
7010 /* On MacOS, %#s format is used for Pascal strings */
7015 elen = strlen(eptr);
7018 elen = sizeof nullstr - 1;
7021 else if (epix ? epix <= svmax : svix < svmax) {
7022 argsv = svargs[epix ? epix-1 : svix++];
7023 eptr = SvPVx(argsv, elen);
7024 if (DO_UTF8(argsv)) {
7025 if (has_precis && precis < elen) {
7027 sv_pos_u2b(argsv, &p, 0); /* sticks at end */
7030 if (width) { /* fudge width (can't fudge elen) */
7031 width += elen - sv_len_utf8(argsv);
7040 * The "%_" hack might have to be changed someday,
7041 * if ISO or ANSI decide to use '_' for something.
7042 * So we keep it hidden from users' code.
7046 argsv = va_arg(*args,SV*);
7047 eptr = SvPVx(argsv, elen);
7053 if (has_precis && elen > precis)
7063 uv = PTR2UV(va_arg(*args, void*));
7065 uv = (epix ? epix <= svmax : svix < svmax) ?
7066 PTR2UV(svargs[epix ? epix-1 : svix++]) : 0;
7086 iv = (IV)utf8_to_uv(vecstr, veclen, &ulen, 0);
7096 case 'h': iv = (short)va_arg(*args, int); break;
7097 default: iv = va_arg(*args, int); break;
7098 case 'l': iv = va_arg(*args, long); break;
7099 case 'V': iv = va_arg(*args, IV); break;
7101 case 'q': iv = va_arg(*args, Quad_t); break;
7106 iv = (epix ? epix <= svmax : svix < svmax) ?
7107 SvIVx(svargs[epix ? epix-1 : svix++]) : 0;
7109 case 'h': iv = (short)iv; break;
7111 case 'l': iv = (long)iv; break;
7114 case 'q': iv = (Quad_t)iv; break;
7121 esignbuf[esignlen++] = plus;
7125 esignbuf[esignlen++] = '-';
7169 uv = utf8_to_uv(vecstr, veclen, &ulen, 0);
7179 case 'h': uv = (unsigned short)va_arg(*args, unsigned); break;
7180 default: uv = va_arg(*args, unsigned); break;
7181 case 'l': uv = va_arg(*args, unsigned long); break;
7182 case 'V': uv = va_arg(*args, UV); break;
7184 case 'q': uv = va_arg(*args, Quad_t); break;
7189 uv = (epix ? epix <= svmax : svix < svmax) ?
7190 SvUVx(svargs[epix ? epix-1 : svix++]) : 0;
7192 case 'h': uv = (unsigned short)uv; break;
7194 case 'l': uv = (unsigned long)uv; break;
7197 case 'q': uv = (Quad_t)uv; break;
7203 eptr = ebuf + sizeof ebuf;
7209 p = (char*)((c == 'X')
7210 ? "0123456789ABCDEF" : "0123456789abcdef");
7216 esignbuf[esignlen++] = '0';
7217 esignbuf[esignlen++] = c; /* 'x' or 'X' */
7223 *--eptr = '0' + dig;
7225 if (alt && *eptr != '0')
7231 *--eptr = '0' + dig;
7234 esignbuf[esignlen++] = '0';
7235 esignbuf[esignlen++] = 'b';
7238 default: /* it had better be ten or less */
7239 #if defined(PERL_Y2KWARN)
7240 if (ckWARN(WARN_Y2K)) {
7242 char *s = SvPV(sv,n);
7243 if (n >= 2 && s[n-2] == '1' && s[n-1] == '9'
7244 && (n == 2 || !isDIGIT(s[n-3])))
7246 Perl_warner(aTHX_ WARN_Y2K,
7247 "Possible Y2K bug: %%%c %s",
7248 c, "format string following '19'");
7254 *--eptr = '0' + dig;
7255 } while (uv /= base);
7258 elen = (ebuf + sizeof ebuf) - eptr;
7261 zeros = precis - elen;
7262 else if (precis == 0 && elen == 1 && *eptr == '0')
7267 /* FLOATING POINT */
7270 c = 'f'; /* maybe %F isn't supported here */
7276 /* This is evil, but floating point is even more evil */
7280 nv = va_arg(*args, NV);
7282 nv = (epix ? epix <= svmax : svix < svmax) ?
7283 SvNVx(svargs[epix ? epix-1 : svix++]) : 0.0;
7286 if (c != 'e' && c != 'E') {
7288 (void)Perl_frexp(nv, &i);
7289 if (i == PERL_INT_MIN)
7290 Perl_die(aTHX_ "panic: frexp");
7292 need = BIT_DIGITS(i);
7294 need += has_precis ? precis : 6; /* known default */
7298 need += 20; /* fudge factor */
7299 if (PL_efloatsize < need) {
7300 Safefree(PL_efloatbuf);
7301 PL_efloatsize = need + 20; /* more fudge */
7302 New(906, PL_efloatbuf, PL_efloatsize, char);
7303 PL_efloatbuf[0] = '\0';
7306 eptr = ebuf + sizeof ebuf;
7309 #if defined(USE_LONG_DOUBLE) && defined(PERL_PRIfldbl)
7311 /* Copy the one or more characters in a long double
7312 * format before the 'base' ([efgEFG]) character to
7313 * the format string. */
7314 static char const prifldbl[] = PERL_PRIfldbl;
7315 char const *p = prifldbl + sizeof(prifldbl) - 3;
7316 while (p >= prifldbl) { *--eptr = *p--; }
7321 do { *--eptr = '0' + (base % 10); } while (base /= 10);
7326 do { *--eptr = '0' + (base % 10); } while (base /= 10);
7338 /* No taint. Otherwise we are in the strange situation
7339 * where printf() taints but print($float) doesn't.
7341 (void)sprintf(PL_efloatbuf, eptr, nv);
7343 eptr = PL_efloatbuf;
7344 elen = strlen(PL_efloatbuf);
7351 i = SvCUR(sv) - origlen;
7354 case 'h': *(va_arg(*args, short*)) = i; break;
7355 default: *(va_arg(*args, int*)) = i; break;
7356 case 'l': *(va_arg(*args, long*)) = i; break;
7357 case 'V': *(va_arg(*args, IV*)) = i; break;
7359 case 'q': *(va_arg(*args, Quad_t*)) = i; break;
7363 else if (epix ? epix <= svmax : svix < svmax)
7364 sv_setuv_mg(svargs[epix ? epix-1 : svix++], (UV)i);
7365 continue; /* not "break" */
7372 if (!args && ckWARN(WARN_PRINTF) &&
7373 (PL_op->op_type == OP_PRTF || PL_op->op_type == OP_SPRINTF)) {
7374 SV *msg = sv_newmortal();
7375 Perl_sv_setpvf(aTHX_ msg, "Invalid conversion in %s: ",
7376 (PL_op->op_type == OP_PRTF) ? "printf" : "sprintf");
7379 Perl_sv_catpvf(aTHX_ msg,
7380 "\"%%%c\"", c & 0xFF);
7382 Perl_sv_catpvf(aTHX_ msg,
7383 "\"%%\\%03"UVof"\"",
7386 sv_catpv(msg, "end of string");
7387 Perl_warner(aTHX_ WARN_PRINTF, "%"SVf, msg); /* yes, this is reentrant */
7390 /* output mangled stuff ... */
7396 /* ... right here, because formatting flags should not apply */
7397 SvGROW(sv, SvCUR(sv) + elen + 1);
7399 memcpy(p, eptr, elen);
7402 SvCUR(sv) = p - SvPVX(sv);
7403 continue; /* not "break" */
7406 have = esignlen + zeros + elen;
7407 need = (have > width ? have : width);
7410 SvGROW(sv, SvCUR(sv) + need + dotstrlen + 1);
7412 if (esignlen && fill == '0') {
7413 for (i = 0; i < esignlen; i++)
7417 memset(p, fill, gap);
7420 if (esignlen && fill != '0') {
7421 for (i = 0; i < esignlen; i++)
7425 for (i = zeros; i; i--)
7429 memcpy(p, eptr, elen);
7433 memset(p, ' ', gap);
7438 memcpy(p, dotstr, dotstrlen);
7442 vectorize = FALSE; /* done iterating over vecstr */
7447 SvCUR(sv) = p - SvPVX(sv);
7455 #if defined(USE_ITHREADS)
7457 #if defined(USE_THREADS)
7458 # include "error: USE_THREADS and USE_ITHREADS are incompatible"
7461 #ifndef GpREFCNT_inc
7462 # define GpREFCNT_inc(gp) ((gp) ? (++(gp)->gp_refcnt, (gp)) : (GP*)NULL)
7466 #define sv_dup_inc(s) SvREFCNT_inc(sv_dup(s))
7467 #define av_dup(s) (AV*)sv_dup((SV*)s)
7468 #define av_dup_inc(s) (AV*)SvREFCNT_inc(sv_dup((SV*)s))
7469 #define hv_dup(s) (HV*)sv_dup((SV*)s)
7470 #define hv_dup_inc(s) (HV*)SvREFCNT_inc(sv_dup((SV*)s))
7471 #define cv_dup(s) (CV*)sv_dup((SV*)s)
7472 #define cv_dup_inc(s) (CV*)SvREFCNT_inc(sv_dup((SV*)s))
7473 #define io_dup(s) (IO*)sv_dup((SV*)s)
7474 #define io_dup_inc(s) (IO*)SvREFCNT_inc(sv_dup((SV*)s))
7475 #define gv_dup(s) (GV*)sv_dup((SV*)s)
7476 #define gv_dup_inc(s) (GV*)SvREFCNT_inc(sv_dup((SV*)s))
7477 #define SAVEPV(p) (p ? savepv(p) : Nullch)
7478 #define SAVEPVN(p,n) (p ? savepvn(p,n) : Nullch)
7481 Perl_re_dup(pTHX_ REGEXP *r)
7483 /* XXX fix when pmop->op_pmregexp becomes shared */
7484 return ReREFCNT_inc(r);
7488 Perl_fp_dup(pTHX_ PerlIO *fp, char type)
7492 return (PerlIO*)NULL;
7494 /* look for it in the table first */
7495 ret = (PerlIO*)ptr_table_fetch(PL_ptr_table, fp);
7499 /* create anew and remember what it is */
7500 ret = PerlIO_fdupopen(aTHX_ fp);
7501 ptr_table_store(PL_ptr_table, fp, ret);
7506 Perl_dirp_dup(pTHX_ DIR *dp)
7515 Perl_gp_dup(pTHX_ GP *gp)
7520 /* look for it in the table first */
7521 ret = (GP*)ptr_table_fetch(PL_ptr_table, gp);
7525 /* create anew and remember what it is */
7526 Newz(0, ret, 1, GP);
7527 ptr_table_store(PL_ptr_table, gp, ret);
7530 ret->gp_refcnt = 0; /* must be before any other dups! */
7531 ret->gp_sv = sv_dup_inc(gp->gp_sv);
7532 ret->gp_io = io_dup_inc(gp->gp_io);
7533 ret->gp_form = cv_dup_inc(gp->gp_form);
7534 ret->gp_av = av_dup_inc(gp->gp_av);
7535 ret->gp_hv = hv_dup_inc(gp->gp_hv);
7536 ret->gp_egv = gv_dup(gp->gp_egv); /* GvEGV is not refcounted */
7537 ret->gp_cv = cv_dup_inc(gp->gp_cv);
7538 ret->gp_cvgen = gp->gp_cvgen;
7539 ret->gp_flags = gp->gp_flags;
7540 ret->gp_line = gp->gp_line;
7541 ret->gp_file = gp->gp_file; /* points to COP.cop_file */
7546 Perl_mg_dup(pTHX_ MAGIC *mg)
7548 MAGIC *mgret = (MAGIC*)NULL;
7551 return (MAGIC*)NULL;
7552 /* look for it in the table first */
7553 mgret = (MAGIC*)ptr_table_fetch(PL_ptr_table, mg);
7557 for (; mg; mg = mg->mg_moremagic) {
7559 Newz(0, nmg, 1, MAGIC);
7563 mgprev->mg_moremagic = nmg;
7564 nmg->mg_virtual = mg->mg_virtual; /* XXX copy dynamic vtable? */
7565 nmg->mg_private = mg->mg_private;
7566 nmg->mg_type = mg->mg_type;
7567 nmg->mg_flags = mg->mg_flags;
7568 if (mg->mg_type == 'r') {
7569 nmg->mg_obj = (SV*)re_dup((REGEXP*)mg->mg_obj);
7572 nmg->mg_obj = (mg->mg_flags & MGf_REFCOUNTED)
7573 ? sv_dup_inc(mg->mg_obj)
7574 : sv_dup(mg->mg_obj);
7576 nmg->mg_len = mg->mg_len;
7577 nmg->mg_ptr = mg->mg_ptr; /* XXX random ptr? */
7578 if (mg->mg_ptr && mg->mg_type != 'g') {
7579 if (mg->mg_len >= 0) {
7580 nmg->mg_ptr = SAVEPVN(mg->mg_ptr, mg->mg_len);
7581 if (mg->mg_type == 'c' && AMT_AMAGIC((AMT*)mg->mg_ptr)) {
7582 AMT *amtp = (AMT*)mg->mg_ptr;
7583 AMT *namtp = (AMT*)nmg->mg_ptr;
7585 for (i = 1; i < NofAMmeth; i++) {
7586 namtp->table[i] = cv_dup_inc(amtp->table[i]);
7590 else if (mg->mg_len == HEf_SVKEY)
7591 nmg->mg_ptr = (char*)sv_dup_inc((SV*)mg->mg_ptr);
7599 Perl_ptr_table_new(pTHX)
7602 Newz(0, tbl, 1, PTR_TBL_t);
7605 Newz(0, tbl->tbl_ary, tbl->tbl_max + 1, PTR_TBL_ENT_t*);
7610 Perl_ptr_table_fetch(pTHX_ PTR_TBL_t *tbl, void *sv)
7612 PTR_TBL_ENT_t *tblent;
7613 UV hash = PTR2UV(sv);
7615 tblent = tbl->tbl_ary[hash & tbl->tbl_max];
7616 for (; tblent; tblent = tblent->next) {
7617 if (tblent->oldval == sv)
7618 return tblent->newval;
7624 Perl_ptr_table_store(pTHX_ PTR_TBL_t *tbl, void *oldv, void *newv)
7626 PTR_TBL_ENT_t *tblent, **otblent;
7627 /* XXX this may be pessimal on platforms where pointers aren't good
7628 * hash values e.g. if they grow faster in the most significant
7630 UV hash = PTR2UV(oldv);
7634 otblent = &tbl->tbl_ary[hash & tbl->tbl_max];
7635 for (tblent = *otblent; tblent; i=0, tblent = tblent->next) {
7636 if (tblent->oldval == oldv) {
7637 tblent->newval = newv;
7642 Newz(0, tblent, 1, PTR_TBL_ENT_t);
7643 tblent->oldval = oldv;
7644 tblent->newval = newv;
7645 tblent->next = *otblent;
7648 if (i && tbl->tbl_items > tbl->tbl_max)
7649 ptr_table_split(tbl);
7653 Perl_ptr_table_split(pTHX_ PTR_TBL_t *tbl)
7655 PTR_TBL_ENT_t **ary = tbl->tbl_ary;
7656 UV oldsize = tbl->tbl_max + 1;
7657 UV newsize = oldsize * 2;
7660 Renew(ary, newsize, PTR_TBL_ENT_t*);
7661 Zero(&ary[oldsize], newsize-oldsize, PTR_TBL_ENT_t*);
7662 tbl->tbl_max = --newsize;
7664 for (i=0; i < oldsize; i++, ary++) {
7665 PTR_TBL_ENT_t **curentp, **entp, *ent;
7668 curentp = ary + oldsize;
7669 for (entp = ary, ent = *ary; ent; ent = *entp) {
7670 if ((newsize & PTR2UV(ent->oldval)) != i) {
7672 ent->next = *curentp;
7687 Perl_sv_dup(pTHX_ SV *sstr)
7691 if (!sstr || SvTYPE(sstr) == SVTYPEMASK)
7693 /* look for it in the table first */
7694 dstr = (SV*)ptr_table_fetch(PL_ptr_table, sstr);
7698 /* create anew and remember what it is */
7700 ptr_table_store(PL_ptr_table, sstr, dstr);
7703 SvFLAGS(dstr) = SvFLAGS(sstr);
7704 SvFLAGS(dstr) &= ~SVf_OOK; /* don't propagate OOK hack */
7705 SvREFCNT(dstr) = 0; /* must be before any other dups! */
7708 if (SvANY(sstr) && PL_watch_pvx && SvPVX(sstr) == PL_watch_pvx)
7709 PerlIO_printf(Perl_debug_log, "watch at %p hit, found string \"%s\"\n",
7710 PL_watch_pvx, SvPVX(sstr));
7713 switch (SvTYPE(sstr)) {
7718 SvANY(dstr) = new_XIV();
7719 SvIVX(dstr) = SvIVX(sstr);
7722 SvANY(dstr) = new_XNV();
7723 SvNVX(dstr) = SvNVX(sstr);
7726 SvANY(dstr) = new_XRV();
7727 SvRV(dstr) = sv_dup_inc(SvRV(sstr));
7730 SvANY(dstr) = new_XPV();
7731 SvCUR(dstr) = SvCUR(sstr);
7732 SvLEN(dstr) = SvLEN(sstr);
7734 SvRV(dstr) = sv_dup_inc(SvRV(sstr));
7735 else if (SvPVX(sstr) && SvLEN(sstr))
7736 SvPVX(dstr) = SAVEPVN(SvPVX(sstr), SvLEN(sstr)-1);
7738 SvPVX(dstr) = SvPVX(sstr); /* XXX shared string/random ptr? */
7741 SvANY(dstr) = new_XPVIV();
7742 SvCUR(dstr) = SvCUR(sstr);
7743 SvLEN(dstr) = SvLEN(sstr);
7744 SvIVX(dstr) = SvIVX(sstr);
7746 SvRV(dstr) = sv_dup_inc(SvRV(sstr));
7747 else if (SvPVX(sstr) && SvLEN(sstr))
7748 SvPVX(dstr) = SAVEPVN(SvPVX(sstr), SvLEN(sstr)-1);
7750 SvPVX(dstr) = SvPVX(sstr); /* XXX shared string/random ptr? */
7753 SvANY(dstr) = new_XPVNV();
7754 SvCUR(dstr) = SvCUR(sstr);
7755 SvLEN(dstr) = SvLEN(sstr);
7756 SvIVX(dstr) = SvIVX(sstr);
7757 SvNVX(dstr) = SvNVX(sstr);
7759 SvRV(dstr) = sv_dup_inc(SvRV(sstr));
7760 else if (SvPVX(sstr) && SvLEN(sstr))
7761 SvPVX(dstr) = SAVEPVN(SvPVX(sstr), SvLEN(sstr)-1);
7763 SvPVX(dstr) = SvPVX(sstr); /* XXX shared string/random ptr? */
7766 SvANY(dstr) = new_XPVMG();
7767 SvCUR(dstr) = SvCUR(sstr);
7768 SvLEN(dstr) = SvLEN(sstr);
7769 SvIVX(dstr) = SvIVX(sstr);
7770 SvNVX(dstr) = SvNVX(sstr);
7771 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr));
7772 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr));
7774 SvRV(dstr) = sv_dup_inc(SvRV(sstr));
7775 else if (SvPVX(sstr) && SvLEN(sstr))
7776 SvPVX(dstr) = SAVEPVN(SvPVX(sstr), SvLEN(sstr)-1);
7778 SvPVX(dstr) = SvPVX(sstr); /* XXX shared string/random ptr? */
7781 SvANY(dstr) = new_XPVBM();
7782 SvCUR(dstr) = SvCUR(sstr);
7783 SvLEN(dstr) = SvLEN(sstr);
7784 SvIVX(dstr) = SvIVX(sstr);
7785 SvNVX(dstr) = SvNVX(sstr);
7786 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr));
7787 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr));
7789 SvRV(dstr) = sv_dup_inc(SvRV(sstr));
7790 else if (SvPVX(sstr) && SvLEN(sstr))
7791 SvPVX(dstr) = SAVEPVN(SvPVX(sstr), SvLEN(sstr)-1);
7793 SvPVX(dstr) = SvPVX(sstr); /* XXX shared string/random ptr? */
7794 BmRARE(dstr) = BmRARE(sstr);
7795 BmUSEFUL(dstr) = BmUSEFUL(sstr);
7796 BmPREVIOUS(dstr)= BmPREVIOUS(sstr);
7799 SvANY(dstr) = new_XPVLV();
7800 SvCUR(dstr) = SvCUR(sstr);
7801 SvLEN(dstr) = SvLEN(sstr);
7802 SvIVX(dstr) = SvIVX(sstr);
7803 SvNVX(dstr) = SvNVX(sstr);
7804 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr));
7805 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr));
7807 SvRV(dstr) = sv_dup_inc(SvRV(sstr));
7808 else if (SvPVX(sstr) && SvLEN(sstr))
7809 SvPVX(dstr) = SAVEPVN(SvPVX(sstr), SvLEN(sstr)-1);
7811 SvPVX(dstr) = SvPVX(sstr); /* XXX shared string/random ptr? */
7812 LvTARGOFF(dstr) = LvTARGOFF(sstr); /* XXX sometimes holds PMOP* when DEBUGGING */
7813 LvTARGLEN(dstr) = LvTARGLEN(sstr);
7814 LvTARG(dstr) = sv_dup_inc(LvTARG(sstr));
7815 LvTYPE(dstr) = LvTYPE(sstr);
7818 SvANY(dstr) = new_XPVGV();
7819 SvCUR(dstr) = SvCUR(sstr);
7820 SvLEN(dstr) = SvLEN(sstr);
7821 SvIVX(dstr) = SvIVX(sstr);
7822 SvNVX(dstr) = SvNVX(sstr);
7823 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr));
7824 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr));
7826 SvRV(dstr) = sv_dup_inc(SvRV(sstr));
7827 else if (SvPVX(sstr) && SvLEN(sstr))
7828 SvPVX(dstr) = SAVEPVN(SvPVX(sstr), SvLEN(sstr)-1);
7830 SvPVX(dstr) = SvPVX(sstr); /* XXX shared string/random ptr? */
7831 GvNAMELEN(dstr) = GvNAMELEN(sstr);
7832 GvNAME(dstr) = SAVEPVN(GvNAME(sstr), GvNAMELEN(sstr));
7833 GvSTASH(dstr) = hv_dup_inc(GvSTASH(sstr));
7834 GvFLAGS(dstr) = GvFLAGS(sstr);
7835 GvGP(dstr) = gp_dup(GvGP(sstr));
7836 (void)GpREFCNT_inc(GvGP(dstr));
7839 SvANY(dstr) = new_XPVIO();
7840 SvCUR(dstr) = SvCUR(sstr);
7841 SvLEN(dstr) = SvLEN(sstr);
7842 SvIVX(dstr) = SvIVX(sstr);
7843 SvNVX(dstr) = SvNVX(sstr);
7844 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr));
7845 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr));
7847 SvRV(dstr) = sv_dup_inc(SvRV(sstr));
7848 else if (SvPVX(sstr) && SvLEN(sstr))
7849 SvPVX(dstr) = SAVEPVN(SvPVX(sstr), SvLEN(sstr)-1);
7851 SvPVX(dstr) = SvPVX(sstr); /* XXX shared string/random ptr? */
7852 IoIFP(dstr) = fp_dup(IoIFP(sstr), IoTYPE(sstr));
7853 if (IoOFP(sstr) == IoIFP(sstr))
7854 IoOFP(dstr) = IoIFP(dstr);
7856 IoOFP(dstr) = fp_dup(IoOFP(sstr), IoTYPE(sstr));
7857 /* PL_rsfp_filters entries have fake IoDIRP() */
7858 if (IoDIRP(sstr) && !(IoFLAGS(sstr) & IOf_FAKE_DIRP))
7859 IoDIRP(dstr) = dirp_dup(IoDIRP(sstr));
7861 IoDIRP(dstr) = IoDIRP(sstr);
7862 IoLINES(dstr) = IoLINES(sstr);
7863 IoPAGE(dstr) = IoPAGE(sstr);
7864 IoPAGE_LEN(dstr) = IoPAGE_LEN(sstr);
7865 IoLINES_LEFT(dstr) = IoLINES_LEFT(sstr);
7866 IoTOP_NAME(dstr) = SAVEPV(IoTOP_NAME(sstr));
7867 IoTOP_GV(dstr) = gv_dup(IoTOP_GV(sstr));
7868 IoFMT_NAME(dstr) = SAVEPV(IoFMT_NAME(sstr));
7869 IoFMT_GV(dstr) = gv_dup(IoFMT_GV(sstr));
7870 IoBOTTOM_NAME(dstr) = SAVEPV(IoBOTTOM_NAME(sstr));
7871 IoBOTTOM_GV(dstr) = gv_dup(IoBOTTOM_GV(sstr));
7872 IoSUBPROCESS(dstr) = IoSUBPROCESS(sstr);
7873 IoTYPE(dstr) = IoTYPE(sstr);
7874 IoFLAGS(dstr) = IoFLAGS(sstr);
7877 SvANY(dstr) = new_XPVAV();
7878 SvCUR(dstr) = SvCUR(sstr);
7879 SvLEN(dstr) = SvLEN(sstr);
7880 SvIVX(dstr) = SvIVX(sstr);
7881 SvNVX(dstr) = SvNVX(sstr);
7882 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr));
7883 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr));
7884 AvARYLEN((AV*)dstr) = sv_dup_inc(AvARYLEN((AV*)sstr));
7885 AvFLAGS((AV*)dstr) = AvFLAGS((AV*)sstr);
7886 if (AvARRAY((AV*)sstr)) {
7887 SV **dst_ary, **src_ary;
7888 SSize_t items = AvFILLp((AV*)sstr) + 1;
7890 src_ary = AvARRAY((AV*)sstr);
7891 Newz(0, dst_ary, AvMAX((AV*)sstr)+1, SV*);
7892 ptr_table_store(PL_ptr_table, src_ary, dst_ary);
7893 SvPVX(dstr) = (char*)dst_ary;
7894 AvALLOC((AV*)dstr) = dst_ary;
7895 if (AvREAL((AV*)sstr)) {
7897 *dst_ary++ = sv_dup_inc(*src_ary++);
7901 *dst_ary++ = sv_dup(*src_ary++);
7903 items = AvMAX((AV*)sstr) - AvFILLp((AV*)sstr);
7904 while (items-- > 0) {
7905 *dst_ary++ = &PL_sv_undef;
7909 SvPVX(dstr) = Nullch;
7910 AvALLOC((AV*)dstr) = (SV**)NULL;
7914 SvANY(dstr) = new_XPVHV();
7915 SvCUR(dstr) = SvCUR(sstr);
7916 SvLEN(dstr) = SvLEN(sstr);
7917 SvIVX(dstr) = SvIVX(sstr);
7918 SvNVX(dstr) = SvNVX(sstr);
7919 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr));
7920 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr));
7921 HvRITER((HV*)dstr) = HvRITER((HV*)sstr);
7922 if (HvARRAY((HV*)sstr)) {
7924 XPVHV *dxhv = (XPVHV*)SvANY(dstr);
7925 XPVHV *sxhv = (XPVHV*)SvANY(sstr);
7926 Newz(0, dxhv->xhv_array,
7927 PERL_HV_ARRAY_ALLOC_BYTES(dxhv->xhv_max+1), char);
7928 while (i <= sxhv->xhv_max) {
7929 ((HE**)dxhv->xhv_array)[i] = he_dup(((HE**)sxhv->xhv_array)[i],
7930 !!HvSHAREKEYS(sstr));
7933 dxhv->xhv_eiter = he_dup(sxhv->xhv_eiter, !!HvSHAREKEYS(sstr));
7936 SvPVX(dstr) = Nullch;
7937 HvEITER((HV*)dstr) = (HE*)NULL;
7939 HvPMROOT((HV*)dstr) = HvPMROOT((HV*)sstr); /* XXX */
7940 HvNAME((HV*)dstr) = SAVEPV(HvNAME((HV*)sstr));
7943 SvANY(dstr) = new_XPVFM();
7944 FmLINES(dstr) = FmLINES(sstr);
7948 SvANY(dstr) = new_XPVCV();
7950 SvCUR(dstr) = SvCUR(sstr);
7951 SvLEN(dstr) = SvLEN(sstr);
7952 SvIVX(dstr) = SvIVX(sstr);
7953 SvNVX(dstr) = SvNVX(sstr);
7954 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr));
7955 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr));
7956 if (SvPVX(sstr) && SvLEN(sstr))
7957 SvPVX(dstr) = SAVEPVN(SvPVX(sstr), SvLEN(sstr)-1);
7959 SvPVX(dstr) = SvPVX(sstr); /* XXX shared string/random ptr? */
7960 CvSTASH(dstr) = hv_dup(CvSTASH(sstr));/* NOTE: not refcounted */
7961 CvSTART(dstr) = CvSTART(sstr);
7962 CvROOT(dstr) = OpREFCNT_inc(CvROOT(sstr));
7963 CvXSUB(dstr) = CvXSUB(sstr);
7964 CvXSUBANY(dstr) = CvXSUBANY(sstr);
7965 CvGV(dstr) = gv_dup_inc(CvGV(sstr));
7966 CvDEPTH(dstr) = CvDEPTH(sstr);
7967 if (CvPADLIST(sstr) && !AvREAL(CvPADLIST(sstr))) {
7968 /* XXX padlists are real, but pretend to be not */
7969 AvREAL_on(CvPADLIST(sstr));
7970 CvPADLIST(dstr) = av_dup_inc(CvPADLIST(sstr));
7971 AvREAL_off(CvPADLIST(sstr));
7972 AvREAL_off(CvPADLIST(dstr));
7975 CvPADLIST(dstr) = av_dup_inc(CvPADLIST(sstr));
7976 CvOUTSIDE(dstr) = cv_dup_inc(CvOUTSIDE(sstr));
7977 CvFLAGS(dstr) = CvFLAGS(sstr);
7980 Perl_croak(aTHX_ "Bizarre SvTYPE [%d]", SvTYPE(sstr));
7984 if (SvOBJECT(dstr) && SvTYPE(dstr) != SVt_PVIO)
7991 Perl_cx_dup(pTHX_ PERL_CONTEXT *cxs, I32 ix, I32 max)
7996 return (PERL_CONTEXT*)NULL;
7998 /* look for it in the table first */
7999 ncxs = (PERL_CONTEXT*)ptr_table_fetch(PL_ptr_table, cxs);
8003 /* create anew and remember what it is */
8004 Newz(56, ncxs, max + 1, PERL_CONTEXT);
8005 ptr_table_store(PL_ptr_table, cxs, ncxs);
8008 PERL_CONTEXT *cx = &cxs[ix];
8009 PERL_CONTEXT *ncx = &ncxs[ix];
8010 ncx->cx_type = cx->cx_type;
8011 if (CxTYPE(cx) == CXt_SUBST) {
8012 Perl_croak(aTHX_ "Cloning substitution context is unimplemented");
8015 ncx->blk_oldsp = cx->blk_oldsp;
8016 ncx->blk_oldcop = cx->blk_oldcop;
8017 ncx->blk_oldretsp = cx->blk_oldretsp;
8018 ncx->blk_oldmarksp = cx->blk_oldmarksp;
8019 ncx->blk_oldscopesp = cx->blk_oldscopesp;
8020 ncx->blk_oldpm = cx->blk_oldpm;
8021 ncx->blk_gimme = cx->blk_gimme;
8022 switch (CxTYPE(cx)) {
8024 ncx->blk_sub.cv = (cx->blk_sub.olddepth == 0
8025 ? cv_dup_inc(cx->blk_sub.cv)
8026 : cv_dup(cx->blk_sub.cv));
8027 ncx->blk_sub.argarray = (cx->blk_sub.hasargs
8028 ? av_dup_inc(cx->blk_sub.argarray)
8030 ncx->blk_sub.savearray = av_dup(cx->blk_sub.savearray);
8031 ncx->blk_sub.olddepth = cx->blk_sub.olddepth;
8032 ncx->blk_sub.hasargs = cx->blk_sub.hasargs;
8033 ncx->blk_sub.lval = cx->blk_sub.lval;
8036 ncx->blk_eval.old_in_eval = cx->blk_eval.old_in_eval;
8037 ncx->blk_eval.old_op_type = cx->blk_eval.old_op_type;
8038 ncx->blk_eval.old_namesv = sv_dup_inc(cx->blk_eval.old_namesv);
8039 ncx->blk_eval.old_eval_root = cx->blk_eval.old_eval_root;
8040 ncx->blk_eval.cur_text = sv_dup(cx->blk_eval.cur_text);
8043 ncx->blk_loop.label = cx->blk_loop.label;
8044 ncx->blk_loop.resetsp = cx->blk_loop.resetsp;
8045 ncx->blk_loop.redo_op = cx->blk_loop.redo_op;
8046 ncx->blk_loop.next_op = cx->blk_loop.next_op;
8047 ncx->blk_loop.last_op = cx->blk_loop.last_op;
8048 ncx->blk_loop.iterdata = (CxPADLOOP(cx)
8049 ? cx->blk_loop.iterdata
8050 : gv_dup((GV*)cx->blk_loop.iterdata));
8051 ncx->blk_loop.oldcurpad
8052 = (SV**)ptr_table_fetch(PL_ptr_table,
8053 cx->blk_loop.oldcurpad);
8054 ncx->blk_loop.itersave = sv_dup_inc(cx->blk_loop.itersave);
8055 ncx->blk_loop.iterlval = sv_dup_inc(cx->blk_loop.iterlval);
8056 ncx->blk_loop.iterary = av_dup_inc(cx->blk_loop.iterary);
8057 ncx->blk_loop.iterix = cx->blk_loop.iterix;
8058 ncx->blk_loop.itermax = cx->blk_loop.itermax;
8061 ncx->blk_sub.cv = cv_dup(cx->blk_sub.cv);
8062 ncx->blk_sub.gv = gv_dup(cx->blk_sub.gv);
8063 ncx->blk_sub.dfoutgv = gv_dup_inc(cx->blk_sub.dfoutgv);
8064 ncx->blk_sub.hasargs = cx->blk_sub.hasargs;
8077 Perl_si_dup(pTHX_ PERL_SI *si)
8082 return (PERL_SI*)NULL;
8084 /* look for it in the table first */
8085 nsi = (PERL_SI*)ptr_table_fetch(PL_ptr_table, si);
8089 /* create anew and remember what it is */
8090 Newz(56, nsi, 1, PERL_SI);
8091 ptr_table_store(PL_ptr_table, si, nsi);
8093 nsi->si_stack = av_dup_inc(si->si_stack);
8094 nsi->si_cxix = si->si_cxix;
8095 nsi->si_cxmax = si->si_cxmax;
8096 nsi->si_cxstack = cx_dup(si->si_cxstack, si->si_cxix, si->si_cxmax);
8097 nsi->si_type = si->si_type;
8098 nsi->si_prev = si_dup(si->si_prev);
8099 nsi->si_next = si_dup(si->si_next);
8100 nsi->si_markoff = si->si_markoff;
8105 #define POPINT(ss,ix) ((ss)[--(ix)].any_i32)
8106 #define TOPINT(ss,ix) ((ss)[ix].any_i32)
8107 #define POPLONG(ss,ix) ((ss)[--(ix)].any_long)
8108 #define TOPLONG(ss,ix) ((ss)[ix].any_long)
8109 #define POPIV(ss,ix) ((ss)[--(ix)].any_iv)
8110 #define TOPIV(ss,ix) ((ss)[ix].any_iv)
8111 #define POPPTR(ss,ix) ((ss)[--(ix)].any_ptr)
8112 #define TOPPTR(ss,ix) ((ss)[ix].any_ptr)
8113 #define POPDPTR(ss,ix) ((ss)[--(ix)].any_dptr)
8114 #define TOPDPTR(ss,ix) ((ss)[ix].any_dptr)
8115 #define POPDXPTR(ss,ix) ((ss)[--(ix)].any_dxptr)
8116 #define TOPDXPTR(ss,ix) ((ss)[ix].any_dxptr)
8119 #define pv_dup_inc(p) SAVEPV(p)
8120 #define pv_dup(p) SAVEPV(p)
8121 #define svp_dup_inc(p,pp) any_dup(p,pp)
8124 Perl_any_dup(pTHX_ void *v, PerlInterpreter *proto_perl)
8131 /* look for it in the table first */
8132 ret = ptr_table_fetch(PL_ptr_table, v);
8136 /* see if it is part of the interpreter structure */
8137 if (v >= (void*)proto_perl && v < (void*)(proto_perl+1))
8138 ret = (void*)(((char*)aTHXo) + (((char*)v) - (char*)proto_perl));
8146 Perl_ss_dup(pTHX_ PerlInterpreter *proto_perl)
8148 ANY *ss = proto_perl->Tsavestack;
8149 I32 ix = proto_perl->Tsavestack_ix;
8150 I32 max = proto_perl->Tsavestack_max;
8163 void (*dptr) (void*);
8164 void (*dxptr) (pTHXo_ void*);
8167 Newz(54, nss, max, ANY);
8173 case SAVEt_ITEM: /* normal string */
8174 sv = (SV*)POPPTR(ss,ix);
8175 TOPPTR(nss,ix) = sv_dup_inc(sv);
8176 sv = (SV*)POPPTR(ss,ix);
8177 TOPPTR(nss,ix) = sv_dup_inc(sv);
8179 case SAVEt_SV: /* scalar reference */
8180 sv = (SV*)POPPTR(ss,ix);
8181 TOPPTR(nss,ix) = sv_dup_inc(sv);
8182 gv = (GV*)POPPTR(ss,ix);
8183 TOPPTR(nss,ix) = gv_dup_inc(gv);
8185 case SAVEt_GENERIC_PVREF: /* generic char* */
8186 c = (char*)POPPTR(ss,ix);
8187 TOPPTR(nss,ix) = pv_dup(c);
8188 ptr = POPPTR(ss,ix);
8189 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
8191 case SAVEt_GENERIC_SVREF: /* generic sv */
8192 case SAVEt_SVREF: /* scalar reference */
8193 sv = (SV*)POPPTR(ss,ix);
8194 TOPPTR(nss,ix) = sv_dup_inc(sv);
8195 ptr = POPPTR(ss,ix);
8196 TOPPTR(nss,ix) = svp_dup_inc((SV**)ptr, proto_perl);/* XXXXX */
8198 case SAVEt_AV: /* array reference */
8199 av = (AV*)POPPTR(ss,ix);
8200 TOPPTR(nss,ix) = av_dup_inc(av);
8201 gv = (GV*)POPPTR(ss,ix);
8202 TOPPTR(nss,ix) = gv_dup(gv);
8204 case SAVEt_HV: /* hash reference */
8205 hv = (HV*)POPPTR(ss,ix);
8206 TOPPTR(nss,ix) = hv_dup_inc(hv);
8207 gv = (GV*)POPPTR(ss,ix);
8208 TOPPTR(nss,ix) = gv_dup(gv);
8210 case SAVEt_INT: /* int reference */
8211 ptr = POPPTR(ss,ix);
8212 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
8213 intval = (int)POPINT(ss,ix);
8214 TOPINT(nss,ix) = intval;
8216 case SAVEt_LONG: /* long reference */
8217 ptr = POPPTR(ss,ix);
8218 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
8219 longval = (long)POPLONG(ss,ix);
8220 TOPLONG(nss,ix) = longval;
8222 case SAVEt_I32: /* I32 reference */
8223 case SAVEt_I16: /* I16 reference */
8224 case SAVEt_I8: /* I8 reference */
8225 ptr = POPPTR(ss,ix);
8226 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
8230 case SAVEt_IV: /* IV reference */
8231 ptr = POPPTR(ss,ix);
8232 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
8236 case SAVEt_SPTR: /* SV* reference */
8237 ptr = POPPTR(ss,ix);
8238 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
8239 sv = (SV*)POPPTR(ss,ix);
8240 TOPPTR(nss,ix) = sv_dup(sv);
8242 case SAVEt_VPTR: /* random* reference */
8243 ptr = POPPTR(ss,ix);
8244 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
8245 ptr = POPPTR(ss,ix);
8246 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
8248 case SAVEt_PPTR: /* char* reference */
8249 ptr = POPPTR(ss,ix);
8250 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
8251 c = (char*)POPPTR(ss,ix);
8252 TOPPTR(nss,ix) = pv_dup(c);
8254 case SAVEt_HPTR: /* HV* reference */
8255 ptr = POPPTR(ss,ix);
8256 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
8257 hv = (HV*)POPPTR(ss,ix);
8258 TOPPTR(nss,ix) = hv_dup(hv);
8260 case SAVEt_APTR: /* AV* reference */
8261 ptr = POPPTR(ss,ix);
8262 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
8263 av = (AV*)POPPTR(ss,ix);
8264 TOPPTR(nss,ix) = av_dup(av);
8267 gv = (GV*)POPPTR(ss,ix);
8268 TOPPTR(nss,ix) = gv_dup(gv);
8270 case SAVEt_GP: /* scalar reference */
8271 gp = (GP*)POPPTR(ss,ix);
8272 TOPPTR(nss,ix) = gp = gp_dup(gp);
8273 (void)GpREFCNT_inc(gp);
8274 gv = (GV*)POPPTR(ss,ix);
8275 TOPPTR(nss,ix) = gv_dup_inc(c);
8276 c = (char*)POPPTR(ss,ix);
8277 TOPPTR(nss,ix) = pv_dup(c);
8284 sv = (SV*)POPPTR(ss,ix);
8285 TOPPTR(nss,ix) = sv_dup_inc(sv);
8288 ptr = POPPTR(ss,ix);
8289 if (ptr && (((OP*)ptr)->op_private & OPpREFCOUNTED)) {
8290 /* these are assumed to be refcounted properly */
8291 switch (((OP*)ptr)->op_type) {
8298 TOPPTR(nss,ix) = ptr;
8303 TOPPTR(nss,ix) = Nullop;
8308 TOPPTR(nss,ix) = Nullop;
8311 c = (char*)POPPTR(ss,ix);
8312 TOPPTR(nss,ix) = pv_dup_inc(c);
8315 longval = POPLONG(ss,ix);
8316 TOPLONG(nss,ix) = longval;
8319 hv = (HV*)POPPTR(ss,ix);
8320 TOPPTR(nss,ix) = hv_dup_inc(hv);
8321 c = (char*)POPPTR(ss,ix);
8322 TOPPTR(nss,ix) = pv_dup_inc(c);
8326 case SAVEt_DESTRUCTOR:
8327 ptr = POPPTR(ss,ix);
8328 TOPPTR(nss,ix) = any_dup(ptr, proto_perl); /* XXX quite arbitrary */
8329 dptr = POPDPTR(ss,ix);
8330 TOPDPTR(nss,ix) = (void (*)(void*))any_dup((void *)dptr, proto_perl);
8332 case SAVEt_DESTRUCTOR_X:
8333 ptr = POPPTR(ss,ix);
8334 TOPPTR(nss,ix) = any_dup(ptr, proto_perl); /* XXX quite arbitrary */
8335 dxptr = POPDXPTR(ss,ix);
8336 TOPDXPTR(nss,ix) = (void (*)(pTHXo_ void*))any_dup((void *)dxptr, proto_perl);
8338 case SAVEt_REGCONTEXT:
8344 case SAVEt_STACK_POS: /* Position on Perl stack */
8348 case SAVEt_AELEM: /* array element */
8349 sv = (SV*)POPPTR(ss,ix);
8350 TOPPTR(nss,ix) = sv_dup_inc(sv);
8353 av = (AV*)POPPTR(ss,ix);
8354 TOPPTR(nss,ix) = av_dup_inc(av);
8356 case SAVEt_HELEM: /* hash element */
8357 sv = (SV*)POPPTR(ss,ix);
8358 TOPPTR(nss,ix) = sv_dup_inc(sv);
8359 sv = (SV*)POPPTR(ss,ix);
8360 TOPPTR(nss,ix) = sv_dup_inc(sv);
8361 hv = (HV*)POPPTR(ss,ix);
8362 TOPPTR(nss,ix) = hv_dup_inc(hv);
8365 ptr = POPPTR(ss,ix);
8366 TOPPTR(nss,ix) = ptr;
8373 av = (AV*)POPPTR(ss,ix);
8374 TOPPTR(nss,ix) = av_dup(av);
8377 longval = (long)POPLONG(ss,ix);
8378 TOPLONG(nss,ix) = longval;
8379 ptr = POPPTR(ss,ix);
8380 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
8381 sv = (SV*)POPPTR(ss,ix);
8382 TOPPTR(nss,ix) = sv_dup(sv);
8385 Perl_croak(aTHX_ "panic: ss_dup inconsistency");
8397 perl_clone(PerlInterpreter *proto_perl, UV flags)
8400 CPerlObj *pPerl = (CPerlObj*)proto_perl;
8403 #ifdef PERL_IMPLICIT_SYS
8404 return perl_clone_using(proto_perl, flags,
8406 proto_perl->IMemShared,
8407 proto_perl->IMemParse,
8417 perl_clone_using(PerlInterpreter *proto_perl, UV flags,
8418 struct IPerlMem* ipM, struct IPerlMem* ipMS,
8419 struct IPerlMem* ipMP, struct IPerlEnv* ipE,
8420 struct IPerlStdIO* ipStd, struct IPerlLIO* ipLIO,
8421 struct IPerlDir* ipD, struct IPerlSock* ipS,
8422 struct IPerlProc* ipP)
8424 /* XXX many of the string copies here can be optimized if they're
8425 * constants; they need to be allocated as common memory and just
8426 * their pointers copied. */
8430 CPerlObj *pPerl = new(ipM) CPerlObj(ipM, ipMS, ipMP, ipE, ipStd, ipLIO,
8432 PERL_SET_THX(pPerl);
8433 # else /* !PERL_OBJECT */
8434 PerlInterpreter *my_perl = (PerlInterpreter*)(*ipM->pMalloc)(ipM, sizeof(PerlInterpreter));
8435 PERL_SET_THX(my_perl);
8438 memset(my_perl, 0xab, sizeof(PerlInterpreter));
8443 # else /* !DEBUGGING */
8444 Zero(my_perl, 1, PerlInterpreter);
8445 # endif /* DEBUGGING */
8449 PL_MemShared = ipMS;
8457 # endif /* PERL_OBJECT */
8458 #else /* !PERL_IMPLICIT_SYS */
8460 PerlInterpreter *my_perl = (PerlInterpreter*)PerlMem_malloc(sizeof(PerlInterpreter));
8461 PERL_SET_THX(my_perl);
8464 memset(my_perl, 0xab, sizeof(PerlInterpreter));
8469 # else /* !DEBUGGING */
8470 Zero(my_perl, 1, PerlInterpreter);
8471 # endif /* DEBUGGING */
8472 #endif /* PERL_IMPLICIT_SYS */
8475 PL_xiv_arenaroot = NULL;
8477 PL_xnv_arenaroot = NULL;
8479 PL_xrv_arenaroot = NULL;
8481 PL_xpv_arenaroot = NULL;
8483 PL_xpviv_arenaroot = NULL;
8484 PL_xpviv_root = NULL;
8485 PL_xpvnv_arenaroot = NULL;
8486 PL_xpvnv_root = NULL;
8487 PL_xpvcv_arenaroot = NULL;
8488 PL_xpvcv_root = NULL;
8489 PL_xpvav_arenaroot = NULL;
8490 PL_xpvav_root = NULL;
8491 PL_xpvhv_arenaroot = NULL;
8492 PL_xpvhv_root = NULL;
8493 PL_xpvmg_arenaroot = NULL;
8494 PL_xpvmg_root = NULL;
8495 PL_xpvlv_arenaroot = NULL;
8496 PL_xpvlv_root = NULL;
8497 PL_xpvbm_arenaroot = NULL;
8498 PL_xpvbm_root = NULL;
8499 PL_he_arenaroot = NULL;
8501 PL_nice_chunk = NULL;
8502 PL_nice_chunk_size = 0;
8505 PL_sv_root = Nullsv;
8506 PL_sv_arenaroot = Nullsv;
8508 PL_debug = proto_perl->Idebug;
8510 /* create SV map for pointer relocation */
8511 PL_ptr_table = ptr_table_new();
8513 /* initialize these special pointers as early as possible */
8514 SvANY(&PL_sv_undef) = NULL;
8515 SvREFCNT(&PL_sv_undef) = (~(U32)0)/2;
8516 SvFLAGS(&PL_sv_undef) = SVf_READONLY|SVt_NULL;
8517 ptr_table_store(PL_ptr_table, &proto_perl->Isv_undef, &PL_sv_undef);
8520 SvUPGRADE(&PL_sv_no, SVt_PVNV);
8522 SvANY(&PL_sv_no) = new_XPVNV();
8524 SvREFCNT(&PL_sv_no) = (~(U32)0)/2;
8525 SvFLAGS(&PL_sv_no) = SVp_NOK|SVf_NOK|SVp_POK|SVf_POK|SVf_READONLY|SVt_PVNV;
8526 SvPVX(&PL_sv_no) = SAVEPVN(PL_No, 0);
8527 SvCUR(&PL_sv_no) = 0;
8528 SvLEN(&PL_sv_no) = 1;
8529 SvNVX(&PL_sv_no) = 0;
8530 ptr_table_store(PL_ptr_table, &proto_perl->Isv_no, &PL_sv_no);
8533 SvUPGRADE(&PL_sv_yes, SVt_PVNV);
8535 SvANY(&PL_sv_yes) = new_XPVNV();
8537 SvREFCNT(&PL_sv_yes) = (~(U32)0)/2;
8538 SvFLAGS(&PL_sv_yes) = SVp_NOK|SVf_NOK|SVp_POK|SVf_POK|SVf_READONLY|SVt_PVNV;
8539 SvPVX(&PL_sv_yes) = SAVEPVN(PL_Yes, 1);
8540 SvCUR(&PL_sv_yes) = 1;
8541 SvLEN(&PL_sv_yes) = 2;
8542 SvNVX(&PL_sv_yes) = 1;
8543 ptr_table_store(PL_ptr_table, &proto_perl->Isv_yes, &PL_sv_yes);
8545 /* create shared string table */
8546 PL_strtab = newHV();
8547 HvSHAREKEYS_off(PL_strtab);
8548 hv_ksplit(PL_strtab, 512);
8549 ptr_table_store(PL_ptr_table, proto_perl->Istrtab, PL_strtab);
8551 PL_compiling = proto_perl->Icompiling;
8552 PL_compiling.cop_stashpv = SAVEPV(PL_compiling.cop_stashpv);
8553 PL_compiling.cop_file = SAVEPV(PL_compiling.cop_file);
8554 ptr_table_store(PL_ptr_table, &proto_perl->Icompiling, &PL_compiling);
8555 if (!specialWARN(PL_compiling.cop_warnings))
8556 PL_compiling.cop_warnings = sv_dup_inc(PL_compiling.cop_warnings);
8557 if (!specialCopIO(PL_compiling.cop_io))
8558 PL_compiling.cop_io = sv_dup_inc(PL_compiling.cop_io);
8559 PL_curcop = (COP*)any_dup(proto_perl->Tcurcop, proto_perl);
8561 /* pseudo environmental stuff */
8562 PL_origargc = proto_perl->Iorigargc;
8564 New(0, PL_origargv, i+1, char*);
8565 PL_origargv[i] = '\0';
8567 PL_origargv[i] = SAVEPV(proto_perl->Iorigargv[i]);
8569 PL_envgv = gv_dup(proto_perl->Ienvgv);
8570 PL_incgv = gv_dup(proto_perl->Iincgv);
8571 PL_hintgv = gv_dup(proto_perl->Ihintgv);
8572 PL_origfilename = SAVEPV(proto_perl->Iorigfilename);
8573 PL_diehook = sv_dup_inc(proto_perl->Idiehook);
8574 PL_warnhook = sv_dup_inc(proto_perl->Iwarnhook);
8577 PL_minus_c = proto_perl->Iminus_c;
8578 PL_patchlevel = sv_dup_inc(proto_perl->Ipatchlevel);
8579 PL_localpatches = proto_perl->Ilocalpatches;
8580 PL_splitstr = proto_perl->Isplitstr;
8581 PL_preprocess = proto_perl->Ipreprocess;
8582 PL_minus_n = proto_perl->Iminus_n;
8583 PL_minus_p = proto_perl->Iminus_p;
8584 PL_minus_l = proto_perl->Iminus_l;
8585 PL_minus_a = proto_perl->Iminus_a;
8586 PL_minus_F = proto_perl->Iminus_F;
8587 PL_doswitches = proto_perl->Idoswitches;
8588 PL_dowarn = proto_perl->Idowarn;
8589 PL_doextract = proto_perl->Idoextract;
8590 PL_sawampersand = proto_perl->Isawampersand;
8591 PL_unsafe = proto_perl->Iunsafe;
8592 PL_inplace = SAVEPV(proto_perl->Iinplace);
8593 PL_e_script = sv_dup_inc(proto_perl->Ie_script);
8594 PL_perldb = proto_perl->Iperldb;
8595 PL_perl_destruct_level = proto_perl->Iperl_destruct_level;
8597 /* magical thingies */
8598 /* XXX time(&PL_basetime) when asked for? */
8599 PL_basetime = proto_perl->Ibasetime;
8600 PL_formfeed = sv_dup(proto_perl->Iformfeed);
8602 PL_maxsysfd = proto_perl->Imaxsysfd;
8603 PL_multiline = proto_perl->Imultiline;
8604 PL_statusvalue = proto_perl->Istatusvalue;
8606 PL_statusvalue_vms = proto_perl->Istatusvalue_vms;
8609 /* shortcuts to various I/O objects */
8610 PL_stdingv = gv_dup(proto_perl->Istdingv);
8611 PL_stderrgv = gv_dup(proto_perl->Istderrgv);
8612 PL_defgv = gv_dup(proto_perl->Idefgv);
8613 PL_argvgv = gv_dup(proto_perl->Iargvgv);
8614 PL_argvoutgv = gv_dup(proto_perl->Iargvoutgv);
8615 PL_argvout_stack = av_dup(proto_perl->Iargvout_stack);
8617 /* shortcuts to regexp stuff */
8618 PL_replgv = gv_dup(proto_perl->Ireplgv);
8620 /* shortcuts to misc objects */
8621 PL_errgv = gv_dup(proto_perl->Ierrgv);
8623 /* shortcuts to debugging objects */
8624 PL_DBgv = gv_dup(proto_perl->IDBgv);
8625 PL_DBline = gv_dup(proto_perl->IDBline);
8626 PL_DBsub = gv_dup(proto_perl->IDBsub);
8627 PL_DBsingle = sv_dup(proto_perl->IDBsingle);
8628 PL_DBtrace = sv_dup(proto_perl->IDBtrace);
8629 PL_DBsignal = sv_dup(proto_perl->IDBsignal);
8630 PL_lineary = av_dup(proto_perl->Ilineary);
8631 PL_dbargs = av_dup(proto_perl->Idbargs);
8634 PL_defstash = hv_dup_inc(proto_perl->Tdefstash);
8635 PL_curstash = hv_dup(proto_perl->Tcurstash);
8636 PL_debstash = hv_dup(proto_perl->Idebstash);
8637 PL_globalstash = hv_dup(proto_perl->Iglobalstash);
8638 PL_curstname = sv_dup_inc(proto_perl->Icurstname);
8640 PL_beginav = av_dup_inc(proto_perl->Ibeginav);
8641 PL_endav = av_dup_inc(proto_perl->Iendav);
8642 PL_checkav = av_dup_inc(proto_perl->Icheckav);
8643 PL_initav = av_dup_inc(proto_perl->Iinitav);
8645 PL_sub_generation = proto_perl->Isub_generation;
8647 /* funky return mechanisms */
8648 PL_forkprocess = proto_perl->Iforkprocess;
8650 /* subprocess state */
8651 PL_fdpid = av_dup_inc(proto_perl->Ifdpid);
8653 /* internal state */
8654 PL_tainting = proto_perl->Itainting;
8655 PL_maxo = proto_perl->Imaxo;
8656 if (proto_perl->Iop_mask)
8657 PL_op_mask = SAVEPVN(proto_perl->Iop_mask, PL_maxo);
8659 PL_op_mask = Nullch;
8661 /* current interpreter roots */
8662 PL_main_cv = cv_dup_inc(proto_perl->Imain_cv);
8663 PL_main_root = OpREFCNT_inc(proto_perl->Imain_root);
8664 PL_main_start = proto_perl->Imain_start;
8665 PL_eval_root = proto_perl->Ieval_root;
8666 PL_eval_start = proto_perl->Ieval_start;
8668 /* runtime control stuff */
8669 PL_curcopdb = (COP*)any_dup(proto_perl->Icurcopdb, proto_perl);
8670 PL_copline = proto_perl->Icopline;
8672 PL_filemode = proto_perl->Ifilemode;
8673 PL_lastfd = proto_perl->Ilastfd;
8674 PL_oldname = proto_perl->Ioldname; /* XXX not quite right */
8677 PL_gensym = proto_perl->Igensym;
8678 PL_preambled = proto_perl->Ipreambled;
8679 PL_preambleav = av_dup_inc(proto_perl->Ipreambleav);
8680 PL_laststatval = proto_perl->Ilaststatval;
8681 PL_laststype = proto_perl->Ilaststype;
8682 PL_mess_sv = Nullsv;
8684 PL_ors_sv = sv_dup_inc(proto_perl->Iors_sv);
8685 PL_ofmt = SAVEPV(proto_perl->Iofmt);
8687 /* interpreter atexit processing */
8688 PL_exitlistlen = proto_perl->Iexitlistlen;
8689 if (PL_exitlistlen) {
8690 New(0, PL_exitlist, PL_exitlistlen, PerlExitListEntry);
8691 Copy(proto_perl->Iexitlist, PL_exitlist, PL_exitlistlen, PerlExitListEntry);
8694 PL_exitlist = (PerlExitListEntry*)NULL;
8695 PL_modglobal = hv_dup_inc(proto_perl->Imodglobal);
8697 PL_profiledata = NULL;
8698 PL_rsfp = fp_dup(proto_perl->Irsfp, '<');
8699 /* PL_rsfp_filters entries have fake IoDIRP() */
8700 PL_rsfp_filters = av_dup_inc(proto_perl->Irsfp_filters);
8702 PL_compcv = cv_dup(proto_perl->Icompcv);
8703 PL_comppad = av_dup(proto_perl->Icomppad);
8704 PL_comppad_name = av_dup(proto_perl->Icomppad_name);
8705 PL_comppad_name_fill = proto_perl->Icomppad_name_fill;
8706 PL_comppad_name_floor = proto_perl->Icomppad_name_floor;
8707 PL_curpad = (SV**)ptr_table_fetch(PL_ptr_table,
8708 proto_perl->Tcurpad);
8710 #ifdef HAVE_INTERP_INTERN
8711 sys_intern_dup(&proto_perl->Isys_intern, &PL_sys_intern);
8714 /* more statics moved here */
8715 PL_generation = proto_perl->Igeneration;
8716 PL_DBcv = cv_dup(proto_perl->IDBcv);
8718 PL_in_clean_objs = proto_perl->Iin_clean_objs;
8719 PL_in_clean_all = proto_perl->Iin_clean_all;
8721 PL_uid = proto_perl->Iuid;
8722 PL_euid = proto_perl->Ieuid;
8723 PL_gid = proto_perl->Igid;
8724 PL_egid = proto_perl->Iegid;
8725 PL_nomemok = proto_perl->Inomemok;
8726 PL_an = proto_perl->Ian;
8727 PL_cop_seqmax = proto_perl->Icop_seqmax;
8728 PL_op_seqmax = proto_perl->Iop_seqmax;
8729 PL_evalseq = proto_perl->Ievalseq;
8730 PL_origenviron = proto_perl->Iorigenviron; /* XXX not quite right */
8731 PL_origalen = proto_perl->Iorigalen;
8732 PL_pidstatus = newHV(); /* XXX flag for cloning? */
8733 PL_osname = SAVEPV(proto_perl->Iosname);
8734 PL_sh_path = SAVEPV(proto_perl->Ish_path);
8735 PL_sighandlerp = proto_perl->Isighandlerp;
8738 PL_runops = proto_perl->Irunops;
8740 Copy(proto_perl->Itokenbuf, PL_tokenbuf, 256, char);
8743 PL_cshlen = proto_perl->Icshlen;
8744 PL_cshname = SAVEPVN(proto_perl->Icshname, PL_cshlen);
8747 PL_lex_state = proto_perl->Ilex_state;
8748 PL_lex_defer = proto_perl->Ilex_defer;
8749 PL_lex_expect = proto_perl->Ilex_expect;
8750 PL_lex_formbrack = proto_perl->Ilex_formbrack;
8751 PL_lex_dojoin = proto_perl->Ilex_dojoin;
8752 PL_lex_starts = proto_perl->Ilex_starts;
8753 PL_lex_stuff = sv_dup_inc(proto_perl->Ilex_stuff);
8754 PL_lex_repl = sv_dup_inc(proto_perl->Ilex_repl);
8755 PL_lex_op = proto_perl->Ilex_op;
8756 PL_lex_inpat = proto_perl->Ilex_inpat;
8757 PL_lex_inwhat = proto_perl->Ilex_inwhat;
8758 PL_lex_brackets = proto_perl->Ilex_brackets;
8759 i = (PL_lex_brackets < 120 ? 120 : PL_lex_brackets);
8760 PL_lex_brackstack = SAVEPVN(proto_perl->Ilex_brackstack,i);
8761 PL_lex_casemods = proto_perl->Ilex_casemods;
8762 i = (PL_lex_casemods < 12 ? 12 : PL_lex_casemods);
8763 PL_lex_casestack = SAVEPVN(proto_perl->Ilex_casestack,i);
8765 Copy(proto_perl->Inextval, PL_nextval, 5, YYSTYPE);
8766 Copy(proto_perl->Inexttype, PL_nexttype, 5, I32);
8767 PL_nexttoke = proto_perl->Inexttoke;
8769 PL_linestr = sv_dup_inc(proto_perl->Ilinestr);
8770 i = proto_perl->Ibufptr - SvPVX(proto_perl->Ilinestr);
8771 PL_bufptr = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
8772 i = proto_perl->Ioldbufptr - SvPVX(proto_perl->Ilinestr);
8773 PL_oldbufptr = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
8774 i = proto_perl->Ioldoldbufptr - SvPVX(proto_perl->Ilinestr);
8775 PL_oldoldbufptr = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
8776 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
8777 i = proto_perl->Ilinestart - SvPVX(proto_perl->Ilinestr);
8778 PL_linestart = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
8779 PL_pending_ident = proto_perl->Ipending_ident;
8780 PL_sublex_info = proto_perl->Isublex_info; /* XXX not quite right */
8782 PL_expect = proto_perl->Iexpect;
8784 PL_multi_start = proto_perl->Imulti_start;
8785 PL_multi_end = proto_perl->Imulti_end;
8786 PL_multi_open = proto_perl->Imulti_open;
8787 PL_multi_close = proto_perl->Imulti_close;
8789 PL_error_count = proto_perl->Ierror_count;
8790 PL_subline = proto_perl->Isubline;
8791 PL_subname = sv_dup_inc(proto_perl->Isubname);
8793 PL_min_intro_pending = proto_perl->Imin_intro_pending;
8794 PL_max_intro_pending = proto_perl->Imax_intro_pending;
8795 PL_padix = proto_perl->Ipadix;
8796 PL_padix_floor = proto_perl->Ipadix_floor;
8797 PL_pad_reset_pending = proto_perl->Ipad_reset_pending;
8799 i = proto_perl->Ilast_uni - SvPVX(proto_perl->Ilinestr);
8800 PL_last_uni = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
8801 i = proto_perl->Ilast_lop - SvPVX(proto_perl->Ilinestr);
8802 PL_last_lop = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
8803 PL_last_lop_op = proto_perl->Ilast_lop_op;
8804 PL_in_my = proto_perl->Iin_my;
8805 PL_in_my_stash = hv_dup(proto_perl->Iin_my_stash);
8807 PL_cryptseen = proto_perl->Icryptseen;
8810 PL_hints = proto_perl->Ihints;
8812 PL_amagic_generation = proto_perl->Iamagic_generation;
8814 #ifdef USE_LOCALE_COLLATE
8815 PL_collation_ix = proto_perl->Icollation_ix;
8816 PL_collation_name = SAVEPV(proto_perl->Icollation_name);
8817 PL_collation_standard = proto_perl->Icollation_standard;
8818 PL_collxfrm_base = proto_perl->Icollxfrm_base;
8819 PL_collxfrm_mult = proto_perl->Icollxfrm_mult;
8820 #endif /* USE_LOCALE_COLLATE */
8822 #ifdef USE_LOCALE_NUMERIC
8823 PL_numeric_name = SAVEPV(proto_perl->Inumeric_name);
8824 PL_numeric_standard = proto_perl->Inumeric_standard;
8825 PL_numeric_local = proto_perl->Inumeric_local;
8826 PL_numeric_radix = proto_perl->Inumeric_radix;
8827 #endif /* !USE_LOCALE_NUMERIC */
8829 /* utf8 character classes */
8830 PL_utf8_alnum = sv_dup_inc(proto_perl->Iutf8_alnum);
8831 PL_utf8_alnumc = sv_dup_inc(proto_perl->Iutf8_alnumc);
8832 PL_utf8_ascii = sv_dup_inc(proto_perl->Iutf8_ascii);
8833 PL_utf8_alpha = sv_dup_inc(proto_perl->Iutf8_alpha);
8834 PL_utf8_space = sv_dup_inc(proto_perl->Iutf8_space);
8835 PL_utf8_cntrl = sv_dup_inc(proto_perl->Iutf8_cntrl);
8836 PL_utf8_graph = sv_dup_inc(proto_perl->Iutf8_graph);
8837 PL_utf8_digit = sv_dup_inc(proto_perl->Iutf8_digit);
8838 PL_utf8_upper = sv_dup_inc(proto_perl->Iutf8_upper);
8839 PL_utf8_lower = sv_dup_inc(proto_perl->Iutf8_lower);
8840 PL_utf8_print = sv_dup_inc(proto_perl->Iutf8_print);
8841 PL_utf8_punct = sv_dup_inc(proto_perl->Iutf8_punct);
8842 PL_utf8_xdigit = sv_dup_inc(proto_perl->Iutf8_xdigit);
8843 PL_utf8_mark = sv_dup_inc(proto_perl->Iutf8_mark);
8844 PL_utf8_toupper = sv_dup_inc(proto_perl->Iutf8_toupper);
8845 PL_utf8_totitle = sv_dup_inc(proto_perl->Iutf8_totitle);
8846 PL_utf8_tolower = sv_dup_inc(proto_perl->Iutf8_tolower);
8849 PL_last_swash_hv = Nullhv; /* reinits on demand */
8850 PL_last_swash_klen = 0;
8851 PL_last_swash_key[0]= '\0';
8852 PL_last_swash_tmps = (U8*)NULL;
8853 PL_last_swash_slen = 0;
8855 /* perly.c globals */
8856 PL_yydebug = proto_perl->Iyydebug;
8857 PL_yynerrs = proto_perl->Iyynerrs;
8858 PL_yyerrflag = proto_perl->Iyyerrflag;
8859 PL_yychar = proto_perl->Iyychar;
8860 PL_yyval = proto_perl->Iyyval;
8861 PL_yylval = proto_perl->Iyylval;
8863 PL_glob_index = proto_perl->Iglob_index;
8864 PL_srand_called = proto_perl->Isrand_called;
8865 PL_uudmap['M'] = 0; /* reinits on demand */
8866 PL_bitcount = Nullch; /* reinits on demand */
8868 if (proto_perl->Ipsig_ptr) {
8869 int sig_num[] = { SIG_NUM };
8870 Newz(0, PL_psig_ptr, sizeof(sig_num)/sizeof(*sig_num), SV*);
8871 Newz(0, PL_psig_name, sizeof(sig_num)/sizeof(*sig_num), SV*);
8872 for (i = 1; PL_sig_name[i]; i++) {
8873 PL_psig_ptr[i] = sv_dup_inc(proto_perl->Ipsig_ptr[i]);
8874 PL_psig_name[i] = sv_dup_inc(proto_perl->Ipsig_name[i]);
8878 PL_psig_ptr = (SV**)NULL;
8879 PL_psig_name = (SV**)NULL;
8882 /* thrdvar.h stuff */
8885 /* next allocation will be PL_tmps_stack[PL_tmps_ix+1] */
8886 PL_tmps_ix = proto_perl->Ttmps_ix;
8887 PL_tmps_max = proto_perl->Ttmps_max;
8888 PL_tmps_floor = proto_perl->Ttmps_floor;
8889 Newz(50, PL_tmps_stack, PL_tmps_max, SV*);
8891 while (i <= PL_tmps_ix) {
8892 PL_tmps_stack[i] = sv_dup_inc(proto_perl->Ttmps_stack[i]);
8896 /* next PUSHMARK() sets *(PL_markstack_ptr+1) */
8897 i = proto_perl->Tmarkstack_max - proto_perl->Tmarkstack;
8898 Newz(54, PL_markstack, i, I32);
8899 PL_markstack_max = PL_markstack + (proto_perl->Tmarkstack_max
8900 - proto_perl->Tmarkstack);
8901 PL_markstack_ptr = PL_markstack + (proto_perl->Tmarkstack_ptr
8902 - proto_perl->Tmarkstack);
8903 Copy(proto_perl->Tmarkstack, PL_markstack,
8904 PL_markstack_ptr - PL_markstack + 1, I32);
8906 /* next push_scope()/ENTER sets PL_scopestack[PL_scopestack_ix]
8907 * NOTE: unlike the others! */
8908 PL_scopestack_ix = proto_perl->Tscopestack_ix;
8909 PL_scopestack_max = proto_perl->Tscopestack_max;
8910 Newz(54, PL_scopestack, PL_scopestack_max, I32);
8911 Copy(proto_perl->Tscopestack, PL_scopestack, PL_scopestack_ix, I32);
8913 /* next push_return() sets PL_retstack[PL_retstack_ix]
8914 * NOTE: unlike the others! */
8915 PL_retstack_ix = proto_perl->Tretstack_ix;
8916 PL_retstack_max = proto_perl->Tretstack_max;
8917 Newz(54, PL_retstack, PL_retstack_max, OP*);
8918 Copy(proto_perl->Tretstack, PL_retstack, PL_retstack_ix, I32);
8920 /* NOTE: si_dup() looks at PL_markstack */
8921 PL_curstackinfo = si_dup(proto_perl->Tcurstackinfo);
8923 /* PL_curstack = PL_curstackinfo->si_stack; */
8924 PL_curstack = av_dup(proto_perl->Tcurstack);
8925 PL_mainstack = av_dup(proto_perl->Tmainstack);
8927 /* next PUSHs() etc. set *(PL_stack_sp+1) */
8928 PL_stack_base = AvARRAY(PL_curstack);
8929 PL_stack_sp = PL_stack_base + (proto_perl->Tstack_sp
8930 - proto_perl->Tstack_base);
8931 PL_stack_max = PL_stack_base + AvMAX(PL_curstack);
8933 /* next SSPUSHFOO() sets PL_savestack[PL_savestack_ix]
8934 * NOTE: unlike the others! */
8935 PL_savestack_ix = proto_perl->Tsavestack_ix;
8936 PL_savestack_max = proto_perl->Tsavestack_max;
8937 /*Newz(54, PL_savestack, PL_savestack_max, ANY);*/
8938 PL_savestack = ss_dup(proto_perl);
8942 ENTER; /* perl_destruct() wants to LEAVE; */
8945 PL_start_env = proto_perl->Tstart_env; /* XXXXXX */
8946 PL_top_env = &PL_start_env;
8948 PL_op = proto_perl->Top;
8951 PL_Xpv = (XPV*)NULL;
8952 PL_na = proto_perl->Tna;
8954 PL_statbuf = proto_perl->Tstatbuf;
8955 PL_statcache = proto_perl->Tstatcache;
8956 PL_statgv = gv_dup(proto_perl->Tstatgv);
8957 PL_statname = sv_dup_inc(proto_perl->Tstatname);
8959 PL_timesbuf = proto_perl->Ttimesbuf;
8962 PL_tainted = proto_perl->Ttainted;
8963 PL_curpm = proto_perl->Tcurpm; /* XXX No PMOP ref count */
8964 PL_nrs = sv_dup_inc(proto_perl->Tnrs);
8965 PL_rs = sv_dup_inc(proto_perl->Trs);
8966 PL_last_in_gv = gv_dup(proto_perl->Tlast_in_gv);
8967 PL_ofs_sv = sv_dup_inc(proto_perl->Tofs_sv);
8968 PL_defoutgv = gv_dup_inc(proto_perl->Tdefoutgv);
8969 PL_chopset = proto_perl->Tchopset; /* XXX never deallocated */
8970 PL_toptarget = sv_dup_inc(proto_perl->Ttoptarget);
8971 PL_bodytarget = sv_dup_inc(proto_perl->Tbodytarget);
8972 PL_formtarget = sv_dup(proto_perl->Tformtarget);
8974 PL_restartop = proto_perl->Trestartop;
8975 PL_in_eval = proto_perl->Tin_eval;
8976 PL_delaymagic = proto_perl->Tdelaymagic;
8977 PL_dirty = proto_perl->Tdirty;
8978 PL_localizing = proto_perl->Tlocalizing;
8980 #ifdef PERL_FLEXIBLE_EXCEPTIONS
8981 PL_protect = proto_perl->Tprotect;
8983 PL_errors = sv_dup_inc(proto_perl->Terrors);
8984 PL_av_fetch_sv = Nullsv;
8985 PL_hv_fetch_sv = Nullsv;
8986 Zero(&PL_hv_fetch_ent_mh, 1, HE); /* XXX */
8987 PL_modcount = proto_perl->Tmodcount;
8988 PL_lastgotoprobe = Nullop;
8989 PL_dumpindent = proto_perl->Tdumpindent;
8991 PL_sortcop = (OP*)any_dup(proto_perl->Tsortcop, proto_perl);
8992 PL_sortstash = hv_dup(proto_perl->Tsortstash);
8993 PL_firstgv = gv_dup(proto_perl->Tfirstgv);
8994 PL_secondgv = gv_dup(proto_perl->Tsecondgv);
8995 PL_sortcxix = proto_perl->Tsortcxix;
8996 PL_efloatbuf = Nullch; /* reinits on demand */
8997 PL_efloatsize = 0; /* reinits on demand */
9001 PL_screamfirst = NULL;
9002 PL_screamnext = NULL;
9003 PL_maxscream = -1; /* reinits on demand */
9004 PL_lastscream = Nullsv;
9006 PL_watchaddr = NULL;
9007 PL_watchok = Nullch;
9009 PL_regdummy = proto_perl->Tregdummy;
9010 PL_regcomp_parse = Nullch;
9011 PL_regxend = Nullch;
9012 PL_regcode = (regnode*)NULL;
9015 PL_regprecomp = Nullch;
9020 PL_seen_zerolen = 0;
9022 PL_regcomp_rx = (regexp*)NULL;
9024 PL_colorset = 0; /* reinits PL_colors[] */
9025 /*PL_colors[6] = {0,0,0,0,0,0};*/
9026 PL_reg_whilem_seen = 0;
9027 PL_reginput = Nullch;
9030 PL_regstartp = (I32*)NULL;
9031 PL_regendp = (I32*)NULL;
9032 PL_reglastparen = (U32*)NULL;
9033 PL_regtill = Nullch;
9035 PL_reg_start_tmp = (char**)NULL;
9036 PL_reg_start_tmpl = 0;
9037 PL_regdata = (struct reg_data*)NULL;
9040 PL_reg_eval_set = 0;
9042 PL_regprogram = (regnode*)NULL;
9044 PL_regcc = (CURCUR*)NULL;
9045 PL_reg_call_cc = (struct re_cc_state*)NULL;
9046 PL_reg_re = (regexp*)NULL;
9047 PL_reg_ganch = Nullch;
9049 PL_reg_magic = (MAGIC*)NULL;
9051 PL_reg_oldcurpm = (PMOP*)NULL;
9052 PL_reg_curpm = (PMOP*)NULL;
9053 PL_reg_oldsaved = Nullch;
9054 PL_reg_oldsavedlen = 0;
9056 PL_reg_leftiter = 0;
9057 PL_reg_poscache = Nullch;
9058 PL_reg_poscache_size= 0;
9060 /* RE engine - function pointers */
9061 PL_regcompp = proto_perl->Tregcompp;
9062 PL_regexecp = proto_perl->Tregexecp;
9063 PL_regint_start = proto_perl->Tregint_start;
9064 PL_regint_string = proto_perl->Tregint_string;
9065 PL_regfree = proto_perl->Tregfree;
9067 PL_reginterp_cnt = 0;
9068 PL_reg_starttry = 0;
9071 return (PerlInterpreter*)pPerl;
9077 #else /* !USE_ITHREADS */
9083 #endif /* USE_ITHREADS */
9086 do_report_used(pTHXo_ SV *sv)
9088 if (SvTYPE(sv) != SVTYPEMASK) {
9089 PerlIO_printf(Perl_debug_log, "****\n");
9095 do_clean_objs(pTHXo_ SV *sv)
9099 if (SvROK(sv) && SvOBJECT(rv = SvRV(sv))) {
9100 DEBUG_D((PerlIO_printf(Perl_debug_log, "Cleaning object ref:\n "), sv_dump(sv));)
9101 if (SvWEAKREF(sv)) {
9112 /* XXX Might want to check arrays, etc. */
9115 #ifndef DISABLE_DESTRUCTOR_KLUDGE
9117 do_clean_named_objs(pTHXo_ SV *sv)
9119 if (SvTYPE(sv) == SVt_PVGV && GvGP(sv)) {
9120 if ( SvOBJECT(GvSV(sv)) ||
9121 (GvAV(sv) && SvOBJECT(GvAV(sv))) ||
9122 (GvHV(sv) && SvOBJECT(GvHV(sv))) ||
9123 (GvIO(sv) && SvOBJECT(GvIO(sv))) ||
9124 (GvCV(sv) && SvOBJECT(GvCV(sv))) )
9126 DEBUG_D((PerlIO_printf(Perl_debug_log, "Cleaning named glob object:\n "), sv_dump(sv));)
9134 do_clean_all(pTHXo_ SV *sv)
9136 DEBUG_D((PerlIO_printf(Perl_debug_log, "Cleaning loops: SV at 0x%"UVxf"\n", PTR2UV(sv)) );)
9137 SvFLAGS(sv) |= SVf_BREAK;