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(sva, 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)
198 /* Free arenas here, but be careful about fake ones. (We assume
199 contiguity of the fake ones with the corresponding real ones.) */
201 for (sva = PL_sv_arenaroot; sva; sva = svanext) {
202 svanext = (SV*) SvANY(sva);
203 while (svanext && SvFAKE(svanext))
204 svanext = (SV*) SvANY(svanext);
207 Safefree((void *)sva);
211 Safefree(PL_nice_chunk);
212 PL_nice_chunk = Nullch;
213 PL_nice_chunk_size = 0;
219 Perl_report_uninit(pTHX)
222 Perl_warner(aTHX_ WARN_UNINITIALIZED, PL_warn_uninit,
223 " in ", PL_op_desc[PL_op->op_type]);
225 Perl_warner(aTHX_ WARN_UNINITIALIZED, PL_warn_uninit, "", "");
237 * See comment in more_xiv() -- RAM.
239 PL_xiv_root = *(IV**)xiv;
241 return (XPVIV*)((char*)xiv - STRUCT_OFFSET(XPVIV, xiv_iv));
245 S_del_xiv(pTHX_ XPVIV *p)
247 IV* xiv = (IV*)((char*)(p) + STRUCT_OFFSET(XPVIV, xiv_iv));
249 *(IV**)xiv = PL_xiv_root;
260 New(705, ptr, 1008/sizeof(XPV), XPV);
261 ptr->xpv_pv = (char*)PL_xiv_arenaroot; /* linked list of xiv arenas */
262 PL_xiv_arenaroot = ptr; /* to keep Purify happy */
265 xivend = &xiv[1008 / sizeof(IV) - 1];
266 xiv += (sizeof(XPV) - 1) / sizeof(IV) + 1; /* fudge by size of XPV */
268 while (xiv < xivend) {
269 *(IV**)xiv = (IV *)(xiv + 1);
283 PL_xnv_root = *(NV**)xnv;
285 return (XPVNV*)((char*)xnv - STRUCT_OFFSET(XPVNV, xnv_nv));
289 S_del_xnv(pTHX_ XPVNV *p)
291 NV* xnv = (NV*)((char*)(p) + STRUCT_OFFSET(XPVNV, xnv_nv));
293 *(NV**)xnv = PL_xnv_root;
303 New(711, xnv, 1008/sizeof(NV), NV);
304 xnvend = &xnv[1008 / sizeof(NV) - 1];
305 xnv += (sizeof(XPVIV) - 1) / sizeof(NV) + 1; /* fudge by sizeof XPVIV */
307 while (xnv < xnvend) {
308 *(NV**)xnv = (NV*)(xnv + 1);
322 PL_xrv_root = (XRV*)xrv->xrv_rv;
328 S_del_xrv(pTHX_ XRV *p)
331 p->xrv_rv = (SV*)PL_xrv_root;
340 register XRV* xrvend;
341 New(712, PL_xrv_root, 1008/sizeof(XRV), XRV);
343 xrvend = &xrv[1008 / sizeof(XRV) - 1];
344 while (xrv < xrvend) {
345 xrv->xrv_rv = (SV*)(xrv + 1);
359 PL_xpv_root = (XPV*)xpv->xpv_pv;
365 S_del_xpv(pTHX_ XPV *p)
368 p->xpv_pv = (char*)PL_xpv_root;
377 register XPV* xpvend;
378 New(713, PL_xpv_root, 1008/sizeof(XPV), XPV);
380 xpvend = &xpv[1008 / sizeof(XPV) - 1];
381 while (xpv < xpvend) {
382 xpv->xpv_pv = (char*)(xpv + 1);
395 xpviv = PL_xpviv_root;
396 PL_xpviv_root = (XPVIV*)xpviv->xpv_pv;
402 S_del_xpviv(pTHX_ XPVIV *p)
405 p->xpv_pv = (char*)PL_xpviv_root;
414 register XPVIV* xpviv;
415 register XPVIV* xpvivend;
416 New(714, PL_xpviv_root, 1008/sizeof(XPVIV), XPVIV);
417 xpviv = PL_xpviv_root;
418 xpvivend = &xpviv[1008 / sizeof(XPVIV) - 1];
419 while (xpviv < xpvivend) {
420 xpviv->xpv_pv = (char*)(xpviv + 1);
434 xpvnv = PL_xpvnv_root;
435 PL_xpvnv_root = (XPVNV*)xpvnv->xpv_pv;
441 S_del_xpvnv(pTHX_ XPVNV *p)
444 p->xpv_pv = (char*)PL_xpvnv_root;
453 register XPVNV* xpvnv;
454 register XPVNV* xpvnvend;
455 New(715, PL_xpvnv_root, 1008/sizeof(XPVNV), XPVNV);
456 xpvnv = PL_xpvnv_root;
457 xpvnvend = &xpvnv[1008 / sizeof(XPVNV) - 1];
458 while (xpvnv < xpvnvend) {
459 xpvnv->xpv_pv = (char*)(xpvnv + 1);
474 xpvcv = PL_xpvcv_root;
475 PL_xpvcv_root = (XPVCV*)xpvcv->xpv_pv;
481 S_del_xpvcv(pTHX_ XPVCV *p)
484 p->xpv_pv = (char*)PL_xpvcv_root;
493 register XPVCV* xpvcv;
494 register XPVCV* xpvcvend;
495 New(716, PL_xpvcv_root, 1008/sizeof(XPVCV), XPVCV);
496 xpvcv = PL_xpvcv_root;
497 xpvcvend = &xpvcv[1008 / sizeof(XPVCV) - 1];
498 while (xpvcv < xpvcvend) {
499 xpvcv->xpv_pv = (char*)(xpvcv + 1);
514 xpvav = PL_xpvav_root;
515 PL_xpvav_root = (XPVAV*)xpvav->xav_array;
521 S_del_xpvav(pTHX_ XPVAV *p)
524 p->xav_array = (char*)PL_xpvav_root;
533 register XPVAV* xpvav;
534 register XPVAV* xpvavend;
535 New(717, PL_xpvav_root, 1008/sizeof(XPVAV), XPVAV);
536 xpvav = PL_xpvav_root;
537 xpvavend = &xpvav[1008 / sizeof(XPVAV) - 1];
538 while (xpvav < xpvavend) {
539 xpvav->xav_array = (char*)(xpvav + 1);
542 xpvav->xav_array = 0;
554 xpvhv = PL_xpvhv_root;
555 PL_xpvhv_root = (XPVHV*)xpvhv->xhv_array;
561 S_del_xpvhv(pTHX_ XPVHV *p)
564 p->xhv_array = (char*)PL_xpvhv_root;
573 register XPVHV* xpvhv;
574 register XPVHV* xpvhvend;
575 New(718, PL_xpvhv_root, 1008/sizeof(XPVHV), XPVHV);
576 xpvhv = PL_xpvhv_root;
577 xpvhvend = &xpvhv[1008 / sizeof(XPVHV) - 1];
578 while (xpvhv < xpvhvend) {
579 xpvhv->xhv_array = (char*)(xpvhv + 1);
582 xpvhv->xhv_array = 0;
593 xpvmg = PL_xpvmg_root;
594 PL_xpvmg_root = (XPVMG*)xpvmg->xpv_pv;
600 S_del_xpvmg(pTHX_ XPVMG *p)
603 p->xpv_pv = (char*)PL_xpvmg_root;
612 register XPVMG* xpvmg;
613 register XPVMG* xpvmgend;
614 New(719, PL_xpvmg_root, 1008/sizeof(XPVMG), XPVMG);
615 xpvmg = PL_xpvmg_root;
616 xpvmgend = &xpvmg[1008 / sizeof(XPVMG) - 1];
617 while (xpvmg < xpvmgend) {
618 xpvmg->xpv_pv = (char*)(xpvmg + 1);
633 xpvlv = PL_xpvlv_root;
634 PL_xpvlv_root = (XPVLV*)xpvlv->xpv_pv;
640 S_del_xpvlv(pTHX_ XPVLV *p)
643 p->xpv_pv = (char*)PL_xpvlv_root;
652 register XPVLV* xpvlv;
653 register XPVLV* xpvlvend;
654 New(720, PL_xpvlv_root, 1008/sizeof(XPVLV), XPVLV);
655 xpvlv = PL_xpvlv_root;
656 xpvlvend = &xpvlv[1008 / sizeof(XPVLV) - 1];
657 while (xpvlv < xpvlvend) {
658 xpvlv->xpv_pv = (char*)(xpvlv + 1);
672 xpvbm = PL_xpvbm_root;
673 PL_xpvbm_root = (XPVBM*)xpvbm->xpv_pv;
679 S_del_xpvbm(pTHX_ XPVBM *p)
682 p->xpv_pv = (char*)PL_xpvbm_root;
691 register XPVBM* xpvbm;
692 register XPVBM* xpvbmend;
693 New(721, PL_xpvbm_root, 1008/sizeof(XPVBM), XPVBM);
694 xpvbm = PL_xpvbm_root;
695 xpvbmend = &xpvbm[1008 / sizeof(XPVBM) - 1];
696 while (xpvbm < xpvbmend) {
697 xpvbm->xpv_pv = (char*)(xpvbm + 1);
704 # define my_safemalloc(s) (void*)safexmalloc(717,s)
705 # define my_safefree(p) safexfree((char*)p)
707 # define my_safemalloc(s) (void*)safemalloc(s)
708 # define my_safefree(p) safefree((char*)p)
713 #define new_XIV() my_safemalloc(sizeof(XPVIV))
714 #define del_XIV(p) my_safefree(p)
716 #define new_XNV() my_safemalloc(sizeof(XPVNV))
717 #define del_XNV(p) my_safefree(p)
719 #define new_XRV() my_safemalloc(sizeof(XRV))
720 #define del_XRV(p) my_safefree(p)
722 #define new_XPV() my_safemalloc(sizeof(XPV))
723 #define del_XPV(p) my_safefree(p)
725 #define new_XPVIV() my_safemalloc(sizeof(XPVIV))
726 #define del_XPVIV(p) my_safefree(p)
728 #define new_XPVNV() my_safemalloc(sizeof(XPVNV))
729 #define del_XPVNV(p) my_safefree(p)
731 #define new_XPVCV() my_safemalloc(sizeof(XPVCV))
732 #define del_XPVCV(p) my_safefree(p)
734 #define new_XPVAV() my_safemalloc(sizeof(XPVAV))
735 #define del_XPVAV(p) my_safefree(p)
737 #define new_XPVHV() my_safemalloc(sizeof(XPVHV))
738 #define del_XPVHV(p) my_safefree(p)
740 #define new_XPVMG() my_safemalloc(sizeof(XPVMG))
741 #define del_XPVMG(p) my_safefree(p)
743 #define new_XPVLV() my_safemalloc(sizeof(XPVLV))
744 #define del_XPVLV(p) my_safefree(p)
746 #define new_XPVBM() my_safemalloc(sizeof(XPVBM))
747 #define del_XPVBM(p) my_safefree(p)
751 #define new_XIV() (void*)new_xiv()
752 #define del_XIV(p) del_xiv((XPVIV*) p)
754 #define new_XNV() (void*)new_xnv()
755 #define del_XNV(p) del_xnv((XPVNV*) p)
757 #define new_XRV() (void*)new_xrv()
758 #define del_XRV(p) del_xrv((XRV*) p)
760 #define new_XPV() (void*)new_xpv()
761 #define del_XPV(p) del_xpv((XPV *)p)
763 #define new_XPVIV() (void*)new_xpviv()
764 #define del_XPVIV(p) del_xpviv((XPVIV *)p)
766 #define new_XPVNV() (void*)new_xpvnv()
767 #define del_XPVNV(p) del_xpvnv((XPVNV *)p)
769 #define new_XPVCV() (void*)new_xpvcv()
770 #define del_XPVCV(p) del_xpvcv((XPVCV *)p)
772 #define new_XPVAV() (void*)new_xpvav()
773 #define del_XPVAV(p) del_xpvav((XPVAV *)p)
775 #define new_XPVHV() (void*)new_xpvhv()
776 #define del_XPVHV(p) del_xpvhv((XPVHV *)p)
778 #define new_XPVMG() (void*)new_xpvmg()
779 #define del_XPVMG(p) del_xpvmg((XPVMG *)p)
781 #define new_XPVLV() (void*)new_xpvlv()
782 #define del_XPVLV(p) del_xpvlv((XPVLV *)p)
784 #define new_XPVBM() (void*)new_xpvbm()
785 #define del_XPVBM(p) del_xpvbm((XPVBM *)p)
789 #define new_XPVGV() my_safemalloc(sizeof(XPVGV))
790 #define del_XPVGV(p) my_safefree(p)
792 #define new_XPVFM() my_safemalloc(sizeof(XPVFM))
793 #define del_XPVFM(p) my_safefree(p)
795 #define new_XPVIO() my_safemalloc(sizeof(XPVIO))
796 #define del_XPVIO(p) my_safefree(p)
799 =for apidoc sv_upgrade
801 Upgrade an SV to a more complex form. Use C<SvUPGRADE>. See
808 Perl_sv_upgrade(pTHX_ register SV *sv, U32 mt)
818 if (SvTYPE(sv) == mt)
824 switch (SvTYPE(sv)) {
845 else if (mt < SVt_PVIV)
862 pv = (char*)SvRV(sv);
882 else if (mt == SVt_NV)
893 del_XPVIV(SvANY(sv));
903 del_XPVNV(SvANY(sv));
913 del_XPVMG(SvANY(sv));
916 Perl_croak(aTHX_ "Can't upgrade that kind of scalar");
921 Perl_croak(aTHX_ "Can't upgrade to undef");
923 SvANY(sv) = new_XIV();
927 SvANY(sv) = new_XNV();
931 SvANY(sv) = new_XRV();
935 SvANY(sv) = new_XPV();
941 SvANY(sv) = new_XPVIV();
951 SvANY(sv) = new_XPVNV();
959 SvANY(sv) = new_XPVMG();
969 SvANY(sv) = new_XPVLV();
983 SvANY(sv) = new_XPVAV();
998 SvANY(sv) = new_XPVHV();
1006 SvMAGIC(sv) = magic;
1007 SvSTASH(sv) = stash;
1014 SvANY(sv) = new_XPVCV();
1015 Zero(SvANY(sv), 1, XPVCV);
1021 SvMAGIC(sv) = magic;
1022 SvSTASH(sv) = stash;
1025 SvANY(sv) = new_XPVGV();
1031 SvMAGIC(sv) = magic;
1032 SvSTASH(sv) = stash;
1040 SvANY(sv) = new_XPVBM();
1046 SvMAGIC(sv) = magic;
1047 SvSTASH(sv) = stash;
1053 SvANY(sv) = new_XPVFM();
1054 Zero(SvANY(sv), 1, XPVFM);
1060 SvMAGIC(sv) = magic;
1061 SvSTASH(sv) = stash;
1064 SvANY(sv) = new_XPVIO();
1065 Zero(SvANY(sv), 1, XPVIO);
1071 SvMAGIC(sv) = magic;
1072 SvSTASH(sv) = stash;
1073 IoPAGE_LEN(sv) = 60;
1076 SvFLAGS(sv) &= ~SVTYPEMASK;
1082 Perl_sv_backoff(pTHX_ register SV *sv)
1086 char *s = SvPVX(sv);
1087 SvLEN(sv) += SvIVX(sv);
1088 SvPVX(sv) -= SvIVX(sv);
1090 Move(s, SvPVX(sv), SvCUR(sv)+1, char);
1092 SvFLAGS(sv) &= ~SVf_OOK;
1099 Expands the character buffer in the SV. This will use C<sv_unref> and will
1100 upgrade the SV to C<SVt_PV>. Returns a pointer to the character buffer.
1107 Perl_sv_grow(pTHX_ register SV *sv, register STRLEN newlen)
1111 #ifdef HAS_64K_LIMIT
1112 if (newlen >= 0x10000) {
1113 PerlIO_printf(Perl_debug_log,
1114 "Allocation too large: %"UVxf"\n", (UV)newlen);
1117 #endif /* HAS_64K_LIMIT */
1120 if (SvTYPE(sv) < SVt_PV) {
1121 sv_upgrade(sv, SVt_PV);
1124 else if (SvOOK(sv)) { /* pv is offset? */
1127 if (newlen > SvLEN(sv))
1128 newlen += 10 * (newlen - SvCUR(sv)); /* avoid copy each time */
1129 #ifdef HAS_64K_LIMIT
1130 if (newlen >= 0x10000)
1136 if (newlen > SvLEN(sv)) { /* need more room? */
1137 if (SvLEN(sv) && s) {
1138 #if defined(MYMALLOC) && !defined(LEAKTEST)
1139 STRLEN l = malloced_size((void*)SvPVX(sv));
1145 Renew(s,newlen,char);
1148 New(703,s,newlen,char);
1150 SvLEN_set(sv, newlen);
1156 =for apidoc sv_setiv
1158 Copies an integer into the given SV. Does not handle 'set' magic. See
1165 Perl_sv_setiv(pTHX_ register SV *sv, IV i)
1167 SV_CHECK_THINKFIRST(sv);
1168 switch (SvTYPE(sv)) {
1170 sv_upgrade(sv, SVt_IV);
1173 sv_upgrade(sv, SVt_PVNV);
1177 sv_upgrade(sv, SVt_PVIV);
1188 Perl_croak(aTHX_ "Can't coerce %s to integer in %s", sv_reftype(sv,0),
1189 PL_op_desc[PL_op->op_type]);
1192 (void)SvIOK_only(sv); /* validate number */
1198 =for apidoc sv_setiv_mg
1200 Like C<sv_setiv>, but also handles 'set' magic.
1206 Perl_sv_setiv_mg(pTHX_ register SV *sv, IV i)
1213 =for apidoc sv_setuv
1215 Copies an unsigned integer into the given SV. Does not handle 'set' magic.
1222 Perl_sv_setuv(pTHX_ register SV *sv, UV u)
1230 =for apidoc sv_setuv_mg
1232 Like C<sv_setuv>, but also handles 'set' magic.
1238 Perl_sv_setuv_mg(pTHX_ register SV *sv, UV u)
1245 =for apidoc sv_setnv
1247 Copies a double into the given SV. Does not handle 'set' magic. See
1254 Perl_sv_setnv(pTHX_ register SV *sv, NV num)
1256 SV_CHECK_THINKFIRST(sv);
1257 switch (SvTYPE(sv)) {
1260 sv_upgrade(sv, SVt_NV);
1265 sv_upgrade(sv, SVt_PVNV);
1276 Perl_croak(aTHX_ "Can't coerce %s to number in %s", sv_reftype(sv,0),
1277 PL_op_name[PL_op->op_type]);
1281 (void)SvNOK_only(sv); /* validate number */
1286 =for apidoc sv_setnv_mg
1288 Like C<sv_setnv>, but also handles 'set' magic.
1294 Perl_sv_setnv_mg(pTHX_ register SV *sv, NV num)
1301 S_not_a_number(pTHX_ SV *sv)
1307 char *limit = tmpbuf + sizeof(tmpbuf) - 8;
1308 /* each *s can expand to 4 chars + "...\0",
1309 i.e. need room for 8 chars */
1311 for (s = SvPVX(sv); *s && d < limit; s++) {
1313 if (ch & 128 && !isPRINT_LC(ch)) {
1322 else if (ch == '\r') {
1326 else if (ch == '\f') {
1330 else if (ch == '\\') {
1334 else if (isPRINT_LC(ch))
1349 Perl_warner(aTHX_ WARN_NUMERIC,
1350 "Argument \"%s\" isn't numeric in %s", tmpbuf,
1351 PL_op_desc[PL_op->op_type]);
1353 Perl_warner(aTHX_ WARN_NUMERIC,
1354 "Argument \"%s\" isn't numeric", tmpbuf);
1357 /* the number can be converted to integer with atol() or atoll() */
1358 #define IS_NUMBER_TO_INT_BY_ATOL 0x01
1359 #define IS_NUMBER_TO_INT_BY_ATOF 0x02 /* atol() may be != atof() */
1360 #define IS_NUMBER_NOT_IV 0x04 /* (IV)atof() may be != atof() */
1361 #define IS_NUMBER_NEG 0x08 /* not good to cache UV */
1363 /* Actually, ISO C leaves conversion of UV to IV undefined, but
1364 until proven guilty, assume that things are not that bad... */
1367 Perl_sv_2iv(pTHX_ register SV *sv)
1371 if (SvGMAGICAL(sv)) {
1376 return I_V(SvNVX(sv));
1378 if (SvPOKp(sv) && SvLEN(sv))
1381 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
1383 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
1389 if (SvTHINKFIRST(sv)) {
1392 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv, numer)))
1393 return SvIV(tmpstr);
1394 return PTR2IV(SvRV(sv));
1396 if (SvREADONLY(sv) && !SvOK(sv)) {
1398 if (ckWARN(WARN_UNINITIALIZED))
1405 return (IV)(SvUVX(sv));
1412 /* We can cache the IV/UV value even if it not good enough
1413 * to reconstruct NV, since the conversion to PV will prefer
1417 if (SvTYPE(sv) == SVt_NV)
1418 sv_upgrade(sv, SVt_PVNV);
1421 if (SvNVX(sv) < (NV)IV_MAX + 0.5)
1422 SvIVX(sv) = I_V(SvNVX(sv));
1424 SvUVX(sv) = U_V(SvNVX(sv));
1427 DEBUG_c(PerlIO_printf(Perl_debug_log,
1428 "0x%"UVxf" 2iv(%"UVuf" => %"IVdf") (as unsigned)\n",
1432 return (IV)SvUVX(sv);
1435 else if (SvPOKp(sv) && SvLEN(sv)) {
1436 I32 numtype = looks_like_number(sv);
1438 /* We want to avoid a possible problem when we cache an IV which
1439 may be later translated to an NV, and the resulting NV is not
1440 the translation of the initial data.
1442 This means that if we cache such an IV, we need to cache the
1443 NV as well. Moreover, we trade speed for space, and do not
1444 cache the NV if not needed.
1446 if (numtype & IS_NUMBER_NOT_IV) {
1447 /* May be not an integer. Need to cache NV if we cache IV
1448 * - otherwise future conversion to NV will be wrong. */
1451 d = Atof(SvPVX(sv));
1453 if (SvTYPE(sv) < SVt_PVNV)
1454 sv_upgrade(sv, SVt_PVNV);
1458 #if defined(USE_LONG_DOUBLE)
1459 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2nv(%" PERL_PRIgldbl ")\n",
1460 PTR2UV(sv), SvNVX(sv)));
1462 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2nv(%g)\n",
1463 PTR2UV(sv), SvNVX(sv)));
1465 if (SvNVX(sv) < (NV)IV_MAX + 0.5)
1466 SvIVX(sv) = I_V(SvNVX(sv));
1468 SvUVX(sv) = U_V(SvNVX(sv));
1474 /* The NV may be reconstructed from IV - safe to cache IV,
1475 which may be calculated by atol(). */
1476 if (SvTYPE(sv) == SVt_PV)
1477 sv_upgrade(sv, SVt_PVIV);
1479 SvIVX(sv) = Atol(SvPVX(sv));
1481 else { /* Not a number. Cache 0. */
1484 if (SvTYPE(sv) < SVt_PVIV)
1485 sv_upgrade(sv, SVt_PVIV);
1488 if (ckWARN(WARN_NUMERIC))
1494 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing && !(SvFLAGS(sv) & SVs_PADTMP))
1496 if (SvTYPE(sv) < SVt_IV)
1497 /* Typically the caller expects that sv_any is not NULL now. */
1498 sv_upgrade(sv, SVt_IV);
1501 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2iv(%"IVdf")\n",
1502 PTR2UV(sv),SvIVX(sv)));
1503 return SvIsUV(sv) ? (IV)SvUVX(sv) : SvIVX(sv);
1507 Perl_sv_2uv(pTHX_ register SV *sv)
1511 if (SvGMAGICAL(sv)) {
1516 return U_V(SvNVX(sv));
1517 if (SvPOKp(sv) && SvLEN(sv))
1520 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
1522 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
1528 if (SvTHINKFIRST(sv)) {
1531 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv, numer)))
1532 return SvUV(tmpstr);
1533 return PTR2UV(SvRV(sv));
1535 if (SvREADONLY(sv) && !SvOK(sv)) {
1537 if (ckWARN(WARN_UNINITIALIZED))
1547 return (UV)SvIVX(sv);
1551 /* We can cache the IV/UV value even if it not good enough
1552 * to reconstruct NV, since the conversion to PV will prefer
1555 if (SvTYPE(sv) == SVt_NV)
1556 sv_upgrade(sv, SVt_PVNV);
1558 if (SvNVX(sv) >= -0.5) {
1560 SvUVX(sv) = U_V(SvNVX(sv));
1563 SvIVX(sv) = I_V(SvNVX(sv));
1565 DEBUG_c(PerlIO_printf(Perl_debug_log,
1566 "0x%"UVxf" 2uv(%"IVdf" => %"IVdf") (as signed)\n",
1569 (IV)(UV)SvIVX(sv)));
1570 return (UV)SvIVX(sv);
1573 else if (SvPOKp(sv) && SvLEN(sv)) {
1574 I32 numtype = looks_like_number(sv);
1576 /* We want to avoid a possible problem when we cache a UV which
1577 may be later translated to an NV, and the resulting NV is not
1578 the translation of the initial data.
1580 This means that if we cache such a UV, we need to cache the
1581 NV as well. Moreover, we trade speed for space, and do not
1582 cache the NV if not needed.
1584 if (numtype & IS_NUMBER_NOT_IV) {
1585 /* May be not an integer. Need to cache NV if we cache IV
1586 * - otherwise future conversion to NV will be wrong. */
1589 d = Atof(SvPVX(sv));
1591 if (SvTYPE(sv) < SVt_PVNV)
1592 sv_upgrade(sv, SVt_PVNV);
1596 #if defined(USE_LONG_DOUBLE)
1597 DEBUG_c(PerlIO_printf(Perl_debug_log,
1598 "0x%"UVxf" 2nv(%" PERL_PRIgldbl ")\n",
1599 PTR2UV(sv), SvNVX(sv)));
1601 DEBUG_c(PerlIO_printf(Perl_debug_log,
1602 "0x%"UVxf" 2nv(%g)\n",
1603 PTR2UV(sv), SvNVX(sv)));
1605 if (SvNVX(sv) < -0.5) {
1606 SvIVX(sv) = I_V(SvNVX(sv));
1609 SvUVX(sv) = U_V(SvNVX(sv));
1613 else if (numtype & IS_NUMBER_NEG) {
1614 /* The NV may be reconstructed from IV - safe to cache IV,
1615 which may be calculated by atol(). */
1616 if (SvTYPE(sv) == SVt_PV)
1617 sv_upgrade(sv, SVt_PVIV);
1619 SvIVX(sv) = (IV)Atol(SvPVX(sv));
1621 else if (numtype) { /* Non-negative */
1622 /* The NV may be reconstructed from UV - safe to cache UV,
1623 which may be calculated by strtoul()/atol. */
1624 if (SvTYPE(sv) == SVt_PV)
1625 sv_upgrade(sv, SVt_PVIV);
1627 (void)SvIsUV_on(sv);
1629 SvUVX(sv) = Strtoul(SvPVX(sv), Null(char**), 10);
1630 #else /* no atou(), but we know the number fits into IV... */
1631 /* The only problem may be if it is negative... */
1632 SvUVX(sv) = (UV)Atol(SvPVX(sv));
1635 else { /* Not a number. Cache 0. */
1638 if (SvTYPE(sv) < SVt_PVIV)
1639 sv_upgrade(sv, SVt_PVIV);
1640 SvUVX(sv) = 0; /* We assume that 0s have the
1641 same bitmap in IV and UV. */
1643 (void)SvIsUV_on(sv);
1644 if (ckWARN(WARN_NUMERIC))
1649 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
1651 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
1654 if (SvTYPE(sv) < SVt_IV)
1655 /* Typically the caller expects that sv_any is not NULL now. */
1656 sv_upgrade(sv, SVt_IV);
1660 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2uv(%"UVuf")\n",
1661 PTR2UV(sv),SvUVX(sv)));
1662 return SvIsUV(sv) ? SvUVX(sv) : (UV)SvIVX(sv);
1666 Perl_sv_2nv(pTHX_ register SV *sv)
1670 if (SvGMAGICAL(sv)) {
1674 if (SvPOKp(sv) && SvLEN(sv)) {
1676 if (ckWARN(WARN_NUMERIC) && !SvIOKp(sv) && !looks_like_number(sv))
1678 return Atof(SvPVX(sv));
1682 return (NV)SvUVX(sv);
1684 return (NV)SvIVX(sv);
1687 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
1689 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
1695 if (SvTHINKFIRST(sv)) {
1698 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv,numer)))
1699 return SvNV(tmpstr);
1700 return PTR2NV(SvRV(sv));
1702 if (SvREADONLY(sv) && !SvOK(sv)) {
1704 if (ckWARN(WARN_UNINITIALIZED))
1709 if (SvTYPE(sv) < SVt_NV) {
1710 if (SvTYPE(sv) == SVt_IV)
1711 sv_upgrade(sv, SVt_PVNV);
1713 sv_upgrade(sv, SVt_NV);
1714 #if defined(USE_LONG_DOUBLE)
1716 RESTORE_NUMERIC_STANDARD();
1717 PerlIO_printf(Perl_debug_log,
1718 "0x%"UVxf" num(%" PERL_PRIgldbl ")\n",
1719 PTR2UV(sv), SvNVX(sv));
1720 RESTORE_NUMERIC_LOCAL();
1724 RESTORE_NUMERIC_STANDARD();
1725 PerlIO_printf(Perl_debug_log, "0x%"UVxf" num(%g)\n",
1726 PTR2UV(sv), SvNVX(sv));
1727 RESTORE_NUMERIC_LOCAL();
1731 else if (SvTYPE(sv) < SVt_PVNV)
1732 sv_upgrade(sv, SVt_PVNV);
1734 (!SvPOKp(sv) || !strchr(SvPVX(sv),'.') || !looks_like_number(sv)))
1736 SvNVX(sv) = SvIsUV(sv) ? (NV)SvUVX(sv) : (NV)SvIVX(sv);
1738 else if (SvPOKp(sv) && SvLEN(sv)) {
1740 if (ckWARN(WARN_NUMERIC) && !SvIOKp(sv) && !looks_like_number(sv))
1742 SvNVX(sv) = Atof(SvPVX(sv));
1746 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing && !(SvFLAGS(sv) & SVs_PADTMP))
1748 if (SvTYPE(sv) < SVt_NV)
1749 /* Typically the caller expects that sv_any is not NULL now. */
1750 sv_upgrade(sv, SVt_NV);
1754 #if defined(USE_LONG_DOUBLE)
1756 RESTORE_NUMERIC_STANDARD();
1757 PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2nv(%" PERL_PRIgldbl ")\n",
1758 PTR2UV(sv), SvNVX(sv));
1759 RESTORE_NUMERIC_LOCAL();
1763 RESTORE_NUMERIC_STANDARD();
1764 PerlIO_printf(Perl_debug_log, "0x%"UVxf" 1nv(%g)\n",
1765 PTR2UV(sv), SvNVX(sv));
1766 RESTORE_NUMERIC_LOCAL();
1773 S_asIV(pTHX_ SV *sv)
1775 I32 numtype = looks_like_number(sv);
1778 if (numtype & IS_NUMBER_TO_INT_BY_ATOL)
1779 return Atol(SvPVX(sv));
1782 if (ckWARN(WARN_NUMERIC))
1785 d = Atof(SvPVX(sv));
1790 S_asUV(pTHX_ SV *sv)
1792 I32 numtype = looks_like_number(sv);
1795 if (numtype & IS_NUMBER_TO_INT_BY_ATOL)
1796 return Strtoul(SvPVX(sv), Null(char**), 10);
1800 if (ckWARN(WARN_NUMERIC))
1803 return U_V(Atof(SvPVX(sv)));
1807 * Returns a combination of (advisory only - can get false negatives)
1808 * IS_NUMBER_TO_INT_BY_ATOL, IS_NUMBER_TO_INT_BY_ATOF, IS_NUMBER_NOT_IV,
1810 * 0 if does not look like number.
1812 * In fact possible values are 0 and
1813 * IS_NUMBER_TO_INT_BY_ATOL 123
1814 * IS_NUMBER_TO_INT_BY_ATOL | IS_NUMBER_NOT_IV 123.1
1815 * IS_NUMBER_TO_INT_BY_ATOF | IS_NUMBER_NOT_IV 123e0
1816 * with a possible addition of IS_NUMBER_NEG.
1820 =for apidoc looks_like_number
1822 Test if an the content of an SV looks like a number (or is a
1829 Perl_looks_like_number(pTHX_ SV *sv)
1832 register char *send;
1833 register char *sbegin;
1834 register char *nbegin;
1842 else if (SvPOKp(sv))
1843 sbegin = SvPV(sv, len);
1846 send = sbegin + len;
1853 numtype = IS_NUMBER_NEG;
1860 * we return IS_NUMBER_TO_INT_BY_ATOL if the number can be converted
1861 * to _integer_ with atol() and IS_NUMBER_TO_INT_BY_ATOF if you need
1865 /* next must be digit or the radix separator */
1869 } while (isDIGIT(*s));
1871 if (s - nbegin >= TYPE_DIGITS(IV)) /* Cannot cache ato[ul]() */
1872 numtype |= IS_NUMBER_TO_INT_BY_ATOF | IS_NUMBER_NOT_IV;
1874 numtype |= IS_NUMBER_TO_INT_BY_ATOL;
1877 #ifdef USE_LOCALE_NUMERIC
1878 || IS_NUMERIC_RADIX(*s)
1882 numtype |= IS_NUMBER_NOT_IV;
1883 while (isDIGIT(*s)) /* optional digits after the radix */
1888 #ifdef USE_LOCALE_NUMERIC
1889 || IS_NUMERIC_RADIX(*s)
1893 numtype |= IS_NUMBER_TO_INT_BY_ATOL | IS_NUMBER_NOT_IV;
1894 /* no digits before the radix means we need digits after it */
1898 } while (isDIGIT(*s));
1906 /* we can have an optional exponent part */
1907 if (*s == 'e' || *s == 'E') {
1908 numtype &= ~IS_NUMBER_NEG;
1909 numtype |= IS_NUMBER_TO_INT_BY_ATOF | IS_NUMBER_NOT_IV;
1911 if (*s == '+' || *s == '-')
1916 } while (isDIGIT(*s));
1925 if (len == 10 && memEQ(sbegin, "0 but true", 10))
1926 return IS_NUMBER_TO_INT_BY_ATOL;
1931 Perl_sv_2pv_nolen(pTHX_ register SV *sv)
1934 return sv_2pv(sv, &n_a);
1937 /* We assume that buf is at least TYPE_CHARS(UV) long. */
1939 uiv_2buf(char *buf, IV iv, UV uv, int is_uv, char **peob)
1942 char *ptr = buf + TYPE_CHARS(UV);
1957 *--ptr = '0' + (uv % 10);
1966 Perl_sv_2pv(pTHX_ register SV *sv, STRLEN *lp)
1971 char tbuf[64]; /* Must fit sprintf/Gconvert of longest IV/NV */
1972 char *tmpbuf = tbuf;
1978 if (SvGMAGICAL(sv)) {
1986 (void)sprintf(tmpbuf,"%"UVuf, (UV)SvUVX(sv));
1988 (void)sprintf(tmpbuf,"%"IVdf, (IV)SvIVX(sv));
1993 Gconvert(SvNVX(sv), NV_DIG, 0, tmpbuf);
1998 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
2000 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
2007 if (SvTHINKFIRST(sv)) {
2010 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv,string)))
2011 return SvPV(tmpstr,*lp);
2018 switch (SvTYPE(sv)) {
2020 if ( ((SvFLAGS(sv) &
2021 (SVs_OBJECT|SVf_OK|SVs_GMG|SVs_SMG|SVs_RMG))
2022 == (SVs_OBJECT|SVs_RMG))
2023 && strEQ(s=HvNAME(SvSTASH(sv)), "Regexp")
2024 && (mg = mg_find(sv, 'r'))) {
2026 regexp *re = (regexp *)mg->mg_obj;
2029 char *fptr = "msix";
2034 U16 reganch = (re->reganch & PMf_COMPILETIME) >> 12;
2036 while(ch = *fptr++) {
2038 reflags[left++] = ch;
2041 reflags[right--] = ch;
2046 reflags[left] = '-';
2050 mg->mg_len = re->prelen + 4 + left;
2051 New(616, mg->mg_ptr, mg->mg_len + 1 + left, char);
2052 Copy("(?", mg->mg_ptr, 2, char);
2053 Copy(reflags, mg->mg_ptr+2, left, char);
2054 Copy(":", mg->mg_ptr+left+2, 1, char);
2055 Copy(re->precomp, mg->mg_ptr+3+left, re->prelen, char);
2056 mg->mg_ptr[mg->mg_len - 1] = ')';
2057 mg->mg_ptr[mg->mg_len] = 0;
2059 PL_reginterp_cnt += re->program[0].next_off;
2071 case SVt_PVBM: s = "SCALAR"; break;
2072 case SVt_PVLV: s = "LVALUE"; break;
2073 case SVt_PVAV: s = "ARRAY"; break;
2074 case SVt_PVHV: s = "HASH"; break;
2075 case SVt_PVCV: s = "CODE"; break;
2076 case SVt_PVGV: s = "GLOB"; break;
2077 case SVt_PVFM: s = "FORMAT"; break;
2078 case SVt_PVIO: s = "IO"; break;
2079 default: s = "UNKNOWN"; break;
2083 Perl_sv_setpvf(aTHX_ tsv, "%s=%s", HvNAME(SvSTASH(sv)), s);
2086 Perl_sv_catpvf(aTHX_ tsv, "(0x%"UVxf")", PTR2UV(sv));
2092 if (SvREADONLY(sv) && !SvOK(sv)) {
2094 if (ckWARN(WARN_UNINITIALIZED))
2100 if (SvNOKp(sv)) { /* See note in sv_2uv() */
2101 /* XXXX 64-bit? IV may have better precision... */
2102 /* I tried changing this for to be 64-bit-aware and
2103 * the t/op/numconvert.t became very, very, angry.
2105 if (SvTYPE(sv) < SVt_PVNV)
2106 sv_upgrade(sv, SVt_PVNV);
2109 olderrno = errno; /* some Xenix systems wipe out errno here */
2111 if (SvNVX(sv) == 0.0)
2112 (void)strcpy(s,"0");
2116 Gconvert(SvNVX(sv), NV_DIG, 0, s);
2119 #ifdef FIXNEGATIVEZERO
2120 if (*s == '-' && s[1] == '0' && !s[2])
2129 else if (SvIOKp(sv)) {
2130 U32 isIOK = SvIOK(sv);
2131 U32 isUIOK = SvIsUV(sv);
2132 char buf[TYPE_CHARS(UV)];
2135 if (SvTYPE(sv) < SVt_PVIV)
2136 sv_upgrade(sv, SVt_PVIV);
2138 ptr = uiv_2buf(buf, 0, SvUVX(sv), 1, &ebuf);
2140 ptr = uiv_2buf(buf, SvIVX(sv), 0, 0, &ebuf);
2141 SvGROW(sv, ebuf - ptr + 1); /* inlined from sv_setpvn */
2142 Move(ptr,SvPVX(sv),ebuf - ptr,char);
2143 SvCUR_set(sv, ebuf - ptr);
2156 if (ckWARN(WARN_UNINITIALIZED)
2157 && !PL_localizing && !(SvFLAGS(sv) & SVs_PADTMP))
2162 if (SvTYPE(sv) < SVt_PV)
2163 /* Typically the caller expects that sv_any is not NULL now. */
2164 sv_upgrade(sv, SVt_PV);
2167 *lp = s - SvPVX(sv);
2170 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2pv(%s)\n",
2171 PTR2UV(sv),SvPVX(sv)));
2175 if (SvROK(sv)) { /* XXX Skip this when sv_pvn_force calls */
2176 /* Sneaky stuff here */
2180 tsv = newSVpv(tmpbuf, 0);
2196 len = strlen(tmpbuf);
2198 #ifdef FIXNEGATIVEZERO
2199 if (len == 2 && t[0] == '-' && t[1] == '0') {
2204 (void)SvUPGRADE(sv, SVt_PV);
2206 s = SvGROW(sv, len + 1);
2215 Perl_sv_2pvbyte_nolen(pTHX_ register SV *sv)
2217 return sv_2pv_nolen(sv);
2221 Perl_sv_2pvbyte(pTHX_ register SV *sv, STRLEN *lp)
2223 return sv_2pv(sv,lp);
2227 Perl_sv_2pvutf8_nolen(pTHX_ register SV *sv)
2229 return sv_2pv_nolen(sv);
2233 Perl_sv_2pvutf8(pTHX_ register SV *sv, STRLEN *lp)
2235 return sv_2pv(sv,lp);
2238 /* This function is only called on magical items */
2240 Perl_sv_2bool(pTHX_ register SV *sv)
2250 if (SvAMAGIC(sv) && (tmpsv = AMG_CALLun(sv,bool_)))
2251 return SvTRUE(tmpsv);
2252 return SvRV(sv) != 0;
2255 register XPV* Xpvtmp;
2256 if ((Xpvtmp = (XPV*)SvANY(sv)) &&
2257 (*Xpvtmp->xpv_pv > '0' ||
2258 Xpvtmp->xpv_cur > 1 ||
2259 (Xpvtmp->xpv_cur && *Xpvtmp->xpv_pv != '0')))
2266 return SvIVX(sv) != 0;
2269 return SvNVX(sv) != 0.0;
2276 /* Note: sv_setsv() should not be called with a source string that needs
2277 * to be reused, since it may destroy the source string if it is marked
2282 =for apidoc sv_setsv
2284 Copies the contents of the source SV C<ssv> into the destination SV C<dsv>.
2285 The source SV may be destroyed if it is mortal. Does not handle 'set'
2286 magic. See the macro forms C<SvSetSV>, C<SvSetSV_nosteal> and
2293 Perl_sv_setsv(pTHX_ SV *dstr, register SV *sstr)
2296 register U32 sflags;
2302 SV_CHECK_THINKFIRST(dstr);
2304 sstr = &PL_sv_undef;
2305 stype = SvTYPE(sstr);
2306 dtype = SvTYPE(dstr);
2310 /* There's a lot of redundancy below but we're going for speed here */
2315 if (dtype != SVt_PVGV) {
2316 (void)SvOK_off(dstr);
2324 sv_upgrade(dstr, SVt_IV);
2327 sv_upgrade(dstr, SVt_PVNV);
2331 sv_upgrade(dstr, SVt_PVIV);
2334 (void)SvIOK_only(dstr);
2335 SvIVX(dstr) = SvIVX(sstr);
2348 sv_upgrade(dstr, SVt_NV);
2353 sv_upgrade(dstr, SVt_PVNV);
2356 SvNVX(dstr) = SvNVX(sstr);
2357 (void)SvNOK_only(dstr);
2365 sv_upgrade(dstr, SVt_RV);
2366 else if (dtype == SVt_PVGV &&
2367 SvTYPE(SvRV(sstr)) == SVt_PVGV) {
2370 if (GvIMPORTED(dstr) != GVf_IMPORTED
2371 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
2373 GvIMPORTED_on(dstr);
2384 sv_upgrade(dstr, SVt_PV);
2387 if (dtype < SVt_PVIV)
2388 sv_upgrade(dstr, SVt_PVIV);
2391 if (dtype < SVt_PVNV)
2392 sv_upgrade(dstr, SVt_PVNV);
2399 Perl_croak(aTHX_ "Bizarre copy of %s in %s", sv_reftype(sstr, 0),
2400 PL_op_name[PL_op->op_type]);
2402 Perl_croak(aTHX_ "Bizarre copy of %s", sv_reftype(sstr, 0));
2406 if (dtype <= SVt_PVGV) {
2408 if (dtype != SVt_PVGV) {
2409 char *name = GvNAME(sstr);
2410 STRLEN len = GvNAMELEN(sstr);
2411 sv_upgrade(dstr, SVt_PVGV);
2412 sv_magic(dstr, dstr, '*', name, len);
2413 GvSTASH(dstr) = (HV*)SvREFCNT_inc(GvSTASH(sstr));
2414 GvNAME(dstr) = savepvn(name, len);
2415 GvNAMELEN(dstr) = len;
2416 SvFAKE_on(dstr); /* can coerce to non-glob */
2418 /* ahem, death to those who redefine active sort subs */
2419 else if (PL_curstackinfo->si_type == PERLSI_SORT
2420 && GvCV(dstr) && PL_sortcop == CvSTART(GvCV(dstr)))
2421 Perl_croak(aTHX_ "Can't redefine active sort subroutine %s",
2423 (void)SvOK_off(dstr);
2424 GvINTRO_off(dstr); /* one-shot flag */
2426 GvGP(dstr) = gp_ref(GvGP(sstr));
2428 if (GvIMPORTED(dstr) != GVf_IMPORTED
2429 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
2431 GvIMPORTED_on(dstr);
2439 if (SvGMAGICAL(sstr)) {
2441 if (SvTYPE(sstr) != stype) {
2442 stype = SvTYPE(sstr);
2443 if (stype == SVt_PVGV && dtype <= SVt_PVGV)
2447 if (stype == SVt_PVLV)
2448 (void)SvUPGRADE(dstr, SVt_PVNV);
2450 (void)SvUPGRADE(dstr, stype);
2453 sflags = SvFLAGS(sstr);
2455 if (sflags & SVf_ROK) {
2456 if (dtype >= SVt_PV) {
2457 if (dtype == SVt_PVGV) {
2458 SV *sref = SvREFCNT_inc(SvRV(sstr));
2460 int intro = GvINTRO(dstr);
2465 GvINTRO_off(dstr); /* one-shot flag */
2466 Newz(602,gp, 1, GP);
2467 GvGP(dstr) = gp_ref(gp);
2468 GvSV(dstr) = NEWSV(72,0);
2469 GvLINE(dstr) = CopLINE(PL_curcop);
2470 GvEGV(dstr) = (GV*)dstr;
2473 switch (SvTYPE(sref)) {
2476 SAVESPTR(GvAV(dstr));
2478 dref = (SV*)GvAV(dstr);
2479 GvAV(dstr) = (AV*)sref;
2480 if (GvIMPORTED_AV_off(dstr)
2481 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
2483 GvIMPORTED_AV_on(dstr);
2488 SAVESPTR(GvHV(dstr));
2490 dref = (SV*)GvHV(dstr);
2491 GvHV(dstr) = (HV*)sref;
2492 if (GvIMPORTED_HV_off(dstr)
2493 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
2495 GvIMPORTED_HV_on(dstr);
2500 if (GvCVGEN(dstr) && GvCV(dstr) != (CV*)sref) {
2501 SvREFCNT_dec(GvCV(dstr));
2502 GvCV(dstr) = Nullcv;
2503 GvCVGEN(dstr) = 0; /* Switch off cacheness. */
2504 PL_sub_generation++;
2506 SAVESPTR(GvCV(dstr));
2509 dref = (SV*)GvCV(dstr);
2510 if (GvCV(dstr) != (CV*)sref) {
2511 CV* cv = GvCV(dstr);
2513 if (!GvCVGEN((GV*)dstr) &&
2514 (CvROOT(cv) || CvXSUB(cv)))
2516 SV *const_sv = cv_const_sv(cv);
2517 bool const_changed = TRUE;
2519 const_changed = sv_cmp(const_sv,
2520 op_const_sv(CvSTART((CV*)sref),
2522 /* ahem, death to those who redefine
2523 * active sort subs */
2524 if (PL_curstackinfo->si_type == PERLSI_SORT &&
2525 PL_sortcop == CvSTART(cv))
2527 "Can't redefine active sort subroutine %s",
2528 GvENAME((GV*)dstr));
2529 if (ckWARN(WARN_REDEFINE) || (const_changed && const_sv)) {
2530 if (!(CvGV(cv) && GvSTASH(CvGV(cv))
2531 && HvNAME(GvSTASH(CvGV(cv)))
2532 && strEQ(HvNAME(GvSTASH(CvGV(cv))),
2534 Perl_warner(aTHX_ WARN_REDEFINE, const_sv ?
2535 "Constant subroutine %s redefined"
2536 : "Subroutine %s redefined",
2537 GvENAME((GV*)dstr));
2540 cv_ckproto(cv, (GV*)dstr,
2541 SvPOK(sref) ? SvPVX(sref) : Nullch);
2543 GvCV(dstr) = (CV*)sref;
2544 GvCVGEN(dstr) = 0; /* Switch off cacheness. */
2545 GvASSUMECV_on(dstr);
2546 PL_sub_generation++;
2548 if (GvIMPORTED_CV_off(dstr)
2549 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
2551 GvIMPORTED_CV_on(dstr);
2556 SAVESPTR(GvIOp(dstr));
2558 dref = (SV*)GvIOp(dstr);
2559 GvIOp(dstr) = (IO*)sref;
2563 SAVESPTR(GvSV(dstr));
2565 dref = (SV*)GvSV(dstr);
2567 if (GvIMPORTED_SV_off(dstr)
2568 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
2570 GvIMPORTED_SV_on(dstr);
2582 (void)SvOOK_off(dstr); /* backoff */
2584 Safefree(SvPVX(dstr));
2585 SvLEN(dstr)=SvCUR(dstr)=0;
2588 (void)SvOK_off(dstr);
2589 SvRV(dstr) = SvREFCNT_inc(SvRV(sstr));
2591 if (sflags & SVp_NOK) {
2593 SvNVX(dstr) = SvNVX(sstr);
2595 if (sflags & SVp_IOK) {
2596 (void)SvIOK_on(dstr);
2597 SvIVX(dstr) = SvIVX(sstr);
2601 if (SvAMAGIC(sstr)) {
2605 else if (sflags & SVp_POK) {
2608 * Check to see if we can just swipe the string. If so, it's a
2609 * possible small lose on short strings, but a big win on long ones.
2610 * It might even be a win on short strings if SvPVX(dstr)
2611 * has to be allocated and SvPVX(sstr) has to be freed.
2614 if (SvTEMP(sstr) && /* slated for free anyway? */
2615 SvREFCNT(sstr) == 1 && /* and no other references to it? */
2616 !(sflags & SVf_OOK)) /* and not involved in OOK hack? */
2618 if (SvPVX(dstr)) { /* we know that dtype >= SVt_PV */
2620 SvFLAGS(dstr) &= ~SVf_OOK;
2621 Safefree(SvPVX(dstr) - SvIVX(dstr));
2623 else if (SvLEN(dstr))
2624 Safefree(SvPVX(dstr));
2626 (void)SvPOK_only(dstr);
2627 SvPV_set(dstr, SvPVX(sstr));
2628 SvLEN_set(dstr, SvLEN(sstr));
2629 SvCUR_set(dstr, SvCUR(sstr));
2631 (void)SvOK_off(sstr);
2632 SvPV_set(sstr, Nullch);
2637 else { /* have to copy actual string */
2638 STRLEN len = SvCUR(sstr);
2640 SvGROW(dstr, len + 1); /* inlined from sv_setpvn */
2641 Move(SvPVX(sstr),SvPVX(dstr),len,char);
2642 SvCUR_set(dstr, len);
2643 *SvEND(dstr) = '\0';
2644 (void)SvPOK_only(dstr);
2649 if (sflags & SVp_NOK) {
2651 SvNVX(dstr) = SvNVX(sstr);
2653 if (sflags & SVp_IOK) {
2654 (void)SvIOK_on(dstr);
2655 SvIVX(dstr) = SvIVX(sstr);
2660 else if (sflags & SVp_NOK) {
2661 SvNVX(dstr) = SvNVX(sstr);
2662 (void)SvNOK_only(dstr);
2664 (void)SvIOK_on(dstr);
2665 SvIVX(dstr) = SvIVX(sstr);
2666 /* XXXX Do we want to set IsUV for IV(ROK)? Be extra safe... */
2671 else if (sflags & SVp_IOK) {
2672 (void)SvIOK_only(dstr);
2673 SvIVX(dstr) = SvIVX(sstr);
2678 if (dtype == SVt_PVGV) {
2679 if (ckWARN(WARN_UNSAFE))
2680 Perl_warner(aTHX_ WARN_UNSAFE, "Undefined value assigned to typeglob");
2683 (void)SvOK_off(dstr);
2689 =for apidoc sv_setsv_mg
2691 Like C<sv_setsv>, but also handles 'set' magic.
2697 Perl_sv_setsv_mg(pTHX_ SV *dstr, register SV *sstr)
2699 sv_setsv(dstr,sstr);
2704 =for apidoc sv_setpvn
2706 Copies a string into an SV. The C<len> parameter indicates the number of
2707 bytes to be copied. Does not handle 'set' magic. See C<sv_setpvn_mg>.
2713 Perl_sv_setpvn(pTHX_ register SV *sv, register const char *ptr, register STRLEN len)
2715 register char *dptr;
2716 assert(len >= 0); /* STRLEN is probably unsigned, so this may
2717 elicit a warning, but it won't hurt. */
2718 SV_CHECK_THINKFIRST(sv);
2723 (void)SvUPGRADE(sv, SVt_PV);
2725 SvGROW(sv, len + 1);
2727 Move(ptr,dptr,len,char);
2730 (void)SvPOK_only(sv); /* validate pointer */
2735 =for apidoc sv_setpvn_mg
2737 Like C<sv_setpvn>, but also handles 'set' magic.
2743 Perl_sv_setpvn_mg(pTHX_ register SV *sv, register const char *ptr, register STRLEN len)
2745 sv_setpvn(sv,ptr,len);
2750 =for apidoc sv_setpv
2752 Copies a string into an SV. The string must be null-terminated. Does not
2753 handle 'set' magic. See C<sv_setpv_mg>.
2759 Perl_sv_setpv(pTHX_ register SV *sv, register const char *ptr)
2761 register STRLEN len;
2763 SV_CHECK_THINKFIRST(sv);
2769 (void)SvUPGRADE(sv, SVt_PV);
2771 SvGROW(sv, len + 1);
2772 Move(ptr,SvPVX(sv),len+1,char);
2774 (void)SvPOK_only(sv); /* validate pointer */
2779 =for apidoc sv_setpv_mg
2781 Like C<sv_setpv>, but also handles 'set' magic.
2787 Perl_sv_setpv_mg(pTHX_ register SV *sv, register const char *ptr)
2794 =for apidoc sv_usepvn
2796 Tells an SV to use C<ptr> to find its string value. Normally the string is
2797 stored inside the SV but sv_usepvn allows the SV to use an outside string.
2798 The C<ptr> should point to memory that was allocated by C<malloc>. The
2799 string length, C<len>, must be supplied. This function will realloc the
2800 memory pointed to by C<ptr>, so that pointer should not be freed or used by
2801 the programmer after giving it to sv_usepvn. Does not handle 'set' magic.
2802 See C<sv_usepvn_mg>.
2808 Perl_sv_usepvn(pTHX_ register SV *sv, register char *ptr, register STRLEN len)
2810 SV_CHECK_THINKFIRST(sv);
2811 (void)SvUPGRADE(sv, SVt_PV);
2816 (void)SvOOK_off(sv);
2817 if (SvPVX(sv) && SvLEN(sv))
2818 Safefree(SvPVX(sv));
2819 Renew(ptr, len+1, char);
2822 SvLEN_set(sv, len+1);
2824 (void)SvPOK_only(sv); /* validate pointer */
2829 =for apidoc sv_usepvn_mg
2831 Like C<sv_usepvn>, but also handles 'set' magic.
2837 Perl_sv_usepvn_mg(pTHX_ register SV *sv, register char *ptr, register STRLEN len)
2839 sv_usepvn(sv,ptr,len);
2844 Perl_sv_force_normal(pTHX_ register SV *sv)
2846 if (SvREADONLY(sv)) {
2848 if (PL_curcop != &PL_compiling)
2849 Perl_croak(aTHX_ PL_no_modify);
2853 else if (SvFAKE(sv) && SvTYPE(sv) == SVt_PVGV)
2860 Efficient removal of characters from the beginning of the string buffer.
2861 SvPOK(sv) must be true and the C<ptr> must be a pointer to somewhere inside
2862 the string buffer. The C<ptr> becomes the first character of the adjusted
2869 Perl_sv_chop(pTHX_ register SV *sv, register char *ptr) /* like set but assuming ptr is in sv */
2873 register STRLEN delta;
2875 if (!ptr || !SvPOKp(sv))
2877 SV_CHECK_THINKFIRST(sv);
2878 if (SvTYPE(sv) < SVt_PVIV)
2879 sv_upgrade(sv,SVt_PVIV);
2882 if (!SvLEN(sv)) { /* make copy of shared string */
2883 char *pvx = SvPVX(sv);
2884 STRLEN len = SvCUR(sv);
2885 SvGROW(sv, len + 1);
2886 Move(pvx,SvPVX(sv),len,char);
2890 SvFLAGS(sv) |= SVf_OOK;
2892 SvFLAGS(sv) &= ~(SVf_IOK|SVf_NOK|SVp_IOK|SVp_NOK|SVf_IVisUV);
2893 delta = ptr - SvPVX(sv);
2901 =for apidoc sv_catpvn
2903 Concatenates the string onto the end of the string which is in the SV. The
2904 C<len> indicates number of bytes to copy. Handles 'get' magic, but not
2905 'set' magic. See C<sv_catpvn_mg>.
2911 Perl_sv_catpvn(pTHX_ register SV *sv, register const char *ptr, register STRLEN len)
2916 junk = SvPV_force(sv, tlen);
2917 SvGROW(sv, tlen + len + 1);
2920 Move(ptr,SvPVX(sv)+tlen,len,char);
2923 (void)SvPOK_only_UTF8(sv); /* validate pointer */
2928 =for apidoc sv_catpvn_mg
2930 Like C<sv_catpvn>, but also handles 'set' magic.
2936 Perl_sv_catpvn_mg(pTHX_ register SV *sv, register const char *ptr, register STRLEN len)
2938 sv_catpvn(sv,ptr,len);
2943 =for apidoc sv_catsv
2945 Concatenates the string from SV C<ssv> onto the end of the string in SV
2946 C<dsv>. Handles 'get' magic, but not 'set' magic. See C<sv_catsv_mg>.
2952 Perl_sv_catsv(pTHX_ SV *dstr, register SV *sstr)
2958 if (s = SvPV(sstr, len))
2959 sv_catpvn(dstr,s,len);
2965 =for apidoc sv_catsv_mg
2967 Like C<sv_catsv>, but also handles 'set' magic.
2973 Perl_sv_catsv_mg(pTHX_ SV *dstr, register SV *sstr)
2975 sv_catsv(dstr,sstr);
2980 =for apidoc sv_catpv
2982 Concatenates the string onto the end of the string which is in the SV.
2983 Handles 'get' magic, but not 'set' magic. See C<sv_catpv_mg>.
2989 Perl_sv_catpv(pTHX_ register SV *sv, register const char *ptr)
2991 register STRLEN len;
2997 junk = SvPV_force(sv, tlen);
2999 SvGROW(sv, tlen + len + 1);
3002 Move(ptr,SvPVX(sv)+tlen,len+1,char);
3004 (void)SvPOK_only_UTF8(sv); /* validate pointer */
3009 =for apidoc sv_catpv_mg
3011 Like C<sv_catpv>, but also handles 'set' magic.
3017 Perl_sv_catpv_mg(pTHX_ register SV *sv, register const char *ptr)
3024 Perl_newSV(pTHX_ STRLEN len)
3030 sv_upgrade(sv, SVt_PV);
3031 SvGROW(sv, len + 1);
3036 /* name is assumed to contain an SV* if (name && namelen == HEf_SVKEY) */
3039 =for apidoc sv_magic
3041 Adds magic to an SV.
3047 Perl_sv_magic(pTHX_ register SV *sv, SV *obj, int how, const char *name, I32 namlen)
3051 if (SvREADONLY(sv)) {
3053 if (PL_curcop != &PL_compiling && !strchr("gBf", how))
3054 Perl_croak(aTHX_ PL_no_modify);
3056 if (SvMAGICAL(sv) || (how == 't' && SvTYPE(sv) >= SVt_PVMG)) {
3057 if (SvMAGIC(sv) && (mg = mg_find(sv, how))) {
3064 (void)SvUPGRADE(sv, SVt_PVMG);
3066 Newz(702,mg, 1, MAGIC);
3067 mg->mg_moremagic = SvMAGIC(sv);
3070 if (!obj || obj == sv || how == '#' || how == 'r')
3074 mg->mg_obj = SvREFCNT_inc(obj);
3075 mg->mg_flags |= MGf_REFCOUNTED;
3078 mg->mg_len = namlen;
3081 mg->mg_ptr = savepvn(name, namlen);
3082 else if (namlen == HEf_SVKEY)
3083 mg->mg_ptr = (char*)SvREFCNT_inc((SV*)name);
3087 mg->mg_virtual = &PL_vtbl_sv;
3090 mg->mg_virtual = &PL_vtbl_amagic;
3093 mg->mg_virtual = &PL_vtbl_amagicelem;
3099 mg->mg_virtual = &PL_vtbl_bm;
3102 mg->mg_virtual = &PL_vtbl_regdata;
3105 mg->mg_virtual = &PL_vtbl_regdatum;
3108 mg->mg_virtual = &PL_vtbl_env;
3111 mg->mg_virtual = &PL_vtbl_fm;
3114 mg->mg_virtual = &PL_vtbl_envelem;
3117 mg->mg_virtual = &PL_vtbl_mglob;
3120 mg->mg_virtual = &PL_vtbl_isa;
3123 mg->mg_virtual = &PL_vtbl_isaelem;
3126 mg->mg_virtual = &PL_vtbl_nkeys;
3133 mg->mg_virtual = &PL_vtbl_dbline;
3137 mg->mg_virtual = &PL_vtbl_mutex;
3139 #endif /* USE_THREADS */
3140 #ifdef USE_LOCALE_COLLATE
3142 mg->mg_virtual = &PL_vtbl_collxfrm;
3144 #endif /* USE_LOCALE_COLLATE */
3146 mg->mg_virtual = &PL_vtbl_pack;
3150 mg->mg_virtual = &PL_vtbl_packelem;
3153 mg->mg_virtual = &PL_vtbl_regexp;
3156 mg->mg_virtual = &PL_vtbl_sig;
3159 mg->mg_virtual = &PL_vtbl_sigelem;
3162 mg->mg_virtual = &PL_vtbl_taint;
3166 mg->mg_virtual = &PL_vtbl_uvar;
3169 mg->mg_virtual = &PL_vtbl_vec;
3172 mg->mg_virtual = &PL_vtbl_substr;
3175 mg->mg_virtual = &PL_vtbl_defelem;
3178 mg->mg_virtual = &PL_vtbl_glob;
3181 mg->mg_virtual = &PL_vtbl_arylen;
3184 mg->mg_virtual = &PL_vtbl_pos;
3187 mg->mg_virtual = &PL_vtbl_backref;
3189 case '~': /* Reserved for use by extensions not perl internals. */
3190 /* Useful for attaching extension internal data to perl vars. */
3191 /* Note that multiple extensions may clash if magical scalars */
3192 /* etc holding private data from one are passed to another. */
3196 Perl_croak(aTHX_ "Don't know how to handle magic of type '%c'", how);
3200 SvFLAGS(sv) &= ~(SVf_IOK|SVf_NOK|SVf_POK);
3204 Perl_sv_unmagic(pTHX_ SV *sv, int type)
3208 if (SvTYPE(sv) < SVt_PVMG || !SvMAGIC(sv))
3211 for (mg = *mgp; mg; mg = *mgp) {
3212 if (mg->mg_type == type) {
3213 MGVTBL* vtbl = mg->mg_virtual;
3214 *mgp = mg->mg_moremagic;
3215 if (vtbl && vtbl->svt_free)
3216 CALL_FPTR(vtbl->svt_free)(aTHX_ sv, mg);
3217 if (mg->mg_ptr && mg->mg_type != 'g')
3218 if (mg->mg_len >= 0)
3219 Safefree(mg->mg_ptr);
3220 else if (mg->mg_len == HEf_SVKEY)
3221 SvREFCNT_dec((SV*)mg->mg_ptr);
3222 if (mg->mg_flags & MGf_REFCOUNTED)
3223 SvREFCNT_dec(mg->mg_obj);
3227 mgp = &mg->mg_moremagic;
3231 SvFLAGS(sv) |= (SvFLAGS(sv) & (SVp_IOK|SVp_NOK|SVp_POK)) >> PRIVSHIFT;
3238 Perl_sv_rvweaken(pTHX_ SV *sv)
3241 if (!SvOK(sv)) /* let undefs pass */
3244 Perl_croak(aTHX_ "Can't weaken a nonreference");
3245 else if (SvWEAKREF(sv)) {
3247 if (ckWARN(WARN_MISC))
3248 Perl_warner(aTHX_ WARN_MISC, "Reference is already weak");
3252 sv_add_backref(tsv, sv);
3259 S_sv_add_backref(pTHX_ SV *tsv, SV *sv)
3263 if (SvMAGICAL(tsv) && (mg = mg_find(tsv, '<')))
3264 av = (AV*)mg->mg_obj;
3267 sv_magic(tsv, (SV*)av, '<', NULL, 0);
3268 SvREFCNT_dec(av); /* for sv_magic */
3274 S_sv_del_backref(pTHX_ SV *sv)
3281 if (!SvMAGICAL(tsv) || !(mg = mg_find(tsv, '<')))
3282 Perl_croak(aTHX_ "panic: del_backref");
3283 av = (AV *)mg->mg_obj;
3288 svp[i] = &PL_sv_undef; /* XXX */
3295 =for apidoc sv_insert
3297 Inserts a string at the specified offset/length within the SV. Similar to
3298 the Perl substr() function.
3304 Perl_sv_insert(pTHX_ SV *bigstr, STRLEN offset, STRLEN len, char *little, STRLEN littlelen)
3308 register char *midend;
3309 register char *bigend;
3315 Perl_croak(aTHX_ "Can't modify non-existent substring");
3316 SvPV_force(bigstr, curlen);
3317 if (offset + len > curlen) {
3318 SvGROW(bigstr, offset+len+1);
3319 Zero(SvPVX(bigstr)+curlen, offset+len-curlen, char);
3320 SvCUR_set(bigstr, offset+len);
3324 i = littlelen - len;
3325 if (i > 0) { /* string might grow */
3326 big = SvGROW(bigstr, SvCUR(bigstr) + i + 1);
3327 mid = big + offset + len;
3328 midend = bigend = big + SvCUR(bigstr);
3331 while (midend > mid) /* shove everything down */
3332 *--bigend = *--midend;
3333 Move(little,big+offset,littlelen,char);
3339 Move(little,SvPVX(bigstr)+offset,len,char);
3344 big = SvPVX(bigstr);
3347 bigend = big + SvCUR(bigstr);
3349 if (midend > bigend)
3350 Perl_croak(aTHX_ "panic: sv_insert");
3352 if (mid - big > bigend - midend) { /* faster to shorten from end */
3354 Move(little, mid, littlelen,char);
3357 i = bigend - midend;
3359 Move(midend, mid, i,char);
3363 SvCUR_set(bigstr, mid - big);
3366 else if (i = mid - big) { /* faster from front */
3367 midend -= littlelen;
3369 sv_chop(bigstr,midend-i);
3374 Move(little, mid, littlelen,char);
3376 else if (littlelen) {
3377 midend -= littlelen;
3378 sv_chop(bigstr,midend);
3379 Move(little,midend,littlelen,char);
3382 sv_chop(bigstr,midend);
3387 /* make sv point to what nstr did */
3390 Perl_sv_replace(pTHX_ register SV *sv, register SV *nsv)
3393 U32 refcnt = SvREFCNT(sv);
3394 SV_CHECK_THINKFIRST(sv);
3395 if (SvREFCNT(nsv) != 1 && ckWARN_d(WARN_INTERNAL))
3396 Perl_warner(aTHX_ WARN_INTERNAL, "Reference miscount in sv_replace()");
3397 if (SvMAGICAL(sv)) {
3401 sv_upgrade(nsv, SVt_PVMG);
3402 SvMAGIC(nsv) = SvMAGIC(sv);
3403 SvFLAGS(nsv) |= SvMAGICAL(sv);
3409 assert(!SvREFCNT(sv));
3410 StructCopy(nsv,sv,SV);
3411 SvREFCNT(sv) = refcnt;
3412 SvFLAGS(nsv) |= SVTYPEMASK; /* Mark as freed */
3417 Perl_sv_clear(pTHX_ register SV *sv)
3421 assert(SvREFCNT(sv) == 0);
3425 if (PL_defstash) { /* Still have a symbol table? */
3430 Zero(&tmpref, 1, SV);
3431 sv_upgrade(&tmpref, SVt_RV);
3433 SvREADONLY_on(&tmpref); /* DESTROY() could be naughty */
3434 SvREFCNT(&tmpref) = 1;
3437 stash = SvSTASH(sv);
3438 destructor = gv_fetchmethod(SvSTASH(sv), "DESTROY");
3441 PUSHSTACKi(PERLSI_DESTROY);
3442 SvRV(&tmpref) = SvREFCNT_inc(sv);
3447 call_sv((SV*)GvCV(destructor),
3448 G_DISCARD|G_EVAL|G_KEEPERR);
3454 } while (SvOBJECT(sv) && SvSTASH(sv) != stash);
3456 del_XRV(SvANY(&tmpref));
3459 if (PL_in_clean_objs)
3460 Perl_croak(aTHX_ "DESTROY created new reference to dead object '%s'",
3462 /* DESTROY gave object new lease on life */
3468 SvREFCNT_dec(SvSTASH(sv)); /* possibly of changed persuasion */
3469 SvOBJECT_off(sv); /* Curse the object. */
3470 if (SvTYPE(sv) != SVt_PVIO)
3471 --PL_sv_objcount; /* XXX Might want something more general */
3474 if (SvTYPE(sv) >= SVt_PVMG && SvMAGIC(sv))
3477 switch (SvTYPE(sv)) {
3480 IoIFP(sv) != PerlIO_stdin() &&
3481 IoIFP(sv) != PerlIO_stdout() &&
3482 IoIFP(sv) != PerlIO_stderr())
3484 io_close((IO*)sv, FALSE);
3486 if (IoDIRP(sv) && !(IoFLAGS(sv) & IOf_FAKE_DIRP))
3487 PerlDir_close(IoDIRP(sv));
3488 IoDIRP(sv) = (DIR*)NULL;
3489 Safefree(IoTOP_NAME(sv));
3490 Safefree(IoFMT_NAME(sv));
3491 Safefree(IoBOTTOM_NAME(sv));
3506 SvREFCNT_dec(LvTARG(sv));
3510 Safefree(GvNAME(sv));
3511 /* cannot decrease stash refcount yet, as we might recursively delete
3512 ourselves when the refcnt drops to zero. Delay SvREFCNT_dec
3513 of stash until current sv is completely gone.
3514 -- JohnPC, 27 Mar 1998 */
3515 stash = GvSTASH(sv);
3521 (void)SvOOK_off(sv);
3529 SvREFCNT_dec(SvRV(sv));
3531 else if (SvPVX(sv) && SvLEN(sv))
3532 Safefree(SvPVX(sv));
3542 switch (SvTYPE(sv)) {
3558 del_XPVIV(SvANY(sv));
3561 del_XPVNV(SvANY(sv));
3564 del_XPVMG(SvANY(sv));
3567 del_XPVLV(SvANY(sv));
3570 del_XPVAV(SvANY(sv));
3573 del_XPVHV(SvANY(sv));
3576 del_XPVCV(SvANY(sv));
3579 del_XPVGV(SvANY(sv));
3580 /* code duplication for increased performance. */
3581 SvFLAGS(sv) &= SVf_BREAK;
3582 SvFLAGS(sv) |= SVTYPEMASK;
3583 /* decrease refcount of the stash that owns this GV, if any */
3585 SvREFCNT_dec(stash);
3586 return; /* not break, SvFLAGS reset already happened */
3588 del_XPVBM(SvANY(sv));
3591 del_XPVFM(SvANY(sv));
3594 del_XPVIO(SvANY(sv));
3597 SvFLAGS(sv) &= SVf_BREAK;
3598 SvFLAGS(sv) |= SVTYPEMASK;
3602 Perl_sv_newref(pTHX_ SV *sv)
3605 ATOMIC_INC(SvREFCNT(sv));
3610 Perl_sv_free(pTHX_ SV *sv)
3613 int refcount_is_zero;
3617 if (SvREFCNT(sv) == 0) {
3618 if (SvFLAGS(sv) & SVf_BREAK)
3620 if (PL_in_clean_all) /* All is fair */
3622 if (SvREADONLY(sv) && SvIMMORTAL(sv)) {
3623 /* make sure SvREFCNT(sv)==0 happens very seldom */
3624 SvREFCNT(sv) = (~(U32)0)/2;
3627 if (ckWARN_d(WARN_INTERNAL))
3628 Perl_warner(aTHX_ WARN_INTERNAL, "Attempt to free unreferenced scalar");
3631 ATOMIC_DEC_AND_TEST(refcount_is_zero, SvREFCNT(sv));
3632 if (!refcount_is_zero)
3636 if (ckWARN_d(WARN_DEBUGGING))
3637 Perl_warner(aTHX_ WARN_DEBUGGING,
3638 "Attempt to free temp prematurely: SV 0x%"UVxf,
3643 if (SvREADONLY(sv) && SvIMMORTAL(sv)) {
3644 /* make sure SvREFCNT(sv)==0 happens very seldom */
3645 SvREFCNT(sv) = (~(U32)0)/2;
3656 Returns the length of the string in the SV. See also C<SvCUR>.
3662 Perl_sv_len(pTHX_ register SV *sv)
3671 len = mg_length(sv);
3673 junk = SvPV(sv, len);
3678 Perl_sv_len_utf8(pTHX_ register SV *sv)
3689 len = mg_length(sv);
3692 s = (U8*)SvPV(sv, len);
3703 Perl_sv_pos_u2b(pTHX_ register SV *sv, I32* offsetp, I32* lenp)
3708 I32 uoffset = *offsetp;
3714 start = s = (U8*)SvPV(sv, len);
3716 while (s < send && uoffset--)
3720 *offsetp = s - start;
3724 while (s < send && ulen--)
3734 Perl_sv_pos_b2u(pTHX_ register SV *sv, I32* offsetp)
3743 s = (U8*)SvPV(sv, len);
3745 Perl_croak(aTHX_ "panic: bad byte offset");
3746 send = s + *offsetp;
3754 if (ckWARN_d(WARN_UTF8))
3755 Perl_warner(aTHX_ WARN_UTF8, "Malformed UTF-8 character");
3765 Returns a boolean indicating whether the strings in the two SVs are
3772 Perl_sv_eq(pTHX_ register SV *str1, register SV *str2)
3784 pv1 = SvPV(str1, cur1);
3789 pv2 = SvPV(str2, cur2);
3794 return memEQ(pv1, pv2, cur1);
3800 Compares the strings in two SVs. Returns -1, 0, or 1 indicating whether the
3801 string in C<sv1> is less than, equal to, or greater than the string in
3808 Perl_sv_cmp(pTHX_ register SV *str1, register SV *str2)
3811 char *pv1 = str1 ? SvPV(str1, cur1) : (char *) NULL;
3813 char *pv2 = str2 ? SvPV(str2, cur2) : (char *) NULL;
3817 return cur2 ? -1 : 0;
3822 retval = memcmp((void*)pv1, (void*)pv2, cur1 < cur2 ? cur1 : cur2);
3825 return retval < 0 ? -1 : 1;
3830 return cur1 < cur2 ? -1 : 1;
3834 Perl_sv_cmp_locale(pTHX_ register SV *sv1, register SV *sv2)
3836 #ifdef USE_LOCALE_COLLATE
3842 if (PL_collation_standard)
3846 pv1 = sv1 ? sv_collxfrm(sv1, &len1) : (char *) NULL;
3848 pv2 = sv2 ? sv_collxfrm(sv2, &len2) : (char *) NULL;
3850 if (!pv1 || !len1) {
3861 retval = memcmp((void*)pv1, (void*)pv2, len1 < len2 ? len1 : len2);
3864 return retval < 0 ? -1 : 1;
3867 * When the result of collation is equality, that doesn't mean
3868 * that there are no differences -- some locales exclude some
3869 * characters from consideration. So to avoid false equalities,
3870 * we use the raw string as a tiebreaker.
3876 #endif /* USE_LOCALE_COLLATE */
3878 return sv_cmp(sv1, sv2);
3881 #ifdef USE_LOCALE_COLLATE
3883 * Any scalar variable may carry an 'o' magic that contains the
3884 * scalar data of the variable transformed to such a format that
3885 * a normal memory comparison can be used to compare the data
3886 * according to the locale settings.
3889 Perl_sv_collxfrm(pTHX_ SV *sv, STRLEN *nxp)
3893 mg = SvMAGICAL(sv) ? mg_find(sv, 'o') : (MAGIC *) NULL;
3894 if (!mg || !mg->mg_ptr || *(U32*)mg->mg_ptr != PL_collation_ix) {
3899 Safefree(mg->mg_ptr);
3901 if ((xf = mem_collxfrm(s, len, &xlen))) {
3902 if (SvREADONLY(sv)) {
3905 return xf + sizeof(PL_collation_ix);
3908 sv_magic(sv, 0, 'o', 0, 0);
3909 mg = mg_find(sv, 'o');
3922 if (mg && mg->mg_ptr) {
3924 return mg->mg_ptr + sizeof(PL_collation_ix);
3932 #endif /* USE_LOCALE_COLLATE */
3935 Perl_sv_gets(pTHX_ register SV *sv, register PerlIO *fp, I32 append)
3940 register STDCHAR rslast;
3941 register STDCHAR *bp;
3945 SV_CHECK_THINKFIRST(sv);
3946 (void)SvUPGRADE(sv, SVt_PV);
3950 if (RsSNARF(PL_rs)) {
3954 else if (RsRECORD(PL_rs)) {
3955 I32 recsize, bytesread;
3958 /* Grab the size of the record we're getting */
3959 recsize = SvIV(SvRV(PL_rs));
3960 (void)SvPOK_only(sv); /* Validate pointer */
3961 buffer = SvGROW(sv, recsize + 1);
3964 /* VMS wants read instead of fread, because fread doesn't respect */
3965 /* RMS record boundaries. This is not necessarily a good thing to be */
3966 /* doing, but we've got no other real choice */
3967 bytesread = PerlLIO_read(PerlIO_fileno(fp), buffer, recsize);
3969 bytesread = PerlIO_read(fp, buffer, recsize);
3971 SvCUR_set(sv, bytesread);
3972 buffer[bytesread] = '\0';
3973 return(SvCUR(sv) ? SvPVX(sv) : Nullch);
3975 else if (RsPARA(PL_rs)) {
3980 rsptr = SvPV(PL_rs, rslen);
3981 rslast = rslen ? rsptr[rslen - 1] : '\0';
3983 if (RsPARA(PL_rs)) { /* have to do this both before and after */
3984 do { /* to make sure file boundaries work right */
3987 i = PerlIO_getc(fp);
3991 PerlIO_ungetc(fp,i);
3997 /* See if we know enough about I/O mechanism to cheat it ! */
3999 /* This used to be #ifdef test - it is made run-time test for ease
4000 of abstracting out stdio interface. One call should be cheap
4001 enough here - and may even be a macro allowing compile
4005 if (PerlIO_fast_gets(fp)) {
4008 * We're going to steal some values from the stdio struct
4009 * and put EVERYTHING in the innermost loop into registers.
4011 register STDCHAR *ptr;
4015 #if defined(VMS) && defined(PERLIO_IS_STDIO)
4016 /* An ungetc()d char is handled separately from the regular
4017 * buffer, so we getc() it back out and stuff it in the buffer.
4019 i = PerlIO_getc(fp);
4020 if (i == EOF) return 0;
4021 *(--((*fp)->_ptr)) = (unsigned char) i;
4025 /* Here is some breathtakingly efficient cheating */
4027 cnt = PerlIO_get_cnt(fp); /* get count into register */
4028 (void)SvPOK_only(sv); /* validate pointer */
4029 if (SvLEN(sv) - append <= cnt + 1) { /* make sure we have the room */
4030 if (cnt > 80 && SvLEN(sv) > append) {
4031 shortbuffered = cnt - SvLEN(sv) + append + 1;
4032 cnt -= shortbuffered;
4036 /* remember that cnt can be negative */
4037 SvGROW(sv, append + (cnt <= 0 ? 2 : (cnt + 1)));
4042 bp = (STDCHAR*)SvPVX(sv) + append; /* move these two too to registers */
4043 ptr = (STDCHAR*)PerlIO_get_ptr(fp);
4044 DEBUG_P(PerlIO_printf(Perl_debug_log,
4045 "Screamer: entering, ptr=%"UVuf", cnt=%ld\n",PTR2UV(ptr),(long)cnt));
4046 DEBUG_P(PerlIO_printf(Perl_debug_log,
4047 "Screamer: entering: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
4048 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
4049 PTR2UV(PerlIO_has_base(fp) ? PerlIO_get_base(fp) : 0)));
4054 while (cnt > 0) { /* this | eat */
4056 if ((*bp++ = *ptr++) == rslast) /* really | dust */
4057 goto thats_all_folks; /* screams | sed :-) */
4061 Copy(ptr, bp, cnt, char); /* this | eat */
4062 bp += cnt; /* screams | dust */
4063 ptr += cnt; /* louder | sed :-) */
4068 if (shortbuffered) { /* oh well, must extend */
4069 cnt = shortbuffered;
4071 bpx = bp - (STDCHAR*)SvPVX(sv); /* box up before relocation */
4073 SvGROW(sv, SvLEN(sv) + append + cnt + 2);
4074 bp = (STDCHAR*)SvPVX(sv) + bpx; /* unbox after relocation */
4078 DEBUG_P(PerlIO_printf(Perl_debug_log,
4079 "Screamer: going to getc, ptr=%"UVuf", cnt=%ld\n",
4080 PTR2UV(ptr),(long)cnt));
4081 PerlIO_set_ptrcnt(fp, ptr, cnt); /* deregisterize cnt and ptr */
4082 DEBUG_P(PerlIO_printf(Perl_debug_log,
4083 "Screamer: pre: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
4084 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
4085 PTR2UV(PerlIO_has_base (fp) ? PerlIO_get_base(fp) : 0)));
4086 /* This used to call 'filbuf' in stdio form, but as that behaves like
4087 getc when cnt <= 0 we use PerlIO_getc here to avoid introducing
4088 another abstraction. */
4089 i = PerlIO_getc(fp); /* get more characters */
4090 DEBUG_P(PerlIO_printf(Perl_debug_log,
4091 "Screamer: post: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
4092 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
4093 PTR2UV(PerlIO_has_base (fp) ? PerlIO_get_base(fp) : 0)));
4094 cnt = PerlIO_get_cnt(fp);
4095 ptr = (STDCHAR*)PerlIO_get_ptr(fp); /* reregisterize cnt and ptr */
4096 DEBUG_P(PerlIO_printf(Perl_debug_log,
4097 "Screamer: after getc, ptr=%"UVuf", cnt=%ld\n",PTR2UV(ptr),(long)cnt));
4099 if (i == EOF) /* all done for ever? */
4100 goto thats_really_all_folks;
4102 bpx = bp - (STDCHAR*)SvPVX(sv); /* box up before relocation */
4104 SvGROW(sv, bpx + cnt + 2);
4105 bp = (STDCHAR*)SvPVX(sv) + bpx; /* unbox after relocation */
4107 *bp++ = i; /* store character from PerlIO_getc */
4109 if (rslen && (STDCHAR)i == rslast) /* all done for now? */
4110 goto thats_all_folks;
4114 if ((rslen > 1 && (bp - (STDCHAR*)SvPVX(sv) < rslen)) ||
4115 memNE((char*)bp - rslen, rsptr, rslen))
4116 goto screamer; /* go back to the fray */
4117 thats_really_all_folks:
4119 cnt += shortbuffered;
4120 DEBUG_P(PerlIO_printf(Perl_debug_log,
4121 "Screamer: quitting, ptr=%"UVuf", cnt=%ld\n",PTR2UV(ptr),(long)cnt));
4122 PerlIO_set_ptrcnt(fp, ptr, cnt); /* put these back or we're in trouble */
4123 DEBUG_P(PerlIO_printf(Perl_debug_log,
4124 "Screamer: end: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
4125 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
4126 PTR2UV(PerlIO_has_base (fp) ? PerlIO_get_base(fp) : 0)));
4128 SvCUR_set(sv, bp - (STDCHAR*)SvPVX(sv)); /* set length */
4129 DEBUG_P(PerlIO_printf(Perl_debug_log,
4130 "Screamer: done, len=%ld, string=|%.*s|\n",
4131 (long)SvCUR(sv),(int)SvCUR(sv),SvPVX(sv)));
4136 /*The big, slow, and stupid way */
4139 /* Need to work around EPOC SDK features */
4140 /* On WINS: MS VC5 generates calls to _chkstk, */
4141 /* if a `large' stack frame is allocated */
4142 /* gcc on MARM does not generate calls like these */
4148 register STDCHAR *bpe = buf + sizeof(buf);
4150 while ((i = PerlIO_getc(fp)) != EOF && (*bp++ = i) != rslast && bp < bpe)
4151 ; /* keep reading */
4155 cnt = PerlIO_read(fp,(char*)buf, sizeof(buf));
4156 /* Accomodate broken VAXC compiler, which applies U8 cast to
4157 * both args of ?: operator, causing EOF to change into 255
4159 if (cnt) { i = (U8)buf[cnt - 1]; } else { i = EOF; }
4163 sv_catpvn(sv, (char *) buf, cnt);
4165 sv_setpvn(sv, (char *) buf, cnt);
4167 if (i != EOF && /* joy */
4169 SvCUR(sv) < rslen ||
4170 memNE(SvPVX(sv) + SvCUR(sv) - rslen, rsptr, rslen)))
4174 * If we're reading from a TTY and we get a short read,
4175 * indicating that the user hit his EOF character, we need
4176 * to notice it now, because if we try to read from the TTY
4177 * again, the EOF condition will disappear.
4179 * The comparison of cnt to sizeof(buf) is an optimization
4180 * that prevents unnecessary calls to feof().
4184 if (!(cnt < sizeof(buf) && PerlIO_eof(fp)))
4189 if (RsPARA(PL_rs)) { /* have to do this both before and after */
4190 while (i != EOF) { /* to make sure file boundaries work right */
4191 i = PerlIO_getc(fp);
4193 PerlIO_ungetc(fp,i);
4199 return (SvCUR(sv) - append) ? SvPVX(sv) : Nullch;
4206 Auto-increment of the value in the SV.
4212 Perl_sv_inc(pTHX_ register SV *sv)
4221 if (SvTHINKFIRST(sv)) {
4222 if (SvREADONLY(sv)) {
4224 if (PL_curcop != &PL_compiling)
4225 Perl_croak(aTHX_ PL_no_modify);
4229 if (SvAMAGIC(sv) && AMG_CALLun(sv,inc))
4231 i = PTR2IV(SvRV(sv));
4236 flags = SvFLAGS(sv);
4237 if (flags & SVp_NOK) {
4238 (void)SvNOK_only(sv);
4242 if (flags & SVp_IOK) {
4244 if (SvUVX(sv) == UV_MAX)
4245 sv_setnv(sv, (NV)UV_MAX + 1.0);
4247 (void)SvIOK_only_UV(sv);
4250 if (SvIVX(sv) == IV_MAX)
4251 sv_setnv(sv, (NV)IV_MAX + 1.0);
4253 (void)SvIOK_only(sv);
4259 if (!(flags & SVp_POK) || !*SvPVX(sv)) {
4260 if ((flags & SVTYPEMASK) < SVt_PVNV)
4261 sv_upgrade(sv, SVt_NV);
4263 (void)SvNOK_only(sv);
4267 while (isALPHA(*d)) d++;
4268 while (isDIGIT(*d)) d++;
4270 sv_setnv(sv,Atof(SvPVX(sv)) + 1.0); /* punt */
4274 while (d >= SvPVX(sv)) {
4282 /* MKS: The original code here died if letters weren't consecutive.
4283 * at least it didn't have to worry about non-C locales. The
4284 * new code assumes that ('z'-'a')==('Z'-'A'), letters are
4285 * arranged in order (although not consecutively) and that only
4286 * [A-Za-z] are accepted by isALPHA in the C locale.
4288 if (*d != 'z' && *d != 'Z') {
4289 do { ++*d; } while (!isALPHA(*d));
4292 *(d--) -= 'z' - 'a';
4297 *(d--) -= 'z' - 'a' + 1;
4301 /* oh,oh, the number grew */
4302 SvGROW(sv, SvCUR(sv) + 2);
4304 for (d = SvPVX(sv) + SvCUR(sv); d > SvPVX(sv); d--)
4315 Auto-decrement of the value in the SV.
4321 Perl_sv_dec(pTHX_ register SV *sv)
4329 if (SvTHINKFIRST(sv)) {
4330 if (SvREADONLY(sv)) {
4332 if (PL_curcop != &PL_compiling)
4333 Perl_croak(aTHX_ PL_no_modify);
4337 if (SvAMAGIC(sv) && AMG_CALLun(sv,dec))
4339 i = PTR2IV(SvRV(sv));
4344 flags = SvFLAGS(sv);
4345 if (flags & SVp_NOK) {
4347 (void)SvNOK_only(sv);
4350 if (flags & SVp_IOK) {
4352 if (SvUVX(sv) == 0) {
4353 (void)SvIOK_only(sv);
4357 (void)SvIOK_only_UV(sv);
4361 if (SvIVX(sv) == IV_MIN)
4362 sv_setnv(sv, (NV)IV_MIN - 1.0);
4364 (void)SvIOK_only(sv);
4370 if (!(flags & SVp_POK)) {
4371 if ((flags & SVTYPEMASK) < SVt_PVNV)
4372 sv_upgrade(sv, SVt_NV);
4374 (void)SvNOK_only(sv);
4377 sv_setnv(sv,Atof(SvPVX(sv)) - 1.0); /* punt */
4381 =for apidoc sv_mortalcopy
4383 Creates a new SV which is a copy of the original SV. The new SV is marked
4389 /* Make a string that will exist for the duration of the expression
4390 * evaluation. Actually, it may have to last longer than that, but
4391 * hopefully we won't free it until it has been assigned to a
4392 * permanent location. */
4395 Perl_sv_mortalcopy(pTHX_ SV *oldstr)
4401 sv_setsv(sv,oldstr);
4403 PL_tmps_stack[++PL_tmps_ix] = sv;
4409 =for apidoc sv_newmortal
4411 Creates a new SV which is mortal. The reference count of the SV is set to 1.
4417 Perl_sv_newmortal(pTHX)
4423 SvFLAGS(sv) = SVs_TEMP;
4425 PL_tmps_stack[++PL_tmps_ix] = sv;
4430 =for apidoc sv_2mortal
4432 Marks an SV as mortal. The SV will be destroyed when the current context
4438 /* same thing without the copying */
4441 Perl_sv_2mortal(pTHX_ register SV *sv)
4446 if (SvREADONLY(sv) && SvIMMORTAL(sv))
4449 PL_tmps_stack[++PL_tmps_ix] = sv;
4457 Creates a new SV and copies a string into it. The reference count for the
4458 SV is set to 1. If C<len> is zero, Perl will compute the length using
4459 strlen(). For efficiency, consider using C<newSVpvn> instead.
4465 Perl_newSVpv(pTHX_ const char *s, STRLEN len)
4472 sv_setpvn(sv,s,len);
4477 =for apidoc newSVpvn
4479 Creates a new SV and copies a string into it. The reference count for the
4480 SV is set to 1. Note that if C<len> is zero, Perl will create a zero length
4481 string. You are responsible for ensuring that the source string is at least
4488 Perl_newSVpvn(pTHX_ const char *s, STRLEN len)
4493 sv_setpvn(sv,s,len);
4497 #if defined(PERL_IMPLICIT_CONTEXT)
4499 Perl_newSVpvf_nocontext(const char* pat, ...)
4504 va_start(args, pat);
4505 sv = vnewSVpvf(pat, &args);
4512 =for apidoc newSVpvf
4514 Creates a new SV an initialize it with the string formatted like
4521 Perl_newSVpvf(pTHX_ const char* pat, ...)
4525 va_start(args, pat);
4526 sv = vnewSVpvf(pat, &args);
4532 Perl_vnewSVpvf(pTHX_ const char* pat, va_list* args)
4536 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
4543 Creates a new SV and copies a floating point value into it.
4544 The reference count for the SV is set to 1.
4550 Perl_newSVnv(pTHX_ NV n)
4562 Creates a new SV and copies an integer into it. The reference count for the
4569 Perl_newSViv(pTHX_ IV i)
4579 =for apidoc newRV_noinc
4581 Creates an RV wrapper for an SV. The reference count for the original
4582 SV is B<not> incremented.
4588 Perl_newRV_noinc(pTHX_ SV *tmpRef)
4594 sv_upgrade(sv, SVt_RV);
4601 /* newRV_inc is #defined to newRV in sv.h */
4603 Perl_newRV(pTHX_ SV *tmpRef)
4605 return newRV_noinc(SvREFCNT_inc(tmpRef));
4611 Creates a new SV which is an exact duplicate of the original SV.
4616 /* make an exact duplicate of old */
4619 Perl_newSVsv(pTHX_ register SV *old)
4626 if (SvTYPE(old) == SVTYPEMASK) {
4627 if (ckWARN_d(WARN_INTERNAL))
4628 Perl_warner(aTHX_ WARN_INTERNAL, "semi-panic: attempt to dup freed string");
4643 Perl_sv_reset(pTHX_ register char *s, HV *stash)
4651 char todo[PERL_UCHAR_MAX+1];
4656 if (!*s) { /* reset ?? searches */
4657 for (pm = HvPMROOT(stash); pm; pm = pm->op_pmnext) {
4658 pm->op_pmdynflags &= ~PMdf_USED;
4663 /* reset variables */
4665 if (!HvARRAY(stash))
4668 Zero(todo, 256, char);
4670 i = (unsigned char)*s;
4674 max = (unsigned char)*s++;
4675 for ( ; i <= max; i++) {
4678 for (i = 0; i <= (I32) HvMAX(stash); i++) {
4679 for (entry = HvARRAY(stash)[i];
4681 entry = HeNEXT(entry))
4683 if (!todo[(U8)*HeKEY(entry)])
4685 gv = (GV*)HeVAL(entry);
4687 if (SvTHINKFIRST(sv)) {
4688 if (!SvREADONLY(sv) && SvROK(sv))
4693 if (SvTYPE(sv) >= SVt_PV) {
4695 if (SvPVX(sv) != Nullch)
4702 if (GvHV(gv) && !HvNAME(GvHV(gv))) {
4704 #ifndef VMS /* VMS has no environ array */
4706 environ[0] = Nullch;
4715 Perl_sv_2io(pTHX_ SV *sv)
4721 switch (SvTYPE(sv)) {
4729 Perl_croak(aTHX_ "Bad filehandle: %s", GvNAME(gv));
4733 Perl_croak(aTHX_ PL_no_usym, "filehandle");
4735 return sv_2io(SvRV(sv));
4736 gv = gv_fetchpv(SvPV(sv,n_a), FALSE, SVt_PVIO);
4742 Perl_croak(aTHX_ "Bad filehandle: %s", SvPV(sv,n_a));
4749 Perl_sv_2cv(pTHX_ SV *sv, HV **st, GV **gvp, I32 lref)
4756 return *gvp = Nullgv, Nullcv;
4757 switch (SvTYPE(sv)) {
4777 SV **sp = &sv; /* Used in tryAMAGICunDEREF macro. */
4778 tryAMAGICunDEREF(to_cv);
4781 if (SvTYPE(sv) == SVt_PVCV) {
4790 Perl_croak(aTHX_ "Not a subroutine reference");
4795 gv = gv_fetchpv(SvPV(sv, n_a), lref, SVt_PVCV);
4801 if (lref && !GvCVu(gv)) {
4804 tmpsv = NEWSV(704,0);
4805 gv_efullname3(tmpsv, gv, Nullch);
4806 /* XXX this is probably not what they think they're getting.
4807 * It has the same effect as "sub name;", i.e. just a forward
4809 newSUB(start_subparse(FALSE, 0),
4810 newSVOP(OP_CONST, 0, tmpsv),
4815 Perl_croak(aTHX_ "Unable to create sub named \"%s\"", SvPV(sv,n_a));
4822 Perl_sv_true(pTHX_ register SV *sv)
4829 if ((tXpv = (XPV*)SvANY(sv)) &&
4830 (tXpv->xpv_cur > 1 ||
4831 (tXpv->xpv_cur && *tXpv->xpv_pv != '0')))
4838 return SvIVX(sv) != 0;
4841 return SvNVX(sv) != 0.0;
4843 return sv_2bool(sv);
4849 Perl_sv_iv(pTHX_ register SV *sv)
4853 return (IV)SvUVX(sv);
4860 Perl_sv_uv(pTHX_ register SV *sv)
4865 return (UV)SvIVX(sv);
4871 Perl_sv_nv(pTHX_ register SV *sv)
4879 Perl_sv_pv(pTHX_ SV *sv)
4886 return sv_2pv(sv, &n_a);
4890 Perl_sv_pvn(pTHX_ SV *sv, STRLEN *lp)
4896 return sv_2pv(sv, lp);
4900 Perl_sv_pvn_force(pTHX_ SV *sv, STRLEN *lp)
4904 if (SvTHINKFIRST(sv) && !SvROK(sv))
4905 sv_force_normal(sv);
4911 if (SvTYPE(sv) > SVt_PVLV && SvTYPE(sv) != SVt_PVFM) {
4913 Perl_croak(aTHX_ "Can't coerce %s to string in %s", sv_reftype(sv,0),
4914 PL_op_name[PL_op->op_type]);
4918 if (s != SvPVX(sv)) { /* Almost, but not quite, sv_setpvn() */
4923 (void)SvUPGRADE(sv, SVt_PV); /* Never FALSE */
4924 SvGROW(sv, len + 1);
4925 Move(s,SvPVX(sv),len,char);
4930 SvPOK_on(sv); /* validate pointer */
4932 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2pv(%s)\n",
4933 PTR2UV(sv),SvPVX(sv)));
4940 Perl_sv_pvbyte(pTHX_ SV *sv)
4946 Perl_sv_pvbyten(pTHX_ SV *sv, STRLEN *lp)
4948 return sv_pvn(sv,lp);
4952 Perl_sv_pvbyten_force(pTHX_ SV *sv, STRLEN *lp)
4954 return sv_pvn_force(sv,lp);
4958 Perl_sv_pvutf8(pTHX_ SV *sv)
4964 Perl_sv_pvutf8n(pTHX_ SV *sv, STRLEN *lp)
4966 return sv_pvn(sv,lp);
4970 Perl_sv_pvutf8n_force(pTHX_ SV *sv, STRLEN *lp)
4972 return sv_pvn_force(sv,lp);
4976 Perl_sv_reftype(pTHX_ SV *sv, int ob)
4978 if (ob && SvOBJECT(sv))
4979 return HvNAME(SvSTASH(sv));
4981 switch (SvTYPE(sv)) {
4995 case SVt_PVLV: return "LVALUE";
4996 case SVt_PVAV: return "ARRAY";
4997 case SVt_PVHV: return "HASH";
4998 case SVt_PVCV: return "CODE";
4999 case SVt_PVGV: return "GLOB";
5000 case SVt_PVFM: return "FORMAT";
5001 default: return "UNKNOWN";
5007 =for apidoc sv_isobject
5009 Returns a boolean indicating whether the SV is an RV pointing to a blessed
5010 object. If the SV is not an RV, or if the object is not blessed, then this
5017 Perl_sv_isobject(pTHX_ SV *sv)
5034 Returns a boolean indicating whether the SV is blessed into the specified
5035 class. This does not check for subtypes; use C<sv_derived_from> to verify
5036 an inheritance relationship.
5042 Perl_sv_isa(pTHX_ SV *sv, const char *name)
5054 return strEQ(HvNAME(SvSTASH(sv)), name);
5060 Creates a new SV for the RV, C<rv>, to point to. If C<rv> is not an RV then
5061 it will be upgraded to one. If C<classname> is non-null then the new SV will
5062 be blessed in the specified package. The new SV is returned and its
5063 reference count is 1.
5069 Perl_newSVrv(pTHX_ SV *rv, const char *classname)
5076 SV_CHECK_THINKFIRST(rv);
5079 if (SvTYPE(rv) < SVt_RV)
5080 sv_upgrade(rv, SVt_RV);
5087 HV* stash = gv_stashpv(classname, TRUE);
5088 (void)sv_bless(rv, stash);
5094 =for apidoc sv_setref_pv
5096 Copies a pointer into a new SV, optionally blessing the SV. The C<rv>
5097 argument will be upgraded to an RV. That RV will be modified to point to
5098 the new SV. If the C<pv> argument is NULL then C<PL_sv_undef> will be placed
5099 into the SV. The C<classname> argument indicates the package for the
5100 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
5101 will be returned and will have a reference count of 1.
5103 Do not use with other Perl types such as HV, AV, SV, CV, because those
5104 objects will become corrupted by the pointer copy process.
5106 Note that C<sv_setref_pvn> copies the string while this copies the pointer.
5112 Perl_sv_setref_pv(pTHX_ SV *rv, const char *classname, void *pv)
5115 sv_setsv(rv, &PL_sv_undef);
5119 sv_setiv(newSVrv(rv,classname), PTR2IV(pv));
5124 =for apidoc sv_setref_iv
5126 Copies an integer into a new SV, optionally blessing the SV. The C<rv>
5127 argument will be upgraded to an RV. That RV will be modified to point to
5128 the new SV. The C<classname> argument indicates the package for the
5129 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
5130 will be returned and will have a reference count of 1.
5136 Perl_sv_setref_iv(pTHX_ SV *rv, const char *classname, IV iv)
5138 sv_setiv(newSVrv(rv,classname), iv);
5143 =for apidoc sv_setref_nv
5145 Copies a double into a new SV, optionally blessing the SV. The C<rv>
5146 argument will be upgraded to an RV. That RV will be modified to point to
5147 the new SV. The C<classname> argument indicates the package for the
5148 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
5149 will be returned and will have a reference count of 1.
5155 Perl_sv_setref_nv(pTHX_ SV *rv, const char *classname, NV nv)
5157 sv_setnv(newSVrv(rv,classname), nv);
5162 =for apidoc sv_setref_pvn
5164 Copies a string into a new SV, optionally blessing the SV. The length of the
5165 string must be specified with C<n>. The C<rv> argument will be upgraded to
5166 an RV. That RV will be modified to point to the new SV. The C<classname>
5167 argument indicates the package for the blessing. Set C<classname> to
5168 C<Nullch> to avoid the blessing. The new SV will be returned and will have
5169 a reference count of 1.
5171 Note that C<sv_setref_pv> copies the pointer while this copies the string.
5177 Perl_sv_setref_pvn(pTHX_ SV *rv, const char *classname, char *pv, STRLEN n)
5179 sv_setpvn(newSVrv(rv,classname), pv, n);
5184 =for apidoc sv_bless
5186 Blesses an SV into a specified package. The SV must be an RV. The package
5187 must be designated by its stash (see C<gv_stashpv()>). The reference count
5188 of the SV is unaffected.
5194 Perl_sv_bless(pTHX_ SV *sv, HV *stash)
5199 Perl_croak(aTHX_ "Can't bless non-reference value");
5201 if (SvFLAGS(tmpRef) & (SVs_OBJECT|SVf_READONLY)) {
5202 if (SvREADONLY(tmpRef))
5203 Perl_croak(aTHX_ PL_no_modify);
5204 if (SvOBJECT(tmpRef)) {
5205 if (SvTYPE(tmpRef) != SVt_PVIO)
5207 SvREFCNT_dec(SvSTASH(tmpRef));
5210 SvOBJECT_on(tmpRef);
5211 if (SvTYPE(tmpRef) != SVt_PVIO)
5213 (void)SvUPGRADE(tmpRef, SVt_PVMG);
5214 SvSTASH(tmpRef) = (HV*)SvREFCNT_inc(stash);
5225 S_sv_unglob(pTHX_ SV *sv)
5227 assert(SvTYPE(sv) == SVt_PVGV);
5232 SvREFCNT_dec(GvSTASH(sv));
5233 GvSTASH(sv) = Nullhv;
5235 sv_unmagic(sv, '*');
5236 Safefree(GvNAME(sv));
5238 SvFLAGS(sv) &= ~SVTYPEMASK;
5239 SvFLAGS(sv) |= SVt_PVMG;
5243 =for apidoc sv_unref
5245 Unsets the RV status of the SV, and decrements the reference count of
5246 whatever was being referenced by the RV. This can almost be thought of
5247 as a reversal of C<newSVrv>. See C<SvROK_off>.
5253 Perl_sv_unref(pTHX_ SV *sv)
5257 if (SvWEAKREF(sv)) {
5265 if (SvREFCNT(rv) != 1 || SvREADONLY(rv))
5268 sv_2mortal(rv); /* Schedule for freeing later */
5272 Perl_sv_taint(pTHX_ SV *sv)
5274 sv_magic((sv), Nullsv, 't', Nullch, 0);
5278 Perl_sv_untaint(pTHX_ SV *sv)
5280 if (SvTYPE(sv) >= SVt_PVMG && SvMAGIC(sv)) {
5281 MAGIC *mg = mg_find(sv, 't');
5288 Perl_sv_tainted(pTHX_ SV *sv)
5290 if (SvTYPE(sv) >= SVt_PVMG && SvMAGIC(sv)) {
5291 MAGIC *mg = mg_find(sv, 't');
5292 if (mg && ((mg->mg_len & 1) || (mg->mg_len & 2) && mg->mg_obj == sv))
5299 =for apidoc sv_setpviv
5301 Copies an integer into the given SV, also updating its string value.
5302 Does not handle 'set' magic. See C<sv_setpviv_mg>.
5308 Perl_sv_setpviv(pTHX_ SV *sv, IV iv)
5310 char buf[TYPE_CHARS(UV)];
5312 char *ptr = uiv_2buf(buf, iv, 0, 0, &ebuf);
5314 sv_setpvn(sv, ptr, ebuf - ptr);
5319 =for apidoc sv_setpviv_mg
5321 Like C<sv_setpviv>, but also handles 'set' magic.
5327 Perl_sv_setpviv_mg(pTHX_ SV *sv, IV iv)
5329 char buf[TYPE_CHARS(UV)];
5331 char *ptr = uiv_2buf(buf, iv, 0, 0, &ebuf);
5333 sv_setpvn(sv, ptr, ebuf - ptr);
5337 #if defined(PERL_IMPLICIT_CONTEXT)
5339 Perl_sv_setpvf_nocontext(SV *sv, const char* pat, ...)
5343 va_start(args, pat);
5344 sv_vsetpvf(sv, pat, &args);
5350 Perl_sv_setpvf_mg_nocontext(SV *sv, const char* pat, ...)
5354 va_start(args, pat);
5355 sv_vsetpvf_mg(sv, pat, &args);
5361 =for apidoc sv_setpvf
5363 Processes its arguments like C<sprintf> and sets an SV to the formatted
5364 output. Does not handle 'set' magic. See C<sv_setpvf_mg>.
5370 Perl_sv_setpvf(pTHX_ SV *sv, const char* pat, ...)
5373 va_start(args, pat);
5374 sv_vsetpvf(sv, pat, &args);
5379 Perl_sv_vsetpvf(pTHX_ SV *sv, const char* pat, va_list* args)
5381 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
5385 =for apidoc sv_setpvf_mg
5387 Like C<sv_setpvf>, but also handles 'set' magic.
5393 Perl_sv_setpvf_mg(pTHX_ SV *sv, const char* pat, ...)
5396 va_start(args, pat);
5397 sv_vsetpvf_mg(sv, pat, &args);
5402 Perl_sv_vsetpvf_mg(pTHX_ SV *sv, const char* pat, va_list* args)
5404 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
5408 #if defined(PERL_IMPLICIT_CONTEXT)
5410 Perl_sv_catpvf_nocontext(SV *sv, const char* pat, ...)
5414 va_start(args, pat);
5415 sv_vcatpvf(sv, pat, &args);
5420 Perl_sv_catpvf_mg_nocontext(SV *sv, const char* pat, ...)
5424 va_start(args, pat);
5425 sv_vcatpvf_mg(sv, pat, &args);
5431 =for apidoc sv_catpvf
5433 Processes its arguments like C<sprintf> and appends the formatted output
5434 to an SV. Handles 'get' magic, but not 'set' magic. C<SvSETMAGIC()> must
5435 typically be called after calling this function to handle 'set' magic.
5441 Perl_sv_catpvf(pTHX_ SV *sv, const char* pat, ...)
5444 va_start(args, pat);
5445 sv_vcatpvf(sv, pat, &args);
5450 Perl_sv_vcatpvf(pTHX_ SV *sv, const char* pat, va_list* args)
5452 sv_vcatpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
5456 =for apidoc sv_catpvf_mg
5458 Like C<sv_catpvf>, but also handles 'set' magic.
5464 Perl_sv_catpvf_mg(pTHX_ SV *sv, const char* pat, ...)
5467 va_start(args, pat);
5468 sv_vcatpvf_mg(sv, pat, &args);
5473 Perl_sv_vcatpvf_mg(pTHX_ SV *sv, const char* pat, va_list* args)
5475 sv_vcatpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
5480 =for apidoc sv_vsetpvfn
5482 Works like C<vcatpvfn> but copies the text into the SV instead of
5489 Perl_sv_vsetpvfn(pTHX_ SV *sv, const char *pat, STRLEN patlen, va_list *args, SV **svargs, I32 svmax, bool *maybe_tainted)
5491 sv_setpvn(sv, "", 0);
5492 sv_vcatpvfn(sv, pat, patlen, args, svargs, svmax, maybe_tainted);
5496 =for apidoc sv_vcatpvfn
5498 Processes its arguments like C<vsprintf> and appends the formatted output
5499 to an SV. Uses an array of SVs if the C style variable argument list is
5500 missing (NULL). When running with taint checks enabled, indicates via
5501 C<maybe_tainted> if results are untrustworthy (often due to the use of
5508 Perl_sv_vcatpvfn(pTHX_ SV *sv, const char *pat, STRLEN patlen, va_list *args, SV **svargs, I32 svmax, bool *maybe_tainted)
5516 static char nullstr[] = "(null)";
5519 /* no matter what, this is a string now */
5520 (void)SvPV_force(sv, origlen);
5522 /* special-case "", "%s", and "%_" */
5525 if (patlen == 2 && pat[0] == '%') {
5529 char *s = va_arg(*args, char*);
5530 sv_catpv(sv, s ? s : nullstr);
5532 else if (svix < svmax) {
5533 sv_catsv(sv, *svargs);
5534 if (DO_UTF8(*svargs))
5540 argsv = va_arg(*args, SV*);
5541 sv_catsv(sv, argsv);
5546 /* See comment on '_' below */
5551 patend = (char*)pat + patlen;
5552 for (p = (char*)pat; p < patend; p = q) {
5560 bool has_precis = FALSE;
5562 bool is_utf = FALSE;
5566 STRLEN esignlen = 0;
5568 char *eptr = Nullch;
5570 /* Times 4: a decimal digit takes more than 3 binary digits.
5571 * NV_DIG: mantissa takes than many decimal digits.
5572 * Plus 32: Playing safe. */
5573 char ebuf[IV_DIG * 4 + NV_DIG + 32];
5574 /* large enough for "%#.#f" --chip */
5575 /* what about long double NVs? --jhi */
5586 for (q = p; q < patend && *q != '%'; ++q) ;
5588 sv_catpvn(sv, p, q - p);
5626 case '1': case '2': case '3':
5627 case '4': case '5': case '6':
5628 case '7': case '8': case '9':
5631 width = width * 10 + (*q++ - '0');
5636 i = va_arg(*args, int);
5638 i = (svix < svmax) ? SvIVx(svargs[svix++]) : 0;
5640 width = (i < 0) ? -i : i;
5651 i = va_arg(*args, int);
5653 i = (svix < svmax) ? SvIVx(svargs[svix++]) : 0;
5654 precis = (i < 0) ? 0 : i;
5660 precis = precis * 10 + (*q++ - '0');
5677 if (*(q + 1) == 'l') { /* lld */
5704 uv = va_arg(*args, int);
5706 uv = (svix < svmax) ? SvIVx(svargs[svix++]) : 0;
5707 if ((uv > 255 || (uv > 127 && SvUTF8(sv))) && !IN_BYTE) {
5708 eptr = (char*)utf8buf;
5709 elen = uv_to_utf8((U8*)eptr, uv) - utf8buf;
5721 eptr = va_arg(*args, char*);
5723 #ifdef MACOS_TRADITIONAL
5724 /* On MacOS, %#s format is used for Pascal strings */
5729 elen = strlen(eptr);
5732 elen = sizeof nullstr - 1;
5735 else if (svix < svmax) {
5736 argsv = svargs[svix++];
5737 eptr = SvPVx(argsv, elen);
5738 if (DO_UTF8(argsv)) {
5739 if (has_precis && precis < elen) {
5741 sv_pos_u2b(argsv, &p, 0); /* sticks at end */
5744 if (width) { /* fudge width (can't fudge elen) */
5745 width += elen - sv_len_utf8(argsv);
5754 argsv = va_arg(*args, SV*);
5755 else if (svix < svmax)
5756 argsv = svargs[svix++];
5759 U8 *str = (U8*)SvPVx(argsv,len);
5761 SV *vsv = NEWSV(73,vlen);
5764 U8 *vptr = (U8*)SvPVX(vsv);
5766 bool utf = DO_UTF8(argsv);
5774 uv = utf8_to_uv(str, &ulen);
5781 eptr = ebuf + sizeof ebuf;
5783 *--eptr = '0' + uv % 10;
5785 elen = (ebuf + sizeof ebuf) - eptr;
5786 while (elen >= vfree-1) {
5787 STRLEN off = vptr - (U8*)SvPVX(vsv);
5791 vptr = (U8*)SvPVX(vsv) + off;
5793 memcpy(vptr, eptr, elen);
5803 SvCUR_set(vsv,vcur);
5811 * The "%_" hack might have to be changed someday,
5812 * if ISO or ANSI decide to use '_' for something.
5813 * So we keep it hidden from users' code.
5817 argsv = va_arg(*args,SV*);
5818 eptr = SvPVx(argsv, elen);
5823 if (has_precis && elen > precis)
5831 uv = PTR2UV(va_arg(*args, void*));
5833 uv = (svix < svmax) ? PTR2UV(svargs[svix++]) : 0;
5848 case 'h': iv = (short)va_arg(*args, int); break;
5849 default: iv = va_arg(*args, int); break;
5850 case 'l': iv = va_arg(*args, long); break;
5851 case 'V': iv = va_arg(*args, IV); break;
5853 case 'q': iv = va_arg(*args, Quad_t); break;
5858 iv = (svix < svmax) ? SvIVx(svargs[svix++]) : 0;
5860 case 'h': iv = (short)iv; break;
5861 default: iv = (int)iv; break;
5862 case 'l': iv = (long)iv; break;
5865 case 'q': iv = (Quad_t)iv; break;
5872 esignbuf[esignlen++] = plus;
5876 esignbuf[esignlen++] = '-';
5914 case 'h': uv = (unsigned short)va_arg(*args, unsigned); break;
5915 default: uv = va_arg(*args, unsigned); break;
5916 case 'l': uv = va_arg(*args, unsigned long); break;
5917 case 'V': uv = va_arg(*args, UV); break;
5919 case 'q': uv = va_arg(*args, Quad_t); break;
5924 uv = (svix < svmax) ? SvUVx(svargs[svix++]) : 0;
5926 case 'h': uv = (unsigned short)uv; break;
5927 default: uv = (unsigned)uv; break;
5928 case 'l': uv = (unsigned long)uv; break;
5931 case 'q': uv = (Quad_t)uv; break;
5937 eptr = ebuf + sizeof ebuf;
5943 p = (char*)((c == 'X')
5944 ? "0123456789ABCDEF" : "0123456789abcdef");
5950 esignbuf[esignlen++] = '0';
5951 esignbuf[esignlen++] = c; /* 'x' or 'X' */
5957 *--eptr = '0' + dig;
5959 if (alt && *eptr != '0')
5965 *--eptr = '0' + dig;
5968 esignbuf[esignlen++] = '0';
5969 esignbuf[esignlen++] = 'b';
5972 default: /* it had better be ten or less */
5973 #if defined(PERL_Y2KWARN)
5974 if (ckWARN(WARN_MISC)) {
5976 char *s = SvPV(sv,n);
5977 if (n >= 2 && s[n-2] == '1' && s[n-1] == '9'
5978 && (n == 2 || !isDIGIT(s[n-3])))
5980 Perl_warner(aTHX_ WARN_MISC,
5981 "Possible Y2K bug: %%%c %s",
5982 c, "format string following '19'");
5988 *--eptr = '0' + dig;
5989 } while (uv /= base);
5992 elen = (ebuf + sizeof ebuf) - eptr;
5995 zeros = precis - elen;
5996 else if (precis == 0 && elen == 1 && *eptr == '0')
6001 /* FLOATING POINT */
6004 c = 'f'; /* maybe %F isn't supported here */
6010 /* This is evil, but floating point is even more evil */
6013 nv = va_arg(*args, NV);
6015 nv = (svix < svmax) ? SvNVx(svargs[svix++]) : 0.0;
6018 if (c != 'e' && c != 'E') {
6020 (void)frexp(nv, &i);
6021 if (i == PERL_INT_MIN)
6022 Perl_die(aTHX_ "panic: frexp");
6024 need = BIT_DIGITS(i);
6026 need += has_precis ? precis : 6; /* known default */
6030 need += 20; /* fudge factor */
6031 if (PL_efloatsize < need) {
6032 Safefree(PL_efloatbuf);
6033 PL_efloatsize = need + 20; /* more fudge */
6034 New(906, PL_efloatbuf, PL_efloatsize, char);
6035 PL_efloatbuf[0] = '\0';
6038 eptr = ebuf + sizeof ebuf;
6041 #ifdef USE_LONG_DOUBLE
6043 char* p = PERL_PRIfldbl + sizeof(PERL_PRIfldbl) - 3;
6044 while (p >= PERL_PRIfldbl) { *--eptr = *p--; }
6049 do { *--eptr = '0' + (base % 10); } while (base /= 10);
6054 do { *--eptr = '0' + (base % 10); } while (base /= 10);
6067 RESTORE_NUMERIC_STANDARD();
6068 (void)sprintf(PL_efloatbuf, eptr, nv);
6069 RESTORE_NUMERIC_LOCAL();
6072 eptr = PL_efloatbuf;
6073 elen = strlen(PL_efloatbuf);
6079 i = SvCUR(sv) - origlen;
6082 case 'h': *(va_arg(*args, short*)) = i; break;
6083 default: *(va_arg(*args, int*)) = i; break;
6084 case 'l': *(va_arg(*args, long*)) = i; break;
6085 case 'V': *(va_arg(*args, IV*)) = i; break;
6087 case 'q': *(va_arg(*args, Quad_t*)) = i; break;
6091 else if (svix < svmax)
6092 sv_setuv(svargs[svix++], (UV)i);
6093 continue; /* not "break" */
6099 if (!args && ckWARN(WARN_PRINTF) &&
6100 (PL_op->op_type == OP_PRTF || PL_op->op_type == OP_SPRINTF)) {
6101 SV *msg = sv_newmortal();
6102 Perl_sv_setpvf(aTHX_ msg, "Invalid conversion in %s: ",
6103 (PL_op->op_type == OP_PRTF) ? "printf" : "sprintf");
6106 Perl_sv_catpvf(aTHX_ msg,
6107 "\"%%%c\"", c & 0xFF);
6109 Perl_sv_catpvf(aTHX_ msg,
6110 "\"%%\\%03"UVof"\"",
6113 sv_catpv(msg, "end of string");
6114 Perl_warner(aTHX_ WARN_PRINTF, "%"SVf, msg); /* yes, this is reentrant */
6117 /* output mangled stuff ... */
6123 /* ... right here, because formatting flags should not apply */
6124 SvGROW(sv, SvCUR(sv) + elen + 1);
6126 memcpy(p, eptr, elen);
6129 SvCUR(sv) = p - SvPVX(sv);
6130 continue; /* not "break" */
6133 have = esignlen + zeros + elen;
6134 need = (have > width ? have : width);
6137 SvGROW(sv, SvCUR(sv) + need + 1);
6139 if (esignlen && fill == '0') {
6140 for (i = 0; i < esignlen; i++)
6144 memset(p, fill, gap);
6147 if (esignlen && fill != '0') {
6148 for (i = 0; i < esignlen; i++)
6152 for (i = zeros; i; i--)
6156 memcpy(p, eptr, elen);
6160 memset(p, ' ', gap);
6166 SvCUR(sv) = p - SvPVX(sv);
6170 #if defined(USE_ITHREADS)
6172 #if defined(USE_THREADS)
6173 # include "error: USE_THREADS and USE_ITHREADS are incompatible"
6176 #ifndef OpREFCNT_inc
6177 # define OpREFCNT_inc(o) ((o) ? (++(o)->op_targ, (o)) : Nullop)
6180 #ifndef GpREFCNT_inc
6181 # define GpREFCNT_inc(gp) ((gp) ? (++(gp)->gp_refcnt, (gp)) : (GP*)NULL)
6185 #define sv_dup_inc(s) SvREFCNT_inc(sv_dup(s))
6186 #define av_dup(s) (AV*)sv_dup((SV*)s)
6187 #define av_dup_inc(s) (AV*)SvREFCNT_inc(sv_dup((SV*)s))
6188 #define hv_dup(s) (HV*)sv_dup((SV*)s)
6189 #define hv_dup_inc(s) (HV*)SvREFCNT_inc(sv_dup((SV*)s))
6190 #define cv_dup(s) (CV*)sv_dup((SV*)s)
6191 #define cv_dup_inc(s) (CV*)SvREFCNT_inc(sv_dup((SV*)s))
6192 #define io_dup(s) (IO*)sv_dup((SV*)s)
6193 #define io_dup_inc(s) (IO*)SvREFCNT_inc(sv_dup((SV*)s))
6194 #define gv_dup(s) (GV*)sv_dup((SV*)s)
6195 #define gv_dup_inc(s) (GV*)SvREFCNT_inc(sv_dup((SV*)s))
6196 #define SAVEPV(p) (p ? savepv(p) : Nullch)
6197 #define SAVEPVN(p,n) (p ? savepvn(p,n) : Nullch)
6200 Perl_re_dup(pTHX_ REGEXP *r)
6202 /* XXX fix when pmop->op_pmregexp becomes shared */
6203 return ReREFCNT_inc(r);
6207 Perl_fp_dup(pTHX_ PerlIO *fp, char type)
6211 return (PerlIO*)NULL;
6213 /* look for it in the table first */
6214 ret = (PerlIO*)ptr_table_fetch(PL_ptr_table, fp);
6218 /* create anew and remember what it is */
6219 ret = PerlIO_fdupopen(fp);
6220 ptr_table_store(PL_ptr_table, fp, ret);
6225 Perl_dirp_dup(pTHX_ DIR *dp)
6234 Perl_gp_dup(pTHX_ GP *gp)
6239 /* look for it in the table first */
6240 ret = (GP*)ptr_table_fetch(PL_ptr_table, gp);
6244 /* create anew and remember what it is */
6245 Newz(0, ret, 1, GP);
6246 ptr_table_store(PL_ptr_table, gp, ret);
6249 ret->gp_refcnt = 0; /* must be before any other dups! */
6250 ret->gp_sv = sv_dup_inc(gp->gp_sv);
6251 ret->gp_io = io_dup_inc(gp->gp_io);
6252 ret->gp_form = cv_dup_inc(gp->gp_form);
6253 ret->gp_av = av_dup_inc(gp->gp_av);
6254 ret->gp_hv = hv_dup_inc(gp->gp_hv);
6255 ret->gp_egv = gv_dup(gp->gp_egv); /* GvEGV is not refcounted */
6256 ret->gp_cv = cv_dup_inc(gp->gp_cv);
6257 ret->gp_cvgen = gp->gp_cvgen;
6258 ret->gp_flags = gp->gp_flags;
6259 ret->gp_line = gp->gp_line;
6260 ret->gp_file = gp->gp_file; /* points to COP.cop_file */
6265 Perl_mg_dup(pTHX_ MAGIC *mg)
6267 MAGIC *mgret = (MAGIC*)NULL;
6270 return (MAGIC*)NULL;
6271 /* look for it in the table first */
6272 mgret = (MAGIC*)ptr_table_fetch(PL_ptr_table, mg);
6276 for (; mg; mg = mg->mg_moremagic) {
6278 Newz(0, nmg, 1, MAGIC);
6282 mgprev->mg_moremagic = nmg;
6283 nmg->mg_virtual = mg->mg_virtual; /* XXX copy dynamic vtable? */
6284 nmg->mg_private = mg->mg_private;
6285 nmg->mg_type = mg->mg_type;
6286 nmg->mg_flags = mg->mg_flags;
6287 if (mg->mg_type == 'r') {
6288 nmg->mg_obj = (SV*)re_dup((REGEXP*)mg->mg_obj);
6291 nmg->mg_obj = (mg->mg_flags & MGf_REFCOUNTED)
6292 ? sv_dup_inc(mg->mg_obj)
6293 : sv_dup(mg->mg_obj);
6295 nmg->mg_len = mg->mg_len;
6296 nmg->mg_ptr = mg->mg_ptr; /* XXX random ptr? */
6297 if (mg->mg_ptr && mg->mg_type != 'g') {
6298 if (mg->mg_len >= 0) {
6299 nmg->mg_ptr = SAVEPVN(mg->mg_ptr, mg->mg_len);
6300 if (mg->mg_type == 'c' && AMT_AMAGIC((AMT*)mg->mg_ptr)) {
6301 AMT *amtp = (AMT*)mg->mg_ptr;
6302 AMT *namtp = (AMT*)nmg->mg_ptr;
6304 for (i = 1; i < NofAMmeth; i++) {
6305 namtp->table[i] = cv_dup_inc(amtp->table[i]);
6309 else if (mg->mg_len == HEf_SVKEY)
6310 nmg->mg_ptr = (char*)sv_dup_inc((SV*)mg->mg_ptr);
6318 Perl_ptr_table_new(pTHX)
6321 Newz(0, tbl, 1, PTR_TBL_t);
6324 Newz(0, tbl->tbl_ary, tbl->tbl_max + 1, PTR_TBL_ENT_t*);
6329 Perl_ptr_table_fetch(pTHX_ PTR_TBL_t *tbl, void *sv)
6331 PTR_TBL_ENT_t *tblent;
6332 UV hash = PTR2UV(sv);
6334 tblent = tbl->tbl_ary[hash & tbl->tbl_max];
6335 for (; tblent; tblent = tblent->next) {
6336 if (tblent->oldval == sv)
6337 return tblent->newval;
6343 Perl_ptr_table_store(pTHX_ PTR_TBL_t *tbl, void *oldv, void *newv)
6345 PTR_TBL_ENT_t *tblent, **otblent;
6346 /* XXX this may be pessimal on platforms where pointers aren't good
6347 * hash values e.g. if they grow faster in the most significant
6349 UV hash = PTR2UV(oldv);
6353 otblent = &tbl->tbl_ary[hash & tbl->tbl_max];
6354 for (tblent = *otblent; tblent; i=0, tblent = tblent->next) {
6355 if (tblent->oldval == oldv) {
6356 tblent->newval = newv;
6361 Newz(0, tblent, 1, PTR_TBL_ENT_t);
6362 tblent->oldval = oldv;
6363 tblent->newval = newv;
6364 tblent->next = *otblent;
6367 if (i && tbl->tbl_items > tbl->tbl_max)
6368 ptr_table_split(tbl);
6372 Perl_ptr_table_split(pTHX_ PTR_TBL_t *tbl)
6374 PTR_TBL_ENT_t **ary = tbl->tbl_ary;
6375 UV oldsize = tbl->tbl_max + 1;
6376 UV newsize = oldsize * 2;
6379 Renew(ary, newsize, PTR_TBL_ENT_t*);
6380 Zero(&ary[oldsize], newsize-oldsize, PTR_TBL_ENT_t*);
6381 tbl->tbl_max = --newsize;
6383 for (i=0; i < oldsize; i++, ary++) {
6384 PTR_TBL_ENT_t **curentp, **entp, *ent;
6387 curentp = ary + oldsize;
6388 for (entp = ary, ent = *ary; ent; ent = *entp) {
6389 if ((newsize & PTR2UV(ent->oldval)) != i) {
6391 ent->next = *curentp;
6406 Perl_sv_dup(pTHX_ SV *sstr)
6413 if (!sstr || SvTYPE(sstr) == SVTYPEMASK)
6415 /* look for it in the table first */
6416 dstr = (SV*)ptr_table_fetch(PL_ptr_table, sstr);
6420 /* create anew and remember what it is */
6422 ptr_table_store(PL_ptr_table, sstr, dstr);
6425 SvFLAGS(dstr) = SvFLAGS(sstr);
6426 SvFLAGS(dstr) &= ~SVf_OOK; /* don't propagate OOK hack */
6427 SvREFCNT(dstr) = 0; /* must be before any other dups! */
6430 if (SvANY(sstr) && PL_watch_pvx && SvPVX(sstr) == PL_watch_pvx)
6431 PerlIO_printf(Perl_debug_log, "watch at %p hit, found string \"%s\"\n",
6432 PL_watch_pvx, SvPVX(sstr));
6435 switch (SvTYPE(sstr)) {
6440 SvANY(dstr) = new_XIV();
6441 SvIVX(dstr) = SvIVX(sstr);
6444 SvANY(dstr) = new_XNV();
6445 SvNVX(dstr) = SvNVX(sstr);
6448 SvANY(dstr) = new_XRV();
6449 SvRV(dstr) = sv_dup_inc(SvRV(sstr));
6452 SvANY(dstr) = new_XPV();
6453 SvCUR(dstr) = SvCUR(sstr);
6454 SvLEN(dstr) = SvLEN(sstr);
6456 SvRV(dstr) = sv_dup_inc(SvRV(sstr));
6457 else if (SvPVX(sstr) && SvLEN(sstr))
6458 SvPVX(dstr) = SAVEPVN(SvPVX(sstr), SvLEN(sstr)-1);
6460 SvPVX(dstr) = SvPVX(sstr); /* XXX shared string/random ptr? */
6463 SvANY(dstr) = new_XPVIV();
6464 SvCUR(dstr) = SvCUR(sstr);
6465 SvLEN(dstr) = SvLEN(sstr);
6466 SvIVX(dstr) = SvIVX(sstr);
6468 SvRV(dstr) = sv_dup_inc(SvRV(sstr));
6469 else if (SvPVX(sstr) && SvLEN(sstr))
6470 SvPVX(dstr) = SAVEPVN(SvPVX(sstr), SvLEN(sstr)-1);
6472 SvPVX(dstr) = SvPVX(sstr); /* XXX shared string/random ptr? */
6475 SvANY(dstr) = new_XPVNV();
6476 SvCUR(dstr) = SvCUR(sstr);
6477 SvLEN(dstr) = SvLEN(sstr);
6478 SvIVX(dstr) = SvIVX(sstr);
6479 SvNVX(dstr) = SvNVX(sstr);
6481 SvRV(dstr) = sv_dup_inc(SvRV(sstr));
6482 else if (SvPVX(sstr) && SvLEN(sstr))
6483 SvPVX(dstr) = SAVEPVN(SvPVX(sstr), SvLEN(sstr)-1);
6485 SvPVX(dstr) = SvPVX(sstr); /* XXX shared string/random ptr? */
6488 SvANY(dstr) = new_XPVMG();
6489 SvCUR(dstr) = SvCUR(sstr);
6490 SvLEN(dstr) = SvLEN(sstr);
6491 SvIVX(dstr) = SvIVX(sstr);
6492 SvNVX(dstr) = SvNVX(sstr);
6493 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr));
6494 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr));
6496 SvRV(dstr) = sv_dup_inc(SvRV(sstr));
6497 else if (SvPVX(sstr) && SvLEN(sstr))
6498 SvPVX(dstr) = SAVEPVN(SvPVX(sstr), SvLEN(sstr)-1);
6500 SvPVX(dstr) = SvPVX(sstr); /* XXX shared string/random ptr? */
6503 SvANY(dstr) = new_XPVBM();
6504 SvCUR(dstr) = SvCUR(sstr);
6505 SvLEN(dstr) = SvLEN(sstr);
6506 SvIVX(dstr) = SvIVX(sstr);
6507 SvNVX(dstr) = SvNVX(sstr);
6508 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr));
6509 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr));
6511 SvRV(dstr) = sv_dup_inc(SvRV(sstr));
6512 else if (SvPVX(sstr) && SvLEN(sstr))
6513 SvPVX(dstr) = SAVEPVN(SvPVX(sstr), SvLEN(sstr)-1);
6515 SvPVX(dstr) = SvPVX(sstr); /* XXX shared string/random ptr? */
6516 BmRARE(dstr) = BmRARE(sstr);
6517 BmUSEFUL(dstr) = BmUSEFUL(sstr);
6518 BmPREVIOUS(dstr)= BmPREVIOUS(sstr);
6521 SvANY(dstr) = new_XPVLV();
6522 SvCUR(dstr) = SvCUR(sstr);
6523 SvLEN(dstr) = SvLEN(sstr);
6524 SvIVX(dstr) = SvIVX(sstr);
6525 SvNVX(dstr) = SvNVX(sstr);
6526 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr));
6527 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr));
6529 SvRV(dstr) = sv_dup_inc(SvRV(sstr));
6530 else if (SvPVX(sstr) && SvLEN(sstr))
6531 SvPVX(dstr) = SAVEPVN(SvPVX(sstr), SvLEN(sstr)-1);
6533 SvPVX(dstr) = SvPVX(sstr); /* XXX shared string/random ptr? */
6534 LvTARGOFF(dstr) = LvTARGOFF(sstr); /* XXX sometimes holds PMOP* when DEBUGGING */
6535 LvTARGLEN(dstr) = LvTARGLEN(sstr);
6536 LvTARG(dstr) = sv_dup_inc(LvTARG(sstr));
6537 LvTYPE(dstr) = LvTYPE(sstr);
6540 SvANY(dstr) = new_XPVGV();
6541 SvCUR(dstr) = SvCUR(sstr);
6542 SvLEN(dstr) = SvLEN(sstr);
6543 SvIVX(dstr) = SvIVX(sstr);
6544 SvNVX(dstr) = SvNVX(sstr);
6545 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr));
6546 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr));
6548 SvRV(dstr) = sv_dup_inc(SvRV(sstr));
6549 else if (SvPVX(sstr) && SvLEN(sstr))
6550 SvPVX(dstr) = SAVEPVN(SvPVX(sstr), SvLEN(sstr)-1);
6552 SvPVX(dstr) = SvPVX(sstr); /* XXX shared string/random ptr? */
6553 GvNAMELEN(dstr) = GvNAMELEN(sstr);
6554 GvNAME(dstr) = SAVEPVN(GvNAME(sstr), GvNAMELEN(sstr));
6555 GvSTASH(dstr) = hv_dup_inc(GvSTASH(sstr));
6556 GvFLAGS(dstr) = GvFLAGS(sstr);
6557 GvGP(dstr) = gp_dup(GvGP(sstr));
6558 (void)GpREFCNT_inc(GvGP(dstr));
6561 SvANY(dstr) = new_XPVIO();
6562 SvCUR(dstr) = SvCUR(sstr);
6563 SvLEN(dstr) = SvLEN(sstr);
6564 SvIVX(dstr) = SvIVX(sstr);
6565 SvNVX(dstr) = SvNVX(sstr);
6566 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr));
6567 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr));
6569 SvRV(dstr) = sv_dup_inc(SvRV(sstr));
6570 else if (SvPVX(sstr) && SvLEN(sstr))
6571 SvPVX(dstr) = SAVEPVN(SvPVX(sstr), SvLEN(sstr)-1);
6573 SvPVX(dstr) = SvPVX(sstr); /* XXX shared string/random ptr? */
6574 IoIFP(dstr) = fp_dup(IoIFP(sstr), IoTYPE(sstr));
6575 if (IoOFP(sstr) == IoIFP(sstr))
6576 IoOFP(dstr) = IoIFP(dstr);
6578 IoOFP(dstr) = fp_dup(IoOFP(sstr), IoTYPE(sstr));
6579 /* PL_rsfp_filters entries have fake IoDIRP() */
6580 if (IoDIRP(sstr) && !(IoFLAGS(sstr) & IOf_FAKE_DIRP))
6581 IoDIRP(dstr) = dirp_dup(IoDIRP(sstr));
6583 IoDIRP(dstr) = IoDIRP(sstr);
6584 IoLINES(dstr) = IoLINES(sstr);
6585 IoPAGE(dstr) = IoPAGE(sstr);
6586 IoPAGE_LEN(dstr) = IoPAGE_LEN(sstr);
6587 IoLINES_LEFT(dstr) = IoLINES_LEFT(sstr);
6588 IoTOP_NAME(dstr) = SAVEPV(IoTOP_NAME(sstr));
6589 IoTOP_GV(dstr) = gv_dup(IoTOP_GV(sstr));
6590 IoFMT_NAME(dstr) = SAVEPV(IoFMT_NAME(sstr));
6591 IoFMT_GV(dstr) = gv_dup(IoFMT_GV(sstr));
6592 IoBOTTOM_NAME(dstr) = SAVEPV(IoBOTTOM_NAME(sstr));
6593 IoBOTTOM_GV(dstr) = gv_dup(IoBOTTOM_GV(sstr));
6594 IoSUBPROCESS(dstr) = IoSUBPROCESS(sstr);
6595 IoTYPE(dstr) = IoTYPE(sstr);
6596 IoFLAGS(dstr) = IoFLAGS(sstr);
6599 SvANY(dstr) = new_XPVAV();
6600 SvCUR(dstr) = SvCUR(sstr);
6601 SvLEN(dstr) = SvLEN(sstr);
6602 SvIVX(dstr) = SvIVX(sstr);
6603 SvNVX(dstr) = SvNVX(sstr);
6604 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr));
6605 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr));
6606 AvARYLEN((AV*)dstr) = sv_dup_inc(AvARYLEN((AV*)sstr));
6607 AvFLAGS((AV*)dstr) = AvFLAGS((AV*)sstr);
6608 if (AvARRAY((AV*)sstr)) {
6609 SV **dst_ary, **src_ary;
6610 SSize_t items = AvFILLp((AV*)sstr) + 1;
6612 src_ary = AvARRAY((AV*)sstr);
6613 Newz(0, dst_ary, AvMAX((AV*)sstr)+1, SV*);
6614 ptr_table_store(PL_ptr_table, src_ary, dst_ary);
6615 SvPVX(dstr) = (char*)dst_ary;
6616 AvALLOC((AV*)dstr) = dst_ary;
6617 if (AvREAL((AV*)sstr)) {
6619 *dst_ary++ = sv_dup_inc(*src_ary++);
6623 *dst_ary++ = sv_dup(*src_ary++);
6625 items = AvMAX((AV*)sstr) - AvFILLp((AV*)sstr);
6626 while (items-- > 0) {
6627 *dst_ary++ = &PL_sv_undef;
6631 SvPVX(dstr) = Nullch;
6632 AvALLOC((AV*)dstr) = (SV**)NULL;
6636 SvANY(dstr) = new_XPVHV();
6637 SvCUR(dstr) = SvCUR(sstr);
6638 SvLEN(dstr) = SvLEN(sstr);
6639 SvIVX(dstr) = SvIVX(sstr);
6640 SvNVX(dstr) = SvNVX(sstr);
6641 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr));
6642 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr));
6643 HvRITER((HV*)dstr) = HvRITER((HV*)sstr);
6644 if (HvARRAY((HV*)sstr)) {
6647 XPVHV *dxhv = (XPVHV*)SvANY(dstr);
6648 XPVHV *sxhv = (XPVHV*)SvANY(sstr);
6649 Newz(0, dxhv->xhv_array,
6650 PERL_HV_ARRAY_ALLOC_BYTES(dxhv->xhv_max+1), char);
6651 while (i <= sxhv->xhv_max) {
6652 ((HE**)dxhv->xhv_array)[i] = he_dup(((HE**)sxhv->xhv_array)[i],
6653 !!HvSHAREKEYS(sstr));
6656 dxhv->xhv_eiter = he_dup(sxhv->xhv_eiter, !!HvSHAREKEYS(sstr));
6659 SvPVX(dstr) = Nullch;
6660 HvEITER((HV*)dstr) = (HE*)NULL;
6662 HvPMROOT((HV*)dstr) = HvPMROOT((HV*)sstr); /* XXX */
6663 HvNAME((HV*)dstr) = SAVEPV(HvNAME((HV*)sstr));
6666 SvANY(dstr) = new_XPVFM();
6667 FmLINES(dstr) = FmLINES(sstr);
6671 SvANY(dstr) = new_XPVCV();
6673 SvCUR(dstr) = SvCUR(sstr);
6674 SvLEN(dstr) = SvLEN(sstr);
6675 SvIVX(dstr) = SvIVX(sstr);
6676 SvNVX(dstr) = SvNVX(sstr);
6677 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr));
6678 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr));
6679 if (SvPVX(sstr) && SvLEN(sstr))
6680 SvPVX(dstr) = SAVEPVN(SvPVX(sstr), SvLEN(sstr)-1);
6682 SvPVX(dstr) = SvPVX(sstr); /* XXX shared string/random ptr? */
6683 CvSTASH(dstr) = hv_dup(CvSTASH(sstr));/* NOTE: not refcounted */
6684 CvSTART(dstr) = CvSTART(sstr);
6685 CvROOT(dstr) = OpREFCNT_inc(CvROOT(sstr));
6686 CvXSUB(dstr) = CvXSUB(sstr);
6687 CvXSUBANY(dstr) = CvXSUBANY(sstr);
6688 CvGV(dstr) = gv_dup_inc(CvGV(sstr));
6689 CvDEPTH(dstr) = CvDEPTH(sstr);
6690 if (CvPADLIST(sstr) && !AvREAL(CvPADLIST(sstr))) {
6691 /* XXX padlists are real, but pretend to be not */
6692 AvREAL_on(CvPADLIST(sstr));
6693 CvPADLIST(dstr) = av_dup_inc(CvPADLIST(sstr));
6694 AvREAL_off(CvPADLIST(sstr));
6695 AvREAL_off(CvPADLIST(dstr));
6698 CvPADLIST(dstr) = av_dup_inc(CvPADLIST(sstr));
6699 CvOUTSIDE(dstr) = cv_dup_inc(CvOUTSIDE(sstr));
6700 CvFLAGS(dstr) = CvFLAGS(sstr);
6703 Perl_croak(aTHX_ "Bizarre SvTYPE [%d]", SvTYPE(sstr));
6707 if (SvOBJECT(dstr) && SvTYPE(dstr) != SVt_PVIO)
6714 Perl_cx_dup(pTHX_ PERL_CONTEXT *cxs, I32 ix, I32 max)
6719 return (PERL_CONTEXT*)NULL;
6721 /* look for it in the table first */
6722 ncxs = (PERL_CONTEXT*)ptr_table_fetch(PL_ptr_table, cxs);
6726 /* create anew and remember what it is */
6727 Newz(56, ncxs, max + 1, PERL_CONTEXT);
6728 ptr_table_store(PL_ptr_table, cxs, ncxs);
6731 PERL_CONTEXT *cx = &cxs[ix];
6732 PERL_CONTEXT *ncx = &ncxs[ix];
6733 ncx->cx_type = cx->cx_type;
6734 if (CxTYPE(cx) == CXt_SUBST) {
6735 Perl_croak(aTHX_ "Cloning substitution context is unimplemented");
6738 ncx->blk_oldsp = cx->blk_oldsp;
6739 ncx->blk_oldcop = cx->blk_oldcop;
6740 ncx->blk_oldretsp = cx->blk_oldretsp;
6741 ncx->blk_oldmarksp = cx->blk_oldmarksp;
6742 ncx->blk_oldscopesp = cx->blk_oldscopesp;
6743 ncx->blk_oldpm = cx->blk_oldpm;
6744 ncx->blk_gimme = cx->blk_gimme;
6745 switch (CxTYPE(cx)) {
6747 ncx->blk_sub.cv = (cx->blk_sub.olddepth == 0
6748 ? cv_dup_inc(cx->blk_sub.cv)
6749 : cv_dup(cx->blk_sub.cv));
6750 ncx->blk_sub.argarray = (cx->blk_sub.hasargs
6751 ? av_dup_inc(cx->blk_sub.argarray)
6753 ncx->blk_sub.savearray = av_dup(cx->blk_sub.savearray);
6754 ncx->blk_sub.olddepth = cx->blk_sub.olddepth;
6755 ncx->blk_sub.hasargs = cx->blk_sub.hasargs;
6756 ncx->blk_sub.lval = cx->blk_sub.lval;
6759 ncx->blk_eval.old_in_eval = cx->blk_eval.old_in_eval;
6760 ncx->blk_eval.old_op_type = cx->blk_eval.old_op_type;
6761 ncx->blk_eval.old_namesv = sv_dup_inc(cx->blk_eval.old_namesv);
6762 ncx->blk_eval.old_eval_root = cx->blk_eval.old_eval_root;
6763 ncx->blk_eval.cur_text = sv_dup(cx->blk_eval.cur_text);
6766 ncx->blk_loop.label = cx->blk_loop.label;
6767 ncx->blk_loop.resetsp = cx->blk_loop.resetsp;
6768 ncx->blk_loop.redo_op = cx->blk_loop.redo_op;
6769 ncx->blk_loop.next_op = cx->blk_loop.next_op;
6770 ncx->blk_loop.last_op = cx->blk_loop.last_op;
6771 ncx->blk_loop.iterdata = (CxPADLOOP(cx)
6772 ? cx->blk_loop.iterdata
6773 : gv_dup((GV*)cx->blk_loop.iterdata));
6774 ncx->blk_loop.itersave = sv_dup_inc(cx->blk_loop.itersave);
6775 ncx->blk_loop.iterlval = sv_dup_inc(cx->blk_loop.iterlval);
6776 ncx->blk_loop.iterary = av_dup_inc(cx->blk_loop.iterary);
6777 ncx->blk_loop.iterix = cx->blk_loop.iterix;
6778 ncx->blk_loop.itermax = cx->blk_loop.itermax;
6781 ncx->blk_sub.cv = cv_dup(cx->blk_sub.cv);
6782 ncx->blk_sub.gv = gv_dup(cx->blk_sub.gv);
6783 ncx->blk_sub.dfoutgv = gv_dup_inc(cx->blk_sub.dfoutgv);
6784 ncx->blk_sub.hasargs = cx->blk_sub.hasargs;
6797 Perl_si_dup(pTHX_ PERL_SI *si)
6802 return (PERL_SI*)NULL;
6804 /* look for it in the table first */
6805 nsi = (PERL_SI*)ptr_table_fetch(PL_ptr_table, si);
6809 /* create anew and remember what it is */
6810 Newz(56, nsi, 1, PERL_SI);
6811 ptr_table_store(PL_ptr_table, si, nsi);
6813 nsi->si_stack = av_dup_inc(si->si_stack);
6814 nsi->si_cxix = si->si_cxix;
6815 nsi->si_cxmax = si->si_cxmax;
6816 nsi->si_cxstack = cx_dup(si->si_cxstack, si->si_cxix, si->si_cxmax);
6817 nsi->si_type = si->si_type;
6818 nsi->si_prev = si_dup(si->si_prev);
6819 nsi->si_next = si_dup(si->si_next);
6820 nsi->si_markoff = si->si_markoff;
6825 #define POPINT(ss,ix) ((ss)[--(ix)].any_i32)
6826 #define TOPINT(ss,ix) ((ss)[ix].any_i32)
6827 #define POPLONG(ss,ix) ((ss)[--(ix)].any_long)
6828 #define TOPLONG(ss,ix) ((ss)[ix].any_long)
6829 #define POPIV(ss,ix) ((ss)[--(ix)].any_iv)
6830 #define TOPIV(ss,ix) ((ss)[ix].any_iv)
6831 #define POPPTR(ss,ix) ((ss)[--(ix)].any_ptr)
6832 #define TOPPTR(ss,ix) ((ss)[ix].any_ptr)
6833 #define POPDPTR(ss,ix) ((ss)[--(ix)].any_dptr)
6834 #define TOPDPTR(ss,ix) ((ss)[ix].any_dptr)
6835 #define POPDXPTR(ss,ix) ((ss)[--(ix)].any_dxptr)
6836 #define TOPDXPTR(ss,ix) ((ss)[ix].any_dxptr)
6839 #define pv_dup_inc(p) SAVEPV(p)
6840 #define pv_dup(p) SAVEPV(p)
6841 #define svp_dup_inc(p,pp) any_dup(p,pp)
6844 Perl_any_dup(pTHX_ void *v, PerlInterpreter *proto_perl)
6851 /* look for it in the table first */
6852 ret = ptr_table_fetch(PL_ptr_table, v);
6856 /* see if it is part of the interpreter structure */
6857 if (v >= (void*)proto_perl && v < (void*)(proto_perl+1))
6858 ret = (void*)(((char*)aTHXo) + (((char*)v) - (char*)proto_perl));
6866 Perl_ss_dup(pTHX_ PerlInterpreter *proto_perl)
6868 ANY *ss = proto_perl->Tsavestack;
6869 I32 ix = proto_perl->Tsavestack_ix;
6870 I32 max = proto_perl->Tsavestack_max;
6883 void (*dptr) (void*);
6884 void (*dxptr) (pTHXo_ void*);
6886 Newz(54, nss, max, ANY);
6892 case SAVEt_ITEM: /* normal string */
6893 sv = (SV*)POPPTR(ss,ix);
6894 TOPPTR(nss,ix) = sv_dup_inc(sv);
6895 sv = (SV*)POPPTR(ss,ix);
6896 TOPPTR(nss,ix) = sv_dup_inc(sv);
6898 case SAVEt_SV: /* scalar reference */
6899 sv = (SV*)POPPTR(ss,ix);
6900 TOPPTR(nss,ix) = sv_dup_inc(sv);
6901 gv = (GV*)POPPTR(ss,ix);
6902 TOPPTR(nss,ix) = gv_dup_inc(gv);
6904 case SAVEt_GENERIC_SVREF: /* generic sv */
6905 case SAVEt_SVREF: /* scalar reference */
6906 sv = (SV*)POPPTR(ss,ix);
6907 TOPPTR(nss,ix) = sv_dup_inc(sv);
6908 ptr = POPPTR(ss,ix);
6909 TOPPTR(nss,ix) = svp_dup_inc((SV**)ptr, proto_perl);/* XXXXX */
6911 case SAVEt_AV: /* array reference */
6912 av = (AV*)POPPTR(ss,ix);
6913 TOPPTR(nss,ix) = av_dup_inc(av);
6914 gv = (GV*)POPPTR(ss,ix);
6915 TOPPTR(nss,ix) = gv_dup(gv);
6917 case SAVEt_HV: /* hash reference */
6918 hv = (HV*)POPPTR(ss,ix);
6919 TOPPTR(nss,ix) = hv_dup_inc(hv);
6920 gv = (GV*)POPPTR(ss,ix);
6921 TOPPTR(nss,ix) = gv_dup(gv);
6923 case SAVEt_INT: /* int reference */
6924 ptr = POPPTR(ss,ix);
6925 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
6926 intval = (int)POPINT(ss,ix);
6927 TOPINT(nss,ix) = intval;
6929 case SAVEt_LONG: /* long reference */
6930 ptr = POPPTR(ss,ix);
6931 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
6932 longval = (long)POPLONG(ss,ix);
6933 TOPLONG(nss,ix) = longval;
6935 case SAVEt_I32: /* I32 reference */
6936 case SAVEt_I16: /* I16 reference */
6937 case SAVEt_I8: /* I8 reference */
6938 ptr = POPPTR(ss,ix);
6939 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
6943 case SAVEt_IV: /* IV reference */
6944 ptr = POPPTR(ss,ix);
6945 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
6949 case SAVEt_SPTR: /* SV* reference */
6950 ptr = POPPTR(ss,ix);
6951 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
6952 sv = (SV*)POPPTR(ss,ix);
6953 TOPPTR(nss,ix) = sv_dup(sv);
6955 case SAVEt_VPTR: /* random* reference */
6956 ptr = POPPTR(ss,ix);
6957 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
6958 ptr = POPPTR(ss,ix);
6959 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
6961 case SAVEt_PPTR: /* char* reference */
6962 ptr = POPPTR(ss,ix);
6963 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
6964 c = (char*)POPPTR(ss,ix);
6965 TOPPTR(nss,ix) = pv_dup(c);
6967 case SAVEt_HPTR: /* HV* reference */
6968 ptr = POPPTR(ss,ix);
6969 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
6970 hv = (HV*)POPPTR(ss,ix);
6971 TOPPTR(nss,ix) = hv_dup(hv);
6973 case SAVEt_APTR: /* AV* reference */
6974 ptr = POPPTR(ss,ix);
6975 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
6976 av = (AV*)POPPTR(ss,ix);
6977 TOPPTR(nss,ix) = av_dup(av);
6980 gv = (GV*)POPPTR(ss,ix);
6981 TOPPTR(nss,ix) = gv_dup(gv);
6983 case SAVEt_GP: /* scalar reference */
6984 gp = (GP*)POPPTR(ss,ix);
6985 TOPPTR(nss,ix) = gp = gp_dup(gp);
6986 (void)GpREFCNT_inc(gp);
6987 gv = (GV*)POPPTR(ss,ix);
6988 TOPPTR(nss,ix) = gv_dup_inc(c);
6989 c = (char*)POPPTR(ss,ix);
6990 TOPPTR(nss,ix) = pv_dup(c);
6997 sv = (SV*)POPPTR(ss,ix);
6998 TOPPTR(nss,ix) = sv_dup_inc(sv);
7001 ptr = POPPTR(ss,ix);
7002 if (ptr && (((OP*)ptr)->op_private & OPpREFCOUNTED)) {
7003 /* these are assumed to be refcounted properly */
7004 switch (((OP*)ptr)->op_type) {
7011 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
7014 TOPPTR(nss,ix) = Nullop;
7019 TOPPTR(nss,ix) = Nullop;
7022 c = (char*)POPPTR(ss,ix);
7023 TOPPTR(nss,ix) = pv_dup_inc(c);
7026 longval = POPLONG(ss,ix);
7027 TOPLONG(nss,ix) = longval;
7030 hv = (HV*)POPPTR(ss,ix);
7031 TOPPTR(nss,ix) = hv_dup_inc(hv);
7032 c = (char*)POPPTR(ss,ix);
7033 TOPPTR(nss,ix) = pv_dup_inc(c);
7037 case SAVEt_DESTRUCTOR:
7038 ptr = POPPTR(ss,ix);
7039 TOPPTR(nss,ix) = any_dup(ptr, proto_perl); /* XXX quite arbitrary */
7040 dptr = POPDPTR(ss,ix);
7041 TOPDPTR(nss,ix) = (void (*)(void*))any_dup(dptr, proto_perl);
7043 case SAVEt_DESTRUCTOR_X:
7044 ptr = POPPTR(ss,ix);
7045 TOPPTR(nss,ix) = any_dup(ptr, proto_perl); /* XXX quite arbitrary */
7046 dxptr = POPDXPTR(ss,ix);
7047 TOPDXPTR(nss,ix) = (void (*)(pTHXo_ void*))any_dup(dxptr, proto_perl);
7049 case SAVEt_REGCONTEXT:
7055 case SAVEt_STACK_POS: /* Position on Perl stack */
7059 case SAVEt_AELEM: /* array element */
7060 sv = (SV*)POPPTR(ss,ix);
7061 TOPPTR(nss,ix) = sv_dup_inc(sv);
7064 av = (AV*)POPPTR(ss,ix);
7065 TOPPTR(nss,ix) = av_dup_inc(av);
7067 case SAVEt_HELEM: /* hash element */
7068 sv = (SV*)POPPTR(ss,ix);
7069 TOPPTR(nss,ix) = sv_dup_inc(sv);
7070 sv = (SV*)POPPTR(ss,ix);
7071 TOPPTR(nss,ix) = sv_dup_inc(sv);
7072 hv = (HV*)POPPTR(ss,ix);
7073 TOPPTR(nss,ix) = hv_dup_inc(hv);
7076 ptr = POPPTR(ss,ix);
7077 TOPPTR(nss,ix) = ptr;
7084 av = (AV*)POPPTR(ss,ix);
7085 TOPPTR(nss,ix) = av_dup(av);
7088 Perl_croak(aTHX_ "panic: ss_dup inconsistency");
7100 perl_clone(PerlInterpreter *proto_perl, UV flags)
7103 CPerlObj *pPerl = (CPerlObj*)proto_perl;
7106 #ifdef PERL_IMPLICIT_SYS
7107 return perl_clone_using(proto_perl, flags,
7109 proto_perl->IMemShared,
7110 proto_perl->IMemParse,
7120 perl_clone_using(PerlInterpreter *proto_perl, UV flags,
7121 struct IPerlMem* ipM, struct IPerlMem* ipMS,
7122 struct IPerlMem* ipMP, struct IPerlEnv* ipE,
7123 struct IPerlStdIO* ipStd, struct IPerlLIO* ipLIO,
7124 struct IPerlDir* ipD, struct IPerlSock* ipS,
7125 struct IPerlProc* ipP)
7127 /* XXX many of the string copies here can be optimized if they're
7128 * constants; they need to be allocated as common memory and just
7129 * their pointers copied. */
7135 CPerlObj *pPerl = new(ipM) CPerlObj(ipM, ipMS, ipMP, ipE, ipStd, ipLIO,
7137 PERL_SET_INTERP(pPerl);
7138 # else /* !PERL_OBJECT */
7139 PerlInterpreter *my_perl = (PerlInterpreter*)(*ipM->pMalloc)(ipM, sizeof(PerlInterpreter));
7140 PERL_SET_INTERP(my_perl);
7143 memset(my_perl, 0xab, sizeof(PerlInterpreter));
7148 # else /* !DEBUGGING */
7149 Zero(my_perl, 1, PerlInterpreter);
7150 # endif /* DEBUGGING */
7154 PL_MemShared = ipMS;
7162 # endif /* PERL_OBJECT */
7163 #else /* !PERL_IMPLICIT_SYS */
7167 PerlInterpreter *my_perl = (PerlInterpreter*)PerlMem_malloc(sizeof(PerlInterpreter));
7168 PERL_SET_INTERP(my_perl);
7171 memset(my_perl, 0xab, sizeof(PerlInterpreter));
7176 # else /* !DEBUGGING */
7177 Zero(my_perl, 1, PerlInterpreter);
7178 # endif /* DEBUGGING */
7179 #endif /* PERL_IMPLICIT_SYS */
7182 PL_xiv_arenaroot = NULL;
7187 PL_xpviv_root = NULL;
7188 PL_xpvnv_root = NULL;
7189 PL_xpvcv_root = NULL;
7190 PL_xpvav_root = NULL;
7191 PL_xpvhv_root = NULL;
7192 PL_xpvmg_root = NULL;
7193 PL_xpvlv_root = NULL;
7194 PL_xpvbm_root = NULL;
7196 PL_nice_chunk = NULL;
7197 PL_nice_chunk_size = 0;
7200 PL_sv_root = Nullsv;
7201 PL_sv_arenaroot = Nullsv;
7203 PL_debug = proto_perl->Idebug;
7205 /* create SV map for pointer relocation */
7206 PL_ptr_table = ptr_table_new();
7208 /* initialize these special pointers as early as possible */
7209 SvANY(&PL_sv_undef) = NULL;
7210 SvREFCNT(&PL_sv_undef) = (~(U32)0)/2;
7211 SvFLAGS(&PL_sv_undef) = SVf_READONLY|SVt_NULL;
7212 ptr_table_store(PL_ptr_table, &proto_perl->Isv_undef, &PL_sv_undef);
7215 SvUPGRADE(&PL_sv_no, SVt_PVNV);
7217 SvANY(&PL_sv_no) = new_XPVNV();
7219 SvREFCNT(&PL_sv_no) = (~(U32)0)/2;
7220 SvFLAGS(&PL_sv_no) = SVp_NOK|SVf_NOK|SVp_POK|SVf_POK|SVf_READONLY|SVt_PVNV;
7221 SvPVX(&PL_sv_no) = SAVEPVN(PL_No, 0);
7222 SvCUR(&PL_sv_no) = 0;
7223 SvLEN(&PL_sv_no) = 1;
7224 SvNVX(&PL_sv_no) = 0;
7225 ptr_table_store(PL_ptr_table, &proto_perl->Isv_no, &PL_sv_no);
7228 SvUPGRADE(&PL_sv_yes, SVt_PVNV);
7230 SvANY(&PL_sv_yes) = new_XPVNV();
7232 SvREFCNT(&PL_sv_yes) = (~(U32)0)/2;
7233 SvFLAGS(&PL_sv_yes) = SVp_NOK|SVf_NOK|SVp_POK|SVf_POK|SVf_READONLY|SVt_PVNV;
7234 SvPVX(&PL_sv_yes) = SAVEPVN(PL_Yes, 1);
7235 SvCUR(&PL_sv_yes) = 1;
7236 SvLEN(&PL_sv_yes) = 2;
7237 SvNVX(&PL_sv_yes) = 1;
7238 ptr_table_store(PL_ptr_table, &proto_perl->Isv_yes, &PL_sv_yes);
7240 /* create shared string table */
7241 PL_strtab = newHV();
7242 HvSHAREKEYS_off(PL_strtab);
7243 hv_ksplit(PL_strtab, 512);
7244 ptr_table_store(PL_ptr_table, proto_perl->Istrtab, PL_strtab);
7246 PL_compiling = proto_perl->Icompiling;
7247 PL_compiling.cop_stashpv = SAVEPV(PL_compiling.cop_stashpv);
7248 PL_compiling.cop_file = SAVEPV(PL_compiling.cop_file);
7249 ptr_table_store(PL_ptr_table, &proto_perl->Icompiling, &PL_compiling);
7250 if (!specialWARN(PL_compiling.cop_warnings))
7251 PL_compiling.cop_warnings = sv_dup_inc(PL_compiling.cop_warnings);
7252 PL_curcop = (COP*)any_dup(proto_perl->Tcurcop, proto_perl);
7254 /* pseudo environmental stuff */
7255 PL_origargc = proto_perl->Iorigargc;
7257 New(0, PL_origargv, i+1, char*);
7258 PL_origargv[i] = '\0';
7260 PL_origargv[i] = SAVEPV(proto_perl->Iorigargv[i]);
7262 PL_envgv = gv_dup(proto_perl->Ienvgv);
7263 PL_incgv = gv_dup(proto_perl->Iincgv);
7264 PL_hintgv = gv_dup(proto_perl->Ihintgv);
7265 PL_origfilename = SAVEPV(proto_perl->Iorigfilename);
7266 PL_diehook = sv_dup_inc(proto_perl->Idiehook);
7267 PL_warnhook = sv_dup_inc(proto_perl->Iwarnhook);
7270 PL_minus_c = proto_perl->Iminus_c;
7271 PL_patchlevel = sv_dup_inc(proto_perl->Ipatchlevel);
7272 PL_localpatches = proto_perl->Ilocalpatches;
7273 PL_splitstr = proto_perl->Isplitstr;
7274 PL_preprocess = proto_perl->Ipreprocess;
7275 PL_minus_n = proto_perl->Iminus_n;
7276 PL_minus_p = proto_perl->Iminus_p;
7277 PL_minus_l = proto_perl->Iminus_l;
7278 PL_minus_a = proto_perl->Iminus_a;
7279 PL_minus_F = proto_perl->Iminus_F;
7280 PL_doswitches = proto_perl->Idoswitches;
7281 PL_dowarn = proto_perl->Idowarn;
7282 PL_doextract = proto_perl->Idoextract;
7283 PL_sawampersand = proto_perl->Isawampersand;
7284 PL_unsafe = proto_perl->Iunsafe;
7285 PL_inplace = SAVEPV(proto_perl->Iinplace);
7286 PL_e_script = sv_dup_inc(proto_perl->Ie_script);
7287 PL_perldb = proto_perl->Iperldb;
7288 PL_perl_destruct_level = proto_perl->Iperl_destruct_level;
7290 /* magical thingies */
7291 /* XXX time(&PL_basetime) when asked for? */
7292 PL_basetime = proto_perl->Ibasetime;
7293 PL_formfeed = sv_dup(proto_perl->Iformfeed);
7295 PL_maxsysfd = proto_perl->Imaxsysfd;
7296 PL_multiline = proto_perl->Imultiline;
7297 PL_statusvalue = proto_perl->Istatusvalue;
7299 PL_statusvalue_vms = proto_perl->Istatusvalue_vms;
7302 /* shortcuts to various I/O objects */
7303 PL_stdingv = gv_dup(proto_perl->Istdingv);
7304 PL_stderrgv = gv_dup(proto_perl->Istderrgv);
7305 PL_defgv = gv_dup(proto_perl->Idefgv);
7306 PL_argvgv = gv_dup(proto_perl->Iargvgv);
7307 PL_argvoutgv = gv_dup(proto_perl->Iargvoutgv);
7308 PL_argvout_stack = av_dup(proto_perl->Iargvout_stack);
7310 /* shortcuts to regexp stuff */
7311 PL_replgv = gv_dup(proto_perl->Ireplgv);
7313 /* shortcuts to misc objects */
7314 PL_errgv = gv_dup(proto_perl->Ierrgv);
7316 /* shortcuts to debugging objects */
7317 PL_DBgv = gv_dup(proto_perl->IDBgv);
7318 PL_DBline = gv_dup(proto_perl->IDBline);
7319 PL_DBsub = gv_dup(proto_perl->IDBsub);
7320 PL_DBsingle = sv_dup(proto_perl->IDBsingle);
7321 PL_DBtrace = sv_dup(proto_perl->IDBtrace);
7322 PL_DBsignal = sv_dup(proto_perl->IDBsignal);
7323 PL_lineary = av_dup(proto_perl->Ilineary);
7324 PL_dbargs = av_dup(proto_perl->Idbargs);
7327 PL_defstash = hv_dup_inc(proto_perl->Tdefstash);
7328 PL_curstash = hv_dup(proto_perl->Tcurstash);
7329 PL_debstash = hv_dup(proto_perl->Idebstash);
7330 PL_globalstash = hv_dup(proto_perl->Iglobalstash);
7331 PL_curstname = sv_dup_inc(proto_perl->Icurstname);
7333 PL_beginav = av_dup_inc(proto_perl->Ibeginav);
7334 PL_endav = av_dup_inc(proto_perl->Iendav);
7335 PL_checkav = av_dup_inc(proto_perl->Icheckav);
7336 PL_initav = av_dup_inc(proto_perl->Iinitav);
7338 PL_sub_generation = proto_perl->Isub_generation;
7340 /* funky return mechanisms */
7341 PL_forkprocess = proto_perl->Iforkprocess;
7343 /* subprocess state */
7344 PL_fdpid = av_dup_inc(proto_perl->Ifdpid);
7346 /* internal state */
7347 PL_tainting = proto_perl->Itainting;
7348 PL_maxo = proto_perl->Imaxo;
7349 if (proto_perl->Iop_mask)
7350 PL_op_mask = SAVEPVN(proto_perl->Iop_mask, PL_maxo);
7352 PL_op_mask = Nullch;
7354 /* current interpreter roots */
7355 PL_main_cv = cv_dup_inc(proto_perl->Imain_cv);
7356 PL_main_root = OpREFCNT_inc(proto_perl->Imain_root);
7357 PL_main_start = proto_perl->Imain_start;
7358 PL_eval_root = OpREFCNT_inc(proto_perl->Ieval_root);
7359 PL_eval_start = proto_perl->Ieval_start;
7361 /* runtime control stuff */
7362 PL_curcopdb = (COP*)any_dup(proto_perl->Icurcopdb, proto_perl);
7363 PL_copline = proto_perl->Icopline;
7365 PL_filemode = proto_perl->Ifilemode;
7366 PL_lastfd = proto_perl->Ilastfd;
7367 PL_oldname = proto_perl->Ioldname; /* XXX not quite right */
7370 PL_gensym = proto_perl->Igensym;
7371 PL_preambled = proto_perl->Ipreambled;
7372 PL_preambleav = av_dup_inc(proto_perl->Ipreambleav);
7373 PL_laststatval = proto_perl->Ilaststatval;
7374 PL_laststype = proto_perl->Ilaststype;
7375 PL_mess_sv = Nullsv;
7377 PL_orslen = proto_perl->Iorslen;
7378 PL_ors = SAVEPVN(proto_perl->Iors, PL_orslen);
7379 PL_ofmt = SAVEPV(proto_perl->Iofmt);
7381 /* interpreter atexit processing */
7382 PL_exitlistlen = proto_perl->Iexitlistlen;
7383 if (PL_exitlistlen) {
7384 New(0, PL_exitlist, PL_exitlistlen, PerlExitListEntry);
7385 Copy(proto_perl->Iexitlist, PL_exitlist, PL_exitlistlen, PerlExitListEntry);
7388 PL_exitlist = (PerlExitListEntry*)NULL;
7389 PL_modglobal = hv_dup_inc(proto_perl->Imodglobal);
7391 PL_profiledata = NULL;
7392 PL_rsfp = fp_dup(proto_perl->Irsfp, '<');
7393 /* PL_rsfp_filters entries have fake IoDIRP() */
7394 PL_rsfp_filters = av_dup_inc(proto_perl->Irsfp_filters);
7396 PL_compcv = cv_dup(proto_perl->Icompcv);
7397 PL_comppad = av_dup(proto_perl->Icomppad);
7398 PL_comppad_name = av_dup(proto_perl->Icomppad_name);
7399 PL_comppad_name_fill = proto_perl->Icomppad_name_fill;
7400 PL_comppad_name_floor = proto_perl->Icomppad_name_floor;
7401 PL_curpad = (SV**)ptr_table_fetch(PL_ptr_table,
7402 proto_perl->Tcurpad);
7404 #ifdef HAVE_INTERP_INTERN
7405 sys_intern_dup(&proto_perl->Isys_intern, &PL_sys_intern);
7408 /* more statics moved here */
7409 PL_generation = proto_perl->Igeneration;
7410 PL_DBcv = cv_dup(proto_perl->IDBcv);
7412 PL_in_clean_objs = proto_perl->Iin_clean_objs;
7413 PL_in_clean_all = proto_perl->Iin_clean_all;
7415 PL_uid = proto_perl->Iuid;
7416 PL_euid = proto_perl->Ieuid;
7417 PL_gid = proto_perl->Igid;
7418 PL_egid = proto_perl->Iegid;
7419 PL_nomemok = proto_perl->Inomemok;
7420 PL_an = proto_perl->Ian;
7421 PL_cop_seqmax = proto_perl->Icop_seqmax;
7422 PL_op_seqmax = proto_perl->Iop_seqmax;
7423 PL_evalseq = proto_perl->Ievalseq;
7424 PL_origenviron = proto_perl->Iorigenviron; /* XXX not quite right */
7425 PL_origalen = proto_perl->Iorigalen;
7426 PL_pidstatus = newHV(); /* XXX flag for cloning? */
7427 PL_osname = SAVEPV(proto_perl->Iosname);
7428 PL_sh_path = SAVEPV(proto_perl->Ish_path);
7429 PL_sighandlerp = proto_perl->Isighandlerp;
7432 PL_runops = proto_perl->Irunops;
7434 Copy(proto_perl->Itokenbuf, PL_tokenbuf, 256, char);
7437 PL_cshlen = proto_perl->Icshlen;
7438 PL_cshname = SAVEPVN(proto_perl->Icshname, PL_cshlen);
7441 PL_lex_state = proto_perl->Ilex_state;
7442 PL_lex_defer = proto_perl->Ilex_defer;
7443 PL_lex_expect = proto_perl->Ilex_expect;
7444 PL_lex_formbrack = proto_perl->Ilex_formbrack;
7445 PL_lex_dojoin = proto_perl->Ilex_dojoin;
7446 PL_lex_starts = proto_perl->Ilex_starts;
7447 PL_lex_stuff = sv_dup_inc(proto_perl->Ilex_stuff);
7448 PL_lex_repl = sv_dup_inc(proto_perl->Ilex_repl);
7449 PL_lex_op = proto_perl->Ilex_op;
7450 PL_lex_inpat = proto_perl->Ilex_inpat;
7451 PL_lex_inwhat = proto_perl->Ilex_inwhat;
7452 PL_lex_brackets = proto_perl->Ilex_brackets;
7453 i = (PL_lex_brackets < 120 ? 120 : PL_lex_brackets);
7454 PL_lex_brackstack = SAVEPVN(proto_perl->Ilex_brackstack,i);
7455 PL_lex_casemods = proto_perl->Ilex_casemods;
7456 i = (PL_lex_casemods < 12 ? 12 : PL_lex_casemods);
7457 PL_lex_casestack = SAVEPVN(proto_perl->Ilex_casestack,i);
7459 Copy(proto_perl->Inextval, PL_nextval, 5, YYSTYPE);
7460 Copy(proto_perl->Inexttype, PL_nexttype, 5, I32);
7461 PL_nexttoke = proto_perl->Inexttoke;
7463 PL_linestr = sv_dup_inc(proto_perl->Ilinestr);
7464 i = proto_perl->Ibufptr - SvPVX(proto_perl->Ilinestr);
7465 PL_bufptr = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
7466 i = proto_perl->Ioldbufptr - SvPVX(proto_perl->Ilinestr);
7467 PL_oldbufptr = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
7468 i = proto_perl->Ioldoldbufptr - SvPVX(proto_perl->Ilinestr);
7469 PL_oldoldbufptr = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
7470 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
7471 i = proto_perl->Ilinestart - SvPVX(proto_perl->Ilinestr);
7472 PL_linestart = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
7473 PL_pending_ident = proto_perl->Ipending_ident;
7474 PL_sublex_info = proto_perl->Isublex_info; /* XXX not quite right */
7476 PL_expect = proto_perl->Iexpect;
7478 PL_multi_start = proto_perl->Imulti_start;
7479 PL_multi_end = proto_perl->Imulti_end;
7480 PL_multi_open = proto_perl->Imulti_open;
7481 PL_multi_close = proto_perl->Imulti_close;
7483 PL_error_count = proto_perl->Ierror_count;
7484 PL_subline = proto_perl->Isubline;
7485 PL_subname = sv_dup_inc(proto_perl->Isubname);
7487 PL_min_intro_pending = proto_perl->Imin_intro_pending;
7488 PL_max_intro_pending = proto_perl->Imax_intro_pending;
7489 PL_padix = proto_perl->Ipadix;
7490 PL_padix_floor = proto_perl->Ipadix_floor;
7491 PL_pad_reset_pending = proto_perl->Ipad_reset_pending;
7493 i = proto_perl->Ilast_uni - SvPVX(proto_perl->Ilinestr);
7494 PL_last_uni = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
7495 i = proto_perl->Ilast_lop - SvPVX(proto_perl->Ilinestr);
7496 PL_last_lop = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
7497 PL_last_lop_op = proto_perl->Ilast_lop_op;
7498 PL_in_my = proto_perl->Iin_my;
7499 PL_in_my_stash = hv_dup(proto_perl->Iin_my_stash);
7501 PL_cryptseen = proto_perl->Icryptseen;
7504 PL_hints = proto_perl->Ihints;
7506 PL_amagic_generation = proto_perl->Iamagic_generation;
7508 #ifdef USE_LOCALE_COLLATE
7509 PL_collation_ix = proto_perl->Icollation_ix;
7510 PL_collation_name = SAVEPV(proto_perl->Icollation_name);
7511 PL_collation_standard = proto_perl->Icollation_standard;
7512 PL_collxfrm_base = proto_perl->Icollxfrm_base;
7513 PL_collxfrm_mult = proto_perl->Icollxfrm_mult;
7514 #endif /* USE_LOCALE_COLLATE */
7516 #ifdef USE_LOCALE_NUMERIC
7517 PL_numeric_name = SAVEPV(proto_perl->Inumeric_name);
7518 PL_numeric_standard = proto_perl->Inumeric_standard;
7519 PL_numeric_local = proto_perl->Inumeric_local;
7520 PL_numeric_radix = proto_perl->Inumeric_radix;
7521 #endif /* !USE_LOCALE_NUMERIC */
7523 /* utf8 character classes */
7524 PL_utf8_alnum = sv_dup_inc(proto_perl->Iutf8_alnum);
7525 PL_utf8_alnumc = sv_dup_inc(proto_perl->Iutf8_alnumc);
7526 PL_utf8_ascii = sv_dup_inc(proto_perl->Iutf8_ascii);
7527 PL_utf8_alpha = sv_dup_inc(proto_perl->Iutf8_alpha);
7528 PL_utf8_space = sv_dup_inc(proto_perl->Iutf8_space);
7529 PL_utf8_cntrl = sv_dup_inc(proto_perl->Iutf8_cntrl);
7530 PL_utf8_graph = sv_dup_inc(proto_perl->Iutf8_graph);
7531 PL_utf8_digit = sv_dup_inc(proto_perl->Iutf8_digit);
7532 PL_utf8_upper = sv_dup_inc(proto_perl->Iutf8_upper);
7533 PL_utf8_lower = sv_dup_inc(proto_perl->Iutf8_lower);
7534 PL_utf8_print = sv_dup_inc(proto_perl->Iutf8_print);
7535 PL_utf8_punct = sv_dup_inc(proto_perl->Iutf8_punct);
7536 PL_utf8_xdigit = sv_dup_inc(proto_perl->Iutf8_xdigit);
7537 PL_utf8_mark = sv_dup_inc(proto_perl->Iutf8_mark);
7538 PL_utf8_toupper = sv_dup_inc(proto_perl->Iutf8_toupper);
7539 PL_utf8_totitle = sv_dup_inc(proto_perl->Iutf8_totitle);
7540 PL_utf8_tolower = sv_dup_inc(proto_perl->Iutf8_tolower);
7543 PL_last_swash_hv = Nullhv; /* reinits on demand */
7544 PL_last_swash_klen = 0;
7545 PL_last_swash_key[0]= '\0';
7546 PL_last_swash_tmps = (U8*)NULL;
7547 PL_last_swash_slen = 0;
7549 /* perly.c globals */
7550 PL_yydebug = proto_perl->Iyydebug;
7551 PL_yynerrs = proto_perl->Iyynerrs;
7552 PL_yyerrflag = proto_perl->Iyyerrflag;
7553 PL_yychar = proto_perl->Iyychar;
7554 PL_yyval = proto_perl->Iyyval;
7555 PL_yylval = proto_perl->Iyylval;
7557 PL_glob_index = proto_perl->Iglob_index;
7558 PL_srand_called = proto_perl->Isrand_called;
7559 PL_uudmap['M'] = 0; /* reinits on demand */
7560 PL_bitcount = Nullch; /* reinits on demand */
7562 if (proto_perl->Ipsig_ptr) {
7563 int sig_num[] = { SIG_NUM };
7564 Newz(0, PL_psig_ptr, sizeof(sig_num)/sizeof(*sig_num), SV*);
7565 Newz(0, PL_psig_name, sizeof(sig_num)/sizeof(*sig_num), SV*);
7566 for (i = 1; PL_sig_name[i]; i++) {
7567 PL_psig_ptr[i] = sv_dup_inc(proto_perl->Ipsig_ptr[i]);
7568 PL_psig_name[i] = sv_dup_inc(proto_perl->Ipsig_name[i]);
7572 PL_psig_ptr = (SV**)NULL;
7573 PL_psig_name = (SV**)NULL;
7576 /* thrdvar.h stuff */
7579 /* next allocation will be PL_tmps_stack[PL_tmps_ix+1] */
7580 PL_tmps_ix = proto_perl->Ttmps_ix;
7581 PL_tmps_max = proto_perl->Ttmps_max;
7582 PL_tmps_floor = proto_perl->Ttmps_floor;
7583 Newz(50, PL_tmps_stack, PL_tmps_max, SV*);
7585 while (i <= PL_tmps_ix) {
7586 PL_tmps_stack[i] = sv_dup_inc(proto_perl->Ttmps_stack[i]);
7590 /* next PUSHMARK() sets *(PL_markstack_ptr+1) */
7591 i = proto_perl->Tmarkstack_max - proto_perl->Tmarkstack;
7592 Newz(54, PL_markstack, i, I32);
7593 PL_markstack_max = PL_markstack + (proto_perl->Tmarkstack_max
7594 - proto_perl->Tmarkstack);
7595 PL_markstack_ptr = PL_markstack + (proto_perl->Tmarkstack_ptr
7596 - proto_perl->Tmarkstack);
7597 Copy(proto_perl->Tmarkstack, PL_markstack,
7598 PL_markstack_ptr - PL_markstack + 1, I32);
7600 /* next push_scope()/ENTER sets PL_scopestack[PL_scopestack_ix]
7601 * NOTE: unlike the others! */
7602 PL_scopestack_ix = proto_perl->Tscopestack_ix;
7603 PL_scopestack_max = proto_perl->Tscopestack_max;
7604 Newz(54, PL_scopestack, PL_scopestack_max, I32);
7605 Copy(proto_perl->Tscopestack, PL_scopestack, PL_scopestack_ix, I32);
7607 /* next push_return() sets PL_retstack[PL_retstack_ix]
7608 * NOTE: unlike the others! */
7609 PL_retstack_ix = proto_perl->Tretstack_ix;
7610 PL_retstack_max = proto_perl->Tretstack_max;
7611 Newz(54, PL_retstack, PL_retstack_max, OP*);
7612 Copy(proto_perl->Tretstack, PL_retstack, PL_retstack_ix, I32);
7614 /* NOTE: si_dup() looks at PL_markstack */
7615 PL_curstackinfo = si_dup(proto_perl->Tcurstackinfo);
7617 /* PL_curstack = PL_curstackinfo->si_stack; */
7618 PL_curstack = av_dup(proto_perl->Tcurstack);
7619 PL_mainstack = av_dup(proto_perl->Tmainstack);
7621 /* next PUSHs() etc. set *(PL_stack_sp+1) */
7622 PL_stack_base = AvARRAY(PL_curstack);
7623 PL_stack_sp = PL_stack_base + (proto_perl->Tstack_sp
7624 - proto_perl->Tstack_base);
7625 PL_stack_max = PL_stack_base + AvMAX(PL_curstack);
7627 /* next SSPUSHFOO() sets PL_savestack[PL_savestack_ix]
7628 * NOTE: unlike the others! */
7629 PL_savestack_ix = proto_perl->Tsavestack_ix;
7630 PL_savestack_max = proto_perl->Tsavestack_max;
7631 /*Newz(54, PL_savestack, PL_savestack_max, ANY);*/
7632 PL_savestack = ss_dup(proto_perl);
7638 PL_start_env = proto_perl->Tstart_env; /* XXXXXX */
7639 PL_top_env = &PL_start_env;
7641 PL_op = proto_perl->Top;
7644 PL_Xpv = (XPV*)NULL;
7645 PL_na = proto_perl->Tna;
7647 PL_statbuf = proto_perl->Tstatbuf;
7648 PL_statcache = proto_perl->Tstatcache;
7649 PL_statgv = gv_dup(proto_perl->Tstatgv);
7650 PL_statname = sv_dup_inc(proto_perl->Tstatname);
7652 PL_timesbuf = proto_perl->Ttimesbuf;
7655 PL_tainted = proto_perl->Ttainted;
7656 PL_curpm = proto_perl->Tcurpm; /* XXX No PMOP ref count */
7657 PL_nrs = sv_dup_inc(proto_perl->Tnrs);
7658 PL_rs = sv_dup_inc(proto_perl->Trs);
7659 PL_last_in_gv = gv_dup(proto_perl->Tlast_in_gv);
7660 PL_ofslen = proto_perl->Tofslen;
7661 PL_ofs = SAVEPVN(proto_perl->Tofs, PL_ofslen);
7662 PL_defoutgv = gv_dup_inc(proto_perl->Tdefoutgv);
7663 PL_chopset = proto_perl->Tchopset; /* XXX never deallocated */
7664 PL_toptarget = sv_dup_inc(proto_perl->Ttoptarget);
7665 PL_bodytarget = sv_dup_inc(proto_perl->Tbodytarget);
7666 PL_formtarget = sv_dup(proto_perl->Tformtarget);
7668 PL_restartop = proto_perl->Trestartop;
7669 PL_in_eval = proto_perl->Tin_eval;
7670 PL_delaymagic = proto_perl->Tdelaymagic;
7671 PL_dirty = proto_perl->Tdirty;
7672 PL_localizing = proto_perl->Tlocalizing;
7674 PL_protect = proto_perl->Tprotect;
7675 PL_errors = sv_dup_inc(proto_perl->Terrors);
7676 PL_av_fetch_sv = Nullsv;
7677 PL_hv_fetch_sv = Nullsv;
7678 Zero(&PL_hv_fetch_ent_mh, 1, HE); /* XXX */
7679 PL_modcount = proto_perl->Tmodcount;
7680 PL_lastgotoprobe = Nullop;
7681 PL_dumpindent = proto_perl->Tdumpindent;
7683 PL_sortcop = (OP*)any_dup(proto_perl->Tsortcop, proto_perl);
7684 PL_sortstash = hv_dup(proto_perl->Tsortstash);
7685 PL_firstgv = gv_dup(proto_perl->Tfirstgv);
7686 PL_secondgv = gv_dup(proto_perl->Tsecondgv);
7687 PL_sortcxix = proto_perl->Tsortcxix;
7688 PL_efloatbuf = Nullch; /* reinits on demand */
7689 PL_efloatsize = 0; /* reinits on demand */
7693 PL_screamfirst = NULL;
7694 PL_screamnext = NULL;
7695 PL_maxscream = -1; /* reinits on demand */
7696 PL_lastscream = Nullsv;
7698 PL_watchaddr = NULL;
7699 PL_watchok = Nullch;
7701 PL_regdummy = proto_perl->Tregdummy;
7702 PL_regcomp_parse = Nullch;
7703 PL_regxend = Nullch;
7704 PL_regcode = (regnode*)NULL;
7707 PL_regprecomp = Nullch;
7712 PL_seen_zerolen = 0;
7714 PL_regcomp_rx = (regexp*)NULL;
7716 PL_colorset = 0; /* reinits PL_colors[] */
7717 /*PL_colors[6] = {0,0,0,0,0,0};*/
7718 PL_reg_whilem_seen = 0;
7719 PL_reginput = Nullch;
7722 PL_regstartp = (I32*)NULL;
7723 PL_regendp = (I32*)NULL;
7724 PL_reglastparen = (U32*)NULL;
7725 PL_regtill = Nullch;
7727 PL_reg_start_tmp = (char**)NULL;
7728 PL_reg_start_tmpl = 0;
7729 PL_regdata = (struct reg_data*)NULL;
7732 PL_reg_eval_set = 0;
7734 PL_regprogram = (regnode*)NULL;
7736 PL_regcc = (CURCUR*)NULL;
7737 PL_reg_call_cc = (struct re_cc_state*)NULL;
7738 PL_reg_re = (regexp*)NULL;
7739 PL_reg_ganch = Nullch;
7741 PL_reg_magic = (MAGIC*)NULL;
7743 PL_reg_oldcurpm = (PMOP*)NULL;
7744 PL_reg_curpm = (PMOP*)NULL;
7745 PL_reg_oldsaved = Nullch;
7746 PL_reg_oldsavedlen = 0;
7748 PL_reg_leftiter = 0;
7749 PL_reg_poscache = Nullch;
7750 PL_reg_poscache_size= 0;
7752 /* RE engine - function pointers */
7753 PL_regcompp = proto_perl->Tregcompp;
7754 PL_regexecp = proto_perl->Tregexecp;
7755 PL_regint_start = proto_perl->Tregint_start;
7756 PL_regint_string = proto_perl->Tregint_string;
7757 PL_regfree = proto_perl->Tregfree;
7759 PL_reginterp_cnt = 0;
7760 PL_reg_starttry = 0;
7763 return (PerlInterpreter*)pPerl;
7769 #else /* !USE_ITHREADS */
7775 #endif /* USE_ITHREADS */
7778 do_report_used(pTHXo_ SV *sv)
7780 if (SvTYPE(sv) != SVTYPEMASK) {
7781 PerlIO_printf(Perl_debug_log, "****\n");
7787 do_clean_objs(pTHXo_ SV *sv)
7791 if (SvROK(sv) && SvOBJECT(rv = SvRV(sv))) {
7792 DEBUG_D((PerlIO_printf(Perl_debug_log, "Cleaning object ref:\n "), sv_dump(sv));)
7798 /* XXX Might want to check arrays, etc. */
7801 #ifndef DISABLE_DESTRUCTOR_KLUDGE
7803 do_clean_named_objs(pTHXo_ SV *sv)
7805 if (SvTYPE(sv) == SVt_PVGV && GvGP(sv)) {
7806 if ( SvOBJECT(GvSV(sv)) ||
7807 GvAV(sv) && SvOBJECT(GvAV(sv)) ||
7808 GvHV(sv) && SvOBJECT(GvHV(sv)) ||
7809 GvIO(sv) && SvOBJECT(GvIO(sv)) ||
7810 GvCV(sv) && SvOBJECT(GvCV(sv)) )
7812 DEBUG_D((PerlIO_printf(Perl_debug_log, "Cleaning named glob object:\n "), sv_dump(sv));)
7820 do_clean_all(pTHXo_ SV *sv)
7822 DEBUG_D((PerlIO_printf(Perl_debug_log, "Cleaning loops: SV at 0x%"UVxf"\n", PTR2UV(sv)) );)
7823 SvFLAGS(sv) |= SVf_BREAK;