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;
1465 SvANY(sv) = new_XPVAV();
1473 SvMAGIC(sv) = magic;
1474 SvSTASH(sv) = stash;
1480 SvANY(sv) = new_XPVHV();
1486 HvTOTALKEYS(sv) = 0;
1487 HvPLACEHOLDERS(sv) = 0;
1488 SvMAGIC(sv) = magic;
1489 SvSTASH(sv) = stash;
1496 SvANY(sv) = new_XPVCV();
1497 Zero(SvANY(sv), 1, XPVCV);
1503 SvMAGIC(sv) = magic;
1504 SvSTASH(sv) = stash;
1507 SvANY(sv) = new_XPVGV();
1513 SvMAGIC(sv) = magic;
1514 SvSTASH(sv) = stash;
1522 SvANY(sv) = new_XPVBM();
1528 SvMAGIC(sv) = magic;
1529 SvSTASH(sv) = stash;
1535 SvANY(sv) = new_XPVFM();
1536 Zero(SvANY(sv), 1, XPVFM);
1542 SvMAGIC(sv) = magic;
1543 SvSTASH(sv) = stash;
1546 SvANY(sv) = new_XPVIO();
1547 Zero(SvANY(sv), 1, XPVIO);
1553 SvMAGIC(sv) = magic;
1554 SvSTASH(sv) = stash;
1555 IoPAGE_LEN(sv) = 60;
1558 SvFLAGS(sv) &= ~SVTYPEMASK;
1564 =for apidoc sv_backoff
1566 Remove any string offset. You should normally use the C<SvOOK_off> macro
1573 Perl_sv_backoff(pTHX_ register SV *sv)
1577 char *s = SvPVX(sv);
1578 SvLEN(sv) += SvIVX(sv);
1579 SvPVX(sv) -= SvIVX(sv);
1581 Move(s, SvPVX(sv), SvCUR(sv)+1, char);
1583 SvFLAGS(sv) &= ~SVf_OOK;
1590 Expands the character buffer in the SV. If necessary, uses C<sv_unref> and
1591 upgrades the SV to C<SVt_PV>. Returns a pointer to the character buffer.
1592 Use the C<SvGROW> wrapper instead.
1598 Perl_sv_grow(pTHX_ register SV *sv, register STRLEN newlen)
1602 #ifdef HAS_64K_LIMIT
1603 if (newlen >= 0x10000) {
1604 PerlIO_printf(Perl_debug_log,
1605 "Allocation too large: %"UVxf"\n", (UV)newlen);
1608 #endif /* HAS_64K_LIMIT */
1611 if (SvTYPE(sv) < SVt_PV) {
1612 sv_upgrade(sv, SVt_PV);
1615 else if (SvOOK(sv)) { /* pv is offset? */
1618 if (newlen > SvLEN(sv))
1619 newlen += 10 * (newlen - SvCUR(sv)); /* avoid copy each time */
1620 #ifdef HAS_64K_LIMIT
1621 if (newlen >= 0x10000)
1628 if (newlen > SvLEN(sv)) { /* need more room? */
1629 if (SvLEN(sv) && s) {
1631 STRLEN l = malloced_size((void*)SvPVX(sv));
1637 Renew(s,newlen,char);
1640 New(703, s, newlen, char);
1641 if (SvPVX(sv) && SvCUR(sv)) {
1642 Move(SvPVX(sv), s, (newlen < SvCUR(sv)) ? newlen : SvCUR(sv), char);
1646 SvLEN_set(sv, newlen);
1652 =for apidoc sv_setiv
1654 Copies an integer into the given SV, upgrading first if necessary.
1655 Does not handle 'set' magic. See also C<sv_setiv_mg>.
1661 Perl_sv_setiv(pTHX_ register SV *sv, IV i)
1663 SV_CHECK_THINKFIRST_COW_DROP(sv);
1664 switch (SvTYPE(sv)) {
1666 sv_upgrade(sv, SVt_IV);
1669 sv_upgrade(sv, SVt_PVNV);
1673 sv_upgrade(sv, SVt_PVIV);
1682 Perl_croak(aTHX_ "Can't coerce %s to integer in %s", sv_reftype(sv,0),
1685 (void)SvIOK_only(sv); /* validate number */
1691 =for apidoc sv_setiv_mg
1693 Like C<sv_setiv>, but also handles 'set' magic.
1699 Perl_sv_setiv_mg(pTHX_ register SV *sv, IV i)
1706 =for apidoc sv_setuv
1708 Copies an unsigned integer into the given SV, upgrading first if necessary.
1709 Does not handle 'set' magic. See also C<sv_setuv_mg>.
1715 Perl_sv_setuv(pTHX_ register SV *sv, UV u)
1717 /* With these two if statements:
1718 u=1.49 s=0.52 cu=72.49 cs=10.64 scripts=270 tests=20865
1721 u=1.35 s=0.47 cu=73.45 cs=11.43 scripts=270 tests=20865
1723 If you wish to remove them, please benchmark to see what the effect is
1725 if (u <= (UV)IV_MAX) {
1726 sv_setiv(sv, (IV)u);
1735 =for apidoc sv_setuv_mg
1737 Like C<sv_setuv>, but also handles 'set' magic.
1743 Perl_sv_setuv_mg(pTHX_ register SV *sv, UV u)
1745 /* With these two if statements:
1746 u=1.49 s=0.52 cu=72.49 cs=10.64 scripts=270 tests=20865
1749 u=1.35 s=0.47 cu=73.45 cs=11.43 scripts=270 tests=20865
1751 If you wish to remove them, please benchmark to see what the effect is
1753 if (u <= (UV)IV_MAX) {
1754 sv_setiv(sv, (IV)u);
1764 =for apidoc sv_setnv
1766 Copies a double into the given SV, upgrading first if necessary.
1767 Does not handle 'set' magic. See also C<sv_setnv_mg>.
1773 Perl_sv_setnv(pTHX_ register SV *sv, NV num)
1775 SV_CHECK_THINKFIRST_COW_DROP(sv);
1776 switch (SvTYPE(sv)) {
1779 sv_upgrade(sv, SVt_NV);
1784 sv_upgrade(sv, SVt_PVNV);
1793 Perl_croak(aTHX_ "Can't coerce %s to number in %s", sv_reftype(sv,0),
1797 (void)SvNOK_only(sv); /* validate number */
1802 =for apidoc sv_setnv_mg
1804 Like C<sv_setnv>, but also handles 'set' magic.
1810 Perl_sv_setnv_mg(pTHX_ register SV *sv, NV num)
1816 /* Print an "isn't numeric" warning, using a cleaned-up,
1817 * printable version of the offending string
1821 S_not_a_number(pTHX_ SV *sv)
1828 dsv = sv_2mortal(newSVpv("", 0));
1829 pv = sv_uni_display(dsv, sv, 10, 0);
1832 char *limit = tmpbuf + sizeof(tmpbuf) - 8;
1833 /* each *s can expand to 4 chars + "...\0",
1834 i.e. need room for 8 chars */
1837 for (s = SvPVX(sv), end = s + SvCUR(sv); s < end && d < limit; s++) {
1839 if (ch & 128 && !isPRINT_LC(ch)) {
1848 else if (ch == '\r') {
1852 else if (ch == '\f') {
1856 else if (ch == '\\') {
1860 else if (ch == '\0') {
1864 else if (isPRINT_LC(ch))
1881 Perl_warner(aTHX_ packWARN(WARN_NUMERIC),
1882 "Argument \"%s\" isn't numeric in %s", pv,
1885 Perl_warner(aTHX_ packWARN(WARN_NUMERIC),
1886 "Argument \"%s\" isn't numeric", pv);
1890 =for apidoc looks_like_number
1892 Test if the content of an SV looks like a number (or is a number).
1893 C<Inf> and C<Infinity> are treated as numbers (so will not issue a
1894 non-numeric warning), even if your atof() doesn't grok them.
1900 Perl_looks_like_number(pTHX_ SV *sv)
1902 register char *sbegin;
1909 else if (SvPOKp(sv))
1910 sbegin = SvPV(sv, len);
1912 return 1; /* Historic. Wrong? */
1913 return grok_number(sbegin, len, NULL);
1916 /* Actually, ISO C leaves conversion of UV to IV undefined, but
1917 until proven guilty, assume that things are not that bad... */
1922 As 64 bit platforms often have an NV that doesn't preserve all bits of
1923 an IV (an assumption perl has been based on to date) it becomes necessary
1924 to remove the assumption that the NV always carries enough precision to
1925 recreate the IV whenever needed, and that the NV is the canonical form.
1926 Instead, IV/UV and NV need to be given equal rights. So as to not lose
1927 precision as a side effect of conversion (which would lead to insanity
1928 and the dragon(s) in t/op/numconvert.t getting very angry) the intent is
1929 1) to distinguish between IV/UV/NV slots that have cached a valid
1930 conversion where precision was lost and IV/UV/NV slots that have a
1931 valid conversion which has lost no precision
1932 2) to ensure that if a numeric conversion to one form is requested that
1933 would lose precision, the precise conversion (or differently
1934 imprecise conversion) is also performed and cached, to prevent
1935 requests for different numeric formats on the same SV causing
1936 lossy conversion chains. (lossless conversion chains are perfectly
1941 SvIOKp is true if the IV slot contains a valid value
1942 SvIOK is true only if the IV value is accurate (UV if SvIOK_UV true)
1943 SvNOKp is true if the NV slot contains a valid value
1944 SvNOK is true only if the NV value is accurate
1947 while converting from PV to NV, check to see if converting that NV to an
1948 IV(or UV) would lose accuracy over a direct conversion from PV to
1949 IV(or UV). If it would, cache both conversions, return NV, but mark
1950 SV as IOK NOKp (ie not NOK).
1952 While converting from PV to IV, check to see if converting that IV to an
1953 NV would lose accuracy over a direct conversion from PV to NV. If it
1954 would, cache both conversions, flag similarly.
1956 Before, the SV value "3.2" could become NV=3.2 IV=3 NOK, IOK quite
1957 correctly because if IV & NV were set NV *always* overruled.
1958 Now, "3.2" will become NV=3.2 IV=3 NOK, IOKp, because the flag's meaning
1959 changes - now IV and NV together means that the two are interchangeable:
1960 SvIVX == (IV) SvNVX && SvNVX == (NV) SvIVX;
1962 The benefit of this is that operations such as pp_add know that if
1963 SvIOK is true for both left and right operands, then integer addition
1964 can be used instead of floating point (for cases where the result won't
1965 overflow). Before, floating point was always used, which could lead to
1966 loss of precision compared with integer addition.
1968 * making IV and NV equal status should make maths accurate on 64 bit
1970 * may speed up maths somewhat if pp_add and friends start to use
1971 integers when possible instead of fp. (Hopefully the overhead in
1972 looking for SvIOK and checking for overflow will not outweigh the
1973 fp to integer speedup)
1974 * will slow down integer operations (callers of SvIV) on "inaccurate"
1975 values, as the change from SvIOK to SvIOKp will cause a call into
1976 sv_2iv each time rather than a macro access direct to the IV slot
1977 * should speed up number->string conversion on integers as IV is
1978 favoured when IV and NV are equally accurate
1980 ####################################################################
1981 You had better be using SvIOK_notUV if you want an IV for arithmetic:
1982 SvIOK is true if (IV or UV), so you might be getting (IV)SvUV.
1983 On the other hand, SvUOK is true iff UV.
1984 ####################################################################
1986 Your mileage will vary depending your CPU's relative fp to integer
1990 #ifndef NV_PRESERVES_UV
1991 # define IS_NUMBER_UNDERFLOW_IV 1
1992 # define IS_NUMBER_UNDERFLOW_UV 2
1993 # define IS_NUMBER_IV_AND_UV 2
1994 # define IS_NUMBER_OVERFLOW_IV 4
1995 # define IS_NUMBER_OVERFLOW_UV 5
1997 /* sv_2iuv_non_preserve(): private routine for use by sv_2iv() and sv_2uv() */
1999 /* For sv_2nv these three cases are "SvNOK and don't bother casting" */
2001 S_sv_2iuv_non_preserve(pTHX_ register SV *sv, I32 numtype)
2003 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));
2004 if (SvNVX(sv) < (NV)IV_MIN) {
2005 (void)SvIOKp_on(sv);
2008 return IS_NUMBER_UNDERFLOW_IV;
2010 if (SvNVX(sv) > (NV)UV_MAX) {
2011 (void)SvIOKp_on(sv);
2015 return IS_NUMBER_OVERFLOW_UV;
2017 (void)SvIOKp_on(sv);
2019 /* Can't use strtol etc to convert this string. (See truth table in
2021 if (SvNVX(sv) <= (UV)IV_MAX) {
2022 SvIVX(sv) = I_V(SvNVX(sv));
2023 if ((NV)(SvIVX(sv)) == SvNVX(sv)) {
2024 SvIOK_on(sv); /* Integer is precise. NOK, IOK */
2026 /* Integer is imprecise. NOK, IOKp */
2028 return SvNVX(sv) < 0 ? IS_NUMBER_UNDERFLOW_UV : IS_NUMBER_IV_AND_UV;
2031 SvUVX(sv) = U_V(SvNVX(sv));
2032 if ((NV)(SvUVX(sv)) == SvNVX(sv)) {
2033 if (SvUVX(sv) == UV_MAX) {
2034 /* As we know that NVs don't preserve UVs, UV_MAX cannot
2035 possibly be preserved by NV. Hence, it must be overflow.
2037 return IS_NUMBER_OVERFLOW_UV;
2039 SvIOK_on(sv); /* Integer is precise. NOK, UOK */
2041 /* Integer is imprecise. NOK, IOKp */
2043 return IS_NUMBER_OVERFLOW_IV;
2045 #endif /* !NV_PRESERVES_UV*/
2047 /* sv_2iv() is now a macro using Perl_sv_2iv_flags();
2048 * this function provided for binary compatibility only
2052 Perl_sv_2iv(pTHX_ register SV *sv)
2054 return sv_2iv_flags(sv, SV_GMAGIC);
2058 =for apidoc sv_2iv_flags
2060 Return the integer value of an SV, doing any necessary string
2061 conversion. If flags includes SV_GMAGIC, does an mg_get() first.
2062 Normally used via the C<SvIV(sv)> and C<SvIVx(sv)> macros.
2068 Perl_sv_2iv_flags(pTHX_ register SV *sv, I32 flags)
2072 if (SvGMAGICAL(sv)) {
2073 if (flags & SV_GMAGIC)
2078 return I_V(SvNVX(sv));
2080 if (SvPOKp(sv) && SvLEN(sv))
2083 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
2084 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
2090 if (SvTHINKFIRST(sv)) {
2093 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv,numer)) &&
2094 (!SvROK(tmpstr) || (SvRV(tmpstr) != SvRV(sv))))
2095 return SvIV(tmpstr);
2096 return PTR2IV(SvRV(sv));
2099 sv_force_normal_flags(sv, 0);
2101 if (SvREADONLY(sv) && !SvOK(sv)) {
2102 if (ckWARN(WARN_UNINITIALIZED))
2109 return (IV)(SvUVX(sv));
2116 /* erm. not sure. *should* never get NOKp (without NOK) from sv_2nv
2117 * without also getting a cached IV/UV from it at the same time
2118 * (ie PV->NV conversion should detect loss of accuracy and cache
2119 * IV or UV at same time to avoid this. NWC */
2121 if (SvTYPE(sv) == SVt_NV)
2122 sv_upgrade(sv, SVt_PVNV);
2124 (void)SvIOKp_on(sv); /* Must do this first, to clear any SvOOK */
2125 /* < not <= as for NV doesn't preserve UV, ((NV)IV_MAX+1) will almost
2126 certainly cast into the IV range at IV_MAX, whereas the correct
2127 answer is the UV IV_MAX +1. Hence < ensures that dodgy boundary
2129 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2130 SvIVX(sv) = I_V(SvNVX(sv));
2131 if (SvNVX(sv) == (NV) SvIVX(sv)
2132 #ifndef NV_PRESERVES_UV
2133 && (((UV)1 << NV_PRESERVES_UV_BITS) >
2134 (UV)(SvIVX(sv) > 0 ? SvIVX(sv) : -SvIVX(sv)))
2135 /* Don't flag it as "accurately an integer" if the number
2136 came from a (by definition imprecise) NV operation, and
2137 we're outside the range of NV integer precision */
2140 SvIOK_on(sv); /* Can this go wrong with rounding? NWC */
2141 DEBUG_c(PerlIO_printf(Perl_debug_log,
2142 "0x%"UVxf" iv(%"NVgf" => %"IVdf") (precise)\n",
2148 /* IV not precise. No need to convert from PV, as NV
2149 conversion would already have cached IV if it detected
2150 that PV->IV would be better than PV->NV->IV
2151 flags already correct - don't set public IOK. */
2152 DEBUG_c(PerlIO_printf(Perl_debug_log,
2153 "0x%"UVxf" iv(%"NVgf" => %"IVdf") (imprecise)\n",
2158 /* Can the above go wrong if SvIVX == IV_MIN and SvNVX < IV_MIN,
2159 but the cast (NV)IV_MIN rounds to a the value less (more
2160 negative) than IV_MIN which happens to be equal to SvNVX ??
2161 Analogous to 0xFFFFFFFFFFFFFFFF rounding up to NV (2**64) and
2162 NV rounding back to 0xFFFFFFFFFFFFFFFF, so UVX == UV(NVX) and
2163 (NV)UVX == NVX are both true, but the values differ. :-(
2164 Hopefully for 2s complement IV_MIN is something like
2165 0x8000000000000000 which will be exact. NWC */
2168 SvUVX(sv) = U_V(SvNVX(sv));
2170 (SvNVX(sv) == (NV) SvUVX(sv))
2171 #ifndef NV_PRESERVES_UV
2172 /* Make sure it's not 0xFFFFFFFFFFFFFFFF */
2173 /*&& (SvUVX(sv) != UV_MAX) irrelevant with code below */
2174 && (((UV)1 << NV_PRESERVES_UV_BITS) > SvUVX(sv))
2175 /* Don't flag it as "accurately an integer" if the number
2176 came from a (by definition imprecise) NV operation, and
2177 we're outside the range of NV integer precision */
2183 DEBUG_c(PerlIO_printf(Perl_debug_log,
2184 "0x%"UVxf" 2iv(%"UVuf" => %"IVdf") (as unsigned)\n",
2188 return (IV)SvUVX(sv);
2191 else if (SvPOKp(sv) && SvLEN(sv)) {
2193 int numtype = grok_number(SvPVX(sv), SvCUR(sv), &value);
2194 /* We want to avoid a possible problem when we cache an IV which
2195 may be later translated to an NV, and the resulting NV is not
2196 the same as the direct translation of the initial string
2197 (eg 123.456 can shortcut to the IV 123 with atol(), but we must
2198 be careful to ensure that the value with the .456 is around if the
2199 NV value is requested in the future).
2201 This means that if we cache such an IV, we need to cache the
2202 NV as well. Moreover, we trade speed for space, and do not
2203 cache the NV if we are sure it's not needed.
2206 /* SVt_PVNV is one higher than SVt_PVIV, hence this order */
2207 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2208 == IS_NUMBER_IN_UV) {
2209 /* It's definitely an integer, only upgrade to PVIV */
2210 if (SvTYPE(sv) < SVt_PVIV)
2211 sv_upgrade(sv, SVt_PVIV);
2213 } else if (SvTYPE(sv) < SVt_PVNV)
2214 sv_upgrade(sv, SVt_PVNV);
2216 /* If NV preserves UV then we only use the UV value if we know that
2217 we aren't going to call atof() below. If NVs don't preserve UVs
2218 then the value returned may have more precision than atof() will
2219 return, even though value isn't perfectly accurate. */
2220 if ((numtype & (IS_NUMBER_IN_UV
2221 #ifdef NV_PRESERVES_UV
2224 )) == IS_NUMBER_IN_UV) {
2225 /* This won't turn off the public IOK flag if it was set above */
2226 (void)SvIOKp_on(sv);
2228 if (!(numtype & IS_NUMBER_NEG)) {
2230 if (value <= (UV)IV_MAX) {
2231 SvIVX(sv) = (IV)value;
2237 /* 2s complement assumption */
2238 if (value <= (UV)IV_MIN) {
2239 SvIVX(sv) = -(IV)value;
2241 /* Too negative for an IV. This is a double upgrade, but
2242 I'm assuming it will be rare. */
2243 if (SvTYPE(sv) < SVt_PVNV)
2244 sv_upgrade(sv, SVt_PVNV);
2248 SvNVX(sv) = -(NV)value;
2253 /* For !NV_PRESERVES_UV and IS_NUMBER_IN_UV and IS_NUMBER_NOT_INT we
2254 will be in the previous block to set the IV slot, and the next
2255 block to set the NV slot. So no else here. */
2257 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2258 != IS_NUMBER_IN_UV) {
2259 /* It wasn't an (integer that doesn't overflow the UV). */
2260 SvNVX(sv) = Atof(SvPVX(sv));
2262 if (! numtype && ckWARN(WARN_NUMERIC))
2265 #if defined(USE_LONG_DOUBLE)
2266 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2iv(%" PERL_PRIgldbl ")\n",
2267 PTR2UV(sv), SvNVX(sv)));
2269 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2iv(%"NVgf")\n",
2270 PTR2UV(sv), SvNVX(sv)));
2274 #ifdef NV_PRESERVES_UV
2275 (void)SvIOKp_on(sv);
2277 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2278 SvIVX(sv) = I_V(SvNVX(sv));
2279 if ((NV)(SvIVX(sv)) == SvNVX(sv)) {
2282 /* Integer is imprecise. NOK, IOKp */
2284 /* UV will not work better than IV */
2286 if (SvNVX(sv) > (NV)UV_MAX) {
2288 /* Integer is inaccurate. NOK, IOKp, is UV */
2292 SvUVX(sv) = U_V(SvNVX(sv));
2293 /* 0xFFFFFFFFFFFFFFFF not an issue in here */
2294 if ((NV)(SvUVX(sv)) == SvNVX(sv)) {
2298 /* Integer is imprecise. NOK, IOKp, is UV */
2304 #else /* NV_PRESERVES_UV */
2305 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2306 == (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT)) {
2307 /* The IV slot will have been set from value returned by
2308 grok_number above. The NV slot has just been set using
2311 assert (SvIOKp(sv));
2313 if (((UV)1 << NV_PRESERVES_UV_BITS) >
2314 U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))) {
2315 /* Small enough to preserve all bits. */
2316 (void)SvIOKp_on(sv);
2318 SvIVX(sv) = I_V(SvNVX(sv));
2319 if ((NV)(SvIVX(sv)) == SvNVX(sv))
2321 /* Assumption: first non-preserved integer is < IV_MAX,
2322 this NV is in the preserved range, therefore: */
2323 if (!(U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))
2325 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);
2329 0 0 already failed to read UV.
2330 0 1 already failed to read UV.
2331 1 0 you won't get here in this case. IV/UV
2332 slot set, public IOK, Atof() unneeded.
2333 1 1 already read UV.
2334 so there's no point in sv_2iuv_non_preserve() attempting
2335 to use atol, strtol, strtoul etc. */
2336 if (sv_2iuv_non_preserve (sv, numtype)
2337 >= IS_NUMBER_OVERFLOW_IV)
2341 #endif /* NV_PRESERVES_UV */
2344 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing && !(SvFLAGS(sv) & SVs_PADTMP))
2346 if (SvTYPE(sv) < SVt_IV)
2347 /* Typically the caller expects that sv_any is not NULL now. */
2348 sv_upgrade(sv, SVt_IV);
2351 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2iv(%"IVdf")\n",
2352 PTR2UV(sv),SvIVX(sv)));
2353 return SvIsUV(sv) ? (IV)SvUVX(sv) : SvIVX(sv);
2356 /* sv_2uv() is now a macro using Perl_sv_2uv_flags();
2357 * this function provided for binary compatibility only
2361 Perl_sv_2uv(pTHX_ register SV *sv)
2363 return sv_2uv_flags(sv, SV_GMAGIC);
2367 =for apidoc sv_2uv_flags
2369 Return the unsigned integer value of an SV, doing any necessary string
2370 conversion. If flags includes SV_GMAGIC, does an mg_get() first.
2371 Normally used via the C<SvUV(sv)> and C<SvUVx(sv)> macros.
2377 Perl_sv_2uv_flags(pTHX_ register SV *sv, I32 flags)
2381 if (SvGMAGICAL(sv)) {
2382 if (flags & SV_GMAGIC)
2387 return U_V(SvNVX(sv));
2388 if (SvPOKp(sv) && SvLEN(sv))
2391 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
2392 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
2398 if (SvTHINKFIRST(sv)) {
2401 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv,numer)) &&
2402 (!SvROK(tmpstr) || (SvRV(tmpstr) != SvRV(sv))))
2403 return SvUV(tmpstr);
2404 return PTR2UV(SvRV(sv));
2407 sv_force_normal_flags(sv, 0);
2409 if (SvREADONLY(sv) && !SvOK(sv)) {
2410 if (ckWARN(WARN_UNINITIALIZED))
2420 return (UV)SvIVX(sv);
2424 /* erm. not sure. *should* never get NOKp (without NOK) from sv_2nv
2425 * without also getting a cached IV/UV from it at the same time
2426 * (ie PV->NV conversion should detect loss of accuracy and cache
2427 * IV or UV at same time to avoid this. */
2428 /* IV-over-UV optimisation - choose to cache IV if possible */
2430 if (SvTYPE(sv) == SVt_NV)
2431 sv_upgrade(sv, SVt_PVNV);
2433 (void)SvIOKp_on(sv); /* Must do this first, to clear any SvOOK */
2434 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2435 SvIVX(sv) = I_V(SvNVX(sv));
2436 if (SvNVX(sv) == (NV) SvIVX(sv)
2437 #ifndef NV_PRESERVES_UV
2438 && (((UV)1 << NV_PRESERVES_UV_BITS) >
2439 (UV)(SvIVX(sv) > 0 ? SvIVX(sv) : -SvIVX(sv)))
2440 /* Don't flag it as "accurately an integer" if the number
2441 came from a (by definition imprecise) NV operation, and
2442 we're outside the range of NV integer precision */
2445 SvIOK_on(sv); /* Can this go wrong with rounding? NWC */
2446 DEBUG_c(PerlIO_printf(Perl_debug_log,
2447 "0x%"UVxf" uv(%"NVgf" => %"IVdf") (precise)\n",
2453 /* IV not precise. No need to convert from PV, as NV
2454 conversion would already have cached IV if it detected
2455 that PV->IV would be better than PV->NV->IV
2456 flags already correct - don't set public IOK. */
2457 DEBUG_c(PerlIO_printf(Perl_debug_log,
2458 "0x%"UVxf" uv(%"NVgf" => %"IVdf") (imprecise)\n",
2463 /* Can the above go wrong if SvIVX == IV_MIN and SvNVX < IV_MIN,
2464 but the cast (NV)IV_MIN rounds to a the value less (more
2465 negative) than IV_MIN which happens to be equal to SvNVX ??
2466 Analogous to 0xFFFFFFFFFFFFFFFF rounding up to NV (2**64) and
2467 NV rounding back to 0xFFFFFFFFFFFFFFFF, so UVX == UV(NVX) and
2468 (NV)UVX == NVX are both true, but the values differ. :-(
2469 Hopefully for 2s complement IV_MIN is something like
2470 0x8000000000000000 which will be exact. NWC */
2473 SvUVX(sv) = U_V(SvNVX(sv));
2475 (SvNVX(sv) == (NV) SvUVX(sv))
2476 #ifndef NV_PRESERVES_UV
2477 /* Make sure it's not 0xFFFFFFFFFFFFFFFF */
2478 /*&& (SvUVX(sv) != UV_MAX) irrelevant with code below */
2479 && (((UV)1 << NV_PRESERVES_UV_BITS) > SvUVX(sv))
2480 /* Don't flag it as "accurately an integer" if the number
2481 came from a (by definition imprecise) NV operation, and
2482 we're outside the range of NV integer precision */
2487 DEBUG_c(PerlIO_printf(Perl_debug_log,
2488 "0x%"UVxf" 2uv(%"UVuf" => %"IVdf") (as unsigned)\n",
2494 else if (SvPOKp(sv) && SvLEN(sv)) {
2496 int numtype = grok_number(SvPVX(sv), SvCUR(sv), &value);
2498 /* We want to avoid a possible problem when we cache a UV which
2499 may be later translated to an NV, and the resulting NV is not
2500 the translation of the initial data.
2502 This means that if we cache such a UV, we need to cache the
2503 NV as well. Moreover, we trade speed for space, and do not
2504 cache the NV if not needed.
2507 /* SVt_PVNV is one higher than SVt_PVIV, hence this order */
2508 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2509 == IS_NUMBER_IN_UV) {
2510 /* It's definitely an integer, only upgrade to PVIV */
2511 if (SvTYPE(sv) < SVt_PVIV)
2512 sv_upgrade(sv, SVt_PVIV);
2514 } else if (SvTYPE(sv) < SVt_PVNV)
2515 sv_upgrade(sv, SVt_PVNV);
2517 /* If NV preserves UV then we only use the UV value if we know that
2518 we aren't going to call atof() below. If NVs don't preserve UVs
2519 then the value returned may have more precision than atof() will
2520 return, even though it isn't accurate. */
2521 if ((numtype & (IS_NUMBER_IN_UV
2522 #ifdef NV_PRESERVES_UV
2525 )) == IS_NUMBER_IN_UV) {
2526 /* This won't turn off the public IOK flag if it was set above */
2527 (void)SvIOKp_on(sv);
2529 if (!(numtype & IS_NUMBER_NEG)) {
2531 if (value <= (UV)IV_MAX) {
2532 SvIVX(sv) = (IV)value;
2534 /* it didn't overflow, and it was positive. */
2539 /* 2s complement assumption */
2540 if (value <= (UV)IV_MIN) {
2541 SvIVX(sv) = -(IV)value;
2543 /* Too negative for an IV. This is a double upgrade, but
2544 I'm assuming it will be rare. */
2545 if (SvTYPE(sv) < SVt_PVNV)
2546 sv_upgrade(sv, SVt_PVNV);
2550 SvNVX(sv) = -(NV)value;
2556 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2557 != IS_NUMBER_IN_UV) {
2558 /* It wasn't an integer, or it overflowed the UV. */
2559 SvNVX(sv) = Atof(SvPVX(sv));
2561 if (! numtype && ckWARN(WARN_NUMERIC))
2564 #if defined(USE_LONG_DOUBLE)
2565 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2uv(%" PERL_PRIgldbl ")\n",
2566 PTR2UV(sv), SvNVX(sv)));
2568 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2uv(%"NVgf")\n",
2569 PTR2UV(sv), SvNVX(sv)));
2572 #ifdef NV_PRESERVES_UV
2573 (void)SvIOKp_on(sv);
2575 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2576 SvIVX(sv) = I_V(SvNVX(sv));
2577 if ((NV)(SvIVX(sv)) == SvNVX(sv)) {
2580 /* Integer is imprecise. NOK, IOKp */
2582 /* UV will not work better than IV */
2584 if (SvNVX(sv) > (NV)UV_MAX) {
2586 /* Integer is inaccurate. NOK, IOKp, is UV */
2590 SvUVX(sv) = U_V(SvNVX(sv));
2591 /* 0xFFFFFFFFFFFFFFFF not an issue in here, NVs
2592 NV preservse UV so can do correct comparison. */
2593 if ((NV)(SvUVX(sv)) == SvNVX(sv)) {
2597 /* Integer is imprecise. NOK, IOKp, is UV */
2602 #else /* NV_PRESERVES_UV */
2603 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2604 == (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT)) {
2605 /* The UV slot will have been set from value returned by
2606 grok_number above. The NV slot has just been set using
2609 assert (SvIOKp(sv));
2611 if (((UV)1 << NV_PRESERVES_UV_BITS) >
2612 U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))) {
2613 /* Small enough to preserve all bits. */
2614 (void)SvIOKp_on(sv);
2616 SvIVX(sv) = I_V(SvNVX(sv));
2617 if ((NV)(SvIVX(sv)) == SvNVX(sv))
2619 /* Assumption: first non-preserved integer is < IV_MAX,
2620 this NV is in the preserved range, therefore: */
2621 if (!(U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))
2623 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);
2626 sv_2iuv_non_preserve (sv, numtype);
2628 #endif /* NV_PRESERVES_UV */
2632 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
2633 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
2636 if (SvTYPE(sv) < SVt_IV)
2637 /* Typically the caller expects that sv_any is not NULL now. */
2638 sv_upgrade(sv, SVt_IV);
2642 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2uv(%"UVuf")\n",
2643 PTR2UV(sv),SvUVX(sv)));
2644 return SvIsUV(sv) ? SvUVX(sv) : (UV)SvIVX(sv);
2650 Return the num value of an SV, doing any necessary string or integer
2651 conversion, magic etc. Normally used via the C<SvNV(sv)> and C<SvNVx(sv)>
2658 Perl_sv_2nv(pTHX_ register SV *sv)
2662 if (SvGMAGICAL(sv)) {
2666 if (SvPOKp(sv) && SvLEN(sv)) {
2667 if (ckWARN(WARN_NUMERIC) && !SvIOKp(sv) &&
2668 !grok_number(SvPVX(sv), SvCUR(sv), NULL))
2670 return Atof(SvPVX(sv));
2674 return (NV)SvUVX(sv);
2676 return (NV)SvIVX(sv);
2679 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
2680 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
2686 if (SvTHINKFIRST(sv)) {
2689 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv,numer)) &&
2690 (!SvROK(tmpstr) || (SvRV(tmpstr) != SvRV(sv))))
2691 return SvNV(tmpstr);
2692 return PTR2NV(SvRV(sv));
2695 sv_force_normal_flags(sv, 0);
2697 if (SvREADONLY(sv) && !SvOK(sv)) {
2698 if (ckWARN(WARN_UNINITIALIZED))
2703 if (SvTYPE(sv) < SVt_NV) {
2704 if (SvTYPE(sv) == SVt_IV)
2705 sv_upgrade(sv, SVt_PVNV);
2707 sv_upgrade(sv, SVt_NV);
2708 #ifdef USE_LONG_DOUBLE
2710 STORE_NUMERIC_LOCAL_SET_STANDARD();
2711 PerlIO_printf(Perl_debug_log,
2712 "0x%"UVxf" num(%" PERL_PRIgldbl ")\n",
2713 PTR2UV(sv), SvNVX(sv));
2714 RESTORE_NUMERIC_LOCAL();
2718 STORE_NUMERIC_LOCAL_SET_STANDARD();
2719 PerlIO_printf(Perl_debug_log, "0x%"UVxf" num(%"NVgf")\n",
2720 PTR2UV(sv), SvNVX(sv));
2721 RESTORE_NUMERIC_LOCAL();
2725 else if (SvTYPE(sv) < SVt_PVNV)
2726 sv_upgrade(sv, SVt_PVNV);
2731 SvNVX(sv) = SvIsUV(sv) ? (NV)SvUVX(sv) : (NV)SvIVX(sv);
2732 #ifdef NV_PRESERVES_UV
2735 /* Only set the public NV OK flag if this NV preserves the IV */
2736 /* Check it's not 0xFFFFFFFFFFFFFFFF */
2737 if (SvIsUV(sv) ? ((SvUVX(sv) != UV_MAX)&&(SvUVX(sv) == U_V(SvNVX(sv))))
2738 : (SvIVX(sv) == I_V(SvNVX(sv))))
2744 else if (SvPOKp(sv) && SvLEN(sv)) {
2746 int numtype = grok_number(SvPVX(sv), SvCUR(sv), &value);
2747 if (ckWARN(WARN_NUMERIC) && !SvIOKp(sv) && !numtype)
2749 #ifdef NV_PRESERVES_UV
2750 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2751 == IS_NUMBER_IN_UV) {
2752 /* It's definitely an integer */
2753 SvNVX(sv) = (numtype & IS_NUMBER_NEG) ? -(NV)value : (NV)value;
2755 SvNVX(sv) = Atof(SvPVX(sv));
2758 SvNVX(sv) = Atof(SvPVX(sv));
2759 /* Only set the public NV OK flag if this NV preserves the value in
2760 the PV at least as well as an IV/UV would.
2761 Not sure how to do this 100% reliably. */
2762 /* if that shift count is out of range then Configure's test is
2763 wonky. We shouldn't be in here with NV_PRESERVES_UV_BITS ==
2765 if (((UV)1 << NV_PRESERVES_UV_BITS) >
2766 U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))) {
2767 SvNOK_on(sv); /* Definitely small enough to preserve all bits */
2768 } else if (!(numtype & IS_NUMBER_IN_UV)) {
2769 /* Can't use strtol etc to convert this string, so don't try.
2770 sv_2iv and sv_2uv will use the NV to convert, not the PV. */
2773 /* value has been set. It may not be precise. */
2774 if ((numtype & IS_NUMBER_NEG) && (value > (UV)IV_MIN)) {
2775 /* 2s complement assumption for (UV)IV_MIN */
2776 SvNOK_on(sv); /* Integer is too negative. */
2781 if (numtype & IS_NUMBER_NEG) {
2782 SvIVX(sv) = -(IV)value;
2783 } else if (value <= (UV)IV_MAX) {
2784 SvIVX(sv) = (IV)value;
2790 if (numtype & IS_NUMBER_NOT_INT) {
2791 /* I believe that even if the original PV had decimals,
2792 they are lost beyond the limit of the FP precision.
2793 However, neither is canonical, so both only get p
2794 flags. NWC, 2000/11/25 */
2795 /* Both already have p flags, so do nothing */
2798 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2799 if (SvIVX(sv) == I_V(nv)) {
2804 /* It had no "." so it must be integer. */
2807 /* between IV_MAX and NV(UV_MAX).
2808 Could be slightly > UV_MAX */
2810 if (numtype & IS_NUMBER_NOT_INT) {
2811 /* UV and NV both imprecise. */
2813 UV nv_as_uv = U_V(nv);
2815 if (value == nv_as_uv && SvUVX(sv) != UV_MAX) {
2826 #endif /* NV_PRESERVES_UV */
2829 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing && !(SvFLAGS(sv) & SVs_PADTMP))
2831 if (SvTYPE(sv) < SVt_NV)
2832 /* Typically the caller expects that sv_any is not NULL now. */
2833 /* XXX Ilya implies that this is a bug in callers that assume this
2834 and ideally should be fixed. */
2835 sv_upgrade(sv, SVt_NV);
2838 #if defined(USE_LONG_DOUBLE)
2840 STORE_NUMERIC_LOCAL_SET_STANDARD();
2841 PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2nv(%" PERL_PRIgldbl ")\n",
2842 PTR2UV(sv), SvNVX(sv));
2843 RESTORE_NUMERIC_LOCAL();
2847 STORE_NUMERIC_LOCAL_SET_STANDARD();
2848 PerlIO_printf(Perl_debug_log, "0x%"UVxf" 1nv(%"NVgf")\n",
2849 PTR2UV(sv), SvNVX(sv));
2850 RESTORE_NUMERIC_LOCAL();
2856 /* asIV(): extract an integer from the string value of an SV.
2857 * Caller must validate PVX */
2860 S_asIV(pTHX_ SV *sv)
2863 int numtype = grok_number(SvPVX(sv), SvCUR(sv), &value);
2865 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2866 == IS_NUMBER_IN_UV) {
2867 /* It's definitely an integer */
2868 if (numtype & IS_NUMBER_NEG) {
2869 if (value < (UV)IV_MIN)
2872 if (value < (UV)IV_MAX)
2877 if (ckWARN(WARN_NUMERIC))
2880 return I_V(Atof(SvPVX(sv)));
2883 /* asUV(): extract an unsigned integer from the string value of an SV
2884 * Caller must validate PVX */
2887 S_asUV(pTHX_ SV *sv)
2890 int numtype = grok_number(SvPVX(sv), SvCUR(sv), &value);
2892 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2893 == IS_NUMBER_IN_UV) {
2894 /* It's definitely an integer */
2895 if (!(numtype & IS_NUMBER_NEG))
2899 if (ckWARN(WARN_NUMERIC))
2902 return U_V(Atof(SvPVX(sv)));
2906 =for apidoc sv_2pv_nolen
2908 Like C<sv_2pv()>, but doesn't return the length too. You should usually
2909 use the macro wrapper C<SvPV_nolen(sv)> instead.
2914 Perl_sv_2pv_nolen(pTHX_ register SV *sv)
2917 return sv_2pv(sv, &n_a);
2920 /* uiv_2buf(): private routine for use by sv_2pv_flags(): print an IV or
2921 * UV as a string towards the end of buf, and return pointers to start and
2924 * We assume that buf is at least TYPE_CHARS(UV) long.
2928 uiv_2buf(char *buf, IV iv, UV uv, int is_uv, char **peob)
2930 char *ptr = buf + TYPE_CHARS(UV);
2944 *--ptr = '0' + (char)(uv % 10);
2952 /* sv_2pv() is now a macro using Perl_sv_2pv_flags();
2953 * this function provided for binary compatibility only
2957 Perl_sv_2pv(pTHX_ register SV *sv, STRLEN *lp)
2959 return sv_2pv_flags(sv, lp, SV_GMAGIC);
2963 =for apidoc sv_2pv_flags
2965 Returns a pointer to the string value of an SV, and sets *lp to its length.
2966 If flags includes SV_GMAGIC, does an mg_get() first. Coerces sv to a string
2968 Normally invoked via the C<SvPV_flags> macro. C<sv_2pv()> and C<sv_2pv_nomg>
2969 usually end up here too.
2975 Perl_sv_2pv_flags(pTHX_ register SV *sv, STRLEN *lp, I32 flags)
2980 char tbuf[64]; /* Must fit sprintf/Gconvert of longest IV/NV */
2981 char *tmpbuf = tbuf;
2987 if (SvGMAGICAL(sv)) {
2988 if (flags & SV_GMAGIC)
2996 (void)sprintf(tmpbuf,"%"UVuf, (UV)SvUVX(sv));
2998 (void)sprintf(tmpbuf,"%"IVdf, (IV)SvIVX(sv));
3003 Gconvert(SvNVX(sv), NV_DIG, 0, tmpbuf);
3008 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
3009 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
3016 if (SvTHINKFIRST(sv)) {
3019 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv,string)) &&
3020 (!SvROK(tmpstr) || (SvRV(tmpstr) != SvRV(sv)))) {
3021 char *pv = SvPV(tmpstr, *lp);
3035 switch (SvTYPE(sv)) {
3037 if ( ((SvFLAGS(sv) &
3038 (SVs_OBJECT|SVf_OK|SVs_GMG|SVs_SMG|SVs_RMG))
3039 == (SVs_OBJECT|SVs_SMG))
3040 && (mg = mg_find(sv, PERL_MAGIC_qr))) {
3041 regexp *re = (regexp *)mg->mg_obj;
3044 char *fptr = "msix";
3049 char need_newline = 0;
3050 U16 reganch = (U16)((re->reganch & PMf_COMPILETIME) >> 12);
3052 while((ch = *fptr++)) {
3054 reflags[left++] = ch;
3057 reflags[right--] = ch;
3062 reflags[left] = '-';
3066 mg->mg_len = re->prelen + 4 + left;
3068 * If /x was used, we have to worry about a regex
3069 * ending with a comment later being embedded
3070 * within another regex. If so, we don't want this
3071 * regex's "commentization" to leak out to the
3072 * right part of the enclosing regex, we must cap
3073 * it with a newline.
3075 * So, if /x was used, we scan backwards from the
3076 * end of the regex. If we find a '#' before we
3077 * find a newline, we need to add a newline
3078 * ourself. If we find a '\n' first (or if we
3079 * don't find '#' or '\n'), we don't need to add
3080 * anything. -jfriedl
3082 if (PMf_EXTENDED & re->reganch)
3084 char *endptr = re->precomp + re->prelen;
3085 while (endptr >= re->precomp)
3087 char c = *(endptr--);
3089 break; /* don't need another */
3091 /* we end while in a comment, so we
3093 mg->mg_len++; /* save space for it */
3094 need_newline = 1; /* note to add it */
3100 New(616, mg->mg_ptr, mg->mg_len + 1 + left, char);
3101 Copy("(?", mg->mg_ptr, 2, char);
3102 Copy(reflags, mg->mg_ptr+2, left, char);
3103 Copy(":", mg->mg_ptr+left+2, 1, char);
3104 Copy(re->precomp, mg->mg_ptr+3+left, re->prelen, char);
3106 mg->mg_ptr[mg->mg_len - 2] = '\n';
3107 mg->mg_ptr[mg->mg_len - 1] = ')';
3108 mg->mg_ptr[mg->mg_len] = 0;
3110 PL_reginterp_cnt += re->program[0].next_off;
3112 if (re->reganch & ROPT_UTF8)
3127 case SVt_PVBM: if (SvROK(sv))
3130 s = "SCALAR"; break;
3131 case SVt_PVLV: s = SvROK(sv) ? "REF"
3132 /* tied lvalues should appear to be
3133 * scalars for backwards compatitbility */
3134 : (LvTYPE(sv) == 't' || LvTYPE(sv) == 'T')
3135 ? "SCALAR" : "LVALUE"; break;
3136 case SVt_PVAV: s = "ARRAY"; break;
3137 case SVt_PVHV: s = "HASH"; break;
3138 case SVt_PVCV: s = "CODE"; break;
3139 case SVt_PVGV: s = "GLOB"; break;
3140 case SVt_PVFM: s = "FORMAT"; break;
3141 case SVt_PVIO: s = "IO"; break;
3142 default: s = "UNKNOWN"; break;
3146 if (HvNAME(SvSTASH(sv)))
3147 Perl_sv_setpvf(aTHX_ tsv, "%s=%s", HvNAME(SvSTASH(sv)), s);
3149 Perl_sv_setpvf(aTHX_ tsv, "__ANON__=%s", s);
3152 Perl_sv_catpvf(aTHX_ tsv, "(0x%"UVxf")", PTR2UV(sv));
3158 if (SvREADONLY(sv) && !SvOK(sv)) {
3159 if (ckWARN(WARN_UNINITIALIZED))
3165 if (SvIOK(sv) || ((SvIOKp(sv) && !SvNOKp(sv)))) {
3166 /* I'm assuming that if both IV and NV are equally valid then
3167 converting the IV is going to be more efficient */
3168 U32 isIOK = SvIOK(sv);
3169 U32 isUIOK = SvIsUV(sv);
3170 char buf[TYPE_CHARS(UV)];
3173 if (SvTYPE(sv) < SVt_PVIV)
3174 sv_upgrade(sv, SVt_PVIV);
3176 ptr = uiv_2buf(buf, 0, SvUVX(sv), 1, &ebuf);
3178 ptr = uiv_2buf(buf, SvIVX(sv), 0, 0, &ebuf);
3179 SvGROW(sv, (STRLEN)(ebuf - ptr + 1)); /* inlined from sv_setpvn */
3180 Move(ptr,SvPVX(sv),ebuf - ptr,char);
3181 SvCUR_set(sv, ebuf - ptr);
3191 else if (SvNOKp(sv)) {
3192 if (SvTYPE(sv) < SVt_PVNV)
3193 sv_upgrade(sv, SVt_PVNV);
3194 /* The +20 is pure guesswork. Configure test needed. --jhi */
3195 SvGROW(sv, NV_DIG + 20);
3197 olderrno = errno; /* some Xenix systems wipe out errno here */
3199 if (SvNVX(sv) == 0.0)
3200 (void)strcpy(s,"0");
3204 Gconvert(SvNVX(sv), NV_DIG, 0, s);
3207 #ifdef FIXNEGATIVEZERO
3208 if (*s == '-' && s[1] == '0' && !s[2])
3218 if (ckWARN(WARN_UNINITIALIZED)
3219 && !PL_localizing && !(SvFLAGS(sv) & SVs_PADTMP))
3222 if (SvTYPE(sv) < SVt_PV)
3223 /* Typically the caller expects that sv_any is not NULL now. */
3224 sv_upgrade(sv, SVt_PV);
3227 *lp = s - SvPVX(sv);
3230 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2pv(%s)\n",
3231 PTR2UV(sv),SvPVX(sv)));
3235 if (SvROK(sv)) { /* XXX Skip this when sv_pvn_force calls */
3236 /* Sneaky stuff here */
3240 tsv = newSVpv(tmpbuf, 0);
3256 len = strlen(tmpbuf);
3258 #ifdef FIXNEGATIVEZERO
3259 if (len == 2 && t[0] == '-' && t[1] == '0') {
3264 (void)SvUPGRADE(sv, SVt_PV);
3266 s = SvGROW(sv, len + 1);
3275 =for apidoc sv_copypv
3277 Copies a stringified representation of the source SV into the
3278 destination SV. Automatically performs any necessary mg_get and
3279 coercion of numeric values into strings. Guaranteed to preserve
3280 UTF-8 flag even from overloaded objects. Similar in nature to
3281 sv_2pv[_flags] but operates directly on an SV instead of just the
3282 string. Mostly uses sv_2pv_flags to do its work, except when that
3283 would lose the UTF-8'ness of the PV.
3289 Perl_sv_copypv(pTHX_ SV *dsv, register SV *ssv)
3294 sv_setpvn(dsv,s,len);
3302 =for apidoc sv_2pvbyte_nolen
3304 Return a pointer to the byte-encoded representation of the SV.
3305 May cause the SV to be downgraded from UTF-8 as a side-effect.
3307 Usually accessed via the C<SvPVbyte_nolen> macro.
3313 Perl_sv_2pvbyte_nolen(pTHX_ register SV *sv)
3316 return sv_2pvbyte(sv, &n_a);
3320 =for apidoc sv_2pvbyte
3322 Return a pointer to the byte-encoded representation of the SV, and set *lp
3323 to its length. May cause the SV to be downgraded from UTF-8 as a
3326 Usually accessed via the C<SvPVbyte> macro.
3332 Perl_sv_2pvbyte(pTHX_ register SV *sv, STRLEN *lp)
3334 sv_utf8_downgrade(sv,0);
3335 return SvPV(sv,*lp);
3339 =for apidoc sv_2pvutf8_nolen
3341 Return a pointer to the UTF-8-encoded representation of the SV.
3342 May cause the SV to be upgraded to UTF-8 as a side-effect.
3344 Usually accessed via the C<SvPVutf8_nolen> macro.
3350 Perl_sv_2pvutf8_nolen(pTHX_ register SV *sv)
3353 return sv_2pvutf8(sv, &n_a);
3357 =for apidoc sv_2pvutf8
3359 Return a pointer to the UTF-8-encoded representation of the SV, and set *lp
3360 to its length. May cause the SV to be upgraded to UTF-8 as a side-effect.
3362 Usually accessed via the C<SvPVutf8> macro.
3368 Perl_sv_2pvutf8(pTHX_ register SV *sv, STRLEN *lp)
3370 sv_utf8_upgrade(sv);
3371 return SvPV(sv,*lp);
3375 =for apidoc sv_2bool
3377 This function is only called on magical items, and is only used by
3378 sv_true() or its macro equivalent.
3384 Perl_sv_2bool(pTHX_ register SV *sv)
3393 if (SvAMAGIC(sv) && (tmpsv=AMG_CALLun(sv,bool_)) &&
3394 (!SvROK(tmpsv) || (SvRV(tmpsv) != SvRV(sv))))
3395 return (bool)SvTRUE(tmpsv);
3396 return SvRV(sv) != 0;
3399 register XPV* Xpvtmp;
3400 if ((Xpvtmp = (XPV*)SvANY(sv)) &&
3401 (*Xpvtmp->xpv_pv > '0' ||
3402 Xpvtmp->xpv_cur > 1 ||
3403 (Xpvtmp->xpv_cur && *Xpvtmp->xpv_pv != '0')))
3410 return SvIVX(sv) != 0;
3413 return SvNVX(sv) != 0.0;
3420 /* sv_utf8_upgrade() is now a macro using sv_utf8_upgrade_flags();
3421 * this function provided for binary compatibility only
3426 Perl_sv_utf8_upgrade(pTHX_ register SV *sv)
3428 return sv_utf8_upgrade_flags(sv, SV_GMAGIC);
3432 =for apidoc sv_utf8_upgrade
3434 Convert the PV of an SV to its UTF-8-encoded form.
3435 Forces the SV to string form if it is not already.
3436 Always sets the SvUTF8 flag to avoid future validity checks even
3437 if all the bytes have hibit clear.
3439 This is not as a general purpose byte encoding to Unicode interface:
3440 use the Encode extension for that.
3442 =for apidoc sv_utf8_upgrade_flags
3444 Convert the PV of an SV to its UTF-8-encoded form.
3445 Forces the SV to string form if it is not already.
3446 Always sets the SvUTF8 flag to avoid future validity checks even
3447 if all the bytes have hibit clear. If C<flags> has C<SV_GMAGIC> bit set,
3448 will C<mg_get> on C<sv> if appropriate, else not. C<sv_utf8_upgrade> and
3449 C<sv_utf8_upgrade_nomg> are implemented in terms of this function.
3451 This is not as a general purpose byte encoding to Unicode interface:
3452 use the Encode extension for that.
3458 Perl_sv_utf8_upgrade_flags(pTHX_ register SV *sv, I32 flags)
3468 (void) sv_2pv_flags(sv,&len, flags);
3477 sv_force_normal_flags(sv, 0);
3480 if (SvREADONLY(sv)) {
3481 Perl_croak(aTHX_ PL_no_modify);
3484 if (PL_encoding && !(flags & SV_UTF8_NO_ENCODING))
3485 sv_recode_to_utf8(sv, PL_encoding);
3486 else { /* Assume Latin-1/EBCDIC */
3487 /* This function could be much more efficient if we
3488 * had a FLAG in SVs to signal if there are any hibit
3489 * chars in the PV. Given that there isn't such a flag
3490 * make the loop as fast as possible. */
3491 s = (U8 *) SvPVX(sv);
3492 e = (U8 *) SvEND(sv);
3496 if ((hibit = !NATIVE_IS_INVARIANT(ch)))
3502 len = SvCUR(sv) + 1; /* Plus the \0 */
3503 SvPVX(sv) = (char*)bytes_to_utf8((U8*)s, &len);
3504 SvCUR(sv) = len - 1;
3506 Safefree(s); /* No longer using what was there before. */
3507 SvLEN(sv) = len; /* No longer know the real size. */
3509 /* Mark as UTF-8 even if no hibit - saves scanning loop */
3516 =for apidoc sv_utf8_downgrade
3518 Attempt to convert the PV of an SV from UTF-8-encoded to byte encoding.
3519 This may not be possible if the PV contains non-byte encoding characters;
3520 if this is the case, either returns false or, if C<fail_ok> is not
3523 This is not as a general purpose Unicode to byte encoding interface:
3524 use the Encode extension for that.
3530 Perl_sv_utf8_downgrade(pTHX_ register SV* sv, bool fail_ok)
3532 if (SvPOK(sv) && SvUTF8(sv)) {
3538 sv_force_normal_flags(sv, 0);
3540 s = (U8 *) SvPV(sv, len);
3541 if (!utf8_to_bytes(s, &len)) {
3546 Perl_croak(aTHX_ "Wide character in %s",
3549 Perl_croak(aTHX_ "Wide character");
3560 =for apidoc sv_utf8_encode
3562 Convert the PV of an SV to UTF-8-encoded, but then turn off the C<SvUTF8>
3563 flag so that it looks like octets again. Used as a building block
3564 for encode_utf8 in Encode.xs
3570 Perl_sv_utf8_encode(pTHX_ register SV *sv)
3572 (void) sv_utf8_upgrade(sv);
3577 =for apidoc sv_utf8_decode
3579 Convert the octets in the PV from UTF-8 to chars. Scan for validity and then
3580 turn off SvUTF8 if needed so that we see characters. Used as a building block
3581 for decode_utf8 in Encode.xs
3587 Perl_sv_utf8_decode(pTHX_ register SV *sv)
3593 /* The octets may have got themselves encoded - get them back as
3596 if (!sv_utf8_downgrade(sv, TRUE))
3599 /* it is actually just a matter of turning the utf8 flag on, but
3600 * we want to make sure everything inside is valid utf8 first.
3602 c = (U8 *) SvPVX(sv);
3603 if (!is_utf8_string(c, SvCUR(sv)+1))
3605 e = (U8 *) SvEND(sv);
3608 if (!UTF8_IS_INVARIANT(ch)) {
3617 /* sv_setsv() is now a macro using Perl_sv_setsv_flags();
3618 * this function provided for binary compatibility only
3622 Perl_sv_setsv(pTHX_ SV *dstr, register SV *sstr)
3624 sv_setsv_flags(dstr, sstr, SV_GMAGIC);
3628 =for apidoc sv_setsv
3630 Copies the contents of the source SV C<ssv> into the destination SV
3631 C<dsv>. The source SV may be destroyed if it is mortal, so don't use this
3632 function if the source SV needs to be reused. Does not handle 'set' magic.
3633 Loosely speaking, it performs a copy-by-value, obliterating any previous
3634 content of the destination.
3636 You probably want to use one of the assortment of wrappers, such as
3637 C<SvSetSV>, C<SvSetSV_nosteal>, C<SvSetMagicSV> and
3638 C<SvSetMagicSV_nosteal>.
3640 =for apidoc sv_setsv_flags
3642 Copies the contents of the source SV C<ssv> into the destination SV
3643 C<dsv>. The source SV may be destroyed if it is mortal, so don't use this
3644 function if the source SV needs to be reused. Does not handle 'set' magic.
3645 Loosely speaking, it performs a copy-by-value, obliterating any previous
3646 content of the destination.
3647 If the C<flags> parameter has the C<SV_GMAGIC> bit set, will C<mg_get> on
3648 C<ssv> if appropriate, else not. C<sv_setsv> and C<sv_setsv_nomg> are
3649 implemented in terms of this function.
3651 You probably want to use one of the assortment of wrappers, such as
3652 C<SvSetSV>, C<SvSetSV_nosteal>, C<SvSetMagicSV> and
3653 C<SvSetMagicSV_nosteal>.
3655 This is the primary function for copying scalars, and most other
3656 copy-ish functions and macros use this underneath.
3662 Perl_sv_setsv_flags(pTHX_ SV *dstr, register SV *sstr, I32 flags)
3664 register U32 sflags;
3670 SV_CHECK_THINKFIRST_COW_DROP(dstr);
3672 sstr = &PL_sv_undef;
3673 stype = SvTYPE(sstr);
3674 dtype = SvTYPE(dstr);
3679 /* need to nuke the magic */
3681 SvRMAGICAL_off(dstr);
3684 /* There's a lot of redundancy below but we're going for speed here */
3689 if (dtype != SVt_PVGV) {
3690 (void)SvOK_off(dstr);
3698 sv_upgrade(dstr, SVt_IV);
3701 sv_upgrade(dstr, SVt_PVNV);
3705 sv_upgrade(dstr, SVt_PVIV);
3708 (void)SvIOK_only(dstr);
3709 SvIVX(dstr) = SvIVX(sstr);
3712 if (SvTAINTED(sstr))
3723 sv_upgrade(dstr, SVt_NV);
3728 sv_upgrade(dstr, SVt_PVNV);
3731 SvNVX(dstr) = SvNVX(sstr);
3732 (void)SvNOK_only(dstr);
3733 if (SvTAINTED(sstr))
3741 sv_upgrade(dstr, SVt_RV);
3742 else if (dtype == SVt_PVGV &&
3743 SvROK(sstr) && SvTYPE(SvRV(sstr)) == SVt_PVGV) {
3746 if (GvIMPORTED(dstr) != GVf_IMPORTED
3747 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3749 GvIMPORTED_on(dstr);
3758 #ifdef PERL_COPY_ON_WRITE
3759 if ((SvFLAGS(sstr) & CAN_COW_MASK) == CAN_COW_FLAGS) {
3760 if (dtype < SVt_PVIV)
3761 sv_upgrade(dstr, SVt_PVIV);
3768 sv_upgrade(dstr, SVt_PV);
3771 if (dtype < SVt_PVIV)
3772 sv_upgrade(dstr, SVt_PVIV);
3775 if (dtype < SVt_PVNV)
3776 sv_upgrade(dstr, SVt_PVNV);
3783 Perl_croak(aTHX_ "Bizarre copy of %s in %s", sv_reftype(sstr, 0),
3786 Perl_croak(aTHX_ "Bizarre copy of %s", sv_reftype(sstr, 0));
3790 if (dtype <= SVt_PVGV) {
3792 if (dtype != SVt_PVGV) {
3793 char *name = GvNAME(sstr);
3794 STRLEN len = GvNAMELEN(sstr);
3795 /* don't upgrade SVt_PVLV: it can hold a glob */
3796 if (dtype != SVt_PVLV)
3797 sv_upgrade(dstr, SVt_PVGV);
3798 sv_magic(dstr, dstr, PERL_MAGIC_glob, Nullch, 0);
3799 GvSTASH(dstr) = (HV*)SvREFCNT_inc(GvSTASH(sstr));
3800 GvNAME(dstr) = savepvn(name, len);
3801 GvNAMELEN(dstr) = len;
3802 SvFAKE_on(dstr); /* can coerce to non-glob */
3804 /* ahem, death to those who redefine active sort subs */
3805 else if (PL_curstackinfo->si_type == PERLSI_SORT
3806 && GvCV(dstr) && PL_sortcop == CvSTART(GvCV(dstr)))
3807 Perl_croak(aTHX_ "Can't redefine active sort subroutine %s",
3810 #ifdef GV_UNIQUE_CHECK
3811 if (GvUNIQUE((GV*)dstr)) {
3812 Perl_croak(aTHX_ PL_no_modify);
3816 (void)SvOK_off(dstr);
3817 GvINTRO_off(dstr); /* one-shot flag */
3819 GvGP(dstr) = gp_ref(GvGP(sstr));
3820 if (SvTAINTED(sstr))
3822 if (GvIMPORTED(dstr) != GVf_IMPORTED
3823 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3825 GvIMPORTED_on(dstr);
3833 if (SvGMAGICAL(sstr) && (flags & SV_GMAGIC)) {
3835 if ((int)SvTYPE(sstr) != stype) {
3836 stype = SvTYPE(sstr);
3837 if (stype == SVt_PVGV && dtype <= SVt_PVGV)
3841 if (stype == SVt_PVLV)
3842 (void)SvUPGRADE(dstr, SVt_PVNV);
3844 (void)SvUPGRADE(dstr, (U32)stype);
3847 sflags = SvFLAGS(sstr);
3849 if (sflags & SVf_ROK) {
3850 if (dtype >= SVt_PV) {
3851 if (dtype == SVt_PVGV) {
3852 SV *sref = SvREFCNT_inc(SvRV(sstr));
3854 int intro = GvINTRO(dstr);
3856 #ifdef GV_UNIQUE_CHECK
3857 if (GvUNIQUE((GV*)dstr)) {
3858 Perl_croak(aTHX_ PL_no_modify);
3863 GvINTRO_off(dstr); /* one-shot flag */
3864 GvLINE(dstr) = CopLINE(PL_curcop);
3865 GvEGV(dstr) = (GV*)dstr;
3868 switch (SvTYPE(sref)) {
3871 SAVEGENERICSV(GvAV(dstr));
3873 dref = (SV*)GvAV(dstr);
3874 GvAV(dstr) = (AV*)sref;
3875 if (!GvIMPORTED_AV(dstr)
3876 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3878 GvIMPORTED_AV_on(dstr);
3883 SAVEGENERICSV(GvHV(dstr));
3885 dref = (SV*)GvHV(dstr);
3886 GvHV(dstr) = (HV*)sref;
3887 if (!GvIMPORTED_HV(dstr)
3888 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3890 GvIMPORTED_HV_on(dstr);
3895 if (GvCVGEN(dstr) && GvCV(dstr) != (CV*)sref) {
3896 SvREFCNT_dec(GvCV(dstr));
3897 GvCV(dstr) = Nullcv;
3898 GvCVGEN(dstr) = 0; /* Switch off cacheness. */
3899 PL_sub_generation++;
3901 SAVEGENERICSV(GvCV(dstr));
3904 dref = (SV*)GvCV(dstr);
3905 if (GvCV(dstr) != (CV*)sref) {
3906 CV* cv = GvCV(dstr);
3908 if (!GvCVGEN((GV*)dstr) &&
3909 (CvROOT(cv) || CvXSUB(cv)))
3911 /* ahem, death to those who redefine
3912 * active sort subs */
3913 if (PL_curstackinfo->si_type == PERLSI_SORT &&
3914 PL_sortcop == CvSTART(cv))
3916 "Can't redefine active sort subroutine %s",
3917 GvENAME((GV*)dstr));
3918 /* Redefining a sub - warning is mandatory if
3919 it was a const and its value changed. */
3920 if (ckWARN(WARN_REDEFINE)
3922 && (!CvCONST((CV*)sref)
3923 || sv_cmp(cv_const_sv(cv),
3924 cv_const_sv((CV*)sref)))))
3926 Perl_warner(aTHX_ packWARN(WARN_REDEFINE),
3928 ? "Constant subroutine %s::%s redefined"
3929 : "Subroutine %s::%s redefined",
3930 HvNAME(GvSTASH((GV*)dstr)),
3931 GvENAME((GV*)dstr));
3935 cv_ckproto(cv, (GV*)dstr,
3936 SvPOK(sref) ? SvPVX(sref) : Nullch);
3938 GvCV(dstr) = (CV*)sref;
3939 GvCVGEN(dstr) = 0; /* Switch off cacheness. */
3940 GvASSUMECV_on(dstr);
3941 PL_sub_generation++;
3943 if (!GvIMPORTED_CV(dstr)
3944 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3946 GvIMPORTED_CV_on(dstr);
3951 SAVEGENERICSV(GvIOp(dstr));
3953 dref = (SV*)GvIOp(dstr);
3954 GvIOp(dstr) = (IO*)sref;
3958 SAVEGENERICSV(GvFORM(dstr));
3960 dref = (SV*)GvFORM(dstr);
3961 GvFORM(dstr) = (CV*)sref;
3965 SAVEGENERICSV(GvSV(dstr));
3967 dref = (SV*)GvSV(dstr);
3969 if (!GvIMPORTED_SV(dstr)
3970 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3972 GvIMPORTED_SV_on(dstr);
3978 if (SvTAINTED(sstr))
3983 (void)SvOOK_off(dstr); /* backoff */
3985 Safefree(SvPVX(dstr));
3986 SvLEN(dstr)=SvCUR(dstr)=0;
3989 (void)SvOK_off(dstr);
3990 SvRV(dstr) = SvREFCNT_inc(SvRV(sstr));
3992 if (sflags & SVp_NOK) {
3994 /* Only set the public OK flag if the source has public OK. */
3995 if (sflags & SVf_NOK)
3996 SvFLAGS(dstr) |= SVf_NOK;
3997 SvNVX(dstr) = SvNVX(sstr);
3999 if (sflags & SVp_IOK) {
4000 (void)SvIOKp_on(dstr);
4001 if (sflags & SVf_IOK)
4002 SvFLAGS(dstr) |= SVf_IOK;
4003 if (sflags & SVf_IVisUV)
4005 SvIVX(dstr) = SvIVX(sstr);
4007 if (SvAMAGIC(sstr)) {
4011 else if (sflags & SVp_POK) {
4015 * Check to see if we can just swipe the string. If so, it's a
4016 * possible small lose on short strings, but a big win on long ones.
4017 * It might even be a win on short strings if SvPVX(dstr)
4018 * has to be allocated and SvPVX(sstr) has to be freed.
4021 /* Whichever path we take through the next code, we want this true,
4022 and doing it now facilitates the COW check. */
4023 (void)SvPOK_only(dstr);
4026 #ifdef PERL_COPY_ON_WRITE
4027 (sflags & (SVf_FAKE | SVf_READONLY)) != (SVf_FAKE | SVf_READONLY)
4031 (sflags & SVs_TEMP) && /* slated for free anyway? */
4032 !(sflags & SVf_OOK) && /* and not involved in OOK hack? */
4033 SvREFCNT(sstr) == 1 && /* and no other references to it? */
4034 SvLEN(sstr) && /* and really is a string */
4035 /* and won't be needed again, potentially */
4036 !(PL_op && PL_op->op_type == OP_AASSIGN))
4037 #ifdef PERL_COPY_ON_WRITE
4038 && !((sflags & CAN_COW_MASK) == CAN_COW_FLAGS
4039 && (SvFLAGS(dstr) & CAN_COW_MASK) == CAN_COW_FLAGS
4040 && SvTYPE(sstr) >= SVt_PVIV)
4043 /* Failed the swipe test, and it's not a shared hash key either.
4044 Have to copy the string. */
4045 STRLEN len = SvCUR(sstr);
4046 SvGROW(dstr, len + 1); /* inlined from sv_setpvn */
4047 Move(SvPVX(sstr),SvPVX(dstr),len,char);
4048 SvCUR_set(dstr, len);
4049 *SvEND(dstr) = '\0';
4051 /* If PERL_COPY_ON_WRITE is not defined, then isSwipe will always
4053 #ifdef PERL_COPY_ON_WRITE
4054 /* Either it's a shared hash key, or it's suitable for
4055 copy-on-write or we can swipe the string. */
4057 PerlIO_printf(Perl_debug_log, "Copy on write: sstr --> dstr\n");
4062 /* I believe I should acquire a global SV mutex if
4063 it's a COW sv (not a shared hash key) to stop
4064 it going un copy-on-write.
4065 If the source SV has gone un copy on write between up there
4066 and down here, then (assert() that) it is of the correct
4067 form to make it copy on write again */
4068 if ((sflags & (SVf_FAKE | SVf_READONLY))
4069 != (SVf_FAKE | SVf_READONLY)) {
4070 SvREADONLY_on(sstr);
4072 /* Make the source SV into a loop of 1.
4073 (about to become 2) */
4074 SV_COW_NEXT_SV_SET(sstr, sstr);
4078 /* Initial code is common. */
4079 if (SvPVX(dstr)) { /* we know that dtype >= SVt_PV */
4081 SvFLAGS(dstr) &= ~SVf_OOK;
4082 Safefree(SvPVX(dstr) - SvIVX(dstr));
4084 else if (SvLEN(dstr))
4085 Safefree(SvPVX(dstr));
4088 #ifdef PERL_COPY_ON_WRITE
4090 /* making another shared SV. */
4091 STRLEN cur = SvCUR(sstr);
4092 STRLEN len = SvLEN(sstr);
4093 assert (SvTYPE(dstr) >= SVt_PVIV);
4095 /* SvIsCOW_normal */
4096 /* splice us in between source and next-after-source. */
4097 SV_COW_NEXT_SV_SET(dstr, SV_COW_NEXT_SV(sstr));
4098 SV_COW_NEXT_SV_SET(sstr, dstr);
4099 SvPV_set(dstr, SvPVX(sstr));
4101 /* SvIsCOW_shared_hash */
4102 UV hash = SvUVX(sstr);
4103 DEBUG_C(PerlIO_printf(Perl_debug_log,
4104 "Copy on write: Sharing hash\n"));
4106 sharepvn(SvPVX(sstr),
4107 (sflags & SVf_UTF8?-cur:cur), hash));
4112 SvREADONLY_on(dstr);
4114 /* Relesase a global SV mutex. */
4118 { /* Passes the swipe test. */
4119 SvPV_set(dstr, SvPVX(sstr));
4120 SvLEN_set(dstr, SvLEN(sstr));
4121 SvCUR_set(dstr, SvCUR(sstr));
4124 (void)SvOK_off(sstr); /* NOTE: nukes most SvFLAGS on sstr */
4125 SvPV_set(sstr, Nullch);
4131 if (sflags & SVf_UTF8)
4134 if (sflags & SVp_NOK) {
4136 if (sflags & SVf_NOK)
4137 SvFLAGS(dstr) |= SVf_NOK;
4138 SvNVX(dstr) = SvNVX(sstr);
4140 if (sflags & SVp_IOK) {
4141 (void)SvIOKp_on(dstr);
4142 if (sflags & SVf_IOK)
4143 SvFLAGS(dstr) |= SVf_IOK;
4144 if (sflags & SVf_IVisUV)
4146 SvIVX(dstr) = SvIVX(sstr);
4149 MAGIC *smg = mg_find(sstr,PERL_MAGIC_vstring);
4150 sv_magic(dstr, NULL, PERL_MAGIC_vstring,
4151 smg->mg_ptr, smg->mg_len);
4152 SvRMAGICAL_on(dstr);
4155 else if (sflags & SVp_IOK) {
4156 if (sflags & SVf_IOK)
4157 (void)SvIOK_only(dstr);
4159 (void)SvOK_off(dstr);
4160 (void)SvIOKp_on(dstr);
4162 /* XXXX Do we want to set IsUV for IV(ROK)? Be extra safe... */
4163 if (sflags & SVf_IVisUV)
4165 SvIVX(dstr) = SvIVX(sstr);
4166 if (sflags & SVp_NOK) {
4167 if (sflags & SVf_NOK)
4168 (void)SvNOK_on(dstr);
4170 (void)SvNOKp_on(dstr);
4171 SvNVX(dstr) = SvNVX(sstr);
4174 else if (sflags & SVp_NOK) {
4175 if (sflags & SVf_NOK)
4176 (void)SvNOK_only(dstr);
4178 (void)SvOK_off(dstr);
4181 SvNVX(dstr) = SvNVX(sstr);
4184 if (dtype == SVt_PVGV) {
4185 if (ckWARN(WARN_MISC))
4186 Perl_warner(aTHX_ packWARN(WARN_MISC), "Undefined value assigned to typeglob");
4189 (void)SvOK_off(dstr);
4191 if (SvTAINTED(sstr))
4196 =for apidoc sv_setsv_mg
4198 Like C<sv_setsv>, but also handles 'set' magic.
4204 Perl_sv_setsv_mg(pTHX_ SV *dstr, register SV *sstr)
4206 sv_setsv(dstr,sstr);
4210 #ifdef PERL_COPY_ON_WRITE
4212 Perl_sv_setsv_cow(pTHX_ SV *dstr, SV *sstr)
4214 STRLEN cur = SvCUR(sstr);
4215 STRLEN len = SvLEN(sstr);
4216 register char *new_pv;
4219 PerlIO_printf(Perl_debug_log, "Fast copy on write: %p -> %p\n",
4227 if (SvTHINKFIRST(dstr))
4228 sv_force_normal_flags(dstr, SV_COW_DROP_PV);
4229 else if (SvPVX(dstr))
4230 Safefree(SvPVX(dstr));
4234 (void)SvUPGRADE (dstr, SVt_PVIV);
4236 assert (SvPOK(sstr));
4237 assert (SvPOKp(sstr));
4238 assert (!SvIOK(sstr));
4239 assert (!SvIOKp(sstr));
4240 assert (!SvNOK(sstr));
4241 assert (!SvNOKp(sstr));
4243 if (SvIsCOW(sstr)) {
4245 if (SvLEN(sstr) == 0) {
4246 /* source is a COW shared hash key. */
4247 UV hash = SvUVX(sstr);
4248 DEBUG_C(PerlIO_printf(Perl_debug_log,
4249 "Fast copy on write: Sharing hash\n"));
4251 new_pv = sharepvn(SvPVX(sstr), (SvUTF8(sstr)?-cur:cur), hash);
4254 SV_COW_NEXT_SV_SET(dstr, SV_COW_NEXT_SV(sstr));
4256 assert ((SvFLAGS(sstr) & CAN_COW_MASK) == CAN_COW_FLAGS);
4257 (void)SvUPGRADE (sstr, SVt_PVIV);
4258 SvREADONLY_on(sstr);
4260 DEBUG_C(PerlIO_printf(Perl_debug_log,
4261 "Fast copy on write: Converting sstr to COW\n"));
4262 SV_COW_NEXT_SV_SET(dstr, sstr);
4264 SV_COW_NEXT_SV_SET(sstr, dstr);
4265 new_pv = SvPVX(sstr);
4268 SvPV_set(dstr, new_pv);
4269 SvFLAGS(dstr) = (SVt_PVIV|SVf_POK|SVp_POK|SVf_FAKE|SVf_READONLY);
4282 =for apidoc sv_setpvn
4284 Copies a string into an SV. The C<len> parameter indicates the number of
4285 bytes to be copied. Does not handle 'set' magic. See C<sv_setpvn_mg>.
4291 Perl_sv_setpvn(pTHX_ register SV *sv, register const char *ptr, register STRLEN len)
4293 register char *dptr;
4295 SV_CHECK_THINKFIRST_COW_DROP(sv);
4301 /* len is STRLEN which is unsigned, need to copy to signed */
4304 Perl_croak(aTHX_ "panic: sv_setpvn called with negative strlen");
4306 (void)SvUPGRADE(sv, SVt_PV);
4308 SvGROW(sv, len + 1);
4310 Move(ptr,dptr,len,char);
4313 (void)SvPOK_only_UTF8(sv); /* validate pointer */
4318 =for apidoc sv_setpvn_mg
4320 Like C<sv_setpvn>, but also handles 'set' magic.
4326 Perl_sv_setpvn_mg(pTHX_ register SV *sv, register const char *ptr, register STRLEN len)
4328 sv_setpvn(sv,ptr,len);
4333 =for apidoc sv_setpv
4335 Copies a string into an SV. The string must be null-terminated. Does not
4336 handle 'set' magic. See C<sv_setpv_mg>.
4342 Perl_sv_setpv(pTHX_ register SV *sv, register const char *ptr)
4344 register STRLEN len;
4346 SV_CHECK_THINKFIRST_COW_DROP(sv);
4352 (void)SvUPGRADE(sv, SVt_PV);
4354 SvGROW(sv, len + 1);
4355 Move(ptr,SvPVX(sv),len+1,char);
4357 (void)SvPOK_only_UTF8(sv); /* validate pointer */
4362 =for apidoc sv_setpv_mg
4364 Like C<sv_setpv>, but also handles 'set' magic.
4370 Perl_sv_setpv_mg(pTHX_ register SV *sv, register const char *ptr)
4377 =for apidoc sv_usepvn
4379 Tells an SV to use C<ptr> to find its string value. Normally the string is
4380 stored inside the SV but sv_usepvn allows the SV to use an outside string.
4381 The C<ptr> should point to memory that was allocated by C<malloc>. The
4382 string length, C<len>, must be supplied. This function will realloc the
4383 memory pointed to by C<ptr>, so that pointer should not be freed or used by
4384 the programmer after giving it to sv_usepvn. Does not handle 'set' magic.
4385 See C<sv_usepvn_mg>.
4391 Perl_sv_usepvn(pTHX_ register SV *sv, register char *ptr, register STRLEN len)
4393 SV_CHECK_THINKFIRST_COW_DROP(sv);
4394 (void)SvUPGRADE(sv, SVt_PV);
4399 (void)SvOOK_off(sv);
4400 if (SvPVX(sv) && SvLEN(sv))
4401 Safefree(SvPVX(sv));
4402 Renew(ptr, len+1, char);
4405 SvLEN_set(sv, len+1);
4407 (void)SvPOK_only_UTF8(sv); /* validate pointer */
4412 =for apidoc sv_usepvn_mg
4414 Like C<sv_usepvn>, but also handles 'set' magic.
4420 Perl_sv_usepvn_mg(pTHX_ register SV *sv, register char *ptr, register STRLEN len)
4422 sv_usepvn(sv,ptr,len);
4426 #ifdef PERL_COPY_ON_WRITE
4427 /* Need to do this *after* making the SV normal, as we need the buffer
4428 pointer to remain valid until after we've copied it. If we let go too early,
4429 another thread could invalidate it by unsharing last of the same hash key
4430 (which it can do by means other than releasing copy-on-write Svs)
4431 or by changing the other copy-on-write SVs in the loop. */
4433 S_sv_release_COW(pTHX_ register SV *sv, char *pvx, STRLEN cur, STRLEN len,
4434 U32 hash, SV *after)
4436 if (len) { /* this SV was SvIsCOW_normal(sv) */
4437 /* we need to find the SV pointing to us. */
4438 SV *current = SV_COW_NEXT_SV(after);
4440 if (current == sv) {
4441 /* The SV we point to points back to us (there were only two of us
4443 Hence other SV is no longer copy on write either. */
4445 SvREADONLY_off(after);
4447 /* We need to follow the pointers around the loop. */
4449 while ((next = SV_COW_NEXT_SV(current)) != sv) {
4452 /* don't loop forever if the structure is bust, and we have
4453 a pointer into a closed loop. */
4454 assert (current != after);
4455 assert (SvPVX(current) == pvx);
4457 /* Make the SV before us point to the SV after us. */
4458 SV_COW_NEXT_SV_SET(current, after);
4461 unsharepvn(pvx, SvUTF8(sv) ? -(I32)cur : cur, hash);
4466 Perl_sv_release_IVX(pTHX_ register SV *sv)
4469 sv_force_normal_flags(sv, 0);
4470 return SvOOK_off(sv);
4474 =for apidoc sv_force_normal_flags
4476 Undo various types of fakery on an SV: if the PV is a shared string, make
4477 a private copy; if we're a ref, stop refing; if we're a glob, downgrade to
4478 an xpvmg; if we're a copy-on-write scalar, this is the on-write time when
4479 we do the copy, and is also used locally. If C<SV_COW_DROP_PV> is set
4480 then a copy-on-write scalar drops its PV buffer (if any) and becomes
4481 SvPOK_off rather than making a copy. (Used where this scalar is about to be
4482 set to some other value.) In addition, the C<flags> parameter gets passed to
4483 C<sv_unref_flags()> when unrefing. C<sv_force_normal> calls this function
4484 with flags set to 0.
4490 Perl_sv_force_normal_flags(pTHX_ register SV *sv, U32 flags)
4492 #ifdef PERL_COPY_ON_WRITE
4493 if (SvREADONLY(sv)) {
4494 /* At this point I believe I should acquire a global SV mutex. */
4496 char *pvx = SvPVX(sv);
4497 STRLEN len = SvLEN(sv);
4498 STRLEN cur = SvCUR(sv);
4499 U32 hash = SvUVX(sv);
4500 SV *next = SV_COW_NEXT_SV(sv); /* next COW sv in the loop. */
4502 PerlIO_printf(Perl_debug_log,
4503 "Copy on write: Force normal %ld\n",
4509 /* This SV doesn't own the buffer, so need to New() a new one: */
4512 if (flags & SV_COW_DROP_PV) {
4513 /* OK, so we don't need to copy our buffer. */
4516 SvGROW(sv, cur + 1);
4517 Move(pvx,SvPVX(sv),cur,char);
4521 sv_release_COW(sv, pvx, cur, len, hash, next);
4526 else if (IN_PERL_RUNTIME)
4527 Perl_croak(aTHX_ PL_no_modify);
4528 /* At this point I believe that I can drop the global SV mutex. */
4531 if (SvREADONLY(sv)) {
4533 char *pvx = SvPVX(sv);
4534 int is_utf8 = SvUTF8(sv);
4535 STRLEN len = SvCUR(sv);
4536 U32 hash = SvUVX(sv);
4541 SvGROW(sv, len + 1);
4542 Move(pvx,SvPVX(sv),len,char);
4544 unsharepvn(pvx, is_utf8 ? -(I32)len : len, hash);
4546 else if (IN_PERL_RUNTIME)
4547 Perl_croak(aTHX_ PL_no_modify);
4551 sv_unref_flags(sv, flags);
4552 else if (SvFAKE(sv) && SvTYPE(sv) == SVt_PVGV)
4557 =for apidoc sv_force_normal
4559 Undo various types of fakery on an SV: if the PV is a shared string, make
4560 a private copy; if we're a ref, stop refing; if we're a glob, downgrade to
4561 an xpvmg. See also C<sv_force_normal_flags>.
4567 Perl_sv_force_normal(pTHX_ register SV *sv)
4569 sv_force_normal_flags(sv, 0);
4575 Efficient removal of characters from the beginning of the string buffer.
4576 SvPOK(sv) must be true and the C<ptr> must be a pointer to somewhere inside
4577 the string buffer. The C<ptr> becomes the first character of the adjusted
4578 string. Uses the "OOK hack".
4579 Beware: after this function returns, C<ptr> and SvPVX(sv) may no longer
4580 refer to the same chunk of data.
4586 Perl_sv_chop(pTHX_ register SV *sv, register char *ptr)
4588 register STRLEN delta;
4589 if (!ptr || !SvPOKp(sv))
4591 delta = ptr - SvPVX(sv);
4592 SV_CHECK_THINKFIRST(sv);
4593 if (SvTYPE(sv) < SVt_PVIV)
4594 sv_upgrade(sv,SVt_PVIV);
4597 if (!SvLEN(sv)) { /* make copy of shared string */
4598 char *pvx = SvPVX(sv);
4599 STRLEN len = SvCUR(sv);
4600 SvGROW(sv, len + 1);
4601 Move(pvx,SvPVX(sv),len,char);
4605 /* Same SvOOK_on but SvOOK_on does a SvIOK_off
4606 and we do that anyway inside the SvNIOK_off
4608 SvFLAGS(sv) |= SVf_OOK;
4617 /* sv_catpvn() is now a macro using Perl_sv_catpvn_flags();
4618 * this function provided for binary compatibility only
4622 Perl_sv_catpvn(pTHX_ SV *dsv, const char* sstr, STRLEN slen)
4624 sv_catpvn_flags(dsv, sstr, slen, SV_GMAGIC);
4628 =for apidoc sv_catpvn
4630 Concatenates the string onto the end of the string which is in the SV. The
4631 C<len> indicates number of bytes to copy. If the SV has the UTF-8
4632 status set, then the bytes appended should be valid UTF-8.
4633 Handles 'get' magic, but not 'set' magic. See C<sv_catpvn_mg>.
4635 =for apidoc sv_catpvn_flags
4637 Concatenates the string onto the end of the string which is in the SV. The
4638 C<len> indicates number of bytes to copy. If the SV has the UTF-8
4639 status set, then the bytes appended should be valid UTF-8.
4640 If C<flags> has C<SV_GMAGIC> bit set, will C<mg_get> on C<dsv> if
4641 appropriate, else not. C<sv_catpvn> and C<sv_catpvn_nomg> are implemented
4642 in terms of this function.
4648 Perl_sv_catpvn_flags(pTHX_ register SV *dsv, register const char *sstr, register STRLEN slen, I32 flags)
4653 dstr = SvPV_force_flags(dsv, dlen, flags);
4654 SvGROW(dsv, dlen + slen + 1);
4657 Move(sstr, SvPVX(dsv) + dlen, slen, char);
4660 (void)SvPOK_only_UTF8(dsv); /* validate pointer */
4665 =for apidoc sv_catpvn_mg
4667 Like C<sv_catpvn>, but also handles 'set' magic.
4673 Perl_sv_catpvn_mg(pTHX_ register SV *sv, register const char *ptr, register STRLEN len)
4675 sv_catpvn(sv,ptr,len);
4679 /* sv_catsv() is now a macro using Perl_sv_catsv_flags();
4680 * this function provided for binary compatibility only
4684 Perl_sv_catsv(pTHX_ SV *dstr, register SV *sstr)
4686 sv_catsv_flags(dstr, sstr, SV_GMAGIC);
4690 =for apidoc sv_catsv
4692 Concatenates the string from SV C<ssv> onto the end of the string in
4693 SV C<dsv>. Modifies C<dsv> but not C<ssv>. Handles 'get' magic, but
4694 not 'set' magic. See C<sv_catsv_mg>.
4696 =for apidoc sv_catsv_flags
4698 Concatenates the string from SV C<ssv> onto the end of the string in
4699 SV C<dsv>. Modifies C<dsv> but not C<ssv>. If C<flags> has C<SV_GMAGIC>
4700 bit set, will C<mg_get> on the SVs if appropriate, else not. C<sv_catsv>
4701 and C<sv_catsv_nomg> are implemented in terms of this function.
4706 Perl_sv_catsv_flags(pTHX_ SV *dsv, register SV *ssv, I32 flags)
4712 if ((spv = SvPV(ssv, slen))) {
4713 /* sutf8 and dutf8 were type bool, but under USE_ITHREADS,
4714 gcc version 2.95.2 20000220 (Debian GNU/Linux) for
4715 Linux xxx 2.2.17 on sparc64 with gcc -O2, we erroneously
4716 get dutf8 = 0x20000000, (i.e. SVf_UTF8) even though
4717 dsv->sv_flags doesn't have that bit set.
4718 Andy Dougherty 12 Oct 2001
4720 I32 sutf8 = DO_UTF8(ssv);
4723 if (SvGMAGICAL(dsv) && (flags & SV_GMAGIC))
4725 dutf8 = DO_UTF8(dsv);
4727 if (dutf8 != sutf8) {
4729 /* Not modifying source SV, so taking a temporary copy. */
4730 SV* csv = sv_2mortal(newSVpvn(spv, slen));
4732 sv_utf8_upgrade(csv);
4733 spv = SvPV(csv, slen);
4736 sv_utf8_upgrade_nomg(dsv);
4738 sv_catpvn_nomg(dsv, spv, slen);
4743 =for apidoc sv_catsv_mg
4745 Like C<sv_catsv>, but also handles 'set' magic.
4751 Perl_sv_catsv_mg(pTHX_ SV *dsv, register SV *ssv)
4758 =for apidoc sv_catpv
4760 Concatenates the string onto the end of the string which is in the SV.
4761 If the SV has the UTF-8 status set, then the bytes appended should be
4762 valid UTF-8. Handles 'get' magic, but not 'set' magic. See C<sv_catpv_mg>.
4767 Perl_sv_catpv(pTHX_ register SV *sv, register const char *ptr)
4769 register STRLEN len;
4775 junk = SvPV_force(sv, tlen);
4777 SvGROW(sv, tlen + len + 1);
4780 Move(ptr,SvPVX(sv)+tlen,len+1,char);
4782 (void)SvPOK_only_UTF8(sv); /* validate pointer */
4787 =for apidoc sv_catpv_mg
4789 Like C<sv_catpv>, but also handles 'set' magic.
4795 Perl_sv_catpv_mg(pTHX_ register SV *sv, register const char *ptr)
4804 Create a new null SV, or if len > 0, create a new empty SVt_PV type SV
4805 with an initial PV allocation of len+1. Normally accessed via the C<NEWSV>
4812 Perl_newSV(pTHX_ STRLEN len)
4818 sv_upgrade(sv, SVt_PV);
4819 SvGROW(sv, len + 1);
4824 =for apidoc sv_magicext
4826 Adds magic to an SV, upgrading it if necessary. Applies the
4827 supplied vtable and returns pointer to the magic added.
4829 Note that sv_magicext will allow things that sv_magic will not.
4830 In particular you can add magic to SvREADONLY SVs and and more than
4831 one instance of the same 'how'
4833 I C<namelen> is greater then zero then a savepvn() I<copy> of C<name> is stored,
4834 if C<namelen> is zero then C<name> is stored as-is and - as another special
4835 case - if C<(name && namelen == HEf_SVKEY)> then C<name> is assumed to contain
4836 an C<SV*> and has its REFCNT incremented
4838 (This is now used as a subroutine by sv_magic.)
4843 Perl_sv_magicext(pTHX_ SV* sv, SV* obj, int how, MGVTBL *vtable,
4844 const char* name, I32 namlen)
4848 if (SvTYPE(sv) < SVt_PVMG) {
4849 (void)SvUPGRADE(sv, SVt_PVMG);
4851 Newz(702,mg, 1, MAGIC);
4852 mg->mg_moremagic = SvMAGIC(sv);
4855 /* Some magic sontains a reference loop, where the sv and object refer to
4856 each other. To prevent a reference loop that would prevent such
4857 objects being freed, we look for such loops and if we find one we
4858 avoid incrementing the object refcount.
4860 Note we cannot do this to avoid self-tie loops as intervening RV must
4861 have its REFCNT incremented to keep it in existence.
4864 if (!obj || obj == sv ||
4865 how == PERL_MAGIC_arylen ||
4866 how == PERL_MAGIC_qr ||
4867 (SvTYPE(obj) == SVt_PVGV &&
4868 (GvSV(obj) == sv || GvHV(obj) == (HV*)sv || GvAV(obj) == (AV*)sv ||
4869 GvCV(obj) == (CV*)sv || GvIOp(obj) == (IO*)sv ||
4870 GvFORM(obj) == (CV*)sv)))
4875 mg->mg_obj = SvREFCNT_inc(obj);
4876 mg->mg_flags |= MGf_REFCOUNTED;
4879 /* Normal self-ties simply pass a null object, and instead of
4880 using mg_obj directly, use the SvTIED_obj macro to produce a
4881 new RV as needed. For glob "self-ties", we are tieing the PVIO
4882 with an RV obj pointing to the glob containing the PVIO. In
4883 this case, to avoid a reference loop, we need to weaken the
4887 if (how == PERL_MAGIC_tiedscalar && SvTYPE(sv) == SVt_PVIO &&
4888 obj && SvROK(obj) && GvIO(SvRV(obj)) == (IO*)sv)
4894 mg->mg_len = namlen;
4897 mg->mg_ptr = savepvn(name, namlen);
4898 else if (namlen == HEf_SVKEY)
4899 mg->mg_ptr = (char*)SvREFCNT_inc((SV*)name);
4901 mg->mg_ptr = (char *) name;
4903 mg->mg_virtual = vtable;
4907 SvFLAGS(sv) &= ~(SVf_IOK|SVf_NOK|SVf_POK);
4912 =for apidoc sv_magic
4914 Adds magic to an SV. First upgrades C<sv> to type C<SVt_PVMG> if necessary,
4915 then adds a new magic item of type C<how> to the head of the magic list.
4921 Perl_sv_magic(pTHX_ register SV *sv, SV *obj, int how, const char *name, I32 namlen)
4926 #ifdef PERL_COPY_ON_WRITE
4928 sv_force_normal_flags(sv, 0);
4930 if (SvREADONLY(sv)) {
4932 && how != PERL_MAGIC_regex_global
4933 && how != PERL_MAGIC_bm
4934 && how != PERL_MAGIC_fm
4935 && how != PERL_MAGIC_sv
4936 && how != PERL_MAGIC_backref
4939 Perl_croak(aTHX_ PL_no_modify);
4942 if (SvMAGICAL(sv) || (how == PERL_MAGIC_taint && SvTYPE(sv) >= SVt_PVMG)) {
4943 if (SvMAGIC(sv) && (mg = mg_find(sv, how))) {
4944 /* sv_magic() refuses to add a magic of the same 'how' as an
4947 if (how == PERL_MAGIC_taint)
4955 vtable = &PL_vtbl_sv;
4957 case PERL_MAGIC_overload:
4958 vtable = &PL_vtbl_amagic;
4960 case PERL_MAGIC_overload_elem:
4961 vtable = &PL_vtbl_amagicelem;
4963 case PERL_MAGIC_overload_table:
4964 vtable = &PL_vtbl_ovrld;
4967 vtable = &PL_vtbl_bm;
4969 case PERL_MAGIC_regdata:
4970 vtable = &PL_vtbl_regdata;
4972 case PERL_MAGIC_regdatum:
4973 vtable = &PL_vtbl_regdatum;
4975 case PERL_MAGIC_env:
4976 vtable = &PL_vtbl_env;
4979 vtable = &PL_vtbl_fm;
4981 case PERL_MAGIC_envelem:
4982 vtable = &PL_vtbl_envelem;
4984 case PERL_MAGIC_regex_global:
4985 vtable = &PL_vtbl_mglob;
4987 case PERL_MAGIC_isa:
4988 vtable = &PL_vtbl_isa;
4990 case PERL_MAGIC_isaelem:
4991 vtable = &PL_vtbl_isaelem;
4993 case PERL_MAGIC_nkeys:
4994 vtable = &PL_vtbl_nkeys;
4996 case PERL_MAGIC_dbfile:
4999 case PERL_MAGIC_dbline:
5000 vtable = &PL_vtbl_dbline;
5002 #ifdef USE_LOCALE_COLLATE
5003 case PERL_MAGIC_collxfrm:
5004 vtable = &PL_vtbl_collxfrm;
5006 #endif /* USE_LOCALE_COLLATE */
5007 case PERL_MAGIC_tied:
5008 vtable = &PL_vtbl_pack;
5010 case PERL_MAGIC_tiedelem:
5011 case PERL_MAGIC_tiedscalar:
5012 vtable = &PL_vtbl_packelem;
5015 vtable = &PL_vtbl_regexp;
5017 case PERL_MAGIC_sig:
5018 vtable = &PL_vtbl_sig;
5020 case PERL_MAGIC_sigelem:
5021 vtable = &PL_vtbl_sigelem;
5023 case PERL_MAGIC_taint:
5024 vtable = &PL_vtbl_taint;
5026 case PERL_MAGIC_uvar:
5027 vtable = &PL_vtbl_uvar;
5029 case PERL_MAGIC_vec:
5030 vtable = &PL_vtbl_vec;
5032 case PERL_MAGIC_vstring:
5035 case PERL_MAGIC_utf8:
5036 vtable = &PL_vtbl_utf8;
5038 case PERL_MAGIC_substr:
5039 vtable = &PL_vtbl_substr;
5041 case PERL_MAGIC_defelem:
5042 vtable = &PL_vtbl_defelem;
5044 case PERL_MAGIC_glob:
5045 vtable = &PL_vtbl_glob;
5047 case PERL_MAGIC_arylen:
5048 vtable = &PL_vtbl_arylen;
5050 case PERL_MAGIC_pos:
5051 vtable = &PL_vtbl_pos;
5053 case PERL_MAGIC_backref:
5054 vtable = &PL_vtbl_backref;
5056 case PERL_MAGIC_ext:
5057 /* Reserved for use by extensions not perl internals. */
5058 /* Useful for attaching extension internal data to perl vars. */
5059 /* Note that multiple extensions may clash if magical scalars */
5060 /* etc holding private data from one are passed to another. */
5063 Perl_croak(aTHX_ "Don't know how to handle magic of type \\%o", how);
5066 /* Rest of work is done else where */
5067 mg = sv_magicext(sv,obj,how,vtable,name,namlen);
5070 case PERL_MAGIC_taint:
5073 case PERL_MAGIC_ext:
5074 case PERL_MAGIC_dbfile:
5081 =for apidoc sv_unmagic
5083 Removes all magic of type C<type> from an SV.
5089 Perl_sv_unmagic(pTHX_ SV *sv, int type)
5093 if (SvTYPE(sv) < SVt_PVMG || !SvMAGIC(sv))
5096 for (mg = *mgp; mg; mg = *mgp) {
5097 if (mg->mg_type == type) {
5098 MGVTBL* vtbl = mg->mg_virtual;
5099 *mgp = mg->mg_moremagic;
5100 if (vtbl && vtbl->svt_free)
5101 CALL_FPTR(vtbl->svt_free)(aTHX_ sv, mg);
5102 if (mg->mg_ptr && mg->mg_type != PERL_MAGIC_regex_global) {
5104 Safefree(mg->mg_ptr);
5105 else if (mg->mg_len == HEf_SVKEY)
5106 SvREFCNT_dec((SV*)mg->mg_ptr);
5107 else if (mg->mg_type == PERL_MAGIC_utf8 && mg->mg_ptr)
5108 Safefree(mg->mg_ptr);
5110 if (mg->mg_flags & MGf_REFCOUNTED)
5111 SvREFCNT_dec(mg->mg_obj);
5115 mgp = &mg->mg_moremagic;
5119 SvFLAGS(sv) |= (SvFLAGS(sv) & (SVp_NOK|SVp_POK)) >> PRIVSHIFT;
5126 =for apidoc sv_rvweaken
5128 Weaken a reference: set the C<SvWEAKREF> flag on this RV; give the
5129 referred-to SV C<PERL_MAGIC_backref> magic if it hasn't already; and
5130 push a back-reference to this RV onto the array of backreferences
5131 associated with that magic.
5137 Perl_sv_rvweaken(pTHX_ SV *sv)
5140 if (!SvOK(sv)) /* let undefs pass */
5143 Perl_croak(aTHX_ "Can't weaken a nonreference");
5144 else if (SvWEAKREF(sv)) {
5145 if (ckWARN(WARN_MISC))
5146 Perl_warner(aTHX_ packWARN(WARN_MISC), "Reference is already weak");
5150 sv_add_backref(tsv, sv);
5156 /* Give tsv backref magic if it hasn't already got it, then push a
5157 * back-reference to sv onto the array associated with the backref magic.
5161 S_sv_add_backref(pTHX_ SV *tsv, SV *sv)
5165 if (SvMAGICAL(tsv) && (mg = mg_find(tsv, PERL_MAGIC_backref)))
5166 av = (AV*)mg->mg_obj;
5169 sv_magic(tsv, (SV*)av, PERL_MAGIC_backref, NULL, 0);
5170 /* av now has a refcnt of 2, which avoids it getting freed
5171 * before us during global cleanup. The extra ref is removed
5172 * by magic_killbackrefs() when tsv is being freed */
5174 if (AvFILLp(av) >= AvMAX(av)) {
5176 SV **svp = AvARRAY(av);
5177 for (i = AvFILLp(av); i >= 0; i--)
5179 svp[i] = sv; /* reuse the slot */
5182 av_extend(av, AvFILLp(av)+1);
5184 AvARRAY(av)[++AvFILLp(av)] = sv; /* av_push() */
5187 /* delete a back-reference to ourselves from the backref magic associated
5188 * with the SV we point to.
5192 S_sv_del_backref(pTHX_ SV *sv)
5199 if (!SvMAGICAL(tsv) || !(mg = mg_find(tsv, PERL_MAGIC_backref)))
5200 Perl_croak(aTHX_ "panic: del_backref");
5201 av = (AV *)mg->mg_obj;
5203 for (i = AvFILLp(av); i >= 0; i--)
5204 if (svp[i] == sv) svp[i] = Nullsv;
5208 =for apidoc sv_insert
5210 Inserts a string at the specified offset/length within the SV. Similar to
5211 the Perl substr() function.
5217 Perl_sv_insert(pTHX_ SV *bigstr, STRLEN offset, STRLEN len, char *little, STRLEN littlelen)
5221 register char *midend;
5222 register char *bigend;
5228 Perl_croak(aTHX_ "Can't modify non-existent substring");
5229 SvPV_force(bigstr, curlen);
5230 (void)SvPOK_only_UTF8(bigstr);
5231 if (offset + len > curlen) {
5232 SvGROW(bigstr, offset+len+1);
5233 Zero(SvPVX(bigstr)+curlen, offset+len-curlen, char);
5234 SvCUR_set(bigstr, offset+len);
5238 i = littlelen - len;
5239 if (i > 0) { /* string might grow */
5240 big = SvGROW(bigstr, SvCUR(bigstr) + i + 1);
5241 mid = big + offset + len;
5242 midend = bigend = big + SvCUR(bigstr);
5245 while (midend > mid) /* shove everything down */
5246 *--bigend = *--midend;
5247 Move(little,big+offset,littlelen,char);
5253 Move(little,SvPVX(bigstr)+offset,len,char);
5258 big = SvPVX(bigstr);
5261 bigend = big + SvCUR(bigstr);
5263 if (midend > bigend)
5264 Perl_croak(aTHX_ "panic: sv_insert");
5266 if (mid - big > bigend - midend) { /* faster to shorten from end */
5268 Move(little, mid, littlelen,char);
5271 i = bigend - midend;
5273 Move(midend, mid, i,char);
5277 SvCUR_set(bigstr, mid - big);
5280 else if ((i = mid - big)) { /* faster from front */
5281 midend -= littlelen;
5283 sv_chop(bigstr,midend-i);
5288 Move(little, mid, littlelen,char);
5290 else if (littlelen) {
5291 midend -= littlelen;
5292 sv_chop(bigstr,midend);
5293 Move(little,midend,littlelen,char);
5296 sv_chop(bigstr,midend);
5302 =for apidoc sv_replace
5304 Make the first argument a copy of the second, then delete the original.
5305 The target SV physically takes over ownership of the body of the source SV
5306 and inherits its flags; however, the target keeps any magic it owns,
5307 and any magic in the source is discarded.
5308 Note that this is a rather specialist SV copying operation; most of the
5309 time you'll want to use C<sv_setsv> or one of its many macro front-ends.
5315 Perl_sv_replace(pTHX_ register SV *sv, register SV *nsv)
5317 U32 refcnt = SvREFCNT(sv);
5318 SV_CHECK_THINKFIRST_COW_DROP(sv);
5319 if (SvREFCNT(nsv) != 1 && ckWARN_d(WARN_INTERNAL))
5320 Perl_warner(aTHX_ packWARN(WARN_INTERNAL), "Reference miscount in sv_replace()");
5321 if (SvMAGICAL(sv)) {
5325 sv_upgrade(nsv, SVt_PVMG);
5326 SvMAGIC(nsv) = SvMAGIC(sv);
5327 SvFLAGS(nsv) |= SvMAGICAL(sv);
5333 assert(!SvREFCNT(sv));
5334 StructCopy(nsv,sv,SV);
5335 #ifdef PERL_COPY_ON_WRITE
5336 if (SvIsCOW_normal(nsv)) {
5337 /* We need to follow the pointers around the loop to make the
5338 previous SV point to sv, rather than nsv. */
5341 while ((next = SV_COW_NEXT_SV(current)) != nsv) {
5344 assert(SvPVX(current) == SvPVX(nsv));
5346 /* Make the SV before us point to the SV after us. */
5348 PerlIO_printf(Perl_debug_log, "previous is\n");
5350 PerlIO_printf(Perl_debug_log,
5351 "move it from 0x%"UVxf" to 0x%"UVxf"\n",
5352 (UV) SV_COW_NEXT_SV(current), (UV) sv);
5354 SV_COW_NEXT_SV_SET(current, sv);
5357 SvREFCNT(sv) = refcnt;
5358 SvFLAGS(nsv) |= SVTYPEMASK; /* Mark as freed */
5364 =for apidoc sv_clear
5366 Clear an SV: call any destructors, free up any memory used by the body,
5367 and free the body itself. The SV's head is I<not> freed, although
5368 its type is set to all 1's so that it won't inadvertently be assumed
5369 to be live during global destruction etc.
5370 This function should only be called when REFCNT is zero. Most of the time
5371 you'll want to call C<sv_free()> (or its macro wrapper C<SvREFCNT_dec>)
5378 Perl_sv_clear(pTHX_ register SV *sv)
5382 assert(SvREFCNT(sv) == 0);
5385 if (PL_defstash) { /* Still have a symbol table? */
5392 stash = SvSTASH(sv);
5393 destructor = StashHANDLER(stash,DESTROY);
5395 SV* tmpref = newRV(sv);
5396 SvREADONLY_on(tmpref); /* DESTROY() could be naughty */
5398 PUSHSTACKi(PERLSI_DESTROY);
5403 call_sv((SV*)destructor, G_DISCARD|G_EVAL|G_KEEPERR|G_VOID);
5409 if(SvREFCNT(tmpref) < 2) {
5410 /* tmpref is not kept alive! */
5415 SvREFCNT_dec(tmpref);
5417 } while (SvOBJECT(sv) && SvSTASH(sv) != stash);
5421 if (PL_in_clean_objs)
5422 Perl_croak(aTHX_ "DESTROY created new reference to dead object '%s'",
5424 /* DESTROY gave object new lease on life */
5430 SvREFCNT_dec(SvSTASH(sv)); /* possibly of changed persuasion */
5431 SvOBJECT_off(sv); /* Curse the object. */
5432 if (SvTYPE(sv) != SVt_PVIO)
5433 --PL_sv_objcount; /* XXX Might want something more general */
5436 if (SvTYPE(sv) >= SVt_PVMG) {
5439 if (SvFLAGS(sv) & SVpad_TYPED)
5440 SvREFCNT_dec(SvSTASH(sv));
5443 switch (SvTYPE(sv)) {
5446 IoIFP(sv) != PerlIO_stdin() &&
5447 IoIFP(sv) != PerlIO_stdout() &&
5448 IoIFP(sv) != PerlIO_stderr())
5450 io_close((IO*)sv, FALSE);
5452 if (IoDIRP(sv) && !(IoFLAGS(sv) & IOf_FAKE_DIRP))
5453 PerlDir_close(IoDIRP(sv));
5454 IoDIRP(sv) = (DIR*)NULL;
5455 Safefree(IoTOP_NAME(sv));
5456 Safefree(IoFMT_NAME(sv));
5457 Safefree(IoBOTTOM_NAME(sv));
5472 if (LvTYPE(sv) == 'T') { /* for tie: return HE to pool */
5473 SvREFCNT_dec(HeKEY_sv((HE*)LvTARG(sv)));
5474 HeNEXT((HE*)LvTARG(sv)) = PL_hv_fetch_ent_mh;
5475 PL_hv_fetch_ent_mh = (HE*)LvTARG(sv);
5477 else if (LvTYPE(sv) != 't') /* unless tie: unrefcnted fake SV** */
5478 SvREFCNT_dec(LvTARG(sv));
5482 Safefree(GvNAME(sv));
5483 /* cannot decrease stash refcount yet, as we might recursively delete
5484 ourselves when the refcnt drops to zero. Delay SvREFCNT_dec
5485 of stash until current sv is completely gone.
5486 -- JohnPC, 27 Mar 1998 */
5487 stash = GvSTASH(sv);
5493 (void)SvOOK_off(sv);
5501 SvREFCNT_dec(SvRV(sv));
5503 #ifdef PERL_COPY_ON_WRITE
5504 else if (SvPVX(sv)) {
5506 /* I believe I need to grab the global SV mutex here and
5507 then recheck the COW status. */
5509 PerlIO_printf(Perl_debug_log, "Copy on write: clear\n");
5512 sv_release_COW(sv, SvPVX(sv), SvCUR(sv), SvLEN(sv),
5513 SvUVX(sv), SV_COW_NEXT_SV(sv));
5514 /* And drop it here. */
5516 } else if (SvLEN(sv)) {
5517 Safefree(SvPVX(sv));
5521 else if (SvPVX(sv) && SvLEN(sv))
5522 Safefree(SvPVX(sv));
5523 else if (SvPVX(sv) && SvREADONLY(sv) && SvFAKE(sv)) {
5524 unsharepvn(SvPVX(sv),
5525 SvUTF8(sv) ? -(I32)SvCUR(sv) : SvCUR(sv),
5539 switch (SvTYPE(sv)) {
5555 del_XPVIV(SvANY(sv));
5558 del_XPVNV(SvANY(sv));
5561 del_XPVMG(SvANY(sv));
5564 del_XPVLV(SvANY(sv));
5567 del_XPVAV(SvANY(sv));
5570 del_XPVHV(SvANY(sv));
5573 del_XPVCV(SvANY(sv));
5576 del_XPVGV(SvANY(sv));
5577 /* code duplication for increased performance. */
5578 SvFLAGS(sv) &= SVf_BREAK;
5579 SvFLAGS(sv) |= SVTYPEMASK;
5580 /* decrease refcount of the stash that owns this GV, if any */
5582 SvREFCNT_dec(stash);
5583 return; /* not break, SvFLAGS reset already happened */
5585 del_XPVBM(SvANY(sv));
5588 del_XPVFM(SvANY(sv));
5591 del_XPVIO(SvANY(sv));
5594 SvFLAGS(sv) &= SVf_BREAK;
5595 SvFLAGS(sv) |= SVTYPEMASK;
5599 =for apidoc sv_newref
5601 Increment an SV's reference count. Use the C<SvREFCNT_inc()> wrapper
5608 Perl_sv_newref(pTHX_ SV *sv)
5618 Decrement an SV's reference count, and if it drops to zero, call
5619 C<sv_clear> to invoke destructors and free up any memory used by
5620 the body; finally, deallocate the SV's head itself.
5621 Normally called via a wrapper macro C<SvREFCNT_dec>.
5627 Perl_sv_free(pTHX_ SV *sv)
5631 if (SvREFCNT(sv) == 0) {
5632 if (SvFLAGS(sv) & SVf_BREAK)
5633 /* this SV's refcnt has been artificially decremented to
5634 * trigger cleanup */
5636 if (PL_in_clean_all) /* All is fair */
5638 if (SvREADONLY(sv) && SvIMMORTAL(sv)) {
5639 /* make sure SvREFCNT(sv)==0 happens very seldom */
5640 SvREFCNT(sv) = (~(U32)0)/2;
5643 if (ckWARN_d(WARN_INTERNAL))
5644 Perl_warner(aTHX_ packWARN(WARN_INTERNAL),
5645 "Attempt to free unreferenced scalar: SV 0x%"UVxf,
5649 if (--(SvREFCNT(sv)) > 0)
5651 Perl_sv_free2(aTHX_ sv);
5655 Perl_sv_free2(pTHX_ SV *sv)
5659 if (ckWARN_d(WARN_DEBUGGING))
5660 Perl_warner(aTHX_ packWARN(WARN_DEBUGGING),
5661 "Attempt to free temp prematurely: SV 0x%"UVxf,
5666 if (SvREADONLY(sv) && SvIMMORTAL(sv)) {
5667 /* make sure SvREFCNT(sv)==0 happens very seldom */
5668 SvREFCNT(sv) = (~(U32)0)/2;
5679 Returns the length of the string in the SV. Handles magic and type
5680 coercion. See also C<SvCUR>, which gives raw access to the xpv_cur slot.
5686 Perl_sv_len(pTHX_ register SV *sv)
5694 len = mg_length(sv);
5696 (void)SvPV(sv, len);
5701 =for apidoc sv_len_utf8
5703 Returns the number of characters in the string in an SV, counting wide
5704 UTF-8 bytes as a single character. Handles magic and type coercion.
5710 * The length is cached in PERL_UTF8_magic, in the mg_len field. Also the
5711 * mg_ptr is used, by sv_pos_u2b(), see the comments of S_utf8_mg_pos_init().
5712 * (Note that the mg_len is not the length of the mg_ptr field.)
5717 Perl_sv_len_utf8(pTHX_ register SV *sv)
5723 return mg_length(sv);
5727 U8 *s = (U8*)SvPV(sv, len);
5728 MAGIC *mg = SvMAGICAL(sv) ? mg_find(sv, PERL_MAGIC_utf8) : 0;
5730 if (mg && mg->mg_len != -1 && (mg->mg_len > 0 || len == 0)) {
5732 #ifdef PERL_UTF8_CACHE_ASSERT
5733 assert(ulen == Perl_utf8_length(aTHX_ s, s + len));
5737 ulen = Perl_utf8_length(aTHX_ s, s + len);
5738 if (!mg && !SvREADONLY(sv)) {
5739 sv_magic(sv, 0, PERL_MAGIC_utf8, 0, 0);
5740 mg = mg_find(sv, PERL_MAGIC_utf8);
5750 /* S_utf8_mg_pos_init() is used to initialize the mg_ptr field of
5751 * a PERL_UTF8_magic. The mg_ptr is used to store the mapping
5752 * between UTF-8 and byte offsets. There are two (substr offset and substr
5753 * length, the i offset, PERL_MAGIC_UTF8_CACHESIZE) times two (UTF-8 offset
5754 * and byte offset) cache positions.
5756 * The mg_len field is used by sv_len_utf8(), see its comments.
5757 * Note that the mg_len is not the length of the mg_ptr field.
5761 S_utf8_mg_pos_init(pTHX_ SV *sv, MAGIC **mgp, STRLEN **cachep, I32 i, I32 *offsetp, U8 *s, U8 *start)
5765 if (SvMAGICAL(sv) && !SvREADONLY(sv)) {
5767 *mgp = sv_magicext(sv, 0, PERL_MAGIC_utf8, &PL_vtbl_utf8, 0, 0);
5771 *cachep = (STRLEN *) (*mgp)->mg_ptr;
5773 Newz(0, *cachep, PERL_MAGIC_UTF8_CACHESIZE * 2, STRLEN);
5774 (*mgp)->mg_ptr = (char *) *cachep;
5778 (*cachep)[i] = *offsetp;
5779 (*cachep)[i+1] = s - start;
5787 * S_utf8_mg_pos() is used to query and update mg_ptr field of
5788 * a PERL_UTF8_magic. The mg_ptr is used to store the mapping
5789 * between UTF-8 and byte offsets. See also the comments of
5790 * S_utf8_mg_pos_init().
5794 S_utf8_mg_pos(pTHX_ SV *sv, MAGIC **mgp, STRLEN **cachep, I32 i, I32 *offsetp, I32 uoff, U8 **sp, U8 *start, U8 *send)
5798 if (SvMAGICAL(sv) && !SvREADONLY(sv)) {
5800 *mgp = mg_find(sv, PERL_MAGIC_utf8);
5801 if (*mgp && (*mgp)->mg_ptr) {
5802 *cachep = (STRLEN *) (*mgp)->mg_ptr;
5803 ASSERT_UTF8_CACHE(*cachep);
5804 if ((*cachep)[i] == (STRLEN)uoff) /* An exact match. */
5806 else { /* We will skip to the right spot. */
5811 /* The assumption is that going backward is half
5812 * the speed of going forward (that's where the
5813 * 2 * backw in the below comes from). (The real
5814 * figure of course depends on the UTF-8 data.) */
5816 if ((*cachep)[i] > (STRLEN)uoff) {
5818 backw = (*cachep)[i] - (STRLEN)uoff;
5820 if (forw < 2 * backw)
5823 p = start + (*cachep)[i+1];
5825 /* Try this only for the substr offset (i == 0),
5826 * not for the substr length (i == 2). */
5827 else if (i == 0) { /* (*cachep)[i] < uoff */
5828 STRLEN ulen = sv_len_utf8(sv);
5830 if ((STRLEN)uoff < ulen) {
5831 forw = (STRLEN)uoff - (*cachep)[i];
5832 backw = ulen - (STRLEN)uoff;
5834 if (forw < 2 * backw)
5835 p = start + (*cachep)[i+1];
5840 /* If the string is not long enough for uoff,
5841 * we could extend it, but not at this low a level. */
5845 if (forw < 2 * backw) {
5852 while (UTF8_IS_CONTINUATION(*p))
5857 /* Update the cache. */
5858 (*cachep)[i] = (STRLEN)uoff;
5859 (*cachep)[i+1] = p - start;
5861 /* Drop the stale "length" cache */
5870 if (found) { /* Setup the return values. */
5871 *offsetp = (*cachep)[i+1];
5872 *sp = start + *offsetp;
5875 *offsetp = send - start;
5877 else if (*sp < start) {
5883 #ifdef PERL_UTF8_CACHE_ASSERT
5888 while (n-- && s < send)
5892 assert(*offsetp == s - start);
5893 assert((*cachep)[0] == (STRLEN)uoff);
5894 assert((*cachep)[1] == *offsetp);
5896 ASSERT_UTF8_CACHE(*cachep);
5905 =for apidoc sv_pos_u2b
5907 Converts the value pointed to by offsetp from a count of UTF-8 chars from
5908 the start of the string, to a count of the equivalent number of bytes; if
5909 lenp is non-zero, it does the same to lenp, but this time starting from
5910 the offset, rather than from the start of the string. Handles magic and
5917 * sv_pos_u2b() uses, like sv_pos_b2u(), the mg_ptr of the potential
5918 * PERL_UTF8_magic of the sv to store the mapping between UTF-8 and
5919 * byte offsets. See also the comments of S_utf8_mg_pos().
5924 Perl_sv_pos_u2b(pTHX_ register SV *sv, I32* offsetp, I32* lenp)
5935 start = s = (U8*)SvPV(sv, len);
5937 I32 uoffset = *offsetp;
5942 if (utf8_mg_pos(sv, &mg, &cache, 0, offsetp, *offsetp, &s, start, send))
5944 if (!found && uoffset > 0) {
5945 while (s < send && uoffset--)
5949 if (utf8_mg_pos_init(sv, &mg, &cache, 0, offsetp, s, start))
5951 *offsetp = s - start;
5956 if (utf8_mg_pos(sv, &mg, &cache, 2, lenp, *lenp + *offsetp, &s, start, send)) {
5960 if (!found && *lenp > 0) {
5963 while (s < send && ulen--)
5967 if (utf8_mg_pos_init(sv, &mg, &cache, 2, lenp, s, start))
5968 cache[2] += *offsetp;
5972 ASSERT_UTF8_CACHE(cache);
5984 =for apidoc sv_pos_b2u
5986 Converts the value pointed to by offsetp from a count of bytes from the
5987 start of the string, to a count of the equivalent number of UTF-8 chars.
5988 Handles magic and type coercion.
5994 * sv_pos_b2u() uses, like sv_pos_u2b(), the mg_ptr of the potential
5995 * PERL_UTF8_magic of the sv to store the mapping between UTF-8 and
5996 * byte offsets. See also the comments of S_utf8_mg_pos().
6001 Perl_sv_pos_b2u(pTHX_ register SV* sv, I32* offsetp)
6009 s = (U8*)SvPV(sv, len);
6010 if ((I32)len < *offsetp)
6011 Perl_croak(aTHX_ "panic: sv_pos_b2u: bad byte offset");
6013 U8* send = s + *offsetp;
6015 STRLEN *cache = NULL;
6019 if (SvMAGICAL(sv) && !SvREADONLY(sv)) {
6020 mg = mg_find(sv, PERL_MAGIC_utf8);
6021 if (mg && mg->mg_ptr) {
6022 cache = (STRLEN *) mg->mg_ptr;
6023 if (cache[1] == (STRLEN)*offsetp) {
6024 /* An exact match. */
6025 *offsetp = cache[0];
6029 else if (cache[1] < (STRLEN)*offsetp) {
6030 /* We already know part of the way. */
6033 /* Let the below loop do the rest. */
6035 else { /* cache[1] > *offsetp */
6036 /* We already know all of the way, now we may
6037 * be able to walk back. The same assumption
6038 * is made as in S_utf8_mg_pos(), namely that
6039 * walking backward is twice slower than
6040 * walking forward. */
6041 STRLEN forw = *offsetp;
6042 STRLEN backw = cache[1] - *offsetp;
6044 if (!(forw < 2 * backw)) {
6045 U8 *p = s + cache[1];
6052 while (UTF8_IS_CONTINUATION(*p)) {
6060 *offsetp = cache[0];
6065 ASSERT_UTF8_CACHE(cache);
6071 /* Call utf8n_to_uvchr() to validate the sequence
6072 * (unless a simple non-UTF character) */
6073 if (!UTF8_IS_INVARIANT(*s))
6074 utf8n_to_uvchr(s, UTF8SKIP(s), &n, 0);
6083 if (!SvREADONLY(sv)) {
6085 sv_magic(sv, 0, PERL_MAGIC_utf8, 0, 0);
6086 mg = mg_find(sv, PERL_MAGIC_utf8);
6091 Newz(0, cache, PERL_MAGIC_UTF8_CACHESIZE * 2, STRLEN);
6092 mg->mg_ptr = (char *) cache;
6097 cache[1] = *offsetp;
6108 Returns a boolean indicating whether the strings in the two SVs are
6109 identical. Is UTF-8 and 'use bytes' aware, handles get magic, and will
6110 coerce its args to strings if necessary.
6116 Perl_sv_eq(pTHX_ register SV *sv1, register SV *sv2)
6124 SV* svrecode = Nullsv;
6131 pv1 = SvPV(sv1, cur1);
6138 pv2 = SvPV(sv2, cur2);
6140 if (cur1 && cur2 && SvUTF8(sv1) != SvUTF8(sv2) && !IN_BYTES) {
6141 /* Differing utf8ness.
6142 * Do not UTF8size the comparands as a side-effect. */
6145 svrecode = newSVpvn(pv2, cur2);
6146 sv_recode_to_utf8(svrecode, PL_encoding);
6147 pv2 = SvPV(svrecode, cur2);
6150 svrecode = newSVpvn(pv1, cur1);
6151 sv_recode_to_utf8(svrecode, PL_encoding);
6152 pv1 = SvPV(svrecode, cur1);
6154 /* Now both are in UTF-8. */
6159 bool is_utf8 = TRUE;
6162 /* sv1 is the UTF-8 one,
6163 * if is equal it must be downgrade-able */
6164 char *pv = (char*)bytes_from_utf8((U8*)pv1,
6170 /* sv2 is the UTF-8 one,
6171 * if is equal it must be downgrade-able */
6172 char *pv = (char *)bytes_from_utf8((U8*)pv2,
6178 /* Downgrade not possible - cannot be eq */
6185 eq = (pv1 == pv2) || memEQ(pv1, pv2, cur1);
6188 SvREFCNT_dec(svrecode);
6199 Compares the strings in two SVs. Returns -1, 0, or 1 indicating whether the
6200 string in C<sv1> is less than, equal to, or greater than the string in
6201 C<sv2>. Is UTF-8 and 'use bytes' aware, handles get magic, and will
6202 coerce its args to strings if necessary. See also C<sv_cmp_locale>.
6208 Perl_sv_cmp(pTHX_ register SV *sv1, register SV *sv2)
6211 char *pv1, *pv2, *tpv = Nullch;
6213 SV *svrecode = Nullsv;
6220 pv1 = SvPV(sv1, cur1);
6227 pv2 = SvPV(sv2, cur2);
6229 if (cur1 && cur2 && SvUTF8(sv1) != SvUTF8(sv2) && !IN_BYTES) {
6230 /* Differing utf8ness.
6231 * Do not UTF8size the comparands as a side-effect. */
6234 svrecode = newSVpvn(pv2, cur2);
6235 sv_recode_to_utf8(svrecode, PL_encoding);
6236 pv2 = SvPV(svrecode, cur2);
6239 pv2 = tpv = (char*)bytes_to_utf8((U8*)pv2, &cur2);
6244 svrecode = newSVpvn(pv1, cur1);
6245 sv_recode_to_utf8(svrecode, PL_encoding);
6246 pv1 = SvPV(svrecode, cur1);
6249 pv1 = tpv = (char*)bytes_to_utf8((U8*)pv1, &cur1);
6255 cmp = cur2 ? -1 : 0;
6259 I32 retval = memcmp((void*)pv1, (void*)pv2, cur1 < cur2 ? cur1 : cur2);
6262 cmp = retval < 0 ? -1 : 1;
6263 } else if (cur1 == cur2) {
6266 cmp = cur1 < cur2 ? -1 : 1;
6271 SvREFCNT_dec(svrecode);
6280 =for apidoc sv_cmp_locale
6282 Compares the strings in two SVs in a locale-aware manner. Is UTF-8 and
6283 'use bytes' aware, handles get magic, and will coerce its args to strings
6284 if necessary. See also C<sv_cmp_locale>. See also C<sv_cmp>.
6290 Perl_sv_cmp_locale(pTHX_ register SV *sv1, register SV *sv2)
6292 #ifdef USE_LOCALE_COLLATE
6298 if (PL_collation_standard)
6302 pv1 = sv1 ? sv_collxfrm(sv1, &len1) : (char *) NULL;
6304 pv2 = sv2 ? sv_collxfrm(sv2, &len2) : (char *) NULL;
6306 if (!pv1 || !len1) {
6317 retval = memcmp((void*)pv1, (void*)pv2, len1 < len2 ? len1 : len2);
6320 return retval < 0 ? -1 : 1;
6323 * When the result of collation is equality, that doesn't mean
6324 * that there are no differences -- some locales exclude some
6325 * characters from consideration. So to avoid false equalities,
6326 * we use the raw string as a tiebreaker.
6332 #endif /* USE_LOCALE_COLLATE */
6334 return sv_cmp(sv1, sv2);
6338 #ifdef USE_LOCALE_COLLATE
6341 =for apidoc sv_collxfrm
6343 Add Collate Transform magic to an SV if it doesn't already have it.
6345 Any scalar variable may carry PERL_MAGIC_collxfrm magic that contains the
6346 scalar data of the variable, but transformed to such a format that a normal
6347 memory comparison can be used to compare the data according to the locale
6354 Perl_sv_collxfrm(pTHX_ SV *sv, STRLEN *nxp)
6358 mg = SvMAGICAL(sv) ? mg_find(sv, PERL_MAGIC_collxfrm) : (MAGIC *) NULL;
6359 if (!mg || !mg->mg_ptr || *(U32*)mg->mg_ptr != PL_collation_ix) {
6364 Safefree(mg->mg_ptr);
6366 if ((xf = mem_collxfrm(s, len, &xlen))) {
6367 if (SvREADONLY(sv)) {
6370 return xf + sizeof(PL_collation_ix);
6373 sv_magic(sv, 0, PERL_MAGIC_collxfrm, 0, 0);
6374 mg = mg_find(sv, PERL_MAGIC_collxfrm);
6387 if (mg && mg->mg_ptr) {
6389 return mg->mg_ptr + sizeof(PL_collation_ix);
6397 #endif /* USE_LOCALE_COLLATE */
6402 Get a line from the filehandle and store it into the SV, optionally
6403 appending to the currently-stored string.
6409 Perl_sv_gets(pTHX_ register SV *sv, register PerlIO *fp, I32 append)
6413 register STDCHAR rslast;
6414 register STDCHAR *bp;
6420 if (SvTHINKFIRST(sv))
6421 sv_force_normal_flags(sv, append ? 0 : SV_COW_DROP_PV);
6422 /* XXX. If you make this PVIV, then copy on write can copy scalars read
6424 However, perlbench says it's slower, because the existing swipe code
6425 is faster than copy on write.
6426 Swings and roundabouts. */
6427 (void)SvUPGRADE(sv, SVt_PV);
6432 if (PerlIO_isutf8(fp)) {
6434 sv_utf8_upgrade_nomg(sv);
6435 sv_pos_u2b(sv,&append,0);
6437 } else if (SvUTF8(sv)) {
6438 SV *tsv = NEWSV(0,0);
6439 sv_gets(tsv, fp, 0);
6440 sv_utf8_upgrade_nomg(tsv);
6441 SvCUR_set(sv,append);
6444 goto return_string_or_null;
6449 if (PerlIO_isutf8(fp))
6452 if (IN_PERL_COMPILETIME) {
6453 /* we always read code in line mode */
6457 else if (RsSNARF(PL_rs)) {
6458 /* If it is a regular disk file use size from stat() as estimate
6459 of amount we are going to read - may result in malloc-ing
6460 more memory than we realy need if layers bellow reduce
6461 size we read (e.g. CRLF or a gzip layer)
6464 if (!PerlLIO_fstat(PerlIO_fileno(fp), &st) && S_ISREG(st.st_mode)) {
6465 Off_t offset = PerlIO_tell(fp);
6466 if (offset != (Off_t) -1 && st.st_size + append > offset) {
6467 (void) SvGROW(sv, (STRLEN)((st.st_size - offset) + append + 1));
6473 else if (RsRECORD(PL_rs)) {
6477 /* Grab the size of the record we're getting */
6478 recsize = SvIV(SvRV(PL_rs));
6479 buffer = SvGROW(sv, (STRLEN)(recsize + append + 1)) + append;
6482 /* VMS wants read instead of fread, because fread doesn't respect */
6483 /* RMS record boundaries. This is not necessarily a good thing to be */
6484 /* doing, but we've got no other real choice - except avoid stdio
6485 as implementation - perhaps write a :vms layer ?
6487 bytesread = PerlLIO_read(PerlIO_fileno(fp), buffer, recsize);
6489 bytesread = PerlIO_read(fp, buffer, recsize);
6493 SvCUR_set(sv, bytesread += append);
6494 buffer[bytesread] = '\0';
6495 goto return_string_or_null;
6497 else if (RsPARA(PL_rs)) {
6503 /* Get $/ i.e. PL_rs into same encoding as stream wants */
6504 if (PerlIO_isutf8(fp)) {
6505 rsptr = SvPVutf8(PL_rs, rslen);
6508 if (SvUTF8(PL_rs)) {
6509 if (!sv_utf8_downgrade(PL_rs, TRUE)) {
6510 Perl_croak(aTHX_ "Wide character in $/");
6513 rsptr = SvPV(PL_rs, rslen);
6517 rslast = rslen ? rsptr[rslen - 1] : '\0';
6519 if (rspara) { /* have to do this both before and after */
6520 do { /* to make sure file boundaries work right */
6523 i = PerlIO_getc(fp);
6527 PerlIO_ungetc(fp,i);
6533 /* See if we know enough about I/O mechanism to cheat it ! */
6535 /* This used to be #ifdef test - it is made run-time test for ease
6536 of abstracting out stdio interface. One call should be cheap
6537 enough here - and may even be a macro allowing compile
6541 if (PerlIO_fast_gets(fp)) {
6544 * We're going to steal some values from the stdio struct
6545 * and put EVERYTHING in the innermost loop into registers.
6547 register STDCHAR *ptr;
6551 #if defined(VMS) && defined(PERLIO_IS_STDIO)
6552 /* An ungetc()d char is handled separately from the regular
6553 * buffer, so we getc() it back out and stuff it in the buffer.
6555 i = PerlIO_getc(fp);
6556 if (i == EOF) return 0;
6557 *(--((*fp)->_ptr)) = (unsigned char) i;
6561 /* Here is some breathtakingly efficient cheating */
6563 cnt = PerlIO_get_cnt(fp); /* get count into register */
6564 /* make sure we have the room */
6565 if ((I32)(SvLEN(sv) - append) <= cnt + 1) {
6566 /* Not room for all of it
6567 if we are looking for a separator and room for some
6569 if (rslen && cnt > 80 && (I32)SvLEN(sv) > append) {
6570 /* just process what we have room for */
6571 shortbuffered = cnt - SvLEN(sv) + append + 1;
6572 cnt -= shortbuffered;
6576 /* remember that cnt can be negative */
6577 SvGROW(sv, (STRLEN)(append + (cnt <= 0 ? 2 : (cnt + 1))));
6582 bp = (STDCHAR*)SvPVX(sv) + append; /* move these two too to registers */
6583 ptr = (STDCHAR*)PerlIO_get_ptr(fp);
6584 DEBUG_P(PerlIO_printf(Perl_debug_log,
6585 "Screamer: entering, ptr=%"UVuf", cnt=%ld\n",PTR2UV(ptr),(long)cnt));
6586 DEBUG_P(PerlIO_printf(Perl_debug_log,
6587 "Screamer: entering: PerlIO * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
6588 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
6589 PTR2UV(PerlIO_has_base(fp) ? PerlIO_get_base(fp) : 0)));
6594 while (cnt > 0) { /* this | eat */
6596 if ((*bp++ = *ptr++) == rslast) /* really | dust */
6597 goto thats_all_folks; /* screams | sed :-) */
6601 Copy(ptr, bp, cnt, char); /* this | eat */
6602 bp += cnt; /* screams | dust */
6603 ptr += cnt; /* louder | sed :-) */
6608 if (shortbuffered) { /* oh well, must extend */
6609 cnt = shortbuffered;
6611 bpx = bp - (STDCHAR*)SvPVX(sv); /* box up before relocation */
6613 SvGROW(sv, SvLEN(sv) + append + cnt + 2);
6614 bp = (STDCHAR*)SvPVX(sv) + bpx; /* unbox after relocation */
6618 DEBUG_P(PerlIO_printf(Perl_debug_log,
6619 "Screamer: going to getc, ptr=%"UVuf", cnt=%ld\n",
6620 PTR2UV(ptr),(long)cnt));
6621 PerlIO_set_ptrcnt(fp, (STDCHAR*)ptr, cnt); /* deregisterize cnt and ptr */
6623 DEBUG_P(PerlIO_printf(Perl_debug_log,
6624 "Screamer: pre: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
6625 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
6626 PTR2UV(PerlIO_has_base (fp) ? PerlIO_get_base(fp) : 0)));
6628 /* This used to call 'filbuf' in stdio form, but as that behaves like
6629 getc when cnt <= 0 we use PerlIO_getc here to avoid introducing
6630 another abstraction. */
6631 i = PerlIO_getc(fp); /* get more characters */
6633 DEBUG_P(PerlIO_printf(Perl_debug_log,
6634 "Screamer: post: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
6635 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
6636 PTR2UV(PerlIO_has_base (fp) ? PerlIO_get_base(fp) : 0)));
6638 cnt = PerlIO_get_cnt(fp);
6639 ptr = (STDCHAR*)PerlIO_get_ptr(fp); /* reregisterize cnt and ptr */
6640 DEBUG_P(PerlIO_printf(Perl_debug_log,
6641 "Screamer: after getc, ptr=%"UVuf", cnt=%ld\n",PTR2UV(ptr),(long)cnt));
6643 if (i == EOF) /* all done for ever? */
6644 goto thats_really_all_folks;
6646 bpx = bp - (STDCHAR*)SvPVX(sv); /* box up before relocation */
6648 SvGROW(sv, bpx + cnt + 2);
6649 bp = (STDCHAR*)SvPVX(sv) + bpx; /* unbox after relocation */
6651 *bp++ = (STDCHAR)i; /* store character from PerlIO_getc */
6653 if (rslen && (STDCHAR)i == rslast) /* all done for now? */
6654 goto thats_all_folks;
6658 if ((rslen > 1 && (STRLEN)(bp - (STDCHAR*)SvPVX(sv)) < rslen) ||
6659 memNE((char*)bp - rslen, rsptr, rslen))
6660 goto screamer; /* go back to the fray */
6661 thats_really_all_folks:
6663 cnt += shortbuffered;
6664 DEBUG_P(PerlIO_printf(Perl_debug_log,
6665 "Screamer: quitting, ptr=%"UVuf", cnt=%ld\n",PTR2UV(ptr),(long)cnt));
6666 PerlIO_set_ptrcnt(fp, (STDCHAR*)ptr, cnt); /* put these back or we're in trouble */
6667 DEBUG_P(PerlIO_printf(Perl_debug_log,
6668 "Screamer: end: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
6669 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
6670 PTR2UV(PerlIO_has_base (fp) ? PerlIO_get_base(fp) : 0)));
6672 SvCUR_set(sv, bp - (STDCHAR*)SvPVX(sv)); /* set length */
6673 DEBUG_P(PerlIO_printf(Perl_debug_log,
6674 "Screamer: done, len=%ld, string=|%.*s|\n",
6675 (long)SvCUR(sv),(int)SvCUR(sv),SvPVX(sv)));
6679 /*The big, slow, and stupid way. */
6681 /* Any stack-challenged places. */
6683 /* EPOC: need to work around SDK features. *
6684 * On WINS: MS VC5 generates calls to _chkstk, *
6685 * if a "large" stack frame is allocated. *
6686 * gcc on MARM does not generate calls like these. */
6687 # define USEHEAPINSTEADOFSTACK
6690 #ifdef USEHEAPINSTEADOFSTACK
6692 New(0, buf, 8192, STDCHAR);
6700 register STDCHAR *bpe = buf + sizeof(buf);
6702 while ((i = PerlIO_getc(fp)) != EOF && (*bp++ = (STDCHAR)i) != rslast && bp < bpe)
6703 ; /* keep reading */
6707 cnt = PerlIO_read(fp,(char*)buf, sizeof(buf));
6708 /* Accomodate broken VAXC compiler, which applies U8 cast to
6709 * both args of ?: operator, causing EOF to change into 255
6712 i = (U8)buf[cnt - 1];
6718 cnt = 0; /* we do need to re-set the sv even when cnt <= 0 */
6720 sv_catpvn(sv, (char *) buf, cnt);
6722 sv_setpvn(sv, (char *) buf, cnt);
6724 if (i != EOF && /* joy */
6726 SvCUR(sv) < rslen ||
6727 memNE(SvPVX(sv) + SvCUR(sv) - rslen, rsptr, rslen)))
6731 * If we're reading from a TTY and we get a short read,
6732 * indicating that the user hit his EOF character, we need
6733 * to notice it now, because if we try to read from the TTY
6734 * again, the EOF condition will disappear.
6736 * The comparison of cnt to sizeof(buf) is an optimization
6737 * that prevents unnecessary calls to feof().
6741 if (!(cnt < sizeof(buf) && PerlIO_eof(fp)))
6745 #ifdef USEHEAPINSTEADOFSTACK
6750 if (rspara) { /* have to do this both before and after */
6751 while (i != EOF) { /* to make sure file boundaries work right */
6752 i = PerlIO_getc(fp);
6754 PerlIO_ungetc(fp,i);
6760 return_string_or_null:
6761 return (SvCUR(sv) - append) ? SvPVX(sv) : Nullch;
6767 Auto-increment of the value in the SV, doing string to numeric conversion
6768 if necessary. Handles 'get' magic.
6774 Perl_sv_inc(pTHX_ register SV *sv)
6783 if (SvTHINKFIRST(sv)) {
6785 sv_force_normal_flags(sv, 0);
6786 if (SvREADONLY(sv)) {
6787 if (IN_PERL_RUNTIME)
6788 Perl_croak(aTHX_ PL_no_modify);
6792 if (SvAMAGIC(sv) && AMG_CALLun(sv,inc))
6794 i = PTR2IV(SvRV(sv));
6799 flags = SvFLAGS(sv);
6800 if ((flags & (SVp_NOK|SVp_IOK)) == SVp_NOK) {
6801 /* It's (privately or publicly) a float, but not tested as an
6802 integer, so test it to see. */
6804 flags = SvFLAGS(sv);
6806 if ((flags & SVf_IOK) || ((flags & (SVp_IOK | SVp_NOK)) == SVp_IOK)) {
6807 /* It's publicly an integer, or privately an integer-not-float */
6808 #ifdef PERL_PRESERVE_IVUV
6812 if (SvUVX(sv) == UV_MAX)
6813 sv_setnv(sv, UV_MAX_P1);
6815 (void)SvIOK_only_UV(sv);
6818 if (SvIVX(sv) == IV_MAX)
6819 sv_setuv(sv, (UV)IV_MAX + 1);
6821 (void)SvIOK_only(sv);
6827 if (flags & SVp_NOK) {
6828 (void)SvNOK_only(sv);
6833 if (!(flags & SVp_POK) || !*SvPVX(sv)) {
6834 if ((flags & SVTYPEMASK) < SVt_PVIV)
6835 sv_upgrade(sv, SVt_IV);
6836 (void)SvIOK_only(sv);
6841 while (isALPHA(*d)) d++;
6842 while (isDIGIT(*d)) d++;
6844 #ifdef PERL_PRESERVE_IVUV
6845 /* Got to punt this as an integer if needs be, but we don't issue
6846 warnings. Probably ought to make the sv_iv_please() that does
6847 the conversion if possible, and silently. */
6848 int numtype = grok_number(SvPVX(sv), SvCUR(sv), NULL);
6849 if (numtype && !(numtype & IS_NUMBER_INFINITY)) {
6850 /* Need to try really hard to see if it's an integer.
6851 9.22337203685478e+18 is an integer.
6852 but "9.22337203685478e+18" + 0 is UV=9223372036854779904
6853 so $a="9.22337203685478e+18"; $a+0; $a++
6854 needs to be the same as $a="9.22337203685478e+18"; $a++
6861 /* sv_2iv *should* have made this an NV */
6862 if (flags & SVp_NOK) {
6863 (void)SvNOK_only(sv);
6867 /* I don't think we can get here. Maybe I should assert this
6868 And if we do get here I suspect that sv_setnv will croak. NWC
6870 #if defined(USE_LONG_DOUBLE)
6871 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",
6872 SvPVX(sv), SvIVX(sv), SvNVX(sv)));
6874 DEBUG_c(PerlIO_printf(Perl_debug_log,"sv_inc punt failed to convert '%s' to IOK or NOKp, UV=0x%"UVxf" NV=%"NVgf"\n",
6875 SvPVX(sv), SvIVX(sv), SvNVX(sv)));
6878 #endif /* PERL_PRESERVE_IVUV */
6879 sv_setnv(sv,Atof(SvPVX(sv)) + 1.0);
6883 while (d >= SvPVX(sv)) {
6891 /* MKS: The original code here died if letters weren't consecutive.
6892 * at least it didn't have to worry about non-C locales. The
6893 * new code assumes that ('z'-'a')==('Z'-'A'), letters are
6894 * arranged in order (although not consecutively) and that only
6895 * [A-Za-z] are accepted by isALPHA in the C locale.
6897 if (*d != 'z' && *d != 'Z') {
6898 do { ++*d; } while (!isALPHA(*d));
6901 *(d--) -= 'z' - 'a';
6906 *(d--) -= 'z' - 'a' + 1;
6910 /* oh,oh, the number grew */
6911 SvGROW(sv, SvCUR(sv) + 2);
6913 for (d = SvPVX(sv) + SvCUR(sv); d > SvPVX(sv); d--)
6924 Auto-decrement of the value in the SV, doing string to numeric conversion
6925 if necessary. Handles 'get' magic.
6931 Perl_sv_dec(pTHX_ register SV *sv)
6939 if (SvTHINKFIRST(sv)) {
6941 sv_force_normal_flags(sv, 0);
6942 if (SvREADONLY(sv)) {
6943 if (IN_PERL_RUNTIME)
6944 Perl_croak(aTHX_ PL_no_modify);
6948 if (SvAMAGIC(sv) && AMG_CALLun(sv,dec))
6950 i = PTR2IV(SvRV(sv));
6955 /* Unlike sv_inc we don't have to worry about string-never-numbers
6956 and keeping them magic. But we mustn't warn on punting */
6957 flags = SvFLAGS(sv);
6958 if ((flags & SVf_IOK) || ((flags & (SVp_IOK | SVp_NOK)) == SVp_IOK)) {
6959 /* It's publicly an integer, or privately an integer-not-float */
6960 #ifdef PERL_PRESERVE_IVUV
6964 if (SvUVX(sv) == 0) {
6965 (void)SvIOK_only(sv);
6969 (void)SvIOK_only_UV(sv);
6973 if (SvIVX(sv) == IV_MIN)
6974 sv_setnv(sv, (NV)IV_MIN - 1.0);
6976 (void)SvIOK_only(sv);
6982 if (flags & SVp_NOK) {
6984 (void)SvNOK_only(sv);
6987 if (!(flags & SVp_POK)) {
6988 if ((flags & SVTYPEMASK) < SVt_PVNV)
6989 sv_upgrade(sv, SVt_NV);
6991 (void)SvNOK_only(sv);
6994 #ifdef PERL_PRESERVE_IVUV
6996 int numtype = grok_number(SvPVX(sv), SvCUR(sv), NULL);
6997 if (numtype && !(numtype & IS_NUMBER_INFINITY)) {
6998 /* Need to try really hard to see if it's an integer.
6999 9.22337203685478e+18 is an integer.
7000 but "9.22337203685478e+18" + 0 is UV=9223372036854779904
7001 so $a="9.22337203685478e+18"; $a+0; $a--
7002 needs to be the same as $a="9.22337203685478e+18"; $a--
7009 /* sv_2iv *should* have made this an NV */
7010 if (flags & SVp_NOK) {
7011 (void)SvNOK_only(sv);
7015 /* I don't think we can get here. Maybe I should assert this
7016 And if we do get here I suspect that sv_setnv will croak. NWC
7018 #if defined(USE_LONG_DOUBLE)
7019 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",
7020 SvPVX(sv), SvIVX(sv), SvNVX(sv)));
7022 DEBUG_c(PerlIO_printf(Perl_debug_log,"sv_dec punt failed to convert '%s' to IOK or NOKp, UV=0x%"UVxf" NV=%"NVgf"\n",
7023 SvPVX(sv), SvIVX(sv), SvNVX(sv)));
7027 #endif /* PERL_PRESERVE_IVUV */
7028 sv_setnv(sv,Atof(SvPVX(sv)) - 1.0); /* punt */
7032 =for apidoc sv_mortalcopy
7034 Creates a new SV which is a copy of the original SV (using C<sv_setsv>).
7035 The new SV is marked as mortal. It will be destroyed "soon", either by an
7036 explicit call to FREETMPS, or by an implicit call at places such as
7037 statement boundaries. See also C<sv_newmortal> and C<sv_2mortal>.
7042 /* Make a string that will exist for the duration of the expression
7043 * evaluation. Actually, it may have to last longer than that, but
7044 * hopefully we won't free it until it has been assigned to a
7045 * permanent location. */
7048 Perl_sv_mortalcopy(pTHX_ SV *oldstr)
7053 sv_setsv(sv,oldstr);
7055 PL_tmps_stack[++PL_tmps_ix] = sv;
7061 =for apidoc sv_newmortal
7063 Creates a new null SV which is mortal. The reference count of the SV is
7064 set to 1. It will be destroyed "soon", either by an explicit call to
7065 FREETMPS, or by an implicit call at places such as statement boundaries.
7066 See also C<sv_mortalcopy> and C<sv_2mortal>.
7072 Perl_sv_newmortal(pTHX)
7077 SvFLAGS(sv) = SVs_TEMP;
7079 PL_tmps_stack[++PL_tmps_ix] = sv;
7084 =for apidoc sv_2mortal
7086 Marks an existing SV as mortal. The SV will be destroyed "soon", either
7087 by an explicit call to FREETMPS, or by an implicit call at places such as
7088 statement boundaries. See also C<sv_newmortal> and C<sv_mortalcopy>.
7094 Perl_sv_2mortal(pTHX_ register SV *sv)
7098 if (SvREADONLY(sv) && SvIMMORTAL(sv))
7101 PL_tmps_stack[++PL_tmps_ix] = sv;
7109 Creates a new SV and copies a string into it. The reference count for the
7110 SV is set to 1. If C<len> is zero, Perl will compute the length using
7111 strlen(). For efficiency, consider using C<newSVpvn> instead.
7117 Perl_newSVpv(pTHX_ const char *s, STRLEN len)
7124 sv_setpvn(sv,s,len);
7129 =for apidoc newSVpvn
7131 Creates a new SV and copies a string into it. The reference count for the
7132 SV is set to 1. Note that if C<len> is zero, Perl will create a zero length
7133 string. You are responsible for ensuring that the source string is at least
7140 Perl_newSVpvn(pTHX_ const char *s, STRLEN len)
7145 sv_setpvn(sv,s,len);
7150 =for apidoc newSVpvn_share
7152 Creates a new SV with its SvPVX pointing to a shared string in the string
7153 table. If the string does not already exist in the table, it is created
7154 first. Turns on READONLY and FAKE. The string's hash is stored in the UV
7155 slot of the SV; if the C<hash> parameter is non-zero, that value is used;
7156 otherwise the hash is computed. The idea here is that as the string table
7157 is used for shared hash keys these strings will have SvPVX == HeKEY and
7158 hash lookup will avoid string compare.
7164 Perl_newSVpvn_share(pTHX_ const char *src, I32 len, U32 hash)
7167 bool is_utf8 = FALSE;
7169 STRLEN tmplen = -len;
7171 /* See the note in hv.c:hv_fetch() --jhi */
7172 src = (char*)bytes_from_utf8((U8*)src, &tmplen, &is_utf8);
7176 PERL_HASH(hash, src, len);
7178 sv_upgrade(sv, SVt_PVIV);
7179 SvPVX(sv) = sharepvn(src, is_utf8?-len:len, hash);
7192 #if defined(PERL_IMPLICIT_CONTEXT)
7194 /* pTHX_ magic can't cope with varargs, so this is a no-context
7195 * version of the main function, (which may itself be aliased to us).
7196 * Don't access this version directly.
7200 Perl_newSVpvf_nocontext(const char* pat, ...)
7205 va_start(args, pat);
7206 sv = vnewSVpvf(pat, &args);
7213 =for apidoc newSVpvf
7215 Creates a new SV and initializes it with the string formatted like
7222 Perl_newSVpvf(pTHX_ const char* pat, ...)
7226 va_start(args, pat);
7227 sv = vnewSVpvf(pat, &args);
7232 /* backend for newSVpvf() and newSVpvf_nocontext() */
7235 Perl_vnewSVpvf(pTHX_ const char* pat, va_list* args)
7239 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
7246 Creates a new SV and copies a floating point value into it.
7247 The reference count for the SV is set to 1.
7253 Perl_newSVnv(pTHX_ NV n)
7265 Creates a new SV and copies an integer into it. The reference count for the
7272 Perl_newSViv(pTHX_ IV i)
7284 Creates a new SV and copies an unsigned integer into it.
7285 The reference count for the SV is set to 1.
7291 Perl_newSVuv(pTHX_ UV u)
7301 =for apidoc newRV_noinc
7303 Creates an RV wrapper for an SV. The reference count for the original
7304 SV is B<not> incremented.
7310 Perl_newRV_noinc(pTHX_ SV *tmpRef)
7315 sv_upgrade(sv, SVt_RV);
7322 /* newRV_inc is the official function name to use now.
7323 * newRV_inc is in fact #defined to newRV in sv.h
7327 Perl_newRV(pTHX_ SV *tmpRef)
7329 return newRV_noinc(SvREFCNT_inc(tmpRef));
7335 Creates a new SV which is an exact duplicate of the original SV.
7342 Perl_newSVsv(pTHX_ register SV *old)
7348 if (SvTYPE(old) == SVTYPEMASK) {
7349 if (ckWARN_d(WARN_INTERNAL))
7350 Perl_warner(aTHX_ packWARN(WARN_INTERNAL), "semi-panic: attempt to dup freed string");
7365 =for apidoc sv_reset
7367 Underlying implementation for the C<reset> Perl function.
7368 Note that the perl-level function is vaguely deprecated.
7374 Perl_sv_reset(pTHX_ register char *s, HV *stash)
7382 char todo[PERL_UCHAR_MAX+1];
7387 if (!*s) { /* reset ?? searches */
7388 for (pm = HvPMROOT(stash); pm; pm = pm->op_pmnext) {
7389 pm->op_pmdynflags &= ~PMdf_USED;
7394 /* reset variables */
7396 if (!HvARRAY(stash))
7399 Zero(todo, 256, char);
7401 i = (unsigned char)*s;
7405 max = (unsigned char)*s++;
7406 for ( ; i <= max; i++) {
7409 for (i = 0; i <= (I32) HvMAX(stash); i++) {
7410 for (entry = HvARRAY(stash)[i];
7412 entry = HeNEXT(entry))
7414 if (!todo[(U8)*HeKEY(entry)])
7416 gv = (GV*)HeVAL(entry);
7418 if (SvTHINKFIRST(sv)) {
7419 if (!SvREADONLY(sv) && SvROK(sv))
7424 if (SvTYPE(sv) >= SVt_PV) {
7426 if (SvPVX(sv) != Nullch)
7433 if (GvHV(gv) && !HvNAME(GvHV(gv))) {
7436 #ifdef USE_ENVIRON_ARRAY
7438 # ifdef USE_ITHREADS
7439 && PL_curinterp == aTHX
7443 environ[0] = Nullch;
7446 #endif /* !PERL_MICRO */
7456 Using various gambits, try to get an IO from an SV: the IO slot if its a
7457 GV; or the recursive result if we're an RV; or the IO slot of the symbol
7458 named after the PV if we're a string.
7464 Perl_sv_2io(pTHX_ SV *sv)
7470 switch (SvTYPE(sv)) {
7478 Perl_croak(aTHX_ "Bad filehandle: %s", GvNAME(gv));
7482 Perl_croak(aTHX_ PL_no_usym, "filehandle");
7484 return sv_2io(SvRV(sv));
7485 gv = gv_fetchpv(SvPV(sv,n_a), FALSE, SVt_PVIO);
7491 Perl_croak(aTHX_ "Bad filehandle: %"SVf, sv);
7500 Using various gambits, try to get a CV from an SV; in addition, try if
7501 possible to set C<*st> and C<*gvp> to the stash and GV associated with it.
7507 Perl_sv_2cv(pTHX_ SV *sv, HV **st, GV **gvp, I32 lref)
7514 return *gvp = Nullgv, Nullcv;
7515 switch (SvTYPE(sv)) {
7534 SV **sp = &sv; /* Used in tryAMAGICunDEREF macro. */
7535 tryAMAGICunDEREF(to_cv);
7538 if (SvTYPE(sv) == SVt_PVCV) {
7547 Perl_croak(aTHX_ "Not a subroutine reference");
7552 gv = gv_fetchpv(SvPV(sv, n_a), lref, SVt_PVCV);
7558 if (lref && !GvCVu(gv)) {
7561 tmpsv = NEWSV(704,0);
7562 gv_efullname3(tmpsv, gv, Nullch);
7563 /* XXX this is probably not what they think they're getting.
7564 * It has the same effect as "sub name;", i.e. just a forward
7566 newSUB(start_subparse(FALSE, 0),
7567 newSVOP(OP_CONST, 0, tmpsv),
7572 Perl_croak(aTHX_ "Unable to create sub named \"%"SVf"\"",
7582 Returns true if the SV has a true value by Perl's rules.
7583 Use the C<SvTRUE> macro instead, which may call C<sv_true()> or may
7584 instead use an in-line version.
7590 Perl_sv_true(pTHX_ register SV *sv)
7596 if ((tXpv = (XPV*)SvANY(sv)) &&
7597 (tXpv->xpv_cur > 1 ||
7598 (tXpv->xpv_cur && *tXpv->xpv_pv != '0')))
7605 return SvIVX(sv) != 0;
7608 return SvNVX(sv) != 0.0;
7610 return sv_2bool(sv);
7618 A private implementation of the C<SvIVx> macro for compilers which can't
7619 cope with complex macro expressions. Always use the macro instead.
7625 Perl_sv_iv(pTHX_ register SV *sv)
7629 return (IV)SvUVX(sv);
7638 A private implementation of the C<SvUVx> macro for compilers which can't
7639 cope with complex macro expressions. Always use the macro instead.
7645 Perl_sv_uv(pTHX_ register SV *sv)
7650 return (UV)SvIVX(sv);
7658 A private implementation of the C<SvNVx> macro for compilers which can't
7659 cope with complex macro expressions. Always use the macro instead.
7665 Perl_sv_nv(pTHX_ register SV *sv)
7672 /* sv_pv() is now a macro using SvPV_nolen();
7673 * this function provided for binary compatibility only
7677 Perl_sv_pv(pTHX_ SV *sv)
7684 return sv_2pv(sv, &n_a);
7690 Use the C<SvPV_nolen> macro instead
7694 A private implementation of the C<SvPV> macro for compilers which can't
7695 cope with complex macro expressions. Always use the macro instead.
7701 Perl_sv_pvn(pTHX_ SV *sv, STRLEN *lp)
7707 return sv_2pv(sv, lp);
7712 Perl_sv_pvn_nomg(pTHX_ register SV *sv, STRLEN *lp)
7718 return sv_2pv_flags(sv, lp, 0);
7721 /* sv_pvn_force() is now a macro using Perl_sv_pvn_force_flags();
7722 * this function provided for binary compatibility only
7726 Perl_sv_pvn_force(pTHX_ SV *sv, STRLEN *lp)
7728 return sv_pvn_force_flags(sv, lp, SV_GMAGIC);
7732 =for apidoc sv_pvn_force
7734 Get a sensible string out of the SV somehow.
7735 A private implementation of the C<SvPV_force> macro for compilers which
7736 can't cope with complex macro expressions. Always use the macro instead.
7738 =for apidoc sv_pvn_force_flags
7740 Get a sensible string out of the SV somehow.
7741 If C<flags> has C<SV_GMAGIC> bit set, will C<mg_get> on C<sv> if
7742 appropriate, else not. C<sv_pvn_force> and C<sv_pvn_force_nomg> are
7743 implemented in terms of this function.
7744 You normally want to use the various wrapper macros instead: see
7745 C<SvPV_force> and C<SvPV_force_nomg>
7751 Perl_sv_pvn_force_flags(pTHX_ SV *sv, STRLEN *lp, I32 flags)
7755 if (SvTHINKFIRST(sv) && !SvROK(sv))
7756 sv_force_normal_flags(sv, 0);
7762 if (SvTYPE(sv) > SVt_PVLV && SvTYPE(sv) != SVt_PVFM) {
7763 Perl_croak(aTHX_ "Can't coerce %s to string in %s", sv_reftype(sv,0),
7767 s = sv_2pv_flags(sv, lp, flags);
7768 if (s != SvPVX(sv)) { /* Almost, but not quite, sv_setpvn() */
7773 (void)SvUPGRADE(sv, SVt_PV); /* Never FALSE */
7774 SvGROW(sv, len + 1);
7775 Move(s,SvPVX(sv),len,char);
7780 SvPOK_on(sv); /* validate pointer */
7782 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2pv(%s)\n",
7783 PTR2UV(sv),SvPVX(sv)));
7789 /* sv_pvbyte () is now a macro using Perl_sv_2pv_flags();
7790 * this function provided for binary compatibility only
7794 Perl_sv_pvbyte(pTHX_ SV *sv)
7796 sv_utf8_downgrade(sv,0);
7801 =for apidoc sv_pvbyte
7803 Use C<SvPVbyte_nolen> instead.
7805 =for apidoc sv_pvbyten
7807 A private implementation of the C<SvPVbyte> macro for compilers
7808 which can't cope with complex macro expressions. Always use the macro
7815 Perl_sv_pvbyten(pTHX_ SV *sv, STRLEN *lp)
7817 sv_utf8_downgrade(sv,0);
7818 return sv_pvn(sv,lp);
7822 =for apidoc sv_pvbyten_force
7824 A private implementation of the C<SvPVbytex_force> macro for compilers
7825 which can't cope with complex macro expressions. Always use the macro
7832 Perl_sv_pvbyten_force(pTHX_ SV *sv, STRLEN *lp)
7834 sv_utf8_downgrade(sv,0);
7835 return sv_pvn_force(sv,lp);
7838 /* sv_pvutf8 () is now a macro using Perl_sv_2pv_flags();
7839 * this function provided for binary compatibility only
7843 Perl_sv_pvutf8(pTHX_ SV *sv)
7845 sv_utf8_upgrade(sv);
7850 =for apidoc sv_pvutf8
7852 Use the C<SvPVutf8_nolen> macro instead
7854 =for apidoc sv_pvutf8n
7856 A private implementation of the C<SvPVutf8> macro for compilers
7857 which can't cope with complex macro expressions. Always use the macro
7864 Perl_sv_pvutf8n(pTHX_ SV *sv, STRLEN *lp)
7866 sv_utf8_upgrade(sv);
7867 return sv_pvn(sv,lp);
7871 =for apidoc sv_pvutf8n_force
7873 A private implementation of the C<SvPVutf8_force> macro for compilers
7874 which can't cope with complex macro expressions. Always use the macro
7881 Perl_sv_pvutf8n_force(pTHX_ SV *sv, STRLEN *lp)
7883 sv_utf8_upgrade(sv);
7884 return sv_pvn_force(sv,lp);
7888 =for apidoc sv_reftype
7890 Returns a string describing what the SV is a reference to.
7896 Perl_sv_reftype(pTHX_ SV *sv, int ob)
7898 if (ob && SvOBJECT(sv)) {
7899 if (HvNAME(SvSTASH(sv)))
7900 return HvNAME(SvSTASH(sv));
7905 switch (SvTYPE(sv)) {
7922 case SVt_PVLV: return SvROK(sv) ? "REF"
7923 /* tied lvalues should appear to be
7924 * scalars for backwards compatitbility */
7925 : (LvTYPE(sv) == 't' || LvTYPE(sv) == 'T')
7926 ? "SCALAR" : "LVALUE";
7927 case SVt_PVAV: return "ARRAY";
7928 case SVt_PVHV: return "HASH";
7929 case SVt_PVCV: return "CODE";
7930 case SVt_PVGV: return "GLOB";
7931 case SVt_PVFM: return "FORMAT";
7932 case SVt_PVIO: return "IO";
7933 default: return "UNKNOWN";
7939 =for apidoc sv_isobject
7941 Returns a boolean indicating whether the SV is an RV pointing to a blessed
7942 object. If the SV is not an RV, or if the object is not blessed, then this
7949 Perl_sv_isobject(pTHX_ SV *sv)
7966 Returns a boolean indicating whether the SV is blessed into the specified
7967 class. This does not check for subtypes; use C<sv_derived_from> to verify
7968 an inheritance relationship.
7974 Perl_sv_isa(pTHX_ SV *sv, const char *name)
7985 if (!HvNAME(SvSTASH(sv)))
7988 return strEQ(HvNAME(SvSTASH(sv)), name);
7994 Creates a new SV for the RV, C<rv>, to point to. If C<rv> is not an RV then
7995 it will be upgraded to one. If C<classname> is non-null then the new SV will
7996 be blessed in the specified package. The new SV is returned and its
7997 reference count is 1.
8003 Perl_newSVrv(pTHX_ SV *rv, const char *classname)
8009 SV_CHECK_THINKFIRST_COW_DROP(rv);
8012 if (SvTYPE(rv) >= SVt_PVMG) {
8013 U32 refcnt = SvREFCNT(rv);
8017 SvREFCNT(rv) = refcnt;
8020 if (SvTYPE(rv) < SVt_RV)
8021 sv_upgrade(rv, SVt_RV);
8022 else if (SvTYPE(rv) > SVt_RV) {
8023 (void)SvOOK_off(rv);
8024 if (SvPVX(rv) && SvLEN(rv))
8025 Safefree(SvPVX(rv));
8035 HV* stash = gv_stashpv(classname, TRUE);
8036 (void)sv_bless(rv, stash);
8042 =for apidoc sv_setref_pv
8044 Copies a pointer into a new SV, optionally blessing the SV. The C<rv>
8045 argument will be upgraded to an RV. That RV will be modified to point to
8046 the new SV. If the C<pv> argument is NULL then C<PL_sv_undef> will be placed
8047 into the SV. The C<classname> argument indicates the package for the
8048 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
8049 will have a reference count of 1, and the RV will be returned.
8051 Do not use with other Perl types such as HV, AV, SV, CV, because those
8052 objects will become corrupted by the pointer copy process.
8054 Note that C<sv_setref_pvn> copies the string while this copies the pointer.
8060 Perl_sv_setref_pv(pTHX_ SV *rv, const char *classname, void *pv)
8063 sv_setsv(rv, &PL_sv_undef);
8067 sv_setiv(newSVrv(rv,classname), PTR2IV(pv));
8072 =for apidoc sv_setref_iv
8074 Copies an integer into a new SV, optionally blessing the SV. The C<rv>
8075 argument will be upgraded to an RV. That RV will be modified to point to
8076 the new SV. The C<classname> argument indicates the package for the
8077 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
8078 will have a reference count of 1, and the RV will be returned.
8084 Perl_sv_setref_iv(pTHX_ SV *rv, const char *classname, IV iv)
8086 sv_setiv(newSVrv(rv,classname), iv);
8091 =for apidoc sv_setref_uv
8093 Copies an unsigned integer into a new SV, optionally blessing the SV. The C<rv>
8094 argument will be upgraded to an RV. That RV will be modified to point to
8095 the new SV. The C<classname> argument indicates the package for the
8096 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
8097 will have a reference count of 1, and the RV will be returned.
8103 Perl_sv_setref_uv(pTHX_ SV *rv, const char *classname, UV uv)
8105 sv_setuv(newSVrv(rv,classname), uv);
8110 =for apidoc sv_setref_nv
8112 Copies a double into a new SV, optionally blessing the SV. The C<rv>
8113 argument will be upgraded to an RV. That RV will be modified to point to
8114 the new SV. The C<classname> argument indicates the package for the
8115 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
8116 will have a reference count of 1, and the RV will be returned.
8122 Perl_sv_setref_nv(pTHX_ SV *rv, const char *classname, NV nv)
8124 sv_setnv(newSVrv(rv,classname), nv);
8129 =for apidoc sv_setref_pvn
8131 Copies a string into a new SV, optionally blessing the SV. The length of the
8132 string must be specified with C<n>. The C<rv> argument will be upgraded to
8133 an RV. That RV will be modified to point to the new SV. The C<classname>
8134 argument indicates the package for the blessing. Set C<classname> to
8135 C<Nullch> to avoid the blessing. The new SV will have a reference count
8136 of 1, and the RV will be returned.
8138 Note that C<sv_setref_pv> copies the pointer while this copies the string.
8144 Perl_sv_setref_pvn(pTHX_ SV *rv, const char *classname, char *pv, STRLEN n)
8146 sv_setpvn(newSVrv(rv,classname), pv, n);
8151 =for apidoc sv_bless
8153 Blesses an SV into a specified package. The SV must be an RV. The package
8154 must be designated by its stash (see C<gv_stashpv()>). The reference count
8155 of the SV is unaffected.
8161 Perl_sv_bless(pTHX_ SV *sv, HV *stash)
8165 Perl_croak(aTHX_ "Can't bless non-reference value");
8167 if (SvFLAGS(tmpRef) & (SVs_OBJECT|SVf_READONLY)) {
8168 if (SvREADONLY(tmpRef))
8169 Perl_croak(aTHX_ PL_no_modify);
8170 if (SvOBJECT(tmpRef)) {
8171 if (SvTYPE(tmpRef) != SVt_PVIO)
8173 SvREFCNT_dec(SvSTASH(tmpRef));
8176 SvOBJECT_on(tmpRef);
8177 if (SvTYPE(tmpRef) != SVt_PVIO)
8179 (void)SvUPGRADE(tmpRef, SVt_PVMG);
8180 SvSTASH(tmpRef) = (HV*)SvREFCNT_inc(stash);
8187 if(SvSMAGICAL(tmpRef))
8188 if(mg_find(tmpRef, PERL_MAGIC_ext) || mg_find(tmpRef, PERL_MAGIC_uvar))
8196 /* Downgrades a PVGV to a PVMG.
8200 S_sv_unglob(pTHX_ SV *sv)
8204 assert(SvTYPE(sv) == SVt_PVGV);
8209 SvREFCNT_dec(GvSTASH(sv));
8210 GvSTASH(sv) = Nullhv;
8212 sv_unmagic(sv, PERL_MAGIC_glob);
8213 Safefree(GvNAME(sv));
8216 /* need to keep SvANY(sv) in the right arena */
8217 xpvmg = new_XPVMG();
8218 StructCopy(SvANY(sv), xpvmg, XPVMG);
8219 del_XPVGV(SvANY(sv));
8222 SvFLAGS(sv) &= ~SVTYPEMASK;
8223 SvFLAGS(sv) |= SVt_PVMG;
8227 =for apidoc sv_unref_flags
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>. The C<cflags> argument can contain
8232 C<SV_IMMEDIATE_UNREF> to force the reference count to be decremented
8233 (otherwise the decrementing is conditional on the reference count being
8234 different from one or the reference being a readonly SV).
8241 Perl_sv_unref_flags(pTHX_ SV *sv, U32 flags)
8245 if (SvWEAKREF(sv)) {
8253 /* You can't have a || SvREADONLY(rv) here, as $a = $$a, where $a was
8254 assigned to as BEGIN {$a = \"Foo"} will fail. */
8255 if (SvREFCNT(rv) != 1 || (flags & SV_IMMEDIATE_UNREF))
8257 else /* XXX Hack, but hard to make $a=$a->[1] work otherwise */
8258 sv_2mortal(rv); /* Schedule for freeing later */
8262 =for apidoc sv_unref
8264 Unsets the RV status of the SV, and decrements the reference count of
8265 whatever was being referenced by the RV. This can almost be thought of
8266 as a reversal of C<newSVrv>. This is C<sv_unref_flags> with the C<flag>
8267 being zero. See C<SvROK_off>.
8273 Perl_sv_unref(pTHX_ SV *sv)
8275 sv_unref_flags(sv, 0);
8279 =for apidoc sv_taint
8281 Taint an SV. Use C<SvTAINTED_on> instead.
8286 Perl_sv_taint(pTHX_ SV *sv)
8288 sv_magic((sv), Nullsv, PERL_MAGIC_taint, Nullch, 0);
8292 =for apidoc sv_untaint
8294 Untaint an SV. Use C<SvTAINTED_off> instead.
8299 Perl_sv_untaint(pTHX_ SV *sv)
8301 if (SvTYPE(sv) >= SVt_PVMG && SvMAGIC(sv)) {
8302 MAGIC *mg = mg_find(sv, PERL_MAGIC_taint);
8309 =for apidoc sv_tainted
8311 Test an SV for taintedness. Use C<SvTAINTED> instead.
8316 Perl_sv_tainted(pTHX_ SV *sv)
8318 if (SvTYPE(sv) >= SVt_PVMG && SvMAGIC(sv)) {
8319 MAGIC *mg = mg_find(sv, PERL_MAGIC_taint);
8320 if (mg && ((mg->mg_len & 1) || ((mg->mg_len & 2) && mg->mg_obj == sv)))
8327 =for apidoc sv_setpviv
8329 Copies an integer into the given SV, also updating its string value.
8330 Does not handle 'set' magic. See C<sv_setpviv_mg>.
8336 Perl_sv_setpviv(pTHX_ SV *sv, IV iv)
8338 char buf[TYPE_CHARS(UV)];
8340 char *ptr = uiv_2buf(buf, iv, 0, 0, &ebuf);
8342 sv_setpvn(sv, ptr, ebuf - ptr);
8346 =for apidoc sv_setpviv_mg
8348 Like C<sv_setpviv>, but also handles 'set' magic.
8354 Perl_sv_setpviv_mg(pTHX_ SV *sv, IV iv)
8356 char buf[TYPE_CHARS(UV)];
8358 char *ptr = uiv_2buf(buf, iv, 0, 0, &ebuf);
8360 sv_setpvn(sv, ptr, ebuf - ptr);
8364 #if defined(PERL_IMPLICIT_CONTEXT)
8366 /* pTHX_ magic can't cope with varargs, so this is a no-context
8367 * version of the main function, (which may itself be aliased to us).
8368 * Don't access this version directly.
8372 Perl_sv_setpvf_nocontext(SV *sv, const char* pat, ...)
8376 va_start(args, pat);
8377 sv_vsetpvf(sv, pat, &args);
8381 /* pTHX_ magic can't cope with varargs, so this is a no-context
8382 * version of the main function, (which may itself be aliased to us).
8383 * Don't access this version directly.
8387 Perl_sv_setpvf_mg_nocontext(SV *sv, const char* pat, ...)
8391 va_start(args, pat);
8392 sv_vsetpvf_mg(sv, pat, &args);
8398 =for apidoc sv_setpvf
8400 Processes its arguments like C<sprintf> and sets an SV to the formatted
8401 output. Does not handle 'set' magic. See C<sv_setpvf_mg>.
8407 Perl_sv_setpvf(pTHX_ SV *sv, const char* pat, ...)
8410 va_start(args, pat);
8411 sv_vsetpvf(sv, pat, &args);
8415 /* backend for C<sv_setpvf> and C<sv_setpvf_nocontext> */
8418 Perl_sv_vsetpvf(pTHX_ SV *sv, const char* pat, va_list* args)
8420 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
8424 =for apidoc sv_setpvf_mg
8426 Like C<sv_setpvf>, but also handles 'set' magic.
8432 Perl_sv_setpvf_mg(pTHX_ SV *sv, const char* pat, ...)
8435 va_start(args, pat);
8436 sv_vsetpvf_mg(sv, pat, &args);
8440 /* backend for C<sv_setpvf_mg> C<setpvf_mg_nocontext> */
8443 Perl_sv_vsetpvf_mg(pTHX_ SV *sv, const char* pat, va_list* args)
8445 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
8449 #if defined(PERL_IMPLICIT_CONTEXT)
8451 /* pTHX_ magic can't cope with varargs, so this is a no-context
8452 * version of the main function, (which may itself be aliased to us).
8453 * Don't access this version directly.
8457 Perl_sv_catpvf_nocontext(SV *sv, const char* pat, ...)
8461 va_start(args, pat);
8462 sv_vcatpvf(sv, pat, &args);
8466 /* pTHX_ magic can't cope with varargs, so this is a no-context
8467 * version of the main function, (which may itself be aliased to us).
8468 * Don't access this version directly.
8472 Perl_sv_catpvf_mg_nocontext(SV *sv, const char* pat, ...)
8476 va_start(args, pat);
8477 sv_vcatpvf_mg(sv, pat, &args);
8483 =for apidoc sv_catpvf
8485 Processes its arguments like C<sprintf> and appends the formatted
8486 output to an SV. If the appended data contains "wide" characters
8487 (including, but not limited to, SVs with a UTF-8 PV formatted with %s,
8488 and characters >255 formatted with %c), the original SV might get
8489 upgraded to UTF-8. Handles 'get' magic, but not 'set' magic.
8490 C<SvSETMAGIC()> must typically be called after calling this function
8491 to handle 'set' magic.
8496 Perl_sv_catpvf(pTHX_ SV *sv, const char* pat, ...)
8499 va_start(args, pat);
8500 sv_vcatpvf(sv, pat, &args);
8504 /* backend for C<sv_catpvf> and C<catpvf_mg_nocontext> */
8507 Perl_sv_vcatpvf(pTHX_ SV *sv, const char* pat, va_list* args)
8509 sv_vcatpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
8513 =for apidoc sv_catpvf_mg
8515 Like C<sv_catpvf>, but also handles 'set' magic.
8521 Perl_sv_catpvf_mg(pTHX_ SV *sv, const char* pat, ...)
8524 va_start(args, pat);
8525 sv_vcatpvf_mg(sv, pat, &args);
8529 /* backend for C<catpvf_mg> and C<catpvf_mg_nocontext> */
8532 Perl_sv_vcatpvf_mg(pTHX_ SV *sv, const char* pat, va_list* args)
8534 sv_vcatpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
8539 =for apidoc sv_vsetpvfn
8541 Works like C<vcatpvfn> but copies the text into the SV instead of
8544 Usually used via one of its frontends C<sv_setpvf> and C<sv_setpvf_mg>.
8550 Perl_sv_vsetpvfn(pTHX_ SV *sv, const char *pat, STRLEN patlen, va_list *args, SV **svargs, I32 svmax, bool *maybe_tainted)
8552 sv_setpvn(sv, "", 0);
8553 sv_vcatpvfn(sv, pat, patlen, args, svargs, svmax, maybe_tainted);
8556 /* private function for use in sv_vcatpvfn via the EXPECT_NUMBER macro */
8559 S_expect_number(pTHX_ char** pattern)
8562 switch (**pattern) {
8563 case '1': case '2': case '3':
8564 case '4': case '5': case '6':
8565 case '7': case '8': case '9':
8566 while (isDIGIT(**pattern))
8567 var = var * 10 + (*(*pattern)++ - '0');
8571 #define EXPECT_NUMBER(pattern, var) (var = S_expect_number(aTHX_ &pattern))
8574 F0convert(NV nv, char *endbuf, STRLEN *len)
8585 if (uv & 1 && uv == nv)
8586 uv--; /* Round to even */
8588 unsigned dig = uv % 10;
8601 =for apidoc sv_vcatpvfn
8603 Processes its arguments like C<vsprintf> and appends the formatted output
8604 to an SV. Uses an array of SVs if the C style variable argument list is
8605 missing (NULL). When running with taint checks enabled, indicates via
8606 C<maybe_tainted> if results are untrustworthy (often due to the use of
8609 Usually used via one of its frontends C<sv_catpvf> and C<sv_catpvf_mg>.
8615 Perl_sv_vcatpvfn(pTHX_ SV *sv, const char *pat, STRLEN patlen, va_list *args, SV **svargs, I32 svmax, bool *maybe_tainted)
8622 static char nullstr[] = "(null)";
8624 bool has_utf8; /* has the result utf8? */
8625 bool pat_utf8; /* the pattern is in utf8? */
8627 /* Times 4: a decimal digit takes more than 3 binary digits.
8628 * NV_DIG: mantissa takes than many decimal digits.
8629 * Plus 32: Playing safe. */
8630 char ebuf[IV_DIG * 4 + NV_DIG + 32];
8631 /* large enough for "%#.#f" --chip */
8632 /* what about long double NVs? --jhi */
8634 has_utf8 = pat_utf8 = DO_UTF8(sv);
8636 /* no matter what, this is a string now */
8637 (void)SvPV_force(sv, origlen);
8639 /* special-case "", "%s", and "%_" */
8642 if (patlen == 2 && pat[0] == '%') {
8646 char *s = va_arg(*args, char*);
8647 sv_catpv(sv, s ? s : nullstr);
8649 else if (svix < svmax) {
8650 sv_catsv(sv, *svargs);
8651 if (DO_UTF8(*svargs))
8657 argsv = va_arg(*args, SV*);
8658 sv_catsv(sv, argsv);
8663 /* See comment on '_' below */
8668 #ifndef USE_LONG_DOUBLE
8669 /* special-case "%.<number>[gf]" */
8670 if ( patlen <= 5 && pat[0] == '%' && pat[1] == '.'
8671 && (pat[patlen-1] == 'g' || pat[patlen-1] == 'f') ) {
8672 unsigned digits = 0;
8676 while (*pp >= '0' && *pp <= '9')
8677 digits = 10 * digits + (*pp++ - '0');
8678 if (pp - pat == (int)patlen - 1) {
8682 nv = (NV)va_arg(*args, double);
8683 else if (svix < svmax)
8688 /* Add check for digits != 0 because it seems that some
8689 gconverts are buggy in this case, and we don't yet have
8690 a Configure test for this. */
8691 if (digits && digits < sizeof(ebuf) - NV_DIG - 10) {
8692 /* 0, point, slack */
8693 Gconvert(nv, (int)digits, 0, ebuf);
8695 if (*ebuf) /* May return an empty string for digits==0 */
8698 } else if (!digits) {
8701 if ((p = F0convert(nv, ebuf + sizeof ebuf, &l))) {
8702 sv_catpvn(sv, p, l);
8708 #endif /* !USE_LONG_DOUBLE */
8710 if (!args && svix < svmax && DO_UTF8(*svargs))
8713 patend = (char*)pat + patlen;
8714 for (p = (char*)pat; p < patend; p = q) {
8717 bool vectorize = FALSE;
8718 bool vectorarg = FALSE;
8719 bool vec_utf8 = FALSE;
8725 bool has_precis = FALSE;
8728 bool is_utf8 = FALSE; /* is this item utf8? */
8729 #ifdef HAS_LDBL_SPRINTF_BUG
8730 /* This is to try to fix a bug with irix/nonstop-ux/powerux and
8731 with sfio - Allen <allens@cpan.org> */
8732 bool fix_ldbl_sprintf_bug = FALSE;
8736 U8 utf8buf[UTF8_MAXLEN+1];
8737 STRLEN esignlen = 0;
8739 char *eptr = Nullch;
8742 U8 *vecstr = Null(U8*);
8749 /* we need a long double target in case HAS_LONG_DOUBLE but
8752 #if defined(HAS_LONG_DOUBLE) && LONG_DOUBLESIZE > DOUBLESIZE
8761 STRLEN dotstrlen = 1;
8762 I32 efix = 0; /* explicit format parameter index */
8763 I32 ewix = 0; /* explicit width index */
8764 I32 epix = 0; /* explicit precision index */
8765 I32 evix = 0; /* explicit vector index */
8766 bool asterisk = FALSE;
8768 /* echo everything up to the next format specification */
8769 for (q = p; q < patend && *q != '%'; ++q) ;
8771 if (has_utf8 && !pat_utf8)
8772 sv_catpvn_utf8_upgrade(sv, p, q - p, nsv);
8774 sv_catpvn(sv, p, q - p);
8781 We allow format specification elements in this order:
8782 \d+\$ explicit format parameter index
8784 v|\*(\d+\$)?v vector with optional (optionally specified) arg
8785 0 flag (as above): repeated to allow "v02"
8786 \d+|\*(\d+\$)? width using optional (optionally specified) arg
8787 \.(\d*|\*(\d+\$)?) precision using optional (optionally specified) arg
8789 [%bcdefginopsux_DFOUX] format (mandatory)
8791 if (EXPECT_NUMBER(q, width)) {
8832 if (EXPECT_NUMBER(q, ewix))
8841 if ((vectorarg = asterisk)) {
8853 EXPECT_NUMBER(q, width);
8858 vecsv = va_arg(*args, SV*);
8860 vecsv = (evix ? evix <= svmax : svix < svmax) ?
8861 svargs[evix ? evix-1 : svix++] : &PL_sv_undef;
8862 dotstr = SvPVx(vecsv, dotstrlen);
8867 vecsv = va_arg(*args, SV*);
8868 vecstr = (U8*)SvPVx(vecsv,veclen);
8869 vec_utf8 = DO_UTF8(vecsv);
8871 else if (efix ? efix <= svmax : svix < svmax) {
8872 vecsv = svargs[efix ? efix-1 : svix++];
8873 vecstr = (U8*)SvPVx(vecsv,veclen);
8874 vec_utf8 = DO_UTF8(vecsv);
8884 i = va_arg(*args, int);
8886 i = (ewix ? ewix <= svmax : svix < svmax) ?
8887 SvIVx(svargs[ewix ? ewix-1 : svix++]) : 0;
8889 width = (i < 0) ? -i : i;
8899 if (EXPECT_NUMBER(q, epix) && *q++ != '$')
8901 /* XXX: todo, support specified precision parameter */
8905 i = va_arg(*args, int);
8907 i = (ewix ? ewix <= svmax : svix < svmax)
8908 ? SvIVx(svargs[ewix ? ewix-1 : svix++]) : 0;
8909 precis = (i < 0) ? 0 : i;
8914 precis = precis * 10 + (*q++ - '0');
8923 case 'I': /* Ix, I32x, and I64x */
8925 if (q[1] == '6' && q[2] == '4') {
8931 if (q[1] == '3' && q[2] == '2') {
8941 #if defined(HAS_QUAD) || defined(HAS_LONG_DOUBLE)
8952 #if defined(HAS_QUAD) || defined(HAS_LONG_DOUBLE)
8953 if (*(q + 1) == 'l') { /* lld, llf */
8978 argsv = (efix ? efix <= svmax : svix < svmax) ?
8979 svargs[efix ? efix-1 : svix++] : &PL_sv_undef;
8986 uv = (args && !vectorize) ? va_arg(*args, int) : SvIVx(argsv);
8988 (!UNI_IS_INVARIANT(uv) && SvUTF8(sv)))
8990 eptr = (char*)utf8buf;
8991 elen = uvchr_to_utf8((U8*)eptr, uv) - utf8buf;
9002 if (args && !vectorize) {
9003 eptr = va_arg(*args, char*);
9005 #ifdef MACOS_TRADITIONAL
9006 /* On MacOS, %#s format is used for Pascal strings */
9011 elen = strlen(eptr);
9014 elen = sizeof nullstr - 1;
9018 eptr = SvPVx(argsv, elen);
9019 if (DO_UTF8(argsv)) {
9020 if (has_precis && precis < elen) {
9022 sv_pos_u2b(argsv, &p, 0); /* sticks at end */
9025 if (width) { /* fudge width (can't fudge elen) */
9026 width += elen - sv_len_utf8(argsv);
9035 * The "%_" hack might have to be changed someday,
9036 * if ISO or ANSI decide to use '_' for something.
9037 * So we keep it hidden from users' code.
9039 if (!args || vectorize)
9041 argsv = va_arg(*args, SV*);
9042 eptr = SvPVx(argsv, elen);
9048 if (has_precis && elen > precis)
9055 if (alt || vectorize)
9057 uv = PTR2UV(args ? va_arg(*args, void*) : argsv);
9075 uv = utf8n_to_uvchr(vecstr, veclen, &ulen,
9084 esignbuf[esignlen++] = plus;
9088 case 'h': iv = (short)va_arg(*args, int); break;
9089 case 'l': iv = va_arg(*args, long); break;
9090 case 'V': iv = va_arg(*args, IV); break;
9091 default: iv = va_arg(*args, int); break;
9093 case 'q': iv = va_arg(*args, Quad_t); break;
9098 IV tiv = SvIVx(argsv); /* work around GCC bug #13488 */
9100 case 'h': iv = (short)tiv; break;
9101 case 'l': iv = (long)tiv; break;
9103 default: iv = tiv; break;
9105 case 'q': iv = (Quad_t)tiv; break;
9109 if ( !vectorize ) /* we already set uv above */
9114 esignbuf[esignlen++] = plus;
9118 esignbuf[esignlen++] = '-';
9161 uv = utf8n_to_uvchr(vecstr, veclen, &ulen,
9172 case 'h': uv = (unsigned short)va_arg(*args, unsigned); break;
9173 case 'l': uv = va_arg(*args, unsigned long); break;
9174 case 'V': uv = va_arg(*args, UV); break;
9175 default: uv = va_arg(*args, unsigned); break;
9177 case 'q': uv = va_arg(*args, Uquad_t); break;
9182 UV tuv = SvUVx(argsv); /* work around GCC bug #13488 */
9184 case 'h': uv = (unsigned short)tuv; break;
9185 case 'l': uv = (unsigned long)tuv; break;
9187 default: uv = tuv; break;
9189 case 'q': uv = (Uquad_t)tuv; break;
9195 eptr = ebuf + sizeof ebuf;
9201 p = (char*)((c == 'X')
9202 ? "0123456789ABCDEF" : "0123456789abcdef");
9208 esignbuf[esignlen++] = '0';
9209 esignbuf[esignlen++] = c; /* 'x' or 'X' */
9215 *--eptr = '0' + dig;
9217 if (alt && *eptr != '0')
9223 *--eptr = '0' + dig;
9226 esignbuf[esignlen++] = '0';
9227 esignbuf[esignlen++] = 'b';
9230 default: /* it had better be ten or less */
9231 #if defined(PERL_Y2KWARN)
9232 if (ckWARN(WARN_Y2K)) {
9234 char *s = SvPV(sv,n);
9235 if (n >= 2 && s[n-2] == '1' && s[n-1] == '9'
9236 && (n == 2 || !isDIGIT(s[n-3])))
9238 Perl_warner(aTHX_ packWARN(WARN_Y2K),
9239 "Possible Y2K bug: %%%c %s",
9240 c, "format string following '19'");
9246 *--eptr = '0' + dig;
9247 } while (uv /= base);
9250 elen = (ebuf + sizeof ebuf) - eptr;
9253 zeros = precis - elen;
9254 else if (precis == 0 && elen == 1 && *eptr == '0')
9259 /* FLOATING POINT */
9262 c = 'f'; /* maybe %F isn't supported here */
9268 /* This is evil, but floating point is even more evil */
9270 /* for SV-style calling, we can only get NV
9271 for C-style calling, we assume %f is double;
9272 for simplicity we allow any of %Lf, %llf, %qf for long double
9276 #if defined(USE_LONG_DOUBLE)
9280 /* [perl #20339] - we should accept and ignore %lf rather than die */
9284 #if defined(USE_LONG_DOUBLE)
9285 intsize = args ? 0 : 'q';
9289 #if defined(HAS_LONG_DOUBLE)
9298 /* now we need (long double) if intsize == 'q', else (double) */
9299 nv = (args && !vectorize) ?
9300 #if LONG_DOUBLESIZE > DOUBLESIZE
9302 va_arg(*args, long double) :
9303 va_arg(*args, double)
9305 va_arg(*args, double)
9311 if (c != 'e' && c != 'E') {
9313 /* FIXME: if HAS_LONG_DOUBLE but not USE_LONG_DOUBLE this
9314 will cast our (long double) to (double) */
9315 (void)Perl_frexp(nv, &i);
9316 if (i == PERL_INT_MIN)
9317 Perl_die(aTHX_ "panic: frexp");
9319 need = BIT_DIGITS(i);
9321 need += has_precis ? precis : 6; /* known default */
9326 #ifdef HAS_LDBL_SPRINTF_BUG
9327 /* This is to try to fix a bug with irix/nonstop-ux/powerux and
9328 with sfio - Allen <allens@cpan.org> */
9331 # define MY_DBL_MAX DBL_MAX
9332 # else /* XXX guessing! HUGE_VAL may be defined as infinity, so not using */
9333 # if DOUBLESIZE >= 8
9334 # define MY_DBL_MAX 1.7976931348623157E+308L
9336 # define MY_DBL_MAX 3.40282347E+38L
9340 # ifdef HAS_LDBL_SPRINTF_BUG_LESS1 /* only between -1L & 1L - Allen */
9341 # define MY_DBL_MAX_BUG 1L
9343 # define MY_DBL_MAX_BUG MY_DBL_MAX
9347 # define MY_DBL_MIN DBL_MIN
9348 # else /* XXX guessing! -Allen */
9349 # if DOUBLESIZE >= 8
9350 # define MY_DBL_MIN 2.2250738585072014E-308L
9352 # define MY_DBL_MIN 1.17549435E-38L
9356 if ((intsize == 'q') && (c == 'f') &&
9357 ((nv < MY_DBL_MAX_BUG) && (nv > -MY_DBL_MAX_BUG)) &&
9359 /* it's going to be short enough that
9360 * long double precision is not needed */
9362 if ((nv <= 0L) && (nv >= -0L))
9363 fix_ldbl_sprintf_bug = TRUE; /* 0 is 0 - easiest */
9365 /* would use Perl_fp_class as a double-check but not
9366 * functional on IRIX - see perl.h comments */
9368 if ((nv >= MY_DBL_MIN) || (nv <= -MY_DBL_MIN)) {
9369 /* It's within the range that a double can represent */
9370 #if defined(DBL_MAX) && !defined(DBL_MIN)
9371 if ((nv >= ((long double)1/DBL_MAX)) ||
9372 (nv <= (-(long double)1/DBL_MAX)))
9374 fix_ldbl_sprintf_bug = TRUE;
9377 if (fix_ldbl_sprintf_bug == TRUE) {
9387 # undef MY_DBL_MAX_BUG
9390 #endif /* HAS_LDBL_SPRINTF_BUG */
9392 need += 20; /* fudge factor */
9393 if (PL_efloatsize < need) {
9394 Safefree(PL_efloatbuf);
9395 PL_efloatsize = need + 20; /* more fudge */
9396 New(906, PL_efloatbuf, PL_efloatsize, char);
9397 PL_efloatbuf[0] = '\0';
9400 if ( !(width || left || plus || alt) && fill != '0'
9401 && has_precis && intsize != 'q' ) { /* Shortcuts */
9402 /* See earlier comment about buggy Gconvert when digits,
9404 if ( c == 'g' && precis) {
9405 Gconvert((NV)nv, (int)precis, 0, PL_efloatbuf);
9406 if (*PL_efloatbuf) /* May return an empty string for digits==0 */
9407 goto float_converted;
9408 } else if ( c == 'f' && !precis) {
9409 if ((eptr = F0convert(nv, ebuf + sizeof ebuf, &elen)))
9413 eptr = ebuf + sizeof ebuf;
9416 /* FIXME: what to do if HAS_LONG_DOUBLE but not PERL_PRIfldbl? */
9417 #if defined(HAS_LONG_DOUBLE) && defined(PERL_PRIfldbl)
9418 if (intsize == 'q') {
9419 /* Copy the one or more characters in a long double
9420 * format before the 'base' ([efgEFG]) character to
9421 * the format string. */
9422 static char const prifldbl[] = PERL_PRIfldbl;
9423 char const *p = prifldbl + sizeof(prifldbl) - 3;
9424 while (p >= prifldbl) { *--eptr = *p--; }
9429 do { *--eptr = '0' + (base % 10); } while (base /= 10);
9434 do { *--eptr = '0' + (base % 10); } while (base /= 10);
9446 /* No taint. Otherwise we are in the strange situation
9447 * where printf() taints but print($float) doesn't.
9449 #if defined(HAS_LONG_DOUBLE)
9451 (void)sprintf(PL_efloatbuf, eptr, nv);
9453 (void)sprintf(PL_efloatbuf, eptr, (double)nv);
9455 (void)sprintf(PL_efloatbuf, eptr, nv);
9458 eptr = PL_efloatbuf;
9459 elen = strlen(PL_efloatbuf);
9465 i = SvCUR(sv) - origlen;
9466 if (args && !vectorize) {
9468 case 'h': *(va_arg(*args, short*)) = i; break;
9469 default: *(va_arg(*args, int*)) = i; break;
9470 case 'l': *(va_arg(*args, long*)) = i; break;
9471 case 'V': *(va_arg(*args, IV*)) = i; break;
9473 case 'q': *(va_arg(*args, Quad_t*)) = i; break;
9478 sv_setuv_mg(argsv, (UV)i);
9480 continue; /* not "break" */
9486 if (!args && ckWARN(WARN_PRINTF) &&
9487 (PL_op->op_type == OP_PRTF || PL_op->op_type == OP_SPRINTF)) {
9488 SV *msg = sv_newmortal();
9489 Perl_sv_setpvf(aTHX_ msg, "Invalid conversion in %sprintf: ",
9490 (PL_op->op_type == OP_PRTF) ? "" : "s");
9493 Perl_sv_catpvf(aTHX_ msg,
9494 "\"%%%c\"", c & 0xFF);
9496 Perl_sv_catpvf(aTHX_ msg,
9497 "\"%%\\%03"UVof"\"",
9500 sv_catpv(msg, "end of string");
9501 Perl_warner(aTHX_ packWARN(WARN_PRINTF), "%"SVf, msg); /* yes, this is reentrant */
9504 /* output mangled stuff ... */
9510 /* ... right here, because formatting flags should not apply */
9511 SvGROW(sv, SvCUR(sv) + elen + 1);
9513 Copy(eptr, p, elen, char);
9516 SvCUR(sv) = p - SvPVX(sv);
9518 continue; /* not "break" */
9521 /* calculate width before utf8_upgrade changes it */
9522 have = esignlen + zeros + elen;
9524 if (is_utf8 != has_utf8) {
9527 sv_utf8_upgrade(sv);
9530 SV *nsv = sv_2mortal(newSVpvn(eptr, elen));
9531 sv_utf8_upgrade(nsv);
9535 SvGROW(sv, SvCUR(sv) + elen + 1);
9539 /* Use memchr() instead of strchr(), as eptr is not guaranteed */
9540 /* to point to a null-terminated string. */
9541 if (left && ckWARN(WARN_PRINTF) && memchr(eptr, '\n', elen) &&
9542 (PL_op->op_type == OP_PRTF || PL_op->op_type == OP_SPRINTF))
9543 Perl_warner(aTHX_ packWARN(WARN_PRINTF),
9544 "Newline in left-justified string for %sprintf",
9545 (PL_op->op_type == OP_PRTF) ? "" : "s");
9547 need = (have > width ? have : width);
9550 SvGROW(sv, SvCUR(sv) + need + dotstrlen + 1);
9552 if (esignlen && fill == '0') {
9553 for (i = 0; i < (int)esignlen; i++)
9557 memset(p, fill, gap);
9560 if (esignlen && fill != '0') {
9561 for (i = 0; i < (int)esignlen; i++)
9565 for (i = zeros; i; i--)
9569 Copy(eptr, p, elen, char);
9573 memset(p, ' ', gap);
9578 Copy(dotstr, p, dotstrlen, char);
9582 vectorize = FALSE; /* done iterating over vecstr */
9589 SvCUR(sv) = p - SvPVX(sv);
9597 /* =========================================================================
9599 =head1 Cloning an interpreter
9601 All the macros and functions in this section are for the private use of
9602 the main function, perl_clone().
9604 The foo_dup() functions make an exact copy of an existing foo thinngy.
9605 During the course of a cloning, a hash table is used to map old addresses
9606 to new addresses. The table is created and manipulated with the
9607 ptr_table_* functions.
9611 ============================================================================*/
9614 #if defined(USE_ITHREADS)
9616 #ifndef GpREFCNT_inc
9617 # define GpREFCNT_inc(gp) ((gp) ? (++(gp)->gp_refcnt, (gp)) : (GP*)NULL)
9621 #define sv_dup_inc(s,t) SvREFCNT_inc(sv_dup(s,t))
9622 #define av_dup(s,t) (AV*)sv_dup((SV*)s,t)
9623 #define av_dup_inc(s,t) (AV*)SvREFCNT_inc(sv_dup((SV*)s,t))
9624 #define hv_dup(s,t) (HV*)sv_dup((SV*)s,t)
9625 #define hv_dup_inc(s,t) (HV*)SvREFCNT_inc(sv_dup((SV*)s,t))
9626 #define cv_dup(s,t) (CV*)sv_dup((SV*)s,t)
9627 #define cv_dup_inc(s,t) (CV*)SvREFCNT_inc(sv_dup((SV*)s,t))
9628 #define io_dup(s,t) (IO*)sv_dup((SV*)s,t)
9629 #define io_dup_inc(s,t) (IO*)SvREFCNT_inc(sv_dup((SV*)s,t))
9630 #define gv_dup(s,t) (GV*)sv_dup((SV*)s,t)
9631 #define gv_dup_inc(s,t) (GV*)SvREFCNT_inc(sv_dup((SV*)s,t))
9632 #define SAVEPV(p) (p ? savepv(p) : Nullch)
9633 #define SAVEPVN(p,n) (p ? savepvn(p,n) : Nullch)
9636 /* Duplicate a regexp. Required reading: pregcomp() and pregfree() in
9637 regcomp.c. AMS 20010712 */
9640 Perl_re_dup(pTHX_ REGEXP *r, CLONE_PARAMS *param)
9644 struct reg_substr_datum *s;
9647 return (REGEXP *)NULL;
9649 if ((ret = (REGEXP *)ptr_table_fetch(PL_ptr_table, r)))
9652 len = r->offsets[0];
9653 npar = r->nparens+1;
9655 Newc(0, ret, sizeof(regexp) + (len+1)*sizeof(regnode), char, regexp);
9656 Copy(r->program, ret->program, len+1, regnode);
9658 New(0, ret->startp, npar, I32);
9659 Copy(r->startp, ret->startp, npar, I32);
9660 New(0, ret->endp, npar, I32);
9661 Copy(r->startp, ret->startp, npar, I32);
9663 New(0, ret->substrs, 1, struct reg_substr_data);
9664 for (s = ret->substrs->data, i = 0; i < 3; i++, s++) {
9665 s->min_offset = r->substrs->data[i].min_offset;
9666 s->max_offset = r->substrs->data[i].max_offset;
9667 s->substr = sv_dup_inc(r->substrs->data[i].substr, param);
9668 s->utf8_substr = sv_dup_inc(r->substrs->data[i].utf8_substr, param);
9671 ret->regstclass = NULL;
9674 int count = r->data->count;
9676 Newc(0, d, sizeof(struct reg_data) + count*sizeof(void *),
9677 char, struct reg_data);
9678 New(0, d->what, count, U8);
9681 for (i = 0; i < count; i++) {
9682 d->what[i] = r->data->what[i];
9683 switch (d->what[i]) {
9685 d->data[i] = sv_dup_inc((SV *)r->data->data[i], param);
9688 d->data[i] = av_dup_inc((AV *)r->data->data[i], param);
9691 /* This is cheating. */
9692 New(0, d->data[i], 1, struct regnode_charclass_class);
9693 StructCopy(r->data->data[i], d->data[i],
9694 struct regnode_charclass_class);
9695 ret->regstclass = (regnode*)d->data[i];
9698 /* Compiled op trees are readonly, and can thus be
9699 shared without duplication. */
9700 d->data[i] = (void*)OpREFCNT_inc((OP*)r->data->data[i]);
9703 d->data[i] = r->data->data[i];
9713 New(0, ret->offsets, 2*len+1, U32);
9714 Copy(r->offsets, ret->offsets, 2*len+1, U32);
9716 ret->precomp = SAVEPV(r->precomp);
9717 ret->refcnt = r->refcnt;
9718 ret->minlen = r->minlen;
9719 ret->prelen = r->prelen;
9720 ret->nparens = r->nparens;
9721 ret->lastparen = r->lastparen;
9722 ret->lastcloseparen = r->lastcloseparen;
9723 ret->reganch = r->reganch;
9725 ret->sublen = r->sublen;
9727 if (RX_MATCH_COPIED(ret))
9728 ret->subbeg = SAVEPV(r->subbeg);
9730 ret->subbeg = Nullch;
9731 #ifdef PERL_COPY_ON_WRITE
9732 ret->saved_copy = Nullsv;
9735 ptr_table_store(PL_ptr_table, r, ret);
9739 /* duplicate a file handle */
9742 Perl_fp_dup(pTHX_ PerlIO *fp, char type, CLONE_PARAMS *param)
9746 return (PerlIO*)NULL;
9748 /* look for it in the table first */
9749 ret = (PerlIO*)ptr_table_fetch(PL_ptr_table, fp);
9753 /* create anew and remember what it is */
9754 ret = PerlIO_fdupopen(aTHX_ fp, param, PERLIO_DUP_CLONE);
9755 ptr_table_store(PL_ptr_table, fp, ret);
9759 /* duplicate a directory handle */
9762 Perl_dirp_dup(pTHX_ DIR *dp)
9770 /* duplicate a typeglob */
9773 Perl_gp_dup(pTHX_ GP *gp, CLONE_PARAMS* param)
9778 /* look for it in the table first */
9779 ret = (GP*)ptr_table_fetch(PL_ptr_table, gp);
9783 /* create anew and remember what it is */
9784 Newz(0, ret, 1, GP);
9785 ptr_table_store(PL_ptr_table, gp, ret);
9788 ret->gp_refcnt = 0; /* must be before any other dups! */
9789 ret->gp_sv = sv_dup_inc(gp->gp_sv, param);
9790 ret->gp_io = io_dup_inc(gp->gp_io, param);
9791 ret->gp_form = cv_dup_inc(gp->gp_form, param);
9792 ret->gp_av = av_dup_inc(gp->gp_av, param);
9793 ret->gp_hv = hv_dup_inc(gp->gp_hv, param);
9794 ret->gp_egv = gv_dup(gp->gp_egv, param);/* GvEGV is not refcounted */
9795 ret->gp_cv = cv_dup_inc(gp->gp_cv, param);
9796 ret->gp_cvgen = gp->gp_cvgen;
9797 ret->gp_flags = gp->gp_flags;
9798 ret->gp_line = gp->gp_line;
9799 ret->gp_file = gp->gp_file; /* points to COP.cop_file */
9803 /* duplicate a chain of magic */
9806 Perl_mg_dup(pTHX_ MAGIC *mg, CLONE_PARAMS* param)
9808 MAGIC *mgprev = (MAGIC*)NULL;
9811 return (MAGIC*)NULL;
9812 /* look for it in the table first */
9813 mgret = (MAGIC*)ptr_table_fetch(PL_ptr_table, mg);
9817 for (; mg; mg = mg->mg_moremagic) {
9819 Newz(0, nmg, 1, MAGIC);
9821 mgprev->mg_moremagic = nmg;
9824 nmg->mg_virtual = mg->mg_virtual; /* XXX copy dynamic vtable? */
9825 nmg->mg_private = mg->mg_private;
9826 nmg->mg_type = mg->mg_type;
9827 nmg->mg_flags = mg->mg_flags;
9828 if (mg->mg_type == PERL_MAGIC_qr) {
9829 nmg->mg_obj = (SV*)re_dup((REGEXP*)mg->mg_obj, param);
9831 else if(mg->mg_type == PERL_MAGIC_backref) {
9832 AV *av = (AV*) mg->mg_obj;
9835 SvREFCNT_inc(nmg->mg_obj = (SV*)newAV());
9837 for (i = AvFILLp(av); i >= 0; i--) {
9838 if (!svp[i]) continue;
9839 av_push((AV*)nmg->mg_obj,sv_dup(svp[i],param));
9843 nmg->mg_obj = (mg->mg_flags & MGf_REFCOUNTED)
9844 ? sv_dup_inc(mg->mg_obj, param)
9845 : sv_dup(mg->mg_obj, param);
9847 nmg->mg_len = mg->mg_len;
9848 nmg->mg_ptr = mg->mg_ptr; /* XXX random ptr? */
9849 if (mg->mg_ptr && mg->mg_type != PERL_MAGIC_regex_global) {
9850 if (mg->mg_len > 0) {
9851 nmg->mg_ptr = SAVEPVN(mg->mg_ptr, mg->mg_len);
9852 if (mg->mg_type == PERL_MAGIC_overload_table &&
9853 AMT_AMAGIC((AMT*)mg->mg_ptr))
9855 AMT *amtp = (AMT*)mg->mg_ptr;
9856 AMT *namtp = (AMT*)nmg->mg_ptr;
9858 for (i = 1; i < NofAMmeth; i++) {
9859 namtp->table[i] = cv_dup_inc(amtp->table[i], param);
9863 else if (mg->mg_len == HEf_SVKEY)
9864 nmg->mg_ptr = (char*)sv_dup_inc((SV*)mg->mg_ptr, param);
9866 if ((mg->mg_flags & MGf_DUP) && mg->mg_virtual && mg->mg_virtual->svt_dup) {
9867 CALL_FPTR(nmg->mg_virtual->svt_dup)(aTHX_ nmg, param);
9874 /* create a new pointer-mapping table */
9877 Perl_ptr_table_new(pTHX)
9880 Newz(0, tbl, 1, PTR_TBL_t);
9883 Newz(0, tbl->tbl_ary, tbl->tbl_max + 1, PTR_TBL_ENT_t*);
9887 /* map an existing pointer using a table */
9890 Perl_ptr_table_fetch(pTHX_ PTR_TBL_t *tbl, void *sv)
9892 PTR_TBL_ENT_t *tblent;
9893 UV hash = PTR2UV(sv);
9895 tblent = tbl->tbl_ary[hash & tbl->tbl_max];
9896 for (; tblent; tblent = tblent->next) {
9897 if (tblent->oldval == sv)
9898 return tblent->newval;
9903 /* add a new entry to a pointer-mapping table */
9906 Perl_ptr_table_store(pTHX_ PTR_TBL_t *tbl, void *oldv, void *newv)
9908 PTR_TBL_ENT_t *tblent, **otblent;
9909 /* XXX this may be pessimal on platforms where pointers aren't good
9910 * hash values e.g. if they grow faster in the most significant
9912 UV hash = PTR2UV(oldv);
9916 otblent = &tbl->tbl_ary[hash & tbl->tbl_max];
9917 for (tblent = *otblent; tblent; i=0, tblent = tblent->next) {
9918 if (tblent->oldval == oldv) {
9919 tblent->newval = newv;
9923 Newz(0, tblent, 1, PTR_TBL_ENT_t);
9924 tblent->oldval = oldv;
9925 tblent->newval = newv;
9926 tblent->next = *otblent;
9929 if (i && tbl->tbl_items > tbl->tbl_max)
9930 ptr_table_split(tbl);
9933 /* double the hash bucket size of an existing ptr table */
9936 Perl_ptr_table_split(pTHX_ PTR_TBL_t *tbl)
9938 PTR_TBL_ENT_t **ary = tbl->tbl_ary;
9939 UV oldsize = tbl->tbl_max + 1;
9940 UV newsize = oldsize * 2;
9943 Renew(ary, newsize, PTR_TBL_ENT_t*);
9944 Zero(&ary[oldsize], newsize-oldsize, PTR_TBL_ENT_t*);
9945 tbl->tbl_max = --newsize;
9947 for (i=0; i < oldsize; i++, ary++) {
9948 PTR_TBL_ENT_t **curentp, **entp, *ent;
9951 curentp = ary + oldsize;
9952 for (entp = ary, ent = *ary; ent; ent = *entp) {
9953 if ((newsize & PTR2UV(ent->oldval)) != i) {
9955 ent->next = *curentp;
9965 /* remove all the entries from a ptr table */
9968 Perl_ptr_table_clear(pTHX_ PTR_TBL_t *tbl)
9970 register PTR_TBL_ENT_t **array;
9971 register PTR_TBL_ENT_t *entry;
9972 register PTR_TBL_ENT_t *oentry = Null(PTR_TBL_ENT_t*);
9976 if (!tbl || !tbl->tbl_items) {
9980 array = tbl->tbl_ary;
9987 entry = entry->next;
9991 if (++riter > max) {
9994 entry = array[riter];
10001 /* clear and free a ptr table */
10004 Perl_ptr_table_free(pTHX_ PTR_TBL_t *tbl)
10009 ptr_table_clear(tbl);
10010 Safefree(tbl->tbl_ary);
10015 char *PL_watch_pvx;
10018 /* attempt to make everything in the typeglob readonly */
10021 S_gv_share(pTHX_ SV *sstr, CLONE_PARAMS *param)
10023 GV *gv = (GV*)sstr;
10024 SV *sv = ¶m->proto_perl->Isv_no; /* just need SvREADONLY-ness */
10026 if (GvIO(gv) || GvFORM(gv)) {
10027 GvUNIQUE_off(gv); /* GvIOs cannot be shared. nor can GvFORMs */
10029 else if (!GvCV(gv)) {
10030 GvCV(gv) = (CV*)sv;
10033 /* CvPADLISTs cannot be shared */
10034 if (!SvREADONLY(GvCV(gv)) && !CvXSUB(GvCV(gv))) {
10039 if (!GvUNIQUE(gv)) {
10041 PerlIO_printf(Perl_debug_log, "gv_share: unable to share %s::%s\n",
10042 HvNAME(GvSTASH(gv)), GvNAME(gv));
10048 * write attempts will die with
10049 * "Modification of a read-only value attempted"
10055 SvREADONLY_on(GvSV(gv));
10059 GvAV(gv) = (AV*)sv;
10062 SvREADONLY_on(GvAV(gv));
10066 GvHV(gv) = (HV*)sv;
10069 SvREADONLY_on(GvHV(gv));
10072 return sstr; /* he_dup() will SvREFCNT_inc() */
10075 /* duplicate an SV of any type (including AV, HV etc) */
10078 Perl_rvpv_dup(pTHX_ SV *dstr, SV *sstr, CLONE_PARAMS* param)
10081 SvRV(dstr) = SvWEAKREF(sstr)
10082 ? sv_dup(SvRV(sstr), param)
10083 : sv_dup_inc(SvRV(sstr), param);
10085 else if (SvPVX(sstr)) {
10086 /* Has something there */
10088 /* Normal PV - clone whole allocated space */
10089 SvPVX(dstr) = SAVEPVN(SvPVX(sstr), SvLEN(sstr)-1);
10090 if (SvREADONLY(sstr) && SvFAKE(sstr)) {
10091 /* Not that normal - actually sstr is copy on write.
10092 But we are a true, independant SV, so: */
10093 SvREADONLY_off(dstr);
10098 /* Special case - not normally malloced for some reason */
10099 if (SvREADONLY(sstr) && SvFAKE(sstr)) {
10100 /* A "shared" PV - clone it as unshared string */
10101 if(SvPADTMP(sstr)) {
10102 /* However, some of them live in the pad
10103 and they should not have these flags
10106 SvPVX(dstr) = sharepvn(SvPVX(sstr), SvCUR(sstr),
10108 SvUVX(dstr) = SvUVX(sstr);
10111 SvPVX(dstr) = SAVEPVN(SvPVX(sstr), SvCUR(sstr));
10113 SvREADONLY_off(dstr);
10117 /* Some other special case - random pointer */
10118 SvPVX(dstr) = SvPVX(sstr);
10123 /* Copy the Null */
10124 SvPVX(dstr) = SvPVX(sstr);
10129 Perl_sv_dup(pTHX_ SV *sstr, CLONE_PARAMS* param)
10133 if (!sstr || SvTYPE(sstr) == SVTYPEMASK)
10135 /* look for it in the table first */
10136 dstr = (SV*)ptr_table_fetch(PL_ptr_table, sstr);
10140 if(param->flags & CLONEf_JOIN_IN) {
10141 /** We are joining here so we don't want do clone
10142 something that is bad **/
10144 if(SvTYPE(sstr) == SVt_PVHV &&
10146 /** don't clone stashes if they already exist **/
10147 HV* old_stash = gv_stashpv(HvNAME(sstr),0);
10148 return (SV*) old_stash;
10152 /* create anew and remember what it is */
10154 ptr_table_store(PL_ptr_table, sstr, dstr);
10157 SvFLAGS(dstr) = SvFLAGS(sstr);
10158 SvFLAGS(dstr) &= ~SVf_OOK; /* don't propagate OOK hack */
10159 SvREFCNT(dstr) = 0; /* must be before any other dups! */
10162 if (SvANY(sstr) && PL_watch_pvx && SvPVX(sstr) == PL_watch_pvx)
10163 PerlIO_printf(Perl_debug_log, "watch at %p hit, found string \"%s\"\n",
10164 PL_watch_pvx, SvPVX(sstr));
10167 switch (SvTYPE(sstr)) {
10169 SvANY(dstr) = NULL;
10172 SvANY(dstr) = new_XIV();
10173 SvIVX(dstr) = SvIVX(sstr);
10176 SvANY(dstr) = new_XNV();
10177 SvNVX(dstr) = SvNVX(sstr);
10180 SvANY(dstr) = new_XRV();
10181 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10184 SvANY(dstr) = new_XPV();
10185 SvCUR(dstr) = SvCUR(sstr);
10186 SvLEN(dstr) = SvLEN(sstr);
10187 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10190 SvANY(dstr) = new_XPVIV();
10191 SvCUR(dstr) = SvCUR(sstr);
10192 SvLEN(dstr) = SvLEN(sstr);
10193 SvIVX(dstr) = SvIVX(sstr);
10194 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10197 SvANY(dstr) = new_XPVNV();
10198 SvCUR(dstr) = SvCUR(sstr);
10199 SvLEN(dstr) = SvLEN(sstr);
10200 SvIVX(dstr) = SvIVX(sstr);
10201 SvNVX(dstr) = SvNVX(sstr);
10202 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10205 SvANY(dstr) = new_XPVMG();
10206 SvCUR(dstr) = SvCUR(sstr);
10207 SvLEN(dstr) = SvLEN(sstr);
10208 SvIVX(dstr) = SvIVX(sstr);
10209 SvNVX(dstr) = SvNVX(sstr);
10210 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr), param);
10211 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr), param);
10212 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10215 SvANY(dstr) = new_XPVBM();
10216 SvCUR(dstr) = SvCUR(sstr);
10217 SvLEN(dstr) = SvLEN(sstr);
10218 SvIVX(dstr) = SvIVX(sstr);
10219 SvNVX(dstr) = SvNVX(sstr);
10220 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr), param);
10221 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr), param);
10222 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10223 BmRARE(dstr) = BmRARE(sstr);
10224 BmUSEFUL(dstr) = BmUSEFUL(sstr);
10225 BmPREVIOUS(dstr)= BmPREVIOUS(sstr);
10228 SvANY(dstr) = new_XPVLV();
10229 SvCUR(dstr) = SvCUR(sstr);
10230 SvLEN(dstr) = SvLEN(sstr);
10231 SvIVX(dstr) = SvIVX(sstr);
10232 SvNVX(dstr) = SvNVX(sstr);
10233 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr), param);
10234 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr), param);
10235 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10236 LvTARGOFF(dstr) = LvTARGOFF(sstr); /* XXX sometimes holds PMOP* when DEBUGGING */
10237 LvTARGLEN(dstr) = LvTARGLEN(sstr);
10238 if (LvTYPE(sstr) == 't') /* for tie: unrefcnted fake (SV**) */
10239 LvTARG(dstr) = dstr;
10240 else if (LvTYPE(sstr) == 'T') /* for tie: fake HE */
10241 LvTARG(dstr) = (SV*)he_dup((HE*)LvTARG(sstr), 0, param);
10243 LvTARG(dstr) = sv_dup_inc(LvTARG(sstr), param);
10244 LvTYPE(dstr) = LvTYPE(sstr);
10247 if (GvUNIQUE((GV*)sstr)) {
10249 if ((share = gv_share(sstr, param))) {
10252 ptr_table_store(PL_ptr_table, sstr, dstr);
10254 PerlIO_printf(Perl_debug_log, "sv_dup: sharing %s::%s\n",
10255 HvNAME(GvSTASH(share)), GvNAME(share));
10260 SvANY(dstr) = new_XPVGV();
10261 SvCUR(dstr) = SvCUR(sstr);
10262 SvLEN(dstr) = SvLEN(sstr);
10263 SvIVX(dstr) = SvIVX(sstr);
10264 SvNVX(dstr) = SvNVX(sstr);
10265 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr), param);
10266 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr), param);
10267 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10268 GvNAMELEN(dstr) = GvNAMELEN(sstr);
10269 GvNAME(dstr) = SAVEPVN(GvNAME(sstr), GvNAMELEN(sstr));
10270 GvSTASH(dstr) = hv_dup_inc(GvSTASH(sstr), param);
10271 GvFLAGS(dstr) = GvFLAGS(sstr);
10272 GvGP(dstr) = gp_dup(GvGP(sstr), param);
10273 (void)GpREFCNT_inc(GvGP(dstr));
10276 SvANY(dstr) = new_XPVIO();
10277 SvCUR(dstr) = SvCUR(sstr);
10278 SvLEN(dstr) = SvLEN(sstr);
10279 SvIVX(dstr) = SvIVX(sstr);
10280 SvNVX(dstr) = SvNVX(sstr);
10281 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr), param);
10282 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr), param);
10283 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10284 IoIFP(dstr) = fp_dup(IoIFP(sstr), IoTYPE(sstr), param);
10285 if (IoOFP(sstr) == IoIFP(sstr))
10286 IoOFP(dstr) = IoIFP(dstr);
10288 IoOFP(dstr) = fp_dup(IoOFP(sstr), IoTYPE(sstr), param);
10289 /* PL_rsfp_filters entries have fake IoDIRP() */
10290 if (IoDIRP(sstr) && !(IoFLAGS(sstr) & IOf_FAKE_DIRP))
10291 IoDIRP(dstr) = dirp_dup(IoDIRP(sstr));
10293 IoDIRP(dstr) = IoDIRP(sstr);
10294 IoLINES(dstr) = IoLINES(sstr);
10295 IoPAGE(dstr) = IoPAGE(sstr);
10296 IoPAGE_LEN(dstr) = IoPAGE_LEN(sstr);
10297 IoLINES_LEFT(dstr) = IoLINES_LEFT(sstr);
10298 if(IoFLAGS(sstr) & IOf_FAKE_DIRP) {
10299 /* I have no idea why fake dirp (rsfps)
10300 should be treaded differently but otherwise
10301 we end up with leaks -- sky*/
10302 IoTOP_GV(dstr) = gv_dup_inc(IoTOP_GV(sstr), param);
10303 IoFMT_GV(dstr) = gv_dup_inc(IoFMT_GV(sstr), param);
10304 IoBOTTOM_GV(dstr) = gv_dup_inc(IoBOTTOM_GV(sstr), param);
10306 IoTOP_GV(dstr) = gv_dup(IoTOP_GV(sstr), param);
10307 IoFMT_GV(dstr) = gv_dup(IoFMT_GV(sstr), param);
10308 IoBOTTOM_GV(dstr) = gv_dup(IoBOTTOM_GV(sstr), param);
10310 IoTOP_NAME(dstr) = SAVEPV(IoTOP_NAME(sstr));
10311 IoFMT_NAME(dstr) = SAVEPV(IoFMT_NAME(sstr));
10312 IoBOTTOM_NAME(dstr) = SAVEPV(IoBOTTOM_NAME(sstr));
10313 IoSUBPROCESS(dstr) = IoSUBPROCESS(sstr);
10314 IoTYPE(dstr) = IoTYPE(sstr);
10315 IoFLAGS(dstr) = IoFLAGS(sstr);
10318 SvANY(dstr) = new_XPVAV();
10319 SvCUR(dstr) = SvCUR(sstr);
10320 SvLEN(dstr) = SvLEN(sstr);
10321 SvIVX(dstr) = SvIVX(sstr);
10322 SvNVX(dstr) = SvNVX(sstr);
10323 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr), param);
10324 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr), param);
10325 AvARYLEN((AV*)dstr) = sv_dup_inc(AvARYLEN((AV*)sstr), param);
10326 AvFLAGS((AV*)dstr) = AvFLAGS((AV*)sstr);
10327 if (AvARRAY((AV*)sstr)) {
10328 SV **dst_ary, **src_ary;
10329 SSize_t items = AvFILLp((AV*)sstr) + 1;
10331 src_ary = AvARRAY((AV*)sstr);
10332 Newz(0, dst_ary, AvMAX((AV*)sstr)+1, SV*);
10333 ptr_table_store(PL_ptr_table, src_ary, dst_ary);
10334 SvPVX(dstr) = (char*)dst_ary;
10335 AvALLOC((AV*)dstr) = dst_ary;
10336 if (AvREAL((AV*)sstr)) {
10337 while (items-- > 0)
10338 *dst_ary++ = sv_dup_inc(*src_ary++, param);
10341 while (items-- > 0)
10342 *dst_ary++ = sv_dup(*src_ary++, param);
10344 items = AvMAX((AV*)sstr) - AvFILLp((AV*)sstr);
10345 while (items-- > 0) {
10346 *dst_ary++ = &PL_sv_undef;
10350 SvPVX(dstr) = Nullch;
10351 AvALLOC((AV*)dstr) = (SV**)NULL;
10355 SvANY(dstr) = new_XPVHV();
10356 SvCUR(dstr) = SvCUR(sstr);
10357 SvLEN(dstr) = SvLEN(sstr);
10358 SvIVX(dstr) = SvIVX(sstr);
10359 SvNVX(dstr) = SvNVX(sstr);
10360 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr), param);
10361 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr), param);
10362 HvRITER((HV*)dstr) = HvRITER((HV*)sstr);
10363 if (HvARRAY((HV*)sstr)) {
10365 XPVHV *dxhv = (XPVHV*)SvANY(dstr);
10366 XPVHV *sxhv = (XPVHV*)SvANY(sstr);
10367 Newz(0, dxhv->xhv_array,
10368 PERL_HV_ARRAY_ALLOC_BYTES(dxhv->xhv_max+1), char);
10369 while (i <= sxhv->xhv_max) {
10370 ((HE**)dxhv->xhv_array)[i] = he_dup(((HE**)sxhv->xhv_array)[i],
10371 (bool)!!HvSHAREKEYS(sstr),
10375 dxhv->xhv_eiter = he_dup(sxhv->xhv_eiter,
10376 (bool)!!HvSHAREKEYS(sstr), param);
10379 SvPVX(dstr) = Nullch;
10380 HvEITER((HV*)dstr) = (HE*)NULL;
10382 HvPMROOT((HV*)dstr) = HvPMROOT((HV*)sstr); /* XXX */
10383 HvNAME((HV*)dstr) = SAVEPV(HvNAME((HV*)sstr));
10384 /* Record stashes for possible cloning in Perl_clone(). */
10385 if(HvNAME((HV*)dstr))
10386 av_push(param->stashes, dstr);
10389 SvANY(dstr) = new_XPVFM();
10390 FmLINES(dstr) = FmLINES(sstr);
10394 SvANY(dstr) = new_XPVCV();
10396 SvCUR(dstr) = SvCUR(sstr);
10397 SvLEN(dstr) = SvLEN(sstr);
10398 SvIVX(dstr) = SvIVX(sstr);
10399 SvNVX(dstr) = SvNVX(sstr);
10400 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr), param);
10401 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr), param);
10402 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10403 CvSTASH(dstr) = hv_dup(CvSTASH(sstr), param); /* NOTE: not refcounted */
10404 CvSTART(dstr) = CvSTART(sstr);
10405 CvROOT(dstr) = OpREFCNT_inc(CvROOT(sstr));
10406 CvXSUB(dstr) = CvXSUB(sstr);
10407 CvXSUBANY(dstr) = CvXSUBANY(sstr);
10408 if (CvCONST(sstr)) {
10409 CvXSUBANY(dstr).any_ptr = GvUNIQUE(CvGV(sstr)) ?
10410 SvREFCNT_inc(CvXSUBANY(sstr).any_ptr) :
10411 sv_dup_inc(CvXSUBANY(sstr).any_ptr, param);
10413 /* don't dup if copying back - CvGV isn't refcounted, so the
10414 * duped GV may never be freed. A bit of a hack! DAPM */
10415 CvGV(dstr) = (param->flags & CLONEf_JOIN_IN) ?
10416 Nullgv : gv_dup(CvGV(sstr), param) ;
10417 if (param->flags & CLONEf_COPY_STACKS) {
10418 CvDEPTH(dstr) = CvDEPTH(sstr);
10422 PAD_DUP(CvPADLIST(dstr), CvPADLIST(sstr), param);
10423 CvOUTSIDE_SEQ(dstr) = CvOUTSIDE_SEQ(sstr);
10425 CvWEAKOUTSIDE(sstr)
10426 ? cv_dup( CvOUTSIDE(sstr), param)
10427 : cv_dup_inc(CvOUTSIDE(sstr), param);
10428 CvFLAGS(dstr) = CvFLAGS(sstr);
10429 CvFILE(dstr) = CvXSUB(sstr) ? CvFILE(sstr) : SAVEPV(CvFILE(sstr));
10432 Perl_croak(aTHX_ "Bizarre SvTYPE [%" IVdf "]", (IV)SvTYPE(sstr));
10436 if (SvOBJECT(dstr) && SvTYPE(dstr) != SVt_PVIO)
10442 /* duplicate a context */
10445 Perl_cx_dup(pTHX_ PERL_CONTEXT *cxs, I32 ix, I32 max, CLONE_PARAMS* param)
10447 PERL_CONTEXT *ncxs;
10450 return (PERL_CONTEXT*)NULL;
10452 /* look for it in the table first */
10453 ncxs = (PERL_CONTEXT*)ptr_table_fetch(PL_ptr_table, cxs);
10457 /* create anew and remember what it is */
10458 Newz(56, ncxs, max + 1, PERL_CONTEXT);
10459 ptr_table_store(PL_ptr_table, cxs, ncxs);
10462 PERL_CONTEXT *cx = &cxs[ix];
10463 PERL_CONTEXT *ncx = &ncxs[ix];
10464 ncx->cx_type = cx->cx_type;
10465 if (CxTYPE(cx) == CXt_SUBST) {
10466 Perl_croak(aTHX_ "Cloning substitution context is unimplemented");
10469 ncx->blk_oldsp = cx->blk_oldsp;
10470 ncx->blk_oldcop = cx->blk_oldcop;
10471 ncx->blk_oldretsp = cx->blk_oldretsp;
10472 ncx->blk_oldmarksp = cx->blk_oldmarksp;
10473 ncx->blk_oldscopesp = cx->blk_oldscopesp;
10474 ncx->blk_oldpm = cx->blk_oldpm;
10475 ncx->blk_gimme = cx->blk_gimme;
10476 switch (CxTYPE(cx)) {
10478 ncx->blk_sub.cv = (cx->blk_sub.olddepth == 0
10479 ? cv_dup_inc(cx->blk_sub.cv, param)
10480 : cv_dup(cx->blk_sub.cv,param));
10481 ncx->blk_sub.argarray = (cx->blk_sub.hasargs
10482 ? av_dup_inc(cx->blk_sub.argarray, param)
10484 ncx->blk_sub.savearray = av_dup_inc(cx->blk_sub.savearray, param);
10485 ncx->blk_sub.olddepth = cx->blk_sub.olddepth;
10486 ncx->blk_sub.hasargs = cx->blk_sub.hasargs;
10487 ncx->blk_sub.lval = cx->blk_sub.lval;
10490 ncx->blk_eval.old_in_eval = cx->blk_eval.old_in_eval;
10491 ncx->blk_eval.old_op_type = cx->blk_eval.old_op_type;
10492 ncx->blk_eval.old_namesv = sv_dup_inc(cx->blk_eval.old_namesv, param);
10493 ncx->blk_eval.old_eval_root = cx->blk_eval.old_eval_root;
10494 ncx->blk_eval.cur_text = sv_dup(cx->blk_eval.cur_text, param);
10497 ncx->blk_loop.label = cx->blk_loop.label;
10498 ncx->blk_loop.resetsp = cx->blk_loop.resetsp;
10499 ncx->blk_loop.redo_op = cx->blk_loop.redo_op;
10500 ncx->blk_loop.next_op = cx->blk_loop.next_op;
10501 ncx->blk_loop.last_op = cx->blk_loop.last_op;
10502 ncx->blk_loop.iterdata = (CxPADLOOP(cx)
10503 ? cx->blk_loop.iterdata
10504 : gv_dup((GV*)cx->blk_loop.iterdata, param));
10505 ncx->blk_loop.oldcomppad
10506 = (PAD*)ptr_table_fetch(PL_ptr_table,
10507 cx->blk_loop.oldcomppad);
10508 ncx->blk_loop.itersave = sv_dup_inc(cx->blk_loop.itersave, param);
10509 ncx->blk_loop.iterlval = sv_dup_inc(cx->blk_loop.iterlval, param);
10510 ncx->blk_loop.iterary = av_dup_inc(cx->blk_loop.iterary, param);
10511 ncx->blk_loop.iterix = cx->blk_loop.iterix;
10512 ncx->blk_loop.itermax = cx->blk_loop.itermax;
10515 ncx->blk_sub.cv = cv_dup(cx->blk_sub.cv, param);
10516 ncx->blk_sub.gv = gv_dup(cx->blk_sub.gv, param);
10517 ncx->blk_sub.dfoutgv = gv_dup_inc(cx->blk_sub.dfoutgv, param);
10518 ncx->blk_sub.hasargs = cx->blk_sub.hasargs;
10530 /* duplicate a stack info structure */
10533 Perl_si_dup(pTHX_ PERL_SI *si, CLONE_PARAMS* param)
10538 return (PERL_SI*)NULL;
10540 /* look for it in the table first */
10541 nsi = (PERL_SI*)ptr_table_fetch(PL_ptr_table, si);
10545 /* create anew and remember what it is */
10546 Newz(56, nsi, 1, PERL_SI);
10547 ptr_table_store(PL_ptr_table, si, nsi);
10549 nsi->si_stack = av_dup_inc(si->si_stack, param);
10550 nsi->si_cxix = si->si_cxix;
10551 nsi->si_cxmax = si->si_cxmax;
10552 nsi->si_cxstack = cx_dup(si->si_cxstack, si->si_cxix, si->si_cxmax, param);
10553 nsi->si_type = si->si_type;
10554 nsi->si_prev = si_dup(si->si_prev, param);
10555 nsi->si_next = si_dup(si->si_next, param);
10556 nsi->si_markoff = si->si_markoff;
10561 #define POPINT(ss,ix) ((ss)[--(ix)].any_i32)
10562 #define TOPINT(ss,ix) ((ss)[ix].any_i32)
10563 #define POPLONG(ss,ix) ((ss)[--(ix)].any_long)
10564 #define TOPLONG(ss,ix) ((ss)[ix].any_long)
10565 #define POPIV(ss,ix) ((ss)[--(ix)].any_iv)
10566 #define TOPIV(ss,ix) ((ss)[ix].any_iv)
10567 #define POPBOOL(ss,ix) ((ss)[--(ix)].any_bool)
10568 #define TOPBOOL(ss,ix) ((ss)[ix].any_bool)
10569 #define POPPTR(ss,ix) ((ss)[--(ix)].any_ptr)
10570 #define TOPPTR(ss,ix) ((ss)[ix].any_ptr)
10571 #define POPDPTR(ss,ix) ((ss)[--(ix)].any_dptr)
10572 #define TOPDPTR(ss,ix) ((ss)[ix].any_dptr)
10573 #define POPDXPTR(ss,ix) ((ss)[--(ix)].any_dxptr)
10574 #define TOPDXPTR(ss,ix) ((ss)[ix].any_dxptr)
10577 #define pv_dup_inc(p) SAVEPV(p)
10578 #define pv_dup(p) SAVEPV(p)
10579 #define svp_dup_inc(p,pp) any_dup(p,pp)
10581 /* map any object to the new equivent - either something in the
10582 * ptr table, or something in the interpreter structure
10586 Perl_any_dup(pTHX_ void *v, PerlInterpreter *proto_perl)
10591 return (void*)NULL;
10593 /* look for it in the table first */
10594 ret = ptr_table_fetch(PL_ptr_table, v);
10598 /* see if it is part of the interpreter structure */
10599 if (v >= (void*)proto_perl && v < (void*)(proto_perl+1))
10600 ret = (void*)(((char*)aTHX) + (((char*)v) - (char*)proto_perl));
10608 /* duplicate the save stack */
10611 Perl_ss_dup(pTHX_ PerlInterpreter *proto_perl, CLONE_PARAMS* param)
10613 ANY *ss = proto_perl->Tsavestack;
10614 I32 ix = proto_perl->Tsavestack_ix;
10615 I32 max = proto_perl->Tsavestack_max;
10628 void (*dptr) (void*);
10629 void (*dxptr) (pTHX_ void*);
10632 Newz(54, nss, max, ANY);
10636 TOPINT(nss,ix) = i;
10638 case SAVEt_ITEM: /* normal string */
10639 sv = (SV*)POPPTR(ss,ix);
10640 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
10641 sv = (SV*)POPPTR(ss,ix);
10642 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
10644 case SAVEt_SV: /* scalar reference */
10645 sv = (SV*)POPPTR(ss,ix);
10646 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
10647 gv = (GV*)POPPTR(ss,ix);
10648 TOPPTR(nss,ix) = gv_dup_inc(gv, param);
10650 case SAVEt_GENERIC_PVREF: /* generic char* */
10651 c = (char*)POPPTR(ss,ix);
10652 TOPPTR(nss,ix) = pv_dup(c);
10653 ptr = POPPTR(ss,ix);
10654 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10656 case SAVEt_SHARED_PVREF: /* char* in shared space */
10657 c = (char*)POPPTR(ss,ix);
10658 TOPPTR(nss,ix) = savesharedpv(c);
10659 ptr = POPPTR(ss,ix);
10660 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10662 case SAVEt_GENERIC_SVREF: /* generic sv */
10663 case SAVEt_SVREF: /* scalar reference */
10664 sv = (SV*)POPPTR(ss,ix);
10665 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
10666 ptr = POPPTR(ss,ix);
10667 TOPPTR(nss,ix) = svp_dup_inc((SV**)ptr, proto_perl);/* XXXXX */
10669 case SAVEt_AV: /* array reference */
10670 av = (AV*)POPPTR(ss,ix);
10671 TOPPTR(nss,ix) = av_dup_inc(av, param);
10672 gv = (GV*)POPPTR(ss,ix);
10673 TOPPTR(nss,ix) = gv_dup(gv, param);
10675 case SAVEt_HV: /* hash reference */
10676 hv = (HV*)POPPTR(ss,ix);
10677 TOPPTR(nss,ix) = hv_dup_inc(hv, param);
10678 gv = (GV*)POPPTR(ss,ix);
10679 TOPPTR(nss,ix) = gv_dup(gv, param);
10681 case SAVEt_INT: /* int reference */
10682 ptr = POPPTR(ss,ix);
10683 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10684 intval = (int)POPINT(ss,ix);
10685 TOPINT(nss,ix) = intval;
10687 case SAVEt_LONG: /* long reference */
10688 ptr = POPPTR(ss,ix);
10689 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10690 longval = (long)POPLONG(ss,ix);
10691 TOPLONG(nss,ix) = longval;
10693 case SAVEt_I32: /* I32 reference */
10694 case SAVEt_I16: /* I16 reference */
10695 case SAVEt_I8: /* I8 reference */
10696 ptr = POPPTR(ss,ix);
10697 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10699 TOPINT(nss,ix) = i;
10701 case SAVEt_IV: /* IV reference */
10702 ptr = POPPTR(ss,ix);
10703 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10705 TOPIV(nss,ix) = iv;
10707 case SAVEt_SPTR: /* SV* reference */
10708 ptr = POPPTR(ss,ix);
10709 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10710 sv = (SV*)POPPTR(ss,ix);
10711 TOPPTR(nss,ix) = sv_dup(sv, param);
10713 case SAVEt_VPTR: /* random* reference */
10714 ptr = POPPTR(ss,ix);
10715 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10716 ptr = POPPTR(ss,ix);
10717 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10719 case SAVEt_PPTR: /* char* reference */
10720 ptr = POPPTR(ss,ix);
10721 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10722 c = (char*)POPPTR(ss,ix);
10723 TOPPTR(nss,ix) = pv_dup(c);
10725 case SAVEt_HPTR: /* HV* reference */
10726 ptr = POPPTR(ss,ix);
10727 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10728 hv = (HV*)POPPTR(ss,ix);
10729 TOPPTR(nss,ix) = hv_dup(hv, param);
10731 case SAVEt_APTR: /* AV* reference */
10732 ptr = POPPTR(ss,ix);
10733 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10734 av = (AV*)POPPTR(ss,ix);
10735 TOPPTR(nss,ix) = av_dup(av, param);
10738 gv = (GV*)POPPTR(ss,ix);
10739 TOPPTR(nss,ix) = gv_dup(gv, param);
10741 case SAVEt_GP: /* scalar reference */
10742 gp = (GP*)POPPTR(ss,ix);
10743 TOPPTR(nss,ix) = gp = gp_dup(gp, param);
10744 (void)GpREFCNT_inc(gp);
10745 gv = (GV*)POPPTR(ss,ix);
10746 TOPPTR(nss,ix) = gv_dup_inc(gv, param);
10747 c = (char*)POPPTR(ss,ix);
10748 TOPPTR(nss,ix) = pv_dup(c);
10750 TOPIV(nss,ix) = iv;
10752 TOPIV(nss,ix) = iv;
10755 case SAVEt_MORTALIZESV:
10756 sv = (SV*)POPPTR(ss,ix);
10757 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
10760 ptr = POPPTR(ss,ix);
10761 if (ptr && (((OP*)ptr)->op_private & OPpREFCOUNTED)) {
10762 /* these are assumed to be refcounted properly */
10763 switch (((OP*)ptr)->op_type) {
10765 case OP_LEAVESUBLV:
10769 case OP_LEAVEWRITE:
10770 TOPPTR(nss,ix) = ptr;
10775 TOPPTR(nss,ix) = Nullop;
10780 TOPPTR(nss,ix) = Nullop;
10783 c = (char*)POPPTR(ss,ix);
10784 TOPPTR(nss,ix) = pv_dup_inc(c);
10786 case SAVEt_CLEARSV:
10787 longval = POPLONG(ss,ix);
10788 TOPLONG(nss,ix) = longval;
10791 hv = (HV*)POPPTR(ss,ix);
10792 TOPPTR(nss,ix) = hv_dup_inc(hv, param);
10793 c = (char*)POPPTR(ss,ix);
10794 TOPPTR(nss,ix) = pv_dup_inc(c);
10796 TOPINT(nss,ix) = i;
10798 case SAVEt_DESTRUCTOR:
10799 ptr = POPPTR(ss,ix);
10800 TOPPTR(nss,ix) = any_dup(ptr, proto_perl); /* XXX quite arbitrary */
10801 dptr = POPDPTR(ss,ix);
10802 TOPDPTR(nss,ix) = (void (*)(void*))any_dup((void *)dptr, proto_perl);
10804 case SAVEt_DESTRUCTOR_X:
10805 ptr = POPPTR(ss,ix);
10806 TOPPTR(nss,ix) = any_dup(ptr, proto_perl); /* XXX quite arbitrary */
10807 dxptr = POPDXPTR(ss,ix);
10808 TOPDXPTR(nss,ix) = (void (*)(pTHX_ void*))any_dup((void *)dxptr, proto_perl);
10810 case SAVEt_REGCONTEXT:
10813 TOPINT(nss,ix) = i;
10816 case SAVEt_STACK_POS: /* Position on Perl stack */
10818 TOPINT(nss,ix) = i;
10820 case SAVEt_AELEM: /* array element */
10821 sv = (SV*)POPPTR(ss,ix);
10822 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
10824 TOPINT(nss,ix) = i;
10825 av = (AV*)POPPTR(ss,ix);
10826 TOPPTR(nss,ix) = av_dup_inc(av, param);
10828 case SAVEt_HELEM: /* hash element */
10829 sv = (SV*)POPPTR(ss,ix);
10830 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
10831 sv = (SV*)POPPTR(ss,ix);
10832 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
10833 hv = (HV*)POPPTR(ss,ix);
10834 TOPPTR(nss,ix) = hv_dup_inc(hv, param);
10837 ptr = POPPTR(ss,ix);
10838 TOPPTR(nss,ix) = ptr;
10842 TOPINT(nss,ix) = i;
10844 case SAVEt_COMPPAD:
10845 av = (AV*)POPPTR(ss,ix);
10846 TOPPTR(nss,ix) = av_dup(av, param);
10849 longval = (long)POPLONG(ss,ix);
10850 TOPLONG(nss,ix) = longval;
10851 ptr = POPPTR(ss,ix);
10852 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10853 sv = (SV*)POPPTR(ss,ix);
10854 TOPPTR(nss,ix) = sv_dup(sv, param);
10857 ptr = POPPTR(ss,ix);
10858 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10859 longval = (long)POPBOOL(ss,ix);
10860 TOPBOOL(nss,ix) = (bool)longval;
10862 case SAVEt_SET_SVFLAGS:
10864 TOPINT(nss,ix) = i;
10866 TOPINT(nss,ix) = i;
10867 sv = (SV*)POPPTR(ss,ix);
10868 TOPPTR(nss,ix) = sv_dup(sv, param);
10871 Perl_croak(aTHX_ "panic: ss_dup inconsistency");
10879 =for apidoc perl_clone
10881 Create and return a new interpreter by cloning the current one.
10883 perl_clone takes these flags as parameters:
10885 CLONEf_COPY_STACKS - is used to, well, copy the stacks also,
10886 without it we only clone the data and zero the stacks,
10887 with it we copy the stacks and the new perl interpreter is
10888 ready to run at the exact same point as the previous one.
10889 The pseudo-fork code uses COPY_STACKS while the
10890 threads->new doesn't.
10892 CLONEf_KEEP_PTR_TABLE
10893 perl_clone keeps a ptr_table with the pointer of the old
10894 variable as a key and the new variable as a value,
10895 this allows it to check if something has been cloned and not
10896 clone it again but rather just use the value and increase the
10897 refcount. If KEEP_PTR_TABLE is not set then perl_clone will kill
10898 the ptr_table using the function
10899 C<ptr_table_free(PL_ptr_table); PL_ptr_table = NULL;>,
10900 reason to keep it around is if you want to dup some of your own
10901 variable who are outside the graph perl scans, example of this
10902 code is in threads.xs create
10905 This is a win32 thing, it is ignored on unix, it tells perls
10906 win32host code (which is c++) to clone itself, this is needed on
10907 win32 if you want to run two threads at the same time,
10908 if you just want to do some stuff in a separate perl interpreter
10909 and then throw it away and return to the original one,
10910 you don't need to do anything.
10915 /* XXX the above needs expanding by someone who actually understands it ! */
10916 EXTERN_C PerlInterpreter *
10917 perl_clone_host(PerlInterpreter* proto_perl, UV flags);
10920 perl_clone(PerlInterpreter *proto_perl, UV flags)
10922 #ifdef PERL_IMPLICIT_SYS
10924 /* perlhost.h so we need to call into it
10925 to clone the host, CPerlHost should have a c interface, sky */
10927 if (flags & CLONEf_CLONE_HOST) {
10928 return perl_clone_host(proto_perl,flags);
10930 return perl_clone_using(proto_perl, flags,
10932 proto_perl->IMemShared,
10933 proto_perl->IMemParse,
10935 proto_perl->IStdIO,
10939 proto_perl->IProc);
10943 perl_clone_using(PerlInterpreter *proto_perl, UV flags,
10944 struct IPerlMem* ipM, struct IPerlMem* ipMS,
10945 struct IPerlMem* ipMP, struct IPerlEnv* ipE,
10946 struct IPerlStdIO* ipStd, struct IPerlLIO* ipLIO,
10947 struct IPerlDir* ipD, struct IPerlSock* ipS,
10948 struct IPerlProc* ipP)
10950 /* XXX many of the string copies here can be optimized if they're
10951 * constants; they need to be allocated as common memory and just
10952 * their pointers copied. */
10955 CLONE_PARAMS clone_params;
10956 CLONE_PARAMS* param = &clone_params;
10958 PerlInterpreter *my_perl = (PerlInterpreter*)(*ipM->pMalloc)(ipM, sizeof(PerlInterpreter));
10959 PERL_SET_THX(my_perl);
10962 Poison(my_perl, 1, PerlInterpreter);
10966 PL_savestack_ix = 0;
10967 PL_savestack_max = -1;
10969 PL_sig_pending = 0;
10970 Zero(&PL_debug_pad, 1, struct perl_debug_pad);
10971 # else /* !DEBUGGING */
10972 Zero(my_perl, 1, PerlInterpreter);
10973 # endif /* DEBUGGING */
10975 /* host pointers */
10977 PL_MemShared = ipMS;
10978 PL_MemParse = ipMP;
10985 #else /* !PERL_IMPLICIT_SYS */
10987 CLONE_PARAMS clone_params;
10988 CLONE_PARAMS* param = &clone_params;
10989 PerlInterpreter *my_perl = (PerlInterpreter*)PerlMem_malloc(sizeof(PerlInterpreter));
10990 PERL_SET_THX(my_perl);
10995 Poison(my_perl, 1, PerlInterpreter);
10999 PL_savestack_ix = 0;
11000 PL_savestack_max = -1;
11002 PL_sig_pending = 0;
11003 Zero(&PL_debug_pad, 1, struct perl_debug_pad);
11004 # else /* !DEBUGGING */
11005 Zero(my_perl, 1, PerlInterpreter);
11006 # endif /* DEBUGGING */
11007 #endif /* PERL_IMPLICIT_SYS */
11008 param->flags = flags;
11009 param->proto_perl = proto_perl;
11012 PL_xiv_arenaroot = NULL;
11013 PL_xiv_root = NULL;
11014 PL_xnv_arenaroot = NULL;
11015 PL_xnv_root = NULL;
11016 PL_xrv_arenaroot = NULL;
11017 PL_xrv_root = NULL;
11018 PL_xpv_arenaroot = NULL;
11019 PL_xpv_root = NULL;
11020 PL_xpviv_arenaroot = NULL;
11021 PL_xpviv_root = NULL;
11022 PL_xpvnv_arenaroot = NULL;
11023 PL_xpvnv_root = NULL;
11024 PL_xpvcv_arenaroot = NULL;
11025 PL_xpvcv_root = NULL;
11026 PL_xpvav_arenaroot = NULL;
11027 PL_xpvav_root = NULL;
11028 PL_xpvhv_arenaroot = NULL;
11029 PL_xpvhv_root = NULL;
11030 PL_xpvmg_arenaroot = NULL;
11031 PL_xpvmg_root = NULL;
11032 PL_xpvlv_arenaroot = NULL;
11033 PL_xpvlv_root = NULL;
11034 PL_xpvbm_arenaroot = NULL;
11035 PL_xpvbm_root = NULL;
11036 PL_he_arenaroot = NULL;
11038 PL_nice_chunk = NULL;
11039 PL_nice_chunk_size = 0;
11041 PL_sv_objcount = 0;
11042 PL_sv_root = Nullsv;
11043 PL_sv_arenaroot = Nullsv;
11045 PL_debug = proto_perl->Idebug;
11047 #ifdef USE_REENTRANT_API
11048 /* XXX: things like -Dm will segfault here in perlio, but doing
11049 * PERL_SET_CONTEXT(proto_perl);
11050 * breaks too many other things
11052 Perl_reentrant_init(aTHX);
11055 /* create SV map for pointer relocation */
11056 PL_ptr_table = ptr_table_new();
11058 /* initialize these special pointers as early as possible */
11059 SvANY(&PL_sv_undef) = NULL;
11060 SvREFCNT(&PL_sv_undef) = (~(U32)0)/2;
11061 SvFLAGS(&PL_sv_undef) = SVf_READONLY|SVt_NULL;
11062 ptr_table_store(PL_ptr_table, &proto_perl->Isv_undef, &PL_sv_undef);
11064 SvANY(&PL_sv_no) = new_XPVNV();
11065 SvREFCNT(&PL_sv_no) = (~(U32)0)/2;
11066 SvFLAGS(&PL_sv_no) = SVp_NOK|SVf_NOK|SVp_POK|SVf_POK|SVf_READONLY|SVt_PVNV;
11067 SvPVX(&PL_sv_no) = SAVEPVN(PL_No, 0);
11068 SvCUR(&PL_sv_no) = 0;
11069 SvLEN(&PL_sv_no) = 1;
11070 SvNVX(&PL_sv_no) = 0;
11071 ptr_table_store(PL_ptr_table, &proto_perl->Isv_no, &PL_sv_no);
11073 SvANY(&PL_sv_yes) = new_XPVNV();
11074 SvREFCNT(&PL_sv_yes) = (~(U32)0)/2;
11075 SvFLAGS(&PL_sv_yes) = SVp_NOK|SVf_NOK|SVp_POK|SVf_POK|SVf_READONLY|SVt_PVNV;
11076 SvPVX(&PL_sv_yes) = SAVEPVN(PL_Yes, 1);
11077 SvCUR(&PL_sv_yes) = 1;
11078 SvLEN(&PL_sv_yes) = 2;
11079 SvNVX(&PL_sv_yes) = 1;
11080 ptr_table_store(PL_ptr_table, &proto_perl->Isv_yes, &PL_sv_yes);
11082 /* create (a non-shared!) shared string table */
11083 PL_strtab = newHV();
11084 HvSHAREKEYS_off(PL_strtab);
11085 hv_ksplit(PL_strtab, 512);
11086 ptr_table_store(PL_ptr_table, proto_perl->Istrtab, PL_strtab);
11088 PL_compiling = proto_perl->Icompiling;
11090 /* These two PVs will be free'd special way so must set them same way op.c does */
11091 PL_compiling.cop_stashpv = savesharedpv(PL_compiling.cop_stashpv);
11092 ptr_table_store(PL_ptr_table, proto_perl->Icompiling.cop_stashpv, PL_compiling.cop_stashpv);
11094 PL_compiling.cop_file = savesharedpv(PL_compiling.cop_file);
11095 ptr_table_store(PL_ptr_table, proto_perl->Icompiling.cop_file, PL_compiling.cop_file);
11097 ptr_table_store(PL_ptr_table, &proto_perl->Icompiling, &PL_compiling);
11098 if (!specialWARN(PL_compiling.cop_warnings))
11099 PL_compiling.cop_warnings = sv_dup_inc(PL_compiling.cop_warnings, param);
11100 if (!specialCopIO(PL_compiling.cop_io))
11101 PL_compiling.cop_io = sv_dup_inc(PL_compiling.cop_io, param);
11102 PL_curcop = (COP*)any_dup(proto_perl->Tcurcop, proto_perl);
11104 /* pseudo environmental stuff */
11105 PL_origargc = proto_perl->Iorigargc;
11106 PL_origargv = proto_perl->Iorigargv;
11108 param->stashes = newAV(); /* Setup array of objects to call clone on */
11110 #ifdef PERLIO_LAYERS
11111 /* Clone PerlIO tables as soon as we can handle general xx_dup() */
11112 PerlIO_clone(aTHX_ proto_perl, param);
11115 PL_envgv = gv_dup(proto_perl->Ienvgv, param);
11116 PL_incgv = gv_dup(proto_perl->Iincgv, param);
11117 PL_hintgv = gv_dup(proto_perl->Ihintgv, param);
11118 PL_origfilename = SAVEPV(proto_perl->Iorigfilename);
11119 PL_diehook = sv_dup_inc(proto_perl->Idiehook, param);
11120 PL_warnhook = sv_dup_inc(proto_perl->Iwarnhook, param);
11123 PL_minus_c = proto_perl->Iminus_c;
11124 PL_patchlevel = sv_dup_inc(proto_perl->Ipatchlevel, param);
11125 PL_localpatches = proto_perl->Ilocalpatches;
11126 PL_splitstr = proto_perl->Isplitstr;
11127 PL_preprocess = proto_perl->Ipreprocess;
11128 PL_minus_n = proto_perl->Iminus_n;
11129 PL_minus_p = proto_perl->Iminus_p;
11130 PL_minus_l = proto_perl->Iminus_l;
11131 PL_minus_a = proto_perl->Iminus_a;
11132 PL_minus_F = proto_perl->Iminus_F;
11133 PL_doswitches = proto_perl->Idoswitches;
11134 PL_dowarn = proto_perl->Idowarn;
11135 PL_doextract = proto_perl->Idoextract;
11136 PL_sawampersand = proto_perl->Isawampersand;
11137 PL_unsafe = proto_perl->Iunsafe;
11138 PL_inplace = SAVEPV(proto_perl->Iinplace);
11139 PL_e_script = sv_dup_inc(proto_perl->Ie_script, param);
11140 PL_perldb = proto_perl->Iperldb;
11141 PL_perl_destruct_level = proto_perl->Iperl_destruct_level;
11142 PL_exit_flags = proto_perl->Iexit_flags;
11144 /* magical thingies */
11145 /* XXX time(&PL_basetime) when asked for? */
11146 PL_basetime = proto_perl->Ibasetime;
11147 PL_formfeed = sv_dup(proto_perl->Iformfeed, param);
11149 PL_maxsysfd = proto_perl->Imaxsysfd;
11150 PL_multiline = proto_perl->Imultiline;
11151 PL_statusvalue = proto_perl->Istatusvalue;
11153 PL_statusvalue_vms = proto_perl->Istatusvalue_vms;
11155 PL_encoding = sv_dup(proto_perl->Iencoding, param);
11157 sv_setpvn(PERL_DEBUG_PAD(0), "", 0); /* For regex debugging. */
11158 sv_setpvn(PERL_DEBUG_PAD(1), "", 0); /* ext/re needs these */
11159 sv_setpvn(PERL_DEBUG_PAD(2), "", 0); /* even without DEBUGGING. */
11161 /* Clone the regex array */
11162 PL_regex_padav = newAV();
11164 I32 len = av_len((AV*)proto_perl->Iregex_padav);
11165 SV** regexen = AvARRAY((AV*)proto_perl->Iregex_padav);
11166 av_push(PL_regex_padav,
11167 sv_dup_inc(regexen[0],param));
11168 for(i = 1; i <= len; i++) {
11169 if(SvREPADTMP(regexen[i])) {
11170 av_push(PL_regex_padav, sv_dup_inc(regexen[i], param));
11172 av_push(PL_regex_padav,
11174 newSViv(PTR2IV(re_dup(INT2PTR(REGEXP *,
11175 SvIVX(regexen[i])), param)))
11180 PL_regex_pad = AvARRAY(PL_regex_padav);
11182 /* shortcuts to various I/O objects */
11183 PL_stdingv = gv_dup(proto_perl->Istdingv, param);
11184 PL_stderrgv = gv_dup(proto_perl->Istderrgv, param);
11185 PL_defgv = gv_dup(proto_perl->Idefgv, param);
11186 PL_argvgv = gv_dup(proto_perl->Iargvgv, param);
11187 PL_argvoutgv = gv_dup(proto_perl->Iargvoutgv, param);
11188 PL_argvout_stack = av_dup_inc(proto_perl->Iargvout_stack, param);
11190 /* shortcuts to regexp stuff */
11191 PL_replgv = gv_dup(proto_perl->Ireplgv, param);
11193 /* shortcuts to misc objects */
11194 PL_errgv = gv_dup(proto_perl->Ierrgv, param);
11196 /* shortcuts to debugging objects */
11197 PL_DBgv = gv_dup(proto_perl->IDBgv, param);
11198 PL_DBline = gv_dup(proto_perl->IDBline, param);
11199 PL_DBsub = gv_dup(proto_perl->IDBsub, param);
11200 PL_DBsingle = sv_dup(proto_perl->IDBsingle, param);
11201 PL_DBtrace = sv_dup(proto_perl->IDBtrace, param);
11202 PL_DBsignal = sv_dup(proto_perl->IDBsignal, param);
11203 PL_DBassertion = sv_dup(proto_perl->IDBassertion, param);
11204 PL_lineary = av_dup(proto_perl->Ilineary, param);
11205 PL_dbargs = av_dup(proto_perl->Idbargs, param);
11207 /* symbol tables */
11208 PL_defstash = hv_dup_inc(proto_perl->Tdefstash, param);
11209 PL_curstash = hv_dup(proto_perl->Tcurstash, param);
11210 PL_debstash = hv_dup(proto_perl->Idebstash, param);
11211 PL_globalstash = hv_dup(proto_perl->Iglobalstash, param);
11212 PL_curstname = sv_dup_inc(proto_perl->Icurstname, param);
11214 PL_beginav = av_dup_inc(proto_perl->Ibeginav, param);
11215 PL_beginav_save = av_dup_inc(proto_perl->Ibeginav_save, param);
11216 PL_checkav_save = av_dup_inc(proto_perl->Icheckav_save, param);
11217 PL_endav = av_dup_inc(proto_perl->Iendav, param);
11218 PL_checkav = av_dup_inc(proto_perl->Icheckav, param);
11219 PL_initav = av_dup_inc(proto_perl->Iinitav, param);
11221 PL_sub_generation = proto_perl->Isub_generation;
11223 /* funky return mechanisms */
11224 PL_forkprocess = proto_perl->Iforkprocess;
11226 /* subprocess state */
11227 PL_fdpid = av_dup_inc(proto_perl->Ifdpid, param);
11229 /* internal state */
11230 PL_tainting = proto_perl->Itainting;
11231 PL_taint_warn = proto_perl->Itaint_warn;
11232 PL_maxo = proto_perl->Imaxo;
11233 if (proto_perl->Iop_mask)
11234 PL_op_mask = SAVEPVN(proto_perl->Iop_mask, PL_maxo);
11236 PL_op_mask = Nullch;
11237 /* PL_asserting = proto_perl->Iasserting; */
11239 /* current interpreter roots */
11240 PL_main_cv = cv_dup_inc(proto_perl->Imain_cv, param);
11241 PL_main_root = OpREFCNT_inc(proto_perl->Imain_root);
11242 PL_main_start = proto_perl->Imain_start;
11243 PL_eval_root = proto_perl->Ieval_root;
11244 PL_eval_start = proto_perl->Ieval_start;
11246 /* runtime control stuff */
11247 PL_curcopdb = (COP*)any_dup(proto_perl->Icurcopdb, proto_perl);
11248 PL_copline = proto_perl->Icopline;
11250 PL_filemode = proto_perl->Ifilemode;
11251 PL_lastfd = proto_perl->Ilastfd;
11252 PL_oldname = proto_perl->Ioldname; /* XXX not quite right */
11255 PL_gensym = proto_perl->Igensym;
11256 PL_preambled = proto_perl->Ipreambled;
11257 PL_preambleav = av_dup_inc(proto_perl->Ipreambleav, param);
11258 PL_laststatval = proto_perl->Ilaststatval;
11259 PL_laststype = proto_perl->Ilaststype;
11260 PL_mess_sv = Nullsv;
11262 PL_ors_sv = sv_dup_inc(proto_perl->Iors_sv, param);
11263 PL_ofmt = SAVEPV(proto_perl->Iofmt);
11265 /* interpreter atexit processing */
11266 PL_exitlistlen = proto_perl->Iexitlistlen;
11267 if (PL_exitlistlen) {
11268 New(0, PL_exitlist, PL_exitlistlen, PerlExitListEntry);
11269 Copy(proto_perl->Iexitlist, PL_exitlist, PL_exitlistlen, PerlExitListEntry);
11272 PL_exitlist = (PerlExitListEntry*)NULL;
11273 PL_modglobal = hv_dup_inc(proto_perl->Imodglobal, param);
11274 PL_custom_op_names = hv_dup_inc(proto_perl->Icustom_op_names,param);
11275 PL_custom_op_descs = hv_dup_inc(proto_perl->Icustom_op_descs,param);
11277 PL_profiledata = NULL;
11278 PL_rsfp = fp_dup(proto_perl->Irsfp, '<', param);
11279 /* PL_rsfp_filters entries have fake IoDIRP() */
11280 PL_rsfp_filters = av_dup_inc(proto_perl->Irsfp_filters, param);
11282 PL_compcv = cv_dup(proto_perl->Icompcv, param);
11284 PAD_CLONE_VARS(proto_perl, param);
11286 #ifdef HAVE_INTERP_INTERN
11287 sys_intern_dup(&proto_perl->Isys_intern, &PL_sys_intern);
11290 /* more statics moved here */
11291 PL_generation = proto_perl->Igeneration;
11292 PL_DBcv = cv_dup(proto_perl->IDBcv, param);
11294 PL_in_clean_objs = proto_perl->Iin_clean_objs;
11295 PL_in_clean_all = proto_perl->Iin_clean_all;
11297 PL_uid = proto_perl->Iuid;
11298 PL_euid = proto_perl->Ieuid;
11299 PL_gid = proto_perl->Igid;
11300 PL_egid = proto_perl->Iegid;
11301 PL_nomemok = proto_perl->Inomemok;
11302 PL_an = proto_perl->Ian;
11303 PL_evalseq = proto_perl->Ievalseq;
11304 PL_origenviron = proto_perl->Iorigenviron; /* XXX not quite right */
11305 PL_origalen = proto_perl->Iorigalen;
11306 PL_pidstatus = newHV(); /* XXX flag for cloning? */
11307 PL_osname = SAVEPV(proto_perl->Iosname);
11308 PL_sh_path_compat = proto_perl->Ish_path_compat; /* XXX never deallocated */
11309 PL_sighandlerp = proto_perl->Isighandlerp;
11312 PL_runops = proto_perl->Irunops;
11314 Copy(proto_perl->Itokenbuf, PL_tokenbuf, 256, char);
11317 PL_cshlen = proto_perl->Icshlen;
11318 PL_cshname = proto_perl->Icshname; /* XXX never deallocated */
11321 PL_lex_state = proto_perl->Ilex_state;
11322 PL_lex_defer = proto_perl->Ilex_defer;
11323 PL_lex_expect = proto_perl->Ilex_expect;
11324 PL_lex_formbrack = proto_perl->Ilex_formbrack;
11325 PL_lex_dojoin = proto_perl->Ilex_dojoin;
11326 PL_lex_starts = proto_perl->Ilex_starts;
11327 PL_lex_stuff = sv_dup_inc(proto_perl->Ilex_stuff, param);
11328 PL_lex_repl = sv_dup_inc(proto_perl->Ilex_repl, param);
11329 PL_lex_op = proto_perl->Ilex_op;
11330 PL_lex_inpat = proto_perl->Ilex_inpat;
11331 PL_lex_inwhat = proto_perl->Ilex_inwhat;
11332 PL_lex_brackets = proto_perl->Ilex_brackets;
11333 i = (PL_lex_brackets < 120 ? 120 : PL_lex_brackets);
11334 PL_lex_brackstack = SAVEPVN(proto_perl->Ilex_brackstack,i);
11335 PL_lex_casemods = proto_perl->Ilex_casemods;
11336 i = (PL_lex_casemods < 12 ? 12 : PL_lex_casemods);
11337 PL_lex_casestack = SAVEPVN(proto_perl->Ilex_casestack,i);
11339 Copy(proto_perl->Inextval, PL_nextval, 5, YYSTYPE);
11340 Copy(proto_perl->Inexttype, PL_nexttype, 5, I32);
11341 PL_nexttoke = proto_perl->Inexttoke;
11343 /* XXX This is probably masking the deeper issue of why
11344 * SvANY(proto_perl->Ilinestr) can be NULL at this point. For test case:
11345 * http://archive.develooper.com/perl5-porters%40perl.org/msg83298.html
11346 * (A little debugging with a watchpoint on it may help.)
11348 if (SvANY(proto_perl->Ilinestr)) {
11349 PL_linestr = sv_dup_inc(proto_perl->Ilinestr, param);
11350 i = proto_perl->Ibufptr - SvPVX(proto_perl->Ilinestr);
11351 PL_bufptr = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
11352 i = proto_perl->Ioldbufptr - SvPVX(proto_perl->Ilinestr);
11353 PL_oldbufptr = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
11354 i = proto_perl->Ioldoldbufptr - SvPVX(proto_perl->Ilinestr);
11355 PL_oldoldbufptr = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
11356 i = proto_perl->Ilinestart - SvPVX(proto_perl->Ilinestr);
11357 PL_linestart = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
11360 PL_linestr = NEWSV(65,79);
11361 sv_upgrade(PL_linestr,SVt_PVIV);
11362 sv_setpvn(PL_linestr,"",0);
11363 PL_bufptr = PL_oldbufptr = PL_oldoldbufptr = PL_linestart = SvPVX(PL_linestr);
11365 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
11366 PL_pending_ident = proto_perl->Ipending_ident;
11367 PL_sublex_info = proto_perl->Isublex_info; /* XXX not quite right */
11369 PL_expect = proto_perl->Iexpect;
11371 PL_multi_start = proto_perl->Imulti_start;
11372 PL_multi_end = proto_perl->Imulti_end;
11373 PL_multi_open = proto_perl->Imulti_open;
11374 PL_multi_close = proto_perl->Imulti_close;
11376 PL_error_count = proto_perl->Ierror_count;
11377 PL_subline = proto_perl->Isubline;
11378 PL_subname = sv_dup_inc(proto_perl->Isubname, param);
11380 /* XXX See comment on SvANY(proto_perl->Ilinestr) above */
11381 if (SvANY(proto_perl->Ilinestr)) {
11382 i = proto_perl->Ilast_uni - SvPVX(proto_perl->Ilinestr);
11383 PL_last_uni = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
11384 i = proto_perl->Ilast_lop - SvPVX(proto_perl->Ilinestr);
11385 PL_last_lop = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
11386 PL_last_lop_op = proto_perl->Ilast_lop_op;
11389 PL_last_uni = SvPVX(PL_linestr);
11390 PL_last_lop = SvPVX(PL_linestr);
11391 PL_last_lop_op = 0;
11393 PL_in_my = proto_perl->Iin_my;
11394 PL_in_my_stash = hv_dup(proto_perl->Iin_my_stash, param);
11396 PL_cryptseen = proto_perl->Icryptseen;
11399 PL_hints = proto_perl->Ihints;
11401 PL_amagic_generation = proto_perl->Iamagic_generation;
11403 #ifdef USE_LOCALE_COLLATE
11404 PL_collation_ix = proto_perl->Icollation_ix;
11405 PL_collation_name = SAVEPV(proto_perl->Icollation_name);
11406 PL_collation_standard = proto_perl->Icollation_standard;
11407 PL_collxfrm_base = proto_perl->Icollxfrm_base;
11408 PL_collxfrm_mult = proto_perl->Icollxfrm_mult;
11409 #endif /* USE_LOCALE_COLLATE */
11411 #ifdef USE_LOCALE_NUMERIC
11412 PL_numeric_name = SAVEPV(proto_perl->Inumeric_name);
11413 PL_numeric_standard = proto_perl->Inumeric_standard;
11414 PL_numeric_local = proto_perl->Inumeric_local;
11415 PL_numeric_radix_sv = sv_dup_inc(proto_perl->Inumeric_radix_sv, param);
11416 #endif /* !USE_LOCALE_NUMERIC */
11418 /* utf8 character classes */
11419 PL_utf8_alnum = sv_dup_inc(proto_perl->Iutf8_alnum, param);
11420 PL_utf8_alnumc = sv_dup_inc(proto_perl->Iutf8_alnumc, param);
11421 PL_utf8_ascii = sv_dup_inc(proto_perl->Iutf8_ascii, param);
11422 PL_utf8_alpha = sv_dup_inc(proto_perl->Iutf8_alpha, param);
11423 PL_utf8_space = sv_dup_inc(proto_perl->Iutf8_space, param);
11424 PL_utf8_cntrl = sv_dup_inc(proto_perl->Iutf8_cntrl, param);
11425 PL_utf8_graph = sv_dup_inc(proto_perl->Iutf8_graph, param);
11426 PL_utf8_digit = sv_dup_inc(proto_perl->Iutf8_digit, param);
11427 PL_utf8_upper = sv_dup_inc(proto_perl->Iutf8_upper, param);
11428 PL_utf8_lower = sv_dup_inc(proto_perl->Iutf8_lower, param);
11429 PL_utf8_print = sv_dup_inc(proto_perl->Iutf8_print, param);
11430 PL_utf8_punct = sv_dup_inc(proto_perl->Iutf8_punct, param);
11431 PL_utf8_xdigit = sv_dup_inc(proto_perl->Iutf8_xdigit, param);
11432 PL_utf8_mark = sv_dup_inc(proto_perl->Iutf8_mark, param);
11433 PL_utf8_toupper = sv_dup_inc(proto_perl->Iutf8_toupper, param);
11434 PL_utf8_totitle = sv_dup_inc(proto_perl->Iutf8_totitle, param);
11435 PL_utf8_tolower = sv_dup_inc(proto_perl->Iutf8_tolower, param);
11436 PL_utf8_tofold = sv_dup_inc(proto_perl->Iutf8_tofold, param);
11437 PL_utf8_idstart = sv_dup_inc(proto_perl->Iutf8_idstart, param);
11438 PL_utf8_idcont = sv_dup_inc(proto_perl->Iutf8_idcont, param);
11440 /* Did the locale setup indicate UTF-8? */
11441 PL_utf8locale = proto_perl->Iutf8locale;
11442 /* Unicode features (see perlrun/-C) */
11443 PL_unicode = proto_perl->Iunicode;
11445 /* Pre-5.8 signals control */
11446 PL_signals = proto_perl->Isignals;
11448 /* times() ticks per second */
11449 PL_clocktick = proto_perl->Iclocktick;
11451 /* Recursion stopper for PerlIO_find_layer */
11452 PL_in_load_module = proto_perl->Iin_load_module;
11454 /* sort() routine */
11455 PL_sort_RealCmp = proto_perl->Isort_RealCmp;
11457 /* Not really needed/useful since the reenrant_retint is "volatile",
11458 * but do it for consistency's sake. */
11459 PL_reentrant_retint = proto_perl->Ireentrant_retint;
11461 /* Hooks to shared SVs and locks. */
11462 PL_sharehook = proto_perl->Isharehook;
11463 PL_lockhook = proto_perl->Ilockhook;
11464 PL_unlockhook = proto_perl->Iunlockhook;
11465 PL_threadhook = proto_perl->Ithreadhook;
11467 PL_runops_std = proto_perl->Irunops_std;
11468 PL_runops_dbg = proto_perl->Irunops_dbg;
11470 #ifdef THREADS_HAVE_PIDS
11471 PL_ppid = proto_perl->Ippid;
11475 PL_last_swash_hv = Nullhv; /* reinits on demand */
11476 PL_last_swash_klen = 0;
11477 PL_last_swash_key[0]= '\0';
11478 PL_last_swash_tmps = (U8*)NULL;
11479 PL_last_swash_slen = 0;
11481 PL_glob_index = proto_perl->Iglob_index;
11482 PL_srand_called = proto_perl->Isrand_called;
11483 PL_hash_seed = proto_perl->Ihash_seed;
11484 PL_rehash_seed = proto_perl->Irehash_seed;
11485 PL_uudmap['M'] = 0; /* reinits on demand */
11486 PL_bitcount = Nullch; /* reinits on demand */
11488 if (proto_perl->Ipsig_pend) {
11489 Newz(0, PL_psig_pend, SIG_SIZE, int);
11492 PL_psig_pend = (int*)NULL;
11495 if (proto_perl->Ipsig_ptr) {
11496 Newz(0, PL_psig_ptr, SIG_SIZE, SV*);
11497 Newz(0, PL_psig_name, SIG_SIZE, SV*);
11498 for (i = 1; i < SIG_SIZE; i++) {
11499 PL_psig_ptr[i] = sv_dup_inc(proto_perl->Ipsig_ptr[i], param);
11500 PL_psig_name[i] = sv_dup_inc(proto_perl->Ipsig_name[i], param);
11504 PL_psig_ptr = (SV**)NULL;
11505 PL_psig_name = (SV**)NULL;
11508 /* thrdvar.h stuff */
11510 if (flags & CLONEf_COPY_STACKS) {
11511 /* next allocation will be PL_tmps_stack[PL_tmps_ix+1] */
11512 PL_tmps_ix = proto_perl->Ttmps_ix;
11513 PL_tmps_max = proto_perl->Ttmps_max;
11514 PL_tmps_floor = proto_perl->Ttmps_floor;
11515 Newz(50, PL_tmps_stack, PL_tmps_max, SV*);
11517 while (i <= PL_tmps_ix) {
11518 PL_tmps_stack[i] = sv_dup_inc(proto_perl->Ttmps_stack[i], param);
11522 /* next PUSHMARK() sets *(PL_markstack_ptr+1) */
11523 i = proto_perl->Tmarkstack_max - proto_perl->Tmarkstack;
11524 Newz(54, PL_markstack, i, I32);
11525 PL_markstack_max = PL_markstack + (proto_perl->Tmarkstack_max
11526 - proto_perl->Tmarkstack);
11527 PL_markstack_ptr = PL_markstack + (proto_perl->Tmarkstack_ptr
11528 - proto_perl->Tmarkstack);
11529 Copy(proto_perl->Tmarkstack, PL_markstack,
11530 PL_markstack_ptr - PL_markstack + 1, I32);
11532 /* next push_scope()/ENTER sets PL_scopestack[PL_scopestack_ix]
11533 * NOTE: unlike the others! */
11534 PL_scopestack_ix = proto_perl->Tscopestack_ix;
11535 PL_scopestack_max = proto_perl->Tscopestack_max;
11536 Newz(54, PL_scopestack, PL_scopestack_max, I32);
11537 Copy(proto_perl->Tscopestack, PL_scopestack, PL_scopestack_ix, I32);
11539 /* next push_return() sets PL_retstack[PL_retstack_ix]
11540 * NOTE: unlike the others! */
11541 PL_retstack_ix = proto_perl->Tretstack_ix;
11542 PL_retstack_max = proto_perl->Tretstack_max;
11543 Newz(54, PL_retstack, PL_retstack_max, OP*);
11544 Copy(proto_perl->Tretstack, PL_retstack, PL_retstack_ix, OP*);
11546 /* NOTE: si_dup() looks at PL_markstack */
11547 PL_curstackinfo = si_dup(proto_perl->Tcurstackinfo, param);
11549 /* PL_curstack = PL_curstackinfo->si_stack; */
11550 PL_curstack = av_dup(proto_perl->Tcurstack, param);
11551 PL_mainstack = av_dup(proto_perl->Tmainstack, param);
11553 /* next PUSHs() etc. set *(PL_stack_sp+1) */
11554 PL_stack_base = AvARRAY(PL_curstack);
11555 PL_stack_sp = PL_stack_base + (proto_perl->Tstack_sp
11556 - proto_perl->Tstack_base);
11557 PL_stack_max = PL_stack_base + AvMAX(PL_curstack);
11559 /* next SSPUSHFOO() sets PL_savestack[PL_savestack_ix]
11560 * NOTE: unlike the others! */
11561 PL_savestack_ix = proto_perl->Tsavestack_ix;
11562 PL_savestack_max = proto_perl->Tsavestack_max;
11563 /*Newz(54, PL_savestack, PL_savestack_max, ANY);*/
11564 PL_savestack = ss_dup(proto_perl, param);
11568 ENTER; /* perl_destruct() wants to LEAVE; */
11571 PL_start_env = proto_perl->Tstart_env; /* XXXXXX */
11572 PL_top_env = &PL_start_env;
11574 PL_op = proto_perl->Top;
11577 PL_Xpv = (XPV*)NULL;
11578 PL_na = proto_perl->Tna;
11580 PL_statbuf = proto_perl->Tstatbuf;
11581 PL_statcache = proto_perl->Tstatcache;
11582 PL_statgv = gv_dup(proto_perl->Tstatgv, param);
11583 PL_statname = sv_dup_inc(proto_perl->Tstatname, param);
11585 PL_timesbuf = proto_perl->Ttimesbuf;
11588 PL_tainted = proto_perl->Ttainted;
11589 PL_curpm = proto_perl->Tcurpm; /* XXX No PMOP ref count */
11590 PL_rs = sv_dup_inc(proto_perl->Trs, param);
11591 PL_last_in_gv = gv_dup(proto_perl->Tlast_in_gv, param);
11592 PL_ofs_sv = sv_dup_inc(proto_perl->Tofs_sv, param);
11593 PL_defoutgv = gv_dup_inc(proto_perl->Tdefoutgv, param);
11594 PL_chopset = proto_perl->Tchopset; /* XXX never deallocated */
11595 PL_toptarget = sv_dup_inc(proto_perl->Ttoptarget, param);
11596 PL_bodytarget = sv_dup_inc(proto_perl->Tbodytarget, param);
11597 PL_formtarget = sv_dup(proto_perl->Tformtarget, param);
11599 PL_restartop = proto_perl->Trestartop;
11600 PL_in_eval = proto_perl->Tin_eval;
11601 PL_delaymagic = proto_perl->Tdelaymagic;
11602 PL_dirty = proto_perl->Tdirty;
11603 PL_localizing = proto_perl->Tlocalizing;
11605 #ifdef PERL_FLEXIBLE_EXCEPTIONS
11606 PL_protect = proto_perl->Tprotect;
11608 PL_errors = sv_dup_inc(proto_perl->Terrors, param);
11609 PL_hv_fetch_ent_mh = Nullhe;
11610 PL_modcount = proto_perl->Tmodcount;
11611 PL_lastgotoprobe = Nullop;
11612 PL_dumpindent = proto_perl->Tdumpindent;
11614 PL_sortcop = (OP*)any_dup(proto_perl->Tsortcop, proto_perl);
11615 PL_sortstash = hv_dup(proto_perl->Tsortstash, param);
11616 PL_firstgv = gv_dup(proto_perl->Tfirstgv, param);
11617 PL_secondgv = gv_dup(proto_perl->Tsecondgv, param);
11618 PL_sortcxix = proto_perl->Tsortcxix;
11619 PL_efloatbuf = Nullch; /* reinits on demand */
11620 PL_efloatsize = 0; /* reinits on demand */
11624 PL_screamfirst = NULL;
11625 PL_screamnext = NULL;
11626 PL_maxscream = -1; /* reinits on demand */
11627 PL_lastscream = Nullsv;
11629 PL_watchaddr = NULL;
11630 PL_watchok = Nullch;
11632 PL_regdummy = proto_perl->Tregdummy;
11633 PL_regprecomp = Nullch;
11636 PL_colorset = 0; /* reinits PL_colors[] */
11637 /*PL_colors[6] = {0,0,0,0,0,0};*/
11638 PL_reginput = Nullch;
11639 PL_regbol = Nullch;
11640 PL_regeol = Nullch;
11641 PL_regstartp = (I32*)NULL;
11642 PL_regendp = (I32*)NULL;
11643 PL_reglastparen = (U32*)NULL;
11644 PL_reglastcloseparen = (U32*)NULL;
11645 PL_regtill = Nullch;
11646 PL_reg_start_tmp = (char**)NULL;
11647 PL_reg_start_tmpl = 0;
11648 PL_regdata = (struct reg_data*)NULL;
11651 PL_reg_eval_set = 0;
11653 PL_regprogram = (regnode*)NULL;
11655 PL_regcc = (CURCUR*)NULL;
11656 PL_reg_call_cc = (struct re_cc_state*)NULL;
11657 PL_reg_re = (regexp*)NULL;
11658 PL_reg_ganch = Nullch;
11659 PL_reg_sv = Nullsv;
11660 PL_reg_match_utf8 = FALSE;
11661 PL_reg_magic = (MAGIC*)NULL;
11663 PL_reg_oldcurpm = (PMOP*)NULL;
11664 PL_reg_curpm = (PMOP*)NULL;
11665 PL_reg_oldsaved = Nullch;
11666 PL_reg_oldsavedlen = 0;
11667 #ifdef PERL_COPY_ON_WRITE
11670 PL_reg_maxiter = 0;
11671 PL_reg_leftiter = 0;
11672 PL_reg_poscache = Nullch;
11673 PL_reg_poscache_size= 0;
11675 /* RE engine - function pointers */
11676 PL_regcompp = proto_perl->Tregcompp;
11677 PL_regexecp = proto_perl->Tregexecp;
11678 PL_regint_start = proto_perl->Tregint_start;
11679 PL_regint_string = proto_perl->Tregint_string;
11680 PL_regfree = proto_perl->Tregfree;
11682 PL_reginterp_cnt = 0;
11683 PL_reg_starttry = 0;
11685 /* Pluggable optimizer */
11686 PL_peepp = proto_perl->Tpeepp;
11688 PL_stashcache = newHV();
11690 if (!(flags & CLONEf_KEEP_PTR_TABLE)) {
11691 ptr_table_free(PL_ptr_table);
11692 PL_ptr_table = NULL;
11695 /* Call the ->CLONE method, if it exists, for each of the stashes
11696 identified by sv_dup() above.
11698 while(av_len(param->stashes) != -1) {
11699 HV* stash = (HV*) av_shift(param->stashes);
11700 GV* cloner = gv_fetchmethod_autoload(stash, "CLONE", 0);
11701 if (cloner && GvCV(cloner)) {
11706 XPUSHs(sv_2mortal(newSVpv(HvNAME(stash), 0)));
11708 call_sv((SV*)GvCV(cloner), G_DISCARD);
11714 SvREFCNT_dec(param->stashes);
11719 #endif /* USE_ITHREADS */
11722 =head1 Unicode Support
11724 =for apidoc sv_recode_to_utf8
11726 The encoding is assumed to be an Encode object, on entry the PV
11727 of the sv is assumed to be octets in that encoding, and the sv
11728 will be converted into Unicode (and UTF-8).
11730 If the sv already is UTF-8 (or if it is not POK), or if the encoding
11731 is not a reference, nothing is done to the sv. If the encoding is not
11732 an C<Encode::XS> Encoding object, bad things will happen.
11733 (See F<lib/encoding.pm> and L<Encode>).
11735 The PV of the sv is returned.
11740 Perl_sv_recode_to_utf8(pTHX_ SV *sv, SV *encoding)
11742 if (SvPOK(sv) && !SvUTF8(sv) && !IN_BYTES && SvROK(encoding)) {
11756 Passing sv_yes is wrong - it needs to be or'ed set of constants
11757 for Encode::XS, while UTf-8 decode (currently) assumes a true value means
11758 remove converted chars from source.
11760 Both will default the value - let them.
11762 XPUSHs(&PL_sv_yes);
11765 call_method("decode", G_SCALAR);
11769 s = SvPV(uni, len);
11770 if (s != SvPVX(sv)) {
11771 SvGROW(sv, len + 1);
11772 Move(s, SvPVX(sv), len, char);
11773 SvCUR_set(sv, len);
11774 SvPVX(sv)[len] = 0;
11784 =for apidoc sv_cat_decode
11786 The encoding is assumed to be an Encode object, the PV of the ssv is
11787 assumed to be octets in that encoding and decoding the input starts
11788 from the position which (PV + *offset) pointed to. The dsv will be
11789 concatenated the decoded UTF-8 string from ssv. Decoding will terminate
11790 when the string tstr appears in decoding output or the input ends on
11791 the PV of the ssv. The value which the offset points will be modified
11792 to the last input position on the ssv.
11794 Returns TRUE if the terminator was found, else returns FALSE.
11799 Perl_sv_cat_decode(pTHX_ SV *dsv, SV *encoding,
11800 SV *ssv, int *offset, char *tstr, int tlen)
11803 if (SvPOK(ssv) && SvPOK(dsv) && SvROK(encoding) && offset) {
11814 XPUSHs(offsv = sv_2mortal(newSViv(*offset)));
11815 XPUSHs(sv_2mortal(newSVpvn(tstr, tlen)));
11817 call_method("cat_decode", G_SCALAR);
11819 ret = SvTRUE(TOPs);
11820 *offset = SvIV(offsv);
11826 Perl_croak(aTHX_ "Invalid argument to sv_cat_decode");