3 * Copyright (c) 1991-2000, Larry Wall
5 * You may distribute under the terms of either the GNU General Public
6 * License or the Artistic License, as specified in the README file.
11 * "I wonder what the Entish is for 'yes' and 'no'," he thought.
19 #define SV_CHECK_THINKFIRST(sv) if (SvTHINKFIRST(sv)) sv_force_normal(sv)
21 static void do_report_used(pTHXo_ SV *sv);
22 static void do_clean_objs(pTHXo_ SV *sv);
23 #ifndef DISABLE_DESTRUCTOR_KLUDGE
24 static void do_clean_named_objs(pTHXo_ SV *sv);
26 static void do_clean_all(pTHXo_ SV *sv);
29 * "A time to plant, and a time to uproot what was planted..."
34 SvANY(p) = (void *)PL_sv_root; \
35 SvFLAGS(p) = SVTYPEMASK; \
40 /* sv_mutex must be held while calling uproot_SV() */
41 #define uproot_SV(p) \
44 PL_sv_root = (SV*)SvANY(p); \
66 if (PL_debug & 32768) \
76 if (PL_debug & 32768) {
81 for (sva = PL_sv_arenaroot; sva; sva = (SV *) SvANY(sva)) {
83 svend = &sva[SvREFCNT(sva)];
84 if (p >= sv && p < svend)
88 if (ckWARN_d(WARN_INTERNAL))
89 Perl_warner(aTHX_ WARN_INTERNAL,
90 "Attempt to free non-arena SV: 0x%"UVxf,
98 #else /* ! DEBUGGING */
100 #define del_SV(p) plant_SV(p)
102 #endif /* DEBUGGING */
105 Perl_sv_add_arena(pTHX_ char *ptr, U32 size, U32 flags)
110 Zero(ptr, size, char);
112 /* The first SV in an arena isn't an SV. */
113 SvANY(sva) = (void *) PL_sv_arenaroot; /* ptr to next arena */
114 SvREFCNT(sva) = size / sizeof(SV); /* number of SV slots */
115 SvFLAGS(sva) = flags; /* FAKE if not to be freed */
117 PL_sv_arenaroot = sva;
118 PL_sv_root = sva + 1;
120 svend = &sva[SvREFCNT(sva) - 1];
123 SvANY(sv) = (void *)(SV*)(sv + 1);
124 SvFLAGS(sv) = SVTYPEMASK;
128 SvFLAGS(sv) = SVTYPEMASK;
131 /* sv_mutex must be held while calling more_sv() */
138 sv_add_arena(PL_nice_chunk, PL_nice_chunk_size, 0);
139 PL_nice_chunk = Nullch;
142 char *chunk; /* must use New here to match call to */
143 New(704,chunk,1008,char); /* Safefree() in sv_free_arenas() */
144 sv_add_arena(chunk, 1008, 0);
151 S_visit(pTHX_ SVFUNC_t f)
157 for (sva = PL_sv_arenaroot; sva; sva = (SV*)SvANY(sva)) {
158 svend = &sva[SvREFCNT(sva)];
159 for (sv = sva + 1; sv < svend; ++sv) {
160 if (SvTYPE(sv) != SVTYPEMASK)
167 Perl_sv_report_used(pTHX)
169 visit(do_report_used);
173 Perl_sv_clean_objs(pTHX)
175 PL_in_clean_objs = TRUE;
176 visit(do_clean_objs);
177 #ifndef DISABLE_DESTRUCTOR_KLUDGE
178 /* some barnacles may yet remain, clinging to typeglobs */
179 visit(do_clean_named_objs);
181 PL_in_clean_objs = FALSE;
185 Perl_sv_clean_all(pTHX)
187 PL_in_clean_all = TRUE;
189 PL_in_clean_all = FALSE;
193 Perl_sv_free_arenas(pTHX)
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)
2218 return sv_2pvbyte(sv, &n_a);
2222 Perl_sv_2pvbyte(pTHX_ register SV *sv, STRLEN *lp)
2224 return sv_2pv(sv,lp);
2228 Perl_sv_2pvutf8_nolen(pTHX_ register SV *sv)
2231 return sv_2pvutf8(sv, &n_a);
2235 Perl_sv_2pvutf8(pTHX_ register SV *sv, STRLEN *lp)
2237 sv_utf8_upgrade(sv);
2238 return sv_2pv(sv,lp);
2241 /* This function is only called on magical items */
2243 Perl_sv_2bool(pTHX_ register SV *sv)
2253 if (SvAMAGIC(sv) && (tmpsv = AMG_CALLun(sv,bool_)))
2254 return SvTRUE(tmpsv);
2255 return SvRV(sv) != 0;
2258 register XPV* Xpvtmp;
2259 if ((Xpvtmp = (XPV*)SvANY(sv)) &&
2260 (*Xpvtmp->xpv_pv > '0' ||
2261 Xpvtmp->xpv_cur > 1 ||
2262 (Xpvtmp->xpv_cur && *Xpvtmp->xpv_pv != '0')))
2269 return SvIVX(sv) != 0;
2272 return SvNVX(sv) != 0.0;
2280 Perl_sv_utf8_upgrade(pTHX_ register SV *sv)
2285 if (!sv || !SvPOK(sv) || SvUTF8(sv))
2288 /* This function could be much more efficient if we had a FLAG
2289 * to signal if there are any hibit chars in the string
2292 for (c = SvPVX(sv); c < SvEND(sv); c++) {
2299 SvGROW(sv, SvCUR(sv) + hicount + 1);
2301 src = SvEND(sv) - 1;
2302 SvCUR_set(sv, SvCUR(sv) + hicount);
2303 dst = SvEND(sv) - 1;
2308 uv_to_utf8((U8*)dst, (U8)*src--);
2321 Perl_sv_utf8_downgrade(pTHX_ register SV* sv, bool fail_ok)
2323 if (SvPOK(sv) && SvUTF8(sv)) {
2324 char *c = SvPVX(sv);
2326 /* need to figure out if this is possible at all first */
2327 while (c < SvEND(sv)) {
2330 UV uv = utf8_to_uv((U8*)c, &len);
2335 /* XXX might want to make a callback here instead */
2336 Perl_croak(aTHX_ "Big byte");
2349 char *src = first_hi;
2350 char *dst = first_hi;
2351 while (src < SvEND(sv)) {
2354 U8 u = (U8)utf8_to_uv((U8*)src, &len);
2362 SvCUR_set(sv, dst - SvPVX(sv));
2370 Perl_sv_utf8_encode(pTHX_ register SV *sv)
2372 sv_utf8_upgrade(sv);
2377 Perl_sv_utf8_decode(pTHX_ register SV *sv)
2381 bool has_utf = FALSE;
2382 if (!sv_utf8_downgrade(sv, TRUE))
2385 /* it is actually just a matter of turning the utf8 flag on, but
2386 * we want to make sure everything inside is valid utf8 first.
2389 while (c < SvEND(sv)) {
2392 (void)utf8_to_uv((U8*)c, &len);
2412 /* Note: sv_setsv() should not be called with a source string that needs
2413 * to be reused, since it may destroy the source string if it is marked
2418 =for apidoc sv_setsv
2420 Copies the contents of the source SV C<ssv> into the destination SV C<dsv>.
2421 The source SV may be destroyed if it is mortal. Does not handle 'set'
2422 magic. See the macro forms C<SvSetSV>, C<SvSetSV_nosteal> and
2429 Perl_sv_setsv(pTHX_ SV *dstr, register SV *sstr)
2432 register U32 sflags;
2438 SV_CHECK_THINKFIRST(dstr);
2440 sstr = &PL_sv_undef;
2441 stype = SvTYPE(sstr);
2442 dtype = SvTYPE(dstr);
2446 /* There's a lot of redundancy below but we're going for speed here */
2451 if (dtype != SVt_PVGV) {
2452 (void)SvOK_off(dstr);
2460 sv_upgrade(dstr, SVt_IV);
2463 sv_upgrade(dstr, SVt_PVNV);
2467 sv_upgrade(dstr, SVt_PVIV);
2470 (void)SvIOK_only(dstr);
2471 SvIVX(dstr) = SvIVX(sstr);
2484 sv_upgrade(dstr, SVt_NV);
2489 sv_upgrade(dstr, SVt_PVNV);
2492 SvNVX(dstr) = SvNVX(sstr);
2493 (void)SvNOK_only(dstr);
2501 sv_upgrade(dstr, SVt_RV);
2502 else if (dtype == SVt_PVGV &&
2503 SvTYPE(SvRV(sstr)) == SVt_PVGV) {
2506 if (GvIMPORTED(dstr) != GVf_IMPORTED
2507 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
2509 GvIMPORTED_on(dstr);
2520 sv_upgrade(dstr, SVt_PV);
2523 if (dtype < SVt_PVIV)
2524 sv_upgrade(dstr, SVt_PVIV);
2527 if (dtype < SVt_PVNV)
2528 sv_upgrade(dstr, SVt_PVNV);
2535 Perl_croak(aTHX_ "Bizarre copy of %s in %s", sv_reftype(sstr, 0),
2536 PL_op_name[PL_op->op_type]);
2538 Perl_croak(aTHX_ "Bizarre copy of %s", sv_reftype(sstr, 0));
2542 if (dtype <= SVt_PVGV) {
2544 if (dtype != SVt_PVGV) {
2545 char *name = GvNAME(sstr);
2546 STRLEN len = GvNAMELEN(sstr);
2547 sv_upgrade(dstr, SVt_PVGV);
2548 sv_magic(dstr, dstr, '*', name, len);
2549 GvSTASH(dstr) = (HV*)SvREFCNT_inc(GvSTASH(sstr));
2550 GvNAME(dstr) = savepvn(name, len);
2551 GvNAMELEN(dstr) = len;
2552 SvFAKE_on(dstr); /* can coerce to non-glob */
2554 /* ahem, death to those who redefine active sort subs */
2555 else if (PL_curstackinfo->si_type == PERLSI_SORT
2556 && GvCV(dstr) && PL_sortcop == CvSTART(GvCV(dstr)))
2557 Perl_croak(aTHX_ "Can't redefine active sort subroutine %s",
2559 (void)SvOK_off(dstr);
2560 GvINTRO_off(dstr); /* one-shot flag */
2562 GvGP(dstr) = gp_ref(GvGP(sstr));
2564 if (GvIMPORTED(dstr) != GVf_IMPORTED
2565 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
2567 GvIMPORTED_on(dstr);
2575 if (SvGMAGICAL(sstr)) {
2577 if (SvTYPE(sstr) != stype) {
2578 stype = SvTYPE(sstr);
2579 if (stype == SVt_PVGV && dtype <= SVt_PVGV)
2583 if (stype == SVt_PVLV)
2584 (void)SvUPGRADE(dstr, SVt_PVNV);
2586 (void)SvUPGRADE(dstr, stype);
2589 sflags = SvFLAGS(sstr);
2591 if (sflags & SVf_ROK) {
2592 if (dtype >= SVt_PV) {
2593 if (dtype == SVt_PVGV) {
2594 SV *sref = SvREFCNT_inc(SvRV(sstr));
2596 int intro = GvINTRO(dstr);
2601 GvINTRO_off(dstr); /* one-shot flag */
2602 Newz(602,gp, 1, GP);
2603 GvGP(dstr) = gp_ref(gp);
2604 GvSV(dstr) = NEWSV(72,0);
2605 GvLINE(dstr) = CopLINE(PL_curcop);
2606 GvEGV(dstr) = (GV*)dstr;
2609 switch (SvTYPE(sref)) {
2612 SAVESPTR(GvAV(dstr));
2614 dref = (SV*)GvAV(dstr);
2615 GvAV(dstr) = (AV*)sref;
2616 if (GvIMPORTED_AV_off(dstr)
2617 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
2619 GvIMPORTED_AV_on(dstr);
2624 SAVESPTR(GvHV(dstr));
2626 dref = (SV*)GvHV(dstr);
2627 GvHV(dstr) = (HV*)sref;
2628 if (GvIMPORTED_HV_off(dstr)
2629 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
2631 GvIMPORTED_HV_on(dstr);
2636 if (GvCVGEN(dstr) && GvCV(dstr) != (CV*)sref) {
2637 SvREFCNT_dec(GvCV(dstr));
2638 GvCV(dstr) = Nullcv;
2639 GvCVGEN(dstr) = 0; /* Switch off cacheness. */
2640 PL_sub_generation++;
2642 SAVESPTR(GvCV(dstr));
2645 dref = (SV*)GvCV(dstr);
2646 if (GvCV(dstr) != (CV*)sref) {
2647 CV* cv = GvCV(dstr);
2649 if (!GvCVGEN((GV*)dstr) &&
2650 (CvROOT(cv) || CvXSUB(cv)))
2652 SV *const_sv = cv_const_sv(cv);
2653 bool const_changed = TRUE;
2655 const_changed = sv_cmp(const_sv,
2656 op_const_sv(CvSTART((CV*)sref),
2658 /* ahem, death to those who redefine
2659 * active sort subs */
2660 if (PL_curstackinfo->si_type == PERLSI_SORT &&
2661 PL_sortcop == CvSTART(cv))
2663 "Can't redefine active sort subroutine %s",
2664 GvENAME((GV*)dstr));
2665 if ((const_changed || const_sv) && ckWARN(WARN_REDEFINE))
2666 Perl_warner(aTHX_ WARN_REDEFINE, const_sv ?
2667 "Constant subroutine %s redefined"
2668 : "Subroutine %s redefined",
2669 GvENAME((GV*)dstr));
2671 cv_ckproto(cv, (GV*)dstr,
2672 SvPOK(sref) ? SvPVX(sref) : Nullch);
2674 GvCV(dstr) = (CV*)sref;
2675 GvCVGEN(dstr) = 0; /* Switch off cacheness. */
2676 GvASSUMECV_on(dstr);
2677 PL_sub_generation++;
2679 if (GvIMPORTED_CV_off(dstr)
2680 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
2682 GvIMPORTED_CV_on(dstr);
2687 SAVESPTR(GvIOp(dstr));
2689 dref = (SV*)GvIOp(dstr);
2690 GvIOp(dstr) = (IO*)sref;
2694 SAVESPTR(GvSV(dstr));
2696 dref = (SV*)GvSV(dstr);
2698 if (GvIMPORTED_SV_off(dstr)
2699 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
2701 GvIMPORTED_SV_on(dstr);
2713 (void)SvOOK_off(dstr); /* backoff */
2715 Safefree(SvPVX(dstr));
2716 SvLEN(dstr)=SvCUR(dstr)=0;
2719 (void)SvOK_off(dstr);
2720 SvRV(dstr) = SvREFCNT_inc(SvRV(sstr));
2722 if (sflags & SVp_NOK) {
2724 SvNVX(dstr) = SvNVX(sstr);
2726 if (sflags & SVp_IOK) {
2727 (void)SvIOK_on(dstr);
2728 SvIVX(dstr) = SvIVX(sstr);
2732 if (SvAMAGIC(sstr)) {
2736 else if (sflags & SVp_POK) {
2739 * Check to see if we can just swipe the string. If so, it's a
2740 * possible small lose on short strings, but a big win on long ones.
2741 * It might even be a win on short strings if SvPVX(dstr)
2742 * has to be allocated and SvPVX(sstr) has to be freed.
2745 if (SvTEMP(sstr) && /* slated for free anyway? */
2746 SvREFCNT(sstr) == 1 && /* and no other references to it? */
2747 !(sflags & SVf_OOK)) /* and not involved in OOK hack? */
2749 if (SvPVX(dstr)) { /* we know that dtype >= SVt_PV */
2751 SvFLAGS(dstr) &= ~SVf_OOK;
2752 Safefree(SvPVX(dstr) - SvIVX(dstr));
2754 else if (SvLEN(dstr))
2755 Safefree(SvPVX(dstr));
2757 (void)SvPOK_only(dstr);
2758 SvPV_set(dstr, SvPVX(sstr));
2759 SvLEN_set(dstr, SvLEN(sstr));
2760 SvCUR_set(dstr, SvCUR(sstr));
2767 (void)SvOK_off(sstr);
2768 SvPV_set(sstr, Nullch);
2773 else { /* have to copy actual string */
2774 STRLEN len = SvCUR(sstr);
2776 SvGROW(dstr, len + 1); /* inlined from sv_setpvn */
2777 Move(SvPVX(sstr),SvPVX(dstr),len,char);
2778 SvCUR_set(dstr, len);
2779 *SvEND(dstr) = '\0';
2780 (void)SvPOK_only(dstr);
2785 if (sflags & SVp_NOK) {
2787 SvNVX(dstr) = SvNVX(sstr);
2789 if (sflags & SVp_IOK) {
2790 (void)SvIOK_on(dstr);
2791 SvIVX(dstr) = SvIVX(sstr);
2796 else if (sflags & SVp_NOK) {
2797 SvNVX(dstr) = SvNVX(sstr);
2798 (void)SvNOK_only(dstr);
2800 (void)SvIOK_on(dstr);
2801 SvIVX(dstr) = SvIVX(sstr);
2802 /* XXXX Do we want to set IsUV for IV(ROK)? Be extra safe... */
2807 else if (sflags & SVp_IOK) {
2808 (void)SvIOK_only(dstr);
2809 SvIVX(dstr) = SvIVX(sstr);
2814 if (dtype == SVt_PVGV) {
2815 if (ckWARN(WARN_MISC))
2816 Perl_warner(aTHX_ WARN_MISC, "Undefined value assigned to typeglob");
2819 (void)SvOK_off(dstr);
2825 =for apidoc sv_setsv_mg
2827 Like C<sv_setsv>, but also handles 'set' magic.
2833 Perl_sv_setsv_mg(pTHX_ SV *dstr, register SV *sstr)
2835 sv_setsv(dstr,sstr);
2840 =for apidoc sv_setpvn
2842 Copies a string into an SV. The C<len> parameter indicates the number of
2843 bytes to be copied. Does not handle 'set' magic. See C<sv_setpvn_mg>.
2849 Perl_sv_setpvn(pTHX_ register SV *sv, register const char *ptr, register STRLEN len)
2851 register char *dptr;
2852 assert(len >= 0); /* STRLEN is probably unsigned, so this may
2853 elicit a warning, but it won't hurt. */
2854 SV_CHECK_THINKFIRST(sv);
2859 (void)SvUPGRADE(sv, SVt_PV);
2861 SvGROW(sv, len + 1);
2863 Move(ptr,dptr,len,char);
2866 (void)SvPOK_only(sv); /* validate pointer */
2871 =for apidoc sv_setpvn_mg
2873 Like C<sv_setpvn>, but also handles 'set' magic.
2879 Perl_sv_setpvn_mg(pTHX_ register SV *sv, register const char *ptr, register STRLEN len)
2881 sv_setpvn(sv,ptr,len);
2886 =for apidoc sv_setpv
2888 Copies a string into an SV. The string must be null-terminated. Does not
2889 handle 'set' magic. See C<sv_setpv_mg>.
2895 Perl_sv_setpv(pTHX_ register SV *sv, register const char *ptr)
2897 register STRLEN len;
2899 SV_CHECK_THINKFIRST(sv);
2905 (void)SvUPGRADE(sv, SVt_PV);
2907 SvGROW(sv, len + 1);
2908 Move(ptr,SvPVX(sv),len+1,char);
2910 (void)SvPOK_only(sv); /* validate pointer */
2915 =for apidoc sv_setpv_mg
2917 Like C<sv_setpv>, but also handles 'set' magic.
2923 Perl_sv_setpv_mg(pTHX_ register SV *sv, register const char *ptr)
2930 =for apidoc sv_usepvn
2932 Tells an SV to use C<ptr> to find its string value. Normally the string is
2933 stored inside the SV but sv_usepvn allows the SV to use an outside string.
2934 The C<ptr> should point to memory that was allocated by C<malloc>. The
2935 string length, C<len>, must be supplied. This function will realloc the
2936 memory pointed to by C<ptr>, so that pointer should not be freed or used by
2937 the programmer after giving it to sv_usepvn. Does not handle 'set' magic.
2938 See C<sv_usepvn_mg>.
2944 Perl_sv_usepvn(pTHX_ register SV *sv, register char *ptr, register STRLEN len)
2946 SV_CHECK_THINKFIRST(sv);
2947 (void)SvUPGRADE(sv, SVt_PV);
2952 (void)SvOOK_off(sv);
2953 if (SvPVX(sv) && SvLEN(sv))
2954 Safefree(SvPVX(sv));
2955 Renew(ptr, len+1, char);
2958 SvLEN_set(sv, len+1);
2960 (void)SvPOK_only(sv); /* validate pointer */
2965 =for apidoc sv_usepvn_mg
2967 Like C<sv_usepvn>, but also handles 'set' magic.
2973 Perl_sv_usepvn_mg(pTHX_ register SV *sv, register char *ptr, register STRLEN len)
2975 sv_usepvn(sv,ptr,len);
2980 Perl_sv_force_normal(pTHX_ register SV *sv)
2982 if (SvREADONLY(sv)) {
2984 if (PL_curcop != &PL_compiling)
2985 Perl_croak(aTHX_ PL_no_modify);
2989 else if (SvFAKE(sv) && SvTYPE(sv) == SVt_PVGV)
2996 Efficient removal of characters from the beginning of the string buffer.
2997 SvPOK(sv) must be true and the C<ptr> must be a pointer to somewhere inside
2998 the string buffer. The C<ptr> becomes the first character of the adjusted
3005 Perl_sv_chop(pTHX_ register SV *sv, register char *ptr) /* like set but assuming ptr is in sv */
3009 register STRLEN delta;
3011 if (!ptr || !SvPOKp(sv))
3013 SV_CHECK_THINKFIRST(sv);
3014 if (SvTYPE(sv) < SVt_PVIV)
3015 sv_upgrade(sv,SVt_PVIV);
3018 if (!SvLEN(sv)) { /* make copy of shared string */
3019 char *pvx = SvPVX(sv);
3020 STRLEN len = SvCUR(sv);
3021 SvGROW(sv, len + 1);
3022 Move(pvx,SvPVX(sv),len,char);
3026 SvFLAGS(sv) |= SVf_OOK;
3028 SvFLAGS(sv) &= ~(SVf_IOK|SVf_NOK|SVp_IOK|SVp_NOK|SVf_IVisUV);
3029 delta = ptr - SvPVX(sv);
3037 =for apidoc sv_catpvn
3039 Concatenates the string onto the end of the string which is in the SV. The
3040 C<len> indicates number of bytes to copy. Handles 'get' magic, but not
3041 'set' magic. See C<sv_catpvn_mg>.
3047 Perl_sv_catpvn(pTHX_ register SV *sv, register const char *ptr, register STRLEN len)
3052 junk = SvPV_force(sv, tlen);
3053 SvGROW(sv, tlen + len + 1);
3056 Move(ptr,SvPVX(sv)+tlen,len,char);
3059 (void)SvPOK_only_UTF8(sv); /* validate pointer */
3064 =for apidoc sv_catpvn_mg
3066 Like C<sv_catpvn>, but also handles 'set' magic.
3072 Perl_sv_catpvn_mg(pTHX_ register SV *sv, register const char *ptr, register STRLEN len)
3074 sv_catpvn(sv,ptr,len);
3079 =for apidoc sv_catsv
3081 Concatenates the string from SV C<ssv> onto the end of the string in SV
3082 C<dsv>. Handles 'get' magic, but not 'set' magic. See C<sv_catsv_mg>.
3088 Perl_sv_catsv(pTHX_ SV *dstr, register SV *sstr)
3094 if (s = SvPV(sstr, len)) {
3096 sv_utf8_upgrade(dstr);
3097 sv_catpvn(dstr,s,len);
3104 =for apidoc sv_catsv_mg
3106 Like C<sv_catsv>, but also handles 'set' magic.
3112 Perl_sv_catsv_mg(pTHX_ SV *dstr, register SV *sstr)
3114 sv_catsv(dstr,sstr);
3119 =for apidoc sv_catpv
3121 Concatenates the string onto the end of the string which is in the SV.
3122 Handles 'get' magic, but not 'set' magic. See C<sv_catpv_mg>.
3128 Perl_sv_catpv(pTHX_ register SV *sv, register const char *ptr)
3130 register STRLEN len;
3136 junk = SvPV_force(sv, tlen);
3138 SvGROW(sv, tlen + len + 1);
3141 Move(ptr,SvPVX(sv)+tlen,len+1,char);
3143 (void)SvPOK_only_UTF8(sv); /* validate pointer */
3148 =for apidoc sv_catpv_mg
3150 Like C<sv_catpv>, but also handles 'set' magic.
3156 Perl_sv_catpv_mg(pTHX_ register SV *sv, register const char *ptr)
3163 Perl_newSV(pTHX_ STRLEN len)
3169 sv_upgrade(sv, SVt_PV);
3170 SvGROW(sv, len + 1);
3175 /* name is assumed to contain an SV* if (name && namelen == HEf_SVKEY) */
3178 =for apidoc sv_magic
3180 Adds magic to an SV.
3186 Perl_sv_magic(pTHX_ register SV *sv, SV *obj, int how, const char *name, I32 namlen)
3190 if (SvREADONLY(sv)) {
3192 if (PL_curcop != &PL_compiling && !strchr("gBf", how))
3193 Perl_croak(aTHX_ PL_no_modify);
3195 if (SvMAGICAL(sv) || (how == 't' && SvTYPE(sv) >= SVt_PVMG)) {
3196 if (SvMAGIC(sv) && (mg = mg_find(sv, how))) {
3203 (void)SvUPGRADE(sv, SVt_PVMG);
3205 Newz(702,mg, 1, MAGIC);
3206 mg->mg_moremagic = SvMAGIC(sv);
3209 if (!obj || obj == sv || how == '#' || how == 'r')
3213 mg->mg_obj = SvREFCNT_inc(obj);
3214 mg->mg_flags |= MGf_REFCOUNTED;
3217 mg->mg_len = namlen;
3220 mg->mg_ptr = savepvn(name, namlen);
3221 else if (namlen == HEf_SVKEY)
3222 mg->mg_ptr = (char*)SvREFCNT_inc((SV*)name);
3226 mg->mg_virtual = &PL_vtbl_sv;
3229 mg->mg_virtual = &PL_vtbl_amagic;
3232 mg->mg_virtual = &PL_vtbl_amagicelem;
3238 mg->mg_virtual = &PL_vtbl_bm;
3241 mg->mg_virtual = &PL_vtbl_regdata;
3244 mg->mg_virtual = &PL_vtbl_regdatum;
3247 mg->mg_virtual = &PL_vtbl_env;
3250 mg->mg_virtual = &PL_vtbl_fm;
3253 mg->mg_virtual = &PL_vtbl_envelem;
3256 mg->mg_virtual = &PL_vtbl_mglob;
3259 mg->mg_virtual = &PL_vtbl_isa;
3262 mg->mg_virtual = &PL_vtbl_isaelem;
3265 mg->mg_virtual = &PL_vtbl_nkeys;
3272 mg->mg_virtual = &PL_vtbl_dbline;
3276 mg->mg_virtual = &PL_vtbl_mutex;
3278 #endif /* USE_THREADS */
3279 #ifdef USE_LOCALE_COLLATE
3281 mg->mg_virtual = &PL_vtbl_collxfrm;
3283 #endif /* USE_LOCALE_COLLATE */
3285 mg->mg_virtual = &PL_vtbl_pack;
3289 mg->mg_virtual = &PL_vtbl_packelem;
3292 mg->mg_virtual = &PL_vtbl_regexp;
3295 mg->mg_virtual = &PL_vtbl_sig;
3298 mg->mg_virtual = &PL_vtbl_sigelem;
3301 mg->mg_virtual = &PL_vtbl_taint;
3305 mg->mg_virtual = &PL_vtbl_uvar;
3308 mg->mg_virtual = &PL_vtbl_vec;
3311 mg->mg_virtual = &PL_vtbl_substr;
3314 mg->mg_virtual = &PL_vtbl_defelem;
3317 mg->mg_virtual = &PL_vtbl_glob;
3320 mg->mg_virtual = &PL_vtbl_arylen;
3323 mg->mg_virtual = &PL_vtbl_pos;
3326 mg->mg_virtual = &PL_vtbl_backref;
3328 case '~': /* Reserved for use by extensions not perl internals. */
3329 /* Useful for attaching extension internal data to perl vars. */
3330 /* Note that multiple extensions may clash if magical scalars */
3331 /* etc holding private data from one are passed to another. */
3335 Perl_croak(aTHX_ "Don't know how to handle magic of type '%c'", how);
3339 SvFLAGS(sv) &= ~(SVf_IOK|SVf_NOK|SVf_POK);
3343 Perl_sv_unmagic(pTHX_ SV *sv, int type)
3347 if (SvTYPE(sv) < SVt_PVMG || !SvMAGIC(sv))
3350 for (mg = *mgp; mg; mg = *mgp) {
3351 if (mg->mg_type == type) {
3352 MGVTBL* vtbl = mg->mg_virtual;
3353 *mgp = mg->mg_moremagic;
3354 if (vtbl && vtbl->svt_free)
3355 CALL_FPTR(vtbl->svt_free)(aTHX_ sv, mg);
3356 if (mg->mg_ptr && mg->mg_type != 'g')
3357 if (mg->mg_len >= 0)
3358 Safefree(mg->mg_ptr);
3359 else if (mg->mg_len == HEf_SVKEY)
3360 SvREFCNT_dec((SV*)mg->mg_ptr);
3361 if (mg->mg_flags & MGf_REFCOUNTED)
3362 SvREFCNT_dec(mg->mg_obj);
3366 mgp = &mg->mg_moremagic;
3370 SvFLAGS(sv) |= (SvFLAGS(sv) & (SVp_IOK|SVp_NOK|SVp_POK)) >> PRIVSHIFT;
3377 Perl_sv_rvweaken(pTHX_ SV *sv)
3380 if (!SvOK(sv)) /* let undefs pass */
3383 Perl_croak(aTHX_ "Can't weaken a nonreference");
3384 else if (SvWEAKREF(sv)) {
3386 if (ckWARN(WARN_MISC))
3387 Perl_warner(aTHX_ WARN_MISC, "Reference is already weak");
3391 sv_add_backref(tsv, sv);
3398 S_sv_add_backref(pTHX_ SV *tsv, SV *sv)
3402 if (SvMAGICAL(tsv) && (mg = mg_find(tsv, '<')))
3403 av = (AV*)mg->mg_obj;
3406 sv_magic(tsv, (SV*)av, '<', NULL, 0);
3407 SvREFCNT_dec(av); /* for sv_magic */
3413 S_sv_del_backref(pTHX_ SV *sv)
3420 if (!SvMAGICAL(tsv) || !(mg = mg_find(tsv, '<')))
3421 Perl_croak(aTHX_ "panic: del_backref");
3422 av = (AV *)mg->mg_obj;
3427 svp[i] = &PL_sv_undef; /* XXX */
3434 =for apidoc sv_insert
3436 Inserts a string at the specified offset/length within the SV. Similar to
3437 the Perl substr() function.
3443 Perl_sv_insert(pTHX_ SV *bigstr, STRLEN offset, STRLEN len, char *little, STRLEN littlelen)
3447 register char *midend;
3448 register char *bigend;
3454 Perl_croak(aTHX_ "Can't modify non-existent substring");
3455 SvPV_force(bigstr, curlen);
3456 if (offset + len > curlen) {
3457 SvGROW(bigstr, offset+len+1);
3458 Zero(SvPVX(bigstr)+curlen, offset+len-curlen, char);
3459 SvCUR_set(bigstr, offset+len);
3463 i = littlelen - len;
3464 if (i > 0) { /* string might grow */
3465 big = SvGROW(bigstr, SvCUR(bigstr) + i + 1);
3466 mid = big + offset + len;
3467 midend = bigend = big + SvCUR(bigstr);
3470 while (midend > mid) /* shove everything down */
3471 *--bigend = *--midend;
3472 Move(little,big+offset,littlelen,char);
3478 Move(little,SvPVX(bigstr)+offset,len,char);
3483 big = SvPVX(bigstr);
3486 bigend = big + SvCUR(bigstr);
3488 if (midend > bigend)
3489 Perl_croak(aTHX_ "panic: sv_insert");
3491 if (mid - big > bigend - midend) { /* faster to shorten from end */
3493 Move(little, mid, littlelen,char);
3496 i = bigend - midend;
3498 Move(midend, mid, i,char);
3502 SvCUR_set(bigstr, mid - big);
3505 else if (i = mid - big) { /* faster from front */
3506 midend -= littlelen;
3508 sv_chop(bigstr,midend-i);
3513 Move(little, mid, littlelen,char);
3515 else if (littlelen) {
3516 midend -= littlelen;
3517 sv_chop(bigstr,midend);
3518 Move(little,midend,littlelen,char);
3521 sv_chop(bigstr,midend);
3526 /* make sv point to what nstr did */
3529 Perl_sv_replace(pTHX_ register SV *sv, register SV *nsv)
3532 U32 refcnt = SvREFCNT(sv);
3533 SV_CHECK_THINKFIRST(sv);
3534 if (SvREFCNT(nsv) != 1 && ckWARN_d(WARN_INTERNAL))
3535 Perl_warner(aTHX_ WARN_INTERNAL, "Reference miscount in sv_replace()");
3536 if (SvMAGICAL(sv)) {
3540 sv_upgrade(nsv, SVt_PVMG);
3541 SvMAGIC(nsv) = SvMAGIC(sv);
3542 SvFLAGS(nsv) |= SvMAGICAL(sv);
3548 assert(!SvREFCNT(sv));
3549 StructCopy(nsv,sv,SV);
3550 SvREFCNT(sv) = refcnt;
3551 SvFLAGS(nsv) |= SVTYPEMASK; /* Mark as freed */
3556 Perl_sv_clear(pTHX_ register SV *sv)
3560 assert(SvREFCNT(sv) == 0);
3564 if (PL_defstash) { /* Still have a symbol table? */
3569 Zero(&tmpref, 1, SV);
3570 sv_upgrade(&tmpref, SVt_RV);
3572 SvREADONLY_on(&tmpref); /* DESTROY() could be naughty */
3573 SvREFCNT(&tmpref) = 1;
3576 stash = SvSTASH(sv);
3577 destructor = gv_fetchmethod(SvSTASH(sv), "DESTROY");
3580 PUSHSTACKi(PERLSI_DESTROY);
3581 SvRV(&tmpref) = SvREFCNT_inc(sv);
3586 call_sv((SV*)GvCV(destructor),
3587 G_DISCARD|G_EVAL|G_KEEPERR);
3593 } while (SvOBJECT(sv) && SvSTASH(sv) != stash);
3595 del_XRV(SvANY(&tmpref));
3598 if (PL_in_clean_objs)
3599 Perl_croak(aTHX_ "DESTROY created new reference to dead object '%s'",
3601 /* DESTROY gave object new lease on life */
3607 SvREFCNT_dec(SvSTASH(sv)); /* possibly of changed persuasion */
3608 SvOBJECT_off(sv); /* Curse the object. */
3609 if (SvTYPE(sv) != SVt_PVIO)
3610 --PL_sv_objcount; /* XXX Might want something more general */
3613 if (SvTYPE(sv) >= SVt_PVMG && SvMAGIC(sv))
3616 switch (SvTYPE(sv)) {
3619 IoIFP(sv) != PerlIO_stdin() &&
3620 IoIFP(sv) != PerlIO_stdout() &&
3621 IoIFP(sv) != PerlIO_stderr())
3623 io_close((IO*)sv, FALSE);
3625 if (IoDIRP(sv) && !(IoFLAGS(sv) & IOf_FAKE_DIRP))
3626 PerlDir_close(IoDIRP(sv));
3627 IoDIRP(sv) = (DIR*)NULL;
3628 Safefree(IoTOP_NAME(sv));
3629 Safefree(IoFMT_NAME(sv));
3630 Safefree(IoBOTTOM_NAME(sv));
3645 SvREFCNT_dec(LvTARG(sv));
3649 Safefree(GvNAME(sv));
3650 /* cannot decrease stash refcount yet, as we might recursively delete
3651 ourselves when the refcnt drops to zero. Delay SvREFCNT_dec
3652 of stash until current sv is completely gone.
3653 -- JohnPC, 27 Mar 1998 */
3654 stash = GvSTASH(sv);
3660 (void)SvOOK_off(sv);
3668 SvREFCNT_dec(SvRV(sv));
3670 else if (SvPVX(sv) && SvLEN(sv))
3671 Safefree(SvPVX(sv));
3681 switch (SvTYPE(sv)) {
3697 del_XPVIV(SvANY(sv));
3700 del_XPVNV(SvANY(sv));
3703 del_XPVMG(SvANY(sv));
3706 del_XPVLV(SvANY(sv));
3709 del_XPVAV(SvANY(sv));
3712 del_XPVHV(SvANY(sv));
3715 del_XPVCV(SvANY(sv));
3718 del_XPVGV(SvANY(sv));
3719 /* code duplication for increased performance. */
3720 SvFLAGS(sv) &= SVf_BREAK;
3721 SvFLAGS(sv) |= SVTYPEMASK;
3722 /* decrease refcount of the stash that owns this GV, if any */
3724 SvREFCNT_dec(stash);
3725 return; /* not break, SvFLAGS reset already happened */
3727 del_XPVBM(SvANY(sv));
3730 del_XPVFM(SvANY(sv));
3733 del_XPVIO(SvANY(sv));
3736 SvFLAGS(sv) &= SVf_BREAK;
3737 SvFLAGS(sv) |= SVTYPEMASK;
3741 Perl_sv_newref(pTHX_ SV *sv)
3744 ATOMIC_INC(SvREFCNT(sv));
3749 Perl_sv_free(pTHX_ SV *sv)
3752 int refcount_is_zero;
3756 if (SvREFCNT(sv) == 0) {
3757 if (SvFLAGS(sv) & SVf_BREAK)
3759 if (PL_in_clean_all) /* All is fair */
3761 if (SvREADONLY(sv) && SvIMMORTAL(sv)) {
3762 /* make sure SvREFCNT(sv)==0 happens very seldom */
3763 SvREFCNT(sv) = (~(U32)0)/2;
3766 if (ckWARN_d(WARN_INTERNAL))
3767 Perl_warner(aTHX_ WARN_INTERNAL, "Attempt to free unreferenced scalar");
3770 ATOMIC_DEC_AND_TEST(refcount_is_zero, SvREFCNT(sv));
3771 if (!refcount_is_zero)
3775 if (ckWARN_d(WARN_DEBUGGING))
3776 Perl_warner(aTHX_ WARN_DEBUGGING,
3777 "Attempt to free temp prematurely: SV 0x%"UVxf,
3782 if (SvREADONLY(sv) && SvIMMORTAL(sv)) {
3783 /* make sure SvREFCNT(sv)==0 happens very seldom */
3784 SvREFCNT(sv) = (~(U32)0)/2;
3795 Returns the length of the string in the SV. See also C<SvCUR>.
3801 Perl_sv_len(pTHX_ register SV *sv)
3810 len = mg_length(sv);
3812 junk = SvPV(sv, len);
3817 Perl_sv_len_utf8(pTHX_ register SV *sv)
3828 len = mg_length(sv);
3831 s = (U8*)SvPV(sv, len);
3842 Perl_sv_pos_u2b(pTHX_ register SV *sv, I32* offsetp, I32* lenp)
3847 I32 uoffset = *offsetp;
3853 start = s = (U8*)SvPV(sv, len);
3855 while (s < send && uoffset--)
3859 *offsetp = s - start;
3863 while (s < send && ulen--)
3873 Perl_sv_pos_b2u(pTHX_ register SV *sv, I32* offsetp)
3882 s = (U8*)SvPV(sv, len);
3884 Perl_croak(aTHX_ "panic: bad byte offset");
3885 send = s + *offsetp;
3893 if (ckWARN_d(WARN_UTF8))
3894 Perl_warner(aTHX_ WARN_UTF8, "Malformed UTF-8 character");
3904 Returns a boolean indicating whether the strings in the two SVs are
3911 Perl_sv_eq(pTHX_ register SV *str1, register SV *str2)
3923 pv1 = SvPV(str1, cur1);
3928 pv2 = SvPV(str2, cur2);
3933 return memEQ(pv1, pv2, cur1);
3939 Compares the strings in two SVs. Returns -1, 0, or 1 indicating whether the
3940 string in C<sv1> is less than, equal to, or greater than the string in
3947 Perl_sv_cmp(pTHX_ register SV *str1, register SV *str2)
3955 pv1 = SvPV(str1, cur1);
3963 if (SvPOK(str1) && SvUTF8(str1) != SvUTF8(str2) && !IN_BYTE) {
3964 /* must upgrade other to UTF8 first */
3966 sv_utf8_upgrade(str2);
3969 sv_utf8_upgrade(str1);
3970 /* refresh pointer and length */
3979 pv2 = sv_2pv(str2, &cur2);
3987 return cur2 ? -1 : 0;
3992 retval = memcmp((void*)pv1, (void*)pv2, cur1 < cur2 ? cur1 : cur2);
3995 return retval < 0 ? -1 : 1;
4000 return cur1 < cur2 ? -1 : 1;
4004 Perl_sv_cmp_locale(pTHX_ register SV *sv1, register SV *sv2)
4006 #ifdef USE_LOCALE_COLLATE
4012 if (PL_collation_standard)
4016 pv1 = sv1 ? sv_collxfrm(sv1, &len1) : (char *) NULL;
4018 pv2 = sv2 ? sv_collxfrm(sv2, &len2) : (char *) NULL;
4020 if (!pv1 || !len1) {
4031 retval = memcmp((void*)pv1, (void*)pv2, len1 < len2 ? len1 : len2);
4034 return retval < 0 ? -1 : 1;
4037 * When the result of collation is equality, that doesn't mean
4038 * that there are no differences -- some locales exclude some
4039 * characters from consideration. So to avoid false equalities,
4040 * we use the raw string as a tiebreaker.
4046 #endif /* USE_LOCALE_COLLATE */
4048 return sv_cmp(sv1, sv2);
4051 #ifdef USE_LOCALE_COLLATE
4053 * Any scalar variable may carry an 'o' magic that contains the
4054 * scalar data of the variable transformed to such a format that
4055 * a normal memory comparison can be used to compare the data
4056 * according to the locale settings.
4059 Perl_sv_collxfrm(pTHX_ SV *sv, STRLEN *nxp)
4063 mg = SvMAGICAL(sv) ? mg_find(sv, 'o') : (MAGIC *) NULL;
4064 if (!mg || !mg->mg_ptr || *(U32*)mg->mg_ptr != PL_collation_ix) {
4069 Safefree(mg->mg_ptr);
4071 if ((xf = mem_collxfrm(s, len, &xlen))) {
4072 if (SvREADONLY(sv)) {
4075 return xf + sizeof(PL_collation_ix);
4078 sv_magic(sv, 0, 'o', 0, 0);
4079 mg = mg_find(sv, 'o');
4092 if (mg && mg->mg_ptr) {
4094 return mg->mg_ptr + sizeof(PL_collation_ix);
4102 #endif /* USE_LOCALE_COLLATE */
4105 Perl_sv_gets(pTHX_ register SV *sv, register PerlIO *fp, I32 append)
4110 register STDCHAR rslast;
4111 register STDCHAR *bp;
4115 SV_CHECK_THINKFIRST(sv);
4116 (void)SvUPGRADE(sv, SVt_PV);
4120 if (RsSNARF(PL_rs)) {
4124 else if (RsRECORD(PL_rs)) {
4125 I32 recsize, bytesread;
4128 /* Grab the size of the record we're getting */
4129 recsize = SvIV(SvRV(PL_rs));
4130 (void)SvPOK_only(sv); /* Validate pointer */
4131 buffer = SvGROW(sv, recsize + 1);
4134 /* VMS wants read instead of fread, because fread doesn't respect */
4135 /* RMS record boundaries. This is not necessarily a good thing to be */
4136 /* doing, but we've got no other real choice */
4137 bytesread = PerlLIO_read(PerlIO_fileno(fp), buffer, recsize);
4139 bytesread = PerlIO_read(fp, buffer, recsize);
4141 SvCUR_set(sv, bytesread);
4142 buffer[bytesread] = '\0';
4143 return(SvCUR(sv) ? SvPVX(sv) : Nullch);
4145 else if (RsPARA(PL_rs)) {
4150 rsptr = SvPV(PL_rs, rslen);
4151 rslast = rslen ? rsptr[rslen - 1] : '\0';
4153 if (RsPARA(PL_rs)) { /* have to do this both before and after */
4154 do { /* to make sure file boundaries work right */
4157 i = PerlIO_getc(fp);
4161 PerlIO_ungetc(fp,i);
4167 /* See if we know enough about I/O mechanism to cheat it ! */
4169 /* This used to be #ifdef test - it is made run-time test for ease
4170 of abstracting out stdio interface. One call should be cheap
4171 enough here - and may even be a macro allowing compile
4175 if (PerlIO_fast_gets(fp)) {
4178 * We're going to steal some values from the stdio struct
4179 * and put EVERYTHING in the innermost loop into registers.
4181 register STDCHAR *ptr;
4185 #if defined(VMS) && defined(PERLIO_IS_STDIO)
4186 /* An ungetc()d char is handled separately from the regular
4187 * buffer, so we getc() it back out and stuff it in the buffer.
4189 i = PerlIO_getc(fp);
4190 if (i == EOF) return 0;
4191 *(--((*fp)->_ptr)) = (unsigned char) i;
4195 /* Here is some breathtakingly efficient cheating */
4197 cnt = PerlIO_get_cnt(fp); /* get count into register */
4198 (void)SvPOK_only(sv); /* validate pointer */
4199 if (SvLEN(sv) - append <= cnt + 1) { /* make sure we have the room */
4200 if (cnt > 80 && SvLEN(sv) > append) {
4201 shortbuffered = cnt - SvLEN(sv) + append + 1;
4202 cnt -= shortbuffered;
4206 /* remember that cnt can be negative */
4207 SvGROW(sv, append + (cnt <= 0 ? 2 : (cnt + 1)));
4212 bp = (STDCHAR*)SvPVX(sv) + append; /* move these two too to registers */
4213 ptr = (STDCHAR*)PerlIO_get_ptr(fp);
4214 DEBUG_P(PerlIO_printf(Perl_debug_log,
4215 "Screamer: entering, ptr=%"UVuf", cnt=%ld\n",PTR2UV(ptr),(long)cnt));
4216 DEBUG_P(PerlIO_printf(Perl_debug_log,
4217 "Screamer: entering: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
4218 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
4219 PTR2UV(PerlIO_has_base(fp) ? PerlIO_get_base(fp) : 0)));
4224 while (cnt > 0) { /* this | eat */
4226 if ((*bp++ = *ptr++) == rslast) /* really | dust */
4227 goto thats_all_folks; /* screams | sed :-) */
4231 Copy(ptr, bp, cnt, char); /* this | eat */
4232 bp += cnt; /* screams | dust */
4233 ptr += cnt; /* louder | sed :-) */
4238 if (shortbuffered) { /* oh well, must extend */
4239 cnt = shortbuffered;
4241 bpx = bp - (STDCHAR*)SvPVX(sv); /* box up before relocation */
4243 SvGROW(sv, SvLEN(sv) + append + cnt + 2);
4244 bp = (STDCHAR*)SvPVX(sv) + bpx; /* unbox after relocation */
4248 DEBUG_P(PerlIO_printf(Perl_debug_log,
4249 "Screamer: going to getc, ptr=%"UVuf", cnt=%ld\n",
4250 PTR2UV(ptr),(long)cnt));
4251 PerlIO_set_ptrcnt(fp, ptr, cnt); /* deregisterize cnt and ptr */
4252 DEBUG_P(PerlIO_printf(Perl_debug_log,
4253 "Screamer: pre: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
4254 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
4255 PTR2UV(PerlIO_has_base (fp) ? PerlIO_get_base(fp) : 0)));
4256 /* This used to call 'filbuf' in stdio form, but as that behaves like
4257 getc when cnt <= 0 we use PerlIO_getc here to avoid introducing
4258 another abstraction. */
4259 i = PerlIO_getc(fp); /* get more characters */
4260 DEBUG_P(PerlIO_printf(Perl_debug_log,
4261 "Screamer: post: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
4262 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
4263 PTR2UV(PerlIO_has_base (fp) ? PerlIO_get_base(fp) : 0)));
4264 cnt = PerlIO_get_cnt(fp);
4265 ptr = (STDCHAR*)PerlIO_get_ptr(fp); /* reregisterize cnt and ptr */
4266 DEBUG_P(PerlIO_printf(Perl_debug_log,
4267 "Screamer: after getc, ptr=%"UVuf", cnt=%ld\n",PTR2UV(ptr),(long)cnt));
4269 if (i == EOF) /* all done for ever? */
4270 goto thats_really_all_folks;
4272 bpx = bp - (STDCHAR*)SvPVX(sv); /* box up before relocation */
4274 SvGROW(sv, bpx + cnt + 2);
4275 bp = (STDCHAR*)SvPVX(sv) + bpx; /* unbox after relocation */
4277 *bp++ = i; /* store character from PerlIO_getc */
4279 if (rslen && (STDCHAR)i == rslast) /* all done for now? */
4280 goto thats_all_folks;
4284 if ((rslen > 1 && (bp - (STDCHAR*)SvPVX(sv) < rslen)) ||
4285 memNE((char*)bp - rslen, rsptr, rslen))
4286 goto screamer; /* go back to the fray */
4287 thats_really_all_folks:
4289 cnt += shortbuffered;
4290 DEBUG_P(PerlIO_printf(Perl_debug_log,
4291 "Screamer: quitting, ptr=%"UVuf", cnt=%ld\n",PTR2UV(ptr),(long)cnt));
4292 PerlIO_set_ptrcnt(fp, ptr, cnt); /* put these back or we're in trouble */
4293 DEBUG_P(PerlIO_printf(Perl_debug_log,
4294 "Screamer: end: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
4295 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
4296 PTR2UV(PerlIO_has_base (fp) ? PerlIO_get_base(fp) : 0)));
4298 SvCUR_set(sv, bp - (STDCHAR*)SvPVX(sv)); /* set length */
4299 DEBUG_P(PerlIO_printf(Perl_debug_log,
4300 "Screamer: done, len=%ld, string=|%.*s|\n",
4301 (long)SvCUR(sv),(int)SvCUR(sv),SvPVX(sv)));
4306 /*The big, slow, and stupid way */
4309 /* Need to work around EPOC SDK features */
4310 /* On WINS: MS VC5 generates calls to _chkstk, */
4311 /* if a `large' stack frame is allocated */
4312 /* gcc on MARM does not generate calls like these */
4318 register STDCHAR *bpe = buf + sizeof(buf);
4320 while ((i = PerlIO_getc(fp)) != EOF && (*bp++ = i) != rslast && bp < bpe)
4321 ; /* keep reading */
4325 cnt = PerlIO_read(fp,(char*)buf, sizeof(buf));
4326 /* Accomodate broken VAXC compiler, which applies U8 cast to
4327 * both args of ?: operator, causing EOF to change into 255
4329 if (cnt) { i = (U8)buf[cnt - 1]; } else { i = EOF; }
4333 sv_catpvn(sv, (char *) buf, cnt);
4335 sv_setpvn(sv, (char *) buf, cnt);
4337 if (i != EOF && /* joy */
4339 SvCUR(sv) < rslen ||
4340 memNE(SvPVX(sv) + SvCUR(sv) - rslen, rsptr, rslen)))
4344 * If we're reading from a TTY and we get a short read,
4345 * indicating that the user hit his EOF character, we need
4346 * to notice it now, because if we try to read from the TTY
4347 * again, the EOF condition will disappear.
4349 * The comparison of cnt to sizeof(buf) is an optimization
4350 * that prevents unnecessary calls to feof().
4354 if (!(cnt < sizeof(buf) && PerlIO_eof(fp)))
4359 if (RsPARA(PL_rs)) { /* have to do this both before and after */
4360 while (i != EOF) { /* to make sure file boundaries work right */
4361 i = PerlIO_getc(fp);
4363 PerlIO_ungetc(fp,i);
4369 return (SvCUR(sv) - append) ? SvPVX(sv) : Nullch;
4376 Auto-increment of the value in the SV.
4382 Perl_sv_inc(pTHX_ register SV *sv)
4391 if (SvTHINKFIRST(sv)) {
4392 if (SvREADONLY(sv)) {
4394 if (PL_curcop != &PL_compiling)
4395 Perl_croak(aTHX_ PL_no_modify);
4399 if (SvAMAGIC(sv) && AMG_CALLun(sv,inc))
4401 i = PTR2IV(SvRV(sv));
4406 flags = SvFLAGS(sv);
4407 if (flags & SVp_NOK) {
4408 (void)SvNOK_only(sv);
4412 if (flags & SVp_IOK) {
4414 if (SvUVX(sv) == UV_MAX)
4415 sv_setnv(sv, (NV)UV_MAX + 1.0);
4417 (void)SvIOK_only_UV(sv);
4420 if (SvIVX(sv) == IV_MAX)
4421 sv_setnv(sv, (NV)IV_MAX + 1.0);
4423 (void)SvIOK_only(sv);
4429 if (!(flags & SVp_POK) || !*SvPVX(sv)) {
4430 if ((flags & SVTYPEMASK) < SVt_PVNV)
4431 sv_upgrade(sv, SVt_NV);
4433 (void)SvNOK_only(sv);
4437 while (isALPHA(*d)) d++;
4438 while (isDIGIT(*d)) d++;
4440 sv_setnv(sv,Atof(SvPVX(sv)) + 1.0); /* punt */
4444 while (d >= SvPVX(sv)) {
4452 /* MKS: The original code here died if letters weren't consecutive.
4453 * at least it didn't have to worry about non-C locales. The
4454 * new code assumes that ('z'-'a')==('Z'-'A'), letters are
4455 * arranged in order (although not consecutively) and that only
4456 * [A-Za-z] are accepted by isALPHA in the C locale.
4458 if (*d != 'z' && *d != 'Z') {
4459 do { ++*d; } while (!isALPHA(*d));
4462 *(d--) -= 'z' - 'a';
4467 *(d--) -= 'z' - 'a' + 1;
4471 /* oh,oh, the number grew */
4472 SvGROW(sv, SvCUR(sv) + 2);
4474 for (d = SvPVX(sv) + SvCUR(sv); d > SvPVX(sv); d--)
4485 Auto-decrement of the value in the SV.
4491 Perl_sv_dec(pTHX_ register SV *sv)
4499 if (SvTHINKFIRST(sv)) {
4500 if (SvREADONLY(sv)) {
4502 if (PL_curcop != &PL_compiling)
4503 Perl_croak(aTHX_ PL_no_modify);
4507 if (SvAMAGIC(sv) && AMG_CALLun(sv,dec))
4509 i = PTR2IV(SvRV(sv));
4514 flags = SvFLAGS(sv);
4515 if (flags & SVp_NOK) {
4517 (void)SvNOK_only(sv);
4520 if (flags & SVp_IOK) {
4522 if (SvUVX(sv) == 0) {
4523 (void)SvIOK_only(sv);
4527 (void)SvIOK_only_UV(sv);
4531 if (SvIVX(sv) == IV_MIN)
4532 sv_setnv(sv, (NV)IV_MIN - 1.0);
4534 (void)SvIOK_only(sv);
4540 if (!(flags & SVp_POK)) {
4541 if ((flags & SVTYPEMASK) < SVt_PVNV)
4542 sv_upgrade(sv, SVt_NV);
4544 (void)SvNOK_only(sv);
4547 sv_setnv(sv,Atof(SvPVX(sv)) - 1.0); /* punt */
4551 =for apidoc sv_mortalcopy
4553 Creates a new SV which is a copy of the original SV. The new SV is marked
4559 /* Make a string that will exist for the duration of the expression
4560 * evaluation. Actually, it may have to last longer than that, but
4561 * hopefully we won't free it until it has been assigned to a
4562 * permanent location. */
4565 Perl_sv_mortalcopy(pTHX_ SV *oldstr)
4571 sv_setsv(sv,oldstr);
4573 PL_tmps_stack[++PL_tmps_ix] = sv;
4579 =for apidoc sv_newmortal
4581 Creates a new SV which is mortal. The reference count of the SV is set to 1.
4587 Perl_sv_newmortal(pTHX)
4593 SvFLAGS(sv) = SVs_TEMP;
4595 PL_tmps_stack[++PL_tmps_ix] = sv;
4600 =for apidoc sv_2mortal
4602 Marks an SV as mortal. The SV will be destroyed when the current context
4608 /* same thing without the copying */
4611 Perl_sv_2mortal(pTHX_ register SV *sv)
4616 if (SvREADONLY(sv) && SvIMMORTAL(sv))
4619 PL_tmps_stack[++PL_tmps_ix] = sv;
4627 Creates a new SV and copies a string into it. The reference count for the
4628 SV is set to 1. If C<len> is zero, Perl will compute the length using
4629 strlen(). For efficiency, consider using C<newSVpvn> instead.
4635 Perl_newSVpv(pTHX_ const char *s, STRLEN len)
4642 sv_setpvn(sv,s,len);
4647 =for apidoc newSVpvn
4649 Creates a new SV and copies a string into it. The reference count for the
4650 SV is set to 1. Note that if C<len> is zero, Perl will create a zero length
4651 string. You are responsible for ensuring that the source string is at least
4658 Perl_newSVpvn(pTHX_ const char *s, STRLEN len)
4663 sv_setpvn(sv,s,len);
4667 #if defined(PERL_IMPLICIT_CONTEXT)
4669 Perl_newSVpvf_nocontext(const char* pat, ...)
4674 va_start(args, pat);
4675 sv = vnewSVpvf(pat, &args);
4682 =for apidoc newSVpvf
4684 Creates a new SV an initialize it with the string formatted like
4691 Perl_newSVpvf(pTHX_ const char* pat, ...)
4695 va_start(args, pat);
4696 sv = vnewSVpvf(pat, &args);
4702 Perl_vnewSVpvf(pTHX_ const char* pat, va_list* args)
4706 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
4713 Creates a new SV and copies a floating point value into it.
4714 The reference count for the SV is set to 1.
4720 Perl_newSVnv(pTHX_ NV n)
4732 Creates a new SV and copies an integer into it. The reference count for the
4739 Perl_newSViv(pTHX_ IV i)
4749 =for apidoc newRV_noinc
4751 Creates an RV wrapper for an SV. The reference count for the original
4752 SV is B<not> incremented.
4758 Perl_newRV_noinc(pTHX_ SV *tmpRef)
4764 sv_upgrade(sv, SVt_RV);
4771 /* newRV_inc is #defined to newRV in sv.h */
4773 Perl_newRV(pTHX_ SV *tmpRef)
4775 return newRV_noinc(SvREFCNT_inc(tmpRef));
4781 Creates a new SV which is an exact duplicate of the original SV.
4786 /* make an exact duplicate of old */
4789 Perl_newSVsv(pTHX_ register SV *old)
4796 if (SvTYPE(old) == SVTYPEMASK) {
4797 if (ckWARN_d(WARN_INTERNAL))
4798 Perl_warner(aTHX_ WARN_INTERNAL, "semi-panic: attempt to dup freed string");
4813 Perl_sv_reset(pTHX_ register char *s, HV *stash)
4821 char todo[PERL_UCHAR_MAX+1];
4826 if (!*s) { /* reset ?? searches */
4827 for (pm = HvPMROOT(stash); pm; pm = pm->op_pmnext) {
4828 pm->op_pmdynflags &= ~PMdf_USED;
4833 /* reset variables */
4835 if (!HvARRAY(stash))
4838 Zero(todo, 256, char);
4840 i = (unsigned char)*s;
4844 max = (unsigned char)*s++;
4845 for ( ; i <= max; i++) {
4848 for (i = 0; i <= (I32) HvMAX(stash); i++) {
4849 for (entry = HvARRAY(stash)[i];
4851 entry = HeNEXT(entry))
4853 if (!todo[(U8)*HeKEY(entry)])
4855 gv = (GV*)HeVAL(entry);
4857 if (SvTHINKFIRST(sv)) {
4858 if (!SvREADONLY(sv) && SvROK(sv))
4863 if (SvTYPE(sv) >= SVt_PV) {
4865 if (SvPVX(sv) != Nullch)
4872 if (GvHV(gv) && !HvNAME(GvHV(gv))) {
4874 #ifndef VMS /* VMS has no environ array */
4876 environ[0] = Nullch;
4885 Perl_sv_2io(pTHX_ SV *sv)
4891 switch (SvTYPE(sv)) {
4899 Perl_croak(aTHX_ "Bad filehandle: %s", GvNAME(gv));
4903 Perl_croak(aTHX_ PL_no_usym, "filehandle");
4905 return sv_2io(SvRV(sv));
4906 gv = gv_fetchpv(SvPV(sv,n_a), FALSE, SVt_PVIO);
4912 Perl_croak(aTHX_ "Bad filehandle: %s", SvPV(sv,n_a));
4919 Perl_sv_2cv(pTHX_ SV *sv, HV **st, GV **gvp, I32 lref)
4926 return *gvp = Nullgv, Nullcv;
4927 switch (SvTYPE(sv)) {
4947 SV **sp = &sv; /* Used in tryAMAGICunDEREF macro. */
4948 tryAMAGICunDEREF(to_cv);
4951 if (SvTYPE(sv) == SVt_PVCV) {
4960 Perl_croak(aTHX_ "Not a subroutine reference");
4965 gv = gv_fetchpv(SvPV(sv, n_a), lref, SVt_PVCV);
4971 if (lref && !GvCVu(gv)) {
4974 tmpsv = NEWSV(704,0);
4975 gv_efullname3(tmpsv, gv, Nullch);
4976 /* XXX this is probably not what they think they're getting.
4977 * It has the same effect as "sub name;", i.e. just a forward
4979 newSUB(start_subparse(FALSE, 0),
4980 newSVOP(OP_CONST, 0, tmpsv),
4985 Perl_croak(aTHX_ "Unable to create sub named \"%s\"", SvPV(sv,n_a));
4992 Perl_sv_true(pTHX_ register SV *sv)
4999 if ((tXpv = (XPV*)SvANY(sv)) &&
5000 (tXpv->xpv_cur > 1 ||
5001 (tXpv->xpv_cur && *tXpv->xpv_pv != '0')))
5008 return SvIVX(sv) != 0;
5011 return SvNVX(sv) != 0.0;
5013 return sv_2bool(sv);
5019 Perl_sv_iv(pTHX_ register SV *sv)
5023 return (IV)SvUVX(sv);
5030 Perl_sv_uv(pTHX_ register SV *sv)
5035 return (UV)SvIVX(sv);
5041 Perl_sv_nv(pTHX_ register SV *sv)
5049 Perl_sv_pv(pTHX_ SV *sv)
5056 return sv_2pv(sv, &n_a);
5060 Perl_sv_pvn(pTHX_ SV *sv, STRLEN *lp)
5066 return sv_2pv(sv, lp);