3 * Copyright (C) 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999,
4 * 2000, 2001, 2002, 2003, by Larry Wall and others
6 * You may distribute under the terms of either the GNU General Public
7 * License or the Artistic License, as specified in the README file.
9 * "I wonder what the Entish is for 'yes' and 'no'," he thought.
12 * This file contains the code that creates, manipulates and destroys
13 * scalar values (SVs). The other types (AV, HV, GV, etc.) reuse the
14 * structure of an SV, so their creation and destruction is handled
15 * here; higher-level functions are in av.c, hv.c, and so on. Opcode
16 * level functions (eg. substr, split, join) for each of the types are
27 #ifdef PERL_UTF8_CACHE_ASSERT
28 /* The cache element 0 is the Unicode offset;
29 * the cache element 1 is the byte offset of the element 0;
30 * the cache element 2 is the Unicode length of the substring;
31 * the cache element 3 is the byte length of the substring;
32 * The checking of the substring side would be good
33 * but substr() has enough code paths to make my head spin;
34 * if adding more checks watch out for the following tests:
35 * t/op/index.t t/op/length.t t/op/pat.t t/op/substr.t
36 * lib/utf8.t lib/Unicode/Collate/t/index.t
39 #define ASSERT_UTF8_CACHE(cache) \
40 STMT_START { if (cache) { assert((cache)[0] <= (cache)[1]); } } STMT_END
42 #define ASSERT_UTF8_CACHE(cache) NOOP
45 #ifdef PERL_COPY_ON_WRITE
46 #define SV_COW_NEXT_SV(sv) INT2PTR(SV *,SvUVX(sv))
47 #define SV_COW_NEXT_SV_SET(current,next) SvUVX(current) = PTR2UV(next)
48 /* This is a pessimistic view. Scalar must be purely a read-write PV to copy-
52 /* ============================================================================
54 =head1 Allocation and deallocation of SVs.
56 An SV (or AV, HV, etc.) is allocated in two parts: the head (struct sv,
57 av, hv...) contains type and reference count information, as well as a
58 pointer to the body (struct xrv, xpv, xpviv...), which contains fields
59 specific to each type.
61 Normally, this allocation is done using arenas, which are approximately
62 1K chunks of memory parcelled up into N heads or bodies. The first slot
63 in each arena is reserved, and is used to hold a link to the next arena.
64 In the case of heads, the unused first slot also contains some flags and
65 a note of the number of slots. Snaked through each arena chain is a
66 linked list of free items; when this becomes empty, an extra arena is
67 allocated and divided up into N items which are threaded into the free
70 The following global variables are associated with arenas:
72 PL_sv_arenaroot pointer to list of SV arenas
73 PL_sv_root pointer to list of free SV structures
75 PL_foo_arenaroot pointer to list of foo arenas,
76 PL_foo_root pointer to list of free foo bodies
77 ... for foo in xiv, xnv, xrv, xpv etc.
79 Note that some of the larger and more rarely used body types (eg xpvio)
80 are not allocated using arenas, but are instead just malloc()/free()ed as
81 required. Also, if PURIFY is defined, arenas are abandoned altogether,
82 with all items individually malloc()ed. In addition, a few SV heads are
83 not allocated from an arena, but are instead directly created as static
84 or auto variables, eg PL_sv_undef.
86 The SV arena serves the secondary purpose of allowing still-live SVs
87 to be located and destroyed during final cleanup.
89 At the lowest level, the macros new_SV() and del_SV() grab and free
90 an SV head. (If debugging with -DD, del_SV() calls the function S_del_sv()
91 to return the SV to the free list with error checking.) new_SV() calls
92 more_sv() / sv_add_arena() to add an extra arena if the free list is empty.
93 SVs in the free list have their SvTYPE field set to all ones.
95 Similarly, there are macros new_XIV()/del_XIV(), new_XNV()/del_XNV() etc
96 that allocate and return individual body types. Normally these are mapped
97 to the arena-manipulating functions new_xiv()/del_xiv() etc, but may be
98 instead mapped directly to malloc()/free() if PURIFY is defined. The
99 new/del functions remove from, or add to, the appropriate PL_foo_root
100 list, and call more_xiv() etc to add a new arena if the list is empty.
102 At the time of very final cleanup, sv_free_arenas() is called from
103 perl_destruct() to physically free all the arenas allocated since the
104 start of the interpreter. Note that this also clears PL_he_arenaroot,
105 which is otherwise dealt with in hv.c.
107 Manipulation of any of the PL_*root pointers is protected by enclosing
108 LOCK_SV_MUTEX; ... UNLOCK_SV_MUTEX calls which should Do the Right Thing
109 if threads are enabled.
111 The function visit() scans the SV arenas list, and calls a specified
112 function for each SV it finds which is still live - ie which has an SvTYPE
113 other than all 1's, and a non-zero SvREFCNT. visit() is used by the
114 following functions (specified as [function that calls visit()] / [function
115 called by visit() for each SV]):
117 sv_report_used() / do_report_used()
118 dump all remaining SVs (debugging aid)
120 sv_clean_objs() / do_clean_objs(),do_clean_named_objs()
121 Attempt to free all objects pointed to by RVs,
122 and, unless DISABLE_DESTRUCTOR_KLUDGE is defined,
123 try to do the same for all objects indirectly
124 referenced by typeglobs too. Called once from
125 perl_destruct(), prior to calling sv_clean_all()
128 sv_clean_all() / do_clean_all()
129 SvREFCNT_dec(sv) each remaining SV, possibly
130 triggering an sv_free(). It also sets the
131 SVf_BREAK flag on the SV to indicate that the
132 refcnt has been artificially lowered, and thus
133 stopping sv_free() from giving spurious warnings
134 about SVs which unexpectedly have a refcnt
135 of zero. called repeatedly from perl_destruct()
136 until there are no SVs left.
140 Private API to rest of sv.c
144 new_XIV(), del_XIV(),
145 new_XNV(), del_XNV(),
150 sv_report_used(), sv_clean_objs(), sv_clean_all(), sv_free_arenas()
155 ============================================================================ */
160 * "A time to plant, and a time to uproot what was planted..."
163 #define plant_SV(p) \
165 SvANY(p) = (void *)PL_sv_root; \
166 SvFLAGS(p) = SVTYPEMASK; \
171 /* sv_mutex must be held while calling uproot_SV() */
172 #define uproot_SV(p) \
175 PL_sv_root = (SV*)SvANY(p); \
180 /* new_SV(): return a new, empty SV head */
182 #ifdef DEBUG_LEAKING_SCALARS
183 /* provide a real function for a debugger to play with */
200 # define new_SV(p) (p)=S_new_SV(aTHX)
218 /* del_SV(): return an empty SV head to the free list */
233 S_del_sv(pTHX_ SV *p)
240 for (sva = PL_sv_arenaroot; sva; sva = (SV *) SvANY(sva)) {
242 svend = &sva[SvREFCNT(sva)];
243 if (p >= sv && p < svend)
247 if (ckWARN_d(WARN_INTERNAL))
248 Perl_warner(aTHX_ packWARN(WARN_INTERNAL),
249 "Attempt to free non-arena SV: 0x%"UVxf,
257 #else /* ! DEBUGGING */
259 #define del_SV(p) plant_SV(p)
261 #endif /* DEBUGGING */
265 =head1 SV Manipulation Functions
267 =for apidoc sv_add_arena
269 Given a chunk of memory, link it to the head of the list of arenas,
270 and split it into a list of free SVs.
276 Perl_sv_add_arena(pTHX_ char *ptr, U32 size, U32 flags)
281 Zero(ptr, size, char);
283 /* The first SV in an arena isn't an SV. */
284 SvANY(sva) = (void *) PL_sv_arenaroot; /* ptr to next arena */
285 SvREFCNT(sva) = size / sizeof(SV); /* number of SV slots */
286 SvFLAGS(sva) = flags; /* FAKE if not to be freed */
288 PL_sv_arenaroot = sva;
289 PL_sv_root = sva + 1;
291 svend = &sva[SvREFCNT(sva) - 1];
294 SvANY(sv) = (void *)(SV*)(sv + 1);
295 SvFLAGS(sv) = SVTYPEMASK;
299 SvFLAGS(sv) = SVTYPEMASK;
302 /* make some more SVs by adding another arena */
304 /* sv_mutex must be held while calling more_sv() */
311 sv_add_arena(PL_nice_chunk, PL_nice_chunk_size, 0);
312 PL_nice_chunk = Nullch;
313 PL_nice_chunk_size = 0;
316 char *chunk; /* must use New here to match call to */
317 New(704,chunk,1008,char); /* Safefree() in sv_free_arenas() */
318 sv_add_arena(chunk, 1008, 0);
324 /* visit(): call the named function for each non-free SV in the arenas. */
327 S_visit(pTHX_ SVFUNC_t f)
334 for (sva = PL_sv_arenaroot; sva; sva = (SV*)SvANY(sva)) {
335 svend = &sva[SvREFCNT(sva)];
336 for (sv = sva + 1; sv < svend; ++sv) {
337 if (SvTYPE(sv) != SVTYPEMASK && SvREFCNT(sv)) {
348 /* called by sv_report_used() for each live SV */
351 do_report_used(pTHX_ SV *sv)
353 if (SvTYPE(sv) != SVTYPEMASK) {
354 PerlIO_printf(Perl_debug_log, "****\n");
361 =for apidoc sv_report_used
363 Dump the contents of all SVs not yet freed. (Debugging aid).
369 Perl_sv_report_used(pTHX)
372 visit(do_report_used);
376 /* called by sv_clean_objs() for each live SV */
379 do_clean_objs(pTHX_ SV *sv)
383 if (SvROK(sv) && SvOBJECT(rv = SvRV(sv))) {
384 DEBUG_D((PerlIO_printf(Perl_debug_log, "Cleaning object ref:\n "), sv_dump(sv)));
396 /* XXX Might want to check arrays, etc. */
399 /* called by sv_clean_objs() for each live SV */
401 #ifndef DISABLE_DESTRUCTOR_KLUDGE
403 do_clean_named_objs(pTHX_ SV *sv)
405 if (SvTYPE(sv) == SVt_PVGV && GvGP(sv)) {
406 if ( SvOBJECT(GvSV(sv)) ||
407 (GvAV(sv) && SvOBJECT(GvAV(sv))) ||
408 (GvHV(sv) && SvOBJECT(GvHV(sv))) ||
409 (GvIO(sv) && SvOBJECT(GvIO(sv))) ||
410 (GvCV(sv) && SvOBJECT(GvCV(sv))) )
412 DEBUG_D((PerlIO_printf(Perl_debug_log, "Cleaning named glob object:\n "), sv_dump(sv)));
420 =for apidoc sv_clean_objs
422 Attempt to destroy all objects not yet freed
428 Perl_sv_clean_objs(pTHX)
430 PL_in_clean_objs = TRUE;
431 visit(do_clean_objs);
432 #ifndef DISABLE_DESTRUCTOR_KLUDGE
433 /* some barnacles may yet remain, clinging to typeglobs */
434 visit(do_clean_named_objs);
436 PL_in_clean_objs = FALSE;
439 /* called by sv_clean_all() for each live SV */
442 do_clean_all(pTHX_ SV *sv)
444 DEBUG_D((PerlIO_printf(Perl_debug_log, "Cleaning loops: SV at 0x%"UVxf"\n", PTR2UV(sv)) ));
445 SvFLAGS(sv) |= SVf_BREAK;
450 =for apidoc sv_clean_all
452 Decrement the refcnt of each remaining SV, possibly triggering a
453 cleanup. This function may have to be called multiple times to free
454 SVs which are in complex self-referential hierarchies.
460 Perl_sv_clean_all(pTHX)
463 PL_in_clean_all = TRUE;
464 cleaned = visit(do_clean_all);
465 PL_in_clean_all = FALSE;
470 =for apidoc sv_free_arenas
472 Deallocate the memory used by all arenas. Note that all the individual SV
473 heads and bodies within the arenas must already have been freed.
479 Perl_sv_free_arenas(pTHX)
483 XPV *arena, *arenanext;
485 /* Free arenas here, but be careful about fake ones. (We assume
486 contiguity of the fake ones with the corresponding real ones.) */
488 for (sva = PL_sv_arenaroot; sva; sva = svanext) {
489 svanext = (SV*) SvANY(sva);
490 while (svanext && SvFAKE(svanext))
491 svanext = (SV*) SvANY(svanext);
494 Safefree((void *)sva);
497 for (arena = PL_xiv_arenaroot; arena; arena = arenanext) {
498 arenanext = (XPV*)arena->xpv_pv;
501 PL_xiv_arenaroot = 0;
504 for (arena = PL_xnv_arenaroot; arena; arena = arenanext) {
505 arenanext = (XPV*)arena->xpv_pv;
508 PL_xnv_arenaroot = 0;
511 for (arena = PL_xrv_arenaroot; arena; arena = arenanext) {
512 arenanext = (XPV*)arena->xpv_pv;
515 PL_xrv_arenaroot = 0;
518 for (arena = PL_xpv_arenaroot; arena; arena = arenanext) {
519 arenanext = (XPV*)arena->xpv_pv;
522 PL_xpv_arenaroot = 0;
525 for (arena = (XPV*)PL_xpviv_arenaroot; arena; arena = arenanext) {
526 arenanext = (XPV*)arena->xpv_pv;
529 PL_xpviv_arenaroot = 0;
532 for (arena = (XPV*)PL_xpvnv_arenaroot; arena; arena = arenanext) {
533 arenanext = (XPV*)arena->xpv_pv;
536 PL_xpvnv_arenaroot = 0;
539 for (arena = (XPV*)PL_xpvcv_arenaroot; arena; arena = arenanext) {
540 arenanext = (XPV*)arena->xpv_pv;
543 PL_xpvcv_arenaroot = 0;
546 for (arena = (XPV*)PL_xpvav_arenaroot; arena; arena = arenanext) {
547 arenanext = (XPV*)arena->xpv_pv;
550 PL_xpvav_arenaroot = 0;
553 for (arena = (XPV*)PL_xpvhv_arenaroot; arena; arena = arenanext) {
554 arenanext = (XPV*)arena->xpv_pv;
557 PL_xpvhv_arenaroot = 0;
560 for (arena = (XPV*)PL_xpvmg_arenaroot; arena; arena = arenanext) {
561 arenanext = (XPV*)arena->xpv_pv;
564 PL_xpvmg_arenaroot = 0;
567 for (arena = (XPV*)PL_xpvlv_arenaroot; arena; arena = arenanext) {
568 arenanext = (XPV*)arena->xpv_pv;
571 PL_xpvlv_arenaroot = 0;
574 for (arena = (XPV*)PL_xpvbm_arenaroot; arena; arena = arenanext) {
575 arenanext = (XPV*)arena->xpv_pv;
578 PL_xpvbm_arenaroot = 0;
581 for (arena = (XPV*)PL_he_arenaroot; arena; arena = arenanext) {
582 arenanext = (XPV*)arena->xpv_pv;
589 Safefree(PL_nice_chunk);
590 PL_nice_chunk = Nullch;
591 PL_nice_chunk_size = 0;
597 =for apidoc report_uninit
599 Print appropriate "Use of uninitialized variable" warning
605 Perl_report_uninit(pTHX)
608 Perl_warner(aTHX_ packWARN(WARN_UNINITIALIZED), PL_warn_uninit,
609 " in ", OP_DESC(PL_op));
611 Perl_warner(aTHX_ packWARN(WARN_UNINITIALIZED), PL_warn_uninit, "", "");
614 /* grab a new IV body from the free list, allocating more if necessary */
625 * See comment in more_xiv() -- RAM.
627 PL_xiv_root = *(IV**)xiv;
629 return (XPVIV*)((char*)xiv - STRUCT_OFFSET(XPVIV, xiv_iv));
632 /* return an IV body to the free list */
635 S_del_xiv(pTHX_ XPVIV *p)
637 IV* xiv = (IV*)((char*)(p) + STRUCT_OFFSET(XPVIV, xiv_iv));
639 *(IV**)xiv = PL_xiv_root;
644 /* allocate another arena's worth of IV bodies */
652 New(705, ptr, 1008/sizeof(XPV), XPV);
653 ptr->xpv_pv = (char*)PL_xiv_arenaroot; /* linked list of xiv arenas */
654 PL_xiv_arenaroot = ptr; /* to keep Purify happy */
657 xivend = &xiv[1008 / sizeof(IV) - 1];
658 xiv += (sizeof(XPV) - 1) / sizeof(IV) + 1; /* fudge by size of XPV */
660 while (xiv < xivend) {
661 *(IV**)xiv = (IV *)(xiv + 1);
667 /* grab a new NV body from the free list, allocating more if necessary */
677 PL_xnv_root = *(NV**)xnv;
679 return (XPVNV*)((char*)xnv - STRUCT_OFFSET(XPVNV, xnv_nv));
682 /* return an NV body to the free list */
685 S_del_xnv(pTHX_ XPVNV *p)
687 NV* xnv = (NV*)((char*)(p) + STRUCT_OFFSET(XPVNV, xnv_nv));
689 *(NV**)xnv = PL_xnv_root;
694 /* allocate another arena's worth of NV bodies */
702 New(711, ptr, 1008/sizeof(XPV), XPV);
703 ptr->xpv_pv = (char*)PL_xnv_arenaroot;
704 PL_xnv_arenaroot = ptr;
707 xnvend = &xnv[1008 / sizeof(NV) - 1];
708 xnv += (sizeof(XPVIV) - 1) / sizeof(NV) + 1; /* fudge by sizeof XPVIV */
710 while (xnv < xnvend) {
711 *(NV**)xnv = (NV*)(xnv + 1);
717 /* grab a new struct xrv from the free list, allocating more if necessary */
727 PL_xrv_root = (XRV*)xrv->xrv_rv;
732 /* return a struct xrv to the free list */
735 S_del_xrv(pTHX_ XRV *p)
738 p->xrv_rv = (SV*)PL_xrv_root;
743 /* allocate another arena's worth of struct xrv */
749 register XRV* xrvend;
751 New(712, ptr, 1008/sizeof(XPV), XPV);
752 ptr->xpv_pv = (char*)PL_xrv_arenaroot;
753 PL_xrv_arenaroot = ptr;
756 xrvend = &xrv[1008 / sizeof(XRV) - 1];
757 xrv += (sizeof(XPV) - 1) / sizeof(XRV) + 1;
759 while (xrv < xrvend) {
760 xrv->xrv_rv = (SV*)(xrv + 1);
766 /* grab a new struct xpv from the free list, allocating more if necessary */
776 PL_xpv_root = (XPV*)xpv->xpv_pv;
781 /* return a struct xpv to the free list */
784 S_del_xpv(pTHX_ XPV *p)
787 p->xpv_pv = (char*)PL_xpv_root;
792 /* allocate another arena's worth of struct xpv */
798 register XPV* xpvend;
799 New(713, xpv, 1008/sizeof(XPV), XPV);
800 xpv->xpv_pv = (char*)PL_xpv_arenaroot;
801 PL_xpv_arenaroot = xpv;
803 xpvend = &xpv[1008 / sizeof(XPV) - 1];
805 while (xpv < xpvend) {
806 xpv->xpv_pv = (char*)(xpv + 1);
812 /* grab a new struct xpviv from the free list, allocating more if necessary */
821 xpviv = PL_xpviv_root;
822 PL_xpviv_root = (XPVIV*)xpviv->xpv_pv;
827 /* return a struct xpviv to the free list */
830 S_del_xpviv(pTHX_ XPVIV *p)
833 p->xpv_pv = (char*)PL_xpviv_root;
838 /* allocate another arena's worth of struct xpviv */
843 register XPVIV* xpviv;
844 register XPVIV* xpvivend;
845 New(714, xpviv, 1008/sizeof(XPVIV), XPVIV);
846 xpviv->xpv_pv = (char*)PL_xpviv_arenaroot;
847 PL_xpviv_arenaroot = xpviv;
849 xpvivend = &xpviv[1008 / sizeof(XPVIV) - 1];
850 PL_xpviv_root = ++xpviv;
851 while (xpviv < xpvivend) {
852 xpviv->xpv_pv = (char*)(xpviv + 1);
858 /* grab a new struct xpvnv from the free list, allocating more if necessary */
867 xpvnv = PL_xpvnv_root;
868 PL_xpvnv_root = (XPVNV*)xpvnv->xpv_pv;
873 /* return a struct xpvnv to the free list */
876 S_del_xpvnv(pTHX_ XPVNV *p)
879 p->xpv_pv = (char*)PL_xpvnv_root;
884 /* allocate another arena's worth of struct xpvnv */
889 register XPVNV* xpvnv;
890 register XPVNV* xpvnvend;
891 New(715, xpvnv, 1008/sizeof(XPVNV), XPVNV);
892 xpvnv->xpv_pv = (char*)PL_xpvnv_arenaroot;
893 PL_xpvnv_arenaroot = xpvnv;
895 xpvnvend = &xpvnv[1008 / sizeof(XPVNV) - 1];
896 PL_xpvnv_root = ++xpvnv;
897 while (xpvnv < xpvnvend) {
898 xpvnv->xpv_pv = (char*)(xpvnv + 1);
904 /* grab a new struct xpvcv from the free list, allocating more if necessary */
913 xpvcv = PL_xpvcv_root;
914 PL_xpvcv_root = (XPVCV*)xpvcv->xpv_pv;
919 /* return a struct xpvcv to the free list */
922 S_del_xpvcv(pTHX_ XPVCV *p)
925 p->xpv_pv = (char*)PL_xpvcv_root;
930 /* allocate another arena's worth of struct xpvcv */
935 register XPVCV* xpvcv;
936 register XPVCV* xpvcvend;
937 New(716, xpvcv, 1008/sizeof(XPVCV), XPVCV);
938 xpvcv->xpv_pv = (char*)PL_xpvcv_arenaroot;
939 PL_xpvcv_arenaroot = xpvcv;
941 xpvcvend = &xpvcv[1008 / sizeof(XPVCV) - 1];
942 PL_xpvcv_root = ++xpvcv;
943 while (xpvcv < xpvcvend) {
944 xpvcv->xpv_pv = (char*)(xpvcv + 1);
950 /* grab a new struct xpvav from the free list, allocating more if necessary */
959 xpvav = PL_xpvav_root;
960 PL_xpvav_root = (XPVAV*)xpvav->xav_array;
965 /* return a struct xpvav to the free list */
968 S_del_xpvav(pTHX_ XPVAV *p)
971 p->xav_array = (char*)PL_xpvav_root;
976 /* allocate another arena's worth of struct xpvav */
981 register XPVAV* xpvav;
982 register XPVAV* xpvavend;
983 New(717, xpvav, 1008/sizeof(XPVAV), XPVAV);
984 xpvav->xav_array = (char*)PL_xpvav_arenaroot;
985 PL_xpvav_arenaroot = xpvav;
987 xpvavend = &xpvav[1008 / sizeof(XPVAV) - 1];
988 PL_xpvav_root = ++xpvav;
989 while (xpvav < xpvavend) {
990 xpvav->xav_array = (char*)(xpvav + 1);
993 xpvav->xav_array = 0;
996 /* grab a new struct xpvhv from the free list, allocating more if necessary */
1005 xpvhv = PL_xpvhv_root;
1006 PL_xpvhv_root = (XPVHV*)xpvhv->xhv_array;
1011 /* return a struct xpvhv to the free list */
1014 S_del_xpvhv(pTHX_ XPVHV *p)
1017 p->xhv_array = (char*)PL_xpvhv_root;
1022 /* allocate another arena's worth of struct xpvhv */
1027 register XPVHV* xpvhv;
1028 register XPVHV* xpvhvend;
1029 New(718, xpvhv, 1008/sizeof(XPVHV), XPVHV);
1030 xpvhv->xhv_array = (char*)PL_xpvhv_arenaroot;
1031 PL_xpvhv_arenaroot = xpvhv;
1033 xpvhvend = &xpvhv[1008 / sizeof(XPVHV) - 1];
1034 PL_xpvhv_root = ++xpvhv;
1035 while (xpvhv < xpvhvend) {
1036 xpvhv->xhv_array = (char*)(xpvhv + 1);
1039 xpvhv->xhv_array = 0;
1042 /* grab a new struct xpvmg from the free list, allocating more if necessary */
1051 xpvmg = PL_xpvmg_root;
1052 PL_xpvmg_root = (XPVMG*)xpvmg->xpv_pv;
1057 /* return a struct xpvmg to the free list */
1060 S_del_xpvmg(pTHX_ XPVMG *p)
1063 p->xpv_pv = (char*)PL_xpvmg_root;
1068 /* allocate another arena's worth of struct xpvmg */
1073 register XPVMG* xpvmg;
1074 register XPVMG* xpvmgend;
1075 New(719, xpvmg, 1008/sizeof(XPVMG), XPVMG);
1076 xpvmg->xpv_pv = (char*)PL_xpvmg_arenaroot;
1077 PL_xpvmg_arenaroot = xpvmg;
1079 xpvmgend = &xpvmg[1008 / sizeof(XPVMG) - 1];
1080 PL_xpvmg_root = ++xpvmg;
1081 while (xpvmg < xpvmgend) {
1082 xpvmg->xpv_pv = (char*)(xpvmg + 1);
1088 /* grab a new struct xpvlv from the free list, allocating more if necessary */
1097 xpvlv = PL_xpvlv_root;
1098 PL_xpvlv_root = (XPVLV*)xpvlv->xpv_pv;
1103 /* return a struct xpvlv to the free list */
1106 S_del_xpvlv(pTHX_ XPVLV *p)
1109 p->xpv_pv = (char*)PL_xpvlv_root;
1114 /* allocate another arena's worth of struct xpvlv */
1119 register XPVLV* xpvlv;
1120 register XPVLV* xpvlvend;
1121 New(720, xpvlv, 1008/sizeof(XPVLV), XPVLV);
1122 xpvlv->xpv_pv = (char*)PL_xpvlv_arenaroot;
1123 PL_xpvlv_arenaroot = xpvlv;
1125 xpvlvend = &xpvlv[1008 / sizeof(XPVLV) - 1];
1126 PL_xpvlv_root = ++xpvlv;
1127 while (xpvlv < xpvlvend) {
1128 xpvlv->xpv_pv = (char*)(xpvlv + 1);
1134 /* grab a new struct xpvbm from the free list, allocating more if necessary */
1143 xpvbm = PL_xpvbm_root;
1144 PL_xpvbm_root = (XPVBM*)xpvbm->xpv_pv;
1149 /* return a struct xpvbm to the free list */
1152 S_del_xpvbm(pTHX_ XPVBM *p)
1155 p->xpv_pv = (char*)PL_xpvbm_root;
1160 /* allocate another arena's worth of struct xpvbm */
1165 register XPVBM* xpvbm;
1166 register XPVBM* xpvbmend;
1167 New(721, xpvbm, 1008/sizeof(XPVBM), XPVBM);
1168 xpvbm->xpv_pv = (char*)PL_xpvbm_arenaroot;
1169 PL_xpvbm_arenaroot = xpvbm;
1171 xpvbmend = &xpvbm[1008 / sizeof(XPVBM) - 1];
1172 PL_xpvbm_root = ++xpvbm;
1173 while (xpvbm < xpvbmend) {
1174 xpvbm->xpv_pv = (char*)(xpvbm + 1);
1180 #define my_safemalloc(s) (void*)safemalloc(s)
1181 #define my_safefree(p) safefree((char*)p)
1185 #define new_XIV() my_safemalloc(sizeof(XPVIV))
1186 #define del_XIV(p) my_safefree(p)
1188 #define new_XNV() my_safemalloc(sizeof(XPVNV))
1189 #define del_XNV(p) my_safefree(p)
1191 #define new_XRV() my_safemalloc(sizeof(XRV))
1192 #define del_XRV(p) my_safefree(p)
1194 #define new_XPV() my_safemalloc(sizeof(XPV))
1195 #define del_XPV(p) my_safefree(p)
1197 #define new_XPVIV() my_safemalloc(sizeof(XPVIV))
1198 #define del_XPVIV(p) my_safefree(p)
1200 #define new_XPVNV() my_safemalloc(sizeof(XPVNV))
1201 #define del_XPVNV(p) my_safefree(p)
1203 #define new_XPVCV() my_safemalloc(sizeof(XPVCV))
1204 #define del_XPVCV(p) my_safefree(p)
1206 #define new_XPVAV() my_safemalloc(sizeof(XPVAV))
1207 #define del_XPVAV(p) my_safefree(p)
1209 #define new_XPVHV() my_safemalloc(sizeof(XPVHV))
1210 #define del_XPVHV(p) my_safefree(p)
1212 #define new_XPVMG() my_safemalloc(sizeof(XPVMG))
1213 #define del_XPVMG(p) my_safefree(p)
1215 #define new_XPVLV() my_safemalloc(sizeof(XPVLV))
1216 #define del_XPVLV(p) my_safefree(p)
1218 #define new_XPVBM() my_safemalloc(sizeof(XPVBM))
1219 #define del_XPVBM(p) my_safefree(p)
1223 #define new_XIV() (void*)new_xiv()
1224 #define del_XIV(p) del_xiv((XPVIV*) p)
1226 #define new_XNV() (void*)new_xnv()
1227 #define del_XNV(p) del_xnv((XPVNV*) p)
1229 #define new_XRV() (void*)new_xrv()
1230 #define del_XRV(p) del_xrv((XRV*) p)
1232 #define new_XPV() (void*)new_xpv()
1233 #define del_XPV(p) del_xpv((XPV *)p)
1235 #define new_XPVIV() (void*)new_xpviv()
1236 #define del_XPVIV(p) del_xpviv((XPVIV *)p)
1238 #define new_XPVNV() (void*)new_xpvnv()
1239 #define del_XPVNV(p) del_xpvnv((XPVNV *)p)
1241 #define new_XPVCV() (void*)new_xpvcv()
1242 #define del_XPVCV(p) del_xpvcv((XPVCV *)p)
1244 #define new_XPVAV() (void*)new_xpvav()
1245 #define del_XPVAV(p) del_xpvav((XPVAV *)p)
1247 #define new_XPVHV() (void*)new_xpvhv()
1248 #define del_XPVHV(p) del_xpvhv((XPVHV *)p)
1250 #define new_XPVMG() (void*)new_xpvmg()
1251 #define del_XPVMG(p) del_xpvmg((XPVMG *)p)
1253 #define new_XPVLV() (void*)new_xpvlv()
1254 #define del_XPVLV(p) del_xpvlv((XPVLV *)p)
1256 #define new_XPVBM() (void*)new_xpvbm()
1257 #define del_XPVBM(p) del_xpvbm((XPVBM *)p)
1261 #define new_XPVGV() my_safemalloc(sizeof(XPVGV))
1262 #define del_XPVGV(p) my_safefree(p)
1264 #define new_XPVFM() my_safemalloc(sizeof(XPVFM))
1265 #define del_XPVFM(p) my_safefree(p)
1267 #define new_XPVIO() my_safemalloc(sizeof(XPVIO))
1268 #define del_XPVIO(p) my_safefree(p)
1271 =for apidoc sv_upgrade
1273 Upgrade an SV to a more complex form. Generally adds a new body type to the
1274 SV, then copies across as much information as possible from the old body.
1275 You generally want to use the C<SvUPGRADE> macro wrapper. See also C<svtype>.
1281 Perl_sv_upgrade(pTHX_ register SV *sv, U32 mt)
1288 MAGIC* magic = NULL;
1291 if (mt != SVt_PV && SvIsCOW(sv)) {
1292 sv_force_normal_flags(sv, 0);
1295 if (SvTYPE(sv) == mt)
1299 (void)SvOOK_off(sv);
1301 switch (SvTYPE(sv)) {
1322 else if (mt < SVt_PVIV)
1339 pv = (char*)SvRV(sv);
1359 else if (mt == SVt_NV)
1370 del_XPVIV(SvANY(sv));
1380 del_XPVNV(SvANY(sv));
1388 magic = SvMAGIC(sv);
1389 stash = SvSTASH(sv);
1390 del_XPVMG(SvANY(sv));
1393 Perl_croak(aTHX_ "Can't upgrade that kind of scalar");
1398 Perl_croak(aTHX_ "Can't upgrade to undef");
1400 SvANY(sv) = new_XIV();
1404 SvANY(sv) = new_XNV();
1408 SvANY(sv) = new_XRV();
1412 SvANY(sv) = new_XPV();
1418 SvANY(sv) = new_XPVIV();
1428 SvANY(sv) = new_XPVNV();
1436 SvANY(sv) = new_XPVMG();
1442 SvMAGIC(sv) = magic;
1443 SvSTASH(sv) = stash;
1446 SvANY(sv) = new_XPVLV();
1452 SvMAGIC(sv) = magic;
1453 SvSTASH(sv) = stash;
1460 SvANY(sv) = new_XPVAV();
1468 SvMAGIC(sv) = magic;
1469 SvSTASH(sv) = stash;
1475 SvANY(sv) = new_XPVHV();
1481 HvTOTALKEYS(sv) = 0;
1482 HvPLACEHOLDERS(sv) = 0;
1483 SvMAGIC(sv) = magic;
1484 SvSTASH(sv) = stash;
1491 SvANY(sv) = new_XPVCV();
1492 Zero(SvANY(sv), 1, XPVCV);
1498 SvMAGIC(sv) = magic;
1499 SvSTASH(sv) = stash;
1502 SvANY(sv) = new_XPVGV();
1508 SvMAGIC(sv) = magic;
1509 SvSTASH(sv) = stash;
1517 SvANY(sv) = new_XPVBM();
1523 SvMAGIC(sv) = magic;
1524 SvSTASH(sv) = stash;
1530 SvANY(sv) = new_XPVFM();
1531 Zero(SvANY(sv), 1, XPVFM);
1537 SvMAGIC(sv) = magic;
1538 SvSTASH(sv) = stash;
1541 SvANY(sv) = new_XPVIO();
1542 Zero(SvANY(sv), 1, XPVIO);
1548 SvMAGIC(sv) = magic;
1549 SvSTASH(sv) = stash;
1550 IoPAGE_LEN(sv) = 60;
1553 SvFLAGS(sv) &= ~SVTYPEMASK;
1559 =for apidoc sv_backoff
1561 Remove any string offset. You should normally use the C<SvOOK_off> macro
1568 Perl_sv_backoff(pTHX_ register SV *sv)
1572 char *s = SvPVX(sv);
1573 SvLEN(sv) += SvIVX(sv);
1574 SvPVX(sv) -= SvIVX(sv);
1576 Move(s, SvPVX(sv), SvCUR(sv)+1, char);
1578 SvFLAGS(sv) &= ~SVf_OOK;
1585 Expands the character buffer in the SV. If necessary, uses C<sv_unref> and
1586 upgrades the SV to C<SVt_PV>. Returns a pointer to the character buffer.
1587 Use the C<SvGROW> wrapper instead.
1593 Perl_sv_grow(pTHX_ register SV *sv, register STRLEN newlen)
1597 #ifdef HAS_64K_LIMIT
1598 if (newlen >= 0x10000) {
1599 PerlIO_printf(Perl_debug_log,
1600 "Allocation too large: %"UVxf"\n", (UV)newlen);
1603 #endif /* HAS_64K_LIMIT */
1606 if (SvTYPE(sv) < SVt_PV) {
1607 sv_upgrade(sv, SVt_PV);
1610 else if (SvOOK(sv)) { /* pv is offset? */
1613 if (newlen > SvLEN(sv))
1614 newlen += 10 * (newlen - SvCUR(sv)); /* avoid copy each time */
1615 #ifdef HAS_64K_LIMIT
1616 if (newlen >= 0x10000)
1623 if (newlen > SvLEN(sv)) { /* need more room? */
1624 if (SvLEN(sv) && s) {
1626 STRLEN l = malloced_size((void*)SvPVX(sv));
1632 Renew(s,newlen,char);
1635 New(703, s, newlen, char);
1636 if (SvPVX(sv) && SvCUR(sv)) {
1637 Move(SvPVX(sv), s, (newlen < SvCUR(sv)) ? newlen : SvCUR(sv), char);
1641 SvLEN_set(sv, newlen);
1647 =for apidoc sv_setiv
1649 Copies an integer into the given SV, upgrading first if necessary.
1650 Does not handle 'set' magic. See also C<sv_setiv_mg>.
1656 Perl_sv_setiv(pTHX_ register SV *sv, IV i)
1658 SV_CHECK_THINKFIRST_COW_DROP(sv);
1659 switch (SvTYPE(sv)) {
1661 sv_upgrade(sv, SVt_IV);
1664 sv_upgrade(sv, SVt_PVNV);
1668 sv_upgrade(sv, SVt_PVIV);
1677 Perl_croak(aTHX_ "Can't coerce %s to integer in %s", sv_reftype(sv,0),
1680 (void)SvIOK_only(sv); /* validate number */
1686 =for apidoc sv_setiv_mg
1688 Like C<sv_setiv>, but also handles 'set' magic.
1694 Perl_sv_setiv_mg(pTHX_ register SV *sv, IV i)
1701 =for apidoc sv_setuv
1703 Copies an unsigned integer into the given SV, upgrading first if necessary.
1704 Does not handle 'set' magic. See also C<sv_setuv_mg>.
1710 Perl_sv_setuv(pTHX_ register SV *sv, UV u)
1712 /* With these two if statements:
1713 u=1.49 s=0.52 cu=72.49 cs=10.64 scripts=270 tests=20865
1716 u=1.35 s=0.47 cu=73.45 cs=11.43 scripts=270 tests=20865
1718 If you wish to remove them, please benchmark to see what the effect is
1720 if (u <= (UV)IV_MAX) {
1721 sv_setiv(sv, (IV)u);
1730 =for apidoc sv_setuv_mg
1732 Like C<sv_setuv>, but also handles 'set' magic.
1738 Perl_sv_setuv_mg(pTHX_ register SV *sv, UV u)
1740 /* With these two if statements:
1741 u=1.49 s=0.52 cu=72.49 cs=10.64 scripts=270 tests=20865
1744 u=1.35 s=0.47 cu=73.45 cs=11.43 scripts=270 tests=20865
1746 If you wish to remove them, please benchmark to see what the effect is
1748 if (u <= (UV)IV_MAX) {
1749 sv_setiv(sv, (IV)u);
1759 =for apidoc sv_setnv
1761 Copies a double into the given SV, upgrading first if necessary.
1762 Does not handle 'set' magic. See also C<sv_setnv_mg>.
1768 Perl_sv_setnv(pTHX_ register SV *sv, NV num)
1770 SV_CHECK_THINKFIRST_COW_DROP(sv);
1771 switch (SvTYPE(sv)) {
1774 sv_upgrade(sv, SVt_NV);
1779 sv_upgrade(sv, SVt_PVNV);
1788 Perl_croak(aTHX_ "Can't coerce %s to number in %s", sv_reftype(sv,0),
1792 (void)SvNOK_only(sv); /* validate number */
1797 =for apidoc sv_setnv_mg
1799 Like C<sv_setnv>, but also handles 'set' magic.
1805 Perl_sv_setnv_mg(pTHX_ register SV *sv, NV num)
1811 /* Print an "isn't numeric" warning, using a cleaned-up,
1812 * printable version of the offending string
1816 S_not_a_number(pTHX_ SV *sv)
1823 dsv = sv_2mortal(newSVpv("", 0));
1824 pv = sv_uni_display(dsv, sv, 10, 0);
1827 char *limit = tmpbuf + sizeof(tmpbuf) - 8;
1828 /* each *s can expand to 4 chars + "...\0",
1829 i.e. need room for 8 chars */
1832 for (s = SvPVX(sv), end = s + SvCUR(sv); s < end && d < limit; s++) {
1834 if (ch & 128 && !isPRINT_LC(ch)) {
1843 else if (ch == '\r') {
1847 else if (ch == '\f') {
1851 else if (ch == '\\') {
1855 else if (ch == '\0') {
1859 else if (isPRINT_LC(ch))
1876 Perl_warner(aTHX_ packWARN(WARN_NUMERIC),
1877 "Argument \"%s\" isn't numeric in %s", pv,
1880 Perl_warner(aTHX_ packWARN(WARN_NUMERIC),
1881 "Argument \"%s\" isn't numeric", pv);
1885 =for apidoc looks_like_number
1887 Test if the content of an SV looks like a number (or is a number).
1888 C<Inf> and C<Infinity> are treated as numbers (so will not issue a
1889 non-numeric warning), even if your atof() doesn't grok them.
1895 Perl_looks_like_number(pTHX_ SV *sv)
1897 register char *sbegin;
1904 else if (SvPOKp(sv))
1905 sbegin = SvPV(sv, len);
1907 return 1; /* Historic. Wrong? */
1908 return grok_number(sbegin, len, NULL);
1911 /* Actually, ISO C leaves conversion of UV to IV undefined, but
1912 until proven guilty, assume that things are not that bad... */
1917 As 64 bit platforms often have an NV that doesn't preserve all bits of
1918 an IV (an assumption perl has been based on to date) it becomes necessary
1919 to remove the assumption that the NV always carries enough precision to
1920 recreate the IV whenever needed, and that the NV is the canonical form.
1921 Instead, IV/UV and NV need to be given equal rights. So as to not lose
1922 precision as a side effect of conversion (which would lead to insanity
1923 and the dragon(s) in t/op/numconvert.t getting very angry) the intent is
1924 1) to distinguish between IV/UV/NV slots that have cached a valid
1925 conversion where precision was lost and IV/UV/NV slots that have a
1926 valid conversion which has lost no precision
1927 2) to ensure that if a numeric conversion to one form is requested that
1928 would lose precision, the precise conversion (or differently
1929 imprecise conversion) is also performed and cached, to prevent
1930 requests for different numeric formats on the same SV causing
1931 lossy conversion chains. (lossless conversion chains are perfectly
1936 SvIOKp is true if the IV slot contains a valid value
1937 SvIOK is true only if the IV value is accurate (UV if SvIOK_UV true)
1938 SvNOKp is true if the NV slot contains a valid value
1939 SvNOK is true only if the NV value is accurate
1942 while converting from PV to NV, check to see if converting that NV to an
1943 IV(or UV) would lose accuracy over a direct conversion from PV to
1944 IV(or UV). If it would, cache both conversions, return NV, but mark
1945 SV as IOK NOKp (ie not NOK).
1947 While converting from PV to IV, check to see if converting that IV to an
1948 NV would lose accuracy over a direct conversion from PV to NV. If it
1949 would, cache both conversions, flag similarly.
1951 Before, the SV value "3.2" could become NV=3.2 IV=3 NOK, IOK quite
1952 correctly because if IV & NV were set NV *always* overruled.
1953 Now, "3.2" will become NV=3.2 IV=3 NOK, IOKp, because the flag's meaning
1954 changes - now IV and NV together means that the two are interchangeable:
1955 SvIVX == (IV) SvNVX && SvNVX == (NV) SvIVX;
1957 The benefit of this is that operations such as pp_add know that if
1958 SvIOK is true for both left and right operands, then integer addition
1959 can be used instead of floating point (for cases where the result won't
1960 overflow). Before, floating point was always used, which could lead to
1961 loss of precision compared with integer addition.
1963 * making IV and NV equal status should make maths accurate on 64 bit
1965 * may speed up maths somewhat if pp_add and friends start to use
1966 integers when possible instead of fp. (Hopefully the overhead in
1967 looking for SvIOK and checking for overflow will not outweigh the
1968 fp to integer speedup)
1969 * will slow down integer operations (callers of SvIV) on "inaccurate"
1970 values, as the change from SvIOK to SvIOKp will cause a call into
1971 sv_2iv each time rather than a macro access direct to the IV slot
1972 * should speed up number->string conversion on integers as IV is
1973 favoured when IV and NV are equally accurate
1975 ####################################################################
1976 You had better be using SvIOK_notUV if you want an IV for arithmetic:
1977 SvIOK is true if (IV or UV), so you might be getting (IV)SvUV.
1978 On the other hand, SvUOK is true iff UV.
1979 ####################################################################
1981 Your mileage will vary depending your CPU's relative fp to integer
1985 #ifndef NV_PRESERVES_UV
1986 # define IS_NUMBER_UNDERFLOW_IV 1
1987 # define IS_NUMBER_UNDERFLOW_UV 2
1988 # define IS_NUMBER_IV_AND_UV 2
1989 # define IS_NUMBER_OVERFLOW_IV 4
1990 # define IS_NUMBER_OVERFLOW_UV 5
1992 /* sv_2iuv_non_preserve(): private routine for use by sv_2iv() and sv_2uv() */
1994 /* For sv_2nv these three cases are "SvNOK and don't bother casting" */
1996 S_sv_2iuv_non_preserve(pTHX_ register SV *sv, I32 numtype)
1998 DEBUG_c(PerlIO_printf(Perl_debug_log,"sv_2iuv_non '%s', IV=0x%"UVxf" NV=%"NVgf" inttype=%"UVXf"\n", SvPVX(sv), SvIVX(sv), SvNVX(sv), (UV)numtype));
1999 if (SvNVX(sv) < (NV)IV_MIN) {
2000 (void)SvIOKp_on(sv);
2003 return IS_NUMBER_UNDERFLOW_IV;
2005 if (SvNVX(sv) > (NV)UV_MAX) {
2006 (void)SvIOKp_on(sv);
2010 return IS_NUMBER_OVERFLOW_UV;
2012 (void)SvIOKp_on(sv);
2014 /* Can't use strtol etc to convert this string. (See truth table in
2016 if (SvNVX(sv) <= (UV)IV_MAX) {
2017 SvIVX(sv) = I_V(SvNVX(sv));
2018 if ((NV)(SvIVX(sv)) == SvNVX(sv)) {
2019 SvIOK_on(sv); /* Integer is precise. NOK, IOK */
2021 /* Integer is imprecise. NOK, IOKp */
2023 return SvNVX(sv) < 0 ? IS_NUMBER_UNDERFLOW_UV : IS_NUMBER_IV_AND_UV;
2026 SvUVX(sv) = U_V(SvNVX(sv));
2027 if ((NV)(SvUVX(sv)) == SvNVX(sv)) {
2028 if (SvUVX(sv) == UV_MAX) {
2029 /* As we know that NVs don't preserve UVs, UV_MAX cannot
2030 possibly be preserved by NV. Hence, it must be overflow.
2032 return IS_NUMBER_OVERFLOW_UV;
2034 SvIOK_on(sv); /* Integer is precise. NOK, UOK */
2036 /* Integer is imprecise. NOK, IOKp */
2038 return IS_NUMBER_OVERFLOW_IV;
2040 #endif /* !NV_PRESERVES_UV*/
2042 /* sv_2iv() is now a macro using Perl_sv_2iv_flags();
2043 * this function provided for binary compatibility only
2047 Perl_sv_2iv(pTHX_ register SV *sv)
2049 return sv_2iv_flags(sv, SV_GMAGIC);
2053 =for apidoc sv_2iv_flags
2055 Return the integer value of an SV, doing any necessary string
2056 conversion. If flags includes SV_GMAGIC, does an mg_get() first.
2057 Normally used via the C<SvIV(sv)> and C<SvIVx(sv)> macros.
2063 Perl_sv_2iv_flags(pTHX_ register SV *sv, I32 flags)
2067 if (SvGMAGICAL(sv)) {
2068 if (flags & SV_GMAGIC)
2073 return I_V(SvNVX(sv));
2075 if (SvPOKp(sv) && SvLEN(sv))
2078 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
2079 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
2085 if (SvTHINKFIRST(sv)) {
2088 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv,numer)) &&
2089 (!SvROK(tmpstr) || (SvRV(tmpstr) != SvRV(sv))))
2090 return SvIV(tmpstr);
2091 return PTR2IV(SvRV(sv));
2094 sv_force_normal_flags(sv, 0);
2096 if (SvREADONLY(sv) && !SvOK(sv)) {
2097 if (ckWARN(WARN_UNINITIALIZED))
2104 return (IV)(SvUVX(sv));
2111 /* erm. not sure. *should* never get NOKp (without NOK) from sv_2nv
2112 * without also getting a cached IV/UV from it at the same time
2113 * (ie PV->NV conversion should detect loss of accuracy and cache
2114 * IV or UV at same time to avoid this. NWC */
2116 if (SvTYPE(sv) == SVt_NV)
2117 sv_upgrade(sv, SVt_PVNV);
2119 (void)SvIOKp_on(sv); /* Must do this first, to clear any SvOOK */
2120 /* < not <= as for NV doesn't preserve UV, ((NV)IV_MAX+1) will almost
2121 certainly cast into the IV range at IV_MAX, whereas the correct
2122 answer is the UV IV_MAX +1. Hence < ensures that dodgy boundary
2124 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2125 SvIVX(sv) = I_V(SvNVX(sv));
2126 if (SvNVX(sv) == (NV) SvIVX(sv)
2127 #ifndef NV_PRESERVES_UV
2128 && (((UV)1 << NV_PRESERVES_UV_BITS) >
2129 (UV)(SvIVX(sv) > 0 ? SvIVX(sv) : -SvIVX(sv)))
2130 /* Don't flag it as "accurately an integer" if the number
2131 came from a (by definition imprecise) NV operation, and
2132 we're outside the range of NV integer precision */
2135 SvIOK_on(sv); /* Can this go wrong with rounding? NWC */
2136 DEBUG_c(PerlIO_printf(Perl_debug_log,
2137 "0x%"UVxf" iv(%"NVgf" => %"IVdf") (precise)\n",
2143 /* IV not precise. No need to convert from PV, as NV
2144 conversion would already have cached IV if it detected
2145 that PV->IV would be better than PV->NV->IV
2146 flags already correct - don't set public IOK. */
2147 DEBUG_c(PerlIO_printf(Perl_debug_log,
2148 "0x%"UVxf" iv(%"NVgf" => %"IVdf") (imprecise)\n",
2153 /* Can the above go wrong if SvIVX == IV_MIN and SvNVX < IV_MIN,
2154 but the cast (NV)IV_MIN rounds to a the value less (more
2155 negative) than IV_MIN which happens to be equal to SvNVX ??
2156 Analogous to 0xFFFFFFFFFFFFFFFF rounding up to NV (2**64) and
2157 NV rounding back to 0xFFFFFFFFFFFFFFFF, so UVX == UV(NVX) and
2158 (NV)UVX == NVX are both true, but the values differ. :-(
2159 Hopefully for 2s complement IV_MIN is something like
2160 0x8000000000000000 which will be exact. NWC */
2163 SvUVX(sv) = U_V(SvNVX(sv));
2165 (SvNVX(sv) == (NV) SvUVX(sv))
2166 #ifndef NV_PRESERVES_UV
2167 /* Make sure it's not 0xFFFFFFFFFFFFFFFF */
2168 /*&& (SvUVX(sv) != UV_MAX) irrelevant with code below */
2169 && (((UV)1 << NV_PRESERVES_UV_BITS) > SvUVX(sv))
2170 /* Don't flag it as "accurately an integer" if the number
2171 came from a (by definition imprecise) NV operation, and
2172 we're outside the range of NV integer precision */
2178 DEBUG_c(PerlIO_printf(Perl_debug_log,
2179 "0x%"UVxf" 2iv(%"UVuf" => %"IVdf") (as unsigned)\n",
2183 return (IV)SvUVX(sv);
2186 else if (SvPOKp(sv) && SvLEN(sv)) {
2188 int numtype = grok_number(SvPVX(sv), SvCUR(sv), &value);
2189 /* We want to avoid a possible problem when we cache an IV which
2190 may be later translated to an NV, and the resulting NV is not
2191 the same as the direct translation of the initial string
2192 (eg 123.456 can shortcut to the IV 123 with atol(), but we must
2193 be careful to ensure that the value with the .456 is around if the
2194 NV value is requested in the future).
2196 This means that if we cache such an IV, we need to cache the
2197 NV as well. Moreover, we trade speed for space, and do not
2198 cache the NV if we are sure it's not needed.
2201 /* SVt_PVNV is one higher than SVt_PVIV, hence this order */
2202 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2203 == IS_NUMBER_IN_UV) {
2204 /* It's definitely an integer, only upgrade to PVIV */
2205 if (SvTYPE(sv) < SVt_PVIV)
2206 sv_upgrade(sv, SVt_PVIV);
2208 } else if (SvTYPE(sv) < SVt_PVNV)
2209 sv_upgrade(sv, SVt_PVNV);
2211 /* If NV preserves UV then we only use the UV value if we know that
2212 we aren't going to call atof() below. If NVs don't preserve UVs
2213 then the value returned may have more precision than atof() will
2214 return, even though value isn't perfectly accurate. */
2215 if ((numtype & (IS_NUMBER_IN_UV
2216 #ifdef NV_PRESERVES_UV
2219 )) == IS_NUMBER_IN_UV) {
2220 /* This won't turn off the public IOK flag if it was set above */
2221 (void)SvIOKp_on(sv);
2223 if (!(numtype & IS_NUMBER_NEG)) {
2225 if (value <= (UV)IV_MAX) {
2226 SvIVX(sv) = (IV)value;
2232 /* 2s complement assumption */
2233 if (value <= (UV)IV_MIN) {
2234 SvIVX(sv) = -(IV)value;
2236 /* Too negative for an IV. This is a double upgrade, but
2237 I'm assuming it will be rare. */
2238 if (SvTYPE(sv) < SVt_PVNV)
2239 sv_upgrade(sv, SVt_PVNV);
2243 SvNVX(sv) = -(NV)value;
2248 /* For !NV_PRESERVES_UV and IS_NUMBER_IN_UV and IS_NUMBER_NOT_INT we
2249 will be in the previous block to set the IV slot, and the next
2250 block to set the NV slot. So no else here. */
2252 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2253 != IS_NUMBER_IN_UV) {
2254 /* It wasn't an (integer that doesn't overflow the UV). */
2255 SvNVX(sv) = Atof(SvPVX(sv));
2257 if (! numtype && ckWARN(WARN_NUMERIC))
2260 #if defined(USE_LONG_DOUBLE)
2261 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2iv(%" PERL_PRIgldbl ")\n",
2262 PTR2UV(sv), SvNVX(sv)));
2264 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2iv(%"NVgf")\n",
2265 PTR2UV(sv), SvNVX(sv)));
2269 #ifdef NV_PRESERVES_UV
2270 (void)SvIOKp_on(sv);
2272 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2273 SvIVX(sv) = I_V(SvNVX(sv));
2274 if ((NV)(SvIVX(sv)) == SvNVX(sv)) {
2277 /* Integer is imprecise. NOK, IOKp */
2279 /* UV will not work better than IV */
2281 if (SvNVX(sv) > (NV)UV_MAX) {
2283 /* Integer is inaccurate. NOK, IOKp, is UV */
2287 SvUVX(sv) = U_V(SvNVX(sv));
2288 /* 0xFFFFFFFFFFFFFFFF not an issue in here */
2289 if ((NV)(SvUVX(sv)) == SvNVX(sv)) {
2293 /* Integer is imprecise. NOK, IOKp, is UV */
2299 #else /* NV_PRESERVES_UV */
2300 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2301 == (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT)) {
2302 /* The IV slot will have been set from value returned by
2303 grok_number above. The NV slot has just been set using
2306 assert (SvIOKp(sv));
2308 if (((UV)1 << NV_PRESERVES_UV_BITS) >
2309 U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))) {
2310 /* Small enough to preserve all bits. */
2311 (void)SvIOKp_on(sv);
2313 SvIVX(sv) = I_V(SvNVX(sv));
2314 if ((NV)(SvIVX(sv)) == SvNVX(sv))
2316 /* Assumption: first non-preserved integer is < IV_MAX,
2317 this NV is in the preserved range, therefore: */
2318 if (!(U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))
2320 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);
2324 0 0 already failed to read UV.
2325 0 1 already failed to read UV.
2326 1 0 you won't get here in this case. IV/UV
2327 slot set, public IOK, Atof() unneeded.
2328 1 1 already read UV.
2329 so there's no point in sv_2iuv_non_preserve() attempting
2330 to use atol, strtol, strtoul etc. */
2331 if (sv_2iuv_non_preserve (sv, numtype)
2332 >= IS_NUMBER_OVERFLOW_IV)
2336 #endif /* NV_PRESERVES_UV */
2339 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing && !(SvFLAGS(sv) & SVs_PADTMP))
2341 if (SvTYPE(sv) < SVt_IV)
2342 /* Typically the caller expects that sv_any is not NULL now. */
2343 sv_upgrade(sv, SVt_IV);
2346 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2iv(%"IVdf")\n",
2347 PTR2UV(sv),SvIVX(sv)));
2348 return SvIsUV(sv) ? (IV)SvUVX(sv) : SvIVX(sv);
2351 /* sv_2uv() is now a macro using Perl_sv_2uv_flags();
2352 * this function provided for binary compatibility only
2356 Perl_sv_2uv(pTHX_ register SV *sv)
2358 return sv_2uv_flags(sv, SV_GMAGIC);
2362 =for apidoc sv_2uv_flags
2364 Return the unsigned integer value of an SV, doing any necessary string
2365 conversion. If flags includes SV_GMAGIC, does an mg_get() first.
2366 Normally used via the C<SvUV(sv)> and C<SvUVx(sv)> macros.
2372 Perl_sv_2uv_flags(pTHX_ register SV *sv, I32 flags)
2376 if (SvGMAGICAL(sv)) {
2377 if (flags & SV_GMAGIC)
2382 return U_V(SvNVX(sv));
2383 if (SvPOKp(sv) && SvLEN(sv))
2386 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
2387 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
2393 if (SvTHINKFIRST(sv)) {
2396 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv,numer)) &&
2397 (!SvROK(tmpstr) || (SvRV(tmpstr) != SvRV(sv))))
2398 return SvUV(tmpstr);
2399 return PTR2UV(SvRV(sv));
2402 sv_force_normal_flags(sv, 0);
2404 if (SvREADONLY(sv) && !SvOK(sv)) {
2405 if (ckWARN(WARN_UNINITIALIZED))
2415 return (UV)SvIVX(sv);
2419 /* erm. not sure. *should* never get NOKp (without NOK) from sv_2nv
2420 * without also getting a cached IV/UV from it at the same time
2421 * (ie PV->NV conversion should detect loss of accuracy and cache
2422 * IV or UV at same time to avoid this. */
2423 /* IV-over-UV optimisation - choose to cache IV if possible */
2425 if (SvTYPE(sv) == SVt_NV)
2426 sv_upgrade(sv, SVt_PVNV);
2428 (void)SvIOKp_on(sv); /* Must do this first, to clear any SvOOK */
2429 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2430 SvIVX(sv) = I_V(SvNVX(sv));
2431 if (SvNVX(sv) == (NV) SvIVX(sv)
2432 #ifndef NV_PRESERVES_UV
2433 && (((UV)1 << NV_PRESERVES_UV_BITS) >
2434 (UV)(SvIVX(sv) > 0 ? SvIVX(sv) : -SvIVX(sv)))
2435 /* Don't flag it as "accurately an integer" if the number
2436 came from a (by definition imprecise) NV operation, and
2437 we're outside the range of NV integer precision */
2440 SvIOK_on(sv); /* Can this go wrong with rounding? NWC */
2441 DEBUG_c(PerlIO_printf(Perl_debug_log,
2442 "0x%"UVxf" uv(%"NVgf" => %"IVdf") (precise)\n",
2448 /* IV not precise. No need to convert from PV, as NV
2449 conversion would already have cached IV if it detected
2450 that PV->IV would be better than PV->NV->IV
2451 flags already correct - don't set public IOK. */
2452 DEBUG_c(PerlIO_printf(Perl_debug_log,
2453 "0x%"UVxf" uv(%"NVgf" => %"IVdf") (imprecise)\n",
2458 /* Can the above go wrong if SvIVX == IV_MIN and SvNVX < IV_MIN,
2459 but the cast (NV)IV_MIN rounds to a the value less (more
2460 negative) than IV_MIN which happens to be equal to SvNVX ??
2461 Analogous to 0xFFFFFFFFFFFFFFFF rounding up to NV (2**64) and
2462 NV rounding back to 0xFFFFFFFFFFFFFFFF, so UVX == UV(NVX) and
2463 (NV)UVX == NVX are both true, but the values differ. :-(
2464 Hopefully for 2s complement IV_MIN is something like
2465 0x8000000000000000 which will be exact. NWC */
2468 SvUVX(sv) = U_V(SvNVX(sv));
2470 (SvNVX(sv) == (NV) SvUVX(sv))
2471 #ifndef NV_PRESERVES_UV
2472 /* Make sure it's not 0xFFFFFFFFFFFFFFFF */
2473 /*&& (SvUVX(sv) != UV_MAX) irrelevant with code below */
2474 && (((UV)1 << NV_PRESERVES_UV_BITS) > SvUVX(sv))
2475 /* Don't flag it as "accurately an integer" if the number
2476 came from a (by definition imprecise) NV operation, and
2477 we're outside the range of NV integer precision */
2482 DEBUG_c(PerlIO_printf(Perl_debug_log,
2483 "0x%"UVxf" 2uv(%"UVuf" => %"IVdf") (as unsigned)\n",
2489 else if (SvPOKp(sv) && SvLEN(sv)) {
2491 int numtype = grok_number(SvPVX(sv), SvCUR(sv), &value);
2493 /* We want to avoid a possible problem when we cache a UV which
2494 may be later translated to an NV, and the resulting NV is not
2495 the translation of the initial data.
2497 This means that if we cache such a UV, we need to cache the
2498 NV as well. Moreover, we trade speed for space, and do not
2499 cache the NV if not needed.
2502 /* SVt_PVNV is one higher than SVt_PVIV, hence this order */
2503 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2504 == IS_NUMBER_IN_UV) {
2505 /* It's definitely an integer, only upgrade to PVIV */
2506 if (SvTYPE(sv) < SVt_PVIV)
2507 sv_upgrade(sv, SVt_PVIV);
2509 } else if (SvTYPE(sv) < SVt_PVNV)
2510 sv_upgrade(sv, SVt_PVNV);
2512 /* If NV preserves UV then we only use the UV value if we know that
2513 we aren't going to call atof() below. If NVs don't preserve UVs
2514 then the value returned may have more precision than atof() will
2515 return, even though it isn't accurate. */
2516 if ((numtype & (IS_NUMBER_IN_UV
2517 #ifdef NV_PRESERVES_UV
2520 )) == IS_NUMBER_IN_UV) {
2521 /* This won't turn off the public IOK flag if it was set above */
2522 (void)SvIOKp_on(sv);
2524 if (!(numtype & IS_NUMBER_NEG)) {
2526 if (value <= (UV)IV_MAX) {
2527 SvIVX(sv) = (IV)value;
2529 /* it didn't overflow, and it was positive. */
2534 /* 2s complement assumption */
2535 if (value <= (UV)IV_MIN) {
2536 SvIVX(sv) = -(IV)value;
2538 /* Too negative for an IV. This is a double upgrade, but
2539 I'm assuming it will be rare. */
2540 if (SvTYPE(sv) < SVt_PVNV)
2541 sv_upgrade(sv, SVt_PVNV);
2545 SvNVX(sv) = -(NV)value;
2551 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2552 != IS_NUMBER_IN_UV) {
2553 /* It wasn't an integer, or it overflowed the UV. */
2554 SvNVX(sv) = Atof(SvPVX(sv));
2556 if (! numtype && ckWARN(WARN_NUMERIC))
2559 #if defined(USE_LONG_DOUBLE)
2560 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2uv(%" PERL_PRIgldbl ")\n",
2561 PTR2UV(sv), SvNVX(sv)));
2563 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2uv(%"NVgf")\n",
2564 PTR2UV(sv), SvNVX(sv)));
2567 #ifdef NV_PRESERVES_UV
2568 (void)SvIOKp_on(sv);
2570 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2571 SvIVX(sv) = I_V(SvNVX(sv));
2572 if ((NV)(SvIVX(sv)) == SvNVX(sv)) {
2575 /* Integer is imprecise. NOK, IOKp */
2577 /* UV will not work better than IV */
2579 if (SvNVX(sv) > (NV)UV_MAX) {
2581 /* Integer is inaccurate. NOK, IOKp, is UV */
2585 SvUVX(sv) = U_V(SvNVX(sv));
2586 /* 0xFFFFFFFFFFFFFFFF not an issue in here, NVs
2587 NV preservse UV so can do correct comparison. */
2588 if ((NV)(SvUVX(sv)) == SvNVX(sv)) {
2592 /* Integer is imprecise. NOK, IOKp, is UV */
2597 #else /* NV_PRESERVES_UV */
2598 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2599 == (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT)) {
2600 /* The UV slot will have been set from value returned by
2601 grok_number above. The NV slot has just been set using
2604 assert (SvIOKp(sv));
2606 if (((UV)1 << NV_PRESERVES_UV_BITS) >
2607 U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))) {
2608 /* Small enough to preserve all bits. */
2609 (void)SvIOKp_on(sv);
2611 SvIVX(sv) = I_V(SvNVX(sv));
2612 if ((NV)(SvIVX(sv)) == SvNVX(sv))
2614 /* Assumption: first non-preserved integer is < IV_MAX,
2615 this NV is in the preserved range, therefore: */
2616 if (!(U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))
2618 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);
2621 sv_2iuv_non_preserve (sv, numtype);
2623 #endif /* NV_PRESERVES_UV */
2627 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
2628 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
2631 if (SvTYPE(sv) < SVt_IV)
2632 /* Typically the caller expects that sv_any is not NULL now. */
2633 sv_upgrade(sv, SVt_IV);
2637 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2uv(%"UVuf")\n",
2638 PTR2UV(sv),SvUVX(sv)));
2639 return SvIsUV(sv) ? SvUVX(sv) : (UV)SvIVX(sv);
2645 Return the num value of an SV, doing any necessary string or integer
2646 conversion, magic etc. Normally used via the C<SvNV(sv)> and C<SvNVx(sv)>
2653 Perl_sv_2nv(pTHX_ register SV *sv)
2657 if (SvGMAGICAL(sv)) {
2661 if (SvPOKp(sv) && SvLEN(sv)) {
2662 if (ckWARN(WARN_NUMERIC) && !SvIOKp(sv) &&
2663 !grok_number(SvPVX(sv), SvCUR(sv), NULL))
2665 return Atof(SvPVX(sv));
2669 return (NV)SvUVX(sv);
2671 return (NV)SvIVX(sv);
2674 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
2675 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
2681 if (SvTHINKFIRST(sv)) {
2684 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv,numer)) &&
2685 (!SvROK(tmpstr) || (SvRV(tmpstr) != SvRV(sv))))
2686 return SvNV(tmpstr);
2687 return PTR2NV(SvRV(sv));
2690 sv_force_normal_flags(sv, 0);
2692 if (SvREADONLY(sv) && !SvOK(sv)) {
2693 if (ckWARN(WARN_UNINITIALIZED))
2698 if (SvTYPE(sv) < SVt_NV) {
2699 if (SvTYPE(sv) == SVt_IV)
2700 sv_upgrade(sv, SVt_PVNV);
2702 sv_upgrade(sv, SVt_NV);
2703 #ifdef USE_LONG_DOUBLE
2705 STORE_NUMERIC_LOCAL_SET_STANDARD();
2706 PerlIO_printf(Perl_debug_log,
2707 "0x%"UVxf" num(%" PERL_PRIgldbl ")\n",
2708 PTR2UV(sv), SvNVX(sv));
2709 RESTORE_NUMERIC_LOCAL();
2713 STORE_NUMERIC_LOCAL_SET_STANDARD();
2714 PerlIO_printf(Perl_debug_log, "0x%"UVxf" num(%"NVgf")\n",
2715 PTR2UV(sv), SvNVX(sv));
2716 RESTORE_NUMERIC_LOCAL();
2720 else if (SvTYPE(sv) < SVt_PVNV)
2721 sv_upgrade(sv, SVt_PVNV);
2726 SvNVX(sv) = SvIsUV(sv) ? (NV)SvUVX(sv) : (NV)SvIVX(sv);
2727 #ifdef NV_PRESERVES_UV
2730 /* Only set the public NV OK flag if this NV preserves the IV */
2731 /* Check it's not 0xFFFFFFFFFFFFFFFF */
2732 if (SvIsUV(sv) ? ((SvUVX(sv) != UV_MAX)&&(SvUVX(sv) == U_V(SvNVX(sv))))
2733 : (SvIVX(sv) == I_V(SvNVX(sv))))
2739 else if (SvPOKp(sv) && SvLEN(sv)) {
2741 int numtype = grok_number(SvPVX(sv), SvCUR(sv), &value);
2742 if (ckWARN(WARN_NUMERIC) && !SvIOKp(sv) && !numtype)
2744 #ifdef NV_PRESERVES_UV
2745 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2746 == IS_NUMBER_IN_UV) {
2747 /* It's definitely an integer */
2748 SvNVX(sv) = (numtype & IS_NUMBER_NEG) ? -(NV)value : (NV)value;
2750 SvNVX(sv) = Atof(SvPVX(sv));
2753 SvNVX(sv) = Atof(SvPVX(sv));
2754 /* Only set the public NV OK flag if this NV preserves the value in
2755 the PV at least as well as an IV/UV would.
2756 Not sure how to do this 100% reliably. */
2757 /* if that shift count is out of range then Configure's test is
2758 wonky. We shouldn't be in here with NV_PRESERVES_UV_BITS ==
2760 if (((UV)1 << NV_PRESERVES_UV_BITS) >
2761 U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))) {
2762 SvNOK_on(sv); /* Definitely small enough to preserve all bits */
2763 } else if (!(numtype & IS_NUMBER_IN_UV)) {
2764 /* Can't use strtol etc to convert this string, so don't try.
2765 sv_2iv and sv_2uv will use the NV to convert, not the PV. */
2768 /* value has been set. It may not be precise. */
2769 if ((numtype & IS_NUMBER_NEG) && (value > (UV)IV_MIN)) {
2770 /* 2s complement assumption for (UV)IV_MIN */
2771 SvNOK_on(sv); /* Integer is too negative. */
2776 if (numtype & IS_NUMBER_NEG) {
2777 SvIVX(sv) = -(IV)value;
2778 } else if (value <= (UV)IV_MAX) {
2779 SvIVX(sv) = (IV)value;
2785 if (numtype & IS_NUMBER_NOT_INT) {
2786 /* I believe that even if the original PV had decimals,
2787 they are lost beyond the limit of the FP precision.
2788 However, neither is canonical, so both only get p
2789 flags. NWC, 2000/11/25 */
2790 /* Both already have p flags, so do nothing */
2793 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2794 if (SvIVX(sv) == I_V(nv)) {
2799 /* It had no "." so it must be integer. */
2802 /* between IV_MAX and NV(UV_MAX).
2803 Could be slightly > UV_MAX */
2805 if (numtype & IS_NUMBER_NOT_INT) {
2806 /* UV and NV both imprecise. */
2808 UV nv_as_uv = U_V(nv);
2810 if (value == nv_as_uv && SvUVX(sv) != UV_MAX) {
2821 #endif /* NV_PRESERVES_UV */
2824 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing && !(SvFLAGS(sv) & SVs_PADTMP))
2826 if (SvTYPE(sv) < SVt_NV)
2827 /* Typically the caller expects that sv_any is not NULL now. */
2828 /* XXX Ilya implies that this is a bug in callers that assume this
2829 and ideally should be fixed. */
2830 sv_upgrade(sv, SVt_NV);
2833 #if defined(USE_LONG_DOUBLE)
2835 STORE_NUMERIC_LOCAL_SET_STANDARD();
2836 PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2nv(%" PERL_PRIgldbl ")\n",
2837 PTR2UV(sv), SvNVX(sv));
2838 RESTORE_NUMERIC_LOCAL();
2842 STORE_NUMERIC_LOCAL_SET_STANDARD();
2843 PerlIO_printf(Perl_debug_log, "0x%"UVxf" 1nv(%"NVgf")\n",
2844 PTR2UV(sv), SvNVX(sv));
2845 RESTORE_NUMERIC_LOCAL();
2851 /* asIV(): extract an integer from the string value of an SV.
2852 * Caller must validate PVX */
2855 S_asIV(pTHX_ SV *sv)
2858 int numtype = grok_number(SvPVX(sv), SvCUR(sv), &value);
2860 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2861 == IS_NUMBER_IN_UV) {
2862 /* It's definitely an integer */
2863 if (numtype & IS_NUMBER_NEG) {
2864 if (value < (UV)IV_MIN)
2867 if (value < (UV)IV_MAX)
2872 if (ckWARN(WARN_NUMERIC))
2875 return I_V(Atof(SvPVX(sv)));
2878 /* asUV(): extract an unsigned integer from the string value of an SV
2879 * Caller must validate PVX */
2882 S_asUV(pTHX_ SV *sv)
2885 int numtype = grok_number(SvPVX(sv), SvCUR(sv), &value);
2887 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2888 == IS_NUMBER_IN_UV) {
2889 /* It's definitely an integer */
2890 if (!(numtype & IS_NUMBER_NEG))
2894 if (ckWARN(WARN_NUMERIC))
2897 return U_V(Atof(SvPVX(sv)));
2901 =for apidoc sv_2pv_nolen
2903 Like C<sv_2pv()>, but doesn't return the length too. You should usually
2904 use the macro wrapper C<SvPV_nolen(sv)> instead.
2909 Perl_sv_2pv_nolen(pTHX_ register SV *sv)
2912 return sv_2pv(sv, &n_a);
2915 /* uiv_2buf(): private routine for use by sv_2pv_flags(): print an IV or
2916 * UV as a string towards the end of buf, and return pointers to start and
2919 * We assume that buf is at least TYPE_CHARS(UV) long.
2923 uiv_2buf(char *buf, IV iv, UV uv, int is_uv, char **peob)
2925 char *ptr = buf + TYPE_CHARS(UV);
2939 *--ptr = '0' + (char)(uv % 10);
2947 /* sv_2pv() is now a macro using Perl_sv_2pv_flags();
2948 * this function provided for binary compatibility only
2952 Perl_sv_2pv(pTHX_ register SV *sv, STRLEN *lp)
2954 return sv_2pv_flags(sv, lp, SV_GMAGIC);
2958 =for apidoc sv_2pv_flags
2960 Returns a pointer to the string value of an SV, and sets *lp to its length.
2961 If flags includes SV_GMAGIC, does an mg_get() first. Coerces sv to a string
2963 Normally invoked via the C<SvPV_flags> macro. C<sv_2pv()> and C<sv_2pv_nomg>
2964 usually end up here too.
2970 Perl_sv_2pv_flags(pTHX_ register SV *sv, STRLEN *lp, I32 flags)
2975 char tbuf[64]; /* Must fit sprintf/Gconvert of longest IV/NV */
2976 char *tmpbuf = tbuf;
2982 if (SvGMAGICAL(sv)) {
2983 if (flags & SV_GMAGIC)
2991 (void)sprintf(tmpbuf,"%"UVuf, (UV)SvUVX(sv));
2993 (void)sprintf(tmpbuf,"%"IVdf, (IV)SvIVX(sv));
2998 Gconvert(SvNVX(sv), NV_DIG, 0, tmpbuf);
3003 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
3004 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
3011 if (SvTHINKFIRST(sv)) {
3014 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv,string)) &&
3015 (!SvROK(tmpstr) || (SvRV(tmpstr) != SvRV(sv)))) {
3016 char *pv = SvPV(tmpstr, *lp);
3030 switch (SvTYPE(sv)) {
3032 if ( ((SvFLAGS(sv) &
3033 (SVs_OBJECT|SVf_OK|SVs_GMG|SVs_SMG|SVs_RMG))
3034 == (SVs_OBJECT|SVs_SMG))
3035 && (mg = mg_find(sv, PERL_MAGIC_qr))) {
3036 regexp *re = (regexp *)mg->mg_obj;
3039 char *fptr = "msix";
3044 char need_newline = 0;
3045 U16 reganch = (U16)((re->reganch & PMf_COMPILETIME) >> 12);
3047 while((ch = *fptr++)) {
3049 reflags[left++] = ch;
3052 reflags[right--] = ch;
3057 reflags[left] = '-';
3061 mg->mg_len = re->prelen + 4 + left;
3063 * If /x was used, we have to worry about a regex
3064 * ending with a comment later being embedded
3065 * within another regex. If so, we don't want this
3066 * regex's "commentization" to leak out to the
3067 * right part of the enclosing regex, we must cap
3068 * it with a newline.
3070 * So, if /x was used, we scan backwards from the
3071 * end of the regex. If we find a '#' before we
3072 * find a newline, we need to add a newline
3073 * ourself. If we find a '\n' first (or if we
3074 * don't find '#' or '\n'), we don't need to add
3075 * anything. -jfriedl
3077 if (PMf_EXTENDED & re->reganch)
3079 char *endptr = re->precomp + re->prelen;
3080 while (endptr >= re->precomp)
3082 char c = *(endptr--);
3084 break; /* don't need another */
3086 /* we end while in a comment, so we
3088 mg->mg_len++; /* save space for it */
3089 need_newline = 1; /* note to add it */
3095 New(616, mg->mg_ptr, mg->mg_len + 1 + left, char);
3096 Copy("(?", mg->mg_ptr, 2, char);
3097 Copy(reflags, mg->mg_ptr+2, left, char);
3098 Copy(":", mg->mg_ptr+left+2, 1, char);
3099 Copy(re->precomp, mg->mg_ptr+3+left, re->prelen, char);
3101 mg->mg_ptr[mg->mg_len - 2] = '\n';
3102 mg->mg_ptr[mg->mg_len - 1] = ')';
3103 mg->mg_ptr[mg->mg_len] = 0;
3105 PL_reginterp_cnt += re->program[0].next_off;
3107 if (re->reganch & ROPT_UTF8)
3122 case SVt_PVBM: if (SvROK(sv))
3125 s = "SCALAR"; break;
3126 case SVt_PVLV: s = SvROK(sv) ? "REF"
3127 /* tied lvalues should appear to be
3128 * scalars for backwards compatitbility */
3129 : (LvTYPE(sv) == 't' || LvTYPE(sv) == 'T')
3130 ? "SCALAR" : "LVALUE"; break;
3131 case SVt_PVAV: s = "ARRAY"; break;
3132 case SVt_PVHV: s = "HASH"; break;
3133 case SVt_PVCV: s = "CODE"; break;
3134 case SVt_PVGV: s = "GLOB"; break;
3135 case SVt_PVFM: s = "FORMAT"; break;
3136 case SVt_PVIO: s = "IO"; break;
3137 default: s = "UNKNOWN"; break;
3141 if (HvNAME(SvSTASH(sv)))
3142 Perl_sv_setpvf(aTHX_ tsv, "%s=%s", HvNAME(SvSTASH(sv)), s);
3144 Perl_sv_setpvf(aTHX_ tsv, "__ANON__=%s", s);
3147 Perl_sv_catpvf(aTHX_ tsv, "(0x%"UVxf")", PTR2UV(sv));
3153 if (SvREADONLY(sv) && !SvOK(sv)) {
3154 if (ckWARN(WARN_UNINITIALIZED))
3160 if (SvIOK(sv) || ((SvIOKp(sv) && !SvNOKp(sv)))) {
3161 /* I'm assuming that if both IV and NV are equally valid then
3162 converting the IV is going to be more efficient */
3163 U32 isIOK = SvIOK(sv);
3164 U32 isUIOK = SvIsUV(sv);
3165 char buf[TYPE_CHARS(UV)];
3168 if (SvTYPE(sv) < SVt_PVIV)
3169 sv_upgrade(sv, SVt_PVIV);
3171 ptr = uiv_2buf(buf, 0, SvUVX(sv), 1, &ebuf);
3173 ptr = uiv_2buf(buf, SvIVX(sv), 0, 0, &ebuf);
3174 SvGROW(sv, (STRLEN)(ebuf - ptr + 1)); /* inlined from sv_setpvn */
3175 Move(ptr,SvPVX(sv),ebuf - ptr,char);
3176 SvCUR_set(sv, ebuf - ptr);
3186 else if (SvNOKp(sv)) {
3187 if (SvTYPE(sv) < SVt_PVNV)
3188 sv_upgrade(sv, SVt_PVNV);
3189 /* The +20 is pure guesswork. Configure test needed. --jhi */
3190 SvGROW(sv, NV_DIG + 20);
3192 olderrno = errno; /* some Xenix systems wipe out errno here */
3194 if (SvNVX(sv) == 0.0)
3195 (void)strcpy(s,"0");
3199 Gconvert(SvNVX(sv), NV_DIG, 0, s);
3202 #ifdef FIXNEGATIVEZERO
3203 if (*s == '-' && s[1] == '0' && !s[2])
3213 if (ckWARN(WARN_UNINITIALIZED)
3214 && !PL_localizing && !(SvFLAGS(sv) & SVs_PADTMP))
3217 if (SvTYPE(sv) < SVt_PV)
3218 /* Typically the caller expects that sv_any is not NULL now. */
3219 sv_upgrade(sv, SVt_PV);
3222 *lp = s - SvPVX(sv);
3225 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2pv(%s)\n",
3226 PTR2UV(sv),SvPVX(sv)));
3230 if (SvROK(sv)) { /* XXX Skip this when sv_pvn_force calls */
3231 /* Sneaky stuff here */
3235 tsv = newSVpv(tmpbuf, 0);
3251 len = strlen(tmpbuf);
3253 #ifdef FIXNEGATIVEZERO
3254 if (len == 2 && t[0] == '-' && t[1] == '0') {
3259 (void)SvUPGRADE(sv, SVt_PV);
3261 s = SvGROW(sv, len + 1);
3270 =for apidoc sv_copypv
3272 Copies a stringified representation of the source SV into the
3273 destination SV. Automatically performs any necessary mg_get and
3274 coercion of numeric values into strings. Guaranteed to preserve
3275 UTF-8 flag even from overloaded objects. Similar in nature to
3276 sv_2pv[_flags] but operates directly on an SV instead of just the
3277 string. Mostly uses sv_2pv_flags to do its work, except when that
3278 would lose the UTF-8'ness of the PV.
3284 Perl_sv_copypv(pTHX_ SV *dsv, register SV *ssv)
3289 sv_setpvn(dsv,s,len);
3297 =for apidoc sv_2pvbyte_nolen
3299 Return a pointer to the byte-encoded representation of the SV.
3300 May cause the SV to be downgraded from UTF-8 as a side-effect.
3302 Usually accessed via the C<SvPVbyte_nolen> macro.
3308 Perl_sv_2pvbyte_nolen(pTHX_ register SV *sv)
3311 return sv_2pvbyte(sv, &n_a);
3315 =for apidoc sv_2pvbyte
3317 Return a pointer to the byte-encoded representation of the SV, and set *lp
3318 to its length. May cause the SV to be downgraded from UTF-8 as a
3321 Usually accessed via the C<SvPVbyte> macro.
3327 Perl_sv_2pvbyte(pTHX_ register SV *sv, STRLEN *lp)
3329 sv_utf8_downgrade(sv,0);
3330 return SvPV(sv,*lp);
3334 =for apidoc sv_2pvutf8_nolen
3336 Return a pointer to the UTF-8-encoded representation of the SV.
3337 May cause the SV to be upgraded to UTF-8 as a side-effect.
3339 Usually accessed via the C<SvPVutf8_nolen> macro.
3345 Perl_sv_2pvutf8_nolen(pTHX_ register SV *sv)
3348 return sv_2pvutf8(sv, &n_a);
3352 =for apidoc sv_2pvutf8
3354 Return a pointer to the UTF-8-encoded representation of the SV, and set *lp
3355 to its length. May cause the SV to be upgraded to UTF-8 as a side-effect.
3357 Usually accessed via the C<SvPVutf8> macro.
3363 Perl_sv_2pvutf8(pTHX_ register SV *sv, STRLEN *lp)
3365 sv_utf8_upgrade(sv);
3366 return SvPV(sv,*lp);
3370 =for apidoc sv_2bool
3372 This function is only called on magical items, and is only used by
3373 sv_true() or its macro equivalent.
3379 Perl_sv_2bool(pTHX_ register SV *sv)
3388 if (SvAMAGIC(sv) && (tmpsv=AMG_CALLun(sv,bool_)) &&
3389 (!SvROK(tmpsv) || (SvRV(tmpsv) != SvRV(sv))))
3390 return (bool)SvTRUE(tmpsv);
3391 return SvRV(sv) != 0;
3394 register XPV* Xpvtmp;
3395 if ((Xpvtmp = (XPV*)SvANY(sv)) &&
3396 (*Xpvtmp->xpv_pv > '0' ||
3397 Xpvtmp->xpv_cur > 1 ||
3398 (Xpvtmp->xpv_cur && *Xpvtmp->xpv_pv != '0')))
3405 return SvIVX(sv) != 0;
3408 return SvNVX(sv) != 0.0;
3415 /* sv_utf8_upgrade() is now a macro using sv_utf8_upgrade_flags();
3416 * this function provided for binary compatibility only
3421 Perl_sv_utf8_upgrade(pTHX_ register SV *sv)
3423 return sv_utf8_upgrade_flags(sv, SV_GMAGIC);
3427 =for apidoc sv_utf8_upgrade
3429 Convert the PV of an SV to its UTF-8-encoded form.
3430 Forces the SV to string form if it is not already.
3431 Always sets the SvUTF8 flag to avoid future validity checks even
3432 if all the bytes have hibit clear.
3434 This is not as a general purpose byte encoding to Unicode interface:
3435 use the Encode extension for that.
3437 =for apidoc sv_utf8_upgrade_flags
3439 Convert the PV of an SV to its UTF-8-encoded form.
3440 Forces the SV to string form if it is not already.
3441 Always sets the SvUTF8 flag to avoid future validity checks even
3442 if all the bytes have hibit clear. If C<flags> has C<SV_GMAGIC> bit set,
3443 will C<mg_get> on C<sv> if appropriate, else not. C<sv_utf8_upgrade> and
3444 C<sv_utf8_upgrade_nomg> are implemented in terms of this function.
3446 This is not as a general purpose byte encoding to Unicode interface:
3447 use the Encode extension for that.
3453 Perl_sv_utf8_upgrade_flags(pTHX_ register SV *sv, I32 flags)
3463 (void) sv_2pv_flags(sv,&len, flags);
3472 sv_force_normal_flags(sv, 0);
3475 if (PL_encoding && !(flags & SV_UTF8_NO_ENCODING))
3476 sv_recode_to_utf8(sv, PL_encoding);
3477 else { /* Assume Latin-1/EBCDIC */
3478 /* This function could be much more efficient if we
3479 * had a FLAG in SVs to signal if there are any hibit
3480 * chars in the PV. Given that there isn't such a flag
3481 * make the loop as fast as possible. */
3482 s = (U8 *) SvPVX(sv);
3483 e = (U8 *) SvEND(sv);
3487 if ((hibit = !NATIVE_IS_INVARIANT(ch)))
3493 len = SvCUR(sv) + 1; /* Plus the \0 */
3494 SvPVX(sv) = (char*)bytes_to_utf8((U8*)s, &len);
3495 SvCUR(sv) = len - 1;
3497 Safefree(s); /* No longer using what was there before. */
3498 SvLEN(sv) = len; /* No longer know the real size. */
3500 /* Mark as UTF-8 even if no hibit - saves scanning loop */
3507 =for apidoc sv_utf8_downgrade
3509 Attempt to convert the PV of an SV from UTF-8-encoded to byte encoding.
3510 This may not be possible if the PV contains non-byte encoding characters;
3511 if this is the case, either returns false or, if C<fail_ok> is not
3514 This is not as a general purpose Unicode to byte encoding interface:
3515 use the Encode extension for that.
3521 Perl_sv_utf8_downgrade(pTHX_ register SV* sv, bool fail_ok)
3523 if (SvPOK(sv) && SvUTF8(sv)) {
3529 sv_force_normal_flags(sv, 0);
3531 s = (U8 *) SvPV(sv, len);
3532 if (!utf8_to_bytes(s, &len)) {
3537 Perl_croak(aTHX_ "Wide character in %s",
3540 Perl_croak(aTHX_ "Wide character");
3551 =for apidoc sv_utf8_encode
3553 Convert the PV of an SV to UTF-8-encoded, but then turn off the C<SvUTF8>
3554 flag so that it looks like octets again. Used as a building block
3555 for encode_utf8 in Encode.xs
3561 Perl_sv_utf8_encode(pTHX_ register SV *sv)
3563 (void) sv_utf8_upgrade(sv);
3568 =for apidoc sv_utf8_decode
3570 Convert the octets in the PV from UTF-8 to chars. Scan for validity and then
3571 turn off SvUTF8 if needed so that we see characters. Used as a building block
3572 for decode_utf8 in Encode.xs
3578 Perl_sv_utf8_decode(pTHX_ register SV *sv)
3584 /* The octets may have got themselves encoded - get them back as
3587 if (!sv_utf8_downgrade(sv, TRUE))
3590 /* it is actually just a matter of turning the utf8 flag on, but
3591 * we want to make sure everything inside is valid utf8 first.
3593 c = (U8 *) SvPVX(sv);
3594 if (!is_utf8_string(c, SvCUR(sv)+1))
3596 e = (U8 *) SvEND(sv);
3599 if (!UTF8_IS_INVARIANT(ch)) {
3608 /* sv_setsv() is now a macro using Perl_sv_setsv_flags();
3609 * this function provided for binary compatibility only
3613 Perl_sv_setsv(pTHX_ SV *dstr, register SV *sstr)
3615 sv_setsv_flags(dstr, sstr, SV_GMAGIC);
3619 =for apidoc sv_setsv
3621 Copies the contents of the source SV C<ssv> into the destination SV
3622 C<dsv>. The source SV may be destroyed if it is mortal, so don't use this
3623 function if the source SV needs to be reused. Does not handle 'set' magic.
3624 Loosely speaking, it performs a copy-by-value, obliterating any previous
3625 content of the destination.
3627 You probably want to use one of the assortment of wrappers, such as
3628 C<SvSetSV>, C<SvSetSV_nosteal>, C<SvSetMagicSV> and
3629 C<SvSetMagicSV_nosteal>.
3631 =for apidoc sv_setsv_flags
3633 Copies the contents of the source SV C<ssv> into the destination SV
3634 C<dsv>. The source SV may be destroyed if it is mortal, so don't use this
3635 function if the source SV needs to be reused. Does not handle 'set' magic.
3636 Loosely speaking, it performs a copy-by-value, obliterating any previous
3637 content of the destination.
3638 If the C<flags> parameter has the C<SV_GMAGIC> bit set, will C<mg_get> on
3639 C<ssv> if appropriate, else not. C<sv_setsv> and C<sv_setsv_nomg> are
3640 implemented in terms of this function.
3642 You probably want to use one of the assortment of wrappers, such as
3643 C<SvSetSV>, C<SvSetSV_nosteal>, C<SvSetMagicSV> and
3644 C<SvSetMagicSV_nosteal>.
3646 This is the primary function for copying scalars, and most other
3647 copy-ish functions and macros use this underneath.
3653 Perl_sv_setsv_flags(pTHX_ SV *dstr, register SV *sstr, I32 flags)
3655 register U32 sflags;
3661 SV_CHECK_THINKFIRST_COW_DROP(dstr);
3663 sstr = &PL_sv_undef;
3664 stype = SvTYPE(sstr);
3665 dtype = SvTYPE(dstr);
3670 /* need to nuke the magic */
3672 SvRMAGICAL_off(dstr);
3675 /* There's a lot of redundancy below but we're going for speed here */
3680 if (dtype != SVt_PVGV) {
3681 (void)SvOK_off(dstr);
3689 sv_upgrade(dstr, SVt_IV);
3692 sv_upgrade(dstr, SVt_PVNV);
3696 sv_upgrade(dstr, SVt_PVIV);
3699 (void)SvIOK_only(dstr);
3700 SvIVX(dstr) = SvIVX(sstr);
3703 if (SvTAINTED(sstr))
3714 sv_upgrade(dstr, SVt_NV);
3719 sv_upgrade(dstr, SVt_PVNV);
3722 SvNVX(dstr) = SvNVX(sstr);
3723 (void)SvNOK_only(dstr);
3724 if (SvTAINTED(sstr))
3732 sv_upgrade(dstr, SVt_RV);
3733 else if (dtype == SVt_PVGV &&
3734 SvROK(sstr) && SvTYPE(SvRV(sstr)) == SVt_PVGV) {
3737 if (GvIMPORTED(dstr) != GVf_IMPORTED
3738 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3740 GvIMPORTED_on(dstr);
3749 #ifdef PERL_COPY_ON_WRITE
3750 if ((SvFLAGS(sstr) & CAN_COW_MASK) == CAN_COW_FLAGS) {
3751 if (dtype < SVt_PVIV)
3752 sv_upgrade(dstr, SVt_PVIV);
3759 sv_upgrade(dstr, SVt_PV);
3762 if (dtype < SVt_PVIV)
3763 sv_upgrade(dstr, SVt_PVIV);
3766 if (dtype < SVt_PVNV)
3767 sv_upgrade(dstr, SVt_PVNV);
3774 Perl_croak(aTHX_ "Bizarre copy of %s in %s", sv_reftype(sstr, 0),
3777 Perl_croak(aTHX_ "Bizarre copy of %s", sv_reftype(sstr, 0));
3781 if (dtype <= SVt_PVGV) {
3783 if (dtype != SVt_PVGV) {
3784 char *name = GvNAME(sstr);
3785 STRLEN len = GvNAMELEN(sstr);
3786 sv_upgrade(dstr, SVt_PVGV);
3787 sv_magic(dstr, dstr, PERL_MAGIC_glob, Nullch, 0);
3788 GvSTASH(dstr) = (HV*)SvREFCNT_inc(GvSTASH(sstr));
3789 GvNAME(dstr) = savepvn(name, len);
3790 GvNAMELEN(dstr) = len;
3791 SvFAKE_on(dstr); /* can coerce to non-glob */
3793 /* ahem, death to those who redefine active sort subs */
3794 else if (PL_curstackinfo->si_type == PERLSI_SORT
3795 && GvCV(dstr) && PL_sortcop == CvSTART(GvCV(dstr)))
3796 Perl_croak(aTHX_ "Can't redefine active sort subroutine %s",
3799 #ifdef GV_UNIQUE_CHECK
3800 if (GvUNIQUE((GV*)dstr)) {
3801 Perl_croak(aTHX_ PL_no_modify);
3805 (void)SvOK_off(dstr);
3806 GvINTRO_off(dstr); /* one-shot flag */
3808 GvGP(dstr) = gp_ref(GvGP(sstr));
3809 if (SvTAINTED(sstr))
3811 if (GvIMPORTED(dstr) != GVf_IMPORTED
3812 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3814 GvIMPORTED_on(dstr);
3822 if (SvGMAGICAL(sstr) && (flags & SV_GMAGIC)) {
3824 if ((int)SvTYPE(sstr) != stype) {
3825 stype = SvTYPE(sstr);
3826 if (stype == SVt_PVGV && dtype <= SVt_PVGV)
3830 if (stype == SVt_PVLV)
3831 (void)SvUPGRADE(dstr, SVt_PVNV);
3833 (void)SvUPGRADE(dstr, (U32)stype);
3836 sflags = SvFLAGS(sstr);
3838 if (sflags & SVf_ROK) {
3839 if (dtype >= SVt_PV) {
3840 if (dtype == SVt_PVGV) {
3841 SV *sref = SvREFCNT_inc(SvRV(sstr));
3843 int intro = GvINTRO(dstr);
3845 #ifdef GV_UNIQUE_CHECK
3846 if (GvUNIQUE((GV*)dstr)) {
3847 Perl_croak(aTHX_ PL_no_modify);
3852 GvINTRO_off(dstr); /* one-shot flag */
3853 GvLINE(dstr) = CopLINE(PL_curcop);
3854 GvEGV(dstr) = (GV*)dstr;
3857 switch (SvTYPE(sref)) {
3860 SAVEGENERICSV(GvAV(dstr));
3862 dref = (SV*)GvAV(dstr);
3863 GvAV(dstr) = (AV*)sref;
3864 if (!GvIMPORTED_AV(dstr)
3865 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3867 GvIMPORTED_AV_on(dstr);
3872 SAVEGENERICSV(GvHV(dstr));
3874 dref = (SV*)GvHV(dstr);
3875 GvHV(dstr) = (HV*)sref;
3876 if (!GvIMPORTED_HV(dstr)
3877 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3879 GvIMPORTED_HV_on(dstr);
3884 if (GvCVGEN(dstr) && GvCV(dstr) != (CV*)sref) {
3885 SvREFCNT_dec(GvCV(dstr));
3886 GvCV(dstr) = Nullcv;
3887 GvCVGEN(dstr) = 0; /* Switch off cacheness. */
3888 PL_sub_generation++;
3890 SAVEGENERICSV(GvCV(dstr));
3893 dref = (SV*)GvCV(dstr);
3894 if (GvCV(dstr) != (CV*)sref) {
3895 CV* cv = GvCV(dstr);
3897 if (!GvCVGEN((GV*)dstr) &&
3898 (CvROOT(cv) || CvXSUB(cv)))
3900 /* ahem, death to those who redefine
3901 * active sort subs */
3902 if (PL_curstackinfo->si_type == PERLSI_SORT &&
3903 PL_sortcop == CvSTART(cv))
3905 "Can't redefine active sort subroutine %s",
3906 GvENAME((GV*)dstr));
3907 /* Redefining a sub - warning is mandatory if
3908 it was a const and its value changed. */
3909 if (ckWARN(WARN_REDEFINE)
3911 && (!CvCONST((CV*)sref)
3912 || sv_cmp(cv_const_sv(cv),
3913 cv_const_sv((CV*)sref)))))
3915 Perl_warner(aTHX_ packWARN(WARN_REDEFINE),
3917 ? "Constant subroutine %s::%s redefined"
3918 : "Subroutine %s::%s redefined",
3919 HvNAME(GvSTASH((GV*)dstr)),
3920 GvENAME((GV*)dstr));
3924 cv_ckproto(cv, (GV*)dstr,
3925 SvPOK(sref) ? SvPVX(sref) : Nullch);
3927 GvCV(dstr) = (CV*)sref;
3928 GvCVGEN(dstr) = 0; /* Switch off cacheness. */
3929 GvASSUMECV_on(dstr);
3930 PL_sub_generation++;
3932 if (!GvIMPORTED_CV(dstr)
3933 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3935 GvIMPORTED_CV_on(dstr);
3940 SAVEGENERICSV(GvIOp(dstr));
3942 dref = (SV*)GvIOp(dstr);
3943 GvIOp(dstr) = (IO*)sref;
3947 SAVEGENERICSV(GvFORM(dstr));
3949 dref = (SV*)GvFORM(dstr);
3950 GvFORM(dstr) = (CV*)sref;
3954 SAVEGENERICSV(GvSV(dstr));
3956 dref = (SV*)GvSV(dstr);
3958 if (!GvIMPORTED_SV(dstr)
3959 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3961 GvIMPORTED_SV_on(dstr);
3967 if (SvTAINTED(sstr))
3972 (void)SvOOK_off(dstr); /* backoff */
3974 Safefree(SvPVX(dstr));
3975 SvLEN(dstr)=SvCUR(dstr)=0;
3978 (void)SvOK_off(dstr);
3979 SvRV(dstr) = SvREFCNT_inc(SvRV(sstr));
3981 if (sflags & SVp_NOK) {
3983 /* Only set the public OK flag if the source has public OK. */
3984 if (sflags & SVf_NOK)
3985 SvFLAGS(dstr) |= SVf_NOK;
3986 SvNVX(dstr) = SvNVX(sstr);
3988 if (sflags & SVp_IOK) {
3989 (void)SvIOKp_on(dstr);
3990 if (sflags & SVf_IOK)
3991 SvFLAGS(dstr) |= SVf_IOK;
3992 if (sflags & SVf_IVisUV)
3994 SvIVX(dstr) = SvIVX(sstr);
3996 if (SvAMAGIC(sstr)) {
4000 else if (sflags & SVp_POK) {
4004 * Check to see if we can just swipe the string. If so, it's a
4005 * possible small lose on short strings, but a big win on long ones.
4006 * It might even be a win on short strings if SvPVX(dstr)
4007 * has to be allocated and SvPVX(sstr) has to be freed.
4010 /* Whichever path we take through the next code, we want this true,
4011 and doing it now facilitates the COW check. */
4012 (void)SvPOK_only(dstr);
4015 #ifdef PERL_COPY_ON_WRITE
4016 (sflags & (SVf_FAKE | SVf_READONLY)) != (SVf_FAKE | SVf_READONLY)
4020 (sflags & SVs_TEMP) && /* slated for free anyway? */
4021 !(sflags & SVf_OOK) && /* and not involved in OOK hack? */
4022 SvREFCNT(sstr) == 1 && /* and no other references to it? */
4023 SvLEN(sstr) && /* and really is a string */
4024 /* and won't be needed again, potentially */
4025 !(PL_op && PL_op->op_type == OP_AASSIGN))
4026 #ifdef PERL_COPY_ON_WRITE
4027 && !((sflags & CAN_COW_MASK) == CAN_COW_FLAGS
4028 && (SvFLAGS(dstr) & CAN_COW_MASK) == CAN_COW_FLAGS
4029 && SvTYPE(sstr) >= SVt_PVIV)
4032 /* Failed the swipe test, and it's not a shared hash key either.
4033 Have to copy the string. */
4034 STRLEN len = SvCUR(sstr);
4035 SvGROW(dstr, len + 1); /* inlined from sv_setpvn */
4036 Move(SvPVX(sstr),SvPVX(dstr),len,char);
4037 SvCUR_set(dstr, len);
4038 *SvEND(dstr) = '\0';
4040 /* If PERL_COPY_ON_WRITE is not defined, then isSwipe will always
4042 #ifdef PERL_COPY_ON_WRITE
4043 /* Either it's a shared hash key, or it's suitable for
4044 copy-on-write or we can swipe the string. */
4046 PerlIO_printf(Perl_debug_log, "Copy on write: sstr --> dstr\n");
4051 /* I believe I should acquire a global SV mutex if
4052 it's a COW sv (not a shared hash key) to stop
4053 it going un copy-on-write.
4054 If the source SV has gone un copy on write between up there
4055 and down here, then (assert() that) it is of the correct
4056 form to make it copy on write again */
4057 if ((sflags & (SVf_FAKE | SVf_READONLY))
4058 != (SVf_FAKE | SVf_READONLY)) {
4059 SvREADONLY_on(sstr);
4061 /* Make the source SV into a loop of 1.
4062 (about to become 2) */
4063 SV_COW_NEXT_SV_SET(sstr, sstr);
4067 /* Initial code is common. */
4068 if (SvPVX(dstr)) { /* we know that dtype >= SVt_PV */
4070 SvFLAGS(dstr) &= ~SVf_OOK;
4071 Safefree(SvPVX(dstr) - SvIVX(dstr));
4073 else if (SvLEN(dstr))
4074 Safefree(SvPVX(dstr));
4077 #ifdef PERL_COPY_ON_WRITE
4079 /* making another shared SV. */
4080 STRLEN cur = SvCUR(sstr);
4081 STRLEN len = SvLEN(sstr);
4082 assert (SvTYPE(dstr) >= SVt_PVIV);
4084 /* SvIsCOW_normal */
4085 /* splice us in between source and next-after-source. */
4086 SV_COW_NEXT_SV_SET(dstr, SV_COW_NEXT_SV(sstr));
4087 SV_COW_NEXT_SV_SET(sstr, dstr);
4088 SvPV_set(dstr, SvPVX(sstr));
4090 /* SvIsCOW_shared_hash */
4091 UV hash = SvUVX(sstr);
4092 DEBUG_C(PerlIO_printf(Perl_debug_log,
4093 "Copy on write: Sharing hash\n"));
4095 sharepvn(SvPVX(sstr),
4096 (sflags & SVf_UTF8?-cur:cur), hash));
4101 SvREADONLY_on(dstr);
4103 /* Relesase a global SV mutex. */
4107 { /* Passes the swipe test. */
4108 SvPV_set(dstr, SvPVX(sstr));
4109 SvLEN_set(dstr, SvLEN(sstr));
4110 SvCUR_set(dstr, SvCUR(sstr));
4113 (void)SvOK_off(sstr); /* NOTE: nukes most SvFLAGS on sstr */
4114 SvPV_set(sstr, Nullch);
4120 if (sflags & SVf_UTF8)
4123 if (sflags & SVp_NOK) {
4125 if (sflags & SVf_NOK)
4126 SvFLAGS(dstr) |= SVf_NOK;
4127 SvNVX(dstr) = SvNVX(sstr);
4129 if (sflags & SVp_IOK) {
4130 (void)SvIOKp_on(dstr);
4131 if (sflags & SVf_IOK)
4132 SvFLAGS(dstr) |= SVf_IOK;
4133 if (sflags & SVf_IVisUV)
4135 SvIVX(dstr) = SvIVX(sstr);
4138 MAGIC *smg = mg_find(sstr,PERL_MAGIC_vstring);
4139 sv_magic(dstr, NULL, PERL_MAGIC_vstring,
4140 smg->mg_ptr, smg->mg_len);
4141 SvRMAGICAL_on(dstr);
4144 else if (sflags & SVp_IOK) {
4145 if (sflags & SVf_IOK)
4146 (void)SvIOK_only(dstr);
4148 (void)SvOK_off(dstr);
4149 (void)SvIOKp_on(dstr);
4151 /* XXXX Do we want to set IsUV for IV(ROK)? Be extra safe... */
4152 if (sflags & SVf_IVisUV)
4154 SvIVX(dstr) = SvIVX(sstr);
4155 if (sflags & SVp_NOK) {
4156 if (sflags & SVf_NOK)
4157 (void)SvNOK_on(dstr);
4159 (void)SvNOKp_on(dstr);
4160 SvNVX(dstr) = SvNVX(sstr);
4163 else if (sflags & SVp_NOK) {
4164 if (sflags & SVf_NOK)
4165 (void)SvNOK_only(dstr);
4167 (void)SvOK_off(dstr);
4170 SvNVX(dstr) = SvNVX(sstr);
4173 if (dtype == SVt_PVGV) {
4174 if (ckWARN(WARN_MISC))
4175 Perl_warner(aTHX_ packWARN(WARN_MISC), "Undefined value assigned to typeglob");
4178 (void)SvOK_off(dstr);
4180 if (SvTAINTED(sstr))
4185 =for apidoc sv_setsv_mg
4187 Like C<sv_setsv>, but also handles 'set' magic.
4193 Perl_sv_setsv_mg(pTHX_ SV *dstr, register SV *sstr)
4195 sv_setsv(dstr,sstr);
4199 #ifdef PERL_COPY_ON_WRITE
4201 Perl_sv_setsv_cow(pTHX_ SV *dstr, SV *sstr)
4203 STRLEN cur = SvCUR(sstr);
4204 STRLEN len = SvLEN(sstr);
4205 register char *new_pv;
4208 PerlIO_printf(Perl_debug_log, "Fast copy on write: %p -> %p\n",
4216 if (SvTHINKFIRST(dstr))
4217 sv_force_normal_flags(dstr, SV_COW_DROP_PV);
4218 else if (SvPVX(dstr))
4219 Safefree(SvPVX(dstr));
4223 SvUPGRADE (dstr, SVt_PVIV);
4225 assert (SvPOK(sstr));
4226 assert (SvPOKp(sstr));
4227 assert (!SvIOK(sstr));
4228 assert (!SvIOKp(sstr));
4229 assert (!SvNOK(sstr));
4230 assert (!SvNOKp(sstr));
4232 if (SvIsCOW(sstr)) {
4234 if (SvLEN(sstr) == 0) {
4235 /* source is a COW shared hash key. */
4236 UV hash = SvUVX(sstr);
4237 DEBUG_C(PerlIO_printf(Perl_debug_log,
4238 "Fast copy on write: Sharing hash\n"));
4240 new_pv = sharepvn(SvPVX(sstr), (SvUTF8(sstr)?-cur:cur), hash);
4243 SV_COW_NEXT_SV_SET(dstr, SV_COW_NEXT_SV(sstr));
4245 assert ((SvFLAGS(sstr) & CAN_COW_MASK) == CAN_COW_FLAGS);
4246 SvUPGRADE (sstr, SVt_PVIV);
4247 SvREADONLY_on(sstr);
4249 DEBUG_C(PerlIO_printf(Perl_debug_log,
4250 "Fast copy on write: Converting sstr to COW\n"));
4251 SV_COW_NEXT_SV_SET(dstr, sstr);
4253 SV_COW_NEXT_SV_SET(sstr, dstr);
4254 new_pv = SvPVX(sstr);
4257 SvPV_set(dstr, new_pv);
4258 SvFLAGS(dstr) = (SVt_PVIV|SVf_POK|SVp_POK|SVf_FAKE|SVf_READONLY);
4271 =for apidoc sv_setpvn
4273 Copies a string into an SV. The C<len> parameter indicates the number of
4274 bytes to be copied. Does not handle 'set' magic. See C<sv_setpvn_mg>.
4280 Perl_sv_setpvn(pTHX_ register SV *sv, register const char *ptr, register STRLEN len)
4282 register char *dptr;
4284 SV_CHECK_THINKFIRST_COW_DROP(sv);
4290 /* len is STRLEN which is unsigned, need to copy to signed */
4293 Perl_croak(aTHX_ "panic: sv_setpvn called with negative strlen");
4295 (void)SvUPGRADE(sv, SVt_PV);
4297 SvGROW(sv, len + 1);
4299 Move(ptr,dptr,len,char);
4302 (void)SvPOK_only_UTF8(sv); /* validate pointer */
4307 =for apidoc sv_setpvn_mg
4309 Like C<sv_setpvn>, but also handles 'set' magic.
4315 Perl_sv_setpvn_mg(pTHX_ register SV *sv, register const char *ptr, register STRLEN len)
4317 sv_setpvn(sv,ptr,len);
4322 =for apidoc sv_setpv
4324 Copies a string into an SV. The string must be null-terminated. Does not
4325 handle 'set' magic. See C<sv_setpv_mg>.
4331 Perl_sv_setpv(pTHX_ register SV *sv, register const char *ptr)
4333 register STRLEN len;
4335 SV_CHECK_THINKFIRST_COW_DROP(sv);
4341 (void)SvUPGRADE(sv, SVt_PV);
4343 SvGROW(sv, len + 1);
4344 Move(ptr,SvPVX(sv),len+1,char);
4346 (void)SvPOK_only_UTF8(sv); /* validate pointer */
4351 =for apidoc sv_setpv_mg
4353 Like C<sv_setpv>, but also handles 'set' magic.
4359 Perl_sv_setpv_mg(pTHX_ register SV *sv, register const char *ptr)
4366 =for apidoc sv_usepvn
4368 Tells an SV to use C<ptr> to find its string value. Normally the string is
4369 stored inside the SV but sv_usepvn allows the SV to use an outside string.
4370 The C<ptr> should point to memory that was allocated by C<malloc>. The
4371 string length, C<len>, must be supplied. This function will realloc the
4372 memory pointed to by C<ptr>, so that pointer should not be freed or used by
4373 the programmer after giving it to sv_usepvn. Does not handle 'set' magic.
4374 See C<sv_usepvn_mg>.
4380 Perl_sv_usepvn(pTHX_ register SV *sv, register char *ptr, register STRLEN len)
4382 SV_CHECK_THINKFIRST_COW_DROP(sv);
4383 (void)SvUPGRADE(sv, SVt_PV);
4388 (void)SvOOK_off(sv);
4389 if (SvPVX(sv) && SvLEN(sv))
4390 Safefree(SvPVX(sv));
4391 Renew(ptr, len+1, char);
4394 SvLEN_set(sv, len+1);
4396 (void)SvPOK_only_UTF8(sv); /* validate pointer */
4401 =for apidoc sv_usepvn_mg
4403 Like C<sv_usepvn>, but also handles 'set' magic.
4409 Perl_sv_usepvn_mg(pTHX_ register SV *sv, register char *ptr, register STRLEN len)
4411 sv_usepvn(sv,ptr,len);
4415 #ifdef PERL_COPY_ON_WRITE
4416 /* Need to do this *after* making the SV normal, as we need the buffer
4417 pointer to remain valid until after we've copied it. If we let go too early,
4418 another thread could invalidate it by unsharing last of the same hash key
4419 (which it can do by means other than releasing copy-on-write Svs)
4420 or by changing the other copy-on-write SVs in the loop. */
4422 S_sv_release_COW(pTHX_ register SV *sv, char *pvx, STRLEN cur, STRLEN len,
4423 U32 hash, SV *after)
4425 if (len) { /* this SV was SvIsCOW_normal(sv) */
4426 /* we need to find the SV pointing to us. */
4427 SV *current = SV_COW_NEXT_SV(after);
4429 if (current == sv) {
4430 /* The SV we point to points back to us (there were only two of us
4432 Hence other SV is no longer copy on write either. */
4434 SvREADONLY_off(after);
4436 /* We need to follow the pointers around the loop. */
4438 while ((next = SV_COW_NEXT_SV(current)) != sv) {
4441 /* don't loop forever if the structure is bust, and we have
4442 a pointer into a closed loop. */
4443 assert (current != after);
4444 assert (SvPVX(current) == pvx);
4446 /* Make the SV before us point to the SV after us. */
4447 SV_COW_NEXT_SV_SET(current, after);
4450 unsharepvn(pvx, SvUTF8(sv) ? -(I32)cur : cur, hash);
4455 Perl_sv_release_IVX(pTHX_ register SV *sv)
4458 sv_force_normal_flags(sv, 0);
4459 return SvOOK_off(sv);
4463 =for apidoc sv_force_normal_flags
4465 Undo various types of fakery on an SV: if the PV is a shared string, make
4466 a private copy; if we're a ref, stop refing; if we're a glob, downgrade to
4467 an xpvmg; if we're a copy-on-write scalar, this is the on-write time when
4468 we do the copy, and is also used locally. If C<SV_COW_DROP_PV> is set
4469 then a copy-on-write scalar drops its PV buffer (if any) and becomes
4470 SvPOK_off rather than making a copy. (Used where this scalar is about to be
4471 set to some other value.) In addition, the C<flags> parameter gets passed to
4472 C<sv_unref_flags()> when unrefing. C<sv_force_normal> calls this function
4473 with flags set to 0.
4479 Perl_sv_force_normal_flags(pTHX_ register SV *sv, U32 flags)
4481 #ifdef PERL_COPY_ON_WRITE
4482 if (SvREADONLY(sv)) {
4483 /* At this point I believe I should acquire a global SV mutex. */
4485 char *pvx = SvPVX(sv);
4486 STRLEN len = SvLEN(sv);
4487 STRLEN cur = SvCUR(sv);
4488 U32 hash = SvUVX(sv);
4489 SV *next = SV_COW_NEXT_SV(sv); /* next COW sv in the loop. */
4491 PerlIO_printf(Perl_debug_log,
4492 "Copy on write: Force normal %ld\n",
4498 /* This SV doesn't own the buffer, so need to New() a new one: */
4501 if (flags & SV_COW_DROP_PV) {
4502 /* OK, so we don't need to copy our buffer. */
4505 SvGROW(sv, cur + 1);
4506 Move(pvx,SvPVX(sv),cur,char);
4510 sv_release_COW(sv, pvx, cur, len, hash, next);
4515 else if (IN_PERL_RUNTIME)
4516 Perl_croak(aTHX_ PL_no_modify);
4517 /* At this point I believe that I can drop the global SV mutex. */
4520 if (SvREADONLY(sv)) {
4522 char *pvx = SvPVX(sv);
4523 int is_utf8 = SvUTF8(sv);
4524 STRLEN len = SvCUR(sv);
4525 U32 hash = SvUVX(sv);
4530 SvGROW(sv, len + 1);
4531 Move(pvx,SvPVX(sv),len,char);
4533 unsharepvn(pvx, is_utf8 ? -(I32)len : len, hash);
4535 else if (IN_PERL_RUNTIME)
4536 Perl_croak(aTHX_ PL_no_modify);
4540 sv_unref_flags(sv, flags);
4541 else if (SvFAKE(sv) && SvTYPE(sv) == SVt_PVGV)
4546 =for apidoc sv_force_normal
4548 Undo various types of fakery on an SV: if the PV is a shared string, make
4549 a private copy; if we're a ref, stop refing; if we're a glob, downgrade to
4550 an xpvmg. See also C<sv_force_normal_flags>.
4556 Perl_sv_force_normal(pTHX_ register SV *sv)
4558 sv_force_normal_flags(sv, 0);
4564 Efficient removal of characters from the beginning of the string buffer.
4565 SvPOK(sv) must be true and the C<ptr> must be a pointer to somewhere inside
4566 the string buffer. The C<ptr> becomes the first character of the adjusted
4567 string. Uses the "OOK hack".
4568 Beware: after this function returns, C<ptr> and SvPVX(sv) may no longer
4569 refer to the same chunk of data.
4575 Perl_sv_chop(pTHX_ register SV *sv, register char *ptr)
4577 register STRLEN delta;
4578 if (!ptr || !SvPOKp(sv))
4580 delta = ptr - SvPVX(sv);
4581 SV_CHECK_THINKFIRST(sv);
4582 if (SvTYPE(sv) < SVt_PVIV)
4583 sv_upgrade(sv,SVt_PVIV);
4586 if (!SvLEN(sv)) { /* make copy of shared string */
4587 char *pvx = SvPVX(sv);
4588 STRLEN len = SvCUR(sv);
4589 SvGROW(sv, len + 1);
4590 Move(pvx,SvPVX(sv),len,char);
4594 /* Same SvOOK_on but SvOOK_on does a SvIOK_off
4595 and we do that anyway inside the SvNIOK_off
4597 SvFLAGS(sv) |= SVf_OOK;
4606 /* sv_catpvn() is now a macro using Perl_sv_catpvn_flags();
4607 * this function provided for binary compatibility only
4611 Perl_sv_catpvn(pTHX_ SV *dsv, const char* sstr, STRLEN slen)
4613 sv_catpvn_flags(dsv, sstr, slen, SV_GMAGIC);
4617 =for apidoc sv_catpvn
4619 Concatenates the string onto the end of the string which is in the SV. The
4620 C<len> indicates number of bytes to copy. If the SV has the UTF-8
4621 status set, then the bytes appended should be valid UTF-8.
4622 Handles 'get' magic, but not 'set' magic. See C<sv_catpvn_mg>.
4624 =for apidoc sv_catpvn_flags
4626 Concatenates the string onto the end of the string which is in the SV. The
4627 C<len> indicates number of bytes to copy. If the SV has the UTF-8
4628 status set, then the bytes appended should be valid UTF-8.
4629 If C<flags> has C<SV_GMAGIC> bit set, will C<mg_get> on C<dsv> if
4630 appropriate, else not. C<sv_catpvn> and C<sv_catpvn_nomg> are implemented
4631 in terms of this function.
4637 Perl_sv_catpvn_flags(pTHX_ register SV *dsv, register const char *sstr, register STRLEN slen, I32 flags)
4642 dstr = SvPV_force_flags(dsv, dlen, flags);
4643 SvGROW(dsv, dlen + slen + 1);
4646 Move(sstr, SvPVX(dsv) + dlen, slen, char);
4649 (void)SvPOK_only_UTF8(dsv); /* validate pointer */
4654 =for apidoc sv_catpvn_mg
4656 Like C<sv_catpvn>, but also handles 'set' magic.
4662 Perl_sv_catpvn_mg(pTHX_ register SV *sv, register const char *ptr, register STRLEN len)
4664 sv_catpvn(sv,ptr,len);
4668 /* sv_catsv() is now a macro using Perl_sv_catsv_flags();
4669 * this function provided for binary compatibility only
4673 Perl_sv_catsv(pTHX_ SV *dstr, register SV *sstr)
4675 sv_catsv_flags(dstr, sstr, SV_GMAGIC);
4679 =for apidoc sv_catsv
4681 Concatenates the string from SV C<ssv> onto the end of the string in
4682 SV C<dsv>. Modifies C<dsv> but not C<ssv>. Handles 'get' magic, but
4683 not 'set' magic. See C<sv_catsv_mg>.
4685 =for apidoc sv_catsv_flags
4687 Concatenates the string from SV C<ssv> onto the end of the string in
4688 SV C<dsv>. Modifies C<dsv> but not C<ssv>. If C<flags> has C<SV_GMAGIC>
4689 bit set, will C<mg_get> on the SVs if appropriate, else not. C<sv_catsv>
4690 and C<sv_catsv_nomg> are implemented in terms of this function.
4695 Perl_sv_catsv_flags(pTHX_ SV *dsv, register SV *ssv, I32 flags)
4701 if ((spv = SvPV(ssv, slen))) {
4702 /* sutf8 and dutf8 were type bool, but under USE_ITHREADS,
4703 gcc version 2.95.2 20000220 (Debian GNU/Linux) for
4704 Linux xxx 2.2.17 on sparc64 with gcc -O2, we erroneously
4705 get dutf8 = 0x20000000, (i.e. SVf_UTF8) even though
4706 dsv->sv_flags doesn't have that bit set.
4707 Andy Dougherty 12 Oct 2001
4709 I32 sutf8 = DO_UTF8(ssv);
4712 if (SvGMAGICAL(dsv) && (flags & SV_GMAGIC))
4714 dutf8 = DO_UTF8(dsv);
4716 if (dutf8 != sutf8) {
4718 /* Not modifying source SV, so taking a temporary copy. */
4719 SV* csv = sv_2mortal(newSVpvn(spv, slen));
4721 sv_utf8_upgrade(csv);
4722 spv = SvPV(csv, slen);
4725 sv_utf8_upgrade_nomg(dsv);
4727 sv_catpvn_nomg(dsv, spv, slen);
4732 =for apidoc sv_catsv_mg
4734 Like C<sv_catsv>, but also handles 'set' magic.
4740 Perl_sv_catsv_mg(pTHX_ SV *dsv, register SV *ssv)
4747 =for apidoc sv_catpv
4749 Concatenates the string onto the end of the string which is in the SV.
4750 If the SV has the UTF-8 status set, then the bytes appended should be
4751 valid UTF-8. Handles 'get' magic, but not 'set' magic. See C<sv_catpv_mg>.
4756 Perl_sv_catpv(pTHX_ register SV *sv, register const char *ptr)
4758 register STRLEN len;
4764 junk = SvPV_force(sv, tlen);
4766 SvGROW(sv, tlen + len + 1);
4769 Move(ptr,SvPVX(sv)+tlen,len+1,char);
4771 (void)SvPOK_only_UTF8(sv); /* validate pointer */
4776 =for apidoc sv_catpv_mg
4778 Like C<sv_catpv>, but also handles 'set' magic.
4784 Perl_sv_catpv_mg(pTHX_ register SV *sv, register const char *ptr)
4793 Create a new null SV, or if len > 0, create a new empty SVt_PV type SV
4794 with an initial PV allocation of len+1. Normally accessed via the C<NEWSV>
4801 Perl_newSV(pTHX_ STRLEN len)
4807 sv_upgrade(sv, SVt_PV);
4808 SvGROW(sv, len + 1);
4813 =for apidoc sv_magicext
4815 Adds magic to an SV, upgrading it if necessary. Applies the
4816 supplied vtable and returns pointer to the magic added.
4818 Note that sv_magicext will allow things that sv_magic will not.
4819 In particular you can add magic to SvREADONLY SVs and and more than
4820 one instance of the same 'how'
4822 I C<namelen> is greater then zero then a savepvn() I<copy> of C<name> is stored,
4823 if C<namelen> is zero then C<name> is stored as-is and - as another special
4824 case - if C<(name && namelen == HEf_SVKEY)> then C<name> is assumed to contain
4825 an C<SV*> and has its REFCNT incremented
4827 (This is now used as a subroutine by sv_magic.)
4832 Perl_sv_magicext(pTHX_ SV* sv, SV* obj, int how, MGVTBL *vtable,
4833 const char* name, I32 namlen)
4837 if (SvTYPE(sv) < SVt_PVMG) {
4838 (void)SvUPGRADE(sv, SVt_PVMG);
4840 Newz(702,mg, 1, MAGIC);
4841 mg->mg_moremagic = SvMAGIC(sv);
4844 /* Some magic sontains a reference loop, where the sv and object refer to
4845 each other. To prevent a reference loop that would prevent such
4846 objects being freed, we look for such loops and if we find one we
4847 avoid incrementing the object refcount.
4849 Note we cannot do this to avoid self-tie loops as intervening RV must
4850 have its REFCNT incremented to keep it in existence.
4853 if (!obj || obj == sv ||
4854 how == PERL_MAGIC_arylen ||
4855 how == PERL_MAGIC_qr ||
4856 (SvTYPE(obj) == SVt_PVGV &&
4857 (GvSV(obj) == sv || GvHV(obj) == (HV*)sv || GvAV(obj) == (AV*)sv ||
4858 GvCV(obj) == (CV*)sv || GvIOp(obj) == (IO*)sv ||
4859 GvFORM(obj) == (CV*)sv)))
4864 mg->mg_obj = SvREFCNT_inc(obj);
4865 mg->mg_flags |= MGf_REFCOUNTED;
4868 /* Normal self-ties simply pass a null object, and instead of
4869 using mg_obj directly, use the SvTIED_obj macro to produce a
4870 new RV as needed. For glob "self-ties", we are tieing the PVIO
4871 with an RV obj pointing to the glob containing the PVIO. In
4872 this case, to avoid a reference loop, we need to weaken the
4876 if (how == PERL_MAGIC_tiedscalar && SvTYPE(sv) == SVt_PVIO &&
4877 obj && SvROK(obj) && GvIO(SvRV(obj)) == (IO*)sv)
4883 mg->mg_len = namlen;
4886 mg->mg_ptr = savepvn(name, namlen);
4887 else if (namlen == HEf_SVKEY)
4888 mg->mg_ptr = (char*)SvREFCNT_inc((SV*)name);
4890 mg->mg_ptr = (char *) name;
4892 mg->mg_virtual = vtable;
4896 SvFLAGS(sv) &= ~(SVf_IOK|SVf_NOK|SVf_POK);
4901 =for apidoc sv_magic
4903 Adds magic to an SV. First upgrades C<sv> to type C<SVt_PVMG> if necessary,
4904 then adds a new magic item of type C<how> to the head of the magic list.
4910 Perl_sv_magic(pTHX_ register SV *sv, SV *obj, int how, const char *name, I32 namlen)
4915 #ifdef PERL_COPY_ON_WRITE
4917 sv_force_normal_flags(sv, 0);
4919 if (SvREADONLY(sv)) {
4921 && how != PERL_MAGIC_regex_global
4922 && how != PERL_MAGIC_bm
4923 && how != PERL_MAGIC_fm
4924 && how != PERL_MAGIC_sv
4925 && how != PERL_MAGIC_backref
4928 Perl_croak(aTHX_ PL_no_modify);
4931 if (SvMAGICAL(sv) || (how == PERL_MAGIC_taint && SvTYPE(sv) >= SVt_PVMG)) {
4932 if (SvMAGIC(sv) && (mg = mg_find(sv, how))) {
4933 /* sv_magic() refuses to add a magic of the same 'how' as an
4936 if (how == PERL_MAGIC_taint)
4944 vtable = &PL_vtbl_sv;
4946 case PERL_MAGIC_overload:
4947 vtable = &PL_vtbl_amagic;
4949 case PERL_MAGIC_overload_elem:
4950 vtable = &PL_vtbl_amagicelem;
4952 case PERL_MAGIC_overload_table:
4953 vtable = &PL_vtbl_ovrld;
4956 vtable = &PL_vtbl_bm;
4958 case PERL_MAGIC_regdata:
4959 vtable = &PL_vtbl_regdata;
4961 case PERL_MAGIC_regdatum:
4962 vtable = &PL_vtbl_regdatum;
4964 case PERL_MAGIC_env:
4965 vtable = &PL_vtbl_env;
4968 vtable = &PL_vtbl_fm;
4970 case PERL_MAGIC_envelem:
4971 vtable = &PL_vtbl_envelem;
4973 case PERL_MAGIC_regex_global:
4974 vtable = &PL_vtbl_mglob;
4976 case PERL_MAGIC_isa:
4977 vtable = &PL_vtbl_isa;
4979 case PERL_MAGIC_isaelem:
4980 vtable = &PL_vtbl_isaelem;
4982 case PERL_MAGIC_nkeys:
4983 vtable = &PL_vtbl_nkeys;
4985 case PERL_MAGIC_dbfile:
4988 case PERL_MAGIC_dbline:
4989 vtable = &PL_vtbl_dbline;
4991 #ifdef USE_LOCALE_COLLATE
4992 case PERL_MAGIC_collxfrm:
4993 vtable = &PL_vtbl_collxfrm;
4995 #endif /* USE_LOCALE_COLLATE */
4996 case PERL_MAGIC_tied:
4997 vtable = &PL_vtbl_pack;
4999 case PERL_MAGIC_tiedelem:
5000 case PERL_MAGIC_tiedscalar:
5001 vtable = &PL_vtbl_packelem;
5004 vtable = &PL_vtbl_regexp;
5006 case PERL_MAGIC_sig:
5007 vtable = &PL_vtbl_sig;
5009 case PERL_MAGIC_sigelem:
5010 vtable = &PL_vtbl_sigelem;
5012 case PERL_MAGIC_taint:
5013 vtable = &PL_vtbl_taint;
5015 case PERL_MAGIC_uvar:
5016 vtable = &PL_vtbl_uvar;
5018 case PERL_MAGIC_vec:
5019 vtable = &PL_vtbl_vec;
5021 case PERL_MAGIC_vstring:
5024 case PERL_MAGIC_utf8:
5025 vtable = &PL_vtbl_utf8;
5027 case PERL_MAGIC_substr:
5028 vtable = &PL_vtbl_substr;
5030 case PERL_MAGIC_defelem:
5031 vtable = &PL_vtbl_defelem;
5033 case PERL_MAGIC_glob:
5034 vtable = &PL_vtbl_glob;
5036 case PERL_MAGIC_arylen:
5037 vtable = &PL_vtbl_arylen;
5039 case PERL_MAGIC_pos:
5040 vtable = &PL_vtbl_pos;
5042 case PERL_MAGIC_backref:
5043 vtable = &PL_vtbl_backref;
5045 case PERL_MAGIC_ext:
5046 /* Reserved for use by extensions not perl internals. */
5047 /* Useful for attaching extension internal data to perl vars. */
5048 /* Note that multiple extensions may clash if magical scalars */
5049 /* etc holding private data from one are passed to another. */
5052 Perl_croak(aTHX_ "Don't know how to handle magic of type \\%o", how);
5055 /* Rest of work is done else where */
5056 mg = sv_magicext(sv,obj,how,vtable,name,namlen);
5059 case PERL_MAGIC_taint:
5062 case PERL_MAGIC_ext:
5063 case PERL_MAGIC_dbfile:
5070 =for apidoc sv_unmagic
5072 Removes all magic of type C<type> from an SV.
5078 Perl_sv_unmagic(pTHX_ SV *sv, int type)
5082 if (SvTYPE(sv) < SVt_PVMG || !SvMAGIC(sv))
5085 for (mg = *mgp; mg; mg = *mgp) {
5086 if (mg->mg_type == type) {
5087 MGVTBL* vtbl = mg->mg_virtual;
5088 *mgp = mg->mg_moremagic;
5089 if (vtbl && vtbl->svt_free)
5090 CALL_FPTR(vtbl->svt_free)(aTHX_ sv, mg);
5091 if (mg->mg_ptr && mg->mg_type != PERL_MAGIC_regex_global) {
5093 Safefree(mg->mg_ptr);
5094 else if (mg->mg_len == HEf_SVKEY)
5095 SvREFCNT_dec((SV*)mg->mg_ptr);
5096 else if (mg->mg_type == PERL_MAGIC_utf8 && mg->mg_ptr)
5097 Safefree(mg->mg_ptr);
5099 if (mg->mg_flags & MGf_REFCOUNTED)
5100 SvREFCNT_dec(mg->mg_obj);
5104 mgp = &mg->mg_moremagic;
5108 SvFLAGS(sv) |= (SvFLAGS(sv) & (SVp_NOK|SVp_POK)) >> PRIVSHIFT;
5115 =for apidoc sv_rvweaken
5117 Weaken a reference: set the C<SvWEAKREF> flag on this RV; give the
5118 referred-to SV C<PERL_MAGIC_backref> magic if it hasn't already; and
5119 push a back-reference to this RV onto the array of backreferences
5120 associated with that magic.
5126 Perl_sv_rvweaken(pTHX_ SV *sv)
5129 if (!SvOK(sv)) /* let undefs pass */
5132 Perl_croak(aTHX_ "Can't weaken a nonreference");
5133 else if (SvWEAKREF(sv)) {
5134 if (ckWARN(WARN_MISC))
5135 Perl_warner(aTHX_ packWARN(WARN_MISC), "Reference is already weak");
5139 sv_add_backref(tsv, sv);
5145 /* Give tsv backref magic if it hasn't already got it, then push a
5146 * back-reference to sv onto the array associated with the backref magic.
5150 S_sv_add_backref(pTHX_ SV *tsv, SV *sv)
5154 if (SvMAGICAL(tsv) && (mg = mg_find(tsv, PERL_MAGIC_backref)))
5155 av = (AV*)mg->mg_obj;
5158 sv_magic(tsv, (SV*)av, PERL_MAGIC_backref, NULL, 0);
5159 /* av now has a refcnt of 2, which avoids it getting freed
5160 * before us during global cleanup. The extra ref is removed
5161 * by magic_killbackrefs() when tsv is being freed */
5163 if (AvFILLp(av) >= AvMAX(av)) {
5165 SV **svp = AvARRAY(av);
5166 for (i = AvFILLp(av); i >= 0; i--)
5168 svp[i] = sv; /* reuse the slot */
5171 av_extend(av, AvFILLp(av)+1);
5173 AvARRAY(av)[++AvFILLp(av)] = sv; /* av_push() */
5176 /* delete a back-reference to ourselves from the backref magic associated
5177 * with the SV we point to.
5181 S_sv_del_backref(pTHX_ SV *sv)
5188 if (!SvMAGICAL(tsv) || !(mg = mg_find(tsv, PERL_MAGIC_backref)))
5189 Perl_croak(aTHX_ "panic: del_backref");
5190 av = (AV *)mg->mg_obj;
5192 for (i = AvFILLp(av); i >= 0; i--)
5193 if (svp[i] == sv) svp[i] = Nullsv;
5197 =for apidoc sv_insert
5199 Inserts a string at the specified offset/length within the SV. Similar to
5200 the Perl substr() function.
5206 Perl_sv_insert(pTHX_ SV *bigstr, STRLEN offset, STRLEN len, char *little, STRLEN littlelen)
5210 register char *midend;
5211 register char *bigend;
5217 Perl_croak(aTHX_ "Can't modify non-existent substring");
5218 SvPV_force(bigstr, curlen);
5219 (void)SvPOK_only_UTF8(bigstr);
5220 if (offset + len > curlen) {
5221 SvGROW(bigstr, offset+len+1);
5222 Zero(SvPVX(bigstr)+curlen, offset+len-curlen, char);
5223 SvCUR_set(bigstr, offset+len);
5227 i = littlelen - len;
5228 if (i > 0) { /* string might grow */
5229 big = SvGROW(bigstr, SvCUR(bigstr) + i + 1);
5230 mid = big + offset + len;
5231 midend = bigend = big + SvCUR(bigstr);
5234 while (midend > mid) /* shove everything down */
5235 *--bigend = *--midend;
5236 Move(little,big+offset,littlelen,char);
5242 Move(little,SvPVX(bigstr)+offset,len,char);
5247 big = SvPVX(bigstr);
5250 bigend = big + SvCUR(bigstr);
5252 if (midend > bigend)
5253 Perl_croak(aTHX_ "panic: sv_insert");
5255 if (mid - big > bigend - midend) { /* faster to shorten from end */
5257 Move(little, mid, littlelen,char);
5260 i = bigend - midend;
5262 Move(midend, mid, i,char);
5266 SvCUR_set(bigstr, mid - big);
5269 else if ((i = mid - big)) { /* faster from front */
5270 midend -= littlelen;
5272 sv_chop(bigstr,midend-i);
5277 Move(little, mid, littlelen,char);
5279 else if (littlelen) {
5280 midend -= littlelen;
5281 sv_chop(bigstr,midend);
5282 Move(little,midend,littlelen,char);
5285 sv_chop(bigstr,midend);
5291 =for apidoc sv_replace
5293 Make the first argument a copy of the second, then delete the original.
5294 The target SV physically takes over ownership of the body of the source SV
5295 and inherits its flags; however, the target keeps any magic it owns,
5296 and any magic in the source is discarded.
5297 Note that this is a rather specialist SV copying operation; most of the
5298 time you'll want to use C<sv_setsv> or one of its many macro front-ends.
5304 Perl_sv_replace(pTHX_ register SV *sv, register SV *nsv)
5306 U32 refcnt = SvREFCNT(sv);
5307 SV_CHECK_THINKFIRST_COW_DROP(sv);
5308 if (SvREFCNT(nsv) != 1 && ckWARN_d(WARN_INTERNAL))
5309 Perl_warner(aTHX_ packWARN(WARN_INTERNAL), "Reference miscount in sv_replace()");
5310 if (SvMAGICAL(sv)) {
5314 sv_upgrade(nsv, SVt_PVMG);
5315 SvMAGIC(nsv) = SvMAGIC(sv);
5316 SvFLAGS(nsv) |= SvMAGICAL(sv);
5322 assert(!SvREFCNT(sv));
5323 StructCopy(nsv,sv,SV);
5324 #ifdef PERL_COPY_ON_WRITE
5325 if (SvIsCOW_normal(nsv)) {
5326 /* We need to follow the pointers around the loop to make the
5327 previous SV point to sv, rather than nsv. */
5330 while ((next = SV_COW_NEXT_SV(current)) != nsv) {
5333 assert(SvPVX(current) == SvPVX(nsv));
5335 /* Make the SV before us point to the SV after us. */
5337 PerlIO_printf(Perl_debug_log, "previous is\n");
5339 PerlIO_printf(Perl_debug_log,
5340 "move it from 0x%"UVxf" to 0x%"UVxf"\n",
5341 (UV) SV_COW_NEXT_SV(current), (UV) sv);
5343 SV_COW_NEXT_SV_SET(current, sv);
5346 SvREFCNT(sv) = refcnt;
5347 SvFLAGS(nsv) |= SVTYPEMASK; /* Mark as freed */
5353 =for apidoc sv_clear
5355 Clear an SV: call any destructors, free up any memory used by the body,
5356 and free the body itself. The SV's head is I<not> freed, although
5357 its type is set to all 1's so that it won't inadvertently be assumed
5358 to be live during global destruction etc.
5359 This function should only be called when REFCNT is zero. Most of the time
5360 you'll want to call C<sv_free()> (or its macro wrapper C<SvREFCNT_dec>)
5367 Perl_sv_clear(pTHX_ register SV *sv)
5371 assert(SvREFCNT(sv) == 0);
5374 if (PL_defstash) { /* Still have a symbol table? */
5381 stash = SvSTASH(sv);
5382 destructor = StashHANDLER(stash,DESTROY);
5384 SV* tmpref = newRV(sv);
5385 SvREADONLY_on(tmpref); /* DESTROY() could be naughty */
5387 PUSHSTACKi(PERLSI_DESTROY);
5392 call_sv((SV*)destructor, G_DISCARD|G_EVAL|G_KEEPERR|G_VOID);
5398 if(SvREFCNT(tmpref) < 2) {
5399 /* tmpref is not kept alive! */
5404 SvREFCNT_dec(tmpref);
5406 } while (SvOBJECT(sv) && SvSTASH(sv) != stash);
5410 if (PL_in_clean_objs)
5411 Perl_croak(aTHX_ "DESTROY created new reference to dead object '%s'",
5413 /* DESTROY gave object new lease on life */
5419 SvREFCNT_dec(SvSTASH(sv)); /* possibly of changed persuasion */
5420 SvOBJECT_off(sv); /* Curse the object. */
5421 if (SvTYPE(sv) != SVt_PVIO)
5422 --PL_sv_objcount; /* XXX Might want something more general */
5425 if (SvTYPE(sv) >= SVt_PVMG) {
5428 if (SvFLAGS(sv) & SVpad_TYPED)
5429 SvREFCNT_dec(SvSTASH(sv));
5432 switch (SvTYPE(sv)) {
5435 IoIFP(sv) != PerlIO_stdin() &&
5436 IoIFP(sv) != PerlIO_stdout() &&
5437 IoIFP(sv) != PerlIO_stderr())
5439 io_close((IO*)sv, FALSE);
5441 if (IoDIRP(sv) && !(IoFLAGS(sv) & IOf_FAKE_DIRP))
5442 PerlDir_close(IoDIRP(sv));
5443 IoDIRP(sv) = (DIR*)NULL;
5444 Safefree(IoTOP_NAME(sv));
5445 Safefree(IoFMT_NAME(sv));
5446 Safefree(IoBOTTOM_NAME(sv));
5461 if (LvTYPE(sv) == 'T') { /* for tie: return HE to pool */
5462 SvREFCNT_dec(HeKEY_sv((HE*)LvTARG(sv)));
5463 HeNEXT((HE*)LvTARG(sv)) = PL_hv_fetch_ent_mh;
5464 PL_hv_fetch_ent_mh = (HE*)LvTARG(sv);
5466 else if (LvTYPE(sv) != 't') /* unless tie: unrefcnted fake SV** */
5467 SvREFCNT_dec(LvTARG(sv));
5471 Safefree(GvNAME(sv));
5472 /* cannot decrease stash refcount yet, as we might recursively delete
5473 ourselves when the refcnt drops to zero. Delay SvREFCNT_dec
5474 of stash until current sv is completely gone.
5475 -- JohnPC, 27 Mar 1998 */
5476 stash = GvSTASH(sv);
5482 (void)SvOOK_off(sv);
5490 SvREFCNT_dec(SvRV(sv));
5492 #ifdef PERL_COPY_ON_WRITE
5493 else if (SvPVX(sv)) {
5495 /* I believe I need to grab the global SV mutex here and
5496 then recheck the COW status. */
5498 PerlIO_printf(Perl_debug_log, "Copy on write: clear\n");
5501 sv_release_COW(sv, SvPVX(sv), SvCUR(sv), SvLEN(sv),
5502 SvUVX(sv), SV_COW_NEXT_SV(sv));
5503 /* And drop it here. */
5505 } else if (SvLEN(sv)) {
5506 Safefree(SvPVX(sv));
5510 else if (SvPVX(sv) && SvLEN(sv))
5511 Safefree(SvPVX(sv));
5512 else if (SvPVX(sv) && SvREADONLY(sv) && SvFAKE(sv)) {
5513 unsharepvn(SvPVX(sv),
5514 SvUTF8(sv) ? -(I32)SvCUR(sv) : SvCUR(sv),
5528 switch (SvTYPE(sv)) {
5544 del_XPVIV(SvANY(sv));
5547 del_XPVNV(SvANY(sv));
5550 del_XPVMG(SvANY(sv));
5553 del_XPVLV(SvANY(sv));
5556 del_XPVAV(SvANY(sv));
5559 del_XPVHV(SvANY(sv));
5562 del_XPVCV(SvANY(sv));
5565 del_XPVGV(SvANY(sv));
5566 /* code duplication for increased performance. */
5567 SvFLAGS(sv) &= SVf_BREAK;
5568 SvFLAGS(sv) |= SVTYPEMASK;
5569 /* decrease refcount of the stash that owns this GV, if any */
5571 SvREFCNT_dec(stash);
5572 return; /* not break, SvFLAGS reset already happened */
5574 del_XPVBM(SvANY(sv));
5577 del_XPVFM(SvANY(sv));
5580 del_XPVIO(SvANY(sv));
5583 SvFLAGS(sv) &= SVf_BREAK;
5584 SvFLAGS(sv) |= SVTYPEMASK;
5588 =for apidoc sv_newref
5590 Increment an SV's reference count. Use the C<SvREFCNT_inc()> wrapper
5597 Perl_sv_newref(pTHX_ SV *sv)
5607 Decrement an SV's reference count, and if it drops to zero, call
5608 C<sv_clear> to invoke destructors and free up any memory used by
5609 the body; finally, deallocate the SV's head itself.
5610 Normally called via a wrapper macro C<SvREFCNT_dec>.
5616 Perl_sv_free(pTHX_ SV *sv)
5620 if (SvREFCNT(sv) == 0) {
5621 if (SvFLAGS(sv) & SVf_BREAK)
5622 /* this SV's refcnt has been artificially decremented to
5623 * trigger cleanup */
5625 if (PL_in_clean_all) /* All is fair */
5627 if (SvREADONLY(sv) && SvIMMORTAL(sv)) {
5628 /* make sure SvREFCNT(sv)==0 happens very seldom */
5629 SvREFCNT(sv) = (~(U32)0)/2;
5632 if (ckWARN_d(WARN_INTERNAL))
5633 Perl_warner(aTHX_ packWARN(WARN_INTERNAL),
5634 "Attempt to free unreferenced scalar: SV 0x%"UVxf,
5638 if (--(SvREFCNT(sv)) > 0)
5640 Perl_sv_free2(aTHX_ sv);
5644 Perl_sv_free2(pTHX_ SV *sv)
5648 if (ckWARN_d(WARN_DEBUGGING))
5649 Perl_warner(aTHX_ packWARN(WARN_DEBUGGING),
5650 "Attempt to free temp prematurely: SV 0x%"UVxf,
5655 if (SvREADONLY(sv) && SvIMMORTAL(sv)) {
5656 /* make sure SvREFCNT(sv)==0 happens very seldom */
5657 SvREFCNT(sv) = (~(U32)0)/2;
5668 Returns the length of the string in the SV. Handles magic and type
5669 coercion. See also C<SvCUR>, which gives raw access to the xpv_cur slot.
5675 Perl_sv_len(pTHX_ register SV *sv)
5683 len = mg_length(sv);
5685 (void)SvPV(sv, len);
5690 =for apidoc sv_len_utf8
5692 Returns the number of characters in the string in an SV, counting wide
5693 UTF-8 bytes as a single character. Handles magic and type coercion.
5699 * The length is cached in PERL_UTF8_magic, in the mg_len field. Also the
5700 * mg_ptr is used, by sv_pos_u2b(), see the comments of S_utf8_mg_pos_init().
5701 * (Note that the mg_len is not the length of the mg_ptr field.)
5706 Perl_sv_len_utf8(pTHX_ register SV *sv)
5712 return mg_length(sv);
5716 U8 *s = (U8*)SvPV(sv, len);
5717 MAGIC *mg = SvMAGICAL(sv) ? mg_find(sv, PERL_MAGIC_utf8) : 0;
5719 if (mg && mg->mg_len != -1 && (mg->mg_len > 0 || len == 0)) {
5721 #ifdef PERL_UTF8_CACHE_ASSERT
5722 assert(ulen == Perl_utf8_length(aTHX_ s, s + len));
5726 ulen = Perl_utf8_length(aTHX_ s, s + len);
5727 if (!mg && !SvREADONLY(sv)) {
5728 sv_magic(sv, 0, PERL_MAGIC_utf8, 0, 0);
5729 mg = mg_find(sv, PERL_MAGIC_utf8);
5739 /* S_utf8_mg_pos_init() is used to initialize the mg_ptr field of
5740 * a PERL_UTF8_magic. The mg_ptr is used to store the mapping
5741 * between UTF-8 and byte offsets. There are two (substr offset and substr
5742 * length, the i offset, PERL_MAGIC_UTF8_CACHESIZE) times two (UTF-8 offset
5743 * and byte offset) cache positions.
5745 * The mg_len field is used by sv_len_utf8(), see its comments.
5746 * Note that the mg_len is not the length of the mg_ptr field.
5750 S_utf8_mg_pos_init(pTHX_ SV *sv, MAGIC **mgp, STRLEN **cachep, I32 i, I32 *offsetp, U8 *s, U8 *start)
5754 if (SvMAGICAL(sv) && !SvREADONLY(sv)) {
5756 *mgp = sv_magicext(sv, 0, PERL_MAGIC_utf8, &PL_vtbl_utf8, 0, 0);
5760 *cachep = (STRLEN *) (*mgp)->mg_ptr;
5762 Newz(0, *cachep, PERL_MAGIC_UTF8_CACHESIZE * 2, STRLEN);
5763 (*mgp)->mg_ptr = (char *) *cachep;
5767 (*cachep)[i] = *offsetp;
5768 (*cachep)[i+1] = s - start;
5776 * S_utf8_mg_pos() is used to query and update mg_ptr field of
5777 * a PERL_UTF8_magic. The mg_ptr is used to store the mapping
5778 * between UTF-8 and byte offsets. See also the comments of
5779 * S_utf8_mg_pos_init().
5783 S_utf8_mg_pos(pTHX_ SV *sv, MAGIC **mgp, STRLEN **cachep, I32 i, I32 *offsetp, I32 uoff, U8 **sp, U8 *start, U8 *send)
5787 if (SvMAGICAL(sv) && !SvREADONLY(sv)) {
5789 *mgp = mg_find(sv, PERL_MAGIC_utf8);
5790 if (*mgp && (*mgp)->mg_ptr) {
5791 *cachep = (STRLEN *) (*mgp)->mg_ptr;
5792 ASSERT_UTF8_CACHE(*cachep);
5793 if ((*cachep)[i] == (STRLEN)uoff) /* An exact match. */
5795 else { /* We will skip to the right spot. */
5800 /* The assumption is that going backward is half
5801 * the speed of going forward (that's where the
5802 * 2 * backw in the below comes from). (The real
5803 * figure of course depends on the UTF-8 data.) */
5805 if ((*cachep)[i] > (STRLEN)uoff) {
5807 backw = (*cachep)[i] - (STRLEN)uoff;
5809 if (forw < 2 * backw)
5812 p = start + (*cachep)[i+1];
5814 /* Try this only for the substr offset (i == 0),
5815 * not for the substr length (i == 2). */
5816 else if (i == 0) { /* (*cachep)[i] < uoff */
5817 STRLEN ulen = sv_len_utf8(sv);
5819 if ((STRLEN)uoff < ulen) {
5820 forw = (STRLEN)uoff - (*cachep)[i];
5821 backw = ulen - (STRLEN)uoff;
5823 if (forw < 2 * backw)
5824 p = start + (*cachep)[i+1];
5829 /* If the string is not long enough for uoff,
5830 * we could extend it, but not at this low a level. */
5834 if (forw < 2 * backw) {
5841 while (UTF8_IS_CONTINUATION(*p))
5846 /* Update the cache. */
5847 (*cachep)[i] = (STRLEN)uoff;
5848 (*cachep)[i+1] = p - start;
5850 /* Drop the stale "length" cache */
5859 if (found) { /* Setup the return values. */
5860 *offsetp = (*cachep)[i+1];
5861 *sp = start + *offsetp;
5864 *offsetp = send - start;
5866 else if (*sp < start) {
5872 #ifdef PERL_UTF8_CACHE_ASSERT
5877 while (n-- && s < send)
5881 assert(*offsetp == s - start);
5882 assert((*cachep)[0] == (STRLEN)uoff);
5883 assert((*cachep)[1] == *offsetp);
5885 ASSERT_UTF8_CACHE(*cachep);
5894 =for apidoc sv_pos_u2b
5896 Converts the value pointed to by offsetp from a count of UTF-8 chars from
5897 the start of the string, to a count of the equivalent number of bytes; if
5898 lenp is non-zero, it does the same to lenp, but this time starting from
5899 the offset, rather than from the start of the string. Handles magic and
5906 * sv_pos_u2b() uses, like sv_pos_b2u(), the mg_ptr of the potential
5907 * PERL_UTF8_magic of the sv to store the mapping between UTF-8 and
5908 * byte offsets. See also the comments of S_utf8_mg_pos().
5913 Perl_sv_pos_u2b(pTHX_ register SV *sv, I32* offsetp, I32* lenp)
5924 start = s = (U8*)SvPV(sv, len);
5926 I32 uoffset = *offsetp;
5931 if (utf8_mg_pos(sv, &mg, &cache, 0, offsetp, *offsetp, &s, start, send))
5933 if (!found && uoffset > 0) {
5934 while (s < send && uoffset--)
5938 if (utf8_mg_pos_init(sv, &mg, &cache, 0, offsetp, s, start))
5940 *offsetp = s - start;
5945 if (utf8_mg_pos(sv, &mg, &cache, 2, lenp, *lenp + *offsetp, &s, start, send)) {
5949 if (!found && *lenp > 0) {
5952 while (s < send && ulen--)
5956 if (utf8_mg_pos_init(sv, &mg, &cache, 2, lenp, s, start))
5957 cache[2] += *offsetp;
5961 ASSERT_UTF8_CACHE(cache);
5973 =for apidoc sv_pos_b2u
5975 Converts the value pointed to by offsetp from a count of bytes from the
5976 start of the string, to a count of the equivalent number of UTF-8 chars.
5977 Handles magic and type coercion.
5983 * sv_pos_b2u() uses, like sv_pos_u2b(), the mg_ptr of the potential
5984 * PERL_UTF8_magic of the sv to store the mapping between UTF-8 and
5985 * byte offsets. See also the comments of S_utf8_mg_pos().
5990 Perl_sv_pos_b2u(pTHX_ register SV* sv, I32* offsetp)
5998 s = (U8*)SvPV(sv, len);
5999 if ((I32)len < *offsetp)
6000 Perl_croak(aTHX_ "panic: sv_pos_b2u: bad byte offset");
6002 U8* send = s + *offsetp;
6004 STRLEN *cache = NULL;
6008 if (SvMAGICAL(sv) && !SvREADONLY(sv)) {
6009 mg = mg_find(sv, PERL_MAGIC_utf8);
6010 if (mg && mg->mg_ptr) {
6011 cache = (STRLEN *) mg->mg_ptr;
6012 if (cache[1] == (STRLEN)*offsetp) {
6013 /* An exact match. */
6014 *offsetp = cache[0];
6018 else if (cache[1] < (STRLEN)*offsetp) {
6019 /* We already know part of the way. */
6022 /* Let the below loop do the rest. */
6024 else { /* cache[1] > *offsetp */
6025 /* We already know all of the way, now we may
6026 * be able to walk back. The same assumption
6027 * is made as in S_utf8_mg_pos(), namely that
6028 * walking backward is twice slower than
6029 * walking forward. */
6030 STRLEN forw = *offsetp;
6031 STRLEN backw = cache[1] - *offsetp;
6033 if (!(forw < 2 * backw)) {
6034 U8 *p = s + cache[1];
6041 while (UTF8_IS_CONTINUATION(*p)) {
6049 *offsetp = cache[0];
6054 ASSERT_UTF8_CACHE(cache);
6060 /* Call utf8n_to_uvchr() to validate the sequence
6061 * (unless a simple non-UTF character) */
6062 if (!UTF8_IS_INVARIANT(*s))
6063 utf8n_to_uvchr(s, UTF8SKIP(s), &n, 0);
6072 if (!SvREADONLY(sv)) {
6074 sv_magic(sv, 0, PERL_MAGIC_utf8, 0, 0);
6075 mg = mg_find(sv, PERL_MAGIC_utf8);
6080 Newz(0, cache, PERL_MAGIC_UTF8_CACHESIZE * 2, STRLEN);
6081 mg->mg_ptr = (char *) cache;
6086 cache[1] = *offsetp;
6097 Returns a boolean indicating whether the strings in the two SVs are
6098 identical. Is UTF-8 and 'use bytes' aware, handles get magic, and will
6099 coerce its args to strings if necessary.
6105 Perl_sv_eq(pTHX_ register SV *sv1, register SV *sv2)
6113 SV* svrecode = Nullsv;
6120 pv1 = SvPV(sv1, cur1);
6127 pv2 = SvPV(sv2, cur2);
6129 if (cur1 && cur2 && SvUTF8(sv1) != SvUTF8(sv2) && !IN_BYTES) {
6130 /* Differing utf8ness.
6131 * Do not UTF8size the comparands as a side-effect. */
6134 svrecode = newSVpvn(pv2, cur2);
6135 sv_recode_to_utf8(svrecode, PL_encoding);
6136 pv2 = SvPV(svrecode, cur2);
6139 svrecode = newSVpvn(pv1, cur1);
6140 sv_recode_to_utf8(svrecode, PL_encoding);
6141 pv1 = SvPV(svrecode, cur1);
6143 /* Now both are in UTF-8. */
6148 bool is_utf8 = TRUE;
6151 /* sv1 is the UTF-8 one,
6152 * if is equal it must be downgrade-able */
6153 char *pv = (char*)bytes_from_utf8((U8*)pv1,
6159 /* sv2 is the UTF-8 one,
6160 * if is equal it must be downgrade-able */
6161 char *pv = (char *)bytes_from_utf8((U8*)pv2,
6167 /* Downgrade not possible - cannot be eq */
6174 eq = (pv1 == pv2) || memEQ(pv1, pv2, cur1);
6177 SvREFCNT_dec(svrecode);
6188 Compares the strings in two SVs. Returns -1, 0, or 1 indicating whether the
6189 string in C<sv1> is less than, equal to, or greater than the string in
6190 C<sv2>. Is UTF-8 and 'use bytes' aware, handles get magic, and will
6191 coerce its args to strings if necessary. See also C<sv_cmp_locale>.
6197 Perl_sv_cmp(pTHX_ register SV *sv1, register SV *sv2)
6200 char *pv1, *pv2, *tpv = Nullch;
6202 SV *svrecode = Nullsv;
6209 pv1 = SvPV(sv1, cur1);
6216 pv2 = SvPV(sv2, cur2);
6218 if (cur1 && cur2 && SvUTF8(sv1) != SvUTF8(sv2) && !IN_BYTES) {
6219 /* Differing utf8ness.
6220 * Do not UTF8size the comparands as a side-effect. */
6223 svrecode = newSVpvn(pv2, cur2);
6224 sv_recode_to_utf8(svrecode, PL_encoding);
6225 pv2 = SvPV(svrecode, cur2);
6228 pv2 = tpv = (char*)bytes_to_utf8((U8*)pv2, &cur2);
6233 svrecode = newSVpvn(pv1, cur1);
6234 sv_recode_to_utf8(svrecode, PL_encoding);
6235 pv1 = SvPV(svrecode, cur1);
6238 pv1 = tpv = (char*)bytes_to_utf8((U8*)pv1, &cur1);
6244 cmp = cur2 ? -1 : 0;
6248 I32 retval = memcmp((void*)pv1, (void*)pv2, cur1 < cur2 ? cur1 : cur2);
6251 cmp = retval < 0 ? -1 : 1;
6252 } else if (cur1 == cur2) {
6255 cmp = cur1 < cur2 ? -1 : 1;
6260 SvREFCNT_dec(svrecode);
6269 =for apidoc sv_cmp_locale
6271 Compares the strings in two SVs in a locale-aware manner. Is UTF-8 and
6272 'use bytes' aware, handles get magic, and will coerce its args to strings
6273 if necessary. See also C<sv_cmp_locale>. See also C<sv_cmp>.
6279 Perl_sv_cmp_locale(pTHX_ register SV *sv1, register SV *sv2)
6281 #ifdef USE_LOCALE_COLLATE
6287 if (PL_collation_standard)
6291 pv1 = sv1 ? sv_collxfrm(sv1, &len1) : (char *) NULL;
6293 pv2 = sv2 ? sv_collxfrm(sv2, &len2) : (char *) NULL;
6295 if (!pv1 || !len1) {
6306 retval = memcmp((void*)pv1, (void*)pv2, len1 < len2 ? len1 : len2);
6309 return retval < 0 ? -1 : 1;
6312 * When the result of collation is equality, that doesn't mean
6313 * that there are no differences -- some locales exclude some
6314 * characters from consideration. So to avoid false equalities,
6315 * we use the raw string as a tiebreaker.
6321 #endif /* USE_LOCALE_COLLATE */
6323 return sv_cmp(sv1, sv2);
6327 #ifdef USE_LOCALE_COLLATE
6330 =for apidoc sv_collxfrm
6332 Add Collate Transform magic to an SV if it doesn't already have it.
6334 Any scalar variable may carry PERL_MAGIC_collxfrm magic that contains the
6335 scalar data of the variable, but transformed to such a format that a normal
6336 memory comparison can be used to compare the data according to the locale
6343 Perl_sv_collxfrm(pTHX_ SV *sv, STRLEN *nxp)
6347 mg = SvMAGICAL(sv) ? mg_find(sv, PERL_MAGIC_collxfrm) : (MAGIC *) NULL;
6348 if (!mg || !mg->mg_ptr || *(U32*)mg->mg_ptr != PL_collation_ix) {
6353 Safefree(mg->mg_ptr);
6355 if ((xf = mem_collxfrm(s, len, &xlen))) {
6356 if (SvREADONLY(sv)) {
6359 return xf + sizeof(PL_collation_ix);
6362 sv_magic(sv, 0, PERL_MAGIC_collxfrm, 0, 0);
6363 mg = mg_find(sv, PERL_MAGIC_collxfrm);
6376 if (mg && mg->mg_ptr) {
6378 return mg->mg_ptr + sizeof(PL_collation_ix);
6386 #endif /* USE_LOCALE_COLLATE */
6391 Get a line from the filehandle and store it into the SV, optionally
6392 appending to the currently-stored string.
6398 Perl_sv_gets(pTHX_ register SV *sv, register PerlIO *fp, I32 append)
6402 register STDCHAR rslast;
6403 register STDCHAR *bp;
6409 if (SvTHINKFIRST(sv))
6410 sv_force_normal_flags(sv, append ? 0 : SV_COW_DROP_PV);
6411 /* XXX. If you make this PVIV, then copy on write can copy scalars read
6413 However, perlbench says it's slower, because the existing swipe code
6414 is faster than copy on write.
6415 Swings and roundabouts. */
6416 (void)SvUPGRADE(sv, SVt_PV);
6421 if (PerlIO_isutf8(fp)) {
6423 sv_utf8_upgrade_nomg(sv);
6424 sv_pos_u2b(sv,&append,0);
6426 } else if (SvUTF8(sv)) {
6427 SV *tsv = NEWSV(0,0);
6428 sv_gets(tsv, fp, 0);
6429 sv_utf8_upgrade_nomg(tsv);
6430 SvCUR_set(sv,append);
6433 goto return_string_or_null;
6438 if (PerlIO_isutf8(fp))
6441 if (IN_PERL_COMPILETIME) {
6442 /* we always read code in line mode */
6446 else if (RsSNARF(PL_rs)) {
6447 /* If it is a regular disk file use size from stat() as estimate
6448 of amount we are going to read - may result in malloc-ing
6449 more memory than we realy need if layers bellow reduce
6450 size we read (e.g. CRLF or a gzip layer)
6453 if (!PerlLIO_fstat(PerlIO_fileno(fp), &st) && S_ISREG(st.st_mode)) {
6454 Off_t offset = PerlIO_tell(fp);
6455 if (offset != (Off_t) -1 && st.st_size + append > offset) {
6456 (void) SvGROW(sv, (STRLEN)((st.st_size - offset) + append + 1));
6462 else if (RsRECORD(PL_rs)) {
6466 /* Grab the size of the record we're getting */
6467 recsize = SvIV(SvRV(PL_rs));
6468 buffer = SvGROW(sv, (STRLEN)(recsize + append + 1)) + append;
6471 /* VMS wants read instead of fread, because fread doesn't respect */
6472 /* RMS record boundaries. This is not necessarily a good thing to be */
6473 /* doing, but we've got no other real choice - except avoid stdio
6474 as implementation - perhaps write a :vms layer ?
6476 bytesread = PerlLIO_read(PerlIO_fileno(fp), buffer, recsize);
6478 bytesread = PerlIO_read(fp, buffer, recsize);
6482 SvCUR_set(sv, bytesread += append);
6483 buffer[bytesread] = '\0';
6484 goto return_string_or_null;
6486 else if (RsPARA(PL_rs)) {
6492 /* Get $/ i.e. PL_rs into same encoding as stream wants */
6493 if (PerlIO_isutf8(fp)) {
6494 rsptr = SvPVutf8(PL_rs, rslen);
6497 if (SvUTF8(PL_rs)) {
6498 if (!sv_utf8_downgrade(PL_rs, TRUE)) {
6499 Perl_croak(aTHX_ "Wide character in $/");
6502 rsptr = SvPV(PL_rs, rslen);
6506 rslast = rslen ? rsptr[rslen - 1] : '\0';
6508 if (rspara) { /* have to do this both before and after */
6509 do { /* to make sure file boundaries work right */
6512 i = PerlIO_getc(fp);
6516 PerlIO_ungetc(fp,i);
6522 /* See if we know enough about I/O mechanism to cheat it ! */
6524 /* This used to be #ifdef test - it is made run-time test for ease
6525 of abstracting out stdio interface. One call should be cheap
6526 enough here - and may even be a macro allowing compile
6530 if (PerlIO_fast_gets(fp)) {
6533 * We're going to steal some values from the stdio struct
6534 * and put EVERYTHING in the innermost loop into registers.
6536 register STDCHAR *ptr;
6540 #if defined(VMS) && defined(PERLIO_IS_STDIO)
6541 /* An ungetc()d char is handled separately from the regular
6542 * buffer, so we getc() it back out and stuff it in the buffer.
6544 i = PerlIO_getc(fp);
6545 if (i == EOF) return 0;
6546 *(--((*fp)->_ptr)) = (unsigned char) i;
6550 /* Here is some breathtakingly efficient cheating */
6552 cnt = PerlIO_get_cnt(fp); /* get count into register */
6553 /* make sure we have the room */
6554 if ((I32)(SvLEN(sv) - append) <= cnt + 1) {
6555 /* Not room for all of it
6556 if we are looking for a separator and room for some
6558 if (rslen && cnt > 80 && (I32)SvLEN(sv) > append) {
6559 /* just process what we have room for */
6560 shortbuffered = cnt - SvLEN(sv) + append + 1;
6561 cnt -= shortbuffered;
6565 /* remember that cnt can be negative */
6566 SvGROW(sv, (STRLEN)(append + (cnt <= 0 ? 2 : (cnt + 1))));
6571 bp = (STDCHAR*)SvPVX(sv) + append; /* move these two too to registers */
6572 ptr = (STDCHAR*)PerlIO_get_ptr(fp);
6573 DEBUG_P(PerlIO_printf(Perl_debug_log,
6574 "Screamer: entering, ptr=%"UVuf", cnt=%ld\n",PTR2UV(ptr),(long)cnt));
6575 DEBUG_P(PerlIO_printf(Perl_debug_log,
6576 "Screamer: entering: PerlIO * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
6577 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
6578 PTR2UV(PerlIO_has_base(fp) ? PerlIO_get_base(fp) : 0)));
6583 while (cnt > 0) { /* this | eat */
6585 if ((*bp++ = *ptr++) == rslast) /* really | dust */
6586 goto thats_all_folks; /* screams | sed :-) */
6590 Copy(ptr, bp, cnt, char); /* this | eat */
6591 bp += cnt; /* screams | dust */
6592 ptr += cnt; /* louder | sed :-) */
6597 if (shortbuffered) { /* oh well, must extend */
6598 cnt = shortbuffered;
6600 bpx = bp - (STDCHAR*)SvPVX(sv); /* box up before relocation */
6602 SvGROW(sv, SvLEN(sv) + append + cnt + 2);
6603 bp = (STDCHAR*)SvPVX(sv) + bpx; /* unbox after relocation */
6607 DEBUG_P(PerlIO_printf(Perl_debug_log,
6608 "Screamer: going to getc, ptr=%"UVuf", cnt=%ld\n",
6609 PTR2UV(ptr),(long)cnt));
6610 PerlIO_set_ptrcnt(fp, (STDCHAR*)ptr, cnt); /* deregisterize cnt and ptr */
6612 DEBUG_P(PerlIO_printf(Perl_debug_log,
6613 "Screamer: pre: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
6614 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
6615 PTR2UV(PerlIO_has_base (fp) ? PerlIO_get_base(fp) : 0)));
6617 /* This used to call 'filbuf' in stdio form, but as that behaves like
6618 getc when cnt <= 0 we use PerlIO_getc here to avoid introducing
6619 another abstraction. */
6620 i = PerlIO_getc(fp); /* get more characters */
6622 DEBUG_P(PerlIO_printf(Perl_debug_log,
6623 "Screamer: post: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
6624 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
6625 PTR2UV(PerlIO_has_base (fp) ? PerlIO_get_base(fp) : 0)));
6627 cnt = PerlIO_get_cnt(fp);
6628 ptr = (STDCHAR*)PerlIO_get_ptr(fp); /* reregisterize cnt and ptr */
6629 DEBUG_P(PerlIO_printf(Perl_debug_log,
6630 "Screamer: after getc, ptr=%"UVuf", cnt=%ld\n",PTR2UV(ptr),(long)cnt));
6632 if (i == EOF) /* all done for ever? */
6633 goto thats_really_all_folks;
6635 bpx = bp - (STDCHAR*)SvPVX(sv); /* box up before relocation */
6637 SvGROW(sv, bpx + cnt + 2);
6638 bp = (STDCHAR*)SvPVX(sv) + bpx; /* unbox after relocation */
6640 *bp++ = (STDCHAR)i; /* store character from PerlIO_getc */
6642 if (rslen && (STDCHAR)i == rslast) /* all done for now? */
6643 goto thats_all_folks;
6647 if ((rslen > 1 && (STRLEN)(bp - (STDCHAR*)SvPVX(sv)) < rslen) ||
6648 memNE((char*)bp - rslen, rsptr, rslen))
6649 goto screamer; /* go back to the fray */
6650 thats_really_all_folks:
6652 cnt += shortbuffered;
6653 DEBUG_P(PerlIO_printf(Perl_debug_log,
6654 "Screamer: quitting, ptr=%"UVuf", cnt=%ld\n",PTR2UV(ptr),(long)cnt));
6655 PerlIO_set_ptrcnt(fp, (STDCHAR*)ptr, cnt); /* put these back or we're in trouble */
6656 DEBUG_P(PerlIO_printf(Perl_debug_log,
6657 "Screamer: end: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
6658 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
6659 PTR2UV(PerlIO_has_base (fp) ? PerlIO_get_base(fp) : 0)));
6661 SvCUR_set(sv, bp - (STDCHAR*)SvPVX(sv)); /* set length */
6662 DEBUG_P(PerlIO_printf(Perl_debug_log,
6663 "Screamer: done, len=%ld, string=|%.*s|\n",
6664 (long)SvCUR(sv),(int)SvCUR(sv),SvPVX(sv)));
6668 /*The big, slow, and stupid way. */
6670 /* Any stack-challenged places. */
6672 /* EPOC: need to work around SDK features. *
6673 * On WINS: MS VC5 generates calls to _chkstk, *
6674 * if a "large" stack frame is allocated. *
6675 * gcc on MARM does not generate calls like these. */
6676 # define USEHEAPINSTEADOFSTACK
6679 #ifdef USEHEAPINSTEADOFSTACK
6681 New(0, buf, 8192, STDCHAR);
6689 register STDCHAR *bpe = buf + sizeof(buf);
6691 while ((i = PerlIO_getc(fp)) != EOF && (*bp++ = (STDCHAR)i) != rslast && bp < bpe)
6692 ; /* keep reading */
6696 cnt = PerlIO_read(fp,(char*)buf, sizeof(buf));
6697 /* Accomodate broken VAXC compiler, which applies U8 cast to
6698 * both args of ?: operator, causing EOF to change into 255
6701 i = (U8)buf[cnt - 1];
6707 cnt = 0; /* we do need to re-set the sv even when cnt <= 0 */
6709 sv_catpvn(sv, (char *) buf, cnt);
6711 sv_setpvn(sv, (char *) buf, cnt);
6713 if (i != EOF && /* joy */
6715 SvCUR(sv) < rslen ||
6716 memNE(SvPVX(sv) + SvCUR(sv) - rslen, rsptr, rslen)))
6720 * If we're reading from a TTY and we get a short read,
6721 * indicating that the user hit his EOF character, we need
6722 * to notice it now, because if we try to read from the TTY
6723 * again, the EOF condition will disappear.
6725 * The comparison of cnt to sizeof(buf) is an optimization
6726 * that prevents unnecessary calls to feof().
6730 if (!(cnt < sizeof(buf) && PerlIO_eof(fp)))
6734 #ifdef USEHEAPINSTEADOFSTACK
6739 if (rspara) { /* have to do this both before and after */
6740 while (i != EOF) { /* to make sure file boundaries work right */
6741 i = PerlIO_getc(fp);
6743 PerlIO_ungetc(fp,i);
6749 return_string_or_null:
6750 return (SvCUR(sv) - append) ? SvPVX(sv) : Nullch;
6756 Auto-increment of the value in the SV, doing string to numeric conversion
6757 if necessary. Handles 'get' magic.
6763 Perl_sv_inc(pTHX_ register SV *sv)
6772 if (SvTHINKFIRST(sv)) {
6774 sv_force_normal_flags(sv, 0);
6775 if (SvREADONLY(sv)) {
6776 if (IN_PERL_RUNTIME)
6777 Perl_croak(aTHX_ PL_no_modify);
6781 if (SvAMAGIC(sv) && AMG_CALLun(sv,inc))
6783 i = PTR2IV(SvRV(sv));
6788 flags = SvFLAGS(sv);
6789 if ((flags & (SVp_NOK|SVp_IOK)) == SVp_NOK) {
6790 /* It's (privately or publicly) a float, but not tested as an
6791 integer, so test it to see. */
6793 flags = SvFLAGS(sv);
6795 if ((flags & SVf_IOK) || ((flags & (SVp_IOK | SVp_NOK)) == SVp_IOK)) {
6796 /* It's publicly an integer, or privately an integer-not-float */
6797 #ifdef PERL_PRESERVE_IVUV
6801 if (SvUVX(sv) == UV_MAX)
6802 sv_setnv(sv, UV_MAX_P1);
6804 (void)SvIOK_only_UV(sv);
6807 if (SvIVX(sv) == IV_MAX)
6808 sv_setuv(sv, (UV)IV_MAX + 1);
6810 (void)SvIOK_only(sv);
6816 if (flags & SVp_NOK) {
6817 (void)SvNOK_only(sv);
6822 if (!(flags & SVp_POK) || !*SvPVX(sv)) {
6823 if ((flags & SVTYPEMASK) < SVt_PVIV)
6824 sv_upgrade(sv, SVt_IV);
6825 (void)SvIOK_only(sv);
6830 while (isALPHA(*d)) d++;
6831 while (isDIGIT(*d)) d++;
6833 #ifdef PERL_PRESERVE_IVUV
6834 /* Got to punt this as an integer if needs be, but we don't issue
6835 warnings. Probably ought to make the sv_iv_please() that does
6836 the conversion if possible, and silently. */
6837 int numtype = grok_number(SvPVX(sv), SvCUR(sv), NULL);
6838 if (numtype && !(numtype & IS_NUMBER_INFINITY)) {
6839 /* Need to try really hard to see if it's an integer.
6840 9.22337203685478e+18 is an integer.
6841 but "9.22337203685478e+18" + 0 is UV=9223372036854779904
6842 so $a="9.22337203685478e+18"; $a+0; $a++
6843 needs to be the same as $a="9.22337203685478e+18"; $a++
6850 /* sv_2iv *should* have made this an NV */
6851 if (flags & SVp_NOK) {
6852 (void)SvNOK_only(sv);
6856 /* I don't think we can get here. Maybe I should assert this
6857 And if we do get here I suspect that sv_setnv will croak. NWC
6859 #if defined(USE_LONG_DOUBLE)
6860 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",
6861 SvPVX(sv), SvIVX(sv), SvNVX(sv)));
6863 DEBUG_c(PerlIO_printf(Perl_debug_log,"sv_inc punt failed to convert '%s' to IOK or NOKp, UV=0x%"UVxf" NV=%"NVgf"\n",
6864 SvPVX(sv), SvIVX(sv), SvNVX(sv)));
6867 #endif /* PERL_PRESERVE_IVUV */
6868 sv_setnv(sv,Atof(SvPVX(sv)) + 1.0);
6872 while (d >= SvPVX(sv)) {
6880 /* MKS: The original code here died if letters weren't consecutive.
6881 * at least it didn't have to worry about non-C locales. The
6882 * new code assumes that ('z'-'a')==('Z'-'A'), letters are
6883 * arranged in order (although not consecutively) and that only
6884 * [A-Za-z] are accepted by isALPHA in the C locale.
6886 if (*d != 'z' && *d != 'Z') {
6887 do { ++*d; } while (!isALPHA(*d));
6890 *(d--) -= 'z' - 'a';
6895 *(d--) -= 'z' - 'a' + 1;
6899 /* oh,oh, the number grew */
6900 SvGROW(sv, SvCUR(sv) + 2);
6902 for (d = SvPVX(sv) + SvCUR(sv); d > SvPVX(sv); d--)
6913 Auto-decrement of the value in the SV, doing string to numeric conversion
6914 if necessary. Handles 'get' magic.
6920 Perl_sv_dec(pTHX_ register SV *sv)
6928 if (SvTHINKFIRST(sv)) {
6930 sv_force_normal_flags(sv, 0);
6931 if (SvREADONLY(sv)) {
6932 if (IN_PERL_RUNTIME)
6933 Perl_croak(aTHX_ PL_no_modify);
6937 if (SvAMAGIC(sv) && AMG_CALLun(sv,dec))
6939 i = PTR2IV(SvRV(sv));
6944 /* Unlike sv_inc we don't have to worry about string-never-numbers
6945 and keeping them magic. But we mustn't warn on punting */
6946 flags = SvFLAGS(sv);
6947 if ((flags & SVf_IOK) || ((flags & (SVp_IOK | SVp_NOK)) == SVp_IOK)) {
6948 /* It's publicly an integer, or privately an integer-not-float */
6949 #ifdef PERL_PRESERVE_IVUV
6953 if (SvUVX(sv) == 0) {
6954 (void)SvIOK_only(sv);
6958 (void)SvIOK_only_UV(sv);
6962 if (SvIVX(sv) == IV_MIN)
6963 sv_setnv(sv, (NV)IV_MIN - 1.0);
6965 (void)SvIOK_only(sv);
6971 if (flags & SVp_NOK) {
6973 (void)SvNOK_only(sv);
6976 if (!(flags & SVp_POK)) {
6977 if ((flags & SVTYPEMASK) < SVt_PVNV)
6978 sv_upgrade(sv, SVt_NV);
6980 (void)SvNOK_only(sv);
6983 #ifdef PERL_PRESERVE_IVUV
6985 int numtype = grok_number(SvPVX(sv), SvCUR(sv), NULL);
6986 if (numtype && !(numtype & IS_NUMBER_INFINITY)) {
6987 /* Need to try really hard to see if it's an integer.
6988 9.22337203685478e+18 is an integer.
6989 but "9.22337203685478e+18" + 0 is UV=9223372036854779904
6990 so $a="9.22337203685478e+18"; $a+0; $a--
6991 needs to be the same as $a="9.22337203685478e+18"; $a--
6998 /* sv_2iv *should* have made this an NV */
6999 if (flags & SVp_NOK) {
7000 (void)SvNOK_only(sv);
7004 /* I don't think we can get here. Maybe I should assert this
7005 And if we do get here I suspect that sv_setnv will croak. NWC
7007 #if defined(USE_LONG_DOUBLE)
7008 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",
7009 SvPVX(sv), SvIVX(sv), SvNVX(sv)));
7011 DEBUG_c(PerlIO_printf(Perl_debug_log,"sv_dec punt failed to convert '%s' to IOK or NOKp, UV=0x%"UVxf" NV=%"NVgf"\n",
7012 SvPVX(sv), SvIVX(sv), SvNVX(sv)));
7016 #endif /* PERL_PRESERVE_IVUV */
7017 sv_setnv(sv,Atof(SvPVX(sv)) - 1.0); /* punt */
7021 =for apidoc sv_mortalcopy
7023 Creates a new SV which is a copy of the original SV (using C<sv_setsv>).
7024 The new SV is marked as mortal. It will be destroyed "soon", either by an
7025 explicit call to FREETMPS, or by an implicit call at places such as
7026 statement boundaries. See also C<sv_newmortal> and C<sv_2mortal>.
7031 /* Make a string that will exist for the duration of the expression
7032 * evaluation. Actually, it may have to last longer than that, but
7033 * hopefully we won't free it until it has been assigned to a
7034 * permanent location. */
7037 Perl_sv_mortalcopy(pTHX_ SV *oldstr)
7042 sv_setsv(sv,oldstr);
7044 PL_tmps_stack[++PL_tmps_ix] = sv;
7050 =for apidoc sv_newmortal
7052 Creates a new null SV which is mortal. The reference count of the SV is
7053 set to 1. It will be destroyed "soon", either by an explicit call to
7054 FREETMPS, or by an implicit call at places such as statement boundaries.
7055 See also C<sv_mortalcopy> and C<sv_2mortal>.
7061 Perl_sv_newmortal(pTHX)
7066 SvFLAGS(sv) = SVs_TEMP;
7068 PL_tmps_stack[++PL_tmps_ix] = sv;
7073 =for apidoc sv_2mortal
7075 Marks an existing SV as mortal. The SV will be destroyed "soon", either
7076 by an explicit call to FREETMPS, or by an implicit call at places such as
7077 statement boundaries. See also C<sv_newmortal> and C<sv_mortalcopy>.
7083 Perl_sv_2mortal(pTHX_ register SV *sv)
7087 if (SvREADONLY(sv) && SvIMMORTAL(sv))
7090 PL_tmps_stack[++PL_tmps_ix] = sv;
7098 Creates a new SV and copies a string into it. The reference count for the
7099 SV is set to 1. If C<len> is zero, Perl will compute the length using
7100 strlen(). For efficiency, consider using C<newSVpvn> instead.
7106 Perl_newSVpv(pTHX_ const char *s, STRLEN len)
7113 sv_setpvn(sv,s,len);
7118 =for apidoc newSVpvn
7120 Creates a new SV and copies a string into it. The reference count for the
7121 SV is set to 1. Note that if C<len> is zero, Perl will create a zero length
7122 string. You are responsible for ensuring that the source string is at least
7129 Perl_newSVpvn(pTHX_ const char *s, STRLEN len)
7134 sv_setpvn(sv,s,len);
7139 =for apidoc newSVpvn_share
7141 Creates a new SV with its SvPVX pointing to a shared string in the string
7142 table. If the string does not already exist in the table, it is created
7143 first. Turns on READONLY and FAKE. The string's hash is stored in the UV
7144 slot of the SV; if the C<hash> parameter is non-zero, that value is used;
7145 otherwise the hash is computed. The idea here is that as the string table
7146 is used for shared hash keys these strings will have SvPVX == HeKEY and
7147 hash lookup will avoid string compare.
7153 Perl_newSVpvn_share(pTHX_ const char *src, I32 len, U32 hash)
7156 bool is_utf8 = FALSE;
7158 STRLEN tmplen = -len;
7160 /* See the note in hv.c:hv_fetch() --jhi */
7161 src = (char*)bytes_from_utf8((U8*)src, &tmplen, &is_utf8);
7165 PERL_HASH(hash, src, len);
7167 sv_upgrade(sv, SVt_PVIV);
7168 SvPVX(sv) = sharepvn(src, is_utf8?-len:len, hash);
7181 #if defined(PERL_IMPLICIT_CONTEXT)
7183 /* pTHX_ magic can't cope with varargs, so this is a no-context
7184 * version of the main function, (which may itself be aliased to us).
7185 * Don't access this version directly.
7189 Perl_newSVpvf_nocontext(const char* pat, ...)
7194 va_start(args, pat);
7195 sv = vnewSVpvf(pat, &args);
7202 =for apidoc newSVpvf
7204 Creates a new SV and initializes it with the string formatted like
7211 Perl_newSVpvf(pTHX_ const char* pat, ...)
7215 va_start(args, pat);
7216 sv = vnewSVpvf(pat, &args);
7221 /* backend for newSVpvf() and newSVpvf_nocontext() */
7224 Perl_vnewSVpvf(pTHX_ const char* pat, va_list* args)
7228 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
7235 Creates a new SV and copies a floating point value into it.
7236 The reference count for the SV is set to 1.
7242 Perl_newSVnv(pTHX_ NV n)
7254 Creates a new SV and copies an integer into it. The reference count for the
7261 Perl_newSViv(pTHX_ IV i)
7273 Creates a new SV and copies an unsigned integer into it.
7274 The reference count for the SV is set to 1.
7280 Perl_newSVuv(pTHX_ UV u)
7290 =for apidoc newRV_noinc
7292 Creates an RV wrapper for an SV. The reference count for the original
7293 SV is B<not> incremented.
7299 Perl_newRV_noinc(pTHX_ SV *tmpRef)
7304 sv_upgrade(sv, SVt_RV);
7311 /* newRV_inc is the official function name to use now.
7312 * newRV_inc is in fact #defined to newRV in sv.h
7316 Perl_newRV(pTHX_ SV *tmpRef)
7318 return newRV_noinc(SvREFCNT_inc(tmpRef));
7324 Creates a new SV which is an exact duplicate of the original SV.
7331 Perl_newSVsv(pTHX_ register SV *old)
7337 if (SvTYPE(old) == SVTYPEMASK) {
7338 if (ckWARN_d(WARN_INTERNAL))
7339 Perl_warner(aTHX_ packWARN(WARN_INTERNAL), "semi-panic: attempt to dup freed string");
7354 =for apidoc sv_reset
7356 Underlying implementation for the C<reset> Perl function.
7357 Note that the perl-level function is vaguely deprecated.
7363 Perl_sv_reset(pTHX_ register char *s, HV *stash)
7371 char todo[PERL_UCHAR_MAX+1];
7376 if (!*s) { /* reset ?? searches */
7377 for (pm = HvPMROOT(stash); pm; pm = pm->op_pmnext) {
7378 pm->op_pmdynflags &= ~PMdf_USED;
7383 /* reset variables */
7385 if (!HvARRAY(stash))
7388 Zero(todo, 256, char);
7390 i = (unsigned char)*s;
7394 max = (unsigned char)*s++;
7395 for ( ; i <= max; i++) {
7398 for (i = 0; i <= (I32) HvMAX(stash); i++) {
7399 for (entry = HvARRAY(stash)[i];
7401 entry = HeNEXT(entry))
7403 if (!todo[(U8)*HeKEY(entry)])
7405 gv = (GV*)HeVAL(entry);
7407 if (SvTHINKFIRST(sv)) {
7408 if (!SvREADONLY(sv) && SvROK(sv))
7413 if (SvTYPE(sv) >= SVt_PV) {
7415 if (SvPVX(sv) != Nullch)
7422 if (GvHV(gv) && !HvNAME(GvHV(gv))) {
7425 #ifdef USE_ENVIRON_ARRAY
7427 # ifdef USE_ITHREADS
7428 && PL_curinterp == aTHX
7432 environ[0] = Nullch;
7435 #endif /* !PERL_MICRO */
7445 Using various gambits, try to get an IO from an SV: the IO slot if its a
7446 GV; or the recursive result if we're an RV; or the IO slot of the symbol
7447 named after the PV if we're a string.
7453 Perl_sv_2io(pTHX_ SV *sv)
7459 switch (SvTYPE(sv)) {
7467 Perl_croak(aTHX_ "Bad filehandle: %s", GvNAME(gv));
7471 Perl_croak(aTHX_ PL_no_usym, "filehandle");
7473 return sv_2io(SvRV(sv));
7474 gv = gv_fetchpv(SvPV(sv,n_a), FALSE, SVt_PVIO);
7480 Perl_croak(aTHX_ "Bad filehandle: %"SVf, sv);
7489 Using various gambits, try to get a CV from an SV; in addition, try if
7490 possible to set C<*st> and C<*gvp> to the stash and GV associated with it.
7496 Perl_sv_2cv(pTHX_ SV *sv, HV **st, GV **gvp, I32 lref)
7503 return *gvp = Nullgv, Nullcv;
7504 switch (SvTYPE(sv)) {
7523 SV **sp = &sv; /* Used in tryAMAGICunDEREF macro. */
7524 tryAMAGICunDEREF(to_cv);
7527 if (SvTYPE(sv) == SVt_PVCV) {
7536 Perl_croak(aTHX_ "Not a subroutine reference");
7541 gv = gv_fetchpv(SvPV(sv, n_a), lref, SVt_PVCV);
7547 if (lref && !GvCVu(gv)) {
7550 tmpsv = NEWSV(704,0);
7551 gv_efullname3(tmpsv, gv, Nullch);
7552 /* XXX this is probably not what they think they're getting.
7553 * It has the same effect as "sub name;", i.e. just a forward
7555 newSUB(start_subparse(FALSE, 0),
7556 newSVOP(OP_CONST, 0, tmpsv),
7561 Perl_croak(aTHX_ "Unable to create sub named \"%"SVf"\"",
7571 Returns true if the SV has a true value by Perl's rules.
7572 Use the C<SvTRUE> macro instead, which may call C<sv_true()> or may
7573 instead use an in-line version.
7579 Perl_sv_true(pTHX_ register SV *sv)
7585 if ((tXpv = (XPV*)SvANY(sv)) &&
7586 (tXpv->xpv_cur > 1 ||
7587 (tXpv->xpv_cur && *tXpv->xpv_pv != '0')))
7594 return SvIVX(sv) != 0;
7597 return SvNVX(sv) != 0.0;
7599 return sv_2bool(sv);
7607 A private implementation of the C<SvIVx> macro for compilers which can't
7608 cope with complex macro expressions. Always use the macro instead.
7614 Perl_sv_iv(pTHX_ register SV *sv)
7618 return (IV)SvUVX(sv);
7627 A private implementation of the C<SvUVx> macro for compilers which can't
7628 cope with complex macro expressions. Always use the macro instead.
7634 Perl_sv_uv(pTHX_ register SV *sv)
7639 return (UV)SvIVX(sv);
7647 A private implementation of the C<SvNVx> macro for compilers which can't
7648 cope with complex macro expressions. Always use the macro instead.
7654 Perl_sv_nv(pTHX_ register SV *sv)
7661 /* sv_pv() is now a macro using SvPV_nolen();
7662 * this function provided for binary compatibility only
7666 Perl_sv_pv(pTHX_ SV *sv)
7673 return sv_2pv(sv, &n_a);
7679 Use the C<SvPV_nolen> macro instead
7683 A private implementation of the C<SvPV> macro for compilers which can't
7684 cope with complex macro expressions. Always use the macro instead.
7690 Perl_sv_pvn(pTHX_ SV *sv, STRLEN *lp)
7696 return sv_2pv(sv, lp);
7701 Perl_sv_pvn_nomg(pTHX_ register SV *sv, STRLEN *lp)
7707 return sv_2pv_flags(sv, lp, 0);
7710 /* sv_pvn_force() is now a macro using Perl_sv_pvn_force_flags();
7711 * this function provided for binary compatibility only
7715 Perl_sv_pvn_force(pTHX_ SV *sv, STRLEN *lp)
7717 return sv_pvn_force_flags(sv, lp, SV_GMAGIC);
7721 =for apidoc sv_pvn_force
7723 Get a sensible string out of the SV somehow.
7724 A private implementation of the C<SvPV_force> macro for compilers which
7725 can't cope with complex macro expressions. Always use the macro instead.
7727 =for apidoc sv_pvn_force_flags
7729 Get a sensible string out of the SV somehow.
7730 If C<flags> has C<SV_GMAGIC> bit set, will C<mg_get> on C<sv> if
7731 appropriate, else not. C<sv_pvn_force> and C<sv_pvn_force_nomg> are
7732 implemented in terms of this function.
7733 You normally want to use the various wrapper macros instead: see
7734 C<SvPV_force> and C<SvPV_force_nomg>
7740 Perl_sv_pvn_force_flags(pTHX_ SV *sv, STRLEN *lp, I32 flags)
7744 if (SvTHINKFIRST(sv) && !SvROK(sv))
7745 sv_force_normal_flags(sv, 0);
7751 if (SvTYPE(sv) > SVt_PVLV && SvTYPE(sv) != SVt_PVFM) {
7752 Perl_croak(aTHX_ "Can't coerce %s to string in %s", sv_reftype(sv,0),
7756 s = sv_2pv_flags(sv, lp, flags);
7757 if (s != SvPVX(sv)) { /* Almost, but not quite, sv_setpvn() */
7762 (void)SvUPGRADE(sv, SVt_PV); /* Never FALSE */
7763 SvGROW(sv, len + 1);
7764 Move(s,SvPVX(sv),len,char);
7769 SvPOK_on(sv); /* validate pointer */
7771 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2pv(%s)\n",
7772 PTR2UV(sv),SvPVX(sv)));
7778 /* sv_pvbyte () is now a macro using Perl_sv_2pv_flags();
7779 * this function provided for binary compatibility only
7783 Perl_sv_pvbyte(pTHX_ SV *sv)
7785 sv_utf8_downgrade(sv,0);
7790 =for apidoc sv_pvbyte
7792 Use C<SvPVbyte_nolen> instead.
7794 =for apidoc sv_pvbyten
7796 A private implementation of the C<SvPVbyte> macro for compilers
7797 which can't cope with complex macro expressions. Always use the macro
7804 Perl_sv_pvbyten(pTHX_ SV *sv, STRLEN *lp)
7806 sv_utf8_downgrade(sv,0);
7807 return sv_pvn(sv,lp);
7811 =for apidoc sv_pvbyten_force
7813 A private implementation of the C<SvPVbytex_force> macro for compilers
7814 which can't cope with complex macro expressions. Always use the macro
7821 Perl_sv_pvbyten_force(pTHX_ SV *sv, STRLEN *lp)
7823 sv_utf8_downgrade(sv,0);
7824 return sv_pvn_force(sv,lp);
7827 /* sv_pvutf8 () is now a macro using Perl_sv_2pv_flags();
7828 * this function provided for binary compatibility only
7832 Perl_sv_pvutf8(pTHX_ SV *sv)
7834 sv_utf8_upgrade(sv);
7839 =for apidoc sv_pvutf8
7841 Use the C<SvPVutf8_nolen> macro instead
7843 =for apidoc sv_pvutf8n
7845 A private implementation of the C<SvPVutf8> macro for compilers
7846 which can't cope with complex macro expressions. Always use the macro
7853 Perl_sv_pvutf8n(pTHX_ SV *sv, STRLEN *lp)
7855 sv_utf8_upgrade(sv);
7856 return sv_pvn(sv,lp);
7860 =for apidoc sv_pvutf8n_force
7862 A private implementation of the C<SvPVutf8_force> macro for compilers
7863 which can't cope with complex macro expressions. Always use the macro
7870 Perl_sv_pvutf8n_force(pTHX_ SV *sv, STRLEN *lp)
7872 sv_utf8_upgrade(sv);
7873 return sv_pvn_force(sv,lp);
7877 =for apidoc sv_reftype
7879 Returns a string describing what the SV is a reference to.
7885 Perl_sv_reftype(pTHX_ SV *sv, int ob)
7887 if (ob && SvOBJECT(sv)) {
7888 if (HvNAME(SvSTASH(sv)))
7889 return HvNAME(SvSTASH(sv));
7894 switch (SvTYPE(sv)) {
7911 case SVt_PVLV: return SvROK(sv) ? "REF"
7912 /* tied lvalues should appear to be
7913 * scalars for backwards compatitbility */
7914 : (LvTYPE(sv) == 't' || LvTYPE(sv) == 'T')
7915 ? "SCALAR" : "LVALUE";
7916 case SVt_PVAV: return "ARRAY";
7917 case SVt_PVHV: return "HASH";
7918 case SVt_PVCV: return "CODE";
7919 case SVt_PVGV: return "GLOB";
7920 case SVt_PVFM: return "FORMAT";
7921 case SVt_PVIO: return "IO";
7922 default: return "UNKNOWN";
7928 =for apidoc sv_isobject
7930 Returns a boolean indicating whether the SV is an RV pointing to a blessed
7931 object. If the SV is not an RV, or if the object is not blessed, then this
7938 Perl_sv_isobject(pTHX_ SV *sv)
7955 Returns a boolean indicating whether the SV is blessed into the specified
7956 class. This does not check for subtypes; use C<sv_derived_from> to verify
7957 an inheritance relationship.
7963 Perl_sv_isa(pTHX_ SV *sv, const char *name)
7974 if (!HvNAME(SvSTASH(sv)))
7977 return strEQ(HvNAME(SvSTASH(sv)), name);
7983 Creates a new SV for the RV, C<rv>, to point to. If C<rv> is not an RV then
7984 it will be upgraded to one. If C<classname> is non-null then the new SV will
7985 be blessed in the specified package. The new SV is returned and its
7986 reference count is 1.
7992 Perl_newSVrv(pTHX_ SV *rv, const char *classname)
7998 SV_CHECK_THINKFIRST_COW_DROP(rv);
8001 if (SvTYPE(rv) >= SVt_PVMG) {
8002 U32 refcnt = SvREFCNT(rv);
8006 SvREFCNT(rv) = refcnt;
8009 if (SvTYPE(rv) < SVt_RV)
8010 sv_upgrade(rv, SVt_RV);
8011 else if (SvTYPE(rv) > SVt_RV) {
8012 (void)SvOOK_off(rv);
8013 if (SvPVX(rv) && SvLEN(rv))
8014 Safefree(SvPVX(rv));
8024 HV* stash = gv_stashpv(classname, TRUE);
8025 (void)sv_bless(rv, stash);
8031 =for apidoc sv_setref_pv
8033 Copies a pointer into a new SV, optionally blessing the SV. The C<rv>
8034 argument will be upgraded to an RV. That RV will be modified to point to
8035 the new SV. If the C<pv> argument is NULL then C<PL_sv_undef> will be placed
8036 into the SV. The C<classname> argument indicates the package for the
8037 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
8038 will have a reference count of 1, and the RV will be returned.
8040 Do not use with other Perl types such as HV, AV, SV, CV, because those
8041 objects will become corrupted by the pointer copy process.
8043 Note that C<sv_setref_pvn> copies the string while this copies the pointer.
8049 Perl_sv_setref_pv(pTHX_ SV *rv, const char *classname, void *pv)
8052 sv_setsv(rv, &PL_sv_undef);
8056 sv_setiv(newSVrv(rv,classname), PTR2IV(pv));
8061 =for apidoc sv_setref_iv
8063 Copies an integer into a new SV, optionally blessing the SV. The C<rv>
8064 argument will be upgraded to an RV. That RV will be modified to point to
8065 the new SV. The C<classname> argument indicates the package for the
8066 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
8067 will have a reference count of 1, and the RV will be returned.
8073 Perl_sv_setref_iv(pTHX_ SV *rv, const char *classname, IV iv)
8075 sv_setiv(newSVrv(rv,classname), iv);
8080 =for apidoc sv_setref_uv
8082 Copies an unsigned integer into a new SV, optionally blessing the SV. The C<rv>
8083 argument will be upgraded to an RV. That RV will be modified to point to
8084 the new SV. The C<classname> argument indicates the package for the
8085 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
8086 will have a reference count of 1, and the RV will be returned.
8092 Perl_sv_setref_uv(pTHX_ SV *rv, const char *classname, UV uv)
8094 sv_setuv(newSVrv(rv,classname), uv);
8099 =for apidoc sv_setref_nv
8101 Copies a double into a new SV, optionally blessing the SV. The C<rv>
8102 argument will be upgraded to an RV. That RV will be modified to point to
8103 the new SV. The C<classname> argument indicates the package for the
8104 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
8105 will have a reference count of 1, and the RV will be returned.
8111 Perl_sv_setref_nv(pTHX_ SV *rv, const char *classname, NV nv)
8113 sv_setnv(newSVrv(rv,classname), nv);
8118 =for apidoc sv_setref_pvn
8120 Copies a string into a new SV, optionally blessing the SV. The length of the
8121 string must be specified with C<n>. The C<rv> argument will be upgraded to
8122 an RV. That RV will be modified to point to the new SV. The C<classname>
8123 argument indicates the package for the blessing. Set C<classname> to
8124 C<Nullch> to avoid the blessing. The new SV will have a reference count
8125 of 1, and the RV will be returned.
8127 Note that C<sv_setref_pv> copies the pointer while this copies the string.
8133 Perl_sv_setref_pvn(pTHX_ SV *rv, const char *classname, char *pv, STRLEN n)
8135 sv_setpvn(newSVrv(rv,classname), pv, n);
8140 =for apidoc sv_bless
8142 Blesses an SV into a specified package. The SV must be an RV. The package
8143 must be designated by its stash (see C<gv_stashpv()>). The reference count
8144 of the SV is unaffected.
8150 Perl_sv_bless(pTHX_ SV *sv, HV *stash)
8154 Perl_croak(aTHX_ "Can't bless non-reference value");
8156 if (SvFLAGS(tmpRef) & (SVs_OBJECT|SVf_READONLY)) {
8157 if (SvREADONLY(tmpRef))
8158 Perl_croak(aTHX_ PL_no_modify);
8159 if (SvOBJECT(tmpRef)) {
8160 if (SvTYPE(tmpRef) != SVt_PVIO)
8162 SvREFCNT_dec(SvSTASH(tmpRef));
8165 SvOBJECT_on(tmpRef);
8166 if (SvTYPE(tmpRef) != SVt_PVIO)
8168 (void)SvUPGRADE(tmpRef, SVt_PVMG);
8169 SvSTASH(tmpRef) = (HV*)SvREFCNT_inc(stash);
8176 if(SvSMAGICAL(tmpRef))
8177 if(mg_find(tmpRef, PERL_MAGIC_ext) || mg_find(tmpRef, PERL_MAGIC_uvar))
8185 /* Downgrades a PVGV to a PVMG.
8189 S_sv_unglob(pTHX_ SV *sv)
8193 assert(SvTYPE(sv) == SVt_PVGV);
8198 SvREFCNT_dec(GvSTASH(sv));
8199 GvSTASH(sv) = Nullhv;
8201 sv_unmagic(sv, PERL_MAGIC_glob);
8202 Safefree(GvNAME(sv));
8205 /* need to keep SvANY(sv) in the right arena */
8206 xpvmg = new_XPVMG();
8207 StructCopy(SvANY(sv), xpvmg, XPVMG);
8208 del_XPVGV(SvANY(sv));
8211 SvFLAGS(sv) &= ~SVTYPEMASK;
8212 SvFLAGS(sv) |= SVt_PVMG;
8216 =for apidoc sv_unref_flags
8218 Unsets the RV status of the SV, and decrements the reference count of
8219 whatever was being referenced by the RV. This can almost be thought of
8220 as a reversal of C<newSVrv>. The C<cflags> argument can contain
8221 C<SV_IMMEDIATE_UNREF> to force the reference count to be decremented
8222 (otherwise the decrementing is conditional on the reference count being
8223 different from one or the reference being a readonly SV).
8230 Perl_sv_unref_flags(pTHX_ SV *sv, U32 flags)
8234 if (SvWEAKREF(sv)) {
8242 /* You can't have a || SvREADONLY(rv) here, as $a = $$a, where $a was
8243 assigned to as BEGIN {$a = \"Foo"} will fail. */
8244 if (SvREFCNT(rv) != 1 || (flags & SV_IMMEDIATE_UNREF))
8246 else /* XXX Hack, but hard to make $a=$a->[1] work otherwise */
8247 sv_2mortal(rv); /* Schedule for freeing later */
8251 =for apidoc sv_unref
8253 Unsets the RV status of the SV, and decrements the reference count of
8254 whatever was being referenced by the RV. This can almost be thought of
8255 as a reversal of C<newSVrv>. This is C<sv_unref_flags> with the C<flag>
8256 being zero. See C<SvROK_off>.
8262 Perl_sv_unref(pTHX_ SV *sv)
8264 sv_unref_flags(sv, 0);
8268 =for apidoc sv_taint
8270 Taint an SV. Use C<SvTAINTED_on> instead.
8275 Perl_sv_taint(pTHX_ SV *sv)
8277 sv_magic((sv), Nullsv, PERL_MAGIC_taint, Nullch, 0);
8281 =for apidoc sv_untaint
8283 Untaint an SV. Use C<SvTAINTED_off> instead.
8288 Perl_sv_untaint(pTHX_ SV *sv)
8290 if (SvTYPE(sv) >= SVt_PVMG && SvMAGIC(sv)) {
8291 MAGIC *mg = mg_find(sv, PERL_MAGIC_taint);
8298 =for apidoc sv_tainted
8300 Test an SV for taintedness. Use C<SvTAINTED> instead.
8305 Perl_sv_tainted(pTHX_ SV *sv)
8307 if (SvTYPE(sv) >= SVt_PVMG && SvMAGIC(sv)) {
8308 MAGIC *mg = mg_find(sv, PERL_MAGIC_taint);
8309 if (mg && ((mg->mg_len & 1) || ((mg->mg_len & 2) && mg->mg_obj == sv)))
8316 =for apidoc sv_setpviv
8318 Copies an integer into the given SV, also updating its string value.
8319 Does not handle 'set' magic. See C<sv_setpviv_mg>.
8325 Perl_sv_setpviv(pTHX_ SV *sv, IV iv)
8327 char buf[TYPE_CHARS(UV)];
8329 char *ptr = uiv_2buf(buf, iv, 0, 0, &ebuf);
8331 sv_setpvn(sv, ptr, ebuf - ptr);
8335 =for apidoc sv_setpviv_mg
8337 Like C<sv_setpviv>, but also handles 'set' magic.
8343 Perl_sv_setpviv_mg(pTHX_ SV *sv, IV iv)
8345 char buf[TYPE_CHARS(UV)];
8347 char *ptr = uiv_2buf(buf, iv, 0, 0, &ebuf);
8349 sv_setpvn(sv, ptr, ebuf - ptr);
8353 #if defined(PERL_IMPLICIT_CONTEXT)
8355 /* pTHX_ magic can't cope with varargs, so this is a no-context
8356 * version of the main function, (which may itself be aliased to us).
8357 * Don't access this version directly.
8361 Perl_sv_setpvf_nocontext(SV *sv, const char* pat, ...)
8365 va_start(args, pat);
8366 sv_vsetpvf(sv, pat, &args);
8370 /* pTHX_ magic can't cope with varargs, so this is a no-context
8371 * version of the main function, (which may itself be aliased to us).
8372 * Don't access this version directly.
8376 Perl_sv_setpvf_mg_nocontext(SV *sv, const char* pat, ...)
8380 va_start(args, pat);
8381 sv_vsetpvf_mg(sv, pat, &args);
8387 =for apidoc sv_setpvf
8389 Processes its arguments like C<sprintf> and sets an SV to the formatted
8390 output. Does not handle 'set' magic. See C<sv_setpvf_mg>.
8396 Perl_sv_setpvf(pTHX_ SV *sv, const char* pat, ...)
8399 va_start(args, pat);
8400 sv_vsetpvf(sv, pat, &args);
8404 /* backend for C<sv_setpvf> and C<sv_setpvf_nocontext> */
8407 Perl_sv_vsetpvf(pTHX_ SV *sv, const char* pat, va_list* args)
8409 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
8413 =for apidoc sv_setpvf_mg
8415 Like C<sv_setpvf>, but also handles 'set' magic.
8421 Perl_sv_setpvf_mg(pTHX_ SV *sv, const char* pat, ...)
8424 va_start(args, pat);
8425 sv_vsetpvf_mg(sv, pat, &args);
8429 /* backend for C<sv_setpvf_mg> C<setpvf_mg_nocontext> */
8432 Perl_sv_vsetpvf_mg(pTHX_ SV *sv, const char* pat, va_list* args)
8434 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
8438 #if defined(PERL_IMPLICIT_CONTEXT)
8440 /* pTHX_ magic can't cope with varargs, so this is a no-context
8441 * version of the main function, (which may itself be aliased to us).
8442 * Don't access this version directly.
8446 Perl_sv_catpvf_nocontext(SV *sv, const char* pat, ...)
8450 va_start(args, pat);
8451 sv_vcatpvf(sv, pat, &args);
8455 /* pTHX_ magic can't cope with varargs, so this is a no-context
8456 * version of the main function, (which may itself be aliased to us).
8457 * Don't access this version directly.
8461 Perl_sv_catpvf_mg_nocontext(SV *sv, const char* pat, ...)
8465 va_start(args, pat);
8466 sv_vcatpvf_mg(sv, pat, &args);
8472 =for apidoc sv_catpvf
8474 Processes its arguments like C<sprintf> and appends the formatted
8475 output to an SV. If the appended data contains "wide" characters
8476 (including, but not limited to, SVs with a UTF-8 PV formatted with %s,
8477 and characters >255 formatted with %c), the original SV might get
8478 upgraded to UTF-8. Handles 'get' magic, but not 'set' magic.
8479 C<SvSETMAGIC()> must typically be called after calling this function
8480 to handle 'set' magic.
8485 Perl_sv_catpvf(pTHX_ SV *sv, const char* pat, ...)
8488 va_start(args, pat);
8489 sv_vcatpvf(sv, pat, &args);
8493 /* backend for C<sv_catpvf> and C<catpvf_mg_nocontext> */
8496 Perl_sv_vcatpvf(pTHX_ SV *sv, const char* pat, va_list* args)
8498 sv_vcatpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
8502 =for apidoc sv_catpvf_mg
8504 Like C<sv_catpvf>, but also handles 'set' magic.
8510 Perl_sv_catpvf_mg(pTHX_ SV *sv, const char* pat, ...)
8513 va_start(args, pat);
8514 sv_vcatpvf_mg(sv, pat, &args);
8518 /* backend for C<catpvf_mg> and C<catpvf_mg_nocontext> */
8521 Perl_sv_vcatpvf_mg(pTHX_ SV *sv, const char* pat, va_list* args)
8523 sv_vcatpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
8528 =for apidoc sv_vsetpvfn
8530 Works like C<vcatpvfn> but copies the text into the SV instead of
8533 Usually used via one of its frontends C<sv_setpvf> and C<sv_setpvf_mg>.
8539 Perl_sv_vsetpvfn(pTHX_ SV *sv, const char *pat, STRLEN patlen, va_list *args, SV **svargs, I32 svmax, bool *maybe_tainted)
8541 sv_setpvn(sv, "", 0);
8542 sv_vcatpvfn(sv, pat, patlen, args, svargs, svmax, maybe_tainted);
8545 /* private function for use in sv_vcatpvfn via the EXPECT_NUMBER macro */
8548 S_expect_number(pTHX_ char** pattern)
8551 switch (**pattern) {
8552 case '1': case '2': case '3':
8553 case '4': case '5': case '6':
8554 case '7': case '8': case '9':
8555 while (isDIGIT(**pattern))
8556 var = var * 10 + (*(*pattern)++ - '0');
8560 #define EXPECT_NUMBER(pattern, var) (var = S_expect_number(aTHX_ &pattern))
8563 F0convert(NV nv, char *endbuf, STRLEN *len)
8574 if (uv & 1 && uv == nv)
8575 uv--; /* Round to even */
8577 unsigned dig = uv % 10;
8590 =for apidoc sv_vcatpvfn
8592 Processes its arguments like C<vsprintf> and appends the formatted output
8593 to an SV. Uses an array of SVs if the C style variable argument list is
8594 missing (NULL). When running with taint checks enabled, indicates via
8595 C<maybe_tainted> if results are untrustworthy (often due to the use of
8598 Usually used via one of its frontends C<sv_catpvf> and C<sv_catpvf_mg>.
8604 Perl_sv_vcatpvfn(pTHX_ SV *sv, const char *pat, STRLEN patlen, va_list *args, SV **svargs, I32 svmax, bool *maybe_tainted)
8611 static char nullstr[] = "(null)";
8613 bool has_utf8; /* has the result utf8? */
8614 bool pat_utf8; /* the pattern is in utf8? */
8616 /* Times 4: a decimal digit takes more than 3 binary digits.
8617 * NV_DIG: mantissa takes than many decimal digits.
8618 * Plus 32: Playing safe. */
8619 char ebuf[IV_DIG * 4 + NV_DIG + 32];
8620 /* large enough for "%#.#f" --chip */
8621 /* what about long double NVs? --jhi */
8623 has_utf8 = pat_utf8 = DO_UTF8(sv);
8625 /* no matter what, this is a string now */
8626 (void)SvPV_force(sv, origlen);
8628 /* special-case "", "%s", and "%_" */
8631 if (patlen == 2 && pat[0] == '%') {
8635 char *s = va_arg(*args, char*);
8636 sv_catpv(sv, s ? s : nullstr);
8638 else if (svix < svmax) {
8639 sv_catsv(sv, *svargs);
8640 if (DO_UTF8(*svargs))
8646 argsv = va_arg(*args, SV*);
8647 sv_catsv(sv, argsv);
8652 /* See comment on '_' below */
8657 #ifndef USE_LONG_DOUBLE
8658 /* special-case "%.<number>[gf]" */
8659 if ( patlen <= 5 && pat[0] == '%' && pat[1] == '.'
8660 && (pat[patlen-1] == 'g' || pat[patlen-1] == 'f') ) {
8661 unsigned digits = 0;
8665 while (*pp >= '0' && *pp <= '9')
8666 digits = 10 * digits + (*pp++ - '0');
8667 if (pp - pat == (int)patlen - 1) {
8671 nv = (NV)va_arg(*args, double);
8672 else if (svix < svmax)
8677 /* Add check for digits != 0 because it seems that some
8678 gconverts are buggy in this case, and we don't yet have
8679 a Configure test for this. */
8680 if (digits && digits < sizeof(ebuf) - NV_DIG - 10) {
8681 /* 0, point, slack */
8682 Gconvert(nv, (int)digits, 0, ebuf);
8684 if (*ebuf) /* May return an empty string for digits==0 */
8687 } else if (!digits) {
8690 if ((p = F0convert(nv, ebuf + sizeof ebuf, &l))) {
8691 sv_catpvn(sv, p, l);
8697 #endif /* !USE_LONG_DOUBLE */
8699 if (!args && svix < svmax && DO_UTF8(*svargs))
8702 patend = (char*)pat + patlen;
8703 for (p = (char*)pat; p < patend; p = q) {
8706 bool vectorize = FALSE;
8707 bool vectorarg = FALSE;
8708 bool vec_utf8 = FALSE;
8714 bool has_precis = FALSE;
8717 bool is_utf8 = FALSE; /* is this item utf8? */
8718 #ifdef HAS_LDBL_SPRINTF_BUG
8719 /* This is to try to fix a bug with irix/nonstop-ux/powerux and
8720 with sfio - Allen <allens@cpan.org> */
8721 bool fix_ldbl_sprintf_bug = FALSE;
8725 U8 utf8buf[UTF8_MAXLEN+1];
8726 STRLEN esignlen = 0;
8728 char *eptr = Nullch;
8731 U8 *vecstr = Null(U8*);
8738 /* we need a long double target in case HAS_LONG_DOUBLE but
8741 #if defined(HAS_LONG_DOUBLE) && LONG_DOUBLESIZE > DOUBLESIZE
8750 STRLEN dotstrlen = 1;
8751 I32 efix = 0; /* explicit format parameter index */
8752 I32 ewix = 0; /* explicit width index */
8753 I32 epix = 0; /* explicit precision index */
8754 I32 evix = 0; /* explicit vector index */
8755 bool asterisk = FALSE;
8757 /* echo everything up to the next format specification */
8758 for (q = p; q < patend && *q != '%'; ++q) ;
8760 if (has_utf8 && !pat_utf8)
8761 sv_catpvn_utf8_upgrade(sv, p, q - p, nsv);
8763 sv_catpvn(sv, p, q - p);
8770 We allow format specification elements in this order:
8771 \d+\$ explicit format parameter index
8773 v|\*(\d+\$)?v vector with optional (optionally specified) arg
8774 0 flag (as above): repeated to allow "v02"
8775 \d+|\*(\d+\$)? width using optional (optionally specified) arg
8776 \.(\d*|\*(\d+\$)?) precision using optional (optionally specified) arg
8778 [%bcdefginopsux_DFOUX] format (mandatory)
8780 if (EXPECT_NUMBER(q, width)) {
8821 if (EXPECT_NUMBER(q, ewix))
8830 if ((vectorarg = asterisk)) {
8842 EXPECT_NUMBER(q, width);
8847 vecsv = va_arg(*args, SV*);
8849 vecsv = (evix ? evix <= svmax : svix < svmax) ?
8850 svargs[evix ? evix-1 : svix++] : &PL_sv_undef;
8851 dotstr = SvPVx(vecsv, dotstrlen);
8856 vecsv = va_arg(*args, SV*);
8857 vecstr = (U8*)SvPVx(vecsv,veclen);
8858 vec_utf8 = DO_UTF8(vecsv);
8860 else if (efix ? efix <= svmax : svix < svmax) {
8861 vecsv = svargs[efix ? efix-1 : svix++];
8862 vecstr = (U8*)SvPVx(vecsv,veclen);
8863 vec_utf8 = DO_UTF8(vecsv);
8873 i = va_arg(*args, int);
8875 i = (ewix ? ewix <= svmax : svix < svmax) ?
8876 SvIVx(svargs[ewix ? ewix-1 : svix++]) : 0;
8878 width = (i < 0) ? -i : i;
8888 if (EXPECT_NUMBER(q, epix) && *q++ != '$')
8890 /* XXX: todo, support specified precision parameter */
8894 i = va_arg(*args, int);
8896 i = (ewix ? ewix <= svmax : svix < svmax)
8897 ? SvIVx(svargs[ewix ? ewix-1 : svix++]) : 0;
8898 precis = (i < 0) ? 0 : i;
8903 precis = precis * 10 + (*q++ - '0');
8912 case 'I': /* Ix, I32x, and I64x */
8914 if (q[1] == '6' && q[2] == '4') {
8920 if (q[1] == '3' && q[2] == '2') {
8930 #if defined(HAS_QUAD) || defined(HAS_LONG_DOUBLE)
8941 #if defined(HAS_QUAD) || defined(HAS_LONG_DOUBLE)
8942 if (*(q + 1) == 'l') { /* lld, llf */
8967 argsv = (efix ? efix <= svmax : svix < svmax) ?
8968 svargs[efix ? efix-1 : svix++] : &PL_sv_undef;
8975 uv = (args && !vectorize) ? va_arg(*args, int) : SvIVx(argsv);
8977 (!UNI_IS_INVARIANT(uv) && SvUTF8(sv)))
8979 eptr = (char*)utf8buf;
8980 elen = uvchr_to_utf8((U8*)eptr, uv) - utf8buf;
8991 if (args && !vectorize) {
8992 eptr = va_arg(*args, char*);
8994 #ifdef MACOS_TRADITIONAL
8995 /* On MacOS, %#s format is used for Pascal strings */
9000 elen = strlen(eptr);
9003 elen = sizeof nullstr - 1;
9007 eptr = SvPVx(argsv, elen);
9008 if (DO_UTF8(argsv)) {
9009 if (has_precis && precis < elen) {
9011 sv_pos_u2b(argsv, &p, 0); /* sticks at end */
9014 if (width) { /* fudge width (can't fudge elen) */
9015 width += elen - sv_len_utf8(argsv);
9024 * The "%_" hack might have to be changed someday,
9025 * if ISO or ANSI decide to use '_' for something.
9026 * So we keep it hidden from users' code.
9028 if (!args || vectorize)
9030 argsv = va_arg(*args, SV*);
9031 eptr = SvPVx(argsv, elen);
9037 if (has_precis && elen > precis)
9044 if (alt || vectorize)
9046 uv = PTR2UV(args ? va_arg(*args, void*) : argsv);
9064 uv = utf8n_to_uvchr(vecstr, veclen, &ulen,
9073 esignbuf[esignlen++] = plus;
9077 case 'h': iv = (short)va_arg(*args, int); break;
9078 case 'l': iv = va_arg(*args, long); break;
9079 case 'V': iv = va_arg(*args, IV); break;
9080 default: iv = va_arg(*args, int); break;
9082 case 'q': iv = va_arg(*args, Quad_t); break;
9087 IV tiv = SvIVx(argsv); /* work around GCC bug #13488 */
9089 case 'h': iv = (short)tiv; break;
9090 case 'l': iv = (long)tiv; break;
9092 default: iv = tiv; break;
9094 case 'q': iv = (Quad_t)tiv; break;
9098 if ( !vectorize ) /* we already set uv above */
9103 esignbuf[esignlen++] = plus;
9107 esignbuf[esignlen++] = '-';
9150 uv = utf8n_to_uvchr(vecstr, veclen, &ulen,
9161 case 'h': uv = (unsigned short)va_arg(*args, unsigned); break;
9162 case 'l': uv = va_arg(*args, unsigned long); break;
9163 case 'V': uv = va_arg(*args, UV); break;
9164 default: uv = va_arg(*args, unsigned); break;
9166 case 'q': uv = va_arg(*args, Uquad_t); break;
9171 UV tuv = SvUVx(argsv); /* work around GCC bug #13488 */
9173 case 'h': uv = (unsigned short)tuv; break;
9174 case 'l': uv = (unsigned long)tuv; break;
9176 default: uv = tuv; break;
9178 case 'q': uv = (Uquad_t)tuv; break;
9184 eptr = ebuf + sizeof ebuf;
9190 p = (char*)((c == 'X')
9191 ? "0123456789ABCDEF" : "0123456789abcdef");
9197 esignbuf[esignlen++] = '0';
9198 esignbuf[esignlen++] = c; /* 'x' or 'X' */
9204 *--eptr = '0' + dig;
9206 if (alt && *eptr != '0')
9212 *--eptr = '0' + dig;
9215 esignbuf[esignlen++] = '0';
9216 esignbuf[esignlen++] = 'b';
9219 default: /* it had better be ten or less */
9220 #if defined(PERL_Y2KWARN)
9221 if (ckWARN(WARN_Y2K)) {
9223 char *s = SvPV(sv,n);
9224 if (n >= 2 && s[n-2] == '1' && s[n-1] == '9'
9225 && (n == 2 || !isDIGIT(s[n-3])))
9227 Perl_warner(aTHX_ packWARN(WARN_Y2K),
9228 "Possible Y2K bug: %%%c %s",
9229 c, "format string following '19'");
9235 *--eptr = '0' + dig;
9236 } while (uv /= base);
9239 elen = (ebuf + sizeof ebuf) - eptr;
9242 zeros = precis - elen;
9243 else if (precis == 0 && elen == 1 && *eptr == '0')
9248 /* FLOATING POINT */
9251 c = 'f'; /* maybe %F isn't supported here */
9257 /* This is evil, but floating point is even more evil */
9259 /* for SV-style calling, we can only get NV
9260 for C-style calling, we assume %f is double;
9261 for simplicity we allow any of %Lf, %llf, %qf for long double
9265 #if defined(USE_LONG_DOUBLE)
9269 /* [perl #20339] - we should accept and ignore %lf rather than die */
9273 #if defined(USE_LONG_DOUBLE)
9274 intsize = args ? 0 : 'q';
9278 #if defined(HAS_LONG_DOUBLE)
9287 /* now we need (long double) if intsize == 'q', else (double) */
9288 nv = (args && !vectorize) ?
9289 #if LONG_DOUBLESIZE > DOUBLESIZE
9291 va_arg(*args, long double) :
9292 va_arg(*args, double)
9294 va_arg(*args, double)
9300 if (c != 'e' && c != 'E') {
9302 /* FIXME: if HAS_LONG_DOUBLE but not USE_LONG_DOUBLE this
9303 will cast our (long double) to (double) */
9304 (void)Perl_frexp(nv, &i);
9305 if (i == PERL_INT_MIN)
9306 Perl_die(aTHX_ "panic: frexp");
9308 need = BIT_DIGITS(i);
9310 need += has_precis ? precis : 6; /* known default */
9315 #ifdef HAS_LDBL_SPRINTF_BUG
9316 /* This is to try to fix a bug with irix/nonstop-ux/powerux and
9317 with sfio - Allen <allens@cpan.org> */
9320 # define MY_DBL_MAX DBL_MAX
9321 # else /* XXX guessing! HUGE_VAL may be defined as infinity, so not using */
9322 # if DOUBLESIZE >= 8
9323 # define MY_DBL_MAX 1.7976931348623157E+308L
9325 # define MY_DBL_MAX 3.40282347E+38L
9329 # ifdef HAS_LDBL_SPRINTF_BUG_LESS1 /* only between -1L & 1L - Allen */
9330 # define MY_DBL_MAX_BUG 1L
9332 # define MY_DBL_MAX_BUG MY_DBL_MAX
9336 # define MY_DBL_MIN DBL_MIN
9337 # else /* XXX guessing! -Allen */
9338 # if DOUBLESIZE >= 8
9339 # define MY_DBL_MIN 2.2250738585072014E-308L
9341 # define MY_DBL_MIN 1.17549435E-38L
9345 if ((intsize == 'q') && (c == 'f') &&
9346 ((nv < MY_DBL_MAX_BUG) && (nv > -MY_DBL_MAX_BUG)) &&
9348 /* it's going to be short enough that
9349 * long double precision is not needed */
9351 if ((nv <= 0L) && (nv >= -0L))
9352 fix_ldbl_sprintf_bug = TRUE; /* 0 is 0 - easiest */
9354 /* would use Perl_fp_class as a double-check but not
9355 * functional on IRIX - see perl.h comments */
9357 if ((nv >= MY_DBL_MIN) || (nv <= -MY_DBL_MIN)) {
9358 /* It's within the range that a double can represent */
9359 #if defined(DBL_MAX) && !defined(DBL_MIN)
9360 if ((nv >= ((long double)1/DBL_MAX)) ||
9361 (nv <= (-(long double)1/DBL_MAX)))
9363 fix_ldbl_sprintf_bug = TRUE;
9366 if (fix_ldbl_sprintf_bug == TRUE) {
9376 # undef MY_DBL_MAX_BUG
9379 #endif /* HAS_LDBL_SPRINTF_BUG */
9381 need += 20; /* fudge factor */
9382 if (PL_efloatsize < need) {
9383 Safefree(PL_efloatbuf);
9384 PL_efloatsize = need + 20; /* more fudge */
9385 New(906, PL_efloatbuf, PL_efloatsize, char);
9386 PL_efloatbuf[0] = '\0';
9389 if ( !(width || left || plus || alt) && fill != '0'
9390 && has_precis && intsize != 'q' ) { /* Shortcuts */
9391 /* See earlier comment about buggy Gconvert when digits,
9393 if ( c == 'g' && precis) {
9394 Gconvert((NV)nv, (int)precis, 0, PL_efloatbuf);
9395 if (*PL_efloatbuf) /* May return an empty string for digits==0 */
9396 goto float_converted;
9397 } else if ( c == 'f' && !precis) {
9398 if ((eptr = F0convert(nv, ebuf + sizeof ebuf, &elen)))
9402 eptr = ebuf + sizeof ebuf;
9405 /* FIXME: what to do if HAS_LONG_DOUBLE but not PERL_PRIfldbl? */
9406 #if defined(HAS_LONG_DOUBLE) && defined(PERL_PRIfldbl)
9407 if (intsize == 'q') {
9408 /* Copy the one or more characters in a long double
9409 * format before the 'base' ([efgEFG]) character to
9410 * the format string. */
9411 static char const prifldbl[] = PERL_PRIfldbl;
9412 char const *p = prifldbl + sizeof(prifldbl) - 3;
9413 while (p >= prifldbl) { *--eptr = *p--; }
9418 do { *--eptr = '0' + (base % 10); } while (base /= 10);
9423 do { *--eptr = '0' + (base % 10); } while (base /= 10);
9435 /* No taint. Otherwise we are in the strange situation
9436 * where printf() taints but print($float) doesn't.
9438 #if defined(HAS_LONG_DOUBLE)
9440 (void)sprintf(PL_efloatbuf, eptr, nv);
9442 (void)sprintf(PL_efloatbuf, eptr, (double)nv);
9444 (void)sprintf(PL_efloatbuf, eptr, nv);
9447 eptr = PL_efloatbuf;
9448 elen = strlen(PL_efloatbuf);
9454 i = SvCUR(sv) - origlen;
9455 if (args && !vectorize) {
9457 case 'h': *(va_arg(*args, short*)) = i; break;
9458 default: *(va_arg(*args, int*)) = i; break;
9459 case 'l': *(va_arg(*args, long*)) = i; break;
9460 case 'V': *(va_arg(*args, IV*)) = i; break;
9462 case 'q': *(va_arg(*args, Quad_t*)) = i; break;
9467 sv_setuv_mg(argsv, (UV)i);
9469 continue; /* not "break" */
9475 if (!args && ckWARN(WARN_PRINTF) &&
9476 (PL_op->op_type == OP_PRTF || PL_op->op_type == OP_SPRINTF)) {
9477 SV *msg = sv_newmortal();
9478 Perl_sv_setpvf(aTHX_ msg, "Invalid conversion in %sprintf: ",
9479 (PL_op->op_type == OP_PRTF) ? "" : "s");
9482 Perl_sv_catpvf(aTHX_ msg,
9483 "\"%%%c\"", c & 0xFF);
9485 Perl_sv_catpvf(aTHX_ msg,
9486 "\"%%\\%03"UVof"\"",
9489 sv_catpv(msg, "end of string");
9490 Perl_warner(aTHX_ packWARN(WARN_PRINTF), "%"SVf, msg); /* yes, this is reentrant */
9493 /* output mangled stuff ... */
9499 /* ... right here, because formatting flags should not apply */
9500 SvGROW(sv, SvCUR(sv) + elen + 1);
9502 Copy(eptr, p, elen, char);
9505 SvCUR(sv) = p - SvPVX(sv);
9507 continue; /* not "break" */
9510 /* calculate width before utf8_upgrade changes it */
9511 have = esignlen + zeros + elen;
9513 if (is_utf8 != has_utf8) {
9516 sv_utf8_upgrade(sv);
9519 SV *nsv = sv_2mortal(newSVpvn(eptr, elen));
9520 sv_utf8_upgrade(nsv);
9524 SvGROW(sv, SvCUR(sv) + elen + 1);
9528 /* Use memchr() instead of strchr(), as eptr is not guaranteed */
9529 /* to point to a null-terminated string. */
9530 if (left && ckWARN(WARN_PRINTF) && memchr(eptr, '\n', elen) &&
9531 (PL_op->op_type == OP_PRTF || PL_op->op_type == OP_SPRINTF))
9532 Perl_warner(aTHX_ packWARN(WARN_PRINTF),
9533 "Newline in left-justified string for %sprintf",
9534 (PL_op->op_type == OP_PRTF) ? "" : "s");
9536 need = (have > width ? have : width);
9539 SvGROW(sv, SvCUR(sv) + need + dotstrlen + 1);
9541 if (esignlen && fill == '0') {
9542 for (i = 0; i < (int)esignlen; i++)
9546 memset(p, fill, gap);
9549 if (esignlen && fill != '0') {
9550 for (i = 0; i < (int)esignlen; i++)
9554 for (i = zeros; i; i--)
9558 Copy(eptr, p, elen, char);
9562 memset(p, ' ', gap);
9567 Copy(dotstr, p, dotstrlen, char);
9571 vectorize = FALSE; /* done iterating over vecstr */
9578 SvCUR(sv) = p - SvPVX(sv);
9586 /* =========================================================================
9588 =head1 Cloning an interpreter
9590 All the macros and functions in this section are for the private use of
9591 the main function, perl_clone().
9593 The foo_dup() functions make an exact copy of an existing foo thinngy.
9594 During the course of a cloning, a hash table is used to map old addresses
9595 to new addresses. The table is created and manipulated with the
9596 ptr_table_* functions.
9600 ============================================================================*/
9603 #if defined(USE_ITHREADS)
9605 #ifndef GpREFCNT_inc
9606 # define GpREFCNT_inc(gp) ((gp) ? (++(gp)->gp_refcnt, (gp)) : (GP*)NULL)
9610 #define sv_dup_inc(s,t) SvREFCNT_inc(sv_dup(s,t))
9611 #define av_dup(s,t) (AV*)sv_dup((SV*)s,t)
9612 #define av_dup_inc(s,t) (AV*)SvREFCNT_inc(sv_dup((SV*)s,t))
9613 #define hv_dup(s,t) (HV*)sv_dup((SV*)s,t)
9614 #define hv_dup_inc(s,t) (HV*)SvREFCNT_inc(sv_dup((SV*)s,t))
9615 #define cv_dup(s,t) (CV*)sv_dup((SV*)s,t)
9616 #define cv_dup_inc(s,t) (CV*)SvREFCNT_inc(sv_dup((SV*)s,t))
9617 #define io_dup(s,t) (IO*)sv_dup((SV*)s,t)
9618 #define io_dup_inc(s,t) (IO*)SvREFCNT_inc(sv_dup((SV*)s,t))
9619 #define gv_dup(s,t) (GV*)sv_dup((SV*)s,t)
9620 #define gv_dup_inc(s,t) (GV*)SvREFCNT_inc(sv_dup((SV*)s,t))
9621 #define SAVEPV(p) (p ? savepv(p) : Nullch)
9622 #define SAVEPVN(p,n) (p ? savepvn(p,n) : Nullch)
9625 /* Duplicate a regexp. Required reading: pregcomp() and pregfree() in
9626 regcomp.c. AMS 20010712 */
9629 Perl_re_dup(pTHX_ REGEXP *r, CLONE_PARAMS *param)
9633 struct reg_substr_datum *s;
9636 return (REGEXP *)NULL;
9638 if ((ret = (REGEXP *)ptr_table_fetch(PL_ptr_table, r)))
9641 len = r->offsets[0];
9642 npar = r->nparens+1;
9644 Newc(0, ret, sizeof(regexp) + (len+1)*sizeof(regnode), char, regexp);
9645 Copy(r->program, ret->program, len+1, regnode);
9647 New(0, ret->startp, npar, I32);
9648 Copy(r->startp, ret->startp, npar, I32);
9649 New(0, ret->endp, npar, I32);
9650 Copy(r->startp, ret->startp, npar, I32);
9652 New(0, ret->substrs, 1, struct reg_substr_data);
9653 for (s = ret->substrs->data, i = 0; i < 3; i++, s++) {
9654 s->min_offset = r->substrs->data[i].min_offset;
9655 s->max_offset = r->substrs->data[i].max_offset;
9656 s->substr = sv_dup_inc(r->substrs->data[i].substr, param);
9657 s->utf8_substr = sv_dup_inc(r->substrs->data[i].utf8_substr, param);
9660 ret->regstclass = NULL;
9663 int count = r->data->count;
9665 Newc(0, d, sizeof(struct reg_data) + count*sizeof(void *),
9666 char, struct reg_data);
9667 New(0, d->what, count, U8);
9670 for (i = 0; i < count; i++) {
9671 d->what[i] = r->data->what[i];
9672 switch (d->what[i]) {
9674 d->data[i] = sv_dup_inc((SV *)r->data->data[i], param);
9677 d->data[i] = av_dup_inc((AV *)r->data->data[i], param);
9680 /* This is cheating. */
9681 New(0, d->data[i], 1, struct regnode_charclass_class);
9682 StructCopy(r->data->data[i], d->data[i],
9683 struct regnode_charclass_class);
9684 ret->regstclass = (regnode*)d->data[i];
9687 /* Compiled op trees are readonly, and can thus be
9688 shared without duplication. */
9689 d->data[i] = (void*)OpREFCNT_inc((OP*)r->data->data[i]);
9692 d->data[i] = r->data->data[i];
9702 New(0, ret->offsets, 2*len+1, U32);
9703 Copy(r->offsets, ret->offsets, 2*len+1, U32);
9705 ret->precomp = SAVEPV(r->precomp);
9706 ret->refcnt = r->refcnt;
9707 ret->minlen = r->minlen;
9708 ret->prelen = r->prelen;
9709 ret->nparens = r->nparens;
9710 ret->lastparen = r->lastparen;
9711 ret->lastcloseparen = r->lastcloseparen;
9712 ret->reganch = r->reganch;
9714 ret->sublen = r->sublen;
9716 if (RX_MATCH_COPIED(ret))
9717 ret->subbeg = SAVEPV(r->subbeg);
9719 ret->subbeg = Nullch;
9720 #ifdef PERL_COPY_ON_WRITE
9721 ret->saved_copy = Nullsv;
9724 ptr_table_store(PL_ptr_table, r, ret);
9728 /* duplicate a file handle */
9731 Perl_fp_dup(pTHX_ PerlIO *fp, char type, CLONE_PARAMS *param)
9735 return (PerlIO*)NULL;
9737 /* look for it in the table first */
9738 ret = (PerlIO*)ptr_table_fetch(PL_ptr_table, fp);
9742 /* create anew and remember what it is */
9743 ret = PerlIO_fdupopen(aTHX_ fp, param, PERLIO_DUP_CLONE);
9744 ptr_table_store(PL_ptr_table, fp, ret);
9748 /* duplicate a directory handle */
9751 Perl_dirp_dup(pTHX_ DIR *dp)
9759 /* duplicate a typeglob */
9762 Perl_gp_dup(pTHX_ GP *gp, CLONE_PARAMS* param)
9767 /* look for it in the table first */
9768 ret = (GP*)ptr_table_fetch(PL_ptr_table, gp);
9772 /* create anew and remember what it is */
9773 Newz(0, ret, 1, GP);
9774 ptr_table_store(PL_ptr_table, gp, ret);
9777 ret->gp_refcnt = 0; /* must be before any other dups! */
9778 ret->gp_sv = sv_dup_inc(gp->gp_sv, param);
9779 ret->gp_io = io_dup_inc(gp->gp_io, param);
9780 ret->gp_form = cv_dup_inc(gp->gp_form, param);
9781 ret->gp_av = av_dup_inc(gp->gp_av, param);
9782 ret->gp_hv = hv_dup_inc(gp->gp_hv, param);
9783 ret->gp_egv = gv_dup(gp->gp_egv, param);/* GvEGV is not refcounted */
9784 ret->gp_cv = cv_dup_inc(gp->gp_cv, param);
9785 ret->gp_cvgen = gp->gp_cvgen;
9786 ret->gp_flags = gp->gp_flags;
9787 ret->gp_line = gp->gp_line;
9788 ret->gp_file = gp->gp_file; /* points to COP.cop_file */
9792 /* duplicate a chain of magic */
9795 Perl_mg_dup(pTHX_ MAGIC *mg, CLONE_PARAMS* param)
9797 MAGIC *mgprev = (MAGIC*)NULL;
9800 return (MAGIC*)NULL;
9801 /* look for it in the table first */
9802 mgret = (MAGIC*)ptr_table_fetch(PL_ptr_table, mg);
9806 for (; mg; mg = mg->mg_moremagic) {
9808 Newz(0, nmg, 1, MAGIC);
9810 mgprev->mg_moremagic = nmg;
9813 nmg->mg_virtual = mg->mg_virtual; /* XXX copy dynamic vtable? */
9814 nmg->mg_private = mg->mg_private;
9815 nmg->mg_type = mg->mg_type;
9816 nmg->mg_flags = mg->mg_flags;
9817 if (mg->mg_type == PERL_MAGIC_qr) {
9818 nmg->mg_obj = (SV*)re_dup((REGEXP*)mg->mg_obj, param);
9820 else if(mg->mg_type == PERL_MAGIC_backref) {
9821 AV *av = (AV*) mg->mg_obj;
9824 SvREFCNT_inc(nmg->mg_obj = (SV*)newAV());
9826 for (i = AvFILLp(av); i >= 0; i--) {
9827 if (!svp[i]) continue;
9828 av_push((AV*)nmg->mg_obj,sv_dup(svp[i],param));
9832 nmg->mg_obj = (mg->mg_flags & MGf_REFCOUNTED)
9833 ? sv_dup_inc(mg->mg_obj, param)
9834 : sv_dup(mg->mg_obj, param);
9836 nmg->mg_len = mg->mg_len;
9837 nmg->mg_ptr = mg->mg_ptr; /* XXX random ptr? */
9838 if (mg->mg_ptr && mg->mg_type != PERL_MAGIC_regex_global) {
9839 if (mg->mg_len > 0) {
9840 nmg->mg_ptr = SAVEPVN(mg->mg_ptr, mg->mg_len);
9841 if (mg->mg_type == PERL_MAGIC_overload_table &&
9842 AMT_AMAGIC((AMT*)mg->mg_ptr))
9844 AMT *amtp = (AMT*)mg->mg_ptr;
9845 AMT *namtp = (AMT*)nmg->mg_ptr;
9847 for (i = 1; i < NofAMmeth; i++) {
9848 namtp->table[i] = cv_dup_inc(amtp->table[i], param);
9852 else if (mg->mg_len == HEf_SVKEY)
9853 nmg->mg_ptr = (char*)sv_dup_inc((SV*)mg->mg_ptr, param);
9855 if ((mg->mg_flags & MGf_DUP) && mg->mg_virtual && mg->mg_virtual->svt_dup) {
9856 CALL_FPTR(nmg->mg_virtual->svt_dup)(aTHX_ nmg, param);
9863 /* create a new pointer-mapping table */
9866 Perl_ptr_table_new(pTHX)
9869 Newz(0, tbl, 1, PTR_TBL_t);
9872 Newz(0, tbl->tbl_ary, tbl->tbl_max + 1, PTR_TBL_ENT_t*);
9876 /* map an existing pointer using a table */
9879 Perl_ptr_table_fetch(pTHX_ PTR_TBL_t *tbl, void *sv)
9881 PTR_TBL_ENT_t *tblent;
9882 UV hash = PTR2UV(sv);
9884 tblent = tbl->tbl_ary[hash & tbl->tbl_max];
9885 for (; tblent; tblent = tblent->next) {
9886 if (tblent->oldval == sv)
9887 return tblent->newval;
9892 /* add a new entry to a pointer-mapping table */
9895 Perl_ptr_table_store(pTHX_ PTR_TBL_t *tbl, void *oldv, void *newv)
9897 PTR_TBL_ENT_t *tblent, **otblent;
9898 /* XXX this may be pessimal on platforms where pointers aren't good
9899 * hash values e.g. if they grow faster in the most significant
9901 UV hash = PTR2UV(oldv);
9905 otblent = &tbl->tbl_ary[hash & tbl->tbl_max];
9906 for (tblent = *otblent; tblent; i=0, tblent = tblent->next) {
9907 if (tblent->oldval == oldv) {
9908 tblent->newval = newv;
9912 Newz(0, tblent, 1, PTR_TBL_ENT_t);
9913 tblent->oldval = oldv;
9914 tblent->newval = newv;
9915 tblent->next = *otblent;
9918 if (i && tbl->tbl_items > tbl->tbl_max)
9919 ptr_table_split(tbl);
9922 /* double the hash bucket size of an existing ptr table */
9925 Perl_ptr_table_split(pTHX_ PTR_TBL_t *tbl)
9927 PTR_TBL_ENT_t **ary = tbl->tbl_ary;
9928 UV oldsize = tbl->tbl_max + 1;
9929 UV newsize = oldsize * 2;
9932 Renew(ary, newsize, PTR_TBL_ENT_t*);
9933 Zero(&ary[oldsize], newsize-oldsize, PTR_TBL_ENT_t*);
9934 tbl->tbl_max = --newsize;
9936 for (i=0; i < oldsize; i++, ary++) {
9937 PTR_TBL_ENT_t **curentp, **entp, *ent;
9940 curentp = ary + oldsize;
9941 for (entp = ary, ent = *ary; ent; ent = *entp) {
9942 if ((newsize & PTR2UV(ent->oldval)) != i) {
9944 ent->next = *curentp;
9954 /* remove all the entries from a ptr table */
9957 Perl_ptr_table_clear(pTHX_ PTR_TBL_t *tbl)
9959 register PTR_TBL_ENT_t **array;
9960 register PTR_TBL_ENT_t *entry;
9961 register PTR_TBL_ENT_t *oentry = Null(PTR_TBL_ENT_t*);
9965 if (!tbl || !tbl->tbl_items) {
9969 array = tbl->tbl_ary;
9976 entry = entry->next;
9980 if (++riter > max) {
9983 entry = array[riter];
9990 /* clear and free a ptr table */
9993 Perl_ptr_table_free(pTHX_ PTR_TBL_t *tbl)
9998 ptr_table_clear(tbl);
9999 Safefree(tbl->tbl_ary);
10004 char *PL_watch_pvx;
10007 /* attempt to make everything in the typeglob readonly */
10010 S_gv_share(pTHX_ SV *sstr, CLONE_PARAMS *param)
10012 GV *gv = (GV*)sstr;
10013 SV *sv = ¶m->proto_perl->Isv_no; /* just need SvREADONLY-ness */
10015 if (GvIO(gv) || GvFORM(gv)) {
10016 GvUNIQUE_off(gv); /* GvIOs cannot be shared. nor can GvFORMs */
10018 else if (!GvCV(gv)) {
10019 GvCV(gv) = (CV*)sv;
10022 /* CvPADLISTs cannot be shared */
10023 if (!SvREADONLY(GvCV(gv)) && !CvXSUB(GvCV(gv))) {
10028 if (!GvUNIQUE(gv)) {
10030 PerlIO_printf(Perl_debug_log, "gv_share: unable to share %s::%s\n",
10031 HvNAME(GvSTASH(gv)), GvNAME(gv));
10037 * write attempts will die with
10038 * "Modification of a read-only value attempted"
10044 SvREADONLY_on(GvSV(gv));
10048 GvAV(gv) = (AV*)sv;
10051 SvREADONLY_on(GvAV(gv));
10055 GvHV(gv) = (HV*)sv;
10058 SvREADONLY_on(GvHV(gv));
10061 return sstr; /* he_dup() will SvREFCNT_inc() */
10064 /* duplicate an SV of any type (including AV, HV etc) */
10067 Perl_rvpv_dup(pTHX_ SV *dstr, SV *sstr, CLONE_PARAMS* param)
10070 SvRV(dstr) = SvWEAKREF(sstr)
10071 ? sv_dup(SvRV(sstr), param)
10072 : sv_dup_inc(SvRV(sstr), param);
10074 else if (SvPVX(sstr)) {
10075 /* Has something there */
10077 /* Normal PV - clone whole allocated space */
10078 SvPVX(dstr) = SAVEPVN(SvPVX(sstr), SvLEN(sstr)-1);
10079 if (SvREADONLY(sstr) && SvFAKE(sstr)) {
10080 /* Not that normal - actually sstr is copy on write.
10081 But we are a true, independant SV, so: */
10082 SvREADONLY_off(dstr);
10087 /* Special case - not normally malloced for some reason */
10088 if (SvREADONLY(sstr) && SvFAKE(sstr)) {
10089 /* A "shared" PV - clone it as unshared string */
10090 if(SvPADTMP(sstr)) {
10091 /* However, some of them live in the pad
10092 and they should not have these flags
10095 SvPVX(dstr) = sharepvn(SvPVX(sstr), SvCUR(sstr),
10097 SvUVX(dstr) = SvUVX(sstr);
10100 SvPVX(dstr) = SAVEPVN(SvPVX(sstr), SvCUR(sstr));
10102 SvREADONLY_off(dstr);
10106 /* Some other special case - random pointer */
10107 SvPVX(dstr) = SvPVX(sstr);
10112 /* Copy the Null */
10113 SvPVX(dstr) = SvPVX(sstr);
10118 Perl_sv_dup(pTHX_ SV *sstr, CLONE_PARAMS* param)
10122 if (!sstr || SvTYPE(sstr) == SVTYPEMASK)
10124 /* look for it in the table first */
10125 dstr = (SV*)ptr_table_fetch(PL_ptr_table, sstr);
10129 if(param->flags & CLONEf_JOIN_IN) {
10130 /** We are joining here so we don't want do clone
10131 something that is bad **/
10133 if(SvTYPE(sstr) == SVt_PVHV &&
10135 /** don't clone stashes if they already exist **/
10136 HV* old_stash = gv_stashpv(HvNAME(sstr),0);
10137 return (SV*) old_stash;
10141 /* create anew and remember what it is */
10143 ptr_table_store(PL_ptr_table, sstr, dstr);
10146 SvFLAGS(dstr) = SvFLAGS(sstr);
10147 SvFLAGS(dstr) &= ~SVf_OOK; /* don't propagate OOK hack */
10148 SvREFCNT(dstr) = 0; /* must be before any other dups! */
10151 if (SvANY(sstr) && PL_watch_pvx && SvPVX(sstr) == PL_watch_pvx)
10152 PerlIO_printf(Perl_debug_log, "watch at %p hit, found string \"%s\"\n",
10153 PL_watch_pvx, SvPVX(sstr));
10156 switch (SvTYPE(sstr)) {
10158 SvANY(dstr) = NULL;
10161 SvANY(dstr) = new_XIV();
10162 SvIVX(dstr) = SvIVX(sstr);
10165 SvANY(dstr) = new_XNV();
10166 SvNVX(dstr) = SvNVX(sstr);
10169 SvANY(dstr) = new_XRV();
10170 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10173 SvANY(dstr) = new_XPV();
10174 SvCUR(dstr) = SvCUR(sstr);
10175 SvLEN(dstr) = SvLEN(sstr);
10176 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10179 SvANY(dstr) = new_XPVIV();
10180 SvCUR(dstr) = SvCUR(sstr);
10181 SvLEN(dstr) = SvLEN(sstr);
10182 SvIVX(dstr) = SvIVX(sstr);
10183 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10186 SvANY(dstr) = new_XPVNV();
10187 SvCUR(dstr) = SvCUR(sstr);
10188 SvLEN(dstr) = SvLEN(sstr);
10189 SvIVX(dstr) = SvIVX(sstr);
10190 SvNVX(dstr) = SvNVX(sstr);
10191 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10194 SvANY(dstr) = new_XPVMG();
10195 SvCUR(dstr) = SvCUR(sstr);
10196 SvLEN(dstr) = SvLEN(sstr);
10197 SvIVX(dstr) = SvIVX(sstr);
10198 SvNVX(dstr) = SvNVX(sstr);
10199 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr), param);
10200 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr), param);
10201 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10204 SvANY(dstr) = new_XPVBM();
10205 SvCUR(dstr) = SvCUR(sstr);
10206 SvLEN(dstr) = SvLEN(sstr);
10207 SvIVX(dstr) = SvIVX(sstr);
10208 SvNVX(dstr) = SvNVX(sstr);
10209 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr), param);
10210 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr), param);
10211 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10212 BmRARE(dstr) = BmRARE(sstr);
10213 BmUSEFUL(dstr) = BmUSEFUL(sstr);
10214 BmPREVIOUS(dstr)= BmPREVIOUS(sstr);
10217 SvANY(dstr) = new_XPVLV();
10218 SvCUR(dstr) = SvCUR(sstr);
10219 SvLEN(dstr) = SvLEN(sstr);
10220 SvIVX(dstr) = SvIVX(sstr);
10221 SvNVX(dstr) = SvNVX(sstr);
10222 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr), param);
10223 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr), param);
10224 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10225 LvTARGOFF(dstr) = LvTARGOFF(sstr); /* XXX sometimes holds PMOP* when DEBUGGING */
10226 LvTARGLEN(dstr) = LvTARGLEN(sstr);
10227 if (LvTYPE(sstr) == 't') /* for tie: unrefcnted fake (SV**) */
10228 LvTARG(dstr) = dstr;
10229 else if (LvTYPE(sstr) == 'T') /* for tie: fake HE */
10230 LvTARG(dstr) = (SV*)he_dup((HE*)LvTARG(sstr), 0, param);
10232 LvTARG(dstr) = sv_dup_inc(LvTARG(sstr), param);
10233 LvTYPE(dstr) = LvTYPE(sstr);
10236 if (GvUNIQUE((GV*)sstr)) {
10238 if ((share = gv_share(sstr, param))) {
10241 ptr_table_store(PL_ptr_table, sstr, dstr);
10243 PerlIO_printf(Perl_debug_log, "sv_dup: sharing %s::%s\n",
10244 HvNAME(GvSTASH(share)), GvNAME(share));
10249 SvANY(dstr) = new_XPVGV();
10250 SvCUR(dstr) = SvCUR(sstr);
10251 SvLEN(dstr) = SvLEN(sstr);
10252 SvIVX(dstr) = SvIVX(sstr);
10253 SvNVX(dstr) = SvNVX(sstr);
10254 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr), param);
10255 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr), param);
10256 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10257 GvNAMELEN(dstr) = GvNAMELEN(sstr);
10258 GvNAME(dstr) = SAVEPVN(GvNAME(sstr), GvNAMELEN(sstr));
10259 GvSTASH(dstr) = hv_dup_inc(GvSTASH(sstr), param);
10260 GvFLAGS(dstr) = GvFLAGS(sstr);
10261 GvGP(dstr) = gp_dup(GvGP(sstr), param);
10262 (void)GpREFCNT_inc(GvGP(dstr));
10265 SvANY(dstr) = new_XPVIO();
10266 SvCUR(dstr) = SvCUR(sstr);
10267 SvLEN(dstr) = SvLEN(sstr);
10268 SvIVX(dstr) = SvIVX(sstr);
10269 SvNVX(dstr) = SvNVX(sstr);
10270 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr), param);
10271 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr), param);
10272 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10273 IoIFP(dstr) = fp_dup(IoIFP(sstr), IoTYPE(sstr), param);
10274 if (IoOFP(sstr) == IoIFP(sstr))
10275 IoOFP(dstr) = IoIFP(dstr);
10277 IoOFP(dstr) = fp_dup(IoOFP(sstr), IoTYPE(sstr), param);
10278 /* PL_rsfp_filters entries have fake IoDIRP() */
10279 if (IoDIRP(sstr) && !(IoFLAGS(sstr) & IOf_FAKE_DIRP))
10280 IoDIRP(dstr) = dirp_dup(IoDIRP(sstr));
10282 IoDIRP(dstr) = IoDIRP(sstr);
10283 IoLINES(dstr) = IoLINES(sstr);
10284 IoPAGE(dstr) = IoPAGE(sstr);
10285 IoPAGE_LEN(dstr) = IoPAGE_LEN(sstr);
10286 IoLINES_LEFT(dstr) = IoLINES_LEFT(sstr);
10287 if(IoFLAGS(sstr) & IOf_FAKE_DIRP) {
10288 /* I have no idea why fake dirp (rsfps)
10289 should be treaded differently but otherwise
10290 we end up with leaks -- sky*/
10291 IoTOP_GV(dstr) = gv_dup_inc(IoTOP_GV(sstr), param);
10292 IoFMT_GV(dstr) = gv_dup_inc(IoFMT_GV(sstr), param);
10293 IoBOTTOM_GV(dstr) = gv_dup_inc(IoBOTTOM_GV(sstr), param);
10295 IoTOP_GV(dstr) = gv_dup(IoTOP_GV(sstr), param);
10296 IoFMT_GV(dstr) = gv_dup(IoFMT_GV(sstr), param);
10297 IoBOTTOM_GV(dstr) = gv_dup(IoBOTTOM_GV(sstr), param);
10299 IoTOP_NAME(dstr) = SAVEPV(IoTOP_NAME(sstr));
10300 IoFMT_NAME(dstr) = SAVEPV(IoFMT_NAME(sstr));
10301 IoBOTTOM_NAME(dstr) = SAVEPV(IoBOTTOM_NAME(sstr));
10302 IoSUBPROCESS(dstr) = IoSUBPROCESS(sstr);
10303 IoTYPE(dstr) = IoTYPE(sstr);
10304 IoFLAGS(dstr) = IoFLAGS(sstr);
10307 SvANY(dstr) = new_XPVAV();
10308 SvCUR(dstr) = SvCUR(sstr);
10309 SvLEN(dstr) = SvLEN(sstr);
10310 SvIVX(dstr) = SvIVX(sstr);
10311 SvNVX(dstr) = SvNVX(sstr);
10312 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr), param);
10313 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr), param);
10314 AvARYLEN((AV*)dstr) = sv_dup_inc(AvARYLEN((AV*)sstr), param);
10315 AvFLAGS((AV*)dstr) = AvFLAGS((AV*)sstr);
10316 if (AvARRAY((AV*)sstr)) {
10317 SV **dst_ary, **src_ary;
10318 SSize_t items = AvFILLp((AV*)sstr) + 1;
10320 src_ary = AvARRAY((AV*)sstr);
10321 Newz(0, dst_ary, AvMAX((AV*)sstr)+1, SV*);
10322 ptr_table_store(PL_ptr_table, src_ary, dst_ary);
10323 SvPVX(dstr) = (char*)dst_ary;
10324 AvALLOC((AV*)dstr) = dst_ary;
10325 if (AvREAL((AV*)sstr)) {
10326 while (items-- > 0)
10327 *dst_ary++ = sv_dup_inc(*src_ary++, param);
10330 while (items-- > 0)
10331 *dst_ary++ = sv_dup(*src_ary++, param);
10333 items = AvMAX((AV*)sstr) - AvFILLp((AV*)sstr);
10334 while (items-- > 0) {
10335 *dst_ary++ = &PL_sv_undef;
10339 SvPVX(dstr) = Nullch;
10340 AvALLOC((AV*)dstr) = (SV**)NULL;
10344 SvANY(dstr) = new_XPVHV();
10345 SvCUR(dstr) = SvCUR(sstr);
10346 SvLEN(dstr) = SvLEN(sstr);
10347 SvIVX(dstr) = SvIVX(sstr);
10348 SvNVX(dstr) = SvNVX(sstr);
10349 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr), param);
10350 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr), param);
10351 HvRITER((HV*)dstr) = HvRITER((HV*)sstr);
10352 if (HvARRAY((HV*)sstr)) {
10354 XPVHV *dxhv = (XPVHV*)SvANY(dstr);
10355 XPVHV *sxhv = (XPVHV*)SvANY(sstr);
10356 Newz(0, dxhv->xhv_array,
10357 PERL_HV_ARRAY_ALLOC_BYTES(dxhv->xhv_max+1), char);
10358 while (i <= sxhv->xhv_max) {
10359 ((HE**)dxhv->xhv_array)[i] = he_dup(((HE**)sxhv->xhv_array)[i],
10360 (bool)!!HvSHAREKEYS(sstr),
10364 dxhv->xhv_eiter = he_dup(sxhv->xhv_eiter,
10365 (bool)!!HvSHAREKEYS(sstr), param);
10368 SvPVX(dstr) = Nullch;
10369 HvEITER((HV*)dstr) = (HE*)NULL;
10371 HvPMROOT((HV*)dstr) = HvPMROOT((HV*)sstr); /* XXX */
10372 HvNAME((HV*)dstr) = SAVEPV(HvNAME((HV*)sstr));
10373 /* Record stashes for possible cloning in Perl_clone(). */
10374 if(HvNAME((HV*)dstr))
10375 av_push(param->stashes, dstr);
10378 SvANY(dstr) = new_XPVFM();
10379 FmLINES(dstr) = FmLINES(sstr);
10383 SvANY(dstr) = new_XPVCV();
10385 SvCUR(dstr) = SvCUR(sstr);
10386 SvLEN(dstr) = SvLEN(sstr);
10387 SvIVX(dstr) = SvIVX(sstr);
10388 SvNVX(dstr) = SvNVX(sstr);
10389 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr), param);
10390 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr), param);
10391 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10392 CvSTASH(dstr) = hv_dup(CvSTASH(sstr), param); /* NOTE: not refcounted */
10393 CvSTART(dstr) = CvSTART(sstr);
10394 CvROOT(dstr) = OpREFCNT_inc(CvROOT(sstr));
10395 CvXSUB(dstr) = CvXSUB(sstr);
10396 CvXSUBANY(dstr) = CvXSUBANY(sstr);
10397 if (CvCONST(sstr)) {
10398 CvXSUBANY(dstr).any_ptr = GvUNIQUE(CvGV(sstr)) ?
10399 SvREFCNT_inc(CvXSUBANY(sstr).any_ptr) :
10400 sv_dup_inc(CvXSUBANY(sstr).any_ptr, param);
10402 /* don't dup if copying back - CvGV isn't refcounted, so the
10403 * duped GV may never be freed. A bit of a hack! DAPM */
10404 CvGV(dstr) = (param->flags & CLONEf_JOIN_IN) ?
10405 Nullgv : gv_dup(CvGV(sstr), param) ;
10406 if (param->flags & CLONEf_COPY_STACKS) {
10407 CvDEPTH(dstr) = CvDEPTH(sstr);
10411 PAD_DUP(CvPADLIST(dstr), CvPADLIST(sstr), param);
10412 CvOUTSIDE_SEQ(dstr) = CvOUTSIDE_SEQ(sstr);
10414 CvWEAKOUTSIDE(sstr)
10415 ? cv_dup( CvOUTSIDE(sstr), param)
10416 : cv_dup_inc(CvOUTSIDE(sstr), param);
10417 CvFLAGS(dstr) = CvFLAGS(sstr);
10418 CvFILE(dstr) = CvXSUB(sstr) ? CvFILE(sstr) : SAVEPV(CvFILE(sstr));
10421 Perl_croak(aTHX_ "Bizarre SvTYPE [%" IVdf "]", (IV)SvTYPE(sstr));
10425 if (SvOBJECT(dstr) && SvTYPE(dstr) != SVt_PVIO)
10431 /* duplicate a context */
10434 Perl_cx_dup(pTHX_ PERL_CONTEXT *cxs, I32 ix, I32 max, CLONE_PARAMS* param)
10436 PERL_CONTEXT *ncxs;
10439 return (PERL_CONTEXT*)NULL;
10441 /* look for it in the table first */
10442 ncxs = (PERL_CONTEXT*)ptr_table_fetch(PL_ptr_table, cxs);
10446 /* create anew and remember what it is */
10447 Newz(56, ncxs, max + 1, PERL_CONTEXT);
10448 ptr_table_store(PL_ptr_table, cxs, ncxs);
10451 PERL_CONTEXT *cx = &cxs[ix];
10452 PERL_CONTEXT *ncx = &ncxs[ix];
10453 ncx->cx_type = cx->cx_type;
10454 if (CxTYPE(cx) == CXt_SUBST) {
10455 Perl_croak(aTHX_ "Cloning substitution context is unimplemented");
10458 ncx->blk_oldsp = cx->blk_oldsp;
10459 ncx->blk_oldcop = cx->blk_oldcop;
10460 ncx->blk_oldretsp = cx->blk_oldretsp;
10461 ncx->blk_oldmarksp = cx->blk_oldmarksp;
10462 ncx->blk_oldscopesp = cx->blk_oldscopesp;
10463 ncx->blk_oldpm = cx->blk_oldpm;
10464 ncx->blk_gimme = cx->blk_gimme;
10465 switch (CxTYPE(cx)) {
10467 ncx->blk_sub.cv = (cx->blk_sub.olddepth == 0
10468 ? cv_dup_inc(cx->blk_sub.cv, param)
10469 : cv_dup(cx->blk_sub.cv,param));
10470 ncx->blk_sub.argarray = (cx->blk_sub.hasargs
10471 ? av_dup_inc(cx->blk_sub.argarray, param)
10473 ncx->blk_sub.savearray = av_dup_inc(cx->blk_sub.savearray, param);
10474 ncx->blk_sub.olddepth = cx->blk_sub.olddepth;
10475 ncx->blk_sub.hasargs = cx->blk_sub.hasargs;
10476 ncx->blk_sub.lval = cx->blk_sub.lval;
10479 ncx->blk_eval.old_in_eval = cx->blk_eval.old_in_eval;
10480 ncx->blk_eval.old_op_type = cx->blk_eval.old_op_type;
10481 ncx->blk_eval.old_namesv = sv_dup_inc(cx->blk_eval.old_namesv, param);
10482 ncx->blk_eval.old_eval_root = cx->blk_eval.old_eval_root;
10483 ncx->blk_eval.cur_text = sv_dup(cx->blk_eval.cur_text, param);
10486 ncx->blk_loop.label = cx->blk_loop.label;
10487 ncx->blk_loop.resetsp = cx->blk_loop.resetsp;
10488 ncx->blk_loop.redo_op = cx->blk_loop.redo_op;
10489 ncx->blk_loop.next_op = cx->blk_loop.next_op;
10490 ncx->blk_loop.last_op = cx->blk_loop.last_op;
10491 ncx->blk_loop.iterdata = (CxPADLOOP(cx)
10492 ? cx->blk_loop.iterdata
10493 : gv_dup((GV*)cx->blk_loop.iterdata, param));
10494 ncx->blk_loop.oldcomppad
10495 = (PAD*)ptr_table_fetch(PL_ptr_table,
10496 cx->blk_loop.oldcomppad);
10497 ncx->blk_loop.itersave = sv_dup_inc(cx->blk_loop.itersave, param);
10498 ncx->blk_loop.iterlval = sv_dup_inc(cx->blk_loop.iterlval, param);
10499 ncx->blk_loop.iterary = av_dup_inc(cx->blk_loop.iterary, param);
10500 ncx->blk_loop.iterix = cx->blk_loop.iterix;
10501 ncx->blk_loop.itermax = cx->blk_loop.itermax;
10504 ncx->blk_sub.cv = cv_dup(cx->blk_sub.cv, param);
10505 ncx->blk_sub.gv = gv_dup(cx->blk_sub.gv, param);
10506 ncx->blk_sub.dfoutgv = gv_dup_inc(cx->blk_sub.dfoutgv, param);
10507 ncx->blk_sub.hasargs = cx->blk_sub.hasargs;
10519 /* duplicate a stack info structure */
10522 Perl_si_dup(pTHX_ PERL_SI *si, CLONE_PARAMS* param)
10527 return (PERL_SI*)NULL;
10529 /* look for it in the table first */
10530 nsi = (PERL_SI*)ptr_table_fetch(PL_ptr_table, si);
10534 /* create anew and remember what it is */
10535 Newz(56, nsi, 1, PERL_SI);
10536 ptr_table_store(PL_ptr_table, si, nsi);
10538 nsi->si_stack = av_dup_inc(si->si_stack, param);
10539 nsi->si_cxix = si->si_cxix;
10540 nsi->si_cxmax = si->si_cxmax;
10541 nsi->si_cxstack = cx_dup(si->si_cxstack, si->si_cxix, si->si_cxmax, param);
10542 nsi->si_type = si->si_type;
10543 nsi->si_prev = si_dup(si->si_prev, param);
10544 nsi->si_next = si_dup(si->si_next, param);
10545 nsi->si_markoff = si->si_markoff;
10550 #define POPINT(ss,ix) ((ss)[--(ix)].any_i32)
10551 #define TOPINT(ss,ix) ((ss)[ix].any_i32)
10552 #define POPLONG(ss,ix) ((ss)[--(ix)].any_long)
10553 #define TOPLONG(ss,ix) ((ss)[ix].any_long)
10554 #define POPIV(ss,ix) ((ss)[--(ix)].any_iv)
10555 #define TOPIV(ss,ix) ((ss)[ix].any_iv)
10556 #define POPBOOL(ss,ix) ((ss)[--(ix)].any_bool)
10557 #define TOPBOOL(ss,ix) ((ss)[ix].any_bool)
10558 #define POPPTR(ss,ix) ((ss)[--(ix)].any_ptr)
10559 #define TOPPTR(ss,ix) ((ss)[ix].any_ptr)
10560 #define POPDPTR(ss,ix) ((ss)[--(ix)].any_dptr)
10561 #define TOPDPTR(ss,ix) ((ss)[ix].any_dptr)
10562 #define POPDXPTR(ss,ix) ((ss)[--(ix)].any_dxptr)
10563 #define TOPDXPTR(ss,ix) ((ss)[ix].any_dxptr)
10566 #define pv_dup_inc(p) SAVEPV(p)
10567 #define pv_dup(p) SAVEPV(p)
10568 #define svp_dup_inc(p,pp) any_dup(p,pp)
10570 /* map any object to the new equivent - either something in the
10571 * ptr table, or something in the interpreter structure
10575 Perl_any_dup(pTHX_ void *v, PerlInterpreter *proto_perl)
10580 return (void*)NULL;
10582 /* look for it in the table first */
10583 ret = ptr_table_fetch(PL_ptr_table, v);
10587 /* see if it is part of the interpreter structure */
10588 if (v >= (void*)proto_perl && v < (void*)(proto_perl+1))
10589 ret = (void*)(((char*)aTHX) + (((char*)v) - (char*)proto_perl));
10597 /* duplicate the save stack */
10600 Perl_ss_dup(pTHX_ PerlInterpreter *proto_perl, CLONE_PARAMS* param)
10602 ANY *ss = proto_perl->Tsavestack;
10603 I32 ix = proto_perl->Tsavestack_ix;
10604 I32 max = proto_perl->Tsavestack_max;
10617 void (*dptr) (void*);
10618 void (*dxptr) (pTHX_ void*);
10621 Newz(54, nss, max, ANY);
10625 TOPINT(nss,ix) = i;
10627 case SAVEt_ITEM: /* normal string */
10628 sv = (SV*)POPPTR(ss,ix);
10629 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
10630 sv = (SV*)POPPTR(ss,ix);
10631 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
10633 case SAVEt_SV: /* scalar reference */
10634 sv = (SV*)POPPTR(ss,ix);
10635 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
10636 gv = (GV*)POPPTR(ss,ix);
10637 TOPPTR(nss,ix) = gv_dup_inc(gv, param);
10639 case SAVEt_GENERIC_PVREF: /* generic char* */
10640 c = (char*)POPPTR(ss,ix);
10641 TOPPTR(nss,ix) = pv_dup(c);
10642 ptr = POPPTR(ss,ix);
10643 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10645 case SAVEt_SHARED_PVREF: /* char* in shared space */
10646 c = (char*)POPPTR(ss,ix);
10647 TOPPTR(nss,ix) = savesharedpv(c);
10648 ptr = POPPTR(ss,ix);
10649 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10651 case SAVEt_GENERIC_SVREF: /* generic sv */
10652 case SAVEt_SVREF: /* scalar reference */
10653 sv = (SV*)POPPTR(ss,ix);
10654 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
10655 ptr = POPPTR(ss,ix);
10656 TOPPTR(nss,ix) = svp_dup_inc((SV**)ptr, proto_perl);/* XXXXX */
10658 case SAVEt_AV: /* array reference */
10659 av = (AV*)POPPTR(ss,ix);
10660 TOPPTR(nss,ix) = av_dup_inc(av, param);
10661 gv = (GV*)POPPTR(ss,ix);
10662 TOPPTR(nss,ix) = gv_dup(gv, param);
10664 case SAVEt_HV: /* hash reference */
10665 hv = (HV*)POPPTR(ss,ix);
10666 TOPPTR(nss,ix) = hv_dup_inc(hv, param);
10667 gv = (GV*)POPPTR(ss,ix);
10668 TOPPTR(nss,ix) = gv_dup(gv, param);
10670 case SAVEt_INT: /* int reference */
10671 ptr = POPPTR(ss,ix);
10672 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10673 intval = (int)POPINT(ss,ix);
10674 TOPINT(nss,ix) = intval;
10676 case SAVEt_LONG: /* long reference */
10677 ptr = POPPTR(ss,ix);
10678 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10679 longval = (long)POPLONG(ss,ix);
10680 TOPLONG(nss,ix) = longval;
10682 case SAVEt_I32: /* I32 reference */
10683 case SAVEt_I16: /* I16 reference */
10684 case SAVEt_I8: /* I8 reference */
10685 ptr = POPPTR(ss,ix);
10686 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10688 TOPINT(nss,ix) = i;
10690 case SAVEt_IV: /* IV reference */
10691 ptr = POPPTR(ss,ix);
10692 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10694 TOPIV(nss,ix) = iv;
10696 case SAVEt_SPTR: /* SV* reference */
10697 ptr = POPPTR(ss,ix);
10698 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10699 sv = (SV*)POPPTR(ss,ix);
10700 TOPPTR(nss,ix) = sv_dup(sv, param);
10702 case SAVEt_VPTR: /* random* reference */
10703 ptr = POPPTR(ss,ix);
10704 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10705 ptr = POPPTR(ss,ix);
10706 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10708 case SAVEt_PPTR: /* char* reference */
10709 ptr = POPPTR(ss,ix);
10710 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10711 c = (char*)POPPTR(ss,ix);
10712 TOPPTR(nss,ix) = pv_dup(c);
10714 case SAVEt_HPTR: /* HV* reference */
10715 ptr = POPPTR(ss,ix);
10716 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10717 hv = (HV*)POPPTR(ss,ix);
10718 TOPPTR(nss,ix) = hv_dup(hv, param);
10720 case SAVEt_APTR: /* AV* reference */
10721 ptr = POPPTR(ss,ix);
10722 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10723 av = (AV*)POPPTR(ss,ix);
10724 TOPPTR(nss,ix) = av_dup(av, param);
10727 gv = (GV*)POPPTR(ss,ix);
10728 TOPPTR(nss,ix) = gv_dup(gv, param);
10730 case SAVEt_GP: /* scalar reference */
10731 gp = (GP*)POPPTR(ss,ix);
10732 TOPPTR(nss,ix) = gp = gp_dup(gp, param);
10733 (void)GpREFCNT_inc(gp);
10734 gv = (GV*)POPPTR(ss,ix);
10735 TOPPTR(nss,ix) = gv_dup_inc(gv, param);
10736 c = (char*)POPPTR(ss,ix);
10737 TOPPTR(nss,ix) = pv_dup(c);
10739 TOPIV(nss,ix) = iv;
10741 TOPIV(nss,ix) = iv;
10744 case SAVEt_MORTALIZESV:
10745 sv = (SV*)POPPTR(ss,ix);
10746 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
10749 ptr = POPPTR(ss,ix);
10750 if (ptr && (((OP*)ptr)->op_private & OPpREFCOUNTED)) {
10751 /* these are assumed to be refcounted properly */
10752 switch (((OP*)ptr)->op_type) {
10754 case OP_LEAVESUBLV:
10758 case OP_LEAVEWRITE:
10759 TOPPTR(nss,ix) = ptr;
10764 TOPPTR(nss,ix) = Nullop;
10769 TOPPTR(nss,ix) = Nullop;
10772 c = (char*)POPPTR(ss,ix);
10773 TOPPTR(nss,ix) = pv_dup_inc(c);
10775 case SAVEt_CLEARSV:
10776 longval = POPLONG(ss,ix);
10777 TOPLONG(nss,ix) = longval;
10780 hv = (HV*)POPPTR(ss,ix);
10781 TOPPTR(nss,ix) = hv_dup_inc(hv, param);
10782 c = (char*)POPPTR(ss,ix);
10783 TOPPTR(nss,ix) = pv_dup_inc(c);
10785 TOPINT(nss,ix) = i;
10787 case SAVEt_DESTRUCTOR:
10788 ptr = POPPTR(ss,ix);
10789 TOPPTR(nss,ix) = any_dup(ptr, proto_perl); /* XXX quite arbitrary */
10790 dptr = POPDPTR(ss,ix);
10791 TOPDPTR(nss,ix) = (void (*)(void*))any_dup((void *)dptr, proto_perl);
10793 case SAVEt_DESTRUCTOR_X:
10794 ptr = POPPTR(ss,ix);
10795 TOPPTR(nss,ix) = any_dup(ptr, proto_perl); /* XXX quite arbitrary */
10796 dxptr = POPDXPTR(ss,ix);
10797 TOPDXPTR(nss,ix) = (void (*)(pTHX_ void*))any_dup((void *)dxptr, proto_perl);
10799 case SAVEt_REGCONTEXT:
10802 TOPINT(nss,ix) = i;
10805 case SAVEt_STACK_POS: /* Position on Perl stack */
10807 TOPINT(nss,ix) = i;
10809 case SAVEt_AELEM: /* array element */
10810 sv = (SV*)POPPTR(ss,ix);
10811 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
10813 TOPINT(nss,ix) = i;
10814 av = (AV*)POPPTR(ss,ix);
10815 TOPPTR(nss,ix) = av_dup_inc(av, param);
10817 case SAVEt_HELEM: /* hash element */
10818 sv = (SV*)POPPTR(ss,ix);
10819 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
10820 sv = (SV*)POPPTR(ss,ix);
10821 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
10822 hv = (HV*)POPPTR(ss,ix);
10823 TOPPTR(nss,ix) = hv_dup_inc(hv, param);
10826 ptr = POPPTR(ss,ix);
10827 TOPPTR(nss,ix) = ptr;
10831 TOPINT(nss,ix) = i;
10833 case SAVEt_COMPPAD:
10834 av = (AV*)POPPTR(ss,ix);
10835 TOPPTR(nss,ix) = av_dup(av, param);
10838 longval = (long)POPLONG(ss,ix);
10839 TOPLONG(nss,ix) = longval;
10840 ptr = POPPTR(ss,ix);
10841 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10842 sv = (SV*)POPPTR(ss,ix);
10843 TOPPTR(nss,ix) = sv_dup(sv, param);
10846 ptr = POPPTR(ss,ix);
10847 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10848 longval = (long)POPBOOL(ss,ix);
10849 TOPBOOL(nss,ix) = (bool)longval;
10851 case SAVEt_SET_SVFLAGS:
10853 TOPINT(nss,ix) = i;
10855 TOPINT(nss,ix) = i;
10856 sv = (SV*)POPPTR(ss,ix);
10857 TOPPTR(nss,ix) = sv_dup(sv, param);
10860 Perl_croak(aTHX_ "panic: ss_dup inconsistency");
10868 =for apidoc perl_clone
10870 Create and return a new interpreter by cloning the current one.
10872 perl_clone takes these flags as parameters:
10874 CLONEf_COPY_STACKS - is used to, well, copy the stacks also,
10875 without it we only clone the data and zero the stacks,
10876 with it we copy the stacks and the new perl interpreter is
10877 ready to run at the exact same point as the previous one.
10878 The pseudo-fork code uses COPY_STACKS while the
10879 threads->new doesn't.
10881 CLONEf_KEEP_PTR_TABLE
10882 perl_clone keeps a ptr_table with the pointer of the old
10883 variable as a key and the new variable as a value,
10884 this allows it to check if something has been cloned and not
10885 clone it again but rather just use the value and increase the
10886 refcount. If KEEP_PTR_TABLE is not set then perl_clone will kill
10887 the ptr_table using the function
10888 C<ptr_table_free(PL_ptr_table); PL_ptr_table = NULL;>,
10889 reason to keep it around is if you want to dup some of your own
10890 variable who are outside the graph perl scans, example of this
10891 code is in threads.xs create
10894 This is a win32 thing, it is ignored on unix, it tells perls
10895 win32host code (which is c++) to clone itself, this is needed on
10896 win32 if you want to run two threads at the same time,
10897 if you just want to do some stuff in a separate perl interpreter
10898 and then throw it away and return to the original one,
10899 you don't need to do anything.
10904 /* XXX the above needs expanding by someone who actually understands it ! */
10905 EXTERN_C PerlInterpreter *
10906 perl_clone_host(PerlInterpreter* proto_perl, UV flags);
10909 perl_clone(PerlInterpreter *proto_perl, UV flags)
10911 #ifdef PERL_IMPLICIT_SYS
10913 /* perlhost.h so we need to call into it
10914 to clone the host, CPerlHost should have a c interface, sky */
10916 if (flags & CLONEf_CLONE_HOST) {
10917 return perl_clone_host(proto_perl,flags);
10919 return perl_clone_using(proto_perl, flags,
10921 proto_perl->IMemShared,
10922 proto_perl->IMemParse,
10924 proto_perl->IStdIO,
10928 proto_perl->IProc);
10932 perl_clone_using(PerlInterpreter *proto_perl, UV flags,
10933 struct IPerlMem* ipM, struct IPerlMem* ipMS,
10934 struct IPerlMem* ipMP, struct IPerlEnv* ipE,
10935 struct IPerlStdIO* ipStd, struct IPerlLIO* ipLIO,
10936 struct IPerlDir* ipD, struct IPerlSock* ipS,
10937 struct IPerlProc* ipP)
10939 /* XXX many of the string copies here can be optimized if they're
10940 * constants; they need to be allocated as common memory and just
10941 * their pointers copied. */
10944 CLONE_PARAMS clone_params;
10945 CLONE_PARAMS* param = &clone_params;
10947 PerlInterpreter *my_perl = (PerlInterpreter*)(*ipM->pMalloc)(ipM, sizeof(PerlInterpreter));
10948 PERL_SET_THX(my_perl);
10951 Poison(my_perl, 1, PerlInterpreter);
10955 PL_savestack_ix = 0;
10956 PL_savestack_max = -1;
10958 PL_sig_pending = 0;
10959 Zero(&PL_debug_pad, 1, struct perl_debug_pad);
10960 # else /* !DEBUGGING */
10961 Zero(my_perl, 1, PerlInterpreter);
10962 # endif /* DEBUGGING */
10964 /* host pointers */
10966 PL_MemShared = ipMS;
10967 PL_MemParse = ipMP;
10974 #else /* !PERL_IMPLICIT_SYS */
10976 CLONE_PARAMS clone_params;
10977 CLONE_PARAMS* param = &clone_params;
10978 PerlInterpreter *my_perl = (PerlInterpreter*)PerlMem_malloc(sizeof(PerlInterpreter));
10979 PERL_SET_THX(my_perl);
10984 Poison(my_perl, 1, PerlInterpreter);
10988 PL_savestack_ix = 0;
10989 PL_savestack_max = -1;
10991 PL_sig_pending = 0;
10992 Zero(&PL_debug_pad, 1, struct perl_debug_pad);
10993 # else /* !DEBUGGING */
10994 Zero(my_perl, 1, PerlInterpreter);
10995 # endif /* DEBUGGING */
10996 #endif /* PERL_IMPLICIT_SYS */
10997 param->flags = flags;
10998 param->proto_perl = proto_perl;
11001 PL_xiv_arenaroot = NULL;
11002 PL_xiv_root = NULL;
11003 PL_xnv_arenaroot = NULL;
11004 PL_xnv_root = NULL;
11005 PL_xrv_arenaroot = NULL;
11006 PL_xrv_root = NULL;
11007 PL_xpv_arenaroot = NULL;
11008 PL_xpv_root = NULL;
11009 PL_xpviv_arenaroot = NULL;
11010 PL_xpviv_root = NULL;
11011 PL_xpvnv_arenaroot = NULL;
11012 PL_xpvnv_root = NULL;
11013 PL_xpvcv_arenaroot = NULL;
11014 PL_xpvcv_root = NULL;
11015 PL_xpvav_arenaroot = NULL;
11016 PL_xpvav_root = NULL;
11017 PL_xpvhv_arenaroot = NULL;
11018 PL_xpvhv_root = NULL;
11019 PL_xpvmg_arenaroot = NULL;
11020 PL_xpvmg_root = NULL;
11021 PL_xpvlv_arenaroot = NULL;
11022 PL_xpvlv_root = NULL;
11023 PL_xpvbm_arenaroot = NULL;
11024 PL_xpvbm_root = NULL;
11025 PL_he_arenaroot = NULL;
11027 PL_nice_chunk = NULL;
11028 PL_nice_chunk_size = 0;
11030 PL_sv_objcount = 0;
11031 PL_sv_root = Nullsv;
11032 PL_sv_arenaroot = Nullsv;
11034 PL_debug = proto_perl->Idebug;
11036 #ifdef USE_REENTRANT_API
11037 /* XXX: things like -Dm will segfault here in perlio, but doing
11038 * PERL_SET_CONTEXT(proto_perl);
11039 * breaks too many other things
11041 Perl_reentrant_init(aTHX);
11044 /* create SV map for pointer relocation */
11045 PL_ptr_table = ptr_table_new();
11047 /* initialize these special pointers as early as possible */
11048 SvANY(&PL_sv_undef) = NULL;
11049 SvREFCNT(&PL_sv_undef) = (~(U32)0)/2;
11050 SvFLAGS(&PL_sv_undef) = SVf_READONLY|SVt_NULL;
11051 ptr_table_store(PL_ptr_table, &proto_perl->Isv_undef, &PL_sv_undef);
11053 SvANY(&PL_sv_no) = new_XPVNV();
11054 SvREFCNT(&PL_sv_no) = (~(U32)0)/2;
11055 SvFLAGS(&PL_sv_no) = SVp_NOK|SVf_NOK|SVp_POK|SVf_POK|SVf_READONLY|SVt_PVNV;
11056 SvPVX(&PL_sv_no) = SAVEPVN(PL_No, 0);
11057 SvCUR(&PL_sv_no) = 0;
11058 SvLEN(&PL_sv_no) = 1;
11059 SvNVX(&PL_sv_no) = 0;
11060 ptr_table_store(PL_ptr_table, &proto_perl->Isv_no, &PL_sv_no);
11062 SvANY(&PL_sv_yes) = new_XPVNV();
11063 SvREFCNT(&PL_sv_yes) = (~(U32)0)/2;
11064 SvFLAGS(&PL_sv_yes) = SVp_NOK|SVf_NOK|SVp_POK|SVf_POK|SVf_READONLY|SVt_PVNV;
11065 SvPVX(&PL_sv_yes) = SAVEPVN(PL_Yes, 1);
11066 SvCUR(&PL_sv_yes) = 1;
11067 SvLEN(&PL_sv_yes) = 2;
11068 SvNVX(&PL_sv_yes) = 1;
11069 ptr_table_store(PL_ptr_table, &proto_perl->Isv_yes, &PL_sv_yes);
11071 /* create (a non-shared!) shared string table */
11072 PL_strtab = newHV();
11073 HvSHAREKEYS_off(PL_strtab);
11074 hv_ksplit(PL_strtab, 512);
11075 ptr_table_store(PL_ptr_table, proto_perl->Istrtab, PL_strtab);
11077 PL_compiling = proto_perl->Icompiling;
11079 /* These two PVs will be free'd special way so must set them same way op.c does */
11080 PL_compiling.cop_stashpv = savesharedpv(PL_compiling.cop_stashpv);
11081 ptr_table_store(PL_ptr_table, proto_perl->Icompiling.cop_stashpv, PL_compiling.cop_stashpv);
11083 PL_compiling.cop_file = savesharedpv(PL_compiling.cop_file);
11084 ptr_table_store(PL_ptr_table, proto_perl->Icompiling.cop_file, PL_compiling.cop_file);
11086 ptr_table_store(PL_ptr_table, &proto_perl->Icompiling, &PL_compiling);
11087 if (!specialWARN(PL_compiling.cop_warnings))
11088 PL_compiling.cop_warnings = sv_dup_inc(PL_compiling.cop_warnings, param);
11089 if (!specialCopIO(PL_compiling.cop_io))
11090 PL_compiling.cop_io = sv_dup_inc(PL_compiling.cop_io, param);
11091 PL_curcop = (COP*)any_dup(proto_perl->Tcurcop, proto_perl);
11093 /* pseudo environmental stuff */
11094 PL_origargc = proto_perl->Iorigargc;
11095 PL_origargv = proto_perl->Iorigargv;
11097 param->stashes = newAV(); /* Setup array of objects to call clone on */
11099 #ifdef PERLIO_LAYERS
11100 /* Clone PerlIO tables as soon as we can handle general xx_dup() */
11101 PerlIO_clone(aTHX_ proto_perl, param);
11104 PL_envgv = gv_dup(proto_perl->Ienvgv, param);
11105 PL_incgv = gv_dup(proto_perl->Iincgv, param);
11106 PL_hintgv = gv_dup(proto_perl->Ihintgv, param);
11107 PL_origfilename = SAVEPV(proto_perl->Iorigfilename);
11108 PL_diehook = sv_dup_inc(proto_perl->Idiehook, param);
11109 PL_warnhook = sv_dup_inc(proto_perl->Iwarnhook, param);
11112 PL_minus_c = proto_perl->Iminus_c;
11113 PL_patchlevel = sv_dup_inc(proto_perl->Ipatchlevel, param);
11114 PL_localpatches = proto_perl->Ilocalpatches;
11115 PL_splitstr = proto_perl->Isplitstr;
11116 PL_preprocess = proto_perl->Ipreprocess;
11117 PL_minus_n = proto_perl->Iminus_n;
11118 PL_minus_p = proto_perl->Iminus_p;
11119 PL_minus_l = proto_perl->Iminus_l;
11120 PL_minus_a = proto_perl->Iminus_a;
11121 PL_minus_F = proto_perl->Iminus_F;
11122 PL_doswitches = proto_perl->Idoswitches;
11123 PL_dowarn = proto_perl->Idowarn;
11124 PL_doextract = proto_perl->Idoextract;
11125 PL_sawampersand = proto_perl->Isawampersand;
11126 PL_unsafe = proto_perl->Iunsafe;
11127 PL_inplace = SAVEPV(proto_perl->Iinplace);
11128 PL_e_script = sv_dup_inc(proto_perl->Ie_script, param);
11129 PL_perldb = proto_perl->Iperldb;
11130 PL_perl_destruct_level = proto_perl->Iperl_destruct_level;
11131 PL_exit_flags = proto_perl->Iexit_flags;
11133 /* magical thingies */
11134 /* XXX time(&PL_basetime) when asked for? */
11135 PL_basetime = proto_perl->Ibasetime;
11136 PL_formfeed = sv_dup(proto_perl->Iformfeed, param);
11138 PL_maxsysfd = proto_perl->Imaxsysfd;
11139 PL_multiline = proto_perl->Imultiline;
11140 PL_statusvalue = proto_perl->Istatusvalue;
11142 PL_statusvalue_vms = proto_perl->Istatusvalue_vms;
11144 PL_encoding = sv_dup(proto_perl->Iencoding, param);
11146 sv_setpvn(PERL_DEBUG_PAD(0), "", 0); /* For regex debugging. */
11147 sv_setpvn(PERL_DEBUG_PAD(1), "", 0); /* ext/re needs these */
11148 sv_setpvn(PERL_DEBUG_PAD(2), "", 0); /* even without DEBUGGING. */
11150 /* Clone the regex array */
11151 PL_regex_padav = newAV();
11153 I32 len = av_len((AV*)proto_perl->Iregex_padav);
11154 SV** regexen = AvARRAY((AV*)proto_perl->Iregex_padav);
11155 av_push(PL_regex_padav,
11156 sv_dup_inc(regexen[0],param));
11157 for(i = 1; i <= len; i++) {
11158 if(SvREPADTMP(regexen[i])) {
11159 av_push(PL_regex_padav, sv_dup_inc(regexen[i], param));
11161 av_push(PL_regex_padav,
11163 newSViv(PTR2IV(re_dup(INT2PTR(REGEXP *,
11164 SvIVX(regexen[i])), param)))
11169 PL_regex_pad = AvARRAY(PL_regex_padav);
11171 /* shortcuts to various I/O objects */
11172 PL_stdingv = gv_dup(proto_perl->Istdingv, param);
11173 PL_stderrgv = gv_dup(proto_perl->Istderrgv, param);
11174 PL_defgv = gv_dup(proto_perl->Idefgv, param);
11175 PL_argvgv = gv_dup(proto_perl->Iargvgv, param);
11176 PL_argvoutgv = gv_dup(proto_perl->Iargvoutgv, param);
11177 PL_argvout_stack = av_dup_inc(proto_perl->Iargvout_stack, param);
11179 /* shortcuts to regexp stuff */
11180 PL_replgv = gv_dup(proto_perl->Ireplgv, param);
11182 /* shortcuts to misc objects */
11183 PL_errgv = gv_dup(proto_perl->Ierrgv, param);
11185 /* shortcuts to debugging objects */
11186 PL_DBgv = gv_dup(proto_perl->IDBgv, param);
11187 PL_DBline = gv_dup(proto_perl->IDBline, param);
11188 PL_DBsub = gv_dup(proto_perl->IDBsub, param);
11189 PL_DBsingle = sv_dup(proto_perl->IDBsingle, param);
11190 PL_DBtrace = sv_dup(proto_perl->IDBtrace, param);
11191 PL_DBsignal = sv_dup(proto_perl->IDBsignal, param);
11192 PL_DBassertion = sv_dup(proto_perl->IDBassertion, param);
11193 PL_lineary = av_dup(proto_perl->Ilineary, param);
11194 PL_dbargs = av_dup(proto_perl->Idbargs, param);
11196 /* symbol tables */
11197 PL_defstash = hv_dup_inc(proto_perl->Tdefstash, param);
11198 PL_curstash = hv_dup(proto_perl->Tcurstash, param);
11199 PL_debstash = hv_dup(proto_perl->Idebstash, param);
11200 PL_globalstash = hv_dup(proto_perl->Iglobalstash, param);
11201 PL_curstname = sv_dup_inc(proto_perl->Icurstname, param);
11203 PL_beginav = av_dup_inc(proto_perl->Ibeginav, param);
11204 PL_beginav_save = av_dup_inc(proto_perl->Ibeginav_save, param);
11205 PL_checkav_save = av_dup_inc(proto_perl->Icheckav_save, param);
11206 PL_endav = av_dup_inc(proto_perl->Iendav, param);
11207 PL_checkav = av_dup_inc(proto_perl->Icheckav, param);
11208 PL_initav = av_dup_inc(proto_perl->Iinitav, param);
11210 PL_sub_generation = proto_perl->Isub_generation;
11212 /* funky return mechanisms */
11213 PL_forkprocess = proto_perl->Iforkprocess;
11215 /* subprocess state */
11216 PL_fdpid = av_dup_inc(proto_perl->Ifdpid, param);
11218 /* internal state */
11219 PL_tainting = proto_perl->Itainting;
11220 PL_taint_warn = proto_perl->Itaint_warn;
11221 PL_maxo = proto_perl->Imaxo;
11222 if (proto_perl->Iop_mask)
11223 PL_op_mask = SAVEPVN(proto_perl->Iop_mask, PL_maxo);
11225 PL_op_mask = Nullch;
11226 /* PL_asserting = proto_perl->Iasserting; */
11228 /* current interpreter roots */
11229 PL_main_cv = cv_dup_inc(proto_perl->Imain_cv, param);
11230 PL_main_root = OpREFCNT_inc(proto_perl->Imain_root);
11231 PL_main_start = proto_perl->Imain_start;
11232 PL_eval_root = proto_perl->Ieval_root;
11233 PL_eval_start = proto_perl->Ieval_start;
11235 /* runtime control stuff */
11236 PL_curcopdb = (COP*)any_dup(proto_perl->Icurcopdb, proto_perl);
11237 PL_copline = proto_perl->Icopline;
11239 PL_filemode = proto_perl->Ifilemode;
11240 PL_lastfd = proto_perl->Ilastfd;
11241 PL_oldname = proto_perl->Ioldname; /* XXX not quite right */
11244 PL_gensym = proto_perl->Igensym;
11245 PL_preambled = proto_perl->Ipreambled;
11246 PL_preambleav = av_dup_inc(proto_perl->Ipreambleav, param);
11247 PL_laststatval = proto_perl->Ilaststatval;
11248 PL_laststype = proto_perl->Ilaststype;
11249 PL_mess_sv = Nullsv;
11251 PL_ors_sv = sv_dup_inc(proto_perl->Iors_sv, param);
11252 PL_ofmt = SAVEPV(proto_perl->Iofmt);
11254 /* interpreter atexit processing */
11255 PL_exitlistlen = proto_perl->Iexitlistlen;
11256 if (PL_exitlistlen) {
11257 New(0, PL_exitlist, PL_exitlistlen, PerlExitListEntry);
11258 Copy(proto_perl->Iexitlist, PL_exitlist, PL_exitlistlen, PerlExitListEntry);
11261 PL_exitlist = (PerlExitListEntry*)NULL;
11262 PL_modglobal = hv_dup_inc(proto_perl->Imodglobal, param);
11263 PL_custom_op_names = hv_dup_inc(proto_perl->Icustom_op_names,param);
11264 PL_custom_op_descs = hv_dup_inc(proto_perl->Icustom_op_descs,param);
11266 PL_profiledata = NULL;
11267 PL_rsfp = fp_dup(proto_perl->Irsfp, '<', param);
11268 /* PL_rsfp_filters entries have fake IoDIRP() */
11269 PL_rsfp_filters = av_dup_inc(proto_perl->Irsfp_filters, param);
11271 PL_compcv = cv_dup(proto_perl->Icompcv, param);
11273 PAD_CLONE_VARS(proto_perl, param);
11275 #ifdef HAVE_INTERP_INTERN
11276 sys_intern_dup(&proto_perl->Isys_intern, &PL_sys_intern);
11279 /* more statics moved here */
11280 PL_generation = proto_perl->Igeneration;
11281 PL_DBcv = cv_dup(proto_perl->IDBcv, param);
11283 PL_in_clean_objs = proto_perl->Iin_clean_objs;
11284 PL_in_clean_all = proto_perl->Iin_clean_all;
11286 PL_uid = proto_perl->Iuid;
11287 PL_euid = proto_perl->Ieuid;
11288 PL_gid = proto_perl->Igid;
11289 PL_egid = proto_perl->Iegid;
11290 PL_nomemok = proto_perl->Inomemok;
11291 PL_an = proto_perl->Ian;
11292 PL_op_seqmax = proto_perl->Iop_seqmax;
11293 PL_evalseq = proto_perl->Ievalseq;
11294 PL_origenviron = proto_perl->Iorigenviron; /* XXX not quite right */
11295 PL_origalen = proto_perl->Iorigalen;
11296 PL_pidstatus = newHV(); /* XXX flag for cloning? */
11297 PL_osname = SAVEPV(proto_perl->Iosname);
11298 PL_sh_path_compat = proto_perl->Ish_path_compat; /* XXX never deallocated */
11299 PL_sighandlerp = proto_perl->Isighandlerp;
11302 PL_runops = proto_perl->Irunops;
11304 Copy(proto_perl->Itokenbuf, PL_tokenbuf, 256, char);
11307 PL_cshlen = proto_perl->Icshlen;
11308 PL_cshname = proto_perl->Icshname; /* XXX never deallocated */
11311 PL_lex_state = proto_perl->Ilex_state;
11312 PL_lex_defer = proto_perl->Ilex_defer;
11313 PL_lex_expect = proto_perl->Ilex_expect;
11314 PL_lex_formbrack = proto_perl->Ilex_formbrack;
11315 PL_lex_dojoin = proto_perl->Ilex_dojoin;
11316 PL_lex_starts = proto_perl->Ilex_starts;
11317 PL_lex_stuff = sv_dup_inc(proto_perl->Ilex_stuff, param);
11318 PL_lex_repl = sv_dup_inc(proto_perl->Ilex_repl, param);
11319 PL_lex_op = proto_perl->Ilex_op;
11320 PL_lex_inpat = proto_perl->Ilex_inpat;
11321 PL_lex_inwhat = proto_perl->Ilex_inwhat;
11322 PL_lex_brackets = proto_perl->Ilex_brackets;
11323 i = (PL_lex_brackets < 120 ? 120 : PL_lex_brackets);
11324 PL_lex_brackstack = SAVEPVN(proto_perl->Ilex_brackstack,i);
11325 PL_lex_casemods = proto_perl->Ilex_casemods;
11326 i = (PL_lex_casemods < 12 ? 12 : PL_lex_casemods);
11327 PL_lex_casestack = SAVEPVN(proto_perl->Ilex_casestack,i);
11329 Copy(proto_perl->Inextval, PL_nextval, 5, YYSTYPE);
11330 Copy(proto_perl->Inexttype, PL_nexttype, 5, I32);
11331 PL_nexttoke = proto_perl->Inexttoke;
11333 /* XXX This is probably masking the deeper issue of why
11334 * SvANY(proto_perl->Ilinestr) can be NULL at this point. For test case:
11335 * http://archive.develooper.com/perl5-porters%40perl.org/msg83298.html
11336 * (A little debugging with a watchpoint on it may help.)
11338 if (SvANY(proto_perl->Ilinestr)) {
11339 PL_linestr = sv_dup_inc(proto_perl->Ilinestr, param);
11340 i = proto_perl->Ibufptr - SvPVX(proto_perl->Ilinestr);
11341 PL_bufptr = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
11342 i = proto_perl->Ioldbufptr - SvPVX(proto_perl->Ilinestr);
11343 PL_oldbufptr = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
11344 i = proto_perl->Ioldoldbufptr - SvPVX(proto_perl->Ilinestr);
11345 PL_oldoldbufptr = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
11346 i = proto_perl->Ilinestart - SvPVX(proto_perl->Ilinestr);
11347 PL_linestart = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
11350 PL_linestr = NEWSV(65,79);
11351 sv_upgrade(PL_linestr,SVt_PVIV);
11352 sv_setpvn(PL_linestr,"",0);
11353 PL_bufptr = PL_oldbufptr = PL_oldoldbufptr = PL_linestart = SvPVX(PL_linestr);
11355 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
11356 PL_pending_ident = proto_perl->Ipending_ident;
11357 PL_sublex_info = proto_perl->Isublex_info; /* XXX not quite right */
11359 PL_expect = proto_perl->Iexpect;
11361 PL_multi_start = proto_perl->Imulti_start;
11362 PL_multi_end = proto_perl->Imulti_end;
11363 PL_multi_open = proto_perl->Imulti_open;
11364 PL_multi_close = proto_perl->Imulti_close;
11366 PL_error_count = proto_perl->Ierror_count;
11367 PL_subline = proto_perl->Isubline;
11368 PL_subname = sv_dup_inc(proto_perl->Isubname, param);
11370 /* XXX See comment on SvANY(proto_perl->Ilinestr) above */
11371 if (SvANY(proto_perl->Ilinestr)) {
11372 i = proto_perl->Ilast_uni - SvPVX(proto_perl->Ilinestr);
11373 PL_last_uni = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
11374 i = proto_perl->Ilast_lop - SvPVX(proto_perl->Ilinestr);
11375 PL_last_lop = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
11376 PL_last_lop_op = proto_perl->Ilast_lop_op;
11379 PL_last_uni = SvPVX(PL_linestr);
11380 PL_last_lop = SvPVX(PL_linestr);
11381 PL_last_lop_op = 0;
11383 PL_in_my = proto_perl->Iin_my;
11384 PL_in_my_stash = hv_dup(proto_perl->Iin_my_stash, param);
11386 PL_cryptseen = proto_perl->Icryptseen;
11389 PL_hints = proto_perl->Ihints;
11391 PL_amagic_generation = proto_perl->Iamagic_generation;
11393 #ifdef USE_LOCALE_COLLATE
11394 PL_collation_ix = proto_perl->Icollation_ix;
11395 PL_collation_name = SAVEPV(proto_perl->Icollation_name);
11396 PL_collation_standard = proto_perl->Icollation_standard;
11397 PL_collxfrm_base = proto_perl->Icollxfrm_base;
11398 PL_collxfrm_mult = proto_perl->Icollxfrm_mult;
11399 #endif /* USE_LOCALE_COLLATE */
11401 #ifdef USE_LOCALE_NUMERIC
11402 PL_numeric_name = SAVEPV(proto_perl->Inumeric_name);
11403 PL_numeric_standard = proto_perl->Inumeric_standard;
11404 PL_numeric_local = proto_perl->Inumeric_local;
11405 PL_numeric_radix_sv = sv_dup_inc(proto_perl->Inumeric_radix_sv, param);
11406 #endif /* !USE_LOCALE_NUMERIC */
11408 /* utf8 character classes */
11409 PL_utf8_alnum = sv_dup_inc(proto_perl->Iutf8_alnum, param);
11410 PL_utf8_alnumc = sv_dup_inc(proto_perl->Iutf8_alnumc, param);
11411 PL_utf8_ascii = sv_dup_inc(proto_perl->Iutf8_ascii, param);
11412 PL_utf8_alpha = sv_dup_inc(proto_perl->Iutf8_alpha, param);
11413 PL_utf8_space = sv_dup_inc(proto_perl->Iutf8_space, param);
11414 PL_utf8_cntrl = sv_dup_inc(proto_perl->Iutf8_cntrl, param);
11415 PL_utf8_graph = sv_dup_inc(proto_perl->Iutf8_graph, param);
11416 PL_utf8_digit = sv_dup_inc(proto_perl->Iutf8_digit, param);
11417 PL_utf8_upper = sv_dup_inc(proto_perl->Iutf8_upper, param);
11418 PL_utf8_lower = sv_dup_inc(proto_perl->Iutf8_lower, param);
11419 PL_utf8_print = sv_dup_inc(proto_perl->Iutf8_print, param);
11420 PL_utf8_punct = sv_dup_inc(proto_perl->Iutf8_punct, param);
11421 PL_utf8_xdigit = sv_dup_inc(proto_perl->Iutf8_xdigit, param);
11422 PL_utf8_mark = sv_dup_inc(proto_perl->Iutf8_mark, param);
11423 PL_utf8_toupper = sv_dup_inc(proto_perl->Iutf8_toupper, param);
11424 PL_utf8_totitle = sv_dup_inc(proto_perl->Iutf8_totitle, param);
11425 PL_utf8_tolower = sv_dup_inc(proto_perl->Iutf8_tolower, param);
11426 PL_utf8_tofold = sv_dup_inc(proto_perl->Iutf8_tofold, param);
11427 PL_utf8_idstart = sv_dup_inc(proto_perl->Iutf8_idstart, param);
11428 PL_utf8_idcont = sv_dup_inc(proto_perl->Iutf8_idcont, param);
11430 /* Did the locale setup indicate UTF-8? */
11431 PL_utf8locale = proto_perl->Iutf8locale;
11432 /* Unicode features (see perlrun/-C) */
11433 PL_unicode = proto_perl->Iunicode;
11435 /* Pre-5.8 signals control */
11436 PL_signals = proto_perl->Isignals;
11438 /* times() ticks per second */
11439 PL_clocktick = proto_perl->Iclocktick;
11441 /* Recursion stopper for PerlIO_find_layer */
11442 PL_in_load_module = proto_perl->Iin_load_module;
11444 /* sort() routine */
11445 PL_sort_RealCmp = proto_perl->Isort_RealCmp;
11447 /* Not really needed/useful since the reenrant_retint is "volatile",
11448 * but do it for consistency's sake. */
11449 PL_reentrant_retint = proto_perl->Ireentrant_retint;
11451 /* Hooks to shared SVs and locks. */
11452 PL_sharehook = proto_perl->Isharehook;
11453 PL_lockhook = proto_perl->Ilockhook;
11454 PL_unlockhook = proto_perl->Iunlockhook;
11455 PL_threadhook = proto_perl->Ithreadhook;
11457 PL_runops_std = proto_perl->Irunops_std;
11458 PL_runops_dbg = proto_perl->Irunops_dbg;
11460 #ifdef THREADS_HAVE_PIDS
11461 PL_ppid = proto_perl->Ippid;
11465 PL_last_swash_hv = Nullhv; /* reinits on demand */
11466 PL_last_swash_klen = 0;
11467 PL_last_swash_key[0]= '\0';
11468 PL_last_swash_tmps = (U8*)NULL;
11469 PL_last_swash_slen = 0;
11471 /* perly.c globals */
11472 PL_yydebug = proto_perl->Iyydebug;
11473 PL_yynerrs = proto_perl->Iyynerrs;
11474 PL_yyerrflag = proto_perl->Iyyerrflag;
11475 PL_yychar = proto_perl->Iyychar;
11476 PL_yyval = proto_perl->Iyyval;
11477 PL_yylval = proto_perl->Iyylval;
11479 PL_glob_index = proto_perl->Iglob_index;
11480 PL_srand_called = proto_perl->Isrand_called;
11481 PL_hash_seed = proto_perl->Ihash_seed;
11482 PL_rehash_seed = proto_perl->Irehash_seed;
11483 PL_uudmap['M'] = 0; /* reinits on demand */
11484 PL_bitcount = Nullch; /* reinits on demand */
11486 if (proto_perl->Ipsig_pend) {
11487 Newz(0, PL_psig_pend, SIG_SIZE, int);
11490 PL_psig_pend = (int*)NULL;
11493 if (proto_perl->Ipsig_ptr) {
11494 Newz(0, PL_psig_ptr, SIG_SIZE, SV*);
11495 Newz(0, PL_psig_name, SIG_SIZE, SV*);
11496 for (i = 1; i < SIG_SIZE; i++) {
11497 PL_psig_ptr[i] = sv_dup_inc(proto_perl->Ipsig_ptr[i], param);
11498 PL_psig_name[i] = sv_dup_inc(proto_perl->Ipsig_name[i], param);
11502 PL_psig_ptr = (SV**)NULL;
11503 PL_psig_name = (SV**)NULL;
11506 /* thrdvar.h stuff */
11508 if (flags & CLONEf_COPY_STACKS) {
11509 /* next allocation will be PL_tmps_stack[PL_tmps_ix+1] */
11510 PL_tmps_ix = proto_perl->Ttmps_ix;
11511 PL_tmps_max = proto_perl->Ttmps_max;
11512 PL_tmps_floor = proto_perl->Ttmps_floor;
11513 Newz(50, PL_tmps_stack, PL_tmps_max, SV*);
11515 while (i <= PL_tmps_ix) {
11516 PL_tmps_stack[i] = sv_dup_inc(proto_perl->Ttmps_stack[i], param);
11520 /* next PUSHMARK() sets *(PL_markstack_ptr+1) */
11521 i = proto_perl->Tmarkstack_max - proto_perl->Tmarkstack;
11522 Newz(54, PL_markstack, i, I32);
11523 PL_markstack_max = PL_markstack + (proto_perl->Tmarkstack_max
11524 - proto_perl->Tmarkstack);
11525 PL_markstack_ptr = PL_markstack + (proto_perl->Tmarkstack_ptr
11526 - proto_perl->Tmarkstack);
11527 Copy(proto_perl->Tmarkstack, PL_markstack,
11528 PL_markstack_ptr - PL_markstack + 1, I32);
11530 /* next push_scope()/ENTER sets PL_scopestack[PL_scopestack_ix]
11531 * NOTE: unlike the others! */
11532 PL_scopestack_ix = proto_perl->Tscopestack_ix;
11533 PL_scopestack_max = proto_perl->Tscopestack_max;
11534 Newz(54, PL_scopestack, PL_scopestack_max, I32);
11535 Copy(proto_perl->Tscopestack, PL_scopestack, PL_scopestack_ix, I32);
11537 /* next push_return() sets PL_retstack[PL_retstack_ix]
11538 * NOTE: unlike the others! */
11539 PL_retstack_ix = proto_perl->Tretstack_ix;
11540 PL_retstack_max = proto_perl->Tretstack_max;
11541 Newz(54, PL_retstack, PL_retstack_max, OP*);
11542 Copy(proto_perl->Tretstack, PL_retstack, PL_retstack_ix, OP*);
11544 /* NOTE: si_dup() looks at PL_markstack */
11545 PL_curstackinfo = si_dup(proto_perl->Tcurstackinfo, param);
11547 /* PL_curstack = PL_curstackinfo->si_stack; */
11548 PL_curstack = av_dup(proto_perl->Tcurstack, param);
11549 PL_mainstack = av_dup(proto_perl->Tmainstack, param);
11551 /* next PUSHs() etc. set *(PL_stack_sp+1) */
11552 PL_stack_base = AvARRAY(PL_curstack);
11553 PL_stack_sp = PL_stack_base + (proto_perl->Tstack_sp
11554 - proto_perl->Tstack_base);
11555 PL_stack_max = PL_stack_base + AvMAX(PL_curstack);
11557 /* next SSPUSHFOO() sets PL_savestack[PL_savestack_ix]
11558 * NOTE: unlike the others! */
11559 PL_savestack_ix = proto_perl->Tsavestack_ix;
11560 PL_savestack_max = proto_perl->Tsavestack_max;
11561 /*Newz(54, PL_savestack, PL_savestack_max, ANY);*/
11562 PL_savestack = ss_dup(proto_perl, param);
11566 ENTER; /* perl_destruct() wants to LEAVE; */
11569 PL_start_env = proto_perl->Tstart_env; /* XXXXXX */
11570 PL_top_env = &PL_start_env;
11572 PL_op = proto_perl->Top;
11575 PL_Xpv = (XPV*)NULL;
11576 PL_na = proto_perl->Tna;
11578 PL_statbuf = proto_perl->Tstatbuf;
11579 PL_statcache = proto_perl->Tstatcache;
11580 PL_statgv = gv_dup(proto_perl->Tstatgv, param);
11581 PL_statname = sv_dup_inc(proto_perl->Tstatname, param);
11583 PL_timesbuf = proto_perl->Ttimesbuf;
11586 PL_tainted = proto_perl->Ttainted;
11587 PL_curpm = proto_perl->Tcurpm; /* XXX No PMOP ref count */
11588 PL_rs = sv_dup_inc(proto_perl->Trs, param);
11589 PL_last_in_gv = gv_dup(proto_perl->Tlast_in_gv, param);
11590 PL_ofs_sv = sv_dup_inc(proto_perl->Tofs_sv, param);
11591 PL_defoutgv = gv_dup_inc(proto_perl->Tdefoutgv, param);
11592 PL_chopset = proto_perl->Tchopset; /* XXX never deallocated */
11593 PL_toptarget = sv_dup_inc(proto_perl->Ttoptarget, param);
11594 PL_bodytarget = sv_dup_inc(proto_perl->Tbodytarget, param);
11595 PL_formtarget = sv_dup(proto_perl->Tformtarget, param);
11597 PL_restartop = proto_perl->Trestartop;
11598 PL_in_eval = proto_perl->Tin_eval;
11599 PL_delaymagic = proto_perl->Tdelaymagic;
11600 PL_dirty = proto_perl->Tdirty;
11601 PL_localizing = proto_perl->Tlocalizing;
11603 #ifdef PERL_FLEXIBLE_EXCEPTIONS
11604 PL_protect = proto_perl->Tprotect;
11606 PL_errors = sv_dup_inc(proto_perl->Terrors, param);
11607 PL_hv_fetch_ent_mh = Nullhe;
11608 PL_modcount = proto_perl->Tmodcount;
11609 PL_lastgotoprobe = Nullop;
11610 PL_dumpindent = proto_perl->Tdumpindent;
11612 PL_sortcop = (OP*)any_dup(proto_perl->Tsortcop, proto_perl);
11613 PL_sortstash = hv_dup(proto_perl->Tsortstash, param);
11614 PL_firstgv = gv_dup(proto_perl->Tfirstgv, param);
11615 PL_secondgv = gv_dup(proto_perl->Tsecondgv, param);
11616 PL_sortcxix = proto_perl->Tsortcxix;
11617 PL_efloatbuf = Nullch; /* reinits on demand */
11618 PL_efloatsize = 0; /* reinits on demand */
11622 PL_screamfirst = NULL;
11623 PL_screamnext = NULL;
11624 PL_maxscream = -1; /* reinits on demand */
11625 PL_lastscream = Nullsv;
11627 PL_watchaddr = NULL;
11628 PL_watchok = Nullch;
11630 PL_regdummy = proto_perl->Tregdummy;
11631 PL_regprecomp = Nullch;
11634 PL_colorset = 0; /* reinits PL_colors[] */
11635 /*PL_colors[6] = {0,0,0,0,0,0};*/
11636 PL_reginput = Nullch;
11637 PL_regbol = Nullch;
11638 PL_regeol = Nullch;
11639 PL_regstartp = (I32*)NULL;
11640 PL_regendp = (I32*)NULL;
11641 PL_reglastparen = (U32*)NULL;
11642 PL_reglastcloseparen = (U32*)NULL;
11643 PL_regtill = Nullch;
11644 PL_reg_start_tmp = (char**)NULL;
11645 PL_reg_start_tmpl = 0;
11646 PL_regdata = (struct reg_data*)NULL;
11649 PL_reg_eval_set = 0;
11651 PL_regprogram = (regnode*)NULL;
11653 PL_regcc = (CURCUR*)NULL;
11654 PL_reg_call_cc = (struct re_cc_state*)NULL;
11655 PL_reg_re = (regexp*)NULL;
11656 PL_reg_ganch = Nullch;
11657 PL_reg_sv = Nullsv;
11658 PL_reg_match_utf8 = FALSE;
11659 PL_reg_magic = (MAGIC*)NULL;
11661 PL_reg_oldcurpm = (PMOP*)NULL;
11662 PL_reg_curpm = (PMOP*)NULL;
11663 PL_reg_oldsaved = Nullch;
11664 PL_reg_oldsavedlen = 0;
11665 #ifdef PERL_COPY_ON_WRITE
11668 PL_reg_maxiter = 0;
11669 PL_reg_leftiter = 0;
11670 PL_reg_poscache = Nullch;
11671 PL_reg_poscache_size= 0;
11673 /* RE engine - function pointers */
11674 PL_regcompp = proto_perl->Tregcompp;
11675 PL_regexecp = proto_perl->Tregexecp;
11676 PL_regint_start = proto_perl->Tregint_start;
11677 PL_regint_string = proto_perl->Tregint_string;
11678 PL_regfree = proto_perl->Tregfree;
11680 PL_reginterp_cnt = 0;
11681 PL_reg_starttry = 0;
11683 /* Pluggable optimizer */
11684 PL_peepp = proto_perl->Tpeepp;
11686 PL_stashcache = newHV();
11688 if (!(flags & CLONEf_KEEP_PTR_TABLE)) {
11689 ptr_table_free(PL_ptr_table);
11690 PL_ptr_table = NULL;
11693 /* Call the ->CLONE method, if it exists, for each of the stashes
11694 identified by sv_dup() above.
11696 while(av_len(param->stashes) != -1) {
11697 HV* stash = (HV*) av_shift(param->stashes);
11698 GV* cloner = gv_fetchmethod_autoload(stash, "CLONE", 0);
11699 if (cloner && GvCV(cloner)) {
11704 XPUSHs(sv_2mortal(newSVpv(HvNAME(stash), 0)));
11706 call_sv((SV*)GvCV(cloner), G_DISCARD);
11712 SvREFCNT_dec(param->stashes);
11717 #endif /* USE_ITHREADS */
11720 =head1 Unicode Support
11722 =for apidoc sv_recode_to_utf8
11724 The encoding is assumed to be an Encode object, on entry the PV
11725 of the sv is assumed to be octets in that encoding, and the sv
11726 will be converted into Unicode (and UTF-8).
11728 If the sv already is UTF-8 (or if it is not POK), or if the encoding
11729 is not a reference, nothing is done to the sv. If the encoding is not
11730 an C<Encode::XS> Encoding object, bad things will happen.
11731 (See F<lib/encoding.pm> and L<Encode>).
11733 The PV of the sv is returned.
11738 Perl_sv_recode_to_utf8(pTHX_ SV *sv, SV *encoding)
11740 if (SvPOK(sv) && !SvUTF8(sv) && !IN_BYTES && SvROK(encoding)) {
11754 Passing sv_yes is wrong - it needs to be or'ed set of constants
11755 for Encode::XS, while UTf-8 decode (currently) assumes a true value means
11756 remove converted chars from source.
11758 Both will default the value - let them.
11760 XPUSHs(&PL_sv_yes);
11763 call_method("decode", G_SCALAR);
11767 s = SvPV(uni, len);
11768 if (s != SvPVX(sv)) {
11769 SvGROW(sv, len + 1);
11770 Move(s, SvPVX(sv), len, char);
11771 SvCUR_set(sv, len);
11772 SvPVX(sv)[len] = 0;
11782 =for apidoc sv_cat_decode
11784 The encoding is assumed to be an Encode object, the PV of the ssv is
11785 assumed to be octets in that encoding and decoding the input starts
11786 from the position which (PV + *offset) pointed to. The dsv will be
11787 concatenated the decoded UTF-8 string from ssv. Decoding will terminate
11788 when the string tstr appears in decoding output or the input ends on
11789 the PV of the ssv. The value which the offset points will be modified
11790 to the last input position on the ssv.
11792 Returns TRUE if the terminator was found, else returns FALSE.
11797 Perl_sv_cat_decode(pTHX_ SV *dsv, SV *encoding,
11798 SV *ssv, int *offset, char *tstr, int tlen)
11801 if (SvPOK(ssv) && SvPOK(dsv) && SvROK(encoding) && offset) {
11812 XPUSHs(offsv = sv_2mortal(newSViv(*offset)));
11813 XPUSHs(sv_2mortal(newSVpvn(tstr, tlen)));
11815 call_method("cat_decode", G_SCALAR);
11817 ret = SvTRUE(TOPs);
11818 *offset = SvIV(offsv);
11824 Perl_croak(aTHX_ "Invalid argument to sv_cat_decode");