3 * Copyright (C) 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999,
4 * 2000, 2001, 2002, 2003, by Larry Wall and others
6 * You may distribute under the terms of either the GNU General Public
7 * License or the Artistic License, as specified in the README file.
9 * "I wonder what the Entish is for 'yes' and 'no'," he thought.
12 * This file contains the code that creates, manipulates and destroys
13 * scalar values (SVs). The other types (AV, HV, GV, etc.) reuse the
14 * structure of an SV, so their creation and destruction is handled
15 * here; higher-level functions are in av.c, hv.c, and so on. Opcode
16 * level functions (eg. substr, split, join) for each of the types are
27 #ifdef PERL_UTF8_CACHE_ASSERT
28 /* The cache element 0 is the Unicode offset;
29 * the cache element 1 is the byte offset of the element 0;
30 * the cache element 2 is the Unicode length of the substring;
31 * the cache element 3 is the byte length of the substring;
32 * The checking of the substring side would be good
33 * but substr() has enough code paths to make my head spin;
34 * if adding more checks watch out for the following tests:
35 * t/op/index.t t/op/length.t t/op/pat.t t/op/substr.t
36 * lib/utf8.t lib/Unicode/Collate/t/index.t
39 #define ASSERT_UTF8_CACHE(cache) \
40 STMT_START { if (cache) { assert((cache)[0] <= (cache)[1]); } } STMT_END
42 #define ASSERT_UTF8_CACHE(cache) NOOP
45 #ifdef PERL_COPY_ON_WRITE
46 #define SV_COW_NEXT_SV(sv) INT2PTR(SV *,SvUVX(sv))
47 #define SV_COW_NEXT_SV_SET(current,next) SvUVX(current) = PTR2UV(next)
48 /* This is a pessimistic view. Scalar must be purely a read-write PV to copy-
52 /* ============================================================================
54 =head1 Allocation and deallocation of SVs.
56 An SV (or AV, HV, etc.) is allocated in two parts: the head (struct sv,
57 av, hv...) contains type and reference count information, as well as a
58 pointer to the body (struct xrv, xpv, xpviv...), which contains fields
59 specific to each type.
61 Normally, this allocation is done using arenas, which are approximately
62 1K chunks of memory parcelled up into N heads or bodies. The first slot
63 in each arena is reserved, and is used to hold a link to the next arena.
64 In the case of heads, the unused first slot also contains some flags and
65 a note of the number of slots. Snaked through each arena chain is a
66 linked list of free items; when this becomes empty, an extra arena is
67 allocated and divided up into N items which are threaded into the free
70 The following global variables are associated with arenas:
72 PL_sv_arenaroot pointer to list of SV arenas
73 PL_sv_root pointer to list of free SV structures
75 PL_foo_arenaroot pointer to list of foo arenas,
76 PL_foo_root pointer to list of free foo bodies
77 ... for foo in xiv, xnv, xrv, xpv etc.
79 Note that some of the larger and more rarely used body types (eg xpvio)
80 are not allocated using arenas, but are instead just malloc()/free()ed as
81 required. Also, if PURIFY is defined, arenas are abandoned altogether,
82 with all items individually malloc()ed. In addition, a few SV heads are
83 not allocated from an arena, but are instead directly created as static
84 or auto variables, eg PL_sv_undef.
86 The SV arena serves the secondary purpose of allowing still-live SVs
87 to be located and destroyed during final cleanup.
89 At the lowest level, the macros new_SV() and del_SV() grab and free
90 an SV head. (If debugging with -DD, del_SV() calls the function S_del_sv()
91 to return the SV to the free list with error checking.) new_SV() calls
92 more_sv() / sv_add_arena() to add an extra arena if the free list is empty.
93 SVs in the free list have their SvTYPE field set to all ones.
95 Similarly, there are macros new_XIV()/del_XIV(), new_XNV()/del_XNV() etc
96 that allocate and return individual body types. Normally these are mapped
97 to the arena-manipulating functions new_xiv()/del_xiv() etc, but may be
98 instead mapped directly to malloc()/free() if PURIFY is defined. The
99 new/del functions remove from, or add to, the appropriate PL_foo_root
100 list, and call more_xiv() etc to add a new arena if the list is empty.
102 At the time of very final cleanup, sv_free_arenas() is called from
103 perl_destruct() to physically free all the arenas allocated since the
104 start of the interpreter. Note that this also clears PL_he_arenaroot,
105 which is otherwise dealt with in hv.c.
107 Manipulation of any of the PL_*root pointers is protected by enclosing
108 LOCK_SV_MUTEX; ... UNLOCK_SV_MUTEX calls which should Do the Right Thing
109 if threads are enabled.
111 The function visit() scans the SV arenas list, and calls a specified
112 function for each SV it finds which is still live - ie which has an SvTYPE
113 other than all 1's, and a non-zero SvREFCNT. visit() is used by the
114 following functions (specified as [function that calls visit()] / [function
115 called by visit() for each SV]):
117 sv_report_used() / do_report_used()
118 dump all remaining SVs (debugging aid)
120 sv_clean_objs() / do_clean_objs(),do_clean_named_objs()
121 Attempt to free all objects pointed to by RVs,
122 and, unless DISABLE_DESTRUCTOR_KLUDGE is defined,
123 try to do the same for all objects indirectly
124 referenced by typeglobs too. Called once from
125 perl_destruct(), prior to calling sv_clean_all()
128 sv_clean_all() / do_clean_all()
129 SvREFCNT_dec(sv) each remaining SV, possibly
130 triggering an sv_free(). It also sets the
131 SVf_BREAK flag on the SV to indicate that the
132 refcnt has been artificially lowered, and thus
133 stopping sv_free() from giving spurious warnings
134 about SVs which unexpectedly have a refcnt
135 of zero. called repeatedly from perl_destruct()
136 until there are no SVs left.
140 Private API to rest of sv.c
144 new_XIV(), del_XIV(),
145 new_XNV(), del_XNV(),
150 sv_report_used(), sv_clean_objs(), sv_clean_all(), sv_free_arenas()
155 ============================================================================ */
160 * "A time to plant, and a time to uproot what was planted..."
163 #define plant_SV(p) \
165 SvANY(p) = (void *)PL_sv_root; \
166 SvFLAGS(p) = SVTYPEMASK; \
171 /* sv_mutex must be held while calling uproot_SV() */
172 #define uproot_SV(p) \
175 PL_sv_root = (SV*)SvANY(p); \
180 /* new_SV(): return a new, empty SV head */
182 #ifdef DEBUG_LEAKING_SCALARS
183 /* provide a real function for a debugger to play with */
200 # define new_SV(p) (p)=S_new_SV(aTHX)
218 /* del_SV(): return an empty SV head to the free list */
233 S_del_sv(pTHX_ SV *p)
240 for (sva = PL_sv_arenaroot; sva; sva = (SV *) SvANY(sva)) {
242 svend = &sva[SvREFCNT(sva)];
243 if (p >= sv && p < svend)
247 if (ckWARN_d(WARN_INTERNAL))
248 Perl_warner(aTHX_ packWARN(WARN_INTERNAL),
249 "Attempt to free non-arena SV: 0x%"UVxf,
257 #else /* ! DEBUGGING */
259 #define del_SV(p) plant_SV(p)
261 #endif /* DEBUGGING */
265 =head1 SV Manipulation Functions
267 =for apidoc sv_add_arena
269 Given a chunk of memory, link it to the head of the list of arenas,
270 and split it into a list of free SVs.
276 Perl_sv_add_arena(pTHX_ char *ptr, U32 size, U32 flags)
281 Zero(ptr, size, char);
283 /* The first SV in an arena isn't an SV. */
284 SvANY(sva) = (void *) PL_sv_arenaroot; /* ptr to next arena */
285 SvREFCNT(sva) = size / sizeof(SV); /* number of SV slots */
286 SvFLAGS(sva) = flags; /* FAKE if not to be freed */
288 PL_sv_arenaroot = sva;
289 PL_sv_root = sva + 1;
291 svend = &sva[SvREFCNT(sva) - 1];
294 SvANY(sv) = (void *)(SV*)(sv + 1);
295 SvFLAGS(sv) = SVTYPEMASK;
299 SvFLAGS(sv) = SVTYPEMASK;
302 /* make some more SVs by adding another arena */
304 /* sv_mutex must be held while calling more_sv() */
311 sv_add_arena(PL_nice_chunk, PL_nice_chunk_size, 0);
312 PL_nice_chunk = Nullch;
313 PL_nice_chunk_size = 0;
316 char *chunk; /* must use New here to match call to */
317 New(704,chunk,1008,char); /* Safefree() in sv_free_arenas() */
318 sv_add_arena(chunk, 1008, 0);
324 /* visit(): call the named function for each non-free SV in the arenas. */
327 S_visit(pTHX_ SVFUNC_t f)
334 for (sva = PL_sv_arenaroot; sva; sva = (SV*)SvANY(sva)) {
335 svend = &sva[SvREFCNT(sva)];
336 for (sv = sva + 1; sv < svend; ++sv) {
337 if (SvTYPE(sv) != SVTYPEMASK && SvREFCNT(sv)) {
348 /* called by sv_report_used() for each live SV */
351 do_report_used(pTHX_ SV *sv)
353 if (SvTYPE(sv) != SVTYPEMASK) {
354 PerlIO_printf(Perl_debug_log, "****\n");
361 =for apidoc sv_report_used
363 Dump the contents of all SVs not yet freed. (Debugging aid).
369 Perl_sv_report_used(pTHX)
372 visit(do_report_used);
376 /* called by sv_clean_objs() for each live SV */
379 do_clean_objs(pTHX_ SV *sv)
383 if (SvROK(sv) && SvOBJECT(rv = SvRV(sv))) {
384 DEBUG_D((PerlIO_printf(Perl_debug_log, "Cleaning object ref:\n "), sv_dump(sv)));
396 /* XXX Might want to check arrays, etc. */
399 /* called by sv_clean_objs() for each live SV */
401 #ifndef DISABLE_DESTRUCTOR_KLUDGE
403 do_clean_named_objs(pTHX_ SV *sv)
405 if (SvTYPE(sv) == SVt_PVGV && GvGP(sv)) {
406 if ( SvOBJECT(GvSV(sv)) ||
407 (GvAV(sv) && SvOBJECT(GvAV(sv))) ||
408 (GvHV(sv) && SvOBJECT(GvHV(sv))) ||
409 (GvIO(sv) && SvOBJECT(GvIO(sv))) ||
410 (GvCV(sv) && SvOBJECT(GvCV(sv))) )
412 DEBUG_D((PerlIO_printf(Perl_debug_log, "Cleaning named glob object:\n "), sv_dump(sv)));
420 =for apidoc sv_clean_objs
422 Attempt to destroy all objects not yet freed
428 Perl_sv_clean_objs(pTHX)
430 PL_in_clean_objs = TRUE;
431 visit(do_clean_objs);
432 #ifndef DISABLE_DESTRUCTOR_KLUDGE
433 /* some barnacles may yet remain, clinging to typeglobs */
434 visit(do_clean_named_objs);
436 PL_in_clean_objs = FALSE;
439 /* called by sv_clean_all() for each live SV */
442 do_clean_all(pTHX_ SV *sv)
444 DEBUG_D((PerlIO_printf(Perl_debug_log, "Cleaning loops: SV at 0x%"UVxf"\n", PTR2UV(sv)) ));
445 SvFLAGS(sv) |= SVf_BREAK;
450 =for apidoc sv_clean_all
452 Decrement the refcnt of each remaining SV, possibly triggering a
453 cleanup. This function may have to be called multiple times to free
454 SVs which are in complex self-referential hierarchies.
460 Perl_sv_clean_all(pTHX)
463 PL_in_clean_all = TRUE;
464 cleaned = visit(do_clean_all);
465 PL_in_clean_all = FALSE;
470 =for apidoc sv_free_arenas
472 Deallocate the memory used by all arenas. Note that all the individual SV
473 heads and bodies within the arenas must already have been freed.
479 Perl_sv_free_arenas(pTHX)
483 XPV *arena, *arenanext;
485 /* Free arenas here, but be careful about fake ones. (We assume
486 contiguity of the fake ones with the corresponding real ones.) */
488 for (sva = PL_sv_arenaroot; sva; sva = svanext) {
489 svanext = (SV*) SvANY(sva);
490 while (svanext && SvFAKE(svanext))
491 svanext = (SV*) SvANY(svanext);
494 Safefree((void *)sva);
497 for (arena = PL_xiv_arenaroot; arena; arena = arenanext) {
498 arenanext = (XPV*)arena->xpv_pv;
501 PL_xiv_arenaroot = 0;
503 for (arena = PL_xnv_arenaroot; arena; arena = arenanext) {
504 arenanext = (XPV*)arena->xpv_pv;
507 PL_xnv_arenaroot = 0;
509 for (arena = PL_xrv_arenaroot; arena; arena = arenanext) {
510 arenanext = (XPV*)arena->xpv_pv;
513 PL_xrv_arenaroot = 0;
515 for (arena = PL_xpv_arenaroot; arena; arena = arenanext) {
516 arenanext = (XPV*)arena->xpv_pv;
519 PL_xpv_arenaroot = 0;
521 for (arena = (XPV*)PL_xpviv_arenaroot; arena; arena = arenanext) {
522 arenanext = (XPV*)arena->xpv_pv;
525 PL_xpviv_arenaroot = 0;
527 for (arena = (XPV*)PL_xpvnv_arenaroot; arena; arena = arenanext) {
528 arenanext = (XPV*)arena->xpv_pv;
531 PL_xpvnv_arenaroot = 0;
533 for (arena = (XPV*)PL_xpvcv_arenaroot; arena; arena = arenanext) {
534 arenanext = (XPV*)arena->xpv_pv;
537 PL_xpvcv_arenaroot = 0;
539 for (arena = (XPV*)PL_xpvav_arenaroot; arena; arena = arenanext) {
540 arenanext = (XPV*)arena->xpv_pv;
543 PL_xpvav_arenaroot = 0;
545 for (arena = (XPV*)PL_xpvhv_arenaroot; arena; arena = arenanext) {
546 arenanext = (XPV*)arena->xpv_pv;
549 PL_xpvhv_arenaroot = 0;
551 for (arena = (XPV*)PL_xpvmg_arenaroot; arena; arena = arenanext) {
552 arenanext = (XPV*)arena->xpv_pv;
555 PL_xpvmg_arenaroot = 0;
557 for (arena = (XPV*)PL_xpvlv_arenaroot; arena; arena = arenanext) {
558 arenanext = (XPV*)arena->xpv_pv;
561 PL_xpvlv_arenaroot = 0;
563 for (arena = (XPV*)PL_xpvbm_arenaroot; arena; arena = arenanext) {
564 arenanext = (XPV*)arena->xpv_pv;
567 PL_xpvbm_arenaroot = 0;
569 for (arena = (XPV*)PL_he_arenaroot; arena; arena = arenanext) {
570 arenanext = (XPV*)arena->xpv_pv;
576 Safefree(PL_nice_chunk);
577 PL_nice_chunk = Nullch;
578 PL_nice_chunk_size = 0;
584 =for apidoc report_uninit
586 Print appropriate "Use of uninitialized variable" warning
592 Perl_report_uninit(pTHX)
595 Perl_warner(aTHX_ packWARN(WARN_UNINITIALIZED), PL_warn_uninit,
596 " in ", OP_DESC(PL_op));
598 Perl_warner(aTHX_ packWARN(WARN_UNINITIALIZED), PL_warn_uninit, "", "");
601 /* grab a new IV body from the free list, allocating more if necessary */
612 * See comment in more_xiv() -- RAM.
614 PL_xiv_root = *(IV**)xiv;
616 return (XPVIV*)((char*)xiv - STRUCT_OFFSET(XPVIV, xiv_iv));
619 /* return an IV body to the free list */
622 S_del_xiv(pTHX_ XPVIV *p)
624 IV* xiv = (IV*)((char*)(p) + STRUCT_OFFSET(XPVIV, xiv_iv));
626 *(IV**)xiv = PL_xiv_root;
631 /* allocate another arena's worth of IV bodies */
639 New(705, ptr, 1008/sizeof(XPV), XPV);
640 ptr->xpv_pv = (char*)PL_xiv_arenaroot; /* linked list of xiv arenas */
641 PL_xiv_arenaroot = ptr; /* to keep Purify happy */
644 xivend = &xiv[1008 / sizeof(IV) - 1];
645 xiv += (sizeof(XPV) - 1) / sizeof(IV) + 1; /* fudge by size of XPV */
647 while (xiv < xivend) {
648 *(IV**)xiv = (IV *)(xiv + 1);
654 /* grab a new NV body from the free list, allocating more if necessary */
664 PL_xnv_root = *(NV**)xnv;
666 return (XPVNV*)((char*)xnv - STRUCT_OFFSET(XPVNV, xnv_nv));
669 /* return an NV body to the free list */
672 S_del_xnv(pTHX_ XPVNV *p)
674 NV* xnv = (NV*)((char*)(p) + STRUCT_OFFSET(XPVNV, xnv_nv));
676 *(NV**)xnv = PL_xnv_root;
681 /* allocate another arena's worth of NV bodies */
689 New(711, ptr, 1008/sizeof(XPV), XPV);
690 ptr->xpv_pv = (char*)PL_xnv_arenaroot;
691 PL_xnv_arenaroot = ptr;
694 xnvend = &xnv[1008 / sizeof(NV) - 1];
695 xnv += (sizeof(XPVIV) - 1) / sizeof(NV) + 1; /* fudge by sizeof XPVIV */
697 while (xnv < xnvend) {
698 *(NV**)xnv = (NV*)(xnv + 1);
704 /* grab a new struct xrv from the free list, allocating more if necessary */
714 PL_xrv_root = (XRV*)xrv->xrv_rv;
719 /* return a struct xrv to the free list */
722 S_del_xrv(pTHX_ XRV *p)
725 p->xrv_rv = (SV*)PL_xrv_root;
730 /* allocate another arena's worth of struct xrv */
736 register XRV* xrvend;
738 New(712, ptr, 1008/sizeof(XPV), XPV);
739 ptr->xpv_pv = (char*)PL_xrv_arenaroot;
740 PL_xrv_arenaroot = ptr;
743 xrvend = &xrv[1008 / sizeof(XRV) - 1];
744 xrv += (sizeof(XPV) - 1) / sizeof(XRV) + 1;
746 while (xrv < xrvend) {
747 xrv->xrv_rv = (SV*)(xrv + 1);
753 /* grab a new struct xpv from the free list, allocating more if necessary */
763 PL_xpv_root = (XPV*)xpv->xpv_pv;
768 /* return a struct xpv to the free list */
771 S_del_xpv(pTHX_ XPV *p)
774 p->xpv_pv = (char*)PL_xpv_root;
779 /* allocate another arena's worth of struct xpv */
785 register XPV* xpvend;
786 New(713, xpv, 1008/sizeof(XPV), XPV);
787 xpv->xpv_pv = (char*)PL_xpv_arenaroot;
788 PL_xpv_arenaroot = xpv;
790 xpvend = &xpv[1008 / sizeof(XPV) - 1];
792 while (xpv < xpvend) {
793 xpv->xpv_pv = (char*)(xpv + 1);
799 /* grab a new struct xpviv from the free list, allocating more if necessary */
808 xpviv = PL_xpviv_root;
809 PL_xpviv_root = (XPVIV*)xpviv->xpv_pv;
814 /* return a struct xpviv to the free list */
817 S_del_xpviv(pTHX_ XPVIV *p)
820 p->xpv_pv = (char*)PL_xpviv_root;
825 /* allocate another arena's worth of struct xpviv */
830 register XPVIV* xpviv;
831 register XPVIV* xpvivend;
832 New(714, xpviv, 1008/sizeof(XPVIV), XPVIV);
833 xpviv->xpv_pv = (char*)PL_xpviv_arenaroot;
834 PL_xpviv_arenaroot = xpviv;
836 xpvivend = &xpviv[1008 / sizeof(XPVIV) - 1];
837 PL_xpviv_root = ++xpviv;
838 while (xpviv < xpvivend) {
839 xpviv->xpv_pv = (char*)(xpviv + 1);
845 /* grab a new struct xpvnv from the free list, allocating more if necessary */
854 xpvnv = PL_xpvnv_root;
855 PL_xpvnv_root = (XPVNV*)xpvnv->xpv_pv;
860 /* return a struct xpvnv to the free list */
863 S_del_xpvnv(pTHX_ XPVNV *p)
866 p->xpv_pv = (char*)PL_xpvnv_root;
871 /* allocate another arena's worth of struct xpvnv */
876 register XPVNV* xpvnv;
877 register XPVNV* xpvnvend;
878 New(715, xpvnv, 1008/sizeof(XPVNV), XPVNV);
879 xpvnv->xpv_pv = (char*)PL_xpvnv_arenaroot;
880 PL_xpvnv_arenaroot = xpvnv;
882 xpvnvend = &xpvnv[1008 / sizeof(XPVNV) - 1];
883 PL_xpvnv_root = ++xpvnv;
884 while (xpvnv < xpvnvend) {
885 xpvnv->xpv_pv = (char*)(xpvnv + 1);
891 /* grab a new struct xpvcv from the free list, allocating more if necessary */
900 xpvcv = PL_xpvcv_root;
901 PL_xpvcv_root = (XPVCV*)xpvcv->xpv_pv;
906 /* return a struct xpvcv to the free list */
909 S_del_xpvcv(pTHX_ XPVCV *p)
912 p->xpv_pv = (char*)PL_xpvcv_root;
917 /* allocate another arena's worth of struct xpvcv */
922 register XPVCV* xpvcv;
923 register XPVCV* xpvcvend;
924 New(716, xpvcv, 1008/sizeof(XPVCV), XPVCV);
925 xpvcv->xpv_pv = (char*)PL_xpvcv_arenaroot;
926 PL_xpvcv_arenaroot = xpvcv;
928 xpvcvend = &xpvcv[1008 / sizeof(XPVCV) - 1];
929 PL_xpvcv_root = ++xpvcv;
930 while (xpvcv < xpvcvend) {
931 xpvcv->xpv_pv = (char*)(xpvcv + 1);
937 /* grab a new struct xpvav from the free list, allocating more if necessary */
946 xpvav = PL_xpvav_root;
947 PL_xpvav_root = (XPVAV*)xpvav->xav_array;
952 /* return a struct xpvav to the free list */
955 S_del_xpvav(pTHX_ XPVAV *p)
958 p->xav_array = (char*)PL_xpvav_root;
963 /* allocate another arena's worth of struct xpvav */
968 register XPVAV* xpvav;
969 register XPVAV* xpvavend;
970 New(717, xpvav, 1008/sizeof(XPVAV), XPVAV);
971 xpvav->xav_array = (char*)PL_xpvav_arenaroot;
972 PL_xpvav_arenaroot = xpvav;
974 xpvavend = &xpvav[1008 / sizeof(XPVAV) - 1];
975 PL_xpvav_root = ++xpvav;
976 while (xpvav < xpvavend) {
977 xpvav->xav_array = (char*)(xpvav + 1);
980 xpvav->xav_array = 0;
983 /* grab a new struct xpvhv from the free list, allocating more if necessary */
992 xpvhv = PL_xpvhv_root;
993 PL_xpvhv_root = (XPVHV*)xpvhv->xhv_array;
998 /* return a struct xpvhv to the free list */
1001 S_del_xpvhv(pTHX_ XPVHV *p)
1004 p->xhv_array = (char*)PL_xpvhv_root;
1009 /* allocate another arena's worth of struct xpvhv */
1014 register XPVHV* xpvhv;
1015 register XPVHV* xpvhvend;
1016 New(718, xpvhv, 1008/sizeof(XPVHV), XPVHV);
1017 xpvhv->xhv_array = (char*)PL_xpvhv_arenaroot;
1018 PL_xpvhv_arenaroot = xpvhv;
1020 xpvhvend = &xpvhv[1008 / sizeof(XPVHV) - 1];
1021 PL_xpvhv_root = ++xpvhv;
1022 while (xpvhv < xpvhvend) {
1023 xpvhv->xhv_array = (char*)(xpvhv + 1);
1026 xpvhv->xhv_array = 0;
1029 /* grab a new struct xpvmg from the free list, allocating more if necessary */
1038 xpvmg = PL_xpvmg_root;
1039 PL_xpvmg_root = (XPVMG*)xpvmg->xpv_pv;
1044 /* return a struct xpvmg to the free list */
1047 S_del_xpvmg(pTHX_ XPVMG *p)
1050 p->xpv_pv = (char*)PL_xpvmg_root;
1055 /* allocate another arena's worth of struct xpvmg */
1060 register XPVMG* xpvmg;
1061 register XPVMG* xpvmgend;
1062 New(719, xpvmg, 1008/sizeof(XPVMG), XPVMG);
1063 xpvmg->xpv_pv = (char*)PL_xpvmg_arenaroot;
1064 PL_xpvmg_arenaroot = xpvmg;
1066 xpvmgend = &xpvmg[1008 / sizeof(XPVMG) - 1];
1067 PL_xpvmg_root = ++xpvmg;
1068 while (xpvmg < xpvmgend) {
1069 xpvmg->xpv_pv = (char*)(xpvmg + 1);
1075 /* grab a new struct xpvlv from the free list, allocating more if necessary */
1084 xpvlv = PL_xpvlv_root;
1085 PL_xpvlv_root = (XPVLV*)xpvlv->xpv_pv;
1090 /* return a struct xpvlv to the free list */
1093 S_del_xpvlv(pTHX_ XPVLV *p)
1096 p->xpv_pv = (char*)PL_xpvlv_root;
1101 /* allocate another arena's worth of struct xpvlv */
1106 register XPVLV* xpvlv;
1107 register XPVLV* xpvlvend;
1108 New(720, xpvlv, 1008/sizeof(XPVLV), XPVLV);
1109 xpvlv->xpv_pv = (char*)PL_xpvlv_arenaroot;
1110 PL_xpvlv_arenaroot = xpvlv;
1112 xpvlvend = &xpvlv[1008 / sizeof(XPVLV) - 1];
1113 PL_xpvlv_root = ++xpvlv;
1114 while (xpvlv < xpvlvend) {
1115 xpvlv->xpv_pv = (char*)(xpvlv + 1);
1121 /* grab a new struct xpvbm from the free list, allocating more if necessary */
1130 xpvbm = PL_xpvbm_root;
1131 PL_xpvbm_root = (XPVBM*)xpvbm->xpv_pv;
1136 /* return a struct xpvbm to the free list */
1139 S_del_xpvbm(pTHX_ XPVBM *p)
1142 p->xpv_pv = (char*)PL_xpvbm_root;
1147 /* allocate another arena's worth of struct xpvbm */
1152 register XPVBM* xpvbm;
1153 register XPVBM* xpvbmend;
1154 New(721, xpvbm, 1008/sizeof(XPVBM), XPVBM);
1155 xpvbm->xpv_pv = (char*)PL_xpvbm_arenaroot;
1156 PL_xpvbm_arenaroot = xpvbm;
1158 xpvbmend = &xpvbm[1008 / sizeof(XPVBM) - 1];
1159 PL_xpvbm_root = ++xpvbm;
1160 while (xpvbm < xpvbmend) {
1161 xpvbm->xpv_pv = (char*)(xpvbm + 1);
1167 #define my_safemalloc(s) (void*)safemalloc(s)
1168 #define my_safefree(p) safefree((char*)p)
1172 #define new_XIV() my_safemalloc(sizeof(XPVIV))
1173 #define del_XIV(p) my_safefree(p)
1175 #define new_XNV() my_safemalloc(sizeof(XPVNV))
1176 #define del_XNV(p) my_safefree(p)
1178 #define new_XRV() my_safemalloc(sizeof(XRV))
1179 #define del_XRV(p) my_safefree(p)
1181 #define new_XPV() my_safemalloc(sizeof(XPV))
1182 #define del_XPV(p) my_safefree(p)
1184 #define new_XPVIV() my_safemalloc(sizeof(XPVIV))
1185 #define del_XPVIV(p) my_safefree(p)
1187 #define new_XPVNV() my_safemalloc(sizeof(XPVNV))
1188 #define del_XPVNV(p) my_safefree(p)
1190 #define new_XPVCV() my_safemalloc(sizeof(XPVCV))
1191 #define del_XPVCV(p) my_safefree(p)
1193 #define new_XPVAV() my_safemalloc(sizeof(XPVAV))
1194 #define del_XPVAV(p) my_safefree(p)
1196 #define new_XPVHV() my_safemalloc(sizeof(XPVHV))
1197 #define del_XPVHV(p) my_safefree(p)
1199 #define new_XPVMG() my_safemalloc(sizeof(XPVMG))
1200 #define del_XPVMG(p) my_safefree(p)
1202 #define new_XPVLV() my_safemalloc(sizeof(XPVLV))
1203 #define del_XPVLV(p) my_safefree(p)
1205 #define new_XPVBM() my_safemalloc(sizeof(XPVBM))
1206 #define del_XPVBM(p) my_safefree(p)
1210 #define new_XIV() (void*)new_xiv()
1211 #define del_XIV(p) del_xiv((XPVIV*) p)
1213 #define new_XNV() (void*)new_xnv()
1214 #define del_XNV(p) del_xnv((XPVNV*) p)
1216 #define new_XRV() (void*)new_xrv()
1217 #define del_XRV(p) del_xrv((XRV*) p)
1219 #define new_XPV() (void*)new_xpv()
1220 #define del_XPV(p) del_xpv((XPV *)p)
1222 #define new_XPVIV() (void*)new_xpviv()
1223 #define del_XPVIV(p) del_xpviv((XPVIV *)p)
1225 #define new_XPVNV() (void*)new_xpvnv()
1226 #define del_XPVNV(p) del_xpvnv((XPVNV *)p)
1228 #define new_XPVCV() (void*)new_xpvcv()
1229 #define del_XPVCV(p) del_xpvcv((XPVCV *)p)
1231 #define new_XPVAV() (void*)new_xpvav()
1232 #define del_XPVAV(p) del_xpvav((XPVAV *)p)
1234 #define new_XPVHV() (void*)new_xpvhv()
1235 #define del_XPVHV(p) del_xpvhv((XPVHV *)p)
1237 #define new_XPVMG() (void*)new_xpvmg()
1238 #define del_XPVMG(p) del_xpvmg((XPVMG *)p)
1240 #define new_XPVLV() (void*)new_xpvlv()
1241 #define del_XPVLV(p) del_xpvlv((XPVLV *)p)
1243 #define new_XPVBM() (void*)new_xpvbm()
1244 #define del_XPVBM(p) del_xpvbm((XPVBM *)p)
1248 #define new_XPVGV() my_safemalloc(sizeof(XPVGV))
1249 #define del_XPVGV(p) my_safefree(p)
1251 #define new_XPVFM() my_safemalloc(sizeof(XPVFM))
1252 #define del_XPVFM(p) my_safefree(p)
1254 #define new_XPVIO() my_safemalloc(sizeof(XPVIO))
1255 #define del_XPVIO(p) my_safefree(p)
1258 =for apidoc sv_upgrade
1260 Upgrade an SV to a more complex form. Generally adds a new body type to the
1261 SV, then copies across as much information as possible from the old body.
1262 You generally want to use the C<SvUPGRADE> macro wrapper. See also C<svtype>.
1268 Perl_sv_upgrade(pTHX_ register SV *sv, U32 mt)
1275 MAGIC* magic = NULL;
1278 if (mt != SVt_PV && SvIsCOW(sv)) {
1279 sv_force_normal_flags(sv, 0);
1282 if (SvTYPE(sv) == mt)
1286 (void)SvOOK_off(sv);
1288 switch (SvTYPE(sv)) {
1309 else if (mt < SVt_PVIV)
1326 pv = (char*)SvRV(sv);
1346 else if (mt == SVt_NV)
1357 del_XPVIV(SvANY(sv));
1367 del_XPVNV(SvANY(sv));
1375 magic = SvMAGIC(sv);
1376 stash = SvSTASH(sv);
1377 del_XPVMG(SvANY(sv));
1380 Perl_croak(aTHX_ "Can't upgrade that kind of scalar");
1385 Perl_croak(aTHX_ "Can't upgrade to undef");
1387 SvANY(sv) = new_XIV();
1391 SvANY(sv) = new_XNV();
1395 SvANY(sv) = new_XRV();
1399 SvANY(sv) = new_XPV();
1405 SvANY(sv) = new_XPVIV();
1415 SvANY(sv) = new_XPVNV();
1423 SvANY(sv) = new_XPVMG();
1429 SvMAGIC(sv) = magic;
1430 SvSTASH(sv) = stash;
1433 SvANY(sv) = new_XPVLV();
1439 SvMAGIC(sv) = magic;
1440 SvSTASH(sv) = stash;
1447 SvANY(sv) = new_XPVAV();
1455 SvMAGIC(sv) = magic;
1456 SvSTASH(sv) = stash;
1462 SvANY(sv) = new_XPVHV();
1468 HvTOTALKEYS(sv) = 0;
1469 HvPLACEHOLDERS(sv) = 0;
1470 SvMAGIC(sv) = magic;
1471 SvSTASH(sv) = stash;
1478 SvANY(sv) = new_XPVCV();
1479 Zero(SvANY(sv), 1, XPVCV);
1485 SvMAGIC(sv) = magic;
1486 SvSTASH(sv) = stash;
1489 SvANY(sv) = new_XPVGV();
1495 SvMAGIC(sv) = magic;
1496 SvSTASH(sv) = stash;
1504 SvANY(sv) = new_XPVBM();
1510 SvMAGIC(sv) = magic;
1511 SvSTASH(sv) = stash;
1517 SvANY(sv) = new_XPVFM();
1518 Zero(SvANY(sv), 1, XPVFM);
1524 SvMAGIC(sv) = magic;
1525 SvSTASH(sv) = stash;
1528 SvANY(sv) = new_XPVIO();
1529 Zero(SvANY(sv), 1, XPVIO);
1535 SvMAGIC(sv) = magic;
1536 SvSTASH(sv) = stash;
1537 IoPAGE_LEN(sv) = 60;
1540 SvFLAGS(sv) &= ~SVTYPEMASK;
1546 =for apidoc sv_backoff
1548 Remove any string offset. You should normally use the C<SvOOK_off> macro
1555 Perl_sv_backoff(pTHX_ register SV *sv)
1559 char *s = SvPVX(sv);
1560 SvLEN(sv) += SvIVX(sv);
1561 SvPVX(sv) -= SvIVX(sv);
1563 Move(s, SvPVX(sv), SvCUR(sv)+1, char);
1565 SvFLAGS(sv) &= ~SVf_OOK;
1572 Expands the character buffer in the SV. If necessary, uses C<sv_unref> and
1573 upgrades the SV to C<SVt_PV>. Returns a pointer to the character buffer.
1574 Use the C<SvGROW> wrapper instead.
1580 Perl_sv_grow(pTHX_ register SV *sv, register STRLEN newlen)
1584 #ifdef HAS_64K_LIMIT
1585 if (newlen >= 0x10000) {
1586 PerlIO_printf(Perl_debug_log,
1587 "Allocation too large: %"UVxf"\n", (UV)newlen);
1590 #endif /* HAS_64K_LIMIT */
1593 if (SvTYPE(sv) < SVt_PV) {
1594 sv_upgrade(sv, SVt_PV);
1597 else if (SvOOK(sv)) { /* pv is offset? */
1600 if (newlen > SvLEN(sv))
1601 newlen += 10 * (newlen - SvCUR(sv)); /* avoid copy each time */
1602 #ifdef HAS_64K_LIMIT
1603 if (newlen >= 0x10000)
1610 if (newlen > SvLEN(sv)) { /* need more room? */
1611 if (SvLEN(sv) && s) {
1613 STRLEN l = malloced_size((void*)SvPVX(sv));
1619 Renew(s,newlen,char);
1622 New(703, s, newlen, char);
1623 if (SvPVX(sv) && SvCUR(sv)) {
1624 Move(SvPVX(sv), s, (newlen < SvCUR(sv)) ? newlen : SvCUR(sv), char);
1628 SvLEN_set(sv, newlen);
1634 =for apidoc sv_setiv
1636 Copies an integer into the given SV, upgrading first if necessary.
1637 Does not handle 'set' magic. See also C<sv_setiv_mg>.
1643 Perl_sv_setiv(pTHX_ register SV *sv, IV i)
1645 SV_CHECK_THINKFIRST_COW_DROP(sv);
1646 switch (SvTYPE(sv)) {
1648 sv_upgrade(sv, SVt_IV);
1651 sv_upgrade(sv, SVt_PVNV);
1655 sv_upgrade(sv, SVt_PVIV);
1664 Perl_croak(aTHX_ "Can't coerce %s to integer in %s", sv_reftype(sv,0),
1667 (void)SvIOK_only(sv); /* validate number */
1673 =for apidoc sv_setiv_mg
1675 Like C<sv_setiv>, but also handles 'set' magic.
1681 Perl_sv_setiv_mg(pTHX_ register SV *sv, IV i)
1688 =for apidoc sv_setuv
1690 Copies an unsigned integer into the given SV, upgrading first if necessary.
1691 Does not handle 'set' magic. See also C<sv_setuv_mg>.
1697 Perl_sv_setuv(pTHX_ register SV *sv, UV u)
1699 /* With these two if statements:
1700 u=1.49 s=0.52 cu=72.49 cs=10.64 scripts=270 tests=20865
1703 u=1.35 s=0.47 cu=73.45 cs=11.43 scripts=270 tests=20865
1705 If you wish to remove them, please benchmark to see what the effect is
1707 if (u <= (UV)IV_MAX) {
1708 sv_setiv(sv, (IV)u);
1717 =for apidoc sv_setuv_mg
1719 Like C<sv_setuv>, but also handles 'set' magic.
1725 Perl_sv_setuv_mg(pTHX_ register SV *sv, UV u)
1727 /* With these two if statements:
1728 u=1.49 s=0.52 cu=72.49 cs=10.64 scripts=270 tests=20865
1731 u=1.35 s=0.47 cu=73.45 cs=11.43 scripts=270 tests=20865
1733 If you wish to remove them, please benchmark to see what the effect is
1735 if (u <= (UV)IV_MAX) {
1736 sv_setiv(sv, (IV)u);
1746 =for apidoc sv_setnv
1748 Copies a double into the given SV, upgrading first if necessary.
1749 Does not handle 'set' magic. See also C<sv_setnv_mg>.
1755 Perl_sv_setnv(pTHX_ register SV *sv, NV num)
1757 SV_CHECK_THINKFIRST_COW_DROP(sv);
1758 switch (SvTYPE(sv)) {
1761 sv_upgrade(sv, SVt_NV);
1766 sv_upgrade(sv, SVt_PVNV);
1775 Perl_croak(aTHX_ "Can't coerce %s to number in %s", sv_reftype(sv,0),
1779 (void)SvNOK_only(sv); /* validate number */
1784 =for apidoc sv_setnv_mg
1786 Like C<sv_setnv>, but also handles 'set' magic.
1792 Perl_sv_setnv_mg(pTHX_ register SV *sv, NV num)
1798 /* Print an "isn't numeric" warning, using a cleaned-up,
1799 * printable version of the offending string
1803 S_not_a_number(pTHX_ SV *sv)
1810 dsv = sv_2mortal(newSVpv("", 0));
1811 pv = sv_uni_display(dsv, sv, 10, 0);
1814 char *limit = tmpbuf + sizeof(tmpbuf) - 8;
1815 /* each *s can expand to 4 chars + "...\0",
1816 i.e. need room for 8 chars */
1819 for (s = SvPVX(sv), end = s + SvCUR(sv); s < end && d < limit; s++) {
1821 if (ch & 128 && !isPRINT_LC(ch)) {
1830 else if (ch == '\r') {
1834 else if (ch == '\f') {
1838 else if (ch == '\\') {
1842 else if (ch == '\0') {
1846 else if (isPRINT_LC(ch))
1863 Perl_warner(aTHX_ packWARN(WARN_NUMERIC),
1864 "Argument \"%s\" isn't numeric in %s", pv,
1867 Perl_warner(aTHX_ packWARN(WARN_NUMERIC),
1868 "Argument \"%s\" isn't numeric", pv);
1872 =for apidoc looks_like_number
1874 Test if the content of an SV looks like a number (or is a number).
1875 C<Inf> and C<Infinity> are treated as numbers (so will not issue a
1876 non-numeric warning), even if your atof() doesn't grok them.
1882 Perl_looks_like_number(pTHX_ SV *sv)
1884 register char *sbegin;
1891 else if (SvPOKp(sv))
1892 sbegin = SvPV(sv, len);
1894 return 1; /* Historic. Wrong? */
1895 return grok_number(sbegin, len, NULL);
1898 /* Actually, ISO C leaves conversion of UV to IV undefined, but
1899 until proven guilty, assume that things are not that bad... */
1904 As 64 bit platforms often have an NV that doesn't preserve all bits of
1905 an IV (an assumption perl has been based on to date) it becomes necessary
1906 to remove the assumption that the NV always carries enough precision to
1907 recreate the IV whenever needed, and that the NV is the canonical form.
1908 Instead, IV/UV and NV need to be given equal rights. So as to not lose
1909 precision as a side effect of conversion (which would lead to insanity
1910 and the dragon(s) in t/op/numconvert.t getting very angry) the intent is
1911 1) to distinguish between IV/UV/NV slots that have cached a valid
1912 conversion where precision was lost and IV/UV/NV slots that have a
1913 valid conversion which has lost no precision
1914 2) to ensure that if a numeric conversion to one form is requested that
1915 would lose precision, the precise conversion (or differently
1916 imprecise conversion) is also performed and cached, to prevent
1917 requests for different numeric formats on the same SV causing
1918 lossy conversion chains. (lossless conversion chains are perfectly
1923 SvIOKp is true if the IV slot contains a valid value
1924 SvIOK is true only if the IV value is accurate (UV if SvIOK_UV true)
1925 SvNOKp is true if the NV slot contains a valid value
1926 SvNOK is true only if the NV value is accurate
1929 while converting from PV to NV, check to see if converting that NV to an
1930 IV(or UV) would lose accuracy over a direct conversion from PV to
1931 IV(or UV). If it would, cache both conversions, return NV, but mark
1932 SV as IOK NOKp (ie not NOK).
1934 While converting from PV to IV, check to see if converting that IV to an
1935 NV would lose accuracy over a direct conversion from PV to NV. If it
1936 would, cache both conversions, flag similarly.
1938 Before, the SV value "3.2" could become NV=3.2 IV=3 NOK, IOK quite
1939 correctly because if IV & NV were set NV *always* overruled.
1940 Now, "3.2" will become NV=3.2 IV=3 NOK, IOKp, because the flag's meaning
1941 changes - now IV and NV together means that the two are interchangeable:
1942 SvIVX == (IV) SvNVX && SvNVX == (NV) SvIVX;
1944 The benefit of this is that operations such as pp_add know that if
1945 SvIOK is true for both left and right operands, then integer addition
1946 can be used instead of floating point (for cases where the result won't
1947 overflow). Before, floating point was always used, which could lead to
1948 loss of precision compared with integer addition.
1950 * making IV and NV equal status should make maths accurate on 64 bit
1952 * may speed up maths somewhat if pp_add and friends start to use
1953 integers when possible instead of fp. (Hopefully the overhead in
1954 looking for SvIOK and checking for overflow will not outweigh the
1955 fp to integer speedup)
1956 * will slow down integer operations (callers of SvIV) on "inaccurate"
1957 values, as the change from SvIOK to SvIOKp will cause a call into
1958 sv_2iv each time rather than a macro access direct to the IV slot
1959 * should speed up number->string conversion on integers as IV is
1960 favoured when IV and NV are equally accurate
1962 ####################################################################
1963 You had better be using SvIOK_notUV if you want an IV for arithmetic:
1964 SvIOK is true if (IV or UV), so you might be getting (IV)SvUV.
1965 On the other hand, SvUOK is true iff UV.
1966 ####################################################################
1968 Your mileage will vary depending your CPU's relative fp to integer
1972 #ifndef NV_PRESERVES_UV
1973 # define IS_NUMBER_UNDERFLOW_IV 1
1974 # define IS_NUMBER_UNDERFLOW_UV 2
1975 # define IS_NUMBER_IV_AND_UV 2
1976 # define IS_NUMBER_OVERFLOW_IV 4
1977 # define IS_NUMBER_OVERFLOW_UV 5
1979 /* sv_2iuv_non_preserve(): private routine for use by sv_2iv() and sv_2uv() */
1981 /* For sv_2nv these three cases are "SvNOK and don't bother casting" */
1983 S_sv_2iuv_non_preserve(pTHX_ register SV *sv, I32 numtype)
1985 DEBUG_c(PerlIO_printf(Perl_debug_log,"sv_2iuv_non '%s', IV=0x%"UVxf" NV=%"NVgf" inttype=%"UVXf"\n", SvPVX(sv), SvIVX(sv), SvNVX(sv), (UV)numtype));
1986 if (SvNVX(sv) < (NV)IV_MIN) {
1987 (void)SvIOKp_on(sv);
1990 return IS_NUMBER_UNDERFLOW_IV;
1992 if (SvNVX(sv) > (NV)UV_MAX) {
1993 (void)SvIOKp_on(sv);
1997 return IS_NUMBER_OVERFLOW_UV;
1999 (void)SvIOKp_on(sv);
2001 /* Can't use strtol etc to convert this string. (See truth table in
2003 if (SvNVX(sv) <= (UV)IV_MAX) {
2004 SvIVX(sv) = I_V(SvNVX(sv));
2005 if ((NV)(SvIVX(sv)) == SvNVX(sv)) {
2006 SvIOK_on(sv); /* Integer is precise. NOK, IOK */
2008 /* Integer is imprecise. NOK, IOKp */
2010 return SvNVX(sv) < 0 ? IS_NUMBER_UNDERFLOW_UV : IS_NUMBER_IV_AND_UV;
2013 SvUVX(sv) = U_V(SvNVX(sv));
2014 if ((NV)(SvUVX(sv)) == SvNVX(sv)) {
2015 if (SvUVX(sv) == UV_MAX) {
2016 /* As we know that NVs don't preserve UVs, UV_MAX cannot
2017 possibly be preserved by NV. Hence, it must be overflow.
2019 return IS_NUMBER_OVERFLOW_UV;
2021 SvIOK_on(sv); /* Integer is precise. NOK, UOK */
2023 /* Integer is imprecise. NOK, IOKp */
2025 return IS_NUMBER_OVERFLOW_IV;
2027 #endif /* !NV_PRESERVES_UV*/
2032 Return the integer value of an SV, doing any necessary string conversion,
2033 magic etc. Normally used via the C<SvIV(sv)> and C<SvIVx(sv)> macros.
2039 Perl_sv_2iv(pTHX_ register SV *sv)
2043 if (SvGMAGICAL(sv)) {
2048 return I_V(SvNVX(sv));
2050 if (SvPOKp(sv) && SvLEN(sv))
2053 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
2054 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
2060 if (SvTHINKFIRST(sv)) {
2063 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv,numer)) &&
2064 (!SvROK(tmpstr) || (SvRV(tmpstr) != SvRV(sv))))
2065 return SvIV(tmpstr);
2066 return PTR2IV(SvRV(sv));
2069 sv_force_normal_flags(sv, 0);
2071 if (SvREADONLY(sv) && !SvOK(sv)) {
2072 if (ckWARN(WARN_UNINITIALIZED))
2079 return (IV)(SvUVX(sv));
2086 /* erm. not sure. *should* never get NOKp (without NOK) from sv_2nv
2087 * without also getting a cached IV/UV from it at the same time
2088 * (ie PV->NV conversion should detect loss of accuracy and cache
2089 * IV or UV at same time to avoid this. NWC */
2091 if (SvTYPE(sv) == SVt_NV)
2092 sv_upgrade(sv, SVt_PVNV);
2094 (void)SvIOKp_on(sv); /* Must do this first, to clear any SvOOK */
2095 /* < not <= as for NV doesn't preserve UV, ((NV)IV_MAX+1) will almost
2096 certainly cast into the IV range at IV_MAX, whereas the correct
2097 answer is the UV IV_MAX +1. Hence < ensures that dodgy boundary
2099 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2100 SvIVX(sv) = I_V(SvNVX(sv));
2101 if (SvNVX(sv) == (NV) SvIVX(sv)
2102 #ifndef NV_PRESERVES_UV
2103 && (((UV)1 << NV_PRESERVES_UV_BITS) >
2104 (UV)(SvIVX(sv) > 0 ? SvIVX(sv) : -SvIVX(sv)))
2105 /* Don't flag it as "accurately an integer" if the number
2106 came from a (by definition imprecise) NV operation, and
2107 we're outside the range of NV integer precision */
2110 SvIOK_on(sv); /* Can this go wrong with rounding? NWC */
2111 DEBUG_c(PerlIO_printf(Perl_debug_log,
2112 "0x%"UVxf" iv(%"NVgf" => %"IVdf") (precise)\n",
2118 /* IV not precise. No need to convert from PV, as NV
2119 conversion would already have cached IV if it detected
2120 that PV->IV would be better than PV->NV->IV
2121 flags already correct - don't set public IOK. */
2122 DEBUG_c(PerlIO_printf(Perl_debug_log,
2123 "0x%"UVxf" iv(%"NVgf" => %"IVdf") (imprecise)\n",
2128 /* Can the above go wrong if SvIVX == IV_MIN and SvNVX < IV_MIN,
2129 but the cast (NV)IV_MIN rounds to a the value less (more
2130 negative) than IV_MIN which happens to be equal to SvNVX ??
2131 Analogous to 0xFFFFFFFFFFFFFFFF rounding up to NV (2**64) and
2132 NV rounding back to 0xFFFFFFFFFFFFFFFF, so UVX == UV(NVX) and
2133 (NV)UVX == NVX are both true, but the values differ. :-(
2134 Hopefully for 2s complement IV_MIN is something like
2135 0x8000000000000000 which will be exact. NWC */
2138 SvUVX(sv) = U_V(SvNVX(sv));
2140 (SvNVX(sv) == (NV) SvUVX(sv))
2141 #ifndef NV_PRESERVES_UV
2142 /* Make sure it's not 0xFFFFFFFFFFFFFFFF */
2143 /*&& (SvUVX(sv) != UV_MAX) irrelevant with code below */
2144 && (((UV)1 << NV_PRESERVES_UV_BITS) > SvUVX(sv))
2145 /* Don't flag it as "accurately an integer" if the number
2146 came from a (by definition imprecise) NV operation, and
2147 we're outside the range of NV integer precision */
2153 DEBUG_c(PerlIO_printf(Perl_debug_log,
2154 "0x%"UVxf" 2iv(%"UVuf" => %"IVdf") (as unsigned)\n",
2158 return (IV)SvUVX(sv);
2161 else if (SvPOKp(sv) && SvLEN(sv)) {
2163 int numtype = grok_number(SvPVX(sv), SvCUR(sv), &value);
2164 /* We want to avoid a possible problem when we cache an IV which
2165 may be later translated to an NV, and the resulting NV is not
2166 the same as the direct translation of the initial string
2167 (eg 123.456 can shortcut to the IV 123 with atol(), but we must
2168 be careful to ensure that the value with the .456 is around if the
2169 NV value is requested in the future).
2171 This means that if we cache such an IV, we need to cache the
2172 NV as well. Moreover, we trade speed for space, and do not
2173 cache the NV if we are sure it's not needed.
2176 /* SVt_PVNV is one higher than SVt_PVIV, hence this order */
2177 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2178 == IS_NUMBER_IN_UV) {
2179 /* It's definitely an integer, only upgrade to PVIV */
2180 if (SvTYPE(sv) < SVt_PVIV)
2181 sv_upgrade(sv, SVt_PVIV);
2183 } else if (SvTYPE(sv) < SVt_PVNV)
2184 sv_upgrade(sv, SVt_PVNV);
2186 /* If NV preserves UV then we only use the UV value if we know that
2187 we aren't going to call atof() below. If NVs don't preserve UVs
2188 then the value returned may have more precision than atof() will
2189 return, even though value isn't perfectly accurate. */
2190 if ((numtype & (IS_NUMBER_IN_UV
2191 #ifdef NV_PRESERVES_UV
2194 )) == IS_NUMBER_IN_UV) {
2195 /* This won't turn off the public IOK flag if it was set above */
2196 (void)SvIOKp_on(sv);
2198 if (!(numtype & IS_NUMBER_NEG)) {
2200 if (value <= (UV)IV_MAX) {
2201 SvIVX(sv) = (IV)value;
2207 /* 2s complement assumption */
2208 if (value <= (UV)IV_MIN) {
2209 SvIVX(sv) = -(IV)value;
2211 /* Too negative for an IV. This is a double upgrade, but
2212 I'm assuming it will be rare. */
2213 if (SvTYPE(sv) < SVt_PVNV)
2214 sv_upgrade(sv, SVt_PVNV);
2218 SvNVX(sv) = -(NV)value;
2223 /* For !NV_PRESERVES_UV and IS_NUMBER_IN_UV and IS_NUMBER_NOT_INT we
2224 will be in the previous block to set the IV slot, and the next
2225 block to set the NV slot. So no else here. */
2227 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2228 != IS_NUMBER_IN_UV) {
2229 /* It wasn't an (integer that doesn't overflow the UV). */
2230 SvNVX(sv) = Atof(SvPVX(sv));
2232 if (! numtype && ckWARN(WARN_NUMERIC))
2235 #if defined(USE_LONG_DOUBLE)
2236 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2iv(%" PERL_PRIgldbl ")\n",
2237 PTR2UV(sv), SvNVX(sv)));
2239 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2iv(%"NVgf")\n",
2240 PTR2UV(sv), SvNVX(sv)));
2244 #ifdef NV_PRESERVES_UV
2245 (void)SvIOKp_on(sv);
2247 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2248 SvIVX(sv) = I_V(SvNVX(sv));
2249 if ((NV)(SvIVX(sv)) == SvNVX(sv)) {
2252 /* Integer is imprecise. NOK, IOKp */
2254 /* UV will not work better than IV */
2256 if (SvNVX(sv) > (NV)UV_MAX) {
2258 /* Integer is inaccurate. NOK, IOKp, is UV */
2262 SvUVX(sv) = U_V(SvNVX(sv));
2263 /* 0xFFFFFFFFFFFFFFFF not an issue in here */
2264 if ((NV)(SvUVX(sv)) == SvNVX(sv)) {
2268 /* Integer is imprecise. NOK, IOKp, is UV */
2274 #else /* NV_PRESERVES_UV */
2275 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2276 == (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT)) {
2277 /* The IV slot will have been set from value returned by
2278 grok_number above. The NV slot has just been set using
2281 assert (SvIOKp(sv));
2283 if (((UV)1 << NV_PRESERVES_UV_BITS) >
2284 U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))) {
2285 /* Small enough to preserve all bits. */
2286 (void)SvIOKp_on(sv);
2288 SvIVX(sv) = I_V(SvNVX(sv));
2289 if ((NV)(SvIVX(sv)) == SvNVX(sv))
2291 /* Assumption: first non-preserved integer is < IV_MAX,
2292 this NV is in the preserved range, therefore: */
2293 if (!(U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))
2295 Perl_croak(aTHX_ "sv_2iv assumed (U_V(fabs((double)SvNVX(sv))) < (UV)IV_MAX) but SvNVX(sv)=%"NVgf" U_V is 0x%"UVxf", IV_MAX is 0x%"UVxf"\n", SvNVX(sv), U_V(SvNVX(sv)), (UV)IV_MAX);
2299 0 0 already failed to read UV.
2300 0 1 already failed to read UV.
2301 1 0 you won't get here in this case. IV/UV
2302 slot set, public IOK, Atof() unneeded.
2303 1 1 already read UV.
2304 so there's no point in sv_2iuv_non_preserve() attempting
2305 to use atol, strtol, strtoul etc. */
2306 if (sv_2iuv_non_preserve (sv, numtype)
2307 >= IS_NUMBER_OVERFLOW_IV)
2311 #endif /* NV_PRESERVES_UV */
2314 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing && !(SvFLAGS(sv) & SVs_PADTMP))
2316 if (SvTYPE(sv) < SVt_IV)
2317 /* Typically the caller expects that sv_any is not NULL now. */
2318 sv_upgrade(sv, SVt_IV);
2321 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2iv(%"IVdf")\n",
2322 PTR2UV(sv),SvIVX(sv)));
2323 return SvIsUV(sv) ? (IV)SvUVX(sv) : SvIVX(sv);
2329 Return the unsigned integer value of an SV, doing any necessary string
2330 conversion, magic etc. Normally used via the C<SvUV(sv)> and C<SvUVx(sv)>
2337 Perl_sv_2uv(pTHX_ register SV *sv)
2341 if (SvGMAGICAL(sv)) {
2346 return U_V(SvNVX(sv));
2347 if (SvPOKp(sv) && SvLEN(sv))
2350 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
2351 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
2357 if (SvTHINKFIRST(sv)) {
2360 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv,numer)) &&
2361 (!SvROK(tmpstr) || (SvRV(tmpstr) != SvRV(sv))))
2362 return SvUV(tmpstr);
2363 return PTR2UV(SvRV(sv));
2366 sv_force_normal_flags(sv, 0);
2368 if (SvREADONLY(sv) && !SvOK(sv)) {
2369 if (ckWARN(WARN_UNINITIALIZED))
2379 return (UV)SvIVX(sv);
2383 /* erm. not sure. *should* never get NOKp (without NOK) from sv_2nv
2384 * without also getting a cached IV/UV from it at the same time
2385 * (ie PV->NV conversion should detect loss of accuracy and cache
2386 * IV or UV at same time to avoid this. */
2387 /* IV-over-UV optimisation - choose to cache IV if possible */
2389 if (SvTYPE(sv) == SVt_NV)
2390 sv_upgrade(sv, SVt_PVNV);
2392 (void)SvIOKp_on(sv); /* Must do this first, to clear any SvOOK */
2393 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2394 SvIVX(sv) = I_V(SvNVX(sv));
2395 if (SvNVX(sv) == (NV) SvIVX(sv)
2396 #ifndef NV_PRESERVES_UV
2397 && (((UV)1 << NV_PRESERVES_UV_BITS) >
2398 (UV)(SvIVX(sv) > 0 ? SvIVX(sv) : -SvIVX(sv)))
2399 /* Don't flag it as "accurately an integer" if the number
2400 came from a (by definition imprecise) NV operation, and
2401 we're outside the range of NV integer precision */
2404 SvIOK_on(sv); /* Can this go wrong with rounding? NWC */
2405 DEBUG_c(PerlIO_printf(Perl_debug_log,
2406 "0x%"UVxf" uv(%"NVgf" => %"IVdf") (precise)\n",
2412 /* IV not precise. No need to convert from PV, as NV
2413 conversion would already have cached IV if it detected
2414 that PV->IV would be better than PV->NV->IV
2415 flags already correct - don't set public IOK. */
2416 DEBUG_c(PerlIO_printf(Perl_debug_log,
2417 "0x%"UVxf" uv(%"NVgf" => %"IVdf") (imprecise)\n",
2422 /* Can the above go wrong if SvIVX == IV_MIN and SvNVX < IV_MIN,
2423 but the cast (NV)IV_MIN rounds to a the value less (more
2424 negative) than IV_MIN which happens to be equal to SvNVX ??
2425 Analogous to 0xFFFFFFFFFFFFFFFF rounding up to NV (2**64) and
2426 NV rounding back to 0xFFFFFFFFFFFFFFFF, so UVX == UV(NVX) and
2427 (NV)UVX == NVX are both true, but the values differ. :-(
2428 Hopefully for 2s complement IV_MIN is something like
2429 0x8000000000000000 which will be exact. NWC */
2432 SvUVX(sv) = U_V(SvNVX(sv));
2434 (SvNVX(sv) == (NV) SvUVX(sv))
2435 #ifndef NV_PRESERVES_UV
2436 /* Make sure it's not 0xFFFFFFFFFFFFFFFF */
2437 /*&& (SvUVX(sv) != UV_MAX) irrelevant with code below */
2438 && (((UV)1 << NV_PRESERVES_UV_BITS) > SvUVX(sv))
2439 /* Don't flag it as "accurately an integer" if the number
2440 came from a (by definition imprecise) NV operation, and
2441 we're outside the range of NV integer precision */
2446 DEBUG_c(PerlIO_printf(Perl_debug_log,
2447 "0x%"UVxf" 2uv(%"UVuf" => %"IVdf") (as unsigned)\n",
2453 else if (SvPOKp(sv) && SvLEN(sv)) {
2455 int numtype = grok_number(SvPVX(sv), SvCUR(sv), &value);
2457 /* We want to avoid a possible problem when we cache a UV which
2458 may be later translated to an NV, and the resulting NV is not
2459 the translation of the initial data.
2461 This means that if we cache such a UV, we need to cache the
2462 NV as well. Moreover, we trade speed for space, and do not
2463 cache the NV if not needed.
2466 /* SVt_PVNV is one higher than SVt_PVIV, hence this order */
2467 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2468 == IS_NUMBER_IN_UV) {
2469 /* It's definitely an integer, only upgrade to PVIV */
2470 if (SvTYPE(sv) < SVt_PVIV)
2471 sv_upgrade(sv, SVt_PVIV);
2473 } else if (SvTYPE(sv) < SVt_PVNV)
2474 sv_upgrade(sv, SVt_PVNV);
2476 /* If NV preserves UV then we only use the UV value if we know that
2477 we aren't going to call atof() below. If NVs don't preserve UVs
2478 then the value returned may have more precision than atof() will
2479 return, even though it isn't accurate. */
2480 if ((numtype & (IS_NUMBER_IN_UV
2481 #ifdef NV_PRESERVES_UV
2484 )) == IS_NUMBER_IN_UV) {
2485 /* This won't turn off the public IOK flag if it was set above */
2486 (void)SvIOKp_on(sv);
2488 if (!(numtype & IS_NUMBER_NEG)) {
2490 if (value <= (UV)IV_MAX) {
2491 SvIVX(sv) = (IV)value;
2493 /* it didn't overflow, and it was positive. */
2498 /* 2s complement assumption */
2499 if (value <= (UV)IV_MIN) {
2500 SvIVX(sv) = -(IV)value;
2502 /* Too negative for an IV. This is a double upgrade, but
2503 I'm assuming it will be rare. */
2504 if (SvTYPE(sv) < SVt_PVNV)
2505 sv_upgrade(sv, SVt_PVNV);
2509 SvNVX(sv) = -(NV)value;
2515 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2516 != IS_NUMBER_IN_UV) {
2517 /* It wasn't an integer, or it overflowed the UV. */
2518 SvNVX(sv) = Atof(SvPVX(sv));
2520 if (! numtype && ckWARN(WARN_NUMERIC))
2523 #if defined(USE_LONG_DOUBLE)
2524 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2uv(%" PERL_PRIgldbl ")\n",
2525 PTR2UV(sv), SvNVX(sv)));
2527 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2uv(%"NVgf")\n",
2528 PTR2UV(sv), SvNVX(sv)));
2531 #ifdef NV_PRESERVES_UV
2532 (void)SvIOKp_on(sv);
2534 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2535 SvIVX(sv) = I_V(SvNVX(sv));
2536 if ((NV)(SvIVX(sv)) == SvNVX(sv)) {
2539 /* Integer is imprecise. NOK, IOKp */
2541 /* UV will not work better than IV */
2543 if (SvNVX(sv) > (NV)UV_MAX) {
2545 /* Integer is inaccurate. NOK, IOKp, is UV */
2549 SvUVX(sv) = U_V(SvNVX(sv));
2550 /* 0xFFFFFFFFFFFFFFFF not an issue in here, NVs
2551 NV preservse UV so can do correct comparison. */
2552 if ((NV)(SvUVX(sv)) == SvNVX(sv)) {
2556 /* Integer is imprecise. NOK, IOKp, is UV */
2561 #else /* NV_PRESERVES_UV */
2562 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2563 == (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT)) {
2564 /* The UV slot will have been set from value returned by
2565 grok_number above. The NV slot has just been set using
2568 assert (SvIOKp(sv));
2570 if (((UV)1 << NV_PRESERVES_UV_BITS) >
2571 U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))) {
2572 /* Small enough to preserve all bits. */
2573 (void)SvIOKp_on(sv);
2575 SvIVX(sv) = I_V(SvNVX(sv));
2576 if ((NV)(SvIVX(sv)) == SvNVX(sv))
2578 /* Assumption: first non-preserved integer is < IV_MAX,
2579 this NV is in the preserved range, therefore: */
2580 if (!(U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))
2582 Perl_croak(aTHX_ "sv_2uv assumed (U_V(fabs((double)SvNVX(sv))) < (UV)IV_MAX) but SvNVX(sv)=%"NVgf" U_V is 0x%"UVxf", IV_MAX is 0x%"UVxf"\n", SvNVX(sv), U_V(SvNVX(sv)), (UV)IV_MAX);
2585 sv_2iuv_non_preserve (sv, numtype);
2587 #endif /* NV_PRESERVES_UV */
2591 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
2592 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
2595 if (SvTYPE(sv) < SVt_IV)
2596 /* Typically the caller expects that sv_any is not NULL now. */
2597 sv_upgrade(sv, SVt_IV);
2601 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2uv(%"UVuf")\n",
2602 PTR2UV(sv),SvUVX(sv)));
2603 return SvIsUV(sv) ? SvUVX(sv) : (UV)SvIVX(sv);
2609 Return the num value of an SV, doing any necessary string or integer
2610 conversion, magic etc. Normally used via the C<SvNV(sv)> and C<SvNVx(sv)>
2617 Perl_sv_2nv(pTHX_ register SV *sv)
2621 if (SvGMAGICAL(sv)) {
2625 if (SvPOKp(sv) && SvLEN(sv)) {
2626 if (ckWARN(WARN_NUMERIC) && !SvIOKp(sv) &&
2627 !grok_number(SvPVX(sv), SvCUR(sv), NULL))
2629 return Atof(SvPVX(sv));
2633 return (NV)SvUVX(sv);
2635 return (NV)SvIVX(sv);
2638 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
2639 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
2645 if (SvTHINKFIRST(sv)) {
2648 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv,numer)) &&
2649 (!SvROK(tmpstr) || (SvRV(tmpstr) != SvRV(sv))))
2650 return SvNV(tmpstr);
2651 return PTR2NV(SvRV(sv));
2654 sv_force_normal_flags(sv, 0);
2656 if (SvREADONLY(sv) && !SvOK(sv)) {
2657 if (ckWARN(WARN_UNINITIALIZED))
2662 if (SvTYPE(sv) < SVt_NV) {
2663 if (SvTYPE(sv) == SVt_IV)
2664 sv_upgrade(sv, SVt_PVNV);
2666 sv_upgrade(sv, SVt_NV);
2667 #ifdef USE_LONG_DOUBLE
2669 STORE_NUMERIC_LOCAL_SET_STANDARD();
2670 PerlIO_printf(Perl_debug_log,
2671 "0x%"UVxf" num(%" PERL_PRIgldbl ")\n",
2672 PTR2UV(sv), SvNVX(sv));
2673 RESTORE_NUMERIC_LOCAL();
2677 STORE_NUMERIC_LOCAL_SET_STANDARD();
2678 PerlIO_printf(Perl_debug_log, "0x%"UVxf" num(%"NVgf")\n",
2679 PTR2UV(sv), SvNVX(sv));
2680 RESTORE_NUMERIC_LOCAL();
2684 else if (SvTYPE(sv) < SVt_PVNV)
2685 sv_upgrade(sv, SVt_PVNV);
2690 SvNVX(sv) = SvIsUV(sv) ? (NV)SvUVX(sv) : (NV)SvIVX(sv);
2691 #ifdef NV_PRESERVES_UV
2694 /* Only set the public NV OK flag if this NV preserves the IV */
2695 /* Check it's not 0xFFFFFFFFFFFFFFFF */
2696 if (SvIsUV(sv) ? ((SvUVX(sv) != UV_MAX)&&(SvUVX(sv) == U_V(SvNVX(sv))))
2697 : (SvIVX(sv) == I_V(SvNVX(sv))))
2703 else if (SvPOKp(sv) && SvLEN(sv)) {
2705 int numtype = grok_number(SvPVX(sv), SvCUR(sv), &value);
2706 if (ckWARN(WARN_NUMERIC) && !SvIOKp(sv) && !numtype)
2708 #ifdef NV_PRESERVES_UV
2709 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2710 == IS_NUMBER_IN_UV) {
2711 /* It's definitely an integer */
2712 SvNVX(sv) = (numtype & IS_NUMBER_NEG) ? -(NV)value : (NV)value;
2714 SvNVX(sv) = Atof(SvPVX(sv));
2717 SvNVX(sv) = Atof(SvPVX(sv));
2718 /* Only set the public NV OK flag if this NV preserves the value in
2719 the PV at least as well as an IV/UV would.
2720 Not sure how to do this 100% reliably. */
2721 /* if that shift count is out of range then Configure's test is
2722 wonky. We shouldn't be in here with NV_PRESERVES_UV_BITS ==
2724 if (((UV)1 << NV_PRESERVES_UV_BITS) >
2725 U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))) {
2726 SvNOK_on(sv); /* Definitely small enough to preserve all bits */
2727 } else if (!(numtype & IS_NUMBER_IN_UV)) {
2728 /* Can't use strtol etc to convert this string, so don't try.
2729 sv_2iv and sv_2uv will use the NV to convert, not the PV. */
2732 /* value has been set. It may not be precise. */
2733 if ((numtype & IS_NUMBER_NEG) && (value > (UV)IV_MIN)) {
2734 /* 2s complement assumption for (UV)IV_MIN */
2735 SvNOK_on(sv); /* Integer is too negative. */
2740 if (numtype & IS_NUMBER_NEG) {
2741 SvIVX(sv) = -(IV)value;
2742 } else if (value <= (UV)IV_MAX) {
2743 SvIVX(sv) = (IV)value;
2749 if (numtype & IS_NUMBER_NOT_INT) {
2750 /* I believe that even if the original PV had decimals,
2751 they are lost beyond the limit of the FP precision.
2752 However, neither is canonical, so both only get p
2753 flags. NWC, 2000/11/25 */
2754 /* Both already have p flags, so do nothing */
2757 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2758 if (SvIVX(sv) == I_V(nv)) {
2763 /* It had no "." so it must be integer. */
2766 /* between IV_MAX and NV(UV_MAX).
2767 Could be slightly > UV_MAX */
2769 if (numtype & IS_NUMBER_NOT_INT) {
2770 /* UV and NV both imprecise. */
2772 UV nv_as_uv = U_V(nv);
2774 if (value == nv_as_uv && SvUVX(sv) != UV_MAX) {
2785 #endif /* NV_PRESERVES_UV */
2788 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing && !(SvFLAGS(sv) & SVs_PADTMP))
2790 if (SvTYPE(sv) < SVt_NV)
2791 /* Typically the caller expects that sv_any is not NULL now. */
2792 /* XXX Ilya implies that this is a bug in callers that assume this
2793 and ideally should be fixed. */
2794 sv_upgrade(sv, SVt_NV);
2797 #if defined(USE_LONG_DOUBLE)
2799 STORE_NUMERIC_LOCAL_SET_STANDARD();
2800 PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2nv(%" PERL_PRIgldbl ")\n",
2801 PTR2UV(sv), SvNVX(sv));
2802 RESTORE_NUMERIC_LOCAL();
2806 STORE_NUMERIC_LOCAL_SET_STANDARD();
2807 PerlIO_printf(Perl_debug_log, "0x%"UVxf" 1nv(%"NVgf")\n",
2808 PTR2UV(sv), SvNVX(sv));
2809 RESTORE_NUMERIC_LOCAL();
2815 /* asIV(): extract an integer from the string value of an SV.
2816 * Caller must validate PVX */
2819 S_asIV(pTHX_ SV *sv)
2822 int numtype = grok_number(SvPVX(sv), SvCUR(sv), &value);
2824 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2825 == IS_NUMBER_IN_UV) {
2826 /* It's definitely an integer */
2827 if (numtype & IS_NUMBER_NEG) {
2828 if (value < (UV)IV_MIN)
2831 if (value < (UV)IV_MAX)
2836 if (ckWARN(WARN_NUMERIC))
2839 return I_V(Atof(SvPVX(sv)));
2842 /* asUV(): extract an unsigned integer from the string value of an SV
2843 * Caller must validate PVX */
2846 S_asUV(pTHX_ SV *sv)
2849 int numtype = grok_number(SvPVX(sv), SvCUR(sv), &value);
2851 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2852 == IS_NUMBER_IN_UV) {
2853 /* It's definitely an integer */
2854 if (!(numtype & IS_NUMBER_NEG))
2858 if (ckWARN(WARN_NUMERIC))
2861 return U_V(Atof(SvPVX(sv)));
2865 =for apidoc sv_2pv_nolen
2867 Like C<sv_2pv()>, but doesn't return the length too. You should usually
2868 use the macro wrapper C<SvPV_nolen(sv)> instead.
2873 Perl_sv_2pv_nolen(pTHX_ register SV *sv)
2876 return sv_2pv(sv, &n_a);
2879 /* uiv_2buf(): private routine for use by sv_2pv_flags(): print an IV or
2880 * UV as a string towards the end of buf, and return pointers to start and
2883 * We assume that buf is at least TYPE_CHARS(UV) long.
2887 uiv_2buf(char *buf, IV iv, UV uv, int is_uv, char **peob)
2889 char *ptr = buf + TYPE_CHARS(UV);
2903 *--ptr = '0' + (char)(uv % 10);
2911 /* sv_2pv() is now a macro using Perl_sv_2pv_flags();
2912 * this function provided for binary compatibility only
2916 Perl_sv_2pv(pTHX_ register SV *sv, STRLEN *lp)
2918 return sv_2pv_flags(sv, lp, SV_GMAGIC);
2922 =for apidoc sv_2pv_flags
2924 Returns a pointer to the string value of an SV, and sets *lp to its length.
2925 If flags includes SV_GMAGIC, does an mg_get() first. Coerces sv to a string
2927 Normally invoked via the C<SvPV_flags> macro. C<sv_2pv()> and C<sv_2pv_nomg>
2928 usually end up here too.
2934 Perl_sv_2pv_flags(pTHX_ register SV *sv, STRLEN *lp, I32 flags)
2939 char tbuf[64]; /* Must fit sprintf/Gconvert of longest IV/NV */
2940 char *tmpbuf = tbuf;
2946 if (SvGMAGICAL(sv)) {
2947 if (flags & SV_GMAGIC)
2955 (void)sprintf(tmpbuf,"%"UVuf, (UV)SvUVX(sv));
2957 (void)sprintf(tmpbuf,"%"IVdf, (IV)SvIVX(sv));
2962 Gconvert(SvNVX(sv), NV_DIG, 0, tmpbuf);
2967 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
2968 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
2975 if (SvTHINKFIRST(sv)) {
2978 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv,string)) &&
2979 (!SvROK(tmpstr) || (SvRV(tmpstr) != SvRV(sv)))) {
2980 char *pv = SvPV(tmpstr, *lp);
2994 switch (SvTYPE(sv)) {
2996 if ( ((SvFLAGS(sv) &
2997 (SVs_OBJECT|SVf_OK|SVs_GMG|SVs_SMG|SVs_RMG))
2998 == (SVs_OBJECT|SVs_SMG))
2999 && (mg = mg_find(sv, PERL_MAGIC_qr))) {
3000 regexp *re = (regexp *)mg->mg_obj;
3003 char *fptr = "msix";
3008 char need_newline = 0;
3009 U16 reganch = (U16)((re->reganch & PMf_COMPILETIME) >> 12);
3011 while((ch = *fptr++)) {
3013 reflags[left++] = ch;
3016 reflags[right--] = ch;
3021 reflags[left] = '-';
3025 mg->mg_len = re->prelen + 4 + left;
3027 * If /x was used, we have to worry about a regex
3028 * ending with a comment later being embedded
3029 * within another regex. If so, we don't want this
3030 * regex's "commentization" to leak out to the
3031 * right part of the enclosing regex, we must cap
3032 * it with a newline.
3034 * So, if /x was used, we scan backwards from the
3035 * end of the regex. If we find a '#' before we
3036 * find a newline, we need to add a newline
3037 * ourself. If we find a '\n' first (or if we
3038 * don't find '#' or '\n'), we don't need to add
3039 * anything. -jfriedl
3041 if (PMf_EXTENDED & re->reganch)
3043 char *endptr = re->precomp + re->prelen;
3044 while (endptr >= re->precomp)
3046 char c = *(endptr--);
3048 break; /* don't need another */
3050 /* we end while in a comment, so we
3052 mg->mg_len++; /* save space for it */
3053 need_newline = 1; /* note to add it */
3059 New(616, mg->mg_ptr, mg->mg_len + 1 + left, char);
3060 Copy("(?", mg->mg_ptr, 2, char);
3061 Copy(reflags, mg->mg_ptr+2, left, char);
3062 Copy(":", mg->mg_ptr+left+2, 1, char);
3063 Copy(re->precomp, mg->mg_ptr+3+left, re->prelen, char);
3065 mg->mg_ptr[mg->mg_len - 2] = '\n';
3066 mg->mg_ptr[mg->mg_len - 1] = ')';
3067 mg->mg_ptr[mg->mg_len] = 0;
3069 PL_reginterp_cnt += re->program[0].next_off;
3071 if (re->reganch & ROPT_UTF8)
3086 case SVt_PVBM: if (SvROK(sv))
3089 s = "SCALAR"; break;
3090 case SVt_PVLV: s = SvROK(sv) ? "REF":"LVALUE"; break;
3091 case SVt_PVAV: s = "ARRAY"; break;
3092 case SVt_PVHV: s = "HASH"; break;
3093 case SVt_PVCV: s = "CODE"; break;
3094 case SVt_PVGV: s = "GLOB"; break;
3095 case SVt_PVFM: s = "FORMAT"; break;
3096 case SVt_PVIO: s = "IO"; break;
3097 default: s = "UNKNOWN"; break;
3101 if (HvNAME(SvSTASH(sv)))
3102 Perl_sv_setpvf(aTHX_ tsv, "%s=%s", HvNAME(SvSTASH(sv)), s);
3104 Perl_sv_setpvf(aTHX_ tsv, "__ANON__=%s", s);
3107 Perl_sv_catpvf(aTHX_ tsv, "(0x%"UVxf")", PTR2UV(sv));
3113 if (SvREADONLY(sv) && !SvOK(sv)) {
3114 if (ckWARN(WARN_UNINITIALIZED))
3120 if (SvIOK(sv) || ((SvIOKp(sv) && !SvNOKp(sv)))) {
3121 /* I'm assuming that if both IV and NV are equally valid then
3122 converting the IV is going to be more efficient */
3123 U32 isIOK = SvIOK(sv);
3124 U32 isUIOK = SvIsUV(sv);
3125 char buf[TYPE_CHARS(UV)];
3128 if (SvTYPE(sv) < SVt_PVIV)
3129 sv_upgrade(sv, SVt_PVIV);
3131 ptr = uiv_2buf(buf, 0, SvUVX(sv), 1, &ebuf);
3133 ptr = uiv_2buf(buf, SvIVX(sv), 0, 0, &ebuf);
3134 SvGROW(sv, (STRLEN)(ebuf - ptr + 1)); /* inlined from sv_setpvn */
3135 Move(ptr,SvPVX(sv),ebuf - ptr,char);
3136 SvCUR_set(sv, ebuf - ptr);
3146 else if (SvNOKp(sv)) {
3147 if (SvTYPE(sv) < SVt_PVNV)
3148 sv_upgrade(sv, SVt_PVNV);
3149 /* The +20 is pure guesswork. Configure test needed. --jhi */
3150 SvGROW(sv, NV_DIG + 20);
3152 olderrno = errno; /* some Xenix systems wipe out errno here */
3154 if (SvNVX(sv) == 0.0)
3155 (void)strcpy(s,"0");
3159 Gconvert(SvNVX(sv), NV_DIG, 0, s);
3162 #ifdef FIXNEGATIVEZERO
3163 if (*s == '-' && s[1] == '0' && !s[2])
3173 if (ckWARN(WARN_UNINITIALIZED)
3174 && !PL_localizing && !(SvFLAGS(sv) & SVs_PADTMP))
3177 if (SvTYPE(sv) < SVt_PV)
3178 /* Typically the caller expects that sv_any is not NULL now. */
3179 sv_upgrade(sv, SVt_PV);
3182 *lp = s - SvPVX(sv);
3185 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2pv(%s)\n",
3186 PTR2UV(sv),SvPVX(sv)));
3190 if (SvROK(sv)) { /* XXX Skip this when sv_pvn_force calls */
3191 /* Sneaky stuff here */
3195 tsv = newSVpv(tmpbuf, 0);
3211 len = strlen(tmpbuf);
3213 #ifdef FIXNEGATIVEZERO
3214 if (len == 2 && t[0] == '-' && t[1] == '0') {
3219 (void)SvUPGRADE(sv, SVt_PV);
3221 s = SvGROW(sv, len + 1);
3230 =for apidoc sv_copypv
3232 Copies a stringified representation of the source SV into the
3233 destination SV. Automatically performs any necessary mg_get and
3234 coercion of numeric values into strings. Guaranteed to preserve
3235 UTF-8 flag even from overloaded objects. Similar in nature to
3236 sv_2pv[_flags] but operates directly on an SV instead of just the
3237 string. Mostly uses sv_2pv_flags to do its work, except when that
3238 would lose the UTF-8'ness of the PV.
3244 Perl_sv_copypv(pTHX_ SV *dsv, register SV *ssv)
3249 sv_setpvn(dsv,s,len);
3257 =for apidoc sv_2pvbyte_nolen
3259 Return a pointer to the byte-encoded representation of the SV.
3260 May cause the SV to be downgraded from UTF8 as a side-effect.
3262 Usually accessed via the C<SvPVbyte_nolen> macro.
3268 Perl_sv_2pvbyte_nolen(pTHX_ register SV *sv)
3271 return sv_2pvbyte(sv, &n_a);
3275 =for apidoc sv_2pvbyte
3277 Return a pointer to the byte-encoded representation of the SV, and set *lp
3278 to its length. May cause the SV to be downgraded from UTF8 as a
3281 Usually accessed via the C<SvPVbyte> macro.
3287 Perl_sv_2pvbyte(pTHX_ register SV *sv, STRLEN *lp)
3289 sv_utf8_downgrade(sv,0);
3290 return SvPV(sv,*lp);
3294 =for apidoc sv_2pvutf8_nolen
3296 Return a pointer to the UTF8-encoded representation of the SV.
3297 May cause the SV to be upgraded to UTF8 as a side-effect.
3299 Usually accessed via the C<SvPVutf8_nolen> macro.
3305 Perl_sv_2pvutf8_nolen(pTHX_ register SV *sv)
3308 return sv_2pvutf8(sv, &n_a);
3312 =for apidoc sv_2pvutf8
3314 Return a pointer to the UTF8-encoded representation of the SV, and set *lp
3315 to its length. May cause the SV to be upgraded to UTF8 as a side-effect.
3317 Usually accessed via the C<SvPVutf8> macro.
3323 Perl_sv_2pvutf8(pTHX_ register SV *sv, STRLEN *lp)
3325 sv_utf8_upgrade(sv);
3326 return SvPV(sv,*lp);
3330 =for apidoc sv_2bool
3332 This function is only called on magical items, and is only used by
3333 sv_true() or its macro equivalent.
3339 Perl_sv_2bool(pTHX_ register SV *sv)
3348 if (SvAMAGIC(sv) && (tmpsv=AMG_CALLun(sv,bool_)) &&
3349 (!SvROK(tmpsv) || (SvRV(tmpsv) != SvRV(sv))))
3350 return (bool)SvTRUE(tmpsv);
3351 return SvRV(sv) != 0;
3354 register XPV* Xpvtmp;
3355 if ((Xpvtmp = (XPV*)SvANY(sv)) &&
3356 (*Xpvtmp->xpv_pv > '0' ||
3357 Xpvtmp->xpv_cur > 1 ||
3358 (Xpvtmp->xpv_cur && *Xpvtmp->xpv_pv != '0')))
3365 return SvIVX(sv) != 0;
3368 return SvNVX(sv) != 0.0;
3375 /* sv_utf8_upgrade() is now a macro using sv_utf8_upgrade_flags();
3376 * this function provided for binary compatibility only
3381 Perl_sv_utf8_upgrade(pTHX_ register SV *sv)
3383 return sv_utf8_upgrade_flags(sv, SV_GMAGIC);
3387 =for apidoc sv_utf8_upgrade
3389 Convert the PV of an SV to its UTF8-encoded form.
3390 Forces the SV to string form if it is not already.
3391 Always sets the SvUTF8 flag to avoid future validity checks even
3392 if all the bytes have hibit clear.
3394 This is not as a general purpose byte encoding to Unicode interface:
3395 use the Encode extension for that.
3397 =for apidoc sv_utf8_upgrade_flags
3399 Convert the PV of an SV to its UTF8-encoded form.
3400 Forces the SV to string form if it is not already.
3401 Always sets the SvUTF8 flag to avoid future validity checks even
3402 if all the bytes have hibit clear. If C<flags> has C<SV_GMAGIC> bit set,
3403 will C<mg_get> on C<sv> if appropriate, else not. C<sv_utf8_upgrade> and
3404 C<sv_utf8_upgrade_nomg> are implemented in terms of this function.
3406 This is not as a general purpose byte encoding to Unicode interface:
3407 use the Encode extension for that.
3413 Perl_sv_utf8_upgrade_flags(pTHX_ register SV *sv, I32 flags)
3423 (void) sv_2pv_flags(sv,&len, flags);
3432 sv_force_normal_flags(sv, 0);
3435 if (PL_encoding && !(flags & SV_UTF8_NO_ENCODING))
3436 sv_recode_to_utf8(sv, PL_encoding);
3437 else { /* Assume Latin-1/EBCDIC */
3438 /* This function could be much more efficient if we
3439 * had a FLAG in SVs to signal if there are any hibit
3440 * chars in the PV. Given that there isn't such a flag
3441 * make the loop as fast as possible. */
3442 s = (U8 *) SvPVX(sv);
3443 e = (U8 *) SvEND(sv);
3447 if ((hibit = !NATIVE_IS_INVARIANT(ch)))
3453 len = SvCUR(sv) + 1; /* Plus the \0 */
3454 SvPVX(sv) = (char*)bytes_to_utf8((U8*)s, &len);
3455 SvCUR(sv) = len - 1;
3457 Safefree(s); /* No longer using what was there before. */
3458 SvLEN(sv) = len; /* No longer know the real size. */
3460 /* Mark as UTF-8 even if no hibit - saves scanning loop */
3467 =for apidoc sv_utf8_downgrade
3469 Attempt to convert the PV of an SV from UTF8-encoded to byte encoding.
3470 This may not be possible if the PV contains non-byte encoding characters;
3471 if this is the case, either returns false or, if C<fail_ok> is not
3474 This is not as a general purpose Unicode to byte encoding interface:
3475 use the Encode extension for that.
3481 Perl_sv_utf8_downgrade(pTHX_ register SV* sv, bool fail_ok)
3483 if (SvPOK(sv) && SvUTF8(sv)) {
3489 sv_force_normal_flags(sv, 0);
3491 s = (U8 *) SvPV(sv, len);
3492 if (!utf8_to_bytes(s, &len)) {
3497 Perl_croak(aTHX_ "Wide character in %s",
3500 Perl_croak(aTHX_ "Wide character");
3511 =for apidoc sv_utf8_encode
3513 Convert the PV of an SV to UTF8-encoded, but then turn off the C<SvUTF8>
3514 flag so that it looks like octets again. Used as a building block
3515 for encode_utf8 in Encode.xs
3521 Perl_sv_utf8_encode(pTHX_ register SV *sv)
3523 (void) sv_utf8_upgrade(sv);
3528 =for apidoc sv_utf8_decode
3530 Convert the octets in the PV from UTF-8 to chars. Scan for validity and then
3531 turn off SvUTF8 if needed so that we see characters. Used as a building block
3532 for decode_utf8 in Encode.xs
3538 Perl_sv_utf8_decode(pTHX_ register SV *sv)
3544 /* The octets may have got themselves encoded - get them back as
3547 if (!sv_utf8_downgrade(sv, TRUE))
3550 /* it is actually just a matter of turning the utf8 flag on, but
3551 * we want to make sure everything inside is valid utf8 first.
3553 c = (U8 *) SvPVX(sv);
3554 if (!is_utf8_string(c, SvCUR(sv)+1))
3556 e = (U8 *) SvEND(sv);
3559 if (!UTF8_IS_INVARIANT(ch)) {
3568 /* sv_setsv() is now a macro using Perl_sv_setsv_flags();
3569 * this function provided for binary compatibility only
3573 Perl_sv_setsv(pTHX_ SV *dstr, register SV *sstr)
3575 sv_setsv_flags(dstr, sstr, SV_GMAGIC);
3579 =for apidoc sv_setsv
3581 Copies the contents of the source SV C<ssv> into the destination SV
3582 C<dsv>. The source SV may be destroyed if it is mortal, so don't use this
3583 function if the source SV needs to be reused. Does not handle 'set' magic.
3584 Loosely speaking, it performs a copy-by-value, obliterating any previous
3585 content of the destination.
3587 You probably want to use one of the assortment of wrappers, such as
3588 C<SvSetSV>, C<SvSetSV_nosteal>, C<SvSetMagicSV> and
3589 C<SvSetMagicSV_nosteal>.
3591 =for apidoc sv_setsv_flags
3593 Copies the contents of the source SV C<ssv> into the destination SV
3594 C<dsv>. The source SV may be destroyed if it is mortal, so don't use this
3595 function if the source SV needs to be reused. Does not handle 'set' magic.
3596 Loosely speaking, it performs a copy-by-value, obliterating any previous
3597 content of the destination.
3598 If the C<flags> parameter has the C<SV_GMAGIC> bit set, will C<mg_get> on
3599 C<ssv> if appropriate, else not. C<sv_setsv> and C<sv_setsv_nomg> are
3600 implemented in terms of this function.
3602 You probably want to use one of the assortment of wrappers, such as
3603 C<SvSetSV>, C<SvSetSV_nosteal>, C<SvSetMagicSV> and
3604 C<SvSetMagicSV_nosteal>.
3606 This is the primary function for copying scalars, and most other
3607 copy-ish functions and macros use this underneath.
3613 Perl_sv_setsv_flags(pTHX_ SV *dstr, register SV *sstr, I32 flags)
3615 register U32 sflags;
3621 SV_CHECK_THINKFIRST_COW_DROP(dstr);
3623 sstr = &PL_sv_undef;
3624 stype = SvTYPE(sstr);
3625 dtype = SvTYPE(dstr);
3630 /* need to nuke the magic */
3632 SvRMAGICAL_off(dstr);
3635 /* There's a lot of redundancy below but we're going for speed here */
3640 if (dtype != SVt_PVGV) {
3641 (void)SvOK_off(dstr);
3649 sv_upgrade(dstr, SVt_IV);
3652 sv_upgrade(dstr, SVt_PVNV);
3656 sv_upgrade(dstr, SVt_PVIV);
3659 (void)SvIOK_only(dstr);
3660 SvIVX(dstr) = SvIVX(sstr);
3663 if (SvTAINTED(sstr))
3674 sv_upgrade(dstr, SVt_NV);
3679 sv_upgrade(dstr, SVt_PVNV);
3682 SvNVX(dstr) = SvNVX(sstr);
3683 (void)SvNOK_only(dstr);
3684 if (SvTAINTED(sstr))
3692 sv_upgrade(dstr, SVt_RV);
3693 else if (dtype == SVt_PVGV &&
3694 SvROK(sstr) && SvTYPE(SvRV(sstr)) == SVt_PVGV) {
3697 if (GvIMPORTED(dstr) != GVf_IMPORTED
3698 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3700 GvIMPORTED_on(dstr);
3709 #ifdef PERL_COPY_ON_WRITE
3710 if ((SvFLAGS(sstr) & CAN_COW_MASK) == CAN_COW_FLAGS) {
3711 if (dtype < SVt_PVIV)
3712 sv_upgrade(dstr, SVt_PVIV);
3719 sv_upgrade(dstr, SVt_PV);
3722 if (dtype < SVt_PVIV)
3723 sv_upgrade(dstr, SVt_PVIV);
3726 if (dtype < SVt_PVNV)
3727 sv_upgrade(dstr, SVt_PVNV);
3734 Perl_croak(aTHX_ "Bizarre copy of %s in %s", sv_reftype(sstr, 0),
3737 Perl_croak(aTHX_ "Bizarre copy of %s", sv_reftype(sstr, 0));
3741 if (dtype <= SVt_PVGV) {
3743 if (dtype != SVt_PVGV) {
3744 char *name = GvNAME(sstr);
3745 STRLEN len = GvNAMELEN(sstr);
3746 sv_upgrade(dstr, SVt_PVGV);
3747 sv_magic(dstr, dstr, PERL_MAGIC_glob, Nullch, 0);
3748 GvSTASH(dstr) = (HV*)SvREFCNT_inc(GvSTASH(sstr));
3749 GvNAME(dstr) = savepvn(name, len);
3750 GvNAMELEN(dstr) = len;
3751 SvFAKE_on(dstr); /* can coerce to non-glob */
3753 /* ahem, death to those who redefine active sort subs */
3754 else if (PL_curstackinfo->si_type == PERLSI_SORT
3755 && GvCV(dstr) && PL_sortcop == CvSTART(GvCV(dstr)))
3756 Perl_croak(aTHX_ "Can't redefine active sort subroutine %s",
3759 #ifdef GV_UNIQUE_CHECK
3760 if (GvUNIQUE((GV*)dstr)) {
3761 Perl_croak(aTHX_ PL_no_modify);
3765 (void)SvOK_off(dstr);
3766 GvINTRO_off(dstr); /* one-shot flag */
3768 GvGP(dstr) = gp_ref(GvGP(sstr));
3769 if (SvTAINTED(sstr))
3771 if (GvIMPORTED(dstr) != GVf_IMPORTED
3772 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3774 GvIMPORTED_on(dstr);
3782 if (SvGMAGICAL(sstr) && (flags & SV_GMAGIC)) {
3784 if ((int)SvTYPE(sstr) != stype) {
3785 stype = SvTYPE(sstr);
3786 if (stype == SVt_PVGV && dtype <= SVt_PVGV)
3790 if (stype == SVt_PVLV)
3791 (void)SvUPGRADE(dstr, SVt_PVNV);
3793 (void)SvUPGRADE(dstr, (U32)stype);
3796 sflags = SvFLAGS(sstr);
3798 if (sflags & SVf_ROK) {
3799 if (dtype >= SVt_PV) {
3800 if (dtype == SVt_PVGV) {
3801 SV *sref = SvREFCNT_inc(SvRV(sstr));
3803 int intro = GvINTRO(dstr);
3805 #ifdef GV_UNIQUE_CHECK
3806 if (GvUNIQUE((GV*)dstr)) {
3807 Perl_croak(aTHX_ PL_no_modify);
3812 GvINTRO_off(dstr); /* one-shot flag */
3813 GvLINE(dstr) = CopLINE(PL_curcop);
3814 GvEGV(dstr) = (GV*)dstr;
3817 switch (SvTYPE(sref)) {
3820 SAVEGENERICSV(GvAV(dstr));
3822 dref = (SV*)GvAV(dstr);
3823 GvAV(dstr) = (AV*)sref;
3824 if (!GvIMPORTED_AV(dstr)
3825 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3827 GvIMPORTED_AV_on(dstr);
3832 SAVEGENERICSV(GvHV(dstr));
3834 dref = (SV*)GvHV(dstr);
3835 GvHV(dstr) = (HV*)sref;
3836 if (!GvIMPORTED_HV(dstr)
3837 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3839 GvIMPORTED_HV_on(dstr);
3844 if (GvCVGEN(dstr) && GvCV(dstr) != (CV*)sref) {
3845 SvREFCNT_dec(GvCV(dstr));
3846 GvCV(dstr) = Nullcv;
3847 GvCVGEN(dstr) = 0; /* Switch off cacheness. */
3848 PL_sub_generation++;
3850 SAVEGENERICSV(GvCV(dstr));
3853 dref = (SV*)GvCV(dstr);
3854 if (GvCV(dstr) != (CV*)sref) {
3855 CV* cv = GvCV(dstr);
3857 if (!GvCVGEN((GV*)dstr) &&
3858 (CvROOT(cv) || CvXSUB(cv)))
3860 /* ahem, death to those who redefine
3861 * active sort subs */
3862 if (PL_curstackinfo->si_type == PERLSI_SORT &&
3863 PL_sortcop == CvSTART(cv))
3865 "Can't redefine active sort subroutine %s",
3866 GvENAME((GV*)dstr));
3867 /* Redefining a sub - warning is mandatory if
3868 it was a const and its value changed. */
3869 if (ckWARN(WARN_REDEFINE)
3871 && (!CvCONST((CV*)sref)
3872 || sv_cmp(cv_const_sv(cv),
3873 cv_const_sv((CV*)sref)))))
3875 Perl_warner(aTHX_ packWARN(WARN_REDEFINE),
3877 ? "Constant subroutine %s::%s redefined"
3878 : "Subroutine %s::%s redefined",
3879 HvNAME(GvSTASH((GV*)dstr)),
3880 GvENAME((GV*)dstr));
3884 cv_ckproto(cv, (GV*)dstr,
3885 SvPOK(sref) ? SvPVX(sref) : Nullch);
3887 GvCV(dstr) = (CV*)sref;
3888 GvCVGEN(dstr) = 0; /* Switch off cacheness. */
3889 GvASSUMECV_on(dstr);
3890 PL_sub_generation++;
3892 if (!GvIMPORTED_CV(dstr)
3893 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3895 GvIMPORTED_CV_on(dstr);
3900 SAVEGENERICSV(GvIOp(dstr));
3902 dref = (SV*)GvIOp(dstr);
3903 GvIOp(dstr) = (IO*)sref;
3907 SAVEGENERICSV(GvFORM(dstr));
3909 dref = (SV*)GvFORM(dstr);
3910 GvFORM(dstr) = (CV*)sref;
3914 SAVEGENERICSV(GvSV(dstr));
3916 dref = (SV*)GvSV(dstr);
3918 if (!GvIMPORTED_SV(dstr)
3919 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3921 GvIMPORTED_SV_on(dstr);
3927 if (SvTAINTED(sstr))
3932 (void)SvOOK_off(dstr); /* backoff */
3934 Safefree(SvPVX(dstr));
3935 SvLEN(dstr)=SvCUR(dstr)=0;
3938 (void)SvOK_off(dstr);
3939 SvRV(dstr) = SvREFCNT_inc(SvRV(sstr));
3941 if (sflags & SVp_NOK) {
3943 /* Only set the public OK flag if the source has public OK. */
3944 if (sflags & SVf_NOK)
3945 SvFLAGS(dstr) |= SVf_NOK;
3946 SvNVX(dstr) = SvNVX(sstr);
3948 if (sflags & SVp_IOK) {
3949 (void)SvIOKp_on(dstr);
3950 if (sflags & SVf_IOK)
3951 SvFLAGS(dstr) |= SVf_IOK;
3952 if (sflags & SVf_IVisUV)
3954 SvIVX(dstr) = SvIVX(sstr);
3956 if (SvAMAGIC(sstr)) {
3960 else if (sflags & SVp_POK) {
3964 * Check to see if we can just swipe the string. If so, it's a
3965 * possible small lose on short strings, but a big win on long ones.
3966 * It might even be a win on short strings if SvPVX(dstr)
3967 * has to be allocated and SvPVX(sstr) has to be freed.
3971 #ifdef PERL_COPY_ON_WRITE
3972 (sflags & (SVf_FAKE | SVf_READONLY)) != (SVf_FAKE | SVf_READONLY)
3976 (sflags & SVs_TEMP) && /* slated for free anyway? */
3977 !(sflags & SVf_OOK) && /* and not involved in OOK hack? */
3978 SvREFCNT(sstr) == 1 && /* and no other references to it? */
3979 SvLEN(sstr) && /* and really is a string */
3980 /* and won't be needed again, potentially */
3981 !(PL_op && PL_op->op_type == OP_AASSIGN))
3982 #ifdef PERL_COPY_ON_WRITE
3983 && !((sflags & CAN_COW_MASK) == CAN_COW_FLAGS
3984 && SvTYPE(sstr) >= SVt_PVIV)
3987 /* Failed the swipe test, and it's not a shared hash key either.
3988 Have to copy the string. */
3989 STRLEN len = SvCUR(sstr);
3990 SvGROW(dstr, len + 1); /* inlined from sv_setpvn */
3991 Move(SvPVX(sstr),SvPVX(dstr),len,char);
3992 SvCUR_set(dstr, len);
3993 *SvEND(dstr) = '\0';
3994 (void)SvPOK_only(dstr);
3996 /* If PERL_COPY_ON_WRITE is not defined, then isSwipe will always
3998 #ifdef PERL_COPY_ON_WRITE
3999 /* Either it's a shared hash key, or it's suitable for
4000 copy-on-write or we can swipe the string. */
4002 PerlIO_printf(Perl_debug_log, "Copy on write: sstr --> dstr\n");
4007 /* I believe I should acquire a global SV mutex if
4008 it's a COW sv (not a shared hash key) to stop
4009 it going un copy-on-write.
4010 If the source SV has gone un copy on write between up there
4011 and down here, then (assert() that) it is of the correct
4012 form to make it copy on write again */
4013 if ((sflags & (SVf_FAKE | SVf_READONLY))
4014 != (SVf_FAKE | SVf_READONLY)) {
4015 SvREADONLY_on(sstr);
4017 /* Make the source SV into a loop of 1.
4018 (about to become 2) */
4019 SV_COW_NEXT_SV_SET(sstr, sstr);
4023 /* Initial code is common. */
4024 if (SvPVX(dstr)) { /* we know that dtype >= SVt_PV */
4026 SvFLAGS(dstr) &= ~SVf_OOK;
4027 Safefree(SvPVX(dstr) - SvIVX(dstr));
4029 else if (SvLEN(dstr))
4030 Safefree(SvPVX(dstr));
4032 (void)SvPOK_only(dstr);
4034 #ifdef PERL_COPY_ON_WRITE
4036 /* making another shared SV. */
4037 STRLEN cur = SvCUR(sstr);
4038 STRLEN len = SvLEN(sstr);
4039 assert (SvTYPE(dstr) >= SVt_PVIV);
4041 /* SvIsCOW_normal */
4042 /* splice us in between source and next-after-source. */
4043 SV_COW_NEXT_SV_SET(dstr, SV_COW_NEXT_SV(sstr));
4044 SV_COW_NEXT_SV_SET(sstr, dstr);
4045 SvPV_set(dstr, SvPVX(sstr));
4047 /* SvIsCOW_shared_hash */
4048 UV hash = SvUVX(sstr);
4049 DEBUG_C(PerlIO_printf(Perl_debug_log,
4050 "Copy on write: Sharing hash\n"));
4052 sharepvn(SvPVX(sstr),
4053 (sflags & SVf_UTF8?-cur:cur), hash));
4058 SvREADONLY_on(dstr);
4060 /* Relesase a global SV mutex. */
4064 { /* Passes the swipe test. */
4065 SvPV_set(dstr, SvPVX(sstr));
4066 SvLEN_set(dstr, SvLEN(sstr));
4067 SvCUR_set(dstr, SvCUR(sstr));
4070 (void)SvOK_off(sstr); /* NOTE: nukes most SvFLAGS on sstr */
4071 SvPV_set(sstr, Nullch);
4077 if (sflags & SVf_UTF8)
4080 if (sflags & SVp_NOK) {
4082 if (sflags & SVf_NOK)
4083 SvFLAGS(dstr) |= SVf_NOK;
4084 SvNVX(dstr) = SvNVX(sstr);
4086 if (sflags & SVp_IOK) {
4087 (void)SvIOKp_on(dstr);
4088 if (sflags & SVf_IOK)
4089 SvFLAGS(dstr) |= SVf_IOK;
4090 if (sflags & SVf_IVisUV)
4092 SvIVX(dstr) = SvIVX(sstr);
4095 MAGIC *smg = mg_find(sstr,PERL_MAGIC_vstring);
4096 sv_magic(dstr, NULL, PERL_MAGIC_vstring,
4097 smg->mg_ptr, smg->mg_len);
4098 SvRMAGICAL_on(dstr);
4101 else if (sflags & SVp_IOK) {
4102 if (sflags & SVf_IOK)
4103 (void)SvIOK_only(dstr);
4105 (void)SvOK_off(dstr);
4106 (void)SvIOKp_on(dstr);
4108 /* XXXX Do we want to set IsUV for IV(ROK)? Be extra safe... */
4109 if (sflags & SVf_IVisUV)
4111 SvIVX(dstr) = SvIVX(sstr);
4112 if (sflags & SVp_NOK) {
4113 if (sflags & SVf_NOK)
4114 (void)SvNOK_on(dstr);
4116 (void)SvNOKp_on(dstr);
4117 SvNVX(dstr) = SvNVX(sstr);
4120 else if (sflags & SVp_NOK) {
4121 if (sflags & SVf_NOK)
4122 (void)SvNOK_only(dstr);
4124 (void)SvOK_off(dstr);
4127 SvNVX(dstr) = SvNVX(sstr);
4130 if (dtype == SVt_PVGV) {
4131 if (ckWARN(WARN_MISC))
4132 Perl_warner(aTHX_ packWARN(WARN_MISC), "Undefined value assigned to typeglob");
4135 (void)SvOK_off(dstr);
4137 if (SvTAINTED(sstr))
4142 =for apidoc sv_setsv_mg
4144 Like C<sv_setsv>, but also handles 'set' magic.
4150 Perl_sv_setsv_mg(pTHX_ SV *dstr, register SV *sstr)
4152 sv_setsv(dstr,sstr);
4156 #ifdef PERL_COPY_ON_WRITE
4158 Perl_sv_setsv_cow(pTHX_ SV *dstr, SV *sstr)
4160 STRLEN cur = SvCUR(sstr);
4161 STRLEN len = SvLEN(sstr);
4162 register char *new_pv;
4165 PerlIO_printf(Perl_debug_log, "Fast copy on write: %p -> %p\n",
4173 if (SvTHINKFIRST(dstr))
4174 sv_force_normal_flags(dstr, SV_COW_DROP_PV);
4175 else if (SvPVX(dstr))
4176 Safefree(SvPVX(dstr));
4180 SvUPGRADE (dstr, SVt_PVIV);
4182 assert (SvPOK(sstr));
4183 assert (SvPOKp(sstr));
4184 assert (!SvIOK(sstr));
4185 assert (!SvIOKp(sstr));
4186 assert (!SvNOK(sstr));
4187 assert (!SvNOKp(sstr));
4189 if (SvIsCOW(sstr)) {
4191 if (SvLEN(sstr) == 0) {
4192 /* source is a COW shared hash key. */
4193 UV hash = SvUVX(sstr);
4194 DEBUG_C(PerlIO_printf(Perl_debug_log,
4195 "Fast copy on write: Sharing hash\n"));
4197 new_pv = sharepvn(SvPVX(sstr), (SvUTF8(sstr)?-cur:cur), hash);
4200 SV_COW_NEXT_SV_SET(dstr, SV_COW_NEXT_SV(sstr));
4202 assert ((SvFLAGS(sstr) & CAN_COW_MASK) == CAN_COW_FLAGS);
4203 SvUPGRADE (sstr, SVt_PVIV);
4204 SvREADONLY_on(sstr);
4206 DEBUG_C(PerlIO_printf(Perl_debug_log,
4207 "Fast copy on write: Converting sstr to COW\n"));
4208 SV_COW_NEXT_SV_SET(dstr, sstr);
4210 SV_COW_NEXT_SV_SET(sstr, dstr);
4211 new_pv = SvPVX(sstr);
4214 SvPV_set(dstr, new_pv);
4215 SvFLAGS(dstr) = (SVt_PVIV|SVf_POK|SVp_POK|SVf_FAKE|SVf_READONLY);
4228 =for apidoc sv_setpvn
4230 Copies a string into an SV. The C<len> parameter indicates the number of
4231 bytes to be copied. Does not handle 'set' magic. See C<sv_setpvn_mg>.
4237 Perl_sv_setpvn(pTHX_ register SV *sv, register const char *ptr, register STRLEN len)
4239 register char *dptr;
4241 SV_CHECK_THINKFIRST_COW_DROP(sv);
4247 /* len is STRLEN which is unsigned, need to copy to signed */
4250 Perl_croak(aTHX_ "panic: sv_setpvn called with negative strlen");
4252 (void)SvUPGRADE(sv, SVt_PV);
4254 SvGROW(sv, len + 1);
4256 Move(ptr,dptr,len,char);
4259 (void)SvPOK_only_UTF8(sv); /* validate pointer */
4264 =for apidoc sv_setpvn_mg
4266 Like C<sv_setpvn>, but also handles 'set' magic.
4272 Perl_sv_setpvn_mg(pTHX_ register SV *sv, register const char *ptr, register STRLEN len)
4274 sv_setpvn(sv,ptr,len);
4279 =for apidoc sv_setpv
4281 Copies a string into an SV. The string must be null-terminated. Does not
4282 handle 'set' magic. See C<sv_setpv_mg>.
4288 Perl_sv_setpv(pTHX_ register SV *sv, register const char *ptr)
4290 register STRLEN len;
4292 SV_CHECK_THINKFIRST_COW_DROP(sv);
4298 (void)SvUPGRADE(sv, SVt_PV);
4300 SvGROW(sv, len + 1);
4301 Move(ptr,SvPVX(sv),len+1,char);
4303 (void)SvPOK_only_UTF8(sv); /* validate pointer */
4308 =for apidoc sv_setpv_mg
4310 Like C<sv_setpv>, but also handles 'set' magic.
4316 Perl_sv_setpv_mg(pTHX_ register SV *sv, register const char *ptr)
4323 =for apidoc sv_usepvn
4325 Tells an SV to use C<ptr> to find its string value. Normally the string is
4326 stored inside the SV but sv_usepvn allows the SV to use an outside string.
4327 The C<ptr> should point to memory that was allocated by C<malloc>. The
4328 string length, C<len>, must be supplied. This function will realloc the
4329 memory pointed to by C<ptr>, so that pointer should not be freed or used by
4330 the programmer after giving it to sv_usepvn. Does not handle 'set' magic.
4331 See C<sv_usepvn_mg>.
4337 Perl_sv_usepvn(pTHX_ register SV *sv, register char *ptr, register STRLEN len)
4339 SV_CHECK_THINKFIRST_COW_DROP(sv);
4340 (void)SvUPGRADE(sv, SVt_PV);
4345 (void)SvOOK_off(sv);
4346 if (SvPVX(sv) && SvLEN(sv))
4347 Safefree(SvPVX(sv));
4348 Renew(ptr, len+1, char);
4351 SvLEN_set(sv, len+1);
4353 (void)SvPOK_only_UTF8(sv); /* validate pointer */
4358 =for apidoc sv_usepvn_mg
4360 Like C<sv_usepvn>, but also handles 'set' magic.
4366 Perl_sv_usepvn_mg(pTHX_ register SV *sv, register char *ptr, register STRLEN len)
4368 sv_usepvn(sv,ptr,len);
4372 #ifdef PERL_COPY_ON_WRITE
4373 /* Need to do this *after* making the SV normal, as we need the buffer
4374 pointer to remain valid until after we've copied it. If we let go too early,
4375 another thread could invalidate it by unsharing last of the same hash key
4376 (which it can do by means other than releasing copy-on-write Svs)
4377 or by changing the other copy-on-write SVs in the loop. */
4379 S_sv_release_COW(pTHX_ register SV *sv, char *pvx, STRLEN cur, STRLEN len,
4380 U32 hash, SV *after)
4382 if (len) { /* this SV was SvIsCOW_normal(sv) */
4383 /* we need to find the SV pointing to us. */
4384 SV *current = SV_COW_NEXT_SV(after);
4386 if (current == sv) {
4387 /* The SV we point to points back to us (there were only two of us
4389 Hence other SV is no longer copy on write either. */
4391 SvREADONLY_off(after);
4393 /* We need to follow the pointers around the loop. */
4395 while ((next = SV_COW_NEXT_SV(current)) != sv) {
4398 /* don't loop forever if the structure is bust, and we have
4399 a pointer into a closed loop. */
4400 assert (current != after);
4401 assert (SvPVX(current) == pvx);
4403 /* Make the SV before us point to the SV after us. */
4404 SV_COW_NEXT_SV_SET(current, after);
4407 unsharepvn(pvx, SvUTF8(sv) ? -(I32)cur : cur, hash);
4412 Perl_sv_release_IVX(pTHX_ register SV *sv)
4415 sv_force_normal_flags(sv, 0);
4416 return SvOOK_off(sv);
4420 =for apidoc sv_force_normal_flags
4422 Undo various types of fakery on an SV: if the PV is a shared string, make
4423 a private copy; if we're a ref, stop refing; if we're a glob, downgrade to
4424 an xpvmg; if we're a copy-on-write scalar, this is the on-write time when
4425 we do the copy, and is also used locally. If C<SV_COW_DROP_PV> is set
4426 then a copy-on-write scalar drops its PV buffer (if any) and becomes
4427 SvPOK_off rather than making a copy. (Used where this scalar is about to be
4428 set to some other value.) In addition, the C<flags> parameter gets passed to
4429 C<sv_unref_flags()> when unrefing. C<sv_force_normal> calls this function
4430 with flags set to 0.
4436 Perl_sv_force_normal_flags(pTHX_ register SV *sv, U32 flags)
4438 #ifdef PERL_COPY_ON_WRITE
4439 if (SvREADONLY(sv)) {
4440 /* At this point I believe I should acquire a global SV mutex. */
4442 char *pvx = SvPVX(sv);
4443 STRLEN len = SvLEN(sv);
4444 STRLEN cur = SvCUR(sv);
4445 U32 hash = SvUVX(sv);
4446 SV *next = SV_COW_NEXT_SV(sv); /* next COW sv in the loop. */
4448 PerlIO_printf(Perl_debug_log,
4449 "Copy on write: Force normal %ld\n",
4455 /* This SV doesn't own the buffer, so need to New() a new one: */
4458 if (flags & SV_COW_DROP_PV) {
4459 /* OK, so we don't need to copy our buffer. */
4462 SvGROW(sv, cur + 1);
4463 Move(pvx,SvPVX(sv),cur,char);
4467 sv_release_COW(sv, pvx, cur, len, hash, next);
4472 else if (PL_curcop != &PL_compiling)
4473 Perl_croak(aTHX_ PL_no_modify);
4474 /* At this point I believe that I can drop the global SV mutex. */
4477 if (SvREADONLY(sv)) {
4479 char *pvx = SvPVX(sv);
4480 STRLEN len = SvCUR(sv);
4481 U32 hash = SvUVX(sv);
4484 SvGROW(sv, len + 1);
4485 Move(pvx,SvPVX(sv),len,char);
4487 unsharepvn(pvx, SvUTF8(sv) ? -(I32)len : len, hash);
4489 else if (PL_curcop != &PL_compiling)
4490 Perl_croak(aTHX_ PL_no_modify);
4494 sv_unref_flags(sv, flags);
4495 else if (SvFAKE(sv) && SvTYPE(sv) == SVt_PVGV)
4500 =for apidoc sv_force_normal
4502 Undo various types of fakery on an SV: if the PV is a shared string, make
4503 a private copy; if we're a ref, stop refing; if we're a glob, downgrade to
4504 an xpvmg. See also C<sv_force_normal_flags>.
4510 Perl_sv_force_normal(pTHX_ register SV *sv)
4512 sv_force_normal_flags(sv, 0);
4518 Efficient removal of characters from the beginning of the string buffer.
4519 SvPOK(sv) must be true and the C<ptr> must be a pointer to somewhere inside
4520 the string buffer. The C<ptr> becomes the first character of the adjusted
4521 string. Uses the "OOK hack".
4522 Beware: after this function returns, C<ptr> and SvPVX(sv) may no longer
4523 refer to the same chunk of data.
4529 Perl_sv_chop(pTHX_ register SV *sv, register char *ptr)
4531 register STRLEN delta;
4532 if (!ptr || !SvPOKp(sv))
4534 delta = ptr - SvPVX(sv);
4535 SV_CHECK_THINKFIRST(sv);
4536 if (SvTYPE(sv) < SVt_PVIV)
4537 sv_upgrade(sv,SVt_PVIV);
4540 if (!SvLEN(sv)) { /* make copy of shared string */
4541 char *pvx = SvPVX(sv);
4542 STRLEN len = SvCUR(sv);
4543 SvGROW(sv, len + 1);
4544 Move(pvx,SvPVX(sv),len,char);
4548 /* Same SvOOK_on but SvOOK_on does a SvIOK_off
4549 and we do that anyway inside the SvNIOK_off
4551 SvFLAGS(sv) |= SVf_OOK;
4560 /* sv_catpvn() is now a macro using Perl_sv_catpvn_flags();
4561 * this function provided for binary compatibility only
4565 Perl_sv_catpvn(pTHX_ SV *dsv, const char* sstr, STRLEN slen)
4567 sv_catpvn_flags(dsv, sstr, slen, SV_GMAGIC);
4571 =for apidoc sv_catpvn
4573 Concatenates the string onto the end of the string which is in the SV. The
4574 C<len> indicates number of bytes to copy. If the SV has the UTF8
4575 status set, then the bytes appended should be valid UTF8.
4576 Handles 'get' magic, but not 'set' magic. See C<sv_catpvn_mg>.
4578 =for apidoc sv_catpvn_flags
4580 Concatenates the string onto the end of the string which is in the SV. The
4581 C<len> indicates number of bytes to copy. If the SV has the UTF8
4582 status set, then the bytes appended should be valid UTF8.
4583 If C<flags> has C<SV_GMAGIC> bit set, will C<mg_get> on C<dsv> if
4584 appropriate, else not. C<sv_catpvn> and C<sv_catpvn_nomg> are implemented
4585 in terms of this function.
4591 Perl_sv_catpvn_flags(pTHX_ register SV *dsv, register const char *sstr, register STRLEN slen, I32 flags)
4596 dstr = SvPV_force_flags(dsv, dlen, flags);
4597 SvGROW(dsv, dlen + slen + 1);
4600 Move(sstr, SvPVX(dsv) + dlen, slen, char);
4603 (void)SvPOK_only_UTF8(dsv); /* validate pointer */
4608 =for apidoc sv_catpvn_mg
4610 Like C<sv_catpvn>, but also handles 'set' magic.
4616 Perl_sv_catpvn_mg(pTHX_ register SV *sv, register const char *ptr, register STRLEN len)
4618 sv_catpvn(sv,ptr,len);
4622 /* sv_catsv() is now a macro using Perl_sv_catsv_flags();
4623 * this function provided for binary compatibility only
4627 Perl_sv_catsv(pTHX_ SV *dstr, register SV *sstr)
4629 sv_catsv_flags(dstr, sstr, SV_GMAGIC);
4633 =for apidoc sv_catsv
4635 Concatenates the string from SV C<ssv> onto the end of the string in
4636 SV C<dsv>. Modifies C<dsv> but not C<ssv>. Handles 'get' magic, but
4637 not 'set' magic. See C<sv_catsv_mg>.
4639 =for apidoc sv_catsv_flags
4641 Concatenates the string from SV C<ssv> onto the end of the string in
4642 SV C<dsv>. Modifies C<dsv> but not C<ssv>. If C<flags> has C<SV_GMAGIC>
4643 bit set, will C<mg_get> on the SVs if appropriate, else not. C<sv_catsv>
4644 and C<sv_catsv_nomg> are implemented in terms of this function.
4649 Perl_sv_catsv_flags(pTHX_ SV *dsv, register SV *ssv, I32 flags)
4655 if ((spv = SvPV(ssv, slen))) {
4656 /* sutf8 and dutf8 were type bool, but under USE_ITHREADS,
4657 gcc version 2.95.2 20000220 (Debian GNU/Linux) for
4658 Linux xxx 2.2.17 on sparc64 with gcc -O2, we erroneously
4659 get dutf8 = 0x20000000, (i.e. SVf_UTF8) even though
4660 dsv->sv_flags doesn't have that bit set.
4661 Andy Dougherty 12 Oct 2001
4663 I32 sutf8 = DO_UTF8(ssv);
4666 if (SvGMAGICAL(dsv) && (flags & SV_GMAGIC))
4668 dutf8 = DO_UTF8(dsv);
4670 if (dutf8 != sutf8) {
4672 /* Not modifying source SV, so taking a temporary copy. */
4673 SV* csv = sv_2mortal(newSVpvn(spv, slen));
4675 sv_utf8_upgrade(csv);
4676 spv = SvPV(csv, slen);
4679 sv_utf8_upgrade_nomg(dsv);
4681 sv_catpvn_nomg(dsv, spv, slen);
4686 =for apidoc sv_catsv_mg
4688 Like C<sv_catsv>, but also handles 'set' magic.
4694 Perl_sv_catsv_mg(pTHX_ SV *dsv, register SV *ssv)
4701 =for apidoc sv_catpv
4703 Concatenates the string onto the end of the string which is in the SV.
4704 If the SV has the UTF8 status set, then the bytes appended should be
4705 valid UTF8. Handles 'get' magic, but not 'set' magic. See C<sv_catpv_mg>.
4710 Perl_sv_catpv(pTHX_ register SV *sv, register const char *ptr)
4712 register STRLEN len;
4718 junk = SvPV_force(sv, tlen);
4720 SvGROW(sv, tlen + len + 1);
4723 Move(ptr,SvPVX(sv)+tlen,len+1,char);
4725 (void)SvPOK_only_UTF8(sv); /* validate pointer */
4730 =for apidoc sv_catpv_mg
4732 Like C<sv_catpv>, but also handles 'set' magic.
4738 Perl_sv_catpv_mg(pTHX_ register SV *sv, register const char *ptr)
4747 Create a new null SV, or if len > 0, create a new empty SVt_PV type SV
4748 with an initial PV allocation of len+1. Normally accessed via the C<NEWSV>
4755 Perl_newSV(pTHX_ STRLEN len)
4761 sv_upgrade(sv, SVt_PV);
4762 SvGROW(sv, len + 1);
4767 =for apidoc sv_magicext
4769 Adds magic to an SV, upgrading it if necessary. Applies the
4770 supplied vtable and returns pointer to the magic added.
4772 Note that sv_magicext will allow things that sv_magic will not.
4773 In particular you can add magic to SvREADONLY SVs and and more than
4774 one instance of the same 'how'
4776 I C<namelen> is greater then zero then a savepvn() I<copy> of C<name> is stored,
4777 if C<namelen> is zero then C<name> is stored as-is and - as another special
4778 case - if C<(name && namelen == HEf_SVKEY)> then C<name> is assumed to contain
4779 an C<SV*> and has its REFCNT incremented
4781 (This is now used as a subroutine by sv_magic.)
4786 Perl_sv_magicext(pTHX_ SV* sv, SV* obj, int how, MGVTBL *vtable,
4787 const char* name, I32 namlen)
4791 if (SvTYPE(sv) < SVt_PVMG) {
4792 (void)SvUPGRADE(sv, SVt_PVMG);
4794 Newz(702,mg, 1, MAGIC);
4795 mg->mg_moremagic = SvMAGIC(sv);
4798 /* Some magic sontains a reference loop, where the sv and object refer to
4799 each other. To prevent a reference loop that would prevent such
4800 objects being freed, we look for such loops and if we find one we
4801 avoid incrementing the object refcount.
4803 Note we cannot do this to avoid self-tie loops as intervening RV must
4804 have its REFCNT incremented to keep it in existence.
4807 if (!obj || obj == sv ||
4808 how == PERL_MAGIC_arylen ||
4809 how == PERL_MAGIC_qr ||
4810 (SvTYPE(obj) == SVt_PVGV &&
4811 (GvSV(obj) == sv || GvHV(obj) == (HV*)sv || GvAV(obj) == (AV*)sv ||
4812 GvCV(obj) == (CV*)sv || GvIOp(obj) == (IO*)sv ||
4813 GvFORM(obj) == (CV*)sv)))
4818 mg->mg_obj = SvREFCNT_inc(obj);
4819 mg->mg_flags |= MGf_REFCOUNTED;
4822 /* Normal self-ties simply pass a null object, and instead of
4823 using mg_obj directly, use the SvTIED_obj macro to produce a
4824 new RV as needed. For glob "self-ties", we are tieing the PVIO
4825 with an RV obj pointing to the glob containing the PVIO. In
4826 this case, to avoid a reference loop, we need to weaken the
4830 if (how == PERL_MAGIC_tiedscalar && SvTYPE(sv) == SVt_PVIO &&
4831 obj && SvROK(obj) && GvIO(SvRV(obj)) == (IO*)sv)
4837 mg->mg_len = namlen;
4840 mg->mg_ptr = savepvn(name, namlen);
4841 else if (namlen == HEf_SVKEY)
4842 mg->mg_ptr = (char*)SvREFCNT_inc((SV*)name);
4844 mg->mg_ptr = (char *) name;
4846 mg->mg_virtual = vtable;
4850 SvFLAGS(sv) &= ~(SVf_IOK|SVf_NOK|SVf_POK);
4855 =for apidoc sv_magic
4857 Adds magic to an SV. First upgrades C<sv> to type C<SVt_PVMG> if necessary,
4858 then adds a new magic item of type C<how> to the head of the magic list.
4864 Perl_sv_magic(pTHX_ register SV *sv, SV *obj, int how, const char *name, I32 namlen)
4869 #ifdef PERL_COPY_ON_WRITE
4871 sv_force_normal_flags(sv, 0);
4873 if (SvREADONLY(sv)) {
4874 if (PL_curcop != &PL_compiling
4875 && how != PERL_MAGIC_regex_global
4876 && how != PERL_MAGIC_bm
4877 && how != PERL_MAGIC_fm
4878 && how != PERL_MAGIC_sv
4881 Perl_croak(aTHX_ PL_no_modify);
4884 if (SvMAGICAL(sv) || (how == PERL_MAGIC_taint && SvTYPE(sv) >= SVt_PVMG)) {
4885 if (SvMAGIC(sv) && (mg = mg_find(sv, how))) {
4886 /* sv_magic() refuses to add a magic of the same 'how' as an
4889 if (how == PERL_MAGIC_taint)
4897 vtable = &PL_vtbl_sv;
4899 case PERL_MAGIC_overload:
4900 vtable = &PL_vtbl_amagic;
4902 case PERL_MAGIC_overload_elem:
4903 vtable = &PL_vtbl_amagicelem;
4905 case PERL_MAGIC_overload_table:
4906 vtable = &PL_vtbl_ovrld;
4909 vtable = &PL_vtbl_bm;
4911 case PERL_MAGIC_regdata:
4912 vtable = &PL_vtbl_regdata;
4914 case PERL_MAGIC_regdatum:
4915 vtable = &PL_vtbl_regdatum;
4917 case PERL_MAGIC_env:
4918 vtable = &PL_vtbl_env;
4921 vtable = &PL_vtbl_fm;
4923 case PERL_MAGIC_envelem:
4924 vtable = &PL_vtbl_envelem;
4926 case PERL_MAGIC_regex_global:
4927 vtable = &PL_vtbl_mglob;
4929 case PERL_MAGIC_isa:
4930 vtable = &PL_vtbl_isa;
4932 case PERL_MAGIC_isaelem:
4933 vtable = &PL_vtbl_isaelem;
4935 case PERL_MAGIC_nkeys:
4936 vtable = &PL_vtbl_nkeys;
4938 case PERL_MAGIC_dbfile:
4941 case PERL_MAGIC_dbline:
4942 vtable = &PL_vtbl_dbline;
4944 #ifdef USE_LOCALE_COLLATE
4945 case PERL_MAGIC_collxfrm:
4946 vtable = &PL_vtbl_collxfrm;
4948 #endif /* USE_LOCALE_COLLATE */
4949 case PERL_MAGIC_tied:
4950 vtable = &PL_vtbl_pack;
4952 case PERL_MAGIC_tiedelem:
4953 case PERL_MAGIC_tiedscalar:
4954 vtable = &PL_vtbl_packelem;
4957 vtable = &PL_vtbl_regexp;
4959 case PERL_MAGIC_sig:
4960 vtable = &PL_vtbl_sig;
4962 case PERL_MAGIC_sigelem:
4963 vtable = &PL_vtbl_sigelem;
4965 case PERL_MAGIC_taint:
4966 vtable = &PL_vtbl_taint;
4968 case PERL_MAGIC_uvar:
4969 vtable = &PL_vtbl_uvar;
4971 case PERL_MAGIC_vec:
4972 vtable = &PL_vtbl_vec;
4974 case PERL_MAGIC_vstring:
4977 case PERL_MAGIC_utf8:
4978 vtable = &PL_vtbl_utf8;
4980 case PERL_MAGIC_substr:
4981 vtable = &PL_vtbl_substr;
4983 case PERL_MAGIC_defelem:
4984 vtable = &PL_vtbl_defelem;
4986 case PERL_MAGIC_glob:
4987 vtable = &PL_vtbl_glob;
4989 case PERL_MAGIC_arylen:
4990 vtable = &PL_vtbl_arylen;
4992 case PERL_MAGIC_pos:
4993 vtable = &PL_vtbl_pos;
4995 case PERL_MAGIC_backref:
4996 vtable = &PL_vtbl_backref;
4998 case PERL_MAGIC_ext:
4999 /* Reserved for use by extensions not perl internals. */
5000 /* Useful for attaching extension internal data to perl vars. */
5001 /* Note that multiple extensions may clash if magical scalars */
5002 /* etc holding private data from one are passed to another. */
5005 Perl_croak(aTHX_ "Don't know how to handle magic of type \\%o", how);
5008 /* Rest of work is done else where */
5009 mg = sv_magicext(sv,obj,how,vtable,name,namlen);
5012 case PERL_MAGIC_taint:
5015 case PERL_MAGIC_ext:
5016 case PERL_MAGIC_dbfile:
5023 =for apidoc sv_unmagic
5025 Removes all magic of type C<type> from an SV.
5031 Perl_sv_unmagic(pTHX_ SV *sv, int type)
5035 if (SvTYPE(sv) < SVt_PVMG || !SvMAGIC(sv))
5038 for (mg = *mgp; mg; mg = *mgp) {
5039 if (mg->mg_type == type) {
5040 MGVTBL* vtbl = mg->mg_virtual;
5041 *mgp = mg->mg_moremagic;
5042 if (vtbl && vtbl->svt_free)
5043 CALL_FPTR(vtbl->svt_free)(aTHX_ sv, mg);
5044 if (mg->mg_ptr && mg->mg_type != PERL_MAGIC_regex_global) {
5046 Safefree(mg->mg_ptr);
5047 else if (mg->mg_len == HEf_SVKEY)
5048 SvREFCNT_dec((SV*)mg->mg_ptr);
5049 else if (mg->mg_type == PERL_MAGIC_utf8 && mg->mg_ptr)
5050 Safefree(mg->mg_ptr);
5052 if (mg->mg_flags & MGf_REFCOUNTED)
5053 SvREFCNT_dec(mg->mg_obj);
5057 mgp = &mg->mg_moremagic;
5061 SvFLAGS(sv) |= (SvFLAGS(sv) & (SVp_NOK|SVp_POK)) >> PRIVSHIFT;
5068 =for apidoc sv_rvweaken
5070 Weaken a reference: set the C<SvWEAKREF> flag on this RV; give the
5071 referred-to SV C<PERL_MAGIC_backref> magic if it hasn't already; and
5072 push a back-reference to this RV onto the array of backreferences
5073 associated with that magic.
5079 Perl_sv_rvweaken(pTHX_ SV *sv)
5082 if (!SvOK(sv)) /* let undefs pass */
5085 Perl_croak(aTHX_ "Can't weaken a nonreference");
5086 else if (SvWEAKREF(sv)) {
5087 if (ckWARN(WARN_MISC))
5088 Perl_warner(aTHX_ packWARN(WARN_MISC), "Reference is already weak");
5092 sv_add_backref(tsv, sv);
5098 /* Give tsv backref magic if it hasn't already got it, then push a
5099 * back-reference to sv onto the array associated with the backref magic.
5103 S_sv_add_backref(pTHX_ SV *tsv, SV *sv)
5107 if (SvMAGICAL(tsv) && (mg = mg_find(tsv, PERL_MAGIC_backref)))
5108 av = (AV*)mg->mg_obj;
5111 sv_magic(tsv, (SV*)av, PERL_MAGIC_backref, NULL, 0);
5112 /* av now has a refcnt of 2, which avoids it getting freed
5113 * before us during global cleanup. The extra ref is removed
5114 * by magic_killbackrefs() when tsv is being freed */
5116 if (AvFILLp(av) >= AvMAX(av)) {
5117 SV **svp = AvARRAY(av);
5118 I32 i = AvFILLp(av);
5120 if (svp[i] == &PL_sv_undef) {
5121 svp[i] = sv; /* reuse the slot */
5126 av_extend(av, AvFILLp(av)+1);
5128 AvARRAY(av)[++AvFILLp(av)] = sv; /* av_push() */
5131 /* delete a back-reference to ourselves from the backref magic associated
5132 * with the SV we point to.
5136 S_sv_del_backref(pTHX_ SV *sv)
5143 if (!SvMAGICAL(tsv) || !(mg = mg_find(tsv, PERL_MAGIC_backref)))
5144 Perl_croak(aTHX_ "panic: del_backref");
5145 av = (AV *)mg->mg_obj;
5150 svp[i] = &PL_sv_undef; /* XXX */
5157 =for apidoc sv_insert
5159 Inserts a string at the specified offset/length within the SV. Similar to
5160 the Perl substr() function.
5166 Perl_sv_insert(pTHX_ SV *bigstr, STRLEN offset, STRLEN len, char *little, STRLEN littlelen)
5170 register char *midend;
5171 register char *bigend;
5177 Perl_croak(aTHX_ "Can't modify non-existent substring");
5178 SvPV_force(bigstr, curlen);
5179 (void)SvPOK_only_UTF8(bigstr);
5180 if (offset + len > curlen) {
5181 SvGROW(bigstr, offset+len+1);
5182 Zero(SvPVX(bigstr)+curlen, offset+len-curlen, char);
5183 SvCUR_set(bigstr, offset+len);
5187 i = littlelen - len;
5188 if (i > 0) { /* string might grow */
5189 big = SvGROW(bigstr, SvCUR(bigstr) + i + 1);
5190 mid = big + offset + len;
5191 midend = bigend = big + SvCUR(bigstr);
5194 while (midend > mid) /* shove everything down */
5195 *--bigend = *--midend;
5196 Move(little,big+offset,littlelen,char);
5202 Move(little,SvPVX(bigstr)+offset,len,char);
5207 big = SvPVX(bigstr);
5210 bigend = big + SvCUR(bigstr);
5212 if (midend > bigend)
5213 Perl_croak(aTHX_ "panic: sv_insert");
5215 if (mid - big > bigend - midend) { /* faster to shorten from end */
5217 Move(little, mid, littlelen,char);
5220 i = bigend - midend;
5222 Move(midend, mid, i,char);
5226 SvCUR_set(bigstr, mid - big);
5229 else if ((i = mid - big)) { /* faster from front */
5230 midend -= littlelen;
5232 sv_chop(bigstr,midend-i);
5237 Move(little, mid, littlelen,char);
5239 else if (littlelen) {
5240 midend -= littlelen;
5241 sv_chop(bigstr,midend);
5242 Move(little,midend,littlelen,char);
5245 sv_chop(bigstr,midend);
5251 =for apidoc sv_replace
5253 Make the first argument a copy of the second, then delete the original.
5254 The target SV physically takes over ownership of the body of the source SV
5255 and inherits its flags; however, the target keeps any magic it owns,
5256 and any magic in the source is discarded.
5257 Note that this is a rather specialist SV copying operation; most of the
5258 time you'll want to use C<sv_setsv> or one of its many macro front-ends.
5264 Perl_sv_replace(pTHX_ register SV *sv, register SV *nsv)
5266 U32 refcnt = SvREFCNT(sv);
5267 SV_CHECK_THINKFIRST_COW_DROP(sv);
5268 if (SvREFCNT(nsv) != 1 && ckWARN_d(WARN_INTERNAL))
5269 Perl_warner(aTHX_ packWARN(WARN_INTERNAL), "Reference miscount in sv_replace()");
5270 if (SvMAGICAL(sv)) {
5274 sv_upgrade(nsv, SVt_PVMG);
5275 SvMAGIC(nsv) = SvMAGIC(sv);
5276 SvFLAGS(nsv) |= SvMAGICAL(sv);
5282 assert(!SvREFCNT(sv));
5283 StructCopy(nsv,sv,SV);
5284 #ifdef PERL_COPY_ON_WRITE
5285 if (SvIsCOW_normal(nsv)) {
5286 /* We need to follow the pointers around the loop to make the
5287 previous SV point to sv, rather than nsv. */
5290 while ((next = SV_COW_NEXT_SV(current)) != nsv) {
5293 assert(SvPVX(current) == SvPVX(nsv));
5295 /* Make the SV before us point to the SV after us. */
5297 PerlIO_printf(Perl_debug_log, "previous is\n");
5299 PerlIO_printf(Perl_debug_log,
5300 "move it from 0x%"UVxf" to 0x%"UVxf"\n",
5301 (UV) SV_COW_NEXT_SV(current), (UV) sv);
5303 SV_COW_NEXT_SV_SET(current, sv);
5306 SvREFCNT(sv) = refcnt;
5307 SvFLAGS(nsv) |= SVTYPEMASK; /* Mark as freed */
5312 =for apidoc sv_clear
5314 Clear an SV: call any destructors, free up any memory used by the body,
5315 and free the body itself. The SV's head is I<not> freed, although
5316 its type is set to all 1's so that it won't inadvertently be assumed
5317 to be live during global destruction etc.
5318 This function should only be called when REFCNT is zero. Most of the time
5319 you'll want to call C<sv_free()> (or its macro wrapper C<SvREFCNT_dec>)
5326 Perl_sv_clear(pTHX_ register SV *sv)
5330 assert(SvREFCNT(sv) == 0);
5333 if (PL_defstash) { /* Still have a symbol table? */
5340 stash = SvSTASH(sv);
5341 destructor = StashHANDLER(stash,DESTROY);
5343 SV* tmpref = newRV(sv);
5344 SvREADONLY_on(tmpref); /* DESTROY() could be naughty */
5346 PUSHSTACKi(PERLSI_DESTROY);
5351 call_sv((SV*)destructor, G_DISCARD|G_EVAL|G_KEEPERR|G_VOID);
5357 if(SvREFCNT(tmpref) < 2) {
5358 /* tmpref is not kept alive! */
5363 SvREFCNT_dec(tmpref);
5365 } while (SvOBJECT(sv) && SvSTASH(sv) != stash);
5369 if (PL_in_clean_objs)
5370 Perl_croak(aTHX_ "DESTROY created new reference to dead object '%s'",
5372 /* DESTROY gave object new lease on life */
5378 SvREFCNT_dec(SvSTASH(sv)); /* possibly of changed persuasion */
5379 SvOBJECT_off(sv); /* Curse the object. */
5380 if (SvTYPE(sv) != SVt_PVIO)
5381 --PL_sv_objcount; /* XXX Might want something more general */
5384 if (SvTYPE(sv) >= SVt_PVMG) {
5387 if (SvFLAGS(sv) & SVpad_TYPED)
5388 SvREFCNT_dec(SvSTASH(sv));
5391 switch (SvTYPE(sv)) {
5394 IoIFP(sv) != PerlIO_stdin() &&
5395 IoIFP(sv) != PerlIO_stdout() &&
5396 IoIFP(sv) != PerlIO_stderr())
5398 io_close((IO*)sv, FALSE);
5400 if (IoDIRP(sv) && !(IoFLAGS(sv) & IOf_FAKE_DIRP))
5401 PerlDir_close(IoDIRP(sv));
5402 IoDIRP(sv) = (DIR*)NULL;
5403 Safefree(IoTOP_NAME(sv));
5404 Safefree(IoFMT_NAME(sv));
5405 Safefree(IoBOTTOM_NAME(sv));
5420 if (LvTYPE(sv) == 'T') { /* for tie: return HE to pool */
5421 SvREFCNT_dec(HeKEY_sv((HE*)LvTARG(sv)));
5422 HeNEXT((HE*)LvTARG(sv)) = PL_hv_fetch_ent_mh;
5423 PL_hv_fetch_ent_mh = (HE*)LvTARG(sv);
5425 else if (LvTYPE(sv) != 't') /* unless tie: unrefcnted fake SV** */
5426 SvREFCNT_dec(LvTARG(sv));
5430 Safefree(GvNAME(sv));
5431 /* cannot decrease stash refcount yet, as we might recursively delete
5432 ourselves when the refcnt drops to zero. Delay SvREFCNT_dec
5433 of stash until current sv is completely gone.
5434 -- JohnPC, 27 Mar 1998 */
5435 stash = GvSTASH(sv);
5441 (void)SvOOK_off(sv);
5449 SvREFCNT_dec(SvRV(sv));
5451 #ifdef PERL_COPY_ON_WRITE
5452 else if (SvPVX(sv)) {
5454 /* I believe I need to grab the global SV mutex here and
5455 then recheck the COW status. */
5457 PerlIO_printf(Perl_debug_log, "Copy on write: clear\n");
5460 sv_release_COW(sv, SvPVX(sv), SvCUR(sv), SvLEN(sv),
5461 SvUVX(sv), SV_COW_NEXT_SV(sv));
5462 /* And drop it here. */
5464 } else if (SvLEN(sv)) {
5465 Safefree(SvPVX(sv));
5469 else if (SvPVX(sv) && SvLEN(sv))
5470 Safefree(SvPVX(sv));
5471 else if (SvPVX(sv) && SvREADONLY(sv) && SvFAKE(sv)) {
5472 unsharepvn(SvPVX(sv),
5473 SvUTF8(sv) ? -(I32)SvCUR(sv) : SvCUR(sv),
5487 switch (SvTYPE(sv)) {
5503 del_XPVIV(SvANY(sv));
5506 del_XPVNV(SvANY(sv));
5509 del_XPVMG(SvANY(sv));
5512 del_XPVLV(SvANY(sv));
5515 del_XPVAV(SvANY(sv));
5518 del_XPVHV(SvANY(sv));
5521 del_XPVCV(SvANY(sv));
5524 del_XPVGV(SvANY(sv));
5525 /* code duplication for increased performance. */
5526 SvFLAGS(sv) &= SVf_BREAK;
5527 SvFLAGS(sv) |= SVTYPEMASK;
5528 /* decrease refcount of the stash that owns this GV, if any */
5530 SvREFCNT_dec(stash);
5531 return; /* not break, SvFLAGS reset already happened */
5533 del_XPVBM(SvANY(sv));
5536 del_XPVFM(SvANY(sv));
5539 del_XPVIO(SvANY(sv));
5542 SvFLAGS(sv) &= SVf_BREAK;
5543 SvFLAGS(sv) |= SVTYPEMASK;
5547 =for apidoc sv_newref
5549 Increment an SV's reference count. Use the C<SvREFCNT_inc()> wrapper
5556 Perl_sv_newref(pTHX_ SV *sv)
5566 Decrement an SV's reference count, and if it drops to zero, call
5567 C<sv_clear> to invoke destructors and free up any memory used by
5568 the body; finally, deallocate the SV's head itself.
5569 Normally called via a wrapper macro C<SvREFCNT_dec>.
5575 Perl_sv_free(pTHX_ SV *sv)
5579 if (SvREFCNT(sv) == 0) {
5580 if (SvFLAGS(sv) & SVf_BREAK)
5581 /* this SV's refcnt has been artificially decremented to
5582 * trigger cleanup */
5584 if (PL_in_clean_all) /* All is fair */
5586 if (SvREADONLY(sv) && SvIMMORTAL(sv)) {
5587 /* make sure SvREFCNT(sv)==0 happens very seldom */
5588 SvREFCNT(sv) = (~(U32)0)/2;
5591 if (ckWARN_d(WARN_INTERNAL))
5592 Perl_warner(aTHX_ packWARN(WARN_INTERNAL), "Attempt to free unreferenced scalar");
5595 if (--(SvREFCNT(sv)) > 0)
5597 Perl_sv_free2(aTHX_ sv);
5601 Perl_sv_free2(pTHX_ SV *sv)
5605 if (ckWARN_d(WARN_DEBUGGING))
5606 Perl_warner(aTHX_ packWARN(WARN_DEBUGGING),
5607 "Attempt to free temp prematurely: SV 0x%"UVxf,
5612 if (SvREADONLY(sv) && SvIMMORTAL(sv)) {
5613 /* make sure SvREFCNT(sv)==0 happens very seldom */
5614 SvREFCNT(sv) = (~(U32)0)/2;
5625 Returns the length of the string in the SV. Handles magic and type
5626 coercion. See also C<SvCUR>, which gives raw access to the xpv_cur slot.
5632 Perl_sv_len(pTHX_ register SV *sv)
5640 len = mg_length(sv);
5642 (void)SvPV(sv, len);
5647 =for apidoc sv_len_utf8
5649 Returns the number of characters in the string in an SV, counting wide
5650 UTF8 bytes as a single character. Handles magic and type coercion.
5656 * The length is cached in PERL_UTF8_magic, in the mg_len field. Also the
5657 * mg_ptr is used, by sv_pos_u2b(), see the comments of S_utf8_mg_pos_init().
5658 * (Note that the mg_len is not the length of the mg_ptr field.)
5663 Perl_sv_len_utf8(pTHX_ register SV *sv)
5669 return mg_length(sv);
5673 U8 *s = (U8*)SvPV(sv, len);
5674 MAGIC *mg = SvMAGICAL(sv) ? mg_find(sv, PERL_MAGIC_utf8) : 0;
5676 if (mg && mg->mg_len != -1 && (mg->mg_len > 0 || len == 0)) {
5678 #ifdef PERL_UTF8_CACHE_ASSERT
5679 assert(ulen == Perl_utf8_length(aTHX_ s, s + len));
5683 ulen = Perl_utf8_length(aTHX_ s, s + len);
5684 if (!mg && !SvREADONLY(sv)) {
5685 sv_magic(sv, 0, PERL_MAGIC_utf8, 0, 0);
5686 mg = mg_find(sv, PERL_MAGIC_utf8);
5696 /* S_utf8_mg_pos_init() is used to initialize the mg_ptr field of
5697 * a PERL_UTF8_magic. The mg_ptr is used to store the mapping
5698 * between UTF-8 and byte offsets. There are two (substr offset and substr
5699 * length, the i offset, PERL_MAGIC_UTF8_CACHESIZE) times two (UTF-8 offset
5700 * and byte offset) cache positions.
5702 * The mg_len field is used by sv_len_utf8(), see its comments.
5703 * Note that the mg_len is not the length of the mg_ptr field.
5707 S_utf8_mg_pos_init(pTHX_ SV *sv, MAGIC **mgp, STRLEN **cachep, I32 i, I32 *offsetp, U8 *s, U8 *start)
5711 if (SvMAGICAL(sv) && !SvREADONLY(sv)) {
5713 sv_magic(sv, 0, PERL_MAGIC_utf8, 0, 0);
5714 *mgp = mg_find(sv, PERL_MAGIC_utf8);
5719 *cachep = (STRLEN *) (*mgp)->mg_ptr;
5721 Newz(0, *cachep, PERL_MAGIC_UTF8_CACHESIZE * 2, STRLEN);
5722 (*mgp)->mg_ptr = (char *) *cachep;
5726 (*cachep)[i] = *offsetp;
5727 (*cachep)[i+1] = s - start;
5735 * S_utf8_mg_pos() is used to query and update mg_ptr field of
5736 * a PERL_UTF8_magic. The mg_ptr is used to store the mapping
5737 * between UTF-8 and byte offsets. See also the comments of
5738 * S_utf8_mg_pos_init().
5742 S_utf8_mg_pos(pTHX_ SV *sv, MAGIC **mgp, STRLEN **cachep, I32 i, I32 *offsetp, I32 uoff, U8 **sp, U8 *start, U8 *send)
5746 if (SvMAGICAL(sv) && !SvREADONLY(sv)) {
5748 *mgp = mg_find(sv, PERL_MAGIC_utf8);
5749 if (*mgp && (*mgp)->mg_ptr) {
5750 *cachep = (STRLEN *) (*mgp)->mg_ptr;
5751 ASSERT_UTF8_CACHE(*cachep);
5752 if ((*cachep)[i] == (STRLEN)uoff) /* An exact match. */
5754 else { /* We will skip to the right spot. */
5759 /* The assumption is that going backward is half
5760 * the speed of going forward (that's where the
5761 * 2 * backw in the below comes from). (The real
5762 * figure of course depends on the UTF-8 data.) */
5764 if ((*cachep)[i] > (STRLEN)uoff) {
5766 backw = (*cachep)[i] - (STRLEN)uoff;
5768 if (forw < 2 * backw)
5771 p = start + (*cachep)[i+1];
5773 /* Try this only for the substr offset (i == 0),
5774 * not for the substr length (i == 2). */
5775 else if (i == 0) { /* (*cachep)[i] < uoff */
5776 STRLEN ulen = sv_len_utf8(sv);
5778 if ((STRLEN)uoff < ulen) {
5779 forw = (STRLEN)uoff - (*cachep)[i];
5780 backw = ulen - (STRLEN)uoff;
5782 if (forw < 2 * backw)
5783 p = start + (*cachep)[i+1];
5788 /* If the string is not long enough for uoff,
5789 * we could extend it, but not at this low a level. */
5793 if (forw < 2 * backw) {
5800 while (UTF8_IS_CONTINUATION(*p))
5805 /* Update the cache. */
5806 (*cachep)[i] = (STRLEN)uoff;
5807 (*cachep)[i+1] = p - start;
5812 if (found) { /* Setup the return values. */
5813 *offsetp = (*cachep)[i+1];
5814 *sp = start + *offsetp;
5817 *offsetp = send - start;
5819 else if (*sp < start) {
5825 #ifdef PERL_UTF8_CACHE_ASSERT
5830 while (n-- && s < send)
5834 assert(*offsetp == s - start);
5835 assert((*cachep)[0] == (STRLEN)uoff);
5836 assert((*cachep)[1] == *offsetp);
5838 ASSERT_UTF8_CACHE(*cachep);
5847 =for apidoc sv_pos_u2b
5849 Converts the value pointed to by offsetp from a count of UTF8 chars from
5850 the start of the string, to a count of the equivalent number of bytes; if
5851 lenp is non-zero, it does the same to lenp, but this time starting from
5852 the offset, rather than from the start of the string. Handles magic and
5859 * sv_pos_u2b() uses, like sv_pos_b2u(), the mg_ptr of the potential
5860 * PERL_UTF8_magic of the sv to store the mapping between UTF-8 and
5861 * byte offsets. See also the comments of S_utf8_mg_pos().
5866 Perl_sv_pos_u2b(pTHX_ register SV *sv, I32* offsetp, I32* lenp)
5877 start = s = (U8*)SvPV(sv, len);
5879 I32 uoffset = *offsetp;
5884 if (utf8_mg_pos(sv, &mg, &cache, 0, offsetp, *offsetp, &s, start, send))
5886 if (!found && uoffset > 0) {
5887 while (s < send && uoffset--)
5891 if (utf8_mg_pos_init(sv, &mg, &cache, 0, offsetp, s, start))
5893 *offsetp = s - start;
5898 if (utf8_mg_pos(sv, &mg, &cache, 2, lenp, *lenp + *offsetp, &s, start, send)) {
5902 if (!found && *lenp > 0) {
5905 while (s < send && ulen--)
5909 if (utf8_mg_pos_init(sv, &mg, &cache, 2, lenp, s, start))
5910 cache[2] += *offsetp;
5914 ASSERT_UTF8_CACHE(cache);
5926 =for apidoc sv_pos_b2u
5928 Converts the value pointed to by offsetp from a count of bytes from the
5929 start of the string, to a count of the equivalent number of UTF8 chars.
5930 Handles magic and type coercion.
5936 * sv_pos_b2u() uses, like sv_pos_u2b(), the mg_ptr of the potential
5937 * PERL_UTF8_magic of the sv to store the mapping between UTF-8 and
5938 * byte offsets. See also the comments of S_utf8_mg_pos().
5943 Perl_sv_pos_b2u(pTHX_ register SV* sv, I32* offsetp)
5951 s = (U8*)SvPV(sv, len);
5952 if ((I32)len < *offsetp)
5953 Perl_croak(aTHX_ "panic: sv_pos_b2u: bad byte offset");
5955 U8* send = s + *offsetp;
5957 STRLEN *cache = NULL;
5961 if (SvMAGICAL(sv) && !SvREADONLY(sv)) {
5962 mg = mg_find(sv, PERL_MAGIC_utf8);
5963 if (mg && mg->mg_ptr) {
5964 cache = (STRLEN *) mg->mg_ptr;
5965 if (cache[1] == (STRLEN)*offsetp) {
5966 /* An exact match. */
5967 *offsetp = cache[0];
5971 else if (cache[1] < (STRLEN)*offsetp) {
5972 /* We already know part of the way. */
5975 /* Let the below loop do the rest. */
5977 else { /* cache[1] > *offsetp */
5978 /* We already know all of the way, now we may
5979 * be able to walk back. The same assumption
5980 * is made as in S_utf8_mg_pos(), namely that
5981 * walking backward is twice slower than
5982 * walking forward. */
5983 STRLEN forw = *offsetp;
5984 STRLEN backw = cache[1] - *offsetp;
5986 if (!(forw < 2 * backw)) {
5987 U8 *p = s + cache[1];
5994 while (UTF8_IS_CONTINUATION(*p)) {
6002 *offsetp = cache[0];
6007 ASSERT_UTF8_CACHE(cache);
6013 /* Call utf8n_to_uvchr() to validate the sequence
6014 * (unless a simple non-UTF character) */
6015 if (!UTF8_IS_INVARIANT(*s))
6016 utf8n_to_uvchr(s, UTF8SKIP(s), &n, 0);
6025 if (!SvREADONLY(sv)) {
6027 sv_magic(sv, 0, PERL_MAGIC_utf8, 0, 0);
6028 mg = mg_find(sv, PERL_MAGIC_utf8);
6033 Newz(0, cache, PERL_MAGIC_UTF8_CACHESIZE * 2, STRLEN);
6034 mg->mg_ptr = (char *) cache;
6039 cache[1] = *offsetp;
6050 Returns a boolean indicating whether the strings in the two SVs are
6051 identical. Is UTF-8 and 'use bytes' aware, handles get magic, and will
6052 coerce its args to strings if necessary.
6058 Perl_sv_eq(pTHX_ register SV *sv1, register SV *sv2)
6066 SV* svrecode = Nullsv;
6073 pv1 = SvPV(sv1, cur1);
6080 pv2 = SvPV(sv2, cur2);
6082 if (cur1 && cur2 && SvUTF8(sv1) != SvUTF8(sv2) && !IN_BYTES) {
6083 /* Differing utf8ness.
6084 * Do not UTF8size the comparands as a side-effect. */
6087 svrecode = newSVpvn(pv2, cur2);
6088 sv_recode_to_utf8(svrecode, PL_encoding);
6089 pv2 = SvPV(svrecode, cur2);
6092 svrecode = newSVpvn(pv1, cur1);
6093 sv_recode_to_utf8(svrecode, PL_encoding);
6094 pv1 = SvPV(svrecode, cur1);
6096 /* Now both are in UTF-8. */
6101 bool is_utf8 = TRUE;
6104 /* sv1 is the UTF-8 one,
6105 * if is equal it must be downgrade-able */
6106 char *pv = (char*)bytes_from_utf8((U8*)pv1,
6112 /* sv2 is the UTF-8 one,
6113 * if is equal it must be downgrade-able */
6114 char *pv = (char *)bytes_from_utf8((U8*)pv2,
6120 /* Downgrade not possible - cannot be eq */
6127 eq = (pv1 == pv2) || memEQ(pv1, pv2, cur1);
6130 SvREFCNT_dec(svrecode);
6141 Compares the strings in two SVs. Returns -1, 0, or 1 indicating whether the
6142 string in C<sv1> is less than, equal to, or greater than the string in
6143 C<sv2>. Is UTF-8 and 'use bytes' aware, handles get magic, and will
6144 coerce its args to strings if necessary. See also C<sv_cmp_locale>.
6150 Perl_sv_cmp(pTHX_ register SV *sv1, register SV *sv2)
6153 char *pv1, *pv2, *tpv = Nullch;
6155 SV *svrecode = Nullsv;
6162 pv1 = SvPV(sv1, cur1);
6169 pv2 = SvPV(sv2, cur2);
6171 if (cur1 && cur2 && SvUTF8(sv1) != SvUTF8(sv2) && !IN_BYTES) {
6172 /* Differing utf8ness.
6173 * Do not UTF8size the comparands as a side-effect. */
6176 svrecode = newSVpvn(pv2, cur2);
6177 sv_recode_to_utf8(svrecode, PL_encoding);
6178 pv2 = SvPV(svrecode, cur2);
6181 pv2 = tpv = (char*)bytes_to_utf8((U8*)pv2, &cur2);
6186 svrecode = newSVpvn(pv1, cur1);
6187 sv_recode_to_utf8(svrecode, PL_encoding);
6188 pv1 = SvPV(svrecode, cur1);
6191 pv1 = tpv = (char*)bytes_to_utf8((U8*)pv1, &cur1);
6197 cmp = cur2 ? -1 : 0;
6201 I32 retval = memcmp((void*)pv1, (void*)pv2, cur1 < cur2 ? cur1 : cur2);
6204 cmp = retval < 0 ? -1 : 1;
6205 } else if (cur1 == cur2) {
6208 cmp = cur1 < cur2 ? -1 : 1;
6213 SvREFCNT_dec(svrecode);
6222 =for apidoc sv_cmp_locale
6224 Compares the strings in two SVs in a locale-aware manner. Is UTF-8 and
6225 'use bytes' aware, handles get magic, and will coerce its args to strings
6226 if necessary. See also C<sv_cmp_locale>. See also C<sv_cmp>.
6232 Perl_sv_cmp_locale(pTHX_ register SV *sv1, register SV *sv2)
6234 #ifdef USE_LOCALE_COLLATE
6240 if (PL_collation_standard)
6244 pv1 = sv1 ? sv_collxfrm(sv1, &len1) : (char *) NULL;
6246 pv2 = sv2 ? sv_collxfrm(sv2, &len2) : (char *) NULL;
6248 if (!pv1 || !len1) {
6259 retval = memcmp((void*)pv1, (void*)pv2, len1 < len2 ? len1 : len2);
6262 return retval < 0 ? -1 : 1;
6265 * When the result of collation is equality, that doesn't mean
6266 * that there are no differences -- some locales exclude some
6267 * characters from consideration. So to avoid false equalities,
6268 * we use the raw string as a tiebreaker.
6274 #endif /* USE_LOCALE_COLLATE */
6276 return sv_cmp(sv1, sv2);
6280 #ifdef USE_LOCALE_COLLATE
6283 =for apidoc sv_collxfrm
6285 Add Collate Transform magic to an SV if it doesn't already have it.
6287 Any scalar variable may carry PERL_MAGIC_collxfrm magic that contains the
6288 scalar data of the variable, but transformed to such a format that a normal
6289 memory comparison can be used to compare the data according to the locale
6296 Perl_sv_collxfrm(pTHX_ SV *sv, STRLEN *nxp)
6300 mg = SvMAGICAL(sv) ? mg_find(sv, PERL_MAGIC_collxfrm) : (MAGIC *) NULL;
6301 if (!mg || !mg->mg_ptr || *(U32*)mg->mg_ptr != PL_collation_ix) {
6306 Safefree(mg->mg_ptr);
6308 if ((xf = mem_collxfrm(s, len, &xlen))) {
6309 if (SvREADONLY(sv)) {
6312 return xf + sizeof(PL_collation_ix);
6315 sv_magic(sv, 0, PERL_MAGIC_collxfrm, 0, 0);
6316 mg = mg_find(sv, PERL_MAGIC_collxfrm);
6329 if (mg && mg->mg_ptr) {
6331 return mg->mg_ptr + sizeof(PL_collation_ix);
6339 #endif /* USE_LOCALE_COLLATE */
6344 Get a line from the filehandle and store it into the SV, optionally
6345 appending to the currently-stored string.
6351 Perl_sv_gets(pTHX_ register SV *sv, register PerlIO *fp, I32 append)
6355 register STDCHAR rslast;
6356 register STDCHAR *bp;
6362 if (SvTHINKFIRST(sv))
6363 sv_force_normal_flags(sv, append ? 0 : SV_COW_DROP_PV);
6364 /* XXX. If you make this PVIV, then copy on write can copy scalars read
6366 However, perlbench says it's slower, because the existing swipe code
6367 is faster than copy on write.
6368 Swings and roundabouts. */
6369 (void)SvUPGRADE(sv, SVt_PV);
6374 if (PerlIO_isutf8(fp)) {
6376 sv_utf8_upgrade_nomg(sv);
6377 sv_pos_u2b(sv,&append,0);
6379 } else if (SvUTF8(sv)) {
6380 SV *tsv = NEWSV(0,0);
6381 sv_gets(tsv, fp, 0);
6382 sv_utf8_upgrade_nomg(tsv);
6383 SvCUR_set(sv,append);
6386 goto return_string_or_null;
6391 if (PerlIO_isutf8(fp))
6394 if (PL_curcop == &PL_compiling) {
6395 /* we always read code in line mode */
6399 else if (RsSNARF(PL_rs)) {
6400 /* If it is a regular disk file use size from stat() as estimate
6401 of amount we are going to read - may result in malloc-ing
6402 more memory than we realy need if layers bellow reduce
6403 size we read (e.g. CRLF or a gzip layer)
6406 if (!PerlLIO_fstat(PerlIO_fileno(fp), &st) && S_ISREG(st.st_mode)) {
6407 Off_t offset = PerlIO_tell(fp);
6408 if (offset != (Off_t) -1 && st.st_size + append > offset) {
6409 (void) SvGROW(sv, (STRLEN)((st.st_size - offset) + append + 1));
6415 else if (RsRECORD(PL_rs)) {
6419 /* Grab the size of the record we're getting */
6420 recsize = SvIV(SvRV(PL_rs));
6421 buffer = SvGROW(sv, (STRLEN)(recsize + append + 1)) + append;
6424 /* VMS wants read instead of fread, because fread doesn't respect */
6425 /* RMS record boundaries. This is not necessarily a good thing to be */
6426 /* doing, but we've got no other real choice - except avoid stdio
6427 as implementation - perhaps write a :vms layer ?
6429 bytesread = PerlLIO_read(PerlIO_fileno(fp), buffer, recsize);
6431 bytesread = PerlIO_read(fp, buffer, recsize);
6435 SvCUR_set(sv, bytesread += append);
6436 buffer[bytesread] = '\0';
6437 goto return_string_or_null;
6439 else if (RsPARA(PL_rs)) {
6445 /* Get $/ i.e. PL_rs into same encoding as stream wants */
6446 if (PerlIO_isutf8(fp)) {
6447 rsptr = SvPVutf8(PL_rs, rslen);
6450 if (SvUTF8(PL_rs)) {
6451 if (!sv_utf8_downgrade(PL_rs, TRUE)) {
6452 Perl_croak(aTHX_ "Wide character in $/");
6455 rsptr = SvPV(PL_rs, rslen);
6459 rslast = rslen ? rsptr[rslen - 1] : '\0';
6461 if (rspara) { /* have to do this both before and after */
6462 do { /* to make sure file boundaries work right */
6465 i = PerlIO_getc(fp);
6469 PerlIO_ungetc(fp,i);
6475 /* See if we know enough about I/O mechanism to cheat it ! */
6477 /* This used to be #ifdef test - it is made run-time test for ease
6478 of abstracting out stdio interface. One call should be cheap
6479 enough here - and may even be a macro allowing compile
6483 if (PerlIO_fast_gets(fp)) {
6486 * We're going to steal some values from the stdio struct
6487 * and put EVERYTHING in the innermost loop into registers.
6489 register STDCHAR *ptr;
6493 #if defined(VMS) && defined(PERLIO_IS_STDIO)
6494 /* An ungetc()d char is handled separately from the regular
6495 * buffer, so we getc() it back out and stuff it in the buffer.
6497 i = PerlIO_getc(fp);
6498 if (i == EOF) return 0;
6499 *(--((*fp)->_ptr)) = (unsigned char) i;
6503 /* Here is some breathtakingly efficient cheating */
6505 cnt = PerlIO_get_cnt(fp); /* get count into register */
6506 /* make sure we have the room */
6507 if ((I32)(SvLEN(sv) - append) <= cnt + 1) {
6508 /* Not room for all of it
6509 if we are looking for a separator and room for some
6511 if (rslen && cnt > 80 && (I32)SvLEN(sv) > append) {
6512 /* just process what we have room for */
6513 shortbuffered = cnt - SvLEN(sv) + append + 1;
6514 cnt -= shortbuffered;
6518 /* remember that cnt can be negative */
6519 SvGROW(sv, (STRLEN)(append + (cnt <= 0 ? 2 : (cnt + 1))));
6524 bp = (STDCHAR*)SvPVX(sv) + append; /* move these two too to registers */
6525 ptr = (STDCHAR*)PerlIO_get_ptr(fp);
6526 DEBUG_P(PerlIO_printf(Perl_debug_log,
6527 "Screamer: entering, ptr=%"UVuf", cnt=%ld\n",PTR2UV(ptr),(long)cnt));
6528 DEBUG_P(PerlIO_printf(Perl_debug_log,
6529 "Screamer: entering: PerlIO * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
6530 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
6531 PTR2UV(PerlIO_has_base(fp) ? PerlIO_get_base(fp) : 0)));
6536 while (cnt > 0) { /* this | eat */
6538 if ((*bp++ = *ptr++) == rslast) /* really | dust */
6539 goto thats_all_folks; /* screams | sed :-) */
6543 Copy(ptr, bp, cnt, char); /* this | eat */
6544 bp += cnt; /* screams | dust */
6545 ptr += cnt; /* louder | sed :-) */
6550 if (shortbuffered) { /* oh well, must extend */
6551 cnt = shortbuffered;
6553 bpx = bp - (STDCHAR*)SvPVX(sv); /* box up before relocation */
6555 SvGROW(sv, SvLEN(sv) + append + cnt + 2);
6556 bp = (STDCHAR*)SvPVX(sv) + bpx; /* unbox after relocation */
6560 DEBUG_P(PerlIO_printf(Perl_debug_log,
6561 "Screamer: going to getc, ptr=%"UVuf", cnt=%ld\n",
6562 PTR2UV(ptr),(long)cnt));
6563 PerlIO_set_ptrcnt(fp, (STDCHAR*)ptr, cnt); /* deregisterize cnt and ptr */
6565 DEBUG_P(PerlIO_printf(Perl_debug_log,
6566 "Screamer: pre: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
6567 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
6568 PTR2UV(PerlIO_has_base (fp) ? PerlIO_get_base(fp) : 0)));
6570 /* This used to call 'filbuf' in stdio form, but as that behaves like
6571 getc when cnt <= 0 we use PerlIO_getc here to avoid introducing
6572 another abstraction. */
6573 i = PerlIO_getc(fp); /* get more characters */
6575 DEBUG_P(PerlIO_printf(Perl_debug_log,
6576 "Screamer: post: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
6577 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
6578 PTR2UV(PerlIO_has_base (fp) ? PerlIO_get_base(fp) : 0)));
6580 cnt = PerlIO_get_cnt(fp);
6581 ptr = (STDCHAR*)PerlIO_get_ptr(fp); /* reregisterize cnt and ptr */
6582 DEBUG_P(PerlIO_printf(Perl_debug_log,
6583 "Screamer: after getc, ptr=%"UVuf", cnt=%ld\n",PTR2UV(ptr),(long)cnt));
6585 if (i == EOF) /* all done for ever? */
6586 goto thats_really_all_folks;
6588 bpx = bp - (STDCHAR*)SvPVX(sv); /* box up before relocation */
6590 SvGROW(sv, bpx + cnt + 2);
6591 bp = (STDCHAR*)SvPVX(sv) + bpx; /* unbox after relocation */
6593 *bp++ = (STDCHAR)i; /* store character from PerlIO_getc */
6595 if (rslen && (STDCHAR)i == rslast) /* all done for now? */
6596 goto thats_all_folks;
6600 if ((rslen > 1 && (STRLEN)(bp - (STDCHAR*)SvPVX(sv)) < rslen) ||
6601 memNE((char*)bp - rslen, rsptr, rslen))
6602 goto screamer; /* go back to the fray */
6603 thats_really_all_folks:
6605 cnt += shortbuffered;
6606 DEBUG_P(PerlIO_printf(Perl_debug_log,
6607 "Screamer: quitting, ptr=%"UVuf", cnt=%ld\n",PTR2UV(ptr),(long)cnt));
6608 PerlIO_set_ptrcnt(fp, (STDCHAR*)ptr, cnt); /* put these back or we're in trouble */
6609 DEBUG_P(PerlIO_printf(Perl_debug_log,
6610 "Screamer: end: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
6611 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
6612 PTR2UV(PerlIO_has_base (fp) ? PerlIO_get_base(fp) : 0)));
6614 SvCUR_set(sv, bp - (STDCHAR*)SvPVX(sv)); /* set length */
6615 DEBUG_P(PerlIO_printf(Perl_debug_log,
6616 "Screamer: done, len=%ld, string=|%.*s|\n",
6617 (long)SvCUR(sv),(int)SvCUR(sv),SvPVX(sv)));
6622 /*The big, slow, and stupid way */
6625 /* Need to work around EPOC SDK features */
6626 /* On WINS: MS VC5 generates calls to _chkstk, */
6627 /* if a `large' stack frame is allocated */
6628 /* gcc on MARM does not generate calls like these */
6634 register STDCHAR *bpe = buf + sizeof(buf);
6636 while ((i = PerlIO_getc(fp)) != EOF && (*bp++ = (STDCHAR)i) != rslast && bp < bpe)
6637 ; /* keep reading */
6641 cnt = PerlIO_read(fp,(char*)buf, sizeof(buf));
6642 /* Accomodate broken VAXC compiler, which applies U8 cast to
6643 * both args of ?: operator, causing EOF to change into 255
6646 i = (U8)buf[cnt - 1];
6652 cnt = 0; /* we do need to re-set the sv even when cnt <= 0 */
6654 sv_catpvn(sv, (char *) buf, cnt);
6656 sv_setpvn(sv, (char *) buf, cnt);
6658 if (i != EOF && /* joy */
6660 SvCUR(sv) < rslen ||
6661 memNE(SvPVX(sv) + SvCUR(sv) - rslen, rsptr, rslen)))
6665 * If we're reading from a TTY and we get a short read,
6666 * indicating that the user hit his EOF character, we need
6667 * to notice it now, because if we try to read from the TTY
6668 * again, the EOF condition will disappear.
6670 * The comparison of cnt to sizeof(buf) is an optimization
6671 * that prevents unnecessary calls to feof().
6675 if (!(cnt < sizeof(buf) && PerlIO_eof(fp)))
6680 if (rspara) { /* have to do this both before and after */
6681 while (i != EOF) { /* to make sure file boundaries work right */
6682 i = PerlIO_getc(fp);
6684 PerlIO_ungetc(fp,i);
6690 return_string_or_null:
6691 return (SvCUR(sv) - append) ? SvPVX(sv) : Nullch;
6697 Auto-increment of the value in the SV, doing string to numeric conversion
6698 if necessary. Handles 'get' magic.
6704 Perl_sv_inc(pTHX_ register SV *sv)
6713 if (SvTHINKFIRST(sv)) {
6715 sv_force_normal_flags(sv, 0);
6716 if (SvREADONLY(sv)) {
6717 if (PL_curcop != &PL_compiling)
6718 Perl_croak(aTHX_ PL_no_modify);
6722 if (SvAMAGIC(sv) && AMG_CALLun(sv,inc))
6724 i = PTR2IV(SvRV(sv));
6729 flags = SvFLAGS(sv);
6730 if ((flags & (SVp_NOK|SVp_IOK)) == SVp_NOK) {
6731 /* It's (privately or publicly) a float, but not tested as an
6732 integer, so test it to see. */
6734 flags = SvFLAGS(sv);
6736 if ((flags & SVf_IOK) || ((flags & (SVp_IOK | SVp_NOK)) == SVp_IOK)) {
6737 /* It's publicly an integer, or privately an integer-not-float */
6738 #ifdef PERL_PRESERVE_IVUV
6742 if (SvUVX(sv) == UV_MAX)
6743 sv_setnv(sv, UV_MAX_P1);
6745 (void)SvIOK_only_UV(sv);
6748 if (SvIVX(sv) == IV_MAX)
6749 sv_setuv(sv, (UV)IV_MAX + 1);
6751 (void)SvIOK_only(sv);
6757 if (flags & SVp_NOK) {
6758 (void)SvNOK_only(sv);
6763 if (!(flags & SVp_POK) || !*SvPVX(sv)) {
6764 if ((flags & SVTYPEMASK) < SVt_PVIV)
6765 sv_upgrade(sv, SVt_IV);
6766 (void)SvIOK_only(sv);
6771 while (isALPHA(*d)) d++;
6772 while (isDIGIT(*d)) d++;
6774 #ifdef PERL_PRESERVE_IVUV
6775 /* Got to punt this as an integer if needs be, but we don't issue
6776 warnings. Probably ought to make the sv_iv_please() that does
6777 the conversion if possible, and silently. */
6778 int numtype = grok_number(SvPVX(sv), SvCUR(sv), NULL);
6779 if (numtype && !(numtype & IS_NUMBER_INFINITY)) {
6780 /* Need to try really hard to see if it's an integer.
6781 9.22337203685478e+18 is an integer.
6782 but "9.22337203685478e+18" + 0 is UV=9223372036854779904
6783 so $a="9.22337203685478e+18"; $a+0; $a++
6784 needs to be the same as $a="9.22337203685478e+18"; $a++
6791 /* sv_2iv *should* have made this an NV */
6792 if (flags & SVp_NOK) {
6793 (void)SvNOK_only(sv);
6797 /* I don't think we can get here. Maybe I should assert this
6798 And if we do get here I suspect that sv_setnv will croak. NWC
6800 #if defined(USE_LONG_DOUBLE)
6801 DEBUG_c(PerlIO_printf(Perl_debug_log,"sv_inc punt failed to convert '%s' to IOK or NOKp, UV=0x%"UVxf" NV=%"PERL_PRIgldbl"\n",
6802 SvPVX(sv), SvIVX(sv), SvNVX(sv)));
6804 DEBUG_c(PerlIO_printf(Perl_debug_log,"sv_inc punt failed to convert '%s' to IOK or NOKp, UV=0x%"UVxf" NV=%"NVgf"\n",
6805 SvPVX(sv), SvIVX(sv), SvNVX(sv)));
6808 #endif /* PERL_PRESERVE_IVUV */
6809 sv_setnv(sv,Atof(SvPVX(sv)) + 1.0);
6813 while (d >= SvPVX(sv)) {
6821 /* MKS: The original code here died if letters weren't consecutive.
6822 * at least it didn't have to worry about non-C locales. The
6823 * new code assumes that ('z'-'a')==('Z'-'A'), letters are
6824 * arranged in order (although not consecutively) and that only
6825 * [A-Za-z] are accepted by isALPHA in the C locale.
6827 if (*d != 'z' && *d != 'Z') {
6828 do { ++*d; } while (!isALPHA(*d));
6831 *(d--) -= 'z' - 'a';
6836 *(d--) -= 'z' - 'a' + 1;
6840 /* oh,oh, the number grew */
6841 SvGROW(sv, SvCUR(sv) + 2);
6843 for (d = SvPVX(sv) + SvCUR(sv); d > SvPVX(sv); d--)
6854 Auto-decrement of the value in the SV, doing string to numeric conversion
6855 if necessary. Handles 'get' magic.
6861 Perl_sv_dec(pTHX_ register SV *sv)
6869 if (SvTHINKFIRST(sv)) {
6871 sv_force_normal_flags(sv, 0);
6872 if (SvREADONLY(sv)) {
6873 if (PL_curcop != &PL_compiling)
6874 Perl_croak(aTHX_ PL_no_modify);
6878 if (SvAMAGIC(sv) && AMG_CALLun(sv,dec))
6880 i = PTR2IV(SvRV(sv));
6885 /* Unlike sv_inc we don't have to worry about string-never-numbers
6886 and keeping them magic. But we mustn't warn on punting */
6887 flags = SvFLAGS(sv);
6888 if ((flags & SVf_IOK) || ((flags & (SVp_IOK | SVp_NOK)) == SVp_IOK)) {
6889 /* It's publicly an integer, or privately an integer-not-float */
6890 #ifdef PERL_PRESERVE_IVUV
6894 if (SvUVX(sv) == 0) {
6895 (void)SvIOK_only(sv);
6899 (void)SvIOK_only_UV(sv);
6903 if (SvIVX(sv) == IV_MIN)
6904 sv_setnv(sv, (NV)IV_MIN - 1.0);
6906 (void)SvIOK_only(sv);
6912 if (flags & SVp_NOK) {
6914 (void)SvNOK_only(sv);
6917 if (!(flags & SVp_POK)) {
6918 if ((flags & SVTYPEMASK) < SVt_PVNV)
6919 sv_upgrade(sv, SVt_NV);
6921 (void)SvNOK_only(sv);
6924 #ifdef PERL_PRESERVE_IVUV
6926 int numtype = grok_number(SvPVX(sv), SvCUR(sv), NULL);
6927 if (numtype && !(numtype & IS_NUMBER_INFINITY)) {
6928 /* Need to try really hard to see if it's an integer.
6929 9.22337203685478e+18 is an integer.
6930 but "9.22337203685478e+18" + 0 is UV=9223372036854779904
6931 so $a="9.22337203685478e+18"; $a+0; $a--
6932 needs to be the same as $a="9.22337203685478e+18"; $a--
6939 /* sv_2iv *should* have made this an NV */
6940 if (flags & SVp_NOK) {
6941 (void)SvNOK_only(sv);
6945 /* I don't think we can get here. Maybe I should assert this
6946 And if we do get here I suspect that sv_setnv will croak. NWC
6948 #if defined(USE_LONG_DOUBLE)
6949 DEBUG_c(PerlIO_printf(Perl_debug_log,"sv_dec punt failed to convert '%s' to IOK or NOKp, UV=0x%"UVxf" NV=%"PERL_PRIgldbl"\n",
6950 SvPVX(sv), SvIVX(sv), SvNVX(sv)));
6952 DEBUG_c(PerlIO_printf(Perl_debug_log,"sv_dec punt failed to convert '%s' to IOK or NOKp, UV=0x%"UVxf" NV=%"NVgf"\n",
6953 SvPVX(sv), SvIVX(sv), SvNVX(sv)));
6957 #endif /* PERL_PRESERVE_IVUV */
6958 sv_setnv(sv,Atof(SvPVX(sv)) - 1.0); /* punt */
6962 =for apidoc sv_mortalcopy
6964 Creates a new SV which is a copy of the original SV (using C<sv_setsv>).
6965 The new SV is marked as mortal. It will be destroyed "soon", either by an
6966 explicit call to FREETMPS, or by an implicit call at places such as
6967 statement boundaries. See also C<sv_newmortal> and C<sv_2mortal>.
6972 /* Make a string that will exist for the duration of the expression
6973 * evaluation. Actually, it may have to last longer than that, but
6974 * hopefully we won't free it until it has been assigned to a
6975 * permanent location. */
6978 Perl_sv_mortalcopy(pTHX_ SV *oldstr)
6983 sv_setsv(sv,oldstr);
6985 PL_tmps_stack[++PL_tmps_ix] = sv;
6991 =for apidoc sv_newmortal
6993 Creates a new null SV which is mortal. The reference count of the SV is
6994 set to 1. It will be destroyed "soon", either by an explicit call to
6995 FREETMPS, or by an implicit call at places such as statement boundaries.
6996 See also C<sv_mortalcopy> and C<sv_2mortal>.
7002 Perl_sv_newmortal(pTHX)
7007 SvFLAGS(sv) = SVs_TEMP;
7009 PL_tmps_stack[++PL_tmps_ix] = sv;
7014 =for apidoc sv_2mortal
7016 Marks an existing SV as mortal. The SV will be destroyed "soon", either
7017 by an explicit call to FREETMPS, or by an implicit call at places such as
7018 statement boundaries. See also C<sv_newmortal> and C<sv_mortalcopy>.
7024 Perl_sv_2mortal(pTHX_ register SV *sv)
7028 if (SvREADONLY(sv) && SvIMMORTAL(sv))
7031 PL_tmps_stack[++PL_tmps_ix] = sv;
7039 Creates a new SV and copies a string into it. The reference count for the
7040 SV is set to 1. If C<len> is zero, Perl will compute the length using
7041 strlen(). For efficiency, consider using C<newSVpvn> instead.
7047 Perl_newSVpv(pTHX_ const char *s, STRLEN len)
7054 sv_setpvn(sv,s,len);
7059 =for apidoc newSVpvn
7061 Creates a new SV and copies a string into it. The reference count for the
7062 SV is set to 1. Note that if C<len> is zero, Perl will create a zero length
7063 string. You are responsible for ensuring that the source string is at least
7070 Perl_newSVpvn(pTHX_ const char *s, STRLEN len)
7075 sv_setpvn(sv,s,len);
7080 =for apidoc newSVpvn_share
7082 Creates a new SV with its SvPVX pointing to a shared string in the string
7083 table. If the string does not already exist in the table, it is created
7084 first. Turns on READONLY and FAKE. The string's hash is stored in the UV
7085 slot of the SV; if the C<hash> parameter is non-zero, that value is used;
7086 otherwise the hash is computed. The idea here is that as the string table
7087 is used for shared hash keys these strings will have SvPVX == HeKEY and
7088 hash lookup will avoid string compare.
7094 Perl_newSVpvn_share(pTHX_ const char *src, I32 len, U32 hash)
7097 bool is_utf8 = FALSE;
7099 STRLEN tmplen = -len;
7101 /* See the note in hv.c:hv_fetch() --jhi */
7102 src = (char*)bytes_from_utf8((U8*)src, &tmplen, &is_utf8);
7106 PERL_HASH(hash, src, len);
7108 sv_upgrade(sv, SVt_PVIV);
7109 SvPVX(sv) = sharepvn(src, is_utf8?-len:len, hash);
7122 #if defined(PERL_IMPLICIT_CONTEXT)
7124 /* pTHX_ magic can't cope with varargs, so this is a no-context
7125 * version of the main function, (which may itself be aliased to us).
7126 * Don't access this version directly.
7130 Perl_newSVpvf_nocontext(const char* pat, ...)
7135 va_start(args, pat);
7136 sv = vnewSVpvf(pat, &args);
7143 =for apidoc newSVpvf
7145 Creates a new SV and initializes it with the string formatted like
7152 Perl_newSVpvf(pTHX_ const char* pat, ...)
7156 va_start(args, pat);
7157 sv = vnewSVpvf(pat, &args);
7162 /* backend for newSVpvf() and newSVpvf_nocontext() */
7165 Perl_vnewSVpvf(pTHX_ const char* pat, va_list* args)
7169 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
7176 Creates a new SV and copies a floating point value into it.
7177 The reference count for the SV is set to 1.
7183 Perl_newSVnv(pTHX_ NV n)
7195 Creates a new SV and copies an integer into it. The reference count for the
7202 Perl_newSViv(pTHX_ IV i)
7214 Creates a new SV and copies an unsigned integer into it.
7215 The reference count for the SV is set to 1.
7221 Perl_newSVuv(pTHX_ UV u)
7231 =for apidoc newRV_noinc
7233 Creates an RV wrapper for an SV. The reference count for the original
7234 SV is B<not> incremented.
7240 Perl_newRV_noinc(pTHX_ SV *tmpRef)
7245 sv_upgrade(sv, SVt_RV);
7252 /* newRV_inc is the official function name to use now.
7253 * newRV_inc is in fact #defined to newRV in sv.h
7257 Perl_newRV(pTHX_ SV *tmpRef)
7259 return newRV_noinc(SvREFCNT_inc(tmpRef));
7265 Creates a new SV which is an exact duplicate of the original SV.
7272 Perl_newSVsv(pTHX_ register SV *old)
7278 if (SvTYPE(old) == SVTYPEMASK) {
7279 if (ckWARN_d(WARN_INTERNAL))
7280 Perl_warner(aTHX_ packWARN(WARN_INTERNAL), "semi-panic: attempt to dup freed string");
7295 =for apidoc sv_reset
7297 Underlying implementation for the C<reset> Perl function.
7298 Note that the perl-level function is vaguely deprecated.
7304 Perl_sv_reset(pTHX_ register char *s, HV *stash)
7312 char todo[PERL_UCHAR_MAX+1];
7317 if (!*s) { /* reset ?? searches */
7318 for (pm = HvPMROOT(stash); pm; pm = pm->op_pmnext) {
7319 pm->op_pmdynflags &= ~PMdf_USED;
7324 /* reset variables */
7326 if (!HvARRAY(stash))
7329 Zero(todo, 256, char);
7331 i = (unsigned char)*s;
7335 max = (unsigned char)*s++;
7336 for ( ; i <= max; i++) {
7339 for (i = 0; i <= (I32) HvMAX(stash); i++) {
7340 for (entry = HvARRAY(stash)[i];
7342 entry = HeNEXT(entry))
7344 if (!todo[(U8)*HeKEY(entry)])
7346 gv = (GV*)HeVAL(entry);
7348 if (SvTHINKFIRST(sv)) {
7349 if (!SvREADONLY(sv) && SvROK(sv))
7354 if (SvTYPE(sv) >= SVt_PV) {
7356 if (SvPVX(sv) != Nullch)
7363 if (GvHV(gv) && !HvNAME(GvHV(gv))) {
7365 #ifdef USE_ENVIRON_ARRAY
7367 # ifdef USE_ITHREADS
7368 && PL_curinterp == aTHX
7372 environ[0] = Nullch;
7384 Using various gambits, try to get an IO from an SV: the IO slot if its a
7385 GV; or the recursive result if we're an RV; or the IO slot of the symbol
7386 named after the PV if we're a string.
7392 Perl_sv_2io(pTHX_ SV *sv)
7398 switch (SvTYPE(sv)) {
7406 Perl_croak(aTHX_ "Bad filehandle: %s", GvNAME(gv));
7410 Perl_croak(aTHX_ PL_no_usym, "filehandle");
7412 return sv_2io(SvRV(sv));
7413 gv = gv_fetchpv(SvPV(sv,n_a), FALSE, SVt_PVIO);
7419 Perl_croak(aTHX_ "Bad filehandle: %"SVf, sv);
7428 Using various gambits, try to get a CV from an SV; in addition, try if
7429 possible to set C<*st> and C<*gvp> to the stash and GV associated with it.
7435 Perl_sv_2cv(pTHX_ SV *sv, HV **st, GV **gvp, I32 lref)
7442 return *gvp = Nullgv, Nullcv;
7443 switch (SvTYPE(sv)) {
7462 SV **sp = &sv; /* Used in tryAMAGICunDEREF macro. */
7463 tryAMAGICunDEREF(to_cv);
7466 if (SvTYPE(sv) == SVt_PVCV) {
7475 Perl_croak(aTHX_ "Not a subroutine reference");
7480 gv = gv_fetchpv(SvPV(sv, n_a), lref, SVt_PVCV);
7486 if (lref && !GvCVu(gv)) {
7489 tmpsv = NEWSV(704,0);
7490 gv_efullname3(tmpsv, gv, Nullch);
7491 /* XXX this is probably not what they think they're getting.
7492 * It has the same effect as "sub name;", i.e. just a forward
7494 newSUB(start_subparse(FALSE, 0),
7495 newSVOP(OP_CONST, 0, tmpsv),
7500 Perl_croak(aTHX_ "Unable to create sub named \"%"SVf"\"",
7510 Returns true if the SV has a true value by Perl's rules.
7511 Use the C<SvTRUE> macro instead, which may call C<sv_true()> or may
7512 instead use an in-line version.
7518 Perl_sv_true(pTHX_ register SV *sv)
7524 if ((tXpv = (XPV*)SvANY(sv)) &&
7525 (tXpv->xpv_cur > 1 ||
7526 (tXpv->xpv_cur && *tXpv->xpv_pv != '0')))
7533 return SvIVX(sv) != 0;
7536 return SvNVX(sv) != 0.0;
7538 return sv_2bool(sv);
7546 A private implementation of the C<SvIVx> macro for compilers which can't
7547 cope with complex macro expressions. Always use the macro instead.
7553 Perl_sv_iv(pTHX_ register SV *sv)
7557 return (IV)SvUVX(sv);
7566 A private implementation of the C<SvUVx> macro for compilers which can't
7567 cope with complex macro expressions. Always use the macro instead.
7573 Perl_sv_uv(pTHX_ register SV *sv)
7578 return (UV)SvIVX(sv);
7586 A private implementation of the C<SvNVx> macro for compilers which can't
7587 cope with complex macro expressions. Always use the macro instead.
7593 Perl_sv_nv(pTHX_ register SV *sv)
7600 /* sv_pv() is now a macro using SvPV_nolen();
7601 * this function provided for binary compatibility only
7605 Perl_sv_pv(pTHX_ SV *sv)
7612 return sv_2pv(sv, &n_a);
7618 Use the C<SvPV_nolen> macro instead
7622 A private implementation of the C<SvPV> macro for compilers which can't
7623 cope with complex macro expressions. Always use the macro instead.
7629 Perl_sv_pvn(pTHX_ SV *sv, STRLEN *lp)
7635 return sv_2pv(sv, lp);
7640 Perl_sv_pvn_nomg(pTHX_ register SV *sv, STRLEN *lp)
7646 return sv_2pv_flags(sv, lp, 0);
7649 /* sv_pvn_force() is now a macro using Perl_sv_pvn_force_flags();
7650 * this function provided for binary compatibility only
7654 Perl_sv_pvn_force(pTHX_ SV *sv, STRLEN *lp)
7656 return sv_pvn_force_flags(sv, lp, SV_GMAGIC);
7660 =for apidoc sv_pvn_force
7662 Get a sensible string out of the SV somehow.
7663 A private implementation of the C<SvPV_force> macro for compilers which
7664 can't cope with complex macro expressions. Always use the macro instead.
7666 =for apidoc sv_pvn_force_flags
7668 Get a sensible string out of the SV somehow.
7669 If C<flags> has C<SV_GMAGIC> bit set, will C<mg_get> on C<sv> if
7670 appropriate, else not. C<sv_pvn_force> and C<sv_pvn_force_nomg> are
7671 implemented in terms of this function.
7672 You normally want to use the various wrapper macros instead: see
7673 C<SvPV_force> and C<SvPV_force_nomg>
7679 Perl_sv_pvn_force_flags(pTHX_ SV *sv, STRLEN *lp, I32 flags)
7683 if (SvTHINKFIRST(sv) && !SvROK(sv))
7684 sv_force_normal_flags(sv, 0);
7690 if (SvTYPE(sv) > SVt_PVLV && SvTYPE(sv) != SVt_PVFM) {
7691 Perl_croak(aTHX_ "Can't coerce %s to string in %s", sv_reftype(sv,0),
7695 s = sv_2pv_flags(sv, lp, flags);
7696 if (s != SvPVX(sv)) { /* Almost, but not quite, sv_setpvn() */
7701 (void)SvUPGRADE(sv, SVt_PV); /* Never FALSE */
7702 SvGROW(sv, len + 1);
7703 Move(s,SvPVX(sv),len,char);
7708 SvPOK_on(sv); /* validate pointer */
7710 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2pv(%s)\n",
7711 PTR2UV(sv),SvPVX(sv)));
7717 /* sv_pvbyte () is now a macro using Perl_sv_2pv_flags();
7718 * this function provided for binary compatibility only
7722 Perl_sv_pvbyte(pTHX_ SV *sv)
7724 sv_utf8_downgrade(sv,0);
7729 =for apidoc sv_pvbyte
7731 Use C<SvPVbyte_nolen> instead.
7733 =for apidoc sv_pvbyten
7735 A private implementation of the C<SvPVbyte> macro for compilers
7736 which can't cope with complex macro expressions. Always use the macro
7743 Perl_sv_pvbyten(pTHX_ SV *sv, STRLEN *lp)
7745 sv_utf8_downgrade(sv,0);
7746 return sv_pvn(sv,lp);
7750 =for apidoc sv_pvbyten_force
7752 A private implementation of the C<SvPVbytex_force> macro for compilers
7753 which can't cope with complex macro expressions. Always use the macro
7760 Perl_sv_pvbyten_force(pTHX_ SV *sv, STRLEN *lp)
7762 sv_utf8_downgrade(sv,0);
7763 return sv_pvn_force(sv,lp);
7766 /* sv_pvutf8 () is now a macro using Perl_sv_2pv_flags();
7767 * this function provided for binary compatibility only
7771 Perl_sv_pvutf8(pTHX_ SV *sv)
7773 sv_utf8_upgrade(sv);
7778 =for apidoc sv_pvutf8
7780 Use the C<SvPVutf8_nolen> macro instead
7782 =for apidoc sv_pvutf8n
7784 A private implementation of the C<SvPVutf8> macro for compilers
7785 which can't cope with complex macro expressions. Always use the macro
7792 Perl_sv_pvutf8n(pTHX_ SV *sv, STRLEN *lp)
7794 sv_utf8_upgrade(sv);
7795 return sv_pvn(sv,lp);
7799 =for apidoc sv_pvutf8n_force
7801 A private implementation of the C<SvPVutf8_force> macro for compilers
7802 which can't cope with complex macro expressions. Always use the macro
7809 Perl_sv_pvutf8n_force(pTHX_ SV *sv, STRLEN *lp)
7811 sv_utf8_upgrade(sv);
7812 return sv_pvn_force(sv,lp);
7816 =for apidoc sv_reftype
7818 Returns a string describing what the SV is a reference to.
7824 Perl_sv_reftype(pTHX_ SV *sv, int ob)
7826 if (ob && SvOBJECT(sv)) {
7827 if (HvNAME(SvSTASH(sv)))
7828 return HvNAME(SvSTASH(sv));
7833 switch (SvTYPE(sv)) {
7849 case SVt_PVLV: return SvROK(sv) ? "REF" : "LVALUE";
7850 case SVt_PVAV: return "ARRAY";
7851 case SVt_PVHV: return "HASH";
7852 case SVt_PVCV: return "CODE";
7853 case SVt_PVGV: return "GLOB";
7854 case SVt_PVFM: return "FORMAT";
7855 case SVt_PVIO: return "IO";
7856 default: return "UNKNOWN";
7862 =for apidoc sv_isobject
7864 Returns a boolean indicating whether the SV is an RV pointing to a blessed
7865 object. If the SV is not an RV, or if the object is not blessed, then this
7872 Perl_sv_isobject(pTHX_ SV *sv)
7889 Returns a boolean indicating whether the SV is blessed into the specified
7890 class. This does not check for subtypes; use C<sv_derived_from> to verify
7891 an inheritance relationship.
7897 Perl_sv_isa(pTHX_ SV *sv, const char *name)
7908 if (!HvNAME(SvSTASH(sv)))
7911 return strEQ(HvNAME(SvSTASH(sv)), name);
7917 Creates a new SV for the RV, C<rv>, to point to. If C<rv> is not an RV then
7918 it will be upgraded to one. If C<classname> is non-null then the new SV will
7919 be blessed in the specified package. The new SV is returned and its
7920 reference count is 1.
7926 Perl_newSVrv(pTHX_ SV *rv, const char *classname)
7932 SV_CHECK_THINKFIRST_COW_DROP(rv);
7935 if (SvTYPE(rv) >= SVt_PVMG) {
7936 U32 refcnt = SvREFCNT(rv);
7940 SvREFCNT(rv) = refcnt;
7943 if (SvTYPE(rv) < SVt_RV)
7944 sv_upgrade(rv, SVt_RV);
7945 else if (SvTYPE(rv) > SVt_RV) {
7946 (void)SvOOK_off(rv);
7947 if (SvPVX(rv) && SvLEN(rv))
7948 Safefree(SvPVX(rv));
7958 HV* stash = gv_stashpv(classname, TRUE);
7959 (void)sv_bless(rv, stash);
7965 =for apidoc sv_setref_pv
7967 Copies a pointer into a new SV, optionally blessing the SV. The C<rv>
7968 argument will be upgraded to an RV. That RV will be modified to point to
7969 the new SV. If the C<pv> argument is NULL then C<PL_sv_undef> will be placed
7970 into the SV. The C<classname> argument indicates the package for the
7971 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
7972 will be returned and will have a reference count of 1.
7974 Do not use with other Perl types such as HV, AV, SV, CV, because those
7975 objects will become corrupted by the pointer copy process.
7977 Note that C<sv_setref_pvn> copies the string while this copies the pointer.
7983 Perl_sv_setref_pv(pTHX_ SV *rv, const char *classname, void *pv)
7986 sv_setsv(rv, &PL_sv_undef);
7990 sv_setiv(newSVrv(rv,classname), PTR2IV(pv));
7995 =for apidoc sv_setref_iv
7997 Copies an integer into a new SV, optionally blessing the SV. The C<rv>
7998 argument will be upgraded to an RV. That RV will be modified to point to
7999 the new SV. The C<classname> argument indicates the package for the
8000 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
8001 will be returned and will have a reference count of 1.
8007 Perl_sv_setref_iv(pTHX_ SV *rv, const char *classname, IV iv)
8009 sv_setiv(newSVrv(rv,classname), iv);
8014 =for apidoc sv_setref_uv
8016 Copies an unsigned integer into a new SV, optionally blessing the SV. The C<rv>
8017 argument will be upgraded to an RV. That RV will be modified to point to
8018 the new SV. The C<classname> argument indicates the package for the
8019 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
8020 will be returned and will have a reference count of 1.
8026 Perl_sv_setref_uv(pTHX_ SV *rv, const char *classname, UV uv)
8028 sv_setuv(newSVrv(rv,classname), uv);
8033 =for apidoc sv_setref_nv
8035 Copies a double into a new SV, optionally blessing the SV. The C<rv>
8036 argument will be upgraded to an RV. That RV will be modified to point to
8037 the new SV. The C<classname> argument indicates the package for the
8038 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
8039 will be returned and will have a reference count of 1.
8045 Perl_sv_setref_nv(pTHX_ SV *rv, const char *classname, NV nv)
8047 sv_setnv(newSVrv(rv,classname), nv);
8052 =for apidoc sv_setref_pvn
8054 Copies a string into a new SV, optionally blessing the SV. The length of the
8055 string must be specified with C<n>. The C<rv> argument will be upgraded to
8056 an RV. That RV will be modified to point to the new SV. The C<classname>
8057 argument indicates the package for the blessing. Set C<classname> to
8058 C<Nullch> to avoid the blessing. The new SV will be returned and will have
8059 a reference count of 1.
8061 Note that C<sv_setref_pv> copies the pointer while this copies the string.
8067 Perl_sv_setref_pvn(pTHX_ SV *rv, const char *classname, char *pv, STRLEN n)
8069 sv_setpvn(newSVrv(rv,classname), pv, n);
8074 =for apidoc sv_bless
8076 Blesses an SV into a specified package. The SV must be an RV. The package
8077 must be designated by its stash (see C<gv_stashpv()>). The reference count
8078 of the SV is unaffected.
8084 Perl_sv_bless(pTHX_ SV *sv, HV *stash)
8088 Perl_croak(aTHX_ "Can't bless non-reference value");
8090 if (SvFLAGS(tmpRef) & (SVs_OBJECT|SVf_READONLY)) {
8091 if (SvREADONLY(tmpRef))
8092 Perl_croak(aTHX_ PL_no_modify);
8093 if (SvOBJECT(tmpRef)) {
8094 if (SvTYPE(tmpRef) != SVt_PVIO)
8096 SvREFCNT_dec(SvSTASH(tmpRef));
8099 SvOBJECT_on(tmpRef);
8100 if (SvTYPE(tmpRef) != SVt_PVIO)
8102 (void)SvUPGRADE(tmpRef, SVt_PVMG);
8103 SvSTASH(tmpRef) = (HV*)SvREFCNT_inc(stash);
8110 if(SvSMAGICAL(tmpRef))
8111 if(mg_find(tmpRef, PERL_MAGIC_ext) || mg_find(tmpRef, PERL_MAGIC_uvar))
8119 /* Downgrades a PVGV to a PVMG.
8123 S_sv_unglob(pTHX_ SV *sv)
8127 assert(SvTYPE(sv) == SVt_PVGV);
8132 SvREFCNT_dec(GvSTASH(sv));
8133 GvSTASH(sv) = Nullhv;
8135 sv_unmagic(sv, PERL_MAGIC_glob);
8136 Safefree(GvNAME(sv));
8139 /* need to keep SvANY(sv) in the right arena */
8140 xpvmg = new_XPVMG();
8141 StructCopy(SvANY(sv), xpvmg, XPVMG);
8142 del_XPVGV(SvANY(sv));
8145 SvFLAGS(sv) &= ~SVTYPEMASK;
8146 SvFLAGS(sv) |= SVt_PVMG;
8150 =for apidoc sv_unref_flags
8152 Unsets the RV status of the SV, and decrements the reference count of
8153 whatever was being referenced by the RV. This can almost be thought of
8154 as a reversal of C<newSVrv>. The C<cflags> argument can contain
8155 C<SV_IMMEDIATE_UNREF> to force the reference count to be decremented
8156 (otherwise the decrementing is conditional on the reference count being
8157 different from one or the reference being a readonly SV).
8164 Perl_sv_unref_flags(pTHX_ SV *sv, U32 flags)
8168 if (SvWEAKREF(sv)) {
8176 /* You can't have a || SvREADONLY(rv) here, as $a = $$a, where $a was
8177 assigned to as BEGIN {$a = \"Foo"} will fail. */
8178 if (SvREFCNT(rv) != 1 || (flags & SV_IMMEDIATE_UNREF))
8180 else /* XXX Hack, but hard to make $a=$a->[1] work otherwise */
8181 sv_2mortal(rv); /* Schedule for freeing later */
8185 =for apidoc sv_unref
8187 Unsets the RV status of the SV, and decrements the reference count of
8188 whatever was being referenced by the RV. This can almost be thought of
8189 as a reversal of C<newSVrv>. This is C<sv_unref_flags> with the C<flag>
8190 being zero. See C<SvROK_off>.
8196 Perl_sv_unref(pTHX_ SV *sv)
8198 sv_unref_flags(sv, 0);
8202 =for apidoc sv_taint
8204 Taint an SV. Use C<SvTAINTED_on> instead.
8209 Perl_sv_taint(pTHX_ SV *sv)
8211 sv_magic((sv), Nullsv, PERL_MAGIC_taint, Nullch, 0);
8215 =for apidoc sv_untaint
8217 Untaint an SV. Use C<SvTAINTED_off> instead.
8222 Perl_sv_untaint(pTHX_ SV *sv)
8224 if (SvTYPE(sv) >= SVt_PVMG && SvMAGIC(sv)) {
8225 MAGIC *mg = mg_find(sv, PERL_MAGIC_taint);
8232 =for apidoc sv_tainted
8234 Test an SV for taintedness. Use C<SvTAINTED> instead.
8239 Perl_sv_tainted(pTHX_ SV *sv)
8241 if (SvTYPE(sv) >= SVt_PVMG && SvMAGIC(sv)) {
8242 MAGIC *mg = mg_find(sv, PERL_MAGIC_taint);
8243 if (mg && ((mg->mg_len & 1) || ((mg->mg_len & 2) && mg->mg_obj == sv)))
8250 =for apidoc sv_setpviv
8252 Copies an integer into the given SV, also updating its string value.
8253 Does not handle 'set' magic. See C<sv_setpviv_mg>.
8259 Perl_sv_setpviv(pTHX_ SV *sv, IV iv)
8261 char buf[TYPE_CHARS(UV)];
8263 char *ptr = uiv_2buf(buf, iv, 0, 0, &ebuf);
8265 sv_setpvn(sv, ptr, ebuf - ptr);
8269 =for apidoc sv_setpviv_mg
8271 Like C<sv_setpviv>, but also handles 'set' magic.
8277 Perl_sv_setpviv_mg(pTHX_ SV *sv, IV iv)
8279 char buf[TYPE_CHARS(UV)];
8281 char *ptr = uiv_2buf(buf, iv, 0, 0, &ebuf);
8283 sv_setpvn(sv, ptr, ebuf - ptr);
8287 #if defined(PERL_IMPLICIT_CONTEXT)
8289 /* pTHX_ magic can't cope with varargs, so this is a no-context
8290 * version of the main function, (which may itself be aliased to us).
8291 * Don't access this version directly.
8295 Perl_sv_setpvf_nocontext(SV *sv, const char* pat, ...)
8299 va_start(args, pat);
8300 sv_vsetpvf(sv, pat, &args);
8304 /* pTHX_ magic can't cope with varargs, so this is a no-context
8305 * version of the main function, (which may itself be aliased to us).
8306 * Don't access this version directly.
8310 Perl_sv_setpvf_mg_nocontext(SV *sv, const char* pat, ...)
8314 va_start(args, pat);
8315 sv_vsetpvf_mg(sv, pat, &args);
8321 =for apidoc sv_setpvf
8323 Processes its arguments like C<sprintf> and sets an SV to the formatted
8324 output. Does not handle 'set' magic. See C<sv_setpvf_mg>.
8330 Perl_sv_setpvf(pTHX_ SV *sv, const char* pat, ...)
8333 va_start(args, pat);
8334 sv_vsetpvf(sv, pat, &args);
8338 /* backend for C<sv_setpvf> and C<sv_setpvf_nocontext> */
8341 Perl_sv_vsetpvf(pTHX_ SV *sv, const char* pat, va_list* args)
8343 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
8347 =for apidoc sv_setpvf_mg
8349 Like C<sv_setpvf>, but also handles 'set' magic.
8355 Perl_sv_setpvf_mg(pTHX_ SV *sv, const char* pat, ...)
8358 va_start(args, pat);
8359 sv_vsetpvf_mg(sv, pat, &args);
8363 /* backend for C<sv_setpvf_mg> C<setpvf_mg_nocontext> */
8366 Perl_sv_vsetpvf_mg(pTHX_ SV *sv, const char* pat, va_list* args)
8368 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
8372 #if defined(PERL_IMPLICIT_CONTEXT)
8374 /* pTHX_ magic can't cope with varargs, so this is a no-context
8375 * version of the main function, (which may itself be aliased to us).
8376 * Don't access this version directly.
8380 Perl_sv_catpvf_nocontext(SV *sv, const char* pat, ...)
8384 va_start(args, pat);
8385 sv_vcatpvf(sv, pat, &args);
8389 /* pTHX_ magic can't cope with varargs, so this is a no-context
8390 * version of the main function, (which may itself be aliased to us).
8391 * Don't access this version directly.
8395 Perl_sv_catpvf_mg_nocontext(SV *sv, const char* pat, ...)
8399 va_start(args, pat);
8400 sv_vcatpvf_mg(sv, pat, &args);
8406 =for apidoc sv_catpvf
8408 Processes its arguments like C<sprintf> and appends the formatted
8409 output to an SV. If the appended data contains "wide" characters
8410 (including, but not limited to, SVs with a UTF-8 PV formatted with %s,
8411 and characters >255 formatted with %c), the original SV might get
8412 upgraded to UTF-8. Handles 'get' magic, but not 'set' magic.
8413 C<SvSETMAGIC()> must typically be called after calling this function
8414 to handle 'set' magic.
8419 Perl_sv_catpvf(pTHX_ SV *sv, const char* pat, ...)
8422 va_start(args, pat);
8423 sv_vcatpvf(sv, pat, &args);
8427 /* backend for C<sv_catpvf> and C<catpvf_mg_nocontext> */
8430 Perl_sv_vcatpvf(pTHX_ SV *sv, const char* pat, va_list* args)
8432 sv_vcatpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
8436 =for apidoc sv_catpvf_mg
8438 Like C<sv_catpvf>, but also handles 'set' magic.
8444 Perl_sv_catpvf_mg(pTHX_ SV *sv, const char* pat, ...)
8447 va_start(args, pat);
8448 sv_vcatpvf_mg(sv, pat, &args);
8452 /* backend for C<catpvf_mg> and C<catpvf_mg_nocontext> */
8455 Perl_sv_vcatpvf_mg(pTHX_ SV *sv, const char* pat, va_list* args)
8457 sv_vcatpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
8462 =for apidoc sv_vsetpvfn
8464 Works like C<vcatpvfn> but copies the text into the SV instead of
8467 Usually used via one of its frontends C<sv_setpvf> and C<sv_setpvf_mg>.
8473 Perl_sv_vsetpvfn(pTHX_ SV *sv, const char *pat, STRLEN patlen, va_list *args, SV **svargs, I32 svmax, bool *maybe_tainted)
8475 sv_setpvn(sv, "", 0);
8476 sv_vcatpvfn(sv, pat, patlen, args, svargs, svmax, maybe_tainted);
8479 /* private function for use in sv_vcatpvfn via the EXPECT_NUMBER macro */
8482 S_expect_number(pTHX_ char** pattern)
8485 switch (**pattern) {
8486 case '1': case '2': case '3':
8487 case '4': case '5': case '6':
8488 case '7': case '8': case '9':
8489 while (isDIGIT(**pattern))
8490 var = var * 10 + (*(*pattern)++ - '0');
8494 #define EXPECT_NUMBER(pattern, var) (var = S_expect_number(aTHX_ &pattern))
8497 =for apidoc sv_vcatpvfn
8499 Processes its arguments like C<vsprintf> and appends the formatted output
8500 to an SV. Uses an array of SVs if the C style variable argument list is
8501 missing (NULL). When running with taint checks enabled, indicates via
8502 C<maybe_tainted> if results are untrustworthy (often due to the use of
8505 Usually used via one of its frontends C<sv_catpvf> and C<sv_catpvf_mg>.
8511 Perl_sv_vcatpvfn(pTHX_ SV *sv, const char *pat, STRLEN patlen, va_list *args, SV **svargs, I32 svmax, bool *maybe_tainted)
8518 static char nullstr[] = "(null)";
8520 bool has_utf8; /* has the result utf8? */
8521 bool pat_utf8; /* the pattern is in utf8? */
8524 has_utf8 = pat_utf8 = DO_UTF8(sv);
8526 /* no matter what, this is a string now */
8527 (void)SvPV_force(sv, origlen);
8529 /* special-case "", "%s", and "%_" */
8532 if (patlen == 2 && pat[0] == '%') {
8536 char *s = va_arg(*args, char*);
8537 sv_catpv(sv, s ? s : nullstr);
8539 else if (svix < svmax) {
8540 sv_catsv(sv, *svargs);
8541 if (DO_UTF8(*svargs))
8547 argsv = va_arg(*args, SV*);
8548 sv_catsv(sv, argsv);
8553 /* See comment on '_' below */
8558 if (!args && svix < svmax && DO_UTF8(*svargs))
8561 patend = (char*)pat + patlen;
8562 for (p = (char*)pat; p < patend; p = q) {
8565 bool vectorize = FALSE;
8566 bool vectorarg = FALSE;
8567 bool vec_utf8 = FALSE;
8573 bool has_precis = FALSE;
8576 bool is_utf8 = FALSE; /* is this item utf8? */
8577 #ifdef HAS_LDBL_SPRINTF_BUG
8578 /* This is to try to fix a bug with irix/nonstop-ux/powerux and
8579 with sfio - Allen <allens@cpan.org> */
8580 bool fix_ldbl_sprintf_bug = FALSE;
8584 U8 utf8buf[UTF8_MAXLEN+1];
8585 STRLEN esignlen = 0;
8587 char *eptr = Nullch;
8589 /* Times 4: a decimal digit takes more than 3 binary digits.
8590 * NV_DIG: mantissa takes than many decimal digits.
8591 * Plus 32: Playing safe. */
8592 char ebuf[IV_DIG * 4 + NV_DIG + 32];
8593 /* large enough for "%#.#f" --chip */
8594 /* what about long double NVs? --jhi */
8597 U8 *vecstr = Null(U8*);
8604 /* we need a long double target in case HAS_LONG_DOUBLE but
8607 #if defined(HAS_LONG_DOUBLE) && LONG_DOUBLESIZE > DOUBLESIZE
8616 STRLEN dotstrlen = 1;
8617 I32 efix = 0; /* explicit format parameter index */
8618 I32 ewix = 0; /* explicit width index */
8619 I32 epix = 0; /* explicit precision index */
8620 I32 evix = 0; /* explicit vector index */
8621 bool asterisk = FALSE;
8623 /* echo everything up to the next format specification */
8624 for (q = p; q < patend && *q != '%'; ++q) ;
8626 if (has_utf8 && !pat_utf8)
8627 sv_catpvn_utf8_upgrade(sv, p, q - p, nsv);
8629 sv_catpvn(sv, p, q - p);
8636 We allow format specification elements in this order:
8637 \d+\$ explicit format parameter index
8639 v|\*(\d+\$)?v vector with optional (optionally specified) arg
8640 0 flag (as above): repeated to allow "v02"
8641 \d+|\*(\d+\$)? width using optional (optionally specified) arg
8642 \.(\d*|\*(\d+\$)?) precision using optional (optionally specified) arg
8644 [%bcdefginopsux_DFOUX] format (mandatory)
8646 if (EXPECT_NUMBER(q, width)) {
8687 if (EXPECT_NUMBER(q, ewix))
8696 if ((vectorarg = asterisk)) {
8708 EXPECT_NUMBER(q, width);
8713 vecsv = va_arg(*args, SV*);
8715 vecsv = (evix ? evix <= svmax : svix < svmax) ?
8716 svargs[evix ? evix-1 : svix++] : &PL_sv_undef;
8717 dotstr = SvPVx(vecsv, dotstrlen);
8722 vecsv = va_arg(*args, SV*);
8723 vecstr = (U8*)SvPVx(vecsv,veclen);
8724 vec_utf8 = DO_UTF8(vecsv);
8726 else if (efix ? efix <= svmax : svix < svmax) {
8727 vecsv = svargs[efix ? efix-1 : svix++];
8728 vecstr = (U8*)SvPVx(vecsv,veclen);
8729 vec_utf8 = DO_UTF8(vecsv);
8739 i = va_arg(*args, int);
8741 i = (ewix ? ewix <= svmax : svix < svmax) ?
8742 SvIVx(svargs[ewix ? ewix-1 : svix++]) : 0;
8744 width = (i < 0) ? -i : i;
8754 if (EXPECT_NUMBER(q, epix) && *q++ != '$')
8756 /* XXX: todo, support specified precision parameter */
8760 i = va_arg(*args, int);
8762 i = (ewix ? ewix <= svmax : svix < svmax)
8763 ? SvIVx(svargs[ewix ? ewix-1 : svix++]) : 0;
8764 precis = (i < 0) ? 0 : i;
8769 precis = precis * 10 + (*q++ - '0');
8778 case 'I': /* Ix, I32x, and I64x */
8780 if (q[1] == '6' && q[2] == '4') {
8786 if (q[1] == '3' && q[2] == '2') {
8796 #if defined(HAS_QUAD) || defined(HAS_LONG_DOUBLE)
8807 #if defined(HAS_QUAD) || defined(HAS_LONG_DOUBLE)
8808 if (*(q + 1) == 'l') { /* lld, llf */
8833 argsv = (efix ? efix <= svmax : svix < svmax) ?
8834 svargs[efix ? efix-1 : svix++] : &PL_sv_undef;
8841 uv = (args && !vectorize) ? va_arg(*args, int) : SvIVx(argsv);
8843 (!UNI_IS_INVARIANT(uv) && SvUTF8(sv)))
8845 eptr = (char*)utf8buf;
8846 elen = uvchr_to_utf8((U8*)eptr, uv) - utf8buf;
8857 if (args && !vectorize) {
8858 eptr = va_arg(*args, char*);
8860 #ifdef MACOS_TRADITIONAL
8861 /* On MacOS, %#s format is used for Pascal strings */
8866 elen = strlen(eptr);
8869 elen = sizeof nullstr - 1;
8873 eptr = SvPVx(argsv, elen);
8874 if (DO_UTF8(argsv)) {
8875 if (has_precis && precis < elen) {
8877 sv_pos_u2b(argsv, &p, 0); /* sticks at end */
8880 if (width) { /* fudge width (can't fudge elen) */
8881 width += elen - sv_len_utf8(argsv);
8890 * The "%_" hack might have to be changed someday,
8891 * if ISO or ANSI decide to use '_' for something.
8892 * So we keep it hidden from users' code.
8894 if (!args || vectorize)
8896 argsv = va_arg(*args, SV*);
8897 eptr = SvPVx(argsv, elen);
8903 if (has_precis && elen > precis)
8910 if (alt || vectorize)
8912 uv = PTR2UV(args ? va_arg(*args, void*) : argsv);
8930 uv = utf8n_to_uvchr(vecstr, veclen, &ulen,
8939 esignbuf[esignlen++] = plus;
8943 case 'h': iv = (short)va_arg(*args, int); break;
8944 default: iv = va_arg(*args, int); break;
8945 case 'l': iv = va_arg(*args, long); break;
8946 case 'V': iv = va_arg(*args, IV); break;
8948 case 'q': iv = va_arg(*args, Quad_t); break;
8955 case 'h': iv = (short)iv; break;
8957 case 'l': iv = (long)iv; break;
8960 case 'q': iv = (Quad_t)iv; break;
8964 if ( !vectorize ) /* we already set uv above */
8969 esignbuf[esignlen++] = plus;
8973 esignbuf[esignlen++] = '-';
9016 uv = utf8n_to_uvchr(vecstr, veclen, &ulen,
9027 case 'h': uv = (unsigned short)va_arg(*args, unsigned); break;
9028 default: uv = va_arg(*args, unsigned); break;
9029 case 'l': uv = va_arg(*args, unsigned long); break;
9030 case 'V': uv = va_arg(*args, UV); break;
9032 case 'q': uv = va_arg(*args, Quad_t); break;
9039 case 'h': uv = (unsigned short)uv; break;
9041 case 'l': uv = (unsigned long)uv; break;
9044 case 'q': uv = (Quad_t)uv; break;
9050 eptr = ebuf + sizeof ebuf;
9056 p = (char*)((c == 'X')
9057 ? "0123456789ABCDEF" : "0123456789abcdef");
9063 esignbuf[esignlen++] = '0';
9064 esignbuf[esignlen++] = c; /* 'x' or 'X' */
9070 *--eptr = '0' + dig;
9072 if (alt && *eptr != '0')
9078 *--eptr = '0' + dig;
9081 esignbuf[esignlen++] = '0';
9082 esignbuf[esignlen++] = 'b';
9085 default: /* it had better be ten or less */
9086 #if defined(PERL_Y2KWARN)
9087 if (ckWARN(WARN_Y2K)) {
9089 char *s = SvPV(sv,n);
9090 if (n >= 2 && s[n-2] == '1' && s[n-1] == '9'
9091 && (n == 2 || !isDIGIT(s[n-3])))
9093 Perl_warner(aTHX_ packWARN(WARN_Y2K),
9094 "Possible Y2K bug: %%%c %s",
9095 c, "format string following '19'");
9101 *--eptr = '0' + dig;
9102 } while (uv /= base);
9105 elen = (ebuf + sizeof ebuf) - eptr;
9108 zeros = precis - elen;
9109 else if (precis == 0 && elen == 1 && *eptr == '0')
9114 /* FLOATING POINT */
9117 c = 'f'; /* maybe %F isn't supported here */
9123 /* This is evil, but floating point is even more evil */
9125 /* for SV-style calling, we can only get NV
9126 for C-style calling, we assume %f is double;
9127 for simplicity we allow any of %Lf, %llf, %qf for long double
9131 #if defined(USE_LONG_DOUBLE)
9135 /* [perl #20339] - we should accept and ignore %lf rather than die */
9139 #if defined(USE_LONG_DOUBLE)
9140 intsize = args ? 0 : 'q';
9144 #if defined(HAS_LONG_DOUBLE)
9153 /* now we need (long double) if intsize == 'q', else (double) */
9154 nv = (args && !vectorize) ?
9155 #if LONG_DOUBLESIZE > DOUBLESIZE
9157 va_arg(*args, long double) :
9158 va_arg(*args, double)
9160 va_arg(*args, double)
9166 if (c != 'e' && c != 'E') {
9168 /* FIXME: if HAS_LONG_DOUBLE but not USE_LONG_DOUBLE this
9169 will cast our (long double) to (double) */
9170 (void)Perl_frexp(nv, &i);
9171 if (i == PERL_INT_MIN)
9172 Perl_die(aTHX_ "panic: frexp");
9174 need = BIT_DIGITS(i);
9176 need += has_precis ? precis : 6; /* known default */
9181 #ifdef HAS_LDBL_SPRINTF_BUG
9182 /* This is to try to fix a bug with irix/nonstop-ux/powerux and
9183 with sfio - Allen <allens@cpan.org> */
9186 # define MY_DBL_MAX DBL_MAX
9187 # else /* XXX guessing! HUGE_VAL may be defined as infinity, so not using */
9188 # if DOUBLESIZE >= 8
9189 # define MY_DBL_MAX 1.7976931348623157E+308L
9191 # define MY_DBL_MAX 3.40282347E+38L
9195 # ifdef HAS_LDBL_SPRINTF_BUG_LESS1 /* only between -1L & 1L - Allen */
9196 # define MY_DBL_MAX_BUG 1L
9198 # define MY_DBL_MAX_BUG MY_DBL_MAX
9202 # define MY_DBL_MIN DBL_MIN
9203 # else /* XXX guessing! -Allen */
9204 # if DOUBLESIZE >= 8
9205 # define MY_DBL_MIN 2.2250738585072014E-308L
9207 # define MY_DBL_MIN 1.17549435E-38L
9211 if ((intsize == 'q') && (c == 'f') &&
9212 ((nv < MY_DBL_MAX_BUG) && (nv > -MY_DBL_MAX_BUG)) &&
9214 /* it's going to be short enough that
9215 * long double precision is not needed */
9217 if ((nv <= 0L) && (nv >= -0L))
9218 fix_ldbl_sprintf_bug = TRUE; /* 0 is 0 - easiest */
9220 /* would use Perl_fp_class as a double-check but not
9221 * functional on IRIX - see perl.h comments */
9223 if ((nv >= MY_DBL_MIN) || (nv <= -MY_DBL_MIN)) {
9224 /* It's within the range that a double can represent */
9225 #if defined(DBL_MAX) && !defined(DBL_MIN)
9226 if ((nv >= ((long double)1/DBL_MAX)) ||
9227 (nv <= (-(long double)1/DBL_MAX)))
9229 fix_ldbl_sprintf_bug = TRUE;
9232 if (fix_ldbl_sprintf_bug == TRUE) {
9242 # undef MY_DBL_MAX_BUG
9245 #endif /* HAS_LDBL_SPRINTF_BUG */
9247 need += 20; /* fudge factor */
9248 if (PL_efloatsize < need) {
9249 Safefree(PL_efloatbuf);
9250 PL_efloatsize = need + 20; /* more fudge */
9251 New(906, PL_efloatbuf, PL_efloatsize, char);
9252 PL_efloatbuf[0] = '\0';
9255 eptr = ebuf + sizeof ebuf;
9258 /* FIXME: what to do if HAS_LONG_DOUBLE but not PERL_PRIfldbl? */
9259 #if defined(HAS_LONG_DOUBLE) && defined(PERL_PRIfldbl)
9260 if (intsize == 'q') {
9261 /* Copy the one or more characters in a long double
9262 * format before the 'base' ([efgEFG]) character to
9263 * the format string. */
9264 static char const prifldbl[] = PERL_PRIfldbl;
9265 char const *p = prifldbl + sizeof(prifldbl) - 3;
9266 while (p >= prifldbl) { *--eptr = *p--; }
9271 do { *--eptr = '0' + (base % 10); } while (base /= 10);
9276 do { *--eptr = '0' + (base % 10); } while (base /= 10);
9288 /* No taint. Otherwise we are in the strange situation
9289 * where printf() taints but print($float) doesn't.
9291 #if defined(HAS_LONG_DOUBLE)
9293 (void)sprintf(PL_efloatbuf, eptr, nv);
9295 (void)sprintf(PL_efloatbuf, eptr, (double)nv);
9297 (void)sprintf(PL_efloatbuf, eptr, nv);
9299 eptr = PL_efloatbuf;
9300 elen = strlen(PL_efloatbuf);
9306 i = SvCUR(sv) - origlen;
9307 if (args && !vectorize) {
9309 case 'h': *(va_arg(*args, short*)) = i; break;
9310 default: *(va_arg(*args, int*)) = i; break;
9311 case 'l': *(va_arg(*args, long*)) = i; break;
9312 case 'V': *(va_arg(*args, IV*)) = i; break;
9314 case 'q': *(va_arg(*args, Quad_t*)) = i; break;
9319 sv_setuv_mg(argsv, (UV)i);
9321 continue; /* not "break" */
9327 if (!args && ckWARN(WARN_PRINTF) &&
9328 (PL_op->op_type == OP_PRTF || PL_op->op_type == OP_SPRINTF)) {
9329 SV *msg = sv_newmortal();
9330 Perl_sv_setpvf(aTHX_ msg, "Invalid conversion in %sprintf: ",
9331 (PL_op->op_type == OP_PRTF) ? "" : "s");
9334 Perl_sv_catpvf(aTHX_ msg,
9335 "\"%%%c\"", c & 0xFF);
9337 Perl_sv_catpvf(aTHX_ msg,
9338 "\"%%\\%03"UVof"\"",
9341 sv_catpv(msg, "end of string");
9342 Perl_warner(aTHX_ packWARN(WARN_PRINTF), "%"SVf, msg); /* yes, this is reentrant */
9345 /* output mangled stuff ... */
9351 /* ... right here, because formatting flags should not apply */
9352 SvGROW(sv, SvCUR(sv) + elen + 1);
9354 Copy(eptr, p, elen, char);
9357 SvCUR(sv) = p - SvPVX(sv);
9359 continue; /* not "break" */
9362 if (is_utf8 != has_utf8) {
9365 sv_utf8_upgrade(sv);
9368 SV *nsv = sv_2mortal(newSVpvn(eptr, elen));
9369 sv_utf8_upgrade(nsv);
9373 SvGROW(sv, SvCUR(sv) + elen + 1);
9377 /* Use memchr() instead of strchr(), as eptr is not guaranteed */
9378 /* to point to a null-terminated string. */
9379 if (left && ckWARN(WARN_PRINTF) && memchr(eptr, '\n', elen) &&
9380 (PL_op->op_type == OP_PRTF || PL_op->op_type == OP_SPRINTF))
9381 Perl_warner(aTHX_ packWARN(WARN_PRINTF),
9382 "Newline in left-justified string for %sprintf",
9383 (PL_op->op_type == OP_PRTF) ? "" : "s");
9385 have = esignlen + zeros + elen;
9386 need = (have > width ? have : width);
9389 SvGROW(sv, SvCUR(sv) + need + dotstrlen + 1);
9391 if (esignlen && fill == '0') {
9392 for (i = 0; i < (int)esignlen; i++)
9396 memset(p, fill, gap);
9399 if (esignlen && fill != '0') {
9400 for (i = 0; i < (int)esignlen; i++)
9404 for (i = zeros; i; i--)
9408 Copy(eptr, p, elen, char);
9412 memset(p, ' ', gap);
9417 Copy(dotstr, p, dotstrlen, char);
9421 vectorize = FALSE; /* done iterating over vecstr */
9428 SvCUR(sv) = p - SvPVX(sv);
9436 /* =========================================================================
9438 =head1 Cloning an interpreter
9440 All the macros and functions in this section are for the private use of
9441 the main function, perl_clone().
9443 The foo_dup() functions make an exact copy of an existing foo thinngy.
9444 During the course of a cloning, a hash table is used to map old addresses
9445 to new addresses. The table is created and manipulated with the
9446 ptr_table_* functions.
9450 ============================================================================*/
9453 #if defined(USE_ITHREADS)
9455 #ifndef GpREFCNT_inc
9456 # define GpREFCNT_inc(gp) ((gp) ? (++(gp)->gp_refcnt, (gp)) : (GP*)NULL)
9460 #define sv_dup_inc(s,t) SvREFCNT_inc(sv_dup(s,t))
9461 #define av_dup(s,t) (AV*)sv_dup((SV*)s,t)
9462 #define av_dup_inc(s,t) (AV*)SvREFCNT_inc(sv_dup((SV*)s,t))
9463 #define hv_dup(s,t) (HV*)sv_dup((SV*)s,t)
9464 #define hv_dup_inc(s,t) (HV*)SvREFCNT_inc(sv_dup((SV*)s,t))
9465 #define cv_dup(s,t) (CV*)sv_dup((SV*)s,t)
9466 #define cv_dup_inc(s,t) (CV*)SvREFCNT_inc(sv_dup((SV*)s,t))
9467 #define io_dup(s,t) (IO*)sv_dup((SV*)s,t)
9468 #define io_dup_inc(s,t) (IO*)SvREFCNT_inc(sv_dup((SV*)s,t))
9469 #define gv_dup(s,t) (GV*)sv_dup((SV*)s,t)
9470 #define gv_dup_inc(s,t) (GV*)SvREFCNT_inc(sv_dup((SV*)s,t))
9471 #define SAVEPV(p) (p ? savepv(p) : Nullch)
9472 #define SAVEPVN(p,n) (p ? savepvn(p,n) : Nullch)
9475 /* Duplicate a regexp. Required reading: pregcomp() and pregfree() in
9476 regcomp.c. AMS 20010712 */
9479 Perl_re_dup(pTHX_ REGEXP *r, CLONE_PARAMS *param)
9483 struct reg_substr_datum *s;
9486 return (REGEXP *)NULL;
9488 if ((ret = (REGEXP *)ptr_table_fetch(PL_ptr_table, r)))
9491 len = r->offsets[0];
9492 npar = r->nparens+1;
9494 Newc(0, ret, sizeof(regexp) + (len+1)*sizeof(regnode), char, regexp);
9495 Copy(r->program, ret->program, len+1, regnode);
9497 New(0, ret->startp, npar, I32);
9498 Copy(r->startp, ret->startp, npar, I32);
9499 New(0, ret->endp, npar, I32);
9500 Copy(r->startp, ret->startp, npar, I32);
9502 New(0, ret->substrs, 1, struct reg_substr_data);
9503 for (s = ret->substrs->data, i = 0; i < 3; i++, s++) {
9504 s->min_offset = r->substrs->data[i].min_offset;
9505 s->max_offset = r->substrs->data[i].max_offset;
9506 s->substr = sv_dup_inc(r->substrs->data[i].substr, param);
9507 s->utf8_substr = sv_dup_inc(r->substrs->data[i].utf8_substr, param);
9510 ret->regstclass = NULL;
9513 int count = r->data->count;
9515 Newc(0, d, sizeof(struct reg_data) + count*sizeof(void *),
9516 char, struct reg_data);
9517 New(0, d->what, count, U8);
9520 for (i = 0; i < count; i++) {
9521 d->what[i] = r->data->what[i];
9522 switch (d->what[i]) {
9524 d->data[i] = sv_dup_inc((SV *)r->data->data[i], param);
9527 d->data[i] = av_dup_inc((AV *)r->data->data[i], param);
9530 /* This is cheating. */
9531 New(0, d->data[i], 1, struct regnode_charclass_class);
9532 StructCopy(r->data->data[i], d->data[i],
9533 struct regnode_charclass_class);
9534 ret->regstclass = (regnode*)d->data[i];
9537 /* Compiled op trees are readonly, and can thus be
9538 shared without duplication. */
9539 d->data[i] = (void*)OpREFCNT_inc((OP*)r->data->data[i]);
9542 d->data[i] = r->data->data[i];
9552 New(0, ret->offsets, 2*len+1, U32);
9553 Copy(r->offsets, ret->offsets, 2*len+1, U32);
9555 ret->precomp = SAVEPV(r->precomp);
9556 ret->refcnt = r->refcnt;
9557 ret->minlen = r->minlen;
9558 ret->prelen = r->prelen;
9559 ret->nparens = r->nparens;
9560 ret->lastparen = r->lastparen;
9561 ret->lastcloseparen = r->lastcloseparen;
9562 ret->reganch = r->reganch;
9564 ret->sublen = r->sublen;
9566 if (RX_MATCH_COPIED(ret))
9567 ret->subbeg = SAVEPV(r->subbeg);
9569 ret->subbeg = Nullch;
9570 #ifdef PERL_COPY_ON_WRITE
9571 ret->saved_copy = Nullsv;
9574 ptr_table_store(PL_ptr_table, r, ret);
9578 /* duplicate a file handle */
9581 Perl_fp_dup(pTHX_ PerlIO *fp, char type, CLONE_PARAMS *param)
9585 return (PerlIO*)NULL;
9587 /* look for it in the table first */
9588 ret = (PerlIO*)ptr_table_fetch(PL_ptr_table, fp);
9592 /* create anew and remember what it is */
9593 ret = PerlIO_fdupopen(aTHX_ fp, param, PERLIO_DUP_CLONE);
9594 ptr_table_store(PL_ptr_table, fp, ret);
9598 /* duplicate a directory handle */
9601 Perl_dirp_dup(pTHX_ DIR *dp)
9609 /* duplicate a typeglob */
9612 Perl_gp_dup(pTHX_ GP *gp, CLONE_PARAMS* param)
9617 /* look for it in the table first */
9618 ret = (GP*)ptr_table_fetch(PL_ptr_table, gp);
9622 /* create anew and remember what it is */
9623 Newz(0, ret, 1, GP);
9624 ptr_table_store(PL_ptr_table, gp, ret);
9627 ret->gp_refcnt = 0; /* must be before any other dups! */
9628 ret->gp_sv = sv_dup_inc(gp->gp_sv, param);
9629 ret->gp_io = io_dup_inc(gp->gp_io, param);
9630 ret->gp_form = cv_dup_inc(gp->gp_form, param);
9631 ret->gp_av = av_dup_inc(gp->gp_av, param);
9632 ret->gp_hv = hv_dup_inc(gp->gp_hv, param);
9633 ret->gp_egv = gv_dup(gp->gp_egv, param);/* GvEGV is not refcounted */
9634 ret->gp_cv = cv_dup_inc(gp->gp_cv, param);
9635 ret->gp_cvgen = gp->gp_cvgen;
9636 ret->gp_flags = gp->gp_flags;
9637 ret->gp_line = gp->gp_line;
9638 ret->gp_file = gp->gp_file; /* points to COP.cop_file */
9642 /* duplicate a chain of magic */
9645 Perl_mg_dup(pTHX_ MAGIC *mg, CLONE_PARAMS* param)
9647 MAGIC *mgprev = (MAGIC*)NULL;
9650 return (MAGIC*)NULL;
9651 /* look for it in the table first */
9652 mgret = (MAGIC*)ptr_table_fetch(PL_ptr_table, mg);
9656 for (; mg; mg = mg->mg_moremagic) {
9658 Newz(0, nmg, 1, MAGIC);
9660 mgprev->mg_moremagic = nmg;
9663 nmg->mg_virtual = mg->mg_virtual; /* XXX copy dynamic vtable? */
9664 nmg->mg_private = mg->mg_private;
9665 nmg->mg_type = mg->mg_type;
9666 nmg->mg_flags = mg->mg_flags;
9667 if (mg->mg_type == PERL_MAGIC_qr) {
9668 nmg->mg_obj = (SV*)re_dup((REGEXP*)mg->mg_obj, param);
9670 else if(mg->mg_type == PERL_MAGIC_backref) {
9671 AV *av = (AV*) mg->mg_obj;
9674 nmg->mg_obj = (SV*)newAV();
9678 av_push((AV*)nmg->mg_obj,sv_dup(svp[i],param));
9683 nmg->mg_obj = (mg->mg_flags & MGf_REFCOUNTED)
9684 ? sv_dup_inc(mg->mg_obj, param)
9685 : sv_dup(mg->mg_obj, param);
9687 nmg->mg_len = mg->mg_len;
9688 nmg->mg_ptr = mg->mg_ptr; /* XXX random ptr? */
9689 if (mg->mg_ptr && mg->mg_type != PERL_MAGIC_regex_global) {
9690 if (mg->mg_len > 0) {
9691 nmg->mg_ptr = SAVEPVN(mg->mg_ptr, mg->mg_len);
9692 if (mg->mg_type == PERL_MAGIC_overload_table &&
9693 AMT_AMAGIC((AMT*)mg->mg_ptr))
9695 AMT *amtp = (AMT*)mg->mg_ptr;
9696 AMT *namtp = (AMT*)nmg->mg_ptr;
9698 for (i = 1; i < NofAMmeth; i++) {
9699 namtp->table[i] = cv_dup_inc(amtp->table[i], param);
9703 else if (mg->mg_len == HEf_SVKEY)
9704 nmg->mg_ptr = (char*)sv_dup_inc((SV*)mg->mg_ptr, param);
9706 if ((mg->mg_flags & MGf_DUP) && mg->mg_virtual && mg->mg_virtual->svt_dup) {
9707 CALL_FPTR(nmg->mg_virtual->svt_dup)(aTHX_ nmg, param);
9714 /* create a new pointer-mapping table */
9717 Perl_ptr_table_new(pTHX)
9720 Newz(0, tbl, 1, PTR_TBL_t);
9723 Newz(0, tbl->tbl_ary, tbl->tbl_max + 1, PTR_TBL_ENT_t*);
9727 /* map an existing pointer using a table */
9730 Perl_ptr_table_fetch(pTHX_ PTR_TBL_t *tbl, void *sv)
9732 PTR_TBL_ENT_t *tblent;
9733 UV hash = PTR2UV(sv);
9735 tblent = tbl->tbl_ary[hash & tbl->tbl_max];
9736 for (; tblent; tblent = tblent->next) {
9737 if (tblent->oldval == sv)
9738 return tblent->newval;
9743 /* add a new entry to a pointer-mapping table */
9746 Perl_ptr_table_store(pTHX_ PTR_TBL_t *tbl, void *oldv, void *newv)
9748 PTR_TBL_ENT_t *tblent, **otblent;
9749 /* XXX this may be pessimal on platforms where pointers aren't good
9750 * hash values e.g. if they grow faster in the most significant
9752 UV hash = PTR2UV(oldv);
9756 otblent = &tbl->tbl_ary[hash & tbl->tbl_max];
9757 for (tblent = *otblent; tblent; i=0, tblent = tblent->next) {
9758 if (tblent->oldval == oldv) {
9759 tblent->newval = newv;
9763 Newz(0, tblent, 1, PTR_TBL_ENT_t);
9764 tblent->oldval = oldv;
9765 tblent->newval = newv;
9766 tblent->next = *otblent;
9769 if (i && tbl->tbl_items > tbl->tbl_max)
9770 ptr_table_split(tbl);
9773 /* double the hash bucket size of an existing ptr table */
9776 Perl_ptr_table_split(pTHX_ PTR_TBL_t *tbl)
9778 PTR_TBL_ENT_t **ary = tbl->tbl_ary;
9779 UV oldsize = tbl->tbl_max + 1;
9780 UV newsize = oldsize * 2;
9783 Renew(ary, newsize, PTR_TBL_ENT_t*);
9784 Zero(&ary[oldsize], newsize-oldsize, PTR_TBL_ENT_t*);
9785 tbl->tbl_max = --newsize;
9787 for (i=0; i < oldsize; i++, ary++) {
9788 PTR_TBL_ENT_t **curentp, **entp, *ent;
9791 curentp = ary + oldsize;
9792 for (entp = ary, ent = *ary; ent; ent = *entp) {
9793 if ((newsize & PTR2UV(ent->oldval)) != i) {
9795 ent->next = *curentp;
9805 /* remove all the entries from a ptr table */
9808 Perl_ptr_table_clear(pTHX_ PTR_TBL_t *tbl)
9810 register PTR_TBL_ENT_t **array;
9811 register PTR_TBL_ENT_t *entry;
9812 register PTR_TBL_ENT_t *oentry = Null(PTR_TBL_ENT_t*);
9816 if (!tbl || !tbl->tbl_items) {
9820 array = tbl->tbl_ary;
9827 entry = entry->next;
9831 if (++riter > max) {
9834 entry = array[riter];
9841 /* clear and free a ptr table */
9844 Perl_ptr_table_free(pTHX_ PTR_TBL_t *tbl)
9849 ptr_table_clear(tbl);
9850 Safefree(tbl->tbl_ary);
9858 /* attempt to make everything in the typeglob readonly */
9861 S_gv_share(pTHX_ SV *sstr, CLONE_PARAMS *param)
9864 SV *sv = ¶m->proto_perl->Isv_no; /* just need SvREADONLY-ness */
9866 if (GvIO(gv) || GvFORM(gv)) {
9867 GvUNIQUE_off(gv); /* GvIOs cannot be shared. nor can GvFORMs */
9869 else if (!GvCV(gv)) {
9873 /* CvPADLISTs cannot be shared */
9874 if (!SvREADONLY(GvCV(gv)) && !CvXSUB(GvCV(gv))) {
9879 if (!GvUNIQUE(gv)) {
9881 PerlIO_printf(Perl_debug_log, "gv_share: unable to share %s::%s\n",
9882 HvNAME(GvSTASH(gv)), GvNAME(gv));
9888 * write attempts will die with
9889 * "Modification of a read-only value attempted"
9895 SvREADONLY_on(GvSV(gv));
9902 SvREADONLY_on(GvAV(gv));
9909 SvREADONLY_on(GvAV(gv));
9912 return sstr; /* he_dup() will SvREFCNT_inc() */
9915 /* duplicate an SV of any type (including AV, HV etc) */
9918 Perl_rvpv_dup(pTHX_ SV *dstr, SV *sstr, CLONE_PARAMS* param)
9921 SvRV(dstr) = SvWEAKREF(sstr)
9922 ? sv_dup(SvRV(sstr), param)
9923 : sv_dup_inc(SvRV(sstr), param);
9925 else if (SvPVX(sstr)) {
9926 /* Has something there */
9928 /* Normal PV - clone whole allocated space */
9929 SvPVX(dstr) = SAVEPVN(SvPVX(sstr), SvLEN(sstr)-1);
9930 if (SvREADONLY(sstr) && SvFAKE(sstr)) {
9931 /* Not that normal - actually sstr is copy on write.
9932 But we are a true, independant SV, so: */
9933 SvREADONLY_off(dstr);
9938 /* Special case - not normally malloced for some reason */
9939 if (SvREADONLY(sstr) && SvFAKE(sstr)) {
9940 /* A "shared" PV - clone it as unshared string */
9941 if(SvPADTMP(sstr)) {
9942 /* However, some of them live in the pad
9943 and they should not have these flags
9946 SvPVX(dstr) = sharepvn(SvPVX(sstr), SvCUR(sstr),
9948 SvUVX(dstr) = SvUVX(sstr);
9951 SvPVX(dstr) = SAVEPVN(SvPVX(sstr), SvCUR(sstr));
9953 SvREADONLY_off(dstr);
9957 /* Some other special case - random pointer */
9958 SvPVX(dstr) = SvPVX(sstr);
9964 SvPVX(dstr) = SvPVX(sstr);
9969 Perl_sv_dup(pTHX_ SV *sstr, CLONE_PARAMS* param)
9973 if (!sstr || SvTYPE(sstr) == SVTYPEMASK)
9975 /* look for it in the table first */
9976 dstr = (SV*)ptr_table_fetch(PL_ptr_table, sstr);
9980 if(param->flags & CLONEf_JOIN_IN) {
9981 /** We are joining here so we don't want do clone
9982 something that is bad **/
9984 if(SvTYPE(sstr) == SVt_PVHV &&
9986 /** don't clone stashes if they already exist **/
9987 HV* old_stash = gv_stashpv(HvNAME(sstr),0);
9988 return (SV*) old_stash;
9992 /* create anew and remember what it is */
9994 ptr_table_store(PL_ptr_table, sstr, dstr);
9997 SvFLAGS(dstr) = SvFLAGS(sstr);
9998 SvFLAGS(dstr) &= ~SVf_OOK; /* don't propagate OOK hack */
9999 SvREFCNT(dstr) = 0; /* must be before any other dups! */
10002 if (SvANY(sstr) && PL_watch_pvx && SvPVX(sstr) == PL_watch_pvx)
10003 PerlIO_printf(Perl_debug_log, "watch at %p hit, found string \"%s\"\n",
10004 PL_watch_pvx, SvPVX(sstr));
10007 switch (SvTYPE(sstr)) {
10009 SvANY(dstr) = NULL;
10012 SvANY(dstr) = new_XIV();
10013 SvIVX(dstr) = SvIVX(sstr);
10016 SvANY(dstr) = new_XNV();
10017 SvNVX(dstr) = SvNVX(sstr);
10020 SvANY(dstr) = new_XRV();
10021 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10024 SvANY(dstr) = new_XPV();
10025 SvCUR(dstr) = SvCUR(sstr);
10026 SvLEN(dstr) = SvLEN(sstr);
10027 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10030 SvANY(dstr) = new_XPVIV();
10031 SvCUR(dstr) = SvCUR(sstr);
10032 SvLEN(dstr) = SvLEN(sstr);
10033 SvIVX(dstr) = SvIVX(sstr);
10034 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10037 SvANY(dstr) = new_XPVNV();
10038 SvCUR(dstr) = SvCUR(sstr);
10039 SvLEN(dstr) = SvLEN(sstr);
10040 SvIVX(dstr) = SvIVX(sstr);
10041 SvNVX(dstr) = SvNVX(sstr);
10042 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10045 SvANY(dstr) = new_XPVMG();
10046 SvCUR(dstr) = SvCUR(sstr);
10047 SvLEN(dstr) = SvLEN(sstr);
10048 SvIVX(dstr) = SvIVX(sstr);
10049 SvNVX(dstr) = SvNVX(sstr);
10050 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr), param);
10051 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr), param);
10052 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10055 SvANY(dstr) = new_XPVBM();
10056 SvCUR(dstr) = SvCUR(sstr);
10057 SvLEN(dstr) = SvLEN(sstr);
10058 SvIVX(dstr) = SvIVX(sstr);
10059 SvNVX(dstr) = SvNVX(sstr);
10060 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr), param);
10061 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr), param);
10062 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10063 BmRARE(dstr) = BmRARE(sstr);
10064 BmUSEFUL(dstr) = BmUSEFUL(sstr);
10065 BmPREVIOUS(dstr)= BmPREVIOUS(sstr);
10068 SvANY(dstr) = new_XPVLV();
10069 SvCUR(dstr) = SvCUR(sstr);
10070 SvLEN(dstr) = SvLEN(sstr);
10071 SvIVX(dstr) = SvIVX(sstr);
10072 SvNVX(dstr) = SvNVX(sstr);
10073 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr), param);
10074 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr), param);
10075 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10076 LvTARGOFF(dstr) = LvTARGOFF(sstr); /* XXX sometimes holds PMOP* when DEBUGGING */
10077 LvTARGLEN(dstr) = LvTARGLEN(sstr);
10078 if (LvTYPE(sstr) == 't') /* for tie: unrefcnted fake (SV**) */
10079 LvTARG(dstr) = dstr;
10080 else if (LvTYPE(sstr) == 'T') /* for tie: fake HE */
10081 LvTARG(dstr) = (SV*)he_dup((HE*)LvTARG(sstr), 0, param);
10083 LvTARG(dstr) = sv_dup_inc(LvTARG(sstr), param);
10084 LvTYPE(dstr) = LvTYPE(sstr);
10087 if (GvUNIQUE((GV*)sstr)) {
10089 if ((share = gv_share(sstr, param))) {
10092 ptr_table_store(PL_ptr_table, sstr, dstr);
10094 PerlIO_printf(Perl_debug_log, "sv_dup: sharing %s::%s\n",
10095 HvNAME(GvSTASH(share)), GvNAME(share));
10100 SvANY(dstr) = new_XPVGV();
10101 SvCUR(dstr) = SvCUR(sstr);
10102 SvLEN(dstr) = SvLEN(sstr);
10103 SvIVX(dstr) = SvIVX(sstr);
10104 SvNVX(dstr) = SvNVX(sstr);
10105 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr), param);
10106 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr), param);
10107 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10108 GvNAMELEN(dstr) = GvNAMELEN(sstr);
10109 GvNAME(dstr) = SAVEPVN(GvNAME(sstr), GvNAMELEN(sstr));
10110 GvSTASH(dstr) = hv_dup_inc(GvSTASH(sstr), param);
10111 GvFLAGS(dstr) = GvFLAGS(sstr);
10112 GvGP(dstr) = gp_dup(GvGP(sstr), param);
10113 (void)GpREFCNT_inc(GvGP(dstr));
10116 SvANY(dstr) = new_XPVIO();
10117 SvCUR(dstr) = SvCUR(sstr);
10118 SvLEN(dstr) = SvLEN(sstr);
10119 SvIVX(dstr) = SvIVX(sstr);
10120 SvNVX(dstr) = SvNVX(sstr);
10121 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr), param);
10122 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr), param);
10123 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10124 IoIFP(dstr) = fp_dup(IoIFP(sstr), IoTYPE(sstr), param);
10125 if (IoOFP(sstr) == IoIFP(sstr))
10126 IoOFP(dstr) = IoIFP(dstr);
10128 IoOFP(dstr) = fp_dup(IoOFP(sstr), IoTYPE(sstr), param);
10129 /* PL_rsfp_filters entries have fake IoDIRP() */
10130 if (IoDIRP(sstr) && !(IoFLAGS(sstr) & IOf_FAKE_DIRP))
10131 IoDIRP(dstr) = dirp_dup(IoDIRP(sstr));
10133 IoDIRP(dstr) = IoDIRP(sstr);
10134 IoLINES(dstr) = IoLINES(sstr);
10135 IoPAGE(dstr) = IoPAGE(sstr);
10136 IoPAGE_LEN(dstr) = IoPAGE_LEN(sstr);
10137 IoLINES_LEFT(dstr) = IoLINES_LEFT(sstr);
10138 if(IoFLAGS(sstr) & IOf_FAKE_DIRP) {
10139 /* I have no idea why fake dirp (rsfps)
10140 should be treaded differently but otherwise
10141 we end up with leaks -- sky*/
10142 IoTOP_GV(dstr) = gv_dup_inc(IoTOP_GV(sstr), param);
10143 IoFMT_GV(dstr) = gv_dup_inc(IoFMT_GV(sstr), param);
10144 IoBOTTOM_GV(dstr) = gv_dup_inc(IoBOTTOM_GV(sstr), param);
10146 IoTOP_GV(dstr) = gv_dup(IoTOP_GV(sstr), param);
10147 IoFMT_GV(dstr) = gv_dup(IoFMT_GV(sstr), param);
10148 IoBOTTOM_GV(dstr) = gv_dup(IoBOTTOM_GV(sstr), param);
10150 IoTOP_NAME(dstr) = SAVEPV(IoTOP_NAME(sstr));
10151 IoFMT_NAME(dstr) = SAVEPV(IoFMT_NAME(sstr));
10152 IoBOTTOM_NAME(dstr) = SAVEPV(IoBOTTOM_NAME(sstr));
10153 IoSUBPROCESS(dstr) = IoSUBPROCESS(sstr);
10154 IoTYPE(dstr) = IoTYPE(sstr);
10155 IoFLAGS(dstr) = IoFLAGS(sstr);
10158 SvANY(dstr) = new_XPVAV();
10159 SvCUR(dstr) = SvCUR(sstr);
10160 SvLEN(dstr) = SvLEN(sstr);
10161 SvIVX(dstr) = SvIVX(sstr);
10162 SvNVX(dstr) = SvNVX(sstr);
10163 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr), param);
10164 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr), param);
10165 AvARYLEN((AV*)dstr) = sv_dup_inc(AvARYLEN((AV*)sstr), param);
10166 AvFLAGS((AV*)dstr) = AvFLAGS((AV*)sstr);
10167 if (AvARRAY((AV*)sstr)) {
10168 SV **dst_ary, **src_ary;
10169 SSize_t items = AvFILLp((AV*)sstr) + 1;
10171 src_ary = AvARRAY((AV*)sstr);
10172 Newz(0, dst_ary, AvMAX((AV*)sstr)+1, SV*);
10173 ptr_table_store(PL_ptr_table, src_ary, dst_ary);
10174 SvPVX(dstr) = (char*)dst_ary;
10175 AvALLOC((AV*)dstr) = dst_ary;
10176 if (AvREAL((AV*)sstr)) {
10177 while (items-- > 0)
10178 *dst_ary++ = sv_dup_inc(*src_ary++, param);
10181 while (items-- > 0)
10182 *dst_ary++ = sv_dup(*src_ary++, param);
10184 items = AvMAX((AV*)sstr) - AvFILLp((AV*)sstr);
10185 while (items-- > 0) {
10186 *dst_ary++ = &PL_sv_undef;
10190 SvPVX(dstr) = Nullch;
10191 AvALLOC((AV*)dstr) = (SV**)NULL;
10195 SvANY(dstr) = new_XPVHV();
10196 SvCUR(dstr) = SvCUR(sstr);
10197 SvLEN(dstr) = SvLEN(sstr);
10198 SvIVX(dstr) = SvIVX(sstr);
10199 SvNVX(dstr) = SvNVX(sstr);
10200 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr), param);
10201 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr), param);
10202 HvRITER((HV*)dstr) = HvRITER((HV*)sstr);
10203 if (HvARRAY((HV*)sstr)) {
10205 XPVHV *dxhv = (XPVHV*)SvANY(dstr);
10206 XPVHV *sxhv = (XPVHV*)SvANY(sstr);
10207 Newz(0, dxhv->xhv_array,
10208 PERL_HV_ARRAY_ALLOC_BYTES(dxhv->xhv_max+1), char);
10209 while (i <= sxhv->xhv_max) {
10210 ((HE**)dxhv->xhv_array)[i] = he_dup(((HE**)sxhv->xhv_array)[i],
10211 (bool)!!HvSHAREKEYS(sstr),
10215 dxhv->xhv_eiter = he_dup(sxhv->xhv_eiter,
10216 (bool)!!HvSHAREKEYS(sstr), param);
10219 SvPVX(dstr) = Nullch;
10220 HvEITER((HV*)dstr) = (HE*)NULL;
10222 HvPMROOT((HV*)dstr) = HvPMROOT((HV*)sstr); /* XXX */
10223 HvNAME((HV*)dstr) = SAVEPV(HvNAME((HV*)sstr));
10224 /* Record stashes for possible cloning in Perl_clone(). */
10225 if(HvNAME((HV*)dstr))
10226 av_push(param->stashes, dstr);
10229 SvANY(dstr) = new_XPVFM();
10230 FmLINES(dstr) = FmLINES(sstr);
10234 SvANY(dstr) = new_XPVCV();
10236 SvCUR(dstr) = SvCUR(sstr);
10237 SvLEN(dstr) = SvLEN(sstr);
10238 SvIVX(dstr) = SvIVX(sstr);
10239 SvNVX(dstr) = SvNVX(sstr);
10240 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr), param);
10241 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr), param);
10242 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10243 CvSTASH(dstr) = hv_dup(CvSTASH(sstr), param); /* NOTE: not refcounted */
10244 CvSTART(dstr) = CvSTART(sstr);
10245 CvROOT(dstr) = OpREFCNT_inc(CvROOT(sstr));
10246 CvXSUB(dstr) = CvXSUB(sstr);
10247 CvXSUBANY(dstr) = CvXSUBANY(sstr);
10248 if (CvCONST(sstr)) {
10249 CvXSUBANY(dstr).any_ptr = GvUNIQUE(CvGV(sstr)) ?
10250 SvREFCNT_inc(CvXSUBANY(sstr).any_ptr) :
10251 sv_dup_inc(CvXSUBANY(sstr).any_ptr, param);
10253 CvGV(dstr) = gv_dup(CvGV(sstr), param);
10254 if (param->flags & CLONEf_COPY_STACKS) {
10255 CvDEPTH(dstr) = CvDEPTH(sstr);
10259 PAD_DUP(CvPADLIST(dstr), CvPADLIST(sstr), param);
10260 CvOUTSIDE_SEQ(dstr) = CvOUTSIDE_SEQ(sstr);
10262 CvWEAKOUTSIDE(sstr)
10263 ? cv_dup( CvOUTSIDE(sstr), param)
10264 : cv_dup_inc(CvOUTSIDE(sstr), param);
10265 CvFLAGS(dstr) = CvFLAGS(sstr);
10266 CvFILE(dstr) = CvXSUB(sstr) ? CvFILE(sstr) : SAVEPV(CvFILE(sstr));
10269 Perl_croak(aTHX_ "Bizarre SvTYPE [%" IVdf "]", (IV)SvTYPE(sstr));
10273 if (SvOBJECT(dstr) && SvTYPE(dstr) != SVt_PVIO)
10279 /* duplicate a context */
10282 Perl_cx_dup(pTHX_ PERL_CONTEXT *cxs, I32 ix, I32 max, CLONE_PARAMS* param)
10284 PERL_CONTEXT *ncxs;
10287 return (PERL_CONTEXT*)NULL;
10289 /* look for it in the table first */
10290 ncxs = (PERL_CONTEXT*)ptr_table_fetch(PL_ptr_table, cxs);
10294 /* create anew and remember what it is */
10295 Newz(56, ncxs, max + 1, PERL_CONTEXT);
10296 ptr_table_store(PL_ptr_table, cxs, ncxs);
10299 PERL_CONTEXT *cx = &cxs[ix];
10300 PERL_CONTEXT *ncx = &ncxs[ix];
10301 ncx->cx_type = cx->cx_type;
10302 if (CxTYPE(cx) == CXt_SUBST) {
10303 Perl_croak(aTHX_ "Cloning substitution context is unimplemented");
10306 ncx->blk_oldsp = cx->blk_oldsp;
10307 ncx->blk_oldcop = cx->blk_oldcop;
10308 ncx->blk_oldretsp = cx->blk_oldretsp;
10309 ncx->blk_oldmarksp = cx->blk_oldmarksp;
10310 ncx->blk_oldscopesp = cx->blk_oldscopesp;
10311 ncx->blk_oldpm = cx->blk_oldpm;
10312 ncx->blk_gimme = cx->blk_gimme;
10313 switch (CxTYPE(cx)) {
10315 ncx->blk_sub.cv = (cx->blk_sub.olddepth == 0
10316 ? cv_dup_inc(cx->blk_sub.cv, param)
10317 : cv_dup(cx->blk_sub.cv,param));
10318 ncx->blk_sub.argarray = (cx->blk_sub.hasargs
10319 ? av_dup_inc(cx->blk_sub.argarray, param)
10321 ncx->blk_sub.savearray = av_dup_inc(cx->blk_sub.savearray, param);
10322 ncx->blk_sub.olddepth = cx->blk_sub.olddepth;
10323 ncx->blk_sub.hasargs = cx->blk_sub.hasargs;
10324 ncx->blk_sub.lval = cx->blk_sub.lval;
10327 ncx->blk_eval.old_in_eval = cx->blk_eval.old_in_eval;
10328 ncx->blk_eval.old_op_type = cx->blk_eval.old_op_type;
10329 ncx->blk_eval.old_namesv = sv_dup_inc(cx->blk_eval.old_namesv, param);
10330 ncx->blk_eval.old_eval_root = cx->blk_eval.old_eval_root;
10331 ncx->blk_eval.cur_text = sv_dup(cx->blk_eval.cur_text, param);
10334 ncx->blk_loop.label = cx->blk_loop.label;
10335 ncx->blk_loop.resetsp = cx->blk_loop.resetsp;
10336 ncx->blk_loop.redo_op = cx->blk_loop.redo_op;
10337 ncx->blk_loop.next_op = cx->blk_loop.next_op;
10338 ncx->blk_loop.last_op = cx->blk_loop.last_op;
10339 ncx->blk_loop.iterdata = (CxPADLOOP(cx)
10340 ? cx->blk_loop.iterdata
10341 : gv_dup((GV*)cx->blk_loop.iterdata, param));
10342 ncx->blk_loop.oldcomppad
10343 = (PAD*)ptr_table_fetch(PL_ptr_table,
10344 cx->blk_loop.oldcomppad);
10345 ncx->blk_loop.itersave = sv_dup_inc(cx->blk_loop.itersave, param);
10346 ncx->blk_loop.iterlval = sv_dup_inc(cx->blk_loop.iterlval, param);
10347 ncx->blk_loop.iterary = av_dup_inc(cx->blk_loop.iterary, param);
10348 ncx->blk_loop.iterix = cx->blk_loop.iterix;
10349 ncx->blk_loop.itermax = cx->blk_loop.itermax;
10352 ncx->blk_sub.cv = cv_dup(cx->blk_sub.cv, param);
10353 ncx->blk_sub.gv = gv_dup(cx->blk_sub.gv, param);
10354 ncx->blk_sub.dfoutgv = gv_dup_inc(cx->blk_sub.dfoutgv, param);
10355 ncx->blk_sub.hasargs = cx->blk_sub.hasargs;
10367 /* duplicate a stack info structure */
10370 Perl_si_dup(pTHX_ PERL_SI *si, CLONE_PARAMS* param)
10375 return (PERL_SI*)NULL;
10377 /* look for it in the table first */
10378 nsi = (PERL_SI*)ptr_table_fetch(PL_ptr_table, si);
10382 /* create anew and remember what it is */
10383 Newz(56, nsi, 1, PERL_SI);
10384 ptr_table_store(PL_ptr_table, si, nsi);
10386 nsi->si_stack = av_dup_inc(si->si_stack, param);
10387 nsi->si_cxix = si->si_cxix;
10388 nsi->si_cxmax = si->si_cxmax;
10389 nsi->si_cxstack = cx_dup(si->si_cxstack, si->si_cxix, si->si_cxmax, param);
10390 nsi->si_type = si->si_type;
10391 nsi->si_prev = si_dup(si->si_prev, param);
10392 nsi->si_next = si_dup(si->si_next, param);
10393 nsi->si_markoff = si->si_markoff;
10398 #define POPINT(ss,ix) ((ss)[--(ix)].any_i32)
10399 #define TOPINT(ss,ix) ((ss)[ix].any_i32)
10400 #define POPLONG(ss,ix) ((ss)[--(ix)].any_long)
10401 #define TOPLONG(ss,ix) ((ss)[ix].any_long)
10402 #define POPIV(ss,ix) ((ss)[--(ix)].any_iv)
10403 #define TOPIV(ss,ix) ((ss)[ix].any_iv)
10404 #define POPBOOL(ss,ix) ((ss)[--(ix)].any_bool)
10405 #define TOPBOOL(ss,ix) ((ss)[ix].any_bool)
10406 #define POPPTR(ss,ix) ((ss)[--(ix)].any_ptr)
10407 #define TOPPTR(ss,ix) ((ss)[ix].any_ptr)
10408 #define POPDPTR(ss,ix) ((ss)[--(ix)].any_dptr)
10409 #define TOPDPTR(ss,ix) ((ss)[ix].any_dptr)
10410 #define POPDXPTR(ss,ix) ((ss)[--(ix)].any_dxptr)
10411 #define TOPDXPTR(ss,ix) ((ss)[ix].any_dxptr)
10414 #define pv_dup_inc(p) SAVEPV(p)
10415 #define pv_dup(p) SAVEPV(p)
10416 #define svp_dup_inc(p,pp) any_dup(p,pp)
10418 /* map any object to the new equivent - either something in the
10419 * ptr table, or something in the interpreter structure
10423 Perl_any_dup(pTHX_ void *v, PerlInterpreter *proto_perl)
10428 return (void*)NULL;
10430 /* look for it in the table first */
10431 ret = ptr_table_fetch(PL_ptr_table, v);
10435 /* see if it is part of the interpreter structure */
10436 if (v >= (void*)proto_perl && v < (void*)(proto_perl+1))
10437 ret = (void*)(((char*)aTHX) + (((char*)v) - (char*)proto_perl));
10445 /* duplicate the save stack */
10448 Perl_ss_dup(pTHX_ PerlInterpreter *proto_perl, CLONE_PARAMS* param)
10450 ANY *ss = proto_perl->Tsavestack;
10451 I32 ix = proto_perl->Tsavestack_ix;
10452 I32 max = proto_perl->Tsavestack_max;
10465 void (*dptr) (void*);
10466 void (*dxptr) (pTHX_ void*);
10469 Newz(54, nss, max, ANY);
10473 TOPINT(nss,ix) = i;
10475 case SAVEt_ITEM: /* normal string */
10476 sv = (SV*)POPPTR(ss,ix);
10477 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
10478 sv = (SV*)POPPTR(ss,ix);
10479 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
10481 case SAVEt_SV: /* scalar reference */
10482 sv = (SV*)POPPTR(ss,ix);
10483 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
10484 gv = (GV*)POPPTR(ss,ix);
10485 TOPPTR(nss,ix) = gv_dup_inc(gv, param);
10487 case SAVEt_GENERIC_PVREF: /* generic char* */
10488 c = (char*)POPPTR(ss,ix);
10489 TOPPTR(nss,ix) = pv_dup(c);
10490 ptr = POPPTR(ss,ix);
10491 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10493 case SAVEt_SHARED_PVREF: /* char* in shared space */
10494 c = (char*)POPPTR(ss,ix);
10495 TOPPTR(nss,ix) = savesharedpv(c);
10496 ptr = POPPTR(ss,ix);
10497 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10499 case SAVEt_GENERIC_SVREF: /* generic sv */
10500 case SAVEt_SVREF: /* scalar reference */
10501 sv = (SV*)POPPTR(ss,ix);
10502 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
10503 ptr = POPPTR(ss,ix);
10504 TOPPTR(nss,ix) = svp_dup_inc((SV**)ptr, proto_perl);/* XXXXX */
10506 case SAVEt_AV: /* array reference */
10507 av = (AV*)POPPTR(ss,ix);
10508 TOPPTR(nss,ix) = av_dup_inc(av, param);
10509 gv = (GV*)POPPTR(ss,ix);
10510 TOPPTR(nss,ix) = gv_dup(gv, param);
10512 case SAVEt_HV: /* hash reference */
10513 hv = (HV*)POPPTR(ss,ix);
10514 TOPPTR(nss,ix) = hv_dup_inc(hv, param);
10515 gv = (GV*)POPPTR(ss,ix);
10516 TOPPTR(nss,ix) = gv_dup(gv, param);
10518 case SAVEt_INT: /* int reference */
10519 ptr = POPPTR(ss,ix);
10520 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10521 intval = (int)POPINT(ss,ix);
10522 TOPINT(nss,ix) = intval;
10524 case SAVEt_LONG: /* long reference */
10525 ptr = POPPTR(ss,ix);
10526 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10527 longval = (long)POPLONG(ss,ix);
10528 TOPLONG(nss,ix) = longval;
10530 case SAVEt_I32: /* I32 reference */
10531 case SAVEt_I16: /* I16 reference */
10532 case SAVEt_I8: /* I8 reference */
10533 ptr = POPPTR(ss,ix);
10534 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10536 TOPINT(nss,ix) = i;
10538 case SAVEt_IV: /* IV reference */
10539 ptr = POPPTR(ss,ix);
10540 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10542 TOPIV(nss,ix) = iv;
10544 case SAVEt_SPTR: /* SV* reference */
10545 ptr = POPPTR(ss,ix);
10546 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10547 sv = (SV*)POPPTR(ss,ix);
10548 TOPPTR(nss,ix) = sv_dup(sv, param);
10550 case SAVEt_VPTR: /* random* reference */
10551 ptr = POPPTR(ss,ix);
10552 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10553 ptr = POPPTR(ss,ix);
10554 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10556 case SAVEt_PPTR: /* char* reference */
10557 ptr = POPPTR(ss,ix);
10558 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10559 c = (char*)POPPTR(ss,ix);
10560 TOPPTR(nss,ix) = pv_dup(c);
10562 case SAVEt_HPTR: /* HV* reference */
10563 ptr = POPPTR(ss,ix);
10564 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10565 hv = (HV*)POPPTR(ss,ix);
10566 TOPPTR(nss,ix) = hv_dup(hv, param);
10568 case SAVEt_APTR: /* AV* reference */
10569 ptr = POPPTR(ss,ix);
10570 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10571 av = (AV*)POPPTR(ss,ix);
10572 TOPPTR(nss,ix) = av_dup(av, param);
10575 gv = (GV*)POPPTR(ss,ix);
10576 TOPPTR(nss,ix) = gv_dup(gv, param);
10578 case SAVEt_GP: /* scalar reference */
10579 gp = (GP*)POPPTR(ss,ix);
10580 TOPPTR(nss,ix) = gp = gp_dup(gp, param);
10581 (void)GpREFCNT_inc(gp);
10582 gv = (GV*)POPPTR(ss,ix);
10583 TOPPTR(nss,ix) = gv_dup_inc(gv, param);
10584 c = (char*)POPPTR(ss,ix);
10585 TOPPTR(nss,ix) = pv_dup(c);
10587 TOPIV(nss,ix) = iv;
10589 TOPIV(nss,ix) = iv;
10592 case SAVEt_MORTALIZESV:
10593 sv = (SV*)POPPTR(ss,ix);
10594 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
10597 ptr = POPPTR(ss,ix);
10598 if (ptr && (((OP*)ptr)->op_private & OPpREFCOUNTED)) {
10599 /* these are assumed to be refcounted properly */
10600 switch (((OP*)ptr)->op_type) {
10602 case OP_LEAVESUBLV:
10606 case OP_LEAVEWRITE:
10607 TOPPTR(nss,ix) = ptr;
10612 TOPPTR(nss,ix) = Nullop;
10617 TOPPTR(nss,ix) = Nullop;
10620 c = (char*)POPPTR(ss,ix);
10621 TOPPTR(nss,ix) = pv_dup_inc(c);
10623 case SAVEt_CLEARSV:
10624 longval = POPLONG(ss,ix);
10625 TOPLONG(nss,ix) = longval;
10628 hv = (HV*)POPPTR(ss,ix);
10629 TOPPTR(nss,ix) = hv_dup_inc(hv, param);
10630 c = (char*)POPPTR(ss,ix);
10631 TOPPTR(nss,ix) = pv_dup_inc(c);
10633 TOPINT(nss,ix) = i;
10635 case SAVEt_DESTRUCTOR:
10636 ptr = POPPTR(ss,ix);
10637 TOPPTR(nss,ix) = any_dup(ptr, proto_perl); /* XXX quite arbitrary */
10638 dptr = POPDPTR(ss,ix);
10639 TOPDPTR(nss,ix) = (void (*)(void*))any_dup((void *)dptr, proto_perl);
10641 case SAVEt_DESTRUCTOR_X:
10642 ptr = POPPTR(ss,ix);
10643 TOPPTR(nss,ix) = any_dup(ptr, proto_perl); /* XXX quite arbitrary */
10644 dxptr = POPDXPTR(ss,ix);
10645 TOPDXPTR(nss,ix) = (void (*)(pTHX_ void*))any_dup((void *)dxptr, proto_perl);
10647 case SAVEt_REGCONTEXT:
10650 TOPINT(nss,ix) = i;
10653 case SAVEt_STACK_POS: /* Position on Perl stack */
10655 TOPINT(nss,ix) = i;
10657 case SAVEt_AELEM: /* array element */
10658 sv = (SV*)POPPTR(ss,ix);
10659 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
10661 TOPINT(nss,ix) = i;
10662 av = (AV*)POPPTR(ss,ix);
10663 TOPPTR(nss,ix) = av_dup_inc(av, param);
10665 case SAVEt_HELEM: /* hash element */
10666 sv = (SV*)POPPTR(ss,ix);
10667 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
10668 sv = (SV*)POPPTR(ss,ix);
10669 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
10670 hv = (HV*)POPPTR(ss,ix);
10671 TOPPTR(nss,ix) = hv_dup_inc(hv, param);
10674 ptr = POPPTR(ss,ix);
10675 TOPPTR(nss,ix) = ptr;
10679 TOPINT(nss,ix) = i;
10681 case SAVEt_COMPPAD:
10682 av = (AV*)POPPTR(ss,ix);
10683 TOPPTR(nss,ix) = av_dup(av, param);
10686 longval = (long)POPLONG(ss,ix);
10687 TOPLONG(nss,ix) = longval;
10688 ptr = POPPTR(ss,ix);
10689 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10690 sv = (SV*)POPPTR(ss,ix);
10691 TOPPTR(nss,ix) = sv_dup(sv, param);
10694 ptr = POPPTR(ss,ix);
10695 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10696 longval = (long)POPBOOL(ss,ix);
10697 TOPBOOL(nss,ix) = (bool)longval;
10700 Perl_croak(aTHX_ "panic: ss_dup inconsistency");
10708 =for apidoc perl_clone
10710 Create and return a new interpreter by cloning the current one.
10712 perl_clone takes these flags as paramters:
10714 CLONEf_COPY_STACKS - is used to, well, copy the stacks also,
10715 without it we only clone the data and zero the stacks,
10716 with it we copy the stacks and the new perl interpreter is
10717 ready to run at the exact same point as the previous one.
10718 The pseudo-fork code uses COPY_STACKS while the
10719 threads->new doesn't.
10721 CLONEf_KEEP_PTR_TABLE
10722 perl_clone keeps a ptr_table with the pointer of the old
10723 variable as a key and the new variable as a value,
10724 this allows it to check if something has been cloned and not
10725 clone it again but rather just use the value and increase the
10726 refcount. If KEEP_PTR_TABLE is not set then perl_clone will kill
10727 the ptr_table using the function
10728 C<ptr_table_free(PL_ptr_table); PL_ptr_table = NULL;>,
10729 reason to keep it around is if you want to dup some of your own
10730 variable who are outside the graph perl scans, example of this
10731 code is in threads.xs create
10734 This is a win32 thing, it is ignored on unix, it tells perls
10735 win32host code (which is c++) to clone itself, this is needed on
10736 win32 if you want to run two threads at the same time,
10737 if you just want to do some stuff in a separate perl interpreter
10738 and then throw it away and return to the original one,
10739 you don't need to do anything.
10744 /* XXX the above needs expanding by someone who actually understands it ! */
10745 EXTERN_C PerlInterpreter *
10746 perl_clone_host(PerlInterpreter* proto_perl, UV flags);
10749 perl_clone(PerlInterpreter *proto_perl, UV flags)
10751 #ifdef PERL_IMPLICIT_SYS
10753 /* perlhost.h so we need to call into it
10754 to clone the host, CPerlHost should have a c interface, sky */
10756 if (flags & CLONEf_CLONE_HOST) {
10757 return perl_clone_host(proto_perl,flags);
10759 return perl_clone_using(proto_perl, flags,
10761 proto_perl->IMemShared,
10762 proto_perl->IMemParse,
10764 proto_perl->IStdIO,
10768 proto_perl->IProc);
10772 perl_clone_using(PerlInterpreter *proto_perl, UV flags,
10773 struct IPerlMem* ipM, struct IPerlMem* ipMS,
10774 struct IPerlMem* ipMP, struct IPerlEnv* ipE,
10775 struct IPerlStdIO* ipStd, struct IPerlLIO* ipLIO,
10776 struct IPerlDir* ipD, struct IPerlSock* ipS,
10777 struct IPerlProc* ipP)
10779 /* XXX many of the string copies here can be optimized if they're
10780 * constants; they need to be allocated as common memory and just
10781 * their pointers copied. */
10784 CLONE_PARAMS clone_params;
10785 CLONE_PARAMS* param = &clone_params;
10787 PerlInterpreter *my_perl = (PerlInterpreter*)(*ipM->pMalloc)(ipM, sizeof(PerlInterpreter));
10788 PERL_SET_THX(my_perl);
10791 Poison(my_perl, 1, PerlInterpreter);
10795 PL_savestack_ix = 0;
10796 PL_savestack_max = -1;
10798 PL_sig_pending = 0;
10799 Zero(&PL_debug_pad, 1, struct perl_debug_pad);
10800 # else /* !DEBUGGING */
10801 Zero(my_perl, 1, PerlInterpreter);
10802 # endif /* DEBUGGING */
10804 /* host pointers */
10806 PL_MemShared = ipMS;
10807 PL_MemParse = ipMP;
10814 #else /* !PERL_IMPLICIT_SYS */
10816 CLONE_PARAMS clone_params;
10817 CLONE_PARAMS* param = &clone_params;
10818 PerlInterpreter *my_perl = (PerlInterpreter*)PerlMem_malloc(sizeof(PerlInterpreter));
10819 PERL_SET_THX(my_perl);
10824 Poison(my_perl, 1, PerlInterpreter);
10828 PL_savestack_ix = 0;
10829 PL_savestack_max = -1;
10831 PL_sig_pending = 0;
10832 Zero(&PL_debug_pad, 1, struct perl_debug_pad);
10833 # else /* !DEBUGGING */
10834 Zero(my_perl, 1, PerlInterpreter);
10835 # endif /* DEBUGGING */
10836 #endif /* PERL_IMPLICIT_SYS */
10837 param->flags = flags;
10838 param->proto_perl = proto_perl;
10841 PL_xiv_arenaroot = NULL;
10842 PL_xiv_root = NULL;
10843 PL_xnv_arenaroot = NULL;
10844 PL_xnv_root = NULL;
10845 PL_xrv_arenaroot = NULL;
10846 PL_xrv_root = NULL;
10847 PL_xpv_arenaroot = NULL;
10848 PL_xpv_root = NULL;
10849 PL_xpviv_arenaroot = NULL;
10850 PL_xpviv_root = NULL;
10851 PL_xpvnv_arenaroot = NULL;
10852 PL_xpvnv_root = NULL;
10853 PL_xpvcv_arenaroot = NULL;
10854 PL_xpvcv_root = NULL;
10855 PL_xpvav_arenaroot = NULL;
10856 PL_xpvav_root = NULL;
10857 PL_xpvhv_arenaroot = NULL;
10858 PL_xpvhv_root = NULL;
10859 PL_xpvmg_arenaroot = NULL;
10860 PL_xpvmg_root = NULL;
10861 PL_xpvlv_arenaroot = NULL;
10862 PL_xpvlv_root = NULL;
10863 PL_xpvbm_arenaroot = NULL;
10864 PL_xpvbm_root = NULL;
10865 PL_he_arenaroot = NULL;
10867 PL_nice_chunk = NULL;
10868 PL_nice_chunk_size = 0;
10870 PL_sv_objcount = 0;
10871 PL_sv_root = Nullsv;
10872 PL_sv_arenaroot = Nullsv;
10874 PL_debug = proto_perl->Idebug;
10876 #ifdef USE_REENTRANT_API
10877 Perl_reentrant_init(aTHX);
10880 /* create SV map for pointer relocation */
10881 PL_ptr_table = ptr_table_new();
10883 /* initialize these special pointers as early as possible */
10884 SvANY(&PL_sv_undef) = NULL;
10885 SvREFCNT(&PL_sv_undef) = (~(U32)0)/2;
10886 SvFLAGS(&PL_sv_undef) = SVf_READONLY|SVt_NULL;
10887 ptr_table_store(PL_ptr_table, &proto_perl->Isv_undef, &PL_sv_undef);
10889 SvANY(&PL_sv_no) = new_XPVNV();
10890 SvREFCNT(&PL_sv_no) = (~(U32)0)/2;
10891 SvFLAGS(&PL_sv_no) = SVp_NOK|SVf_NOK|SVp_POK|SVf_POK|SVf_READONLY|SVt_PVNV;
10892 SvPVX(&PL_sv_no) = SAVEPVN(PL_No, 0);
10893 SvCUR(&PL_sv_no) = 0;
10894 SvLEN(&PL_sv_no) = 1;
10895 SvNVX(&PL_sv_no) = 0;
10896 ptr_table_store(PL_ptr_table, &proto_perl->Isv_no, &PL_sv_no);
10898 SvANY(&PL_sv_yes) = new_XPVNV();
10899 SvREFCNT(&PL_sv_yes) = (~(U32)0)/2;
10900 SvFLAGS(&PL_sv_yes) = SVp_NOK|SVf_NOK|SVp_POK|SVf_POK|SVf_READONLY|SVt_PVNV;
10901 SvPVX(&PL_sv_yes) = SAVEPVN(PL_Yes, 1);
10902 SvCUR(&PL_sv_yes) = 1;
10903 SvLEN(&PL_sv_yes) = 2;
10904 SvNVX(&PL_sv_yes) = 1;
10905 ptr_table_store(PL_ptr_table, &proto_perl->Isv_yes, &PL_sv_yes);
10907 /* create (a non-shared!) shared string table */
10908 PL_strtab = newHV();
10909 HvSHAREKEYS_off(PL_strtab);
10910 hv_ksplit(PL_strtab, 512);
10911 ptr_table_store(PL_ptr_table, proto_perl->Istrtab, PL_strtab);
10913 PL_compiling = proto_perl->Icompiling;
10915 /* These two PVs will be free'd special way so must set them same way op.c does */
10916 PL_compiling.cop_stashpv = savesharedpv(PL_compiling.cop_stashpv);
10917 ptr_table_store(PL_ptr_table, proto_perl->Icompiling.cop_stashpv, PL_compiling.cop_stashpv);
10919 PL_compiling.cop_file = savesharedpv(PL_compiling.cop_file);
10920 ptr_table_store(PL_ptr_table, proto_perl->Icompiling.cop_file, PL_compiling.cop_file);
10922 ptr_table_store(PL_ptr_table, &proto_perl->Icompiling, &PL_compiling);
10923 if (!specialWARN(PL_compiling.cop_warnings))
10924 PL_compiling.cop_warnings = sv_dup_inc(PL_compiling.cop_warnings, param);
10925 if (!specialCopIO(PL_compiling.cop_io))
10926 PL_compiling.cop_io = sv_dup_inc(PL_compiling.cop_io, param);
10927 PL_curcop = (COP*)any_dup(proto_perl->Tcurcop, proto_perl);
10929 /* pseudo environmental stuff */
10930 PL_origargc = proto_perl->Iorigargc;
10931 PL_origargv = proto_perl->Iorigargv;
10933 param->stashes = newAV(); /* Setup array of objects to call clone on */
10935 #ifdef PERLIO_LAYERS
10936 /* Clone PerlIO tables as soon as we can handle general xx_dup() */
10937 PerlIO_clone(aTHX_ proto_perl, param);
10940 PL_envgv = gv_dup(proto_perl->Ienvgv, param);
10941 PL_incgv = gv_dup(proto_perl->Iincgv, param);
10942 PL_hintgv = gv_dup(proto_perl->Ihintgv, param);
10943 PL_origfilename = SAVEPV(proto_perl->Iorigfilename);
10944 PL_diehook = sv_dup_inc(proto_perl->Idiehook, param);
10945 PL_warnhook = sv_dup_inc(proto_perl->Iwarnhook, param);
10948 PL_minus_c = proto_perl->Iminus_c;
10949 PL_patchlevel = sv_dup_inc(proto_perl->Ipatchlevel, param);
10950 PL_localpatches = proto_perl->Ilocalpatches;
10951 PL_splitstr = proto_perl->Isplitstr;
10952 PL_preprocess = proto_perl->Ipreprocess;
10953 PL_minus_n = proto_perl->Iminus_n;
10954 PL_minus_p = proto_perl->Iminus_p;
10955 PL_minus_l = proto_perl->Iminus_l;
10956 PL_minus_a = proto_perl->Iminus_a;
10957 PL_minus_F = proto_perl->Iminus_F;
10958 PL_doswitches = proto_perl->Idoswitches;
10959 PL_dowarn = proto_perl->Idowarn;
10960 PL_doextract = proto_perl->Idoextract;
10961 PL_sawampersand = proto_perl->Isawampersand;
10962 PL_unsafe = proto_perl->Iunsafe;
10963 PL_inplace = SAVEPV(proto_perl->Iinplace);
10964 PL_e_script = sv_dup_inc(proto_perl->Ie_script, param);
10965 PL_perldb = proto_perl->Iperldb;
10966 PL_perl_destruct_level = proto_perl->Iperl_destruct_level;
10967 PL_exit_flags = proto_perl->Iexit_flags;
10969 /* magical thingies */
10970 /* XXX time(&PL_basetime) when asked for? */
10971 PL_basetime = proto_perl->Ibasetime;
10972 PL_formfeed = sv_dup(proto_perl->Iformfeed, param);
10974 PL_maxsysfd = proto_perl->Imaxsysfd;
10975 PL_multiline = proto_perl->Imultiline;
10976 PL_statusvalue = proto_perl->Istatusvalue;
10978 PL_statusvalue_vms = proto_perl->Istatusvalue_vms;
10980 PL_encoding = sv_dup(proto_perl->Iencoding, param);
10982 sv_setpvn(PERL_DEBUG_PAD(0), "", 0); /* For regex debugging. */
10983 sv_setpvn(PERL_DEBUG_PAD(1), "", 0); /* ext/re needs these */
10984 sv_setpvn(PERL_DEBUG_PAD(2), "", 0); /* even without DEBUGGING. */
10986 /* Clone the regex array */
10987 PL_regex_padav = newAV();
10989 I32 len = av_len((AV*)proto_perl->Iregex_padav);
10990 SV** regexen = AvARRAY((AV*)proto_perl->Iregex_padav);
10991 av_push(PL_regex_padav,
10992 sv_dup_inc(regexen[0],param));
10993 for(i = 1; i <= len; i++) {
10994 if(SvREPADTMP(regexen[i])) {
10995 av_push(PL_regex_padav, sv_dup_inc(regexen[i], param));
10997 av_push(PL_regex_padav,
10999 newSViv(PTR2IV(re_dup(INT2PTR(REGEXP *,
11000 SvIVX(regexen[i])), param)))
11005 PL_regex_pad = AvARRAY(PL_regex_padav);
11007 /* shortcuts to various I/O objects */
11008 PL_stdingv = gv_dup(proto_perl->Istdingv, param);
11009 PL_stderrgv = gv_dup(proto_perl->Istderrgv, param);
11010 PL_defgv = gv_dup(proto_perl->Idefgv, param);
11011 PL_argvgv = gv_dup(proto_perl->Iargvgv, param);
11012 PL_argvoutgv = gv_dup(proto_perl->Iargvoutgv, param);
11013 PL_argvout_stack = av_dup_inc(proto_perl->Iargvout_stack, param);
11015 /* shortcuts to regexp stuff */
11016 PL_replgv = gv_dup(proto_perl->Ireplgv, param);
11018 /* shortcuts to misc objects */
11019 PL_errgv = gv_dup(proto_perl->Ierrgv, param);
11021 /* shortcuts to debugging objects */
11022 PL_DBgv = gv_dup(proto_perl->IDBgv, param);
11023 PL_DBline = gv_dup(proto_perl->IDBline, param);
11024 PL_DBsub = gv_dup(proto_perl->IDBsub, param);
11025 PL_DBsingle = sv_dup(proto_perl->IDBsingle, param);
11026 PL_DBtrace = sv_dup(proto_perl->IDBtrace, param);
11027 PL_DBsignal = sv_dup(proto_perl->IDBsignal, param);
11028 PL_DBassertion = sv_dup(proto_perl->IDBassertion, param);
11029 PL_lineary = av_dup(proto_perl->Ilineary, param);
11030 PL_dbargs = av_dup(proto_perl->Idbargs, param);
11032 /* symbol tables */
11033 PL_defstash = hv_dup_inc(proto_perl->Tdefstash, param);
11034 PL_curstash = hv_dup(proto_perl->Tcurstash, param);
11035 PL_debstash = hv_dup(proto_perl->Idebstash, param);
11036 PL_globalstash = hv_dup(proto_perl->Iglobalstash, param);
11037 PL_curstname = sv_dup_inc(proto_perl->Icurstname, param);
11039 PL_beginav = av_dup_inc(proto_perl->Ibeginav, param);
11040 PL_beginav_save = av_dup_inc(proto_perl->Ibeginav_save, param);
11041 PL_checkav_save = av_dup_inc(proto_perl->Icheckav_save, param);
11042 PL_endav = av_dup_inc(proto_perl->Iendav, param);
11043 PL_checkav = av_dup_inc(proto_perl->Icheckav, param);
11044 PL_initav = av_dup_inc(proto_perl->Iinitav, param);
11046 PL_sub_generation = proto_perl->Isub_generation;
11048 /* funky return mechanisms */
11049 PL_forkprocess = proto_perl->Iforkprocess;
11051 /* subprocess state */
11052 PL_fdpid = av_dup_inc(proto_perl->Ifdpid, param);
11054 /* internal state */
11055 PL_tainting = proto_perl->Itainting;
11056 PL_taint_warn = proto_perl->Itaint_warn;
11057 PL_maxo = proto_perl->Imaxo;
11058 if (proto_perl->Iop_mask)
11059 PL_op_mask = SAVEPVN(proto_perl->Iop_mask, PL_maxo);
11061 PL_op_mask = Nullch;
11062 /* PL_asserting = proto_perl->Iasserting; */
11064 /* current interpreter roots */
11065 PL_main_cv = cv_dup_inc(proto_perl->Imain_cv, param);
11066 PL_main_root = OpREFCNT_inc(proto_perl->Imain_root);
11067 PL_main_start = proto_perl->Imain_start;
11068 PL_eval_root = proto_perl->Ieval_root;
11069 PL_eval_start = proto_perl->Ieval_start;
11071 /* runtime control stuff */
11072 PL_curcopdb = (COP*)any_dup(proto_perl->Icurcopdb, proto_perl);
11073 PL_copline = proto_perl->Icopline;
11075 PL_filemode = proto_perl->Ifilemode;
11076 PL_lastfd = proto_perl->Ilastfd;
11077 PL_oldname = proto_perl->Ioldname; /* XXX not quite right */
11080 PL_gensym = proto_perl->Igensym;
11081 PL_preambled = proto_perl->Ipreambled;
11082 PL_preambleav = av_dup_inc(proto_perl->Ipreambleav, param);
11083 PL_laststatval = proto_perl->Ilaststatval;
11084 PL_laststype = proto_perl->Ilaststype;
11085 PL_mess_sv = Nullsv;
11087 PL_ors_sv = sv_dup_inc(proto_perl->Iors_sv, param);
11088 PL_ofmt = SAVEPV(proto_perl->Iofmt);
11090 /* interpreter atexit processing */
11091 PL_exitlistlen = proto_perl->Iexitlistlen;
11092 if (PL_exitlistlen) {
11093 New(0, PL_exitlist, PL_exitlistlen, PerlExitListEntry);
11094 Copy(proto_perl->Iexitlist, PL_exitlist, PL_exitlistlen, PerlExitListEntry);
11097 PL_exitlist = (PerlExitListEntry*)NULL;
11098 PL_modglobal = hv_dup_inc(proto_perl->Imodglobal, param);
11099 PL_custom_op_names = hv_dup_inc(proto_perl->Icustom_op_names,param);
11100 PL_custom_op_descs = hv_dup_inc(proto_perl->Icustom_op_descs,param);
11102 PL_profiledata = NULL;
11103 PL_rsfp = fp_dup(proto_perl->Irsfp, '<', param);
11104 /* PL_rsfp_filters entries have fake IoDIRP() */
11105 PL_rsfp_filters = av_dup_inc(proto_perl->Irsfp_filters, param);
11107 PL_compcv = cv_dup(proto_perl->Icompcv, param);
11109 PAD_CLONE_VARS(proto_perl, param);
11111 #ifdef HAVE_INTERP_INTERN
11112 sys_intern_dup(&proto_perl->Isys_intern, &PL_sys_intern);
11115 /* more statics moved here */
11116 PL_generation = proto_perl->Igeneration;
11117 PL_DBcv = cv_dup(proto_perl->IDBcv, param);
11119 PL_in_clean_objs = proto_perl->Iin_clean_objs;
11120 PL_in_clean_all = proto_perl->Iin_clean_all;
11122 PL_uid = proto_perl->Iuid;
11123 PL_euid = proto_perl->Ieuid;
11124 PL_gid = proto_perl->Igid;
11125 PL_egid = proto_perl->Iegid;
11126 PL_nomemok = proto_perl->Inomemok;
11127 PL_an = proto_perl->Ian;
11128 PL_op_seqmax = proto_perl->Iop_seqmax;
11129 PL_evalseq = proto_perl->Ievalseq;
11130 PL_origenviron = proto_perl->Iorigenviron; /* XXX not quite right */
11131 PL_origalen = proto_perl->Iorigalen;
11132 PL_pidstatus = newHV(); /* XXX flag for cloning? */
11133 PL_osname = SAVEPV(proto_perl->Iosname);
11134 PL_sh_path_compat = proto_perl->Ish_path_compat; /* XXX never deallocated */
11135 PL_sighandlerp = proto_perl->Isighandlerp;
11138 PL_runops = proto_perl->Irunops;
11140 Copy(proto_perl->Itokenbuf, PL_tokenbuf, 256, char);
11143 PL_cshlen = proto_perl->Icshlen;
11144 PL_cshname = proto_perl->Icshname; /* XXX never deallocated */
11147 PL_lex_state = proto_perl->Ilex_state;
11148 PL_lex_defer = proto_perl->Ilex_defer;
11149 PL_lex_expect = proto_perl->Ilex_expect;
11150 PL_lex_formbrack = proto_perl->Ilex_formbrack;
11151 PL_lex_dojoin = proto_perl->Ilex_dojoin;
11152 PL_lex_starts = proto_perl->Ilex_starts;
11153 PL_lex_stuff = sv_dup_inc(proto_perl->Ilex_stuff, param);
11154 PL_lex_repl = sv_dup_inc(proto_perl->Ilex_repl, param);
11155 PL_lex_op = proto_perl->Ilex_op;
11156 PL_lex_inpat = proto_perl->Ilex_inpat;
11157 PL_lex_inwhat = proto_perl->Ilex_inwhat;
11158 PL_lex_brackets = proto_perl->Ilex_brackets;
11159 i = (PL_lex_brackets < 120 ? 120 : PL_lex_brackets);
11160 PL_lex_brackstack = SAVEPVN(proto_perl->Ilex_brackstack,i);
11161 PL_lex_casemods = proto_perl->Ilex_casemods;
11162 i = (PL_lex_casemods < 12 ? 12 : PL_lex_casemods);
11163 PL_lex_casestack = SAVEPVN(proto_perl->Ilex_casestack,i);
11165 Copy(proto_perl->Inextval, PL_nextval, 5, YYSTYPE);
11166 Copy(proto_perl->Inexttype, PL_nexttype, 5, I32);
11167 PL_nexttoke = proto_perl->Inexttoke;
11169 /* XXX This is probably masking the deeper issue of why
11170 * SvANY(proto_perl->Ilinestr) can be NULL at this point. For test case:
11171 * http://archive.develooper.com/perl5-porters%40perl.org/msg83298.html
11172 * (A little debugging with a watchpoint on it may help.)
11174 if (SvANY(proto_perl->Ilinestr)) {
11175 PL_linestr = sv_dup_inc(proto_perl->Ilinestr, param);
11176 i = proto_perl->Ibufptr - SvPVX(proto_perl->Ilinestr);
11177 PL_bufptr = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
11178 i = proto_perl->Ioldbufptr - SvPVX(proto_perl->Ilinestr);
11179 PL_oldbufptr = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
11180 i = proto_perl->Ioldoldbufptr - SvPVX(proto_perl->Ilinestr);
11181 PL_oldoldbufptr = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
11182 i = proto_perl->Ilinestart - SvPVX(proto_perl->Ilinestr);
11183 PL_linestart = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
11186 PL_linestr = NEWSV(65,79);
11187 sv_upgrade(PL_linestr,SVt_PVIV);
11188 sv_setpvn(PL_linestr,"",0);
11189 PL_bufptr = PL_oldbufptr = PL_oldoldbufptr = PL_linestart = SvPVX(PL_linestr);
11191 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
11192 PL_pending_ident = proto_perl->Ipending_ident;
11193 PL_sublex_info = proto_perl->Isublex_info; /* XXX not quite right */
11195 PL_expect = proto_perl->Iexpect;
11197 PL_multi_start = proto_perl->Imulti_start;
11198 PL_multi_end = proto_perl->Imulti_end;
11199 PL_multi_open = proto_perl->Imulti_open;
11200 PL_multi_close = proto_perl->Imulti_close;
11202 PL_error_count = proto_perl->Ierror_count;
11203 PL_subline = proto_perl->Isubline;
11204 PL_subname = sv_dup_inc(proto_perl->Isubname, param);
11206 /* XXX See comment on SvANY(proto_perl->Ilinestr) above */
11207 if (SvANY(proto_perl->Ilinestr)) {
11208 i = proto_perl->Ilast_uni - SvPVX(proto_perl->Ilinestr);
11209 PL_last_uni = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
11210 i = proto_perl->Ilast_lop - SvPVX(proto_perl->Ilinestr);
11211 PL_last_lop = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
11212 PL_last_lop_op = proto_perl->Ilast_lop_op;
11215 PL_last_uni = SvPVX(PL_linestr);
11216 PL_last_lop = SvPVX(PL_linestr);
11217 PL_last_lop_op = 0;
11219 PL_in_my = proto_perl->Iin_my;
11220 PL_in_my_stash = hv_dup(proto_perl->Iin_my_stash, param);
11222 PL_cryptseen = proto_perl->Icryptseen;
11225 PL_hints = proto_perl->Ihints;
11227 PL_amagic_generation = proto_perl->Iamagic_generation;
11229 #ifdef USE_LOCALE_COLLATE
11230 PL_collation_ix = proto_perl->Icollation_ix;
11231 PL_collation_name = SAVEPV(proto_perl->Icollation_name);
11232 PL_collation_standard = proto_perl->Icollation_standard;
11233 PL_collxfrm_base = proto_perl->Icollxfrm_base;
11234 PL_collxfrm_mult = proto_perl->Icollxfrm_mult;
11235 #endif /* USE_LOCALE_COLLATE */
11237 #ifdef USE_LOCALE_NUMERIC
11238 PL_numeric_name = SAVEPV(proto_perl->Inumeric_name);
11239 PL_numeric_standard = proto_perl->Inumeric_standard;
11240 PL_numeric_local = proto_perl->Inumeric_local;
11241 PL_numeric_radix_sv = sv_dup_inc(proto_perl->Inumeric_radix_sv, param);
11242 #endif /* !USE_LOCALE_NUMERIC */
11244 /* utf8 character classes */
11245 PL_utf8_alnum = sv_dup_inc(proto_perl->Iutf8_alnum, param);
11246 PL_utf8_alnumc = sv_dup_inc(proto_perl->Iutf8_alnumc, param);
11247 PL_utf8_ascii = sv_dup_inc(proto_perl->Iutf8_ascii, param);
11248 PL_utf8_alpha = sv_dup_inc(proto_perl->Iutf8_alpha, param);
11249 PL_utf8_space = sv_dup_inc(proto_perl->Iutf8_space, param);
11250 PL_utf8_cntrl = sv_dup_inc(proto_perl->Iutf8_cntrl, param);
11251 PL_utf8_graph = sv_dup_inc(proto_perl->Iutf8_graph, param);
11252 PL_utf8_digit = sv_dup_inc(proto_perl->Iutf8_digit, param);
11253 PL_utf8_upper = sv_dup_inc(proto_perl->Iutf8_upper, param);
11254 PL_utf8_lower = sv_dup_inc(proto_perl->Iutf8_lower, param);
11255 PL_utf8_print = sv_dup_inc(proto_perl->Iutf8_print, param);
11256 PL_utf8_punct = sv_dup_inc(proto_perl->Iutf8_punct, param);
11257 PL_utf8_xdigit = sv_dup_inc(proto_perl->Iutf8_xdigit, param);
11258 PL_utf8_mark = sv_dup_inc(proto_perl->Iutf8_mark, param);
11259 PL_utf8_toupper = sv_dup_inc(proto_perl->Iutf8_toupper, param);
11260 PL_utf8_totitle = sv_dup_inc(proto_perl->Iutf8_totitle, param);
11261 PL_utf8_tolower = sv_dup_inc(proto_perl->Iutf8_tolower, param);
11262 PL_utf8_tofold = sv_dup_inc(proto_perl->Iutf8_tofold, param);
11263 PL_utf8_idstart = sv_dup_inc(proto_perl->Iutf8_idstart, param);
11264 PL_utf8_idcont = sv_dup_inc(proto_perl->Iutf8_idcont, param);
11266 /* Did the locale setup indicate UTF-8? */
11267 PL_utf8locale = proto_perl->Iutf8locale;
11268 /* Unicode features (see perlrun/-C) */
11269 PL_unicode = proto_perl->Iunicode;
11271 /* Pre-5.8 signals control */
11272 PL_signals = proto_perl->Isignals;
11274 /* times() ticks per second */
11275 PL_clocktick = proto_perl->Iclocktick;
11277 /* Recursion stopper for PerlIO_find_layer */
11278 PL_in_load_module = proto_perl->Iin_load_module;
11280 /* sort() routine */
11281 PL_sort_RealCmp = proto_perl->Isort_RealCmp;
11283 /* Not really needed/useful since the reenrant_retint is "volatile",
11284 * but do it for consistency's sake. */
11285 PL_reentrant_retint = proto_perl->Ireentrant_retint;
11287 /* Hooks to shared SVs and locks. */
11288 PL_sharehook = proto_perl->Isharehook;
11289 PL_lockhook = proto_perl->Ilockhook;
11290 PL_unlockhook = proto_perl->Iunlockhook;
11291 PL_threadhook = proto_perl->Ithreadhook;
11293 PL_runops_std = proto_perl->Irunops_std;
11294 PL_runops_dbg = proto_perl->Irunops_dbg;
11296 #ifdef THREADS_HAVE_PIDS
11297 PL_ppid = proto_perl->Ippid;
11301 PL_last_swash_hv = Nullhv; /* reinits on demand */
11302 PL_last_swash_klen = 0;
11303 PL_last_swash_key[0]= '\0';
11304 PL_last_swash_tmps = (U8*)NULL;
11305 PL_last_swash_slen = 0;
11307 /* perly.c globals */
11308 PL_yydebug = proto_perl->Iyydebug;
11309 PL_yynerrs = proto_perl->Iyynerrs;
11310 PL_yyerrflag = proto_perl->Iyyerrflag;
11311 PL_yychar = proto_perl->Iyychar;
11312 PL_yyval = proto_perl->Iyyval;
11313 PL_yylval = proto_perl->Iyylval;
11315 PL_glob_index = proto_perl->Iglob_index;
11316 PL_srand_called = proto_perl->Isrand_called;
11317 PL_hash_seed = proto_perl->Ihash_seed;
11318 PL_uudmap['M'] = 0; /* reinits on demand */
11319 PL_bitcount = Nullch; /* reinits on demand */
11321 if (proto_perl->Ipsig_pend) {
11322 Newz(0, PL_psig_pend, SIG_SIZE, int);
11325 PL_psig_pend = (int*)NULL;
11328 if (proto_perl->Ipsig_ptr) {
11329 Newz(0, PL_psig_ptr, SIG_SIZE, SV*);
11330 Newz(0, PL_psig_name, SIG_SIZE, SV*);
11331 for (i = 1; i < SIG_SIZE; i++) {
11332 PL_psig_ptr[i] = sv_dup_inc(proto_perl->Ipsig_ptr[i], param);
11333 PL_psig_name[i] = sv_dup_inc(proto_perl->Ipsig_name[i], param);
11337 PL_psig_ptr = (SV**)NULL;
11338 PL_psig_name = (SV**)NULL;
11341 /* thrdvar.h stuff */
11343 if (flags & CLONEf_COPY_STACKS) {
11344 /* next allocation will be PL_tmps_stack[PL_tmps_ix+1] */
11345 PL_tmps_ix = proto_perl->Ttmps_ix;
11346 PL_tmps_max = proto_perl->Ttmps_max;
11347 PL_tmps_floor = proto_perl->Ttmps_floor;
11348 Newz(50, PL_tmps_stack, PL_tmps_max, SV*);
11350 while (i <= PL_tmps_ix) {
11351 PL_tmps_stack[i] = sv_dup_inc(proto_perl->Ttmps_stack[i], param);
11355 /* next PUSHMARK() sets *(PL_markstack_ptr+1) */
11356 i = proto_perl->Tmarkstack_max - proto_perl->Tmarkstack;
11357 Newz(54, PL_markstack, i, I32);
11358 PL_markstack_max = PL_markstack + (proto_perl->Tmarkstack_max
11359 - proto_perl->Tmarkstack);
11360 PL_markstack_ptr = PL_markstack + (proto_perl->Tmarkstack_ptr
11361 - proto_perl->Tmarkstack);
11362 Copy(proto_perl->Tmarkstack, PL_markstack,
11363 PL_markstack_ptr - PL_markstack + 1, I32);
11365 /* next push_scope()/ENTER sets PL_scopestack[PL_scopestack_ix]
11366 * NOTE: unlike the others! */
11367 PL_scopestack_ix = proto_perl->Tscopestack_ix;
11368 PL_scopestack_max = proto_perl->Tscopestack_max;
11369 Newz(54, PL_scopestack, PL_scopestack_max, I32);
11370 Copy(proto_perl->Tscopestack, PL_scopestack, PL_scopestack_ix, I32);
11372 /* next push_return() sets PL_retstack[PL_retstack_ix]
11373 * NOTE: unlike the others! */
11374 PL_retstack_ix = proto_perl->Tretstack_ix;
11375 PL_retstack_max = proto_perl->Tretstack_max;
11376 Newz(54, PL_retstack, PL_retstack_max, OP*);
11377 Copy(proto_perl->Tretstack, PL_retstack, PL_retstack_ix, OP*);
11379 /* NOTE: si_dup() looks at PL_markstack */
11380 PL_curstackinfo = si_dup(proto_perl->Tcurstackinfo, param);
11382 /* PL_curstack = PL_curstackinfo->si_stack; */
11383 PL_curstack = av_dup(proto_perl->Tcurstack, param);
11384 PL_mainstack = av_dup(proto_perl->Tmainstack, param);
11386 /* next PUSHs() etc. set *(PL_stack_sp+1) */
11387 PL_stack_base = AvARRAY(PL_curstack);
11388 PL_stack_sp = PL_stack_base + (proto_perl->Tstack_sp
11389 - proto_perl->Tstack_base);
11390 PL_stack_max = PL_stack_base + AvMAX(PL_curstack);
11392 /* next SSPUSHFOO() sets PL_savestack[PL_savestack_ix]
11393 * NOTE: unlike the others! */
11394 PL_savestack_ix = proto_perl->Tsavestack_ix;
11395 PL_savestack_max = proto_perl->Tsavestack_max;
11396 /*Newz(54, PL_savestack, PL_savestack_max, ANY);*/
11397 PL_savestack = ss_dup(proto_perl, param);
11401 ENTER; /* perl_destruct() wants to LEAVE; */
11404 PL_start_env = proto_perl->Tstart_env; /* XXXXXX */
11405 PL_top_env = &PL_start_env;
11407 PL_op = proto_perl->Top;
11410 PL_Xpv = (XPV*)NULL;
11411 PL_na = proto_perl->Tna;
11413 PL_statbuf = proto_perl->Tstatbuf;
11414 PL_statcache = proto_perl->Tstatcache;
11415 PL_statgv = gv_dup(proto_perl->Tstatgv, param);
11416 PL_statname = sv_dup_inc(proto_perl->Tstatname, param);
11418 PL_timesbuf = proto_perl->Ttimesbuf;
11421 PL_tainted = proto_perl->Ttainted;
11422 PL_curpm = proto_perl->Tcurpm; /* XXX No PMOP ref count */
11423 PL_rs = sv_dup_inc(proto_perl->Trs, param);
11424 PL_last_in_gv = gv_dup(proto_perl->Tlast_in_gv, param);
11425 PL_ofs_sv = sv_dup_inc(proto_perl->Tofs_sv, param);
11426 PL_defoutgv = gv_dup_inc(proto_perl->Tdefoutgv, param);
11427 PL_chopset = proto_perl->Tchopset; /* XXX never deallocated */
11428 PL_toptarget = sv_dup_inc(proto_perl->Ttoptarget, param);
11429 PL_bodytarget = sv_dup_inc(proto_perl->Tbodytarget, param);
11430 PL_formtarget = sv_dup(proto_perl->Tformtarget, param);
11432 PL_restartop = proto_perl->Trestartop;
11433 PL_in_eval = proto_perl->Tin_eval;
11434 PL_delaymagic = proto_perl->Tdelaymagic;
11435 PL_dirty = proto_perl->Tdirty;
11436 PL_localizing = proto_perl->Tlocalizing;
11438 #ifdef PERL_FLEXIBLE_EXCEPTIONS
11439 PL_protect = proto_perl->Tprotect;
11441 PL_errors = sv_dup_inc(proto_perl->Terrors, param);
11442 PL_hv_fetch_ent_mh = Nullhe;
11443 PL_modcount = proto_perl->Tmodcount;
11444 PL_lastgotoprobe = Nullop;
11445 PL_dumpindent = proto_perl->Tdumpindent;
11447 PL_sortcop = (OP*)any_dup(proto_perl->Tsortcop, proto_perl);
11448 PL_sortstash = hv_dup(proto_perl->Tsortstash, param);
11449 PL_firstgv = gv_dup(proto_perl->Tfirstgv, param);
11450 PL_secondgv = gv_dup(proto_perl->Tsecondgv, param);
11451 PL_sortcxix = proto_perl->Tsortcxix;
11452 PL_efloatbuf = Nullch; /* reinits on demand */
11453 PL_efloatsize = 0; /* reinits on demand */
11457 PL_screamfirst = NULL;
11458 PL_screamnext = NULL;
11459 PL_maxscream = -1; /* reinits on demand */
11460 PL_lastscream = Nullsv;
11462 PL_watchaddr = NULL;
11463 PL_watchok = Nullch;
11465 PL_regdummy = proto_perl->Tregdummy;
11466 PL_regprecomp = Nullch;
11469 PL_colorset = 0; /* reinits PL_colors[] */
11470 /*PL_colors[6] = {0,0,0,0,0,0};*/
11471 PL_reginput = Nullch;
11472 PL_regbol = Nullch;
11473 PL_regeol = Nullch;
11474 PL_regstartp = (I32*)NULL;
11475 PL_regendp = (I32*)NULL;
11476 PL_reglastparen = (U32*)NULL;
11477 PL_regtill = Nullch;
11478 PL_reg_start_tmp = (char**)NULL;
11479 PL_reg_start_tmpl = 0;
11480 PL_regdata = (struct reg_data*)NULL;
11483 PL_reg_eval_set = 0;
11485 PL_regprogram = (regnode*)NULL;
11487 PL_regcc = (CURCUR*)NULL;
11488 PL_reg_call_cc = (struct re_cc_state*)NULL;
11489 PL_reg_re = (regexp*)NULL;
11490 PL_reg_ganch = Nullch;
11491 PL_reg_sv = Nullsv;
11492 PL_reg_match_utf8 = FALSE;
11493 PL_reg_magic = (MAGIC*)NULL;
11495 PL_reg_oldcurpm = (PMOP*)NULL;
11496 PL_reg_curpm = (PMOP*)NULL;
11497 PL_reg_oldsaved = Nullch;
11498 PL_reg_oldsavedlen = 0;
11499 #ifdef PERL_COPY_ON_WRITE
11502 PL_reg_maxiter = 0;
11503 PL_reg_leftiter = 0;
11504 PL_reg_poscache = Nullch;
11505 PL_reg_poscache_size= 0;
11507 /* RE engine - function pointers */
11508 PL_regcompp = proto_perl->Tregcompp;
11509 PL_regexecp = proto_perl->Tregexecp;
11510 PL_regint_start = proto_perl->Tregint_start;
11511 PL_regint_string = proto_perl->Tregint_string;
11512 PL_regfree = proto_perl->Tregfree;
11514 PL_reginterp_cnt = 0;
11515 PL_reg_starttry = 0;
11517 /* Pluggable optimizer */
11518 PL_peepp = proto_perl->Tpeepp;
11520 PL_stashcache = newHV();
11522 if (!(flags & CLONEf_KEEP_PTR_TABLE)) {
11523 ptr_table_free(PL_ptr_table);
11524 PL_ptr_table = NULL;
11527 /* Call the ->CLONE method, if it exists, for each of the stashes
11528 identified by sv_dup() above.
11530 while(av_len(param->stashes) != -1) {
11531 HV* stash = (HV*) av_shift(param->stashes);
11532 GV* cloner = gv_fetchmethod_autoload(stash, "CLONE", 0);
11533 if (cloner && GvCV(cloner)) {
11538 XPUSHs(sv_2mortal(newSVpv(HvNAME(stash), 0)));
11540 call_sv((SV*)GvCV(cloner), G_DISCARD);
11546 SvREFCNT_dec(param->stashes);
11551 #endif /* USE_ITHREADS */
11554 =head1 Unicode Support
11556 =for apidoc sv_recode_to_utf8
11558 The encoding is assumed to be an Encode object, on entry the PV
11559 of the sv is assumed to be octets in that encoding, and the sv
11560 will be converted into Unicode (and UTF-8).
11562 If the sv already is UTF-8 (or if it is not POK), or if the encoding
11563 is not a reference, nothing is done to the sv. If the encoding is not
11564 an C<Encode::XS> Encoding object, bad things will happen.
11565 (See F<lib/encoding.pm> and L<Encode>).
11567 The PV of the sv is returned.
11572 Perl_sv_recode_to_utf8(pTHX_ SV *sv, SV *encoding)
11574 if (SvPOK(sv) && !SvUTF8(sv) && !IN_BYTES && SvROK(encoding)) {
11588 Passing sv_yes is wrong - it needs to be or'ed set of constants
11589 for Encode::XS, while UTf-8 decode (currently) assumes a true value means
11590 remove converted chars from source.
11592 Both will default the value - let them.
11594 XPUSHs(&PL_sv_yes);
11597 call_method("decode", G_SCALAR);
11601 s = SvPV(uni, len);
11602 if (s != SvPVX(sv)) {
11603 SvGROW(sv, len + 1);
11604 Move(s, SvPVX(sv), len, char);
11605 SvCUR_set(sv, len);
11606 SvPVX(sv)[len] = 0;
11616 =for apidoc sv_cat_decode
11618 The encoding is assumed to be an Encode object, the PV of the ssv is
11619 assumed to be octets in that encoding and decoding the input starts
11620 from the position which (PV + *offset) pointed to. The dsv will be
11621 concatenated the decoded UTF-8 string from ssv. Decoding will terminate
11622 when the string tstr appears in decoding output or the input ends on
11623 the PV of the ssv. The value which the offset points will be modified
11624 to the last input position on the ssv.
11626 Returns TRUE if the terminator was found, else returns FALSE.
11631 Perl_sv_cat_decode(pTHX_ SV *dsv, SV *encoding,
11632 SV *ssv, int *offset, char *tstr, int tlen)
11635 if (SvPOK(ssv) && SvPOK(dsv) && SvROK(encoding) && offset) {
11646 XPUSHs(offsv = sv_2mortal(newSViv(*offset)));
11647 XPUSHs(sv_2mortal(newSVpvn(tstr, tlen)));
11649 call_method("cat_decode", G_SCALAR);
11651 ret = SvTRUE(TOPs);
11652 *offset = SvIV(offsv);
11658 Perl_croak(aTHX_ "Invalid argument to sv_cat_decode");