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;
504 for (arena = PL_xnv_arenaroot; arena; arena = arenanext) {
505 arenanext = (XPV*)arena->xpv_pv;
508 PL_xnv_arenaroot = 0;
511 for (arena = PL_xrv_arenaroot; arena; arena = arenanext) {
512 arenanext = (XPV*)arena->xpv_pv;
515 PL_xrv_arenaroot = 0;
518 for (arena = PL_xpv_arenaroot; arena; arena = arenanext) {
519 arenanext = (XPV*)arena->xpv_pv;
522 PL_xpv_arenaroot = 0;
525 for (arena = (XPV*)PL_xpviv_arenaroot; arena; arena = arenanext) {
526 arenanext = (XPV*)arena->xpv_pv;
529 PL_xpviv_arenaroot = 0;
532 for (arena = (XPV*)PL_xpvnv_arenaroot; arena; arena = arenanext) {
533 arenanext = (XPV*)arena->xpv_pv;
536 PL_xpvnv_arenaroot = 0;
539 for (arena = (XPV*)PL_xpvcv_arenaroot; arena; arena = arenanext) {
540 arenanext = (XPV*)arena->xpv_pv;
543 PL_xpvcv_arenaroot = 0;
546 for (arena = (XPV*)PL_xpvav_arenaroot; arena; arena = arenanext) {
547 arenanext = (XPV*)arena->xpv_pv;
550 PL_xpvav_arenaroot = 0;
553 for (arena = (XPV*)PL_xpvhv_arenaroot; arena; arena = arenanext) {
554 arenanext = (XPV*)arena->xpv_pv;
557 PL_xpvhv_arenaroot = 0;
560 for (arena = (XPV*)PL_xpvmg_arenaroot; arena; arena = arenanext) {
561 arenanext = (XPV*)arena->xpv_pv;
564 PL_xpvmg_arenaroot = 0;
567 for (arena = (XPV*)PL_xpvlv_arenaroot; arena; arena = arenanext) {
568 arenanext = (XPV*)arena->xpv_pv;
571 PL_xpvlv_arenaroot = 0;
574 for (arena = (XPV*)PL_xpvbm_arenaroot; arena; arena = arenanext) {
575 arenanext = (XPV*)arena->xpv_pv;
578 PL_xpvbm_arenaroot = 0;
581 for (arena = (XPV*)PL_he_arenaroot; arena; arena = arenanext) {
582 arenanext = (XPV*)arena->xpv_pv;
589 Safefree(PL_nice_chunk);
590 PL_nice_chunk = Nullch;
591 PL_nice_chunk_size = 0;
597 =for apidoc report_uninit
599 Print appropriate "Use of uninitialized variable" warning
605 Perl_report_uninit(pTHX)
608 Perl_warner(aTHX_ packWARN(WARN_UNINITIALIZED), PL_warn_uninit,
609 " in ", OP_DESC(PL_op));
611 Perl_warner(aTHX_ packWARN(WARN_UNINITIALIZED), PL_warn_uninit, "", "");
614 /* grab a new IV body from the free list, allocating more if necessary */
625 * See comment in more_xiv() -- RAM.
627 PL_xiv_root = *(IV**)xiv;
629 return (XPVIV*)((char*)xiv - STRUCT_OFFSET(XPVIV, xiv_iv));
632 /* return an IV body to the free list */
635 S_del_xiv(pTHX_ XPVIV *p)
637 IV* xiv = (IV*)((char*)(p) + STRUCT_OFFSET(XPVIV, xiv_iv));
639 *(IV**)xiv = PL_xiv_root;
644 /* allocate another arena's worth of IV bodies */
652 New(705, ptr, 1008/sizeof(XPV), XPV);
653 ptr->xpv_pv = (char*)PL_xiv_arenaroot; /* linked list of xiv arenas */
654 PL_xiv_arenaroot = ptr; /* to keep Purify happy */
657 xivend = &xiv[1008 / sizeof(IV) - 1];
658 xiv += (sizeof(XPV) - 1) / sizeof(IV) + 1; /* fudge by size of XPV */
660 while (xiv < xivend) {
661 *(IV**)xiv = (IV *)(xiv + 1);
667 /* grab a new NV body from the free list, allocating more if necessary */
677 PL_xnv_root = *(NV**)xnv;
679 return (XPVNV*)((char*)xnv - STRUCT_OFFSET(XPVNV, xnv_nv));
682 /* return an NV body to the free list */
685 S_del_xnv(pTHX_ XPVNV *p)
687 NV* xnv = (NV*)((char*)(p) + STRUCT_OFFSET(XPVNV, xnv_nv));
689 *(NV**)xnv = PL_xnv_root;
694 /* allocate another arena's worth of NV bodies */
702 New(711, ptr, 1008/sizeof(XPV), XPV);
703 ptr->xpv_pv = (char*)PL_xnv_arenaroot;
704 PL_xnv_arenaroot = ptr;
707 xnvend = &xnv[1008 / sizeof(NV) - 1];
708 xnv += (sizeof(XPVIV) - 1) / sizeof(NV) + 1; /* fudge by sizeof XPVIV */
710 while (xnv < xnvend) {
711 *(NV**)xnv = (NV*)(xnv + 1);
717 /* grab a new struct xrv from the free list, allocating more if necessary */
727 PL_xrv_root = (XRV*)xrv->xrv_rv;
732 /* return a struct xrv to the free list */
735 S_del_xrv(pTHX_ XRV *p)
738 p->xrv_rv = (SV*)PL_xrv_root;
743 /* allocate another arena's worth of struct xrv */
749 register XRV* xrvend;
751 New(712, ptr, 1008/sizeof(XPV), XPV);
752 ptr->xpv_pv = (char*)PL_xrv_arenaroot;
753 PL_xrv_arenaroot = ptr;
756 xrvend = &xrv[1008 / sizeof(XRV) - 1];
757 xrv += (sizeof(XPV) - 1) / sizeof(XRV) + 1;
759 while (xrv < xrvend) {
760 xrv->xrv_rv = (SV*)(xrv + 1);
766 /* grab a new struct xpv from the free list, allocating more if necessary */
776 PL_xpv_root = (XPV*)xpv->xpv_pv;
781 /* return a struct xpv to the free list */
784 S_del_xpv(pTHX_ XPV *p)
787 p->xpv_pv = (char*)PL_xpv_root;
792 /* allocate another arena's worth of struct xpv */
798 register XPV* xpvend;
799 New(713, xpv, 1008/sizeof(XPV), XPV);
800 xpv->xpv_pv = (char*)PL_xpv_arenaroot;
801 PL_xpv_arenaroot = xpv;
803 xpvend = &xpv[1008 / sizeof(XPV) - 1];
805 while (xpv < xpvend) {
806 xpv->xpv_pv = (char*)(xpv + 1);
812 /* grab a new struct xpviv from the free list, allocating more if necessary */
821 xpviv = PL_xpviv_root;
822 PL_xpviv_root = (XPVIV*)xpviv->xpv_pv;
827 /* return a struct xpviv to the free list */
830 S_del_xpviv(pTHX_ XPVIV *p)
833 p->xpv_pv = (char*)PL_xpviv_root;
838 /* allocate another arena's worth of struct xpviv */
843 register XPVIV* xpviv;
844 register XPVIV* xpvivend;
845 New(714, xpviv, 1008/sizeof(XPVIV), XPVIV);
846 xpviv->xpv_pv = (char*)PL_xpviv_arenaroot;
847 PL_xpviv_arenaroot = xpviv;
849 xpvivend = &xpviv[1008 / sizeof(XPVIV) - 1];
850 PL_xpviv_root = ++xpviv;
851 while (xpviv < xpvivend) {
852 xpviv->xpv_pv = (char*)(xpviv + 1);
858 /* grab a new struct xpvnv from the free list, allocating more if necessary */
867 xpvnv = PL_xpvnv_root;
868 PL_xpvnv_root = (XPVNV*)xpvnv->xpv_pv;
873 /* return a struct xpvnv to the free list */
876 S_del_xpvnv(pTHX_ XPVNV *p)
879 p->xpv_pv = (char*)PL_xpvnv_root;
884 /* allocate another arena's worth of struct xpvnv */
889 register XPVNV* xpvnv;
890 register XPVNV* xpvnvend;
891 New(715, xpvnv, 1008/sizeof(XPVNV), XPVNV);
892 xpvnv->xpv_pv = (char*)PL_xpvnv_arenaroot;
893 PL_xpvnv_arenaroot = xpvnv;
895 xpvnvend = &xpvnv[1008 / sizeof(XPVNV) - 1];
896 PL_xpvnv_root = ++xpvnv;
897 while (xpvnv < xpvnvend) {
898 xpvnv->xpv_pv = (char*)(xpvnv + 1);
904 /* grab a new struct xpvcv from the free list, allocating more if necessary */
913 xpvcv = PL_xpvcv_root;
914 PL_xpvcv_root = (XPVCV*)xpvcv->xpv_pv;
919 /* return a struct xpvcv to the free list */
922 S_del_xpvcv(pTHX_ XPVCV *p)
925 p->xpv_pv = (char*)PL_xpvcv_root;
930 /* allocate another arena's worth of struct xpvcv */
935 register XPVCV* xpvcv;
936 register XPVCV* xpvcvend;
937 New(716, xpvcv, 1008/sizeof(XPVCV), XPVCV);
938 xpvcv->xpv_pv = (char*)PL_xpvcv_arenaroot;
939 PL_xpvcv_arenaroot = xpvcv;
941 xpvcvend = &xpvcv[1008 / sizeof(XPVCV) - 1];
942 PL_xpvcv_root = ++xpvcv;
943 while (xpvcv < xpvcvend) {
944 xpvcv->xpv_pv = (char*)(xpvcv + 1);
950 /* grab a new struct xpvav from the free list, allocating more if necessary */
959 xpvav = PL_xpvav_root;
960 PL_xpvav_root = (XPVAV*)xpvav->xav_array;
965 /* return a struct xpvav to the free list */
968 S_del_xpvav(pTHX_ XPVAV *p)
971 p->xav_array = (char*)PL_xpvav_root;
976 /* allocate another arena's worth of struct xpvav */
981 register XPVAV* xpvav;
982 register XPVAV* xpvavend;
983 New(717, xpvav, 1008/sizeof(XPVAV), XPVAV);
984 xpvav->xav_array = (char*)PL_xpvav_arenaroot;
985 PL_xpvav_arenaroot = xpvav;
987 xpvavend = &xpvav[1008 / sizeof(XPVAV) - 1];
988 PL_xpvav_root = ++xpvav;
989 while (xpvav < xpvavend) {
990 xpvav->xav_array = (char*)(xpvav + 1);
993 xpvav->xav_array = 0;
996 /* grab a new struct xpvhv from the free list, allocating more if necessary */
1005 xpvhv = PL_xpvhv_root;
1006 PL_xpvhv_root = (XPVHV*)xpvhv->xhv_array;
1011 /* return a struct xpvhv to the free list */
1014 S_del_xpvhv(pTHX_ XPVHV *p)
1017 p->xhv_array = (char*)PL_xpvhv_root;
1022 /* allocate another arena's worth of struct xpvhv */
1027 register XPVHV* xpvhv;
1028 register XPVHV* xpvhvend;
1029 New(718, xpvhv, 1008/sizeof(XPVHV), XPVHV);
1030 xpvhv->xhv_array = (char*)PL_xpvhv_arenaroot;
1031 PL_xpvhv_arenaroot = xpvhv;
1033 xpvhvend = &xpvhv[1008 / sizeof(XPVHV) - 1];
1034 PL_xpvhv_root = ++xpvhv;
1035 while (xpvhv < xpvhvend) {
1036 xpvhv->xhv_array = (char*)(xpvhv + 1);
1039 xpvhv->xhv_array = 0;
1042 /* grab a new struct xpvmg from the free list, allocating more if necessary */
1051 xpvmg = PL_xpvmg_root;
1052 PL_xpvmg_root = (XPVMG*)xpvmg->xpv_pv;
1057 /* return a struct xpvmg to the free list */
1060 S_del_xpvmg(pTHX_ XPVMG *p)
1063 p->xpv_pv = (char*)PL_xpvmg_root;
1068 /* allocate another arena's worth of struct xpvmg */
1073 register XPVMG* xpvmg;
1074 register XPVMG* xpvmgend;
1075 New(719, xpvmg, 1008/sizeof(XPVMG), XPVMG);
1076 xpvmg->xpv_pv = (char*)PL_xpvmg_arenaroot;
1077 PL_xpvmg_arenaroot = xpvmg;
1079 xpvmgend = &xpvmg[1008 / sizeof(XPVMG) - 1];
1080 PL_xpvmg_root = ++xpvmg;
1081 while (xpvmg < xpvmgend) {
1082 xpvmg->xpv_pv = (char*)(xpvmg + 1);
1088 /* grab a new struct xpvlv from the free list, allocating more if necessary */
1097 xpvlv = PL_xpvlv_root;
1098 PL_xpvlv_root = (XPVLV*)xpvlv->xpv_pv;
1103 /* return a struct xpvlv to the free list */
1106 S_del_xpvlv(pTHX_ XPVLV *p)
1109 p->xpv_pv = (char*)PL_xpvlv_root;
1114 /* allocate another arena's worth of struct xpvlv */
1119 register XPVLV* xpvlv;
1120 register XPVLV* xpvlvend;
1121 New(720, xpvlv, 1008/sizeof(XPVLV), XPVLV);
1122 xpvlv->xpv_pv = (char*)PL_xpvlv_arenaroot;
1123 PL_xpvlv_arenaroot = xpvlv;
1125 xpvlvend = &xpvlv[1008 / sizeof(XPVLV) - 1];
1126 PL_xpvlv_root = ++xpvlv;
1127 while (xpvlv < xpvlvend) {
1128 xpvlv->xpv_pv = (char*)(xpvlv + 1);
1134 /* grab a new struct xpvbm from the free list, allocating more if necessary */
1143 xpvbm = PL_xpvbm_root;
1144 PL_xpvbm_root = (XPVBM*)xpvbm->xpv_pv;
1149 /* return a struct xpvbm to the free list */
1152 S_del_xpvbm(pTHX_ XPVBM *p)
1155 p->xpv_pv = (char*)PL_xpvbm_root;
1160 /* allocate another arena's worth of struct xpvbm */
1165 register XPVBM* xpvbm;
1166 register XPVBM* xpvbmend;
1167 New(721, xpvbm, 1008/sizeof(XPVBM), XPVBM);
1168 xpvbm->xpv_pv = (char*)PL_xpvbm_arenaroot;
1169 PL_xpvbm_arenaroot = xpvbm;
1171 xpvbmend = &xpvbm[1008 / sizeof(XPVBM) - 1];
1172 PL_xpvbm_root = ++xpvbm;
1173 while (xpvbm < xpvbmend) {
1174 xpvbm->xpv_pv = (char*)(xpvbm + 1);
1180 #define my_safemalloc(s) (void*)safemalloc(s)
1181 #define my_safefree(p) safefree((char*)p)
1185 #define new_XIV() my_safemalloc(sizeof(XPVIV))
1186 #define del_XIV(p) my_safefree(p)
1188 #define new_XNV() my_safemalloc(sizeof(XPVNV))
1189 #define del_XNV(p) my_safefree(p)
1191 #define new_XRV() my_safemalloc(sizeof(XRV))
1192 #define del_XRV(p) my_safefree(p)
1194 #define new_XPV() my_safemalloc(sizeof(XPV))
1195 #define del_XPV(p) my_safefree(p)
1197 #define new_XPVIV() my_safemalloc(sizeof(XPVIV))
1198 #define del_XPVIV(p) my_safefree(p)
1200 #define new_XPVNV() my_safemalloc(sizeof(XPVNV))
1201 #define del_XPVNV(p) my_safefree(p)
1203 #define new_XPVCV() my_safemalloc(sizeof(XPVCV))
1204 #define del_XPVCV(p) my_safefree(p)
1206 #define new_XPVAV() my_safemalloc(sizeof(XPVAV))
1207 #define del_XPVAV(p) my_safefree(p)
1209 #define new_XPVHV() my_safemalloc(sizeof(XPVHV))
1210 #define del_XPVHV(p) my_safefree(p)
1212 #define new_XPVMG() my_safemalloc(sizeof(XPVMG))
1213 #define del_XPVMG(p) my_safefree(p)
1215 #define new_XPVLV() my_safemalloc(sizeof(XPVLV))
1216 #define del_XPVLV(p) my_safefree(p)
1218 #define new_XPVBM() my_safemalloc(sizeof(XPVBM))
1219 #define del_XPVBM(p) my_safefree(p)
1223 #define new_XIV() (void*)new_xiv()
1224 #define del_XIV(p) del_xiv((XPVIV*) p)
1226 #define new_XNV() (void*)new_xnv()
1227 #define del_XNV(p) del_xnv((XPVNV*) p)
1229 #define new_XRV() (void*)new_xrv()
1230 #define del_XRV(p) del_xrv((XRV*) p)
1232 #define new_XPV() (void*)new_xpv()
1233 #define del_XPV(p) del_xpv((XPV *)p)
1235 #define new_XPVIV() (void*)new_xpviv()
1236 #define del_XPVIV(p) del_xpviv((XPVIV *)p)
1238 #define new_XPVNV() (void*)new_xpvnv()
1239 #define del_XPVNV(p) del_xpvnv((XPVNV *)p)
1241 #define new_XPVCV() (void*)new_xpvcv()
1242 #define del_XPVCV(p) del_xpvcv((XPVCV *)p)
1244 #define new_XPVAV() (void*)new_xpvav()
1245 #define del_XPVAV(p) del_xpvav((XPVAV *)p)
1247 #define new_XPVHV() (void*)new_xpvhv()
1248 #define del_XPVHV(p) del_xpvhv((XPVHV *)p)
1250 #define new_XPVMG() (void*)new_xpvmg()
1251 #define del_XPVMG(p) del_xpvmg((XPVMG *)p)
1253 #define new_XPVLV() (void*)new_xpvlv()
1254 #define del_XPVLV(p) del_xpvlv((XPVLV *)p)
1256 #define new_XPVBM() (void*)new_xpvbm()
1257 #define del_XPVBM(p) del_xpvbm((XPVBM *)p)
1261 #define new_XPVGV() my_safemalloc(sizeof(XPVGV))
1262 #define del_XPVGV(p) my_safefree(p)
1264 #define new_XPVFM() my_safemalloc(sizeof(XPVFM))
1265 #define del_XPVFM(p) my_safefree(p)
1267 #define new_XPVIO() my_safemalloc(sizeof(XPVIO))
1268 #define del_XPVIO(p) my_safefree(p)
1271 =for apidoc sv_upgrade
1273 Upgrade an SV to a more complex form. Generally adds a new body type to the
1274 SV, then copies across as much information as possible from the old body.
1275 You generally want to use the C<SvUPGRADE> macro wrapper. See also C<svtype>.
1281 Perl_sv_upgrade(pTHX_ register SV *sv, U32 mt)
1288 MAGIC* magic = NULL;
1291 if (mt != SVt_PV && SvIsCOW(sv)) {
1292 sv_force_normal_flags(sv, 0);
1295 if (SvTYPE(sv) == mt)
1299 (void)SvOOK_off(sv);
1301 switch (SvTYPE(sv)) {
1322 else if (mt < SVt_PVIV)
1339 pv = (char*)SvRV(sv);
1359 else if (mt == SVt_NV)
1370 del_XPVIV(SvANY(sv));
1380 del_XPVNV(SvANY(sv));
1388 magic = SvMAGIC(sv);
1389 stash = SvSTASH(sv);
1390 del_XPVMG(SvANY(sv));
1393 Perl_croak(aTHX_ "Can't upgrade that kind of scalar");
1398 Perl_croak(aTHX_ "Can't upgrade to undef");
1400 SvANY(sv) = new_XIV();
1404 SvANY(sv) = new_XNV();
1408 SvANY(sv) = new_XRV();
1412 SvANY(sv) = new_XPV();
1418 SvANY(sv) = new_XPVIV();
1428 SvANY(sv) = new_XPVNV();
1436 SvANY(sv) = new_XPVMG();
1442 SvMAGIC(sv) = magic;
1443 SvSTASH(sv) = stash;
1446 SvANY(sv) = new_XPVLV();
1452 SvMAGIC(sv) = magic;
1453 SvSTASH(sv) = stash;
1460 SvANY(sv) = new_XPVAV();
1468 SvMAGIC(sv) = magic;
1469 SvSTASH(sv) = stash;
1475 SvANY(sv) = new_XPVHV();
1481 HvTOTALKEYS(sv) = 0;
1482 HvPLACEHOLDERS(sv) = 0;
1483 SvMAGIC(sv) = magic;
1484 SvSTASH(sv) = stash;
1491 SvANY(sv) = new_XPVCV();
1492 Zero(SvANY(sv), 1, XPVCV);
1498 SvMAGIC(sv) = magic;
1499 SvSTASH(sv) = stash;
1502 SvANY(sv) = new_XPVGV();
1508 SvMAGIC(sv) = magic;
1509 SvSTASH(sv) = stash;
1517 SvANY(sv) = new_XPVBM();
1523 SvMAGIC(sv) = magic;
1524 SvSTASH(sv) = stash;
1530 SvANY(sv) = new_XPVFM();
1531 Zero(SvANY(sv), 1, XPVFM);
1537 SvMAGIC(sv) = magic;
1538 SvSTASH(sv) = stash;
1541 SvANY(sv) = new_XPVIO();
1542 Zero(SvANY(sv), 1, XPVIO);
1548 SvMAGIC(sv) = magic;
1549 SvSTASH(sv) = stash;
1550 IoPAGE_LEN(sv) = 60;
1553 SvFLAGS(sv) &= ~SVTYPEMASK;
1559 =for apidoc sv_backoff
1561 Remove any string offset. You should normally use the C<SvOOK_off> macro
1568 Perl_sv_backoff(pTHX_ register SV *sv)
1572 char *s = SvPVX(sv);
1573 SvLEN(sv) += SvIVX(sv);
1574 SvPVX(sv) -= SvIVX(sv);
1576 Move(s, SvPVX(sv), SvCUR(sv)+1, char);
1578 SvFLAGS(sv) &= ~SVf_OOK;
1585 Expands the character buffer in the SV. If necessary, uses C<sv_unref> and
1586 upgrades the SV to C<SVt_PV>. Returns a pointer to the character buffer.
1587 Use the C<SvGROW> wrapper instead.
1593 Perl_sv_grow(pTHX_ register SV *sv, register STRLEN newlen)
1597 #ifdef HAS_64K_LIMIT
1598 if (newlen >= 0x10000) {
1599 PerlIO_printf(Perl_debug_log,
1600 "Allocation too large: %"UVxf"\n", (UV)newlen);
1603 #endif /* HAS_64K_LIMIT */
1606 if (SvTYPE(sv) < SVt_PV) {
1607 sv_upgrade(sv, SVt_PV);
1610 else if (SvOOK(sv)) { /* pv is offset? */
1613 if (newlen > SvLEN(sv))
1614 newlen += 10 * (newlen - SvCUR(sv)); /* avoid copy each time */
1615 #ifdef HAS_64K_LIMIT
1616 if (newlen >= 0x10000)
1623 if (newlen > SvLEN(sv)) { /* need more room? */
1624 if (SvLEN(sv) && s) {
1626 STRLEN l = malloced_size((void*)SvPVX(sv));
1632 Renew(s,newlen,char);
1635 New(703, s, newlen, char);
1636 if (SvPVX(sv) && SvCUR(sv)) {
1637 Move(SvPVX(sv), s, (newlen < SvCUR(sv)) ? newlen : SvCUR(sv), char);
1641 SvLEN_set(sv, newlen);
1647 =for apidoc sv_setiv
1649 Copies an integer into the given SV, upgrading first if necessary.
1650 Does not handle 'set' magic. See also C<sv_setiv_mg>.
1656 Perl_sv_setiv(pTHX_ register SV *sv, IV i)
1658 SV_CHECK_THINKFIRST_COW_DROP(sv);
1659 switch (SvTYPE(sv)) {
1661 sv_upgrade(sv, SVt_IV);
1664 sv_upgrade(sv, SVt_PVNV);
1668 sv_upgrade(sv, SVt_PVIV);
1677 Perl_croak(aTHX_ "Can't coerce %s to integer in %s", sv_reftype(sv,0),
1680 (void)SvIOK_only(sv); /* validate number */
1686 =for apidoc sv_setiv_mg
1688 Like C<sv_setiv>, but also handles 'set' magic.
1694 Perl_sv_setiv_mg(pTHX_ register SV *sv, IV i)
1701 =for apidoc sv_setuv
1703 Copies an unsigned integer into the given SV, upgrading first if necessary.
1704 Does not handle 'set' magic. See also C<sv_setuv_mg>.
1710 Perl_sv_setuv(pTHX_ register SV *sv, UV u)
1712 /* With these two if statements:
1713 u=1.49 s=0.52 cu=72.49 cs=10.64 scripts=270 tests=20865
1716 u=1.35 s=0.47 cu=73.45 cs=11.43 scripts=270 tests=20865
1718 If you wish to remove them, please benchmark to see what the effect is
1720 if (u <= (UV)IV_MAX) {
1721 sv_setiv(sv, (IV)u);
1730 =for apidoc sv_setuv_mg
1732 Like C<sv_setuv>, but also handles 'set' magic.
1738 Perl_sv_setuv_mg(pTHX_ register SV *sv, UV u)
1740 /* With these two if statements:
1741 u=1.49 s=0.52 cu=72.49 cs=10.64 scripts=270 tests=20865
1744 u=1.35 s=0.47 cu=73.45 cs=11.43 scripts=270 tests=20865
1746 If you wish to remove them, please benchmark to see what the effect is
1748 if (u <= (UV)IV_MAX) {
1749 sv_setiv(sv, (IV)u);
1759 =for apidoc sv_setnv
1761 Copies a double into the given SV, upgrading first if necessary.
1762 Does not handle 'set' magic. See also C<sv_setnv_mg>.
1768 Perl_sv_setnv(pTHX_ register SV *sv, NV num)
1770 SV_CHECK_THINKFIRST_COW_DROP(sv);
1771 switch (SvTYPE(sv)) {
1774 sv_upgrade(sv, SVt_NV);
1779 sv_upgrade(sv, SVt_PVNV);
1788 Perl_croak(aTHX_ "Can't coerce %s to number in %s", sv_reftype(sv,0),
1792 (void)SvNOK_only(sv); /* validate number */
1797 =for apidoc sv_setnv_mg
1799 Like C<sv_setnv>, but also handles 'set' magic.
1805 Perl_sv_setnv_mg(pTHX_ register SV *sv, NV num)
1811 /* Print an "isn't numeric" warning, using a cleaned-up,
1812 * printable version of the offending string
1816 S_not_a_number(pTHX_ SV *sv)
1823 dsv = sv_2mortal(newSVpv("", 0));
1824 pv = sv_uni_display(dsv, sv, 10, 0);
1827 char *limit = tmpbuf + sizeof(tmpbuf) - 8;
1828 /* each *s can expand to 4 chars + "...\0",
1829 i.e. need room for 8 chars */
1832 for (s = SvPVX(sv), end = s + SvCUR(sv); s < end && d < limit; s++) {
1834 if (ch & 128 && !isPRINT_LC(ch)) {
1843 else if (ch == '\r') {
1847 else if (ch == '\f') {
1851 else if (ch == '\\') {
1855 else if (ch == '\0') {
1859 else if (isPRINT_LC(ch))
1876 Perl_warner(aTHX_ packWARN(WARN_NUMERIC),
1877 "Argument \"%s\" isn't numeric in %s", pv,
1880 Perl_warner(aTHX_ packWARN(WARN_NUMERIC),
1881 "Argument \"%s\" isn't numeric", pv);
1885 =for apidoc looks_like_number
1887 Test if the content of an SV looks like a number (or is a number).
1888 C<Inf> and C<Infinity> are treated as numbers (so will not issue a
1889 non-numeric warning), even if your atof() doesn't grok them.
1895 Perl_looks_like_number(pTHX_ SV *sv)
1897 register char *sbegin;
1904 else if (SvPOKp(sv))
1905 sbegin = SvPV(sv, len);
1907 return 1; /* Historic. Wrong? */
1908 return grok_number(sbegin, len, NULL);
1911 /* Actually, ISO C leaves conversion of UV to IV undefined, but
1912 until proven guilty, assume that things are not that bad... */
1917 As 64 bit platforms often have an NV that doesn't preserve all bits of
1918 an IV (an assumption perl has been based on to date) it becomes necessary
1919 to remove the assumption that the NV always carries enough precision to
1920 recreate the IV whenever needed, and that the NV is the canonical form.
1921 Instead, IV/UV and NV need to be given equal rights. So as to not lose
1922 precision as a side effect of conversion (which would lead to insanity
1923 and the dragon(s) in t/op/numconvert.t getting very angry) the intent is
1924 1) to distinguish between IV/UV/NV slots that have cached a valid
1925 conversion where precision was lost and IV/UV/NV slots that have a
1926 valid conversion which has lost no precision
1927 2) to ensure that if a numeric conversion to one form is requested that
1928 would lose precision, the precise conversion (or differently
1929 imprecise conversion) is also performed and cached, to prevent
1930 requests for different numeric formats on the same SV causing
1931 lossy conversion chains. (lossless conversion chains are perfectly
1936 SvIOKp is true if the IV slot contains a valid value
1937 SvIOK is true only if the IV value is accurate (UV if SvIOK_UV true)
1938 SvNOKp is true if the NV slot contains a valid value
1939 SvNOK is true only if the NV value is accurate
1942 while converting from PV to NV, check to see if converting that NV to an
1943 IV(or UV) would lose accuracy over a direct conversion from PV to
1944 IV(or UV). If it would, cache both conversions, return NV, but mark
1945 SV as IOK NOKp (ie not NOK).
1947 While converting from PV to IV, check to see if converting that IV to an
1948 NV would lose accuracy over a direct conversion from PV to NV. If it
1949 would, cache both conversions, flag similarly.
1951 Before, the SV value "3.2" could become NV=3.2 IV=3 NOK, IOK quite
1952 correctly because if IV & NV were set NV *always* overruled.
1953 Now, "3.2" will become NV=3.2 IV=3 NOK, IOKp, because the flag's meaning
1954 changes - now IV and NV together means that the two are interchangeable:
1955 SvIVX == (IV) SvNVX && SvNVX == (NV) SvIVX;
1957 The benefit of this is that operations such as pp_add know that if
1958 SvIOK is true for both left and right operands, then integer addition
1959 can be used instead of floating point (for cases where the result won't
1960 overflow). Before, floating point was always used, which could lead to
1961 loss of precision compared with integer addition.
1963 * making IV and NV equal status should make maths accurate on 64 bit
1965 * may speed up maths somewhat if pp_add and friends start to use
1966 integers when possible instead of fp. (Hopefully the overhead in
1967 looking for SvIOK and checking for overflow will not outweigh the
1968 fp to integer speedup)
1969 * will slow down integer operations (callers of SvIV) on "inaccurate"
1970 values, as the change from SvIOK to SvIOKp will cause a call into
1971 sv_2iv each time rather than a macro access direct to the IV slot
1972 * should speed up number->string conversion on integers as IV is
1973 favoured when IV and NV are equally accurate
1975 ####################################################################
1976 You had better be using SvIOK_notUV if you want an IV for arithmetic:
1977 SvIOK is true if (IV or UV), so you might be getting (IV)SvUV.
1978 On the other hand, SvUOK is true iff UV.
1979 ####################################################################
1981 Your mileage will vary depending your CPU's relative fp to integer
1985 #ifndef NV_PRESERVES_UV
1986 # define IS_NUMBER_UNDERFLOW_IV 1
1987 # define IS_NUMBER_UNDERFLOW_UV 2
1988 # define IS_NUMBER_IV_AND_UV 2
1989 # define IS_NUMBER_OVERFLOW_IV 4
1990 # define IS_NUMBER_OVERFLOW_UV 5
1992 /* sv_2iuv_non_preserve(): private routine for use by sv_2iv() and sv_2uv() */
1994 /* For sv_2nv these three cases are "SvNOK and don't bother casting" */
1996 S_sv_2iuv_non_preserve(pTHX_ register SV *sv, I32 numtype)
1998 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));
1999 if (SvNVX(sv) < (NV)IV_MIN) {
2000 (void)SvIOKp_on(sv);
2003 return IS_NUMBER_UNDERFLOW_IV;
2005 if (SvNVX(sv) > (NV)UV_MAX) {
2006 (void)SvIOKp_on(sv);
2010 return IS_NUMBER_OVERFLOW_UV;
2012 (void)SvIOKp_on(sv);
2014 /* Can't use strtol etc to convert this string. (See truth table in
2016 if (SvNVX(sv) <= (UV)IV_MAX) {
2017 SvIVX(sv) = I_V(SvNVX(sv));
2018 if ((NV)(SvIVX(sv)) == SvNVX(sv)) {
2019 SvIOK_on(sv); /* Integer is precise. NOK, IOK */
2021 /* Integer is imprecise. NOK, IOKp */
2023 return SvNVX(sv) < 0 ? IS_NUMBER_UNDERFLOW_UV : IS_NUMBER_IV_AND_UV;
2026 SvUVX(sv) = U_V(SvNVX(sv));
2027 if ((NV)(SvUVX(sv)) == SvNVX(sv)) {
2028 if (SvUVX(sv) == UV_MAX) {
2029 /* As we know that NVs don't preserve UVs, UV_MAX cannot
2030 possibly be preserved by NV. Hence, it must be overflow.
2032 return IS_NUMBER_OVERFLOW_UV;
2034 SvIOK_on(sv); /* Integer is precise. NOK, UOK */
2036 /* Integer is imprecise. NOK, IOKp */
2038 return IS_NUMBER_OVERFLOW_IV;
2040 #endif /* !NV_PRESERVES_UV*/
2045 Return the integer value of an SV, doing any necessary string conversion,
2046 magic etc. Normally used via the C<SvIV(sv)> and C<SvIVx(sv)> macros.
2052 Perl_sv_2iv(pTHX_ register SV *sv)
2056 if (SvGMAGICAL(sv)) {
2061 return I_V(SvNVX(sv));
2063 if (SvPOKp(sv) && SvLEN(sv))
2066 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
2067 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
2073 if (SvTHINKFIRST(sv)) {
2076 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv,numer)) &&
2077 (!SvROK(tmpstr) || (SvRV(tmpstr) != SvRV(sv))))
2078 return SvIV(tmpstr);
2079 return PTR2IV(SvRV(sv));
2082 sv_force_normal_flags(sv, 0);
2084 if (SvREADONLY(sv) && !SvOK(sv)) {
2085 if (ckWARN(WARN_UNINITIALIZED))
2092 return (IV)(SvUVX(sv));
2099 /* erm. not sure. *should* never get NOKp (without NOK) from sv_2nv
2100 * without also getting a cached IV/UV from it at the same time
2101 * (ie PV->NV conversion should detect loss of accuracy and cache
2102 * IV or UV at same time to avoid this. NWC */
2104 if (SvTYPE(sv) == SVt_NV)
2105 sv_upgrade(sv, SVt_PVNV);
2107 (void)SvIOKp_on(sv); /* Must do this first, to clear any SvOOK */
2108 /* < not <= as for NV doesn't preserve UV, ((NV)IV_MAX+1) will almost
2109 certainly cast into the IV range at IV_MAX, whereas the correct
2110 answer is the UV IV_MAX +1. Hence < ensures that dodgy boundary
2112 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2113 SvIVX(sv) = I_V(SvNVX(sv));
2114 if (SvNVX(sv) == (NV) SvIVX(sv)
2115 #ifndef NV_PRESERVES_UV
2116 && (((UV)1 << NV_PRESERVES_UV_BITS) >
2117 (UV)(SvIVX(sv) > 0 ? SvIVX(sv) : -SvIVX(sv)))
2118 /* Don't flag it as "accurately an integer" if the number
2119 came from a (by definition imprecise) NV operation, and
2120 we're outside the range of NV integer precision */
2123 SvIOK_on(sv); /* Can this go wrong with rounding? NWC */
2124 DEBUG_c(PerlIO_printf(Perl_debug_log,
2125 "0x%"UVxf" iv(%"NVgf" => %"IVdf") (precise)\n",
2131 /* IV not precise. No need to convert from PV, as NV
2132 conversion would already have cached IV if it detected
2133 that PV->IV would be better than PV->NV->IV
2134 flags already correct - don't set public IOK. */
2135 DEBUG_c(PerlIO_printf(Perl_debug_log,
2136 "0x%"UVxf" iv(%"NVgf" => %"IVdf") (imprecise)\n",
2141 /* Can the above go wrong if SvIVX == IV_MIN and SvNVX < IV_MIN,
2142 but the cast (NV)IV_MIN rounds to a the value less (more
2143 negative) than IV_MIN which happens to be equal to SvNVX ??
2144 Analogous to 0xFFFFFFFFFFFFFFFF rounding up to NV (2**64) and
2145 NV rounding back to 0xFFFFFFFFFFFFFFFF, so UVX == UV(NVX) and
2146 (NV)UVX == NVX are both true, but the values differ. :-(
2147 Hopefully for 2s complement IV_MIN is something like
2148 0x8000000000000000 which will be exact. NWC */
2151 SvUVX(sv) = U_V(SvNVX(sv));
2153 (SvNVX(sv) == (NV) SvUVX(sv))
2154 #ifndef NV_PRESERVES_UV
2155 /* Make sure it's not 0xFFFFFFFFFFFFFFFF */
2156 /*&& (SvUVX(sv) != UV_MAX) irrelevant with code below */
2157 && (((UV)1 << NV_PRESERVES_UV_BITS) > SvUVX(sv))
2158 /* Don't flag it as "accurately an integer" if the number
2159 came from a (by definition imprecise) NV operation, and
2160 we're outside the range of NV integer precision */
2166 DEBUG_c(PerlIO_printf(Perl_debug_log,
2167 "0x%"UVxf" 2iv(%"UVuf" => %"IVdf") (as unsigned)\n",
2171 return (IV)SvUVX(sv);
2174 else if (SvPOKp(sv) && SvLEN(sv)) {
2176 int numtype = grok_number(SvPVX(sv), SvCUR(sv), &value);
2177 /* We want to avoid a possible problem when we cache an IV which
2178 may be later translated to an NV, and the resulting NV is not
2179 the same as the direct translation of the initial string
2180 (eg 123.456 can shortcut to the IV 123 with atol(), but we must
2181 be careful to ensure that the value with the .456 is around if the
2182 NV value is requested in the future).
2184 This means that if we cache such an IV, we need to cache the
2185 NV as well. Moreover, we trade speed for space, and do not
2186 cache the NV if we are sure it's not needed.
2189 /* SVt_PVNV is one higher than SVt_PVIV, hence this order */
2190 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2191 == IS_NUMBER_IN_UV) {
2192 /* It's definitely an integer, only upgrade to PVIV */
2193 if (SvTYPE(sv) < SVt_PVIV)
2194 sv_upgrade(sv, SVt_PVIV);
2196 } else if (SvTYPE(sv) < SVt_PVNV)
2197 sv_upgrade(sv, SVt_PVNV);
2199 /* If NV preserves UV then we only use the UV value if we know that
2200 we aren't going to call atof() below. If NVs don't preserve UVs
2201 then the value returned may have more precision than atof() will
2202 return, even though value isn't perfectly accurate. */
2203 if ((numtype & (IS_NUMBER_IN_UV
2204 #ifdef NV_PRESERVES_UV
2207 )) == IS_NUMBER_IN_UV) {
2208 /* This won't turn off the public IOK flag if it was set above */
2209 (void)SvIOKp_on(sv);
2211 if (!(numtype & IS_NUMBER_NEG)) {
2213 if (value <= (UV)IV_MAX) {
2214 SvIVX(sv) = (IV)value;
2220 /* 2s complement assumption */
2221 if (value <= (UV)IV_MIN) {
2222 SvIVX(sv) = -(IV)value;
2224 /* Too negative for an IV. This is a double upgrade, but
2225 I'm assuming it will be rare. */
2226 if (SvTYPE(sv) < SVt_PVNV)
2227 sv_upgrade(sv, SVt_PVNV);
2231 SvNVX(sv) = -(NV)value;
2236 /* For !NV_PRESERVES_UV and IS_NUMBER_IN_UV and IS_NUMBER_NOT_INT we
2237 will be in the previous block to set the IV slot, and the next
2238 block to set the NV slot. So no else here. */
2240 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2241 != IS_NUMBER_IN_UV) {
2242 /* It wasn't an (integer that doesn't overflow the UV). */
2243 SvNVX(sv) = Atof(SvPVX(sv));
2245 if (! numtype && ckWARN(WARN_NUMERIC))
2248 #if defined(USE_LONG_DOUBLE)
2249 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2iv(%" PERL_PRIgldbl ")\n",
2250 PTR2UV(sv), SvNVX(sv)));
2252 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2iv(%"NVgf")\n",
2253 PTR2UV(sv), SvNVX(sv)));
2257 #ifdef NV_PRESERVES_UV
2258 (void)SvIOKp_on(sv);
2260 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2261 SvIVX(sv) = I_V(SvNVX(sv));
2262 if ((NV)(SvIVX(sv)) == SvNVX(sv)) {
2265 /* Integer is imprecise. NOK, IOKp */
2267 /* UV will not work better than IV */
2269 if (SvNVX(sv) > (NV)UV_MAX) {
2271 /* Integer is inaccurate. NOK, IOKp, is UV */
2275 SvUVX(sv) = U_V(SvNVX(sv));
2276 /* 0xFFFFFFFFFFFFFFFF not an issue in here */
2277 if ((NV)(SvUVX(sv)) == SvNVX(sv)) {
2281 /* Integer is imprecise. NOK, IOKp, is UV */
2287 #else /* NV_PRESERVES_UV */
2288 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2289 == (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT)) {
2290 /* The IV slot will have been set from value returned by
2291 grok_number above. The NV slot has just been set using
2294 assert (SvIOKp(sv));
2296 if (((UV)1 << NV_PRESERVES_UV_BITS) >
2297 U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))) {
2298 /* Small enough to preserve all bits. */
2299 (void)SvIOKp_on(sv);
2301 SvIVX(sv) = I_V(SvNVX(sv));
2302 if ((NV)(SvIVX(sv)) == SvNVX(sv))
2304 /* Assumption: first non-preserved integer is < IV_MAX,
2305 this NV is in the preserved range, therefore: */
2306 if (!(U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))
2308 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);
2312 0 0 already failed to read UV.
2313 0 1 already failed to read UV.
2314 1 0 you won't get here in this case. IV/UV
2315 slot set, public IOK, Atof() unneeded.
2316 1 1 already read UV.
2317 so there's no point in sv_2iuv_non_preserve() attempting
2318 to use atol, strtol, strtoul etc. */
2319 if (sv_2iuv_non_preserve (sv, numtype)
2320 >= IS_NUMBER_OVERFLOW_IV)
2324 #endif /* NV_PRESERVES_UV */
2327 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing && !(SvFLAGS(sv) & SVs_PADTMP))
2329 if (SvTYPE(sv) < SVt_IV)
2330 /* Typically the caller expects that sv_any is not NULL now. */
2331 sv_upgrade(sv, SVt_IV);
2334 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2iv(%"IVdf")\n",
2335 PTR2UV(sv),SvIVX(sv)));
2336 return SvIsUV(sv) ? (IV)SvUVX(sv) : SvIVX(sv);
2342 Return the unsigned integer value of an SV, doing any necessary string
2343 conversion, magic etc. Normally used via the C<SvUV(sv)> and C<SvUVx(sv)>
2350 Perl_sv_2uv(pTHX_ register SV *sv)
2354 if (SvGMAGICAL(sv)) {
2359 return U_V(SvNVX(sv));
2360 if (SvPOKp(sv) && SvLEN(sv))
2363 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
2364 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
2370 if (SvTHINKFIRST(sv)) {
2373 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv,numer)) &&
2374 (!SvROK(tmpstr) || (SvRV(tmpstr) != SvRV(sv))))
2375 return SvUV(tmpstr);
2376 return PTR2UV(SvRV(sv));
2379 sv_force_normal_flags(sv, 0);
2381 if (SvREADONLY(sv) && !SvOK(sv)) {
2382 if (ckWARN(WARN_UNINITIALIZED))
2392 return (UV)SvIVX(sv);
2396 /* erm. not sure. *should* never get NOKp (without NOK) from sv_2nv
2397 * without also getting a cached IV/UV from it at the same time
2398 * (ie PV->NV conversion should detect loss of accuracy and cache
2399 * IV or UV at same time to avoid this. */
2400 /* IV-over-UV optimisation - choose to cache IV if possible */
2402 if (SvTYPE(sv) == SVt_NV)
2403 sv_upgrade(sv, SVt_PVNV);
2405 (void)SvIOKp_on(sv); /* Must do this first, to clear any SvOOK */
2406 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2407 SvIVX(sv) = I_V(SvNVX(sv));
2408 if (SvNVX(sv) == (NV) SvIVX(sv)
2409 #ifndef NV_PRESERVES_UV
2410 && (((UV)1 << NV_PRESERVES_UV_BITS) >
2411 (UV)(SvIVX(sv) > 0 ? SvIVX(sv) : -SvIVX(sv)))
2412 /* Don't flag it as "accurately an integer" if the number
2413 came from a (by definition imprecise) NV operation, and
2414 we're outside the range of NV integer precision */
2417 SvIOK_on(sv); /* Can this go wrong with rounding? NWC */
2418 DEBUG_c(PerlIO_printf(Perl_debug_log,
2419 "0x%"UVxf" uv(%"NVgf" => %"IVdf") (precise)\n",
2425 /* IV not precise. No need to convert from PV, as NV
2426 conversion would already have cached IV if it detected
2427 that PV->IV would be better than PV->NV->IV
2428 flags already correct - don't set public IOK. */
2429 DEBUG_c(PerlIO_printf(Perl_debug_log,
2430 "0x%"UVxf" uv(%"NVgf" => %"IVdf") (imprecise)\n",
2435 /* Can the above go wrong if SvIVX == IV_MIN and SvNVX < IV_MIN,
2436 but the cast (NV)IV_MIN rounds to a the value less (more
2437 negative) than IV_MIN which happens to be equal to SvNVX ??
2438 Analogous to 0xFFFFFFFFFFFFFFFF rounding up to NV (2**64) and
2439 NV rounding back to 0xFFFFFFFFFFFFFFFF, so UVX == UV(NVX) and
2440 (NV)UVX == NVX are both true, but the values differ. :-(
2441 Hopefully for 2s complement IV_MIN is something like
2442 0x8000000000000000 which will be exact. NWC */
2445 SvUVX(sv) = U_V(SvNVX(sv));
2447 (SvNVX(sv) == (NV) SvUVX(sv))
2448 #ifndef NV_PRESERVES_UV
2449 /* Make sure it's not 0xFFFFFFFFFFFFFFFF */
2450 /*&& (SvUVX(sv) != UV_MAX) irrelevant with code below */
2451 && (((UV)1 << NV_PRESERVES_UV_BITS) > SvUVX(sv))
2452 /* Don't flag it as "accurately an integer" if the number
2453 came from a (by definition imprecise) NV operation, and
2454 we're outside the range of NV integer precision */
2459 DEBUG_c(PerlIO_printf(Perl_debug_log,
2460 "0x%"UVxf" 2uv(%"UVuf" => %"IVdf") (as unsigned)\n",
2466 else if (SvPOKp(sv) && SvLEN(sv)) {
2468 int numtype = grok_number(SvPVX(sv), SvCUR(sv), &value);
2470 /* We want to avoid a possible problem when we cache a UV which
2471 may be later translated to an NV, and the resulting NV is not
2472 the translation of the initial data.
2474 This means that if we cache such a UV, we need to cache the
2475 NV as well. Moreover, we trade speed for space, and do not
2476 cache the NV if not needed.
2479 /* SVt_PVNV is one higher than SVt_PVIV, hence this order */
2480 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2481 == IS_NUMBER_IN_UV) {
2482 /* It's definitely an integer, only upgrade to PVIV */
2483 if (SvTYPE(sv) < SVt_PVIV)
2484 sv_upgrade(sv, SVt_PVIV);
2486 } else if (SvTYPE(sv) < SVt_PVNV)
2487 sv_upgrade(sv, SVt_PVNV);
2489 /* If NV preserves UV then we only use the UV value if we know that
2490 we aren't going to call atof() below. If NVs don't preserve UVs
2491 then the value returned may have more precision than atof() will
2492 return, even though it isn't accurate. */
2493 if ((numtype & (IS_NUMBER_IN_UV
2494 #ifdef NV_PRESERVES_UV
2497 )) == IS_NUMBER_IN_UV) {
2498 /* This won't turn off the public IOK flag if it was set above */
2499 (void)SvIOKp_on(sv);
2501 if (!(numtype & IS_NUMBER_NEG)) {
2503 if (value <= (UV)IV_MAX) {
2504 SvIVX(sv) = (IV)value;
2506 /* it didn't overflow, and it was positive. */
2511 /* 2s complement assumption */
2512 if (value <= (UV)IV_MIN) {
2513 SvIVX(sv) = -(IV)value;
2515 /* Too negative for an IV. This is a double upgrade, but
2516 I'm assuming it will be rare. */
2517 if (SvTYPE(sv) < SVt_PVNV)
2518 sv_upgrade(sv, SVt_PVNV);
2522 SvNVX(sv) = -(NV)value;
2528 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2529 != IS_NUMBER_IN_UV) {
2530 /* It wasn't an integer, or it overflowed the UV. */
2531 SvNVX(sv) = Atof(SvPVX(sv));
2533 if (! numtype && ckWARN(WARN_NUMERIC))
2536 #if defined(USE_LONG_DOUBLE)
2537 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2uv(%" PERL_PRIgldbl ")\n",
2538 PTR2UV(sv), SvNVX(sv)));
2540 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2uv(%"NVgf")\n",
2541 PTR2UV(sv), SvNVX(sv)));
2544 #ifdef NV_PRESERVES_UV
2545 (void)SvIOKp_on(sv);
2547 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2548 SvIVX(sv) = I_V(SvNVX(sv));
2549 if ((NV)(SvIVX(sv)) == SvNVX(sv)) {
2552 /* Integer is imprecise. NOK, IOKp */
2554 /* UV will not work better than IV */
2556 if (SvNVX(sv) > (NV)UV_MAX) {
2558 /* Integer is inaccurate. NOK, IOKp, is UV */
2562 SvUVX(sv) = U_V(SvNVX(sv));
2563 /* 0xFFFFFFFFFFFFFFFF not an issue in here, NVs
2564 NV preservse UV so can do correct comparison. */
2565 if ((NV)(SvUVX(sv)) == SvNVX(sv)) {
2569 /* Integer is imprecise. NOK, IOKp, is UV */
2574 #else /* NV_PRESERVES_UV */
2575 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2576 == (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT)) {
2577 /* The UV slot will have been set from value returned by
2578 grok_number above. The NV slot has just been set using
2581 assert (SvIOKp(sv));
2583 if (((UV)1 << NV_PRESERVES_UV_BITS) >
2584 U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))) {
2585 /* Small enough to preserve all bits. */
2586 (void)SvIOKp_on(sv);
2588 SvIVX(sv) = I_V(SvNVX(sv));
2589 if ((NV)(SvIVX(sv)) == SvNVX(sv))
2591 /* Assumption: first non-preserved integer is < IV_MAX,
2592 this NV is in the preserved range, therefore: */
2593 if (!(U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))
2595 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);
2598 sv_2iuv_non_preserve (sv, numtype);
2600 #endif /* NV_PRESERVES_UV */
2604 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
2605 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
2608 if (SvTYPE(sv) < SVt_IV)
2609 /* Typically the caller expects that sv_any is not NULL now. */
2610 sv_upgrade(sv, SVt_IV);
2614 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2uv(%"UVuf")\n",
2615 PTR2UV(sv),SvUVX(sv)));
2616 return SvIsUV(sv) ? SvUVX(sv) : (UV)SvIVX(sv);
2622 Return the num value of an SV, doing any necessary string or integer
2623 conversion, magic etc. Normally used via the C<SvNV(sv)> and C<SvNVx(sv)>
2630 Perl_sv_2nv(pTHX_ register SV *sv)
2634 if (SvGMAGICAL(sv)) {
2638 if (SvPOKp(sv) && SvLEN(sv)) {
2639 if (ckWARN(WARN_NUMERIC) && !SvIOKp(sv) &&
2640 !grok_number(SvPVX(sv), SvCUR(sv), NULL))
2642 return Atof(SvPVX(sv));
2646 return (NV)SvUVX(sv);
2648 return (NV)SvIVX(sv);
2651 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
2652 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
2658 if (SvTHINKFIRST(sv)) {
2661 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv,numer)) &&
2662 (!SvROK(tmpstr) || (SvRV(tmpstr) != SvRV(sv))))
2663 return SvNV(tmpstr);
2664 return PTR2NV(SvRV(sv));
2667 sv_force_normal_flags(sv, 0);
2669 if (SvREADONLY(sv) && !SvOK(sv)) {
2670 if (ckWARN(WARN_UNINITIALIZED))
2675 if (SvTYPE(sv) < SVt_NV) {
2676 if (SvTYPE(sv) == SVt_IV)
2677 sv_upgrade(sv, SVt_PVNV);
2679 sv_upgrade(sv, SVt_NV);
2680 #ifdef USE_LONG_DOUBLE
2682 STORE_NUMERIC_LOCAL_SET_STANDARD();
2683 PerlIO_printf(Perl_debug_log,
2684 "0x%"UVxf" num(%" PERL_PRIgldbl ")\n",
2685 PTR2UV(sv), SvNVX(sv));
2686 RESTORE_NUMERIC_LOCAL();
2690 STORE_NUMERIC_LOCAL_SET_STANDARD();
2691 PerlIO_printf(Perl_debug_log, "0x%"UVxf" num(%"NVgf")\n",
2692 PTR2UV(sv), SvNVX(sv));
2693 RESTORE_NUMERIC_LOCAL();
2697 else if (SvTYPE(sv) < SVt_PVNV)
2698 sv_upgrade(sv, SVt_PVNV);
2703 SvNVX(sv) = SvIsUV(sv) ? (NV)SvUVX(sv) : (NV)SvIVX(sv);
2704 #ifdef NV_PRESERVES_UV
2707 /* Only set the public NV OK flag if this NV preserves the IV */
2708 /* Check it's not 0xFFFFFFFFFFFFFFFF */
2709 if (SvIsUV(sv) ? ((SvUVX(sv) != UV_MAX)&&(SvUVX(sv) == U_V(SvNVX(sv))))
2710 : (SvIVX(sv) == I_V(SvNVX(sv))))
2716 else if (SvPOKp(sv) && SvLEN(sv)) {
2718 int numtype = grok_number(SvPVX(sv), SvCUR(sv), &value);
2719 if (ckWARN(WARN_NUMERIC) && !SvIOKp(sv) && !numtype)
2721 #ifdef NV_PRESERVES_UV
2722 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2723 == IS_NUMBER_IN_UV) {
2724 /* It's definitely an integer */
2725 SvNVX(sv) = (numtype & IS_NUMBER_NEG) ? -(NV)value : (NV)value;
2727 SvNVX(sv) = Atof(SvPVX(sv));
2730 SvNVX(sv) = Atof(SvPVX(sv));
2731 /* Only set the public NV OK flag if this NV preserves the value in
2732 the PV at least as well as an IV/UV would.
2733 Not sure how to do this 100% reliably. */
2734 /* if that shift count is out of range then Configure's test is
2735 wonky. We shouldn't be in here with NV_PRESERVES_UV_BITS ==
2737 if (((UV)1 << NV_PRESERVES_UV_BITS) >
2738 U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))) {
2739 SvNOK_on(sv); /* Definitely small enough to preserve all bits */
2740 } else if (!(numtype & IS_NUMBER_IN_UV)) {
2741 /* Can't use strtol etc to convert this string, so don't try.
2742 sv_2iv and sv_2uv will use the NV to convert, not the PV. */
2745 /* value has been set. It may not be precise. */
2746 if ((numtype & IS_NUMBER_NEG) && (value > (UV)IV_MIN)) {
2747 /* 2s complement assumption for (UV)IV_MIN */
2748 SvNOK_on(sv); /* Integer is too negative. */
2753 if (numtype & IS_NUMBER_NEG) {
2754 SvIVX(sv) = -(IV)value;
2755 } else if (value <= (UV)IV_MAX) {
2756 SvIVX(sv) = (IV)value;
2762 if (numtype & IS_NUMBER_NOT_INT) {
2763 /* I believe that even if the original PV had decimals,
2764 they are lost beyond the limit of the FP precision.
2765 However, neither is canonical, so both only get p
2766 flags. NWC, 2000/11/25 */
2767 /* Both already have p flags, so do nothing */
2770 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2771 if (SvIVX(sv) == I_V(nv)) {
2776 /* It had no "." so it must be integer. */
2779 /* between IV_MAX and NV(UV_MAX).
2780 Could be slightly > UV_MAX */
2782 if (numtype & IS_NUMBER_NOT_INT) {
2783 /* UV and NV both imprecise. */
2785 UV nv_as_uv = U_V(nv);
2787 if (value == nv_as_uv && SvUVX(sv) != UV_MAX) {
2798 #endif /* NV_PRESERVES_UV */
2801 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing && !(SvFLAGS(sv) & SVs_PADTMP))
2803 if (SvTYPE(sv) < SVt_NV)
2804 /* Typically the caller expects that sv_any is not NULL now. */
2805 /* XXX Ilya implies that this is a bug in callers that assume this
2806 and ideally should be fixed. */
2807 sv_upgrade(sv, SVt_NV);
2810 #if defined(USE_LONG_DOUBLE)
2812 STORE_NUMERIC_LOCAL_SET_STANDARD();
2813 PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2nv(%" PERL_PRIgldbl ")\n",
2814 PTR2UV(sv), SvNVX(sv));
2815 RESTORE_NUMERIC_LOCAL();
2819 STORE_NUMERIC_LOCAL_SET_STANDARD();
2820 PerlIO_printf(Perl_debug_log, "0x%"UVxf" 1nv(%"NVgf")\n",
2821 PTR2UV(sv), SvNVX(sv));
2822 RESTORE_NUMERIC_LOCAL();
2828 /* asIV(): extract an integer from the string value of an SV.
2829 * Caller must validate PVX */
2832 S_asIV(pTHX_ SV *sv)
2835 int numtype = grok_number(SvPVX(sv), SvCUR(sv), &value);
2837 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2838 == IS_NUMBER_IN_UV) {
2839 /* It's definitely an integer */
2840 if (numtype & IS_NUMBER_NEG) {
2841 if (value < (UV)IV_MIN)
2844 if (value < (UV)IV_MAX)
2849 if (ckWARN(WARN_NUMERIC))
2852 return I_V(Atof(SvPVX(sv)));
2855 /* asUV(): extract an unsigned integer from the string value of an SV
2856 * Caller must validate PVX */
2859 S_asUV(pTHX_ SV *sv)
2862 int numtype = grok_number(SvPVX(sv), SvCUR(sv), &value);
2864 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2865 == IS_NUMBER_IN_UV) {
2866 /* It's definitely an integer */
2867 if (!(numtype & IS_NUMBER_NEG))
2871 if (ckWARN(WARN_NUMERIC))
2874 return U_V(Atof(SvPVX(sv)));
2878 =for apidoc sv_2pv_nolen
2880 Like C<sv_2pv()>, but doesn't return the length too. You should usually
2881 use the macro wrapper C<SvPV_nolen(sv)> instead.
2886 Perl_sv_2pv_nolen(pTHX_ register SV *sv)
2889 return sv_2pv(sv, &n_a);
2892 /* uiv_2buf(): private routine for use by sv_2pv_flags(): print an IV or
2893 * UV as a string towards the end of buf, and return pointers to start and
2896 * We assume that buf is at least TYPE_CHARS(UV) long.
2900 uiv_2buf(char *buf, IV iv, UV uv, int is_uv, char **peob)
2902 char *ptr = buf + TYPE_CHARS(UV);
2916 *--ptr = '0' + (char)(uv % 10);
2924 /* sv_2pv() is now a macro using Perl_sv_2pv_flags();
2925 * this function provided for binary compatibility only
2929 Perl_sv_2pv(pTHX_ register SV *sv, STRLEN *lp)
2931 return sv_2pv_flags(sv, lp, SV_GMAGIC);
2935 =for apidoc sv_2pv_flags
2937 Returns a pointer to the string value of an SV, and sets *lp to its length.
2938 If flags includes SV_GMAGIC, does an mg_get() first. Coerces sv to a string
2940 Normally invoked via the C<SvPV_flags> macro. C<sv_2pv()> and C<sv_2pv_nomg>
2941 usually end up here too.
2947 Perl_sv_2pv_flags(pTHX_ register SV *sv, STRLEN *lp, I32 flags)
2952 char tbuf[64]; /* Must fit sprintf/Gconvert of longest IV/NV */
2953 char *tmpbuf = tbuf;
2959 if (SvGMAGICAL(sv)) {
2960 if (flags & SV_GMAGIC)
2968 (void)sprintf(tmpbuf,"%"UVuf, (UV)SvUVX(sv));
2970 (void)sprintf(tmpbuf,"%"IVdf, (IV)SvIVX(sv));
2975 Gconvert(SvNVX(sv), NV_DIG, 0, tmpbuf);
2980 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
2981 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
2988 if (SvTHINKFIRST(sv)) {
2991 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv,string)) &&
2992 (!SvROK(tmpstr) || (SvRV(tmpstr) != SvRV(sv)))) {
2993 char *pv = SvPV(tmpstr, *lp);
3007 switch (SvTYPE(sv)) {
3009 if ( ((SvFLAGS(sv) &
3010 (SVs_OBJECT|SVf_OK|SVs_GMG|SVs_SMG|SVs_RMG))
3011 == (SVs_OBJECT|SVs_SMG))
3012 && (mg = mg_find(sv, PERL_MAGIC_qr))) {
3013 regexp *re = (regexp *)mg->mg_obj;
3016 char *fptr = "msix";
3021 char need_newline = 0;
3022 U16 reganch = (U16)((re->reganch & PMf_COMPILETIME) >> 12);
3024 while((ch = *fptr++)) {
3026 reflags[left++] = ch;
3029 reflags[right--] = ch;
3034 reflags[left] = '-';
3038 mg->mg_len = re->prelen + 4 + left;
3040 * If /x was used, we have to worry about a regex
3041 * ending with a comment later being embedded
3042 * within another regex. If so, we don't want this
3043 * regex's "commentization" to leak out to the
3044 * right part of the enclosing regex, we must cap
3045 * it with a newline.
3047 * So, if /x was used, we scan backwards from the
3048 * end of the regex. If we find a '#' before we
3049 * find a newline, we need to add a newline
3050 * ourself. If we find a '\n' first (or if we
3051 * don't find '#' or '\n'), we don't need to add
3052 * anything. -jfriedl
3054 if (PMf_EXTENDED & re->reganch)
3056 char *endptr = re->precomp + re->prelen;
3057 while (endptr >= re->precomp)
3059 char c = *(endptr--);
3061 break; /* don't need another */
3063 /* we end while in a comment, so we
3065 mg->mg_len++; /* save space for it */
3066 need_newline = 1; /* note to add it */
3072 New(616, mg->mg_ptr, mg->mg_len + 1 + left, char);
3073 Copy("(?", mg->mg_ptr, 2, char);
3074 Copy(reflags, mg->mg_ptr+2, left, char);
3075 Copy(":", mg->mg_ptr+left+2, 1, char);
3076 Copy(re->precomp, mg->mg_ptr+3+left, re->prelen, char);
3078 mg->mg_ptr[mg->mg_len - 2] = '\n';
3079 mg->mg_ptr[mg->mg_len - 1] = ')';
3080 mg->mg_ptr[mg->mg_len] = 0;
3082 PL_reginterp_cnt += re->program[0].next_off;
3084 if (re->reganch & ROPT_UTF8)
3099 case SVt_PVBM: if (SvROK(sv))
3102 s = "SCALAR"; break;
3103 case SVt_PVLV: s = SvROK(sv) ? "REF"
3104 /* tied lvalues should appear to be
3105 * scalars for backwards compatitbility */
3106 : (LvTYPE(sv) == 't' || LvTYPE(sv) == 'T')
3107 ? "SCALAR" : "LVALUE"; break;
3108 case SVt_PVAV: s = "ARRAY"; break;
3109 case SVt_PVHV: s = "HASH"; break;
3110 case SVt_PVCV: s = "CODE"; break;
3111 case SVt_PVGV: s = "GLOB"; break;
3112 case SVt_PVFM: s = "FORMAT"; break;
3113 case SVt_PVIO: s = "IO"; break;
3114 default: s = "UNKNOWN"; break;
3118 if (HvNAME(SvSTASH(sv)))
3119 Perl_sv_setpvf(aTHX_ tsv, "%s=%s", HvNAME(SvSTASH(sv)), s);
3121 Perl_sv_setpvf(aTHX_ tsv, "__ANON__=%s", s);
3124 Perl_sv_catpvf(aTHX_ tsv, "(0x%"UVxf")", PTR2UV(sv));
3130 if (SvREADONLY(sv) && !SvOK(sv)) {
3131 if (ckWARN(WARN_UNINITIALIZED))
3137 if (SvIOK(sv) || ((SvIOKp(sv) && !SvNOKp(sv)))) {
3138 /* I'm assuming that if both IV and NV are equally valid then
3139 converting the IV is going to be more efficient */
3140 U32 isIOK = SvIOK(sv);
3141 U32 isUIOK = SvIsUV(sv);
3142 char buf[TYPE_CHARS(UV)];
3145 if (SvTYPE(sv) < SVt_PVIV)
3146 sv_upgrade(sv, SVt_PVIV);
3148 ptr = uiv_2buf(buf, 0, SvUVX(sv), 1, &ebuf);
3150 ptr = uiv_2buf(buf, SvIVX(sv), 0, 0, &ebuf);
3151 SvGROW(sv, (STRLEN)(ebuf - ptr + 1)); /* inlined from sv_setpvn */
3152 Move(ptr,SvPVX(sv),ebuf - ptr,char);
3153 SvCUR_set(sv, ebuf - ptr);
3163 else if (SvNOKp(sv)) {
3164 if (SvTYPE(sv) < SVt_PVNV)
3165 sv_upgrade(sv, SVt_PVNV);
3166 /* The +20 is pure guesswork. Configure test needed. --jhi */
3167 SvGROW(sv, NV_DIG + 20);
3169 olderrno = errno; /* some Xenix systems wipe out errno here */
3171 if (SvNVX(sv) == 0.0)
3172 (void)strcpy(s,"0");
3176 Gconvert(SvNVX(sv), NV_DIG, 0, s);
3179 #ifdef FIXNEGATIVEZERO
3180 if (*s == '-' && s[1] == '0' && !s[2])
3190 if (ckWARN(WARN_UNINITIALIZED)
3191 && !PL_localizing && !(SvFLAGS(sv) & SVs_PADTMP))
3194 if (SvTYPE(sv) < SVt_PV)
3195 /* Typically the caller expects that sv_any is not NULL now. */
3196 sv_upgrade(sv, SVt_PV);
3199 *lp = s - SvPVX(sv);
3202 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2pv(%s)\n",
3203 PTR2UV(sv),SvPVX(sv)));
3207 if (SvROK(sv)) { /* XXX Skip this when sv_pvn_force calls */
3208 /* Sneaky stuff here */
3212 tsv = newSVpv(tmpbuf, 0);
3228 len = strlen(tmpbuf);
3230 #ifdef FIXNEGATIVEZERO
3231 if (len == 2 && t[0] == '-' && t[1] == '0') {
3236 (void)SvUPGRADE(sv, SVt_PV);
3238 s = SvGROW(sv, len + 1);
3247 =for apidoc sv_copypv
3249 Copies a stringified representation of the source SV into the
3250 destination SV. Automatically performs any necessary mg_get and
3251 coercion of numeric values into strings. Guaranteed to preserve
3252 UTF-8 flag even from overloaded objects. Similar in nature to
3253 sv_2pv[_flags] but operates directly on an SV instead of just the
3254 string. Mostly uses sv_2pv_flags to do its work, except when that
3255 would lose the UTF-8'ness of the PV.
3261 Perl_sv_copypv(pTHX_ SV *dsv, register SV *ssv)
3266 sv_setpvn(dsv,s,len);
3274 =for apidoc sv_2pvbyte_nolen
3276 Return a pointer to the byte-encoded representation of the SV.
3277 May cause the SV to be downgraded from UTF-8 as a side-effect.
3279 Usually accessed via the C<SvPVbyte_nolen> macro.
3285 Perl_sv_2pvbyte_nolen(pTHX_ register SV *sv)
3288 return sv_2pvbyte(sv, &n_a);
3292 =for apidoc sv_2pvbyte
3294 Return a pointer to the byte-encoded representation of the SV, and set *lp
3295 to its length. May cause the SV to be downgraded from UTF-8 as a
3298 Usually accessed via the C<SvPVbyte> macro.
3304 Perl_sv_2pvbyte(pTHX_ register SV *sv, STRLEN *lp)
3306 sv_utf8_downgrade(sv,0);
3307 return SvPV(sv,*lp);
3311 =for apidoc sv_2pvutf8_nolen
3313 Return a pointer to the UTF-8-encoded representation of the SV.
3314 May cause the SV to be upgraded to UTF-8 as a side-effect.
3316 Usually accessed via the C<SvPVutf8_nolen> macro.
3322 Perl_sv_2pvutf8_nolen(pTHX_ register SV *sv)
3325 return sv_2pvutf8(sv, &n_a);
3329 =for apidoc sv_2pvutf8
3331 Return a pointer to the UTF-8-encoded representation of the SV, and set *lp
3332 to its length. May cause the SV to be upgraded to UTF-8 as a side-effect.
3334 Usually accessed via the C<SvPVutf8> macro.
3340 Perl_sv_2pvutf8(pTHX_ register SV *sv, STRLEN *lp)
3342 sv_utf8_upgrade(sv);
3343 return SvPV(sv,*lp);
3347 =for apidoc sv_2bool
3349 This function is only called on magical items, and is only used by
3350 sv_true() or its macro equivalent.
3356 Perl_sv_2bool(pTHX_ register SV *sv)
3365 if (SvAMAGIC(sv) && (tmpsv=AMG_CALLun(sv,bool_)) &&
3366 (!SvROK(tmpsv) || (SvRV(tmpsv) != SvRV(sv))))
3367 return (bool)SvTRUE(tmpsv);
3368 return SvRV(sv) != 0;
3371 register XPV* Xpvtmp;
3372 if ((Xpvtmp = (XPV*)SvANY(sv)) &&
3373 (*Xpvtmp->xpv_pv > '0' ||
3374 Xpvtmp->xpv_cur > 1 ||
3375 (Xpvtmp->xpv_cur && *Xpvtmp->xpv_pv != '0')))
3382 return SvIVX(sv) != 0;
3385 return SvNVX(sv) != 0.0;
3392 /* sv_utf8_upgrade() is now a macro using sv_utf8_upgrade_flags();
3393 * this function provided for binary compatibility only
3398 Perl_sv_utf8_upgrade(pTHX_ register SV *sv)
3400 return sv_utf8_upgrade_flags(sv, SV_GMAGIC);
3404 =for apidoc sv_utf8_upgrade
3406 Convert the PV of an SV to its UTF-8-encoded form.
3407 Forces the SV to string form if it is not already.
3408 Always sets the SvUTF8 flag to avoid future validity checks even
3409 if all the bytes have hibit clear.
3411 This is not as a general purpose byte encoding to Unicode interface:
3412 use the Encode extension for that.
3414 =for apidoc sv_utf8_upgrade_flags
3416 Convert the PV of an SV to its UTF-8-encoded form.
3417 Forces the SV to string form if it is not already.
3418 Always sets the SvUTF8 flag to avoid future validity checks even
3419 if all the bytes have hibit clear. If C<flags> has C<SV_GMAGIC> bit set,
3420 will C<mg_get> on C<sv> if appropriate, else not. C<sv_utf8_upgrade> and
3421 C<sv_utf8_upgrade_nomg> are implemented in terms of this function.
3423 This is not as a general purpose byte encoding to Unicode interface:
3424 use the Encode extension for that.
3430 Perl_sv_utf8_upgrade_flags(pTHX_ register SV *sv, I32 flags)
3440 (void) sv_2pv_flags(sv,&len, flags);
3449 sv_force_normal_flags(sv, 0);
3452 if (PL_encoding && !(flags & SV_UTF8_NO_ENCODING))
3453 sv_recode_to_utf8(sv, PL_encoding);
3454 else { /* Assume Latin-1/EBCDIC */
3455 /* This function could be much more efficient if we
3456 * had a FLAG in SVs to signal if there are any hibit
3457 * chars in the PV. Given that there isn't such a flag
3458 * make the loop as fast as possible. */
3459 s = (U8 *) SvPVX(sv);
3460 e = (U8 *) SvEND(sv);
3464 if ((hibit = !NATIVE_IS_INVARIANT(ch)))
3470 len = SvCUR(sv) + 1; /* Plus the \0 */
3471 SvPVX(sv) = (char*)bytes_to_utf8((U8*)s, &len);
3472 SvCUR(sv) = len - 1;
3474 Safefree(s); /* No longer using what was there before. */
3475 SvLEN(sv) = len; /* No longer know the real size. */
3477 /* Mark as UTF-8 even if no hibit - saves scanning loop */
3484 =for apidoc sv_utf8_downgrade
3486 Attempt to convert the PV of an SV from UTF-8-encoded to byte encoding.
3487 This may not be possible if the PV contains non-byte encoding characters;
3488 if this is the case, either returns false or, if C<fail_ok> is not
3491 This is not as a general purpose Unicode to byte encoding interface:
3492 use the Encode extension for that.
3498 Perl_sv_utf8_downgrade(pTHX_ register SV* sv, bool fail_ok)
3500 if (SvPOK(sv) && SvUTF8(sv)) {
3506 sv_force_normal_flags(sv, 0);
3508 s = (U8 *) SvPV(sv, len);
3509 if (!utf8_to_bytes(s, &len)) {
3514 Perl_croak(aTHX_ "Wide character in %s",
3517 Perl_croak(aTHX_ "Wide character");
3528 =for apidoc sv_utf8_encode
3530 Convert the PV of an SV to UTF-8-encoded, but then turn off the C<SvUTF8>
3531 flag so that it looks like octets again. Used as a building block
3532 for encode_utf8 in Encode.xs
3538 Perl_sv_utf8_encode(pTHX_ register SV *sv)
3540 (void) sv_utf8_upgrade(sv);
3545 =for apidoc sv_utf8_decode
3547 Convert the octets in the PV from UTF-8 to chars. Scan for validity and then
3548 turn off SvUTF8 if needed so that we see characters. Used as a building block
3549 for decode_utf8 in Encode.xs
3555 Perl_sv_utf8_decode(pTHX_ register SV *sv)
3561 /* The octets may have got themselves encoded - get them back as
3564 if (!sv_utf8_downgrade(sv, TRUE))
3567 /* it is actually just a matter of turning the utf8 flag on, but
3568 * we want to make sure everything inside is valid utf8 first.
3570 c = (U8 *) SvPVX(sv);
3571 if (!is_utf8_string(c, SvCUR(sv)+1))
3573 e = (U8 *) SvEND(sv);
3576 if (!UTF8_IS_INVARIANT(ch)) {
3585 /* sv_setsv() is now a macro using Perl_sv_setsv_flags();
3586 * this function provided for binary compatibility only
3590 Perl_sv_setsv(pTHX_ SV *dstr, register SV *sstr)
3592 sv_setsv_flags(dstr, sstr, SV_GMAGIC);
3596 =for apidoc sv_setsv
3598 Copies the contents of the source SV C<ssv> into the destination SV
3599 C<dsv>. The source SV may be destroyed if it is mortal, so don't use this
3600 function if the source SV needs to be reused. Does not handle 'set' magic.
3601 Loosely speaking, it performs a copy-by-value, obliterating any previous
3602 content of the destination.
3604 You probably want to use one of the assortment of wrappers, such as
3605 C<SvSetSV>, C<SvSetSV_nosteal>, C<SvSetMagicSV> and
3606 C<SvSetMagicSV_nosteal>.
3608 =for apidoc sv_setsv_flags
3610 Copies the contents of the source SV C<ssv> into the destination SV
3611 C<dsv>. The source SV may be destroyed if it is mortal, so don't use this
3612 function if the source SV needs to be reused. Does not handle 'set' magic.
3613 Loosely speaking, it performs a copy-by-value, obliterating any previous
3614 content of the destination.
3615 If the C<flags> parameter has the C<SV_GMAGIC> bit set, will C<mg_get> on
3616 C<ssv> if appropriate, else not. C<sv_setsv> and C<sv_setsv_nomg> are
3617 implemented in terms of this function.
3619 You probably want to use one of the assortment of wrappers, such as
3620 C<SvSetSV>, C<SvSetSV_nosteal>, C<SvSetMagicSV> and
3621 C<SvSetMagicSV_nosteal>.
3623 This is the primary function for copying scalars, and most other
3624 copy-ish functions and macros use this underneath.
3630 Perl_sv_setsv_flags(pTHX_ SV *dstr, register SV *sstr, I32 flags)
3632 register U32 sflags;
3638 SV_CHECK_THINKFIRST_COW_DROP(dstr);
3640 sstr = &PL_sv_undef;
3641 stype = SvTYPE(sstr);
3642 dtype = SvTYPE(dstr);
3647 /* need to nuke the magic */
3649 SvRMAGICAL_off(dstr);
3652 /* There's a lot of redundancy below but we're going for speed here */
3657 if (dtype != SVt_PVGV) {
3658 (void)SvOK_off(dstr);
3666 sv_upgrade(dstr, SVt_IV);
3669 sv_upgrade(dstr, SVt_PVNV);
3673 sv_upgrade(dstr, SVt_PVIV);
3676 (void)SvIOK_only(dstr);
3677 SvIVX(dstr) = SvIVX(sstr);
3680 if (SvTAINTED(sstr))
3691 sv_upgrade(dstr, SVt_NV);
3696 sv_upgrade(dstr, SVt_PVNV);
3699 SvNVX(dstr) = SvNVX(sstr);
3700 (void)SvNOK_only(dstr);
3701 if (SvTAINTED(sstr))
3709 sv_upgrade(dstr, SVt_RV);
3710 else if (dtype == SVt_PVGV &&
3711 SvROK(sstr) && SvTYPE(SvRV(sstr)) == SVt_PVGV) {
3714 if (GvIMPORTED(dstr) != GVf_IMPORTED
3715 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3717 GvIMPORTED_on(dstr);
3726 #ifdef PERL_COPY_ON_WRITE
3727 if ((SvFLAGS(sstr) & CAN_COW_MASK) == CAN_COW_FLAGS) {
3728 if (dtype < SVt_PVIV)
3729 sv_upgrade(dstr, SVt_PVIV);
3736 sv_upgrade(dstr, SVt_PV);
3739 if (dtype < SVt_PVIV)
3740 sv_upgrade(dstr, SVt_PVIV);
3743 if (dtype < SVt_PVNV)
3744 sv_upgrade(dstr, SVt_PVNV);
3751 Perl_croak(aTHX_ "Bizarre copy of %s in %s", sv_reftype(sstr, 0),
3754 Perl_croak(aTHX_ "Bizarre copy of %s", sv_reftype(sstr, 0));
3758 if (dtype <= SVt_PVGV) {
3760 if (dtype != SVt_PVGV) {
3761 char *name = GvNAME(sstr);
3762 STRLEN len = GvNAMELEN(sstr);
3763 sv_upgrade(dstr, SVt_PVGV);
3764 sv_magic(dstr, dstr, PERL_MAGIC_glob, Nullch, 0);
3765 GvSTASH(dstr) = (HV*)SvREFCNT_inc(GvSTASH(sstr));
3766 GvNAME(dstr) = savepvn(name, len);
3767 GvNAMELEN(dstr) = len;
3768 SvFAKE_on(dstr); /* can coerce to non-glob */
3770 /* ahem, death to those who redefine active sort subs */
3771 else if (PL_curstackinfo->si_type == PERLSI_SORT
3772 && GvCV(dstr) && PL_sortcop == CvSTART(GvCV(dstr)))
3773 Perl_croak(aTHX_ "Can't redefine active sort subroutine %s",
3776 #ifdef GV_UNIQUE_CHECK
3777 if (GvUNIQUE((GV*)dstr)) {
3778 Perl_croak(aTHX_ PL_no_modify);
3782 (void)SvOK_off(dstr);
3783 GvINTRO_off(dstr); /* one-shot flag */
3785 GvGP(dstr) = gp_ref(GvGP(sstr));
3786 if (SvTAINTED(sstr))
3788 if (GvIMPORTED(dstr) != GVf_IMPORTED
3789 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3791 GvIMPORTED_on(dstr);
3799 if (SvGMAGICAL(sstr) && (flags & SV_GMAGIC)) {
3801 if ((int)SvTYPE(sstr) != stype) {
3802 stype = SvTYPE(sstr);
3803 if (stype == SVt_PVGV && dtype <= SVt_PVGV)
3807 if (stype == SVt_PVLV)
3808 (void)SvUPGRADE(dstr, SVt_PVNV);
3810 (void)SvUPGRADE(dstr, (U32)stype);
3813 sflags = SvFLAGS(sstr);
3815 if (sflags & SVf_ROK) {
3816 if (dtype >= SVt_PV) {
3817 if (dtype == SVt_PVGV) {
3818 SV *sref = SvREFCNT_inc(SvRV(sstr));
3820 int intro = GvINTRO(dstr);
3822 #ifdef GV_UNIQUE_CHECK
3823 if (GvUNIQUE((GV*)dstr)) {
3824 Perl_croak(aTHX_ PL_no_modify);
3829 GvINTRO_off(dstr); /* one-shot flag */
3830 GvLINE(dstr) = CopLINE(PL_curcop);
3831 GvEGV(dstr) = (GV*)dstr;
3834 switch (SvTYPE(sref)) {
3837 SAVEGENERICSV(GvAV(dstr));
3839 dref = (SV*)GvAV(dstr);
3840 GvAV(dstr) = (AV*)sref;
3841 if (!GvIMPORTED_AV(dstr)
3842 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3844 GvIMPORTED_AV_on(dstr);
3849 SAVEGENERICSV(GvHV(dstr));
3851 dref = (SV*)GvHV(dstr);
3852 GvHV(dstr) = (HV*)sref;
3853 if (!GvIMPORTED_HV(dstr)
3854 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3856 GvIMPORTED_HV_on(dstr);
3861 if (GvCVGEN(dstr) && GvCV(dstr) != (CV*)sref) {
3862 SvREFCNT_dec(GvCV(dstr));
3863 GvCV(dstr) = Nullcv;
3864 GvCVGEN(dstr) = 0; /* Switch off cacheness. */
3865 PL_sub_generation++;
3867 SAVEGENERICSV(GvCV(dstr));
3870 dref = (SV*)GvCV(dstr);
3871 if (GvCV(dstr) != (CV*)sref) {
3872 CV* cv = GvCV(dstr);
3874 if (!GvCVGEN((GV*)dstr) &&
3875 (CvROOT(cv) || CvXSUB(cv)))
3877 /* ahem, death to those who redefine
3878 * active sort subs */
3879 if (PL_curstackinfo->si_type == PERLSI_SORT &&
3880 PL_sortcop == CvSTART(cv))
3882 "Can't redefine active sort subroutine %s",
3883 GvENAME((GV*)dstr));
3884 /* Redefining a sub - warning is mandatory if
3885 it was a const and its value changed. */
3886 if (ckWARN(WARN_REDEFINE)
3888 && (!CvCONST((CV*)sref)
3889 || sv_cmp(cv_const_sv(cv),
3890 cv_const_sv((CV*)sref)))))
3892 Perl_warner(aTHX_ packWARN(WARN_REDEFINE),
3894 ? "Constant subroutine %s::%s redefined"
3895 : "Subroutine %s::%s redefined",
3896 HvNAME(GvSTASH((GV*)dstr)),
3897 GvENAME((GV*)dstr));
3901 cv_ckproto(cv, (GV*)dstr,
3902 SvPOK(sref) ? SvPVX(sref) : Nullch);
3904 GvCV(dstr) = (CV*)sref;
3905 GvCVGEN(dstr) = 0; /* Switch off cacheness. */
3906 GvASSUMECV_on(dstr);
3907 PL_sub_generation++;
3909 if (!GvIMPORTED_CV(dstr)
3910 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3912 GvIMPORTED_CV_on(dstr);
3917 SAVEGENERICSV(GvIOp(dstr));
3919 dref = (SV*)GvIOp(dstr);
3920 GvIOp(dstr) = (IO*)sref;
3924 SAVEGENERICSV(GvFORM(dstr));
3926 dref = (SV*)GvFORM(dstr);
3927 GvFORM(dstr) = (CV*)sref;
3931 SAVEGENERICSV(GvSV(dstr));
3933 dref = (SV*)GvSV(dstr);
3935 if (!GvIMPORTED_SV(dstr)
3936 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3938 GvIMPORTED_SV_on(dstr);
3944 if (SvTAINTED(sstr))
3949 (void)SvOOK_off(dstr); /* backoff */
3951 Safefree(SvPVX(dstr));
3952 SvLEN(dstr)=SvCUR(dstr)=0;
3955 (void)SvOK_off(dstr);
3956 SvRV(dstr) = SvREFCNT_inc(SvRV(sstr));
3958 if (sflags & SVp_NOK) {
3960 /* Only set the public OK flag if the source has public OK. */
3961 if (sflags & SVf_NOK)
3962 SvFLAGS(dstr) |= SVf_NOK;
3963 SvNVX(dstr) = SvNVX(sstr);
3965 if (sflags & SVp_IOK) {
3966 (void)SvIOKp_on(dstr);
3967 if (sflags & SVf_IOK)
3968 SvFLAGS(dstr) |= SVf_IOK;
3969 if (sflags & SVf_IVisUV)
3971 SvIVX(dstr) = SvIVX(sstr);
3973 if (SvAMAGIC(sstr)) {
3977 else if (sflags & SVp_POK) {
3981 * Check to see if we can just swipe the string. If so, it's a
3982 * possible small lose on short strings, but a big win on long ones.
3983 * It might even be a win on short strings if SvPVX(dstr)
3984 * has to be allocated and SvPVX(sstr) has to be freed.
3987 /* Whichever path we take through the next code, we want this true,
3988 and doing it now facilitates the COW check. */
3989 (void)SvPOK_only(dstr);
3992 #ifdef PERL_COPY_ON_WRITE
3993 (sflags & (SVf_FAKE | SVf_READONLY)) != (SVf_FAKE | SVf_READONLY)
3997 (sflags & SVs_TEMP) && /* slated for free anyway? */
3998 !(sflags & SVf_OOK) && /* and not involved in OOK hack? */
3999 SvREFCNT(sstr) == 1 && /* and no other references to it? */
4000 SvLEN(sstr) && /* and really is a string */
4001 /* and won't be needed again, potentially */
4002 !(PL_op && PL_op->op_type == OP_AASSIGN))
4003 #ifdef PERL_COPY_ON_WRITE
4004 && !((sflags & CAN_COW_MASK) == CAN_COW_FLAGS
4005 && (SvFLAGS(dstr) & CAN_COW_MASK) == CAN_COW_FLAGS
4006 && SvTYPE(sstr) >= SVt_PVIV)
4009 /* Failed the swipe test, and it's not a shared hash key either.
4010 Have to copy the string. */
4011 STRLEN len = SvCUR(sstr);
4012 SvGROW(dstr, len + 1); /* inlined from sv_setpvn */
4013 Move(SvPVX(sstr),SvPVX(dstr),len,char);
4014 SvCUR_set(dstr, len);
4015 *SvEND(dstr) = '\0';
4017 /* If PERL_COPY_ON_WRITE is not defined, then isSwipe will always
4019 #ifdef PERL_COPY_ON_WRITE
4020 /* Either it's a shared hash key, or it's suitable for
4021 copy-on-write or we can swipe the string. */
4023 PerlIO_printf(Perl_debug_log, "Copy on write: sstr --> dstr\n");
4028 /* I believe I should acquire a global SV mutex if
4029 it's a COW sv (not a shared hash key) to stop
4030 it going un copy-on-write.
4031 If the source SV has gone un copy on write between up there
4032 and down here, then (assert() that) it is of the correct
4033 form to make it copy on write again */
4034 if ((sflags & (SVf_FAKE | SVf_READONLY))
4035 != (SVf_FAKE | SVf_READONLY)) {
4036 SvREADONLY_on(sstr);
4038 /* Make the source SV into a loop of 1.
4039 (about to become 2) */
4040 SV_COW_NEXT_SV_SET(sstr, sstr);
4044 /* Initial code is common. */
4045 if (SvPVX(dstr)) { /* we know that dtype >= SVt_PV */
4047 SvFLAGS(dstr) &= ~SVf_OOK;
4048 Safefree(SvPVX(dstr) - SvIVX(dstr));
4050 else if (SvLEN(dstr))
4051 Safefree(SvPVX(dstr));
4054 #ifdef PERL_COPY_ON_WRITE
4056 /* making another shared SV. */
4057 STRLEN cur = SvCUR(sstr);
4058 STRLEN len = SvLEN(sstr);
4059 assert (SvTYPE(dstr) >= SVt_PVIV);
4061 /* SvIsCOW_normal */
4062 /* splice us in between source and next-after-source. */
4063 SV_COW_NEXT_SV_SET(dstr, SV_COW_NEXT_SV(sstr));
4064 SV_COW_NEXT_SV_SET(sstr, dstr);
4065 SvPV_set(dstr, SvPVX(sstr));
4067 /* SvIsCOW_shared_hash */
4068 UV hash = SvUVX(sstr);
4069 DEBUG_C(PerlIO_printf(Perl_debug_log,
4070 "Copy on write: Sharing hash\n"));
4072 sharepvn(SvPVX(sstr),
4073 (sflags & SVf_UTF8?-cur:cur), hash));
4078 SvREADONLY_on(dstr);
4080 /* Relesase a global SV mutex. */
4084 { /* Passes the swipe test. */
4085 SvPV_set(dstr, SvPVX(sstr));
4086 SvLEN_set(dstr, SvLEN(sstr));
4087 SvCUR_set(dstr, SvCUR(sstr));
4090 (void)SvOK_off(sstr); /* NOTE: nukes most SvFLAGS on sstr */
4091 SvPV_set(sstr, Nullch);
4097 if (sflags & SVf_UTF8)
4100 if (sflags & SVp_NOK) {
4102 if (sflags & SVf_NOK)
4103 SvFLAGS(dstr) |= SVf_NOK;
4104 SvNVX(dstr) = SvNVX(sstr);
4106 if (sflags & SVp_IOK) {
4107 (void)SvIOKp_on(dstr);
4108 if (sflags & SVf_IOK)
4109 SvFLAGS(dstr) |= SVf_IOK;
4110 if (sflags & SVf_IVisUV)
4112 SvIVX(dstr) = SvIVX(sstr);
4115 MAGIC *smg = mg_find(sstr,PERL_MAGIC_vstring);
4116 sv_magic(dstr, NULL, PERL_MAGIC_vstring,
4117 smg->mg_ptr, smg->mg_len);
4118 SvRMAGICAL_on(dstr);
4121 else if (sflags & SVp_IOK) {
4122 if (sflags & SVf_IOK)
4123 (void)SvIOK_only(dstr);
4125 (void)SvOK_off(dstr);
4126 (void)SvIOKp_on(dstr);
4128 /* XXXX Do we want to set IsUV for IV(ROK)? Be extra safe... */
4129 if (sflags & SVf_IVisUV)
4131 SvIVX(dstr) = SvIVX(sstr);
4132 if (sflags & SVp_NOK) {
4133 if (sflags & SVf_NOK)
4134 (void)SvNOK_on(dstr);
4136 (void)SvNOKp_on(dstr);
4137 SvNVX(dstr) = SvNVX(sstr);
4140 else if (sflags & SVp_NOK) {
4141 if (sflags & SVf_NOK)
4142 (void)SvNOK_only(dstr);
4144 (void)SvOK_off(dstr);
4147 SvNVX(dstr) = SvNVX(sstr);
4150 if (dtype == SVt_PVGV) {
4151 if (ckWARN(WARN_MISC))
4152 Perl_warner(aTHX_ packWARN(WARN_MISC), "Undefined value assigned to typeglob");
4155 (void)SvOK_off(dstr);
4157 if (SvTAINTED(sstr))
4162 =for apidoc sv_setsv_mg
4164 Like C<sv_setsv>, but also handles 'set' magic.
4170 Perl_sv_setsv_mg(pTHX_ SV *dstr, register SV *sstr)
4172 sv_setsv(dstr,sstr);
4176 #ifdef PERL_COPY_ON_WRITE
4178 Perl_sv_setsv_cow(pTHX_ SV *dstr, SV *sstr)
4180 STRLEN cur = SvCUR(sstr);
4181 STRLEN len = SvLEN(sstr);
4182 register char *new_pv;
4185 PerlIO_printf(Perl_debug_log, "Fast copy on write: %p -> %p\n",
4193 if (SvTHINKFIRST(dstr))
4194 sv_force_normal_flags(dstr, SV_COW_DROP_PV);
4195 else if (SvPVX(dstr))
4196 Safefree(SvPVX(dstr));
4200 SvUPGRADE (dstr, SVt_PVIV);
4202 assert (SvPOK(sstr));
4203 assert (SvPOKp(sstr));
4204 assert (!SvIOK(sstr));
4205 assert (!SvIOKp(sstr));
4206 assert (!SvNOK(sstr));
4207 assert (!SvNOKp(sstr));
4209 if (SvIsCOW(sstr)) {
4211 if (SvLEN(sstr) == 0) {
4212 /* source is a COW shared hash key. */
4213 UV hash = SvUVX(sstr);
4214 DEBUG_C(PerlIO_printf(Perl_debug_log,
4215 "Fast copy on write: Sharing hash\n"));
4217 new_pv = sharepvn(SvPVX(sstr), (SvUTF8(sstr)?-cur:cur), hash);
4220 SV_COW_NEXT_SV_SET(dstr, SV_COW_NEXT_SV(sstr));
4222 assert ((SvFLAGS(sstr) & CAN_COW_MASK) == CAN_COW_FLAGS);
4223 SvUPGRADE (sstr, SVt_PVIV);
4224 SvREADONLY_on(sstr);
4226 DEBUG_C(PerlIO_printf(Perl_debug_log,
4227 "Fast copy on write: Converting sstr to COW\n"));
4228 SV_COW_NEXT_SV_SET(dstr, sstr);
4230 SV_COW_NEXT_SV_SET(sstr, dstr);
4231 new_pv = SvPVX(sstr);
4234 SvPV_set(dstr, new_pv);
4235 SvFLAGS(dstr) = (SVt_PVIV|SVf_POK|SVp_POK|SVf_FAKE|SVf_READONLY);
4248 =for apidoc sv_setpvn
4250 Copies a string into an SV. The C<len> parameter indicates the number of
4251 bytes to be copied. Does not handle 'set' magic. See C<sv_setpvn_mg>.
4257 Perl_sv_setpvn(pTHX_ register SV *sv, register const char *ptr, register STRLEN len)
4259 register char *dptr;
4261 SV_CHECK_THINKFIRST_COW_DROP(sv);
4267 /* len is STRLEN which is unsigned, need to copy to signed */
4270 Perl_croak(aTHX_ "panic: sv_setpvn called with negative strlen");
4272 (void)SvUPGRADE(sv, SVt_PV);
4274 SvGROW(sv, len + 1);
4276 Move(ptr,dptr,len,char);
4279 (void)SvPOK_only_UTF8(sv); /* validate pointer */
4284 =for apidoc sv_setpvn_mg
4286 Like C<sv_setpvn>, but also handles 'set' magic.
4292 Perl_sv_setpvn_mg(pTHX_ register SV *sv, register const char *ptr, register STRLEN len)
4294 sv_setpvn(sv,ptr,len);
4299 =for apidoc sv_setpv
4301 Copies a string into an SV. The string must be null-terminated. Does not
4302 handle 'set' magic. See C<sv_setpv_mg>.
4308 Perl_sv_setpv(pTHX_ register SV *sv, register const char *ptr)
4310 register STRLEN len;
4312 SV_CHECK_THINKFIRST_COW_DROP(sv);
4318 (void)SvUPGRADE(sv, SVt_PV);
4320 SvGROW(sv, len + 1);
4321 Move(ptr,SvPVX(sv),len+1,char);
4323 (void)SvPOK_only_UTF8(sv); /* validate pointer */
4328 =for apidoc sv_setpv_mg
4330 Like C<sv_setpv>, but also handles 'set' magic.
4336 Perl_sv_setpv_mg(pTHX_ register SV *sv, register const char *ptr)
4343 =for apidoc sv_usepvn
4345 Tells an SV to use C<ptr> to find its string value. Normally the string is
4346 stored inside the SV but sv_usepvn allows the SV to use an outside string.
4347 The C<ptr> should point to memory that was allocated by C<malloc>. The
4348 string length, C<len>, must be supplied. This function will realloc the
4349 memory pointed to by C<ptr>, so that pointer should not be freed or used by
4350 the programmer after giving it to sv_usepvn. Does not handle 'set' magic.
4351 See C<sv_usepvn_mg>.
4357 Perl_sv_usepvn(pTHX_ register SV *sv, register char *ptr, register STRLEN len)
4359 SV_CHECK_THINKFIRST_COW_DROP(sv);
4360 (void)SvUPGRADE(sv, SVt_PV);
4365 (void)SvOOK_off(sv);
4366 if (SvPVX(sv) && SvLEN(sv))
4367 Safefree(SvPVX(sv));
4368 Renew(ptr, len+1, char);
4371 SvLEN_set(sv, len+1);
4373 (void)SvPOK_only_UTF8(sv); /* validate pointer */
4378 =for apidoc sv_usepvn_mg
4380 Like C<sv_usepvn>, but also handles 'set' magic.
4386 Perl_sv_usepvn_mg(pTHX_ register SV *sv, register char *ptr, register STRLEN len)
4388 sv_usepvn(sv,ptr,len);
4392 #ifdef PERL_COPY_ON_WRITE
4393 /* Need to do this *after* making the SV normal, as we need the buffer
4394 pointer to remain valid until after we've copied it. If we let go too early,
4395 another thread could invalidate it by unsharing last of the same hash key
4396 (which it can do by means other than releasing copy-on-write Svs)
4397 or by changing the other copy-on-write SVs in the loop. */
4399 S_sv_release_COW(pTHX_ register SV *sv, char *pvx, STRLEN cur, STRLEN len,
4400 U32 hash, SV *after)
4402 if (len) { /* this SV was SvIsCOW_normal(sv) */
4403 /* we need to find the SV pointing to us. */
4404 SV *current = SV_COW_NEXT_SV(after);
4406 if (current == sv) {
4407 /* The SV we point to points back to us (there were only two of us
4409 Hence other SV is no longer copy on write either. */
4411 SvREADONLY_off(after);
4413 /* We need to follow the pointers around the loop. */
4415 while ((next = SV_COW_NEXT_SV(current)) != sv) {
4418 /* don't loop forever if the structure is bust, and we have
4419 a pointer into a closed loop. */
4420 assert (current != after);
4421 assert (SvPVX(current) == pvx);
4423 /* Make the SV before us point to the SV after us. */
4424 SV_COW_NEXT_SV_SET(current, after);
4427 unsharepvn(pvx, SvUTF8(sv) ? -(I32)cur : cur, hash);
4432 Perl_sv_release_IVX(pTHX_ register SV *sv)
4435 sv_force_normal_flags(sv, 0);
4436 return SvOOK_off(sv);
4440 =for apidoc sv_force_normal_flags
4442 Undo various types of fakery on an SV: if the PV is a shared string, make
4443 a private copy; if we're a ref, stop refing; if we're a glob, downgrade to
4444 an xpvmg; if we're a copy-on-write scalar, this is the on-write time when
4445 we do the copy, and is also used locally. If C<SV_COW_DROP_PV> is set
4446 then a copy-on-write scalar drops its PV buffer (if any) and becomes
4447 SvPOK_off rather than making a copy. (Used where this scalar is about to be
4448 set to some other value.) In addition, the C<flags> parameter gets passed to
4449 C<sv_unref_flags()> when unrefing. C<sv_force_normal> calls this function
4450 with flags set to 0.
4456 Perl_sv_force_normal_flags(pTHX_ register SV *sv, U32 flags)
4458 #ifdef PERL_COPY_ON_WRITE
4459 if (SvREADONLY(sv)) {
4460 /* At this point I believe I should acquire a global SV mutex. */
4462 char *pvx = SvPVX(sv);
4463 STRLEN len = SvLEN(sv);
4464 STRLEN cur = SvCUR(sv);
4465 U32 hash = SvUVX(sv);
4466 SV *next = SV_COW_NEXT_SV(sv); /* next COW sv in the loop. */
4468 PerlIO_printf(Perl_debug_log,
4469 "Copy on write: Force normal %ld\n",
4475 /* This SV doesn't own the buffer, so need to New() a new one: */
4478 if (flags & SV_COW_DROP_PV) {
4479 /* OK, so we don't need to copy our buffer. */
4482 SvGROW(sv, cur + 1);
4483 Move(pvx,SvPVX(sv),cur,char);
4487 sv_release_COW(sv, pvx, cur, len, hash, next);
4492 else if (IN_PERL_RUNTIME)
4493 Perl_croak(aTHX_ PL_no_modify);
4494 /* At this point I believe that I can drop the global SV mutex. */
4497 if (SvREADONLY(sv)) {
4499 char *pvx = SvPVX(sv);
4500 STRLEN len = SvCUR(sv);
4501 U32 hash = SvUVX(sv);
4504 SvGROW(sv, len + 1);
4505 Move(pvx,SvPVX(sv),len,char);
4507 unsharepvn(pvx, SvUTF8(sv) ? -(I32)len : len, hash);
4509 else if (IN_PERL_RUNTIME)
4510 Perl_croak(aTHX_ PL_no_modify);
4514 sv_unref_flags(sv, flags);
4515 else if (SvFAKE(sv) && SvTYPE(sv) == SVt_PVGV)
4520 =for apidoc sv_force_normal
4522 Undo various types of fakery on an SV: if the PV is a shared string, make
4523 a private copy; if we're a ref, stop refing; if we're a glob, downgrade to
4524 an xpvmg. See also C<sv_force_normal_flags>.
4530 Perl_sv_force_normal(pTHX_ register SV *sv)
4532 sv_force_normal_flags(sv, 0);
4538 Efficient removal of characters from the beginning of the string buffer.
4539 SvPOK(sv) must be true and the C<ptr> must be a pointer to somewhere inside
4540 the string buffer. The C<ptr> becomes the first character of the adjusted
4541 string. Uses the "OOK hack".
4542 Beware: after this function returns, C<ptr> and SvPVX(sv) may no longer
4543 refer to the same chunk of data.
4549 Perl_sv_chop(pTHX_ register SV *sv, register char *ptr)
4551 register STRLEN delta;
4552 if (!ptr || !SvPOKp(sv))
4554 delta = ptr - SvPVX(sv);
4555 SV_CHECK_THINKFIRST(sv);
4556 if (SvTYPE(sv) < SVt_PVIV)
4557 sv_upgrade(sv,SVt_PVIV);
4560 if (!SvLEN(sv)) { /* make copy of shared string */
4561 char *pvx = SvPVX(sv);
4562 STRLEN len = SvCUR(sv);
4563 SvGROW(sv, len + 1);
4564 Move(pvx,SvPVX(sv),len,char);
4568 /* Same SvOOK_on but SvOOK_on does a SvIOK_off
4569 and we do that anyway inside the SvNIOK_off
4571 SvFLAGS(sv) |= SVf_OOK;
4580 /* sv_catpvn() is now a macro using Perl_sv_catpvn_flags();
4581 * this function provided for binary compatibility only
4585 Perl_sv_catpvn(pTHX_ SV *dsv, const char* sstr, STRLEN slen)
4587 sv_catpvn_flags(dsv, sstr, slen, SV_GMAGIC);
4591 =for apidoc sv_catpvn
4593 Concatenates the string onto the end of the string which is in the SV. The
4594 C<len> indicates number of bytes to copy. If the SV has the UTF-8
4595 status set, then the bytes appended should be valid UTF-8.
4596 Handles 'get' magic, but not 'set' magic. See C<sv_catpvn_mg>.
4598 =for apidoc sv_catpvn_flags
4600 Concatenates the string onto the end of the string which is in the SV. The
4601 C<len> indicates number of bytes to copy. If the SV has the UTF-8
4602 status set, then the bytes appended should be valid UTF-8.
4603 If C<flags> has C<SV_GMAGIC> bit set, will C<mg_get> on C<dsv> if
4604 appropriate, else not. C<sv_catpvn> and C<sv_catpvn_nomg> are implemented
4605 in terms of this function.
4611 Perl_sv_catpvn_flags(pTHX_ register SV *dsv, register const char *sstr, register STRLEN slen, I32 flags)
4616 dstr = SvPV_force_flags(dsv, dlen, flags);
4617 SvGROW(dsv, dlen + slen + 1);
4620 Move(sstr, SvPVX(dsv) + dlen, slen, char);
4623 (void)SvPOK_only_UTF8(dsv); /* validate pointer */
4628 =for apidoc sv_catpvn_mg
4630 Like C<sv_catpvn>, but also handles 'set' magic.
4636 Perl_sv_catpvn_mg(pTHX_ register SV *sv, register const char *ptr, register STRLEN len)
4638 sv_catpvn(sv,ptr,len);
4642 /* sv_catsv() is now a macro using Perl_sv_catsv_flags();
4643 * this function provided for binary compatibility only
4647 Perl_sv_catsv(pTHX_ SV *dstr, register SV *sstr)
4649 sv_catsv_flags(dstr, sstr, SV_GMAGIC);
4653 =for apidoc sv_catsv
4655 Concatenates the string from SV C<ssv> onto the end of the string in
4656 SV C<dsv>. Modifies C<dsv> but not C<ssv>. Handles 'get' magic, but
4657 not 'set' magic. See C<sv_catsv_mg>.
4659 =for apidoc sv_catsv_flags
4661 Concatenates the string from SV C<ssv> onto the end of the string in
4662 SV C<dsv>. Modifies C<dsv> but not C<ssv>. If C<flags> has C<SV_GMAGIC>
4663 bit set, will C<mg_get> on the SVs if appropriate, else not. C<sv_catsv>
4664 and C<sv_catsv_nomg> are implemented in terms of this function.
4669 Perl_sv_catsv_flags(pTHX_ SV *dsv, register SV *ssv, I32 flags)
4675 if ((spv = SvPV(ssv, slen))) {
4676 /* sutf8 and dutf8 were type bool, but under USE_ITHREADS,
4677 gcc version 2.95.2 20000220 (Debian GNU/Linux) for
4678 Linux xxx 2.2.17 on sparc64 with gcc -O2, we erroneously
4679 get dutf8 = 0x20000000, (i.e. SVf_UTF8) even though
4680 dsv->sv_flags doesn't have that bit set.
4681 Andy Dougherty 12 Oct 2001
4683 I32 sutf8 = DO_UTF8(ssv);
4686 if (SvGMAGICAL(dsv) && (flags & SV_GMAGIC))
4688 dutf8 = DO_UTF8(dsv);
4690 if (dutf8 != sutf8) {
4692 /* Not modifying source SV, so taking a temporary copy. */
4693 SV* csv = sv_2mortal(newSVpvn(spv, slen));
4695 sv_utf8_upgrade(csv);
4696 spv = SvPV(csv, slen);
4699 sv_utf8_upgrade_nomg(dsv);
4701 sv_catpvn_nomg(dsv, spv, slen);
4706 =for apidoc sv_catsv_mg
4708 Like C<sv_catsv>, but also handles 'set' magic.
4714 Perl_sv_catsv_mg(pTHX_ SV *dsv, register SV *ssv)
4721 =for apidoc sv_catpv
4723 Concatenates the string onto the end of the string which is in the SV.
4724 If the SV has the UTF-8 status set, then the bytes appended should be
4725 valid UTF-8. Handles 'get' magic, but not 'set' magic. See C<sv_catpv_mg>.
4730 Perl_sv_catpv(pTHX_ register SV *sv, register const char *ptr)
4732 register STRLEN len;
4738 junk = SvPV_force(sv, tlen);
4740 SvGROW(sv, tlen + len + 1);
4743 Move(ptr,SvPVX(sv)+tlen,len+1,char);
4745 (void)SvPOK_only_UTF8(sv); /* validate pointer */
4750 =for apidoc sv_catpv_mg
4752 Like C<sv_catpv>, but also handles 'set' magic.
4758 Perl_sv_catpv_mg(pTHX_ register SV *sv, register const char *ptr)
4767 Create a new null SV, or if len > 0, create a new empty SVt_PV type SV
4768 with an initial PV allocation of len+1. Normally accessed via the C<NEWSV>
4775 Perl_newSV(pTHX_ STRLEN len)
4781 sv_upgrade(sv, SVt_PV);
4782 SvGROW(sv, len + 1);
4787 =for apidoc sv_magicext
4789 Adds magic to an SV, upgrading it if necessary. Applies the
4790 supplied vtable and returns pointer to the magic added.
4792 Note that sv_magicext will allow things that sv_magic will not.
4793 In particular you can add magic to SvREADONLY SVs and and more than
4794 one instance of the same 'how'
4796 I C<namelen> is greater then zero then a savepvn() I<copy> of C<name> is stored,
4797 if C<namelen> is zero then C<name> is stored as-is and - as another special
4798 case - if C<(name && namelen == HEf_SVKEY)> then C<name> is assumed to contain
4799 an C<SV*> and has its REFCNT incremented
4801 (This is now used as a subroutine by sv_magic.)
4806 Perl_sv_magicext(pTHX_ SV* sv, SV* obj, int how, MGVTBL *vtable,
4807 const char* name, I32 namlen)
4811 if (SvTYPE(sv) < SVt_PVMG) {
4812 (void)SvUPGRADE(sv, SVt_PVMG);
4814 Newz(702,mg, 1, MAGIC);
4815 mg->mg_moremagic = SvMAGIC(sv);
4818 /* Some magic sontains a reference loop, where the sv and object refer to
4819 each other. To prevent a reference loop that would prevent such
4820 objects being freed, we look for such loops and if we find one we
4821 avoid incrementing the object refcount.
4823 Note we cannot do this to avoid self-tie loops as intervening RV must
4824 have its REFCNT incremented to keep it in existence.
4827 if (!obj || obj == sv ||
4828 how == PERL_MAGIC_arylen ||
4829 how == PERL_MAGIC_qr ||
4830 (SvTYPE(obj) == SVt_PVGV &&
4831 (GvSV(obj) == sv || GvHV(obj) == (HV*)sv || GvAV(obj) == (AV*)sv ||
4832 GvCV(obj) == (CV*)sv || GvIOp(obj) == (IO*)sv ||
4833 GvFORM(obj) == (CV*)sv)))
4838 mg->mg_obj = SvREFCNT_inc(obj);
4839 mg->mg_flags |= MGf_REFCOUNTED;
4842 /* Normal self-ties simply pass a null object, and instead of
4843 using mg_obj directly, use the SvTIED_obj macro to produce a
4844 new RV as needed. For glob "self-ties", we are tieing the PVIO
4845 with an RV obj pointing to the glob containing the PVIO. In
4846 this case, to avoid a reference loop, we need to weaken the
4850 if (how == PERL_MAGIC_tiedscalar && SvTYPE(sv) == SVt_PVIO &&
4851 obj && SvROK(obj) && GvIO(SvRV(obj)) == (IO*)sv)
4857 mg->mg_len = namlen;
4860 mg->mg_ptr = savepvn(name, namlen);
4861 else if (namlen == HEf_SVKEY)
4862 mg->mg_ptr = (char*)SvREFCNT_inc((SV*)name);
4864 mg->mg_ptr = (char *) name;
4866 mg->mg_virtual = vtable;
4870 SvFLAGS(sv) &= ~(SVf_IOK|SVf_NOK|SVf_POK);
4875 =for apidoc sv_magic
4877 Adds magic to an SV. First upgrades C<sv> to type C<SVt_PVMG> if necessary,
4878 then adds a new magic item of type C<how> to the head of the magic list.
4884 Perl_sv_magic(pTHX_ register SV *sv, SV *obj, int how, const char *name, I32 namlen)
4889 #ifdef PERL_COPY_ON_WRITE
4891 sv_force_normal_flags(sv, 0);
4893 if (SvREADONLY(sv)) {
4895 && how != PERL_MAGIC_regex_global
4896 && how != PERL_MAGIC_bm
4897 && how != PERL_MAGIC_fm
4898 && how != PERL_MAGIC_sv
4901 Perl_croak(aTHX_ PL_no_modify);
4904 if (SvMAGICAL(sv) || (how == PERL_MAGIC_taint && SvTYPE(sv) >= SVt_PVMG)) {
4905 if (SvMAGIC(sv) && (mg = mg_find(sv, how))) {
4906 /* sv_magic() refuses to add a magic of the same 'how' as an
4909 if (how == PERL_MAGIC_taint)
4917 vtable = &PL_vtbl_sv;
4919 case PERL_MAGIC_overload:
4920 vtable = &PL_vtbl_amagic;
4922 case PERL_MAGIC_overload_elem:
4923 vtable = &PL_vtbl_amagicelem;
4925 case PERL_MAGIC_overload_table:
4926 vtable = &PL_vtbl_ovrld;
4929 vtable = &PL_vtbl_bm;
4931 case PERL_MAGIC_regdata:
4932 vtable = &PL_vtbl_regdata;
4934 case PERL_MAGIC_regdatum:
4935 vtable = &PL_vtbl_regdatum;
4937 case PERL_MAGIC_env:
4938 vtable = &PL_vtbl_env;
4941 vtable = &PL_vtbl_fm;
4943 case PERL_MAGIC_envelem:
4944 vtable = &PL_vtbl_envelem;
4946 case PERL_MAGIC_regex_global:
4947 vtable = &PL_vtbl_mglob;
4949 case PERL_MAGIC_isa:
4950 vtable = &PL_vtbl_isa;
4952 case PERL_MAGIC_isaelem:
4953 vtable = &PL_vtbl_isaelem;
4955 case PERL_MAGIC_nkeys:
4956 vtable = &PL_vtbl_nkeys;
4958 case PERL_MAGIC_dbfile:
4961 case PERL_MAGIC_dbline:
4962 vtable = &PL_vtbl_dbline;
4964 #ifdef USE_LOCALE_COLLATE
4965 case PERL_MAGIC_collxfrm:
4966 vtable = &PL_vtbl_collxfrm;
4968 #endif /* USE_LOCALE_COLLATE */
4969 case PERL_MAGIC_tied:
4970 vtable = &PL_vtbl_pack;
4972 case PERL_MAGIC_tiedelem:
4973 case PERL_MAGIC_tiedscalar:
4974 vtable = &PL_vtbl_packelem;
4977 vtable = &PL_vtbl_regexp;
4979 case PERL_MAGIC_sig:
4980 vtable = &PL_vtbl_sig;
4982 case PERL_MAGIC_sigelem:
4983 vtable = &PL_vtbl_sigelem;
4985 case PERL_MAGIC_taint:
4986 vtable = &PL_vtbl_taint;
4988 case PERL_MAGIC_uvar:
4989 vtable = &PL_vtbl_uvar;
4991 case PERL_MAGIC_vec:
4992 vtable = &PL_vtbl_vec;
4994 case PERL_MAGIC_vstring:
4997 case PERL_MAGIC_utf8:
4998 vtable = &PL_vtbl_utf8;
5000 case PERL_MAGIC_substr:
5001 vtable = &PL_vtbl_substr;
5003 case PERL_MAGIC_defelem:
5004 vtable = &PL_vtbl_defelem;
5006 case PERL_MAGIC_glob:
5007 vtable = &PL_vtbl_glob;
5009 case PERL_MAGIC_arylen:
5010 vtable = &PL_vtbl_arylen;
5012 case PERL_MAGIC_pos:
5013 vtable = &PL_vtbl_pos;
5015 case PERL_MAGIC_backref:
5016 vtable = &PL_vtbl_backref;
5018 case PERL_MAGIC_ext:
5019 /* Reserved for use by extensions not perl internals. */
5020 /* Useful for attaching extension internal data to perl vars. */
5021 /* Note that multiple extensions may clash if magical scalars */
5022 /* etc holding private data from one are passed to another. */
5025 Perl_croak(aTHX_ "Don't know how to handle magic of type \\%o", how);
5028 /* Rest of work is done else where */
5029 mg = sv_magicext(sv,obj,how,vtable,name,namlen);
5032 case PERL_MAGIC_taint:
5035 case PERL_MAGIC_ext:
5036 case PERL_MAGIC_dbfile:
5043 =for apidoc sv_unmagic
5045 Removes all magic of type C<type> from an SV.
5051 Perl_sv_unmagic(pTHX_ SV *sv, int type)
5055 if (SvTYPE(sv) < SVt_PVMG || !SvMAGIC(sv))
5058 for (mg = *mgp; mg; mg = *mgp) {
5059 if (mg->mg_type == type) {
5060 MGVTBL* vtbl = mg->mg_virtual;
5061 *mgp = mg->mg_moremagic;
5062 if (vtbl && vtbl->svt_free)
5063 CALL_FPTR(vtbl->svt_free)(aTHX_ sv, mg);
5064 if (mg->mg_ptr && mg->mg_type != PERL_MAGIC_regex_global) {
5066 Safefree(mg->mg_ptr);
5067 else if (mg->mg_len == HEf_SVKEY)
5068 SvREFCNT_dec((SV*)mg->mg_ptr);
5069 else if (mg->mg_type == PERL_MAGIC_utf8 && mg->mg_ptr)
5070 Safefree(mg->mg_ptr);
5072 if (mg->mg_flags & MGf_REFCOUNTED)
5073 SvREFCNT_dec(mg->mg_obj);
5077 mgp = &mg->mg_moremagic;
5081 SvFLAGS(sv) |= (SvFLAGS(sv) & (SVp_NOK|SVp_POK)) >> PRIVSHIFT;
5088 =for apidoc sv_rvweaken
5090 Weaken a reference: set the C<SvWEAKREF> flag on this RV; give the
5091 referred-to SV C<PERL_MAGIC_backref> magic if it hasn't already; and
5092 push a back-reference to this RV onto the array of backreferences
5093 associated with that magic.
5099 Perl_sv_rvweaken(pTHX_ SV *sv)
5102 if (!SvOK(sv)) /* let undefs pass */
5105 Perl_croak(aTHX_ "Can't weaken a nonreference");
5106 else if (SvWEAKREF(sv)) {
5107 if (ckWARN(WARN_MISC))
5108 Perl_warner(aTHX_ packWARN(WARN_MISC), "Reference is already weak");
5112 sv_add_backref(tsv, sv);
5118 /* Give tsv backref magic if it hasn't already got it, then push a
5119 * back-reference to sv onto the array associated with the backref magic.
5123 S_sv_add_backref(pTHX_ SV *tsv, SV *sv)
5127 if (SvMAGICAL(tsv) && (mg = mg_find(tsv, PERL_MAGIC_backref)))
5128 av = (AV*)mg->mg_obj;
5131 sv_magic(tsv, (SV*)av, PERL_MAGIC_backref, NULL, 0);
5132 /* av now has a refcnt of 2, which avoids it getting freed
5133 * before us during global cleanup. The extra ref is removed
5134 * by magic_killbackrefs() when tsv is being freed */
5136 if (AvFILLp(av) >= AvMAX(av)) {
5137 SV **svp = AvARRAY(av);
5138 I32 i = AvFILLp(av);
5140 if (svp[i] == &PL_sv_undef) {
5141 svp[i] = sv; /* reuse the slot */
5146 av_extend(av, AvFILLp(av)+1);
5148 AvARRAY(av)[++AvFILLp(av)] = sv; /* av_push() */
5151 /* delete a back-reference to ourselves from the backref magic associated
5152 * with the SV we point to.
5156 S_sv_del_backref(pTHX_ SV *sv)
5163 if (!SvMAGICAL(tsv) || !(mg = mg_find(tsv, PERL_MAGIC_backref)))
5164 Perl_croak(aTHX_ "panic: del_backref");
5165 av = (AV *)mg->mg_obj;
5170 svp[i] = &PL_sv_undef; /* XXX */
5177 =for apidoc sv_insert
5179 Inserts a string at the specified offset/length within the SV. Similar to
5180 the Perl substr() function.
5186 Perl_sv_insert(pTHX_ SV *bigstr, STRLEN offset, STRLEN len, char *little, STRLEN littlelen)
5190 register char *midend;
5191 register char *bigend;
5197 Perl_croak(aTHX_ "Can't modify non-existent substring");
5198 SvPV_force(bigstr, curlen);
5199 (void)SvPOK_only_UTF8(bigstr);
5200 if (offset + len > curlen) {
5201 SvGROW(bigstr, offset+len+1);
5202 Zero(SvPVX(bigstr)+curlen, offset+len-curlen, char);
5203 SvCUR_set(bigstr, offset+len);
5207 i = littlelen - len;
5208 if (i > 0) { /* string might grow */
5209 big = SvGROW(bigstr, SvCUR(bigstr) + i + 1);
5210 mid = big + offset + len;
5211 midend = bigend = big + SvCUR(bigstr);
5214 while (midend > mid) /* shove everything down */
5215 *--bigend = *--midend;
5216 Move(little,big+offset,littlelen,char);
5222 Move(little,SvPVX(bigstr)+offset,len,char);
5227 big = SvPVX(bigstr);
5230 bigend = big + SvCUR(bigstr);
5232 if (midend > bigend)
5233 Perl_croak(aTHX_ "panic: sv_insert");
5235 if (mid - big > bigend - midend) { /* faster to shorten from end */
5237 Move(little, mid, littlelen,char);
5240 i = bigend - midend;
5242 Move(midend, mid, i,char);
5246 SvCUR_set(bigstr, mid - big);
5249 else if ((i = mid - big)) { /* faster from front */
5250 midend -= littlelen;
5252 sv_chop(bigstr,midend-i);
5257 Move(little, mid, littlelen,char);
5259 else if (littlelen) {
5260 midend -= littlelen;
5261 sv_chop(bigstr,midend);
5262 Move(little,midend,littlelen,char);
5265 sv_chop(bigstr,midend);
5271 =for apidoc sv_replace
5273 Make the first argument a copy of the second, then delete the original.
5274 The target SV physically takes over ownership of the body of the source SV
5275 and inherits its flags; however, the target keeps any magic it owns,
5276 and any magic in the source is discarded.
5277 Note that this is a rather specialist SV copying operation; most of the
5278 time you'll want to use C<sv_setsv> or one of its many macro front-ends.
5284 Perl_sv_replace(pTHX_ register SV *sv, register SV *nsv)
5286 U32 refcnt = SvREFCNT(sv);
5287 SV_CHECK_THINKFIRST_COW_DROP(sv);
5288 if (SvREFCNT(nsv) != 1 && ckWARN_d(WARN_INTERNAL))
5289 Perl_warner(aTHX_ packWARN(WARN_INTERNAL), "Reference miscount in sv_replace()");
5290 if (SvMAGICAL(sv)) {
5294 sv_upgrade(nsv, SVt_PVMG);
5295 SvMAGIC(nsv) = SvMAGIC(sv);
5296 SvFLAGS(nsv) |= SvMAGICAL(sv);
5302 assert(!SvREFCNT(sv));
5303 StructCopy(nsv,sv,SV);
5304 #ifdef PERL_COPY_ON_WRITE
5305 if (SvIsCOW_normal(nsv)) {
5306 /* We need to follow the pointers around the loop to make the
5307 previous SV point to sv, rather than nsv. */
5310 while ((next = SV_COW_NEXT_SV(current)) != nsv) {
5313 assert(SvPVX(current) == SvPVX(nsv));
5315 /* Make the SV before us point to the SV after us. */
5317 PerlIO_printf(Perl_debug_log, "previous is\n");
5319 PerlIO_printf(Perl_debug_log,
5320 "move it from 0x%"UVxf" to 0x%"UVxf"\n",
5321 (UV) SV_COW_NEXT_SV(current), (UV) sv);
5323 SV_COW_NEXT_SV_SET(current, sv);
5326 SvREFCNT(sv) = refcnt;
5327 SvFLAGS(nsv) |= SVTYPEMASK; /* Mark as freed */
5333 =for apidoc sv_clear
5335 Clear an SV: call any destructors, free up any memory used by the body,
5336 and free the body itself. The SV's head is I<not> freed, although
5337 its type is set to all 1's so that it won't inadvertently be assumed
5338 to be live during global destruction etc.
5339 This function should only be called when REFCNT is zero. Most of the time
5340 you'll want to call C<sv_free()> (or its macro wrapper C<SvREFCNT_dec>)
5347 Perl_sv_clear(pTHX_ register SV *sv)
5351 assert(SvREFCNT(sv) == 0);
5354 if (PL_defstash) { /* Still have a symbol table? */
5361 stash = SvSTASH(sv);
5362 destructor = StashHANDLER(stash,DESTROY);
5364 SV* tmpref = newRV(sv);
5365 SvREADONLY_on(tmpref); /* DESTROY() could be naughty */
5367 PUSHSTACKi(PERLSI_DESTROY);
5372 call_sv((SV*)destructor, G_DISCARD|G_EVAL|G_KEEPERR|G_VOID);
5378 if(SvREFCNT(tmpref) < 2) {
5379 /* tmpref is not kept alive! */
5384 SvREFCNT_dec(tmpref);
5386 } while (SvOBJECT(sv) && SvSTASH(sv) != stash);
5390 if (PL_in_clean_objs)
5391 Perl_croak(aTHX_ "DESTROY created new reference to dead object '%s'",
5393 /* DESTROY gave object new lease on life */
5399 SvREFCNT_dec(SvSTASH(sv)); /* possibly of changed persuasion */
5400 SvOBJECT_off(sv); /* Curse the object. */
5401 if (SvTYPE(sv) != SVt_PVIO)
5402 --PL_sv_objcount; /* XXX Might want something more general */
5405 if (SvTYPE(sv) >= SVt_PVMG) {
5408 if (SvFLAGS(sv) & SVpad_TYPED)
5409 SvREFCNT_dec(SvSTASH(sv));
5412 switch (SvTYPE(sv)) {
5415 IoIFP(sv) != PerlIO_stdin() &&
5416 IoIFP(sv) != PerlIO_stdout() &&
5417 IoIFP(sv) != PerlIO_stderr())
5419 io_close((IO*)sv, FALSE);
5421 if (IoDIRP(sv) && !(IoFLAGS(sv) & IOf_FAKE_DIRP))
5422 PerlDir_close(IoDIRP(sv));
5423 IoDIRP(sv) = (DIR*)NULL;
5424 Safefree(IoTOP_NAME(sv));
5425 Safefree(IoFMT_NAME(sv));
5426 Safefree(IoBOTTOM_NAME(sv));
5441 if (LvTYPE(sv) == 'T') { /* for tie: return HE to pool */
5442 SvREFCNT_dec(HeKEY_sv((HE*)LvTARG(sv)));
5443 HeNEXT((HE*)LvTARG(sv)) = PL_hv_fetch_ent_mh;
5444 PL_hv_fetch_ent_mh = (HE*)LvTARG(sv);
5446 else if (LvTYPE(sv) != 't') /* unless tie: unrefcnted fake SV** */
5447 SvREFCNT_dec(LvTARG(sv));
5451 Safefree(GvNAME(sv));
5452 /* cannot decrease stash refcount yet, as we might recursively delete
5453 ourselves when the refcnt drops to zero. Delay SvREFCNT_dec
5454 of stash until current sv is completely gone.
5455 -- JohnPC, 27 Mar 1998 */
5456 stash = GvSTASH(sv);
5462 (void)SvOOK_off(sv);
5470 SvREFCNT_dec(SvRV(sv));
5472 #ifdef PERL_COPY_ON_WRITE
5473 else if (SvPVX(sv)) {
5475 /* I believe I need to grab the global SV mutex here and
5476 then recheck the COW status. */
5478 PerlIO_printf(Perl_debug_log, "Copy on write: clear\n");
5481 sv_release_COW(sv, SvPVX(sv), SvCUR(sv), SvLEN(sv),
5482 SvUVX(sv), SV_COW_NEXT_SV(sv));
5483 /* And drop it here. */
5485 } else if (SvLEN(sv)) {
5486 Safefree(SvPVX(sv));
5490 else if (SvPVX(sv) && SvLEN(sv))
5491 Safefree(SvPVX(sv));
5492 else if (SvPVX(sv) && SvREADONLY(sv) && SvFAKE(sv)) {
5493 unsharepvn(SvPVX(sv),
5494 SvUTF8(sv) ? -(I32)SvCUR(sv) : SvCUR(sv),
5508 switch (SvTYPE(sv)) {
5524 del_XPVIV(SvANY(sv));
5527 del_XPVNV(SvANY(sv));
5530 del_XPVMG(SvANY(sv));
5533 del_XPVLV(SvANY(sv));
5536 del_XPVAV(SvANY(sv));
5539 del_XPVHV(SvANY(sv));
5542 del_XPVCV(SvANY(sv));
5545 del_XPVGV(SvANY(sv));
5546 /* code duplication for increased performance. */
5547 SvFLAGS(sv) &= SVf_BREAK;
5548 SvFLAGS(sv) |= SVTYPEMASK;
5549 /* decrease refcount of the stash that owns this GV, if any */
5551 SvREFCNT_dec(stash);
5552 return; /* not break, SvFLAGS reset already happened */
5554 del_XPVBM(SvANY(sv));
5557 del_XPVFM(SvANY(sv));
5560 del_XPVIO(SvANY(sv));
5563 SvFLAGS(sv) &= SVf_BREAK;
5564 SvFLAGS(sv) |= SVTYPEMASK;
5568 =for apidoc sv_newref
5570 Increment an SV's reference count. Use the C<SvREFCNT_inc()> wrapper
5577 Perl_sv_newref(pTHX_ SV *sv)
5587 Decrement an SV's reference count, and if it drops to zero, call
5588 C<sv_clear> to invoke destructors and free up any memory used by
5589 the body; finally, deallocate the SV's head itself.
5590 Normally called via a wrapper macro C<SvREFCNT_dec>.
5596 Perl_sv_free(pTHX_ SV *sv)
5600 if (SvREFCNT(sv) == 0) {
5601 if (SvFLAGS(sv) & SVf_BREAK)
5602 /* this SV's refcnt has been artificially decremented to
5603 * trigger cleanup */
5605 if (PL_in_clean_all) /* All is fair */
5607 if (SvREADONLY(sv) && SvIMMORTAL(sv)) {
5608 /* make sure SvREFCNT(sv)==0 happens very seldom */
5609 SvREFCNT(sv) = (~(U32)0)/2;
5612 if (ckWARN_d(WARN_INTERNAL))
5613 Perl_warner(aTHX_ packWARN(WARN_INTERNAL),
5614 "Attempt to free unreferenced scalar: SV 0x%"UVxf,
5618 if (--(SvREFCNT(sv)) > 0)
5620 Perl_sv_free2(aTHX_ sv);
5624 Perl_sv_free2(pTHX_ SV *sv)
5628 if (ckWARN_d(WARN_DEBUGGING))
5629 Perl_warner(aTHX_ packWARN(WARN_DEBUGGING),
5630 "Attempt to free temp prematurely: SV 0x%"UVxf,
5635 if (SvREADONLY(sv) && SvIMMORTAL(sv)) {
5636 /* make sure SvREFCNT(sv)==0 happens very seldom */
5637 SvREFCNT(sv) = (~(U32)0)/2;
5648 Returns the length of the string in the SV. Handles magic and type
5649 coercion. See also C<SvCUR>, which gives raw access to the xpv_cur slot.
5655 Perl_sv_len(pTHX_ register SV *sv)
5663 len = mg_length(sv);
5665 (void)SvPV(sv, len);
5670 =for apidoc sv_len_utf8
5672 Returns the number of characters in the string in an SV, counting wide
5673 UTF-8 bytes as a single character. Handles magic and type coercion.
5679 * The length is cached in PERL_UTF8_magic, in the mg_len field. Also the
5680 * mg_ptr is used, by sv_pos_u2b(), see the comments of S_utf8_mg_pos_init().
5681 * (Note that the mg_len is not the length of the mg_ptr field.)
5686 Perl_sv_len_utf8(pTHX_ register SV *sv)
5692 return mg_length(sv);
5696 U8 *s = (U8*)SvPV(sv, len);
5697 MAGIC *mg = SvMAGICAL(sv) ? mg_find(sv, PERL_MAGIC_utf8) : 0;
5699 if (mg && mg->mg_len != -1 && (mg->mg_len > 0 || len == 0)) {
5701 #ifdef PERL_UTF8_CACHE_ASSERT
5702 assert(ulen == Perl_utf8_length(aTHX_ s, s + len));
5706 ulen = Perl_utf8_length(aTHX_ s, s + len);
5707 if (!mg && !SvREADONLY(sv)) {
5708 sv_magic(sv, 0, PERL_MAGIC_utf8, 0, 0);
5709 mg = mg_find(sv, PERL_MAGIC_utf8);
5719 /* S_utf8_mg_pos_init() is used to initialize the mg_ptr field of
5720 * a PERL_UTF8_magic. The mg_ptr is used to store the mapping
5721 * between UTF-8 and byte offsets. There are two (substr offset and substr
5722 * length, the i offset, PERL_MAGIC_UTF8_CACHESIZE) times two (UTF-8 offset
5723 * and byte offset) cache positions.
5725 * The mg_len field is used by sv_len_utf8(), see its comments.
5726 * Note that the mg_len is not the length of the mg_ptr field.
5730 S_utf8_mg_pos_init(pTHX_ SV *sv, MAGIC **mgp, STRLEN **cachep, I32 i, I32 *offsetp, U8 *s, U8 *start)
5734 if (SvMAGICAL(sv) && !SvREADONLY(sv)) {
5736 sv_magic(sv, 0, PERL_MAGIC_utf8, 0, 0);
5737 *mgp = mg_find(sv, PERL_MAGIC_utf8);
5742 *cachep = (STRLEN *) (*mgp)->mg_ptr;
5744 Newz(0, *cachep, PERL_MAGIC_UTF8_CACHESIZE * 2, STRLEN);
5745 (*mgp)->mg_ptr = (char *) *cachep;
5749 (*cachep)[i] = *offsetp;
5750 (*cachep)[i+1] = s - start;
5758 * S_utf8_mg_pos() is used to query and update mg_ptr field of
5759 * a PERL_UTF8_magic. The mg_ptr is used to store the mapping
5760 * between UTF-8 and byte offsets. See also the comments of
5761 * S_utf8_mg_pos_init().
5765 S_utf8_mg_pos(pTHX_ SV *sv, MAGIC **mgp, STRLEN **cachep, I32 i, I32 *offsetp, I32 uoff, U8 **sp, U8 *start, U8 *send)
5769 if (SvMAGICAL(sv) && !SvREADONLY(sv)) {
5771 *mgp = mg_find(sv, PERL_MAGIC_utf8);
5772 if (*mgp && (*mgp)->mg_ptr) {
5773 *cachep = (STRLEN *) (*mgp)->mg_ptr;
5774 ASSERT_UTF8_CACHE(*cachep);
5775 if ((*cachep)[i] == (STRLEN)uoff) /* An exact match. */
5777 else { /* We will skip to the right spot. */
5782 /* The assumption is that going backward is half
5783 * the speed of going forward (that's where the
5784 * 2 * backw in the below comes from). (The real
5785 * figure of course depends on the UTF-8 data.) */
5787 if ((*cachep)[i] > (STRLEN)uoff) {
5789 backw = (*cachep)[i] - (STRLEN)uoff;
5791 if (forw < 2 * backw)
5794 p = start + (*cachep)[i+1];
5796 /* Try this only for the substr offset (i == 0),
5797 * not for the substr length (i == 2). */
5798 else if (i == 0) { /* (*cachep)[i] < uoff */
5799 STRLEN ulen = sv_len_utf8(sv);
5801 if ((STRLEN)uoff < ulen) {
5802 forw = (STRLEN)uoff - (*cachep)[i];
5803 backw = ulen - (STRLEN)uoff;
5805 if (forw < 2 * backw)
5806 p = start + (*cachep)[i+1];
5811 /* If the string is not long enough for uoff,
5812 * we could extend it, but not at this low a level. */
5816 if (forw < 2 * backw) {
5823 while (UTF8_IS_CONTINUATION(*p))
5828 /* Update the cache. */
5829 (*cachep)[i] = (STRLEN)uoff;
5830 (*cachep)[i+1] = p - start;
5835 if (found) { /* Setup the return values. */
5836 *offsetp = (*cachep)[i+1];
5837 *sp = start + *offsetp;
5840 *offsetp = send - start;
5842 else if (*sp < start) {
5848 #ifdef PERL_UTF8_CACHE_ASSERT
5853 while (n-- && s < send)
5857 assert(*offsetp == s - start);
5858 assert((*cachep)[0] == (STRLEN)uoff);
5859 assert((*cachep)[1] == *offsetp);
5861 ASSERT_UTF8_CACHE(*cachep);
5870 =for apidoc sv_pos_u2b
5872 Converts the value pointed to by offsetp from a count of UTF-8 chars from
5873 the start of the string, to a count of the equivalent number of bytes; if
5874 lenp is non-zero, it does the same to lenp, but this time starting from
5875 the offset, rather than from the start of the string. Handles magic and
5882 * sv_pos_u2b() uses, like sv_pos_b2u(), the mg_ptr of the potential
5883 * PERL_UTF8_magic of the sv to store the mapping between UTF-8 and
5884 * byte offsets. See also the comments of S_utf8_mg_pos().
5889 Perl_sv_pos_u2b(pTHX_ register SV *sv, I32* offsetp, I32* lenp)
5900 start = s = (U8*)SvPV(sv, len);
5902 I32 uoffset = *offsetp;
5907 if (utf8_mg_pos(sv, &mg, &cache, 0, offsetp, *offsetp, &s, start, send))
5909 if (!found && uoffset > 0) {
5910 while (s < send && uoffset--)
5914 if (utf8_mg_pos_init(sv, &mg, &cache, 0, offsetp, s, start))
5916 *offsetp = s - start;
5921 if (utf8_mg_pos(sv, &mg, &cache, 2, lenp, *lenp + *offsetp, &s, start, send)) {
5925 if (!found && *lenp > 0) {
5928 while (s < send && ulen--)
5932 if (utf8_mg_pos_init(sv, &mg, &cache, 2, lenp, s, start))
5933 cache[2] += *offsetp;
5937 ASSERT_UTF8_CACHE(cache);
5949 =for apidoc sv_pos_b2u
5951 Converts the value pointed to by offsetp from a count of bytes from the
5952 start of the string, to a count of the equivalent number of UTF-8 chars.
5953 Handles magic and type coercion.
5959 * sv_pos_b2u() uses, like sv_pos_u2b(), the mg_ptr of the potential
5960 * PERL_UTF8_magic of the sv to store the mapping between UTF-8 and
5961 * byte offsets. See also the comments of S_utf8_mg_pos().
5966 Perl_sv_pos_b2u(pTHX_ register SV* sv, I32* offsetp)
5974 s = (U8*)SvPV(sv, len);
5975 if ((I32)len < *offsetp)
5976 Perl_croak(aTHX_ "panic: sv_pos_b2u: bad byte offset");
5978 U8* send = s + *offsetp;
5980 STRLEN *cache = NULL;
5984 if (SvMAGICAL(sv) && !SvREADONLY(sv)) {
5985 mg = mg_find(sv, PERL_MAGIC_utf8);
5986 if (mg && mg->mg_ptr) {
5987 cache = (STRLEN *) mg->mg_ptr;
5988 if (cache[1] == (STRLEN)*offsetp) {
5989 /* An exact match. */
5990 *offsetp = cache[0];
5994 else if (cache[1] < (STRLEN)*offsetp) {
5995 /* We already know part of the way. */
5998 /* Let the below loop do the rest. */
6000 else { /* cache[1] > *offsetp */
6001 /* We already know all of the way, now we may
6002 * be able to walk back. The same assumption
6003 * is made as in S_utf8_mg_pos(), namely that
6004 * walking backward is twice slower than
6005 * walking forward. */
6006 STRLEN forw = *offsetp;
6007 STRLEN backw = cache[1] - *offsetp;
6009 if (!(forw < 2 * backw)) {
6010 U8 *p = s + cache[1];
6017 while (UTF8_IS_CONTINUATION(*p)) {
6025 *offsetp = cache[0];
6030 ASSERT_UTF8_CACHE(cache);
6036 /* Call utf8n_to_uvchr() to validate the sequence
6037 * (unless a simple non-UTF character) */
6038 if (!UTF8_IS_INVARIANT(*s))
6039 utf8n_to_uvchr(s, UTF8SKIP(s), &n, 0);
6048 if (!SvREADONLY(sv)) {
6050 sv_magic(sv, 0, PERL_MAGIC_utf8, 0, 0);
6051 mg = mg_find(sv, PERL_MAGIC_utf8);
6056 Newz(0, cache, PERL_MAGIC_UTF8_CACHESIZE * 2, STRLEN);
6057 mg->mg_ptr = (char *) cache;
6062 cache[1] = *offsetp;
6073 Returns a boolean indicating whether the strings in the two SVs are
6074 identical. Is UTF-8 and 'use bytes' aware, handles get magic, and will
6075 coerce its args to strings if necessary.
6081 Perl_sv_eq(pTHX_ register SV *sv1, register SV *sv2)
6089 SV* svrecode = Nullsv;
6096 pv1 = SvPV(sv1, cur1);
6103 pv2 = SvPV(sv2, cur2);
6105 if (cur1 && cur2 && SvUTF8(sv1) != SvUTF8(sv2) && !IN_BYTES) {
6106 /* Differing utf8ness.
6107 * Do not UTF8size the comparands as a side-effect. */
6110 svrecode = newSVpvn(pv2, cur2);
6111 sv_recode_to_utf8(svrecode, PL_encoding);
6112 pv2 = SvPV(svrecode, cur2);
6115 svrecode = newSVpvn(pv1, cur1);
6116 sv_recode_to_utf8(svrecode, PL_encoding);
6117 pv1 = SvPV(svrecode, cur1);
6119 /* Now both are in UTF-8. */
6124 bool is_utf8 = TRUE;
6127 /* sv1 is the UTF-8 one,
6128 * if is equal it must be downgrade-able */
6129 char *pv = (char*)bytes_from_utf8((U8*)pv1,
6135 /* sv2 is the UTF-8 one,
6136 * if is equal it must be downgrade-able */
6137 char *pv = (char *)bytes_from_utf8((U8*)pv2,
6143 /* Downgrade not possible - cannot be eq */
6150 eq = (pv1 == pv2) || memEQ(pv1, pv2, cur1);
6153 SvREFCNT_dec(svrecode);
6164 Compares the strings in two SVs. Returns -1, 0, or 1 indicating whether the
6165 string in C<sv1> is less than, equal to, or greater than the string in
6166 C<sv2>. Is UTF-8 and 'use bytes' aware, handles get magic, and will
6167 coerce its args to strings if necessary. See also C<sv_cmp_locale>.
6173 Perl_sv_cmp(pTHX_ register SV *sv1, register SV *sv2)
6176 char *pv1, *pv2, *tpv = Nullch;
6178 SV *svrecode = Nullsv;
6185 pv1 = SvPV(sv1, cur1);
6192 pv2 = SvPV(sv2, cur2);
6194 if (cur1 && cur2 && SvUTF8(sv1) != SvUTF8(sv2) && !IN_BYTES) {
6195 /* Differing utf8ness.
6196 * Do not UTF8size the comparands as a side-effect. */
6199 svrecode = newSVpvn(pv2, cur2);
6200 sv_recode_to_utf8(svrecode, PL_encoding);
6201 pv2 = SvPV(svrecode, cur2);
6204 pv2 = tpv = (char*)bytes_to_utf8((U8*)pv2, &cur2);
6209 svrecode = newSVpvn(pv1, cur1);
6210 sv_recode_to_utf8(svrecode, PL_encoding);
6211 pv1 = SvPV(svrecode, cur1);
6214 pv1 = tpv = (char*)bytes_to_utf8((U8*)pv1, &cur1);
6220 cmp = cur2 ? -1 : 0;
6224 I32 retval = memcmp((void*)pv1, (void*)pv2, cur1 < cur2 ? cur1 : cur2);
6227 cmp = retval < 0 ? -1 : 1;
6228 } else if (cur1 == cur2) {
6231 cmp = cur1 < cur2 ? -1 : 1;
6236 SvREFCNT_dec(svrecode);
6245 =for apidoc sv_cmp_locale
6247 Compares the strings in two SVs in a locale-aware manner. Is UTF-8 and
6248 'use bytes' aware, handles get magic, and will coerce its args to strings
6249 if necessary. See also C<sv_cmp_locale>. See also C<sv_cmp>.
6255 Perl_sv_cmp_locale(pTHX_ register SV *sv1, register SV *sv2)
6257 #ifdef USE_LOCALE_COLLATE
6263 if (PL_collation_standard)
6267 pv1 = sv1 ? sv_collxfrm(sv1, &len1) : (char *) NULL;
6269 pv2 = sv2 ? sv_collxfrm(sv2, &len2) : (char *) NULL;
6271 if (!pv1 || !len1) {
6282 retval = memcmp((void*)pv1, (void*)pv2, len1 < len2 ? len1 : len2);
6285 return retval < 0 ? -1 : 1;
6288 * When the result of collation is equality, that doesn't mean
6289 * that there are no differences -- some locales exclude some
6290 * characters from consideration. So to avoid false equalities,
6291 * we use the raw string as a tiebreaker.
6297 #endif /* USE_LOCALE_COLLATE */
6299 return sv_cmp(sv1, sv2);
6303 #ifdef USE_LOCALE_COLLATE
6306 =for apidoc sv_collxfrm
6308 Add Collate Transform magic to an SV if it doesn't already have it.
6310 Any scalar variable may carry PERL_MAGIC_collxfrm magic that contains the
6311 scalar data of the variable, but transformed to such a format that a normal
6312 memory comparison can be used to compare the data according to the locale
6319 Perl_sv_collxfrm(pTHX_ SV *sv, STRLEN *nxp)
6323 mg = SvMAGICAL(sv) ? mg_find(sv, PERL_MAGIC_collxfrm) : (MAGIC *) NULL;
6324 if (!mg || !mg->mg_ptr || *(U32*)mg->mg_ptr != PL_collation_ix) {
6329 Safefree(mg->mg_ptr);
6331 if ((xf = mem_collxfrm(s, len, &xlen))) {
6332 if (SvREADONLY(sv)) {
6335 return xf + sizeof(PL_collation_ix);
6338 sv_magic(sv, 0, PERL_MAGIC_collxfrm, 0, 0);
6339 mg = mg_find(sv, PERL_MAGIC_collxfrm);
6352 if (mg && mg->mg_ptr) {
6354 return mg->mg_ptr + sizeof(PL_collation_ix);
6362 #endif /* USE_LOCALE_COLLATE */
6367 Get a line from the filehandle and store it into the SV, optionally
6368 appending to the currently-stored string.
6374 Perl_sv_gets(pTHX_ register SV *sv, register PerlIO *fp, I32 append)
6378 register STDCHAR rslast;
6379 register STDCHAR *bp;
6385 if (SvTHINKFIRST(sv))
6386 sv_force_normal_flags(sv, append ? 0 : SV_COW_DROP_PV);
6387 /* XXX. If you make this PVIV, then copy on write can copy scalars read
6389 However, perlbench says it's slower, because the existing swipe code
6390 is faster than copy on write.
6391 Swings and roundabouts. */
6392 (void)SvUPGRADE(sv, SVt_PV);
6397 if (PerlIO_isutf8(fp)) {
6399 sv_utf8_upgrade_nomg(sv);
6400 sv_pos_u2b(sv,&append,0);
6402 } else if (SvUTF8(sv)) {
6403 SV *tsv = NEWSV(0,0);
6404 sv_gets(tsv, fp, 0);
6405 sv_utf8_upgrade_nomg(tsv);
6406 SvCUR_set(sv,append);
6409 goto return_string_or_null;
6414 if (PerlIO_isutf8(fp))
6417 if (IN_PERL_COMPILETIME) {
6418 /* we always read code in line mode */
6422 else if (RsSNARF(PL_rs)) {
6423 /* If it is a regular disk file use size from stat() as estimate
6424 of amount we are going to read - may result in malloc-ing
6425 more memory than we realy need if layers bellow reduce
6426 size we read (e.g. CRLF or a gzip layer)
6429 if (!PerlLIO_fstat(PerlIO_fileno(fp), &st) && S_ISREG(st.st_mode)) {
6430 Off_t offset = PerlIO_tell(fp);
6431 if (offset != (Off_t) -1 && st.st_size + append > offset) {
6432 (void) SvGROW(sv, (STRLEN)((st.st_size - offset) + append + 1));
6438 else if (RsRECORD(PL_rs)) {
6442 /* Grab the size of the record we're getting */
6443 recsize = SvIV(SvRV(PL_rs));
6444 buffer = SvGROW(sv, (STRLEN)(recsize + append + 1)) + append;
6447 /* VMS wants read instead of fread, because fread doesn't respect */
6448 /* RMS record boundaries. This is not necessarily a good thing to be */
6449 /* doing, but we've got no other real choice - except avoid stdio
6450 as implementation - perhaps write a :vms layer ?
6452 bytesread = PerlLIO_read(PerlIO_fileno(fp), buffer, recsize);
6454 bytesread = PerlIO_read(fp, buffer, recsize);
6458 SvCUR_set(sv, bytesread += append);
6459 buffer[bytesread] = '\0';
6460 goto return_string_or_null;
6462 else if (RsPARA(PL_rs)) {
6468 /* Get $/ i.e. PL_rs into same encoding as stream wants */
6469 if (PerlIO_isutf8(fp)) {
6470 rsptr = SvPVutf8(PL_rs, rslen);
6473 if (SvUTF8(PL_rs)) {
6474 if (!sv_utf8_downgrade(PL_rs, TRUE)) {
6475 Perl_croak(aTHX_ "Wide character in $/");
6478 rsptr = SvPV(PL_rs, rslen);
6482 rslast = rslen ? rsptr[rslen - 1] : '\0';
6484 if (rspara) { /* have to do this both before and after */
6485 do { /* to make sure file boundaries work right */
6488 i = PerlIO_getc(fp);
6492 PerlIO_ungetc(fp,i);
6498 /* See if we know enough about I/O mechanism to cheat it ! */
6500 /* This used to be #ifdef test - it is made run-time test for ease
6501 of abstracting out stdio interface. One call should be cheap
6502 enough here - and may even be a macro allowing compile
6506 if (PerlIO_fast_gets(fp)) {
6509 * We're going to steal some values from the stdio struct
6510 * and put EVERYTHING in the innermost loop into registers.
6512 register STDCHAR *ptr;
6516 #if defined(VMS) && defined(PERLIO_IS_STDIO)
6517 /* An ungetc()d char is handled separately from the regular
6518 * buffer, so we getc() it back out and stuff it in the buffer.
6520 i = PerlIO_getc(fp);
6521 if (i == EOF) return 0;
6522 *(--((*fp)->_ptr)) = (unsigned char) i;
6526 /* Here is some breathtakingly efficient cheating */
6528 cnt = PerlIO_get_cnt(fp); /* get count into register */
6529 /* make sure we have the room */
6530 if ((I32)(SvLEN(sv) - append) <= cnt + 1) {
6531 /* Not room for all of it
6532 if we are looking for a separator and room for some
6534 if (rslen && cnt > 80 && (I32)SvLEN(sv) > append) {
6535 /* just process what we have room for */
6536 shortbuffered = cnt - SvLEN(sv) + append + 1;
6537 cnt -= shortbuffered;
6541 /* remember that cnt can be negative */
6542 SvGROW(sv, (STRLEN)(append + (cnt <= 0 ? 2 : (cnt + 1))));
6547 bp = (STDCHAR*)SvPVX(sv) + append; /* move these two too to registers */
6548 ptr = (STDCHAR*)PerlIO_get_ptr(fp);
6549 DEBUG_P(PerlIO_printf(Perl_debug_log,
6550 "Screamer: entering, ptr=%"UVuf", cnt=%ld\n",PTR2UV(ptr),(long)cnt));
6551 DEBUG_P(PerlIO_printf(Perl_debug_log,
6552 "Screamer: entering: PerlIO * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
6553 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
6554 PTR2UV(PerlIO_has_base(fp) ? PerlIO_get_base(fp) : 0)));
6559 while (cnt > 0) { /* this | eat */
6561 if ((*bp++ = *ptr++) == rslast) /* really | dust */
6562 goto thats_all_folks; /* screams | sed :-) */
6566 Copy(ptr, bp, cnt, char); /* this | eat */
6567 bp += cnt; /* screams | dust */
6568 ptr += cnt; /* louder | sed :-) */
6573 if (shortbuffered) { /* oh well, must extend */
6574 cnt = shortbuffered;
6576 bpx = bp - (STDCHAR*)SvPVX(sv); /* box up before relocation */
6578 SvGROW(sv, SvLEN(sv) + append + cnt + 2);
6579 bp = (STDCHAR*)SvPVX(sv) + bpx; /* unbox after relocation */
6583 DEBUG_P(PerlIO_printf(Perl_debug_log,
6584 "Screamer: going to getc, ptr=%"UVuf", cnt=%ld\n",
6585 PTR2UV(ptr),(long)cnt));
6586 PerlIO_set_ptrcnt(fp, (STDCHAR*)ptr, cnt); /* deregisterize cnt and ptr */
6588 DEBUG_P(PerlIO_printf(Perl_debug_log,
6589 "Screamer: pre: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
6590 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
6591 PTR2UV(PerlIO_has_base (fp) ? PerlIO_get_base(fp) : 0)));
6593 /* This used to call 'filbuf' in stdio form, but as that behaves like
6594 getc when cnt <= 0 we use PerlIO_getc here to avoid introducing
6595 another abstraction. */
6596 i = PerlIO_getc(fp); /* get more characters */
6598 DEBUG_P(PerlIO_printf(Perl_debug_log,
6599 "Screamer: post: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
6600 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
6601 PTR2UV(PerlIO_has_base (fp) ? PerlIO_get_base(fp) : 0)));
6603 cnt = PerlIO_get_cnt(fp);
6604 ptr = (STDCHAR*)PerlIO_get_ptr(fp); /* reregisterize cnt and ptr */
6605 DEBUG_P(PerlIO_printf(Perl_debug_log,
6606 "Screamer: after getc, ptr=%"UVuf", cnt=%ld\n",PTR2UV(ptr),(long)cnt));
6608 if (i == EOF) /* all done for ever? */
6609 goto thats_really_all_folks;
6611 bpx = bp - (STDCHAR*)SvPVX(sv); /* box up before relocation */
6613 SvGROW(sv, bpx + cnt + 2);
6614 bp = (STDCHAR*)SvPVX(sv) + bpx; /* unbox after relocation */
6616 *bp++ = (STDCHAR)i; /* store character from PerlIO_getc */
6618 if (rslen && (STDCHAR)i == rslast) /* all done for now? */
6619 goto thats_all_folks;
6623 if ((rslen > 1 && (STRLEN)(bp - (STDCHAR*)SvPVX(sv)) < rslen) ||
6624 memNE((char*)bp - rslen, rsptr, rslen))
6625 goto screamer; /* go back to the fray */
6626 thats_really_all_folks:
6628 cnt += shortbuffered;
6629 DEBUG_P(PerlIO_printf(Perl_debug_log,
6630 "Screamer: quitting, ptr=%"UVuf", cnt=%ld\n",PTR2UV(ptr),(long)cnt));
6631 PerlIO_set_ptrcnt(fp, (STDCHAR*)ptr, cnt); /* put these back or we're in trouble */
6632 DEBUG_P(PerlIO_printf(Perl_debug_log,
6633 "Screamer: end: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
6634 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
6635 PTR2UV(PerlIO_has_base (fp) ? PerlIO_get_base(fp) : 0)));
6637 SvCUR_set(sv, bp - (STDCHAR*)SvPVX(sv)); /* set length */
6638 DEBUG_P(PerlIO_printf(Perl_debug_log,
6639 "Screamer: done, len=%ld, string=|%.*s|\n",
6640 (long)SvCUR(sv),(int)SvCUR(sv),SvPVX(sv)));
6644 /*The big, slow, and stupid way. */
6646 /* Any stack-challenged places. */
6648 /* EPOC: need to work around SDK features. *
6649 * On WINS: MS VC5 generates calls to _chkstk, *
6650 * if a "large" stack frame is allocated. *
6651 * gcc on MARM does not generate calls like these. */
6652 # define USEHEAPINSTEADOFSTACK
6655 #ifdef USEHEAPINSTEADOFSTACK
6657 New(0, buf, 8192, STDCHAR);
6665 register STDCHAR *bpe = buf + sizeof(buf);
6667 while ((i = PerlIO_getc(fp)) != EOF && (*bp++ = (STDCHAR)i) != rslast && bp < bpe)
6668 ; /* keep reading */
6672 cnt = PerlIO_read(fp,(char*)buf, sizeof(buf));
6673 /* Accomodate broken VAXC compiler, which applies U8 cast to
6674 * both args of ?: operator, causing EOF to change into 255
6677 i = (U8)buf[cnt - 1];
6683 cnt = 0; /* we do need to re-set the sv even when cnt <= 0 */
6685 sv_catpvn(sv, (char *) buf, cnt);
6687 sv_setpvn(sv, (char *) buf, cnt);
6689 if (i != EOF && /* joy */
6691 SvCUR(sv) < rslen ||
6692 memNE(SvPVX(sv) + SvCUR(sv) - rslen, rsptr, rslen)))
6696 * If we're reading from a TTY and we get a short read,
6697 * indicating that the user hit his EOF character, we need
6698 * to notice it now, because if we try to read from the TTY
6699 * again, the EOF condition will disappear.
6701 * The comparison of cnt to sizeof(buf) is an optimization
6702 * that prevents unnecessary calls to feof().
6706 if (!(cnt < sizeof(buf) && PerlIO_eof(fp)))
6710 #ifdef USEHEAPINSTEADOFSTACK
6715 if (rspara) { /* have to do this both before and after */
6716 while (i != EOF) { /* to make sure file boundaries work right */
6717 i = PerlIO_getc(fp);
6719 PerlIO_ungetc(fp,i);
6725 return_string_or_null:
6726 return (SvCUR(sv) - append) ? SvPVX(sv) : Nullch;
6732 Auto-increment of the value in the SV, doing string to numeric conversion
6733 if necessary. Handles 'get' magic.
6739 Perl_sv_inc(pTHX_ register SV *sv)
6748 if (SvTHINKFIRST(sv)) {
6750 sv_force_normal_flags(sv, 0);
6751 if (SvREADONLY(sv)) {
6752 if (IN_PERL_RUNTIME)
6753 Perl_croak(aTHX_ PL_no_modify);
6757 if (SvAMAGIC(sv) && AMG_CALLun(sv,inc))
6759 i = PTR2IV(SvRV(sv));
6764 flags = SvFLAGS(sv);
6765 if ((flags & (SVp_NOK|SVp_IOK)) == SVp_NOK) {
6766 /* It's (privately or publicly) a float, but not tested as an
6767 integer, so test it to see. */
6769 flags = SvFLAGS(sv);
6771 if ((flags & SVf_IOK) || ((flags & (SVp_IOK | SVp_NOK)) == SVp_IOK)) {
6772 /* It's publicly an integer, or privately an integer-not-float */
6773 #ifdef PERL_PRESERVE_IVUV
6777 if (SvUVX(sv) == UV_MAX)
6778 sv_setnv(sv, UV_MAX_P1);
6780 (void)SvIOK_only_UV(sv);
6783 if (SvIVX(sv) == IV_MAX)
6784 sv_setuv(sv, (UV)IV_MAX + 1);
6786 (void)SvIOK_only(sv);
6792 if (flags & SVp_NOK) {
6793 (void)SvNOK_only(sv);
6798 if (!(flags & SVp_POK) || !*SvPVX(sv)) {
6799 if ((flags & SVTYPEMASK) < SVt_PVIV)
6800 sv_upgrade(sv, SVt_IV);
6801 (void)SvIOK_only(sv);
6806 while (isALPHA(*d)) d++;
6807 while (isDIGIT(*d)) d++;
6809 #ifdef PERL_PRESERVE_IVUV
6810 /* Got to punt this as an integer if needs be, but we don't issue
6811 warnings. Probably ought to make the sv_iv_please() that does
6812 the conversion if possible, and silently. */
6813 int numtype = grok_number(SvPVX(sv), SvCUR(sv), NULL);
6814 if (numtype && !(numtype & IS_NUMBER_INFINITY)) {
6815 /* Need to try really hard to see if it's an integer.
6816 9.22337203685478e+18 is an integer.
6817 but "9.22337203685478e+18" + 0 is UV=9223372036854779904
6818 so $a="9.22337203685478e+18"; $a+0; $a++
6819 needs to be the same as $a="9.22337203685478e+18"; $a++
6826 /* sv_2iv *should* have made this an NV */
6827 if (flags & SVp_NOK) {
6828 (void)SvNOK_only(sv);
6832 /* I don't think we can get here. Maybe I should assert this
6833 And if we do get here I suspect that sv_setnv will croak. NWC
6835 #if defined(USE_LONG_DOUBLE)
6836 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",
6837 SvPVX(sv), SvIVX(sv), SvNVX(sv)));
6839 DEBUG_c(PerlIO_printf(Perl_debug_log,"sv_inc punt failed to convert '%s' to IOK or NOKp, UV=0x%"UVxf" NV=%"NVgf"\n",
6840 SvPVX(sv), SvIVX(sv), SvNVX(sv)));
6843 #endif /* PERL_PRESERVE_IVUV */
6844 sv_setnv(sv,Atof(SvPVX(sv)) + 1.0);
6848 while (d >= SvPVX(sv)) {
6856 /* MKS: The original code here died if letters weren't consecutive.
6857 * at least it didn't have to worry about non-C locales. The
6858 * new code assumes that ('z'-'a')==('Z'-'A'), letters are
6859 * arranged in order (although not consecutively) and that only
6860 * [A-Za-z] are accepted by isALPHA in the C locale.
6862 if (*d != 'z' && *d != 'Z') {
6863 do { ++*d; } while (!isALPHA(*d));
6866 *(d--) -= 'z' - 'a';
6871 *(d--) -= 'z' - 'a' + 1;
6875 /* oh,oh, the number grew */
6876 SvGROW(sv, SvCUR(sv) + 2);
6878 for (d = SvPVX(sv) + SvCUR(sv); d > SvPVX(sv); d--)
6889 Auto-decrement of the value in the SV, doing string to numeric conversion
6890 if necessary. Handles 'get' magic.
6896 Perl_sv_dec(pTHX_ register SV *sv)
6904 if (SvTHINKFIRST(sv)) {
6906 sv_force_normal_flags(sv, 0);
6907 if (SvREADONLY(sv)) {
6908 if (IN_PERL_RUNTIME)
6909 Perl_croak(aTHX_ PL_no_modify);
6913 if (SvAMAGIC(sv) && AMG_CALLun(sv,dec))
6915 i = PTR2IV(SvRV(sv));
6920 /* Unlike sv_inc we don't have to worry about string-never-numbers
6921 and keeping them magic. But we mustn't warn on punting */
6922 flags = SvFLAGS(sv);
6923 if ((flags & SVf_IOK) || ((flags & (SVp_IOK | SVp_NOK)) == SVp_IOK)) {
6924 /* It's publicly an integer, or privately an integer-not-float */
6925 #ifdef PERL_PRESERVE_IVUV
6929 if (SvUVX(sv) == 0) {
6930 (void)SvIOK_only(sv);
6934 (void)SvIOK_only_UV(sv);
6938 if (SvIVX(sv) == IV_MIN)
6939 sv_setnv(sv, (NV)IV_MIN - 1.0);
6941 (void)SvIOK_only(sv);
6947 if (flags & SVp_NOK) {
6949 (void)SvNOK_only(sv);
6952 if (!(flags & SVp_POK)) {
6953 if ((flags & SVTYPEMASK) < SVt_PVNV)
6954 sv_upgrade(sv, SVt_NV);
6956 (void)SvNOK_only(sv);
6959 #ifdef PERL_PRESERVE_IVUV
6961 int numtype = grok_number(SvPVX(sv), SvCUR(sv), NULL);
6962 if (numtype && !(numtype & IS_NUMBER_INFINITY)) {
6963 /* Need to try really hard to see if it's an integer.
6964 9.22337203685478e+18 is an integer.
6965 but "9.22337203685478e+18" + 0 is UV=9223372036854779904
6966 so $a="9.22337203685478e+18"; $a+0; $a--
6967 needs to be the same as $a="9.22337203685478e+18"; $a--
6974 /* sv_2iv *should* have made this an NV */
6975 if (flags & SVp_NOK) {
6976 (void)SvNOK_only(sv);
6980 /* I don't think we can get here. Maybe I should assert this
6981 And if we do get here I suspect that sv_setnv will croak. NWC
6983 #if defined(USE_LONG_DOUBLE)
6984 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",
6985 SvPVX(sv), SvIVX(sv), SvNVX(sv)));
6987 DEBUG_c(PerlIO_printf(Perl_debug_log,"sv_dec punt failed to convert '%s' to IOK or NOKp, UV=0x%"UVxf" NV=%"NVgf"\n",
6988 SvPVX(sv), SvIVX(sv), SvNVX(sv)));
6992 #endif /* PERL_PRESERVE_IVUV */
6993 sv_setnv(sv,Atof(SvPVX(sv)) - 1.0); /* punt */
6997 =for apidoc sv_mortalcopy
6999 Creates a new SV which is a copy of the original SV (using C<sv_setsv>).
7000 The new SV is marked as mortal. It will be destroyed "soon", either by an
7001 explicit call to FREETMPS, or by an implicit call at places such as
7002 statement boundaries. See also C<sv_newmortal> and C<sv_2mortal>.
7007 /* Make a string that will exist for the duration of the expression
7008 * evaluation. Actually, it may have to last longer than that, but
7009 * hopefully we won't free it until it has been assigned to a
7010 * permanent location. */
7013 Perl_sv_mortalcopy(pTHX_ SV *oldstr)
7018 sv_setsv(sv,oldstr);
7020 PL_tmps_stack[++PL_tmps_ix] = sv;
7026 =for apidoc sv_newmortal
7028 Creates a new null SV which is mortal. The reference count of the SV is
7029 set to 1. It will be destroyed "soon", either by an explicit call to
7030 FREETMPS, or by an implicit call at places such as statement boundaries.
7031 See also C<sv_mortalcopy> and C<sv_2mortal>.
7037 Perl_sv_newmortal(pTHX)
7042 SvFLAGS(sv) = SVs_TEMP;
7044 PL_tmps_stack[++PL_tmps_ix] = sv;
7049 =for apidoc sv_2mortal
7051 Marks an existing SV as mortal. The SV will be destroyed "soon", either
7052 by an explicit call to FREETMPS, or by an implicit call at places such as
7053 statement boundaries. See also C<sv_newmortal> and C<sv_mortalcopy>.
7059 Perl_sv_2mortal(pTHX_ register SV *sv)
7063 if (SvREADONLY(sv) && SvIMMORTAL(sv))
7066 PL_tmps_stack[++PL_tmps_ix] = sv;
7074 Creates a new SV and copies a string into it. The reference count for the
7075 SV is set to 1. If C<len> is zero, Perl will compute the length using
7076 strlen(). For efficiency, consider using C<newSVpvn> instead.
7082 Perl_newSVpv(pTHX_ const char *s, STRLEN len)
7089 sv_setpvn(sv,s,len);
7094 =for apidoc newSVpvn
7096 Creates a new SV and copies a string into it. The reference count for the
7097 SV is set to 1. Note that if C<len> is zero, Perl will create a zero length
7098 string. You are responsible for ensuring that the source string is at least
7105 Perl_newSVpvn(pTHX_ const char *s, STRLEN len)
7110 sv_setpvn(sv,s,len);
7115 =for apidoc newSVpvn_share
7117 Creates a new SV with its SvPVX pointing to a shared string in the string
7118 table. If the string does not already exist in the table, it is created
7119 first. Turns on READONLY and FAKE. The string's hash is stored in the UV
7120 slot of the SV; if the C<hash> parameter is non-zero, that value is used;
7121 otherwise the hash is computed. The idea here is that as the string table
7122 is used for shared hash keys these strings will have SvPVX == HeKEY and
7123 hash lookup will avoid string compare.
7129 Perl_newSVpvn_share(pTHX_ const char *src, I32 len, U32 hash)
7132 bool is_utf8 = FALSE;
7134 STRLEN tmplen = -len;
7136 /* See the note in hv.c:hv_fetch() --jhi */
7137 src = (char*)bytes_from_utf8((U8*)src, &tmplen, &is_utf8);
7141 PERL_HASH(hash, src, len);
7143 sv_upgrade(sv, SVt_PVIV);
7144 SvPVX(sv) = sharepvn(src, is_utf8?-len:len, hash);
7157 #if defined(PERL_IMPLICIT_CONTEXT)
7159 /* pTHX_ magic can't cope with varargs, so this is a no-context
7160 * version of the main function, (which may itself be aliased to us).
7161 * Don't access this version directly.
7165 Perl_newSVpvf_nocontext(const char* pat, ...)
7170 va_start(args, pat);
7171 sv = vnewSVpvf(pat, &args);
7178 =for apidoc newSVpvf
7180 Creates a new SV and initializes it with the string formatted like
7187 Perl_newSVpvf(pTHX_ const char* pat, ...)
7191 va_start(args, pat);
7192 sv = vnewSVpvf(pat, &args);
7197 /* backend for newSVpvf() and newSVpvf_nocontext() */
7200 Perl_vnewSVpvf(pTHX_ const char* pat, va_list* args)
7204 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
7211 Creates a new SV and copies a floating point value into it.
7212 The reference count for the SV is set to 1.
7218 Perl_newSVnv(pTHX_ NV n)
7230 Creates a new SV and copies an integer into it. The reference count for the
7237 Perl_newSViv(pTHX_ IV i)
7249 Creates a new SV and copies an unsigned integer into it.
7250 The reference count for the SV is set to 1.
7256 Perl_newSVuv(pTHX_ UV u)
7266 =for apidoc newRV_noinc
7268 Creates an RV wrapper for an SV. The reference count for the original
7269 SV is B<not> incremented.
7275 Perl_newRV_noinc(pTHX_ SV *tmpRef)
7280 sv_upgrade(sv, SVt_RV);
7287 /* newRV_inc is the official function name to use now.
7288 * newRV_inc is in fact #defined to newRV in sv.h
7292 Perl_newRV(pTHX_ SV *tmpRef)
7294 return newRV_noinc(SvREFCNT_inc(tmpRef));
7300 Creates a new SV which is an exact duplicate of the original SV.
7307 Perl_newSVsv(pTHX_ register SV *old)
7313 if (SvTYPE(old) == SVTYPEMASK) {
7314 if (ckWARN_d(WARN_INTERNAL))
7315 Perl_warner(aTHX_ packWARN(WARN_INTERNAL), "semi-panic: attempt to dup freed string");
7330 =for apidoc sv_reset
7332 Underlying implementation for the C<reset> Perl function.
7333 Note that the perl-level function is vaguely deprecated.
7339 Perl_sv_reset(pTHX_ register char *s, HV *stash)
7347 char todo[PERL_UCHAR_MAX+1];
7352 if (!*s) { /* reset ?? searches */
7353 for (pm = HvPMROOT(stash); pm; pm = pm->op_pmnext) {
7354 pm->op_pmdynflags &= ~PMdf_USED;
7359 /* reset variables */
7361 if (!HvARRAY(stash))
7364 Zero(todo, 256, char);
7366 i = (unsigned char)*s;
7370 max = (unsigned char)*s++;
7371 for ( ; i <= max; i++) {
7374 for (i = 0; i <= (I32) HvMAX(stash); i++) {
7375 for (entry = HvARRAY(stash)[i];
7377 entry = HeNEXT(entry))
7379 if (!todo[(U8)*HeKEY(entry)])
7381 gv = (GV*)HeVAL(entry);
7383 if (SvTHINKFIRST(sv)) {
7384 if (!SvREADONLY(sv) && SvROK(sv))
7389 if (SvTYPE(sv) >= SVt_PV) {
7391 if (SvPVX(sv) != Nullch)
7398 if (GvHV(gv) && !HvNAME(GvHV(gv))) {
7401 #ifdef USE_ENVIRON_ARRAY
7403 # ifdef USE_ITHREADS
7404 && PL_curinterp == aTHX
7408 environ[0] = Nullch;
7411 #endif /* !PERL_MICRO */
7421 Using various gambits, try to get an IO from an SV: the IO slot if its a
7422 GV; or the recursive result if we're an RV; or the IO slot of the symbol
7423 named after the PV if we're a string.
7429 Perl_sv_2io(pTHX_ SV *sv)
7435 switch (SvTYPE(sv)) {
7443 Perl_croak(aTHX_ "Bad filehandle: %s", GvNAME(gv));
7447 Perl_croak(aTHX_ PL_no_usym, "filehandle");
7449 return sv_2io(SvRV(sv));
7450 gv = gv_fetchpv(SvPV(sv,n_a), FALSE, SVt_PVIO);
7456 Perl_croak(aTHX_ "Bad filehandle: %"SVf, sv);
7465 Using various gambits, try to get a CV from an SV; in addition, try if
7466 possible to set C<*st> and C<*gvp> to the stash and GV associated with it.
7472 Perl_sv_2cv(pTHX_ SV *sv, HV **st, GV **gvp, I32 lref)
7479 return *gvp = Nullgv, Nullcv;
7480 switch (SvTYPE(sv)) {
7499 SV **sp = &sv; /* Used in tryAMAGICunDEREF macro. */
7500 tryAMAGICunDEREF(to_cv);
7503 if (SvTYPE(sv) == SVt_PVCV) {
7512 Perl_croak(aTHX_ "Not a subroutine reference");
7517 gv = gv_fetchpv(SvPV(sv, n_a), lref, SVt_PVCV);
7523 if (lref && !GvCVu(gv)) {
7526 tmpsv = NEWSV(704,0);
7527 gv_efullname3(tmpsv, gv, Nullch);
7528 /* XXX this is probably not what they think they're getting.
7529 * It has the same effect as "sub name;", i.e. just a forward
7531 newSUB(start_subparse(FALSE, 0),
7532 newSVOP(OP_CONST, 0, tmpsv),
7537 Perl_croak(aTHX_ "Unable to create sub named \"%"SVf"\"",
7547 Returns true if the SV has a true value by Perl's rules.
7548 Use the C<SvTRUE> macro instead, which may call C<sv_true()> or may
7549 instead use an in-line version.
7555 Perl_sv_true(pTHX_ register SV *sv)
7561 if ((tXpv = (XPV*)SvANY(sv)) &&
7562 (tXpv->xpv_cur > 1 ||
7563 (tXpv->xpv_cur && *tXpv->xpv_pv != '0')))
7570 return SvIVX(sv) != 0;
7573 return SvNVX(sv) != 0.0;
7575 return sv_2bool(sv);
7583 A private implementation of the C<SvIVx> macro for compilers which can't
7584 cope with complex macro expressions. Always use the macro instead.
7590 Perl_sv_iv(pTHX_ register SV *sv)
7594 return (IV)SvUVX(sv);
7603 A private implementation of the C<SvUVx> macro for compilers which can't
7604 cope with complex macro expressions. Always use the macro instead.
7610 Perl_sv_uv(pTHX_ register SV *sv)
7615 return (UV)SvIVX(sv);
7623 A private implementation of the C<SvNVx> macro for compilers which can't
7624 cope with complex macro expressions. Always use the macro instead.
7630 Perl_sv_nv(pTHX_ register SV *sv)
7637 /* sv_pv() is now a macro using SvPV_nolen();
7638 * this function provided for binary compatibility only
7642 Perl_sv_pv(pTHX_ SV *sv)
7649 return sv_2pv(sv, &n_a);
7655 Use the C<SvPV_nolen> macro instead
7659 A private implementation of the C<SvPV> macro for compilers which can't
7660 cope with complex macro expressions. Always use the macro instead.
7666 Perl_sv_pvn(pTHX_ SV *sv, STRLEN *lp)
7672 return sv_2pv(sv, lp);
7677 Perl_sv_pvn_nomg(pTHX_ register SV *sv, STRLEN *lp)
7683 return sv_2pv_flags(sv, lp, 0);
7686 /* sv_pvn_force() is now a macro using Perl_sv_pvn_force_flags();
7687 * this function provided for binary compatibility only
7691 Perl_sv_pvn_force(pTHX_ SV *sv, STRLEN *lp)
7693 return sv_pvn_force_flags(sv, lp, SV_GMAGIC);
7697 =for apidoc sv_pvn_force
7699 Get a sensible string out of the SV somehow.
7700 A private implementation of the C<SvPV_force> macro for compilers which
7701 can't cope with complex macro expressions. Always use the macro instead.
7703 =for apidoc sv_pvn_force_flags
7705 Get a sensible string out of the SV somehow.
7706 If C<flags> has C<SV_GMAGIC> bit set, will C<mg_get> on C<sv> if
7707 appropriate, else not. C<sv_pvn_force> and C<sv_pvn_force_nomg> are
7708 implemented in terms of this function.
7709 You normally want to use the various wrapper macros instead: see
7710 C<SvPV_force> and C<SvPV_force_nomg>
7716 Perl_sv_pvn_force_flags(pTHX_ SV *sv, STRLEN *lp, I32 flags)
7720 if (SvTHINKFIRST(sv) && !SvROK(sv))
7721 sv_force_normal_flags(sv, 0);
7727 if (SvTYPE(sv) > SVt_PVLV && SvTYPE(sv) != SVt_PVFM) {
7728 Perl_croak(aTHX_ "Can't coerce %s to string in %s", sv_reftype(sv,0),
7732 s = sv_2pv_flags(sv, lp, flags);
7733 if (s != SvPVX(sv)) { /* Almost, but not quite, sv_setpvn() */
7738 (void)SvUPGRADE(sv, SVt_PV); /* Never FALSE */
7739 SvGROW(sv, len + 1);
7740 Move(s,SvPVX(sv),len,char);
7745 SvPOK_on(sv); /* validate pointer */
7747 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2pv(%s)\n",
7748 PTR2UV(sv),SvPVX(sv)));
7754 /* sv_pvbyte () is now a macro using Perl_sv_2pv_flags();
7755 * this function provided for binary compatibility only
7759 Perl_sv_pvbyte(pTHX_ SV *sv)
7761 sv_utf8_downgrade(sv,0);
7766 =for apidoc sv_pvbyte
7768 Use C<SvPVbyte_nolen> instead.
7770 =for apidoc sv_pvbyten
7772 A private implementation of the C<SvPVbyte> macro for compilers
7773 which can't cope with complex macro expressions. Always use the macro
7780 Perl_sv_pvbyten(pTHX_ SV *sv, STRLEN *lp)
7782 sv_utf8_downgrade(sv,0);
7783 return sv_pvn(sv,lp);
7787 =for apidoc sv_pvbyten_force
7789 A private implementation of the C<SvPVbytex_force> macro for compilers
7790 which can't cope with complex macro expressions. Always use the macro
7797 Perl_sv_pvbyten_force(pTHX_ SV *sv, STRLEN *lp)
7799 sv_utf8_downgrade(sv,0);
7800 return sv_pvn_force(sv,lp);
7803 /* sv_pvutf8 () is now a macro using Perl_sv_2pv_flags();
7804 * this function provided for binary compatibility only
7808 Perl_sv_pvutf8(pTHX_ SV *sv)
7810 sv_utf8_upgrade(sv);
7815 =for apidoc sv_pvutf8
7817 Use the C<SvPVutf8_nolen> macro instead
7819 =for apidoc sv_pvutf8n
7821 A private implementation of the C<SvPVutf8> macro for compilers
7822 which can't cope with complex macro expressions. Always use the macro
7829 Perl_sv_pvutf8n(pTHX_ SV *sv, STRLEN *lp)
7831 sv_utf8_upgrade(sv);
7832 return sv_pvn(sv,lp);
7836 =for apidoc sv_pvutf8n_force
7838 A private implementation of the C<SvPVutf8_force> macro for compilers
7839 which can't cope with complex macro expressions. Always use the macro
7846 Perl_sv_pvutf8n_force(pTHX_ SV *sv, STRLEN *lp)
7848 sv_utf8_upgrade(sv);
7849 return sv_pvn_force(sv,lp);
7853 =for apidoc sv_reftype
7855 Returns a string describing what the SV is a reference to.
7861 Perl_sv_reftype(pTHX_ SV *sv, int ob)
7863 if (ob && SvOBJECT(sv)) {
7864 if (HvNAME(SvSTASH(sv)))
7865 return HvNAME(SvSTASH(sv));
7870 switch (SvTYPE(sv)) {
7887 case SVt_PVLV: return SvROK(sv) ? "REF"
7888 /* tied lvalues should appear to be
7889 * scalars for backwards compatitbility */
7890 : (LvTYPE(sv) == 't' || LvTYPE(sv) == 'T')
7891 ? "SCALAR" : "LVALUE";
7892 case SVt_PVAV: return "ARRAY";
7893 case SVt_PVHV: return "HASH";
7894 case SVt_PVCV: return "CODE";
7895 case SVt_PVGV: return "GLOB";
7896 case SVt_PVFM: return "FORMAT";
7897 case SVt_PVIO: return "IO";
7898 default: return "UNKNOWN";
7904 =for apidoc sv_isobject
7906 Returns a boolean indicating whether the SV is an RV pointing to a blessed
7907 object. If the SV is not an RV, or if the object is not blessed, then this
7914 Perl_sv_isobject(pTHX_ SV *sv)
7931 Returns a boolean indicating whether the SV is blessed into the specified
7932 class. This does not check for subtypes; use C<sv_derived_from> to verify
7933 an inheritance relationship.
7939 Perl_sv_isa(pTHX_ SV *sv, const char *name)
7950 if (!HvNAME(SvSTASH(sv)))
7953 return strEQ(HvNAME(SvSTASH(sv)), name);
7959 Creates a new SV for the RV, C<rv>, to point to. If C<rv> is not an RV then
7960 it will be upgraded to one. If C<classname> is non-null then the new SV will
7961 be blessed in the specified package. The new SV is returned and its
7962 reference count is 1.
7968 Perl_newSVrv(pTHX_ SV *rv, const char *classname)
7974 SV_CHECK_THINKFIRST_COW_DROP(rv);
7977 if (SvTYPE(rv) >= SVt_PVMG) {
7978 U32 refcnt = SvREFCNT(rv);
7982 SvREFCNT(rv) = refcnt;
7985 if (SvTYPE(rv) < SVt_RV)
7986 sv_upgrade(rv, SVt_RV);
7987 else if (SvTYPE(rv) > SVt_RV) {
7988 (void)SvOOK_off(rv);
7989 if (SvPVX(rv) && SvLEN(rv))
7990 Safefree(SvPVX(rv));
8000 HV* stash = gv_stashpv(classname, TRUE);
8001 (void)sv_bless(rv, stash);
8007 =for apidoc sv_setref_pv
8009 Copies a pointer into a new SV, optionally blessing the SV. The C<rv>
8010 argument will be upgraded to an RV. That RV will be modified to point to
8011 the new SV. If the C<pv> argument is NULL then C<PL_sv_undef> will be placed
8012 into the SV. The C<classname> argument indicates the package for the
8013 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
8014 will have a reference count of 1, and the RV will be returned.
8016 Do not use with other Perl types such as HV, AV, SV, CV, because those
8017 objects will become corrupted by the pointer copy process.
8019 Note that C<sv_setref_pvn> copies the string while this copies the pointer.
8025 Perl_sv_setref_pv(pTHX_ SV *rv, const char *classname, void *pv)
8028 sv_setsv(rv, &PL_sv_undef);
8032 sv_setiv(newSVrv(rv,classname), PTR2IV(pv));
8037 =for apidoc sv_setref_iv
8039 Copies an integer into a new SV, optionally blessing the SV. The C<rv>
8040 argument will be upgraded to an RV. That RV will be modified to point to
8041 the new SV. The C<classname> argument indicates the package for the
8042 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
8043 will have a reference count of 1, and the RV will be returned.
8049 Perl_sv_setref_iv(pTHX_ SV *rv, const char *classname, IV iv)
8051 sv_setiv(newSVrv(rv,classname), iv);
8056 =for apidoc sv_setref_uv
8058 Copies an unsigned integer into a new SV, optionally blessing the SV. The C<rv>
8059 argument will be upgraded to an RV. That RV will be modified to point to
8060 the new SV. The C<classname> argument indicates the package for the
8061 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
8062 will have a reference count of 1, and the RV will be returned.
8068 Perl_sv_setref_uv(pTHX_ SV *rv, const char *classname, UV uv)
8070 sv_setuv(newSVrv(rv,classname), uv);
8075 =for apidoc sv_setref_nv
8077 Copies a double into a new SV, optionally blessing the SV. The C<rv>
8078 argument will be upgraded to an RV. That RV will be modified to point to
8079 the new SV. The C<classname> argument indicates the package for the
8080 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
8081 will have a reference count of 1, and the RV will be returned.
8087 Perl_sv_setref_nv(pTHX_ SV *rv, const char *classname, NV nv)
8089 sv_setnv(newSVrv(rv,classname), nv);
8094 =for apidoc sv_setref_pvn
8096 Copies a string into a new SV, optionally blessing the SV. The length of the
8097 string must be specified with C<n>. The C<rv> argument will be upgraded to
8098 an RV. That RV will be modified to point to the new SV. The C<classname>
8099 argument indicates the package for the blessing. Set C<classname> to
8100 C<Nullch> to avoid the blessing. The new SV will have a reference count
8101 of 1, and the RV will be returned.
8103 Note that C<sv_setref_pv> copies the pointer while this copies the string.
8109 Perl_sv_setref_pvn(pTHX_ SV *rv, const char *classname, char *pv, STRLEN n)
8111 sv_setpvn(newSVrv(rv,classname), pv, n);
8116 =for apidoc sv_bless
8118 Blesses an SV into a specified package. The SV must be an RV. The package
8119 must be designated by its stash (see C<gv_stashpv()>). The reference count
8120 of the SV is unaffected.
8126 Perl_sv_bless(pTHX_ SV *sv, HV *stash)
8130 Perl_croak(aTHX_ "Can't bless non-reference value");
8132 if (SvFLAGS(tmpRef) & (SVs_OBJECT|SVf_READONLY)) {
8133 if (SvREADONLY(tmpRef))
8134 Perl_croak(aTHX_ PL_no_modify);
8135 if (SvOBJECT(tmpRef)) {
8136 if (SvTYPE(tmpRef) != SVt_PVIO)
8138 SvREFCNT_dec(SvSTASH(tmpRef));
8141 SvOBJECT_on(tmpRef);
8142 if (SvTYPE(tmpRef) != SVt_PVIO)
8144 (void)SvUPGRADE(tmpRef, SVt_PVMG);
8145 SvSTASH(tmpRef) = (HV*)SvREFCNT_inc(stash);
8152 if(SvSMAGICAL(tmpRef))
8153 if(mg_find(tmpRef, PERL_MAGIC_ext) || mg_find(tmpRef, PERL_MAGIC_uvar))
8161 /* Downgrades a PVGV to a PVMG.
8165 S_sv_unglob(pTHX_ SV *sv)
8169 assert(SvTYPE(sv) == SVt_PVGV);
8174 SvREFCNT_dec(GvSTASH(sv));
8175 GvSTASH(sv) = Nullhv;
8177 sv_unmagic(sv, PERL_MAGIC_glob);
8178 Safefree(GvNAME(sv));
8181 /* need to keep SvANY(sv) in the right arena */
8182 xpvmg = new_XPVMG();
8183 StructCopy(SvANY(sv), xpvmg, XPVMG);
8184 del_XPVGV(SvANY(sv));
8187 SvFLAGS(sv) &= ~SVTYPEMASK;
8188 SvFLAGS(sv) |= SVt_PVMG;
8192 =for apidoc sv_unref_flags
8194 Unsets the RV status of the SV, and decrements the reference count of
8195 whatever was being referenced by the RV. This can almost be thought of
8196 as a reversal of C<newSVrv>. The C<cflags> argument can contain
8197 C<SV_IMMEDIATE_UNREF> to force the reference count to be decremented
8198 (otherwise the decrementing is conditional on the reference count being
8199 different from one or the reference being a readonly SV).
8206 Perl_sv_unref_flags(pTHX_ SV *sv, U32 flags)
8210 if (SvWEAKREF(sv)) {
8218 /* You can't have a || SvREADONLY(rv) here, as $a = $$a, where $a was
8219 assigned to as BEGIN {$a = \"Foo"} will fail. */
8220 if (SvREFCNT(rv) != 1 || (flags & SV_IMMEDIATE_UNREF))
8222 else /* XXX Hack, but hard to make $a=$a->[1] work otherwise */
8223 sv_2mortal(rv); /* Schedule for freeing later */
8227 =for apidoc sv_unref
8229 Unsets the RV status of the SV, and decrements the reference count of
8230 whatever was being referenced by the RV. This can almost be thought of
8231 as a reversal of C<newSVrv>. This is C<sv_unref_flags> with the C<flag>
8232 being zero. See C<SvROK_off>.
8238 Perl_sv_unref(pTHX_ SV *sv)
8240 sv_unref_flags(sv, 0);
8244 =for apidoc sv_taint
8246 Taint an SV. Use C<SvTAINTED_on> instead.
8251 Perl_sv_taint(pTHX_ SV *sv)
8253 sv_magic((sv), Nullsv, PERL_MAGIC_taint, Nullch, 0);
8257 =for apidoc sv_untaint
8259 Untaint an SV. Use C<SvTAINTED_off> instead.
8264 Perl_sv_untaint(pTHX_ SV *sv)
8266 if (SvTYPE(sv) >= SVt_PVMG && SvMAGIC(sv)) {
8267 MAGIC *mg = mg_find(sv, PERL_MAGIC_taint);
8274 =for apidoc sv_tainted
8276 Test an SV for taintedness. Use C<SvTAINTED> instead.
8281 Perl_sv_tainted(pTHX_ SV *sv)
8283 if (SvTYPE(sv) >= SVt_PVMG && SvMAGIC(sv)) {
8284 MAGIC *mg = mg_find(sv, PERL_MAGIC_taint);
8285 if (mg && ((mg->mg_len & 1) || ((mg->mg_len & 2) && mg->mg_obj == sv)))
8292 =for apidoc sv_setpviv
8294 Copies an integer into the given SV, also updating its string value.
8295 Does not handle 'set' magic. See C<sv_setpviv_mg>.
8301 Perl_sv_setpviv(pTHX_ SV *sv, IV iv)
8303 char buf[TYPE_CHARS(UV)];
8305 char *ptr = uiv_2buf(buf, iv, 0, 0, &ebuf);
8307 sv_setpvn(sv, ptr, ebuf - ptr);
8311 =for apidoc sv_setpviv_mg
8313 Like C<sv_setpviv>, but also handles 'set' magic.
8319 Perl_sv_setpviv_mg(pTHX_ SV *sv, IV iv)
8321 char buf[TYPE_CHARS(UV)];
8323 char *ptr = uiv_2buf(buf, iv, 0, 0, &ebuf);
8325 sv_setpvn(sv, ptr, ebuf - ptr);
8329 #if defined(PERL_IMPLICIT_CONTEXT)
8331 /* pTHX_ magic can't cope with varargs, so this is a no-context
8332 * version of the main function, (which may itself be aliased to us).
8333 * Don't access this version directly.
8337 Perl_sv_setpvf_nocontext(SV *sv, const char* pat, ...)
8341 va_start(args, pat);
8342 sv_vsetpvf(sv, pat, &args);
8346 /* pTHX_ magic can't cope with varargs, so this is a no-context
8347 * version of the main function, (which may itself be aliased to us).
8348 * Don't access this version directly.
8352 Perl_sv_setpvf_mg_nocontext(SV *sv, const char* pat, ...)
8356 va_start(args, pat);
8357 sv_vsetpvf_mg(sv, pat, &args);
8363 =for apidoc sv_setpvf
8365 Processes its arguments like C<sprintf> and sets an SV to the formatted
8366 output. Does not handle 'set' magic. See C<sv_setpvf_mg>.
8372 Perl_sv_setpvf(pTHX_ SV *sv, const char* pat, ...)
8375 va_start(args, pat);
8376 sv_vsetpvf(sv, pat, &args);
8380 /* backend for C<sv_setpvf> and C<sv_setpvf_nocontext> */
8383 Perl_sv_vsetpvf(pTHX_ SV *sv, const char* pat, va_list* args)
8385 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
8389 =for apidoc sv_setpvf_mg
8391 Like C<sv_setpvf>, but also handles 'set' magic.
8397 Perl_sv_setpvf_mg(pTHX_ SV *sv, const char* pat, ...)
8400 va_start(args, pat);
8401 sv_vsetpvf_mg(sv, pat, &args);
8405 /* backend for C<sv_setpvf_mg> C<setpvf_mg_nocontext> */
8408 Perl_sv_vsetpvf_mg(pTHX_ SV *sv, const char* pat, va_list* args)
8410 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
8414 #if defined(PERL_IMPLICIT_CONTEXT)
8416 /* pTHX_ magic can't cope with varargs, so this is a no-context
8417 * version of the main function, (which may itself be aliased to us).
8418 * Don't access this version directly.
8422 Perl_sv_catpvf_nocontext(SV *sv, const char* pat, ...)
8426 va_start(args, pat);
8427 sv_vcatpvf(sv, pat, &args);
8431 /* pTHX_ magic can't cope with varargs, so this is a no-context
8432 * version of the main function, (which may itself be aliased to us).
8433 * Don't access this version directly.
8437 Perl_sv_catpvf_mg_nocontext(SV *sv, const char* pat, ...)
8441 va_start(args, pat);
8442 sv_vcatpvf_mg(sv, pat, &args);
8448 =for apidoc sv_catpvf
8450 Processes its arguments like C<sprintf> and appends the formatted
8451 output to an SV. If the appended data contains "wide" characters
8452 (including, but not limited to, SVs with a UTF-8 PV formatted with %s,
8453 and characters >255 formatted with %c), the original SV might get
8454 upgraded to UTF-8. Handles 'get' magic, but not 'set' magic.
8455 C<SvSETMAGIC()> must typically be called after calling this function
8456 to handle 'set' magic.
8461 Perl_sv_catpvf(pTHX_ SV *sv, const char* pat, ...)
8464 va_start(args, pat);
8465 sv_vcatpvf(sv, pat, &args);
8469 /* backend for C<sv_catpvf> and C<catpvf_mg_nocontext> */
8472 Perl_sv_vcatpvf(pTHX_ SV *sv, const char* pat, va_list* args)
8474 sv_vcatpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
8478 =for apidoc sv_catpvf_mg
8480 Like C<sv_catpvf>, but also handles 'set' magic.
8486 Perl_sv_catpvf_mg(pTHX_ SV *sv, const char* pat, ...)
8489 va_start(args, pat);
8490 sv_vcatpvf_mg(sv, pat, &args);
8494 /* backend for C<catpvf_mg> and C<catpvf_mg_nocontext> */
8497 Perl_sv_vcatpvf_mg(pTHX_ SV *sv, const char* pat, va_list* args)
8499 sv_vcatpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
8504 =for apidoc sv_vsetpvfn
8506 Works like C<vcatpvfn> but copies the text into the SV instead of
8509 Usually used via one of its frontends C<sv_setpvf> and C<sv_setpvf_mg>.
8515 Perl_sv_vsetpvfn(pTHX_ SV *sv, const char *pat, STRLEN patlen, va_list *args, SV **svargs, I32 svmax, bool *maybe_tainted)
8517 sv_setpvn(sv, "", 0);
8518 sv_vcatpvfn(sv, pat, patlen, args, svargs, svmax, maybe_tainted);
8521 /* private function for use in sv_vcatpvfn via the EXPECT_NUMBER macro */
8524 S_expect_number(pTHX_ char** pattern)
8527 switch (**pattern) {
8528 case '1': case '2': case '3':
8529 case '4': case '5': case '6':
8530 case '7': case '8': case '9':
8531 while (isDIGIT(**pattern))
8532 var = var * 10 + (*(*pattern)++ - '0');
8536 #define EXPECT_NUMBER(pattern, var) (var = S_expect_number(aTHX_ &pattern))
8539 F0convert(NV nv, char *endbuf, STRLEN *len)
8550 if (uv & 1 && uv == nv)
8551 uv--; /* Round to even */
8553 unsigned dig = uv % 10;
8566 =for apidoc sv_vcatpvfn
8568 Processes its arguments like C<vsprintf> and appends the formatted output
8569 to an SV. Uses an array of SVs if the C style variable argument list is
8570 missing (NULL). When running with taint checks enabled, indicates via
8571 C<maybe_tainted> if results are untrustworthy (often due to the use of
8574 Usually used via one of its frontends C<sv_catpvf> and C<sv_catpvf_mg>.
8580 Perl_sv_vcatpvfn(pTHX_ SV *sv, const char *pat, STRLEN patlen, va_list *args, SV **svargs, I32 svmax, bool *maybe_tainted)
8587 static char nullstr[] = "(null)";
8589 bool has_utf8; /* has the result utf8? */
8590 bool pat_utf8; /* the pattern is in utf8? */
8592 /* Times 4: a decimal digit takes more than 3 binary digits.
8593 * NV_DIG: mantissa takes than many decimal digits.
8594 * Plus 32: Playing safe. */
8595 char ebuf[IV_DIG * 4 + NV_DIG + 32];
8596 /* large enough for "%#.#f" --chip */
8597 /* what about long double NVs? --jhi */
8599 has_utf8 = pat_utf8 = DO_UTF8(sv);
8601 /* no matter what, this is a string now */
8602 (void)SvPV_force(sv, origlen);
8604 /* special-case "", "%s", and "%_" */
8607 if (patlen == 2 && pat[0] == '%') {
8611 char *s = va_arg(*args, char*);
8612 sv_catpv(sv, s ? s : nullstr);
8614 else if (svix < svmax) {
8615 sv_catsv(sv, *svargs);
8616 if (DO_UTF8(*svargs))
8622 argsv = va_arg(*args, SV*);
8623 sv_catsv(sv, argsv);
8628 /* See comment on '_' below */
8633 /* special-case "%.<number>[gf]" */
8634 if ( patlen <= 5 && pat[0] == '%' && pat[1] == '.'
8635 && (pat[patlen-1] == 'g' || pat[patlen-1] == 'f') ) {
8636 unsigned digits = 0;
8640 while (*pp >= '0' && *pp <= '9')
8641 digits = 10 * digits + (*pp++ - '0');
8642 if (pp - pat == patlen - 1) {
8646 nv = (NV)va_arg(*args, double);
8647 else if (svix < svmax)
8652 if (digits < sizeof(ebuf) - NV_DIG - 10) { /* 0, point, slack */
8653 Gconvert((double)nv, digits, 0, ebuf);
8655 if (*ebuf) /* May return an empty string for digits==0 */
8658 } else if (!digits) {
8661 if ((p = F0convert(nv, ebuf + sizeof ebuf, &l))) {
8662 sv_catpvn(sv, p, l);
8669 if (!args && svix < svmax && DO_UTF8(*svargs))
8672 patend = (char*)pat + patlen;
8673 for (p = (char*)pat; p < patend; p = q) {
8676 bool vectorize = FALSE;
8677 bool vectorarg = FALSE;
8678 bool vec_utf8 = FALSE;
8684 bool has_precis = FALSE;
8687 bool is_utf8 = FALSE; /* is this item utf8? */
8688 #ifdef HAS_LDBL_SPRINTF_BUG
8689 /* This is to try to fix a bug with irix/nonstop-ux/powerux and
8690 with sfio - Allen <allens@cpan.org> */
8691 bool fix_ldbl_sprintf_bug = FALSE;
8695 U8 utf8buf[UTF8_MAXLEN+1];
8696 STRLEN esignlen = 0;
8698 char *eptr = Nullch;
8701 U8 *vecstr = Null(U8*);
8708 /* we need a long double target in case HAS_LONG_DOUBLE but
8711 #if defined(HAS_LONG_DOUBLE) && LONG_DOUBLESIZE > DOUBLESIZE
8720 STRLEN dotstrlen = 1;
8721 I32 efix = 0; /* explicit format parameter index */
8722 I32 ewix = 0; /* explicit width index */
8723 I32 epix = 0; /* explicit precision index */
8724 I32 evix = 0; /* explicit vector index */
8725 bool asterisk = FALSE;
8727 /* echo everything up to the next format specification */
8728 for (q = p; q < patend && *q != '%'; ++q) ;
8730 if (has_utf8 && !pat_utf8)
8731 sv_catpvn_utf8_upgrade(sv, p, q - p, nsv);
8733 sv_catpvn(sv, p, q - p);
8740 We allow format specification elements in this order:
8741 \d+\$ explicit format parameter index
8743 v|\*(\d+\$)?v vector with optional (optionally specified) arg
8744 0 flag (as above): repeated to allow "v02"
8745 \d+|\*(\d+\$)? width using optional (optionally specified) arg
8746 \.(\d*|\*(\d+\$)?) precision using optional (optionally specified) arg
8748 [%bcdefginopsux_DFOUX] format (mandatory)
8750 if (EXPECT_NUMBER(q, width)) {
8791 if (EXPECT_NUMBER(q, ewix))
8800 if ((vectorarg = asterisk)) {
8812 EXPECT_NUMBER(q, width);
8817 vecsv = va_arg(*args, SV*);
8819 vecsv = (evix ? evix <= svmax : svix < svmax) ?
8820 svargs[evix ? evix-1 : svix++] : &PL_sv_undef;
8821 dotstr = SvPVx(vecsv, dotstrlen);
8826 vecsv = va_arg(*args, SV*);
8827 vecstr = (U8*)SvPVx(vecsv,veclen);
8828 vec_utf8 = DO_UTF8(vecsv);
8830 else if (efix ? efix <= svmax : svix < svmax) {
8831 vecsv = svargs[efix ? efix-1 : svix++];
8832 vecstr = (U8*)SvPVx(vecsv,veclen);
8833 vec_utf8 = DO_UTF8(vecsv);
8843 i = va_arg(*args, int);
8845 i = (ewix ? ewix <= svmax : svix < svmax) ?
8846 SvIVx(svargs[ewix ? ewix-1 : svix++]) : 0;
8848 width = (i < 0) ? -i : i;
8858 if (EXPECT_NUMBER(q, epix) && *q++ != '$')
8860 /* XXX: todo, support specified precision parameter */
8864 i = va_arg(*args, int);
8866 i = (ewix ? ewix <= svmax : svix < svmax)
8867 ? SvIVx(svargs[ewix ? ewix-1 : svix++]) : 0;
8868 precis = (i < 0) ? 0 : i;
8873 precis = precis * 10 + (*q++ - '0');
8882 case 'I': /* Ix, I32x, and I64x */
8884 if (q[1] == '6' && q[2] == '4') {
8890 if (q[1] == '3' && q[2] == '2') {
8900 #if defined(HAS_QUAD) || defined(HAS_LONG_DOUBLE)
8911 #if defined(HAS_QUAD) || defined(HAS_LONG_DOUBLE)
8912 if (*(q + 1) == 'l') { /* lld, llf */
8937 argsv = (efix ? efix <= svmax : svix < svmax) ?
8938 svargs[efix ? efix-1 : svix++] : &PL_sv_undef;
8945 uv = (args && !vectorize) ? va_arg(*args, int) : SvIVx(argsv);
8947 (!UNI_IS_INVARIANT(uv) && SvUTF8(sv)))
8949 eptr = (char*)utf8buf;
8950 elen = uvchr_to_utf8((U8*)eptr, uv) - utf8buf;
8961 if (args && !vectorize) {
8962 eptr = va_arg(*args, char*);
8964 #ifdef MACOS_TRADITIONAL
8965 /* On MacOS, %#s format is used for Pascal strings */
8970 elen = strlen(eptr);
8973 elen = sizeof nullstr - 1;
8977 eptr = SvPVx(argsv, elen);
8978 if (DO_UTF8(argsv)) {
8979 if (has_precis && precis < elen) {
8981 sv_pos_u2b(argsv, &p, 0); /* sticks at end */
8984 if (width) { /* fudge width (can't fudge elen) */
8985 width += elen - sv_len_utf8(argsv);
8994 * The "%_" hack might have to be changed someday,
8995 * if ISO or ANSI decide to use '_' for something.
8996 * So we keep it hidden from users' code.
8998 if (!args || vectorize)
9000 argsv = va_arg(*args, SV*);
9001 eptr = SvPVx(argsv, elen);
9007 if (has_precis && elen > precis)
9014 if (alt || vectorize)
9016 uv = PTR2UV(args ? va_arg(*args, void*) : argsv);
9034 uv = utf8n_to_uvchr(vecstr, veclen, &ulen,
9043 esignbuf[esignlen++] = plus;
9047 case 'h': iv = (short)va_arg(*args, int); break;
9048 default: iv = va_arg(*args, int); break;
9049 case 'l': iv = va_arg(*args, long); break;
9050 case 'V': iv = va_arg(*args, IV); break;
9052 case 'q': iv = va_arg(*args, Quad_t); break;
9059 case 'h': iv = (short)iv; break;
9061 case 'l': iv = (long)iv; break;
9064 case 'q': iv = (Quad_t)iv; break;
9068 if ( !vectorize ) /* we already set uv above */
9073 esignbuf[esignlen++] = plus;
9077 esignbuf[esignlen++] = '-';
9120 uv = utf8n_to_uvchr(vecstr, veclen, &ulen,
9131 case 'h': uv = (unsigned short)va_arg(*args, unsigned); break;
9132 default: uv = va_arg(*args, unsigned); break;
9133 case 'l': uv = va_arg(*args, unsigned long); break;
9134 case 'V': uv = va_arg(*args, UV); break;
9136 case 'q': uv = va_arg(*args, Quad_t); break;
9143 case 'h': uv = (unsigned short)uv; break;
9145 case 'l': uv = (unsigned long)uv; break;
9148 case 'q': uv = (Quad_t)uv; break;
9154 eptr = ebuf + sizeof ebuf;
9160 p = (char*)((c == 'X')
9161 ? "0123456789ABCDEF" : "0123456789abcdef");
9167 esignbuf[esignlen++] = '0';
9168 esignbuf[esignlen++] = c; /* 'x' or 'X' */
9174 *--eptr = '0' + dig;
9176 if (alt && *eptr != '0')
9182 *--eptr = '0' + dig;
9185 esignbuf[esignlen++] = '0';
9186 esignbuf[esignlen++] = 'b';
9189 default: /* it had better be ten or less */
9190 #if defined(PERL_Y2KWARN)
9191 if (ckWARN(WARN_Y2K)) {
9193 char *s = SvPV(sv,n);
9194 if (n >= 2 && s[n-2] == '1' && s[n-1] == '9'
9195 && (n == 2 || !isDIGIT(s[n-3])))
9197 Perl_warner(aTHX_ packWARN(WARN_Y2K),
9198 "Possible Y2K bug: %%%c %s",
9199 c, "format string following '19'");
9205 *--eptr = '0' + dig;
9206 } while (uv /= base);
9209 elen = (ebuf + sizeof ebuf) - eptr;
9212 zeros = precis - elen;
9213 else if (precis == 0 && elen == 1 && *eptr == '0')
9218 /* FLOATING POINT */
9221 c = 'f'; /* maybe %F isn't supported here */
9227 /* This is evil, but floating point is even more evil */
9229 /* for SV-style calling, we can only get NV
9230 for C-style calling, we assume %f is double;
9231 for simplicity we allow any of %Lf, %llf, %qf for long double
9235 #if defined(USE_LONG_DOUBLE)
9239 /* [perl #20339] - we should accept and ignore %lf rather than die */
9243 #if defined(USE_LONG_DOUBLE)
9244 intsize = args ? 0 : 'q';
9248 #if defined(HAS_LONG_DOUBLE)
9257 /* now we need (long double) if intsize == 'q', else (double) */
9258 nv = (args && !vectorize) ?
9259 #if LONG_DOUBLESIZE > DOUBLESIZE
9261 va_arg(*args, long double) :
9262 va_arg(*args, double)
9264 va_arg(*args, double)
9270 if (c != 'e' && c != 'E') {
9272 /* FIXME: if HAS_LONG_DOUBLE but not USE_LONG_DOUBLE this
9273 will cast our (long double) to (double) */
9274 (void)Perl_frexp(nv, &i);
9275 if (i == PERL_INT_MIN)
9276 Perl_die(aTHX_ "panic: frexp");
9278 need = BIT_DIGITS(i);
9280 need += has_precis ? precis : 6; /* known default */
9285 #ifdef HAS_LDBL_SPRINTF_BUG
9286 /* This is to try to fix a bug with irix/nonstop-ux/powerux and
9287 with sfio - Allen <allens@cpan.org> */
9290 # define MY_DBL_MAX DBL_MAX
9291 # else /* XXX guessing! HUGE_VAL may be defined as infinity, so not using */
9292 # if DOUBLESIZE >= 8
9293 # define MY_DBL_MAX 1.7976931348623157E+308L
9295 # define MY_DBL_MAX 3.40282347E+38L
9299 # ifdef HAS_LDBL_SPRINTF_BUG_LESS1 /* only between -1L & 1L - Allen */
9300 # define MY_DBL_MAX_BUG 1L
9302 # define MY_DBL_MAX_BUG MY_DBL_MAX
9306 # define MY_DBL_MIN DBL_MIN
9307 # else /* XXX guessing! -Allen */
9308 # if DOUBLESIZE >= 8
9309 # define MY_DBL_MIN 2.2250738585072014E-308L
9311 # define MY_DBL_MIN 1.17549435E-38L
9315 if ((intsize == 'q') && (c == 'f') &&
9316 ((nv < MY_DBL_MAX_BUG) && (nv > -MY_DBL_MAX_BUG)) &&
9318 /* it's going to be short enough that
9319 * long double precision is not needed */
9321 if ((nv <= 0L) && (nv >= -0L))
9322 fix_ldbl_sprintf_bug = TRUE; /* 0 is 0 - easiest */
9324 /* would use Perl_fp_class as a double-check but not
9325 * functional on IRIX - see perl.h comments */
9327 if ((nv >= MY_DBL_MIN) || (nv <= -MY_DBL_MIN)) {
9328 /* It's within the range that a double can represent */
9329 #if defined(DBL_MAX) && !defined(DBL_MIN)
9330 if ((nv >= ((long double)1/DBL_MAX)) ||
9331 (nv <= (-(long double)1/DBL_MAX)))
9333 fix_ldbl_sprintf_bug = TRUE;
9336 if (fix_ldbl_sprintf_bug == TRUE) {
9346 # undef MY_DBL_MAX_BUG
9349 #endif /* HAS_LDBL_SPRINTF_BUG */
9351 need += 20; /* fudge factor */
9352 if (PL_efloatsize < need) {
9353 Safefree(PL_efloatbuf);
9354 PL_efloatsize = need + 20; /* more fudge */
9355 New(906, PL_efloatbuf, PL_efloatsize, char);
9356 PL_efloatbuf[0] = '\0';
9359 if ( !(width || left || plus || alt) && fill != '0'
9360 && has_precis && intsize != 'q' ) { /* Shortcuts */
9362 Gconvert((double)nv, precis, 0, PL_efloatbuf);
9363 if (*PL_efloatbuf) /* May return an empty string for digits==0 */
9364 goto float_converted;
9365 } else if ( c == 'f' && !precis) {
9366 if ((eptr = F0convert(nv, ebuf + sizeof ebuf, &elen)))
9370 eptr = ebuf + sizeof ebuf;
9373 /* FIXME: what to do if HAS_LONG_DOUBLE but not PERL_PRIfldbl? */
9374 #if defined(HAS_LONG_DOUBLE) && defined(PERL_PRIfldbl)
9375 if (intsize == 'q') {
9376 /* Copy the one or more characters in a long double
9377 * format before the 'base' ([efgEFG]) character to
9378 * the format string. */
9379 static char const prifldbl[] = PERL_PRIfldbl;
9380 char const *p = prifldbl + sizeof(prifldbl) - 3;
9381 while (p >= prifldbl) { *--eptr = *p--; }
9386 do { *--eptr = '0' + (base % 10); } while (base /= 10);
9391 do { *--eptr = '0' + (base % 10); } while (base /= 10);
9403 /* No taint. Otherwise we are in the strange situation
9404 * where printf() taints but print($float) doesn't.
9406 #if defined(HAS_LONG_DOUBLE)
9408 (void)sprintf(PL_efloatbuf, eptr, nv);
9410 (void)sprintf(PL_efloatbuf, eptr, (double)nv);
9412 (void)sprintf(PL_efloatbuf, eptr, nv);
9415 eptr = PL_efloatbuf;
9416 elen = strlen(PL_efloatbuf);
9422 i = SvCUR(sv) - origlen;
9423 if (args && !vectorize) {
9425 case 'h': *(va_arg(*args, short*)) = i; break;
9426 default: *(va_arg(*args, int*)) = i; break;
9427 case 'l': *(va_arg(*args, long*)) = i; break;
9428 case 'V': *(va_arg(*args, IV*)) = i; break;
9430 case 'q': *(va_arg(*args, Quad_t*)) = i; break;
9435 sv_setuv_mg(argsv, (UV)i);
9437 continue; /* not "break" */
9443 if (!args && ckWARN(WARN_PRINTF) &&
9444 (PL_op->op_type == OP_PRTF || PL_op->op_type == OP_SPRINTF)) {
9445 SV *msg = sv_newmortal();
9446 Perl_sv_setpvf(aTHX_ msg, "Invalid conversion in %sprintf: ",
9447 (PL_op->op_type == OP_PRTF) ? "" : "s");
9450 Perl_sv_catpvf(aTHX_ msg,
9451 "\"%%%c\"", c & 0xFF);
9453 Perl_sv_catpvf(aTHX_ msg,
9454 "\"%%\\%03"UVof"\"",
9457 sv_catpv(msg, "end of string");
9458 Perl_warner(aTHX_ packWARN(WARN_PRINTF), "%"SVf, msg); /* yes, this is reentrant */
9461 /* output mangled stuff ... */
9467 /* ... right here, because formatting flags should not apply */
9468 SvGROW(sv, SvCUR(sv) + elen + 1);
9470 Copy(eptr, p, elen, char);
9473 SvCUR(sv) = p - SvPVX(sv);
9475 continue; /* not "break" */
9478 if (is_utf8 != has_utf8) {
9481 sv_utf8_upgrade(sv);
9484 SV *nsv = sv_2mortal(newSVpvn(eptr, elen));
9485 sv_utf8_upgrade(nsv);
9489 SvGROW(sv, SvCUR(sv) + elen + 1);
9493 /* Use memchr() instead of strchr(), as eptr is not guaranteed */
9494 /* to point to a null-terminated string. */
9495 if (left && ckWARN(WARN_PRINTF) && memchr(eptr, '\n', elen) &&
9496 (PL_op->op_type == OP_PRTF || PL_op->op_type == OP_SPRINTF))
9497 Perl_warner(aTHX_ packWARN(WARN_PRINTF),
9498 "Newline in left-justified string for %sprintf",
9499 (PL_op->op_type == OP_PRTF) ? "" : "s");
9501 have = esignlen + zeros + elen;
9502 need = (have > width ? have : width);
9505 SvGROW(sv, SvCUR(sv) + need + dotstrlen + 1);
9507 if (esignlen && fill == '0') {
9508 for (i = 0; i < (int)esignlen; i++)
9512 memset(p, fill, gap);
9515 if (esignlen && fill != '0') {
9516 for (i = 0; i < (int)esignlen; i++)
9520 for (i = zeros; i; i--)
9524 Copy(eptr, p, elen, char);
9528 memset(p, ' ', gap);
9533 Copy(dotstr, p, dotstrlen, char);
9537 vectorize = FALSE; /* done iterating over vecstr */
9544 SvCUR(sv) = p - SvPVX(sv);
9552 /* =========================================================================
9554 =head1 Cloning an interpreter
9556 All the macros and functions in this section are for the private use of
9557 the main function, perl_clone().
9559 The foo_dup() functions make an exact copy of an existing foo thinngy.
9560 During the course of a cloning, a hash table is used to map old addresses
9561 to new addresses. The table is created and manipulated with the
9562 ptr_table_* functions.
9566 ============================================================================*/
9569 #if defined(USE_ITHREADS)
9571 #ifndef GpREFCNT_inc
9572 # define GpREFCNT_inc(gp) ((gp) ? (++(gp)->gp_refcnt, (gp)) : (GP*)NULL)
9576 #define sv_dup_inc(s,t) SvREFCNT_inc(sv_dup(s,t))
9577 #define av_dup(s,t) (AV*)sv_dup((SV*)s,t)
9578 #define av_dup_inc(s,t) (AV*)SvREFCNT_inc(sv_dup((SV*)s,t))
9579 #define hv_dup(s,t) (HV*)sv_dup((SV*)s,t)
9580 #define hv_dup_inc(s,t) (HV*)SvREFCNT_inc(sv_dup((SV*)s,t))
9581 #define cv_dup(s,t) (CV*)sv_dup((SV*)s,t)
9582 #define cv_dup_inc(s,t) (CV*)SvREFCNT_inc(sv_dup((SV*)s,t))
9583 #define io_dup(s,t) (IO*)sv_dup((SV*)s,t)
9584 #define io_dup_inc(s,t) (IO*)SvREFCNT_inc(sv_dup((SV*)s,t))
9585 #define gv_dup(s,t) (GV*)sv_dup((SV*)s,t)
9586 #define gv_dup_inc(s,t) (GV*)SvREFCNT_inc(sv_dup((SV*)s,t))
9587 #define SAVEPV(p) (p ? savepv(p) : Nullch)
9588 #define SAVEPVN(p,n) (p ? savepvn(p,n) : Nullch)
9591 /* Duplicate a regexp. Required reading: pregcomp() and pregfree() in
9592 regcomp.c. AMS 20010712 */
9595 Perl_re_dup(pTHX_ REGEXP *r, CLONE_PARAMS *param)
9599 struct reg_substr_datum *s;
9602 return (REGEXP *)NULL;
9604 if ((ret = (REGEXP *)ptr_table_fetch(PL_ptr_table, r)))
9607 len = r->offsets[0];
9608 npar = r->nparens+1;
9610 Newc(0, ret, sizeof(regexp) + (len+1)*sizeof(regnode), char, regexp);
9611 Copy(r->program, ret->program, len+1, regnode);
9613 New(0, ret->startp, npar, I32);
9614 Copy(r->startp, ret->startp, npar, I32);
9615 New(0, ret->endp, npar, I32);
9616 Copy(r->startp, ret->startp, npar, I32);
9618 New(0, ret->substrs, 1, struct reg_substr_data);
9619 for (s = ret->substrs->data, i = 0; i < 3; i++, s++) {
9620 s->min_offset = r->substrs->data[i].min_offset;
9621 s->max_offset = r->substrs->data[i].max_offset;
9622 s->substr = sv_dup_inc(r->substrs->data[i].substr, param);
9623 s->utf8_substr = sv_dup_inc(r->substrs->data[i].utf8_substr, param);
9626 ret->regstclass = NULL;
9629 int count = r->data->count;
9631 Newc(0, d, sizeof(struct reg_data) + count*sizeof(void *),
9632 char, struct reg_data);
9633 New(0, d->what, count, U8);
9636 for (i = 0; i < count; i++) {
9637 d->what[i] = r->data->what[i];
9638 switch (d->what[i]) {
9640 d->data[i] = sv_dup_inc((SV *)r->data->data[i], param);
9643 d->data[i] = av_dup_inc((AV *)r->data->data[i], param);
9646 /* This is cheating. */
9647 New(0, d->data[i], 1, struct regnode_charclass_class);
9648 StructCopy(r->data->data[i], d->data[i],
9649 struct regnode_charclass_class);
9650 ret->regstclass = (regnode*)d->data[i];
9653 /* Compiled op trees are readonly, and can thus be
9654 shared without duplication. */
9655 d->data[i] = (void*)OpREFCNT_inc((OP*)r->data->data[i]);
9658 d->data[i] = r->data->data[i];
9668 New(0, ret->offsets, 2*len+1, U32);
9669 Copy(r->offsets, ret->offsets, 2*len+1, U32);
9671 ret->precomp = SAVEPV(r->precomp);
9672 ret->refcnt = r->refcnt;
9673 ret->minlen = r->minlen;
9674 ret->prelen = r->prelen;
9675 ret->nparens = r->nparens;
9676 ret->lastparen = r->lastparen;
9677 ret->lastcloseparen = r->lastcloseparen;
9678 ret->reganch = r->reganch;
9680 ret->sublen = r->sublen;
9682 if (RX_MATCH_COPIED(ret))
9683 ret->subbeg = SAVEPV(r->subbeg);
9685 ret->subbeg = Nullch;
9686 #ifdef PERL_COPY_ON_WRITE
9687 ret->saved_copy = Nullsv;
9690 ptr_table_store(PL_ptr_table, r, ret);
9694 /* duplicate a file handle */
9697 Perl_fp_dup(pTHX_ PerlIO *fp, char type, CLONE_PARAMS *param)
9701 return (PerlIO*)NULL;
9703 /* look for it in the table first */
9704 ret = (PerlIO*)ptr_table_fetch(PL_ptr_table, fp);
9708 /* create anew and remember what it is */
9709 ret = PerlIO_fdupopen(aTHX_ fp, param, PERLIO_DUP_CLONE);
9710 ptr_table_store(PL_ptr_table, fp, ret);
9714 /* duplicate a directory handle */
9717 Perl_dirp_dup(pTHX_ DIR *dp)
9725 /* duplicate a typeglob */
9728 Perl_gp_dup(pTHX_ GP *gp, CLONE_PARAMS* param)
9733 /* look for it in the table first */
9734 ret = (GP*)ptr_table_fetch(PL_ptr_table, gp);
9738 /* create anew and remember what it is */
9739 Newz(0, ret, 1, GP);
9740 ptr_table_store(PL_ptr_table, gp, ret);
9743 ret->gp_refcnt = 0; /* must be before any other dups! */
9744 ret->gp_sv = sv_dup_inc(gp->gp_sv, param);
9745 ret->gp_io = io_dup_inc(gp->gp_io, param);
9746 ret->gp_form = cv_dup_inc(gp->gp_form, param);
9747 ret->gp_av = av_dup_inc(gp->gp_av, param);
9748 ret->gp_hv = hv_dup_inc(gp->gp_hv, param);
9749 ret->gp_egv = gv_dup(gp->gp_egv, param);/* GvEGV is not refcounted */
9750 ret->gp_cv = cv_dup_inc(gp->gp_cv, param);
9751 ret->gp_cvgen = gp->gp_cvgen;
9752 ret->gp_flags = gp->gp_flags;
9753 ret->gp_line = gp->gp_line;
9754 ret->gp_file = gp->gp_file; /* points to COP.cop_file */
9758 /* duplicate a chain of magic */
9761 Perl_mg_dup(pTHX_ MAGIC *mg, CLONE_PARAMS* param)
9763 MAGIC *mgprev = (MAGIC*)NULL;
9766 return (MAGIC*)NULL;
9767 /* look for it in the table first */
9768 mgret = (MAGIC*)ptr_table_fetch(PL_ptr_table, mg);
9772 for (; mg; mg = mg->mg_moremagic) {
9774 Newz(0, nmg, 1, MAGIC);
9776 mgprev->mg_moremagic = nmg;
9779 nmg->mg_virtual = mg->mg_virtual; /* XXX copy dynamic vtable? */
9780 nmg->mg_private = mg->mg_private;
9781 nmg->mg_type = mg->mg_type;
9782 nmg->mg_flags = mg->mg_flags;
9783 if (mg->mg_type == PERL_MAGIC_qr) {
9784 nmg->mg_obj = (SV*)re_dup((REGEXP*)mg->mg_obj, param);
9786 else if(mg->mg_type == PERL_MAGIC_backref) {
9787 AV *av = (AV*) mg->mg_obj;
9790 nmg->mg_obj = (SV*)newAV();
9794 av_push((AV*)nmg->mg_obj,sv_dup(svp[i],param));
9799 nmg->mg_obj = (mg->mg_flags & MGf_REFCOUNTED)
9800 ? sv_dup_inc(mg->mg_obj, param)
9801 : sv_dup(mg->mg_obj, param);
9803 nmg->mg_len = mg->mg_len;
9804 nmg->mg_ptr = mg->mg_ptr; /* XXX random ptr? */
9805 if (mg->mg_ptr && mg->mg_type != PERL_MAGIC_regex_global) {
9806 if (mg->mg_len > 0) {
9807 nmg->mg_ptr = SAVEPVN(mg->mg_ptr, mg->mg_len);
9808 if (mg->mg_type == PERL_MAGIC_overload_table &&
9809 AMT_AMAGIC((AMT*)mg->mg_ptr))
9811 AMT *amtp = (AMT*)mg->mg_ptr;
9812 AMT *namtp = (AMT*)nmg->mg_ptr;
9814 for (i = 1; i < NofAMmeth; i++) {
9815 namtp->table[i] = cv_dup_inc(amtp->table[i], param);
9819 else if (mg->mg_len == HEf_SVKEY)
9820 nmg->mg_ptr = (char*)sv_dup_inc((SV*)mg->mg_ptr, param);
9822 if ((mg->mg_flags & MGf_DUP) && mg->mg_virtual && mg->mg_virtual->svt_dup) {
9823 CALL_FPTR(nmg->mg_virtual->svt_dup)(aTHX_ nmg, param);
9830 /* create a new pointer-mapping table */
9833 Perl_ptr_table_new(pTHX)
9836 Newz(0, tbl, 1, PTR_TBL_t);
9839 Newz(0, tbl->tbl_ary, tbl->tbl_max + 1, PTR_TBL_ENT_t*);
9843 /* map an existing pointer using a table */
9846 Perl_ptr_table_fetch(pTHX_ PTR_TBL_t *tbl, void *sv)
9848 PTR_TBL_ENT_t *tblent;
9849 UV hash = PTR2UV(sv);
9851 tblent = tbl->tbl_ary[hash & tbl->tbl_max];
9852 for (; tblent; tblent = tblent->next) {
9853 if (tblent->oldval == sv)
9854 return tblent->newval;
9859 /* add a new entry to a pointer-mapping table */
9862 Perl_ptr_table_store(pTHX_ PTR_TBL_t *tbl, void *oldv, void *newv)
9864 PTR_TBL_ENT_t *tblent, **otblent;
9865 /* XXX this may be pessimal on platforms where pointers aren't good
9866 * hash values e.g. if they grow faster in the most significant
9868 UV hash = PTR2UV(oldv);
9872 otblent = &tbl->tbl_ary[hash & tbl->tbl_max];
9873 for (tblent = *otblent; tblent; i=0, tblent = tblent->next) {
9874 if (tblent->oldval == oldv) {
9875 tblent->newval = newv;
9879 Newz(0, tblent, 1, PTR_TBL_ENT_t);
9880 tblent->oldval = oldv;
9881 tblent->newval = newv;
9882 tblent->next = *otblent;
9885 if (i && tbl->tbl_items > tbl->tbl_max)
9886 ptr_table_split(tbl);
9889 /* double the hash bucket size of an existing ptr table */
9892 Perl_ptr_table_split(pTHX_ PTR_TBL_t *tbl)
9894 PTR_TBL_ENT_t **ary = tbl->tbl_ary;
9895 UV oldsize = tbl->tbl_max + 1;
9896 UV newsize = oldsize * 2;
9899 Renew(ary, newsize, PTR_TBL_ENT_t*);
9900 Zero(&ary[oldsize], newsize-oldsize, PTR_TBL_ENT_t*);
9901 tbl->tbl_max = --newsize;
9903 for (i=0; i < oldsize; i++, ary++) {
9904 PTR_TBL_ENT_t **curentp, **entp, *ent;
9907 curentp = ary + oldsize;
9908 for (entp = ary, ent = *ary; ent; ent = *entp) {
9909 if ((newsize & PTR2UV(ent->oldval)) != i) {
9911 ent->next = *curentp;
9921 /* remove all the entries from a ptr table */
9924 Perl_ptr_table_clear(pTHX_ PTR_TBL_t *tbl)
9926 register PTR_TBL_ENT_t **array;
9927 register PTR_TBL_ENT_t *entry;
9928 register PTR_TBL_ENT_t *oentry = Null(PTR_TBL_ENT_t*);
9932 if (!tbl || !tbl->tbl_items) {
9936 array = tbl->tbl_ary;
9943 entry = entry->next;
9947 if (++riter > max) {
9950 entry = array[riter];
9957 /* clear and free a ptr table */
9960 Perl_ptr_table_free(pTHX_ PTR_TBL_t *tbl)
9965 ptr_table_clear(tbl);
9966 Safefree(tbl->tbl_ary);
9974 /* attempt to make everything in the typeglob readonly */
9977 S_gv_share(pTHX_ SV *sstr, CLONE_PARAMS *param)
9980 SV *sv = ¶m->proto_perl->Isv_no; /* just need SvREADONLY-ness */
9982 if (GvIO(gv) || GvFORM(gv)) {
9983 GvUNIQUE_off(gv); /* GvIOs cannot be shared. nor can GvFORMs */
9985 else if (!GvCV(gv)) {
9989 /* CvPADLISTs cannot be shared */
9990 if (!SvREADONLY(GvCV(gv)) && !CvXSUB(GvCV(gv))) {
9995 if (!GvUNIQUE(gv)) {
9997 PerlIO_printf(Perl_debug_log, "gv_share: unable to share %s::%s\n",
9998 HvNAME(GvSTASH(gv)), GvNAME(gv));
10004 * write attempts will die with
10005 * "Modification of a read-only value attempted"
10011 SvREADONLY_on(GvSV(gv));
10015 GvAV(gv) = (AV*)sv;
10018 SvREADONLY_on(GvAV(gv));
10022 GvHV(gv) = (HV*)sv;
10025 SvREADONLY_on(GvAV(gv));
10028 return sstr; /* he_dup() will SvREFCNT_inc() */
10031 /* duplicate an SV of any type (including AV, HV etc) */
10034 Perl_rvpv_dup(pTHX_ SV *dstr, SV *sstr, CLONE_PARAMS* param)
10037 SvRV(dstr) = SvWEAKREF(sstr)
10038 ? sv_dup(SvRV(sstr), param)
10039 : sv_dup_inc(SvRV(sstr), param);
10041 else if (SvPVX(sstr)) {
10042 /* Has something there */
10044 /* Normal PV - clone whole allocated space */
10045 SvPVX(dstr) = SAVEPVN(SvPVX(sstr), SvLEN(sstr)-1);
10046 if (SvREADONLY(sstr) && SvFAKE(sstr)) {
10047 /* Not that normal - actually sstr is copy on write.
10048 But we are a true, independant SV, so: */
10049 SvREADONLY_off(dstr);
10054 /* Special case - not normally malloced for some reason */
10055 if (SvREADONLY(sstr) && SvFAKE(sstr)) {
10056 /* A "shared" PV - clone it as unshared string */
10057 if(SvPADTMP(sstr)) {
10058 /* However, some of them live in the pad
10059 and they should not have these flags
10062 SvPVX(dstr) = sharepvn(SvPVX(sstr), SvCUR(sstr),
10064 SvUVX(dstr) = SvUVX(sstr);
10067 SvPVX(dstr) = SAVEPVN(SvPVX(sstr), SvCUR(sstr));
10069 SvREADONLY_off(dstr);
10073 /* Some other special case - random pointer */
10074 SvPVX(dstr) = SvPVX(sstr);
10079 /* Copy the Null */
10080 SvPVX(dstr) = SvPVX(sstr);
10085 Perl_sv_dup(pTHX_ SV *sstr, CLONE_PARAMS* param)
10089 if (!sstr || SvTYPE(sstr) == SVTYPEMASK)
10091 /* look for it in the table first */
10092 dstr = (SV*)ptr_table_fetch(PL_ptr_table, sstr);
10096 if(param->flags & CLONEf_JOIN_IN) {
10097 /** We are joining here so we don't want do clone
10098 something that is bad **/
10100 if(SvTYPE(sstr) == SVt_PVHV &&
10102 /** don't clone stashes if they already exist **/
10103 HV* old_stash = gv_stashpv(HvNAME(sstr),0);
10104 return (SV*) old_stash;
10108 /* create anew and remember what it is */
10110 ptr_table_store(PL_ptr_table, sstr, dstr);
10113 SvFLAGS(dstr) = SvFLAGS(sstr);
10114 SvFLAGS(dstr) &= ~SVf_OOK; /* don't propagate OOK hack */
10115 SvREFCNT(dstr) = 0; /* must be before any other dups! */
10118 if (SvANY(sstr) && PL_watch_pvx && SvPVX(sstr) == PL_watch_pvx)
10119 PerlIO_printf(Perl_debug_log, "watch at %p hit, found string \"%s\"\n",
10120 PL_watch_pvx, SvPVX(sstr));
10123 switch (SvTYPE(sstr)) {
10125 SvANY(dstr) = NULL;
10128 SvANY(dstr) = new_XIV();
10129 SvIVX(dstr) = SvIVX(sstr);
10132 SvANY(dstr) = new_XNV();
10133 SvNVX(dstr) = SvNVX(sstr);
10136 SvANY(dstr) = new_XRV();
10137 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10140 SvANY(dstr) = new_XPV();
10141 SvCUR(dstr) = SvCUR(sstr);
10142 SvLEN(dstr) = SvLEN(sstr);
10143 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10146 SvANY(dstr) = new_XPVIV();
10147 SvCUR(dstr) = SvCUR(sstr);
10148 SvLEN(dstr) = SvLEN(sstr);
10149 SvIVX(dstr) = SvIVX(sstr);
10150 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10153 SvANY(dstr) = new_XPVNV();
10154 SvCUR(dstr) = SvCUR(sstr);
10155 SvLEN(dstr) = SvLEN(sstr);
10156 SvIVX(dstr) = SvIVX(sstr);
10157 SvNVX(dstr) = SvNVX(sstr);
10158 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10161 SvANY(dstr) = new_XPVMG();
10162 SvCUR(dstr) = SvCUR(sstr);
10163 SvLEN(dstr) = SvLEN(sstr);
10164 SvIVX(dstr) = SvIVX(sstr);
10165 SvNVX(dstr) = SvNVX(sstr);
10166 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr), param);
10167 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr), param);
10168 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10171 SvANY(dstr) = new_XPVBM();
10172 SvCUR(dstr) = SvCUR(sstr);
10173 SvLEN(dstr) = SvLEN(sstr);
10174 SvIVX(dstr) = SvIVX(sstr);
10175 SvNVX(dstr) = SvNVX(sstr);
10176 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr), param);
10177 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr), param);
10178 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10179 BmRARE(dstr) = BmRARE(sstr);
10180 BmUSEFUL(dstr) = BmUSEFUL(sstr);
10181 BmPREVIOUS(dstr)= BmPREVIOUS(sstr);
10184 SvANY(dstr) = new_XPVLV();
10185 SvCUR(dstr) = SvCUR(sstr);
10186 SvLEN(dstr) = SvLEN(sstr);
10187 SvIVX(dstr) = SvIVX(sstr);
10188 SvNVX(dstr) = SvNVX(sstr);
10189 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr), param);
10190 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr), param);
10191 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10192 LvTARGOFF(dstr) = LvTARGOFF(sstr); /* XXX sometimes holds PMOP* when DEBUGGING */
10193 LvTARGLEN(dstr) = LvTARGLEN(sstr);
10194 if (LvTYPE(sstr) == 't') /* for tie: unrefcnted fake (SV**) */
10195 LvTARG(dstr) = dstr;
10196 else if (LvTYPE(sstr) == 'T') /* for tie: fake HE */
10197 LvTARG(dstr) = (SV*)he_dup((HE*)LvTARG(sstr), 0, param);
10199 LvTARG(dstr) = sv_dup_inc(LvTARG(sstr), param);
10200 LvTYPE(dstr) = LvTYPE(sstr);
10203 if (GvUNIQUE((GV*)sstr)) {
10205 if ((share = gv_share(sstr, param))) {
10208 ptr_table_store(PL_ptr_table, sstr, dstr);
10210 PerlIO_printf(Perl_debug_log, "sv_dup: sharing %s::%s\n",
10211 HvNAME(GvSTASH(share)), GvNAME(share));
10216 SvANY(dstr) = new_XPVGV();
10217 SvCUR(dstr) = SvCUR(sstr);
10218 SvLEN(dstr) = SvLEN(sstr);
10219 SvIVX(dstr) = SvIVX(sstr);
10220 SvNVX(dstr) = SvNVX(sstr);
10221 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr), param);
10222 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr), param);
10223 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10224 GvNAMELEN(dstr) = GvNAMELEN(sstr);
10225 GvNAME(dstr) = SAVEPVN(GvNAME(sstr), GvNAMELEN(sstr));
10226 GvSTASH(dstr) = hv_dup_inc(GvSTASH(sstr), param);
10227 GvFLAGS(dstr) = GvFLAGS(sstr);
10228 GvGP(dstr) = gp_dup(GvGP(sstr), param);
10229 (void)GpREFCNT_inc(GvGP(dstr));
10232 SvANY(dstr) = new_XPVIO();
10233 SvCUR(dstr) = SvCUR(sstr);
10234 SvLEN(dstr) = SvLEN(sstr);
10235 SvIVX(dstr) = SvIVX(sstr);
10236 SvNVX(dstr) = SvNVX(sstr);
10237 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr), param);
10238 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr), param);
10239 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10240 IoIFP(dstr) = fp_dup(IoIFP(sstr), IoTYPE(sstr), param);
10241 if (IoOFP(sstr) == IoIFP(sstr))
10242 IoOFP(dstr) = IoIFP(dstr);
10244 IoOFP(dstr) = fp_dup(IoOFP(sstr), IoTYPE(sstr), param);
10245 /* PL_rsfp_filters entries have fake IoDIRP() */
10246 if (IoDIRP(sstr) && !(IoFLAGS(sstr) & IOf_FAKE_DIRP))
10247 IoDIRP(dstr) = dirp_dup(IoDIRP(sstr));
10249 IoDIRP(dstr) = IoDIRP(sstr);
10250 IoLINES(dstr) = IoLINES(sstr);
10251 IoPAGE(dstr) = IoPAGE(sstr);
10252 IoPAGE_LEN(dstr) = IoPAGE_LEN(sstr);
10253 IoLINES_LEFT(dstr) = IoLINES_LEFT(sstr);
10254 if(IoFLAGS(sstr) & IOf_FAKE_DIRP) {
10255 /* I have no idea why fake dirp (rsfps)
10256 should be treaded differently but otherwise
10257 we end up with leaks -- sky*/
10258 IoTOP_GV(dstr) = gv_dup_inc(IoTOP_GV(sstr), param);
10259 IoFMT_GV(dstr) = gv_dup_inc(IoFMT_GV(sstr), param);
10260 IoBOTTOM_GV(dstr) = gv_dup_inc(IoBOTTOM_GV(sstr), param);
10262 IoTOP_GV(dstr) = gv_dup(IoTOP_GV(sstr), param);
10263 IoFMT_GV(dstr) = gv_dup(IoFMT_GV(sstr), param);
10264 IoBOTTOM_GV(dstr) = gv_dup(IoBOTTOM_GV(sstr), param);
10266 IoTOP_NAME(dstr) = SAVEPV(IoTOP_NAME(sstr));
10267 IoFMT_NAME(dstr) = SAVEPV(IoFMT_NAME(sstr));
10268 IoBOTTOM_NAME(dstr) = SAVEPV(IoBOTTOM_NAME(sstr));
10269 IoSUBPROCESS(dstr) = IoSUBPROCESS(sstr);
10270 IoTYPE(dstr) = IoTYPE(sstr);
10271 IoFLAGS(dstr) = IoFLAGS(sstr);
10274 SvANY(dstr) = new_XPVAV();
10275 SvCUR(dstr) = SvCUR(sstr);
10276 SvLEN(dstr) = SvLEN(sstr);
10277 SvIVX(dstr) = SvIVX(sstr);
10278 SvNVX(dstr) = SvNVX(sstr);
10279 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr), param);
10280 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr), param);
10281 AvARYLEN((AV*)dstr) = sv_dup_inc(AvARYLEN((AV*)sstr), param);
10282 AvFLAGS((AV*)dstr) = AvFLAGS((AV*)sstr);
10283 if (AvARRAY((AV*)sstr)) {
10284 SV **dst_ary, **src_ary;
10285 SSize_t items = AvFILLp((AV*)sstr) + 1;
10287 src_ary = AvARRAY((AV*)sstr);
10288 Newz(0, dst_ary, AvMAX((AV*)sstr)+1, SV*);
10289 ptr_table_store(PL_ptr_table, src_ary, dst_ary);
10290 SvPVX(dstr) = (char*)dst_ary;
10291 AvALLOC((AV*)dstr) = dst_ary;
10292 if (AvREAL((AV*)sstr)) {
10293 while (items-- > 0)
10294 *dst_ary++ = sv_dup_inc(*src_ary++, param);
10297 while (items-- > 0)
10298 *dst_ary++ = sv_dup(*src_ary++, param);
10300 items = AvMAX((AV*)sstr) - AvFILLp((AV*)sstr);
10301 while (items-- > 0) {
10302 *dst_ary++ = &PL_sv_undef;
10306 SvPVX(dstr) = Nullch;
10307 AvALLOC((AV*)dstr) = (SV**)NULL;
10311 SvANY(dstr) = new_XPVHV();
10312 SvCUR(dstr) = SvCUR(sstr);
10313 SvLEN(dstr) = SvLEN(sstr);
10314 SvIVX(dstr) = SvIVX(sstr);
10315 SvNVX(dstr) = SvNVX(sstr);
10316 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr), param);
10317 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr), param);
10318 HvRITER((HV*)dstr) = HvRITER((HV*)sstr);
10319 if (HvARRAY((HV*)sstr)) {
10321 XPVHV *dxhv = (XPVHV*)SvANY(dstr);
10322 XPVHV *sxhv = (XPVHV*)SvANY(sstr);
10323 Newz(0, dxhv->xhv_array,
10324 PERL_HV_ARRAY_ALLOC_BYTES(dxhv->xhv_max+1), char);
10325 while (i <= sxhv->xhv_max) {
10326 ((HE**)dxhv->xhv_array)[i] = he_dup(((HE**)sxhv->xhv_array)[i],
10327 (bool)!!HvSHAREKEYS(sstr),
10331 dxhv->xhv_eiter = he_dup(sxhv->xhv_eiter,
10332 (bool)!!HvSHAREKEYS(sstr), param);
10335 SvPVX(dstr) = Nullch;
10336 HvEITER((HV*)dstr) = (HE*)NULL;
10338 HvPMROOT((HV*)dstr) = HvPMROOT((HV*)sstr); /* XXX */
10339 HvNAME((HV*)dstr) = SAVEPV(HvNAME((HV*)sstr));
10340 /* Record stashes for possible cloning in Perl_clone(). */
10341 if(HvNAME((HV*)dstr))
10342 av_push(param->stashes, dstr);
10345 SvANY(dstr) = new_XPVFM();
10346 FmLINES(dstr) = FmLINES(sstr);
10350 SvANY(dstr) = new_XPVCV();
10352 SvCUR(dstr) = SvCUR(sstr);
10353 SvLEN(dstr) = SvLEN(sstr);
10354 SvIVX(dstr) = SvIVX(sstr);
10355 SvNVX(dstr) = SvNVX(sstr);
10356 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr), param);
10357 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr), param);
10358 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10359 CvSTASH(dstr) = hv_dup(CvSTASH(sstr), param); /* NOTE: not refcounted */
10360 CvSTART(dstr) = CvSTART(sstr);
10361 CvROOT(dstr) = OpREFCNT_inc(CvROOT(sstr));
10362 CvXSUB(dstr) = CvXSUB(sstr);
10363 CvXSUBANY(dstr) = CvXSUBANY(sstr);
10364 if (CvCONST(sstr)) {
10365 CvXSUBANY(dstr).any_ptr = GvUNIQUE(CvGV(sstr)) ?
10366 SvREFCNT_inc(CvXSUBANY(sstr).any_ptr) :
10367 sv_dup_inc(CvXSUBANY(sstr).any_ptr, param);
10369 CvGV(dstr) = gv_dup(CvGV(sstr), param);
10370 if (param->flags & CLONEf_COPY_STACKS) {
10371 CvDEPTH(dstr) = CvDEPTH(sstr);
10375 PAD_DUP(CvPADLIST(dstr), CvPADLIST(sstr), param);
10376 CvOUTSIDE_SEQ(dstr) = CvOUTSIDE_SEQ(sstr);
10378 CvWEAKOUTSIDE(sstr)
10379 ? cv_dup( CvOUTSIDE(sstr), param)
10380 : cv_dup_inc(CvOUTSIDE(sstr), param);
10381 CvFLAGS(dstr) = CvFLAGS(sstr);
10382 CvFILE(dstr) = CvXSUB(sstr) ? CvFILE(sstr) : SAVEPV(CvFILE(sstr));
10385 Perl_croak(aTHX_ "Bizarre SvTYPE [%" IVdf "]", (IV)SvTYPE(sstr));
10389 if (SvOBJECT(dstr) && SvTYPE(dstr) != SVt_PVIO)
10395 /* duplicate a context */
10398 Perl_cx_dup(pTHX_ PERL_CONTEXT *cxs, I32 ix, I32 max, CLONE_PARAMS* param)
10400 PERL_CONTEXT *ncxs;
10403 return (PERL_CONTEXT*)NULL;
10405 /* look for it in the table first */
10406 ncxs = (PERL_CONTEXT*)ptr_table_fetch(PL_ptr_table, cxs);
10410 /* create anew and remember what it is */
10411 Newz(56, ncxs, max + 1, PERL_CONTEXT);
10412 ptr_table_store(PL_ptr_table, cxs, ncxs);
10415 PERL_CONTEXT *cx = &cxs[ix];
10416 PERL_CONTEXT *ncx = &ncxs[ix];
10417 ncx->cx_type = cx->cx_type;
10418 if (CxTYPE(cx) == CXt_SUBST) {
10419 Perl_croak(aTHX_ "Cloning substitution context is unimplemented");
10422 ncx->blk_oldsp = cx->blk_oldsp;
10423 ncx->blk_oldcop = cx->blk_oldcop;
10424 ncx->blk_oldretsp = cx->blk_oldretsp;
10425 ncx->blk_oldmarksp = cx->blk_oldmarksp;
10426 ncx->blk_oldscopesp = cx->blk_oldscopesp;
10427 ncx->blk_oldpm = cx->blk_oldpm;
10428 ncx->blk_gimme = cx->blk_gimme;
10429 switch (CxTYPE(cx)) {
10431 ncx->blk_sub.cv = (cx->blk_sub.olddepth == 0
10432 ? cv_dup_inc(cx->blk_sub.cv, param)
10433 : cv_dup(cx->blk_sub.cv,param));
10434 ncx->blk_sub.argarray = (cx->blk_sub.hasargs
10435 ? av_dup_inc(cx->blk_sub.argarray, param)
10437 ncx->blk_sub.savearray = av_dup_inc(cx->blk_sub.savearray, param);
10438 ncx->blk_sub.olddepth = cx->blk_sub.olddepth;
10439 ncx->blk_sub.hasargs = cx->blk_sub.hasargs;
10440 ncx->blk_sub.lval = cx->blk_sub.lval;
10443 ncx->blk_eval.old_in_eval = cx->blk_eval.old_in_eval;
10444 ncx->blk_eval.old_op_type = cx->blk_eval.old_op_type;
10445 ncx->blk_eval.old_namesv = sv_dup_inc(cx->blk_eval.old_namesv, param);
10446 ncx->blk_eval.old_eval_root = cx->blk_eval.old_eval_root;
10447 ncx->blk_eval.cur_text = sv_dup(cx->blk_eval.cur_text, param);
10450 ncx->blk_loop.label = cx->blk_loop.label;
10451 ncx->blk_loop.resetsp = cx->blk_loop.resetsp;
10452 ncx->blk_loop.redo_op = cx->blk_loop.redo_op;
10453 ncx->blk_loop.next_op = cx->blk_loop.next_op;
10454 ncx->blk_loop.last_op = cx->blk_loop.last_op;
10455 ncx->blk_loop.iterdata = (CxPADLOOP(cx)
10456 ? cx->blk_loop.iterdata
10457 : gv_dup((GV*)cx->blk_loop.iterdata, param));
10458 ncx->blk_loop.oldcomppad
10459 = (PAD*)ptr_table_fetch(PL_ptr_table,
10460 cx->blk_loop.oldcomppad);
10461 ncx->blk_loop.itersave = sv_dup_inc(cx->blk_loop.itersave, param);
10462 ncx->blk_loop.iterlval = sv_dup_inc(cx->blk_loop.iterlval, param);
10463 ncx->blk_loop.iterary = av_dup_inc(cx->blk_loop.iterary, param);
10464 ncx->blk_loop.iterix = cx->blk_loop.iterix;
10465 ncx->blk_loop.itermax = cx->blk_loop.itermax;
10468 ncx->blk_sub.cv = cv_dup(cx->blk_sub.cv, param);
10469 ncx->blk_sub.gv = gv_dup(cx->blk_sub.gv, param);
10470 ncx->blk_sub.dfoutgv = gv_dup_inc(cx->blk_sub.dfoutgv, param);
10471 ncx->blk_sub.hasargs = cx->blk_sub.hasargs;
10483 /* duplicate a stack info structure */
10486 Perl_si_dup(pTHX_ PERL_SI *si, CLONE_PARAMS* param)
10491 return (PERL_SI*)NULL;
10493 /* look for it in the table first */
10494 nsi = (PERL_SI*)ptr_table_fetch(PL_ptr_table, si);
10498 /* create anew and remember what it is */
10499 Newz(56, nsi, 1, PERL_SI);
10500 ptr_table_store(PL_ptr_table, si, nsi);
10502 nsi->si_stack = av_dup_inc(si->si_stack, param);
10503 nsi->si_cxix = si->si_cxix;
10504 nsi->si_cxmax = si->si_cxmax;
10505 nsi->si_cxstack = cx_dup(si->si_cxstack, si->si_cxix, si->si_cxmax, param);
10506 nsi->si_type = si->si_type;
10507 nsi->si_prev = si_dup(si->si_prev, param);
10508 nsi->si_next = si_dup(si->si_next, param);
10509 nsi->si_markoff = si->si_markoff;
10514 #define POPINT(ss,ix) ((ss)[--(ix)].any_i32)
10515 #define TOPINT(ss,ix) ((ss)[ix].any_i32)
10516 #define POPLONG(ss,ix) ((ss)[--(ix)].any_long)
10517 #define TOPLONG(ss,ix) ((ss)[ix].any_long)
10518 #define POPIV(ss,ix) ((ss)[--(ix)].any_iv)
10519 #define TOPIV(ss,ix) ((ss)[ix].any_iv)
10520 #define POPBOOL(ss,ix) ((ss)[--(ix)].any_bool)
10521 #define TOPBOOL(ss,ix) ((ss)[ix].any_bool)
10522 #define POPPTR(ss,ix) ((ss)[--(ix)].any_ptr)
10523 #define TOPPTR(ss,ix) ((ss)[ix].any_ptr)
10524 #define POPDPTR(ss,ix) ((ss)[--(ix)].any_dptr)
10525 #define TOPDPTR(ss,ix) ((ss)[ix].any_dptr)
10526 #define POPDXPTR(ss,ix) ((ss)[--(ix)].any_dxptr)
10527 #define TOPDXPTR(ss,ix) ((ss)[ix].any_dxptr)
10530 #define pv_dup_inc(p) SAVEPV(p)
10531 #define pv_dup(p) SAVEPV(p)
10532 #define svp_dup_inc(p,pp) any_dup(p,pp)
10534 /* map any object to the new equivent - either something in the
10535 * ptr table, or something in the interpreter structure
10539 Perl_any_dup(pTHX_ void *v, PerlInterpreter *proto_perl)
10544 return (void*)NULL;
10546 /* look for it in the table first */
10547 ret = ptr_table_fetch(PL_ptr_table, v);
10551 /* see if it is part of the interpreter structure */
10552 if (v >= (void*)proto_perl && v < (void*)(proto_perl+1))
10553 ret = (void*)(((char*)aTHX) + (((char*)v) - (char*)proto_perl));
10561 /* duplicate the save stack */
10564 Perl_ss_dup(pTHX_ PerlInterpreter *proto_perl, CLONE_PARAMS* param)
10566 ANY *ss = proto_perl->Tsavestack;
10567 I32 ix = proto_perl->Tsavestack_ix;
10568 I32 max = proto_perl->Tsavestack_max;
10581 void (*dptr) (void*);
10582 void (*dxptr) (pTHX_ void*);
10585 Newz(54, nss, max, ANY);
10589 TOPINT(nss,ix) = i;
10591 case SAVEt_ITEM: /* normal string */
10592 sv = (SV*)POPPTR(ss,ix);
10593 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
10594 sv = (SV*)POPPTR(ss,ix);
10595 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
10597 case SAVEt_SV: /* scalar reference */
10598 sv = (SV*)POPPTR(ss,ix);
10599 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
10600 gv = (GV*)POPPTR(ss,ix);
10601 TOPPTR(nss,ix) = gv_dup_inc(gv, param);
10603 case SAVEt_GENERIC_PVREF: /* generic char* */
10604 c = (char*)POPPTR(ss,ix);
10605 TOPPTR(nss,ix) = pv_dup(c);
10606 ptr = POPPTR(ss,ix);
10607 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10609 case SAVEt_SHARED_PVREF: /* char* in shared space */
10610 c = (char*)POPPTR(ss,ix);
10611 TOPPTR(nss,ix) = savesharedpv(c);
10612 ptr = POPPTR(ss,ix);
10613 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10615 case SAVEt_GENERIC_SVREF: /* generic sv */
10616 case SAVEt_SVREF: /* scalar reference */
10617 sv = (SV*)POPPTR(ss,ix);
10618 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
10619 ptr = POPPTR(ss,ix);
10620 TOPPTR(nss,ix) = svp_dup_inc((SV**)ptr, proto_perl);/* XXXXX */
10622 case SAVEt_AV: /* array reference */
10623 av = (AV*)POPPTR(ss,ix);
10624 TOPPTR(nss,ix) = av_dup_inc(av, param);
10625 gv = (GV*)POPPTR(ss,ix);
10626 TOPPTR(nss,ix) = gv_dup(gv, param);
10628 case SAVEt_HV: /* hash reference */
10629 hv = (HV*)POPPTR(ss,ix);
10630 TOPPTR(nss,ix) = hv_dup_inc(hv, param);
10631 gv = (GV*)POPPTR(ss,ix);
10632 TOPPTR(nss,ix) = gv_dup(gv, param);
10634 case SAVEt_INT: /* int reference */
10635 ptr = POPPTR(ss,ix);
10636 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10637 intval = (int)POPINT(ss,ix);
10638 TOPINT(nss,ix) = intval;
10640 case SAVEt_LONG: /* long reference */
10641 ptr = POPPTR(ss,ix);
10642 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10643 longval = (long)POPLONG(ss,ix);
10644 TOPLONG(nss,ix) = longval;
10646 case SAVEt_I32: /* I32 reference */
10647 case SAVEt_I16: /* I16 reference */
10648 case SAVEt_I8: /* I8 reference */
10649 ptr = POPPTR(ss,ix);
10650 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10652 TOPINT(nss,ix) = i;
10654 case SAVEt_IV: /* IV reference */
10655 ptr = POPPTR(ss,ix);
10656 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10658 TOPIV(nss,ix) = iv;
10660 case SAVEt_SPTR: /* SV* reference */
10661 ptr = POPPTR(ss,ix);
10662 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10663 sv = (SV*)POPPTR(ss,ix);
10664 TOPPTR(nss,ix) = sv_dup(sv, param);
10666 case SAVEt_VPTR: /* random* reference */
10667 ptr = POPPTR(ss,ix);
10668 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10669 ptr = POPPTR(ss,ix);
10670 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10672 case SAVEt_PPTR: /* char* reference */
10673 ptr = POPPTR(ss,ix);
10674 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10675 c = (char*)POPPTR(ss,ix);
10676 TOPPTR(nss,ix) = pv_dup(c);
10678 case SAVEt_HPTR: /* HV* reference */
10679 ptr = POPPTR(ss,ix);
10680 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10681 hv = (HV*)POPPTR(ss,ix);
10682 TOPPTR(nss,ix) = hv_dup(hv, param);
10684 case SAVEt_APTR: /* AV* reference */
10685 ptr = POPPTR(ss,ix);
10686 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10687 av = (AV*)POPPTR(ss,ix);
10688 TOPPTR(nss,ix) = av_dup(av, param);
10691 gv = (GV*)POPPTR(ss,ix);
10692 TOPPTR(nss,ix) = gv_dup(gv, param);
10694 case SAVEt_GP: /* scalar reference */
10695 gp = (GP*)POPPTR(ss,ix);
10696 TOPPTR(nss,ix) = gp = gp_dup(gp, param);
10697 (void)GpREFCNT_inc(gp);
10698 gv = (GV*)POPPTR(ss,ix);
10699 TOPPTR(nss,ix) = gv_dup_inc(gv, param);
10700 c = (char*)POPPTR(ss,ix);
10701 TOPPTR(nss,ix) = pv_dup(c);
10703 TOPIV(nss,ix) = iv;
10705 TOPIV(nss,ix) = iv;
10708 case SAVEt_MORTALIZESV:
10709 sv = (SV*)POPPTR(ss,ix);
10710 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
10713 ptr = POPPTR(ss,ix);
10714 if (ptr && (((OP*)ptr)->op_private & OPpREFCOUNTED)) {
10715 /* these are assumed to be refcounted properly */
10716 switch (((OP*)ptr)->op_type) {
10718 case OP_LEAVESUBLV:
10722 case OP_LEAVEWRITE:
10723 TOPPTR(nss,ix) = ptr;
10728 TOPPTR(nss,ix) = Nullop;
10733 TOPPTR(nss,ix) = Nullop;
10736 c = (char*)POPPTR(ss,ix);
10737 TOPPTR(nss,ix) = pv_dup_inc(c);
10739 case SAVEt_CLEARSV:
10740 longval = POPLONG(ss,ix);
10741 TOPLONG(nss,ix) = longval;
10744 hv = (HV*)POPPTR(ss,ix);
10745 TOPPTR(nss,ix) = hv_dup_inc(hv, param);
10746 c = (char*)POPPTR(ss,ix);
10747 TOPPTR(nss,ix) = pv_dup_inc(c);
10749 TOPINT(nss,ix) = i;
10751 case SAVEt_DESTRUCTOR:
10752 ptr = POPPTR(ss,ix);
10753 TOPPTR(nss,ix) = any_dup(ptr, proto_perl); /* XXX quite arbitrary */
10754 dptr = POPDPTR(ss,ix);
10755 TOPDPTR(nss,ix) = (void (*)(void*))any_dup((void *)dptr, proto_perl);
10757 case SAVEt_DESTRUCTOR_X:
10758 ptr = POPPTR(ss,ix);
10759 TOPPTR(nss,ix) = any_dup(ptr, proto_perl); /* XXX quite arbitrary */
10760 dxptr = POPDXPTR(ss,ix);
10761 TOPDXPTR(nss,ix) = (void (*)(pTHX_ void*))any_dup((void *)dxptr, proto_perl);
10763 case SAVEt_REGCONTEXT:
10766 TOPINT(nss,ix) = i;
10769 case SAVEt_STACK_POS: /* Position on Perl stack */
10771 TOPINT(nss,ix) = i;
10773 case SAVEt_AELEM: /* array element */
10774 sv = (SV*)POPPTR(ss,ix);
10775 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
10777 TOPINT(nss,ix) = i;
10778 av = (AV*)POPPTR(ss,ix);
10779 TOPPTR(nss,ix) = av_dup_inc(av, param);
10781 case SAVEt_HELEM: /* hash element */
10782 sv = (SV*)POPPTR(ss,ix);
10783 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
10784 sv = (SV*)POPPTR(ss,ix);
10785 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
10786 hv = (HV*)POPPTR(ss,ix);
10787 TOPPTR(nss,ix) = hv_dup_inc(hv, param);
10790 ptr = POPPTR(ss,ix);
10791 TOPPTR(nss,ix) = ptr;
10795 TOPINT(nss,ix) = i;
10797 case SAVEt_COMPPAD:
10798 av = (AV*)POPPTR(ss,ix);
10799 TOPPTR(nss,ix) = av_dup(av, param);
10802 longval = (long)POPLONG(ss,ix);
10803 TOPLONG(nss,ix) = longval;
10804 ptr = POPPTR(ss,ix);
10805 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10806 sv = (SV*)POPPTR(ss,ix);
10807 TOPPTR(nss,ix) = sv_dup(sv, param);
10810 ptr = POPPTR(ss,ix);
10811 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10812 longval = (long)POPBOOL(ss,ix);
10813 TOPBOOL(nss,ix) = (bool)longval;
10815 case SAVEt_SET_SVFLAGS:
10817 TOPINT(nss,ix) = i;
10819 TOPINT(nss,ix) = i;
10820 sv = (SV*)POPPTR(ss,ix);
10821 TOPPTR(nss,ix) = sv_dup(sv, param);
10824 Perl_croak(aTHX_ "panic: ss_dup inconsistency");
10832 =for apidoc perl_clone
10834 Create and return a new interpreter by cloning the current one.
10836 perl_clone takes these flags as parameters:
10838 CLONEf_COPY_STACKS - is used to, well, copy the stacks also,
10839 without it we only clone the data and zero the stacks,
10840 with it we copy the stacks and the new perl interpreter is
10841 ready to run at the exact same point as the previous one.
10842 The pseudo-fork code uses COPY_STACKS while the
10843 threads->new doesn't.
10845 CLONEf_KEEP_PTR_TABLE
10846 perl_clone keeps a ptr_table with the pointer of the old
10847 variable as a key and the new variable as a value,
10848 this allows it to check if something has been cloned and not
10849 clone it again but rather just use the value and increase the
10850 refcount. If KEEP_PTR_TABLE is not set then perl_clone will kill
10851 the ptr_table using the function
10852 C<ptr_table_free(PL_ptr_table); PL_ptr_table = NULL;>,
10853 reason to keep it around is if you want to dup some of your own
10854 variable who are outside the graph perl scans, example of this
10855 code is in threads.xs create
10858 This is a win32 thing, it is ignored on unix, it tells perls
10859 win32host code (which is c++) to clone itself, this is needed on
10860 win32 if you want to run two threads at the same time,
10861 if you just want to do some stuff in a separate perl interpreter
10862 and then throw it away and return to the original one,
10863 you don't need to do anything.
10868 /* XXX the above needs expanding by someone who actually understands it ! */
10869 EXTERN_C PerlInterpreter *
10870 perl_clone_host(PerlInterpreter* proto_perl, UV flags);
10873 perl_clone(PerlInterpreter *proto_perl, UV flags)
10875 #ifdef PERL_IMPLICIT_SYS
10877 /* perlhost.h so we need to call into it
10878 to clone the host, CPerlHost should have a c interface, sky */
10880 if (flags & CLONEf_CLONE_HOST) {
10881 return perl_clone_host(proto_perl,flags);
10883 return perl_clone_using(proto_perl, flags,
10885 proto_perl->IMemShared,
10886 proto_perl->IMemParse,
10888 proto_perl->IStdIO,
10892 proto_perl->IProc);
10896 perl_clone_using(PerlInterpreter *proto_perl, UV flags,
10897 struct IPerlMem* ipM, struct IPerlMem* ipMS,
10898 struct IPerlMem* ipMP, struct IPerlEnv* ipE,
10899 struct IPerlStdIO* ipStd, struct IPerlLIO* ipLIO,
10900 struct IPerlDir* ipD, struct IPerlSock* ipS,
10901 struct IPerlProc* ipP)
10903 /* XXX many of the string copies here can be optimized if they're
10904 * constants; they need to be allocated as common memory and just
10905 * their pointers copied. */
10908 CLONE_PARAMS clone_params;
10909 CLONE_PARAMS* param = &clone_params;
10911 PerlInterpreter *my_perl = (PerlInterpreter*)(*ipM->pMalloc)(ipM, sizeof(PerlInterpreter));
10912 PERL_SET_THX(my_perl);
10915 Poison(my_perl, 1, PerlInterpreter);
10919 PL_savestack_ix = 0;
10920 PL_savestack_max = -1;
10922 PL_sig_pending = 0;
10923 Zero(&PL_debug_pad, 1, struct perl_debug_pad);
10924 # else /* !DEBUGGING */
10925 Zero(my_perl, 1, PerlInterpreter);
10926 # endif /* DEBUGGING */
10928 /* host pointers */
10930 PL_MemShared = ipMS;
10931 PL_MemParse = ipMP;
10938 #else /* !PERL_IMPLICIT_SYS */
10940 CLONE_PARAMS clone_params;
10941 CLONE_PARAMS* param = &clone_params;
10942 PerlInterpreter *my_perl = (PerlInterpreter*)PerlMem_malloc(sizeof(PerlInterpreter));
10943 PERL_SET_THX(my_perl);
10948 Poison(my_perl, 1, PerlInterpreter);
10952 PL_savestack_ix = 0;
10953 PL_savestack_max = -1;
10955 PL_sig_pending = 0;
10956 Zero(&PL_debug_pad, 1, struct perl_debug_pad);
10957 # else /* !DEBUGGING */
10958 Zero(my_perl, 1, PerlInterpreter);
10959 # endif /* DEBUGGING */
10960 #endif /* PERL_IMPLICIT_SYS */
10961 param->flags = flags;
10962 param->proto_perl = proto_perl;
10965 PL_xiv_arenaroot = NULL;
10966 PL_xiv_root = NULL;
10967 PL_xnv_arenaroot = NULL;
10968 PL_xnv_root = NULL;
10969 PL_xrv_arenaroot = NULL;
10970 PL_xrv_root = NULL;
10971 PL_xpv_arenaroot = NULL;
10972 PL_xpv_root = NULL;
10973 PL_xpviv_arenaroot = NULL;
10974 PL_xpviv_root = NULL;
10975 PL_xpvnv_arenaroot = NULL;
10976 PL_xpvnv_root = NULL;
10977 PL_xpvcv_arenaroot = NULL;
10978 PL_xpvcv_root = NULL;
10979 PL_xpvav_arenaroot = NULL;
10980 PL_xpvav_root = NULL;
10981 PL_xpvhv_arenaroot = NULL;
10982 PL_xpvhv_root = NULL;
10983 PL_xpvmg_arenaroot = NULL;
10984 PL_xpvmg_root = NULL;
10985 PL_xpvlv_arenaroot = NULL;
10986 PL_xpvlv_root = NULL;
10987 PL_xpvbm_arenaroot = NULL;
10988 PL_xpvbm_root = NULL;
10989 PL_he_arenaroot = NULL;
10991 PL_nice_chunk = NULL;
10992 PL_nice_chunk_size = 0;
10994 PL_sv_objcount = 0;
10995 PL_sv_root = Nullsv;
10996 PL_sv_arenaroot = Nullsv;
10998 PL_debug = proto_perl->Idebug;
11000 #ifdef USE_REENTRANT_API
11002 PERL_SET_CONTEXT(proto_perl);
11004 Perl_reentrant_init(aTHX);
11007 /* create SV map for pointer relocation */
11008 PL_ptr_table = ptr_table_new();
11010 /* initialize these special pointers as early as possible */
11011 SvANY(&PL_sv_undef) = NULL;
11012 SvREFCNT(&PL_sv_undef) = (~(U32)0)/2;
11013 SvFLAGS(&PL_sv_undef) = SVf_READONLY|SVt_NULL;
11014 ptr_table_store(PL_ptr_table, &proto_perl->Isv_undef, &PL_sv_undef);
11016 SvANY(&PL_sv_no) = new_XPVNV();
11017 SvREFCNT(&PL_sv_no) = (~(U32)0)/2;
11018 SvFLAGS(&PL_sv_no) = SVp_NOK|SVf_NOK|SVp_POK|SVf_POK|SVf_READONLY|SVt_PVNV;
11019 SvPVX(&PL_sv_no) = SAVEPVN(PL_No, 0);
11020 SvCUR(&PL_sv_no) = 0;
11021 SvLEN(&PL_sv_no) = 1;
11022 SvNVX(&PL_sv_no) = 0;
11023 ptr_table_store(PL_ptr_table, &proto_perl->Isv_no, &PL_sv_no);
11025 SvANY(&PL_sv_yes) = new_XPVNV();
11026 SvREFCNT(&PL_sv_yes) = (~(U32)0)/2;
11027 SvFLAGS(&PL_sv_yes) = SVp_NOK|SVf_NOK|SVp_POK|SVf_POK|SVf_READONLY|SVt_PVNV;
11028 SvPVX(&PL_sv_yes) = SAVEPVN(PL_Yes, 1);
11029 SvCUR(&PL_sv_yes) = 1;
11030 SvLEN(&PL_sv_yes) = 2;
11031 SvNVX(&PL_sv_yes) = 1;
11032 ptr_table_store(PL_ptr_table, &proto_perl->Isv_yes, &PL_sv_yes);
11034 /* create (a non-shared!) shared string table */
11035 PL_strtab = newHV();
11036 HvSHAREKEYS_off(PL_strtab);
11037 hv_ksplit(PL_strtab, 512);
11038 ptr_table_store(PL_ptr_table, proto_perl->Istrtab, PL_strtab);
11040 PL_compiling = proto_perl->Icompiling;
11042 /* These two PVs will be free'd special way so must set them same way op.c does */
11043 PL_compiling.cop_stashpv = savesharedpv(PL_compiling.cop_stashpv);
11044 ptr_table_store(PL_ptr_table, proto_perl->Icompiling.cop_stashpv, PL_compiling.cop_stashpv);
11046 PL_compiling.cop_file = savesharedpv(PL_compiling.cop_file);
11047 ptr_table_store(PL_ptr_table, proto_perl->Icompiling.cop_file, PL_compiling.cop_file);
11049 ptr_table_store(PL_ptr_table, &proto_perl->Icompiling, &PL_compiling);
11050 if (!specialWARN(PL_compiling.cop_warnings))
11051 PL_compiling.cop_warnings = sv_dup_inc(PL_compiling.cop_warnings, param);
11052 if (!specialCopIO(PL_compiling.cop_io))
11053 PL_compiling.cop_io = sv_dup_inc(PL_compiling.cop_io, param);
11054 PL_curcop = (COP*)any_dup(proto_perl->Tcurcop, proto_perl);
11056 /* pseudo environmental stuff */
11057 PL_origargc = proto_perl->Iorigargc;
11058 PL_origargv = proto_perl->Iorigargv;
11060 param->stashes = newAV(); /* Setup array of objects to call clone on */
11062 #ifdef PERLIO_LAYERS
11063 /* Clone PerlIO tables as soon as we can handle general xx_dup() */
11064 PerlIO_clone(aTHX_ proto_perl, param);
11067 PL_envgv = gv_dup(proto_perl->Ienvgv, param);
11068 PL_incgv = gv_dup(proto_perl->Iincgv, param);
11069 PL_hintgv = gv_dup(proto_perl->Ihintgv, param);
11070 PL_origfilename = SAVEPV(proto_perl->Iorigfilename);
11071 PL_diehook = sv_dup_inc(proto_perl->Idiehook, param);
11072 PL_warnhook = sv_dup_inc(proto_perl->Iwarnhook, param);
11075 PL_minus_c = proto_perl->Iminus_c;
11076 PL_patchlevel = sv_dup_inc(proto_perl->Ipatchlevel, param);
11077 PL_localpatches = proto_perl->Ilocalpatches;
11078 PL_splitstr = proto_perl->Isplitstr;
11079 PL_preprocess = proto_perl->Ipreprocess;
11080 PL_minus_n = proto_perl->Iminus_n;
11081 PL_minus_p = proto_perl->Iminus_p;
11082 PL_minus_l = proto_perl->Iminus_l;
11083 PL_minus_a = proto_perl->Iminus_a;
11084 PL_minus_F = proto_perl->Iminus_F;
11085 PL_doswitches = proto_perl->Idoswitches;
11086 PL_dowarn = proto_perl->Idowarn;
11087 PL_doextract = proto_perl->Idoextract;
11088 PL_sawampersand = proto_perl->Isawampersand;
11089 PL_unsafe = proto_perl->Iunsafe;
11090 PL_inplace = SAVEPV(proto_perl->Iinplace);
11091 PL_e_script = sv_dup_inc(proto_perl->Ie_script, param);
11092 PL_perldb = proto_perl->Iperldb;
11093 PL_perl_destruct_level = proto_perl->Iperl_destruct_level;
11094 PL_exit_flags = proto_perl->Iexit_flags;
11096 /* magical thingies */
11097 /* XXX time(&PL_basetime) when asked for? */
11098 PL_basetime = proto_perl->Ibasetime;
11099 PL_formfeed = sv_dup(proto_perl->Iformfeed, param);
11101 PL_maxsysfd = proto_perl->Imaxsysfd;
11102 PL_multiline = proto_perl->Imultiline;
11103 PL_statusvalue = proto_perl->Istatusvalue;
11105 PL_statusvalue_vms = proto_perl->Istatusvalue_vms;
11107 PL_encoding = sv_dup(proto_perl->Iencoding, param);
11109 sv_setpvn(PERL_DEBUG_PAD(0), "", 0); /* For regex debugging. */
11110 sv_setpvn(PERL_DEBUG_PAD(1), "", 0); /* ext/re needs these */
11111 sv_setpvn(PERL_DEBUG_PAD(2), "", 0); /* even without DEBUGGING. */
11113 /* Clone the regex array */
11114 PL_regex_padav = newAV();
11116 I32 len = av_len((AV*)proto_perl->Iregex_padav);
11117 SV** regexen = AvARRAY((AV*)proto_perl->Iregex_padav);
11118 av_push(PL_regex_padav,
11119 sv_dup_inc(regexen[0],param));
11120 for(i = 1; i <= len; i++) {
11121 if(SvREPADTMP(regexen[i])) {
11122 av_push(PL_regex_padav, sv_dup_inc(regexen[i], param));
11124 av_push(PL_regex_padav,
11126 newSViv(PTR2IV(re_dup(INT2PTR(REGEXP *,
11127 SvIVX(regexen[i])), param)))
11132 PL_regex_pad = AvARRAY(PL_regex_padav);
11134 /* shortcuts to various I/O objects */
11135 PL_stdingv = gv_dup(proto_perl->Istdingv, param);
11136 PL_stderrgv = gv_dup(proto_perl->Istderrgv, param);
11137 PL_defgv = gv_dup(proto_perl->Idefgv, param);
11138 PL_argvgv = gv_dup(proto_perl->Iargvgv, param);
11139 PL_argvoutgv = gv_dup(proto_perl->Iargvoutgv, param);
11140 PL_argvout_stack = av_dup_inc(proto_perl->Iargvout_stack, param);
11142 /* shortcuts to regexp stuff */
11143 PL_replgv = gv_dup(proto_perl->Ireplgv, param);
11145 /* shortcuts to misc objects */
11146 PL_errgv = gv_dup(proto_perl->Ierrgv, param);
11148 /* shortcuts to debugging objects */
11149 PL_DBgv = gv_dup(proto_perl->IDBgv, param);
11150 PL_DBline = gv_dup(proto_perl->IDBline, param);
11151 PL_DBsub = gv_dup(proto_perl->IDBsub, param);
11152 PL_DBsingle = sv_dup(proto_perl->IDBsingle, param);
11153 PL_DBtrace = sv_dup(proto_perl->IDBtrace, param);
11154 PL_DBsignal = sv_dup(proto_perl->IDBsignal, param);
11155 PL_DBassertion = sv_dup(proto_perl->IDBassertion, param);
11156 PL_lineary = av_dup(proto_perl->Ilineary, param);
11157 PL_dbargs = av_dup(proto_perl->Idbargs, param);
11159 /* symbol tables */
11160 PL_defstash = hv_dup_inc(proto_perl->Tdefstash, param);
11161 PL_curstash = hv_dup(proto_perl->Tcurstash, param);
11162 PL_debstash = hv_dup(proto_perl->Idebstash, param);
11163 PL_globalstash = hv_dup(proto_perl->Iglobalstash, param);
11164 PL_curstname = sv_dup_inc(proto_perl->Icurstname, param);
11166 PL_beginav = av_dup_inc(proto_perl->Ibeginav, param);
11167 PL_beginav_save = av_dup_inc(proto_perl->Ibeginav_save, param);
11168 PL_checkav_save = av_dup_inc(proto_perl->Icheckav_save, param);
11169 PL_endav = av_dup_inc(proto_perl->Iendav, param);
11170 PL_checkav = av_dup_inc(proto_perl->Icheckav, param);
11171 PL_initav = av_dup_inc(proto_perl->Iinitav, param);
11173 PL_sub_generation = proto_perl->Isub_generation;
11175 /* funky return mechanisms */
11176 PL_forkprocess = proto_perl->Iforkprocess;
11178 /* subprocess state */
11179 PL_fdpid = av_dup_inc(proto_perl->Ifdpid, param);
11181 /* internal state */
11182 PL_tainting = proto_perl->Itainting;
11183 PL_taint_warn = proto_perl->Itaint_warn;
11184 PL_maxo = proto_perl->Imaxo;
11185 if (proto_perl->Iop_mask)
11186 PL_op_mask = SAVEPVN(proto_perl->Iop_mask, PL_maxo);
11188 PL_op_mask = Nullch;
11189 /* PL_asserting = proto_perl->Iasserting; */
11191 /* current interpreter roots */
11192 PL_main_cv = cv_dup_inc(proto_perl->Imain_cv, param);
11193 PL_main_root = OpREFCNT_inc(proto_perl->Imain_root);
11194 PL_main_start = proto_perl->Imain_start;
11195 PL_eval_root = proto_perl->Ieval_root;
11196 PL_eval_start = proto_perl->Ieval_start;
11198 /* runtime control stuff */
11199 PL_curcopdb = (COP*)any_dup(proto_perl->Icurcopdb, proto_perl);
11200 PL_copline = proto_perl->Icopline;
11202 PL_filemode = proto_perl->Ifilemode;
11203 PL_lastfd = proto_perl->Ilastfd;
11204 PL_oldname = proto_perl->Ioldname; /* XXX not quite right */
11207 PL_gensym = proto_perl->Igensym;
11208 PL_preambled = proto_perl->Ipreambled;
11209 PL_preambleav = av_dup_inc(proto_perl->Ipreambleav, param);
11210 PL_laststatval = proto_perl->Ilaststatval;
11211 PL_laststype = proto_perl->Ilaststype;
11212 PL_mess_sv = Nullsv;
11214 PL_ors_sv = sv_dup_inc(proto_perl->Iors_sv, param);
11215 PL_ofmt = SAVEPV(proto_perl->Iofmt);
11217 /* interpreter atexit processing */
11218 PL_exitlistlen = proto_perl->Iexitlistlen;
11219 if (PL_exitlistlen) {
11220 New(0, PL_exitlist, PL_exitlistlen, PerlExitListEntry);
11221 Copy(proto_perl->Iexitlist, PL_exitlist, PL_exitlistlen, PerlExitListEntry);
11224 PL_exitlist = (PerlExitListEntry*)NULL;
11225 PL_modglobal = hv_dup_inc(proto_perl->Imodglobal, param);
11226 PL_custom_op_names = hv_dup_inc(proto_perl->Icustom_op_names,param);
11227 PL_custom_op_descs = hv_dup_inc(proto_perl->Icustom_op_descs,param);
11229 PL_profiledata = NULL;
11230 PL_rsfp = fp_dup(proto_perl->Irsfp, '<', param);
11231 /* PL_rsfp_filters entries have fake IoDIRP() */
11232 PL_rsfp_filters = av_dup_inc(proto_perl->Irsfp_filters, param);
11234 PL_compcv = cv_dup(proto_perl->Icompcv, param);
11236 PAD_CLONE_VARS(proto_perl, param);
11238 #ifdef HAVE_INTERP_INTERN
11239 sys_intern_dup(&proto_perl->Isys_intern, &PL_sys_intern);
11242 /* more statics moved here */
11243 PL_generation = proto_perl->Igeneration;
11244 PL_DBcv = cv_dup(proto_perl->IDBcv, param);
11246 PL_in_clean_objs = proto_perl->Iin_clean_objs;
11247 PL_in_clean_all = proto_perl->Iin_clean_all;
11249 PL_uid = proto_perl->Iuid;
11250 PL_euid = proto_perl->Ieuid;
11251 PL_gid = proto_perl->Igid;
11252 PL_egid = proto_perl->Iegid;
11253 PL_nomemok = proto_perl->Inomemok;
11254 PL_an = proto_perl->Ian;
11255 PL_op_seqmax = proto_perl->Iop_seqmax;
11256 PL_evalseq = proto_perl->Ievalseq;
11257 PL_origenviron = proto_perl->Iorigenviron; /* XXX not quite right */
11258 PL_origalen = proto_perl->Iorigalen;
11259 PL_pidstatus = newHV(); /* XXX flag for cloning? */
11260 PL_osname = SAVEPV(proto_perl->Iosname);
11261 PL_sh_path_compat = proto_perl->Ish_path_compat; /* XXX never deallocated */
11262 PL_sighandlerp = proto_perl->Isighandlerp;
11265 PL_runops = proto_perl->Irunops;
11267 Copy(proto_perl->Itokenbuf, PL_tokenbuf, 256, char);
11270 PL_cshlen = proto_perl->Icshlen;
11271 PL_cshname = proto_perl->Icshname; /* XXX never deallocated */
11274 PL_lex_state = proto_perl->Ilex_state;
11275 PL_lex_defer = proto_perl->Ilex_defer;
11276 PL_lex_expect = proto_perl->Ilex_expect;
11277 PL_lex_formbrack = proto_perl->Ilex_formbrack;
11278 PL_lex_dojoin = proto_perl->Ilex_dojoin;
11279 PL_lex_starts = proto_perl->Ilex_starts;
11280 PL_lex_stuff = sv_dup_inc(proto_perl->Ilex_stuff, param);
11281 PL_lex_repl = sv_dup_inc(proto_perl->Ilex_repl, param);
11282 PL_lex_op = proto_perl->Ilex_op;
11283 PL_lex_inpat = proto_perl->Ilex_inpat;
11284 PL_lex_inwhat = proto_perl->Ilex_inwhat;
11285 PL_lex_brackets = proto_perl->Ilex_brackets;
11286 i = (PL_lex_brackets < 120 ? 120 : PL_lex_brackets);
11287 PL_lex_brackstack = SAVEPVN(proto_perl->Ilex_brackstack,i);
11288 PL_lex_casemods = proto_perl->Ilex_casemods;
11289 i = (PL_lex_casemods < 12 ? 12 : PL_lex_casemods);
11290 PL_lex_casestack = SAVEPVN(proto_perl->Ilex_casestack,i);
11292 Copy(proto_perl->Inextval, PL_nextval, 5, YYSTYPE);
11293 Copy(proto_perl->Inexttype, PL_nexttype, 5, I32);
11294 PL_nexttoke = proto_perl->Inexttoke;
11296 /* XXX This is probably masking the deeper issue of why
11297 * SvANY(proto_perl->Ilinestr) can be NULL at this point. For test case:
11298 * http://archive.develooper.com/perl5-porters%40perl.org/msg83298.html
11299 * (A little debugging with a watchpoint on it may help.)
11301 if (SvANY(proto_perl->Ilinestr)) {
11302 PL_linestr = sv_dup_inc(proto_perl->Ilinestr, param);
11303 i = proto_perl->Ibufptr - SvPVX(proto_perl->Ilinestr);
11304 PL_bufptr = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
11305 i = proto_perl->Ioldbufptr - SvPVX(proto_perl->Ilinestr);
11306 PL_oldbufptr = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
11307 i = proto_perl->Ioldoldbufptr - SvPVX(proto_perl->Ilinestr);
11308 PL_oldoldbufptr = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
11309 i = proto_perl->Ilinestart - SvPVX(proto_perl->Ilinestr);
11310 PL_linestart = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
11313 PL_linestr = NEWSV(65,79);
11314 sv_upgrade(PL_linestr,SVt_PVIV);
11315 sv_setpvn(PL_linestr,"",0);
11316 PL_bufptr = PL_oldbufptr = PL_oldoldbufptr = PL_linestart = SvPVX(PL_linestr);
11318 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
11319 PL_pending_ident = proto_perl->Ipending_ident;
11320 PL_sublex_info = proto_perl->Isublex_info; /* XXX not quite right */
11322 PL_expect = proto_perl->Iexpect;
11324 PL_multi_start = proto_perl->Imulti_start;
11325 PL_multi_end = proto_perl->Imulti_end;
11326 PL_multi_open = proto_perl->Imulti_open;
11327 PL_multi_close = proto_perl->Imulti_close;
11329 PL_error_count = proto_perl->Ierror_count;
11330 PL_subline = proto_perl->Isubline;
11331 PL_subname = sv_dup_inc(proto_perl->Isubname, param);
11333 /* XXX See comment on SvANY(proto_perl->Ilinestr) above */
11334 if (SvANY(proto_perl->Ilinestr)) {
11335 i = proto_perl->Ilast_uni - SvPVX(proto_perl->Ilinestr);
11336 PL_last_uni = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
11337 i = proto_perl->Ilast_lop - SvPVX(proto_perl->Ilinestr);
11338 PL_last_lop = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
11339 PL_last_lop_op = proto_perl->Ilast_lop_op;
11342 PL_last_uni = SvPVX(PL_linestr);
11343 PL_last_lop = SvPVX(PL_linestr);
11344 PL_last_lop_op = 0;
11346 PL_in_my = proto_perl->Iin_my;
11347 PL_in_my_stash = hv_dup(proto_perl->Iin_my_stash, param);
11349 PL_cryptseen = proto_perl->Icryptseen;
11352 PL_hints = proto_perl->Ihints;
11354 PL_amagic_generation = proto_perl->Iamagic_generation;
11356 #ifdef USE_LOCALE_COLLATE
11357 PL_collation_ix = proto_perl->Icollation_ix;
11358 PL_collation_name = SAVEPV(proto_perl->Icollation_name);
11359 PL_collation_standard = proto_perl->Icollation_standard;
11360 PL_collxfrm_base = proto_perl->Icollxfrm_base;
11361 PL_collxfrm_mult = proto_perl->Icollxfrm_mult;
11362 #endif /* USE_LOCALE_COLLATE */
11364 #ifdef USE_LOCALE_NUMERIC
11365 PL_numeric_name = SAVEPV(proto_perl->Inumeric_name);
11366 PL_numeric_standard = proto_perl->Inumeric_standard;
11367 PL_numeric_local = proto_perl->Inumeric_local;
11368 PL_numeric_radix_sv = sv_dup_inc(proto_perl->Inumeric_radix_sv, param);
11369 #endif /* !USE_LOCALE_NUMERIC */
11371 /* utf8 character classes */
11372 PL_utf8_alnum = sv_dup_inc(proto_perl->Iutf8_alnum, param);
11373 PL_utf8_alnumc = sv_dup_inc(proto_perl->Iutf8_alnumc, param);
11374 PL_utf8_ascii = sv_dup_inc(proto_perl->Iutf8_ascii, param);
11375 PL_utf8_alpha = sv_dup_inc(proto_perl->Iutf8_alpha, param);
11376 PL_utf8_space = sv_dup_inc(proto_perl->Iutf8_space, param);
11377 PL_utf8_cntrl = sv_dup_inc(proto_perl->Iutf8_cntrl, param);
11378 PL_utf8_graph = sv_dup_inc(proto_perl->Iutf8_graph, param);
11379 PL_utf8_digit = sv_dup_inc(proto_perl->Iutf8_digit, param);
11380 PL_utf8_upper = sv_dup_inc(proto_perl->Iutf8_upper, param);
11381 PL_utf8_lower = sv_dup_inc(proto_perl->Iutf8_lower, param);
11382 PL_utf8_print = sv_dup_inc(proto_perl->Iutf8_print, param);
11383 PL_utf8_punct = sv_dup_inc(proto_perl->Iutf8_punct, param);
11384 PL_utf8_xdigit = sv_dup_inc(proto_perl->Iutf8_xdigit, param);
11385 PL_utf8_mark = sv_dup_inc(proto_perl->Iutf8_mark, param);
11386 PL_utf8_toupper = sv_dup_inc(proto_perl->Iutf8_toupper, param);
11387 PL_utf8_totitle = sv_dup_inc(proto_perl->Iutf8_totitle, param);
11388 PL_utf8_tolower = sv_dup_inc(proto_perl->Iutf8_tolower, param);
11389 PL_utf8_tofold = sv_dup_inc(proto_perl->Iutf8_tofold, param);
11390 PL_utf8_idstart = sv_dup_inc(proto_perl->Iutf8_idstart, param);
11391 PL_utf8_idcont = sv_dup_inc(proto_perl->Iutf8_idcont, param);
11393 /* Did the locale setup indicate UTF-8? */
11394 PL_utf8locale = proto_perl->Iutf8locale;
11395 /* Unicode features (see perlrun/-C) */
11396 PL_unicode = proto_perl->Iunicode;
11398 /* Pre-5.8 signals control */
11399 PL_signals = proto_perl->Isignals;
11401 /* times() ticks per second */
11402 PL_clocktick = proto_perl->Iclocktick;
11404 /* Recursion stopper for PerlIO_find_layer */
11405 PL_in_load_module = proto_perl->Iin_load_module;
11407 /* sort() routine */
11408 PL_sort_RealCmp = proto_perl->Isort_RealCmp;
11410 /* Not really needed/useful since the reenrant_retint is "volatile",
11411 * but do it for consistency's sake. */
11412 PL_reentrant_retint = proto_perl->Ireentrant_retint;
11414 /* Hooks to shared SVs and locks. */
11415 PL_sharehook = proto_perl->Isharehook;
11416 PL_lockhook = proto_perl->Ilockhook;
11417 PL_unlockhook = proto_perl->Iunlockhook;
11418 PL_threadhook = proto_perl->Ithreadhook;
11420 PL_runops_std = proto_perl->Irunops_std;
11421 PL_runops_dbg = proto_perl->Irunops_dbg;
11423 #ifdef THREADS_HAVE_PIDS
11424 PL_ppid = proto_perl->Ippid;
11428 PL_last_swash_hv = Nullhv; /* reinits on demand */
11429 PL_last_swash_klen = 0;
11430 PL_last_swash_key[0]= '\0';
11431 PL_last_swash_tmps = (U8*)NULL;
11432 PL_last_swash_slen = 0;
11434 /* perly.c globals */
11435 PL_yydebug = proto_perl->Iyydebug;
11436 PL_yynerrs = proto_perl->Iyynerrs;
11437 PL_yyerrflag = proto_perl->Iyyerrflag;
11438 PL_yychar = proto_perl->Iyychar;
11439 PL_yyval = proto_perl->Iyyval;
11440 PL_yylval = proto_perl->Iyylval;
11442 PL_glob_index = proto_perl->Iglob_index;
11443 PL_srand_called = proto_perl->Isrand_called;
11444 PL_hash_seed = proto_perl->Ihash_seed;
11445 PL_rehash_seed = proto_perl->Irehash_seed;
11446 PL_uudmap['M'] = 0; /* reinits on demand */
11447 PL_bitcount = Nullch; /* reinits on demand */
11449 if (proto_perl->Ipsig_pend) {
11450 Newz(0, PL_psig_pend, SIG_SIZE, int);
11453 PL_psig_pend = (int*)NULL;
11456 if (proto_perl->Ipsig_ptr) {
11457 Newz(0, PL_psig_ptr, SIG_SIZE, SV*);
11458 Newz(0, PL_psig_name, SIG_SIZE, SV*);
11459 for (i = 1; i < SIG_SIZE; i++) {
11460 PL_psig_ptr[i] = sv_dup_inc(proto_perl->Ipsig_ptr[i], param);
11461 PL_psig_name[i] = sv_dup_inc(proto_perl->Ipsig_name[i], param);
11465 PL_psig_ptr = (SV**)NULL;
11466 PL_psig_name = (SV**)NULL;
11469 /* thrdvar.h stuff */
11471 if (flags & CLONEf_COPY_STACKS) {
11472 /* next allocation will be PL_tmps_stack[PL_tmps_ix+1] */
11473 PL_tmps_ix = proto_perl->Ttmps_ix;
11474 PL_tmps_max = proto_perl->Ttmps_max;
11475 PL_tmps_floor = proto_perl->Ttmps_floor;
11476 Newz(50, PL_tmps_stack, PL_tmps_max, SV*);
11478 while (i <= PL_tmps_ix) {
11479 PL_tmps_stack[i] = sv_dup_inc(proto_perl->Ttmps_stack[i], param);
11483 /* next PUSHMARK() sets *(PL_markstack_ptr+1) */
11484 i = proto_perl->Tmarkstack_max - proto_perl->Tmarkstack;
11485 Newz(54, PL_markstack, i, I32);
11486 PL_markstack_max = PL_markstack + (proto_perl->Tmarkstack_max
11487 - proto_perl->Tmarkstack);
11488 PL_markstack_ptr = PL_markstack + (proto_perl->Tmarkstack_ptr
11489 - proto_perl->Tmarkstack);
11490 Copy(proto_perl->Tmarkstack, PL_markstack,
11491 PL_markstack_ptr - PL_markstack + 1, I32);
11493 /* next push_scope()/ENTER sets PL_scopestack[PL_scopestack_ix]
11494 * NOTE: unlike the others! */
11495 PL_scopestack_ix = proto_perl->Tscopestack_ix;
11496 PL_scopestack_max = proto_perl->Tscopestack_max;
11497 Newz(54, PL_scopestack, PL_scopestack_max, I32);
11498 Copy(proto_perl->Tscopestack, PL_scopestack, PL_scopestack_ix, I32);
11500 /* next push_return() sets PL_retstack[PL_retstack_ix]
11501 * NOTE: unlike the others! */
11502 PL_retstack_ix = proto_perl->Tretstack_ix;
11503 PL_retstack_max = proto_perl->Tretstack_max;
11504 Newz(54, PL_retstack, PL_retstack_max, OP*);
11505 Copy(proto_perl->Tretstack, PL_retstack, PL_retstack_ix, OP*);
11507 /* NOTE: si_dup() looks at PL_markstack */
11508 PL_curstackinfo = si_dup(proto_perl->Tcurstackinfo, param);
11510 /* PL_curstack = PL_curstackinfo->si_stack; */
11511 PL_curstack = av_dup(proto_perl->Tcurstack, param);
11512 PL_mainstack = av_dup(proto_perl->Tmainstack, param);
11514 /* next PUSHs() etc. set *(PL_stack_sp+1) */
11515 PL_stack_base = AvARRAY(PL_curstack);
11516 PL_stack_sp = PL_stack_base + (proto_perl->Tstack_sp
11517 - proto_perl->Tstack_base);
11518 PL_stack_max = PL_stack_base + AvMAX(PL_curstack);
11520 /* next SSPUSHFOO() sets PL_savestack[PL_savestack_ix]
11521 * NOTE: unlike the others! */
11522 PL_savestack_ix = proto_perl->Tsavestack_ix;
11523 PL_savestack_max = proto_perl->Tsavestack_max;
11524 /*Newz(54, PL_savestack, PL_savestack_max, ANY);*/
11525 PL_savestack = ss_dup(proto_perl, param);
11529 ENTER; /* perl_destruct() wants to LEAVE; */
11532 PL_start_env = proto_perl->Tstart_env; /* XXXXXX */
11533 PL_top_env = &PL_start_env;
11535 PL_op = proto_perl->Top;
11538 PL_Xpv = (XPV*)NULL;
11539 PL_na = proto_perl->Tna;
11541 PL_statbuf = proto_perl->Tstatbuf;
11542 PL_statcache = proto_perl->Tstatcache;
11543 PL_statgv = gv_dup(proto_perl->Tstatgv, param);
11544 PL_statname = sv_dup_inc(proto_perl->Tstatname, param);
11546 PL_timesbuf = proto_perl->Ttimesbuf;
11549 PL_tainted = proto_perl->Ttainted;
11550 PL_curpm = proto_perl->Tcurpm; /* XXX No PMOP ref count */
11551 PL_rs = sv_dup_inc(proto_perl->Trs, param);
11552 PL_last_in_gv = gv_dup(proto_perl->Tlast_in_gv, param);
11553 PL_ofs_sv = sv_dup_inc(proto_perl->Tofs_sv, param);
11554 PL_defoutgv = gv_dup_inc(proto_perl->Tdefoutgv, param);
11555 PL_chopset = proto_perl->Tchopset; /* XXX never deallocated */
11556 PL_toptarget = sv_dup_inc(proto_perl->Ttoptarget, param);
11557 PL_bodytarget = sv_dup_inc(proto_perl->Tbodytarget, param);
11558 PL_formtarget = sv_dup(proto_perl->Tformtarget, param);
11560 PL_restartop = proto_perl->Trestartop;
11561 PL_in_eval = proto_perl->Tin_eval;
11562 PL_delaymagic = proto_perl->Tdelaymagic;
11563 PL_dirty = proto_perl->Tdirty;
11564 PL_localizing = proto_perl->Tlocalizing;
11566 #ifdef PERL_FLEXIBLE_EXCEPTIONS
11567 PL_protect = proto_perl->Tprotect;
11569 PL_errors = sv_dup_inc(proto_perl->Terrors, param);
11570 PL_hv_fetch_ent_mh = Nullhe;
11571 PL_modcount = proto_perl->Tmodcount;
11572 PL_lastgotoprobe = Nullop;
11573 PL_dumpindent = proto_perl->Tdumpindent;
11575 PL_sortcop = (OP*)any_dup(proto_perl->Tsortcop, proto_perl);
11576 PL_sortstash = hv_dup(proto_perl->Tsortstash, param);
11577 PL_firstgv = gv_dup(proto_perl->Tfirstgv, param);
11578 PL_secondgv = gv_dup(proto_perl->Tsecondgv, param);
11579 PL_sortcxix = proto_perl->Tsortcxix;
11580 PL_efloatbuf = Nullch; /* reinits on demand */
11581 PL_efloatsize = 0; /* reinits on demand */
11585 PL_screamfirst = NULL;
11586 PL_screamnext = NULL;
11587 PL_maxscream = -1; /* reinits on demand */
11588 PL_lastscream = Nullsv;
11590 PL_watchaddr = NULL;
11591 PL_watchok = Nullch;
11593 PL_regdummy = proto_perl->Tregdummy;
11594 PL_regprecomp = Nullch;
11597 PL_colorset = 0; /* reinits PL_colors[] */
11598 /*PL_colors[6] = {0,0,0,0,0,0};*/
11599 PL_reginput = Nullch;
11600 PL_regbol = Nullch;
11601 PL_regeol = Nullch;
11602 PL_regstartp = (I32*)NULL;
11603 PL_regendp = (I32*)NULL;
11604 PL_reglastparen = (U32*)NULL;
11605 PL_reglastcloseparen = (U32*)NULL;
11606 PL_regtill = Nullch;
11607 PL_reg_start_tmp = (char**)NULL;
11608 PL_reg_start_tmpl = 0;
11609 PL_regdata = (struct reg_data*)NULL;
11612 PL_reg_eval_set = 0;
11614 PL_regprogram = (regnode*)NULL;
11616 PL_regcc = (CURCUR*)NULL;
11617 PL_reg_call_cc = (struct re_cc_state*)NULL;
11618 PL_reg_re = (regexp*)NULL;
11619 PL_reg_ganch = Nullch;
11620 PL_reg_sv = Nullsv;
11621 PL_reg_match_utf8 = FALSE;
11622 PL_reg_magic = (MAGIC*)NULL;
11624 PL_reg_oldcurpm = (PMOP*)NULL;
11625 PL_reg_curpm = (PMOP*)NULL;
11626 PL_reg_oldsaved = Nullch;
11627 PL_reg_oldsavedlen = 0;
11628 #ifdef PERL_COPY_ON_WRITE
11631 PL_reg_maxiter = 0;
11632 PL_reg_leftiter = 0;
11633 PL_reg_poscache = Nullch;
11634 PL_reg_poscache_size= 0;
11636 /* RE engine - function pointers */
11637 PL_regcompp = proto_perl->Tregcompp;
11638 PL_regexecp = proto_perl->Tregexecp;
11639 PL_regint_start = proto_perl->Tregint_start;
11640 PL_regint_string = proto_perl->Tregint_string;
11641 PL_regfree = proto_perl->Tregfree;
11643 PL_reginterp_cnt = 0;
11644 PL_reg_starttry = 0;
11646 /* Pluggable optimizer */
11647 PL_peepp = proto_perl->Tpeepp;
11649 PL_stashcache = newHV();
11651 if (!(flags & CLONEf_KEEP_PTR_TABLE)) {
11652 ptr_table_free(PL_ptr_table);
11653 PL_ptr_table = NULL;
11656 /* Call the ->CLONE method, if it exists, for each of the stashes
11657 identified by sv_dup() above.
11659 while(av_len(param->stashes) != -1) {
11660 HV* stash = (HV*) av_shift(param->stashes);
11661 GV* cloner = gv_fetchmethod_autoload(stash, "CLONE", 0);
11662 if (cloner && GvCV(cloner)) {
11667 XPUSHs(sv_2mortal(newSVpv(HvNAME(stash), 0)));
11669 call_sv((SV*)GvCV(cloner), G_DISCARD);
11675 SvREFCNT_dec(param->stashes);
11680 #endif /* USE_ITHREADS */
11683 =head1 Unicode Support
11685 =for apidoc sv_recode_to_utf8
11687 The encoding is assumed to be an Encode object, on entry the PV
11688 of the sv is assumed to be octets in that encoding, and the sv
11689 will be converted into Unicode (and UTF-8).
11691 If the sv already is UTF-8 (or if it is not POK), or if the encoding
11692 is not a reference, nothing is done to the sv. If the encoding is not
11693 an C<Encode::XS> Encoding object, bad things will happen.
11694 (See F<lib/encoding.pm> and L<Encode>).
11696 The PV of the sv is returned.
11701 Perl_sv_recode_to_utf8(pTHX_ SV *sv, SV *encoding)
11703 if (SvPOK(sv) && !SvUTF8(sv) && !IN_BYTES && SvROK(encoding)) {
11717 Passing sv_yes is wrong - it needs to be or'ed set of constants
11718 for Encode::XS, while UTf-8 decode (currently) assumes a true value means
11719 remove converted chars from source.
11721 Both will default the value - let them.
11723 XPUSHs(&PL_sv_yes);
11726 call_method("decode", G_SCALAR);
11730 s = SvPV(uni, len);
11731 if (s != SvPVX(sv)) {
11732 SvGROW(sv, len + 1);
11733 Move(s, SvPVX(sv), len, char);
11734 SvCUR_set(sv, len);
11735 SvPVX(sv)[len] = 0;
11745 =for apidoc sv_cat_decode
11747 The encoding is assumed to be an Encode object, the PV of the ssv is
11748 assumed to be octets in that encoding and decoding the input starts
11749 from the position which (PV + *offset) pointed to. The dsv will be
11750 concatenated the decoded UTF-8 string from ssv. Decoding will terminate
11751 when the string tstr appears in decoding output or the input ends on
11752 the PV of the ssv. The value which the offset points will be modified
11753 to the last input position on the ssv.
11755 Returns TRUE if the terminator was found, else returns FALSE.
11760 Perl_sv_cat_decode(pTHX_ SV *dsv, SV *encoding,
11761 SV *ssv, int *offset, char *tstr, int tlen)
11764 if (SvPOK(ssv) && SvPOK(dsv) && SvROK(encoding) && offset) {
11775 XPUSHs(offsv = sv_2mortal(newSViv(*offset)));
11776 XPUSHs(sv_2mortal(newSVpvn(tstr, tlen)));
11778 call_method("cat_decode", G_SCALAR);
11780 ret = SvTRUE(TOPs);
11781 *offset = SvIV(offsv);
11787 Perl_croak(aTHX_ "Invalid argument to sv_cat_decode");