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
2406 * to signal if there are any hibit chars in the string
2409 for (c = SvPVX(sv); c < SvEND(sv); c++) {
2416 SvGROW(sv, SvCUR(sv) + hicount + 1);
2418 src = SvEND(sv) - 1;
2419 SvCUR_set(sv, SvCUR(sv) + hicount);
2420 dst = SvEND(sv) - 1;
2425 uv_to_utf8((U8*)dst, (U8)*src--);
2438 =for apidoc sv_utf8_downgrade
2440 Attempt to convert the PV of an SV from UTF8-encoded to byte encoding.
2441 This may not be possible if the PV contains non-byte encoding characters;
2442 if this is the case, either returns false or, if C<fail_ok> is not
2449 Perl_sv_utf8_downgrade(pTHX_ register SV* sv, bool fail_ok)
2451 if (SvPOK(sv) && SvUTF8(sv)) {
2452 char *c = SvPVX(sv);
2454 /* need to figure out if this is possible at all first */
2455 while (c < SvEND(sv)) {
2458 UV uv = utf8_to_uv((U8*)c, &len);
2463 /* XXX might want to make a callback here instead */
2464 Perl_croak(aTHX_ "Big byte");
2477 char *src = first_hi;
2478 char *dst = first_hi;
2479 while (src < SvEND(sv)) {
2482 U8 u = (U8)utf8_to_uv((U8*)src, &len);
2490 SvCUR_set(sv, dst - SvPVX(sv));
2498 =for apidoc sv_utf8_encode
2500 Convert the PV of an SV to UTF8-encoded, but then turn off the C<SvUTF8>
2501 flag so that it looks like bytes again. Nothing calls this.
2507 Perl_sv_utf8_encode(pTHX_ register SV *sv)
2509 sv_utf8_upgrade(sv);
2514 Perl_sv_utf8_decode(pTHX_ register SV *sv)
2518 bool has_utf = FALSE;
2519 if (!sv_utf8_downgrade(sv, TRUE))
2522 /* it is actually just a matter of turning the utf8 flag on, but
2523 * we want to make sure everything inside is valid utf8 first.
2526 while (c < SvEND(sv)) {
2529 (void)utf8_to_uv((U8*)c, &len);
2549 /* Note: sv_setsv() should not be called with a source string that needs
2550 * to be reused, since it may destroy the source string if it is marked
2555 =for apidoc sv_setsv
2557 Copies the contents of the source SV C<ssv> into the destination SV C<dsv>.
2558 The source SV may be destroyed if it is mortal. Does not handle 'set'
2559 magic. See the macro forms C<SvSetSV>, C<SvSetSV_nosteal> and
2566 Perl_sv_setsv(pTHX_ SV *dstr, register SV *sstr)
2569 register U32 sflags;
2575 SV_CHECK_THINKFIRST(dstr);
2577 sstr = &PL_sv_undef;
2578 stype = SvTYPE(sstr);
2579 dtype = SvTYPE(dstr);
2583 /* There's a lot of redundancy below but we're going for speed here */
2588 if (dtype != SVt_PVGV) {
2589 (void)SvOK_off(dstr);
2597 sv_upgrade(dstr, SVt_IV);
2600 sv_upgrade(dstr, SVt_PVNV);
2604 sv_upgrade(dstr, SVt_PVIV);
2607 (void)SvIOK_only(dstr);
2608 SvIVX(dstr) = SvIVX(sstr);
2621 sv_upgrade(dstr, SVt_NV);
2626 sv_upgrade(dstr, SVt_PVNV);
2629 SvNVX(dstr) = SvNVX(sstr);
2630 (void)SvNOK_only(dstr);
2638 sv_upgrade(dstr, SVt_RV);
2639 else if (dtype == SVt_PVGV &&
2640 SvTYPE(SvRV(sstr)) == SVt_PVGV) {
2643 if (GvIMPORTED(dstr) != GVf_IMPORTED
2644 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
2646 GvIMPORTED_on(dstr);
2657 sv_upgrade(dstr, SVt_PV);
2660 if (dtype < SVt_PVIV)
2661 sv_upgrade(dstr, SVt_PVIV);
2664 if (dtype < SVt_PVNV)
2665 sv_upgrade(dstr, SVt_PVNV);
2672 Perl_croak(aTHX_ "Bizarre copy of %s in %s", sv_reftype(sstr, 0),
2673 PL_op_name[PL_op->op_type]);
2675 Perl_croak(aTHX_ "Bizarre copy of %s", sv_reftype(sstr, 0));
2679 if (dtype <= SVt_PVGV) {
2681 if (dtype != SVt_PVGV) {
2682 char *name = GvNAME(sstr);
2683 STRLEN len = GvNAMELEN(sstr);
2684 sv_upgrade(dstr, SVt_PVGV);
2685 sv_magic(dstr, dstr, '*', Nullch, 0);
2686 GvSTASH(dstr) = (HV*)SvREFCNT_inc(GvSTASH(sstr));
2687 GvNAME(dstr) = savepvn(name, len);
2688 GvNAMELEN(dstr) = len;
2689 SvFAKE_on(dstr); /* can coerce to non-glob */
2691 /* ahem, death to those who redefine active sort subs */
2692 else if (PL_curstackinfo->si_type == PERLSI_SORT
2693 && GvCV(dstr) && PL_sortcop == CvSTART(GvCV(dstr)))
2694 Perl_croak(aTHX_ "Can't redefine active sort subroutine %s",
2696 (void)SvOK_off(dstr);
2697 GvINTRO_off(dstr); /* one-shot flag */
2699 GvGP(dstr) = gp_ref(GvGP(sstr));
2701 if (GvIMPORTED(dstr) != GVf_IMPORTED
2702 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
2704 GvIMPORTED_on(dstr);
2712 if (SvGMAGICAL(sstr)) {
2714 if (SvTYPE(sstr) != stype) {
2715 stype = SvTYPE(sstr);
2716 if (stype == SVt_PVGV && dtype <= SVt_PVGV)
2720 if (stype == SVt_PVLV)
2721 (void)SvUPGRADE(dstr, SVt_PVNV);
2723 (void)SvUPGRADE(dstr, stype);
2726 sflags = SvFLAGS(sstr);
2728 if (sflags & SVf_ROK) {
2729 if (dtype >= SVt_PV) {
2730 if (dtype == SVt_PVGV) {
2731 SV *sref = SvREFCNT_inc(SvRV(sstr));
2733 int intro = GvINTRO(dstr);
2738 GvINTRO_off(dstr); /* one-shot flag */
2739 Newz(602,gp, 1, GP);
2740 GvGP(dstr) = gp_ref(gp);
2741 GvSV(dstr) = NEWSV(72,0);
2742 GvLINE(dstr) = CopLINE(PL_curcop);
2743 GvEGV(dstr) = (GV*)dstr;
2746 switch (SvTYPE(sref)) {
2749 SAVESPTR(GvAV(dstr));
2751 dref = (SV*)GvAV(dstr);
2752 GvAV(dstr) = (AV*)sref;
2753 if (!GvIMPORTED_AV(dstr)
2754 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
2756 GvIMPORTED_AV_on(dstr);
2761 SAVESPTR(GvHV(dstr));
2763 dref = (SV*)GvHV(dstr);
2764 GvHV(dstr) = (HV*)sref;
2765 if (!GvIMPORTED_HV(dstr)
2766 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
2768 GvIMPORTED_HV_on(dstr);
2773 if (GvCVGEN(dstr) && GvCV(dstr) != (CV*)sref) {
2774 SvREFCNT_dec(GvCV(dstr));
2775 GvCV(dstr) = Nullcv;
2776 GvCVGEN(dstr) = 0; /* Switch off cacheness. */
2777 PL_sub_generation++;
2779 SAVESPTR(GvCV(dstr));
2782 dref = (SV*)GvCV(dstr);
2783 if (GvCV(dstr) != (CV*)sref) {
2784 CV* cv = GvCV(dstr);
2786 if (!GvCVGEN((GV*)dstr) &&
2787 (CvROOT(cv) || CvXSUB(cv)))
2789 SV *const_sv = cv_const_sv(cv);
2790 bool const_changed = TRUE;
2792 const_changed = sv_cmp(const_sv,
2793 op_const_sv(CvSTART((CV*)sref),
2795 /* ahem, death to those who redefine
2796 * active sort subs */
2797 if (PL_curstackinfo->si_type == PERLSI_SORT &&
2798 PL_sortcop == CvSTART(cv))
2800 "Can't redefine active sort subroutine %s",
2801 GvENAME((GV*)dstr));
2802 if ((const_changed && const_sv) || ckWARN(WARN_REDEFINE))
2803 Perl_warner(aTHX_ WARN_REDEFINE, const_sv ?
2804 "Constant subroutine %s redefined"
2805 : "Subroutine %s redefined",
2806 GvENAME((GV*)dstr));
2808 cv_ckproto(cv, (GV*)dstr,
2809 SvPOK(sref) ? SvPVX(sref) : Nullch);
2811 GvCV(dstr) = (CV*)sref;
2812 GvCVGEN(dstr) = 0; /* Switch off cacheness. */
2813 GvASSUMECV_on(dstr);
2814 PL_sub_generation++;
2816 if (!GvIMPORTED_CV(dstr)
2817 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
2819 GvIMPORTED_CV_on(dstr);
2824 SAVESPTR(GvIOp(dstr));
2826 dref = (SV*)GvIOp(dstr);
2827 GvIOp(dstr) = (IO*)sref;
2831 SAVESPTR(GvFORM(dstr));
2833 dref = (SV*)GvFORM(dstr);
2834 GvFORM(dstr) = (CV*)sref;
2838 SAVESPTR(GvSV(dstr));
2840 dref = (SV*)GvSV(dstr);
2842 if (!GvIMPORTED_SV(dstr)
2843 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
2845 GvIMPORTED_SV_on(dstr);
2857 (void)SvOOK_off(dstr); /* backoff */
2859 Safefree(SvPVX(dstr));
2860 SvLEN(dstr)=SvCUR(dstr)=0;
2863 (void)SvOK_off(dstr);
2864 SvRV(dstr) = SvREFCNT_inc(SvRV(sstr));
2866 if (sflags & SVp_NOK) {
2868 SvNVX(dstr) = SvNVX(sstr);
2870 if (sflags & SVp_IOK) {
2871 (void)SvIOK_on(dstr);
2872 SvIVX(dstr) = SvIVX(sstr);
2873 if (sflags & SVf_IVisUV)
2876 if (SvAMAGIC(sstr)) {
2880 else if (sflags & SVp_POK) {
2883 * Check to see if we can just swipe the string. If so, it's a
2884 * possible small lose on short strings, but a big win on long ones.
2885 * It might even be a win on short strings if SvPVX(dstr)
2886 * has to be allocated and SvPVX(sstr) has to be freed.
2889 if (SvTEMP(sstr) && /* slated for free anyway? */
2890 SvREFCNT(sstr) == 1 && /* and no other references to it? */
2891 !(sflags & SVf_OOK) && /* and not involved in OOK hack? */
2892 SvLEN(sstr)) /* and really is a string */
2894 if (SvPVX(dstr)) { /* we know that dtype >= SVt_PV */
2896 SvFLAGS(dstr) &= ~SVf_OOK;
2897 Safefree(SvPVX(dstr) - SvIVX(dstr));
2899 else if (SvLEN(dstr))
2900 Safefree(SvPVX(dstr));
2902 (void)SvPOK_only(dstr);
2903 SvPV_set(dstr, SvPVX(sstr));
2904 SvLEN_set(dstr, SvLEN(sstr));
2905 SvCUR_set(dstr, SvCUR(sstr));
2908 (void)SvOK_off(sstr); /* NOTE: nukes most SvFLAGS on sstr */
2909 SvPV_set(sstr, Nullch);
2914 else { /* have to copy actual string */
2915 STRLEN len = SvCUR(sstr);
2917 SvGROW(dstr, len + 1); /* inlined from sv_setpvn */
2918 Move(SvPVX(sstr),SvPVX(dstr),len,char);
2919 SvCUR_set(dstr, len);
2920 *SvEND(dstr) = '\0';
2921 (void)SvPOK_only(dstr);
2923 if ((sflags & SVf_UTF8) && !IN_BYTE)
2926 if (sflags & SVp_NOK) {
2928 SvNVX(dstr) = SvNVX(sstr);
2930 if (sflags & SVp_IOK) {
2931 (void)SvIOK_on(dstr);
2932 SvIVX(dstr) = SvIVX(sstr);
2933 if (sflags & SVf_IVisUV)
2937 else if (sflags & SVp_NOK) {
2938 SvNVX(dstr) = SvNVX(sstr);
2939 (void)SvNOK_only(dstr);
2940 if (sflags & SVf_IOK) {
2941 (void)SvIOK_on(dstr);
2942 SvIVX(dstr) = SvIVX(sstr);
2943 /* XXXX Do we want to set IsUV for IV(ROK)? Be extra safe... */
2944 if (sflags & SVf_IVisUV)
2948 else if (sflags & SVp_IOK) {
2949 (void)SvIOK_only(dstr);
2950 SvIVX(dstr) = SvIVX(sstr);
2951 if (sflags & SVf_IVisUV)
2955 if (dtype == SVt_PVGV) {
2956 if (ckWARN(WARN_MISC))
2957 Perl_warner(aTHX_ WARN_MISC, "Undefined value assigned to typeglob");
2960 (void)SvOK_off(dstr);
2966 =for apidoc sv_setsv_mg
2968 Like C<sv_setsv>, but also handles 'set' magic.
2974 Perl_sv_setsv_mg(pTHX_ SV *dstr, register SV *sstr)
2976 sv_setsv(dstr,sstr);
2981 =for apidoc sv_setpvn
2983 Copies a string into an SV. The C<len> parameter indicates the number of
2984 bytes to be copied. Does not handle 'set' magic. See C<sv_setpvn_mg>.
2990 Perl_sv_setpvn(pTHX_ register SV *sv, register const char *ptr, register STRLEN len)
2992 register char *dptr;
2993 assert(len >= 0); /* STRLEN is probably unsigned, so this may
2994 elicit a warning, but it won't hurt. */
2995 SV_CHECK_THINKFIRST(sv);
3000 (void)SvUPGRADE(sv, SVt_PV);
3002 SvGROW(sv, len + 1);
3004 Move(ptr,dptr,len,char);
3007 (void)SvPOK_only(sv); /* validate pointer */
3012 =for apidoc sv_setpvn_mg
3014 Like C<sv_setpvn>, but also handles 'set' magic.
3020 Perl_sv_setpvn_mg(pTHX_ register SV *sv, register const char *ptr, register STRLEN len)
3022 sv_setpvn(sv,ptr,len);
3027 =for apidoc sv_setpv
3029 Copies a string into an SV. The string must be null-terminated. Does not
3030 handle 'set' magic. See C<sv_setpv_mg>.
3036 Perl_sv_setpv(pTHX_ register SV *sv, register const char *ptr)
3038 register STRLEN len;
3040 SV_CHECK_THINKFIRST(sv);
3046 (void)SvUPGRADE(sv, SVt_PV);
3048 SvGROW(sv, len + 1);
3049 Move(ptr,SvPVX(sv),len+1,char);
3051 (void)SvPOK_only(sv); /* validate pointer */
3056 =for apidoc sv_setpv_mg
3058 Like C<sv_setpv>, but also handles 'set' magic.
3064 Perl_sv_setpv_mg(pTHX_ register SV *sv, register const char *ptr)
3071 =for apidoc sv_usepvn
3073 Tells an SV to use C<ptr> to find its string value. Normally the string is
3074 stored inside the SV but sv_usepvn allows the SV to use an outside string.
3075 The C<ptr> should point to memory that was allocated by C<malloc>. The
3076 string length, C<len>, must be supplied. This function will realloc the
3077 memory pointed to by C<ptr>, so that pointer should not be freed or used by
3078 the programmer after giving it to sv_usepvn. Does not handle 'set' magic.
3079 See C<sv_usepvn_mg>.
3085 Perl_sv_usepvn(pTHX_ register SV *sv, register char *ptr, register STRLEN len)
3087 SV_CHECK_THINKFIRST(sv);
3088 (void)SvUPGRADE(sv, SVt_PV);
3093 (void)SvOOK_off(sv);
3094 if (SvPVX(sv) && SvLEN(sv))
3095 Safefree(SvPVX(sv));
3096 Renew(ptr, len+1, char);
3099 SvLEN_set(sv, len+1);
3101 (void)SvPOK_only(sv); /* validate pointer */
3106 =for apidoc sv_usepvn_mg
3108 Like C<sv_usepvn>, but also handles 'set' magic.
3114 Perl_sv_usepvn_mg(pTHX_ register SV *sv, register char *ptr, register STRLEN len)
3116 sv_usepvn(sv,ptr,len);
3121 Perl_sv_force_normal(pTHX_ register SV *sv)
3123 if (SvREADONLY(sv)) {
3126 char *pvx = SvPVX(sv);
3127 STRLEN len = SvCUR(sv);
3128 U32 hash = SvUVX(sv);
3129 SvGROW(sv, len + 1);
3130 Move(pvx,SvPVX(sv),len,char);
3134 unsharepvn(pvx,len,hash);
3136 else if (PL_curcop != &PL_compiling)
3137 Perl_croak(aTHX_ PL_no_modify);
3141 else if (SvFAKE(sv) && SvTYPE(sv) == SVt_PVGV)
3148 Efficient removal of characters from the beginning of the string buffer.
3149 SvPOK(sv) must be true and the C<ptr> must be a pointer to somewhere inside
3150 the string buffer. The C<ptr> becomes the first character of the adjusted
3157 Perl_sv_chop(pTHX_ register SV *sv, register char *ptr) /* like set but assuming ptr is in sv */
3161 register STRLEN delta;
3163 if (!ptr || !SvPOKp(sv))
3165 SV_CHECK_THINKFIRST(sv);
3166 if (SvTYPE(sv) < SVt_PVIV)
3167 sv_upgrade(sv,SVt_PVIV);
3170 if (!SvLEN(sv)) { /* make copy of shared string */
3171 char *pvx = SvPVX(sv);
3172 STRLEN len = SvCUR(sv);
3173 SvGROW(sv, len + 1);
3174 Move(pvx,SvPVX(sv),len,char);
3178 SvFLAGS(sv) |= SVf_OOK;
3180 SvFLAGS(sv) &= ~(SVf_IOK|SVf_NOK|SVp_IOK|SVp_NOK|SVf_IVisUV);
3181 delta = ptr - SvPVX(sv);
3189 =for apidoc sv_catpvn
3191 Concatenates the string onto the end of the string which is in the SV. The
3192 C<len> indicates number of bytes to copy. Handles 'get' magic, but not
3193 'set' magic. See C<sv_catpvn_mg>.
3199 Perl_sv_catpvn(pTHX_ register SV *sv, register const char *ptr, register STRLEN len)
3204 junk = SvPV_force(sv, tlen);
3205 SvGROW(sv, tlen + len + 1);
3208 Move(ptr,SvPVX(sv)+tlen,len,char);
3211 (void)SvPOK_only_UTF8(sv); /* validate pointer */
3216 =for apidoc sv_catpvn_mg
3218 Like C<sv_catpvn>, but also handles 'set' magic.
3224 Perl_sv_catpvn_mg(pTHX_ register SV *sv, register const char *ptr, register STRLEN len)
3226 sv_catpvn(sv,ptr,len);
3231 =for apidoc sv_catsv
3233 Concatenates the string from SV C<ssv> onto the end of the string in SV
3234 C<dsv>. Handles 'get' magic, but not 'set' magic. See C<sv_catsv_mg>.
3240 Perl_sv_catsv(pTHX_ SV *dstr, register SV *sstr)
3246 if ((s = SvPV(sstr, len))) {
3247 if (DO_UTF8(sstr)) {
3248 sv_utf8_upgrade(dstr);
3249 sv_catpvn(dstr,s,len);
3253 sv_catpvn(dstr,s,len);
3258 =for apidoc sv_catsv_mg
3260 Like C<sv_catsv>, but also handles 'set' magic.
3266 Perl_sv_catsv_mg(pTHX_ SV *dstr, register SV *sstr)
3268 sv_catsv(dstr,sstr);
3273 =for apidoc sv_catpv
3275 Concatenates the string onto the end of the string which is in the SV.
3276 Handles 'get' magic, but not 'set' magic. See C<sv_catpv_mg>.
3282 Perl_sv_catpv(pTHX_ register SV *sv, register const char *ptr)
3284 register STRLEN len;
3290 junk = SvPV_force(sv, tlen);
3292 SvGROW(sv, tlen + len + 1);
3295 Move(ptr,SvPVX(sv)+tlen,len+1,char);
3297 (void)SvPOK_only_UTF8(sv); /* validate pointer */
3302 =for apidoc sv_catpv_mg
3304 Like C<sv_catpv>, but also handles 'set' magic.
3310 Perl_sv_catpv_mg(pTHX_ register SV *sv, register const char *ptr)
3317 Perl_newSV(pTHX_ STRLEN len)
3323 sv_upgrade(sv, SVt_PV);
3324 SvGROW(sv, len + 1);
3329 /* name is assumed to contain an SV* if (name && namelen == HEf_SVKEY) */
3332 =for apidoc sv_magic
3334 Adds magic to an SV.
3340 Perl_sv_magic(pTHX_ register SV *sv, SV *obj, int how, const char *name, I32 namlen)
3344 if (SvREADONLY(sv)) {
3346 if (PL_curcop != &PL_compiling && !strchr("gBf", how))
3347 Perl_croak(aTHX_ PL_no_modify);
3349 if (SvMAGICAL(sv) || (how == 't' && SvTYPE(sv) >= SVt_PVMG)) {
3350 if (SvMAGIC(sv) && (mg = mg_find(sv, how))) {
3357 (void)SvUPGRADE(sv, SVt_PVMG);
3359 Newz(702,mg, 1, MAGIC);
3360 mg->mg_moremagic = SvMAGIC(sv);
3363 if (!obj || obj == sv || how == '#' || how == 'r')
3367 mg->mg_obj = SvREFCNT_inc(obj);
3368 mg->mg_flags |= MGf_REFCOUNTED;
3371 mg->mg_len = namlen;
3374 mg->mg_ptr = savepvn(name, namlen);
3375 else if (namlen == HEf_SVKEY)
3376 mg->mg_ptr = (char*)SvREFCNT_inc((SV*)name);
3380 mg->mg_virtual = &PL_vtbl_sv;
3383 mg->mg_virtual = &PL_vtbl_amagic;
3386 mg->mg_virtual = &PL_vtbl_amagicelem;
3392 mg->mg_virtual = &PL_vtbl_bm;
3395 mg->mg_virtual = &PL_vtbl_regdata;
3398 mg->mg_virtual = &PL_vtbl_regdatum;
3401 mg->mg_virtual = &PL_vtbl_env;
3404 mg->mg_virtual = &PL_vtbl_fm;
3407 mg->mg_virtual = &PL_vtbl_envelem;
3410 mg->mg_virtual = &PL_vtbl_mglob;
3413 mg->mg_virtual = &PL_vtbl_isa;
3416 mg->mg_virtual = &PL_vtbl_isaelem;
3419 mg->mg_virtual = &PL_vtbl_nkeys;
3426 mg->mg_virtual = &PL_vtbl_dbline;
3430 mg->mg_virtual = &PL_vtbl_mutex;
3432 #endif /* USE_THREADS */
3433 #ifdef USE_LOCALE_COLLATE
3435 mg->mg_virtual = &PL_vtbl_collxfrm;
3437 #endif /* USE_LOCALE_COLLATE */
3439 mg->mg_virtual = &PL_vtbl_pack;
3443 mg->mg_virtual = &PL_vtbl_packelem;
3446 mg->mg_virtual = &PL_vtbl_regexp;
3449 mg->mg_virtual = &PL_vtbl_sig;
3452 mg->mg_virtual = &PL_vtbl_sigelem;
3455 mg->mg_virtual = &PL_vtbl_taint;
3459 mg->mg_virtual = &PL_vtbl_uvar;
3462 mg->mg_virtual = &PL_vtbl_vec;
3465 mg->mg_virtual = &PL_vtbl_substr;
3468 mg->mg_virtual = &PL_vtbl_defelem;
3471 mg->mg_virtual = &PL_vtbl_glob;
3474 mg->mg_virtual = &PL_vtbl_arylen;
3477 mg->mg_virtual = &PL_vtbl_pos;
3480 mg->mg_virtual = &PL_vtbl_backref;
3482 case '~': /* Reserved for use by extensions not perl internals. */
3483 /* Useful for attaching extension internal data to perl vars. */
3484 /* Note that multiple extensions may clash if magical scalars */
3485 /* etc holding private data from one are passed to another. */
3489 Perl_croak(aTHX_ "Don't know how to handle magic of type '%c'", how);
3493 SvFLAGS(sv) &= ~(SVf_IOK|SVf_NOK|SVf_POK);
3497 =for apidoc sv_unmagic
3499 Removes magic from an SV.
3505 Perl_sv_unmagic(pTHX_ SV *sv, int type)
3509 if (SvTYPE(sv) < SVt_PVMG || !SvMAGIC(sv))
3512 for (mg = *mgp; mg; mg = *mgp) {
3513 if (mg->mg_type == type) {
3514 MGVTBL* vtbl = mg->mg_virtual;
3515 *mgp = mg->mg_moremagic;
3516 if (vtbl && vtbl->svt_free)
3517 CALL_FPTR(vtbl->svt_free)(aTHX_ sv, mg);
3518 if (mg->mg_ptr && mg->mg_type != 'g')
3519 if (mg->mg_len >= 0)
3520 Safefree(mg->mg_ptr);
3521 else if (mg->mg_len == HEf_SVKEY)
3522 SvREFCNT_dec((SV*)mg->mg_ptr);
3523 if (mg->mg_flags & MGf_REFCOUNTED)
3524 SvREFCNT_dec(mg->mg_obj);
3528 mgp = &mg->mg_moremagic;
3532 SvFLAGS(sv) |= (SvFLAGS(sv) & (SVp_IOK|SVp_NOK|SVp_POK)) >> PRIVSHIFT;
3539 =for apidoc sv_rvweaken
3547 Perl_sv_rvweaken(pTHX_ SV *sv)
3550 if (!SvOK(sv)) /* let undefs pass */
3553 Perl_croak(aTHX_ "Can't weaken a nonreference");
3554 else if (SvWEAKREF(sv)) {
3556 if (ckWARN(WARN_MISC))
3557 Perl_warner(aTHX_ WARN_MISC, "Reference is already weak");
3561 sv_add_backref(tsv, sv);
3568 S_sv_add_backref(pTHX_ SV *tsv, SV *sv)
3572 if (SvMAGICAL(tsv) && (mg = mg_find(tsv, '<')))
3573 av = (AV*)mg->mg_obj;
3576 sv_magic(tsv, (SV*)av, '<', NULL, 0);
3577 SvREFCNT_dec(av); /* for sv_magic */
3583 S_sv_del_backref(pTHX_ SV *sv)
3590 if (!SvMAGICAL(tsv) || !(mg = mg_find(tsv, '<')))
3591 Perl_croak(aTHX_ "panic: del_backref");
3592 av = (AV *)mg->mg_obj;
3597 svp[i] = &PL_sv_undef; /* XXX */
3604 =for apidoc sv_insert
3606 Inserts a string at the specified offset/length within the SV. Similar to
3607 the Perl substr() function.
3613 Perl_sv_insert(pTHX_ SV *bigstr, STRLEN offset, STRLEN len, char *little, STRLEN littlelen)
3617 register char *midend;
3618 register char *bigend;
3624 Perl_croak(aTHX_ "Can't modify non-existent substring");
3625 SvPV_force(bigstr, curlen);
3626 (void)SvPOK_only_UTF8(bigstr);
3627 if (offset + len > curlen) {
3628 SvGROW(bigstr, offset+len+1);
3629 Zero(SvPVX(bigstr)+curlen, offset+len-curlen, char);
3630 SvCUR_set(bigstr, offset+len);
3634 i = littlelen - len;
3635 if (i > 0) { /* string might grow */
3636 big = SvGROW(bigstr, SvCUR(bigstr) + i + 1);
3637 mid = big + offset + len;
3638 midend = bigend = big + SvCUR(bigstr);
3641 while (midend > mid) /* shove everything down */
3642 *--bigend = *--midend;
3643 Move(little,big+offset,littlelen,char);
3649 Move(little,SvPVX(bigstr)+offset,len,char);
3654 big = SvPVX(bigstr);
3657 bigend = big + SvCUR(bigstr);
3659 if (midend > bigend)
3660 Perl_croak(aTHX_ "panic: sv_insert");
3662 if (mid - big > bigend - midend) { /* faster to shorten from end */
3664 Move(little, mid, littlelen,char);
3667 i = bigend - midend;
3669 Move(midend, mid, i,char);
3673 SvCUR_set(bigstr, mid - big);
3676 else if ((i = mid - big)) { /* faster from front */
3677 midend -= littlelen;
3679 sv_chop(bigstr,midend-i);
3684 Move(little, mid, littlelen,char);
3686 else if (littlelen) {
3687 midend -= littlelen;
3688 sv_chop(bigstr,midend);
3689 Move(little,midend,littlelen,char);
3692 sv_chop(bigstr,midend);
3698 =for apidoc sv_replace
3700 Make the first argument a copy of the second, then delete the original.
3706 Perl_sv_replace(pTHX_ register SV *sv, register SV *nsv)
3709 U32 refcnt = SvREFCNT(sv);
3710 SV_CHECK_THINKFIRST(sv);
3711 if (SvREFCNT(nsv) != 1 && ckWARN_d(WARN_INTERNAL))
3712 Perl_warner(aTHX_ WARN_INTERNAL, "Reference miscount in sv_replace()");
3713 if (SvMAGICAL(sv)) {
3717 sv_upgrade(nsv, SVt_PVMG);
3718 SvMAGIC(nsv) = SvMAGIC(sv);
3719 SvFLAGS(nsv) |= SvMAGICAL(sv);
3725 assert(!SvREFCNT(sv));
3726 StructCopy(nsv,sv,SV);
3727 SvREFCNT(sv) = refcnt;
3728 SvFLAGS(nsv) |= SVTYPEMASK; /* Mark as freed */
3733 =for apidoc sv_clear
3735 Clear an SV, making it empty. Does not free the memory used by the SV
3742 Perl_sv_clear(pTHX_ register SV *sv)
3746 assert(SvREFCNT(sv) == 0);
3750 if (PL_defstash) { /* Still have a symbol table? */
3755 Zero(&tmpref, 1, SV);
3756 sv_upgrade(&tmpref, SVt_RV);
3758 SvREADONLY_on(&tmpref); /* DESTROY() could be naughty */
3759 SvREFCNT(&tmpref) = 1;
3762 stash = SvSTASH(sv);
3763 destructor = gv_fetchmethod(SvSTASH(sv), "DESTROY");
3766 PUSHSTACKi(PERLSI_DESTROY);
3767 SvRV(&tmpref) = SvREFCNT_inc(sv);
3772 call_sv((SV*)GvCV(destructor),
3773 G_DISCARD|G_EVAL|G_KEEPERR);
3779 } while (SvOBJECT(sv) && SvSTASH(sv) != stash);
3781 del_XRV(SvANY(&tmpref));
3784 if (PL_in_clean_objs)
3785 Perl_croak(aTHX_ "DESTROY created new reference to dead object '%s'",
3787 /* DESTROY gave object new lease on life */
3793 SvREFCNT_dec(SvSTASH(sv)); /* possibly of changed persuasion */
3794 SvOBJECT_off(sv); /* Curse the object. */
3795 if (SvTYPE(sv) != SVt_PVIO)
3796 --PL_sv_objcount; /* XXX Might want something more general */
3799 if (SvTYPE(sv) >= SVt_PVMG && SvMAGIC(sv))
3802 switch (SvTYPE(sv)) {
3805 IoIFP(sv) != PerlIO_stdin() &&
3806 IoIFP(sv) != PerlIO_stdout() &&
3807 IoIFP(sv) != PerlIO_stderr())
3809 io_close((IO*)sv, FALSE);
3811 if (IoDIRP(sv) && !(IoFLAGS(sv) & IOf_FAKE_DIRP))
3812 PerlDir_close(IoDIRP(sv));
3813 IoDIRP(sv) = (DIR*)NULL;
3814 Safefree(IoTOP_NAME(sv));
3815 Safefree(IoFMT_NAME(sv));
3816 Safefree(IoBOTTOM_NAME(sv));
3831 SvREFCNT_dec(LvTARG(sv));
3835 Safefree(GvNAME(sv));
3836 /* cannot decrease stash refcount yet, as we might recursively delete
3837 ourselves when the refcnt drops to zero. Delay SvREFCNT_dec
3838 of stash until current sv is completely gone.
3839 -- JohnPC, 27 Mar 1998 */
3840 stash = GvSTASH(sv);
3846 (void)SvOOK_off(sv);
3854 SvREFCNT_dec(SvRV(sv));
3856 else if (SvPVX(sv) && SvLEN(sv))
3857 Safefree(SvPVX(sv));
3858 else if (SvPVX(sv) && SvREADONLY(sv) && SvFAKE(sv)) {
3859 unsharepvn(SvPVX(sv),SvCUR(sv),SvUVX(sv));
3871 switch (SvTYPE(sv)) {
3887 del_XPVIV(SvANY(sv));
3890 del_XPVNV(SvANY(sv));
3893 del_XPVMG(SvANY(sv));
3896 del_XPVLV(SvANY(sv));
3899 del_XPVAV(SvANY(sv));
3902 del_XPVHV(SvANY(sv));
3905 del_XPVCV(SvANY(sv));
3908 del_XPVGV(SvANY(sv));
3909 /* code duplication for increased performance. */
3910 SvFLAGS(sv) &= SVf_BREAK;
3911 SvFLAGS(sv) |= SVTYPEMASK;
3912 /* decrease refcount of the stash that owns this GV, if any */
3914 SvREFCNT_dec(stash);
3915 return; /* not break, SvFLAGS reset already happened */
3917 del_XPVBM(SvANY(sv));
3920 del_XPVFM(SvANY(sv));
3923 del_XPVIO(SvANY(sv));
3926 SvFLAGS(sv) &= SVf_BREAK;
3927 SvFLAGS(sv) |= SVTYPEMASK;
3931 Perl_sv_newref(pTHX_ SV *sv)
3934 ATOMIC_INC(SvREFCNT(sv));
3941 Free the memory used by an SV.
3947 Perl_sv_free(pTHX_ SV *sv)
3950 int refcount_is_zero;
3954 if (SvREFCNT(sv) == 0) {
3955 if (SvFLAGS(sv) & SVf_BREAK)
3957 if (PL_in_clean_all) /* All is fair */
3959 if (SvREADONLY(sv) && SvIMMORTAL(sv)) {
3960 /* make sure SvREFCNT(sv)==0 happens very seldom */
3961 SvREFCNT(sv) = (~(U32)0)/2;
3964 if (ckWARN_d(WARN_INTERNAL))
3965 Perl_warner(aTHX_ WARN_INTERNAL, "Attempt to free unreferenced scalar");
3968 ATOMIC_DEC_AND_TEST(refcount_is_zero, SvREFCNT(sv));
3969 if (!refcount_is_zero)
3973 if (ckWARN_d(WARN_DEBUGGING))
3974 Perl_warner(aTHX_ WARN_DEBUGGING,
3975 "Attempt to free temp prematurely: SV 0x%"UVxf,
3980 if (SvREADONLY(sv) && SvIMMORTAL(sv)) {
3981 /* make sure SvREFCNT(sv)==0 happens very seldom */
3982 SvREFCNT(sv) = (~(U32)0)/2;
3993 Returns the length of the string in the SV. See also C<SvCUR>.
3999 Perl_sv_len(pTHX_ register SV *sv)
4008 len = mg_length(sv);
4010 junk = SvPV(sv, len);
4015 =for apidoc sv_len_utf8
4017 Returns the number of characters in the string in an SV, counting wide
4018 UTF8 bytes as a single character.
4024 Perl_sv_len_utf8(pTHX_ register SV *sv)
4035 len = mg_length(sv);
4038 s = (U8*)SvPV(sv, len);
4049 Perl_sv_pos_u2b(pTHX_ register SV *sv, I32* offsetp, I32* lenp)
4054 I32 uoffset = *offsetp;
4060 start = s = (U8*)SvPV(sv, len);
4062 while (s < send && uoffset--)
4066 *offsetp = s - start;
4070 while (s < send && ulen--)
4080 Perl_sv_pos_b2u(pTHX_ register SV *sv, I32* offsetp)
4089 s = (U8*)SvPV(sv, len);
4091 Perl_croak(aTHX_ "panic: bad byte offset");
4092 send = s + *offsetp;
4100 if (ckWARN_d(WARN_UTF8))
4101 Perl_warner(aTHX_ WARN_UTF8, "Malformed UTF-8 character");
4111 Returns a boolean indicating whether the strings in the two SVs are
4118 Perl_sv_eq(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 && 0) {
4145 pv2 = (char*)bytes_to_utf8((U8*)pv2, &cur2);
4149 pv1 = (char*)bytes_to_utf8((U8*)pv1, &cur1);
4155 eq = memEQ(pv1, pv2, cur1);
4168 Compares the strings in two SVs. Returns -1, 0, or 1 indicating whether the
4169 string in C<sv1> is less than, equal to, or greater than the string in
4176 Perl_sv_cmp(pTHX_ register SV *sv1, register SV *sv2)
4181 bool pv1tmp = FALSE;
4182 bool pv2tmp = FALSE;
4189 pv1 = SvPV(sv1, cur1);
4196 pv2 = SvPV(sv2, cur2);
4198 /* do not utf8ize the comparands as a side-effect */
4199 if (cur1 && cur2 && SvUTF8(sv1) != SvUTF8(sv2) && !IN_BYTE) {
4201 pv2 = (char*)bytes_to_utf8((U8*)pv2, &cur2);
4205 pv1 = (char*)bytes_to_utf8((U8*)pv1, &cur1);
4211 cmp = cur2 ? -1 : 0;
4215 I32 retval = memcmp((void*)pv1, (void*)pv2, cur1 < cur2 ? cur1 : cur2);
4218 cmp = retval < 0 ? -1 : 1;
4219 } else if (cur1 == cur2) {
4222 cmp = cur1 < cur2 ? -1 : 1;
4235 =for apidoc sv_cmp_locale
4237 Compares the strings in two SVs in a locale-aware manner. See
4244 Perl_sv_cmp_locale(pTHX_ register SV *sv1, register SV *sv2)
4246 #ifdef USE_LOCALE_COLLATE
4252 if (PL_collation_standard)
4256 pv1 = sv1 ? sv_collxfrm(sv1, &len1) : (char *) NULL;
4258 pv2 = sv2 ? sv_collxfrm(sv2, &len2) : (char *) NULL;
4260 if (!pv1 || !len1) {
4271 retval = memcmp((void*)pv1, (void*)pv2, len1 < len2 ? len1 : len2);
4274 return retval < 0 ? -1 : 1;
4277 * When the result of collation is equality, that doesn't mean
4278 * that there are no differences -- some locales exclude some
4279 * characters from consideration. So to avoid false equalities,
4280 * we use the raw string as a tiebreaker.
4286 #endif /* USE_LOCALE_COLLATE */
4288 return sv_cmp(sv1, sv2);
4291 #ifdef USE_LOCALE_COLLATE
4293 * Any scalar variable may carry an 'o' magic that contains the
4294 * scalar data of the variable transformed to such a format that
4295 * a normal memory comparison can be used to compare the data
4296 * according to the locale settings.
4299 Perl_sv_collxfrm(pTHX_ SV *sv, STRLEN *nxp)
4303 mg = SvMAGICAL(sv) ? mg_find(sv, 'o') : (MAGIC *) NULL;
4304 if (!mg || !mg->mg_ptr || *(U32*)mg->mg_ptr != PL_collation_ix) {
4309 Safefree(mg->mg_ptr);
4311 if ((xf = mem_collxfrm(s, len, &xlen))) {
4312 if (SvREADONLY(sv)) {
4315 return xf + sizeof(PL_collation_ix);
4318 sv_magic(sv, 0, 'o', 0, 0);
4319 mg = mg_find(sv, 'o');
4332 if (mg && mg->mg_ptr) {
4334 return mg->mg_ptr + sizeof(PL_collation_ix);
4342 #endif /* USE_LOCALE_COLLATE */
4347 Get a line from the filehandle and store it into the SV, optionally
4348 appending to the currently-stored string.
4354 Perl_sv_gets(pTHX_ register SV *sv, register PerlIO *fp, I32 append)
4359 register STDCHAR rslast;
4360 register STDCHAR *bp;
4364 SV_CHECK_THINKFIRST(sv);
4365 (void)SvUPGRADE(sv, SVt_PV);
4369 if (RsSNARF(PL_rs)) {
4373 else if (RsRECORD(PL_rs)) {
4374 I32 recsize, bytesread;
4377 /* Grab the size of the record we're getting */
4378 recsize = SvIV(SvRV(PL_rs));
4379 (void)SvPOK_only(sv); /* Validate pointer */
4380 buffer = SvGROW(sv, recsize + 1);
4383 /* VMS wants read instead of fread, because fread doesn't respect */
4384 /* RMS record boundaries. This is not necessarily a good thing to be */
4385 /* doing, but we've got no other real choice */
4386 bytesread = PerlLIO_read(PerlIO_fileno(fp), buffer, recsize);
4388 bytesread = PerlIO_read(fp, buffer, recsize);
4390 SvCUR_set(sv, bytesread);
4391 buffer[bytesread] = '\0';
4392 return(SvCUR(sv) ? SvPVX(sv) : Nullch);
4394 else if (RsPARA(PL_rs)) {
4399 rsptr = SvPV(PL_rs, rslen);
4400 rslast = rslen ? rsptr[rslen - 1] : '\0';
4402 if (RsPARA(PL_rs)) { /* have to do this both before and after */
4403 do { /* to make sure file boundaries work right */
4406 i = PerlIO_getc(fp);
4410 PerlIO_ungetc(fp,i);
4416 /* See if we know enough about I/O mechanism to cheat it ! */
4418 /* This used to be #ifdef test - it is made run-time test for ease
4419 of abstracting out stdio interface. One call should be cheap
4420 enough here - and may even be a macro allowing compile
4424 if (PerlIO_fast_gets(fp)) {
4427 * We're going to steal some values from the stdio struct
4428 * and put EVERYTHING in the innermost loop into registers.
4430 register STDCHAR *ptr;
4434 #if defined(VMS) && defined(PERLIO_IS_STDIO)
4435 /* An ungetc()d char is handled separately from the regular
4436 * buffer, so we getc() it back out and stuff it in the buffer.
4438 i = PerlIO_getc(fp);
4439 if (i == EOF) return 0;
4440 *(--((*fp)->_ptr)) = (unsigned char) i;
4444 /* Here is some breathtakingly efficient cheating */
4446 cnt = PerlIO_get_cnt(fp); /* get count into register */
4447 (void)SvPOK_only(sv); /* validate pointer */
4448 if (SvLEN(sv) - append <= cnt + 1) { /* make sure we have the room */
4449 if (cnt > 80 && SvLEN(sv) > append) {
4450 shortbuffered = cnt - SvLEN(sv) + append + 1;
4451 cnt -= shortbuffered;
4455 /* remember that cnt can be negative */
4456 SvGROW(sv, append + (cnt <= 0 ? 2 : (cnt + 1)));
4461 bp = (STDCHAR*)SvPVX(sv) + append; /* move these two too to registers */
4462 ptr = (STDCHAR*)PerlIO_get_ptr(fp);
4463 DEBUG_P(PerlIO_printf(Perl_debug_log,
4464 "Screamer: entering, ptr=%"UVuf", cnt=%ld\n",PTR2UV(ptr),(long)cnt));
4465 DEBUG_P(PerlIO_printf(Perl_debug_log,
4466 "Screamer: entering: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
4467 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
4468 PTR2UV(PerlIO_has_base(fp) ? PerlIO_get_base(fp) : 0)));
4473 while (cnt > 0) { /* this | eat */
4475 if ((*bp++ = *ptr++) == rslast) /* really | dust */
4476 goto thats_all_folks; /* screams | sed :-) */
4480 Copy(ptr, bp, cnt, char); /* this | eat */
4481 bp += cnt; /* screams | dust */
4482 ptr += cnt; /* louder | sed :-) */
4487 if (shortbuffered) { /* oh well, must extend */
4488 cnt = shortbuffered;
4490 bpx = bp - (STDCHAR*)SvPVX(sv); /* box up before relocation */
4492 SvGROW(sv, SvLEN(sv) + append + cnt + 2);
4493 bp = (STDCHAR*)SvPVX(sv) + bpx; /* unbox after relocation */
4497 DEBUG_P(PerlIO_printf(Perl_debug_log,
4498 "Screamer: going to getc, ptr=%"UVuf", cnt=%ld\n",
4499 PTR2UV(ptr),(long)cnt));
4500 PerlIO_set_ptrcnt(fp, ptr, cnt); /* deregisterize cnt and ptr */
4501 DEBUG_P(PerlIO_printf(Perl_debug_log,
4502 "Screamer: pre: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
4503 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
4504 PTR2UV(PerlIO_has_base (fp) ? PerlIO_get_base(fp) : 0)));
4505 /* This used to call 'filbuf' in stdio form, but as that behaves like
4506 getc when cnt <= 0 we use PerlIO_getc here to avoid introducing
4507 another abstraction. */
4508 i = PerlIO_getc(fp); /* get more characters */
4509 DEBUG_P(PerlIO_printf(Perl_debug_log,
4510 "Screamer: post: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
4511 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
4512 PTR2UV(PerlIO_has_base (fp) ? PerlIO_get_base(fp) : 0)));
4513 cnt = PerlIO_get_cnt(fp);
4514 ptr = (STDCHAR*)PerlIO_get_ptr(fp); /* reregisterize cnt and ptr */
4515 DEBUG_P(PerlIO_printf(Perl_debug_log,
4516 "Screamer: after getc, ptr=%"UVuf", cnt=%ld\n",PTR2UV(ptr),(long)cnt));
4518 if (i == EOF) /* all done for ever? */
4519 goto thats_really_all_folks;
4521 bpx = bp - (STDCHAR*)SvPVX(sv); /* box up before relocation */
4523 SvGROW(sv, bpx + cnt + 2);
4524 bp = (STDCHAR*)SvPVX(sv) + bpx; /* unbox after relocation */
4526 *bp++ = i; /* store character from PerlIO_getc */
4528 if (rslen && (STDCHAR)i == rslast) /* all done for now? */
4529 goto thats_all_folks;
4533 if ((rslen > 1 && (bp - (STDCHAR*)SvPVX(sv) < rslen)) ||
4534 memNE((char*)bp - rslen, rsptr, rslen))
4535 goto screamer; /* go back to the fray */
4536 thats_really_all_folks:
4538 cnt += shortbuffered;
4539 DEBUG_P(PerlIO_printf(Perl_debug_log,
4540 "Screamer: quitting, ptr=%"UVuf", cnt=%ld\n",PTR2UV(ptr),(long)cnt));
4541 PerlIO_set_ptrcnt(fp, ptr, cnt); /* put these back or we're in trouble */
4542 DEBUG_P(PerlIO_printf(Perl_debug_log,
4543 "Screamer: end: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
4544 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
4545 PTR2UV(PerlIO_has_base (fp) ? PerlIO_get_base(fp) : 0)));
4547 SvCUR_set(sv, bp - (STDCHAR*)SvPVX(sv)); /* set length */
4548 DEBUG_P(PerlIO_printf(Perl_debug_log,
4549 "Screamer: done, len=%ld, string=|%.*s|\n",
4550 (long)SvCUR(sv),(int)SvCUR(sv),SvPVX(sv)));
4555 /*The big, slow, and stupid way */
4558 /* Need to work around EPOC SDK features */
4559 /* On WINS: MS VC5 generates calls to _chkstk, */
4560 /* if a `large' stack frame is allocated */
4561 /* gcc on MARM does not generate calls like these */
4567 register STDCHAR *bpe = buf + sizeof(buf);
4569 while ((i = PerlIO_getc(fp)) != EOF && (*bp++ = i) != rslast && bp < bpe)
4570 ; /* keep reading */
4574 cnt = PerlIO_read(fp,(char*)buf, sizeof(buf));
4575 /* Accomodate broken VAXC compiler, which applies U8 cast to
4576 * both args of ?: operator, causing EOF to change into 255
4578 if (cnt) { i = (U8)buf[cnt - 1]; } else { i = EOF; }
4582 sv_catpvn(sv, (char *) buf, cnt);
4584 sv_setpvn(sv, (char *) buf, cnt);
4586 if (i != EOF && /* joy */
4588 SvCUR(sv) < rslen ||
4589 memNE(SvPVX(sv) + SvCUR(sv) - rslen, rsptr, rslen)))
4593 * If we're reading from a TTY and we get a short read,
4594 * indicating that the user hit his EOF character, we need
4595 * to notice it now, because if we try to read from the TTY
4596 * again, the EOF condition will disappear.
4598 * The comparison of cnt to sizeof(buf) is an optimization
4599 * that prevents unnecessary calls to feof().
4603 if (!(cnt < sizeof(buf) && PerlIO_eof(fp)))
4608 if (RsPARA(PL_rs)) { /* have to do this both before and after */
4609 while (i != EOF) { /* to make sure file boundaries work right */
4610 i = PerlIO_getc(fp);
4612 PerlIO_ungetc(fp,i);
4618 return (SvCUR(sv) - append) ? SvPVX(sv) : Nullch;
4625 Auto-increment of the value in the SV.
4631 Perl_sv_inc(pTHX_ register SV *sv)
4640 if (SvTHINKFIRST(sv)) {
4641 if (SvREADONLY(sv)) {
4643 if (PL_curcop != &PL_compiling)
4644 Perl_croak(aTHX_ PL_no_modify);
4648 if (SvAMAGIC(sv) && AMG_CALLun(sv,inc))
4650 i = PTR2IV(SvRV(sv));
4655 flags = SvFLAGS(sv);
4656 if (flags & SVp_NOK) {
4657 (void)SvNOK_only(sv);
4661 if (flags & SVp_IOK) {
4663 if (SvUVX(sv) == UV_MAX)
4664 sv_setnv(sv, (NV)UV_MAX + 1.0);
4666 (void)SvIOK_only_UV(sv);
4669 if (SvIVX(sv) == IV_MAX)
4670 sv_setnv(sv, (NV)IV_MAX + 1.0);
4672 (void)SvIOK_only(sv);
4678 if (!(flags & SVp_POK) || !*SvPVX(sv)) {
4679 if ((flags & SVTYPEMASK) < SVt_PVNV)
4680 sv_upgrade(sv, SVt_NV);
4682 (void)SvNOK_only(sv);
4686 while (isALPHA(*d)) d++;
4687 while (isDIGIT(*d)) d++;
4689 sv_setnv(sv,Atof(SvPVX(sv)) + 1.0); /* punt */
4693 while (d >= SvPVX(sv)) {
4701 /* MKS: The original code here died if letters weren't consecutive.
4702 * at least it didn't have to worry about non-C locales. The
4703 * new code assumes that ('z'-'a')==('Z'-'A'), letters are
4704 * arranged in order (although not consecutively) and that only
4705 * [A-Za-z] are accepted by isALPHA in the C locale.
4707 if (*d != 'z' && *d != 'Z') {
4708 do { ++*d; } while (!isALPHA(*d));
4711 *(d--) -= 'z' - 'a';
4716 *(d--) -= 'z' - 'a' + 1;
4720 /* oh,oh, the number grew */
4721 SvGROW(sv, SvCUR(sv) + 2);
4723 for (d = SvPVX(sv) + SvCUR(sv); d > SvPVX(sv); d--)
4734 Auto-decrement of the value in the SV.
4740 Perl_sv_dec(pTHX_ register SV *sv)
4748 if (SvTHINKFIRST(sv)) {
4749 if (SvREADONLY(sv)) {
4751 if (PL_curcop != &PL_compiling)
4752 Perl_croak(aTHX_ PL_no_modify);
4756 if (SvAMAGIC(sv) && AMG_CALLun(sv,dec))
4758 i = PTR2IV(SvRV(sv));
4763 flags = SvFLAGS(sv);
4764 if (flags & SVp_NOK) {
4766 (void)SvNOK_only(sv);
4769 if (flags & SVp_IOK) {
4771 if (SvUVX(sv) == 0) {
4772 (void)SvIOK_only(sv);
4776 (void)SvIOK_only_UV(sv);
4780 if (SvIVX(sv) == IV_MIN)
4781 sv_setnv(sv, (NV)IV_MIN - 1.0);
4783 (void)SvIOK_only(sv);
4789 if (!(flags & SVp_POK)) {
4790 if ((flags & SVTYPEMASK) < SVt_PVNV)
4791 sv_upgrade(sv, SVt_NV);
4793 (void)SvNOK_only(sv);
4796 sv_setnv(sv,Atof(SvPVX(sv)) - 1.0); /* punt */
4800 =for apidoc sv_mortalcopy
4802 Creates a new SV which is a copy of the original SV. The new SV is marked
4808 /* Make a string that will exist for the duration of the expression
4809 * evaluation. Actually, it may have to last longer than that, but
4810 * hopefully we won't free it until it has been assigned to a
4811 * permanent location. */
4814 Perl_sv_mortalcopy(pTHX_ SV *oldstr)
4820 sv_setsv(sv,oldstr);
4822 PL_tmps_stack[++PL_tmps_ix] = sv;
4828 =for apidoc sv_newmortal
4830 Creates a new SV which is mortal. The reference count of the SV is set to 1.
4836 Perl_sv_newmortal(pTHX)
4842 SvFLAGS(sv) = SVs_TEMP;
4844 PL_tmps_stack[++PL_tmps_ix] = sv;
4849 =for apidoc sv_2mortal
4851 Marks an SV as mortal. The SV will be destroyed when the current context
4857 /* same thing without the copying */
4860 Perl_sv_2mortal(pTHX_ register SV *sv)
4865 if (SvREADONLY(sv) && SvIMMORTAL(sv))
4868 PL_tmps_stack[++PL_tmps_ix] = sv;
4876 Creates a new SV and copies a string into it. The reference count for the
4877 SV is set to 1. If C<len> is zero, Perl will compute the length using
4878 strlen(). For efficiency, consider using C<newSVpvn> instead.
4884 Perl_newSVpv(pTHX_ const char *s, STRLEN len)
4891 sv_setpvn(sv,s,len);
4896 =for apidoc newSVpvn
4898 Creates a new SV and copies a string into it. The reference count for the
4899 SV is set to 1. Note that if C<len> is zero, Perl will create a zero length
4900 string. You are responsible for ensuring that the source string is at least
4907 Perl_newSVpvn(pTHX_ const char *s, STRLEN len)
4912 sv_setpvn(sv,s,len);
4917 =for apidoc newSVpvn_share
4919 Creates a new SV and populates it with a string from
4920 the string table. Turns on READONLY and FAKE.
4921 The idea here is that as string table is used for shared hash
4922 keys these strings will have SvPVX == HeKEY and hash lookup
4923 will avoid string compare.
4929 Perl_newSVpvn_share(pTHX_ const char *src, STRLEN len, U32 hash)
4933 PERL_HASH(hash, src, len);
4935 sv_upgrade(sv, SVt_PVIV);
4936 SvPVX(sv) = sharepvn(src, len, hash);
4946 #if defined(PERL_IMPLICIT_CONTEXT)
4948 Perl_newSVpvf_nocontext(const char* pat, ...)
4953 va_start(args, pat);
4954 sv = vnewSVpvf(pat, &args);
4961 =for apidoc newSVpvf
4963 Creates a new SV an initialize it with the string formatted like
4970 Perl_newSVpvf(pTHX_ const char* pat, ...)
4974 va_start(args, pat);
4975 sv = vnewSVpvf(pat, &args);
4981 Perl_vnewSVpvf(pTHX_ const char* pat, va_list* args)
4985 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
4992 Creates a new SV and copies a floating point value into it.
4993 The reference count for the SV is set to 1.
4999 Perl_newSVnv(pTHX_ NV n)
5011 Creates a new SV and copies an integer into it. The reference count for the
5018 Perl_newSViv(pTHX_ IV i)
5030 Creates a new SV and copies an unsigned integer into it.
5031 The reference count for the SV is set to 1.
5037 Perl_newSVuv(pTHX_ UV u)
5047 =for apidoc newRV_noinc
5049 Creates an RV wrapper for an SV. The reference count for the original
5050 SV is B<not> incremented.
5056 Perl_newRV_noinc(pTHX_ SV *tmpRef)
5062 sv_upgrade(sv, SVt_RV);
5069 /* newRV_inc is #defined to newRV in sv.h */
5071 Perl_newRV(pTHX_ SV *tmpRef)
5073 return newRV_noinc(SvREFCNT_inc(tmpRef));
5079 Creates a new SV which is an exact duplicate of the original SV.
5084 /* make an exact duplicate of old */
5087 Perl_newSVsv(pTHX_ register SV *old)
5094 if (SvTYPE(old) == SVTYPEMASK) {
5095 if (ckWARN_d(WARN_INTERNAL))
5096 Perl_warner(aTHX_ WARN_INTERNAL, "semi-panic: attempt to dup freed string");
5111 Perl_sv_reset(pTHX_ register char *s, HV *stash)
5119 char todo[PERL_UCHAR_MAX+1];
5124 if (!*s) { /* reset ?? searches */
5125 for (pm = HvPMROOT(stash); pm; pm = pm->op_pmnext) {
5126 pm->op_pmdynflags &= ~PMdf_USED;
5131 /* reset variables */
5133 if (!HvARRAY(stash))
5136 Zero(todo, 256, char);
5138 i = (unsigned char)*s;
5142 max = (unsigned char)*s++;
5143 for ( ; i <= max; i++) {
5146 for (i = 0; i <= (I32) HvMAX(stash); i++) {
5147 for (entry = HvARRAY(stash)[i];
5149 entry = HeNEXT(entry))
5151 if (!todo[(U8)*HeKEY(entry)])
5153 gv = (GV*)HeVAL(entry);
5155 if (SvTHINKFIRST(sv)) {
5156 if (!SvREADONLY(sv) && SvROK(sv))
5161 if (SvTYPE(sv) >= SVt_PV) {
5163 if (SvPVX(sv) != Nullch)
5170 if (GvHV(gv) && !HvNAME(GvHV(gv))) {
5172 #ifndef VMS /* VMS has no environ array */
5174 environ[0] = Nullch;
5183 Perl_sv_2io(pTHX_ SV *sv)
5189 switch (SvTYPE(sv)) {
5197 Perl_croak(aTHX_ "Bad filehandle: %s", GvNAME(gv));
5201 Perl_croak(aTHX_ PL_no_usym, "filehandle");
5203 return sv_2io(SvRV(sv));
5204 gv = gv_fetchpv(SvPV(sv,n_a), FALSE, SVt_PVIO);
5210 Perl_croak(aTHX_ "Bad filehandle: %s", SvPV(sv,n_a));
5217 Perl_sv_2cv(pTHX_ SV *sv, HV **st, GV **gvp, I32 lref)
5224 return *gvp = Nullgv, Nullcv;
5225 switch (SvTYPE(sv)) {
5245 SV **sp = &sv; /* Used in tryAMAGICunDEREF macro. */
5246 tryAMAGICunDEREF(to_cv);
5249 if (SvTYPE(sv) == SVt_PVCV) {
5258 Perl_croak(aTHX_ "Not a subroutine reference");
5263 gv = gv_fetchpv(SvPV(sv, n_a), lref, SVt_PVCV);
5269 if (lref && !GvCVu(gv)) {
5272 tmpsv = NEWSV(704,0);
5273 gv_efullname3(tmpsv, gv, Nullch);
5274 /* XXX this is probably not what they think they're getting.
5275 * It has the same effect as "sub name;", i.e. just a forward
5277 newSUB(start_subparse(FALSE, 0),
5278 newSVOP(OP_CONST, 0, tmpsv),
5283 Perl_croak(aTHX_ "Unable to create sub named \"%s\"", SvPV(sv,n_a));
5292 Returns true if the SV has a true value by Perl's rules.
5298 Perl_sv_true(pTHX_ register SV *sv)
5305 if ((tXpv = (XPV*)SvANY(sv)) &&
5306 (tXpv->xpv_cur > 1 ||
5307 (tXpv->xpv_cur && *tXpv->xpv_pv != '0')))
5314 return SvIVX(sv) != 0;
5317 return SvNVX(sv) != 0.0;
5319 return sv_2bool(sv);
5325 Perl_sv_iv(pTHX_ register SV *sv)
5329 return (IV)SvUVX(sv);
5336 Perl_sv_uv(pTHX_ register SV *sv)
5341 return (UV)SvIVX(sv);
5347 Perl_sv_nv(pTHX_ register SV *sv)
5355 Perl_sv_pv(pTHX_ SV *sv)
5362 return sv_2pv(sv, &n_a);
5366 Perl_sv_pvn(pTHX_ SV *sv, STRLEN *lp)
5372 return sv_2pv(sv, lp);
5376 =for apidoc sv_pvn_force
5378 Get a sensible string out of the SV somehow.
5384 Perl_sv_pvn_force(pTHX_ SV *sv, STRLEN *lp)
5388 if (SvTHINKFIRST(sv) && !SvROK(sv))
5389 sv_force_normal(sv);
5395 if (SvTYPE(sv) > SVt_PVLV && SvTYPE(sv) != SVt_PVFM) {
5397 Perl_croak(aTHX_ "Can't coerce %s to string in %s", sv_reftype(sv,0),
5398 PL_op_name[PL_op->op_type]);
5402 if (s != SvPVX(sv)) { /* Almost, but not quite, sv_setpvn() */
5407 (void)SvUPGRADE(sv, SVt_PV); /* Never FALSE */
5408 SvGROW(sv, len + 1);
5409 Move(s,SvPVX(sv),len,char);
5414 SvPOK_on(sv); /* validate pointer */
5416 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2pv(%s)\n",
5417 PTR2UV(sv),SvPVX(sv)));
5424 Perl_sv_pvbyte(pTHX_ SV *sv)
5430 Perl_sv_pvbyten(pTHX_ SV *sv, STRLEN *lp)
5432 return sv_pvn(sv,lp);
5436 Perl_sv_pvbyten_force(pTHX_ SV *sv, STRLEN *lp)
5438 return sv_pvn_force(sv,lp);
5442 Perl_sv_pvutf8(pTHX_ SV *sv)
5444 sv_utf8_upgrade(sv);
5449 Perl_sv_pvutf8n(pTHX_ SV *sv, STRLEN *lp)
5451 sv_utf8_upgrade(sv);
5452 return sv_pvn(sv,lp);
5456 =for apidoc sv_pvutf8n_force
5458 Get a sensible UTF8-encoded string out of the SV somehow. See
5465 Perl_sv_pvutf8n_force(pTHX_ SV *sv, STRLEN *lp)
5467 sv_utf8_upgrade(sv);
5468 return sv_pvn_force(sv,lp);
5472 =for apidoc sv_reftype
5474 Returns a string describing what the SV is a reference to.
5480 Perl_sv_reftype(pTHX_ SV *sv, int ob)
5482 if (ob && SvOBJECT(sv))
5483 return HvNAME(SvSTASH(sv));
5485 switch (SvTYPE(sv)) {
5499 case SVt_PVLV: return "LVALUE";
5500 case SVt_PVAV: return "ARRAY";
5501 case SVt_PVHV: return "HASH";
5502 case SVt_PVCV: return "CODE";
5503 case SVt_PVGV: return "GLOB";
5504 case SVt_PVFM: return "FORMAT";
5505 case SVt_PVIO: return "IO";
5506 default: return "UNKNOWN";
5512 =for apidoc sv_isobject
5514 Returns a boolean indicating whether the SV is an RV pointing to a blessed
5515 object. If the SV is not an RV, or if the object is not blessed, then this
5522 Perl_sv_isobject(pTHX_ SV *sv)
5539 Returns a boolean indicating whether the SV is blessed into the specified
5540 class. This does not check for subtypes; use C<sv_derived_from> to verify
5541 an inheritance relationship.
5547 Perl_sv_isa(pTHX_ SV *sv, const char *name)
5559 return strEQ(HvNAME(SvSTASH(sv)), name);
5565 Creates a new SV for the RV, C<rv>, to point to. If C<rv> is not an RV then
5566 it will be upgraded to one. If C<classname> is non-null then the new SV will
5567 be blessed in the specified package. The new SV is returned and its
5568 reference count is 1.
5574 Perl_newSVrv(pTHX_ SV *rv, const char *classname)
5581 SV_CHECK_THINKFIRST(rv);
5584 if (SvTYPE(rv) >= SVt_PVMG) {
5585 U32 refcnt = SvREFCNT(rv);
5589 SvREFCNT(rv) = refcnt;
5592 if (SvTYPE(rv) < SVt_RV)
5593 sv_upgrade(rv, SVt_RV);
5594 else if (SvTYPE(rv) > SVt_RV) {
5595 (void)SvOOK_off(rv);
5596 if (SvPVX(rv) && SvLEN(rv))
5597 Safefree(SvPVX(rv));
5607 HV* stash = gv_stashpv(classname, TRUE);
5608 (void)sv_bless(rv, stash);
5614 =for apidoc sv_setref_pv
5616 Copies a pointer into a new SV, optionally blessing the SV. The C<rv>
5617 argument will be upgraded to an RV. That RV will be modified to point to
5618 the new SV. If the C<pv> argument is NULL then C<PL_sv_undef> will be placed
5619 into the SV. The C<classname> argument indicates the package for the
5620 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
5621 will be returned and will have a reference count of 1.
5623 Do not use with other Perl types such as HV, AV, SV, CV, because those
5624 objects will become corrupted by the pointer copy process.
5626 Note that C<sv_setref_pvn> copies the string while this copies the pointer.
5632 Perl_sv_setref_pv(pTHX_ SV *rv, const char *classname, void *pv)
5635 sv_setsv(rv, &PL_sv_undef);
5639 sv_setiv(newSVrv(rv,classname), PTR2IV(pv));
5644 =for apidoc sv_setref_iv
5646 Copies an integer into a new SV, optionally blessing the SV. The C<rv>
5647 argument will be upgraded to an RV. That RV will be modified to point to
5648 the new SV. The C<classname> argument indicates the package for the
5649 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
5650 will be returned and will have a reference count of 1.
5656 Perl_sv_setref_iv(pTHX_ SV *rv, const char *classname, IV iv)
5658 sv_setiv(newSVrv(rv,classname), iv);
5663 =for apidoc sv_setref_nv
5665 Copies a double into a new SV, optionally blessing the SV. The C<rv>
5666 argument will be upgraded to an RV. That RV will be modified to point to
5667 the new SV. The C<classname> argument indicates the package for the
5668 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
5669 will be returned and will have a reference count of 1.
5675 Perl_sv_setref_nv(pTHX_ SV *rv, const char *classname, NV nv)
5677 sv_setnv(newSVrv(rv,classname), nv);
5682 =for apidoc sv_setref_pvn
5684 Copies a string into a new SV, optionally blessing the SV. The length of the
5685 string must be specified with C<n>. The C<rv> argument will be upgraded to
5686 an RV. That RV will be modified to point to the new SV. The C<classname>
5687 argument indicates the package for the blessing. Set C<classname> to
5688 C<Nullch> to avoid the blessing. The new SV will be returned and will have
5689 a reference count of 1.
5691 Note that C<sv_setref_pv> copies the pointer while this copies the string.
5697 Perl_sv_setref_pvn(pTHX_ SV *rv, const char *classname, char *pv, STRLEN n)
5699 sv_setpvn(newSVrv(rv,classname), pv, n);
5704 =for apidoc sv_bless
5706 Blesses an SV into a specified package. The SV must be an RV. The package
5707 must be designated by its stash (see C<gv_stashpv()>). The reference count
5708 of the SV is unaffected.
5714 Perl_sv_bless(pTHX_ SV *sv, HV *stash)
5719 Perl_croak(aTHX_ "Can't bless non-reference value");
5721 if (SvFLAGS(tmpRef) & (SVs_OBJECT|SVf_READONLY)) {
5722 if (SvREADONLY(tmpRef))
5723 Perl_croak(aTHX_ PL_no_modify);
5724 if (SvOBJECT(tmpRef)) {
5725 if (SvTYPE(tmpRef) != SVt_PVIO)
5727 SvREFCNT_dec(SvSTASH(tmpRef));
5730 SvOBJECT_on(tmpRef);
5731 if (SvTYPE(tmpRef) != SVt_PVIO)
5733 (void)SvUPGRADE(tmpRef, SVt_PVMG);
5734 SvSTASH(tmpRef) = (HV*)SvREFCNT_inc(stash);
5745 S_sv_unglob(pTHX_ SV *sv)
5749 assert(SvTYPE(sv) == SVt_PVGV);
5754 SvREFCNT_dec(GvSTASH(sv));
5755 GvSTASH(sv) = Nullhv;
5757 sv_unmagic(sv, '*');
5758 Safefree(GvNAME(sv));
5761 /* need to keep SvANY(sv) in the right arena */
5762 xpvmg = new_XPVMG();
5763 StructCopy(SvANY(sv), xpvmg, XPVMG);
5764 del_XPVGV(SvANY(sv));
5767 SvFLAGS(sv) &= ~SVTYPEMASK;
5768 SvFLAGS(sv) |= SVt_PVMG;
5772 =for apidoc sv_unref
5774 Unsets the RV status of the SV, and decrements the reference count of
5775 whatever was being referenced by the RV. This can almost be thought of
5776 as a reversal of C<newSVrv>. See C<SvROK_off>.
5782 Perl_sv_unref(pTHX_ SV *sv)
5786 if (SvWEAKREF(sv)) {
5794 if (SvREFCNT(rv) != 1 || SvREADONLY(rv))
5797 sv_2mortal(rv); /* Schedule for freeing later */
5801 Perl_sv_taint(pTHX_ SV *sv)
5803 sv_magic((sv), Nullsv, 't', Nullch, 0);
5807 Perl_sv_untaint(pTHX_ SV *sv)
5809 if (SvTYPE(sv) >= SVt_PVMG && SvMAGIC(sv)) {
5810 MAGIC *mg = mg_find(sv, 't');
5817 Perl_sv_tainted(pTHX_ SV *sv)
5819 if (SvTYPE(sv) >= SVt_PVMG && SvMAGIC(sv)) {
5820 MAGIC *mg = mg_find(sv, 't');
5821 if (mg && ((mg->mg_len & 1) || ((mg->mg_len & 2) && mg->mg_obj == sv)))
5828 =for apidoc sv_setpviv
5830 Copies an integer into the given SV, also updating its string value.
5831 Does not handle 'set' magic. See C<sv_setpviv_mg>.
5837 Perl_sv_setpviv(pTHX_ SV *sv, IV iv)
5839 char buf[TYPE_CHARS(UV)];
5841 char *ptr = uiv_2buf(buf, iv, 0, 0, &ebuf);
5843 sv_setpvn(sv, ptr, ebuf - ptr);
5848 =for apidoc sv_setpviv_mg
5850 Like C<sv_setpviv>, but also handles 'set' magic.
5856 Perl_sv_setpviv_mg(pTHX_ SV *sv, IV iv)
5858 char buf[TYPE_CHARS(UV)];
5860 char *ptr = uiv_2buf(buf, iv, 0, 0, &ebuf);
5862 sv_setpvn(sv, ptr, ebuf - ptr);
5866 #if defined(PERL_IMPLICIT_CONTEXT)
5868 Perl_sv_setpvf_nocontext(SV *sv, const char* pat, ...)
5872 va_start(args, pat);
5873 sv_vsetpvf(sv, pat, &args);
5879 Perl_sv_setpvf_mg_nocontext(SV *sv, const char* pat, ...)
5883 va_start(args, pat);
5884 sv_vsetpvf_mg(sv, pat, &args);
5890 =for apidoc sv_setpvf
5892 Processes its arguments like C<sprintf> and sets an SV to the formatted
5893 output. Does not handle 'set' magic. See C<sv_setpvf_mg>.
5899 Perl_sv_setpvf(pTHX_ SV *sv, const char* pat, ...)
5902 va_start(args, pat);
5903 sv_vsetpvf(sv, pat, &args);
5908 Perl_sv_vsetpvf(pTHX_ SV *sv, const char* pat, va_list* args)
5910 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
5914 =for apidoc sv_setpvf_mg
5916 Like C<sv_setpvf>, but also handles 'set' magic.
5922 Perl_sv_setpvf_mg(pTHX_ SV *sv, const char* pat, ...)
5925 va_start(args, pat);
5926 sv_vsetpvf_mg(sv, pat, &args);
5931 Perl_sv_vsetpvf_mg(pTHX_ SV *sv, const char* pat, va_list* args)
5933 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
5937 #if defined(PERL_IMPLICIT_CONTEXT)
5939 Perl_sv_catpvf_nocontext(SV *sv, const char* pat, ...)
5943 va_start(args, pat);
5944 sv_vcatpvf(sv, pat, &args);
5949 Perl_sv_catpvf_mg_nocontext(SV *sv, const char* pat, ...)
5953 va_start(args, pat);
5954 sv_vcatpvf_mg(sv, pat, &args);
5960 =for apidoc sv_catpvf
5962 Processes its arguments like C<sprintf> and appends the formatted output
5963 to an SV. Handles 'get' magic, but not 'set' magic. C<SvSETMAGIC()> must
5964 typically be called after calling this function to handle 'set' magic.
5970 Perl_sv_catpvf(pTHX_ SV *sv, const char* pat, ...)
5973 va_start(args, pat);
5974 sv_vcatpvf(sv, pat, &args);
5979 Perl_sv_vcatpvf(pTHX_ SV *sv, const char* pat, va_list* args)
5981 sv_vcatpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
5985 =for apidoc sv_catpvf_mg
5987 Like C<sv_catpvf>, but also handles 'set' magic.
5993 Perl_sv_catpvf_mg(pTHX_ SV *sv, const char* pat, ...)
5996 va_start(args, pat);
5997 sv_vcatpvf_mg(sv, pat, &args);
6002 Perl_sv_vcatpvf_mg(pTHX_ SV *sv, const char* pat, va_list* args)
6004 sv_vcatpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
6009 =for apidoc sv_vsetpvfn
6011 Works like C<vcatpvfn> but copies the text into the SV instead of
6018 Perl_sv_vsetpvfn(pTHX_ SV *sv, const char *pat, STRLEN patlen, va_list *args, SV **svargs, I32 svmax, bool *maybe_tainted)
6020 sv_setpvn(sv, "", 0);
6021 sv_vcatpvfn(sv, pat, patlen, args, svargs, svmax, maybe_tainted);
6025 =for apidoc sv_vcatpvfn
6027 Processes its arguments like C<vsprintf> and appends the formatted output
6028 to an SV. Uses an array of SVs if the C style variable argument list is
6029 missing (NULL). When running with taint checks enabled, indicates via
6030 C<maybe_tainted> if results are untrustworthy (often due to the use of
6037 Perl_sv_vcatpvfn(pTHX_ SV *sv, const char *pat, STRLEN patlen, va_list *args, SV **svargs, I32 svmax, bool *maybe_tainted)
6045 static char nullstr[] = "(null)";
6048 /* no matter what, this is a string now */
6049 (void)SvPV_force(sv, origlen);
6051 /* special-case "", "%s", and "%_" */
6054 if (patlen == 2 && pat[0] == '%') {
6058 char *s = va_arg(*args, char*);
6059 sv_catpv(sv, s ? s : nullstr);
6061 else if (svix < svmax) {
6062 sv_catsv(sv, *svargs);
6063 if (DO_UTF8(*svargs))
6069 argsv = va_arg(*args, SV*);
6070 sv_catsv(sv, argsv);
6075 /* See comment on '_' below */
6080 patend = (char*)pat + patlen;
6081 for (p = (char*)pat; p < patend; p = q) {
6084 bool vectorize = FALSE;
6091 bool has_precis = FALSE;
6093 bool is_utf = FALSE;
6096 U8 utf8buf[UTF8_MAXLEN];
6097 STRLEN esignlen = 0;
6099 char *eptr = Nullch;
6101 /* Times 4: a decimal digit takes more than 3 binary digits.
6102 * NV_DIG: mantissa takes than many decimal digits.
6103 * Plus 32: Playing safe. */
6104 char ebuf[IV_DIG * 4 + NV_DIG + 32];
6105 /* large enough for "%#.#f" --chip */
6106 /* what about long double NVs? --jhi */
6109 U8 *vecstr = Null(U8*);
6121 STRLEN dotstrlen = 1;
6123 for (q = p; q < patend && *q != '%'; ++q) ;
6125 sv_catpvn(sv, p, q - p);
6154 case '*': /* printf("%*vX",":",$ipv6addr) */
6159 vecsv = va_arg(*args, SV*);
6160 else if (svix < svmax)
6161 vecsv = svargs[svix++];
6164 dotstr = SvPVx(vecsv,dotstrlen);
6183 case '1': case '2': case '3':
6184 case '4': case '5': case '6':
6185 case '7': case '8': case '9':
6188 width = width * 10 + (*q++ - '0');
6193 i = va_arg(*args, int);
6195 i = (svix < svmax) ? SvIVx(svargs[svix++]) : 0;
6197 width = (i < 0) ? -i : i;
6208 i = va_arg(*args, int);
6210 i = (svix < svmax) ? SvIVx(svargs[svix++]) : 0;
6211 precis = (i < 0) ? 0 : i;
6217 precis = precis * 10 + (*q++ - '0');
6224 vecsv = va_arg(*args, SV*);
6225 vecstr = (U8*)SvPVx(vecsv,veclen);
6226 utf = DO_UTF8(vecsv);
6228 else if (svix < svmax) {
6229 vecsv = svargs[svix++];
6230 vecstr = (U8*)SvPVx(vecsv,veclen);
6231 utf = DO_UTF8(vecsv);
6242 #if defined(HAS_QUAD) || (defined(HAS_LONG_DOUBLE) && defined(USE_LONG_DOUBLE))
6253 #if defined(HAS_QUAD) || (defined(HAS_LONG_DOUBLE) && defined(USE_LONG_DOUBLE))
6254 if (*(q + 1) == 'l') { /* lld, llf */
6281 uv = va_arg(*args, int);
6283 uv = (svix < svmax) ? SvIVx(svargs[svix++]) : 0;
6284 if ((uv > 255 || (uv > 127 && SvUTF8(sv))) && !IN_BYTE) {
6285 eptr = (char*)utf8buf;
6286 elen = uv_to_utf8((U8*)eptr, uv) - utf8buf;
6298 eptr = va_arg(*args, char*);
6300 #ifdef MACOS_TRADITIONAL
6301 /* On MacOS, %#s format is used for Pascal strings */
6306 elen = strlen(eptr);
6309 elen = sizeof nullstr - 1;
6312 else if (svix < svmax) {
6313 argsv = svargs[svix++];
6314 eptr = SvPVx(argsv, elen);
6315 if (DO_UTF8(argsv)) {
6316 if (has_precis && precis < elen) {
6318 sv_pos_u2b(argsv, &p, 0); /* sticks at end */
6321 if (width) { /* fudge width (can't fudge elen) */
6322 width += elen - sv_len_utf8(argsv);
6331 * The "%_" hack might have to be changed someday,
6332 * if ISO or ANSI decide to use '_' for something.
6333 * So we keep it hidden from users' code.
6337 argsv = va_arg(*args,SV*);
6338 eptr = SvPVx(argsv, elen);
6344 if (has_precis && elen > precis)
6354 uv = PTR2UV(va_arg(*args, void*));
6356 uv = (svix < svmax) ? PTR2UV(svargs[svix++]) : 0;
6376 iv = (IV)utf8_to_uv(vecstr, &ulen);
6386 case 'h': iv = (short)va_arg(*args, int); break;
6387 default: iv = va_arg(*args, int); break;
6388 case 'l': iv = va_arg(*args, long); break;
6389 case 'V': iv = va_arg(*args, IV); break;
6391 case 'q': iv = va_arg(*args, Quad_t); break;
6396 iv = (svix < svmax) ? SvIVx(svargs[svix++]) : 0;
6398 case 'h': iv = (short)iv; break;
6400 case 'l': iv = (long)iv; break;
6403 case 'q': iv = (Quad_t)iv; break;
6410 esignbuf[esignlen++] = plus;
6414 esignbuf[esignlen++] = '-';
6458 uv = utf8_to_uv(vecstr, &ulen);
6468 case 'h': uv = (unsigned short)va_arg(*args, unsigned); break;
6469 default: uv = va_arg(*args, unsigned); break;
6470 case 'l': uv = va_arg(*args, unsigned long); break;
6471 case 'V': uv = va_arg(*args, UV); break;
6473 case 'q': uv = va_arg(*args, Quad_t); break;
6478 uv = (svix < svmax) ? SvUVx(svargs[svix++]) : 0;
6480 case 'h': uv = (unsigned short)uv; break;
6482 case 'l': uv = (unsigned long)uv; break;
6485 case 'q': uv = (Quad_t)uv; break;
6491 eptr = ebuf + sizeof ebuf;
6497 p = (char*)((c == 'X')
6498 ? "0123456789ABCDEF" : "0123456789abcdef");
6504 esignbuf[esignlen++] = '0';
6505 esignbuf[esignlen++] = c; /* 'x' or 'X' */
6511 *--eptr = '0' + dig;
6513 if (alt && *eptr != '0')
6519 *--eptr = '0' + dig;
6522 esignbuf[esignlen++] = '0';
6523 esignbuf[esignlen++] = 'b';
6526 default: /* it had better be ten or less */
6527 #if defined(PERL_Y2KWARN)
6528 if (ckWARN(WARN_Y2K)) {
6530 char *s = SvPV(sv,n);
6531 if (n >= 2 && s[n-2] == '1' && s[n-1] == '9'
6532 && (n == 2 || !isDIGIT(s[n-3])))
6534 Perl_warner(aTHX_ WARN_Y2K,
6535 "Possible Y2K bug: %%%c %s",
6536 c, "format string following '19'");
6542 *--eptr = '0' + dig;
6543 } while (uv /= base);
6546 elen = (ebuf + sizeof ebuf) - eptr;
6549 zeros = precis - elen;
6550 else if (precis == 0 && elen == 1 && *eptr == '0')
6555 /* FLOATING POINT */
6558 c = 'f'; /* maybe %F isn't supported here */
6564 /* This is evil, but floating point is even more evil */
6568 nv = va_arg(*args, NV);
6570 nv = (svix < svmax) ? SvNVx(svargs[svix++]) : 0.0;
6573 if (c != 'e' && c != 'E') {
6575 (void)Perl_frexp(nv, &i);
6576 if (i == PERL_INT_MIN)
6577 Perl_die(aTHX_ "panic: frexp");
6579 need = BIT_DIGITS(i);
6581 need += has_precis ? precis : 6; /* known default */
6585 need += 20; /* fudge factor */
6586 if (PL_efloatsize < need) {
6587 Safefree(PL_efloatbuf);
6588 PL_efloatsize = need + 20; /* more fudge */
6589 New(906, PL_efloatbuf, PL_efloatsize, char);
6590 PL_efloatbuf[0] = '\0';
6593 eptr = ebuf + sizeof ebuf;
6596 #if defined(USE_LONG_DOUBLE) && defined(PERL_PRIfldbl)
6598 /* Copy the one or more characters in a long double
6599 * format before the 'base' ([efgEFG]) character to
6600 * the format string. */
6601 static char const prifldbl[] = PERL_PRIfldbl;
6602 char const *p = prifldbl + sizeof(prifldbl) - 3;
6603 while (p >= prifldbl) { *--eptr = *p--; }
6608 do { *--eptr = '0' + (base % 10); } while (base /= 10);
6613 do { *--eptr = '0' + (base % 10); } while (base /= 10);
6626 STORE_NUMERIC_STANDARD_SET_LOCAL();
6627 #ifdef USE_LOCALE_NUMERIC
6628 if (!was_standard && maybe_tainted)
6629 *maybe_tainted = TRUE;
6631 (void)sprintf(PL_efloatbuf, eptr, nv);
6632 RESTORE_NUMERIC_STANDARD();
6635 eptr = PL_efloatbuf;
6636 elen = strlen(PL_efloatbuf);
6643 i = SvCUR(sv) - origlen;
6646 case 'h': *(va_arg(*args, short*)) = i; break;
6647 default: *(va_arg(*args, int*)) = i; break;
6648 case 'l': *(va_arg(*args, long*)) = i; break;
6649 case 'V': *(va_arg(*args, IV*)) = i; break;
6651 case 'q': *(va_arg(*args, Quad_t*)) = i; break;
6655 else if (svix < svmax)
6656 sv_setuv_mg(svargs[svix++], (UV)i);
6657 continue; /* not "break" */
6664 if (!args && ckWARN(WARN_PRINTF) &&
6665 (PL_op->op_type == OP_PRTF || PL_op->op_type == OP_SPRINTF)) {
6666 SV *msg = sv_newmortal();
6667 Perl_sv_setpvf(aTHX_ msg, "Invalid conversion in %s: ",
6668 (PL_op->op_type == OP_PRTF) ? "printf" : "sprintf");
6671 Perl_sv_catpvf(aTHX_ msg,
6672 "\"%%%c\"", c & 0xFF);
6674 Perl_sv_catpvf(aTHX_ msg,
6675 "\"%%\\%03"UVof"\"",
6678 sv_catpv(msg, "end of string");
6679 Perl_warner(aTHX_ WARN_PRINTF, "%"SVf, msg); /* yes, this is reentrant */
6682 /* output mangled stuff ... */
6688 /* ... right here, because formatting flags should not apply */
6689 SvGROW(sv, SvCUR(sv) + elen + 1);
6691 memcpy(p, eptr, elen);
6694 SvCUR(sv) = p - SvPVX(sv);
6695 continue; /* not "break" */
6698 have = esignlen + zeros + elen;
6699 need = (have > width ? have : width);
6702 SvGROW(sv, SvCUR(sv) + need + dotstrlen + 1);
6704 if (esignlen && fill == '0') {
6705 for (i = 0; i < esignlen; i++)
6709 memset(p, fill, gap);
6712 if (esignlen && fill != '0') {
6713 for (i = 0; i < esignlen; i++)
6717 for (i = zeros; i; i--)
6721 memcpy(p, eptr, elen);
6725 memset(p, ' ', gap);
6730 memcpy(p, dotstr, dotstrlen);
6734 vectorize = FALSE; /* done iterating over vecstr */
6739 SvCUR(sv) = p - SvPVX(sv);
6747 #if defined(USE_ITHREADS)
6749 #if defined(USE_THREADS)
6750 # include "error: USE_THREADS and USE_ITHREADS are incompatible"
6753 #ifndef GpREFCNT_inc
6754 # define GpREFCNT_inc(gp) ((gp) ? (++(gp)->gp_refcnt, (gp)) : (GP*)NULL)
6758 #define sv_dup_inc(s) SvREFCNT_inc(sv_dup(s))
6759 #define av_dup(s) (AV*)sv_dup((SV*)s)
6760 #define av_dup_inc(s) (AV*)SvREFCNT_inc(sv_dup((SV*)s))
6761 #define hv_dup(s) (HV*)sv_dup((SV*)s)
6762 #define hv_dup_inc(s) (HV*)SvREFCNT_inc(sv_dup((SV*)s))
6763 #define cv_dup(s) (CV*)sv_dup((SV*)s)
6764 #define cv_dup_inc(s) (CV*)SvREFCNT_inc(sv_dup((SV*)s))
6765 #define io_dup(s) (IO*)sv_dup((SV*)s)
6766 #define io_dup_inc(s) (IO*)SvREFCNT_inc(sv_dup((SV*)s))
6767 #define gv_dup(s) (GV*)sv_dup((SV*)s)
6768 #define gv_dup_inc(s) (GV*)SvREFCNT_inc(sv_dup((SV*)s))
6769 #define SAVEPV(p) (p ? savepv(p) : Nullch)
6770 #define SAVEPVN(p,n) (p ? savepvn(p,n) : Nullch)
6773 Perl_re_dup(pTHX_ REGEXP *r)
6775 /* XXX fix when pmop->op_pmregexp becomes shared */
6776 return ReREFCNT_inc(r);
6780 Perl_fp_dup(pTHX_ PerlIO *fp, char type)
6784 return (PerlIO*)NULL;
6786 /* look for it in the table first */
6787 ret = (PerlIO*)ptr_table_fetch(PL_ptr_table, fp);
6791 /* create anew and remember what it is */
6792 ret = PerlIO_fdupopen(fp);
6793 ptr_table_store(PL_ptr_table, fp, ret);
6798 Perl_dirp_dup(pTHX_ DIR *dp)
6807 Perl_gp_dup(pTHX_ GP *gp)
6812 /* look for it in the table first */
6813 ret = (GP*)ptr_table_fetch(PL_ptr_table, gp);
6817 /* create anew and remember what it is */
6818 Newz(0, ret, 1, GP);
6819 ptr_table_store(PL_ptr_table, gp, ret);
6822 ret->gp_refcnt = 0; /* must be before any other dups! */
6823 ret->gp_sv = sv_dup_inc(gp->gp_sv);
6824 ret->gp_io = io_dup_inc(gp->gp_io);
6825 ret->gp_form = cv_dup_inc(gp->gp_form);
6826 ret->gp_av = av_dup_inc(gp->gp_av);
6827 ret->gp_hv = hv_dup_inc(gp->gp_hv);
6828 ret->gp_egv = gv_dup(gp->gp_egv); /* GvEGV is not refcounted */
6829 ret->gp_cv = cv_dup_inc(gp->gp_cv);
6830 ret->gp_cvgen = gp->gp_cvgen;
6831 ret->gp_flags = gp->gp_flags;
6832 ret->gp_line = gp->gp_line;
6833 ret->gp_file = gp->gp_file; /* points to COP.cop_file */
6838 Perl_mg_dup(pTHX_ MAGIC *mg)
6840 MAGIC *mgret = (MAGIC*)NULL;
6843 return (MAGIC*)NULL;
6844 /* look for it in the table first */
6845 mgret = (MAGIC*)ptr_table_fetch(PL_ptr_table, mg);
6849 for (; mg; mg = mg->mg_moremagic) {
6851 Newz(0, nmg, 1, MAGIC);
6855 mgprev->mg_moremagic = nmg;
6856 nmg->mg_virtual = mg->mg_virtual; /* XXX copy dynamic vtable? */
6857 nmg->mg_private = mg->mg_private;
6858 nmg->mg_type = mg->mg_type;
6859 nmg->mg_flags = mg->mg_flags;
6860 if (mg->mg_type == 'r') {
6861 nmg->mg_obj = (SV*)re_dup((REGEXP*)mg->mg_obj);
6864 nmg->mg_obj = (mg->mg_flags & MGf_REFCOUNTED)
6865 ? sv_dup_inc(mg->mg_obj)
6866 : sv_dup(mg->mg_obj);
6868 nmg->mg_len = mg->mg_len;
6869 nmg->mg_ptr = mg->mg_ptr; /* XXX random ptr? */
6870 if (mg->mg_ptr && mg->mg_type != 'g') {
6871 if (mg->mg_len >= 0) {
6872 nmg->mg_ptr = SAVEPVN(mg->mg_ptr, mg->mg_len);
6873 if (mg->mg_type == 'c' && AMT_AMAGIC((AMT*)mg->mg_ptr)) {
6874 AMT *amtp = (AMT*)mg->mg_ptr;
6875 AMT *namtp = (AMT*)nmg->mg_ptr;
6877 for (i = 1; i < NofAMmeth; i++) {
6878 namtp->table[i] = cv_dup_inc(amtp->table[i]);
6882 else if (mg->mg_len == HEf_SVKEY)
6883 nmg->mg_ptr = (char*)sv_dup_inc((SV*)mg->mg_ptr);
6891 Perl_ptr_table_new(pTHX)
6894 Newz(0, tbl, 1, PTR_TBL_t);
6897 Newz(0, tbl->tbl_ary, tbl->tbl_max + 1, PTR_TBL_ENT_t*);
6902 Perl_ptr_table_fetch(pTHX_ PTR_TBL_t *tbl, void *sv)
6904 PTR_TBL_ENT_t *tblent;
6905 UV hash = PTR2UV(sv);
6907 tblent = tbl->tbl_ary[hash & tbl->tbl_max];
6908 for (; tblent; tblent = tblent->next) {
6909 if (tblent->oldval == sv)
6910 return tblent->newval;
6916 Perl_ptr_table_store(pTHX_ PTR_TBL_t *tbl, void *oldv, void *newv)
6918 PTR_TBL_ENT_t *tblent, **otblent;
6919 /* XXX this may be pessimal on platforms where pointers aren't good
6920 * hash values e.g. if they grow faster in the most significant
6922 UV hash = PTR2UV(oldv);
6926 otblent = &tbl->tbl_ary[hash & tbl->tbl_max];
6927 for (tblent = *otblent; tblent; i=0, tblent = tblent->next) {
6928 if (tblent->oldval == oldv) {
6929 tblent->newval = newv;
6934 Newz(0, tblent, 1, PTR_TBL_ENT_t);
6935 tblent->oldval = oldv;
6936 tblent->newval = newv;
6937 tblent->next = *otblent;
6940 if (i && tbl->tbl_items > tbl->tbl_max)
6941 ptr_table_split(tbl);
6945 Perl_ptr_table_split(pTHX_ PTR_TBL_t *tbl)
6947 PTR_TBL_ENT_t **ary = tbl->tbl_ary;
6948 UV oldsize = tbl->tbl_max + 1;
6949 UV newsize = oldsize * 2;
6952 Renew(ary, newsize, PTR_TBL_ENT_t*);
6953 Zero(&ary[oldsize], newsize-oldsize, PTR_TBL_ENT_t*);
6954 tbl->tbl_max = --newsize;
6956 for (i=0; i < oldsize; i++, ary++) {
6957 PTR_TBL_ENT_t **curentp, **entp, *ent;
6960 curentp = ary + oldsize;
6961 for (entp = ary, ent = *ary; ent; ent = *entp) {
6962 if ((newsize & PTR2UV(ent->oldval)) != i) {
6964 ent->next = *curentp;
6979 Perl_sv_dup(pTHX_ SV *sstr)
6983 if (!sstr || SvTYPE(sstr) == SVTYPEMASK)
6985 /* look for it in the table first */
6986 dstr = (SV*)ptr_table_fetch(PL_ptr_table, sstr);
6990 /* create anew and remember what it is */
6992 ptr_table_store(PL_ptr_table, sstr, dstr);
6995 SvFLAGS(dstr) = SvFLAGS(sstr);
6996 SvFLAGS(dstr) &= ~SVf_OOK; /* don't propagate OOK hack */
6997 SvREFCNT(dstr) = 0; /* must be before any other dups! */
7000 if (SvANY(sstr) && PL_watch_pvx && SvPVX(sstr) == PL_watch_pvx)
7001 PerlIO_printf(Perl_debug_log, "watch at %p hit, found string \"%s\"\n",
7002 PL_watch_pvx, SvPVX(sstr));
7005 switch (SvTYPE(sstr)) {
7010 SvANY(dstr) = new_XIV();
7011 SvIVX(dstr) = SvIVX(sstr);
7014 SvANY(dstr) = new_XNV();
7015 SvNVX(dstr) = SvNVX(sstr);
7018 SvANY(dstr) = new_XRV();
7019 SvRV(dstr) = sv_dup_inc(SvRV(sstr));
7022 SvANY(dstr) = new_XPV();
7023 SvCUR(dstr) = SvCUR(sstr);
7024 SvLEN(dstr) = SvLEN(sstr);
7026 SvRV(dstr) = sv_dup_inc(SvRV(sstr));
7027 else if (SvPVX(sstr) && SvLEN(sstr))
7028 SvPVX(dstr) = SAVEPVN(SvPVX(sstr), SvLEN(sstr)-1);
7030 SvPVX(dstr) = SvPVX(sstr); /* XXX shared string/random ptr? */
7033 SvANY(dstr) = new_XPVIV();
7034 SvCUR(dstr) = SvCUR(sstr);
7035 SvLEN(dstr) = SvLEN(sstr);
7036 SvIVX(dstr) = SvIVX(sstr);
7038 SvRV(dstr) = sv_dup_inc(SvRV(sstr));
7039 else if (SvPVX(sstr) && SvLEN(sstr))
7040 SvPVX(dstr) = SAVEPVN(SvPVX(sstr), SvLEN(sstr)-1);
7042 SvPVX(dstr) = SvPVX(sstr); /* XXX shared string/random ptr? */
7045 SvANY(dstr) = new_XPVNV();
7046 SvCUR(dstr) = SvCUR(sstr);
7047 SvLEN(dstr) = SvLEN(sstr);
7048 SvIVX(dstr) = SvIVX(sstr);
7049 SvNVX(dstr) = SvNVX(sstr);
7051 SvRV(dstr) = sv_dup_inc(SvRV(sstr));
7052 else if (SvPVX(sstr) && SvLEN(sstr))
7053 SvPVX(dstr) = SAVEPVN(SvPVX(sstr), SvLEN(sstr)-1);
7055 SvPVX(dstr) = SvPVX(sstr); /* XXX shared string/random ptr? */
7058 SvANY(dstr) = new_XPVMG();
7059 SvCUR(dstr) = SvCUR(sstr);
7060 SvLEN(dstr) = SvLEN(sstr);
7061 SvIVX(dstr) = SvIVX(sstr);
7062 SvNVX(dstr) = SvNVX(sstr);
7063 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr));
7064 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr));
7066 SvRV(dstr) = sv_dup_inc(SvRV(sstr));
7067 else if (SvPVX(sstr) && SvLEN(sstr))
7068 SvPVX(dstr) = SAVEPVN(SvPVX(sstr), SvLEN(sstr)-1);
7070 SvPVX(dstr) = SvPVX(sstr); /* XXX shared string/random ptr? */
7073 SvANY(dstr) = new_XPVBM();
7074 SvCUR(dstr) = SvCUR(sstr);
7075 SvLEN(dstr) = SvLEN(sstr);
7076 SvIVX(dstr) = SvIVX(sstr);
7077 SvNVX(dstr) = SvNVX(sstr);
7078 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr));
7079 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr));
7081 SvRV(dstr) = sv_dup_inc(SvRV(sstr));
7082 else if (SvPVX(sstr) && SvLEN(sstr))
7083 SvPVX(dstr) = SAVEPVN(SvPVX(sstr), SvLEN(sstr)-1);
7085 SvPVX(dstr) = SvPVX(sstr); /* XXX shared string/random ptr? */
7086 BmRARE(dstr) = BmRARE(sstr);
7087 BmUSEFUL(dstr) = BmUSEFUL(sstr);
7088 BmPREVIOUS(dstr)= BmPREVIOUS(sstr);
7091 SvANY(dstr) = new_XPVLV();
7092 SvCUR(dstr) = SvCUR(sstr);
7093 SvLEN(dstr) = SvLEN(sstr);
7094 SvIVX(dstr) = SvIVX(sstr);
7095 SvNVX(dstr) = SvNVX(sstr);
7096 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr));
7097 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr));
7099 SvRV(dstr) = sv_dup_inc(SvRV(sstr));
7100 else if (SvPVX(sstr) && SvLEN(sstr))
7101 SvPVX(dstr) = SAVEPVN(SvPVX(sstr), SvLEN(sstr)-1);
7103 SvPVX(dstr) = SvPVX(sstr); /* XXX shared string/random ptr? */
7104 LvTARGOFF(dstr) = LvTARGOFF(sstr); /* XXX sometimes holds PMOP* when DEBUGGING */
7105 LvTARGLEN(dstr) = LvTARGLEN(sstr);
7106 LvTARG(dstr) = sv_dup_inc(LvTARG(sstr));
7107 LvTYPE(dstr) = LvTYPE(sstr);
7110 SvANY(dstr) = new_XPVGV();
7111 SvCUR(dstr) = SvCUR(sstr);
7112 SvLEN(dstr) = SvLEN(sstr);
7113 SvIVX(dstr) = SvIVX(sstr);
7114 SvNVX(dstr) = SvNVX(sstr);
7115 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr));
7116 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr));
7118 SvRV(dstr) = sv_dup_inc(SvRV(sstr));
7119 else if (SvPVX(sstr) && SvLEN(sstr))
7120 SvPVX(dstr) = SAVEPVN(SvPVX(sstr), SvLEN(sstr)-1);
7122 SvPVX(dstr) = SvPVX(sstr); /* XXX shared string/random ptr? */
7123 GvNAMELEN(dstr) = GvNAMELEN(sstr);
7124 GvNAME(dstr) = SAVEPVN(GvNAME(sstr), GvNAMELEN(sstr));
7125 GvSTASH(dstr) = hv_dup_inc(GvSTASH(sstr));
7126 GvFLAGS(dstr) = GvFLAGS(sstr);
7127 GvGP(dstr) = gp_dup(GvGP(sstr));
7128 (void)GpREFCNT_inc(GvGP(dstr));
7131 SvANY(dstr) = new_XPVIO();
7132 SvCUR(dstr) = SvCUR(sstr);
7133 SvLEN(dstr) = SvLEN(sstr);
7134 SvIVX(dstr) = SvIVX(sstr);
7135 SvNVX(dstr) = SvNVX(sstr);
7136 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr));
7137 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr));
7139 SvRV(dstr) = sv_dup_inc(SvRV(sstr));
7140 else if (SvPVX(sstr) && SvLEN(sstr))
7141 SvPVX(dstr) = SAVEPVN(SvPVX(sstr), SvLEN(sstr)-1);
7143 SvPVX(dstr) = SvPVX(sstr); /* XXX shared string/random ptr? */
7144 IoIFP(dstr) = fp_dup(IoIFP(sstr), IoTYPE(sstr));
7145 if (IoOFP(sstr) == IoIFP(sstr))
7146 IoOFP(dstr) = IoIFP(dstr);
7148 IoOFP(dstr) = fp_dup(IoOFP(sstr), IoTYPE(sstr));
7149 /* PL_rsfp_filters entries have fake IoDIRP() */
7150 if (IoDIRP(sstr) && !(IoFLAGS(sstr) & IOf_FAKE_DIRP))
7151 IoDIRP(dstr) = dirp_dup(IoDIRP(sstr));
7153 IoDIRP(dstr) = IoDIRP(sstr);
7154 IoLINES(dstr) = IoLINES(sstr);
7155 IoPAGE(dstr) = IoPAGE(sstr);
7156 IoPAGE_LEN(dstr) = IoPAGE_LEN(sstr);
7157 IoLINES_LEFT(dstr) = IoLINES_LEFT(sstr);
7158 IoTOP_NAME(dstr) = SAVEPV(IoTOP_NAME(sstr));
7159 IoTOP_GV(dstr) = gv_dup(IoTOP_GV(sstr));
7160 IoFMT_NAME(dstr) = SAVEPV(IoFMT_NAME(sstr));
7161 IoFMT_GV(dstr) = gv_dup(IoFMT_GV(sstr));
7162 IoBOTTOM_NAME(dstr) = SAVEPV(IoBOTTOM_NAME(sstr));
7163 IoBOTTOM_GV(dstr) = gv_dup(IoBOTTOM_GV(sstr));
7164 IoSUBPROCESS(dstr) = IoSUBPROCESS(sstr);
7165 IoTYPE(dstr) = IoTYPE(sstr);
7166 IoFLAGS(dstr) = IoFLAGS(sstr);
7169 SvANY(dstr) = new_XPVAV();
7170 SvCUR(dstr) = SvCUR(sstr);
7171 SvLEN(dstr) = SvLEN(sstr);
7172 SvIVX(dstr) = SvIVX(sstr);
7173 SvNVX(dstr) = SvNVX(sstr);
7174 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr));
7175 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr));
7176 AvARYLEN((AV*)dstr) = sv_dup_inc(AvARYLEN((AV*)sstr));
7177 AvFLAGS((AV*)dstr) = AvFLAGS((AV*)sstr);
7178 if (AvARRAY((AV*)sstr)) {
7179 SV **dst_ary, **src_ary;
7180 SSize_t items = AvFILLp((AV*)sstr) + 1;
7182 src_ary = AvARRAY((AV*)sstr);
7183 Newz(0, dst_ary, AvMAX((AV*)sstr)+1, SV*);
7184 ptr_table_store(PL_ptr_table, src_ary, dst_ary);
7185 SvPVX(dstr) = (char*)dst_ary;
7186 AvALLOC((AV*)dstr) = dst_ary;
7187 if (AvREAL((AV*)sstr)) {
7189 *dst_ary++ = sv_dup_inc(*src_ary++);
7193 *dst_ary++ = sv_dup(*src_ary++);
7195 items = AvMAX((AV*)sstr) - AvFILLp((AV*)sstr);
7196 while (items-- > 0) {
7197 *dst_ary++ = &PL_sv_undef;
7201 SvPVX(dstr) = Nullch;
7202 AvALLOC((AV*)dstr) = (SV**)NULL;
7206 SvANY(dstr) = new_XPVHV();
7207 SvCUR(dstr) = SvCUR(sstr);
7208 SvLEN(dstr) = SvLEN(sstr);
7209 SvIVX(dstr) = SvIVX(sstr);
7210 SvNVX(dstr) = SvNVX(sstr);
7211 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr));
7212 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr));
7213 HvRITER((HV*)dstr) = HvRITER((HV*)sstr);
7214 if (HvARRAY((HV*)sstr)) {
7216 XPVHV *dxhv = (XPVHV*)SvANY(dstr);
7217 XPVHV *sxhv = (XPVHV*)SvANY(sstr);
7218 Newz(0, dxhv->xhv_array,
7219 PERL_HV_ARRAY_ALLOC_BYTES(dxhv->xhv_max+1), char);
7220 while (i <= sxhv->xhv_max) {
7221 ((HE**)dxhv->xhv_array)[i] = he_dup(((HE**)sxhv->xhv_array)[i],
7222 !!HvSHAREKEYS(sstr));
7225 dxhv->xhv_eiter = he_dup(sxhv->xhv_eiter, !!HvSHAREKEYS(sstr));
7228 SvPVX(dstr) = Nullch;
7229 HvEITER((HV*)dstr) = (HE*)NULL;
7231 HvPMROOT((HV*)dstr) = HvPMROOT((HV*)sstr); /* XXX */
7232 HvNAME((HV*)dstr) = SAVEPV(HvNAME((HV*)sstr));
7235 SvANY(dstr) = new_XPVFM();
7236 FmLINES(dstr) = FmLINES(sstr);
7240 SvANY(dstr) = new_XPVCV();
7242 SvCUR(dstr) = SvCUR(sstr);
7243 SvLEN(dstr) = SvLEN(sstr);
7244 SvIVX(dstr) = SvIVX(sstr);
7245 SvNVX(dstr) = SvNVX(sstr);
7246 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr));
7247 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr));
7248 if (SvPVX(sstr) && SvLEN(sstr))
7249 SvPVX(dstr) = SAVEPVN(SvPVX(sstr), SvLEN(sstr)-1);
7251 SvPVX(dstr) = SvPVX(sstr); /* XXX shared string/random ptr? */
7252 CvSTASH(dstr) = hv_dup(CvSTASH(sstr));/* NOTE: not refcounted */
7253 CvSTART(dstr) = CvSTART(sstr);
7254 CvROOT(dstr) = OpREFCNT_inc(CvROOT(sstr));
7255 CvXSUB(dstr) = CvXSUB(sstr);
7256 CvXSUBANY(dstr) = CvXSUBANY(sstr);
7257 CvGV(dstr) = gv_dup_inc(CvGV(sstr));
7258 CvDEPTH(dstr) = CvDEPTH(sstr);
7259 if (CvPADLIST(sstr) && !AvREAL(CvPADLIST(sstr))) {
7260 /* XXX padlists are real, but pretend to be not */
7261 AvREAL_on(CvPADLIST(sstr));
7262 CvPADLIST(dstr) = av_dup_inc(CvPADLIST(sstr));
7263 AvREAL_off(CvPADLIST(sstr));
7264 AvREAL_off(CvPADLIST(dstr));
7267 CvPADLIST(dstr) = av_dup_inc(CvPADLIST(sstr));
7268 CvOUTSIDE(dstr) = cv_dup_inc(CvOUTSIDE(sstr));
7269 CvFLAGS(dstr) = CvFLAGS(sstr);
7272 Perl_croak(aTHX_ "Bizarre SvTYPE [%d]", SvTYPE(sstr));
7276 if (SvOBJECT(dstr) && SvTYPE(dstr) != SVt_PVIO)
7283 Perl_cx_dup(pTHX_ PERL_CONTEXT *cxs, I32 ix, I32 max)
7288 return (PERL_CONTEXT*)NULL;
7290 /* look for it in the table first */
7291 ncxs = (PERL_CONTEXT*)ptr_table_fetch(PL_ptr_table, cxs);
7295 /* create anew and remember what it is */
7296 Newz(56, ncxs, max + 1, PERL_CONTEXT);
7297 ptr_table_store(PL_ptr_table, cxs, ncxs);
7300 PERL_CONTEXT *cx = &cxs[ix];
7301 PERL_CONTEXT *ncx = &ncxs[ix];
7302 ncx->cx_type = cx->cx_type;
7303 if (CxTYPE(cx) == CXt_SUBST) {
7304 Perl_croak(aTHX_ "Cloning substitution context is unimplemented");
7307 ncx->blk_oldsp = cx->blk_oldsp;
7308 ncx->blk_oldcop = cx->blk_oldcop;
7309 ncx->blk_oldretsp = cx->blk_oldretsp;
7310 ncx->blk_oldmarksp = cx->blk_oldmarksp;
7311 ncx->blk_oldscopesp = cx->blk_oldscopesp;
7312 ncx->blk_oldpm = cx->blk_oldpm;
7313 ncx->blk_gimme = cx->blk_gimme;
7314 switch (CxTYPE(cx)) {
7316 ncx->blk_sub.cv = (cx->blk_sub.olddepth == 0
7317 ? cv_dup_inc(cx->blk_sub.cv)
7318 : cv_dup(cx->blk_sub.cv));
7319 ncx->blk_sub.argarray = (cx->blk_sub.hasargs
7320 ? av_dup_inc(cx->blk_sub.argarray)
7322 ncx->blk_sub.savearray = av_dup(cx->blk_sub.savearray);
7323 ncx->blk_sub.olddepth = cx->blk_sub.olddepth;
7324 ncx->blk_sub.hasargs = cx->blk_sub.hasargs;
7325 ncx->blk_sub.lval = cx->blk_sub.lval;
7328 ncx->blk_eval.old_in_eval = cx->blk_eval.old_in_eval;
7329 ncx->blk_eval.old_op_type = cx->blk_eval.old_op_type;
7330 ncx->blk_eval.old_namesv = sv_dup_inc(cx->blk_eval.old_namesv);
7331 ncx->blk_eval.old_eval_root = cx->blk_eval.old_eval_root;
7332 ncx->blk_eval.cur_text = sv_dup(cx->blk_eval.cur_text);
7335 ncx->blk_loop.label = cx->blk_loop.label;
7336 ncx->blk_loop.resetsp = cx->blk_loop.resetsp;
7337 ncx->blk_loop.redo_op = cx->blk_loop.redo_op;
7338 ncx->blk_loop.next_op = cx->blk_loop.next_op;
7339 ncx->blk_loop.last_op = cx->blk_loop.last_op;
7340 ncx->blk_loop.iterdata = (CxPADLOOP(cx)
7341 ? cx->blk_loop.iterdata
7342 : gv_dup((GV*)cx->blk_loop.iterdata));
7343 ncx->blk_loop.oldcurpad
7344 = (SV**)ptr_table_fetch(PL_ptr_table,
7345 cx->blk_loop.oldcurpad);
7346 ncx->blk_loop.itersave = sv_dup_inc(cx->blk_loop.itersave);
7347 ncx->blk_loop.iterlval = sv_dup_inc(cx->blk_loop.iterlval);
7348 ncx->blk_loop.iterary = av_dup_inc(cx->blk_loop.iterary);
7349 ncx->blk_loop.iterix = cx->blk_loop.iterix;
7350 ncx->blk_loop.itermax = cx->blk_loop.itermax;
7353 ncx->blk_sub.cv = cv_dup(cx->blk_sub.cv);
7354 ncx->blk_sub.gv = gv_dup(cx->blk_sub.gv);
7355 ncx->blk_sub.dfoutgv = gv_dup_inc(cx->blk_sub.dfoutgv);
7356 ncx->blk_sub.hasargs = cx->blk_sub.hasargs;
7369 Perl_si_dup(pTHX_ PERL_SI *si)
7374 return (PERL_SI*)NULL;
7376 /* look for it in the table first */
7377 nsi = (PERL_SI*)ptr_table_fetch(PL_ptr_table, si);
7381 /* create anew and remember what it is */
7382 Newz(56, nsi, 1, PERL_SI);
7383 ptr_table_store(PL_ptr_table, si, nsi);
7385 nsi->si_stack = av_dup_inc(si->si_stack);
7386 nsi->si_cxix = si->si_cxix;
7387 nsi->si_cxmax = si->si_cxmax;
7388 nsi->si_cxstack = cx_dup(si->si_cxstack, si->si_cxix, si->si_cxmax);
7389 nsi->si_type = si->si_type;
7390 nsi->si_prev = si_dup(si->si_prev);
7391 nsi->si_next = si_dup(si->si_next);
7392 nsi->si_markoff = si->si_markoff;
7397 #define POPINT(ss,ix) ((ss)[--(ix)].any_i32)
7398 #define TOPINT(ss,ix) ((ss)[ix].any_i32)
7399 #define POPLONG(ss,ix) ((ss)[--(ix)].any_long)
7400 #define TOPLONG(ss,ix) ((ss)[ix].any_long)
7401 #define POPIV(ss,ix) ((ss)[--(ix)].any_iv)
7402 #define TOPIV(ss,ix) ((ss)[ix].any_iv)
7403 #define POPPTR(ss,ix) ((ss)[--(ix)].any_ptr)
7404 #define TOPPTR(ss,ix) ((ss)[ix].any_ptr)
7405 #define POPDPTR(ss,ix) ((ss)[--(ix)].any_dptr)
7406 #define TOPDPTR(ss,ix) ((ss)[ix].any_dptr)
7407 #define POPDXPTR(ss,ix) ((ss)[--(ix)].any_dxptr)
7408 #define TOPDXPTR(ss,ix) ((ss)[ix].any_dxptr)
7411 #define pv_dup_inc(p) SAVEPV(p)
7412 #define pv_dup(p) SAVEPV(p)
7413 #define svp_dup_inc(p,pp) any_dup(p,pp)
7416 Perl_any_dup(pTHX_ void *v, PerlInterpreter *proto_perl)
7423 /* look for it in the table first */
7424 ret = ptr_table_fetch(PL_ptr_table, v);
7428 /* see if it is part of the interpreter structure */
7429 if (v >= (void*)proto_perl && v < (void*)(proto_perl+1))
7430 ret = (void*)(((char*)aTHXo) + (((char*)v) - (char*)proto_perl));
7438 Perl_ss_dup(pTHX_ PerlInterpreter *proto_perl)
7440 ANY *ss = proto_perl->Tsavestack;
7441 I32 ix = proto_perl->Tsavestack_ix;
7442 I32 max = proto_perl->Tsavestack_max;
7455 void (*dptr) (void*);
7456 void (*dxptr) (pTHXo_ void*);
7459 Newz(54, nss, max, ANY);
7465 case SAVEt_ITEM: /* normal string */
7466 sv = (SV*)POPPTR(ss,ix);
7467 TOPPTR(nss,ix) = sv_dup_inc(sv);
7468 sv = (SV*)POPPTR(ss,ix);
7469 TOPPTR(nss,ix) = sv_dup_inc(sv);
7471 case SAVEt_SV: /* scalar reference */
7472 sv = (SV*)POPPTR(ss,ix);
7473 TOPPTR(nss,ix) = sv_dup_inc(sv);
7474 gv = (GV*)POPPTR(ss,ix);
7475 TOPPTR(nss,ix) = gv_dup_inc(gv);
7477 case SAVEt_GENERIC_PVREF: /* generic char* */
7478 c = (char*)POPPTR(ss,ix);
7479 TOPPTR(nss,ix) = pv_dup(c);
7480 ptr = POPPTR(ss,ix);
7481 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
7483 case SAVEt_GENERIC_SVREF: /* generic sv */
7484 case SAVEt_SVREF: /* scalar reference */
7485 sv = (SV*)POPPTR(ss,ix);
7486 TOPPTR(nss,ix) = sv_dup_inc(sv);
7487 ptr = POPPTR(ss,ix);
7488 TOPPTR(nss,ix) = svp_dup_inc((SV**)ptr, proto_perl);/* XXXXX */
7490 case SAVEt_AV: /* array reference */
7491 av = (AV*)POPPTR(ss,ix);
7492 TOPPTR(nss,ix) = av_dup_inc(av);
7493 gv = (GV*)POPPTR(ss,ix);
7494 TOPPTR(nss,ix) = gv_dup(gv);
7496 case SAVEt_HV: /* hash reference */
7497 hv = (HV*)POPPTR(ss,ix);
7498 TOPPTR(nss,ix) = hv_dup_inc(hv);
7499 gv = (GV*)POPPTR(ss,ix);
7500 TOPPTR(nss,ix) = gv_dup(gv);
7502 case SAVEt_INT: /* int reference */
7503 ptr = POPPTR(ss,ix);
7504 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
7505 intval = (int)POPINT(ss,ix);
7506 TOPINT(nss,ix) = intval;
7508 case SAVEt_LONG: /* long reference */
7509 ptr = POPPTR(ss,ix);
7510 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
7511 longval = (long)POPLONG(ss,ix);
7512 TOPLONG(nss,ix) = longval;
7514 case SAVEt_I32: /* I32 reference */
7515 case SAVEt_I16: /* I16 reference */
7516 case SAVEt_I8: /* I8 reference */
7517 ptr = POPPTR(ss,ix);
7518 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
7522 case SAVEt_IV: /* IV reference */
7523 ptr = POPPTR(ss,ix);
7524 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
7528 case SAVEt_SPTR: /* SV* reference */
7529 ptr = POPPTR(ss,ix);
7530 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
7531 sv = (SV*)POPPTR(ss,ix);
7532 TOPPTR(nss,ix) = sv_dup(sv);
7534 case SAVEt_VPTR: /* random* reference */
7535 ptr = POPPTR(ss,ix);
7536 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
7537 ptr = POPPTR(ss,ix);
7538 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
7540 case SAVEt_PPTR: /* char* reference */
7541 ptr = POPPTR(ss,ix);
7542 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
7543 c = (char*)POPPTR(ss,ix);
7544 TOPPTR(nss,ix) = pv_dup(c);
7546 case SAVEt_HPTR: /* HV* reference */
7547 ptr = POPPTR(ss,ix);
7548 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
7549 hv = (HV*)POPPTR(ss,ix);
7550 TOPPTR(nss,ix) = hv_dup(hv);
7552 case SAVEt_APTR: /* AV* reference */
7553 ptr = POPPTR(ss,ix);
7554 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
7555 av = (AV*)POPPTR(ss,ix);
7556 TOPPTR(nss,ix) = av_dup(av);
7559 gv = (GV*)POPPTR(ss,ix);
7560 TOPPTR(nss,ix) = gv_dup(gv);
7562 case SAVEt_GP: /* scalar reference */
7563 gp = (GP*)POPPTR(ss,ix);
7564 TOPPTR(nss,ix) = gp = gp_dup(gp);
7565 (void)GpREFCNT_inc(gp);
7566 gv = (GV*)POPPTR(ss,ix);
7567 TOPPTR(nss,ix) = gv_dup_inc(c);
7568 c = (char*)POPPTR(ss,ix);
7569 TOPPTR(nss,ix) = pv_dup(c);
7576 sv = (SV*)POPPTR(ss,ix);
7577 TOPPTR(nss,ix) = sv_dup_inc(sv);
7580 ptr = POPPTR(ss,ix);
7581 if (ptr && (((OP*)ptr)->op_private & OPpREFCOUNTED)) {
7582 /* these are assumed to be refcounted properly */
7583 switch (((OP*)ptr)->op_type) {
7590 TOPPTR(nss,ix) = ptr;
7595 TOPPTR(nss,ix) = Nullop;
7600 TOPPTR(nss,ix) = Nullop;
7603 c = (char*)POPPTR(ss,ix);
7604 TOPPTR(nss,ix) = pv_dup_inc(c);
7607 longval = POPLONG(ss,ix);
7608 TOPLONG(nss,ix) = longval;
7611 hv = (HV*)POPPTR(ss,ix);
7612 TOPPTR(nss,ix) = hv_dup_inc(hv);
7613 c = (char*)POPPTR(ss,ix);
7614 TOPPTR(nss,ix) = pv_dup_inc(c);
7618 case SAVEt_DESTRUCTOR:
7619 ptr = POPPTR(ss,ix);
7620 TOPPTR(nss,ix) = any_dup(ptr, proto_perl); /* XXX quite arbitrary */
7621 dptr = POPDPTR(ss,ix);
7622 TOPDPTR(nss,ix) = (void (*)(void*))any_dup((void *)dptr, proto_perl);
7624 case SAVEt_DESTRUCTOR_X:
7625 ptr = POPPTR(ss,ix);
7626 TOPPTR(nss,ix) = any_dup(ptr, proto_perl); /* XXX quite arbitrary */
7627 dxptr = POPDXPTR(ss,ix);
7628 TOPDXPTR(nss,ix) = (void (*)(pTHXo_ void*))any_dup((void *)dxptr, proto_perl);
7630 case SAVEt_REGCONTEXT:
7636 case SAVEt_STACK_POS: /* Position on Perl stack */
7640 case SAVEt_AELEM: /* array element */
7641 sv = (SV*)POPPTR(ss,ix);
7642 TOPPTR(nss,ix) = sv_dup_inc(sv);
7645 av = (AV*)POPPTR(ss,ix);
7646 TOPPTR(nss,ix) = av_dup_inc(av);
7648 case SAVEt_HELEM: /* hash element */
7649 sv = (SV*)POPPTR(ss,ix);
7650 TOPPTR(nss,ix) = sv_dup_inc(sv);
7651 sv = (SV*)POPPTR(ss,ix);
7652 TOPPTR(nss,ix) = sv_dup_inc(sv);
7653 hv = (HV*)POPPTR(ss,ix);
7654 TOPPTR(nss,ix) = hv_dup_inc(hv);
7657 ptr = POPPTR(ss,ix);
7658 TOPPTR(nss,ix) = ptr;
7665 av = (AV*)POPPTR(ss,ix);
7666 TOPPTR(nss,ix) = av_dup(av);
7669 Perl_croak(aTHX_ "panic: ss_dup inconsistency");
7681 perl_clone(PerlInterpreter *proto_perl, UV flags)
7684 CPerlObj *pPerl = (CPerlObj*)proto_perl;
7687 #ifdef PERL_IMPLICIT_SYS
7688 return perl_clone_using(proto_perl, flags,
7690 proto_perl->IMemShared,
7691 proto_perl->IMemParse,
7701 perl_clone_using(PerlInterpreter *proto_perl, UV flags,
7702 struct IPerlMem* ipM, struct IPerlMem* ipMS,
7703 struct IPerlMem* ipMP, struct IPerlEnv* ipE,
7704 struct IPerlStdIO* ipStd, struct IPerlLIO* ipLIO,
7705 struct IPerlDir* ipD, struct IPerlSock* ipS,
7706 struct IPerlProc* ipP)
7708 /* XXX many of the string copies here can be optimized if they're
7709 * constants; they need to be allocated as common memory and just
7710 * their pointers copied. */
7714 CPerlObj *pPerl = new(ipM) CPerlObj(ipM, ipMS, ipMP, ipE, ipStd, ipLIO,
7716 PERL_SET_THX(pPerl);
7717 # else /* !PERL_OBJECT */
7718 PerlInterpreter *my_perl = (PerlInterpreter*)(*ipM->pMalloc)(ipM, sizeof(PerlInterpreter));
7719 PERL_SET_THX(my_perl);
7722 memset(my_perl, 0xab, sizeof(PerlInterpreter));
7727 # else /* !DEBUGGING */
7728 Zero(my_perl, 1, PerlInterpreter);
7729 # endif /* DEBUGGING */
7733 PL_MemShared = ipMS;
7741 # endif /* PERL_OBJECT */
7742 #else /* !PERL_IMPLICIT_SYS */
7744 PerlInterpreter *my_perl = (PerlInterpreter*)PerlMem_malloc(sizeof(PerlInterpreter));
7745 PERL_SET_THX(my_perl);
7748 memset(my_perl, 0xab, sizeof(PerlInterpreter));
7753 # else /* !DEBUGGING */
7754 Zero(my_perl, 1, PerlInterpreter);
7755 # endif /* DEBUGGING */
7756 #endif /* PERL_IMPLICIT_SYS */
7759 PL_xiv_arenaroot = NULL;
7761 PL_xnv_arenaroot = NULL;
7763 PL_xrv_arenaroot = NULL;
7765 PL_xpv_arenaroot = NULL;
7767 PL_xpviv_arenaroot = NULL;
7768 PL_xpviv_root = NULL;
7769 PL_xpvnv_arenaroot = NULL;
7770 PL_xpvnv_root = NULL;
7771 PL_xpvcv_arenaroot = NULL;
7772 PL_xpvcv_root = NULL;
7773 PL_xpvav_arenaroot = NULL;
7774 PL_xpvav_root = NULL;
7775 PL_xpvhv_arenaroot = NULL;
7776 PL_xpvhv_root = NULL;
7777 PL_xpvmg_arenaroot = NULL;
7778 PL_xpvmg_root = NULL;
7779 PL_xpvlv_arenaroot = NULL;
7780 PL_xpvlv_root = NULL;
7781 PL_xpvbm_arenaroot = NULL;
7782 PL_xpvbm_root = NULL;
7783 PL_he_arenaroot = NULL;
7785 PL_nice_chunk = NULL;
7786 PL_nice_chunk_size = 0;
7789 PL_sv_root = Nullsv;
7790 PL_sv_arenaroot = Nullsv;
7792 PL_debug = proto_perl->Idebug;
7794 /* create SV map for pointer relocation */
7795 PL_ptr_table = ptr_table_new();
7797 /* initialize these special pointers as early as possible */
7798 SvANY(&PL_sv_undef) = NULL;
7799 SvREFCNT(&PL_sv_undef) = (~(U32)0)/2;
7800 SvFLAGS(&PL_sv_undef) = SVf_READONLY|SVt_NULL;
7801 ptr_table_store(PL_ptr_table, &proto_perl->Isv_undef, &PL_sv_undef);
7804 SvUPGRADE(&PL_sv_no, SVt_PVNV);
7806 SvANY(&PL_sv_no) = new_XPVNV();
7808 SvREFCNT(&PL_sv_no) = (~(U32)0)/2;
7809 SvFLAGS(&PL_sv_no) = SVp_NOK|SVf_NOK|SVp_POK|SVf_POK|SVf_READONLY|SVt_PVNV;
7810 SvPVX(&PL_sv_no) = SAVEPVN(PL_No, 0);
7811 SvCUR(&PL_sv_no) = 0;
7812 SvLEN(&PL_sv_no) = 1;
7813 SvNVX(&PL_sv_no) = 0;
7814 ptr_table_store(PL_ptr_table, &proto_perl->Isv_no, &PL_sv_no);
7817 SvUPGRADE(&PL_sv_yes, SVt_PVNV);
7819 SvANY(&PL_sv_yes) = new_XPVNV();
7821 SvREFCNT(&PL_sv_yes) = (~(U32)0)/2;
7822 SvFLAGS(&PL_sv_yes) = SVp_NOK|SVf_NOK|SVp_POK|SVf_POK|SVf_READONLY|SVt_PVNV;
7823 SvPVX(&PL_sv_yes) = SAVEPVN(PL_Yes, 1);
7824 SvCUR(&PL_sv_yes) = 1;
7825 SvLEN(&PL_sv_yes) = 2;
7826 SvNVX(&PL_sv_yes) = 1;
7827 ptr_table_store(PL_ptr_table, &proto_perl->Isv_yes, &PL_sv_yes);
7829 /* create shared string table */
7830 PL_strtab = newHV();
7831 HvSHAREKEYS_off(PL_strtab);
7832 hv_ksplit(PL_strtab, 512);
7833 ptr_table_store(PL_ptr_table, proto_perl->Istrtab, PL_strtab);
7835 PL_compiling = proto_perl->Icompiling;
7836 PL_compiling.cop_stashpv = SAVEPV(PL_compiling.cop_stashpv);
7837 PL_compiling.cop_file = SAVEPV(PL_compiling.cop_file);
7838 ptr_table_store(PL_ptr_table, &proto_perl->Icompiling, &PL_compiling);
7839 if (!specialWARN(PL_compiling.cop_warnings))
7840 PL_compiling.cop_warnings = sv_dup_inc(PL_compiling.cop_warnings);
7841 PL_curcop = (COP*)any_dup(proto_perl->Tcurcop, proto_perl);
7843 /* pseudo environmental stuff */
7844 PL_origargc = proto_perl->Iorigargc;
7846 New(0, PL_origargv, i+1, char*);
7847 PL_origargv[i] = '\0';
7849 PL_origargv[i] = SAVEPV(proto_perl->Iorigargv[i]);
7851 PL_envgv = gv_dup(proto_perl->Ienvgv);
7852 PL_incgv = gv_dup(proto_perl->Iincgv);
7853 PL_hintgv = gv_dup(proto_perl->Ihintgv);
7854 PL_origfilename = SAVEPV(proto_perl->Iorigfilename);
7855 PL_diehook = sv_dup_inc(proto_perl->Idiehook);
7856 PL_warnhook = sv_dup_inc(proto_perl->Iwarnhook);
7859 PL_minus_c = proto_perl->Iminus_c;
7860 PL_patchlevel = sv_dup_inc(proto_perl->Ipatchlevel);
7861 PL_localpatches = proto_perl->Ilocalpatches;
7862 PL_splitstr = proto_perl->Isplitstr;
7863 PL_preprocess = proto_perl->Ipreprocess;
7864 PL_minus_n = proto_perl->Iminus_n;
7865 PL_minus_p = proto_perl->Iminus_p;
7866 PL_minus_l = proto_perl->Iminus_l;
7867 PL_minus_a = proto_perl->Iminus_a;
7868 PL_minus_F = proto_perl->Iminus_F;
7869 PL_doswitches = proto_perl->Idoswitches;
7870 PL_dowarn = proto_perl->Idowarn;
7871 PL_doextract = proto_perl->Idoextract;
7872 PL_sawampersand = proto_perl->Isawampersand;
7873 PL_unsafe = proto_perl->Iunsafe;
7874 PL_inplace = SAVEPV(proto_perl->Iinplace);
7875 PL_e_script = sv_dup_inc(proto_perl->Ie_script);
7876 PL_perldb = proto_perl->Iperldb;
7877 PL_perl_destruct_level = proto_perl->Iperl_destruct_level;
7879 /* magical thingies */
7880 /* XXX time(&PL_basetime) when asked for? */
7881 PL_basetime = proto_perl->Ibasetime;
7882 PL_formfeed = sv_dup(proto_perl->Iformfeed);
7884 PL_maxsysfd = proto_perl->Imaxsysfd;
7885 PL_multiline = proto_perl->Imultiline;
7886 PL_statusvalue = proto_perl->Istatusvalue;
7888 PL_statusvalue_vms = proto_perl->Istatusvalue_vms;
7891 /* shortcuts to various I/O objects */
7892 PL_stdingv = gv_dup(proto_perl->Istdingv);
7893 PL_stderrgv = gv_dup(proto_perl->Istderrgv);
7894 PL_defgv = gv_dup(proto_perl->Idefgv);
7895 PL_argvgv = gv_dup(proto_perl->Iargvgv);
7896 PL_argvoutgv = gv_dup(proto_perl->Iargvoutgv);
7897 PL_argvout_stack = av_dup(proto_perl->Iargvout_stack);
7899 /* shortcuts to regexp stuff */
7900 PL_replgv = gv_dup(proto_perl->Ireplgv);
7902 /* shortcuts to misc objects */
7903 PL_errgv = gv_dup(proto_perl->Ierrgv);
7905 /* shortcuts to debugging objects */
7906 PL_DBgv = gv_dup(proto_perl->IDBgv);
7907 PL_DBline = gv_dup(proto_perl->IDBline);
7908 PL_DBsub = gv_dup(proto_perl->IDBsub);
7909 PL_DBsingle = sv_dup(proto_perl->IDBsingle);
7910 PL_DBtrace = sv_dup(proto_perl->IDBtrace);
7911 PL_DBsignal = sv_dup(proto_perl->IDBsignal);
7912 PL_lineary = av_dup(proto_perl->Ilineary);
7913 PL_dbargs = av_dup(proto_perl->Idbargs);
7916 PL_defstash = hv_dup_inc(proto_perl->Tdefstash);
7917 PL_curstash = hv_dup(proto_perl->Tcurstash);
7918 PL_debstash = hv_dup(proto_perl->Idebstash);
7919 PL_globalstash = hv_dup(proto_perl->Iglobalstash);
7920 PL_curstname = sv_dup_inc(proto_perl->Icurstname);
7922 PL_beginav = av_dup_inc(proto_perl->Ibeginav);
7923 PL_endav = av_dup_inc(proto_perl->Iendav);
7924 PL_checkav = av_dup_inc(proto_perl->Icheckav);
7925 PL_initav = av_dup_inc(proto_perl->Iinitav);
7927 PL_sub_generation = proto_perl->Isub_generation;
7929 /* funky return mechanisms */
7930 PL_forkprocess = proto_perl->Iforkprocess;
7932 /* subprocess state */
7933 PL_fdpid = av_dup_inc(proto_perl->Ifdpid);
7935 /* internal state */
7936 PL_tainting = proto_perl->Itainting;
7937 PL_maxo = proto_perl->Imaxo;
7938 if (proto_perl->Iop_mask)
7939 PL_op_mask = SAVEPVN(proto_perl->Iop_mask, PL_maxo);
7941 PL_op_mask = Nullch;
7943 /* current interpreter roots */
7944 PL_main_cv = cv_dup_inc(proto_perl->Imain_cv);
7945 PL_main_root = OpREFCNT_inc(proto_perl->Imain_root);
7946 PL_main_start = proto_perl->Imain_start;
7947 PL_eval_root = proto_perl->Ieval_root;
7948 PL_eval_start = proto_perl->Ieval_start;
7950 /* runtime control stuff */
7951 PL_curcopdb = (COP*)any_dup(proto_perl->Icurcopdb, proto_perl);
7952 PL_copline = proto_perl->Icopline;
7954 PL_filemode = proto_perl->Ifilemode;
7955 PL_lastfd = proto_perl->Ilastfd;
7956 PL_oldname = proto_perl->Ioldname; /* XXX not quite right */
7959 PL_gensym = proto_perl->Igensym;
7960 PL_preambled = proto_perl->Ipreambled;
7961 PL_preambleav = av_dup_inc(proto_perl->Ipreambleav);
7962 PL_laststatval = proto_perl->Ilaststatval;
7963 PL_laststype = proto_perl->Ilaststype;
7964 PL_mess_sv = Nullsv;
7966 PL_orslen = proto_perl->Iorslen;
7967 PL_ors = SAVEPVN(proto_perl->Iors, PL_orslen);
7968 PL_ofmt = SAVEPV(proto_perl->Iofmt);
7970 /* interpreter atexit processing */
7971 PL_exitlistlen = proto_perl->Iexitlistlen;
7972 if (PL_exitlistlen) {
7973 New(0, PL_exitlist, PL_exitlistlen, PerlExitListEntry);
7974 Copy(proto_perl->Iexitlist, PL_exitlist, PL_exitlistlen, PerlExitListEntry);
7977 PL_exitlist = (PerlExitListEntry*)NULL;
7978 PL_modglobal = hv_dup_inc(proto_perl->Imodglobal);
7980 PL_profiledata = NULL;
7981 PL_rsfp = fp_dup(proto_perl->Irsfp, '<');
7982 /* PL_rsfp_filters entries have fake IoDIRP() */
7983 PL_rsfp_filters = av_dup_inc(proto_perl->Irsfp_filters);
7985 PL_compcv = cv_dup(proto_perl->Icompcv);
7986 PL_comppad = av_dup(proto_perl->Icomppad);
7987 PL_comppad_name = av_dup(proto_perl->Icomppad_name);
7988 PL_comppad_name_fill = proto_perl->Icomppad_name_fill;
7989 PL_comppad_name_floor = proto_perl->Icomppad_name_floor;
7990 PL_curpad = (SV**)ptr_table_fetch(PL_ptr_table,
7991 proto_perl->Tcurpad);
7993 #ifdef HAVE_INTERP_INTERN
7994 sys_intern_dup(&proto_perl->Isys_intern, &PL_sys_intern);
7997 /* more statics moved here */
7998 PL_generation = proto_perl->Igeneration;
7999 PL_DBcv = cv_dup(proto_perl->IDBcv);
8001 PL_in_clean_objs = proto_perl->Iin_clean_objs;
8002 PL_in_clean_all = proto_perl->Iin_clean_all;
8004 PL_uid = proto_perl->Iuid;
8005 PL_euid = proto_perl->Ieuid;
8006 PL_gid = proto_perl->Igid;
8007 PL_egid = proto_perl->Iegid;
8008 PL_nomemok = proto_perl->Inomemok;
8009 PL_an = proto_perl->Ian;
8010 PL_cop_seqmax = proto_perl->Icop_seqmax;
8011 PL_op_seqmax = proto_perl->Iop_seqmax;
8012 PL_evalseq = proto_perl->Ievalseq;
8013 PL_origenviron = proto_perl->Iorigenviron; /* XXX not quite right */
8014 PL_origalen = proto_perl->Iorigalen;
8015 PL_pidstatus = newHV(); /* XXX flag for cloning? */
8016 PL_osname = SAVEPV(proto_perl->Iosname);
8017 PL_sh_path = SAVEPV(proto_perl->Ish_path);
8018 PL_sighandlerp = proto_perl->Isighandlerp;
8021 PL_runops = proto_perl->Irunops;
8023 Copy(proto_perl->Itokenbuf, PL_tokenbuf, 256, char);
8026 PL_cshlen = proto_perl->Icshlen;
8027 PL_cshname = SAVEPVN(proto_perl->Icshname, PL_cshlen);
8030 PL_lex_state = proto_perl->Ilex_state;
8031 PL_lex_defer = proto_perl->Ilex_defer;
8032 PL_lex_expect = proto_perl->Ilex_expect;
8033 PL_lex_formbrack = proto_perl->Ilex_formbrack;
8034 PL_lex_dojoin = proto_perl->Ilex_dojoin;
8035 PL_lex_starts = proto_perl->Ilex_starts;
8036 PL_lex_stuff = sv_dup_inc(proto_perl->Ilex_stuff);
8037 PL_lex_repl = sv_dup_inc(proto_perl->Ilex_repl);
8038 PL_lex_op = proto_perl->Ilex_op;
8039 PL_lex_inpat = proto_perl->Ilex_inpat;
8040 PL_lex_inwhat = proto_perl->Ilex_inwhat;
8041 PL_lex_brackets = proto_perl->Ilex_brackets;
8042 i = (PL_lex_brackets < 120 ? 120 : PL_lex_brackets);
8043 PL_lex_brackstack = SAVEPVN(proto_perl->Ilex_brackstack,i);
8044 PL_lex_casemods = proto_perl->Ilex_casemods;
8045 i = (PL_lex_casemods < 12 ? 12 : PL_lex_casemods);
8046 PL_lex_casestack = SAVEPVN(proto_perl->Ilex_casestack,i);
8048 Copy(proto_perl->Inextval, PL_nextval, 5, YYSTYPE);
8049 Copy(proto_perl->Inexttype, PL_nexttype, 5, I32);
8050 PL_nexttoke = proto_perl->Inexttoke;
8052 PL_linestr = sv_dup_inc(proto_perl->Ilinestr);
8053 i = proto_perl->Ibufptr - SvPVX(proto_perl->Ilinestr);
8054 PL_bufptr = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
8055 i = proto_perl->Ioldbufptr - SvPVX(proto_perl->Ilinestr);
8056 PL_oldbufptr = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
8057 i = proto_perl->Ioldoldbufptr - SvPVX(proto_perl->Ilinestr);
8058 PL_oldoldbufptr = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
8059 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
8060 i = proto_perl->Ilinestart - SvPVX(proto_perl->Ilinestr);
8061 PL_linestart = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
8062 PL_pending_ident = proto_perl->Ipending_ident;
8063 PL_sublex_info = proto_perl->Isublex_info; /* XXX not quite right */
8065 PL_expect = proto_perl->Iexpect;
8067 PL_multi_start = proto_perl->Imulti_start;
8068 PL_multi_end = proto_perl->Imulti_end;
8069 PL_multi_open = proto_perl->Imulti_open;
8070 PL_multi_close = proto_perl->Imulti_close;
8072 PL_error_count = proto_perl->Ierror_count;
8073 PL_subline = proto_perl->Isubline;
8074 PL_subname = sv_dup_inc(proto_perl->Isubname);
8076 PL_min_intro_pending = proto_perl->Imin_intro_pending;
8077 PL_max_intro_pending = proto_perl->Imax_intro_pending;
8078 PL_padix = proto_perl->Ipadix;
8079 PL_padix_floor = proto_perl->Ipadix_floor;
8080 PL_pad_reset_pending = proto_perl->Ipad_reset_pending;
8082 i = proto_perl->Ilast_uni - SvPVX(proto_perl->Ilinestr);
8083 PL_last_uni = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
8084 i = proto_perl->Ilast_lop - SvPVX(proto_perl->Ilinestr);
8085 PL_last_lop = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
8086 PL_last_lop_op = proto_perl->Ilast_lop_op;
8087 PL_in_my = proto_perl->Iin_my;
8088 PL_in_my_stash = hv_dup(proto_perl->Iin_my_stash);
8090 PL_cryptseen = proto_perl->Icryptseen;
8093 PL_hints = proto_perl->Ihints;
8095 PL_amagic_generation = proto_perl->Iamagic_generation;
8097 #ifdef USE_LOCALE_COLLATE
8098 PL_collation_ix = proto_perl->Icollation_ix;
8099 PL_collation_name = SAVEPV(proto_perl->Icollation_name);
8100 PL_collation_standard = proto_perl->Icollation_standard;
8101 PL_collxfrm_base = proto_perl->Icollxfrm_base;
8102 PL_collxfrm_mult = proto_perl->Icollxfrm_mult;
8103 #endif /* USE_LOCALE_COLLATE */
8105 #ifdef USE_LOCALE_NUMERIC
8106 PL_numeric_name = SAVEPV(proto_perl->Inumeric_name);
8107 PL_numeric_standard = proto_perl->Inumeric_standard;
8108 PL_numeric_local = proto_perl->Inumeric_local;
8109 PL_numeric_radix = proto_perl->Inumeric_radix;
8110 #endif /* !USE_LOCALE_NUMERIC */
8112 /* utf8 character classes */
8113 PL_utf8_alnum = sv_dup_inc(proto_perl->Iutf8_alnum);
8114 PL_utf8_alnumc = sv_dup_inc(proto_perl->Iutf8_alnumc);
8115 PL_utf8_ascii = sv_dup_inc(proto_perl->Iutf8_ascii);
8116 PL_utf8_alpha = sv_dup_inc(proto_perl->Iutf8_alpha);
8117 PL_utf8_space = sv_dup_inc(proto_perl->Iutf8_space);
8118 PL_utf8_cntrl = sv_dup_inc(proto_perl->Iutf8_cntrl);
8119 PL_utf8_graph = sv_dup_inc(proto_perl->Iutf8_graph);
8120 PL_utf8_digit = sv_dup_inc(proto_perl->Iutf8_digit);
8121 PL_utf8_upper = sv_dup_inc(proto_perl->Iutf8_upper);
8122 PL_utf8_lower = sv_dup_inc(proto_perl->Iutf8_lower);
8123 PL_utf8_print = sv_dup_inc(proto_perl->Iutf8_print);
8124 PL_utf8_punct = sv_dup_inc(proto_perl->Iutf8_punct);
8125 PL_utf8_xdigit = sv_dup_inc(proto_perl->Iutf8_xdigit);
8126 PL_utf8_mark = sv_dup_inc(proto_perl->Iutf8_mark);
8127 PL_utf8_toupper = sv_dup_inc(proto_perl->Iutf8_toupper);
8128 PL_utf8_totitle = sv_dup_inc(proto_perl->Iutf8_totitle);
8129 PL_utf8_tolower = sv_dup_inc(proto_perl->Iutf8_tolower);
8132 PL_last_swash_hv = Nullhv; /* reinits on demand */
8133 PL_last_swash_klen = 0;
8134 PL_last_swash_key[0]= '\0';
8135 PL_last_swash_tmps = (U8*)NULL;
8136 PL_last_swash_slen = 0;
8138 /* perly.c globals */
8139 PL_yydebug = proto_perl->Iyydebug;
8140 PL_yynerrs = proto_perl->Iyynerrs;
8141 PL_yyerrflag = proto_perl->Iyyerrflag;
8142 PL_yychar = proto_perl->Iyychar;
8143 PL_yyval = proto_perl->Iyyval;
8144 PL_yylval = proto_perl->Iyylval;
8146 PL_glob_index = proto_perl->Iglob_index;
8147 PL_srand_called = proto_perl->Isrand_called;
8148 PL_uudmap['M'] = 0; /* reinits on demand */
8149 PL_bitcount = Nullch; /* reinits on demand */
8151 if (proto_perl->Ipsig_ptr) {
8152 int sig_num[] = { SIG_NUM };
8153 Newz(0, PL_psig_ptr, sizeof(sig_num)/sizeof(*sig_num), SV*);
8154 Newz(0, PL_psig_name, sizeof(sig_num)/sizeof(*sig_num), SV*);
8155 for (i = 1; PL_sig_name[i]; i++) {
8156 PL_psig_ptr[i] = sv_dup_inc(proto_perl->Ipsig_ptr[i]);
8157 PL_psig_name[i] = sv_dup_inc(proto_perl->Ipsig_name[i]);
8161 PL_psig_ptr = (SV**)NULL;
8162 PL_psig_name = (SV**)NULL;
8165 /* thrdvar.h stuff */
8168 /* next allocation will be PL_tmps_stack[PL_tmps_ix+1] */
8169 PL_tmps_ix = proto_perl->Ttmps_ix;
8170 PL_tmps_max = proto_perl->Ttmps_max;
8171 PL_tmps_floor = proto_perl->Ttmps_floor;
8172 Newz(50, PL_tmps_stack, PL_tmps_max, SV*);
8174 while (i <= PL_tmps_ix) {
8175 PL_tmps_stack[i] = sv_dup_inc(proto_perl->Ttmps_stack[i]);
8179 /* next PUSHMARK() sets *(PL_markstack_ptr+1) */
8180 i = proto_perl->Tmarkstack_max - proto_perl->Tmarkstack;
8181 Newz(54, PL_markstack, i, I32);
8182 PL_markstack_max = PL_markstack + (proto_perl->Tmarkstack_max
8183 - proto_perl->Tmarkstack);
8184 PL_markstack_ptr = PL_markstack + (proto_perl->Tmarkstack_ptr
8185 - proto_perl->Tmarkstack);
8186 Copy(proto_perl->Tmarkstack, PL_markstack,
8187 PL_markstack_ptr - PL_markstack + 1, I32);
8189 /* next push_scope()/ENTER sets PL_scopestack[PL_scopestack_ix]
8190 * NOTE: unlike the others! */
8191 PL_scopestack_ix = proto_perl->Tscopestack_ix;
8192 PL_scopestack_max = proto_perl->Tscopestack_max;
8193 Newz(54, PL_scopestack, PL_scopestack_max, I32);
8194 Copy(proto_perl->Tscopestack, PL_scopestack, PL_scopestack_ix, I32);
8196 /* next push_return() sets PL_retstack[PL_retstack_ix]
8197 * NOTE: unlike the others! */
8198 PL_retstack_ix = proto_perl->Tretstack_ix;
8199 PL_retstack_max = proto_perl->Tretstack_max;
8200 Newz(54, PL_retstack, PL_retstack_max, OP*);
8201 Copy(proto_perl->Tretstack, PL_retstack, PL_retstack_ix, I32);
8203 /* NOTE: si_dup() looks at PL_markstack */
8204 PL_curstackinfo = si_dup(proto_perl->Tcurstackinfo);
8206 /* PL_curstack = PL_curstackinfo->si_stack; */
8207 PL_curstack = av_dup(proto_perl->Tcurstack);
8208 PL_mainstack = av_dup(proto_perl->Tmainstack);
8210 /* next PUSHs() etc. set *(PL_stack_sp+1) */
8211 PL_stack_base = AvARRAY(PL_curstack);
8212 PL_stack_sp = PL_stack_base + (proto_perl->Tstack_sp
8213 - proto_perl->Tstack_base);
8214 PL_stack_max = PL_stack_base + AvMAX(PL_curstack);
8216 /* next SSPUSHFOO() sets PL_savestack[PL_savestack_ix]
8217 * NOTE: unlike the others! */
8218 PL_savestack_ix = proto_perl->Tsavestack_ix;
8219 PL_savestack_max = proto_perl->Tsavestack_max;
8220 /*Newz(54, PL_savestack, PL_savestack_max, ANY);*/
8221 PL_savestack = ss_dup(proto_perl);
8225 ENTER; /* perl_destruct() wants to LEAVE; */
8228 PL_start_env = proto_perl->Tstart_env; /* XXXXXX */
8229 PL_top_env = &PL_start_env;
8231 PL_op = proto_perl->Top;
8234 PL_Xpv = (XPV*)NULL;
8235 PL_na = proto_perl->Tna;
8237 PL_statbuf = proto_perl->Tstatbuf;
8238 PL_statcache = proto_perl->Tstatcache;
8239 PL_statgv = gv_dup(proto_perl->Tstatgv);
8240 PL_statname = sv_dup_inc(proto_perl->Tstatname);
8242 PL_timesbuf = proto_perl->Ttimesbuf;
8245 PL_tainted = proto_perl->Ttainted;
8246 PL_curpm = proto_perl->Tcurpm; /* XXX No PMOP ref count */
8247 PL_nrs = sv_dup_inc(proto_perl->Tnrs);
8248 PL_rs = sv_dup_inc(proto_perl->Trs);
8249 PL_last_in_gv = gv_dup(proto_perl->Tlast_in_gv);
8250 PL_ofslen = proto_perl->Tofslen;
8251 PL_ofs = SAVEPVN(proto_perl->Tofs, PL_ofslen);
8252 PL_defoutgv = gv_dup_inc(proto_perl->Tdefoutgv);
8253 PL_chopset = proto_perl->Tchopset; /* XXX never deallocated */
8254 PL_toptarget = sv_dup_inc(proto_perl->Ttoptarget);
8255 PL_bodytarget = sv_dup_inc(proto_perl->Tbodytarget);
8256 PL_formtarget = sv_dup(proto_perl->Tformtarget);
8258 PL_restartop = proto_perl->Trestartop;
8259 PL_in_eval = proto_perl->Tin_eval;
8260 PL_delaymagic = proto_perl->Tdelaymagic;
8261 PL_dirty = proto_perl->Tdirty;
8262 PL_localizing = proto_perl->Tlocalizing;
8264 #ifdef PERL_FLEXIBLE_EXCEPTIONS
8265 PL_protect = proto_perl->Tprotect;
8267 PL_errors = sv_dup_inc(proto_perl->Terrors);
8268 PL_av_fetch_sv = Nullsv;
8269 PL_hv_fetch_sv = Nullsv;
8270 Zero(&PL_hv_fetch_ent_mh, 1, HE); /* XXX */
8271 PL_modcount = proto_perl->Tmodcount;
8272 PL_lastgotoprobe = Nullop;
8273 PL_dumpindent = proto_perl->Tdumpindent;
8275 PL_sortcop = (OP*)any_dup(proto_perl->Tsortcop, proto_perl);
8276 PL_sortstash = hv_dup(proto_perl->Tsortstash);
8277 PL_firstgv = gv_dup(proto_perl->Tfirstgv);
8278 PL_secondgv = gv_dup(proto_perl->Tsecondgv);
8279 PL_sortcxix = proto_perl->Tsortcxix;
8280 PL_efloatbuf = Nullch; /* reinits on demand */
8281 PL_efloatsize = 0; /* reinits on demand */
8285 PL_screamfirst = NULL;
8286 PL_screamnext = NULL;
8287 PL_maxscream = -1; /* reinits on demand */
8288 PL_lastscream = Nullsv;
8290 PL_watchaddr = NULL;
8291 PL_watchok = Nullch;
8293 PL_regdummy = proto_perl->Tregdummy;
8294 PL_regcomp_parse = Nullch;
8295 PL_regxend = Nullch;
8296 PL_regcode = (regnode*)NULL;
8299 PL_regprecomp = Nullch;
8304 PL_seen_zerolen = 0;
8306 PL_regcomp_rx = (regexp*)NULL;
8308 PL_colorset = 0; /* reinits PL_colors[] */
8309 /*PL_colors[6] = {0,0,0,0,0,0};*/
8310 PL_reg_whilem_seen = 0;
8311 PL_reginput = Nullch;
8314 PL_regstartp = (I32*)NULL;
8315 PL_regendp = (I32*)NULL;
8316 PL_reglastparen = (U32*)NULL;
8317 PL_regtill = Nullch;
8319 PL_reg_start_tmp = (char**)NULL;
8320 PL_reg_start_tmpl = 0;
8321 PL_regdata = (struct reg_data*)NULL;
8324 PL_reg_eval_set = 0;
8326 PL_regprogram = (regnode*)NULL;
8328 PL_regcc = (CURCUR*)NULL;
8329 PL_reg_call_cc = (struct re_cc_state*)NULL;
8330 PL_reg_re = (regexp*)NULL;
8331 PL_reg_ganch = Nullch;
8333 PL_reg_magic = (MAGIC*)NULL;
8335 PL_reg_oldcurpm = (PMOP*)NULL;
8336 PL_reg_curpm = (PMOP*)NULL;
8337 PL_reg_oldsaved = Nullch;
8338 PL_reg_oldsavedlen = 0;
8340 PL_reg_leftiter = 0;
8341 PL_reg_poscache = Nullch;
8342 PL_reg_poscache_size= 0;
8344 /* RE engine - function pointers */
8345 PL_regcompp = proto_perl->Tregcompp;
8346 PL_regexecp = proto_perl->Tregexecp;
8347 PL_regint_start = proto_perl->Tregint_start;
8348 PL_regint_string = proto_perl->Tregint_string;
8349 PL_regfree = proto_perl->Tregfree;
8351 PL_reginterp_cnt = 0;
8352 PL_reg_starttry = 0;
8355 return (PerlInterpreter*)pPerl;
8361 #else /* !USE_ITHREADS */
8367 #endif /* USE_ITHREADS */
8370 do_report_used(pTHXo_ SV *sv)
8372 if (SvTYPE(sv) != SVTYPEMASK) {
8373 PerlIO_printf(Perl_debug_log, "****\n");
8379 do_clean_objs(pTHXo_ SV *sv)
8383 if (SvROK(sv) && SvOBJECT(rv = SvRV(sv))) {
8384 DEBUG_D((PerlIO_printf(Perl_debug_log, "Cleaning object ref:\n "), sv_dump(sv));)
8385 if (SvWEAKREF(sv)) {
8396 /* XXX Might want to check arrays, etc. */
8399 #ifndef DISABLE_DESTRUCTOR_KLUDGE
8401 do_clean_named_objs(pTHXo_ SV *sv)
8403 if (SvTYPE(sv) == SVt_PVGV && GvGP(sv)) {
8404 if ( SvOBJECT(GvSV(sv)) ||
8405 (GvAV(sv) && SvOBJECT(GvAV(sv))) ||
8406 (GvHV(sv) && SvOBJECT(GvHV(sv))) ||
8407 (GvIO(sv) && SvOBJECT(GvIO(sv))) ||
8408 (GvCV(sv) && SvOBJECT(GvCV(sv))) )
8410 DEBUG_D((PerlIO_printf(Perl_debug_log, "Cleaning named glob object:\n "), sv_dump(sv));)
8418 do_clean_all(pTHXo_ SV *sv)
8420 DEBUG_D((PerlIO_printf(Perl_debug_log, "Cleaning loops: SV at 0x%"UVxf"\n", PTR2UV(sv)) );)
8421 SvFLAGS(sv) |= SVf_BREAK;