3 * Copyright (c) 1991-2000, Larry Wall
5 * You may distribute under the terms of either the GNU General Public
6 * License or the Artistic License, as specified in the README file.
11 * "I wonder what the Entish is for 'yes' and 'no'," he thought.
19 #define SV_CHECK_THINKFIRST(sv) if (SvTHINKFIRST(sv)) sv_force_normal(sv)
21 static void do_report_used(pTHXo_ SV *sv);
22 static void do_clean_objs(pTHXo_ SV *sv);
23 #ifndef DISABLE_DESTRUCTOR_KLUDGE
24 static void do_clean_named_objs(pTHXo_ SV *sv);
26 static void do_clean_all(pTHXo_ SV *sv);
29 * "A time to plant, and a time to uproot what was planted..."
34 SvANY(p) = (void *)PL_sv_root; \
35 SvFLAGS(p) = SVTYPEMASK; \
40 /* sv_mutex must be held while calling uproot_SV() */
41 #define uproot_SV(p) \
44 PL_sv_root = (SV*)SvANY(p); \
66 if (PL_debug & 32768) \
76 if (PL_debug & 32768) {
81 for (sva = PL_sv_arenaroot; sva; sva = (SV *) SvANY(sva)) {
83 svend = &sva[SvREFCNT(sva)];
84 if (p >= sv && p < svend)
88 if (ckWARN_d(WARN_INTERNAL))
89 Perl_warner(aTHX_ WARN_INTERNAL,
90 "Attempt to free non-arena SV: 0x%"UVxf,
98 #else /* ! DEBUGGING */
100 #define del_SV(p) plant_SV(p)
102 #endif /* DEBUGGING */
105 Perl_sv_add_arena(pTHX_ char *ptr, U32 size, U32 flags)
110 Zero(ptr, size, char);
112 /* The first SV in an arena isn't an SV. */
113 SvANY(sva) = (void *) PL_sv_arenaroot; /* ptr to next arena */
114 SvREFCNT(sva) = size / sizeof(SV); /* number of SV slots */
115 SvFLAGS(sva) = flags; /* FAKE if not to be freed */
117 PL_sv_arenaroot = sva;
118 PL_sv_root = sva + 1;
120 svend = &sva[SvREFCNT(sva) - 1];
123 SvANY(sv) = (void *)(SV*)(sv + 1);
124 SvFLAGS(sv) = SVTYPEMASK;
128 SvFLAGS(sv) = SVTYPEMASK;
131 /* sv_mutex must be held while calling more_sv() */
138 sv_add_arena(PL_nice_chunk, PL_nice_chunk_size, 0);
139 PL_nice_chunk = Nullch;
142 char *chunk; /* must use New here to match call to */
143 New(704,chunk,1008,char); /* Safefree() in sv_free_arenas() */
144 sv_add_arena(chunk, 1008, 0);
151 S_visit(pTHX_ SVFUNC_t f)
157 for (sva = PL_sv_arenaroot; sva; sva = (SV*)SvANY(sva)) {
158 svend = &sva[SvREFCNT(sva)];
159 for (sv = sva + 1; sv < svend; ++sv) {
160 if (SvTYPE(sv) != SVTYPEMASK)
167 Perl_sv_report_used(pTHX)
169 visit(do_report_used);
173 Perl_sv_clean_objs(pTHX)
175 PL_in_clean_objs = TRUE;
176 visit(do_clean_objs);
177 #ifndef DISABLE_DESTRUCTOR_KLUDGE
178 /* some barnacles may yet remain, clinging to typeglobs */
179 visit(do_clean_named_objs);
181 PL_in_clean_objs = FALSE;
185 Perl_sv_clean_all(pTHX)
187 PL_in_clean_all = TRUE;
189 PL_in_clean_all = FALSE;
193 Perl_sv_free_arenas(pTHX)
197 XPV *arena, *arenanext;
199 /* Free arenas here, but be careful about fake ones. (We assume
200 contiguity of the fake ones with the corresponding real ones.) */
202 for (sva = PL_sv_arenaroot; sva; sva = svanext) {
203 svanext = (SV*) SvANY(sva);
204 while (svanext && SvFAKE(svanext))
205 svanext = (SV*) SvANY(svanext);
208 Safefree((void *)sva);
211 for (arena = PL_xiv_arenaroot; arena; arena = arenanext) {
212 arenanext = (XPV*)arena->xpv_pv;
215 PL_xiv_arenaroot = 0;
217 for (arena = PL_xnv_arenaroot; arena; arena = arenanext) {
218 arenanext = (XPV*)arena->xpv_pv;
221 PL_xnv_arenaroot = 0;
223 for (arena = PL_xrv_arenaroot; arena; arena = arenanext) {
224 arenanext = (XPV*)arena->xpv_pv;
227 PL_xrv_arenaroot = 0;
229 for (arena = PL_xpv_arenaroot; arena; arena = arenanext) {
230 arenanext = (XPV*)arena->xpv_pv;
233 PL_xpv_arenaroot = 0;
235 for (arena = (XPV*)PL_xpviv_arenaroot; arena; arena = arenanext) {
236 arenanext = (XPV*)arena->xpv_pv;
239 PL_xpviv_arenaroot = 0;
241 for (arena = (XPV*)PL_xpvnv_arenaroot; arena; arena = arenanext) {
242 arenanext = (XPV*)arena->xpv_pv;
245 PL_xpvnv_arenaroot = 0;
247 for (arena = (XPV*)PL_xpvcv_arenaroot; arena; arena = arenanext) {
248 arenanext = (XPV*)arena->xpv_pv;
251 PL_xpvcv_arenaroot = 0;
253 for (arena = (XPV*)PL_xpvav_arenaroot; arena; arena = arenanext) {
254 arenanext = (XPV*)arena->xpv_pv;
257 PL_xpvav_arenaroot = 0;
259 for (arena = (XPV*)PL_xpvhv_arenaroot; arena; arena = arenanext) {
260 arenanext = (XPV*)arena->xpv_pv;
263 PL_xpvhv_arenaroot = 0;
265 for (arena = (XPV*)PL_xpvmg_arenaroot; arena; arena = arenanext) {
266 arenanext = (XPV*)arena->xpv_pv;
269 PL_xpvmg_arenaroot = 0;
271 for (arena = (XPV*)PL_xpvlv_arenaroot; arena; arena = arenanext) {
272 arenanext = (XPV*)arena->xpv_pv;
275 PL_xpvlv_arenaroot = 0;
277 for (arena = (XPV*)PL_xpvbm_arenaroot; arena; arena = arenanext) {
278 arenanext = (XPV*)arena->xpv_pv;
281 PL_xpvbm_arenaroot = 0;
283 for (arena = (XPV*)PL_he_arenaroot; arena; arena = arenanext) {
284 arenanext = (XPV*)arena->xpv_pv;
290 Safefree(PL_nice_chunk);
291 PL_nice_chunk = Nullch;
292 PL_nice_chunk_size = 0;
298 Perl_report_uninit(pTHX)
301 Perl_warner(aTHX_ WARN_UNINITIALIZED, PL_warn_uninit,
302 " in ", PL_op_desc[PL_op->op_type]);
304 Perl_warner(aTHX_ WARN_UNINITIALIZED, PL_warn_uninit, "", "");
316 * See comment in more_xiv() -- RAM.
318 PL_xiv_root = *(IV**)xiv;
320 return (XPVIV*)((char*)xiv - STRUCT_OFFSET(XPVIV, xiv_iv));
324 S_del_xiv(pTHX_ XPVIV *p)
326 IV* xiv = (IV*)((char*)(p) + STRUCT_OFFSET(XPVIV, xiv_iv));
328 *(IV**)xiv = PL_xiv_root;
339 New(705, ptr, 1008/sizeof(XPV), XPV);
340 ptr->xpv_pv = (char*)PL_xiv_arenaroot; /* linked list of xiv arenas */
341 PL_xiv_arenaroot = ptr; /* to keep Purify happy */
344 xivend = &xiv[1008 / sizeof(IV) - 1];
345 xiv += (sizeof(XPV) - 1) / sizeof(IV) + 1; /* fudge by size of XPV */
347 while (xiv < xivend) {
348 *(IV**)xiv = (IV *)(xiv + 1);
362 PL_xnv_root = *(NV**)xnv;
364 return (XPVNV*)((char*)xnv - STRUCT_OFFSET(XPVNV, xnv_nv));
368 S_del_xnv(pTHX_ XPVNV *p)
370 NV* xnv = (NV*)((char*)(p) + STRUCT_OFFSET(XPVNV, xnv_nv));
372 *(NV**)xnv = PL_xnv_root;
383 New(711, ptr, 1008/sizeof(XPV), XPV);
384 ptr->xpv_pv = (char*)PL_xnv_arenaroot;
385 PL_xnv_arenaroot = ptr;
388 xnvend = &xnv[1008 / sizeof(NV) - 1];
389 xnv += (sizeof(XPVIV) - 1) / sizeof(NV) + 1; /* fudge by sizeof XPVIV */
391 while (xnv < xnvend) {
392 *(NV**)xnv = (NV*)(xnv + 1);
406 PL_xrv_root = (XRV*)xrv->xrv_rv;
412 S_del_xrv(pTHX_ XRV *p)
415 p->xrv_rv = (SV*)PL_xrv_root;
424 register XRV* xrvend;
426 New(712, ptr, 1008/sizeof(XPV), XPV);
427 ptr->xpv_pv = (char*)PL_xrv_arenaroot;
428 PL_xrv_arenaroot = ptr;
431 xrvend = &xrv[1008 / sizeof(XRV) - 1];
432 xrv += (sizeof(XPV) - 1) / sizeof(XRV) + 1;
434 while (xrv < xrvend) {
435 xrv->xrv_rv = (SV*)(xrv + 1);
449 PL_xpv_root = (XPV*)xpv->xpv_pv;
455 S_del_xpv(pTHX_ XPV *p)
458 p->xpv_pv = (char*)PL_xpv_root;
467 register XPV* xpvend;
468 New(713, xpv, 1008/sizeof(XPV), XPV);
469 xpv->xpv_pv = (char*)PL_xpv_arenaroot;
470 PL_xpv_arenaroot = xpv;
472 xpvend = &xpv[1008 / sizeof(XPV) - 1];
474 while (xpv < xpvend) {
475 xpv->xpv_pv = (char*)(xpv + 1);
488 xpviv = PL_xpviv_root;
489 PL_xpviv_root = (XPVIV*)xpviv->xpv_pv;
495 S_del_xpviv(pTHX_ XPVIV *p)
498 p->xpv_pv = (char*)PL_xpviv_root;
506 register XPVIV* xpviv;
507 register XPVIV* xpvivend;
508 New(714, xpviv, 1008/sizeof(XPVIV), XPVIV);
509 xpviv->xpv_pv = (char*)PL_xpviv_arenaroot;
510 PL_xpviv_arenaroot = xpviv;
512 xpvivend = &xpviv[1008 / sizeof(XPVIV) - 1];
513 PL_xpviv_root = ++xpviv;
514 while (xpviv < xpvivend) {
515 xpviv->xpv_pv = (char*)(xpviv + 1);
528 xpvnv = PL_xpvnv_root;
529 PL_xpvnv_root = (XPVNV*)xpvnv->xpv_pv;
535 S_del_xpvnv(pTHX_ XPVNV *p)
538 p->xpv_pv = (char*)PL_xpvnv_root;
546 register XPVNV* xpvnv;
547 register XPVNV* xpvnvend;
548 New(715, xpvnv, 1008/sizeof(XPVNV), XPVNV);
549 xpvnv->xpv_pv = (char*)PL_xpvnv_arenaroot;
550 PL_xpvnv_arenaroot = xpvnv;
552 xpvnvend = &xpvnv[1008 / sizeof(XPVNV) - 1];
553 PL_xpvnv_root = ++xpvnv;
554 while (xpvnv < xpvnvend) {
555 xpvnv->xpv_pv = (char*)(xpvnv + 1);
568 xpvcv = PL_xpvcv_root;
569 PL_xpvcv_root = (XPVCV*)xpvcv->xpv_pv;
575 S_del_xpvcv(pTHX_ XPVCV *p)
578 p->xpv_pv = (char*)PL_xpvcv_root;
586 register XPVCV* xpvcv;
587 register XPVCV* xpvcvend;
588 New(716, xpvcv, 1008/sizeof(XPVCV), XPVCV);
589 xpvcv->xpv_pv = (char*)PL_xpvcv_arenaroot;
590 PL_xpvcv_arenaroot = xpvcv;
592 xpvcvend = &xpvcv[1008 / sizeof(XPVCV) - 1];
593 PL_xpvcv_root = ++xpvcv;
594 while (xpvcv < xpvcvend) {
595 xpvcv->xpv_pv = (char*)(xpvcv + 1);
608 xpvav = PL_xpvav_root;
609 PL_xpvav_root = (XPVAV*)xpvav->xav_array;
615 S_del_xpvav(pTHX_ XPVAV *p)
618 p->xav_array = (char*)PL_xpvav_root;
626 register XPVAV* xpvav;
627 register XPVAV* xpvavend;
628 New(717, xpvav, 1008/sizeof(XPVAV), XPVAV);
629 xpvav->xav_array = (char*)PL_xpvav_arenaroot;
630 PL_xpvav_arenaroot = xpvav;
632 xpvavend = &xpvav[1008 / sizeof(XPVAV) - 1];
633 PL_xpvav_root = ++xpvav;
634 while (xpvav < xpvavend) {
635 xpvav->xav_array = (char*)(xpvav + 1);
638 xpvav->xav_array = 0;
648 xpvhv = PL_xpvhv_root;
649 PL_xpvhv_root = (XPVHV*)xpvhv->xhv_array;
655 S_del_xpvhv(pTHX_ XPVHV *p)
658 p->xhv_array = (char*)PL_xpvhv_root;
666 register XPVHV* xpvhv;
667 register XPVHV* xpvhvend;
668 New(718, xpvhv, 1008/sizeof(XPVHV), XPVHV);
669 xpvhv->xhv_array = (char*)PL_xpvhv_arenaroot;
670 PL_xpvhv_arenaroot = xpvhv;
672 xpvhvend = &xpvhv[1008 / sizeof(XPVHV) - 1];
673 PL_xpvhv_root = ++xpvhv;
674 while (xpvhv < xpvhvend) {
675 xpvhv->xhv_array = (char*)(xpvhv + 1);
678 xpvhv->xhv_array = 0;
688 xpvmg = PL_xpvmg_root;
689 PL_xpvmg_root = (XPVMG*)xpvmg->xpv_pv;
695 S_del_xpvmg(pTHX_ XPVMG *p)
698 p->xpv_pv = (char*)PL_xpvmg_root;
706 register XPVMG* xpvmg;
707 register XPVMG* xpvmgend;
708 New(719, xpvmg, 1008/sizeof(XPVMG), XPVMG);
709 xpvmg->xpv_pv = (char*)PL_xpvmg_arenaroot;
710 PL_xpvmg_arenaroot = xpvmg;
712 xpvmgend = &xpvmg[1008 / sizeof(XPVMG) - 1];
713 PL_xpvmg_root = ++xpvmg;
714 while (xpvmg < xpvmgend) {
715 xpvmg->xpv_pv = (char*)(xpvmg + 1);
728 xpvlv = PL_xpvlv_root;
729 PL_xpvlv_root = (XPVLV*)xpvlv->xpv_pv;
735 S_del_xpvlv(pTHX_ XPVLV *p)
738 p->xpv_pv = (char*)PL_xpvlv_root;
746 register XPVLV* xpvlv;
747 register XPVLV* xpvlvend;
748 New(720, xpvlv, 1008/sizeof(XPVLV), XPVLV);
749 xpvlv->xpv_pv = (char*)PL_xpvlv_arenaroot;
750 PL_xpvlv_arenaroot = xpvlv;
752 xpvlvend = &xpvlv[1008 / sizeof(XPVLV) - 1];
753 PL_xpvlv_root = ++xpvlv;
754 while (xpvlv < xpvlvend) {
755 xpvlv->xpv_pv = (char*)(xpvlv + 1);
768 xpvbm = PL_xpvbm_root;
769 PL_xpvbm_root = (XPVBM*)xpvbm->xpv_pv;
775 S_del_xpvbm(pTHX_ XPVBM *p)
778 p->xpv_pv = (char*)PL_xpvbm_root;
786 register XPVBM* xpvbm;
787 register XPVBM* xpvbmend;
788 New(721, xpvbm, 1008/sizeof(XPVBM), XPVBM);
789 xpvbm->xpv_pv = (char*)PL_xpvbm_arenaroot;
790 PL_xpvbm_arenaroot = xpvbm;
792 xpvbmend = &xpvbm[1008 / sizeof(XPVBM) - 1];
793 PL_xpvbm_root = ++xpvbm;
794 while (xpvbm < xpvbmend) {
795 xpvbm->xpv_pv = (char*)(xpvbm + 1);
802 # define my_safemalloc(s) (void*)safexmalloc(717,s)
803 # define my_safefree(p) safexfree((char*)p)
805 # define my_safemalloc(s) (void*)safemalloc(s)
806 # define my_safefree(p) safefree((char*)p)
811 #define new_XIV() my_safemalloc(sizeof(XPVIV))
812 #define del_XIV(p) my_safefree(p)
814 #define new_XNV() my_safemalloc(sizeof(XPVNV))
815 #define del_XNV(p) my_safefree(p)
817 #define new_XRV() my_safemalloc(sizeof(XRV))
818 #define del_XRV(p) my_safefree(p)
820 #define new_XPV() my_safemalloc(sizeof(XPV))
821 #define del_XPV(p) my_safefree(p)
823 #define new_XPVIV() my_safemalloc(sizeof(XPVIV))
824 #define del_XPVIV(p) my_safefree(p)
826 #define new_XPVNV() my_safemalloc(sizeof(XPVNV))
827 #define del_XPVNV(p) my_safefree(p)
829 #define new_XPVCV() my_safemalloc(sizeof(XPVCV))
830 #define del_XPVCV(p) my_safefree(p)
832 #define new_XPVAV() my_safemalloc(sizeof(XPVAV))
833 #define del_XPVAV(p) my_safefree(p)
835 #define new_XPVHV() my_safemalloc(sizeof(XPVHV))
836 #define del_XPVHV(p) my_safefree(p)
838 #define new_XPVMG() my_safemalloc(sizeof(XPVMG))
839 #define del_XPVMG(p) my_safefree(p)
841 #define new_XPVLV() my_safemalloc(sizeof(XPVLV))
842 #define del_XPVLV(p) my_safefree(p)
844 #define new_XPVBM() my_safemalloc(sizeof(XPVBM))
845 #define del_XPVBM(p) my_safefree(p)
849 #define new_XIV() (void*)new_xiv()
850 #define del_XIV(p) del_xiv((XPVIV*) p)
852 #define new_XNV() (void*)new_xnv()
853 #define del_XNV(p) del_xnv((XPVNV*) p)
855 #define new_XRV() (void*)new_xrv()
856 #define del_XRV(p) del_xrv((XRV*) p)
858 #define new_XPV() (void*)new_xpv()
859 #define del_XPV(p) del_xpv((XPV *)p)
861 #define new_XPVIV() (void*)new_xpviv()
862 #define del_XPVIV(p) del_xpviv((XPVIV *)p)
864 #define new_XPVNV() (void*)new_xpvnv()
865 #define del_XPVNV(p) del_xpvnv((XPVNV *)p)
867 #define new_XPVCV() (void*)new_xpvcv()
868 #define del_XPVCV(p) del_xpvcv((XPVCV *)p)
870 #define new_XPVAV() (void*)new_xpvav()
871 #define del_XPVAV(p) del_xpvav((XPVAV *)p)
873 #define new_XPVHV() (void*)new_xpvhv()
874 #define del_XPVHV(p) del_xpvhv((XPVHV *)p)
876 #define new_XPVMG() (void*)new_xpvmg()
877 #define del_XPVMG(p) del_xpvmg((XPVMG *)p)
879 #define new_XPVLV() (void*)new_xpvlv()
880 #define del_XPVLV(p) del_xpvlv((XPVLV *)p)
882 #define new_XPVBM() (void*)new_xpvbm()
883 #define del_XPVBM(p) del_xpvbm((XPVBM *)p)
887 #define new_XPVGV() my_safemalloc(sizeof(XPVGV))
888 #define del_XPVGV(p) my_safefree(p)
890 #define new_XPVFM() my_safemalloc(sizeof(XPVFM))
891 #define del_XPVFM(p) my_safefree(p)
893 #define new_XPVIO() my_safemalloc(sizeof(XPVIO))
894 #define del_XPVIO(p) my_safefree(p)
897 =for apidoc sv_upgrade
899 Upgrade an SV to a more complex form. Use C<SvUPGRADE>. See
906 Perl_sv_upgrade(pTHX_ register SV *sv, U32 mt)
916 if (mt != SVt_PV && SvREADONLY(sv) && SvFAKE(sv)) {
920 if (SvTYPE(sv) == mt)
926 switch (SvTYPE(sv)) {
947 else if (mt < SVt_PVIV)
964 pv = (char*)SvRV(sv);
984 else if (mt == SVt_NV)
995 del_XPVIV(SvANY(sv));
1005 del_XPVNV(SvANY(sv));
1013 magic = SvMAGIC(sv);
1014 stash = SvSTASH(sv);
1015 del_XPVMG(SvANY(sv));
1018 Perl_croak(aTHX_ "Can't upgrade that kind of scalar");
1023 Perl_croak(aTHX_ "Can't upgrade to undef");
1025 SvANY(sv) = new_XIV();
1029 SvANY(sv) = new_XNV();
1033 SvANY(sv) = new_XRV();
1037 SvANY(sv) = new_XPV();
1043 SvANY(sv) = new_XPVIV();
1053 SvANY(sv) = new_XPVNV();
1061 SvANY(sv) = new_XPVMG();
1067 SvMAGIC(sv) = magic;
1068 SvSTASH(sv) = stash;
1071 SvANY(sv) = new_XPVLV();
1077 SvMAGIC(sv) = magic;
1078 SvSTASH(sv) = stash;
1085 SvANY(sv) = new_XPVAV();
1093 SvMAGIC(sv) = magic;
1094 SvSTASH(sv) = stash;
1100 SvANY(sv) = new_XPVHV();
1108 SvMAGIC(sv) = magic;
1109 SvSTASH(sv) = stash;
1116 SvANY(sv) = new_XPVCV();
1117 Zero(SvANY(sv), 1, XPVCV);
1123 SvMAGIC(sv) = magic;
1124 SvSTASH(sv) = stash;
1127 SvANY(sv) = new_XPVGV();
1133 SvMAGIC(sv) = magic;
1134 SvSTASH(sv) = stash;
1142 SvANY(sv) = new_XPVBM();
1148 SvMAGIC(sv) = magic;
1149 SvSTASH(sv) = stash;
1155 SvANY(sv) = new_XPVFM();
1156 Zero(SvANY(sv), 1, XPVFM);
1162 SvMAGIC(sv) = magic;
1163 SvSTASH(sv) = stash;
1166 SvANY(sv) = new_XPVIO();
1167 Zero(SvANY(sv), 1, XPVIO);
1173 SvMAGIC(sv) = magic;
1174 SvSTASH(sv) = stash;
1175 IoPAGE_LEN(sv) = 60;
1178 SvFLAGS(sv) &= ~SVTYPEMASK;
1184 Perl_sv_backoff(pTHX_ register SV *sv)
1188 char *s = SvPVX(sv);
1189 SvLEN(sv) += SvIVX(sv);
1190 SvPVX(sv) -= SvIVX(sv);
1192 Move(s, SvPVX(sv), SvCUR(sv)+1, char);
1194 SvFLAGS(sv) &= ~SVf_OOK;
1201 Expands the character buffer in the SV. This will use C<sv_unref> and will
1202 upgrade the SV to C<SVt_PV>. Returns a pointer to the character buffer.
1209 Perl_sv_grow(pTHX_ register SV *sv, register STRLEN newlen)
1213 #ifdef HAS_64K_LIMIT
1214 if (newlen >= 0x10000) {
1215 PerlIO_printf(Perl_debug_log,
1216 "Allocation too large: %"UVxf"\n", (UV)newlen);
1219 #endif /* HAS_64K_LIMIT */
1222 if (SvTYPE(sv) < SVt_PV) {
1223 sv_upgrade(sv, SVt_PV);
1226 else if (SvOOK(sv)) { /* pv is offset? */
1229 if (newlen > SvLEN(sv))
1230 newlen += 10 * (newlen - SvCUR(sv)); /* avoid copy each time */
1231 #ifdef HAS_64K_LIMIT
1232 if (newlen >= 0x10000)
1238 if (newlen > SvLEN(sv)) { /* need more room? */
1239 if (SvLEN(sv) && s) {
1240 #if defined(MYMALLOC) && !defined(LEAKTEST)
1241 STRLEN l = malloced_size((void*)SvPVX(sv));
1247 Renew(s,newlen,char);
1250 New(703,s,newlen,char);
1252 SvLEN_set(sv, newlen);
1258 =for apidoc sv_setiv
1260 Copies an integer into the given SV. Does not handle 'set' magic. See
1267 Perl_sv_setiv(pTHX_ register SV *sv, IV i)
1269 SV_CHECK_THINKFIRST(sv);
1270 switch (SvTYPE(sv)) {
1272 sv_upgrade(sv, SVt_IV);
1275 sv_upgrade(sv, SVt_PVNV);
1279 sv_upgrade(sv, SVt_PVIV);
1288 Perl_croak(aTHX_ "Can't coerce %s to integer in %s", sv_reftype(sv,0),
1289 PL_op_desc[PL_op->op_type]);
1291 (void)SvIOK_only(sv); /* validate number */
1297 =for apidoc sv_setiv_mg
1299 Like C<sv_setiv>, but also handles 'set' magic.
1305 Perl_sv_setiv_mg(pTHX_ register SV *sv, IV i)
1312 =for apidoc sv_setuv
1314 Copies an unsigned integer into the given SV. Does not handle 'set' magic.
1321 Perl_sv_setuv(pTHX_ register SV *sv, UV u)
1329 =for apidoc sv_setuv_mg
1331 Like C<sv_setuv>, but also handles 'set' magic.
1337 Perl_sv_setuv_mg(pTHX_ register SV *sv, UV u)
1344 =for apidoc sv_setnv
1346 Copies a double into the given SV. Does not handle 'set' magic. See
1353 Perl_sv_setnv(pTHX_ register SV *sv, NV num)
1355 SV_CHECK_THINKFIRST(sv);
1356 switch (SvTYPE(sv)) {
1359 sv_upgrade(sv, SVt_NV);
1364 sv_upgrade(sv, SVt_PVNV);
1373 Perl_croak(aTHX_ "Can't coerce %s to number in %s", sv_reftype(sv,0),
1374 PL_op_name[PL_op->op_type]);
1377 (void)SvNOK_only(sv); /* validate number */
1382 =for apidoc sv_setnv_mg
1384 Like C<sv_setnv>, but also handles 'set' magic.
1390 Perl_sv_setnv_mg(pTHX_ register SV *sv, NV num)
1397 S_not_a_number(pTHX_ SV *sv)
1402 char *limit = tmpbuf + sizeof(tmpbuf) - 8;
1403 /* each *s can expand to 4 chars + "...\0",
1404 i.e. need room for 8 chars */
1406 for (s = SvPVX(sv); *s && d < limit; s++) {
1408 if (ch & 128 && !isPRINT_LC(ch)) {
1417 else if (ch == '\r') {
1421 else if (ch == '\f') {
1425 else if (ch == '\\') {
1429 else if (isPRINT_LC(ch))
1444 Perl_warner(aTHX_ WARN_NUMERIC,
1445 "Argument \"%s\" isn't numeric in %s", tmpbuf,
1446 PL_op_desc[PL_op->op_type]);
1448 Perl_warner(aTHX_ WARN_NUMERIC,
1449 "Argument \"%s\" isn't numeric", tmpbuf);
1452 /* the number can be converted to integer with atol() or atoll() */
1453 #define IS_NUMBER_TO_INT_BY_ATOL 0x01
1454 #define IS_NUMBER_TO_INT_BY_ATOF 0x02 /* atol() may be != atof() */
1455 #define IS_NUMBER_NOT_IV 0x04 /* (IV)atof() may be != atof() */
1456 #define IS_NUMBER_NEG 0x08 /* not good to cache UV */
1457 #define IS_NUMBER_INFINITY 0x10 /* this is big */
1459 /* Actually, ISO C leaves conversion of UV to IV undefined, but
1460 until proven guilty, assume that things are not that bad... */
1463 Perl_sv_2iv(pTHX_ register SV *sv)
1467 if (SvGMAGICAL(sv)) {
1472 return I_V(SvNVX(sv));
1474 if (SvPOKp(sv) && SvLEN(sv))
1477 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
1478 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
1484 if (SvTHINKFIRST(sv)) {
1487 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv,numer)) &&
1488 (SvRV(tmpstr) != SvRV(sv)))
1489 return SvIV(tmpstr);
1490 return PTR2IV(SvRV(sv));
1492 if (SvREADONLY(sv) && SvFAKE(sv)) {
1493 sv_force_normal(sv);
1495 if (SvREADONLY(sv) && !SvOK(sv)) {
1496 if (ckWARN(WARN_UNINITIALIZED))
1503 return (IV)(SvUVX(sv));
1510 /* We can cache the IV/UV value even if it not good enough
1511 * to reconstruct NV, since the conversion to PV will prefer
1515 if (SvTYPE(sv) == SVt_NV)
1516 sv_upgrade(sv, SVt_PVNV);
1519 if (SvNVX(sv) < (NV)IV_MAX + 0.5)
1520 SvIVX(sv) = I_V(SvNVX(sv));
1522 SvUVX(sv) = U_V(SvNVX(sv));
1525 DEBUG_c(PerlIO_printf(Perl_debug_log,
1526 "0x%"UVxf" 2iv(%"UVuf" => %"IVdf") (as unsigned)\n",
1530 return (IV)SvUVX(sv);
1533 else if (SvPOKp(sv) && SvLEN(sv)) {
1534 I32 numtype = looks_like_number(sv);
1536 /* We want to avoid a possible problem when we cache an IV which
1537 may be later translated to an NV, and the resulting NV is not
1538 the translation of the initial data.
1540 This means that if we cache such an IV, we need to cache the
1541 NV as well. Moreover, we trade speed for space, and do not
1542 cache the NV if not needed.
1544 if (numtype & IS_NUMBER_NOT_IV) {
1545 /* May be not an integer. Need to cache NV if we cache IV
1546 * - otherwise future conversion to NV will be wrong. */
1549 d = Atof(SvPVX(sv));
1551 if (SvTYPE(sv) < SVt_PVNV)
1552 sv_upgrade(sv, SVt_PVNV);
1556 #if defined(USE_LONG_DOUBLE)
1557 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2nv(%" PERL_PRIgldbl ")\n",
1558 PTR2UV(sv), SvNVX(sv)));
1560 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2nv(%g)\n",
1561 PTR2UV(sv), SvNVX(sv)));
1563 if (SvNVX(sv) < (NV)IV_MAX + 0.5)
1564 SvIVX(sv) = I_V(SvNVX(sv));
1566 SvUVX(sv) = U_V(SvNVX(sv));
1571 else { /* The NV may be reconstructed from IV - safe to cache IV,
1572 which may be calculated by atol(). */
1573 if (SvTYPE(sv) < SVt_PVIV)
1574 sv_upgrade(sv, SVt_PVIV);
1576 SvIVX(sv) = Atol(SvPVX(sv));
1577 if (! numtype && ckWARN(WARN_NUMERIC))
1582 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing && !(SvFLAGS(sv) & SVs_PADTMP))
1584 if (SvTYPE(sv) < SVt_IV)
1585 /* Typically the caller expects that sv_any is not NULL now. */
1586 sv_upgrade(sv, SVt_IV);
1589 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2iv(%"IVdf")\n",
1590 PTR2UV(sv),SvIVX(sv)));
1591 return SvIsUV(sv) ? (IV)SvUVX(sv) : SvIVX(sv);
1595 Perl_sv_2uv(pTHX_ register SV *sv)
1599 if (SvGMAGICAL(sv)) {
1604 return U_V(SvNVX(sv));
1605 if (SvPOKp(sv) && SvLEN(sv))
1608 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
1609 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
1615 if (SvTHINKFIRST(sv)) {
1618 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv,numer)) &&
1619 (SvRV(tmpstr) != SvRV(sv)))
1620 return SvUV(tmpstr);
1621 return PTR2UV(SvRV(sv));
1623 if (SvREADONLY(sv) && !SvOK(sv)) {
1624 if (ckWARN(WARN_UNINITIALIZED))
1634 return (UV)SvIVX(sv);
1638 /* We can cache the IV/UV value even if it not good enough
1639 * to reconstruct NV, since the conversion to PV will prefer
1642 if (SvTYPE(sv) == SVt_NV)
1643 sv_upgrade(sv, SVt_PVNV);
1645 if (SvNVX(sv) >= -0.5) {
1647 SvUVX(sv) = U_V(SvNVX(sv));
1650 SvIVX(sv) = I_V(SvNVX(sv));
1652 DEBUG_c(PerlIO_printf(Perl_debug_log,
1653 "0x%"UVxf" 2uv(%"IVdf" => %"IVdf") (as signed)\n",
1656 (IV)(UV)SvIVX(sv)));
1657 return (UV)SvIVX(sv);
1660 else if (SvPOKp(sv) && SvLEN(sv)) {
1661 I32 numtype = looks_like_number(sv);
1663 /* We want to avoid a possible problem when we cache a UV which
1664 may be later translated to an NV, and the resulting NV is not
1665 the translation of the initial data.
1667 This means that if we cache such a UV, we need to cache the
1668 NV as well. Moreover, we trade speed for space, and do not
1669 cache the NV if not needed.
1671 if (numtype & IS_NUMBER_NOT_IV) {
1672 /* May be not an integer. Need to cache NV if we cache IV
1673 * - otherwise future conversion to NV will be wrong. */
1676 d = Atof(SvPVX(sv));
1678 if (SvTYPE(sv) < SVt_PVNV)
1679 sv_upgrade(sv, SVt_PVNV);
1683 #if defined(USE_LONG_DOUBLE)
1684 DEBUG_c(PerlIO_printf(Perl_debug_log,
1685 "0x%"UVxf" 2nv(%" PERL_PRIgldbl ")\n",
1686 PTR2UV(sv), SvNVX(sv)));
1688 DEBUG_c(PerlIO_printf(Perl_debug_log,
1689 "0x%"UVxf" 2nv(%g)\n",
1690 PTR2UV(sv), SvNVX(sv)));
1692 if (SvNVX(sv) < -0.5) {
1693 SvIVX(sv) = I_V(SvNVX(sv));
1696 SvUVX(sv) = U_V(SvNVX(sv));
1700 else if (numtype & IS_NUMBER_NEG) {
1701 /* The NV may be reconstructed from IV - safe to cache IV,
1702 which may be calculated by atol(). */
1703 if (SvTYPE(sv) == SVt_PV)
1704 sv_upgrade(sv, SVt_PVIV);
1706 SvIVX(sv) = (IV)Atol(SvPVX(sv));
1708 else if (numtype) { /* Non-negative */
1709 /* The NV may be reconstructed from UV - safe to cache UV,
1710 which may be calculated by strtoul()/atol. */
1711 if (SvTYPE(sv) == SVt_PV)
1712 sv_upgrade(sv, SVt_PVIV);
1714 (void)SvIsUV_on(sv);
1716 SvUVX(sv) = Strtoul(SvPVX(sv), Null(char**), 10);
1717 #else /* no atou(), but we know the number fits into IV... */
1718 /* The only problem may be if it is negative... */
1719 SvUVX(sv) = (UV)Atol(SvPVX(sv));
1722 else { /* Not a number. Cache 0. */
1723 if (SvTYPE(sv) < SVt_PVIV)
1724 sv_upgrade(sv, SVt_PVIV);
1726 (void)SvIsUV_on(sv);
1727 SvUVX(sv) = 0; /* We assume that 0s have the
1728 same bitmap in IV and UV. */
1729 if (ckWARN(WARN_NUMERIC))
1734 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
1735 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
1738 if (SvTYPE(sv) < SVt_IV)
1739 /* Typically the caller expects that sv_any is not NULL now. */
1740 sv_upgrade(sv, SVt_IV);
1744 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2uv(%"UVuf")\n",
1745 PTR2UV(sv),SvUVX(sv)));
1746 return SvIsUV(sv) ? SvUVX(sv) : (UV)SvIVX(sv);
1750 Perl_sv_2nv(pTHX_ register SV *sv)
1754 if (SvGMAGICAL(sv)) {
1758 if (SvPOKp(sv) && SvLEN(sv)) {
1759 if (ckWARN(WARN_NUMERIC) && !SvIOKp(sv) && !looks_like_number(sv))
1761 return Atof(SvPVX(sv));
1765 return (NV)SvUVX(sv);
1767 return (NV)SvIVX(sv);
1770 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
1771 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
1777 if (SvTHINKFIRST(sv)) {
1780 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv,numer)) &&
1781 (SvRV(tmpstr) != SvRV(sv)))
1782 return SvNV(tmpstr);
1783 return PTR2NV(SvRV(sv));
1785 if (SvREADONLY(sv) && !SvOK(sv)) {
1786 if (ckWARN(WARN_UNINITIALIZED))
1791 if (SvTYPE(sv) < SVt_NV) {
1792 if (SvTYPE(sv) == SVt_IV)
1793 sv_upgrade(sv, SVt_PVNV);
1795 sv_upgrade(sv, SVt_NV);
1796 #if defined(USE_LONG_DOUBLE)
1798 STORE_NUMERIC_LOCAL_SET_STANDARD();
1799 PerlIO_printf(Perl_debug_log,
1800 "0x%"UVxf" num(%" PERL_PRIgldbl ")\n",
1801 PTR2UV(sv), SvNVX(sv));
1802 RESTORE_NUMERIC_LOCAL();
1806 STORE_NUMERIC_LOCAL_SET_STANDARD();
1807 PerlIO_printf(Perl_debug_log, "0x%"UVxf" num(%g)\n",
1808 PTR2UV(sv), SvNVX(sv));
1809 RESTORE_NUMERIC_LOCAL();
1813 else if (SvTYPE(sv) < SVt_PVNV)
1814 sv_upgrade(sv, SVt_PVNV);
1816 (!SvPOKp(sv) || !strchr(SvPVX(sv),'.') || !looks_like_number(sv)))
1818 SvNVX(sv) = SvIsUV(sv) ? (NV)SvUVX(sv) : (NV)SvIVX(sv);
1820 else if (SvPOKp(sv) && SvLEN(sv)) {
1821 if (ckWARN(WARN_NUMERIC) && !SvIOKp(sv) && !looks_like_number(sv))
1823 SvNVX(sv) = Atof(SvPVX(sv));
1826 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing && !(SvFLAGS(sv) & SVs_PADTMP))
1828 if (SvTYPE(sv) < SVt_NV)
1829 /* Typically the caller expects that sv_any is not NULL now. */
1830 sv_upgrade(sv, SVt_NV);
1834 #if defined(USE_LONG_DOUBLE)
1836 STORE_NUMERIC_LOCAL_SET_STANDARD();
1837 PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2nv(%" PERL_PRIgldbl ")\n",
1838 PTR2UV(sv), SvNVX(sv));
1839 RESTORE_NUMERIC_LOCAL();
1843 STORE_NUMERIC_LOCAL_SET_STANDARD();
1844 PerlIO_printf(Perl_debug_log, "0x%"UVxf" 1nv(%g)\n",
1845 PTR2UV(sv), SvNVX(sv));
1846 RESTORE_NUMERIC_LOCAL();
1853 S_asIV(pTHX_ SV *sv)
1855 I32 numtype = looks_like_number(sv);
1858 if (numtype & IS_NUMBER_TO_INT_BY_ATOL)
1859 return Atol(SvPVX(sv));
1861 if (ckWARN(WARN_NUMERIC))
1864 d = Atof(SvPVX(sv));
1869 S_asUV(pTHX_ SV *sv)
1871 I32 numtype = looks_like_number(sv);
1874 if (numtype & IS_NUMBER_TO_INT_BY_ATOL)
1875 return Strtoul(SvPVX(sv), Null(char**), 10);
1878 if (ckWARN(WARN_NUMERIC))
1881 return U_V(Atof(SvPVX(sv)));
1885 * Returns a combination of (advisory only - can get false negatives)
1886 * IS_NUMBER_TO_INT_BY_ATOL, IS_NUMBER_TO_INT_BY_ATOF, IS_NUMBER_NOT_IV,
1888 * 0 if does not look like number.
1890 * In fact possible values are 0 and
1891 * IS_NUMBER_TO_INT_BY_ATOL 123
1892 * IS_NUMBER_TO_INT_BY_ATOL | IS_NUMBER_NOT_IV 123.1
1893 * IS_NUMBER_TO_INT_BY_ATOF | IS_NUMBER_NOT_IV 123e0
1894 * IS_NUMBER_INFINITY
1895 * with a possible addition of IS_NUMBER_NEG.
1899 =for apidoc looks_like_number
1901 Test if an the content of an SV looks like a number (or is a
1908 Perl_looks_like_number(pTHX_ SV *sv)
1911 register char *send;
1912 register char *sbegin;
1913 register char *nbegin;
1922 else if (SvPOKp(sv))
1923 sbegin = SvPV(sv, len);
1926 send = sbegin + len;
1933 numtype = IS_NUMBER_NEG;
1940 * we return IS_NUMBER_TO_INT_BY_ATOL if the number can be converted
1941 * to _integer_ with atol() and IS_NUMBER_TO_INT_BY_ATOF if you need
1945 /* next must be digit or the radix separator or beginning of infinity */
1949 } while (isDIGIT(*s));
1951 if (s - nbegin >= TYPE_DIGITS(IV)) /* Cannot cache ato[ul]() */
1952 numtype |= IS_NUMBER_TO_INT_BY_ATOF | IS_NUMBER_NOT_IV;
1954 numtype |= IS_NUMBER_TO_INT_BY_ATOL;
1957 #ifdef USE_LOCALE_NUMERIC
1958 || IS_NUMERIC_RADIX(*s)
1962 numtype |= IS_NUMBER_NOT_IV;
1963 while (isDIGIT(*s)) /* optional digits after the radix */
1968 #ifdef USE_LOCALE_NUMERIC
1969 || IS_NUMERIC_RADIX(*s)
1973 numtype |= IS_NUMBER_TO_INT_BY_ATOL | IS_NUMBER_NOT_IV;
1974 /* no digits before the radix means we need digits after it */
1978 } while (isDIGIT(*s));
1983 else if (*s == 'I' || *s == 'i') {
1984 s++; if (*s != 'N' && *s != 'n') return 0;
1985 s++; if (*s != 'F' && *s != 'f') return 0;
1986 s++; if (*s == 'I' || *s == 'i') {
1987 s++; if (*s != 'N' && *s != 'n') return 0;
1988 s++; if (*s != 'I' && *s != 'i') return 0;
1989 s++; if (*s != 'T' && *s != 't') return 0;
1990 s++; if (*s != 'Y' && *s != 'y') return 0;
1999 numtype = IS_NUMBER_INFINITY;
2001 /* we can have an optional exponent part */
2002 if (*s == 'e' || *s == 'E') {
2003 numtype &= ~IS_NUMBER_NEG;
2004 numtype |= IS_NUMBER_TO_INT_BY_ATOF | IS_NUMBER_NOT_IV;
2006 if (*s == '+' || *s == '-')
2011 } while (isDIGIT(*s));
2021 if (len == 10 && memEQ(sbegin, "0 but true", 10))
2022 return IS_NUMBER_TO_INT_BY_ATOL;
2027 Perl_sv_2pv_nolen(pTHX_ register SV *sv)
2030 return sv_2pv(sv, &n_a);
2033 /* We assume that buf is at least TYPE_CHARS(UV) long. */
2035 uiv_2buf(char *buf, IV iv, UV uv, int is_uv, char **peob)
2037 char *ptr = buf + TYPE_CHARS(UV);
2051 *--ptr = '0' + (uv % 10);
2060 Perl_sv_2pv(pTHX_ register SV *sv, STRLEN *lp)
2065 char tbuf[64]; /* Must fit sprintf/Gconvert of longest IV/NV */
2066 char *tmpbuf = tbuf;
2072 if (SvGMAGICAL(sv)) {
2080 (void)sprintf(tmpbuf,"%"UVuf, (UV)SvUVX(sv));
2082 (void)sprintf(tmpbuf,"%"IVdf, (IV)SvIVX(sv));
2087 Gconvert(SvNVX(sv), NV_DIG, 0, tmpbuf);
2092 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
2093 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
2100 if (SvTHINKFIRST(sv)) {
2103 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv,string)) &&
2104 (SvRV(tmpstr) != SvRV(sv)))
2105 return SvPV(tmpstr,*lp);
2112 switch (SvTYPE(sv)) {
2114 if ( ((SvFLAGS(sv) &
2115 (SVs_OBJECT|SVf_OK|SVs_GMG|SVs_SMG|SVs_RMG))
2116 == (SVs_OBJECT|SVs_RMG))
2117 && strEQ(s=HvNAME(SvSTASH(sv)), "Regexp")
2118 && (mg = mg_find(sv, 'r'))) {
2119 regexp *re = (regexp *)mg->mg_obj;
2122 char *fptr = "msix";
2127 U16 reganch = (re->reganch & PMf_COMPILETIME) >> 12;
2129 while((ch = *fptr++)) {
2131 reflags[left++] = ch;
2134 reflags[right--] = ch;
2139 reflags[left] = '-';
2143 mg->mg_len = re->prelen + 4 + left;
2144 New(616, mg->mg_ptr, mg->mg_len + 1 + left, char);
2145 Copy("(?", mg->mg_ptr, 2, char);
2146 Copy(reflags, mg->mg_ptr+2, left, char);
2147 Copy(":", mg->mg_ptr+left+2, 1, char);
2148 Copy(re->precomp, mg->mg_ptr+3+left, re->prelen, char);
2149 mg->mg_ptr[mg->mg_len - 1] = ')';
2150 mg->mg_ptr[mg->mg_len] = 0;
2152 PL_reginterp_cnt += re->program[0].next_off;
2164 case SVt_PVBM: if (SvROK(sv))
2167 s = "SCALAR"; break;
2168 case SVt_PVLV: s = "LVALUE"; break;
2169 case SVt_PVAV: s = "ARRAY"; break;
2170 case SVt_PVHV: s = "HASH"; break;
2171 case SVt_PVCV: s = "CODE"; break;
2172 case SVt_PVGV: s = "GLOB"; break;
2173 case SVt_PVFM: s = "FORMAT"; break;
2174 case SVt_PVIO: s = "IO"; break;
2175 default: s = "UNKNOWN"; break;
2179 Perl_sv_setpvf(aTHX_ tsv, "%s=%s", HvNAME(SvSTASH(sv)), s);
2182 Perl_sv_catpvf(aTHX_ tsv, "(0x%"UVxf")", PTR2UV(sv));
2188 if (SvREADONLY(sv) && !SvOK(sv)) {
2189 if (ckWARN(WARN_UNINITIALIZED))
2195 if (SvNOKp(sv)) { /* See note in sv_2uv() */
2196 /* XXXX 64-bit? IV may have better precision... */
2197 /* I tried changing this to be 64-bit-aware and
2198 * the t/op/numconvert.t became very, very, angry.
2200 if (SvTYPE(sv) < SVt_PVNV)
2201 sv_upgrade(sv, SVt_PVNV);
2202 /* The +20 is pure guesswork. Configure test needed. --jhi */
2203 SvGROW(sv, NV_DIG + 20);
2205 olderrno = errno; /* some Xenix systems wipe out errno here */
2207 if (SvNVX(sv) == 0.0)
2208 (void)strcpy(s,"0");
2212 Gconvert(SvNVX(sv), NV_DIG, 0, s);
2215 #ifdef FIXNEGATIVEZERO
2216 if (*s == '-' && s[1] == '0' && !s[2])
2225 else if (SvIOKp(sv)) {
2226 U32 isIOK = SvIOK(sv);
2227 U32 isUIOK = SvIsUV(sv);
2228 char buf[TYPE_CHARS(UV)];
2231 if (SvTYPE(sv) < SVt_PVIV)
2232 sv_upgrade(sv, SVt_PVIV);
2234 ptr = uiv_2buf(buf, 0, SvUVX(sv), 1, &ebuf);
2236 ptr = uiv_2buf(buf, SvIVX(sv), 0, 0, &ebuf);
2237 SvGROW(sv, ebuf - ptr + 1); /* inlined from sv_setpvn */
2238 Move(ptr,SvPVX(sv),ebuf - ptr,char);
2239 SvCUR_set(sv, ebuf - ptr);
2251 if (ckWARN(WARN_UNINITIALIZED)
2252 && !PL_localizing && !(SvFLAGS(sv) & SVs_PADTMP))
2255 if (SvTYPE(sv) < SVt_PV)
2256 /* Typically the caller expects that sv_any is not NULL now. */
2257 sv_upgrade(sv, SVt_PV);
2260 *lp = s - SvPVX(sv);
2263 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2pv(%s)\n",
2264 PTR2UV(sv),SvPVX(sv)));
2268 if (SvROK(sv)) { /* XXX Skip this when sv_pvn_force calls */
2269 /* Sneaky stuff here */
2273 tsv = newSVpv(tmpbuf, 0);
2289 len = strlen(tmpbuf);
2291 #ifdef FIXNEGATIVEZERO
2292 if (len == 2 && t[0] == '-' && t[1] == '0') {
2297 (void)SvUPGRADE(sv, SVt_PV);
2299 s = SvGROW(sv, len + 1);
2308 Perl_sv_2pvbyte_nolen(pTHX_ register SV *sv)
2311 return sv_2pvbyte(sv, &n_a);
2315 Perl_sv_2pvbyte(pTHX_ register SV *sv, STRLEN *lp)
2317 return sv_2pv(sv,lp);
2321 Perl_sv_2pvutf8_nolen(pTHX_ register SV *sv)
2324 return sv_2pvutf8(sv, &n_a);
2328 Perl_sv_2pvutf8(pTHX_ register SV *sv, STRLEN *lp)
2330 sv_utf8_upgrade(sv);
2331 return sv_2pv(sv,lp);
2334 /* This function is only called on magical items */
2336 Perl_sv_2bool(pTHX_ register SV *sv)
2345 if (SvAMAGIC(sv) && (tmpsv=AMG_CALLun(sv,bool_)) &&
2346 (SvRV(tmpsv) != SvRV(sv)))
2347 return SvTRUE(tmpsv);
2348 return SvRV(sv) != 0;
2351 register XPV* Xpvtmp;
2352 if ((Xpvtmp = (XPV*)SvANY(sv)) &&
2353 (*Xpvtmp->xpv_pv > '0' ||
2354 Xpvtmp->xpv_cur > 1 ||
2355 (Xpvtmp->xpv_cur && *Xpvtmp->xpv_pv != '0')))
2362 return SvIVX(sv) != 0;
2365 return SvNVX(sv) != 0.0;
2373 =for apidoc sv_utf8_upgrade
2375 Convert the PV of an SV to its UTF8-encoded form.
2381 Perl_sv_utf8_upgrade(pTHX_ register SV *sv)
2386 if (!sv || !SvPOK(sv) || SvUTF8(sv))
2389 /* This function could be much more efficient if we had a FLAG in SVs
2390 * to signal if there are any hibit chars in the PV.
2392 for (s = t = SvPVX(sv), hibit = FALSE; t < SvEND(sv) && !hibit; t++)
2397 STRLEN len = SvCUR(sv) + 1; /* Plus the \0 */
2398 SvPVX(sv) = (char*)bytes_to_utf8((U8*)s, &len);
2399 SvCUR(sv) = len - 1;
2400 SvLEN(sv) = len; /* No longer know the real size. */
2402 Safefree(s); /* No longer using what was there before. */
2407 =for apidoc sv_utf8_downgrade
2409 Attempt to convert the PV of an SV from UTF8-encoded to byte encoding.
2410 This may not be possible if the PV contains non-byte encoding characters;
2411 if this is the case, either returns false or, if C<fail_ok> is not
2418 Perl_sv_utf8_downgrade(pTHX_ register SV* sv, bool fail_ok)
2420 if (SvPOK(sv) && SvUTF8(sv)) {
2422 char *c = SvPVX(sv);
2423 STRLEN len = SvCUR(sv);
2425 if (!utf8_to_bytes((U8*)c, &len)) {
2430 Perl_croak(aTHX_ "Wide character in %s",
2431 PL_op_desc[PL_op->op_type]);
2433 Perl_croak(aTHX_ "Wide character");
2445 =for apidoc sv_utf8_encode
2447 Convert the PV of an SV to UTF8-encoded, but then turn off the C<SvUTF8>
2448 flag so that it looks like bytes again. Nothing calls this.
2454 Perl_sv_utf8_encode(pTHX_ register SV *sv)
2456 sv_utf8_upgrade(sv);
2461 Perl_sv_utf8_decode(pTHX_ register SV *sv)
2465 bool has_utf = FALSE;
2466 if (!sv_utf8_downgrade(sv, TRUE))
2469 /* it is actually just a matter of turning the utf8 flag on, but
2470 * we want to make sure everything inside is valid utf8 first.
2473 if (!is_utf8_string((U8*)c, SvCUR(sv)+1))
2476 while (c < SvEND(sv)) {
2487 /* Note: sv_setsv() should not be called with a source string that needs
2488 * to be reused, since it may destroy the source string if it is marked
2493 =for apidoc sv_setsv
2495 Copies the contents of the source SV C<ssv> into the destination SV C<dsv>.
2496 The source SV may be destroyed if it is mortal. Does not handle 'set'
2497 magic. See the macro forms C<SvSetSV>, C<SvSetSV_nosteal> and
2504 Perl_sv_setsv(pTHX_ SV *dstr, register SV *sstr)
2506 register U32 sflags;
2512 SV_CHECK_THINKFIRST(dstr);
2514 sstr = &PL_sv_undef;
2515 stype = SvTYPE(sstr);
2516 dtype = SvTYPE(dstr);
2520 /* There's a lot of redundancy below but we're going for speed here */
2525 if (dtype != SVt_PVGV) {
2526 (void)SvOK_off(dstr);
2534 sv_upgrade(dstr, SVt_IV);
2537 sv_upgrade(dstr, SVt_PVNV);
2541 sv_upgrade(dstr, SVt_PVIV);
2544 (void)SvIOK_only(dstr);
2545 SvIVX(dstr) = SvIVX(sstr);
2548 if (SvTAINTED(sstr))
2559 sv_upgrade(dstr, SVt_NV);
2564 sv_upgrade(dstr, SVt_PVNV);
2567 SvNVX(dstr) = SvNVX(sstr);
2568 (void)SvNOK_only(dstr);
2569 if (SvTAINTED(sstr))
2577 sv_upgrade(dstr, SVt_RV);
2578 else if (dtype == SVt_PVGV &&
2579 SvTYPE(SvRV(sstr)) == SVt_PVGV) {
2582 if (GvIMPORTED(dstr) != GVf_IMPORTED
2583 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
2585 GvIMPORTED_on(dstr);
2596 sv_upgrade(dstr, SVt_PV);
2599 if (dtype < SVt_PVIV)
2600 sv_upgrade(dstr, SVt_PVIV);
2603 if (dtype < SVt_PVNV)
2604 sv_upgrade(dstr, SVt_PVNV);
2611 Perl_croak(aTHX_ "Bizarre copy of %s in %s", sv_reftype(sstr, 0),
2612 PL_op_name[PL_op->op_type]);
2614 Perl_croak(aTHX_ "Bizarre copy of %s", sv_reftype(sstr, 0));
2618 if (dtype <= SVt_PVGV) {
2620 if (dtype != SVt_PVGV) {
2621 char *name = GvNAME(sstr);
2622 STRLEN len = GvNAMELEN(sstr);
2623 sv_upgrade(dstr, SVt_PVGV);
2624 sv_magic(dstr, dstr, '*', Nullch, 0);
2625 GvSTASH(dstr) = (HV*)SvREFCNT_inc(GvSTASH(sstr));
2626 GvNAME(dstr) = savepvn(name, len);
2627 GvNAMELEN(dstr) = len;
2628 SvFAKE_on(dstr); /* can coerce to non-glob */
2630 /* ahem, death to those who redefine active sort subs */
2631 else if (PL_curstackinfo->si_type == PERLSI_SORT
2632 && GvCV(dstr) && PL_sortcop == CvSTART(GvCV(dstr)))
2633 Perl_croak(aTHX_ "Can't redefine active sort subroutine %s",
2635 (void)SvOK_off(dstr);
2636 GvINTRO_off(dstr); /* one-shot flag */
2638 GvGP(dstr) = gp_ref(GvGP(sstr));
2639 if (SvTAINTED(sstr))
2641 if (GvIMPORTED(dstr) != GVf_IMPORTED
2642 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
2644 GvIMPORTED_on(dstr);
2652 if (SvGMAGICAL(sstr)) {
2654 if (SvTYPE(sstr) != stype) {
2655 stype = SvTYPE(sstr);
2656 if (stype == SVt_PVGV && dtype <= SVt_PVGV)
2660 if (stype == SVt_PVLV)
2661 (void)SvUPGRADE(dstr, SVt_PVNV);
2663 (void)SvUPGRADE(dstr, stype);
2666 sflags = SvFLAGS(sstr);
2668 if (sflags & SVf_ROK) {
2669 if (dtype >= SVt_PV) {
2670 if (dtype == SVt_PVGV) {
2671 SV *sref = SvREFCNT_inc(SvRV(sstr));
2673 int intro = GvINTRO(dstr);
2678 GvINTRO_off(dstr); /* one-shot flag */
2679 Newz(602,gp, 1, GP);
2680 GvGP(dstr) = gp_ref(gp);
2681 GvSV(dstr) = NEWSV(72,0);
2682 GvLINE(dstr) = CopLINE(PL_curcop);
2683 GvEGV(dstr) = (GV*)dstr;
2686 switch (SvTYPE(sref)) {
2689 SAVESPTR(GvAV(dstr));
2691 dref = (SV*)GvAV(dstr);
2692 GvAV(dstr) = (AV*)sref;
2693 if (!GvIMPORTED_AV(dstr)
2694 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
2696 GvIMPORTED_AV_on(dstr);
2701 SAVESPTR(GvHV(dstr));
2703 dref = (SV*)GvHV(dstr);
2704 GvHV(dstr) = (HV*)sref;
2705 if (!GvIMPORTED_HV(dstr)
2706 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
2708 GvIMPORTED_HV_on(dstr);
2713 if (GvCVGEN(dstr) && GvCV(dstr) != (CV*)sref) {
2714 SvREFCNT_dec(GvCV(dstr));
2715 GvCV(dstr) = Nullcv;
2716 GvCVGEN(dstr) = 0; /* Switch off cacheness. */
2717 PL_sub_generation++;
2719 SAVESPTR(GvCV(dstr));
2722 dref = (SV*)GvCV(dstr);
2723 if (GvCV(dstr) != (CV*)sref) {
2724 CV* cv = GvCV(dstr);
2726 if (!GvCVGEN((GV*)dstr) &&
2727 (CvROOT(cv) || CvXSUB(cv)))
2730 /* ahem, death to those who redefine
2731 * active sort subs */
2732 if (PL_curstackinfo->si_type == PERLSI_SORT &&
2733 PL_sortcop == CvSTART(cv))
2735 "Can't redefine active sort subroutine %s",
2736 GvENAME((GV*)dstr));
2737 /* Redefining a sub - warning is mandatory if
2738 it was a const and its value changed. */
2739 if (ckWARN(WARN_REDEFINE)
2741 && (!CvCONST((CV*)sref)
2742 || sv_cmp(cv_const_sv(cv),
2743 cv_const_sv((CV*)sref)))))
2745 Perl_warner(aTHX_ WARN_REDEFINE,
2747 ? "Constant subroutine %s redefined"
2748 : "Subroutine %s redefined",
2749 GvENAME((GV*)dstr));
2752 cv_ckproto(cv, (GV*)dstr,
2753 SvPOK(sref) ? SvPVX(sref) : Nullch);
2755 GvCV(dstr) = (CV*)sref;
2756 GvCVGEN(dstr) = 0; /* Switch off cacheness. */
2757 GvASSUMECV_on(dstr);
2758 PL_sub_generation++;
2760 if (!GvIMPORTED_CV(dstr)
2761 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
2763 GvIMPORTED_CV_on(dstr);
2768 SAVESPTR(GvIOp(dstr));
2770 dref = (SV*)GvIOp(dstr);
2771 GvIOp(dstr) = (IO*)sref;
2775 SAVESPTR(GvFORM(dstr));
2777 dref = (SV*)GvFORM(dstr);
2778 GvFORM(dstr) = (CV*)sref;
2782 SAVESPTR(GvSV(dstr));
2784 dref = (SV*)GvSV(dstr);
2786 if (!GvIMPORTED_SV(dstr)
2787 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
2789 GvIMPORTED_SV_on(dstr);
2797 if (SvTAINTED(sstr))
2802 (void)SvOOK_off(dstr); /* backoff */
2804 Safefree(SvPVX(dstr));
2805 SvLEN(dstr)=SvCUR(dstr)=0;
2808 (void)SvOK_off(dstr);
2809 SvRV(dstr) = SvREFCNT_inc(SvRV(sstr));
2811 if (sflags & SVp_NOK) {
2813 SvNVX(dstr) = SvNVX(sstr);
2815 if (sflags & SVp_IOK) {
2816 (void)SvIOK_on(dstr);
2817 SvIVX(dstr) = SvIVX(sstr);
2818 if (sflags & SVf_IVisUV)
2821 if (SvAMAGIC(sstr)) {
2825 else if (sflags & SVp_POK) {
2828 * Check to see if we can just swipe the string. If so, it's a
2829 * possible small lose on short strings, but a big win on long ones.
2830 * It might even be a win on short strings if SvPVX(dstr)
2831 * has to be allocated and SvPVX(sstr) has to be freed.
2834 if (SvTEMP(sstr) && /* slated for free anyway? */
2835 SvREFCNT(sstr) == 1 && /* and no other references to it? */
2836 !(sflags & SVf_OOK) && /* and not involved in OOK hack? */
2837 SvLEN(sstr) && /* and really is a string */
2838 !(PL_op && PL_op->op_type == OP_AASSIGN)) /* and won't be needed again, potentially */
2840 if (SvPVX(dstr)) { /* we know that dtype >= SVt_PV */
2842 SvFLAGS(dstr) &= ~SVf_OOK;
2843 Safefree(SvPVX(dstr) - SvIVX(dstr));
2845 else if (SvLEN(dstr))
2846 Safefree(SvPVX(dstr));
2848 (void)SvPOK_only(dstr);
2849 SvPV_set(dstr, SvPVX(sstr));
2850 SvLEN_set(dstr, SvLEN(sstr));
2851 SvCUR_set(dstr, SvCUR(sstr));
2854 (void)SvOK_off(sstr); /* NOTE: nukes most SvFLAGS on sstr */
2855 SvPV_set(sstr, Nullch);
2860 else { /* have to copy actual string */
2861 STRLEN len = SvCUR(sstr);
2863 SvGROW(dstr, len + 1); /* inlined from sv_setpvn */
2864 Move(SvPVX(sstr),SvPVX(dstr),len,char);
2865 SvCUR_set(dstr, len);
2866 *SvEND(dstr) = '\0';
2867 (void)SvPOK_only(dstr);
2869 if ((sflags & SVf_UTF8) && !IN_BYTE)
2872 if (sflags & SVp_NOK) {
2874 SvNVX(dstr) = SvNVX(sstr);
2876 if (sflags & SVp_IOK) {
2877 (void)SvIOK_on(dstr);
2878 SvIVX(dstr) = SvIVX(sstr);
2879 if (sflags & SVf_IVisUV)
2883 else if (sflags & SVp_NOK) {
2884 SvNVX(dstr) = SvNVX(sstr);
2885 (void)SvNOK_only(dstr);
2886 if (sflags & SVf_IOK) {
2887 (void)SvIOK_on(dstr);
2888 SvIVX(dstr) = SvIVX(sstr);
2889 /* XXXX Do we want to set IsUV for IV(ROK)? Be extra safe... */
2890 if (sflags & SVf_IVisUV)
2894 else if (sflags & SVp_IOK) {
2895 (void)SvIOK_only(dstr);
2896 SvIVX(dstr) = SvIVX(sstr);
2897 if (sflags & SVf_IVisUV)
2901 if (dtype == SVt_PVGV) {
2902 if (ckWARN(WARN_MISC))
2903 Perl_warner(aTHX_ WARN_MISC, "Undefined value assigned to typeglob");
2906 (void)SvOK_off(dstr);
2908 if (SvTAINTED(sstr))
2913 =for apidoc sv_setsv_mg
2915 Like C<sv_setsv>, but also handles 'set' magic.
2921 Perl_sv_setsv_mg(pTHX_ SV *dstr, register SV *sstr)
2923 sv_setsv(dstr,sstr);
2928 =for apidoc sv_setpvn
2930 Copies a string into an SV. The C<len> parameter indicates the number of
2931 bytes to be copied. Does not handle 'set' magic. See C<sv_setpvn_mg>.
2937 Perl_sv_setpvn(pTHX_ register SV *sv, register const char *ptr, register STRLEN len)
2939 register char *dptr;
2941 /* len is STRLEN which is unsigned, need to copy to signed */
2945 SV_CHECK_THINKFIRST(sv);
2950 (void)SvUPGRADE(sv, SVt_PV);
2952 SvGROW(sv, len + 1);
2954 Move(ptr,dptr,len,char);
2957 (void)SvPOK_only(sv); /* validate pointer */
2962 =for apidoc sv_setpvn_mg
2964 Like C<sv_setpvn>, but also handles 'set' magic.
2970 Perl_sv_setpvn_mg(pTHX_ register SV *sv, register const char *ptr, register STRLEN len)
2972 sv_setpvn(sv,ptr,len);
2977 =for apidoc sv_setpv
2979 Copies a string into an SV. The string must be null-terminated. Does not
2980 handle 'set' magic. See C<sv_setpv_mg>.
2986 Perl_sv_setpv(pTHX_ register SV *sv, register const char *ptr)
2988 register STRLEN len;
2990 SV_CHECK_THINKFIRST(sv);
2996 (void)SvUPGRADE(sv, SVt_PV);
2998 SvGROW(sv, len + 1);
2999 Move(ptr,SvPVX(sv),len+1,char);
3001 (void)SvPOK_only(sv); /* validate pointer */
3006 =for apidoc sv_setpv_mg
3008 Like C<sv_setpv>, but also handles 'set' magic.
3014 Perl_sv_setpv_mg(pTHX_ register SV *sv, register const char *ptr)
3021 =for apidoc sv_usepvn
3023 Tells an SV to use C<ptr> to find its string value. Normally the string is
3024 stored inside the SV but sv_usepvn allows the SV to use an outside string.
3025 The C<ptr> should point to memory that was allocated by C<malloc>. The
3026 string length, C<len>, must be supplied. This function will realloc the
3027 memory pointed to by C<ptr>, so that pointer should not be freed or used by
3028 the programmer after giving it to sv_usepvn. Does not handle 'set' magic.
3029 See C<sv_usepvn_mg>.
3035 Perl_sv_usepvn(pTHX_ register SV *sv, register char *ptr, register STRLEN len)
3037 SV_CHECK_THINKFIRST(sv);
3038 (void)SvUPGRADE(sv, SVt_PV);
3043 (void)SvOOK_off(sv);
3044 if (SvPVX(sv) && SvLEN(sv))
3045 Safefree(SvPVX(sv));
3046 Renew(ptr, len+1, char);
3049 SvLEN_set(sv, len+1);
3051 (void)SvPOK_only(sv); /* validate pointer */
3056 =for apidoc sv_usepvn_mg
3058 Like C<sv_usepvn>, but also handles 'set' magic.
3064 Perl_sv_usepvn_mg(pTHX_ register SV *sv, register char *ptr, register STRLEN len)
3066 sv_usepvn(sv,ptr,len);
3071 Perl_sv_force_normal_flags(pTHX_ register SV *sv, U32 flags)
3073 if (SvREADONLY(sv)) {
3075 char *pvx = SvPVX(sv);
3076 STRLEN len = SvCUR(sv);
3077 U32 hash = SvUVX(sv);
3078 SvGROW(sv, len + 1);
3079 Move(pvx,SvPVX(sv),len,char);
3083 unsharepvn(pvx,len,hash);
3085 else if (PL_curcop != &PL_compiling)
3086 Perl_croak(aTHX_ PL_no_modify);
3089 sv_unref_flags(sv, flags);
3090 else if (SvFAKE(sv) && SvTYPE(sv) == SVt_PVGV)
3095 Perl_sv_force_normal(pTHX_ register SV *sv)
3097 sv_force_normal_flags(sv, 0);
3103 Efficient removal of characters from the beginning of the string buffer.
3104 SvPOK(sv) must be true and the C<ptr> must be a pointer to somewhere inside
3105 the string buffer. The C<ptr> becomes the first character of the adjusted
3112 Perl_sv_chop(pTHX_ register SV *sv, register char *ptr) /* like set but assuming ptr is in sv */
3116 register STRLEN delta;
3118 if (!ptr || !SvPOKp(sv))
3120 SV_CHECK_THINKFIRST(sv);
3121 if (SvTYPE(sv) < SVt_PVIV)
3122 sv_upgrade(sv,SVt_PVIV);
3125 if (!SvLEN(sv)) { /* make copy of shared string */
3126 char *pvx = SvPVX(sv);
3127 STRLEN len = SvCUR(sv);
3128 SvGROW(sv, len + 1);
3129 Move(pvx,SvPVX(sv),len,char);
3133 SvFLAGS(sv) |= SVf_OOK;
3135 SvFLAGS(sv) &= ~(SVf_IOK|SVf_NOK|SVp_IOK|SVp_NOK|SVf_IVisUV);
3136 delta = ptr - SvPVX(sv);
3144 =for apidoc sv_catpvn
3146 Concatenates the string onto the end of the string which is in the SV. The
3147 C<len> indicates number of bytes to copy. Handles 'get' magic, but not
3148 'set' magic. See C<sv_catpvn_mg>.
3154 Perl_sv_catpvn(pTHX_ register SV *sv, register const char *ptr, register STRLEN len)
3159 junk = SvPV_force(sv, tlen);
3160 SvGROW(sv, tlen + len + 1);
3163 Move(ptr,SvPVX(sv)+tlen,len,char);
3166 (void)SvPOK_only_UTF8(sv); /* validate pointer */
3171 =for apidoc sv_catpvn_mg
3173 Like C<sv_catpvn>, but also handles 'set' magic.
3179 Perl_sv_catpvn_mg(pTHX_ register SV *sv, register const char *ptr, register STRLEN len)
3181 sv_catpvn(sv,ptr,len);
3186 =for apidoc sv_catsv
3188 Concatenates the string from SV C<ssv> onto the end of the string in SV
3189 C<dsv>. Handles 'get' magic, but not 'set' magic. See C<sv_catsv_mg>.
3195 Perl_sv_catsv(pTHX_ SV *dstr, register SV *sstr)
3201 if ((s = SvPV(sstr, len))) {
3202 if (DO_UTF8(sstr)) {
3203 sv_utf8_upgrade(dstr);
3204 sv_catpvn(dstr,s,len);
3208 sv_catpvn(dstr,s,len);
3213 =for apidoc sv_catsv_mg
3215 Like C<sv_catsv>, but also handles 'set' magic.
3221 Perl_sv_catsv_mg(pTHX_ SV *dstr, register SV *sstr)
3223 sv_catsv(dstr,sstr);
3228 =for apidoc sv_catpv
3230 Concatenates the string onto the end of the string which is in the SV.
3231 Handles 'get' magic, but not 'set' magic. See C<sv_catpv_mg>.
3237 Perl_sv_catpv(pTHX_ register SV *sv, register const char *ptr)
3239 register STRLEN len;
3245 junk = SvPV_force(sv, tlen);
3247 SvGROW(sv, tlen + len + 1);
3250 Move(ptr,SvPVX(sv)+tlen,len+1,char);
3252 (void)SvPOK_only_UTF8(sv); /* validate pointer */
3257 =for apidoc sv_catpv_mg
3259 Like C<sv_catpv>, but also handles 'set' magic.
3265 Perl_sv_catpv_mg(pTHX_ register SV *sv, register const char *ptr)
3272 Perl_newSV(pTHX_ STRLEN len)
3278 sv_upgrade(sv, SVt_PV);
3279 SvGROW(sv, len + 1);
3284 /* name is assumed to contain an SV* if (name && namelen == HEf_SVKEY) */
3287 =for apidoc sv_magic
3289 Adds magic to an SV.
3295 Perl_sv_magic(pTHX_ register SV *sv, SV *obj, int how, const char *name, I32 namlen)
3299 if (SvREADONLY(sv)) {
3300 if (PL_curcop != &PL_compiling && !strchr("gBf", how))
3301 Perl_croak(aTHX_ PL_no_modify);
3303 if (SvMAGICAL(sv) || (how == 't' && SvTYPE(sv) >= SVt_PVMG)) {
3304 if (SvMAGIC(sv) && (mg = mg_find(sv, how))) {
3311 (void)SvUPGRADE(sv, SVt_PVMG);
3313 Newz(702,mg, 1, MAGIC);
3314 mg->mg_moremagic = SvMAGIC(sv);
3317 if (!obj || obj == sv || how == '#' || how == 'r')
3320 mg->mg_obj = SvREFCNT_inc(obj);
3321 mg->mg_flags |= MGf_REFCOUNTED;
3324 mg->mg_len = namlen;
3327 mg->mg_ptr = savepvn(name, namlen);
3328 else if (namlen == HEf_SVKEY)
3329 mg->mg_ptr = (char*)SvREFCNT_inc((SV*)name);
3333 mg->mg_virtual = &PL_vtbl_sv;
3336 mg->mg_virtual = &PL_vtbl_amagic;
3339 mg->mg_virtual = &PL_vtbl_amagicelem;
3345 mg->mg_virtual = &PL_vtbl_bm;
3348 mg->mg_virtual = &PL_vtbl_regdata;
3351 mg->mg_virtual = &PL_vtbl_regdatum;
3354 mg->mg_virtual = &PL_vtbl_env;
3357 mg->mg_virtual = &PL_vtbl_fm;
3360 mg->mg_virtual = &PL_vtbl_envelem;
3363 mg->mg_virtual = &PL_vtbl_mglob;
3366 mg->mg_virtual = &PL_vtbl_isa;
3369 mg->mg_virtual = &PL_vtbl_isaelem;
3372 mg->mg_virtual = &PL_vtbl_nkeys;
3379 mg->mg_virtual = &PL_vtbl_dbline;
3383 mg->mg_virtual = &PL_vtbl_mutex;
3385 #endif /* USE_THREADS */
3386 #ifdef USE_LOCALE_COLLATE
3388 mg->mg_virtual = &PL_vtbl_collxfrm;
3390 #endif /* USE_LOCALE_COLLATE */
3392 mg->mg_virtual = &PL_vtbl_pack;
3396 mg->mg_virtual = &PL_vtbl_packelem;
3399 mg->mg_virtual = &PL_vtbl_regexp;
3402 mg->mg_virtual = &PL_vtbl_sig;
3405 mg->mg_virtual = &PL_vtbl_sigelem;
3408 mg->mg_virtual = &PL_vtbl_taint;
3412 mg->mg_virtual = &PL_vtbl_uvar;
3415 mg->mg_virtual = &PL_vtbl_vec;
3418 mg->mg_virtual = &PL_vtbl_substr;
3421 mg->mg_virtual = &PL_vtbl_defelem;
3424 mg->mg_virtual = &PL_vtbl_glob;
3427 mg->mg_virtual = &PL_vtbl_arylen;
3430 mg->mg_virtual = &PL_vtbl_pos;
3433 mg->mg_virtual = &PL_vtbl_backref;
3435 case '~': /* Reserved for use by extensions not perl internals. */
3436 /* Useful for attaching extension internal data to perl vars. */
3437 /* Note that multiple extensions may clash if magical scalars */
3438 /* etc holding private data from one are passed to another. */
3442 Perl_croak(aTHX_ "Don't know how to handle magic of type '%c'", how);
3446 SvFLAGS(sv) &= ~(SVf_IOK|SVf_NOK|SVf_POK);
3450 =for apidoc sv_unmagic
3452 Removes magic from an SV.
3458 Perl_sv_unmagic(pTHX_ SV *sv, int type)
3462 if (SvTYPE(sv) < SVt_PVMG || !SvMAGIC(sv))
3465 for (mg = *mgp; mg; mg = *mgp) {
3466 if (mg->mg_type == type) {
3467 MGVTBL* vtbl = mg->mg_virtual;
3468 *mgp = mg->mg_moremagic;
3469 if (vtbl && vtbl->svt_free)
3470 CALL_FPTR(vtbl->svt_free)(aTHX_ sv, mg);
3471 if (mg->mg_ptr && mg->mg_type != 'g')
3472 if (mg->mg_len >= 0)
3473 Safefree(mg->mg_ptr);
3474 else if (mg->mg_len == HEf_SVKEY)
3475 SvREFCNT_dec((SV*)mg->mg_ptr);
3476 if (mg->mg_flags & MGf_REFCOUNTED)
3477 SvREFCNT_dec(mg->mg_obj);
3481 mgp = &mg->mg_moremagic;
3485 SvFLAGS(sv) |= (SvFLAGS(sv) & (SVp_IOK|SVp_NOK|SVp_POK)) >> PRIVSHIFT;
3492 =for apidoc sv_rvweaken
3500 Perl_sv_rvweaken(pTHX_ SV *sv)
3503 if (!SvOK(sv)) /* let undefs pass */
3506 Perl_croak(aTHX_ "Can't weaken a nonreference");
3507 else if (SvWEAKREF(sv)) {
3508 if (ckWARN(WARN_MISC))
3509 Perl_warner(aTHX_ WARN_MISC, "Reference is already weak");
3513 sv_add_backref(tsv, sv);
3520 S_sv_add_backref(pTHX_ SV *tsv, SV *sv)
3524 if (SvMAGICAL(tsv) && (mg = mg_find(tsv, '<')))
3525 av = (AV*)mg->mg_obj;
3528 sv_magic(tsv, (SV*)av, '<', NULL, 0);
3529 SvREFCNT_dec(av); /* for sv_magic */
3535 S_sv_del_backref(pTHX_ SV *sv)
3542 if (!SvMAGICAL(tsv) || !(mg = mg_find(tsv, '<')))
3543 Perl_croak(aTHX_ "panic: del_backref");
3544 av = (AV *)mg->mg_obj;
3549 svp[i] = &PL_sv_undef; /* XXX */
3556 =for apidoc sv_insert
3558 Inserts a string at the specified offset/length within the SV. Similar to
3559 the Perl substr() function.
3565 Perl_sv_insert(pTHX_ SV *bigstr, STRLEN offset, STRLEN len, char *little, STRLEN littlelen)
3569 register char *midend;
3570 register char *bigend;
3576 Perl_croak(aTHX_ "Can't modify non-existent substring");
3577 SvPV_force(bigstr, curlen);
3578 (void)SvPOK_only_UTF8(bigstr);
3579 if (offset + len > curlen) {
3580 SvGROW(bigstr, offset+len+1);
3581 Zero(SvPVX(bigstr)+curlen, offset+len-curlen, char);
3582 SvCUR_set(bigstr, offset+len);
3586 i = littlelen - len;
3587 if (i > 0) { /* string might grow */
3588 big = SvGROW(bigstr, SvCUR(bigstr) + i + 1);
3589 mid = big + offset + len;
3590 midend = bigend = big + SvCUR(bigstr);
3593 while (midend > mid) /* shove everything down */
3594 *--bigend = *--midend;
3595 Move(little,big+offset,littlelen,char);
3601 Move(little,SvPVX(bigstr)+offset,len,char);
3606 big = SvPVX(bigstr);
3609 bigend = big + SvCUR(bigstr);
3611 if (midend > bigend)
3612 Perl_croak(aTHX_ "panic: sv_insert");
3614 if (mid - big > bigend - midend) { /* faster to shorten from end */
3616 Move(little, mid, littlelen,char);
3619 i = bigend - midend;
3621 Move(midend, mid, i,char);
3625 SvCUR_set(bigstr, mid - big);
3628 else if ((i = mid - big)) { /* faster from front */
3629 midend -= littlelen;
3631 sv_chop(bigstr,midend-i);
3636 Move(little, mid, littlelen,char);
3638 else if (littlelen) {
3639 midend -= littlelen;
3640 sv_chop(bigstr,midend);
3641 Move(little,midend,littlelen,char);
3644 sv_chop(bigstr,midend);
3650 =for apidoc sv_replace
3652 Make the first argument a copy of the second, then delete the original.
3658 Perl_sv_replace(pTHX_ register SV *sv, register SV *nsv)
3660 U32 refcnt = SvREFCNT(sv);
3661 SV_CHECK_THINKFIRST(sv);
3662 if (SvREFCNT(nsv) != 1 && ckWARN_d(WARN_INTERNAL))
3663 Perl_warner(aTHX_ WARN_INTERNAL, "Reference miscount in sv_replace()");
3664 if (SvMAGICAL(sv)) {
3668 sv_upgrade(nsv, SVt_PVMG);
3669 SvMAGIC(nsv) = SvMAGIC(sv);
3670 SvFLAGS(nsv) |= SvMAGICAL(sv);
3676 assert(!SvREFCNT(sv));
3677 StructCopy(nsv,sv,SV);
3678 SvREFCNT(sv) = refcnt;
3679 SvFLAGS(nsv) |= SVTYPEMASK; /* Mark as freed */
3684 =for apidoc sv_clear
3686 Clear an SV, making it empty. Does not free the memory used by the SV
3693 Perl_sv_clear(pTHX_ register SV *sv)
3697 assert(SvREFCNT(sv) == 0);
3700 if (PL_defstash) { /* Still have a symbol table? */
3705 Zero(&tmpref, 1, SV);
3706 sv_upgrade(&tmpref, SVt_RV);
3708 SvREADONLY_on(&tmpref); /* DESTROY() could be naughty */
3709 SvREFCNT(&tmpref) = 1;
3712 stash = SvSTASH(sv);
3713 destructor = gv_fetchmethod(SvSTASH(sv), "DESTROY");
3716 PUSHSTACKi(PERLSI_DESTROY);
3717 SvRV(&tmpref) = SvREFCNT_inc(sv);
3722 call_sv((SV*)GvCV(destructor),
3723 G_DISCARD|G_EVAL|G_KEEPERR);
3729 } while (SvOBJECT(sv) && SvSTASH(sv) != stash);
3731 del_XRV(SvANY(&tmpref));
3734 if (PL_in_clean_objs)
3735 Perl_croak(aTHX_ "DESTROY created new reference to dead object '%s'",
3737 /* DESTROY gave object new lease on life */
3743 SvREFCNT_dec(SvSTASH(sv)); /* possibly of changed persuasion */
3744 SvOBJECT_off(sv); /* Curse the object. */
3745 if (SvTYPE(sv) != SVt_PVIO)
3746 --PL_sv_objcount; /* XXX Might want something more general */
3749 if (SvTYPE(sv) >= SVt_PVMG && SvMAGIC(sv))
3752 switch (SvTYPE(sv)) {
3755 IoIFP(sv) != PerlIO_stdin() &&
3756 IoIFP(sv) != PerlIO_stdout() &&
3757 IoIFP(sv) != PerlIO_stderr())
3759 io_close((IO*)sv, FALSE);
3761 if (IoDIRP(sv) && !(IoFLAGS(sv) & IOf_FAKE_DIRP))
3762 PerlDir_close(IoDIRP(sv));
3763 IoDIRP(sv) = (DIR*)NULL;
3764 Safefree(IoTOP_NAME(sv));
3765 Safefree(IoFMT_NAME(sv));
3766 Safefree(IoBOTTOM_NAME(sv));
3781 SvREFCNT_dec(LvTARG(sv));
3785 Safefree(GvNAME(sv));
3786 /* cannot decrease stash refcount yet, as we might recursively delete
3787 ourselves when the refcnt drops to zero. Delay SvREFCNT_dec
3788 of stash until current sv is completely gone.
3789 -- JohnPC, 27 Mar 1998 */
3790 stash = GvSTASH(sv);
3796 (void)SvOOK_off(sv);
3804 SvREFCNT_dec(SvRV(sv));
3806 else if (SvPVX(sv) && SvLEN(sv))
3807 Safefree(SvPVX(sv));
3808 else if (SvPVX(sv) && SvREADONLY(sv) && SvFAKE(sv)) {
3809 unsharepvn(SvPVX(sv),SvCUR(sv),SvUVX(sv));
3821 switch (SvTYPE(sv)) {
3837 del_XPVIV(SvANY(sv));
3840 del_XPVNV(SvANY(sv));
3843 del_XPVMG(SvANY(sv));
3846 del_XPVLV(SvANY(sv));
3849 del_XPVAV(SvANY(sv));
3852 del_XPVHV(SvANY(sv));
3855 del_XPVCV(SvANY(sv));
3858 del_XPVGV(SvANY(sv));
3859 /* code duplication for increased performance. */
3860 SvFLAGS(sv) &= SVf_BREAK;
3861 SvFLAGS(sv) |= SVTYPEMASK;
3862 /* decrease refcount of the stash that owns this GV, if any */
3864 SvREFCNT_dec(stash);
3865 return; /* not break, SvFLAGS reset already happened */
3867 del_XPVBM(SvANY(sv));
3870 del_XPVFM(SvANY(sv));
3873 del_XPVIO(SvANY(sv));
3876 SvFLAGS(sv) &= SVf_BREAK;
3877 SvFLAGS(sv) |= SVTYPEMASK;
3881 Perl_sv_newref(pTHX_ SV *sv)
3884 ATOMIC_INC(SvREFCNT(sv));
3891 Free the memory used by an SV.
3897 Perl_sv_free(pTHX_ SV *sv)
3899 int refcount_is_zero;
3903 if (SvREFCNT(sv) == 0) {
3904 if (SvFLAGS(sv) & SVf_BREAK)
3906 if (PL_in_clean_all) /* All is fair */
3908 if (SvREADONLY(sv) && SvIMMORTAL(sv)) {
3909 /* make sure SvREFCNT(sv)==0 happens very seldom */
3910 SvREFCNT(sv) = (~(U32)0)/2;
3913 if (ckWARN_d(WARN_INTERNAL))
3914 Perl_warner(aTHX_ WARN_INTERNAL, "Attempt to free unreferenced scalar");
3917 ATOMIC_DEC_AND_TEST(refcount_is_zero, SvREFCNT(sv));
3918 if (!refcount_is_zero)
3922 if (ckWARN_d(WARN_DEBUGGING))
3923 Perl_warner(aTHX_ WARN_DEBUGGING,
3924 "Attempt to free temp prematurely: SV 0x%"UVxf,
3929 if (SvREADONLY(sv) && SvIMMORTAL(sv)) {
3930 /* make sure SvREFCNT(sv)==0 happens very seldom */
3931 SvREFCNT(sv) = (~(U32)0)/2;
3942 Returns the length of the string in the SV. See also C<SvCUR>.
3948 Perl_sv_len(pTHX_ register SV *sv)
3957 len = mg_length(sv);
3959 junk = SvPV(sv, len);
3964 =for apidoc sv_len_utf8
3966 Returns the number of characters in the string in an SV, counting wide
3967 UTF8 bytes as a single character.
3973 Perl_sv_len_utf8(pTHX_ register SV *sv)
3980 return mg_length(sv);
3985 U8 *s = (U8*)SvPV(sv, len);
3987 return Perl_utf8_length(aTHX_ s, s + len);
3992 Perl_sv_pos_u2b(pTHX_ register SV *sv, I32* offsetp, I32* lenp)
3997 I32 uoffset = *offsetp;
4003 start = s = (U8*)SvPV(sv, len);
4005 while (s < send && uoffset--)
4009 *offsetp = s - start;
4013 while (s < send && ulen--)
4023 Perl_sv_pos_b2u(pTHX_ register SV *sv, I32* offsetp)
4032 s = (U8*)SvPV(sv, len);
4034 Perl_croak(aTHX_ "panic: bad byte offset");
4035 send = s + *offsetp;
4042 if (ckWARN_d(WARN_UTF8))
4043 Perl_warner(aTHX_ WARN_UTF8, "Malformed UTF-8 character");
4053 Returns a boolean indicating whether the strings in the two SVs are
4060 Perl_sv_eq(pTHX_ register SV *sv1, register SV *sv2)
4067 bool pv1tmp = FALSE;
4068 bool pv2tmp = FALSE;
4075 pv1 = SvPV(sv1, cur1);
4082 pv2 = SvPV(sv2, cur2);
4084 /* do not utf8ize the comparands as a side-effect */
4085 if (cur1 && cur2 && SvUTF8(sv1) != SvUTF8(sv2) && !IN_BYTE) {
4087 pv2 = (char*)bytes_to_utf8((U8*)pv2, &cur2);
4091 pv1 = (char*)bytes_to_utf8((U8*)pv1, &cur1);
4097 eq = memEQ(pv1, pv2, cur1);
4110 Compares the strings in two SVs. Returns -1, 0, or 1 indicating whether the
4111 string in C<sv1> is less than, equal to, or greater than the string in
4118 Perl_sv_cmp(pTHX_ register SV *sv1, register SV *sv2)
4123 bool pv1tmp = FALSE;
4124 bool pv2tmp = FALSE;
4131 pv1 = SvPV(sv1, cur1);
4138 pv2 = SvPV(sv2, cur2);
4140 /* do not utf8ize the comparands as a side-effect */
4141 if (cur1 && cur2 && SvUTF8(sv1) != SvUTF8(sv2) && !IN_BYTE) {
4143 pv2 = (char*)bytes_to_utf8((U8*)pv2, &cur2);
4147 pv1 = (char*)bytes_to_utf8((U8*)pv1, &cur1);
4153 cmp = cur2 ? -1 : 0;
4157 I32 retval = memcmp((void*)pv1, (void*)pv2, cur1 < cur2 ? cur1 : cur2);
4160 cmp = retval < 0 ? -1 : 1;
4161 } else if (cur1 == cur2) {
4164 cmp = cur1 < cur2 ? -1 : 1;
4177 =for apidoc sv_cmp_locale
4179 Compares the strings in two SVs in a locale-aware manner. See
4186 Perl_sv_cmp_locale(pTHX_ register SV *sv1, register SV *sv2)
4188 #ifdef USE_LOCALE_COLLATE
4194 if (PL_collation_standard)
4198 pv1 = sv1 ? sv_collxfrm(sv1, &len1) : (char *) NULL;
4200 pv2 = sv2 ? sv_collxfrm(sv2, &len2) : (char *) NULL;
4202 if (!pv1 || !len1) {
4213 retval = memcmp((void*)pv1, (void*)pv2, len1 < len2 ? len1 : len2);
4216 return retval < 0 ? -1 : 1;
4219 * When the result of collation is equality, that doesn't mean
4220 * that there are no differences -- some locales exclude some
4221 * characters from consideration. So to avoid false equalities,
4222 * we use the raw string as a tiebreaker.
4228 #endif /* USE_LOCALE_COLLATE */
4230 return sv_cmp(sv1, sv2);
4233 #ifdef USE_LOCALE_COLLATE
4235 * Any scalar variable may carry an 'o' magic that contains the
4236 * scalar data of the variable transformed to such a format that
4237 * a normal memory comparison can be used to compare the data
4238 * according to the locale settings.
4241 Perl_sv_collxfrm(pTHX_ SV *sv, STRLEN *nxp)
4245 mg = SvMAGICAL(sv) ? mg_find(sv, 'o') : (MAGIC *) NULL;
4246 if (!mg || !mg->mg_ptr || *(U32*)mg->mg_ptr != PL_collation_ix) {
4251 Safefree(mg->mg_ptr);
4253 if ((xf = mem_collxfrm(s, len, &xlen))) {
4254 if (SvREADONLY(sv)) {
4257 return xf + sizeof(PL_collation_ix);
4260 sv_magic(sv, 0, 'o', 0, 0);
4261 mg = mg_find(sv, 'o');
4274 if (mg && mg->mg_ptr) {
4276 return mg->mg_ptr + sizeof(PL_collation_ix);
4284 #endif /* USE_LOCALE_COLLATE */
4289 Get a line from the filehandle and store it into the SV, optionally
4290 appending to the currently-stored string.
4296 Perl_sv_gets(pTHX_ register SV *sv, register PerlIO *fp, I32 append)
4300 register STDCHAR rslast;
4301 register STDCHAR *bp;
4305 SV_CHECK_THINKFIRST(sv);
4306 (void)SvUPGRADE(sv, SVt_PV);
4310 if (RsSNARF(PL_rs)) {
4314 else if (RsRECORD(PL_rs)) {
4315 I32 recsize, bytesread;
4318 /* Grab the size of the record we're getting */
4319 recsize = SvIV(SvRV(PL_rs));
4320 (void)SvPOK_only(sv); /* Validate pointer */
4321 buffer = SvGROW(sv, recsize + 1);
4324 /* VMS wants read instead of fread, because fread doesn't respect */
4325 /* RMS record boundaries. This is not necessarily a good thing to be */
4326 /* doing, but we've got no other real choice */
4327 bytesread = PerlLIO_read(PerlIO_fileno(fp), buffer, recsize);
4329 bytesread = PerlIO_read(fp, buffer, recsize);
4331 SvCUR_set(sv, bytesread);
4332 buffer[bytesread] = '\0';
4333 return(SvCUR(sv) ? SvPVX(sv) : Nullch);
4335 else if (RsPARA(PL_rs)) {
4340 rsptr = SvPV(PL_rs, rslen);
4341 rslast = rslen ? rsptr[rslen - 1] : '\0';
4343 if (RsPARA(PL_rs)) { /* have to do this both before and after */
4344 do { /* to make sure file boundaries work right */
4347 i = PerlIO_getc(fp);
4351 PerlIO_ungetc(fp,i);
4357 /* See if we know enough about I/O mechanism to cheat it ! */
4359 /* This used to be #ifdef test - it is made run-time test for ease
4360 of abstracting out stdio interface. One call should be cheap
4361 enough here - and may even be a macro allowing compile
4365 if (PerlIO_fast_gets(fp)) {
4368 * We're going to steal some values from the stdio struct
4369 * and put EVERYTHING in the innermost loop into registers.
4371 register STDCHAR *ptr;
4375 #if defined(VMS) && defined(PERLIO_IS_STDIO)
4376 /* An ungetc()d char is handled separately from the regular
4377 * buffer, so we getc() it back out and stuff it in the buffer.
4379 i = PerlIO_getc(fp);
4380 if (i == EOF) return 0;
4381 *(--((*fp)->_ptr)) = (unsigned char) i;
4385 /* Here is some breathtakingly efficient cheating */
4387 cnt = PerlIO_get_cnt(fp); /* get count into register */
4388 (void)SvPOK_only(sv); /* validate pointer */
4389 if (SvLEN(sv) - append <= cnt + 1) { /* make sure we have the room */
4390 if (cnt > 80 && SvLEN(sv) > append) {
4391 shortbuffered = cnt - SvLEN(sv) + append + 1;
4392 cnt -= shortbuffered;
4396 /* remember that cnt can be negative */
4397 SvGROW(sv, append + (cnt <= 0 ? 2 : (cnt + 1)));
4402 bp = (STDCHAR*)SvPVX(sv) + append; /* move these two too to registers */
4403 ptr = (STDCHAR*)PerlIO_get_ptr(fp);
4404 DEBUG_P(PerlIO_printf(Perl_debug_log,
4405 "Screamer: entering, ptr=%"UVuf", cnt=%ld\n",PTR2UV(ptr),(long)cnt));
4406 DEBUG_P(PerlIO_printf(Perl_debug_log,
4407 "Screamer: entering: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
4408 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
4409 PTR2UV(PerlIO_has_base(fp) ? PerlIO_get_base(fp) : 0)));
4414 while (cnt > 0) { /* this | eat */
4416 if ((*bp++ = *ptr++) == rslast) /* really | dust */
4417 goto thats_all_folks; /* screams | sed :-) */
4421 Copy(ptr, bp, cnt, char); /* this | eat */
4422 bp += cnt; /* screams | dust */
4423 ptr += cnt; /* louder | sed :-) */
4428 if (shortbuffered) { /* oh well, must extend */
4429 cnt = shortbuffered;
4431 bpx = bp - (STDCHAR*)SvPVX(sv); /* box up before relocation */
4433 SvGROW(sv, SvLEN(sv) + append + cnt + 2);
4434 bp = (STDCHAR*)SvPVX(sv) + bpx; /* unbox after relocation */
4438 DEBUG_P(PerlIO_printf(Perl_debug_log,
4439 "Screamer: going to getc, ptr=%"UVuf", cnt=%ld\n",
4440 PTR2UV(ptr),(long)cnt));
4441 PerlIO_set_ptrcnt(fp, ptr, cnt); /* deregisterize cnt and ptr */
4442 DEBUG_P(PerlIO_printf(Perl_debug_log,
4443 "Screamer: pre: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
4444 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
4445 PTR2UV(PerlIO_has_base (fp) ? PerlIO_get_base(fp) : 0)));
4446 /* This used to call 'filbuf' in stdio form, but as that behaves like
4447 getc when cnt <= 0 we use PerlIO_getc here to avoid introducing
4448 another abstraction. */
4449 i = PerlIO_getc(fp); /* get more characters */
4450 DEBUG_P(PerlIO_printf(Perl_debug_log,
4451 "Screamer: post: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
4452 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
4453 PTR2UV(PerlIO_has_base (fp) ? PerlIO_get_base(fp) : 0)));
4454 cnt = PerlIO_get_cnt(fp);
4455 ptr = (STDCHAR*)PerlIO_get_ptr(fp); /* reregisterize cnt and ptr */
4456 DEBUG_P(PerlIO_printf(Perl_debug_log,
4457 "Screamer: after getc, ptr=%"UVuf", cnt=%ld\n",PTR2UV(ptr),(long)cnt));
4459 if (i == EOF) /* all done for ever? */
4460 goto thats_really_all_folks;
4462 bpx = bp - (STDCHAR*)SvPVX(sv); /* box up before relocation */
4464 SvGROW(sv, bpx + cnt + 2);
4465 bp = (STDCHAR*)SvPVX(sv) + bpx; /* unbox after relocation */
4467 *bp++ = i; /* store character from PerlIO_getc */
4469 if (rslen && (STDCHAR)i == rslast) /* all done for now? */
4470 goto thats_all_folks;
4474 if ((rslen > 1 && (bp - (STDCHAR*)SvPVX(sv) < rslen)) ||
4475 memNE((char*)bp - rslen, rsptr, rslen))
4476 goto screamer; /* go back to the fray */
4477 thats_really_all_folks:
4479 cnt += shortbuffered;
4480 DEBUG_P(PerlIO_printf(Perl_debug_log,
4481 "Screamer: quitting, ptr=%"UVuf", cnt=%ld\n",PTR2UV(ptr),(long)cnt));
4482 PerlIO_set_ptrcnt(fp, ptr, cnt); /* put these back or we're in trouble */
4483 DEBUG_P(PerlIO_printf(Perl_debug_log,
4484 "Screamer: end: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
4485 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
4486 PTR2UV(PerlIO_has_base (fp) ? PerlIO_get_base(fp) : 0)));
4488 SvCUR_set(sv, bp - (STDCHAR*)SvPVX(sv)); /* set length */
4489 DEBUG_P(PerlIO_printf(Perl_debug_log,
4490 "Screamer: done, len=%ld, string=|%.*s|\n",
4491 (long)SvCUR(sv),(int)SvCUR(sv),SvPVX(sv)));
4496 /*The big, slow, and stupid way */
4499 /* Need to work around EPOC SDK features */
4500 /* On WINS: MS VC5 generates calls to _chkstk, */
4501 /* if a `large' stack frame is allocated */
4502 /* gcc on MARM does not generate calls like these */
4508 register STDCHAR *bpe = buf + sizeof(buf);
4510 while ((i = PerlIO_getc(fp)) != EOF && (*bp++ = i) != rslast && bp < bpe)
4511 ; /* keep reading */
4515 cnt = PerlIO_read(fp,(char*)buf, sizeof(buf));
4516 /* Accomodate broken VAXC compiler, which applies U8 cast to
4517 * both args of ?: operator, causing EOF to change into 255
4519 if (cnt) { i = (U8)buf[cnt - 1]; } else { i = EOF; }
4523 sv_catpvn(sv, (char *) buf, cnt);
4525 sv_setpvn(sv, (char *) buf, cnt);
4527 if (i != EOF && /* joy */
4529 SvCUR(sv) < rslen ||
4530 memNE(SvPVX(sv) + SvCUR(sv) - rslen, rsptr, rslen)))
4534 * If we're reading from a TTY and we get a short read,
4535 * indicating that the user hit his EOF character, we need
4536 * to notice it now, because if we try to read from the TTY
4537 * again, the EOF condition will disappear.
4539 * The comparison of cnt to sizeof(buf) is an optimization
4540 * that prevents unnecessary calls to feof().
4544 if (!(cnt < sizeof(buf) && PerlIO_eof(fp)))
4549 if (RsPARA(PL_rs)) { /* have to do this both before and after */
4550 while (i != EOF) { /* to make sure file boundaries work right */
4551 i = PerlIO_getc(fp);
4553 PerlIO_ungetc(fp,i);
4559 return (SvCUR(sv) - append) ? SvPVX(sv) : Nullch;
4566 Auto-increment of the value in the SV.
4572 Perl_sv_inc(pTHX_ register SV *sv)
4581 if (SvTHINKFIRST(sv)) {
4582 if (SvREADONLY(sv)) {
4583 if (PL_curcop != &PL_compiling)
4584 Perl_croak(aTHX_ PL_no_modify);
4588 if (SvAMAGIC(sv) && AMG_CALLun(sv,inc))
4590 i = PTR2IV(SvRV(sv));
4595 flags = SvFLAGS(sv);
4596 if (flags & SVp_NOK) {
4597 (void)SvNOK_only(sv);
4601 if (flags & SVp_IOK) {
4603 if (SvUVX(sv) == UV_MAX)
4604 sv_setnv(sv, (NV)UV_MAX + 1.0);
4606 (void)SvIOK_only_UV(sv);
4609 if (SvIVX(sv) == IV_MAX)
4610 sv_setnv(sv, (NV)IV_MAX + 1.0);
4612 (void)SvIOK_only(sv);
4618 if (!(flags & SVp_POK) || !*SvPVX(sv)) {
4619 if ((flags & SVTYPEMASK) < SVt_PVNV)
4620 sv_upgrade(sv, SVt_IV);
4621 (void)SvIOK_only(sv);
4626 while (isALPHA(*d)) d++;
4627 while (isDIGIT(*d)) d++;
4629 sv_setnv(sv,Atof(SvPVX(sv)) + 1.0); /* punt */
4633 while (d >= SvPVX(sv)) {
4641 /* MKS: The original code here died if letters weren't consecutive.
4642 * at least it didn't have to worry about non-C locales. The
4643 * new code assumes that ('z'-'a')==('Z'-'A'), letters are
4644 * arranged in order (although not consecutively) and that only
4645 * [A-Za-z] are accepted by isALPHA in the C locale.
4647 if (*d != 'z' && *d != 'Z') {
4648 do { ++*d; } while (!isALPHA(*d));
4651 *(d--) -= 'z' - 'a';
4656 *(d--) -= 'z' - 'a' + 1;
4660 /* oh,oh, the number grew */
4661 SvGROW(sv, SvCUR(sv) + 2);
4663 for (d = SvPVX(sv) + SvCUR(sv); d > SvPVX(sv); d--)
4674 Auto-decrement of the value in the SV.
4680 Perl_sv_dec(pTHX_ register SV *sv)
4688 if (SvTHINKFIRST(sv)) {
4689 if (SvREADONLY(sv)) {
4690 if (PL_curcop != &PL_compiling)
4691 Perl_croak(aTHX_ PL_no_modify);
4695 if (SvAMAGIC(sv) && AMG_CALLun(sv,dec))
4697 i = PTR2IV(SvRV(sv));
4702 flags = SvFLAGS(sv);
4703 if (flags & SVp_NOK) {
4705 (void)SvNOK_only(sv);
4708 if (flags & SVp_IOK) {
4710 if (SvUVX(sv) == 0) {
4711 (void)SvIOK_only(sv);
4715 (void)SvIOK_only_UV(sv);
4719 if (SvIVX(sv) == IV_MIN)
4720 sv_setnv(sv, (NV)IV_MIN - 1.0);
4722 (void)SvIOK_only(sv);
4728 if (!(flags & SVp_POK)) {
4729 if ((flags & SVTYPEMASK) < SVt_PVNV)
4730 sv_upgrade(sv, SVt_NV);
4732 (void)SvNOK_only(sv);
4735 sv_setnv(sv,Atof(SvPVX(sv)) - 1.0); /* punt */
4739 =for apidoc sv_mortalcopy
4741 Creates a new SV which is a copy of the original SV. The new SV is marked
4747 /* Make a string that will exist for the duration of the expression
4748 * evaluation. Actually, it may have to last longer than that, but
4749 * hopefully we won't free it until it has been assigned to a
4750 * permanent location. */
4753 Perl_sv_mortalcopy(pTHX_ SV *oldstr)
4758 sv_setsv(sv,oldstr);
4760 PL_tmps_stack[++PL_tmps_ix] = sv;
4766 =for apidoc sv_newmortal
4768 Creates a new SV which is mortal. The reference count of the SV is set to 1.
4774 Perl_sv_newmortal(pTHX)
4779 SvFLAGS(sv) = SVs_TEMP;
4781 PL_tmps_stack[++PL_tmps_ix] = sv;
4786 =for apidoc sv_2mortal
4788 Marks an SV as mortal. The SV will be destroyed when the current context
4794 /* same thing without the copying */
4797 Perl_sv_2mortal(pTHX_ register SV *sv)
4801 if (SvREADONLY(sv) && SvIMMORTAL(sv))
4804 PL_tmps_stack[++PL_tmps_ix] = sv;
4812 Creates a new SV and copies a string into it. The reference count for the
4813 SV is set to 1. If C<len> is zero, Perl will compute the length using
4814 strlen(). For efficiency, consider using C<newSVpvn> instead.
4820 Perl_newSVpv(pTHX_ const char *s, STRLEN len)
4827 sv_setpvn(sv,s,len);
4832 =for apidoc newSVpvn
4834 Creates a new SV and copies a string into it. The reference count for the
4835 SV is set to 1. Note that if C<len> is zero, Perl will create a zero length
4836 string. You are responsible for ensuring that the source string is at least
4843 Perl_newSVpvn(pTHX_ const char *s, STRLEN len)
4848 sv_setpvn(sv,s,len);
4853 =for apidoc newSVpvn_share
4855 Creates a new SV and populates it with a string from
4856 the string table. Turns on READONLY and FAKE.
4857 The idea here is that as string table is used for shared hash
4858 keys these strings will have SvPVX == HeKEY and hash lookup
4859 will avoid string compare.
4865 Perl_newSVpvn_share(pTHX_ const char *src, STRLEN len, U32 hash)
4869 PERL_HASH(hash, src, len);
4871 sv_upgrade(sv, SVt_PVIV);
4872 SvPVX(sv) = sharepvn(src, len, hash);
4882 #if defined(PERL_IMPLICIT_CONTEXT)
4884 Perl_newSVpvf_nocontext(const char* pat, ...)
4889 va_start(args, pat);
4890 sv = vnewSVpvf(pat, &args);
4897 =for apidoc newSVpvf
4899 Creates a new SV an initialize it with the string formatted like
4906 Perl_newSVpvf(pTHX_ const char* pat, ...)
4910 va_start(args, pat);
4911 sv = vnewSVpvf(pat, &args);
4917 Perl_vnewSVpvf(pTHX_ const char* pat, va_list* args)
4921 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
4928 Creates a new SV and copies a floating point value into it.
4929 The reference count for the SV is set to 1.
4935 Perl_newSVnv(pTHX_ NV n)
4947 Creates a new SV and copies an integer into it. The reference count for the
4954 Perl_newSViv(pTHX_ IV i)
4966 Creates a new SV and copies an unsigned integer into it.
4967 The reference count for the SV is set to 1.
4973 Perl_newSVuv(pTHX_ UV u)
4983 =for apidoc newRV_noinc
4985 Creates an RV wrapper for an SV. The reference count for the original
4986 SV is B<not> incremented.
4992 Perl_newRV_noinc(pTHX_ SV *tmpRef)
4997 sv_upgrade(sv, SVt_RV);
5004 /* newRV_inc is #defined to newRV in sv.h */
5006 Perl_newRV(pTHX_ SV *tmpRef)
5008 return newRV_noinc(SvREFCNT_inc(tmpRef));
5014 Creates a new SV which is an exact duplicate of the original SV.
5019 /* make an exact duplicate of old */
5022 Perl_newSVsv(pTHX_ register SV *old)
5028 if (SvTYPE(old) == SVTYPEMASK) {
5029 if (ckWARN_d(WARN_INTERNAL))
5030 Perl_warner(aTHX_ WARN_INTERNAL, "semi-panic: attempt to dup freed string");
5045 Perl_sv_reset(pTHX_ register char *s, HV *stash)
5053 char todo[PERL_UCHAR_MAX+1];
5058 if (!*s) { /* reset ?? searches */
5059 for (pm = HvPMROOT(stash); pm; pm = pm->op_pmnext) {
5060 pm->op_pmdynflags &= ~PMdf_USED;
5065 /* reset variables */
5067 if (!HvARRAY(stash))
5070 Zero(todo, 256, char);
5072 i = (unsigned char)*s;
5076 max = (unsigned char)*s++;
5077 for ( ; i <= max; i++) {
5080 for (i = 0; i <= (I32) HvMAX(stash); i++) {
5081 for (entry = HvARRAY(stash)[i];
5083 entry = HeNEXT(entry))
5085 if (!todo[(U8)*HeKEY(entry)])
5087 gv = (GV*)HeVAL(entry);