3 * Copyright (c) 1991-2000, 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 (SvTYPE(sv) == mt)
922 switch (SvTYPE(sv)) {
943 else if (mt < SVt_PVIV)
960 pv = (char*)SvRV(sv);
980 else if (mt == SVt_NV)
991 del_XPVIV(SvANY(sv));
1001 del_XPVNV(SvANY(sv));
1009 magic = SvMAGIC(sv);
1010 stash = SvSTASH(sv);
1011 del_XPVMG(SvANY(sv));
1014 Perl_croak(aTHX_ "Can't upgrade that kind of scalar");
1019 Perl_croak(aTHX_ "Can't upgrade to undef");
1021 SvANY(sv) = new_XIV();
1025 SvANY(sv) = new_XNV();
1029 SvANY(sv) = new_XRV();
1033 SvANY(sv) = new_XPV();
1039 SvANY(sv) = new_XPVIV();
1049 SvANY(sv) = new_XPVNV();
1057 SvANY(sv) = new_XPVMG();
1063 SvMAGIC(sv) = magic;
1064 SvSTASH(sv) = stash;
1067 SvANY(sv) = new_XPVLV();
1073 SvMAGIC(sv) = magic;
1074 SvSTASH(sv) = stash;
1081 SvANY(sv) = new_XPVAV();
1089 SvMAGIC(sv) = magic;
1090 SvSTASH(sv) = stash;
1096 SvANY(sv) = new_XPVHV();
1104 SvMAGIC(sv) = magic;
1105 SvSTASH(sv) = stash;
1112 SvANY(sv) = new_XPVCV();
1113 Zero(SvANY(sv), 1, XPVCV);
1119 SvMAGIC(sv) = magic;
1120 SvSTASH(sv) = stash;
1123 SvANY(sv) = new_XPVGV();
1129 SvMAGIC(sv) = magic;
1130 SvSTASH(sv) = stash;
1138 SvANY(sv) = new_XPVBM();
1144 SvMAGIC(sv) = magic;
1145 SvSTASH(sv) = stash;
1151 SvANY(sv) = new_XPVFM();
1152 Zero(SvANY(sv), 1, XPVFM);
1158 SvMAGIC(sv) = magic;
1159 SvSTASH(sv) = stash;
1162 SvANY(sv) = new_XPVIO();
1163 Zero(SvANY(sv), 1, XPVIO);
1169 SvMAGIC(sv) = magic;
1170 SvSTASH(sv) = stash;
1171 IoPAGE_LEN(sv) = 60;
1174 SvFLAGS(sv) &= ~SVTYPEMASK;
1180 Perl_sv_backoff(pTHX_ register SV *sv)
1184 char *s = SvPVX(sv);
1185 SvLEN(sv) += SvIVX(sv);
1186 SvPVX(sv) -= SvIVX(sv);
1188 Move(s, SvPVX(sv), SvCUR(sv)+1, char);
1190 SvFLAGS(sv) &= ~SVf_OOK;
1197 Expands the character buffer in the SV. This will use C<sv_unref> and will
1198 upgrade the SV to C<SVt_PV>. Returns a pointer to the character buffer.
1205 Perl_sv_grow(pTHX_ register SV *sv, register STRLEN newlen)
1209 #ifdef HAS_64K_LIMIT
1210 if (newlen >= 0x10000) {
1211 PerlIO_printf(Perl_debug_log,
1212 "Allocation too large: %"UVxf"\n", (UV)newlen);
1215 #endif /* HAS_64K_LIMIT */
1218 if (SvTYPE(sv) < SVt_PV) {
1219 sv_upgrade(sv, SVt_PV);
1222 else if (SvOOK(sv)) { /* pv is offset? */
1225 if (newlen > SvLEN(sv))
1226 newlen += 10 * (newlen - SvCUR(sv)); /* avoid copy each time */
1227 #ifdef HAS_64K_LIMIT
1228 if (newlen >= 0x10000)
1234 if (newlen > SvLEN(sv)) { /* need more room? */
1235 if (SvLEN(sv) && s) {
1236 #if defined(MYMALLOC) && !defined(LEAKTEST)
1237 STRLEN l = malloced_size((void*)SvPVX(sv));
1243 Renew(s,newlen,char);
1246 New(703,s,newlen,char);
1248 SvLEN_set(sv, newlen);
1254 =for apidoc sv_setiv
1256 Copies an integer into the given SV. Does not handle 'set' magic. See
1263 Perl_sv_setiv(pTHX_ register SV *sv, IV i)
1265 SV_CHECK_THINKFIRST(sv);
1266 switch (SvTYPE(sv)) {
1268 sv_upgrade(sv, SVt_IV);
1271 sv_upgrade(sv, SVt_PVNV);
1275 sv_upgrade(sv, SVt_PVIV);
1286 Perl_croak(aTHX_ "Can't coerce %s to integer in %s", sv_reftype(sv,0),
1287 PL_op_desc[PL_op->op_type]);
1290 (void)SvIOK_only(sv); /* validate number */
1296 =for apidoc sv_setiv_mg
1298 Like C<sv_setiv>, but also handles 'set' magic.
1304 Perl_sv_setiv_mg(pTHX_ register SV *sv, IV i)
1311 =for apidoc sv_setuv
1313 Copies an unsigned integer into the given SV. Does not handle 'set' magic.
1320 Perl_sv_setuv(pTHX_ register SV *sv, UV u)
1328 =for apidoc sv_setuv_mg
1330 Like C<sv_setuv>, but also handles 'set' magic.
1336 Perl_sv_setuv_mg(pTHX_ register SV *sv, UV u)
1343 =for apidoc sv_setnv
1345 Copies a double into the given SV. Does not handle 'set' magic. See
1352 Perl_sv_setnv(pTHX_ register SV *sv, NV num)
1354 SV_CHECK_THINKFIRST(sv);
1355 switch (SvTYPE(sv)) {
1358 sv_upgrade(sv, SVt_NV);
1363 sv_upgrade(sv, SVt_PVNV);
1374 Perl_croak(aTHX_ "Can't coerce %s to number in %s", sv_reftype(sv,0),
1375 PL_op_name[PL_op->op_type]);
1379 (void)SvNOK_only(sv); /* validate number */
1384 =for apidoc sv_setnv_mg
1386 Like C<sv_setnv>, but also handles 'set' magic.
1392 Perl_sv_setnv_mg(pTHX_ register SV *sv, NV num)
1399 S_not_a_number(pTHX_ SV *sv)
1405 char *limit = tmpbuf + sizeof(tmpbuf) - 8;
1406 /* each *s can expand to 4 chars + "...\0",
1407 i.e. need room for 8 chars */
1409 for (s = SvPVX(sv); *s && d < limit; s++) {
1411 if (ch & 128 && !isPRINT_LC(ch)) {
1420 else if (ch == '\r') {
1424 else if (ch == '\f') {
1428 else if (ch == '\\') {
1432 else if (isPRINT_LC(ch))
1447 Perl_warner(aTHX_ WARN_NUMERIC,
1448 "Argument \"%s\" isn't numeric in %s", tmpbuf,
1449 PL_op_desc[PL_op->op_type]);
1451 Perl_warner(aTHX_ WARN_NUMERIC,
1452 "Argument \"%s\" isn't numeric", tmpbuf);
1455 /* the number can be converted to integer with atol() or atoll() */
1456 #define IS_NUMBER_TO_INT_BY_ATOL 0x01
1457 #define IS_NUMBER_TO_INT_BY_ATOF 0x02 /* atol() may be != atof() */
1458 #define IS_NUMBER_NOT_IV 0x04 /* (IV)atof() may be != atof() */
1459 #define IS_NUMBER_NEG 0x08 /* not good to cache UV */
1460 #define IS_NUMBER_INFINITY 0x10 /* this is big */
1462 /* Actually, ISO C leaves conversion of UV to IV undefined, but
1463 until proven guilty, assume that things are not that bad... */
1466 Perl_sv_2iv(pTHX_ register SV *sv)
1470 if (SvGMAGICAL(sv)) {
1475 return I_V(SvNVX(sv));
1477 if (SvPOKp(sv) && SvLEN(sv))
1480 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
1482 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
1488 if (SvTHINKFIRST(sv)) {
1491 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv, numer)))
1492 return SvIV(tmpstr);
1493 return PTR2IV(SvRV(sv));
1495 if (SvREADONLY(sv) && !SvOK(sv)) {
1497 if (ckWARN(WARN_UNINITIALIZED))
1504 return (IV)(SvUVX(sv));
1511 /* We can cache the IV/UV value even if it not good enough
1512 * to reconstruct NV, since the conversion to PV will prefer
1516 if (SvTYPE(sv) == SVt_NV)
1517 sv_upgrade(sv, SVt_PVNV);
1520 if (SvNVX(sv) < (NV)IV_MAX + 0.5)
1521 SvIVX(sv) = I_V(SvNVX(sv));
1523 SvUVX(sv) = U_V(SvNVX(sv));
1526 DEBUG_c(PerlIO_printf(Perl_debug_log,
1527 "0x%"UVxf" 2iv(%"UVuf" => %"IVdf") (as unsigned)\n",
1531 return (IV)SvUVX(sv);
1534 else if (SvPOKp(sv) && SvLEN(sv)) {
1535 I32 numtype = looks_like_number(sv);
1537 /* We want to avoid a possible problem when we cache an IV which
1538 may be later translated to an NV, and the resulting NV is not
1539 the translation of the initial data.
1541 This means that if we cache such an IV, we need to cache the
1542 NV as well. Moreover, we trade speed for space, and do not
1543 cache the NV if not needed.
1545 if (numtype & IS_NUMBER_NOT_IV) {
1546 /* May be not an integer. Need to cache NV if we cache IV
1547 * - otherwise future conversion to NV will be wrong. */
1550 d = Atof(SvPVX(sv));
1552 if (SvTYPE(sv) < SVt_PVNV)
1553 sv_upgrade(sv, SVt_PVNV);
1557 #if defined(USE_LONG_DOUBLE)
1558 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2nv(%" PERL_PRIgldbl ")\n",
1559 PTR2UV(sv), SvNVX(sv)));
1561 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2nv(%g)\n",
1562 PTR2UV(sv), SvNVX(sv)));
1564 if (SvNVX(sv) < (NV)IV_MAX + 0.5)
1565 SvIVX(sv) = I_V(SvNVX(sv));
1567 SvUVX(sv) = U_V(SvNVX(sv));
1572 else { /* The NV may be reconstructed from IV - safe to cache IV,
1573 which may be calculated by atol(). */
1574 if (SvTYPE(sv) < SVt_PVIV)
1575 sv_upgrade(sv, SVt_PVIV);
1577 SvIVX(sv) = Atol(SvPVX(sv));
1578 if (! numtype && ckWARN(WARN_NUMERIC))
1584 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing && !(SvFLAGS(sv) & SVs_PADTMP))
1586 if (SvTYPE(sv) < SVt_IV)
1587 /* Typically the caller expects that sv_any is not NULL now. */
1588 sv_upgrade(sv, SVt_IV);
1591 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2iv(%"IVdf")\n",
1592 PTR2UV(sv),SvIVX(sv)));
1593 return SvIsUV(sv) ? (IV)SvUVX(sv) : SvIVX(sv);
1597 Perl_sv_2uv(pTHX_ register SV *sv)
1601 if (SvGMAGICAL(sv)) {
1606 return U_V(SvNVX(sv));
1607 if (SvPOKp(sv) && SvLEN(sv))
1610 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
1612 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
1618 if (SvTHINKFIRST(sv)) {
1621 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv, numer)))
1622 return SvUV(tmpstr);
1623 return PTR2UV(SvRV(sv));
1625 if (SvREADONLY(sv) && !SvOK(sv)) {
1627 if (ckWARN(WARN_UNINITIALIZED))
1637 return (UV)SvIVX(sv);
1641 /* We can cache the IV/UV value even if it not good enough
1642 * to reconstruct NV, since the conversion to PV will prefer
1645 if (SvTYPE(sv) == SVt_NV)
1646 sv_upgrade(sv, SVt_PVNV);
1648 if (SvNVX(sv) >= -0.5) {
1650 SvUVX(sv) = U_V(SvNVX(sv));
1653 SvIVX(sv) = I_V(SvNVX(sv));
1655 DEBUG_c(PerlIO_printf(Perl_debug_log,
1656 "0x%"UVxf" 2uv(%"IVdf" => %"IVdf") (as signed)\n",
1659 (IV)(UV)SvIVX(sv)));
1660 return (UV)SvIVX(sv);
1663 else if (SvPOKp(sv) && SvLEN(sv)) {
1664 I32 numtype = looks_like_number(sv);
1666 /* We want to avoid a possible problem when we cache a UV which
1667 may be later translated to an NV, and the resulting NV is not
1668 the translation of the initial data.
1670 This means that if we cache such a UV, we need to cache the
1671 NV as well. Moreover, we trade speed for space, and do not
1672 cache the NV if not needed.
1674 if (numtype & IS_NUMBER_NOT_IV) {
1675 /* May be not an integer. Need to cache NV if we cache IV
1676 * - otherwise future conversion to NV will be wrong. */
1679 d = Atof(SvPVX(sv));
1681 if (SvTYPE(sv) < SVt_PVNV)
1682 sv_upgrade(sv, SVt_PVNV);
1686 #if defined(USE_LONG_DOUBLE)
1687 DEBUG_c(PerlIO_printf(Perl_debug_log,
1688 "0x%"UVxf" 2nv(%" PERL_PRIgldbl ")\n",
1689 PTR2UV(sv), SvNVX(sv)));
1691 DEBUG_c(PerlIO_printf(Perl_debug_log,
1692 "0x%"UVxf" 2nv(%g)\n",
1693 PTR2UV(sv), SvNVX(sv)));
1695 if (SvNVX(sv) < -0.5) {
1696 SvIVX(sv) = I_V(SvNVX(sv));
1699 SvUVX(sv) = U_V(SvNVX(sv));
1703 else if (numtype & IS_NUMBER_NEG) {
1704 /* The NV may be reconstructed from IV - safe to cache IV,
1705 which may be calculated by atol(). */
1706 if (SvTYPE(sv) == SVt_PV)
1707 sv_upgrade(sv, SVt_PVIV);
1709 SvIVX(sv) = (IV)Atol(SvPVX(sv));
1711 else if (numtype) { /* Non-negative */
1712 /* The NV may be reconstructed from UV - safe to cache UV,
1713 which may be calculated by strtoul()/atol. */
1714 if (SvTYPE(sv) == SVt_PV)
1715 sv_upgrade(sv, SVt_PVIV);
1717 (void)SvIsUV_on(sv);
1719 SvUVX(sv) = Strtoul(SvPVX(sv), Null(char**), 10);
1720 #else /* no atou(), but we know the number fits into IV... */
1721 /* The only problem may be if it is negative... */
1722 SvUVX(sv) = (UV)Atol(SvPVX(sv));
1725 else { /* Not a number. Cache 0. */
1728 if (SvTYPE(sv) < SVt_PVIV)
1729 sv_upgrade(sv, SVt_PVIV);
1731 (void)SvIsUV_on(sv);
1732 SvUVX(sv) = 0; /* We assume that 0s have the
1733 same bitmap in IV and UV. */
1734 if (ckWARN(WARN_NUMERIC))
1739 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
1741 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
1744 if (SvTYPE(sv) < SVt_IV)
1745 /* Typically the caller expects that sv_any is not NULL now. */
1746 sv_upgrade(sv, SVt_IV);
1750 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2uv(%"UVuf")\n",
1751 PTR2UV(sv),SvUVX(sv)));
1752 return SvIsUV(sv) ? SvUVX(sv) : (UV)SvIVX(sv);
1756 Perl_sv_2nv(pTHX_ register SV *sv)
1760 if (SvGMAGICAL(sv)) {
1764 if (SvPOKp(sv) && SvLEN(sv)) {
1766 if (ckWARN(WARN_NUMERIC) && !SvIOKp(sv) && !looks_like_number(sv))
1768 return Atof(SvPVX(sv));
1772 return (NV)SvUVX(sv);
1774 return (NV)SvIVX(sv);
1777 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
1779 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
1785 if (SvTHINKFIRST(sv)) {
1788 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv,numer)))
1789 return SvNV(tmpstr);
1790 return PTR2NV(SvRV(sv));
1792 if (SvREADONLY(sv) && !SvOK(sv)) {
1794 if (ckWARN(WARN_UNINITIALIZED))
1799 if (SvTYPE(sv) < SVt_NV) {
1800 if (SvTYPE(sv) == SVt_IV)
1801 sv_upgrade(sv, SVt_PVNV);
1803 sv_upgrade(sv, SVt_NV);
1804 #if defined(USE_LONG_DOUBLE)
1806 STORE_NUMERIC_LOCAL_SET_STANDARD();
1807 PerlIO_printf(Perl_debug_log,
1808 "0x%"UVxf" num(%" PERL_PRIgldbl ")\n",
1809 PTR2UV(sv), SvNVX(sv));
1810 RESTORE_NUMERIC_LOCAL();
1814 STORE_NUMERIC_LOCAL_SET_STANDARD();
1815 PerlIO_printf(Perl_debug_log, "0x%"UVxf" num(%g)\n",
1816 PTR2UV(sv), SvNVX(sv));
1817 RESTORE_NUMERIC_LOCAL();
1821 else if (SvTYPE(sv) < SVt_PVNV)
1822 sv_upgrade(sv, SVt_PVNV);
1824 (!SvPOKp(sv) || !strchr(SvPVX(sv),'.') || !looks_like_number(sv)))
1826 SvNVX(sv) = SvIsUV(sv) ? (NV)SvUVX(sv) : (NV)SvIVX(sv);
1828 else if (SvPOKp(sv) && SvLEN(sv)) {
1830 if (ckWARN(WARN_NUMERIC) && !SvIOKp(sv) && !looks_like_number(sv))
1832 SvNVX(sv) = Atof(SvPVX(sv));
1836 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing && !(SvFLAGS(sv) & SVs_PADTMP))
1838 if (SvTYPE(sv) < SVt_NV)
1839 /* Typically the caller expects that sv_any is not NULL now. */
1840 sv_upgrade(sv, SVt_NV);
1844 #if defined(USE_LONG_DOUBLE)
1846 STORE_NUMERIC_LOCAL_SET_STANDARD();
1847 PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2nv(%" PERL_PRIgldbl ")\n",
1848 PTR2UV(sv), SvNVX(sv));
1849 RESTORE_NUMERIC_LOCAL();
1853 STORE_NUMERIC_LOCAL_SET_STANDARD();
1854 PerlIO_printf(Perl_debug_log, "0x%"UVxf" 1nv(%g)\n",
1855 PTR2UV(sv), SvNVX(sv));
1856 RESTORE_NUMERIC_LOCAL();
1863 S_asIV(pTHX_ SV *sv)
1865 I32 numtype = looks_like_number(sv);
1868 if (numtype & IS_NUMBER_TO_INT_BY_ATOL)
1869 return Atol(SvPVX(sv));
1872 if (ckWARN(WARN_NUMERIC))
1875 d = Atof(SvPVX(sv));
1880 S_asUV(pTHX_ SV *sv)
1882 I32 numtype = looks_like_number(sv);
1885 if (numtype & IS_NUMBER_TO_INT_BY_ATOL)
1886 return Strtoul(SvPVX(sv), Null(char**), 10);
1890 if (ckWARN(WARN_NUMERIC))
1893 return U_V(Atof(SvPVX(sv)));
1897 * Returns a combination of (advisory only - can get false negatives)
1898 * IS_NUMBER_TO_INT_BY_ATOL, IS_NUMBER_TO_INT_BY_ATOF, IS_NUMBER_NOT_IV,
1900 * 0 if does not look like number.
1902 * In fact possible values are 0 and
1903 * IS_NUMBER_TO_INT_BY_ATOL 123
1904 * IS_NUMBER_TO_INT_BY_ATOL | IS_NUMBER_NOT_IV 123.1
1905 * IS_NUMBER_TO_INT_BY_ATOF | IS_NUMBER_NOT_IV 123e0
1906 * IS_NUMBER_INFINITY
1907 * with a possible addition of IS_NUMBER_NEG.
1911 =for apidoc looks_like_number
1913 Test if an the content of an SV looks like a number (or is a
1920 Perl_looks_like_number(pTHX_ SV *sv)
1923 register char *send;
1924 register char *sbegin;
1925 register char *nbegin;
1934 else if (SvPOKp(sv))
1935 sbegin = SvPV(sv, len);
1938 send = sbegin + len;
1945 numtype = IS_NUMBER_NEG;
1952 * we return IS_NUMBER_TO_INT_BY_ATOL if the number can be converted
1953 * to _integer_ with atol() and IS_NUMBER_TO_INT_BY_ATOF if you need
1957 /* next must be digit or the radix separator or beginning of infinity */
1961 } while (isDIGIT(*s));
1963 if (s - nbegin >= TYPE_DIGITS(IV)) /* Cannot cache ato[ul]() */
1964 numtype |= IS_NUMBER_TO_INT_BY_ATOF | IS_NUMBER_NOT_IV;
1966 numtype |= IS_NUMBER_TO_INT_BY_ATOL;
1969 #ifdef USE_LOCALE_NUMERIC
1970 || IS_NUMERIC_RADIX(*s)
1974 numtype |= IS_NUMBER_NOT_IV;
1975 while (isDIGIT(*s)) /* optional digits after the radix */
1980 #ifdef USE_LOCALE_NUMERIC
1981 || IS_NUMERIC_RADIX(*s)
1985 numtype |= IS_NUMBER_TO_INT_BY_ATOL | IS_NUMBER_NOT_IV;
1986 /* no digits before the radix means we need digits after it */
1990 } while (isDIGIT(*s));
1995 else if (*s == 'I' || *s == 'i') {
1996 s++; if (*s != 'N' && *s != 'n') return 0;
1997 s++; if (*s != 'F' && *s != 'f') return 0;
1998 s++; if (*s == 'I' || *s == 'i') {
1999 s++; if (*s != 'N' && *s != 'n') return 0;
2000 s++; if (*s != 'I' && *s != 'i') return 0;
2001 s++; if (*s != 'T' && *s != 't') return 0;
2002 s++; if (*s != 'Y' && *s != 'y') return 0;
2010 numtype = IS_NUMBER_INFINITY;
2012 /* we can have an optional exponent part */
2013 if (*s == 'e' || *s == 'E') {
2014 numtype &= ~IS_NUMBER_NEG;
2015 numtype |= IS_NUMBER_TO_INT_BY_ATOF | IS_NUMBER_NOT_IV;
2017 if (*s == '+' || *s == '-')
2022 } while (isDIGIT(*s));
2032 if (len == 10 && memEQ(sbegin, "0 but true", 10))
2033 return IS_NUMBER_TO_INT_BY_ATOL;
2038 Perl_sv_2pv_nolen(pTHX_ register SV *sv)
2041 return sv_2pv(sv, &n_a);
2044 /* We assume that buf is at least TYPE_CHARS(UV) long. */
2046 uiv_2buf(char *buf, IV iv, UV uv, int is_uv, char **peob)
2048 char *ptr = buf + TYPE_CHARS(UV);
2062 *--ptr = '0' + (uv % 10);
2071 Perl_sv_2pv(pTHX_ register SV *sv, STRLEN *lp)
2076 char tbuf[64]; /* Must fit sprintf/Gconvert of longest IV/NV */
2077 char *tmpbuf = tbuf;
2083 if (SvGMAGICAL(sv)) {
2091 (void)sprintf(tmpbuf,"%"UVuf, (UV)SvUVX(sv));
2093 (void)sprintf(tmpbuf,"%"IVdf, (IV)SvIVX(sv));
2098 Gconvert(SvNVX(sv), NV_DIG, 0, tmpbuf);
2103 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
2105 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
2112 if (SvTHINKFIRST(sv)) {
2115 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv,string)))
2116 return SvPV(tmpstr,*lp);
2123 switch (SvTYPE(sv)) {
2125 if ( ((SvFLAGS(sv) &
2126 (SVs_OBJECT|SVf_OK|SVs_GMG|SVs_SMG|SVs_RMG))
2127 == (SVs_OBJECT|SVs_RMG))
2128 && strEQ(s=HvNAME(SvSTASH(sv)), "Regexp")
2129 && (mg = mg_find(sv, 'r'))) {
2131 regexp *re = (regexp *)mg->mg_obj;
2134 char *fptr = "msix";
2139 U16 reganch = (re->reganch & PMf_COMPILETIME) >> 12;
2141 while((ch = *fptr++)) {
2143 reflags[left++] = ch;
2146 reflags[right--] = ch;
2151 reflags[left] = '-';
2155 mg->mg_len = re->prelen + 4 + left;
2156 New(616, mg->mg_ptr, mg->mg_len + 1 + left, char);
2157 Copy("(?", mg->mg_ptr, 2, char);
2158 Copy(reflags, mg->mg_ptr+2, left, char);
2159 Copy(":", mg->mg_ptr+left+2, 1, char);
2160 Copy(re->precomp, mg->mg_ptr+3+left, re->prelen, char);
2161 mg->mg_ptr[mg->mg_len - 1] = ')';
2162 mg->mg_ptr[mg->mg_len] = 0;
2164 PL_reginterp_cnt += re->program[0].next_off;
2176 case SVt_PVBM: if (SvROK(sv))
2179 s = "SCALAR"; break;
2180 case SVt_PVLV: s = "LVALUE"; break;
2181 case SVt_PVAV: s = "ARRAY"; break;
2182 case SVt_PVHV: s = "HASH"; break;
2183 case SVt_PVCV: s = "CODE"; break;
2184 case SVt_PVGV: s = "GLOB"; break;
2185 case SVt_PVFM: s = "FORMAT"; break;
2186 case SVt_PVIO: s = "IO"; break;
2187 default: s = "UNKNOWN"; break;
2191 Perl_sv_setpvf(aTHX_ tsv, "%s=%s", HvNAME(SvSTASH(sv)), s);
2194 Perl_sv_catpvf(aTHX_ tsv, "(0x%"UVxf")", PTR2UV(sv));
2200 if (SvREADONLY(sv) && !SvOK(sv)) {
2202 if (ckWARN(WARN_UNINITIALIZED))
2208 if (SvNOKp(sv)) { /* See note in sv_2uv() */
2209 /* XXXX 64-bit? IV may have better precision... */
2210 /* I tried changing this to be 64-bit-aware and
2211 * the t/op/numconvert.t became very, very, angry.
2213 if (SvTYPE(sv) < SVt_PVNV)
2214 sv_upgrade(sv, SVt_PVNV);
2215 /* The +20 is pure guesswork. Configure test needed. --jhi */
2216 SvGROW(sv, NV_DIG + 20);
2218 olderrno = errno; /* some Xenix systems wipe out errno here */
2220 if (SvNVX(sv) == 0.0)
2221 (void)strcpy(s,"0");
2225 Gconvert(SvNVX(sv), NV_DIG, 0, s);
2228 #ifdef FIXNEGATIVEZERO
2229 if (*s == '-' && s[1] == '0' && !s[2])
2238 else if (SvIOKp(sv)) {
2239 U32 isIOK = SvIOK(sv);
2240 U32 isUIOK = SvIsUV(sv);
2241 char buf[TYPE_CHARS(UV)];
2244 if (SvTYPE(sv) < SVt_PVIV)
2245 sv_upgrade(sv, SVt_PVIV);
2247 ptr = uiv_2buf(buf, 0, SvUVX(sv), 1, &ebuf);
2249 ptr = uiv_2buf(buf, SvIVX(sv), 0, 0, &ebuf);
2250 SvGROW(sv, ebuf - ptr + 1); /* inlined from sv_setpvn */
2251 Move(ptr,SvPVX(sv),ebuf - ptr,char);
2252 SvCUR_set(sv, ebuf - ptr);
2265 if (ckWARN(WARN_UNINITIALIZED)
2266 && !PL_localizing && !(SvFLAGS(sv) & SVs_PADTMP))
2271 if (SvTYPE(sv) < SVt_PV)
2272 /* Typically the caller expects that sv_any is not NULL now. */
2273 sv_upgrade(sv, SVt_PV);
2276 *lp = s - SvPVX(sv);
2279 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2pv(%s)\n",
2280 PTR2UV(sv),SvPVX(sv)));
2284 if (SvROK(sv)) { /* XXX Skip this when sv_pvn_force calls */
2285 /* Sneaky stuff here */
2289 tsv = newSVpv(tmpbuf, 0);
2305 len = strlen(tmpbuf);
2307 #ifdef FIXNEGATIVEZERO
2308 if (len == 2 && t[0] == '-' && t[1] == '0') {
2313 (void)SvUPGRADE(sv, SVt_PV);
2315 s = SvGROW(sv, len + 1);
2324 Perl_sv_2pvbyte_nolen(pTHX_ register SV *sv)
2327 return sv_2pvbyte(sv, &n_a);
2331 Perl_sv_2pvbyte(pTHX_ register SV *sv, STRLEN *lp)
2333 return sv_2pv(sv,lp);
2337 Perl_sv_2pvutf8_nolen(pTHX_ register SV *sv)
2340 return sv_2pvutf8(sv, &n_a);
2344 Perl_sv_2pvutf8(pTHX_ register SV *sv, STRLEN *lp)
2346 sv_utf8_upgrade(sv);
2347 return sv_2pv(sv,lp);
2350 /* This function is only called on magical items */
2352 Perl_sv_2bool(pTHX_ register SV *sv)
2362 if (SvAMAGIC(sv) && (tmpsv = AMG_CALLun(sv,bool_)))
2363 return SvTRUE(tmpsv);
2364 return SvRV(sv) != 0;
2367 register XPV* Xpvtmp;
2368 if ((Xpvtmp = (XPV*)SvANY(sv)) &&
2369 (*Xpvtmp->xpv_pv > '0' ||
2370 Xpvtmp->xpv_cur > 1 ||
2371 (Xpvtmp->xpv_cur && *Xpvtmp->xpv_pv != '0')))
2378 return SvIVX(sv) != 0;
2381 return SvNVX(sv) != 0.0;
2389 =for apidoc sv_utf8_upgrade
2391 Convert the PV of an SV to its UTF8-encoded form.
2397 Perl_sv_utf8_upgrade(pTHX_ register SV *sv)
2402 if (!sv || !SvPOK(sv) || SvUTF8(sv))
2405 /* This function could be much more efficient if we had a FLAG in SVs
2406 * to signal if there are any hibit chars in the PV.
2408 for (s = t = SvPVX(sv), hibit = FALSE; t < SvEND(sv) && !hibit; t++)
2413 STRLEN len = SvCUR(sv) + 1; /* Plus the \0 */
2414 SvPVX(sv) = (char*)bytes_to_utf8((U8*)s, &len);
2415 SvCUR(sv) = len; /* No longer know the real size. */
2417 Safefree(s); /* No longer using what was there before. */
2422 =for apidoc sv_utf8_downgrade
2424 Attempt to convert the PV of an SV from UTF8-encoded to byte encoding.
2425 This may not be possible if the PV contains non-byte encoding characters;
2426 if this is the case, either returns false or, if C<fail_ok> is not
2433 Perl_sv_utf8_downgrade(pTHX_ register SV* sv, bool fail_ok)
2435 if (SvPOK(sv) && SvUTF8(sv)) {
2436 char *c = SvPVX(sv);
2437 STRLEN len = SvCUR(sv) + 1; /* include trailing NUL */
2438 if (!utf8_to_bytes((U8*)c, &len)) {
2442 Perl_croak("big byte");
2444 SvCUR(sv) = len - 1;
2451 =for apidoc sv_utf8_encode
2453 Convert the PV of an SV to UTF8-encoded, but then turn off the C<SvUTF8>
2454 flag so that it looks like bytes again. Nothing calls this.
2460 Perl_sv_utf8_encode(pTHX_ register SV *sv)
2462 sv_utf8_upgrade(sv);
2467 Perl_sv_utf8_decode(pTHX_ register SV *sv)
2471 bool has_utf = FALSE;
2472 if (!sv_utf8_downgrade(sv, TRUE))
2475 /* it is actually just a matter of turning the utf8 flag on, but
2476 * we want to make sure everything inside is valid utf8 first.
2479 if (!is_utf8_string((U8*)c, SvCUR(sv)+1))
2482 while (c < SvEND(sv)) {
2493 /* Note: sv_setsv() should not be called with a source string that needs
2494 * to be reused, since it may destroy the source string if it is marked
2499 =for apidoc sv_setsv
2501 Copies the contents of the source SV C<ssv> into the destination SV C<dsv>.
2502 The source SV may be destroyed if it is mortal. Does not handle 'set'
2503 magic. See the macro forms C<SvSetSV>, C<SvSetSV_nosteal> and
2510 Perl_sv_setsv(pTHX_ SV *dstr, register SV *sstr)
2513 register U32 sflags;
2519 SV_CHECK_THINKFIRST(dstr);
2521 sstr = &PL_sv_undef;
2522 stype = SvTYPE(sstr);
2523 dtype = SvTYPE(dstr);
2527 /* There's a lot of redundancy below but we're going for speed here */
2532 if (dtype != SVt_PVGV) {
2533 (void)SvOK_off(dstr);
2541 sv_upgrade(dstr, SVt_IV);
2544 sv_upgrade(dstr, SVt_PVNV);
2548 sv_upgrade(dstr, SVt_PVIV);
2551 (void)SvIOK_only(dstr);
2552 SvIVX(dstr) = SvIVX(sstr);
2565 sv_upgrade(dstr, SVt_NV);
2570 sv_upgrade(dstr, SVt_PVNV);
2573 SvNVX(dstr) = SvNVX(sstr);
2574 (void)SvNOK_only(dstr);
2582 sv_upgrade(dstr, SVt_RV);
2583 else if (dtype == SVt_PVGV &&
2584 SvTYPE(SvRV(sstr)) == SVt_PVGV) {
2587 if (GvIMPORTED(dstr) != GVf_IMPORTED
2588 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
2590 GvIMPORTED_on(dstr);
2601 sv_upgrade(dstr, SVt_PV);
2604 if (dtype < SVt_PVIV)
2605 sv_upgrade(dstr, SVt_PVIV);
2608 if (dtype < SVt_PVNV)
2609 sv_upgrade(dstr, SVt_PVNV);
2616 Perl_croak(aTHX_ "Bizarre copy of %s in %s", sv_reftype(sstr, 0),
2617 PL_op_name[PL_op->op_type]);
2619 Perl_croak(aTHX_ "Bizarre copy of %s", sv_reftype(sstr, 0));
2623 if (dtype <= SVt_PVGV) {
2625 if (dtype != SVt_PVGV) {
2626 char *name = GvNAME(sstr);
2627 STRLEN len = GvNAMELEN(sstr);
2628 sv_upgrade(dstr, SVt_PVGV);
2629 sv_magic(dstr, dstr, '*', Nullch, 0);
2630 GvSTASH(dstr) = (HV*)SvREFCNT_inc(GvSTASH(sstr));
2631 GvNAME(dstr) = savepvn(name, len);
2632 GvNAMELEN(dstr) = len;
2633 SvFAKE_on(dstr); /* can coerce to non-glob */
2635 /* ahem, death to those who redefine active sort subs */
2636 else if (PL_curstackinfo->si_type == PERLSI_SORT
2637 && GvCV(dstr) && PL_sortcop == CvSTART(GvCV(dstr)))
2638 Perl_croak(aTHX_ "Can't redefine active sort subroutine %s",
2640 (void)SvOK_off(dstr);
2641 GvINTRO_off(dstr); /* one-shot flag */
2643 GvGP(dstr) = gp_ref(GvGP(sstr));
2645 if (GvIMPORTED(dstr) != GVf_IMPORTED
2646 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
2648 GvIMPORTED_on(dstr);
2656 if (SvGMAGICAL(sstr)) {
2658 if (SvTYPE(sstr) != stype) {
2659 stype = SvTYPE(sstr);
2660 if (stype == SVt_PVGV && dtype <= SVt_PVGV)
2664 if (stype == SVt_PVLV)
2665 (void)SvUPGRADE(dstr, SVt_PVNV);
2667 (void)SvUPGRADE(dstr, stype);
2670 sflags = SvFLAGS(sstr);
2672 if (sflags & SVf_ROK) {
2673 if (dtype >= SVt_PV) {
2674 if (dtype == SVt_PVGV) {
2675 SV *sref = SvREFCNT_inc(SvRV(sstr));
2677 int intro = GvINTRO(dstr);
2682 GvINTRO_off(dstr); /* one-shot flag */
2683 Newz(602,gp, 1, GP);
2684 GvGP(dstr) = gp_ref(gp);
2685 GvSV(dstr) = NEWSV(72,0);
2686 GvLINE(dstr) = CopLINE(PL_curcop);
2687 GvEGV(dstr) = (GV*)dstr;
2690 switch (SvTYPE(sref)) {
2693 SAVESPTR(GvAV(dstr));
2695 dref = (SV*)GvAV(dstr);
2696 GvAV(dstr) = (AV*)sref;
2697 if (!GvIMPORTED_AV(dstr)
2698 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
2700 GvIMPORTED_AV_on(dstr);
2705 SAVESPTR(GvHV(dstr));
2707 dref = (SV*)GvHV(dstr);
2708 GvHV(dstr) = (HV*)sref;
2709 if (!GvIMPORTED_HV(dstr)
2710 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
2712 GvIMPORTED_HV_on(dstr);
2717 if (GvCVGEN(dstr) && GvCV(dstr) != (CV*)sref) {
2718 SvREFCNT_dec(GvCV(dstr));
2719 GvCV(dstr) = Nullcv;
2720 GvCVGEN(dstr) = 0; /* Switch off cacheness. */
2721 PL_sub_generation++;
2723 SAVESPTR(GvCV(dstr));
2726 dref = (SV*)GvCV(dstr);
2727 if (GvCV(dstr) != (CV*)sref) {
2728 CV* cv = GvCV(dstr);
2730 if (!GvCVGEN((GV*)dstr) &&
2731 (CvROOT(cv) || CvXSUB(cv)))
2733 SV *const_sv = cv_const_sv(cv);
2734 bool const_changed = TRUE;
2736 const_changed = sv_cmp(const_sv,
2737 op_const_sv(CvSTART((CV*)sref),
2739 /* ahem, death to those who redefine
2740 * active sort subs */
2741 if (PL_curstackinfo->si_type == PERLSI_SORT &&
2742 PL_sortcop == CvSTART(cv))
2744 "Can't redefine active sort subroutine %s",
2745 GvENAME((GV*)dstr));
2746 if ((const_changed && const_sv) || ckWARN(WARN_REDEFINE))
2747 Perl_warner(aTHX_ WARN_REDEFINE, const_sv ?
2748 "Constant subroutine %s redefined"
2749 : "Subroutine %s redefined",
2750 GvENAME((GV*)dstr));
2752 cv_ckproto(cv, (GV*)dstr,
2753 SvPOK(sref) ? SvPVX(sref) : Nullch);
2755 GvCV(dstr) = (CV*)sref;
2756 GvCVGEN(dstr) = 0; /* Switch off cacheness. */
2757 GvASSUMECV_on(dstr);
2758 PL_sub_generation++;
2760 if (!GvIMPORTED_CV(dstr)
2761 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
2763 GvIMPORTED_CV_on(dstr);
2768 SAVESPTR(GvIOp(dstr));
2770 dref = (SV*)GvIOp(dstr);
2771 GvIOp(dstr) = (IO*)sref;
2775 SAVESPTR(GvFORM(dstr));
2777 dref = (SV*)GvFORM(dstr);
2778 GvFORM(dstr) = (CV*)sref;
2782 SAVESPTR(GvSV(dstr));
2784 dref = (SV*)GvSV(dstr);
2786 if (!GvIMPORTED_SV(dstr)
2787 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
2789 GvIMPORTED_SV_on(dstr);
2801 (void)SvOOK_off(dstr); /* backoff */
2803 Safefree(SvPVX(dstr));
2804 SvLEN(dstr)=SvCUR(dstr)=0;
2807 (void)SvOK_off(dstr);
2808 SvRV(dstr) = SvREFCNT_inc(SvRV(sstr));
2810 if (sflags & SVp_NOK) {
2812 SvNVX(dstr) = SvNVX(sstr);
2814 if (sflags & SVp_IOK) {
2815 (void)SvIOK_on(dstr);
2816 SvIVX(dstr) = SvIVX(sstr);
2817 if (sflags & SVf_IVisUV)
2820 if (SvAMAGIC(sstr)) {
2824 else if (sflags & SVp_POK) {
2827 * Check to see if we can just swipe the string. If so, it's a
2828 * possible small lose on short strings, but a big win on long ones.
2829 * It might even be a win on short strings if SvPVX(dstr)
2830 * has to be allocated and SvPVX(sstr) has to be freed.
2833 if (SvTEMP(sstr) && /* slated for free anyway? */
2834 SvREFCNT(sstr) == 1 && /* and no other references to it? */
2835 !(sflags & SVf_OOK) && /* and not involved in OOK hack? */
2836 SvLEN(sstr)) /* and really is a string */
2838 if (SvPVX(dstr)) { /* we know that dtype >= SVt_PV */
2840 SvFLAGS(dstr) &= ~SVf_OOK;
2841 Safefree(SvPVX(dstr) - SvIVX(dstr));
2843 else if (SvLEN(dstr))
2844 Safefree(SvPVX(dstr));
2846 (void)SvPOK_only(dstr);
2847 SvPV_set(dstr, SvPVX(sstr));
2848 SvLEN_set(dstr, SvLEN(sstr));
2849 SvCUR_set(dstr, SvCUR(sstr));
2852 (void)SvOK_off(sstr); /* NOTE: nukes most SvFLAGS on sstr */
2853 SvPV_set(sstr, Nullch);
2858 else { /* have to copy actual string */
2859 STRLEN len = SvCUR(sstr);
2861 SvGROW(dstr, len + 1); /* inlined from sv_setpvn */
2862 Move(SvPVX(sstr),SvPVX(dstr),len,char);
2863 SvCUR_set(dstr, len);
2864 *SvEND(dstr) = '\0';
2865 (void)SvPOK_only(dstr);
2867 if ((sflags & SVf_UTF8) && !IN_BYTE)
2870 if (sflags & SVp_NOK) {
2872 SvNVX(dstr) = SvNVX(sstr);
2874 if (sflags & SVp_IOK) {
2875 (void)SvIOK_on(dstr);
2876 SvIVX(dstr) = SvIVX(sstr);
2877 if (sflags & SVf_IVisUV)
2881 else if (sflags & SVp_NOK) {
2882 SvNVX(dstr) = SvNVX(sstr);
2883 (void)SvNOK_only(dstr);
2884 if (sflags & SVf_IOK) {
2885 (void)SvIOK_on(dstr);
2886 SvIVX(dstr) = SvIVX(sstr);
2887 /* XXXX Do we want to set IsUV for IV(ROK)? Be extra safe... */
2888 if (sflags & SVf_IVisUV)
2892 else if (sflags & SVp_IOK) {
2893 (void)SvIOK_only(dstr);
2894 SvIVX(dstr) = SvIVX(sstr);
2895 if (sflags & SVf_IVisUV)
2899 if (dtype == SVt_PVGV) {
2900 if (ckWARN(WARN_MISC))
2901 Perl_warner(aTHX_ WARN_MISC, "Undefined value assigned to typeglob");
2904 (void)SvOK_off(dstr);
2910 =for apidoc sv_setsv_mg
2912 Like C<sv_setsv>, but also handles 'set' magic.
2918 Perl_sv_setsv_mg(pTHX_ SV *dstr, register SV *sstr)
2920 sv_setsv(dstr,sstr);
2925 =for apidoc sv_setpvn
2927 Copies a string into an SV. The C<len> parameter indicates the number of
2928 bytes to be copied. Does not handle 'set' magic. See C<sv_setpvn_mg>.
2934 Perl_sv_setpvn(pTHX_ register SV *sv, register const char *ptr, register STRLEN len)
2936 register char *dptr;
2937 assert(len >= 0); /* STRLEN is probably unsigned, so this may
2938 elicit a warning, but it won't hurt. */
2939 SV_CHECK_THINKFIRST(sv);
2944 (void)SvUPGRADE(sv, SVt_PV);
2946 SvGROW(sv, len + 1);
2948 Move(ptr,dptr,len,char);
2951 (void)SvPOK_only(sv); /* validate pointer */
2956 =for apidoc sv_setpvn_mg
2958 Like C<sv_setpvn>, but also handles 'set' magic.
2964 Perl_sv_setpvn_mg(pTHX_ register SV *sv, register const char *ptr, register STRLEN len)
2966 sv_setpvn(sv,ptr,len);
2971 =for apidoc sv_setpv
2973 Copies a string into an SV. The string must be null-terminated. Does not
2974 handle 'set' magic. See C<sv_setpv_mg>.
2980 Perl_sv_setpv(pTHX_ register SV *sv, register const char *ptr)
2982 register STRLEN len;
2984 SV_CHECK_THINKFIRST(sv);
2990 (void)SvUPGRADE(sv, SVt_PV);
2992 SvGROW(sv, len + 1);
2993 Move(ptr,SvPVX(sv),len+1,char);
2995 (void)SvPOK_only(sv); /* validate pointer */
3000 =for apidoc sv_setpv_mg
3002 Like C<sv_setpv>, but also handles 'set' magic.
3008 Perl_sv_setpv_mg(pTHX_ register SV *sv, register const char *ptr)
3015 =for apidoc sv_usepvn
3017 Tells an SV to use C<ptr> to find its string value. Normally the string is
3018 stored inside the SV but sv_usepvn allows the SV to use an outside string.
3019 The C<ptr> should point to memory that was allocated by C<malloc>. The
3020 string length, C<len>, must be supplied. This function will realloc the
3021 memory pointed to by C<ptr>, so that pointer should not be freed or used by
3022 the programmer after giving it to sv_usepvn. Does not handle 'set' magic.
3023 See C<sv_usepvn_mg>.
3029 Perl_sv_usepvn(pTHX_ register SV *sv, register char *ptr, register STRLEN len)
3031 SV_CHECK_THINKFIRST(sv);
3032 (void)SvUPGRADE(sv, SVt_PV);
3037 (void)SvOOK_off(sv);
3038 if (SvPVX(sv) && SvLEN(sv))
3039 Safefree(SvPVX(sv));
3040 Renew(ptr, len+1, char);
3043 SvLEN_set(sv, len+1);
3045 (void)SvPOK_only(sv); /* validate pointer */
3050 =for apidoc sv_usepvn_mg
3052 Like C<sv_usepvn>, but also handles 'set' magic.
3058 Perl_sv_usepvn_mg(pTHX_ register SV *sv, register char *ptr, register STRLEN len)
3060 sv_usepvn(sv,ptr,len);
3065 Perl_sv_force_normal(pTHX_ register SV *sv)
3067 if (SvREADONLY(sv)) {
3070 char *pvx = SvPVX(sv);
3071 STRLEN len = SvCUR(sv);
3072 U32 hash = SvUVX(sv);
3073 SvGROW(sv, len + 1);
3074 Move(pvx,SvPVX(sv),len,char);
3078 unsharepvn(pvx,len,hash);
3080 else if (PL_curcop != &PL_compiling)
3081 Perl_croak(aTHX_ PL_no_modify);
3085 else if (SvFAKE(sv) && SvTYPE(sv) == SVt_PVGV)
3092 Efficient removal of characters from the beginning of the string buffer.
3093 SvPOK(sv) must be true and the C<ptr> must be a pointer to somewhere inside
3094 the string buffer. The C<ptr> becomes the first character of the adjusted
3101 Perl_sv_chop(pTHX_ register SV *sv, register char *ptr) /* like set but assuming ptr is in sv */
3105 register STRLEN delta;
3107 if (!ptr || !SvPOKp(sv))
3109 SV_CHECK_THINKFIRST(sv);
3110 if (SvTYPE(sv) < SVt_PVIV)
3111 sv_upgrade(sv,SVt_PVIV);
3114 if (!SvLEN(sv)) { /* make copy of shared string */
3115 char *pvx = SvPVX(sv);
3116 STRLEN len = SvCUR(sv);
3117 SvGROW(sv, len + 1);
3118 Move(pvx,SvPVX(sv),len,char);
3122 SvFLAGS(sv) |= SVf_OOK;
3124 SvFLAGS(sv) &= ~(SVf_IOK|SVf_NOK|SVp_IOK|SVp_NOK|SVf_IVisUV);
3125 delta = ptr - SvPVX(sv);
3133 =for apidoc sv_catpvn
3135 Concatenates the string onto the end of the string which is in the SV. The
3136 C<len> indicates number of bytes to copy. Handles 'get' magic, but not
3137 'set' magic. See C<sv_catpvn_mg>.
3143 Perl_sv_catpvn(pTHX_ register SV *sv, register const char *ptr, register STRLEN len)
3148 junk = SvPV_force(sv, tlen);
3149 SvGROW(sv, tlen + len + 1);
3152 Move(ptr,SvPVX(sv)+tlen,len,char);
3155 (void)SvPOK_only_UTF8(sv); /* validate pointer */
3160 =for apidoc sv_catpvn_mg
3162 Like C<sv_catpvn>, but also handles 'set' magic.
3168 Perl_sv_catpvn_mg(pTHX_ register SV *sv, register const char *ptr, register STRLEN len)
3170 sv_catpvn(sv,ptr,len);
3175 =for apidoc sv_catsv
3177 Concatenates the string from SV C<ssv> onto the end of the string in SV
3178 C<dsv>. Handles 'get' magic, but not 'set' magic. See C<sv_catsv_mg>.
3184 Perl_sv_catsv(pTHX_ SV *dstr, register SV *sstr)
3190 if ((s = SvPV(sstr, len))) {
3191 if (DO_UTF8(sstr)) {
3192 sv_utf8_upgrade(dstr);
3193 sv_catpvn(dstr,s,len);
3197 sv_catpvn(dstr,s,len);
3202 =for apidoc sv_catsv_mg
3204 Like C<sv_catsv>, but also handles 'set' magic.
3210 Perl_sv_catsv_mg(pTHX_ SV *dstr, register SV *sstr)
3212 sv_catsv(dstr,sstr);
3217 =for apidoc sv_catpv
3219 Concatenates the string onto the end of the string which is in the SV.
3220 Handles 'get' magic, but not 'set' magic. See C<sv_catpv_mg>.
3226 Perl_sv_catpv(pTHX_ register SV *sv, register const char *ptr)
3228 register STRLEN len;
3234 junk = SvPV_force(sv, tlen);
3236 SvGROW(sv, tlen + len + 1);
3239 Move(ptr,SvPVX(sv)+tlen,len+1,char);
3241 (void)SvPOK_only_UTF8(sv); /* validate pointer */
3246 =for apidoc sv_catpv_mg
3248 Like C<sv_catpv>, but also handles 'set' magic.
3254 Perl_sv_catpv_mg(pTHX_ register SV *sv, register const char *ptr)
3261 Perl_newSV(pTHX_ STRLEN len)
3267 sv_upgrade(sv, SVt_PV);
3268 SvGROW(sv, len + 1);
3273 /* name is assumed to contain an SV* if (name && namelen == HEf_SVKEY) */
3276 =for apidoc sv_magic
3278 Adds magic to an SV.
3284 Perl_sv_magic(pTHX_ register SV *sv, SV *obj, int how, const char *name, I32 namlen)
3288 if (SvREADONLY(sv)) {
3290 if (PL_curcop != &PL_compiling && !strchr("gBf", how))
3291 Perl_croak(aTHX_ PL_no_modify);
3293 if (SvMAGICAL(sv) || (how == 't' && SvTYPE(sv) >= SVt_PVMG)) {
3294 if (SvMAGIC(sv) && (mg = mg_find(sv, how))) {
3301 (void)SvUPGRADE(sv, SVt_PVMG);
3303 Newz(702,mg, 1, MAGIC);
3304 mg->mg_moremagic = SvMAGIC(sv);
3307 if (!obj || obj == sv || how == '#' || how == 'r')
3311 mg->mg_obj = SvREFCNT_inc(obj);
3312 mg->mg_flags |= MGf_REFCOUNTED;
3315 mg->mg_len = namlen;
3318 mg->mg_ptr = savepvn(name, namlen);
3319 else if (namlen == HEf_SVKEY)
3320 mg->mg_ptr = (char*)SvREFCNT_inc((SV*)name);
3324 mg->mg_virtual = &PL_vtbl_sv;
3327 mg->mg_virtual = &PL_vtbl_amagic;
3330 mg->mg_virtual = &PL_vtbl_amagicelem;
3336 mg->mg_virtual = &PL_vtbl_bm;
3339 mg->mg_virtual = &PL_vtbl_regdata;
3342 mg->mg_virtual = &PL_vtbl_regdatum;
3345 mg->mg_virtual = &PL_vtbl_env;
3348 mg->mg_virtual = &PL_vtbl_fm;
3351 mg->mg_virtual = &PL_vtbl_envelem;
3354 mg->mg_virtual = &PL_vtbl_mglob;
3357 mg->mg_virtual = &PL_vtbl_isa;
3360 mg->mg_virtual = &PL_vtbl_isaelem;
3363 mg->mg_virtual = &PL_vtbl_nkeys;
3370 mg->mg_virtual = &PL_vtbl_dbline;
3374 mg->mg_virtual = &PL_vtbl_mutex;
3376 #endif /* USE_THREADS */
3377 #ifdef USE_LOCALE_COLLATE
3379 mg->mg_virtual = &PL_vtbl_collxfrm;
3381 #endif /* USE_LOCALE_COLLATE */
3383 mg->mg_virtual = &PL_vtbl_pack;
3387 mg->mg_virtual = &PL_vtbl_packelem;
3390 mg->mg_virtual = &PL_vtbl_regexp;
3393 mg->mg_virtual = &PL_vtbl_sig;
3396 mg->mg_virtual = &PL_vtbl_sigelem;
3399 mg->mg_virtual = &PL_vtbl_taint;
3403 mg->mg_virtual = &PL_vtbl_uvar;
3406 mg->mg_virtual = &PL_vtbl_vec;
3409 mg->mg_virtual = &PL_vtbl_substr;
3412 mg->mg_virtual = &PL_vtbl_defelem;
3415 mg->mg_virtual = &PL_vtbl_glob;
3418 mg->mg_virtual = &PL_vtbl_arylen;
3421 mg->mg_virtual = &PL_vtbl_pos;
3424 mg->mg_virtual = &PL_vtbl_backref;
3426 case '~': /* Reserved for use by extensions not perl internals. */
3427 /* Useful for attaching extension internal data to perl vars. */
3428 /* Note that multiple extensions may clash if magical scalars */
3429 /* etc holding private data from one are passed to another. */
3433 Perl_croak(aTHX_ "Don't know how to handle magic of type '%c'", how);
3437 SvFLAGS(sv) &= ~(SVf_IOK|SVf_NOK|SVf_POK);
3441 =for apidoc sv_unmagic
3443 Removes magic from an SV.
3449 Perl_sv_unmagic(pTHX_ SV *sv, int type)
3453 if (SvTYPE(sv) < SVt_PVMG || !SvMAGIC(sv))
3456 for (mg = *mgp; mg; mg = *mgp) {
3457 if (mg->mg_type == type) {
3458 MGVTBL* vtbl = mg->mg_virtual;
3459 *mgp = mg->mg_moremagic;
3460 if (vtbl && vtbl->svt_free)
3461 CALL_FPTR(vtbl->svt_free)(aTHX_ sv, mg);
3462 if (mg->mg_ptr && mg->mg_type != 'g')
3463 if (mg->mg_len >= 0)
3464 Safefree(mg->mg_ptr);
3465 else if (mg->mg_len == HEf_SVKEY)
3466 SvREFCNT_dec((SV*)mg->mg_ptr);
3467 if (mg->mg_flags & MGf_REFCOUNTED)
3468 SvREFCNT_dec(mg->mg_obj);
3472 mgp = &mg->mg_moremagic;
3476 SvFLAGS(sv) |= (SvFLAGS(sv) & (SVp_IOK|SVp_NOK|SVp_POK)) >> PRIVSHIFT;
3483 =for apidoc sv_rvweaken
3491 Perl_sv_rvweaken(pTHX_ SV *sv)
3494 if (!SvOK(sv)) /* let undefs pass */
3497 Perl_croak(aTHX_ "Can't weaken a nonreference");
3498 else if (SvWEAKREF(sv)) {
3500 if (ckWARN(WARN_MISC))
3501 Perl_warner(aTHX_ WARN_MISC, "Reference is already weak");
3505 sv_add_backref(tsv, sv);
3512 S_sv_add_backref(pTHX_ SV *tsv, SV *sv)
3516 if (SvMAGICAL(tsv) && (mg = mg_find(tsv, '<')))
3517 av = (AV*)mg->mg_obj;
3520 sv_magic(tsv, (SV*)av, '<', NULL, 0);
3521 SvREFCNT_dec(av); /* for sv_magic */
3527 S_sv_del_backref(pTHX_ SV *sv)
3534 if (!SvMAGICAL(tsv) || !(mg = mg_find(tsv, '<')))
3535 Perl_croak(aTHX_ "panic: del_backref");
3536 av = (AV *)mg->mg_obj;
3541 svp[i] = &PL_sv_undef; /* XXX */
3548 =for apidoc sv_insert
3550 Inserts a string at the specified offset/length within the SV. Similar to
3551 the Perl substr() function.
3557 Perl_sv_insert(pTHX_ SV *bigstr, STRLEN offset, STRLEN len, char *little, STRLEN littlelen)
3561 register char *midend;
3562 register char *bigend;
3568 Perl_croak(aTHX_ "Can't modify non-existent substring");
3569 SvPV_force(bigstr, curlen);
3570 (void)SvPOK_only_UTF8(bigstr);
3571 if (offset + len > curlen) {
3572 SvGROW(bigstr, offset+len+1);
3573 Zero(SvPVX(bigstr)+curlen, offset+len-curlen, char);
3574 SvCUR_set(bigstr, offset+len);
3578 i = littlelen - len;
3579 if (i > 0) { /* string might grow */
3580 big = SvGROW(bigstr, SvCUR(bigstr) + i + 1);
3581 mid = big + offset + len;
3582 midend = bigend = big + SvCUR(bigstr);
3585 while (midend > mid) /* shove everything down */
3586 *--bigend = *--midend;
3587 Move(little,big+offset,littlelen,char);
3593 Move(little,SvPVX(bigstr)+offset,len,char);
3598 big = SvPVX(bigstr);
3601 bigend = big + SvCUR(bigstr);
3603 if (midend > bigend)
3604 Perl_croak(aTHX_ "panic: sv_insert");
3606 if (mid - big > bigend - midend) { /* faster to shorten from end */
3608 Move(little, mid, littlelen,char);
3611 i = bigend - midend;
3613 Move(midend, mid, i,char);
3617 SvCUR_set(bigstr, mid - big);
3620 else if ((i = mid - big)) { /* faster from front */
3621 midend -= littlelen;
3623 sv_chop(bigstr,midend-i);
3628 Move(little, mid, littlelen,char);
3630 else if (littlelen) {
3631 midend -= littlelen;
3632 sv_chop(bigstr,midend);
3633 Move(little,midend,littlelen,char);
3636 sv_chop(bigstr,midend);
3642 =for apidoc sv_replace
3644 Make the first argument a copy of the second, then delete the original.
3650 Perl_sv_replace(pTHX_ register SV *sv, register SV *nsv)
3653 U32 refcnt = SvREFCNT(sv);
3654 SV_CHECK_THINKFIRST(sv);
3655 if (SvREFCNT(nsv) != 1 && ckWARN_d(WARN_INTERNAL))
3656 Perl_warner(aTHX_ WARN_INTERNAL, "Reference miscount in sv_replace()");
3657 if (SvMAGICAL(sv)) {
3661 sv_upgrade(nsv, SVt_PVMG);
3662 SvMAGIC(nsv) = SvMAGIC(sv);
3663 SvFLAGS(nsv) |= SvMAGICAL(sv);
3669 assert(!SvREFCNT(sv));
3670 StructCopy(nsv,sv,SV);
3671 SvREFCNT(sv) = refcnt;
3672 SvFLAGS(nsv) |= SVTYPEMASK; /* Mark as freed */
3677 =for apidoc sv_clear
3679 Clear an SV, making it empty. Does not free the memory used by the SV
3686 Perl_sv_clear(pTHX_ register SV *sv)
3690 assert(SvREFCNT(sv) == 0);
3694 if (PL_defstash) { /* Still have a symbol table? */
3699 Zero(&tmpref, 1, SV);
3700 sv_upgrade(&tmpref, SVt_RV);
3702 SvREADONLY_on(&tmpref); /* DESTROY() could be naughty */
3703 SvREFCNT(&tmpref) = 1;
3706 stash = SvSTASH(sv);
3707 destructor = gv_fetchmethod(SvSTASH(sv), "DESTROY");
3710 PUSHSTACKi(PERLSI_DESTROY);
3711 SvRV(&tmpref) = SvREFCNT_inc(sv);
3716 call_sv((SV*)GvCV(destructor),
3717 G_DISCARD|G_EVAL|G_KEEPERR);
3723 } while (SvOBJECT(sv) && SvSTASH(sv) != stash);
3725 del_XRV(SvANY(&tmpref));
3728 if (PL_in_clean_objs)
3729 Perl_croak(aTHX_ "DESTROY created new reference to dead object '%s'",
3731 /* DESTROY gave object new lease on life */
3737 SvREFCNT_dec(SvSTASH(sv)); /* possibly of changed persuasion */
3738 SvOBJECT_off(sv); /* Curse the object. */
3739 if (SvTYPE(sv) != SVt_PVIO)
3740 --PL_sv_objcount; /* XXX Might want something more general */
3743 if (SvTYPE(sv) >= SVt_PVMG && SvMAGIC(sv))
3746 switch (SvTYPE(sv)) {
3749 IoIFP(sv) != PerlIO_stdin() &&
3750 IoIFP(sv) != PerlIO_stdout() &&
3751 IoIFP(sv) != PerlIO_stderr())
3753 io_close((IO*)sv, FALSE);
3755 if (IoDIRP(sv) && !(IoFLAGS(sv) & IOf_FAKE_DIRP))
3756 PerlDir_close(IoDIRP(sv));
3757 IoDIRP(sv) = (DIR*)NULL;
3758 Safefree(IoTOP_NAME(sv));
3759 Safefree(IoFMT_NAME(sv));
3760 Safefree(IoBOTTOM_NAME(sv));
3775 SvREFCNT_dec(LvTARG(sv));
3779 Safefree(GvNAME(sv));
3780 /* cannot decrease stash refcount yet, as we might recursively delete
3781 ourselves when the refcnt drops to zero. Delay SvREFCNT_dec
3782 of stash until current sv is completely gone.
3783 -- JohnPC, 27 Mar 1998 */
3784 stash = GvSTASH(sv);
3790 (void)SvOOK_off(sv);
3798 SvREFCNT_dec(SvRV(sv));
3800 else if (SvPVX(sv) && SvLEN(sv))
3801 Safefree(SvPVX(sv));
3802 else if (SvPVX(sv) && SvREADONLY(sv) && SvFAKE(sv)) {
3803 unsharepvn(SvPVX(sv),SvCUR(sv),SvUVX(sv));
3815 switch (SvTYPE(sv)) {
3831 del_XPVIV(SvANY(sv));
3834 del_XPVNV(SvANY(sv));
3837 del_XPVMG(SvANY(sv));
3840 del_XPVLV(SvANY(sv));
3843 del_XPVAV(SvANY(sv));
3846 del_XPVHV(SvANY(sv));
3849 del_XPVCV(SvANY(sv));
3852 del_XPVGV(SvANY(sv));
3853 /* code duplication for increased performance. */
3854 SvFLAGS(sv) &= SVf_BREAK;
3855 SvFLAGS(sv) |= SVTYPEMASK;
3856 /* decrease refcount of the stash that owns this GV, if any */
3858 SvREFCNT_dec(stash);
3859 return; /* not break, SvFLAGS reset already happened */
3861 del_XPVBM(SvANY(sv));
3864 del_XPVFM(SvANY(sv));
3867 del_XPVIO(SvANY(sv));
3870 SvFLAGS(sv) &= SVf_BREAK;
3871 SvFLAGS(sv) |= SVTYPEMASK;
3875 Perl_sv_newref(pTHX_ SV *sv)
3878 ATOMIC_INC(SvREFCNT(sv));
3885 Free the memory used by an SV.
3891 Perl_sv_free(pTHX_ SV *sv)
3894 int refcount_is_zero;
3898 if (SvREFCNT(sv) == 0) {
3899 if (SvFLAGS(sv) & SVf_BREAK)
3901 if (PL_in_clean_all) /* All is fair */
3903 if (SvREADONLY(sv) && SvIMMORTAL(sv)) {
3904 /* make sure SvREFCNT(sv)==0 happens very seldom */
3905 SvREFCNT(sv) = (~(U32)0)/2;
3908 if (ckWARN_d(WARN_INTERNAL))
3909 Perl_warner(aTHX_ WARN_INTERNAL, "Attempt to free unreferenced scalar");
3912 ATOMIC_DEC_AND_TEST(refcount_is_zero, SvREFCNT(sv));
3913 if (!refcount_is_zero)
3917 if (ckWARN_d(WARN_DEBUGGING))
3918 Perl_warner(aTHX_ WARN_DEBUGGING,
3919 "Attempt to free temp prematurely: SV 0x%"UVxf,
3924 if (SvREADONLY(sv) && SvIMMORTAL(sv)) {
3925 /* make sure SvREFCNT(sv)==0 happens very seldom */
3926 SvREFCNT(sv) = (~(U32)0)/2;
3937 Returns the length of the string in the SV. See also C<SvCUR>.
3943 Perl_sv_len(pTHX_ register SV *sv)
3952 len = mg_length(sv);
3954 junk = SvPV(sv, len);
3959 =for apidoc sv_len_utf8
3961 Returns the number of characters in the string in an SV, counting wide
3962 UTF8 bytes as a single character.
3968 Perl_sv_len_utf8(pTHX_ register SV *sv)
3979 len = mg_length(sv);
3982 s = (U8*)SvPV(sv, len);
3993 Perl_sv_pos_u2b(pTHX_ register SV *sv, I32* offsetp, I32* lenp)
3998 I32 uoffset = *offsetp;
4004 start = s = (U8*)SvPV(sv, len);
4006 while (s < send && uoffset--)
4010 *offsetp = s - start;
4014 while (s < send && ulen--)
4024 Perl_sv_pos_b2u(pTHX_ register SV *sv, I32* offsetp)
4033 s = (U8*)SvPV(sv, len);
4035 Perl_croak(aTHX_ "panic: bad byte offset");
4036 send = s + *offsetp;
4044 if (ckWARN_d(WARN_UTF8))
4045 Perl_warner(aTHX_ WARN_UTF8, "Malformed UTF-8 character");
4055 Returns a boolean indicating whether the strings in the two SVs are
4062 Perl_sv_eq(pTHX_ register SV *sv1, register SV *sv2)
4069 bool pv1tmp = FALSE;
4070 bool pv2tmp = FALSE;
4077 pv1 = SvPV(sv1, cur1);
4084 pv2 = SvPV(sv2, cur2);
4086 /* do not utf8ize the comparands as a side-effect */
4087 if (cur1 && cur2 && SvUTF8(sv1) != SvUTF8(sv2) && !IN_BYTE && 0) {
4089 pv2 = (char*)bytes_to_utf8((U8*)pv2, &cur2);
4093 pv1 = (char*)bytes_to_utf8((U8*)pv1, &cur1);
4099 eq = memEQ(pv1, pv2, cur1);
4112 Compares the strings in two SVs. Returns -1, 0, or 1 indicating whether the
4113 string in C<sv1> is less than, equal to, or greater than the string in
4120 Perl_sv_cmp(pTHX_ register SV *sv1, register SV *sv2)
4125 bool pv1tmp = FALSE;
4126 bool pv2tmp = FALSE;
4133 pv1 = SvPV(sv1, cur1);
4140 pv2 = SvPV(sv2, cur2);
4142 /* do not utf8ize the comparands as a side-effect */
4143 if (cur1 && cur2 && SvUTF8(sv1) != SvUTF8(sv2) && !IN_BYTE) {
4145 pv2 = (char*)bytes_to_utf8((U8*)pv2, &cur2);
4149 pv1 = (char*)bytes_to_utf8((U8*)pv1, &cur1);
4155 cmp = cur2 ? -1 : 0;
4159 I32 retval = memcmp((void*)pv1, (void*)pv2, cur1 < cur2 ? cur1 : cur2);
4162 cmp = retval < 0 ? -1 : 1;
4163 } else if (cur1 == cur2) {
4166 cmp = cur1 < cur2 ? -1 : 1;
4179 =for apidoc sv_cmp_locale
4181 Compares the strings in two SVs in a locale-aware manner. See
4188 Perl_sv_cmp_locale(pTHX_ register SV *sv1, register SV *sv2)
4190 #ifdef USE_LOCALE_COLLATE
4196 if (PL_collation_standard)
4200 pv1 = sv1 ? sv_collxfrm(sv1, &len1) : (char *) NULL;
4202 pv2 = sv2 ? sv_collxfrm(sv2, &len2) : (char *) NULL;
4204 if (!pv1 || !len1) {
4215 retval = memcmp((void*)pv1, (void*)pv2, len1 < len2 ? len1 : len2);
4218 return retval < 0 ? -1 : 1;
4221 * When the result of collation is equality, that doesn't mean
4222 * that there are no differences -- some locales exclude some
4223 * characters from consideration. So to avoid false equalities,
4224 * we use the raw string as a tiebreaker.
4230 #endif /* USE_LOCALE_COLLATE */
4232 return sv_cmp(sv1, sv2);
4235 #ifdef USE_LOCALE_COLLATE
4237 * Any scalar variable may carry an 'o' magic that contains the
4238 * scalar data of the variable transformed to such a format that
4239 * a normal memory comparison can be used to compare the data
4240 * according to the locale settings.
4243 Perl_sv_collxfrm(pTHX_ SV *sv, STRLEN *nxp)
4247 mg = SvMAGICAL(sv) ? mg_find(sv, 'o') : (MAGIC *) NULL;
4248 if (!mg || !mg->mg_ptr || *(U32*)mg->mg_ptr != PL_collation_ix) {
4253 Safefree(mg->mg_ptr);
4255 if ((xf = mem_collxfrm(s, len, &xlen))) {
4256 if (SvREADONLY(sv)) {
4259 return xf + sizeof(PL_collation_ix);
4262 sv_magic(sv, 0, 'o', 0, 0);
4263 mg = mg_find(sv, 'o');
4276 if (mg && mg->mg_ptr) {
4278 return mg->mg_ptr + sizeof(PL_collation_ix);
4286 #endif /* USE_LOCALE_COLLATE */
4291 Get a line from the filehandle and store it into the SV, optionally
4292 appending to the currently-stored string.
4298 Perl_sv_gets(pTHX_ register SV *sv, register PerlIO *fp, I32 append)
4303 register STDCHAR rslast;
4304 register STDCHAR *bp;
4308 SV_CHECK_THINKFIRST(sv);
4309 (void)SvUPGRADE(sv, SVt_PV);
4313 if (RsSNARF(PL_rs)) {
4317 else if (RsRECORD(PL_rs)) {
4318 I32 recsize, bytesread;
4321 /* Grab the size of the record we're getting */
4322 recsize = SvIV(SvRV(PL_rs));
4323 (void)SvPOK_only(sv); /* Validate pointer */
4324 buffer = SvGROW(sv, recsize + 1);
4327 /* VMS wants read instead of fread, because fread doesn't respect */
4328 /* RMS record boundaries. This is not necessarily a good thing to be */
4329 /* doing, but we've got no other real choice */
4330 bytesread = PerlLIO_read(PerlIO_fileno(fp), buffer, recsize);
4332 bytesread = PerlIO_read(fp, buffer, recsize);
4334 SvCUR_set(sv, bytesread);
4335 buffer[bytesread] = '\0';
4336 return(SvCUR(sv) ? SvPVX(sv) : Nullch);
4338 else if (RsPARA(PL_rs)) {
4343 rsptr = SvPV(PL_rs, rslen);
4344 rslast = rslen ? rsptr[rslen - 1] : '\0';
4346 if (RsPARA(PL_rs)) { /* have to do this both before and after */
4347 do { /* to make sure file boundaries work right */
4350 i = PerlIO_getc(fp);
4354 PerlIO_ungetc(fp,i);
4360 /* See if we know enough about I/O mechanism to cheat it ! */
4362 /* This used to be #ifdef test - it is made run-time test for ease
4363 of abstracting out stdio interface. One call should be cheap
4364 enough here - and may even be a macro allowing compile
4368 if (PerlIO_fast_gets(fp)) {
4371 * We're going to steal some values from the stdio struct
4372 * and put EVERYTHING in the innermost loop into registers.
4374 register STDCHAR *ptr;
4378 #if defined(VMS) && defined(PERLIO_IS_STDIO)
4379 /* An ungetc()d char is handled separately from the regular
4380 * buffer, so we getc() it back out and stuff it in the buffer.
4382 i = PerlIO_getc(fp);
4383 if (i == EOF) return 0;
4384 *(--((*fp)->_ptr)) = (unsigned char) i;
4388 /* Here is some breathtakingly efficient cheating */
4390 cnt = PerlIO_get_cnt(fp); /* get count into register */
4391 (void)SvPOK_only(sv); /* validate pointer */
4392 if (SvLEN(sv) - append <= cnt + 1) { /* make sure we have the room */
4393 if (cnt > 80 && SvLEN(sv) > append) {
4394 shortbuffered = cnt - SvLEN(sv) + append + 1;
4395 cnt -= shortbuffered;
4399 /* remember that cnt can be negative */
4400 SvGROW(sv, append + (cnt <= 0 ? 2 : (cnt + 1)));
4405 bp = (STDCHAR*)SvPVX(sv) + append; /* move these two too to registers */
4406 ptr = (STDCHAR*)PerlIO_get_ptr(fp);
4407 DEBUG_P(PerlIO_printf(Perl_debug_log,
4408 "Screamer: entering, ptr=%"UVuf", cnt=%ld\n",PTR2UV(ptr),(long)cnt));
4409 DEBUG_P(PerlIO_printf(Perl_debug_log,
4410 "Screamer: entering: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
4411 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
4412 PTR2UV(PerlIO_has_base(fp) ? PerlIO_get_base(fp) : 0)));
4417 while (cnt > 0) { /* this | eat */
4419 if ((*bp++ = *ptr++) == rslast) /* really | dust */
4420 goto thats_all_folks; /* screams | sed :-) */
4424 Copy(ptr, bp, cnt, char); /* this | eat */
4425 bp += cnt; /* screams | dust */
4426 ptr += cnt; /* louder | sed :-) */
4431 if (shortbuffered) { /* oh well, must extend */
4432 cnt = shortbuffered;
4434 bpx = bp - (STDCHAR*)SvPVX(sv); /* box up before relocation */
4436 SvGROW(sv, SvLEN(sv) + append + cnt + 2);
4437 bp = (STDCHAR*)SvPVX(sv) + bpx; /* unbox after relocation */
4441 DEBUG_P(PerlIO_printf(Perl_debug_log,
4442 "Screamer: going to getc, ptr=%"UVuf", cnt=%ld\n",
4443 PTR2UV(ptr),(long)cnt));
4444 PerlIO_set_ptrcnt(fp, ptr, cnt); /* deregisterize cnt and ptr */
4445 DEBUG_P(PerlIO_printf(Perl_debug_log,
4446 "Screamer: pre: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
4447 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
4448 PTR2UV(PerlIO_has_base (fp) ? PerlIO_get_base(fp) : 0)));
4449 /* This used to call 'filbuf' in stdio form, but as that behaves like
4450 getc when cnt <= 0 we use PerlIO_getc here to avoid introducing
4451 another abstraction. */
4452 i = PerlIO_getc(fp); /* get more characters */
4453 DEBUG_P(PerlIO_printf(Perl_debug_log,
4454 "Screamer: post: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
4455 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
4456 PTR2UV(PerlIO_has_base (fp) ? PerlIO_get_base(fp) : 0)));
4457 cnt = PerlIO_get_cnt(fp);
4458 ptr = (STDCHAR*)PerlIO_get_ptr(fp); /* reregisterize cnt and ptr */
4459 DEBUG_P(PerlIO_printf(Perl_debug_log,
4460 "Screamer: after getc, ptr=%"UVuf", cnt=%ld\n",PTR2UV(ptr),(long)cnt));
4462 if (i == EOF) /* all done for ever? */
4463 goto thats_really_all_folks;
4465 bpx = bp - (STDCHAR*)SvPVX(sv); /* box up before relocation */
4467 SvGROW(sv, bpx + cnt + 2);
4468 bp = (STDCHAR*)SvPVX(sv) + bpx; /* unbox after relocation */
4470 *bp++ = i; /* store character from PerlIO_getc */
4472 if (rslen && (STDCHAR)i == rslast) /* all done for now? */
4473 goto thats_all_folks;
4477 if ((rslen > 1 && (bp - (STDCHAR*)SvPVX(sv) < rslen)) ||
4478 memNE((char*)bp - rslen, rsptr, rslen))
4479 goto screamer; /* go back to the fray */
4480 thats_really_all_folks:
4482 cnt += shortbuffered;
4483 DEBUG_P(PerlIO_printf(Perl_debug_log,
4484 "Screamer: quitting, ptr=%"UVuf", cnt=%ld\n",PTR2UV(ptr),(long)cnt));
4485 PerlIO_set_ptrcnt(fp, ptr, cnt); /* put these back or we're in trouble */
4486 DEBUG_P(PerlIO_printf(Perl_debug_log,
4487 "Screamer: end: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
4488 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
4489 PTR2UV(PerlIO_has_base (fp) ? PerlIO_get_base(fp) : 0)));
4491 SvCUR_set(sv, bp - (STDCHAR*)SvPVX(sv)); /* set length */
4492 DEBUG_P(PerlIO_printf(Perl_debug_log,
4493 "Screamer: done, len=%ld, string=|%.*s|\n",
4494 (long)SvCUR(sv),(int)SvCUR(sv),SvPVX(sv)));
4499 /*The big, slow, and stupid way */
4502 /* Need to work around EPOC SDK features */
4503 /* On WINS: MS VC5 generates calls to _chkstk, */
4504 /* if a `large' stack frame is allocated */
4505 /* gcc on MARM does not generate calls like these */
4511 register STDCHAR *bpe = buf + sizeof(buf);
4513 while ((i = PerlIO_getc(fp)) != EOF && (*bp++ = i) != rslast && bp < bpe)
4514 ; /* keep reading */
4518 cnt = PerlIO_read(fp,(char*)buf, sizeof(buf));
4519 /* Accomodate broken VAXC compiler, which applies U8 cast to
4520 * both args of ?: operator, causing EOF to change into 255
4522 if (cnt) { i = (U8)buf[cnt - 1]; } else { i = EOF; }
4526 sv_catpvn(sv, (char *) buf, cnt);
4528 sv_setpvn(sv, (char *) buf, cnt);
4530 if (i != EOF && /* joy */
4532 SvCUR(sv) < rslen ||
4533 memNE(SvPVX(sv) + SvCUR(sv) - rslen, rsptr, rslen)))
4537 * If we're reading from a TTY and we get a short read,
4538 * indicating that the user hit his EOF character, we need
4539 * to notice it now, because if we try to read from the TTY
4540 * again, the EOF condition will disappear.
4542 * The comparison of cnt to sizeof(buf) is an optimization
4543 * that prevents unnecessary calls to feof().
4547 if (!(cnt < sizeof(buf) && PerlIO_eof(fp)))
4552 if (RsPARA(PL_rs)) { /* have to do this both before and after */
4553 while (i != EOF) { /* to make sure file boundaries work right */
4554 i = PerlIO_getc(fp);
4556 PerlIO_ungetc(fp,i);
4562 return (SvCUR(sv) - append) ? SvPVX(sv) : Nullch;
4569 Auto-increment of the value in the SV.
4575 Perl_sv_inc(pTHX_ register SV *sv)
4584 if (SvTHINKFIRST(sv)) {
4585 if (SvREADONLY(sv)) {
4587 if (PL_curcop != &PL_compiling)
4588 Perl_croak(aTHX_ PL_no_modify);
4592 if (SvAMAGIC(sv) && AMG_CALLun(sv,inc))
4594 i = PTR2IV(SvRV(sv));
4599 flags = SvFLAGS(sv);
4600 if (flags & SVp_NOK) {
4601 (void)SvNOK_only(sv);
4605 if (flags & SVp_IOK) {
4607 if (SvUVX(sv) == UV_MAX)
4608 sv_setnv(sv, (NV)UV_MAX + 1.0);
4610 (void)SvIOK_only_UV(sv);
4613 if (SvIVX(sv) == IV_MAX)
4614 sv_setnv(sv, (NV)IV_MAX + 1.0);
4616 (void)SvIOK_only(sv);
4622 if (!(flags & SVp_POK) || !*SvPVX(sv)) {
4623 if ((flags & SVTYPEMASK) < SVt_PVNV)
4624 sv_upgrade(sv, SVt_NV);
4626 (void)SvNOK_only(sv);
4630 while (isALPHA(*d)) d++;
4631 while (isDIGIT(*d)) d++;
4633 sv_setnv(sv,Atof(SvPVX(sv)) + 1.0); /* punt */
4637 while (d >= SvPVX(sv)) {
4645 /* MKS: The original code here died if letters weren't consecutive.
4646 * at least it didn't have to worry about non-C locales. The
4647 * new code assumes that ('z'-'a')==('Z'-'A'), letters are
4648 * arranged in order (although not consecutively) and that only
4649 * [A-Za-z] are accepted by isALPHA in the C locale.
4651 if (*d != 'z' && *d != 'Z') {
4652 do { ++*d; } while (!isALPHA(*d));
4655 *(d--) -= 'z' - 'a';
4660 *(d--) -= 'z' - 'a' + 1;
4664 /* oh,oh, the number grew */
4665 SvGROW(sv, SvCUR(sv) + 2);
4667 for (d = SvPVX(sv) + SvCUR(sv); d > SvPVX(sv); d--)
4678 Auto-decrement of the value in the SV.
4684 Perl_sv_dec(pTHX_ register SV *sv)
4692 if (SvTHINKFIRST(sv)) {
4693 if (SvREADONLY(sv)) {
4695 if (PL_curcop != &PL_compiling)
4696 Perl_croak(aTHX_ PL_no_modify);
4700 if (SvAMAGIC(sv) && AMG_CALLun(sv,dec))
4702 i = PTR2IV(SvRV(sv));
4707 flags = SvFLAGS(sv);
4708 if (flags & SVp_NOK) {
4710 (void)SvNOK_only(sv);
4713 if (flags & SVp_IOK) {
4715 if (SvUVX(sv) == 0) {
4716 (void)SvIOK_only(sv);
4720 (void)SvIOK_only_UV(sv);
4724 if (SvIVX(sv) == IV_MIN)
4725 sv_setnv(sv, (NV)IV_MIN - 1.0);
4727 (void)SvIOK_only(sv);
4733 if (!(flags & SVp_POK)) {
4734 if ((flags & SVTYPEMASK) < SVt_PVNV)
4735 sv_upgrade(sv, SVt_NV);
4737 (void)SvNOK_only(sv);
4740 sv_setnv(sv,Atof(SvPVX(sv)) - 1.0); /* punt */
4744 =for apidoc sv_mortalcopy
4746 Creates a new SV which is a copy of the original SV. The new SV is marked
4752 /* Make a string that will exist for the duration of the expression
4753 * evaluation. Actually, it may have to last longer than that, but
4754 * hopefully we won't free it until it has been assigned to a
4755 * permanent location. */
4758 Perl_sv_mortalcopy(pTHX_ SV *oldstr)
4764 sv_setsv(sv,oldstr);
4766 PL_tmps_stack[++PL_tmps_ix] = sv;
4772 =for apidoc sv_newmortal
4774 Creates a new SV which is mortal. The reference count of the SV is set to 1.
4780 Perl_sv_newmortal(pTHX)
4786 SvFLAGS(sv) = SVs_TEMP;
4788 PL_tmps_stack[++PL_tmps_ix] = sv;
4793 =for apidoc sv_2mortal
4795 Marks an SV as mortal. The SV will be destroyed when the current context
4801 /* same thing without the copying */
4804 Perl_sv_2mortal(pTHX_ register SV *sv)
4809 if (SvREADONLY(sv) && SvIMMORTAL(sv))
4812 PL_tmps_stack[++PL_tmps_ix] = sv;
4820 Creates a new SV and copies a string into it. The reference count for the
4821 SV is set to 1. If C<len> is zero, Perl will compute the length using
4822 strlen(). For efficiency, consider using C<newSVpvn> instead.
4828 Perl_newSVpv(pTHX_ const char *s, STRLEN len)
4835 sv_setpvn(sv,s,len);
4840 =for apidoc newSVpvn
4842 Creates a new SV and copies a string into it. The reference count for the
4843 SV is set to 1. Note that if C<len> is zero, Perl will create a zero length
4844 string. You are responsible for ensuring that the source string is at least
4851 Perl_newSVpvn(pTHX_ const char *s, STRLEN len)
4856 sv_setpvn(sv,s,len);
4861 =for apidoc newSVpvn_share
4863 Creates a new SV and populates it with a string from
4864 the string table. Turns on READONLY and FAKE.
4865 The idea here is that as string table is used for shared hash
4866 keys these strings will have SvPVX == HeKEY and hash lookup
4867 will avoid string compare.
4873 Perl_newSVpvn_share(pTHX_ const char *src, STRLEN len, U32 hash)
4877 PERL_HASH(hash, src, len);
4879 sv_upgrade(sv, SVt_PVIV);
4880 SvPVX(sv) = sharepvn(src, len, hash);
4890 #if defined(PERL_IMPLICIT_CONTEXT)
4892 Perl_newSVpvf_nocontext(const char* pat, ...)
4897 va_start(args, pat);
4898 sv = vnewSVpvf(pat, &args);
4905 =for apidoc newSVpvf
4907 Creates a new SV an initialize it with the string formatted like
4914 Perl_newSVpvf(pTHX_ const char* pat, ...)
4918 va_start(args, pat);
4919 sv = vnewSVpvf(pat, &args);
4925 Perl_vnewSVpvf(pTHX_ const char* pat, va_list* args)
4929 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
4936 Creates a new SV and copies a floating point value into it.
4937 The reference count for the SV is set to 1.
4943 Perl_newSVnv(pTHX_ NV n)
4955 Creates a new SV and copies an integer into it. The reference count for the
4962 Perl_newSViv(pTHX_ IV i)
4974 Creates a new SV and copies an unsigned integer into it.
4975 The reference count for the SV is set to 1.
4981 Perl_newSVuv(pTHX_ UV u)
4991 =for apidoc newRV_noinc
4993 Creates an RV wrapper for an SV. The reference count for the original
4994 SV is B<not> incremented.
5000 Perl_newRV_noinc(pTHX_ SV *tmpRef)
5006 sv_upgrade(sv, SVt_RV);
5013 /* newRV_inc is #defined to newRV in sv.h */
5015 Perl_newRV(pTHX_ SV *tmpRef)
5017 return newRV_noinc(SvREFCNT_inc(tmpRef));
5023 Creates a new SV which is an exact duplicate of the original SV.
5028 /* make an exact duplicate of old */
5031 Perl_newSVsv(pTHX_ register SV *old)
5038 if (SvTYPE(old) == SVTYPEMASK) {
5039 if (ckWARN_d(WARN_INTERNAL))
5040 Perl_warner(aTHX_ WARN_INTERNAL, "semi-panic: attempt to dup freed string");
5055 Perl_sv_reset(pTHX_ register char *s, HV *stash)
5063 char todo[PERL_UCHAR_MAX+1];
5068 if (!*s) { /* reset ?? searches */
5069 for (pm = HvPMROOT(stash); pm; pm = pm->op_pmnext) {
5070 pm->op_pmdynflags &= ~PMdf_USED;
5075 /* reset variables */
5077 if (!HvARRAY(stash))
5080 Zero(todo, 256, char);
5082 i = (unsigned char)*s;
5086 max = (unsigned char)*s++;
5087 for ( ; i <= max; i++) {
5090 for (i = 0; i <= (I32) HvMAX(stash); i++) {
5091 for (entry = HvARRAY(stash)[i];
5093 entry = HeNEXT(entry))
5095 if (!todo[(U8)*HeKEY(entry)])
5097 gv = (GV*)HeVAL(entry);
5099 if (SvTHINKFIRST(sv)) {
5100 if (!SvREADONLY(sv) && SvROK(sv))
5105 if (SvTYPE(sv) >= SVt_PV) {
5107 if (SvPVX(sv) != Nullch)
5114 if (GvHV(gv) && !HvNAME(GvHV(gv))) {
5116 #ifndef VMS /* VMS has no environ array */
5118 environ[0] = Nullch;
5127 Perl_sv_2io(pTHX_ SV *sv)
5133 switch (SvTYPE(sv)) {
5141 Perl_croak(aTHX_ "Bad filehandle: %s", GvNAME(gv));
5145 Perl_croak(aTHX_ PL_no_usym, "filehandle");
5147 return sv_2io(SvRV(sv));
5148 gv = gv_fetchpv(SvPV(sv,n_a), FALSE, SVt_PVIO);
5154 Perl_croak(aTHX_ "Bad filehandle: %s", SvPV(sv,n_a));
5161 Perl_sv_2cv(pTHX_ SV *sv, HV **st, GV **gvp, I32 lref)
5168 return *gvp = Nullgv, Nullcv;
5169 switch (SvTYPE(sv)) {
5189 SV **sp = &sv; /* Used in tryAMAGICunDEREF macro. */
5190 tryAMAGICunDEREF(to_cv);
5193 if (SvTYPE(sv) == SVt_PVCV) {
5202 Perl_croak(aTHX_ "Not a subroutine reference");
5207 gv = gv_fetchpv(SvPV(sv, n_a), lref, SVt_PVCV);
5213 if (lref && !GvCVu(gv)) {
5216 tmpsv = NEWSV(704,0);
5217 gv_efullname3(tmpsv, gv, Nullch);
5218 /* XXX this is probably not what they think they're getting.
5219 * It has the same effect as "sub name;", i.e. just a forward
5221 newSUB(start_subparse(FALSE, 0),
5222 newSVOP(OP_CONST, 0, tmpsv),
5227 Perl_croak(aTHX_ "Unable to create sub named \"%s\"", SvPV(sv,n_a));
5236 Returns true if the SV has a true value by Perl's rules.
5242 Perl_sv_true(pTHX_ register SV *sv)
5249 if ((tXpv = (XPV*)SvANY(sv)) &&
5250 (tXpv->xpv_cur > 1 ||
5251 (tXpv->xpv_cur && *tXpv->xpv_pv != '0')))
5258 return SvIVX(sv) != 0;
5261 return SvNVX(sv) != 0.0;
5263 return sv_2bool(sv);
5269 Perl_sv_iv(pTHX_ register SV *sv)
5273 return (IV)SvUVX(sv);
5280 Perl_sv_uv(pTHX_ register SV *sv)
5285 return (UV)SvIVX(sv);
5291 Perl_sv_nv(pTHX_ register SV *sv)
5299 Perl_sv_pv(pTHX_ SV *sv)
5306 return sv_2pv(sv, &n_a);
5310 Perl_sv_pvn(pTHX_ SV *sv, STRLEN *lp)
5316 return sv_2pv(sv, lp);
5320 =for apidoc sv_pvn_force
5322 Get a sensible string out of the SV somehow.
5328 Perl_sv_pvn_force(pTHX_ SV *sv, STRLEN *lp)
5332 if (SvTHINKFIRST(sv) && !SvROK(sv))
5333 sv_force_normal(sv);
5339 if (SvTYPE(sv) > SVt_PVLV && SvTYPE(sv) != SVt_PVFM) {
5341 Perl_croak(aTHX_ "Can't coerce %s to string in %s", sv_reftype(sv,0),
5342 PL_op_name[PL_op->op_type]);
5346 if (s != SvPVX(sv)) { /* Almost, but not quite, sv_setpvn() */
5351 (void)SvUPGRADE(sv, SVt_PV); /* Never FALSE */
5352 SvGROW(sv, len + 1);
5353 Move(s,SvPVX(sv),len,char);
5358 SvPOK_on(sv); /* validate pointer */
5360 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2pv(%s)\n",
5361 PTR2UV(sv),SvPVX(sv)));
5368 Perl_sv_pvbyte(pTHX_ SV *sv)
5374 Perl_sv_pvbyten(pTHX_ SV *sv, STRLEN *lp)
5376 return sv_pvn(sv,lp);
5380 Perl_sv_pvbyten_force(pTHX_ SV *sv, STRLEN *lp)
5382 return sv_pvn_force(sv,lp);
5386 Perl_sv_pvutf8(pTHX_ SV *sv)
5388 sv_utf8_upgrade(sv);
5393 Perl_sv_pvutf8n(pTHX_ SV *sv, STRLEN *lp)
5395 sv_utf8_upgrade(sv);
5396 return sv_pvn(sv,lp);
5400 =for apidoc sv_pvutf8n_force
5402 Get a sensible UTF8-encoded string out of the SV somehow. See
5409 Perl_sv_pvutf8n_force(pTHX_ SV *sv, STRLEN *lp)
5411 sv_utf8_upgrade(sv);
5412 return sv_pvn_force(sv,lp);
5416 =for apidoc sv_reftype
5418 Returns a string describing what the SV is a reference to.
5424 Perl_sv_reftype(pTHX_ SV *sv, int ob)
5426 if (ob && SvOBJECT(sv))
5427 return HvNAME(SvSTASH(sv));
5429 switch (SvTYPE(sv)) {
5443 case SVt_PVLV: return "LVALUE";
5444 case SVt_PVAV: return "ARRAY";
5445 case SVt_PVHV: return "HASH";
5446 case SVt_PVCV: return "CODE";
5447 case SVt_PVGV: return "GLOB";
5448 case SVt_PVFM: return "FORMAT";
5449 case SVt_PVIO: return "IO";
5450 default: return "UNKNOWN";
5456 =for apidoc sv_isobject
5458 Returns a boolean indicating whether the SV is an RV pointing to a blessed
5459 object. If the SV is not an RV, or if the object is not blessed, then this
5466 Perl_sv_isobject(pTHX_ SV *sv)
5483 Returns a boolean indicating whether the SV is blessed into the specified
5484 class. This does not check for subtypes; use C<sv_derived_from> to verify
5485 an inheritance relationship.
5491 Perl_sv_isa(pTHX_ SV *sv, const char *name)
5503 return strEQ(HvNAME(SvSTASH(sv)), name);
5509 Creates a new SV for the RV, C<rv>, to point to. If C<rv> is not an RV then
5510 it will be upgraded to one. If C<classname> is non-null then the new SV will
5511 be blessed in the specified package. The new SV is returned and its
5512 reference count is 1.
5518 Perl_newSVrv(pTHX_ SV *rv, const char *classname)
5525 SV_CHECK_THINKFIRST(rv);
5528 if (SvTYPE(rv) >= SVt_PVMG) {
5529 U32 refcnt = SvREFCNT(rv);
5533 SvREFCNT(rv) = refcnt;
5536 if (SvTYPE(rv) < SVt_RV)
5537 sv_upgrade(rv, SVt_RV);
5538 else if (SvTYPE(rv) > SVt_RV) {
5539 (void)SvOOK_off(rv);
5540 if (SvPVX(rv) && SvLEN(rv))
5541 Safefree(SvPVX(rv));
5551 HV* stash = gv_stashpv(classname, TRUE);
5552 (void)sv_bless(rv, stash);
5558 =for apidoc sv_setref_pv
5560 Copies a pointer into a new SV, optionally blessing the SV. The C<rv>
5561 argument will be upgraded to an RV. That RV will be modified to point to
5562 the new SV. If the C<pv> argument is NULL then C<PL_sv_undef> will be placed
5563 into the SV. The C<classname> argument indicates the package for the
5564 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
5565 will be returned and will have a reference count of 1.
5567 Do not use with other Perl types such as HV, AV, SV, CV, because those
5568 objects will become corrupted by the pointer copy process.
5570 Note that C<sv_setref_pvn> copies the string while this copies the pointer.
5576 Perl_sv_setref_pv(pTHX_ SV *rv, const char *classname, void *pv)
5579 sv_setsv(rv, &PL_sv_undef);
5583 sv_setiv(newSVrv(rv,classname), PTR2IV(pv));
5588 =for apidoc sv_setref_iv
5590 Copies an integer into a new SV, optionally blessing the SV. The C<rv>
5591 argument will be upgraded to an RV. That RV will be modified to point to
5592 the new SV. The C<classname> argument indicates the package for the
5593 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
5594 will be returned and will have a reference count of 1.
5600 Perl_sv_setref_iv(pTHX_ SV *rv, const char *classname, IV iv)
5602 sv_setiv(newSVrv(rv,classname), iv);
5607 =for apidoc sv_setref_nv
5609 Copies a double into a new SV, optionally blessing the SV. The C<rv>
5610 argument will be upgraded to an RV. That RV will be modified to point to
5611 the new SV. The C<classname> argument indicates the package for the
5612 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
5613 will be returned and will have a reference count of 1.
5619 Perl_sv_setref_nv(pTHX_ SV *rv, const char *classname, NV nv)
5621 sv_setnv(newSVrv(rv,classname), nv);
5626 =for apidoc sv_setref_pvn
5628 Copies a string into a new SV, optionally blessing the SV. The length of the
5629 string must be specified with C<n>. The C<rv> argument will be upgraded to
5630 an RV. That RV will be modified to point to the new SV. The C<classname>
5631 argument indicates the package for the blessing. Set C<classname> to
5632 C<Nullch> to avoid the blessing. The new SV will be returned and will have
5633 a reference count of 1.
5635 Note that C<sv_setref_pv> copies the pointer while this copies the string.
5641 Perl_sv_setref_pvn(pTHX_ SV *rv, const char *classname, char *pv, STRLEN n)
5643 sv_setpvn(newSVrv(rv,classname), pv, n);
5648 =for apidoc sv_bless
5650 Blesses an SV into a specified package. The SV must be an RV. The package
5651 must be designated by its stash (see C<gv_stashpv()>). The reference count
5652 of the SV is unaffected.
5658 Perl_sv_bless(pTHX_ SV *sv, HV *stash)
5663 Perl_croak(aTHX_ "Can't bless non-reference value");
5665 if (SvFLAGS(tmpRef) & (SVs_OBJECT|SVf_READONLY)) {
5666 if (SvREADONLY(tmpRef))
5667 Perl_croak(aTHX_ PL_no_modify);
5668 if (SvOBJECT(tmpRef)) {
5669 if (SvTYPE(tmpRef) != SVt_PVIO)
5671 SvREFCNT_dec(SvSTASH(tmpRef));
5674 SvOBJECT_on(tmpRef);
5675 if (SvTYPE(tmpRef) != SVt_PVIO)
5677 (void)SvUPGRADE(tmpRef, SVt_PVMG);
5678 SvSTASH(tmpRef) = (HV*)SvREFCNT_inc(stash);
5689 S_sv_unglob(pTHX_ SV *sv)
5693 assert(SvTYPE(sv) == SVt_PVGV);
5698 SvREFCNT_dec(GvSTASH(sv));
5699 GvSTASH(sv) = Nullhv;
5701 sv_unmagic(sv, '*');
5702 Safefree(GvNAME(sv));
5705 /* need to keep SvANY(sv) in the right arena */
5706 xpvmg = new_XPVMG();
5707 StructCopy(SvANY(sv), xpvmg, XPVMG);
5708 del_XPVGV(SvANY(sv));
5711 SvFLAGS(sv) &= ~SVTYPEMASK;
5712 SvFLAGS(sv) |= SVt_PVMG;
5716 =for apidoc sv_unref
5718 Unsets the RV status of the SV, and decrements the reference count of
5719 whatever was being referenced by the RV. This can almost be thought of
5720 as a reversal of C<newSVrv>. See C<SvROK_off>.
5726 Perl_sv_unref(pTHX_ SV *sv)
5730 if (SvWEAKREF(sv)) {
5738 if (SvREFCNT(rv) != 1 || SvREADONLY(rv))
5741 sv_2mortal(rv); /* Schedule for freeing later */
5745 Perl_sv_taint(pTHX_ SV *sv)
5747 sv_magic((sv), Nullsv, 't', Nullch, 0);
5751 Perl_sv_untaint(pTHX_ SV *sv)
5753 if (SvTYPE(sv) >= SVt_PVMG && SvMAGIC(sv)) {
5754 MAGIC *mg = mg_find(sv, 't');
5761 Perl_sv_tainted(pTHX_ SV *sv)
5763 if (SvTYPE(sv) >= SVt_PVMG && SvMAGIC(sv)) {
5764 MAGIC *mg = mg_find(sv, 't');
5765 if (mg && ((mg->mg_len & 1) || ((mg->mg_len & 2) && mg->mg_obj == sv)))
5772 =for apidoc sv_setpviv
5774 Copies an integer into the given SV, also updating its string value.
5775 Does not handle 'set' magic. See C<sv_setpviv_mg>.
5781 Perl_sv_setpviv(pTHX_ SV *sv, IV iv)
5783 char buf[TYPE_CHARS(UV)];
5785 char *ptr = uiv_2buf(buf, iv, 0, 0, &ebuf);
5787 sv_setpvn(sv, ptr, ebuf - ptr);
5792 =for apidoc sv_setpviv_mg
5794 Like C<sv_setpviv>, but also handles 'set' magic.
5800 Perl_sv_setpviv_mg(pTHX_ SV *sv, IV iv)
5802 char buf[TYPE_CHARS(UV)];
5804 char *ptr = uiv_2buf(buf, iv, 0, 0, &ebuf);
5806 sv_setpvn(sv, ptr, ebuf - ptr);
5810 #if defined(PERL_IMPLICIT_CONTEXT)
5812 Perl_sv_setpvf_nocontext(SV *sv, const char* pat, ...)
5816 va_start(args, pat);
5817 sv_vsetpvf(sv, pat, &args);
5823 Perl_sv_setpvf_mg_nocontext(SV *sv, const char* pat, ...)
5827 va_start(args, pat);
5828 sv_vsetpvf_mg(sv, pat, &args);
5834 =for apidoc sv_setpvf
5836 Processes its arguments like C<sprintf> and sets an SV to the formatted
5837 output. Does not handle 'set' magic. See C<sv_setpvf_mg>.
5843 Perl_sv_setpvf(pTHX_ SV *sv, const char* pat, ...)
5846 va_start(args, pat);
5847 sv_vsetpvf(sv, pat, &args);
5852 Perl_sv_vsetpvf(pTHX_ SV *sv, const char* pat, va_list* args)
5854 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
5858 =for apidoc sv_setpvf_mg
5860 Like C<sv_setpvf>, but also handles 'set' magic.
5866 Perl_sv_setpvf_mg(pTHX_ SV *sv, const char* pat, ...)
5869 va_start(args, pat);
5870 sv_vsetpvf_mg(sv, pat, &args);
5875 Perl_sv_vsetpvf_mg(pTHX_ SV *sv, const char* pat, va_list* args)
5877 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
5881 #if defined(PERL_IMPLICIT_CONTEXT)
5883 Perl_sv_catpvf_nocontext(SV *sv, const char* pat, ...)
5887 va_start(args, pat);
5888 sv_vcatpvf(sv, pat, &args);
5893 Perl_sv_catpvf_mg_nocontext(SV *sv, const char* pat, ...)
5897 va_start(args, pat);
5898 sv_vcatpvf_mg(sv, pat, &args);
5904 =for apidoc sv_catpvf
5906 Processes its arguments like C<sprintf> and appends the formatted output
5907 to an SV. Handles 'get' magic, but not 'set' magic. C<SvSETMAGIC()> must
5908 typically be called after calling this function to handle 'set' magic.
5914 Perl_sv_catpvf(pTHX_ SV *sv, const char* pat, ...)
5917 va_start(args, pat);
5918 sv_vcatpvf(sv, pat, &args);
5923 Perl_sv_vcatpvf(pTHX_ SV *sv, const char* pat, va_list* args)
5925 sv_vcatpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
5929 =for apidoc sv_catpvf_mg
5931 Like C<sv_catpvf>, but also handles 'set' magic.
5937 Perl_sv_catpvf_mg(pTHX_ SV *sv, const char* pat, ...)
5940 va_start(args, pat);
5941 sv_vcatpvf_mg(sv, pat, &args);
5946 Perl_sv_vcatpvf_mg(pTHX_ SV *sv, const char* pat, va_list* args)
5948 sv_vcatpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
5953 =for apidoc sv_vsetpvfn
5955 Works like C<vcatpvfn> but copies the text into the SV instead of
5962 Perl_sv_vsetpvfn(pTHX_ SV *sv, const char *pat, STRLEN patlen, va_list *args, SV **svargs, I32 svmax, bool *maybe_tainted)
5964 sv_setpvn(sv, "", 0);
5965 sv_vcatpvfn(sv, pat, patlen, args, svargs, svmax, maybe_tainted);
5969 =for apidoc sv_vcatpvfn
5971 Processes its arguments like C<vsprintf> and appends the formatted output
5972 to an SV. Uses an array of SVs if the C style variable argument list is
5973 missing (NULL). When running with taint checks enabled, indicates via
5974 C<maybe_tainted> if results are untrustworthy (often due to the use of
5981 Perl_sv_vcatpvfn(pTHX_ SV *sv, const char *pat, STRLEN patlen, va_list *args, SV **svargs, I32 svmax, bool *maybe_tainted)
5989 static char nullstr[] = "(null)";
5992 /* no matter what, this is a string now */
5993 (void)SvPV_force(sv, origlen);
5995 /* special-case "", "%s", and "%_" */
5998 if (patlen == 2 && pat[0] == '%') {
6002 char *s = va_arg(*args, char*);
6003 sv_catpv(sv, s ? s : nullstr);
6005 else if (svix < svmax) {
6006 sv_catsv(sv, *svargs);
6007 if (DO_UTF8(*svargs))
6013 argsv = va_arg(*args, SV*);
6014 sv_catsv(sv, argsv);
6019 /* See comment on '_' below */
6024 patend = (char*)pat + patlen;
6025 for (p = (char*)pat; p < patend; p = q) {
6028 bool vectorize = FALSE;
6035 bool has_precis = FALSE;
6037 bool is_utf = FALSE;
6040 U8 utf8buf[UTF8_MAXLEN];
6041 STRLEN esignlen = 0;
6043 char *eptr = Nullch;
6045 /* Times 4: a decimal digit takes more than 3 binary digits.
6046 * NV_DIG: mantissa takes than many decimal digits.
6047 * Plus 32: Playing safe. */
6048 char ebuf[IV_DIG * 4 + NV_DIG + 32];
6049 /* large enough for "%#.#f" --chip */
6050 /* what about long double NVs? --jhi */
6053 U8 *vecstr = Null(U8*);
6065 STRLEN dotstrlen = 1;
6067 for (q = p; q < patend && *q != '%'; ++q) ;
6069 sv_catpvn(sv, p, q - p);
6098 case '*': /* printf("%*vX",":",$ipv6addr) */
6103 vecsv = va_arg(*args, SV*);
6104 else if (svix < svmax)
6105 vecsv = svargs[svix++];
6108 dotstr = SvPVx(vecsv,dotstrlen);
6127 case '1': case '2': case '3':
6128 case '4': case '5': case '6':
6129 case '7': case '8': case '9':
6132 width = width * 10 + (*q++ - '0');
6137 i = va_arg(*args, int);
6139 i = (svix < svmax) ? SvIVx(svargs[svix++]) : 0;
6141 width = (i < 0) ? -i : i;
6152 i = va_arg(*args, int);
6154 i = (svix < svmax) ? SvIVx(svargs[svix++]) : 0;
6155 precis = (i < 0) ? 0 : i;
6161 precis = precis * 10 + (*q++ - '0');
6168 vecsv = va_arg(*args, SV*);
6169 vecstr = (U8*)SvPVx(vecsv,veclen);
6170 utf = DO_UTF8(vecsv);
6172 else if (svix < svmax) {
6173 vecsv = svargs[svix++];
6174 vecstr = (U8*)SvPVx(vecsv,veclen);
6175 utf = DO_UTF8(vecsv);
6186 #if defined(HAS_QUAD) || (defined(HAS_LONG_DOUBLE) && defined(USE_LONG_DOUBLE))
6197 #if defined(HAS_QUAD) || (defined(HAS_LONG_DOUBLE) && defined(USE_LONG_DOUBLE))
6198 if (*(q + 1) == 'l') { /* lld, llf */
6225 uv = va_arg(*args, int);
6227 uv = (svix < svmax) ? SvIVx(svargs[svix++]) : 0;
6228 if ((uv > 255 || (uv > 127 && SvUTF8(sv))) && !IN_BYTE) {
6229 eptr = (char*)utf8buf;
6230 elen = uv_to_utf8((U8*)eptr, uv) - utf8buf;
6242 eptr = va_arg(*args, char*);
6244 #ifdef MACOS_TRADITIONAL
6245 /* On MacOS, %#s format is used for Pascal strings */
6250 elen = strlen(eptr);
6253 elen = sizeof nullstr - 1;
6256 else if (svix < svmax) {
6257 argsv = svargs[svix++];
6258 eptr = SvPVx(argsv, elen);
6259 if (DO_UTF8(argsv)) {
6260 if (has_precis && precis < elen) {
6262 sv_pos_u2b(argsv, &p, 0); /* sticks at end */
6265 if (width) { /* fudge width (can't fudge elen) */
6266 width += elen - sv_len_utf8(argsv);
6275 * The "%_" hack might have to be changed someday,
6276 * if ISO or ANSI decide to use '_' for something.
6277 * So we keep it hidden from users' code.
6281 argsv = va_arg(*args,SV*);
6282 eptr = SvPVx(argsv, elen);
6288 if (has_precis && elen > precis)
6298 uv = PTR2UV(va_arg(*args, void*));
6300 uv = (svix < svmax) ? PTR2UV(svargs[svix++]) : 0;
6320 iv = (IV)utf8_to_uv(vecstr, &ulen, 0);
6330 case 'h': iv = (short)va_arg(*args, int); break;
6331 default: iv = va_arg(*args, int); break;
6332 case 'l': iv = va_arg(*args, long); break;
6333 case 'V': iv = va_arg(*args, IV); break;
6335 case 'q': iv = va_arg(*args, Quad_t); break;
6340 iv = (svix < svmax) ? SvIVx(svargs[svix++]) : 0;
6342 case 'h': iv = (short)iv; break;
6344 case 'l': iv = (long)iv; break;
6347 case 'q': iv = (Quad_t)iv; break;
6354 esignbuf[esignlen++] = plus;
6358 esignbuf[esignlen++] = '-';
6402 uv = utf8_to_uv(vecstr, &ulen, 0);
6412 case 'h': uv = (unsigned short)va_arg(*args, unsigned); break;
6413 default: uv = va_arg(*args, unsigned); break;
6414 case 'l': uv = va_arg(*args, unsigned long); break;
6415 case 'V': uv = va_arg(*args, UV); break;
6417 case 'q': uv = va_arg(*args, Quad_t); break;
6422 uv = (svix < svmax) ? SvUVx(svargs[svix++]) : 0;
6424 case 'h': uv = (unsigned short)uv; break;
6426 case 'l': uv = (unsigned long)uv; break;
6429 case 'q': uv = (Quad_t)uv; break;
6435 eptr = ebuf + sizeof ebuf;
6441 p = (char*)((c == 'X')
6442 ? "0123456789ABCDEF" : "0123456789abcdef");
6448 esignbuf[esignlen++] = '0';
6449 esignbuf[esignlen++] = c; /* 'x' or 'X' */
6455 *--eptr = '0' + dig;
6457 if (alt && *eptr != '0')
6463 *--eptr = '0' + dig;
6466 esignbuf[esignlen++] = '0';
6467 esignbuf[esignlen++] = 'b';
6470 default: /* it had better be ten or less */
6471 #if defined(PERL_Y2KWARN)
6472 if (ckWARN(WARN_Y2K)) {
6474 char *s = SvPV(sv,n);
6475 if (n >= 2 && s[n-2] == '1' && s[n-1] == '9'
6476 && (n == 2 || !isDIGIT(s[n-3])))
6478 Perl_warner(aTHX_ WARN_Y2K,
6479 "Possible Y2K bug: %%%c %s",
6480 c, "format string following '19'");
6486 *--eptr = '0' + dig;
6487 } while (uv /= base);
6490 elen = (ebuf + sizeof ebuf) - eptr;
6493 zeros = precis - elen;
6494 else if (precis == 0 && elen == 1 && *eptr == '0')
6499 /* FLOATING POINT */
6502 c = 'f'; /* maybe %F isn't supported here */
6508 /* This is evil, but floating point is even more evil */
6512 nv = va_arg(*args, NV);
6514 nv = (svix < svmax) ? SvNVx(svargs[svix++]) : 0.0;
6517 if (c != 'e' && c != 'E') {
6519 (void)Perl_frexp(nv, &i);
6520 if (i == PERL_INT_MIN)
6521 Perl_die(aTHX_ "panic: frexp");
6523 need = BIT_DIGITS(i);
6525 need += has_precis ? precis : 6; /* known default */
6529 need += 20; /* fudge factor */
6530 if (PL_efloatsize < need) {
6531 Safefree(PL_efloatbuf);
6532 PL_efloatsize = need + 20; /* more fudge */
6533 New(906, PL_efloatbuf, PL_efloatsize, char);
6534 PL_efloatbuf[0] = '\0';
6537 eptr = ebuf + sizeof ebuf;
6540 #if defined(USE_LONG_DOUBLE) && defined(PERL_PRIfldbl)
6542 /* Copy the one or more characters in a long double
6543 * format before the 'base' ([efgEFG]) character to
6544 * the format string. */
6545 static char const prifldbl[] = PERL_PRIfldbl;
6546 char const *p = prifldbl + sizeof(prifldbl) - 3;
6547 while (p >= prifldbl) { *--eptr = *p--; }
6552 do { *--eptr = '0' + (base % 10); } while (base /= 10);
6557 do { *--eptr = '0' + (base % 10); } while (base /= 10);
6570 STORE_NUMERIC_STANDARD_SET_LOCAL();
6571 #ifdef USE_LOCALE_NUMERIC
6572 if (!was_standard && maybe_tainted)
6573 *maybe_tainted = TRUE;
6575 (void)sprintf(PL_efloatbuf, eptr, nv);
6576 RESTORE_NUMERIC_STANDARD();
6579 eptr = PL_efloatbuf;
6580 elen = strlen(PL_efloatbuf);
6587 i = SvCUR(sv) - origlen;
6590 case 'h': *(va_arg(*args, short*)) = i; break;
6591 default: *(va_arg(*args, int*)) = i; break;
6592 case 'l': *(va_arg(*args, long*)) = i; break;
6593 case 'V': *(va_arg(*args, IV*)) = i; break;
6595 case 'q': *(va_arg(*args, Quad_t*)) = i; break;
6599 else if (svix < svmax)
6600 sv_setuv_mg(svargs[svix++], (UV)i);
6601 continue; /* not "break" */
6608 if (!args && ckWARN(WARN_PRINTF) &&
6609 (PL_op->op_type == OP_PRTF || PL_op->op_type == OP_SPRINTF)) {
6610 SV *msg = sv_newmortal();
6611 Perl_sv_setpvf(aTHX_ msg, "Invalid conversion in %s: ",
6612 (PL_op->op_type == OP_PRTF) ? "printf" : "sprintf");
6615 Perl_sv_catpvf(aTHX_ msg,
6616 "\"%%%c\"", c & 0xFF);
6618 Perl_sv_catpvf(aTHX_ msg,
6619 "\"%%\\%03"UVof"\"",
6622 sv_catpv(msg, "end of string");
6623 Perl_warner(aTHX_ WARN_PRINTF, "%"SVf, msg); /* yes, this is reentrant */
6626 /* output mangled stuff ... */
6632 /* ... right here, because formatting flags should not apply */
6633 SvGROW(sv, SvCUR(sv) + elen + 1);
6635 memcpy(p, eptr, elen);
6638 SvCUR(sv) = p - SvPVX(sv);
6639 continue; /* not "break" */
6642 have = esignlen + zeros + elen;
6643 need = (have > width ? have : width);
6646 SvGROW(sv, SvCUR(sv) + need + dotstrlen + 1);
6648 if (esignlen && fill == '0') {
6649 for (i = 0; i < esignlen; i++)
6653 memset(p, fill, gap);
6656 if (esignlen && fill != '0') {
6657 for (i = 0; i < esignlen; i++)
6661 for (i = zeros; i; i--)
6665 memcpy(p, eptr, elen);
6669 memset(p, ' ', gap);
6674 memcpy(p, dotstr, dotstrlen);
6678 vectorize = FALSE; /* done iterating over vecstr */
6683 SvCUR(sv) = p - SvPVX(sv);
6691 #if defined(USE_ITHREADS)
6693 #if defined(USE_THREADS)
6694 # include "error: USE_THREADS and USE_ITHREADS are incompatible"
6697 #ifndef GpREFCNT_inc
6698 # define GpREFCNT_inc(gp) ((gp) ? (++(gp)->gp_refcnt, (gp)) : (GP*)NULL)
6702 #define sv_dup_inc(s) SvREFCNT_inc(sv_dup(s))
6703 #define av_dup(s) (AV*)sv_dup((SV*)s)
6704 #define av_dup_inc(s) (AV*)SvREFCNT_inc(sv_dup((SV*)s))
6705 #define hv_dup(s) (HV*)sv_dup((SV*)s)
6706 #define hv_dup_inc(s) (HV*)SvREFCNT_inc(sv_dup((SV*)s))
6707 #define cv_dup(s) (CV*)sv_dup((SV*)s)
6708 #define cv_dup_inc(s) (CV*)SvREFCNT_inc(sv_dup((SV*)s))
6709 #define io_dup(s) (IO*)sv_dup((SV*)s)
6710 #define io_dup_inc(s) (IO*)SvREFCNT_inc(sv_dup((SV*)s))
6711 #define gv_dup(s) (GV*)sv_dup((SV*)s)
6712 #define gv_dup_inc(s) (GV*)SvREFCNT_inc(sv_dup((SV*)s))
6713 #define SAVEPV(p) (p ? savepv(p) : Nullch)
6714 #define SAVEPVN(p,n) (p ? savepvn(p,n) : Nullch)
6717 Perl_re_dup(pTHX_ REGEXP *r)
6719 /* XXX fix when pmop->op_pmregexp becomes shared */
6720 return ReREFCNT_inc(r);
6724 Perl_fp_dup(pTHX_ PerlIO *fp, char type)
6728 return (PerlIO*)NULL;
6730 /* look for it in the table first */
6731 ret = (PerlIO*)ptr_table_fetch(PL_ptr_table, fp);
6735 /* create anew and remember what it is */
6736 ret = PerlIO_fdupopen(fp);
6737 ptr_table_store(PL_ptr_table, fp, ret);
6742 Perl_dirp_dup(pTHX_ DIR *dp)
6751 Perl_gp_dup(pTHX_ GP *gp)
6756 /* look for it in the table first */
6757 ret = (GP*)ptr_table_fetch(PL_ptr_table, gp);
6761 /* create anew and remember what it is */
6762 Newz(0, ret, 1, GP);
6763 ptr_table_store(PL_ptr_table, gp, ret);
6766 ret->gp_refcnt = 0; /* must be before any other dups! */
6767 ret->gp_sv = sv_dup_inc(gp->gp_sv);
6768 ret->gp_io = io_dup_inc(gp->gp_io);
6769 ret->gp_form = cv_dup_inc(gp->gp_form);
6770 ret->gp_av = av_dup_inc(gp->gp_av);
6771 ret->gp_hv = hv_dup_inc(gp->gp_hv);
6772 ret->gp_egv = gv_dup(gp->gp_egv); /* GvEGV is not refcounted */
6773 ret->gp_cv = cv_dup_inc(gp->gp_cv);
6774 ret->gp_cvgen = gp->gp_cvgen;
6775 ret->gp_flags = gp->gp_flags;
6776 ret->gp_line = gp->gp_line;
6777 ret->gp_file = gp->gp_file; /* points to COP.cop_file */
6782 Perl_mg_dup(pTHX_ MAGIC *mg)
6784 MAGIC *mgret = (MAGIC*)NULL;
6787 return (MAGIC*)NULL;
6788 /* look for it in the table first */
6789 mgret = (MAGIC*)ptr_table_fetch(PL_ptr_table, mg);
6793 for (; mg; mg = mg->mg_moremagic) {
6795 Newz(0, nmg, 1, MAGIC);
6799 mgprev->mg_moremagic = nmg;
6800 nmg->mg_virtual = mg->mg_virtual; /* XXX copy dynamic vtable? */
6801 nmg->mg_private = mg->mg_private;
6802 nmg->mg_type = mg->mg_type;
6803 nmg->mg_flags = mg->mg_flags;
6804 if (mg->mg_type == 'r') {
6805 nmg->mg_obj = (SV*)re_dup((REGEXP*)mg->mg_obj);
6808 nmg->mg_obj = (mg->mg_flags & MGf_REFCOUNTED)
6809 ? sv_dup_inc(mg->mg_obj)
6810 : sv_dup(mg->mg_obj);
6812 nmg->mg_len = mg->mg_len;
6813 nmg->mg_ptr = mg->mg_ptr; /* XXX random ptr? */
6814 if (mg->mg_ptr && mg->mg_type != 'g') {
6815 if (mg->mg_len >= 0) {
6816 nmg->mg_ptr = SAVEPVN(mg->mg_ptr, mg->mg_len);
6817 if (mg->mg_type == 'c' && AMT_AMAGIC((AMT*)mg->mg_ptr)) {
6818 AMT *amtp = (AMT*)mg->mg_ptr;
6819 AMT *namtp = (AMT*)nmg->mg_ptr;
6821 for (i = 1; i < NofAMmeth; i++) {
6822 namtp->table[i] = cv_dup_inc(amtp->table[i]);
6826 else if (mg->mg_len == HEf_SVKEY)
6827 nmg->mg_ptr = (char*)sv_dup_inc((SV*)mg->mg_ptr);
6835 Perl_ptr_table_new(pTHX)
6838 Newz(0, tbl, 1, PTR_TBL_t);
6841 Newz(0, tbl->tbl_ary, tbl->tbl_max + 1, PTR_TBL_ENT_t*);
6846 Perl_ptr_table_fetch(pTHX_ PTR_TBL_t *tbl, void *sv)
6848 PTR_TBL_ENT_t *tblent;
6849 UV hash = PTR2UV(sv);
6851 tblent = tbl->tbl_ary[hash & tbl->tbl_max];
6852 for (; tblent; tblent = tblent->next) {
6853 if (tblent->oldval == sv)
6854 return tblent->newval;
6860 Perl_ptr_table_store(pTHX_ PTR_TBL_t *tbl, void *oldv, void *newv)
6862 PTR_TBL_ENT_t *tblent, **otblent;
6863 /* XXX this may be pessimal on platforms where pointers aren't good
6864 * hash values e.g. if they grow faster in the most significant
6866 UV hash = PTR2UV(oldv);
6870 otblent = &tbl->tbl_ary[hash & tbl->tbl_max];
6871 for (tblent = *otblent; tblent; i=0, tblent = tblent->next) {
6872 if (tblent->oldval == oldv) {
6873 tblent->newval = newv;
6878 Newz(0, tblent, 1, PTR_TBL_ENT_t);
6879 tblent->oldval = oldv;
6880 tblent->newval = newv;
6881 tblent->next = *otblent;
6884 if (i && tbl->tbl_items > tbl->tbl_max)
6885 ptr_table_split(tbl);
6889 Perl_ptr_table_split(pTHX_ PTR_TBL_t *tbl)
6891 PTR_TBL_ENT_t **ary = tbl->tbl_ary;
6892 UV oldsize = tbl->tbl_max + 1;
6893 UV newsize = oldsize * 2;
6896 Renew(ary, newsize, PTR_TBL_ENT_t*);
6897 Zero(&ary[oldsize], newsize-oldsize, PTR_TBL_ENT_t*);
6898 tbl->tbl_max = --newsize;
6900 for (i=0; i < oldsize; i++, ary++) {
6901 PTR_TBL_ENT_t **curentp, **entp, *ent;
6904 curentp = ary + oldsize;
6905 for (entp = ary, ent = *ary; ent; ent = *entp) {
6906 if ((newsize & PTR2UV(ent->oldval)) != i) {
6908 ent->next = *curentp;
6923 Perl_sv_dup(pTHX_ SV *sstr)
6927 if (!sstr || SvTYPE(sstr) == SVTYPEMASK)
6929 /* look for it in the table first */
6930 dstr = (SV*)ptr_table_fetch(PL_ptr_table, sstr);
6934 /* create anew and remember what it is */
6936 ptr_table_store(PL_ptr_table, sstr, dstr);
6939 SvFLAGS(dstr) = SvFLAGS(sstr);
6940 SvFLAGS(dstr) &= ~SVf_OOK; /* don't propagate OOK hack */
6941 SvREFCNT(dstr) = 0; /* must be before any other dups! */
6944 if (SvANY(sstr) && PL_watch_pvx && SvPVX(sstr) == PL_watch_pvx)
6945 PerlIO_printf(Perl_debug_log, "watch at %p hit, found string \"%s\"\n",
6946 PL_watch_pvx, SvPVX(sstr));
6949 switch (SvTYPE(sstr)) {
6954 SvANY(dstr) = new_XIV();
6955 SvIVX(dstr) = SvIVX(sstr);
6958 SvANY(dstr) = new_XNV();
6959 SvNVX(dstr) = SvNVX(sstr);
6962 SvANY(dstr) = new_XRV();
6963 SvRV(dstr) = sv_dup_inc(SvRV(sstr));
6966 SvANY(dstr) = new_XPV();
6967 SvCUR(dstr) = SvCUR(sstr);
6968 SvLEN(dstr) = SvLEN(sstr);
6970 SvRV(dstr) = sv_dup_inc(SvRV(sstr));
6971 else if (SvPVX(sstr) && SvLEN(sstr))
6972 SvPVX(dstr) = SAVEPVN(SvPVX(sstr), SvLEN(sstr)-1);
6974 SvPVX(dstr) = SvPVX(sstr); /* XXX shared string/random ptr? */
6977 SvANY(dstr) = new_XPVIV();
6978 SvCUR(dstr) = SvCUR(sstr);
6979 SvLEN(dstr) = SvLEN(sstr);
6980 SvIVX(dstr) = SvIVX(sstr);
6982 SvRV(dstr) = sv_dup_inc(SvRV(sstr));
6983 else if (SvPVX(sstr) && SvLEN(sstr))
6984 SvPVX(dstr) = SAVEPVN(SvPVX(sstr), SvLEN(sstr)-1);
6986 SvPVX(dstr) = SvPVX(sstr); /* XXX shared string/random ptr? */
6989 SvANY(dstr) = new_XPVNV();
6990 SvCUR(dstr) = SvCUR(sstr);
6991 SvLEN(dstr) = SvLEN(sstr);
6992 SvIVX(dstr) = SvIVX(sstr);
6993 SvNVX(dstr) = SvNVX(sstr);
6995 SvRV(dstr) = sv_dup_inc(SvRV(sstr));
6996 else if (SvPVX(sstr) && SvLEN(sstr))
6997 SvPVX(dstr) = SAVEPVN(SvPVX(sstr), SvLEN(sstr)-1);
6999 SvPVX(dstr) = SvPVX(sstr); /* XXX shared string/random ptr? */
7002 SvANY(dstr) = new_XPVMG();
7003 SvCUR(dstr) = SvCUR(sstr);
7004 SvLEN(dstr) = SvLEN(sstr);
7005 SvIVX(dstr) = SvIVX(sstr);
7006 SvNVX(dstr) = SvNVX(sstr);
7007 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr));
7008 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr));
7010 SvRV(dstr) = sv_dup_inc(SvRV(sstr));
7011 else if (SvPVX(sstr) && SvLEN(sstr))
7012 SvPVX(dstr) = SAVEPVN(SvPVX(sstr), SvLEN(sstr)-1);
7014 SvPVX(dstr) = SvPVX(sstr); /* XXX shared string/random ptr? */
7017 SvANY(dstr) = new_XPVBM();
7018 SvCUR(dstr) = SvCUR(sstr);
7019 SvLEN(dstr) = SvLEN(sstr);
7020 SvIVX(dstr) = SvIVX(sstr);
7021 SvNVX(dstr) = SvNVX(sstr);
7022 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr));
7023 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr));
7025 SvRV(dstr) = sv_dup_inc(SvRV(sstr));
7026 else if (SvPVX(sstr) && SvLEN(sstr))
7027 SvPVX(dstr) = SAVEPVN(SvPVX(sstr), SvLEN(sstr)-1);
7029 SvPVX(dstr) = SvPVX(sstr); /* XXX shared string/random ptr? */
7030 BmRARE(dstr) = BmRARE(sstr);
7031 BmUSEFUL(dstr) = BmUSEFUL(sstr);
7032 BmPREVIOUS(dstr)= BmPREVIOUS(sstr);
7035 SvANY(dstr) = new_XPVLV();
7036 SvCUR(dstr) = SvCUR(sstr);
7037 SvLEN(dstr) = SvLEN(sstr);
7038 SvIVX(dstr) = SvIVX(sstr);
7039 SvNVX(dstr) = SvNVX(sstr);
7040 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr));
7041 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr));
7043 SvRV(dstr) = sv_dup_inc(SvRV(sstr));
7044 else if (SvPVX(sstr) && SvLEN(sstr))
7045 SvPVX(dstr) = SAVEPVN(SvPVX(sstr), SvLEN(sstr)-1);
7047 SvPVX(dstr) = SvPVX(sstr); /* XXX shared string/random ptr? */
7048 LvTARGOFF(dstr) = LvTARGOFF(sstr); /* XXX sometimes holds PMOP* when DEBUGGING */
7049 LvTARGLEN(dstr) = LvTARGLEN(sstr);
7050 LvTARG(dstr) = sv_dup_inc(LvTARG(sstr));
7051 LvTYPE(dstr) = LvTYPE(sstr);
7054 SvANY(dstr) = new_XPVGV();
7055 SvCUR(dstr) = SvCUR(sstr);
7056 SvLEN(dstr) = SvLEN(sstr);
7057 SvIVX(dstr) = SvIVX(sstr);
7058 SvNVX(dstr) = SvNVX(sstr);
7059 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr));
7060 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr));
7062 SvRV(dstr) = sv_dup_inc(SvRV(sstr));
7063 else if (SvPVX(sstr) && SvLEN(sstr))
7064 SvPVX(dstr) = SAVEPVN(SvPVX(sstr), SvLEN(sstr)-1);
7066 SvPVX(dstr) = SvPVX(sstr); /* XXX shared string/random ptr? */
7067 GvNAMELEN(dstr) = GvNAMELEN(sstr);
7068 GvNAME(dstr) = SAVEPVN(GvNAME(sstr), GvNAMELEN(sstr));
7069 GvSTASH(dstr) = hv_dup_inc(GvSTASH(sstr));
7070 GvFLAGS(dstr) = GvFLAGS(sstr);
7071 GvGP(dstr) = gp_dup(GvGP(sstr));
7072 (void)GpREFCNT_inc(GvGP(dstr));
7075 SvANY(dstr) = new_XPVIO();
7076 SvCUR(dstr) = SvCUR(sstr);
7077 SvLEN(dstr) = SvLEN(sstr);
7078 SvIVX(dstr) = SvIVX(sstr);
7079 SvNVX(dstr) = SvNVX(sstr);
7080 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr));
7081 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr));
7083 SvRV(dstr) = sv_dup_inc(SvRV(sstr));
7084 else if (SvPVX(sstr) && SvLEN(sstr))
7085 SvPVX(dstr) = SAVEPVN(SvPVX(sstr), SvLEN(sstr)-1);
7087 SvPVX(dstr) = SvPVX(sstr); /* XXX shared string/random ptr? */
7088 IoIFP(dstr) = fp_dup(IoIFP(sstr), IoTYPE(sstr));
7089 if (IoOFP(sstr) == IoIFP(sstr))
7090 IoOFP(dstr) = IoIFP(dstr);
7092 IoOFP(dstr) = fp_dup(IoOFP(sstr), IoTYPE(sstr));
7093 /* PL_rsfp_filters entries have fake IoDIRP() */
7094 if (IoDIRP(sstr) && !(IoFLAGS(sstr) & IOf_FAKE_DIRP))
7095 IoDIRP(dstr) = dirp_dup(IoDIRP(sstr));
7097 IoDIRP(dstr) = IoDIRP(sstr);
7098 IoLINES(dstr) = IoLINES(sstr);
7099 IoPAGE(dstr) = IoPAGE(sstr);
7100 IoPAGE_LEN(dstr) = IoPAGE_LEN(sstr);
7101 IoLINES_LEFT(dstr) = IoLINES_LEFT(sstr);
7102 IoTOP_NAME(dstr) = SAVEPV(IoTOP_NAME(sstr));
7103 IoTOP_GV(dstr) = gv_dup(IoTOP_GV(sstr));
7104 IoFMT_NAME(dstr) = SAVEPV(IoFMT_NAME(sstr));
7105 IoFMT_GV(dstr) = gv_dup(IoFMT_GV(sstr));
7106 IoBOTTOM_NAME(dstr) = SAVEPV(IoBOTTOM_NAME(sstr));
7107 IoBOTTOM_GV(dstr) = gv_dup(IoBOTTOM_GV(sstr));
7108 IoSUBPROCESS(dstr) = IoSUBPROCESS(sstr);
7109 IoTYPE(dstr) = IoTYPE(sstr);
7110 IoFLAGS(dstr) = IoFLAGS(sstr);
7113 SvANY(dstr) = new_XPVAV();
7114 SvCUR(dstr) = SvCUR(sstr);
7115 SvLEN(dstr) = SvLEN(sstr);
7116 SvIVX(dstr) = SvIVX(sstr);
7117 SvNVX(dstr) = SvNVX(sstr);
7118 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr));
7119 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr));
7120 AvARYLEN((AV*)dstr) = sv_dup_inc(AvARYLEN((AV*)sstr));
7121 AvFLAGS((AV*)dstr) = AvFLAGS((AV*)sstr);
7122 if (AvARRAY((AV*)sstr)) {
7123 SV **dst_ary, **src_ary;
7124 SSize_t items = AvFILLp((AV*)sstr) + 1;
7126 src_ary = AvARRAY((AV*)sstr);
7127 Newz(0, dst_ary, AvMAX((AV*)sstr)+1, SV*);
7128 ptr_table_store(PL_ptr_table, src_ary, dst_ary);
7129 SvPVX(dstr) = (char*)dst_ary;
7130 AvALLOC((AV*)dstr) = dst_ary;
7131 if (AvREAL((AV*)sstr)) {
7133 *dst_ary++ = sv_dup_inc(*src_ary++);
7137 *dst_ary++ = sv_dup(*src_ary++);
7139 items = AvMAX((AV*)sstr) - AvFILLp((AV*)sstr);
7140 while (items-- > 0) {
7141 *dst_ary++ = &PL_sv_undef;
7145 SvPVX(dstr) = Nullch;
7146 AvALLOC((AV*)dstr) = (SV**)NULL;
7150 SvANY(dstr) = new_XPVHV();
7151 SvCUR(dstr) = SvCUR(sstr);
7152 SvLEN(dstr) = SvLEN(sstr);
7153 SvIVX(dstr) = SvIVX(sstr);
7154 SvNVX(dstr) = SvNVX(sstr);
7155 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr));
7156 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr));
7157 HvRITER((HV*)dstr) = HvRITER((HV*)sstr);
7158 if (HvARRAY((HV*)sstr)) {
7160 XPVHV *dxhv = (XPVHV*)SvANY(dstr);
7161 XPVHV *sxhv = (XPVHV*)SvANY(sstr);
7162 Newz(0, dxhv->xhv_array,
7163 PERL_HV_ARRAY_ALLOC_BYTES(dxhv->xhv_max+1), char);
7164 while (i <= sxhv->xhv_max) {
7165 ((HE**)dxhv->xhv_array)[i] = he_dup(((HE**)sxhv->xhv_array)[i],
7166 !!HvSHAREKEYS(sstr));
7169 dxhv->xhv_eiter = he_dup(sxhv->xhv_eiter, !!HvSHAREKEYS(sstr));
7172 SvPVX(dstr) = Nullch;
7173 HvEITER((HV*)dstr) = (HE*)NULL;
7175 HvPMROOT((HV*)dstr) = HvPMROOT((HV*)sstr); /* XXX */
7176 HvNAME((HV*)dstr) = SAVEPV(HvNAME((HV*)sstr));
7179 SvANY(dstr) = new_XPVFM();
7180 FmLINES(dstr) = FmLINES(sstr);
7184 SvANY(dstr) = new_XPVCV();
7186 SvCUR(dstr) = SvCUR(sstr);
7187 SvLEN(dstr) = SvLEN(sstr);
7188 SvIVX(dstr) = SvIVX(sstr);
7189 SvNVX(dstr) = SvNVX(sstr);
7190 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr));
7191 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr));
7192 if (SvPVX(sstr) && SvLEN(sstr))
7193 SvPVX(dstr) = SAVEPVN(SvPVX(sstr), SvLEN(sstr)-1);
7195 SvPVX(dstr) = SvPVX(sstr); /* XXX shared string/random ptr? */
7196 CvSTASH(dstr) = hv_dup(CvSTASH(sstr));/* NOTE: not refcounted */
7197 CvSTART(dstr) = CvSTART(sstr);
7198 CvROOT(dstr) = OpREFCNT_inc(CvROOT(sstr));
7199 CvXSUB(dstr) = CvXSUB(sstr);
7200 CvXSUBANY(dstr) = CvXSUBANY(sstr);
7201 CvGV(dstr) = gv_dup_inc(CvGV(sstr));
7202 CvDEPTH(dstr) = CvDEPTH(sstr);
7203 if (CvPADLIST(sstr) && !AvREAL(CvPADLIST(sstr))) {
7204 /* XXX padlists are real, but pretend to be not */
7205 AvREAL_on(CvPADLIST(sstr));
7206 CvPADLIST(dstr) = av_dup_inc(CvPADLIST(sstr));
7207 AvREAL_off(CvPADLIST(sstr));
7208 AvREAL_off(CvPADLIST(dstr));
7211 CvPADLIST(dstr) = av_dup_inc(CvPADLIST(sstr));
7212 CvOUTSIDE(dstr) = cv_dup_inc(CvOUTSIDE(sstr));
7213 CvFLAGS(dstr) = CvFLAGS(sstr);
7216 Perl_croak(aTHX_ "Bizarre SvTYPE [%d]", SvTYPE(sstr));
7220 if (SvOBJECT(dstr) && SvTYPE(dstr) != SVt_PVIO)
7227 Perl_cx_dup(pTHX_ PERL_CONTEXT *cxs, I32 ix, I32 max)
7232 return (PERL_CONTEXT*)NULL;
7234 /* look for it in the table first */
7235 ncxs = (PERL_CONTEXT*)ptr_table_fetch(PL_ptr_table, cxs);
7239 /* create anew and remember what it is */
7240 Newz(56, ncxs, max + 1, PERL_CONTEXT);
7241 ptr_table_store(PL_ptr_table, cxs, ncxs);
7244 PERL_CONTEXT *cx = &cxs[ix];
7245 PERL_CONTEXT *ncx = &ncxs[ix];
7246 ncx->cx_type = cx->cx_type;
7247 if (CxTYPE(cx) == CXt_SUBST) {
7248 Perl_croak(aTHX_ "Cloning substitution context is unimplemented");
7251 ncx->blk_oldsp = cx->blk_oldsp;
7252 ncx->blk_oldcop = cx->blk_oldcop;
7253 ncx->blk_oldretsp = cx->blk_oldretsp;
7254 ncx->blk_oldmarksp = cx->blk_oldmarksp;
7255 ncx->blk_oldscopesp = cx->blk_oldscopesp;
7256 ncx->blk_oldpm = cx->blk_oldpm;
7257 ncx->blk_gimme = cx->blk_gimme;
7258 switch (CxTYPE(cx)) {
7260 ncx->blk_sub.cv = (cx->blk_sub.olddepth == 0
7261 ? cv_dup_inc(cx->blk_sub.cv)
7262 : cv_dup(cx->blk_sub.cv));
7263 ncx->blk_sub.argarray = (cx->blk_sub.hasargs
7264 ? av_dup_inc(cx->blk_sub.argarray)
7266 ncx->blk_sub.savearray = av_dup(cx->blk_sub.savearray);
7267 ncx->blk_sub.olddepth = cx->blk_sub.olddepth;
7268 ncx->blk_sub.hasargs = cx->blk_sub.hasargs;
7269 ncx->blk_sub.lval = cx->blk_sub.lval;
7272 ncx->blk_eval.old_in_eval = cx->blk_eval.old_in_eval;
7273 ncx->blk_eval.old_op_type = cx->blk_eval.old_op_type;
7274 ncx->blk_eval.old_namesv = sv_dup_inc(cx->blk_eval.old_namesv);
7275 ncx->blk_eval.old_eval_root = cx->blk_eval.old_eval_root;
7276 ncx->blk_eval.cur_text = sv_dup(cx->blk_eval.cur_text);
7279 ncx->blk_loop.label = cx->blk_loop.label;
7280 ncx->blk_loop.resetsp = cx->blk_loop.resetsp;
7281 ncx->blk_loop.redo_op = cx->blk_loop.redo_op;
7282 ncx->blk_loop.next_op = cx->blk_loop.next_op;
7283 ncx->blk_loop.last_op = cx->blk_loop.last_op;
7284 ncx->blk_loop.iterdata = (CxPADLOOP(cx)
7285 ? cx->blk_loop.iterdata
7286 : gv_dup((GV*)cx->blk_loop.iterdata));
7287 ncx->blk_loop.oldcurpad
7288 = (SV**)ptr_table_fetch(PL_ptr_table,
7289 cx->blk_loop.oldcurpad);
7290 ncx->blk_loop.itersave = sv_dup_inc(cx->blk_loop.itersave);
7291 ncx->blk_loop.iterlval = sv_dup_inc(cx->blk_loop.iterlval);
7292 ncx->blk_loop.iterary = av_dup_inc(cx->blk_loop.iterary);
7293 ncx->blk_loop.iterix = cx->blk_loop.iterix;
7294 ncx->blk_loop.itermax = cx->blk_loop.itermax;
7297 ncx->blk_sub.cv = cv_dup(cx->blk_sub.cv);
7298 ncx->blk_sub.gv = gv_dup(cx->blk_sub.gv);
7299 ncx->blk_sub.dfoutgv = gv_dup_inc(cx->blk_sub.dfoutgv);
7300 ncx->blk_sub.hasargs = cx->blk_sub.hasargs;
7313 Perl_si_dup(pTHX_ PERL_SI *si)
7318 return (PERL_SI*)NULL;
7320 /* look for it in the table first */
7321 nsi = (PERL_SI*)ptr_table_fetch(PL_ptr_table, si);
7325 /* create anew and remember what it is */
7326 Newz(56, nsi, 1, PERL_SI);
7327 ptr_table_store(PL_ptr_table, si, nsi);
7329 nsi->si_stack = av_dup_inc(si->si_stack);
7330 nsi->si_cxix = si->si_cxix;
7331 nsi->si_cxmax = si->si_cxmax;
7332 nsi->si_cxstack = cx_dup(si->si_cxstack, si->si_cxix, si->si_cxmax);
7333 nsi->si_type = si->si_type;
7334 nsi->si_prev = si_dup(si->si_prev);
7335 nsi->si_next = si_dup(si->si_next);
7336 nsi->si_markoff = si->si_markoff;
7341 #define POPINT(ss,ix) ((ss)[--(ix)].any_i32)
7342 #define TOPINT(ss,ix) ((ss)[ix].any_i32)
7343 #define POPLONG(ss,ix) ((ss)[--(ix)].any_long)
7344 #define TOPLONG(ss,ix) ((ss)[ix].any_long)
7345 #define POPIV(ss,ix) ((ss)[--(ix)].any_iv)
7346 #define TOPIV(ss,ix) ((ss)[ix].any_iv)
7347 #define POPPTR(ss,ix) ((ss)[--(ix)].any_ptr)
7348 #define TOPPTR(ss,ix) ((ss)[ix].any_ptr)
7349 #define POPDPTR(ss,ix) ((ss)[--(ix)].any_dptr)
7350 #define TOPDPTR(ss,ix) ((ss)[ix].any_dptr)
7351 #define POPDXPTR(ss,ix) ((ss)[--(ix)].any_dxptr)
7352 #define TOPDXPTR(ss,ix) ((ss)[ix].any_dxptr)
7355 #define pv_dup_inc(p) SAVEPV(p)
7356 #define pv_dup(p) SAVEPV(p)
7357 #define svp_dup_inc(p,pp) any_dup(p,pp)
7360 Perl_any_dup(pTHX_ void *v, PerlInterpreter *proto_perl)
7367 /* look for it in the table first */
7368 ret = ptr_table_fetch(PL_ptr_table, v);
7372 /* see if it is part of the interpreter structure */
7373 if (v >= (void*)proto_perl && v < (void*)(proto_perl+1))
7374 ret = (void*)(((char*)aTHXo) + (((char*)v) - (char*)proto_perl));
7382 Perl_ss_dup(pTHX_ PerlInterpreter *proto_perl)
7384 ANY *ss = proto_perl->Tsavestack;
7385 I32 ix = proto_perl->Tsavestack_ix;
7386 I32 max = proto_perl->Tsavestack_max;
7399 void (*dptr) (void*);
7400 void (*dxptr) (pTHXo_ void*);
7403 Newz(54, nss, max, ANY);
7409 case SAVEt_ITEM: /* normal string */
7410 sv = (SV*)POPPTR(ss,ix);
7411 TOPPTR(nss,ix) = sv_dup_inc(sv);
7412 sv = (SV*)POPPTR(ss,ix);
7413 TOPPTR(nss,ix) = sv_dup_inc(sv);
7415 case SAVEt_SV: /* scalar reference */
7416 sv = (SV*)POPPTR(ss,ix);
7417 TOPPTR(nss,ix) = sv_dup_inc(sv);
7418 gv = (GV*)POPPTR(ss,ix);
7419 TOPPTR(nss,ix) = gv_dup_inc(gv);
7421 case SAVEt_GENERIC_PVREF: /* generic char* */
7422 c = (char*)POPPTR(ss,ix);
7423 TOPPTR(nss,ix) = pv_dup(c);
7424 ptr = POPPTR(ss,ix);
7425 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
7427 case SAVEt_GENERIC_SVREF: /* generic sv */
7428 case SAVEt_SVREF: /* scalar reference */
7429 sv = (SV*)POPPTR(ss,ix);
7430 TOPPTR(nss,ix) = sv_dup_inc(sv);
7431 ptr = POPPTR(ss,ix);
7432 TOPPTR(nss,ix) = svp_dup_inc((SV**)ptr, proto_perl);/* XXXXX */
7434 case SAVEt_AV: /* array reference */
7435 av = (AV*)POPPTR(ss,ix);
7436 TOPPTR(nss,ix) = av_dup_inc(av);
7437 gv = (GV*)POPPTR(ss,ix);
7438 TOPPTR(nss,ix) = gv_dup(gv);
7440 case SAVEt_HV: /* hash reference */
7441 hv = (HV*)POPPTR(ss,ix);
7442 TOPPTR(nss,ix) = hv_dup_inc(hv);
7443 gv = (GV*)POPPTR(ss,ix);
7444 TOPPTR(nss,ix) = gv_dup(gv);
7446 case SAVEt_INT: /* int reference */
7447 ptr = POPPTR(ss,ix);
7448 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
7449 intval = (int)POPINT(ss,ix);
7450 TOPINT(nss,ix) = intval;
7452 case SAVEt_LONG: /* long reference */
7453 ptr = POPPTR(ss,ix);
7454 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
7455 longval = (long)POPLONG(ss,ix);
7456 TOPLONG(nss,ix) = longval;
7458 case SAVEt_I32: /* I32 reference */
7459 case SAVEt_I16: /* I16 reference */
7460 case SAVEt_I8: /* I8 reference */
7461 ptr = POPPTR(ss,ix);
7462 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
7466 case SAVEt_IV: /* IV reference */
7467 ptr = POPPTR(ss,ix);
7468 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
7472 case SAVEt_SPTR: /* SV* reference */
7473 ptr = POPPTR(ss,ix);
7474 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
7475 sv = (SV*)POPPTR(ss,ix);
7476 TOPPTR(nss,ix) = sv_dup(sv);
7478 case SAVEt_VPTR: /* random* reference */
7479 ptr = POPPTR(ss,ix);
7480 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
7481 ptr = POPPTR(ss,ix);
7482 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
7484 case SAVEt_PPTR: /* char* reference */
7485 ptr = POPPTR(ss,ix);
7486 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
7487 c = (char*)POPPTR(ss,ix);
7488 TOPPTR(nss,ix) = pv_dup(c);
7490 case SAVEt_HPTR: /* HV* reference */
7491 ptr = POPPTR(ss,ix);
7492 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
7493 hv = (HV*)POPPTR(ss,ix);
7494 TOPPTR(nss,ix) = hv_dup(hv);
7496 case SAVEt_APTR: /* AV* reference */
7497 ptr = POPPTR(ss,ix);
7498 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
7499 av = (AV*)POPPTR(ss,ix);
7500 TOPPTR(nss,ix) = av_dup(av);
7503 gv = (GV*)POPPTR(ss,ix);
7504 TOPPTR(nss,ix) = gv_dup(gv);
7506 case SAVEt_GP: /* scalar reference */
7507 gp = (GP*)POPPTR(ss,ix);
7508 TOPPTR(nss,ix) = gp = gp_dup(gp);
7509 (void)GpREFCNT_inc(gp);
7510 gv = (GV*)POPPTR(ss,ix);
7511 TOPPTR(nss,ix) = gv_dup_inc(c);
7512 c = (char*)POPPTR(ss,ix);
7513 TOPPTR(nss,ix) = pv_dup(c);
7520 sv = (SV*)POPPTR(ss,ix);
7521 TOPPTR(nss,ix) = sv_dup_inc(sv);
7524 ptr = POPPTR(ss,ix);
7525 if (ptr && (((OP*)ptr)->op_private & OPpREFCOUNTED)) {
7526 /* these are assumed to be refcounted properly */
7527 switch (((OP*)ptr)->op_type) {
7534 TOPPTR(nss,ix) = ptr;
7539 TOPPTR(nss,ix) = Nullop;
7544 TOPPTR(nss,ix) = Nullop;
7547 c = (char*)POPPTR(ss,ix);
7548 TOPPTR(nss,ix) = pv_dup_inc(c);
7551 longval = POPLONG(ss,ix);
7552 TOPLONG(nss,ix) = longval;
7555 hv = (HV*)POPPTR(ss,ix);
7556 TOPPTR(nss,ix) = hv_dup_inc(hv);
7557 c = (char*)POPPTR(ss,ix);
7558 TOPPTR(nss,ix) = pv_dup_inc(c);
7562 case SAVEt_DESTRUCTOR:
7563 ptr = POPPTR(ss,ix);
7564 TOPPTR(nss,ix) = any_dup(ptr, proto_perl); /* XXX quite arbitrary */
7565 dptr = POPDPTR(ss,ix);
7566 TOPDPTR(nss,ix) = (void (*)(void*))any_dup((void *)dptr, proto_perl);
7568 case SAVEt_DESTRUCTOR_X:
7569 ptr = POPPTR(ss,ix);
7570 TOPPTR(nss,ix) = any_dup(ptr, proto_perl); /* XXX quite arbitrary */
7571 dxptr = POPDXPTR(ss,ix);
7572 TOPDXPTR(nss,ix) = (void (*)(pTHXo_ void*))any_dup((void *)dxptr, proto_perl);
7574 case SAVEt_REGCONTEXT:
7580 case SAVEt_STACK_POS: /* Position on Perl stack */
7584 case SAVEt_AELEM: /* array element */
7585 sv = (SV*)POPPTR(ss,ix);
7586 TOPPTR(nss,ix) = sv_dup_inc(sv);
7589 av = (AV*)POPPTR(ss,ix);
7590 TOPPTR(nss,ix) = av_dup_inc(av);
7592 case SAVEt_HELEM: /* hash element */
7593 sv = (SV*)POPPTR(ss,ix);
7594 TOPPTR(nss,ix) = sv_dup_inc(sv);
7595 sv = (SV*)POPPTR(ss,ix);
7596 TOPPTR(nss,ix) = sv_dup_inc(sv);
7597 hv = (HV*)POPPTR(ss,ix);
7598 TOPPTR(nss,ix) = hv_dup_inc(hv);
7601 ptr = POPPTR(ss,ix);
7602 TOPPTR(nss,ix) = ptr;
7609 av = (AV*)POPPTR(ss,ix);
7610 TOPPTR(nss,ix) = av_dup(av);
7613 Perl_croak(aTHX_ "panic: ss_dup inconsistency");
7625 perl_clone(PerlInterpreter *proto_perl, UV flags)
7628 CPerlObj *pPerl = (CPerlObj*)proto_perl;
7631 #ifdef PERL_IMPLICIT_SYS
7632 return perl_clone_using(proto_perl, flags,
7634 proto_perl->IMemShared,
7635 proto_perl->IMemParse,
7645 perl_clone_using(PerlInterpreter *proto_perl, UV flags,
7646 struct IPerlMem* ipM, struct IPerlMem* ipMS,
7647 struct IPerlMem* ipMP, struct IPerlEnv* ipE,
7648 struct IPerlStdIO* ipStd, struct IPerlLIO* ipLIO,
7649 struct IPerlDir* ipD, struct IPerlSock* ipS,
7650 struct IPerlProc* ipP)
7652 /* XXX many of the string copies here can be optimized if they're
7653 * constants; they need to be allocated as common memory and just
7654 * their pointers copied. */
7658 CPerlObj *pPerl = new(ipM) CPerlObj(ipM, ipMS, ipMP, ipE, ipStd, ipLIO,
7660 PERL_SET_THX(pPerl);
7661 # else /* !PERL_OBJECT */
7662 PerlInterpreter *my_perl = (PerlInterpreter*)(*ipM->pMalloc)(ipM, sizeof(PerlInterpreter));
7663 PERL_SET_THX(my_perl);
7666 memset(my_perl, 0xab, sizeof(PerlInterpreter));
7671 # else /* !DEBUGGING */
7672 Zero(my_perl, 1, PerlInterpreter);
7673 # endif /* DEBUGGING */
7677 PL_MemShared = ipMS;
7685 # endif /* PERL_OBJECT */
7686 #else /* !PERL_IMPLICIT_SYS */
7688 PerlInterpreter *my_perl = (PerlInterpreter*)PerlMem_malloc(sizeof(PerlInterpreter));
7689 PERL_SET_THX(my_perl);
7692 memset(my_perl, 0xab, sizeof(PerlInterpreter));
7697 # else /* !DEBUGGING */
7698 Zero(my_perl, 1, PerlInterpreter);
7699 # endif /* DEBUGGING */
7700 #endif /* PERL_IMPLICIT_SYS */
7703 PL_xiv_arenaroot = NULL;
7705 PL_xnv_arenaroot = NULL;
7707 PL_xrv_arenaroot = NULL;
7709 PL_xpv_arenaroot = NULL;
7711 PL_xpviv_arenaroot = NULL;
7712 PL_xpviv_root = NULL;
7713 PL_xpvnv_arenaroot = NULL;
7714 PL_xpvnv_root = NULL;
7715 PL_xpvcv_arenaroot = NULL;
7716 PL_xpvcv_root = NULL;
7717 PL_xpvav_arenaroot = NULL;
7718 PL_xpvav_root = NULL;
7719 PL_xpvhv_arenaroot = NULL;
7720 PL_xpvhv_root = NULL;
7721 PL_xpvmg_arenaroot = NULL;
7722 PL_xpvmg_root = NULL;
7723 PL_xpvlv_arenaroot = NULL;
7724 PL_xpvlv_root = NULL;
7725 PL_xpvbm_arenaroot = NULL;
7726 PL_xpvbm_root = NULL;
7727 PL_he_arenaroot = NULL;
7729 PL_nice_chunk = NULL;
7730 PL_nice_chunk_size = 0;
7733 PL_sv_root = Nullsv;
7734 PL_sv_arenaroot = Nullsv;
7736 PL_debug = proto_perl->Idebug;
7738 /* create SV map for pointer relocation */
7739 PL_ptr_table = ptr_table_new();
7741 /* initialize these special pointers as early as possible */
7742 SvANY(&PL_sv_undef) = NULL;
7743 SvREFCNT(&PL_sv_undef) = (~(U32)0)/2;
7744 SvFLAGS(&PL_sv_undef) = SVf_READONLY|SVt_NULL;
7745 ptr_table_store(PL_ptr_table, &proto_perl->Isv_undef, &PL_sv_undef);
7748 SvUPGRADE(&PL_sv_no, SVt_PVNV);
7750 SvANY(&PL_sv_no) = new_XPVNV();
7752 SvREFCNT(&PL_sv_no) = (~(U32)0)/2;
7753 SvFLAGS(&PL_sv_no) = SVp_NOK|SVf_NOK|SVp_POK|SVf_POK|SVf_READONLY|SVt_PVNV;
7754 SvPVX(&PL_sv_no) = SAVEPVN(PL_No, 0);
7755 SvCUR(&PL_sv_no) = 0;
7756 SvLEN(&PL_sv_no) = 1;
7757 SvNVX(&PL_sv_no) = 0;
7758 ptr_table_store(PL_ptr_table, &proto_perl->Isv_no, &PL_sv_no);
7761 SvUPGRADE(&PL_sv_yes, SVt_PVNV);
7763 SvANY(&PL_sv_yes) = new_XPVNV();
7765 SvREFCNT(&PL_sv_yes) = (~(U32)0)/2;
7766 SvFLAGS(&PL_sv_yes) = SVp_NOK|SVf_NOK|SVp_POK|SVf_POK|SVf_READONLY|SVt_PVNV;
7767 SvPVX(&PL_sv_yes) = SAVEPVN(PL_Yes, 1);
7768 SvCUR(&PL_sv_yes) = 1;
7769 SvLEN(&PL_sv_yes) = 2;
7770 SvNVX(&PL_sv_yes) = 1;
7771 ptr_table_store(PL_ptr_table, &proto_perl->Isv_yes, &PL_sv_yes);
7773 /* create shared string table */
7774 PL_strtab = newHV();
7775 HvSHAREKEYS_off(PL_strtab);
7776 hv_ksplit(PL_strtab, 512);
7777 ptr_table_store(PL_ptr_table, proto_perl->Istrtab, PL_strtab);
7779 PL_compiling = proto_perl->Icompiling;
7780 PL_compiling.cop_stashpv = SAVEPV(PL_compiling.cop_stashpv);
7781 PL_compiling.cop_file = SAVEPV(PL_compiling.cop_file);
7782 ptr_table_store(PL_ptr_table, &proto_perl->Icompiling, &PL_compiling);
7783 if (!specialWARN(PL_compiling.cop_warnings))
7784 PL_compiling.cop_warnings = sv_dup_inc(PL_compiling.cop_warnings);
7785 PL_curcop = (COP*)any_dup(proto_perl->Tcurcop, proto_perl);
7787 /* pseudo environmental stuff */
7788 PL_origargc = proto_perl->Iorigargc;
7790 New(0, PL_origargv, i+1, char*);
7791 PL_origargv[i] = '\0';
7793 PL_origargv[i] = SAVEPV(proto_perl->Iorigargv[i]);
7795 PL_envgv = gv_dup(proto_perl->Ienvgv);
7796 PL_incgv = gv_dup(proto_perl->Iincgv);
7797 PL_hintgv = gv_dup(proto_perl->Ihintgv);
7798 PL_origfilename = SAVEPV(proto_perl->Iorigfilename);
7799 PL_diehook = sv_dup_inc(proto_perl->Idiehook);
7800 PL_warnhook = sv_dup_inc(proto_perl->Iwarnhook);
7803 PL_minus_c = proto_perl->Iminus_c;
7804 PL_patchlevel = sv_dup_inc(proto_perl->Ipatchlevel);
7805 PL_localpatches = proto_perl->Ilocalpatches;
7806 PL_splitstr = proto_perl->Isplitstr;
7807 PL_preprocess = proto_perl->Ipreprocess;
7808 PL_minus_n = proto_perl->Iminus_n;
7809 PL_minus_p = proto_perl->Iminus_p;
7810 PL_minus_l = proto_perl->Iminus_l;
7811 PL_minus_a = proto_perl->Iminus_a;
7812 PL_minus_F = proto_perl->Iminus_F;
7813 PL_doswitches = proto_perl->Idoswitches;
7814 PL_dowarn = proto_perl->Idowarn;
7815 PL_doextract = proto_perl->Idoextract;
7816 PL_sawampersand = proto_perl->Isawampersand;
7817 PL_unsafe = proto_perl->Iunsafe;
7818 PL_inplace = SAVEPV(proto_perl->Iinplace);
7819 PL_e_script = sv_dup_inc(proto_perl->Ie_script);
7820 PL_perldb = proto_perl->Iperldb;
7821 PL_perl_destruct_level = proto_perl->Iperl_destruct_level;
7823 /* magical thingies */
7824 /* XXX time(&PL_basetime) when asked for? */
7825 PL_basetime = proto_perl->Ibasetime;
7826 PL_formfeed = sv_dup(proto_perl->Iformfeed);
7828 PL_maxsysfd = proto_perl->Imaxsysfd;
7829 PL_multiline = proto_perl->Imultiline;
7830 PL_statusvalue = proto_perl->Istatusvalue;
7832 PL_statusvalue_vms = proto_perl->Istatusvalue_vms;
7835 /* shortcuts to various I/O objects */
7836 PL_stdingv = gv_dup(proto_perl->Istdingv);
7837 PL_stderrgv = gv_dup(proto_perl->Istderrgv);
7838 PL_defgv = gv_dup(proto_perl->Idefgv);
7839 PL_argvgv = gv_dup(proto_perl->Iargvgv);
7840 PL_argvoutgv = gv_dup(proto_perl->Iargvoutgv);
7841 PL_argvout_stack = av_dup(proto_perl->Iargvout_stack);
7843 /* shortcuts to regexp stuff */
7844 PL_replgv = gv_dup(proto_perl->Ireplgv);
7846 /* shortcuts to misc objects */
7847 PL_errgv = gv_dup(proto_perl->Ierrgv);
7849 /* shortcuts to debugging objects */
7850 PL_DBgv = gv_dup(proto_perl->IDBgv);
7851 PL_DBline = gv_dup(proto_perl->IDBline);
7852 PL_DBsub = gv_dup(proto_perl->IDBsub);
7853 PL_DBsingle = sv_dup(proto_perl->IDBsingle);
7854 PL_DBtrace = sv_dup(proto_perl->IDBtrace);
7855 PL_DBsignal = sv_dup(proto_perl->IDBsignal);
7856 PL_lineary = av_dup(proto_perl->Ilineary);
7857 PL_dbargs = av_dup(proto_perl->Idbargs);
7860 PL_defstash = hv_dup_inc(proto_perl->Tdefstash);
7861 PL_curstash = hv_dup(proto_perl->Tcurstash);
7862 PL_debstash = hv_dup(proto_perl->Idebstash);
7863 PL_globalstash = hv_dup(proto_perl->Iglobalstash);
7864 PL_curstname = sv_dup_inc(proto_perl->Icurstname);
7866 PL_beginav = av_dup_inc(proto_perl->Ibeginav);
7867 PL_endav = av_dup_inc(proto_perl->Iendav);
7868 PL_checkav = av_dup_inc(proto_perl->Icheckav);
7869 PL_initav = av_dup_inc(proto_perl->Iinitav);
7871 PL_sub_generation = proto_perl->Isub_generation;
7873 /* funky return mechanisms */
7874 PL_forkprocess = proto_perl->Iforkprocess;
7876 /* subprocess state */
7877 PL_fdpid = av_dup_inc(proto_perl->Ifdpid);
7879 /* internal state */
7880 PL_tainting = proto_perl->Itainting;
7881 PL_maxo = proto_perl->Imaxo;
7882 if (proto_perl->Iop_mask)
7883 PL_op_mask = SAVEPVN(proto_perl->Iop_mask, PL_maxo);
7885 PL_op_mask = Nullch;
7887 /* current interpreter roots */
7888 PL_main_cv = cv_dup_inc(proto_perl->Imain_cv);
7889 PL_main_root = OpREFCNT_inc(proto_perl->Imain_root);
7890 PL_main_start = proto_perl->Imain_start;
7891 PL_eval_root = proto_perl->Ieval_root;
7892 PL_eval_start = proto_perl->Ieval_start;
7894 /* runtime control stuff */
7895 PL_curcopdb = (COP*)any_dup(proto_perl->Icurcopdb, proto_perl);
7896 PL_copline = proto_perl->Icopline;
7898 PL_filemode = proto_perl->Ifilemode;
7899 PL_lastfd = proto_perl->Ilastfd;
7900 PL_oldname = proto_perl->Ioldname; /* XXX not quite right */
7903 PL_gensym = proto_perl->Igensym;
7904 PL_preambled = proto_perl->Ipreambled;
7905 PL_preambleav = av_dup_inc(proto_perl->Ipreambleav);
7906 PL_laststatval = proto_perl->Ilaststatval;
7907 PL_laststype = proto_perl->Ilaststype;
7908 PL_mess_sv = Nullsv;
7910 PL_orslen = proto_perl->Iorslen;
7911 PL_ors = SAVEPVN(proto_perl->Iors, PL_orslen);
7912 PL_ofmt = SAVEPV(proto_perl->Iofmt);
7914 /* interpreter atexit processing */
7915 PL_exitlistlen = proto_perl->Iexitlistlen;
7916 if (PL_exitlistlen) {
7917 New(0, PL_exitlist, PL_exitlistlen, PerlExitListEntry);
7918 Copy(proto_perl->Iexitlist, PL_exitlist, PL_exitlistlen, PerlExitListEntry);
7921 PL_exitlist = (PerlExitListEntry*)NULL;
7922 PL_modglobal = hv_dup_inc(proto_perl->Imodglobal);
7924 PL_profiledata = NULL;
7925 PL_rsfp = fp_dup(proto_perl->Irsfp, '<');
7926 /* PL_rsfp_filters entries have fake IoDIRP() */
7927 PL_rsfp_filters = av_dup_inc(proto_perl->Irsfp_filters);
7929 PL_compcv = cv_dup(proto_perl->Icompcv);
7930 PL_comppad = av_dup(proto_perl->Icomppad);
7931 PL_comppad_name = av_dup(proto_perl->Icomppad_name);
7932 PL_comppad_name_fill = proto_perl->Icomppad_name_fill;
7933 PL_comppad_name_floor = proto_perl->Icomppad_name_floor;
7934 PL_curpad = (SV**)ptr_table_fetch(PL_ptr_table,
7935 proto_perl->Tcurpad);
7937 #ifdef HAVE_INTERP_INTERN
7938 sys_intern_dup(&proto_perl->Isys_intern, &PL_sys_intern);
7941 /* more statics moved here */
7942 PL_generation = proto_perl->Igeneration;
7943 PL_DBcv = cv_dup(proto_perl->IDBcv);
7945 PL_in_clean_objs = proto_perl->Iin_clean_objs;
7946 PL_in_clean_all = proto_perl->Iin_clean_all;
7948 PL_uid = proto_perl->Iuid;
7949 PL_euid = proto_perl->Ieuid;
7950 PL_gid = proto_perl->Igid;
7951 PL_egid = proto_perl->Iegid;
7952 PL_nomemok = proto_perl->Inomemok;
7953 PL_an = proto_perl->Ian;
7954 PL_cop_seqmax = proto_perl->Icop_seqmax;
7955 PL_op_seqmax = proto_perl->Iop_seqmax;
7956 PL_evalseq = proto_perl->Ievalseq;
7957 PL_origenviron = proto_perl->Iorigenviron; /* XXX not quite right */
7958 PL_origalen = proto_perl->Iorigalen;
7959 PL_pidstatus = newHV(); /* XXX flag for cloning? */
7960 PL_osname = SAVEPV(proto_perl->Iosname);
7961 PL_sh_path = SAVEPV(proto_perl->Ish_path);
7962 PL_sighandlerp = proto_perl->Isighandlerp;
7965 PL_runops = proto_perl->Irunops;
7967 Copy(proto_perl->Itokenbuf, PL_tokenbuf, 256, char);
7970 PL_cshlen = proto_perl->Icshlen;
7971 PL_cshname = SAVEPVN(proto_perl->Icshname, PL_cshlen);
7974 PL_lex_state = proto_perl->Ilex_state;
7975 PL_lex_defer = proto_perl->Ilex_defer;
7976 PL_lex_expect = proto_perl->Ilex_expect;
7977 PL_lex_formbrack = proto_perl->Ilex_formbrack;
7978 PL_lex_dojoin = proto_perl->Ilex_dojoin;
7979 PL_lex_starts = proto_perl->Ilex_starts;
7980 PL_lex_stuff = sv_dup_inc(proto_perl->Ilex_stuff);
7981 PL_lex_repl = sv_dup_inc(proto_perl->Ilex_repl);
7982 PL_lex_op = proto_perl->Ilex_op;
7983 PL_lex_inpat = proto_perl->Ilex_inpat;
7984 PL_lex_inwhat = proto_perl->Ilex_inwhat;
7985 PL_lex_brackets = proto_perl->Ilex_brackets;
7986 i = (PL_lex_brackets < 120 ? 120 : PL_lex_brackets);
7987 PL_lex_brackstack = SAVEPVN(proto_perl->Ilex_brackstack,i);
7988 PL_lex_casemods = proto_perl->Ilex_casemods;
7989 i = (PL_lex_casemods < 12 ? 12 : PL_lex_casemods);
7990 PL_lex_casestack = SAVEPVN(proto_perl->Ilex_casestack,i);
7992 Copy(proto_perl->Inextval, PL_nextval, 5, YYSTYPE);
7993 Copy(proto_perl->Inexttype, PL_nexttype, 5, I32);
7994 PL_nexttoke = proto_perl->Inexttoke;
7996 PL_linestr = sv_dup_inc(proto_perl->Ilinestr);
7997 i = proto_perl->Ibufptr - SvPVX(proto_perl->Ilinestr);
7998 PL_bufptr = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
7999 i = proto_perl->Ioldbufptr - SvPVX(proto_perl->Ilinestr);
8000 PL_oldbufptr = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
8001 i = proto_perl->Ioldoldbufptr - SvPVX(proto_perl->Ilinestr);
8002 PL_oldoldbufptr = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
8003 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
8004 i = proto_perl->Ilinestart - SvPVX(proto_perl->Ilinestr);
8005 PL_linestart = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
8006 PL_pending_ident = proto_perl->Ipending_ident;
8007 PL_sublex_info = proto_perl->Isublex_info; /* XXX not quite right */
8009 PL_expect = proto_perl->Iexpect;
8011 PL_multi_start = proto_perl->Imulti_start;
8012 PL_multi_end = proto_perl->Imulti_end;
8013 PL_multi_open = proto_perl->Imulti_open;
8014 PL_multi_close = proto_perl->Imulti_close;
8016 PL_error_count = proto_perl->Ierror_count;
8017 PL_subline = proto_perl->Isubline;
8018 PL_subname = sv_dup_inc(proto_perl->Isubname);
8020 PL_min_intro_pending = proto_perl->Imin_intro_pending;
8021 PL_max_intro_pending = proto_perl->Imax_intro_pending;
8022 PL_padix = proto_perl->Ipadix;
8023 PL_padix_floor = proto_perl->Ipadix_floor;
8024 PL_pad_reset_pending = proto_perl->Ipad_reset_pending;
8026 i = proto_perl->Ilast_uni - SvPVX(proto_perl->Ilinestr);
8027 PL_last_uni = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
8028 i = proto_perl->Ilast_lop - SvPVX(proto_perl->Ilinestr);
8029 PL_last_lop = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
8030 PL_last_lop_op = proto_perl->Ilast_lop_op;
8031 PL_in_my = proto_perl->Iin_my;
8032 PL_in_my_stash = hv_dup(proto_perl->Iin_my_stash);
8034 PL_cryptseen = proto_perl->Icryptseen;
8037 PL_hints = proto_perl->Ihints;
8039 PL_amagic_generation = proto_perl->Iamagic_generation;
8041 #ifdef USE_LOCALE_COLLATE
8042 PL_collation_ix = proto_perl->Icollation_ix;
8043 PL_collation_name = SAVEPV(proto_perl->Icollation_name);
8044 PL_collation_standard = proto_perl->Icollation_standard;
8045 PL_collxfrm_base = proto_perl->Icollxfrm_base;
8046 PL_collxfrm_mult = proto_perl->Icollxfrm_mult;
8047 #endif /* USE_LOCALE_COLLATE */
8049 #ifdef USE_LOCALE_NUMERIC
8050 PL_numeric_name = SAVEPV(proto_perl->Inumeric_name);
8051 PL_numeric_standard = proto_perl->Inumeric_standard;
8052 PL_numeric_local = proto_perl->Inumeric_local;
8053 PL_numeric_radix = proto_perl->Inumeric_radix;
8054 #endif /* !USE_LOCALE_NUMERIC */
8056 /* utf8 character classes */
8057 PL_utf8_alnum = sv_dup_inc(proto_perl->Iutf8_alnum);
8058 PL_utf8_alnumc = sv_dup_inc(proto_perl->Iutf8_alnumc);
8059 PL_utf8_ascii = sv_dup_inc(proto_perl->Iutf8_ascii);
8060 PL_utf8_alpha = sv_dup_inc(proto_perl->Iutf8_alpha);
8061 PL_utf8_space = sv_dup_inc(proto_perl->Iutf8_space);
8062 PL_utf8_cntrl = sv_dup_inc(proto_perl->Iutf8_cntrl);
8063 PL_utf8_graph = sv_dup_inc(proto_perl->Iutf8_graph);
8064 PL_utf8_digit = sv_dup_inc(proto_perl->Iutf8_digit);
8065 PL_utf8_upper = sv_dup_inc(proto_perl->Iutf8_upper);
8066 PL_utf8_lower = sv_dup_inc(proto_perl->Iutf8_lower);
8067 PL_utf8_print = sv_dup_inc(proto_perl->Iutf8_print);
8068 PL_utf8_punct = sv_dup_inc(proto_perl->Iutf8_punct);
8069 PL_utf8_xdigit = sv_dup_inc(proto_perl->Iutf8_xdigit);
8070 PL_utf8_mark = sv_dup_inc(proto_perl->Iutf8_mark);
8071 PL_utf8_toupper = sv_dup_inc(proto_perl->Iutf8_toupper);
8072 PL_utf8_totitle = sv_dup_inc(proto_perl->Iutf8_totitle);
8073 PL_utf8_tolower = sv_dup_inc(proto_perl->Iutf8_tolower);
8076 PL_last_swash_hv = Nullhv; /* reinits on demand */
8077 PL_last_swash_klen = 0;
8078 PL_last_swash_key[0]= '\0';
8079 PL_last_swash_tmps = (U8*)NULL;
8080 PL_last_swash_slen = 0;
8082 /* perly.c globals */
8083 PL_yydebug = proto_perl->Iyydebug;
8084 PL_yynerrs = proto_perl->Iyynerrs;
8085 PL_yyerrflag = proto_perl->Iyyerrflag;
8086 PL_yychar = proto_perl->Iyychar;
8087 PL_yyval = proto_perl->Iyyval;
8088 PL_yylval = proto_perl->Iyylval;
8090 PL_glob_index = proto_perl->Iglob_index;
8091 PL_srand_called = proto_perl->Isrand_called;
8092 PL_uudmap['M'] = 0; /* reinits on demand */
8093 PL_bitcount = Nullch; /* reinits on demand */
8095 if (proto_perl->Ipsig_ptr) {
8096 int sig_num[] = { SIG_NUM };
8097 Newz(0, PL_psig_ptr, sizeof(sig_num)/sizeof(*sig_num), SV*);
8098 Newz(0, PL_psig_name, sizeof(sig_num)/sizeof(*sig_num), SV*);
8099 for (i = 1; PL_sig_name[i]; i++) {
8100 PL_psig_ptr[i] = sv_dup_inc(proto_perl->Ipsig_ptr[i]);
8101 PL_psig_name[i] = sv_dup_inc(proto_perl->Ipsig_name[i]);
8105 PL_psig_ptr = (SV**)NULL;
8106 PL_psig_name = (SV**)NULL;
8109 /* thrdvar.h stuff */
8112 /* next allocation will be PL_tmps_stack[PL_tmps_ix+1] */
8113 PL_tmps_ix = proto_perl->Ttmps_ix;
8114 PL_tmps_max = proto_perl->Ttmps_max;
8115 PL_tmps_floor = proto_perl->Ttmps_floor;
8116 Newz(50, PL_tmps_stack, PL_tmps_max, SV*);
8118 while (i <= PL_tmps_ix) {
8119 PL_tmps_stack[i] = sv_dup_inc(proto_perl->Ttmps_stack[i]);
8123 /* next PUSHMARK() sets *(PL_markstack_ptr+1) */
8124 i = proto_perl->Tmarkstack_max - proto_perl->Tmarkstack;
8125 Newz(54, PL_markstack, i, I32);
8126 PL_markstack_max = PL_markstack + (proto_perl->Tmarkstack_max
8127 - proto_perl->Tmarkstack);
8128 PL_markstack_ptr = PL_markstack + (proto_perl->Tmarkstack_ptr
8129 - proto_perl->Tmarkstack);
8130 Copy(proto_perl->Tmarkstack, PL_markstack,
8131 PL_markstack_ptr - PL_markstack + 1, I32);
8133 /* next push_scope()/ENTER sets PL_scopestack[PL_scopestack_ix]
8134 * NOTE: unlike the others! */
8135 PL_scopestack_ix = proto_perl->Tscopestack_ix;
8136 PL_scopestack_max = proto_perl->Tscopestack_max;
8137 Newz(54, PL_scopestack, PL_scopestack_max, I32);
8138 Copy(proto_perl->Tscopestack, PL_scopestack, PL_scopestack_ix, I32);
8140 /* next push_return() sets PL_retstack[PL_retstack_ix]
8141 * NOTE: unlike the others! */
8142 PL_retstack_ix = proto_perl->Tretstack_ix;
8143 PL_retstack_max = proto_perl->Tretstack_max;
8144 Newz(54, PL_retstack, PL_retstack_max, OP*);
8145 Copy(proto_perl->Tretstack, PL_retstack, PL_retstack_ix, I32);
8147 /* NOTE: si_dup() looks at PL_markstack */
8148 PL_curstackinfo = si_dup(proto_perl->Tcurstackinfo);
8150 /* PL_curstack = PL_curstackinfo->si_stack; */
8151 PL_curstack = av_dup(proto_perl->Tcurstack);
8152 PL_mainstack = av_dup(proto_perl->Tmainstack);
8154 /* next PUSHs() etc. set *(PL_stack_sp+1) */
8155 PL_stack_base = AvARRAY(PL_curstack);
8156 PL_stack_sp = PL_stack_base + (proto_perl->Tstack_sp
8157 - proto_perl->Tstack_base);
8158 PL_stack_max = PL_stack_base + AvMAX(PL_curstack);
8160 /* next SSPUSHFOO() sets PL_savestack[PL_savestack_ix]
8161 * NOTE: unlike the others! */
8162 PL_savestack_ix = proto_perl->Tsavestack_ix;
8163 PL_savestack_max = proto_perl->Tsavestack_max;
8164 /*Newz(54, PL_savestack, PL_savestack_max, ANY);*/
8165 PL_savestack = ss_dup(proto_perl);
8169 ENTER; /* perl_destruct() wants to LEAVE; */
8172 PL_start_env = proto_perl->Tstart_env; /* XXXXXX */
8173 PL_top_env = &PL_start_env;
8175 PL_op = proto_perl->Top;
8178 PL_Xpv = (XPV*)NULL;
8179 PL_na = proto_perl->Tna;
8181 PL_statbuf = proto_perl->Tstatbuf;
8182 PL_statcache = proto_perl->Tstatcache;
8183 PL_statgv = gv_dup(proto_perl->Tstatgv);
8184 PL_statname = sv_dup_inc(proto_perl->Tstatname);
8186 PL_timesbuf = proto_perl->Ttimesbuf;
8189 PL_tainted = proto_perl->Ttainted;
8190 PL_curpm = proto_perl->Tcurpm; /* XXX No PMOP ref count */
8191 PL_nrs = sv_dup_inc(proto_perl->Tnrs);
8192 PL_rs = sv_dup_inc(proto_perl->Trs);
8193 PL_last_in_gv = gv_dup(proto_perl->Tlast_in_gv);
8194 PL_ofslen = proto_perl->Tofslen;
8195 PL_ofs = SAVEPVN(proto_perl->Tofs, PL_ofslen);
8196 PL_defoutgv = gv_dup_inc(proto_perl->Tdefoutgv);
8197 PL_chopset = proto_perl->Tchopset; /* XXX never deallocated */
8198 PL_toptarget = sv_dup_inc(proto_perl->Ttoptarget);
8199 PL_bodytarget = sv_dup_inc(proto_perl->Tbodytarget);
8200 PL_formtarget = sv_dup(proto_perl->Tformtarget);
8202 PL_restartop = proto_perl->Trestartop;
8203 PL_in_eval = proto_perl->Tin_eval;
8204 PL_delaymagic = proto_perl->Tdelaymagic;
8205 PL_dirty = proto_perl->Tdirty;
8206 PL_localizing = proto_perl->Tlocalizing;
8208 #ifdef PERL_FLEXIBLE_EXCEPTIONS
8209 PL_protect = proto_perl->Tprotect;
8211 PL_errors = sv_dup_inc(proto_perl->Terrors);
8212 PL_av_fetch_sv = Nullsv;
8213 PL_hv_fetch_sv = Nullsv;
8214 Zero(&PL_hv_fetch_ent_mh, 1, HE); /* XXX */
8215 PL_modcount = proto_perl->Tmodcount;
8216 PL_lastgotoprobe = Nullop;
8217 PL_dumpindent = proto_perl->Tdumpindent;
8219 PL_sortcop = (OP*)any_dup(proto_perl->Tsortcop, proto_perl);
8220 PL_sortstash = hv_dup(proto_perl->Tsortstash);
8221 PL_firstgv = gv_dup(proto_perl->Tfirstgv);
8222 PL_secondgv = gv_dup(proto_perl->Tsecondgv);
8223 PL_sortcxix = proto_perl->Tsortcxix;
8224 PL_efloatbuf = Nullch; /* reinits on demand */
8225 PL_efloatsize = 0; /* reinits on demand */
8229 PL_screamfirst = NULL;
8230 PL_screamnext = NULL;
8231 PL_maxscream = -1; /* reinits on demand */
8232 PL_lastscream = Nullsv;
8234 PL_watchaddr = NULL;
8235 PL_watchok = Nullch;
8237 PL_regdummy = proto_perl->Tregdummy;
8238 PL_regcomp_parse = Nullch;
8239 PL_regxend = Nullch;
8240 PL_regcode = (regnode*)NULL;
8243 PL_regprecomp = Nullch;
8248 PL_seen_zerolen = 0;
8250 PL_regcomp_rx = (regexp*)NULL;
8252 PL_colorset = 0; /* reinits PL_colors[] */
8253 /*PL_colors[6] = {0,0,0,0,0,0};*/
8254 PL_reg_whilem_seen = 0;
8255 PL_reginput = Nullch;
8258 PL_regstartp = (I32*)NULL;
8259 PL_regendp = (I32*)NULL;
8260 PL_reglastparen = (U32*)NULL;
8261 PL_regtill = Nullch;
8263 PL_reg_start_tmp = (char**)NULL;
8264 PL_reg_start_tmpl = 0;
8265 PL_regdata = (struct reg_data*)NULL;
8268 PL_reg_eval_set = 0;
8270 PL_regprogram = (regnode*)NULL;
8272 PL_regcc = (CURCUR*)NULL;
8273 PL_reg_call_cc = (struct re_cc_state*)NULL;
8274 PL_reg_re = (regexp*)NULL;
8275 PL_reg_ganch = Nullch;
8277 PL_reg_magic = (MAGIC*)NULL;
8279 PL_reg_oldcurpm = (PMOP*)NULL;
8280 PL_reg_curpm = (PMOP*)NULL;
8281 PL_reg_oldsaved = Nullch;
8282 PL_reg_oldsavedlen = 0;
8284 PL_reg_leftiter = 0;
8285 PL_reg_poscache = Nullch;
8286 PL_reg_poscache_size= 0;
8288 /* RE engine - function pointers */
8289 PL_regcompp = proto_perl->Tregcompp;
8290 PL_regexecp = proto_perl->Tregexecp;
8291 PL_regint_start = proto_perl->Tregint_start;
8292 PL_regint_string = proto_perl->Tregint_string;
8293 PL_regfree = proto_perl->Tregfree;
8295 PL_reginterp_cnt = 0;
8296 PL_reg_starttry = 0;
8299 return (PerlInterpreter*)pPerl;
8305 #else /* !USE_ITHREADS */
8311 #endif /* USE_ITHREADS */
8314 do_report_used(pTHXo_ SV *sv)
8316 if (SvTYPE(sv) != SVTYPEMASK) {
8317 PerlIO_printf(Perl_debug_log, "****\n");
8323 do_clean_objs(pTHXo_ SV *sv)
8327 if (SvROK(sv) && SvOBJECT(rv = SvRV(sv))) {
8328 DEBUG_D((PerlIO_printf(Perl_debug_log, "Cleaning object ref:\n "), sv_dump(sv));)
8329 if (SvWEAKREF(sv)) {
8340 /* XXX Might want to check arrays, etc. */
8343 #ifndef DISABLE_DESTRUCTOR_KLUDGE
8345 do_clean_named_objs(pTHXo_ SV *sv)
8347 if (SvTYPE(sv) == SVt_PVGV && GvGP(sv)) {
8348 if ( SvOBJECT(GvSV(sv)) ||
8349 (GvAV(sv) && SvOBJECT(GvAV(sv))) ||
8350 (GvHV(sv) && SvOBJECT(GvHV(sv))) ||
8351 (GvIO(sv) && SvOBJECT(GvIO(sv))) ||
8352 (GvCV(sv) && SvOBJECT(GvCV(sv))) )
8354 DEBUG_D((PerlIO_printf(Perl_debug_log, "Cleaning named glob object:\n "), sv_dump(sv));)
8362 do_clean_all(pTHXo_ SV *sv)
8364 DEBUG_D((PerlIO_printf(Perl_debug_log, "Cleaning loops: SV at 0x%"UVxf"\n", PTR2UV(sv)) );)
8365 SvFLAGS(sv) |= SVf_BREAK;