3 * Copyright (c) 1991-2002, Larry Wall
5 * You may distribute under the terms of either the GNU General Public
6 * License or the Artistic License, as specified in the README file.
8 * "I wonder what the Entish is for 'yes' and 'no'," he thought.
11 * This file contains the code that creates, manipulates and destroys
12 * scalar values (SVs). The other types (AV, HV, GV, etc.) reuse the
13 * structure of an SV, so their creation and destruction is handled
14 * here; higher-level functions are in av.c, hv.c, and so on. Opcode
15 * level functions (eg. substr, split, join) for each of the types are
26 #ifdef PERL_COPY_ON_WRITE
27 #define SV_COW_NEXT_SV(sv) INT2PTR(SV *,SvUVX(sv))
28 /* This is a pessamistic view. Scalar must be purely a read-write PV to copy-
30 #define CAN_COW_MASK (SVs_OBJECT|SVs_GMG|SVs_SMG|SVf_IOK|SVf_NOK|SVf_POK| \
31 SVf_ROK|SVp_IOK|SVp_NOK|SVp_POK|SVf_FAKE|SVf_OOK| \
32 SVf_BREAK|SVf_READONLY|SVf_AMAGIC)
33 #define CAN_COW_FLAGS (SVp_POK|SVf_POK)
36 /* ============================================================================
38 =head1 Allocation and deallocation of SVs.
40 An SV (or AV, HV, etc.) is allocated in two parts: the head (struct sv,
41 av, hv...) contains type and reference count information, as well as a
42 pointer to the body (struct xrv, xpv, xpviv...), which contains fields
43 specific to each type.
45 Normally, this allocation is done using arenas, which are approximately
46 1K chunks of memory parcelled up into N heads or bodies. The first slot
47 in each arena is reserved, and is used to hold a link to the next arena.
48 In the case of heads, the unused first slot also contains some flags and
49 a note of the number of slots. Snaked through each arena chain is a
50 linked list of free items; when this becomes empty, an extra arena is
51 allocated and divided up into N items which are threaded into the free
54 The following global variables are associated with arenas:
56 PL_sv_arenaroot pointer to list of SV arenas
57 PL_sv_root pointer to list of free SV structures
59 PL_foo_arenaroot pointer to list of foo arenas,
60 PL_foo_root pointer to list of free foo bodies
61 ... for foo in xiv, xnv, xrv, xpv etc.
63 Note that some of the larger and more rarely used body types (eg xpvio)
64 are not allocated using arenas, but are instead just malloc()/free()ed as
65 required. Also, if PURIFY is defined, arenas are abandoned altogether,
66 with all items individually malloc()ed. In addition, a few SV heads are
67 not allocated from an arena, but are instead directly created as static
68 or auto variables, eg PL_sv_undef.
70 The SV arena serves the secondary purpose of allowing still-live SVs
71 to be located and destroyed during final cleanup.
73 At the lowest level, the macros new_SV() and del_SV() grab and free
74 an SV head. (If debugging with -DD, del_SV() calls the function S_del_sv()
75 to return the SV to the free list with error checking.) new_SV() calls
76 more_sv() / sv_add_arena() to add an extra arena if the free list is empty.
77 SVs in the free list have their SvTYPE field set to all ones.
79 Similarly, there are macros new_XIV()/del_XIV(), new_XNV()/del_XNV() etc
80 that allocate and return individual body types. Normally these are mapped
81 to the arena-manipulating functions new_xiv()/del_xiv() etc, but may be
82 instead mapped directly to malloc()/free() if PURIFY is defined. The
83 new/del functions remove from, or add to, the appropriate PL_foo_root
84 list, and call more_xiv() etc to add a new arena if the list is empty.
86 At the time of very final cleanup, sv_free_arenas() is called from
87 perl_destruct() to physically free all the arenas allocated since the
88 start of the interpreter. Note that this also clears PL_he_arenaroot,
89 which is otherwise dealt with in hv.c.
91 Manipulation of any of the PL_*root pointers is protected by enclosing
92 LOCK_SV_MUTEX; ... UNLOCK_SV_MUTEX calls which should Do the Right Thing
93 if threads are enabled.
95 The function visit() scans the SV arenas list, and calls a specified
96 function for each SV it finds which is still live - ie which has an SvTYPE
97 other than all 1's, and a non-zero SvREFCNT. visit() is used by the
98 following functions (specified as [function that calls visit()] / [function
99 called by visit() for each SV]):
101 sv_report_used() / do_report_used()
102 dump all remaining SVs (debugging aid)
104 sv_clean_objs() / do_clean_objs(),do_clean_named_objs()
105 Attempt to free all objects pointed to by RVs,
106 and, unless DISABLE_DESTRUCTOR_KLUDGE is defined,
107 try to do the same for all objects indirectly
108 referenced by typeglobs too. Called once from
109 perl_destruct(), prior to calling sv_clean_all()
112 sv_clean_all() / do_clean_all()
113 SvREFCNT_dec(sv) each remaining SV, possibly
114 triggering an sv_free(). It also sets the
115 SVf_BREAK flag on the SV to indicate that the
116 refcnt has been artificially lowered, and thus
117 stopping sv_free() from giving spurious warnings
118 about SVs which unexpectedly have a refcnt
119 of zero. called repeatedly from perl_destruct()
120 until there are no SVs left.
124 Private API to rest of sv.c
128 new_XIV(), del_XIV(),
129 new_XNV(), del_XNV(),
134 sv_report_used(), sv_clean_objs(), sv_clean_all(), sv_free_arenas()
139 ============================================================================ */
144 * "A time to plant, and a time to uproot what was planted..."
147 #define plant_SV(p) \
149 SvANY(p) = (void *)PL_sv_root; \
150 SvFLAGS(p) = SVTYPEMASK; \
155 /* sv_mutex must be held while calling uproot_SV() */
156 #define uproot_SV(p) \
159 PL_sv_root = (SV*)SvANY(p); \
164 /* new_SV(): return a new, empty SV head */
180 /* del_SV(): return an empty SV head to the free list */
195 S_del_sv(pTHX_ SV *p)
202 for (sva = PL_sv_arenaroot; sva; sva = (SV *) SvANY(sva)) {
204 svend = &sva[SvREFCNT(sva)];
205 if (p >= sv && p < svend)
209 if (ckWARN_d(WARN_INTERNAL))
210 Perl_warner(aTHX_ packWARN(WARN_INTERNAL),
211 "Attempt to free non-arena SV: 0x%"UVxf,
219 #else /* ! DEBUGGING */
221 #define del_SV(p) plant_SV(p)
223 #endif /* DEBUGGING */
227 =head1 SV Manipulation Functions
229 =for apidoc sv_add_arena
231 Given a chunk of memory, link it to the head of the list of arenas,
232 and split it into a list of free SVs.
238 Perl_sv_add_arena(pTHX_ char *ptr, U32 size, U32 flags)
243 Zero(ptr, size, char);
245 /* The first SV in an arena isn't an SV. */
246 SvANY(sva) = (void *) PL_sv_arenaroot; /* ptr to next arena */
247 SvREFCNT(sva) = size / sizeof(SV); /* number of SV slots */
248 SvFLAGS(sva) = flags; /* FAKE if not to be freed */
250 PL_sv_arenaroot = sva;
251 PL_sv_root = sva + 1;
253 svend = &sva[SvREFCNT(sva) - 1];
256 SvANY(sv) = (void *)(SV*)(sv + 1);
257 SvFLAGS(sv) = SVTYPEMASK;
261 SvFLAGS(sv) = SVTYPEMASK;
264 /* make some more SVs by adding another arena */
266 /* sv_mutex must be held while calling more_sv() */
273 sv_add_arena(PL_nice_chunk, PL_nice_chunk_size, 0);
274 PL_nice_chunk = Nullch;
275 PL_nice_chunk_size = 0;
278 char *chunk; /* must use New here to match call to */
279 New(704,chunk,1008,char); /* Safefree() in sv_free_arenas() */
280 sv_add_arena(chunk, 1008, 0);
286 /* visit(): call the named function for each non-free SV in the arenas. */
289 S_visit(pTHX_ SVFUNC_t f)
296 for (sva = PL_sv_arenaroot; sva; sva = (SV*)SvANY(sva)) {
297 svend = &sva[SvREFCNT(sva)];
298 for (sv = sva + 1; sv < svend; ++sv) {
299 if (SvTYPE(sv) != SVTYPEMASK && SvREFCNT(sv)) {
310 /* called by sv_report_used() for each live SV */
313 do_report_used(pTHX_ SV *sv)
315 if (SvTYPE(sv) != SVTYPEMASK) {
316 PerlIO_printf(Perl_debug_log, "****\n");
323 =for apidoc sv_report_used
325 Dump the contents of all SVs not yet freed. (Debugging aid).
331 Perl_sv_report_used(pTHX)
334 visit(do_report_used);
338 /* called by sv_clean_objs() for each live SV */
341 do_clean_objs(pTHX_ SV *sv)
345 if (SvROK(sv) && SvOBJECT(rv = SvRV(sv))) {
346 DEBUG_D((PerlIO_printf(Perl_debug_log, "Cleaning object ref:\n "), sv_dump(sv)));
358 /* XXX Might want to check arrays, etc. */
361 /* called by sv_clean_objs() for each live SV */
363 #ifndef DISABLE_DESTRUCTOR_KLUDGE
365 do_clean_named_objs(pTHX_ SV *sv)
367 if (SvTYPE(sv) == SVt_PVGV && GvGP(sv)) {
368 if ( SvOBJECT(GvSV(sv)) ||
369 (GvAV(sv) && SvOBJECT(GvAV(sv))) ||
370 (GvHV(sv) && SvOBJECT(GvHV(sv))) ||
371 (GvIO(sv) && SvOBJECT(GvIO(sv))) ||
372 (GvCV(sv) && SvOBJECT(GvCV(sv))) )
374 DEBUG_D((PerlIO_printf(Perl_debug_log, "Cleaning named glob object:\n "), sv_dump(sv)));
382 =for apidoc sv_clean_objs
384 Attempt to destroy all objects not yet freed
390 Perl_sv_clean_objs(pTHX)
392 PL_in_clean_objs = TRUE;
393 visit(do_clean_objs);
394 #ifndef DISABLE_DESTRUCTOR_KLUDGE
395 /* some barnacles may yet remain, clinging to typeglobs */
396 visit(do_clean_named_objs);
398 PL_in_clean_objs = FALSE;
401 /* called by sv_clean_all() for each live SV */
404 do_clean_all(pTHX_ SV *sv)
406 DEBUG_D((PerlIO_printf(Perl_debug_log, "Cleaning loops: SV at 0x%"UVxf"\n", PTR2UV(sv)) ));
407 SvFLAGS(sv) |= SVf_BREAK;
412 =for apidoc sv_clean_all
414 Decrement the refcnt of each remaining SV, possibly triggering a
415 cleanup. This function may have to be called multiple times to free
416 SVs which are in complex self-referential hierarchies.
422 Perl_sv_clean_all(pTHX)
425 PL_in_clean_all = TRUE;
426 cleaned = visit(do_clean_all);
427 PL_in_clean_all = FALSE;
432 =for apidoc sv_free_arenas
434 Deallocate the memory used by all arenas. Note that all the individual SV
435 heads and bodies within the arenas must already have been freed.
441 Perl_sv_free_arenas(pTHX)
445 XPV *arena, *arenanext;
447 /* Free arenas here, but be careful about fake ones. (We assume
448 contiguity of the fake ones with the corresponding real ones.) */
450 for (sva = PL_sv_arenaroot; sva; sva = svanext) {
451 svanext = (SV*) SvANY(sva);
452 while (svanext && SvFAKE(svanext))
453 svanext = (SV*) SvANY(svanext);
456 Safefree((void *)sva);
459 for (arena = PL_xiv_arenaroot; arena; arena = arenanext) {
460 arenanext = (XPV*)arena->xpv_pv;
463 PL_xiv_arenaroot = 0;
465 for (arena = PL_xnv_arenaroot; arena; arena = arenanext) {
466 arenanext = (XPV*)arena->xpv_pv;
469 PL_xnv_arenaroot = 0;
471 for (arena = PL_xrv_arenaroot; arena; arena = arenanext) {
472 arenanext = (XPV*)arena->xpv_pv;
475 PL_xrv_arenaroot = 0;
477 for (arena = PL_xpv_arenaroot; arena; arena = arenanext) {
478 arenanext = (XPV*)arena->xpv_pv;
481 PL_xpv_arenaroot = 0;
483 for (arena = (XPV*)PL_xpviv_arenaroot; arena; arena = arenanext) {
484 arenanext = (XPV*)arena->xpv_pv;
487 PL_xpviv_arenaroot = 0;
489 for (arena = (XPV*)PL_xpvnv_arenaroot; arena; arena = arenanext) {
490 arenanext = (XPV*)arena->xpv_pv;
493 PL_xpvnv_arenaroot = 0;
495 for (arena = (XPV*)PL_xpvcv_arenaroot; arena; arena = arenanext) {
496 arenanext = (XPV*)arena->xpv_pv;
499 PL_xpvcv_arenaroot = 0;
501 for (arena = (XPV*)PL_xpvav_arenaroot; arena; arena = arenanext) {
502 arenanext = (XPV*)arena->xpv_pv;
505 PL_xpvav_arenaroot = 0;
507 for (arena = (XPV*)PL_xpvhv_arenaroot; arena; arena = arenanext) {
508 arenanext = (XPV*)arena->xpv_pv;
511 PL_xpvhv_arenaroot = 0;
513 for (arena = (XPV*)PL_xpvmg_arenaroot; arena; arena = arenanext) {
514 arenanext = (XPV*)arena->xpv_pv;
517 PL_xpvmg_arenaroot = 0;
519 for (arena = (XPV*)PL_xpvlv_arenaroot; arena; arena = arenanext) {
520 arenanext = (XPV*)arena->xpv_pv;
523 PL_xpvlv_arenaroot = 0;
525 for (arena = (XPV*)PL_xpvbm_arenaroot; arena; arena = arenanext) {
526 arenanext = (XPV*)arena->xpv_pv;
529 PL_xpvbm_arenaroot = 0;
531 for (arena = (XPV*)PL_he_arenaroot; arena; arena = arenanext) {
532 arenanext = (XPV*)arena->xpv_pv;
538 Safefree(PL_nice_chunk);
539 PL_nice_chunk = Nullch;
540 PL_nice_chunk_size = 0;
546 =for apidoc report_uninit
548 Print appropriate "Use of uninitialized variable" warning
554 Perl_report_uninit(pTHX)
557 Perl_warner(aTHX_ packWARN(WARN_UNINITIALIZED), PL_warn_uninit,
558 " in ", OP_DESC(PL_op));
560 Perl_warner(aTHX_ packWARN(WARN_UNINITIALIZED), PL_warn_uninit, "", "");
563 /* grab a new IV body from the free list, allocating more if necessary */
574 * See comment in more_xiv() -- RAM.
576 PL_xiv_root = *(IV**)xiv;
578 return (XPVIV*)((char*)xiv - STRUCT_OFFSET(XPVIV, xiv_iv));
581 /* return an IV body to the free list */
584 S_del_xiv(pTHX_ XPVIV *p)
586 IV* xiv = (IV*)((char*)(p) + STRUCT_OFFSET(XPVIV, xiv_iv));
588 *(IV**)xiv = PL_xiv_root;
593 /* allocate another arena's worth of IV bodies */
601 New(705, ptr, 1008/sizeof(XPV), XPV);
602 ptr->xpv_pv = (char*)PL_xiv_arenaroot; /* linked list of xiv arenas */
603 PL_xiv_arenaroot = ptr; /* to keep Purify happy */
606 xivend = &xiv[1008 / sizeof(IV) - 1];
607 xiv += (sizeof(XPV) - 1) / sizeof(IV) + 1; /* fudge by size of XPV */
609 while (xiv < xivend) {
610 *(IV**)xiv = (IV *)(xiv + 1);
616 /* grab a new NV body from the free list, allocating more if necessary */
626 PL_xnv_root = *(NV**)xnv;
628 return (XPVNV*)((char*)xnv - STRUCT_OFFSET(XPVNV, xnv_nv));
631 /* return an NV body to the free list */
634 S_del_xnv(pTHX_ XPVNV *p)
636 NV* xnv = (NV*)((char*)(p) + STRUCT_OFFSET(XPVNV, xnv_nv));
638 *(NV**)xnv = PL_xnv_root;
643 /* allocate another arena's worth of NV bodies */
651 New(711, ptr, 1008/sizeof(XPV), XPV);
652 ptr->xpv_pv = (char*)PL_xnv_arenaroot;
653 PL_xnv_arenaroot = ptr;
656 xnvend = &xnv[1008 / sizeof(NV) - 1];
657 xnv += (sizeof(XPVIV) - 1) / sizeof(NV) + 1; /* fudge by sizeof XPVIV */
659 while (xnv < xnvend) {
660 *(NV**)xnv = (NV*)(xnv + 1);
666 /* grab a new struct xrv from the free list, allocating more if necessary */
676 PL_xrv_root = (XRV*)xrv->xrv_rv;
681 /* return a struct xrv to the free list */
684 S_del_xrv(pTHX_ XRV *p)
687 p->xrv_rv = (SV*)PL_xrv_root;
692 /* allocate another arena's worth of struct xrv */
698 register XRV* xrvend;
700 New(712, ptr, 1008/sizeof(XPV), XPV);
701 ptr->xpv_pv = (char*)PL_xrv_arenaroot;
702 PL_xrv_arenaroot = ptr;
705 xrvend = &xrv[1008 / sizeof(XRV) - 1];
706 xrv += (sizeof(XPV) - 1) / sizeof(XRV) + 1;
708 while (xrv < xrvend) {
709 xrv->xrv_rv = (SV*)(xrv + 1);
715 /* grab a new struct xpv from the free list, allocating more if necessary */
725 PL_xpv_root = (XPV*)xpv->xpv_pv;
730 /* return a struct xpv to the free list */
733 S_del_xpv(pTHX_ XPV *p)
736 p->xpv_pv = (char*)PL_xpv_root;
741 /* allocate another arena's worth of struct xpv */
747 register XPV* xpvend;
748 New(713, xpv, 1008/sizeof(XPV), XPV);
749 xpv->xpv_pv = (char*)PL_xpv_arenaroot;
750 PL_xpv_arenaroot = xpv;
752 xpvend = &xpv[1008 / sizeof(XPV) - 1];
754 while (xpv < xpvend) {
755 xpv->xpv_pv = (char*)(xpv + 1);
761 /* grab a new struct xpviv from the free list, allocating more if necessary */
770 xpviv = PL_xpviv_root;
771 PL_xpviv_root = (XPVIV*)xpviv->xpv_pv;
776 /* return a struct xpviv to the free list */
779 S_del_xpviv(pTHX_ XPVIV *p)
782 p->xpv_pv = (char*)PL_xpviv_root;
787 /* allocate another arena's worth of struct xpviv */
792 register XPVIV* xpviv;
793 register XPVIV* xpvivend;
794 New(714, xpviv, 1008/sizeof(XPVIV), XPVIV);
795 xpviv->xpv_pv = (char*)PL_xpviv_arenaroot;
796 PL_xpviv_arenaroot = xpviv;
798 xpvivend = &xpviv[1008 / sizeof(XPVIV) - 1];
799 PL_xpviv_root = ++xpviv;
800 while (xpviv < xpvivend) {
801 xpviv->xpv_pv = (char*)(xpviv + 1);
807 /* grab a new struct xpvnv from the free list, allocating more if necessary */
816 xpvnv = PL_xpvnv_root;
817 PL_xpvnv_root = (XPVNV*)xpvnv->xpv_pv;
822 /* return a struct xpvnv to the free list */
825 S_del_xpvnv(pTHX_ XPVNV *p)
828 p->xpv_pv = (char*)PL_xpvnv_root;
833 /* allocate another arena's worth of struct xpvnv */
838 register XPVNV* xpvnv;
839 register XPVNV* xpvnvend;
840 New(715, xpvnv, 1008/sizeof(XPVNV), XPVNV);
841 xpvnv->xpv_pv = (char*)PL_xpvnv_arenaroot;
842 PL_xpvnv_arenaroot = xpvnv;
844 xpvnvend = &xpvnv[1008 / sizeof(XPVNV) - 1];
845 PL_xpvnv_root = ++xpvnv;
846 while (xpvnv < xpvnvend) {
847 xpvnv->xpv_pv = (char*)(xpvnv + 1);
853 /* grab a new struct xpvcv from the free list, allocating more if necessary */
862 xpvcv = PL_xpvcv_root;
863 PL_xpvcv_root = (XPVCV*)xpvcv->xpv_pv;
868 /* return a struct xpvcv to the free list */
871 S_del_xpvcv(pTHX_ XPVCV *p)
874 p->xpv_pv = (char*)PL_xpvcv_root;
879 /* allocate another arena's worth of struct xpvcv */
884 register XPVCV* xpvcv;
885 register XPVCV* xpvcvend;
886 New(716, xpvcv, 1008/sizeof(XPVCV), XPVCV);
887 xpvcv->xpv_pv = (char*)PL_xpvcv_arenaroot;
888 PL_xpvcv_arenaroot = xpvcv;
890 xpvcvend = &xpvcv[1008 / sizeof(XPVCV) - 1];
891 PL_xpvcv_root = ++xpvcv;
892 while (xpvcv < xpvcvend) {
893 xpvcv->xpv_pv = (char*)(xpvcv + 1);
899 /* grab a new struct xpvav from the free list, allocating more if necessary */
908 xpvav = PL_xpvav_root;
909 PL_xpvav_root = (XPVAV*)xpvav->xav_array;
914 /* return a struct xpvav to the free list */
917 S_del_xpvav(pTHX_ XPVAV *p)
920 p->xav_array = (char*)PL_xpvav_root;
925 /* allocate another arena's worth of struct xpvav */
930 register XPVAV* xpvav;
931 register XPVAV* xpvavend;
932 New(717, xpvav, 1008/sizeof(XPVAV), XPVAV);
933 xpvav->xav_array = (char*)PL_xpvav_arenaroot;
934 PL_xpvav_arenaroot = xpvav;
936 xpvavend = &xpvav[1008 / sizeof(XPVAV) - 1];
937 PL_xpvav_root = ++xpvav;
938 while (xpvav < xpvavend) {
939 xpvav->xav_array = (char*)(xpvav + 1);
942 xpvav->xav_array = 0;
945 /* grab a new struct xpvhv from the free list, allocating more if necessary */
954 xpvhv = PL_xpvhv_root;
955 PL_xpvhv_root = (XPVHV*)xpvhv->xhv_array;
960 /* return a struct xpvhv to the free list */
963 S_del_xpvhv(pTHX_ XPVHV *p)
966 p->xhv_array = (char*)PL_xpvhv_root;
971 /* allocate another arena's worth of struct xpvhv */
976 register XPVHV* xpvhv;
977 register XPVHV* xpvhvend;
978 New(718, xpvhv, 1008/sizeof(XPVHV), XPVHV);
979 xpvhv->xhv_array = (char*)PL_xpvhv_arenaroot;
980 PL_xpvhv_arenaroot = xpvhv;
982 xpvhvend = &xpvhv[1008 / sizeof(XPVHV) - 1];
983 PL_xpvhv_root = ++xpvhv;
984 while (xpvhv < xpvhvend) {
985 xpvhv->xhv_array = (char*)(xpvhv + 1);
988 xpvhv->xhv_array = 0;
991 /* grab a new struct xpvmg from the free list, allocating more if necessary */
1000 xpvmg = PL_xpvmg_root;
1001 PL_xpvmg_root = (XPVMG*)xpvmg->xpv_pv;
1006 /* return a struct xpvmg to the free list */
1009 S_del_xpvmg(pTHX_ XPVMG *p)
1012 p->xpv_pv = (char*)PL_xpvmg_root;
1017 /* allocate another arena's worth of struct xpvmg */
1022 register XPVMG* xpvmg;
1023 register XPVMG* xpvmgend;
1024 New(719, xpvmg, 1008/sizeof(XPVMG), XPVMG);
1025 xpvmg->xpv_pv = (char*)PL_xpvmg_arenaroot;
1026 PL_xpvmg_arenaroot = xpvmg;
1028 xpvmgend = &xpvmg[1008 / sizeof(XPVMG) - 1];
1029 PL_xpvmg_root = ++xpvmg;
1030 while (xpvmg < xpvmgend) {
1031 xpvmg->xpv_pv = (char*)(xpvmg + 1);
1037 /* grab a new struct xpvlv from the free list, allocating more if necessary */
1046 xpvlv = PL_xpvlv_root;
1047 PL_xpvlv_root = (XPVLV*)xpvlv->xpv_pv;
1052 /* return a struct xpvlv to the free list */
1055 S_del_xpvlv(pTHX_ XPVLV *p)
1058 p->xpv_pv = (char*)PL_xpvlv_root;
1063 /* allocate another arena's worth of struct xpvlv */
1068 register XPVLV* xpvlv;
1069 register XPVLV* xpvlvend;
1070 New(720, xpvlv, 1008/sizeof(XPVLV), XPVLV);
1071 xpvlv->xpv_pv = (char*)PL_xpvlv_arenaroot;
1072 PL_xpvlv_arenaroot = xpvlv;
1074 xpvlvend = &xpvlv[1008 / sizeof(XPVLV) - 1];
1075 PL_xpvlv_root = ++xpvlv;
1076 while (xpvlv < xpvlvend) {
1077 xpvlv->xpv_pv = (char*)(xpvlv + 1);
1083 /* grab a new struct xpvbm from the free list, allocating more if necessary */
1092 xpvbm = PL_xpvbm_root;
1093 PL_xpvbm_root = (XPVBM*)xpvbm->xpv_pv;
1098 /* return a struct xpvbm to the free list */
1101 S_del_xpvbm(pTHX_ XPVBM *p)
1104 p->xpv_pv = (char*)PL_xpvbm_root;
1109 /* allocate another arena's worth of struct xpvbm */
1114 register XPVBM* xpvbm;
1115 register XPVBM* xpvbmend;
1116 New(721, xpvbm, 1008/sizeof(XPVBM), XPVBM);
1117 xpvbm->xpv_pv = (char*)PL_xpvbm_arenaroot;
1118 PL_xpvbm_arenaroot = xpvbm;
1120 xpvbmend = &xpvbm[1008 / sizeof(XPVBM) - 1];
1121 PL_xpvbm_root = ++xpvbm;
1122 while (xpvbm < xpvbmend) {
1123 xpvbm->xpv_pv = (char*)(xpvbm + 1);
1130 # define my_safemalloc(s) (void*)safexmalloc(717,s)
1131 # define my_safefree(p) safexfree((char*)p)
1133 # define my_safemalloc(s) (void*)safemalloc(s)
1134 # define my_safefree(p) safefree((char*)p)
1139 #define new_XIV() my_safemalloc(sizeof(XPVIV))
1140 #define del_XIV(p) my_safefree(p)
1142 #define new_XNV() my_safemalloc(sizeof(XPVNV))
1143 #define del_XNV(p) my_safefree(p)
1145 #define new_XRV() my_safemalloc(sizeof(XRV))
1146 #define del_XRV(p) my_safefree(p)
1148 #define new_XPV() my_safemalloc(sizeof(XPV))
1149 #define del_XPV(p) my_safefree(p)
1151 #define new_XPVIV() my_safemalloc(sizeof(XPVIV))
1152 #define del_XPVIV(p) my_safefree(p)
1154 #define new_XPVNV() my_safemalloc(sizeof(XPVNV))
1155 #define del_XPVNV(p) my_safefree(p)
1157 #define new_XPVCV() my_safemalloc(sizeof(XPVCV))
1158 #define del_XPVCV(p) my_safefree(p)
1160 #define new_XPVAV() my_safemalloc(sizeof(XPVAV))
1161 #define del_XPVAV(p) my_safefree(p)
1163 #define new_XPVHV() my_safemalloc(sizeof(XPVHV))
1164 #define del_XPVHV(p) my_safefree(p)
1166 #define new_XPVMG() my_safemalloc(sizeof(XPVMG))
1167 #define del_XPVMG(p) my_safefree(p)
1169 #define new_XPVLV() my_safemalloc(sizeof(XPVLV))
1170 #define del_XPVLV(p) my_safefree(p)
1172 #define new_XPVBM() my_safemalloc(sizeof(XPVBM))
1173 #define del_XPVBM(p) my_safefree(p)
1177 #define new_XIV() (void*)new_xiv()
1178 #define del_XIV(p) del_xiv((XPVIV*) p)
1180 #define new_XNV() (void*)new_xnv()
1181 #define del_XNV(p) del_xnv((XPVNV*) p)
1183 #define new_XRV() (void*)new_xrv()
1184 #define del_XRV(p) del_xrv((XRV*) p)
1186 #define new_XPV() (void*)new_xpv()
1187 #define del_XPV(p) del_xpv((XPV *)p)
1189 #define new_XPVIV() (void*)new_xpviv()
1190 #define del_XPVIV(p) del_xpviv((XPVIV *)p)
1192 #define new_XPVNV() (void*)new_xpvnv()
1193 #define del_XPVNV(p) del_xpvnv((XPVNV *)p)
1195 #define new_XPVCV() (void*)new_xpvcv()
1196 #define del_XPVCV(p) del_xpvcv((XPVCV *)p)
1198 #define new_XPVAV() (void*)new_xpvav()
1199 #define del_XPVAV(p) del_xpvav((XPVAV *)p)
1201 #define new_XPVHV() (void*)new_xpvhv()
1202 #define del_XPVHV(p) del_xpvhv((XPVHV *)p)
1204 #define new_XPVMG() (void*)new_xpvmg()
1205 #define del_XPVMG(p) del_xpvmg((XPVMG *)p)
1207 #define new_XPVLV() (void*)new_xpvlv()
1208 #define del_XPVLV(p) del_xpvlv((XPVLV *)p)
1210 #define new_XPVBM() (void*)new_xpvbm()
1211 #define del_XPVBM(p) del_xpvbm((XPVBM *)p)
1215 #define new_XPVGV() my_safemalloc(sizeof(XPVGV))
1216 #define del_XPVGV(p) my_safefree(p)
1218 #define new_XPVFM() my_safemalloc(sizeof(XPVFM))
1219 #define del_XPVFM(p) my_safefree(p)
1221 #define new_XPVIO() my_safemalloc(sizeof(XPVIO))
1222 #define del_XPVIO(p) my_safefree(p)
1225 =for apidoc sv_upgrade
1227 Upgrade an SV to a more complex form. Generally adds a new body type to the
1228 SV, then copies across as much information as possible from the old body.
1229 You generally want to use the C<SvUPGRADE> macro wrapper. See also C<svtype>.
1235 Perl_sv_upgrade(pTHX_ register SV *sv, U32 mt)
1242 MAGIC* magic = NULL;
1245 if (mt != SVt_PV && SvIsCOW(sv)) {
1246 sv_force_normal_flags(sv, 0);
1249 if (SvTYPE(sv) == mt)
1253 (void)SvOOK_off(sv);
1255 switch (SvTYPE(sv)) {
1276 else if (mt < SVt_PVIV)
1293 pv = (char*)SvRV(sv);
1313 else if (mt == SVt_NV)
1324 del_XPVIV(SvANY(sv));
1334 del_XPVNV(SvANY(sv));
1342 magic = SvMAGIC(sv);
1343 stash = SvSTASH(sv);
1344 del_XPVMG(SvANY(sv));
1347 Perl_croak(aTHX_ "Can't upgrade that kind of scalar");
1352 Perl_croak(aTHX_ "Can't upgrade to undef");
1354 SvANY(sv) = new_XIV();
1358 SvANY(sv) = new_XNV();
1362 SvANY(sv) = new_XRV();
1366 SvANY(sv) = new_XPV();
1372 SvANY(sv) = new_XPVIV();
1382 SvANY(sv) = new_XPVNV();
1390 SvANY(sv) = new_XPVMG();
1396 SvMAGIC(sv) = magic;
1397 SvSTASH(sv) = stash;
1400 SvANY(sv) = new_XPVLV();
1406 SvMAGIC(sv) = magic;
1407 SvSTASH(sv) = stash;
1414 SvANY(sv) = new_XPVAV();
1422 SvMAGIC(sv) = magic;
1423 SvSTASH(sv) = stash;
1429 SvANY(sv) = new_XPVHV();
1435 HvTOTALKEYS(sv) = 0;
1436 HvPLACEHOLDERS(sv) = 0;
1437 SvMAGIC(sv) = magic;
1438 SvSTASH(sv) = stash;
1445 SvANY(sv) = new_XPVCV();
1446 Zero(SvANY(sv), 1, XPVCV);
1452 SvMAGIC(sv) = magic;
1453 SvSTASH(sv) = stash;
1456 SvANY(sv) = new_XPVGV();
1462 SvMAGIC(sv) = magic;
1463 SvSTASH(sv) = stash;
1471 SvANY(sv) = new_XPVBM();
1477 SvMAGIC(sv) = magic;
1478 SvSTASH(sv) = stash;
1484 SvANY(sv) = new_XPVFM();
1485 Zero(SvANY(sv), 1, XPVFM);
1491 SvMAGIC(sv) = magic;
1492 SvSTASH(sv) = stash;
1495 SvANY(sv) = new_XPVIO();
1496 Zero(SvANY(sv), 1, XPVIO);
1502 SvMAGIC(sv) = magic;
1503 SvSTASH(sv) = stash;
1504 IoPAGE_LEN(sv) = 60;
1507 SvFLAGS(sv) &= ~SVTYPEMASK;
1513 =for apidoc sv_backoff
1515 Remove any string offset. You should normally use the C<SvOOK_off> macro
1522 Perl_sv_backoff(pTHX_ register SV *sv)
1526 char *s = SvPVX(sv);
1527 SvLEN(sv) += SvIVX(sv);
1528 SvPVX(sv) -= SvIVX(sv);
1530 Move(s, SvPVX(sv), SvCUR(sv)+1, char);
1532 SvFLAGS(sv) &= ~SVf_OOK;
1539 Expands the character buffer in the SV. If necessary, uses C<sv_unref> and
1540 upgrades the SV to C<SVt_PV>. Returns a pointer to the character buffer.
1541 Use the C<SvGROW> wrapper instead.
1547 Perl_sv_grow(pTHX_ register SV *sv, register STRLEN newlen)
1553 #ifdef HAS_64K_LIMIT
1554 if (newlen >= 0x10000) {
1555 PerlIO_printf(Perl_debug_log,
1556 "Allocation too large: %"UVxf"\n", (UV)newlen);
1559 #endif /* HAS_64K_LIMIT */
1562 if (SvTYPE(sv) < SVt_PV) {
1563 sv_upgrade(sv, SVt_PV);
1566 else if (SvOOK(sv)) { /* pv is offset? */
1569 if (newlen > SvLEN(sv))
1570 newlen += 10 * (newlen - SvCUR(sv)); /* avoid copy each time */
1571 #ifdef HAS_64K_LIMIT
1572 if (newlen >= 0x10000)
1579 if (newlen > SvLEN(sv)) { /* need more room? */
1580 if (SvLEN(sv) && s) {
1581 #if defined(MYMALLOC) && !defined(LEAKTEST)
1582 STRLEN l = malloced_size((void*)SvPVX(sv));
1588 Renew(s,newlen,char);
1591 New(703, s, newlen, char);
1592 if (SvPVX(sv) && SvCUR(sv)) {
1593 Move(SvPVX(sv), s, (newlen < SvCUR(sv)) ? newlen : SvCUR(sv), char);
1597 SvLEN_set(sv, newlen);
1603 =for apidoc sv_setiv
1605 Copies an integer into the given SV, upgrading first if necessary.
1606 Does not handle 'set' magic. See also C<sv_setiv_mg>.
1612 Perl_sv_setiv(pTHX_ register SV *sv, IV i)
1614 SV_CHECK_THINKFIRST_COW_DROP(sv);
1615 switch (SvTYPE(sv)) {
1617 sv_upgrade(sv, SVt_IV);
1620 sv_upgrade(sv, SVt_PVNV);
1624 sv_upgrade(sv, SVt_PVIV);
1633 Perl_croak(aTHX_ "Can't coerce %s to integer in %s", sv_reftype(sv,0),
1636 (void)SvIOK_only(sv); /* validate number */
1642 =for apidoc sv_setiv_mg
1644 Like C<sv_setiv>, but also handles 'set' magic.
1650 Perl_sv_setiv_mg(pTHX_ register SV *sv, IV i)
1657 =for apidoc sv_setuv
1659 Copies an unsigned integer into the given SV, upgrading first if necessary.
1660 Does not handle 'set' magic. See also C<sv_setuv_mg>.
1666 Perl_sv_setuv(pTHX_ register SV *sv, UV u)
1668 /* With these two if statements:
1669 u=1.49 s=0.52 cu=72.49 cs=10.64 scripts=270 tests=20865
1672 u=1.35 s=0.47 cu=73.45 cs=11.43 scripts=270 tests=20865
1674 If you wish to remove them, please benchmark to see what the effect is
1676 if (u <= (UV)IV_MAX) {
1677 sv_setiv(sv, (IV)u);
1686 =for apidoc sv_setuv_mg
1688 Like C<sv_setuv>, but also handles 'set' magic.
1694 Perl_sv_setuv_mg(pTHX_ register SV *sv, UV u)
1696 /* With these two if statements:
1697 u=1.49 s=0.52 cu=72.49 cs=10.64 scripts=270 tests=20865
1700 u=1.35 s=0.47 cu=73.45 cs=11.43 scripts=270 tests=20865
1702 If you wish to remove them, please benchmark to see what the effect is
1704 if (u <= (UV)IV_MAX) {
1705 sv_setiv(sv, (IV)u);
1715 =for apidoc sv_setnv
1717 Copies a double into the given SV, upgrading first if necessary.
1718 Does not handle 'set' magic. See also C<sv_setnv_mg>.
1724 Perl_sv_setnv(pTHX_ register SV *sv, NV num)
1726 SV_CHECK_THINKFIRST_COW_DROP(sv);
1727 switch (SvTYPE(sv)) {
1730 sv_upgrade(sv, SVt_NV);
1735 sv_upgrade(sv, SVt_PVNV);
1744 Perl_croak(aTHX_ "Can't coerce %s to number in %s", sv_reftype(sv,0),
1748 (void)SvNOK_only(sv); /* validate number */
1753 =for apidoc sv_setnv_mg
1755 Like C<sv_setnv>, but also handles 'set' magic.
1761 Perl_sv_setnv_mg(pTHX_ register SV *sv, NV num)
1767 /* Print an "isn't numeric" warning, using a cleaned-up,
1768 * printable version of the offending string
1772 S_not_a_number(pTHX_ SV *sv)
1779 dsv = sv_2mortal(newSVpv("", 0));
1780 pv = sv_uni_display(dsv, sv, 10, 0);
1783 char *limit = tmpbuf + sizeof(tmpbuf) - 8;
1784 /* each *s can expand to 4 chars + "...\0",
1785 i.e. need room for 8 chars */
1788 for (s = SvPVX(sv), end = s + SvCUR(sv); s < end && d < limit; s++) {
1790 if (ch & 128 && !isPRINT_LC(ch)) {
1799 else if (ch == '\r') {
1803 else if (ch == '\f') {
1807 else if (ch == '\\') {
1811 else if (ch == '\0') {
1815 else if (isPRINT_LC(ch))
1832 Perl_warner(aTHX_ packWARN(WARN_NUMERIC),
1833 "Argument \"%s\" isn't numeric in %s", pv,
1836 Perl_warner(aTHX_ packWARN(WARN_NUMERIC),
1837 "Argument \"%s\" isn't numeric", pv);
1841 =for apidoc looks_like_number
1843 Test if the content of an SV looks like a number (or is a number).
1844 C<Inf> and C<Infinity> are treated as numbers (so will not issue a
1845 non-numeric warning), even if your atof() doesn't grok them.
1851 Perl_looks_like_number(pTHX_ SV *sv)
1853 register char *sbegin;
1860 else if (SvPOKp(sv))
1861 sbegin = SvPV(sv, len);
1863 return 1; /* Historic. Wrong? */
1864 return grok_number(sbegin, len, NULL);
1867 /* Actually, ISO C leaves conversion of UV to IV undefined, but
1868 until proven guilty, assume that things are not that bad... */
1873 As 64 bit platforms often have an NV that doesn't preserve all bits of
1874 an IV (an assumption perl has been based on to date) it becomes necessary
1875 to remove the assumption that the NV always carries enough precision to
1876 recreate the IV whenever needed, and that the NV is the canonical form.
1877 Instead, IV/UV and NV need to be given equal rights. So as to not lose
1878 precision as a side effect of conversion (which would lead to insanity
1879 and the dragon(s) in t/op/numconvert.t getting very angry) the intent is
1880 1) to distinguish between IV/UV/NV slots that have cached a valid
1881 conversion where precision was lost and IV/UV/NV slots that have a
1882 valid conversion which has lost no precision
1883 2) to ensure that if a numeric conversion to one form is requested that
1884 would lose precision, the precise conversion (or differently
1885 imprecise conversion) is also performed and cached, to prevent
1886 requests for different numeric formats on the same SV causing
1887 lossy conversion chains. (lossless conversion chains are perfectly
1892 SvIOKp is true if the IV slot contains a valid value
1893 SvIOK is true only if the IV value is accurate (UV if SvIOK_UV true)
1894 SvNOKp is true if the NV slot contains a valid value
1895 SvNOK is true only if the NV value is accurate
1898 while converting from PV to NV, check to see if converting that NV to an
1899 IV(or UV) would lose accuracy over a direct conversion from PV to
1900 IV(or UV). If it would, cache both conversions, return NV, but mark
1901 SV as IOK NOKp (ie not NOK).
1903 While converting from PV to IV, check to see if converting that IV to an
1904 NV would lose accuracy over a direct conversion from PV to NV. If it
1905 would, cache both conversions, flag similarly.
1907 Before, the SV value "3.2" could become NV=3.2 IV=3 NOK, IOK quite
1908 correctly because if IV & NV were set NV *always* overruled.
1909 Now, "3.2" will become NV=3.2 IV=3 NOK, IOKp, because the flag's meaning
1910 changes - now IV and NV together means that the two are interchangeable:
1911 SvIVX == (IV) SvNVX && SvNVX == (NV) SvIVX;
1913 The benefit of this is that operations such as pp_add know that if
1914 SvIOK is true for both left and right operands, then integer addition
1915 can be used instead of floating point (for cases where the result won't
1916 overflow). Before, floating point was always used, which could lead to
1917 loss of precision compared with integer addition.
1919 * making IV and NV equal status should make maths accurate on 64 bit
1921 * may speed up maths somewhat if pp_add and friends start to use
1922 integers when possible instead of fp. (Hopefully the overhead in
1923 looking for SvIOK and checking for overflow will not outweigh the
1924 fp to integer speedup)
1925 * will slow down integer operations (callers of SvIV) on "inaccurate"
1926 values, as the change from SvIOK to SvIOKp will cause a call into
1927 sv_2iv each time rather than a macro access direct to the IV slot
1928 * should speed up number->string conversion on integers as IV is
1929 favoured when IV and NV are equally accurate
1931 ####################################################################
1932 You had better be using SvIOK_notUV if you want an IV for arithmetic:
1933 SvIOK is true if (IV or UV), so you might be getting (IV)SvUV.
1934 On the other hand, SvUOK is true iff UV.
1935 ####################################################################
1937 Your mileage will vary depending your CPU's relative fp to integer
1941 #ifndef NV_PRESERVES_UV
1942 # define IS_NUMBER_UNDERFLOW_IV 1
1943 # define IS_NUMBER_UNDERFLOW_UV 2
1944 # define IS_NUMBER_IV_AND_UV 2
1945 # define IS_NUMBER_OVERFLOW_IV 4
1946 # define IS_NUMBER_OVERFLOW_UV 5
1948 /* sv_2iuv_non_preserve(): private routine for use by sv_2iv() and sv_2uv() */
1950 /* For sv_2nv these three cases are "SvNOK and don't bother casting" */
1952 S_sv_2iuv_non_preserve(pTHX_ register SV *sv, I32 numtype)
1954 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));
1955 if (SvNVX(sv) < (NV)IV_MIN) {
1956 (void)SvIOKp_on(sv);
1959 return IS_NUMBER_UNDERFLOW_IV;
1961 if (SvNVX(sv) > (NV)UV_MAX) {
1962 (void)SvIOKp_on(sv);
1966 return IS_NUMBER_OVERFLOW_UV;
1968 (void)SvIOKp_on(sv);
1970 /* Can't use strtol etc to convert this string. (See truth table in
1972 if (SvNVX(sv) <= (UV)IV_MAX) {
1973 SvIVX(sv) = I_V(SvNVX(sv));
1974 if ((NV)(SvIVX(sv)) == SvNVX(sv)) {
1975 SvIOK_on(sv); /* Integer is precise. NOK, IOK */
1977 /* Integer is imprecise. NOK, IOKp */
1979 return SvNVX(sv) < 0 ? IS_NUMBER_UNDERFLOW_UV : IS_NUMBER_IV_AND_UV;
1982 SvUVX(sv) = U_V(SvNVX(sv));
1983 if ((NV)(SvUVX(sv)) == SvNVX(sv)) {
1984 if (SvUVX(sv) == UV_MAX) {
1985 /* As we know that NVs don't preserve UVs, UV_MAX cannot
1986 possibly be preserved by NV. Hence, it must be overflow.
1988 return IS_NUMBER_OVERFLOW_UV;
1990 SvIOK_on(sv); /* Integer is precise. NOK, UOK */
1992 /* Integer is imprecise. NOK, IOKp */
1994 return IS_NUMBER_OVERFLOW_IV;
1996 #endif /* !NV_PRESERVES_UV*/
2001 Return the integer value of an SV, doing any necessary string conversion,
2002 magic etc. Normally used via the C<SvIV(sv)> and C<SvIVx(sv)> macros.
2008 Perl_sv_2iv(pTHX_ register SV *sv)
2012 if (SvGMAGICAL(sv)) {
2017 return I_V(SvNVX(sv));
2019 if (SvPOKp(sv) && SvLEN(sv))
2022 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
2023 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
2029 if (SvTHINKFIRST(sv)) {
2032 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv,numer)) &&
2033 (SvTYPE(tmpstr) != SVt_RV || (SvRV(tmpstr) != SvRV(sv))))
2034 return SvIV(tmpstr);
2035 return PTR2IV(SvRV(sv));
2038 sv_force_normal_flags(sv, 0);
2040 if (SvREADONLY(sv) && !SvOK(sv)) {
2041 if (ckWARN(WARN_UNINITIALIZED))
2048 return (IV)(SvUVX(sv));
2055 /* erm. not sure. *should* never get NOKp (without NOK) from sv_2nv
2056 * without also getting a cached IV/UV from it at the same time
2057 * (ie PV->NV conversion should detect loss of accuracy and cache
2058 * IV or UV at same time to avoid this. NWC */
2060 if (SvTYPE(sv) == SVt_NV)
2061 sv_upgrade(sv, SVt_PVNV);
2063 (void)SvIOKp_on(sv); /* Must do this first, to clear any SvOOK */
2064 /* < not <= as for NV doesn't preserve UV, ((NV)IV_MAX+1) will almost
2065 certainly cast into the IV range at IV_MAX, whereas the correct
2066 answer is the UV IV_MAX +1. Hence < ensures that dodgy boundary
2068 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2069 SvIVX(sv) = I_V(SvNVX(sv));
2070 if (SvNVX(sv) == (NV) SvIVX(sv)
2071 #ifndef NV_PRESERVES_UV
2072 && (((UV)1 << NV_PRESERVES_UV_BITS) >
2073 (UV)(SvIVX(sv) > 0 ? SvIVX(sv) : -SvIVX(sv)))
2074 /* Don't flag it as "accurately an integer" if the number
2075 came from a (by definition imprecise) NV operation, and
2076 we're outside the range of NV integer precision */
2079 SvIOK_on(sv); /* Can this go wrong with rounding? NWC */
2080 DEBUG_c(PerlIO_printf(Perl_debug_log,
2081 "0x%"UVxf" iv(%"NVgf" => %"IVdf") (precise)\n",
2087 /* IV not precise. No need to convert from PV, as NV
2088 conversion would already have cached IV if it detected
2089 that PV->IV would be better than PV->NV->IV
2090 flags already correct - don't set public IOK. */
2091 DEBUG_c(PerlIO_printf(Perl_debug_log,
2092 "0x%"UVxf" iv(%"NVgf" => %"IVdf") (imprecise)\n",
2097 /* Can the above go wrong if SvIVX == IV_MIN and SvNVX < IV_MIN,
2098 but the cast (NV)IV_MIN rounds to a the value less (more
2099 negative) than IV_MIN which happens to be equal to SvNVX ??
2100 Analogous to 0xFFFFFFFFFFFFFFFF rounding up to NV (2**64) and
2101 NV rounding back to 0xFFFFFFFFFFFFFFFF, so UVX == UV(NVX) and
2102 (NV)UVX == NVX are both true, but the values differ. :-(
2103 Hopefully for 2s complement IV_MIN is something like
2104 0x8000000000000000 which will be exact. NWC */
2107 SvUVX(sv) = U_V(SvNVX(sv));
2109 (SvNVX(sv) == (NV) SvUVX(sv))
2110 #ifndef NV_PRESERVES_UV
2111 /* Make sure it's not 0xFFFFFFFFFFFFFFFF */
2112 /*&& (SvUVX(sv) != UV_MAX) irrelevant with code below */
2113 && (((UV)1 << NV_PRESERVES_UV_BITS) > SvUVX(sv))
2114 /* Don't flag it as "accurately an integer" if the number
2115 came from a (by definition imprecise) NV operation, and
2116 we're outside the range of NV integer precision */
2122 DEBUG_c(PerlIO_printf(Perl_debug_log,
2123 "0x%"UVxf" 2iv(%"UVuf" => %"IVdf") (as unsigned)\n",
2127 return (IV)SvUVX(sv);
2130 else if (SvPOKp(sv) && SvLEN(sv)) {
2132 int numtype = grok_number(SvPVX(sv), SvCUR(sv), &value);
2133 /* We want to avoid a possible problem when we cache an IV which
2134 may be later translated to an NV, and the resulting NV is not
2135 the same as the direct translation of the initial string
2136 (eg 123.456 can shortcut to the IV 123 with atol(), but we must
2137 be careful to ensure that the value with the .456 is around if the
2138 NV value is requested in the future).
2140 This means that if we cache such an IV, we need to cache the
2141 NV as well. Moreover, we trade speed for space, and do not
2142 cache the NV if we are sure it's not needed.
2145 /* SVt_PVNV is one higher than SVt_PVIV, hence this order */
2146 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2147 == IS_NUMBER_IN_UV) {
2148 /* It's definitely an integer, only upgrade to PVIV */
2149 if (SvTYPE(sv) < SVt_PVIV)
2150 sv_upgrade(sv, SVt_PVIV);
2152 } else if (SvTYPE(sv) < SVt_PVNV)
2153 sv_upgrade(sv, SVt_PVNV);
2155 /* If NV preserves UV then we only use the UV value if we know that
2156 we aren't going to call atof() below. If NVs don't preserve UVs
2157 then the value returned may have more precision than atof() will
2158 return, even though value isn't perfectly accurate. */
2159 if ((numtype & (IS_NUMBER_IN_UV
2160 #ifdef NV_PRESERVES_UV
2163 )) == IS_NUMBER_IN_UV) {
2164 /* This won't turn off the public IOK flag if it was set above */
2165 (void)SvIOKp_on(sv);
2167 if (!(numtype & IS_NUMBER_NEG)) {
2169 if (value <= (UV)IV_MAX) {
2170 SvIVX(sv) = (IV)value;
2176 /* 2s complement assumption */
2177 if (value <= (UV)IV_MIN) {
2178 SvIVX(sv) = -(IV)value;
2180 /* Too negative for an IV. This is a double upgrade, but
2181 I'm assuming it will be rare. */
2182 if (SvTYPE(sv) < SVt_PVNV)
2183 sv_upgrade(sv, SVt_PVNV);
2187 SvNVX(sv) = -(NV)value;
2192 /* For !NV_PRESERVES_UV and IS_NUMBER_IN_UV and IS_NUMBER_NOT_INT we
2193 will be in the previous block to set the IV slot, and the next
2194 block to set the NV slot. So no else here. */
2196 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2197 != IS_NUMBER_IN_UV) {
2198 /* It wasn't an (integer that doesn't overflow the UV). */
2199 SvNVX(sv) = Atof(SvPVX(sv));
2201 if (! numtype && ckWARN(WARN_NUMERIC))
2204 #if defined(USE_LONG_DOUBLE)
2205 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2iv(%" PERL_PRIgldbl ")\n",
2206 PTR2UV(sv), SvNVX(sv)));
2208 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2iv(%"NVgf")\n",
2209 PTR2UV(sv), SvNVX(sv)));
2213 #ifdef NV_PRESERVES_UV
2214 (void)SvIOKp_on(sv);
2216 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2217 SvIVX(sv) = I_V(SvNVX(sv));
2218 if ((NV)(SvIVX(sv)) == SvNVX(sv)) {
2221 /* Integer is imprecise. NOK, IOKp */
2223 /* UV will not work better than IV */
2225 if (SvNVX(sv) > (NV)UV_MAX) {
2227 /* Integer is inaccurate. NOK, IOKp, is UV */
2231 SvUVX(sv) = U_V(SvNVX(sv));
2232 /* 0xFFFFFFFFFFFFFFFF not an issue in here */
2233 if ((NV)(SvUVX(sv)) == SvNVX(sv)) {
2237 /* Integer is imprecise. NOK, IOKp, is UV */
2243 #else /* NV_PRESERVES_UV */
2244 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2245 == (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT)) {
2246 /* The IV slot will have been set from value returned by
2247 grok_number above. The NV slot has just been set using
2250 assert (SvIOKp(sv));
2252 if (((UV)1 << NV_PRESERVES_UV_BITS) >
2253 U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))) {
2254 /* Small enough to preserve all bits. */
2255 (void)SvIOKp_on(sv);
2257 SvIVX(sv) = I_V(SvNVX(sv));
2258 if ((NV)(SvIVX(sv)) == SvNVX(sv))
2260 /* Assumption: first non-preserved integer is < IV_MAX,
2261 this NV is in the preserved range, therefore: */
2262 if (!(U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))
2264 Perl_croak(aTHX_ "sv_2iv assumed (U_V(fabs(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);
2268 0 0 already failed to read UV.
2269 0 1 already failed to read UV.
2270 1 0 you won't get here in this case. IV/UV
2271 slot set, public IOK, Atof() unneeded.
2272 1 1 already read UV.
2273 so there's no point in sv_2iuv_non_preserve() attempting
2274 to use atol, strtol, strtoul etc. */
2275 if (sv_2iuv_non_preserve (sv, numtype)
2276 >= IS_NUMBER_OVERFLOW_IV)
2280 #endif /* NV_PRESERVES_UV */
2283 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing && !(SvFLAGS(sv) & SVs_PADTMP))
2285 if (SvTYPE(sv) < SVt_IV)
2286 /* Typically the caller expects that sv_any is not NULL now. */
2287 sv_upgrade(sv, SVt_IV);
2290 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2iv(%"IVdf")\n",
2291 PTR2UV(sv),SvIVX(sv)));
2292 return SvIsUV(sv) ? (IV)SvUVX(sv) : SvIVX(sv);
2298 Return the unsigned integer value of an SV, doing any necessary string
2299 conversion, magic etc. Normally used via the C<SvUV(sv)> and C<SvUVx(sv)>
2306 Perl_sv_2uv(pTHX_ register SV *sv)
2310 if (SvGMAGICAL(sv)) {
2315 return U_V(SvNVX(sv));
2316 if (SvPOKp(sv) && SvLEN(sv))
2319 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
2320 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
2326 if (SvTHINKFIRST(sv)) {
2329 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv,numer)) &&
2330 (SvTYPE(tmpstr) != SVt_RV || (SvRV(tmpstr) != SvRV(sv))))
2331 return SvUV(tmpstr);
2332 return PTR2UV(SvRV(sv));
2335 sv_force_normal_flags(sv, 0);
2337 if (SvREADONLY(sv) && !SvOK(sv)) {
2338 if (ckWARN(WARN_UNINITIALIZED))
2348 return (UV)SvIVX(sv);
2352 /* erm. not sure. *should* never get NOKp (without NOK) from sv_2nv
2353 * without also getting a cached IV/UV from it at the same time
2354 * (ie PV->NV conversion should detect loss of accuracy and cache
2355 * IV or UV at same time to avoid this. */
2356 /* IV-over-UV optimisation - choose to cache IV if possible */
2358 if (SvTYPE(sv) == SVt_NV)
2359 sv_upgrade(sv, SVt_PVNV);
2361 (void)SvIOKp_on(sv); /* Must do this first, to clear any SvOOK */
2362 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2363 SvIVX(sv) = I_V(SvNVX(sv));
2364 if (SvNVX(sv) == (NV) SvIVX(sv)
2365 #ifndef NV_PRESERVES_UV
2366 && (((UV)1 << NV_PRESERVES_UV_BITS) >
2367 (UV)(SvIVX(sv) > 0 ? SvIVX(sv) : -SvIVX(sv)))
2368 /* Don't flag it as "accurately an integer" if the number
2369 came from a (by definition imprecise) NV operation, and
2370 we're outside the range of NV integer precision */
2373 SvIOK_on(sv); /* Can this go wrong with rounding? NWC */
2374 DEBUG_c(PerlIO_printf(Perl_debug_log,
2375 "0x%"UVxf" uv(%"NVgf" => %"IVdf") (precise)\n",
2381 /* IV not precise. No need to convert from PV, as NV
2382 conversion would already have cached IV if it detected
2383 that PV->IV would be better than PV->NV->IV
2384 flags already correct - don't set public IOK. */
2385 DEBUG_c(PerlIO_printf(Perl_debug_log,
2386 "0x%"UVxf" uv(%"NVgf" => %"IVdf") (imprecise)\n",
2391 /* Can the above go wrong if SvIVX == IV_MIN and SvNVX < IV_MIN,
2392 but the cast (NV)IV_MIN rounds to a the value less (more
2393 negative) than IV_MIN which happens to be equal to SvNVX ??
2394 Analogous to 0xFFFFFFFFFFFFFFFF rounding up to NV (2**64) and
2395 NV rounding back to 0xFFFFFFFFFFFFFFFF, so UVX == UV(NVX) and
2396 (NV)UVX == NVX are both true, but the values differ. :-(
2397 Hopefully for 2s complement IV_MIN is something like
2398 0x8000000000000000 which will be exact. NWC */
2401 SvUVX(sv) = U_V(SvNVX(sv));
2403 (SvNVX(sv) == (NV) SvUVX(sv))
2404 #ifndef NV_PRESERVES_UV
2405 /* Make sure it's not 0xFFFFFFFFFFFFFFFF */
2406 /*&& (SvUVX(sv) != UV_MAX) irrelevant with code below */
2407 && (((UV)1 << NV_PRESERVES_UV_BITS) > SvUVX(sv))
2408 /* Don't flag it as "accurately an integer" if the number
2409 came from a (by definition imprecise) NV operation, and
2410 we're outside the range of NV integer precision */
2415 DEBUG_c(PerlIO_printf(Perl_debug_log,
2416 "0x%"UVxf" 2uv(%"UVuf" => %"IVdf") (as unsigned)\n",
2422 else if (SvPOKp(sv) && SvLEN(sv)) {
2424 int numtype = grok_number(SvPVX(sv), SvCUR(sv), &value);
2426 /* We want to avoid a possible problem when we cache a UV which
2427 may be later translated to an NV, and the resulting NV is not
2428 the translation of the initial data.
2430 This means that if we cache such a UV, we need to cache the
2431 NV as well. Moreover, we trade speed for space, and do not
2432 cache the NV if not needed.
2435 /* SVt_PVNV is one higher than SVt_PVIV, hence this order */
2436 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2437 == IS_NUMBER_IN_UV) {
2438 /* It's definitely an integer, only upgrade to PVIV */
2439 if (SvTYPE(sv) < SVt_PVIV)
2440 sv_upgrade(sv, SVt_PVIV);
2442 } else if (SvTYPE(sv) < SVt_PVNV)
2443 sv_upgrade(sv, SVt_PVNV);
2445 /* If NV preserves UV then we only use the UV value if we know that
2446 we aren't going to call atof() below. If NVs don't preserve UVs
2447 then the value returned may have more precision than atof() will
2448 return, even though it isn't accurate. */
2449 if ((numtype & (IS_NUMBER_IN_UV
2450 #ifdef NV_PRESERVES_UV
2453 )) == IS_NUMBER_IN_UV) {
2454 /* This won't turn off the public IOK flag if it was set above */
2455 (void)SvIOKp_on(sv);
2457 if (!(numtype & IS_NUMBER_NEG)) {
2459 if (value <= (UV)IV_MAX) {
2460 SvIVX(sv) = (IV)value;
2462 /* it didn't overflow, and it was positive. */
2467 /* 2s complement assumption */
2468 if (value <= (UV)IV_MIN) {
2469 SvIVX(sv) = -(IV)value;
2471 /* Too negative for an IV. This is a double upgrade, but
2472 I'm assuming it will be rare. */
2473 if (SvTYPE(sv) < SVt_PVNV)
2474 sv_upgrade(sv, SVt_PVNV);
2478 SvNVX(sv) = -(NV)value;
2484 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2485 != IS_NUMBER_IN_UV) {
2486 /* It wasn't an integer, or it overflowed the UV. */
2487 SvNVX(sv) = Atof(SvPVX(sv));
2489 if (! numtype && ckWARN(WARN_NUMERIC))
2492 #if defined(USE_LONG_DOUBLE)
2493 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2uv(%" PERL_PRIgldbl ")\n",
2494 PTR2UV(sv), SvNVX(sv)));
2496 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2uv(%"NVgf")\n",
2497 PTR2UV(sv), SvNVX(sv)));
2500 #ifdef NV_PRESERVES_UV
2501 (void)SvIOKp_on(sv);
2503 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2504 SvIVX(sv) = I_V(SvNVX(sv));
2505 if ((NV)(SvIVX(sv)) == SvNVX(sv)) {
2508 /* Integer is imprecise. NOK, IOKp */
2510 /* UV will not work better than IV */
2512 if (SvNVX(sv) > (NV)UV_MAX) {
2514 /* Integer is inaccurate. NOK, IOKp, is UV */
2518 SvUVX(sv) = U_V(SvNVX(sv));
2519 /* 0xFFFFFFFFFFFFFFFF not an issue in here, NVs
2520 NV preservse UV so can do correct comparison. */
2521 if ((NV)(SvUVX(sv)) == SvNVX(sv)) {
2525 /* Integer is imprecise. NOK, IOKp, is UV */
2530 #else /* NV_PRESERVES_UV */
2531 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2532 == (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT)) {
2533 /* The UV slot will have been set from value returned by
2534 grok_number above. The NV slot has just been set using
2537 assert (SvIOKp(sv));
2539 if (((UV)1 << NV_PRESERVES_UV_BITS) >
2540 U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))) {
2541 /* Small enough to preserve all bits. */
2542 (void)SvIOKp_on(sv);
2544 SvIVX(sv) = I_V(SvNVX(sv));
2545 if ((NV)(SvIVX(sv)) == SvNVX(sv))
2547 /* Assumption: first non-preserved integer is < IV_MAX,
2548 this NV is in the preserved range, therefore: */
2549 if (!(U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))
2551 Perl_croak(aTHX_ "sv_2uv assumed (U_V(fabs(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);
2554 sv_2iuv_non_preserve (sv, numtype);
2556 #endif /* NV_PRESERVES_UV */
2560 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
2561 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
2564 if (SvTYPE(sv) < SVt_IV)
2565 /* Typically the caller expects that sv_any is not NULL now. */
2566 sv_upgrade(sv, SVt_IV);
2570 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2uv(%"UVuf")\n",
2571 PTR2UV(sv),SvUVX(sv)));
2572 return SvIsUV(sv) ? SvUVX(sv) : (UV)SvIVX(sv);
2578 Return the num value of an SV, doing any necessary string or integer
2579 conversion, magic etc. Normally used via the C<SvNV(sv)> and C<SvNVx(sv)>
2586 Perl_sv_2nv(pTHX_ register SV *sv)
2590 if (SvGMAGICAL(sv)) {
2594 if (SvPOKp(sv) && SvLEN(sv)) {
2595 if (ckWARN(WARN_NUMERIC) && !SvIOKp(sv) &&
2596 !grok_number(SvPVX(sv), SvCUR(sv), NULL))
2598 return Atof(SvPVX(sv));
2602 return (NV)SvUVX(sv);
2604 return (NV)SvIVX(sv);
2607 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
2608 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
2614 if (SvTHINKFIRST(sv)) {
2617 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv,numer)) &&
2618 (SvTYPE(tmpstr) != SVt_RV || (SvRV(tmpstr) != SvRV(sv))))
2619 return SvNV(tmpstr);
2620 return PTR2NV(SvRV(sv));
2623 sv_force_normal_flags(sv, 0);
2625 if (SvREADONLY(sv) && !SvOK(sv)) {
2626 if (ckWARN(WARN_UNINITIALIZED))
2631 if (SvTYPE(sv) < SVt_NV) {
2632 if (SvTYPE(sv) == SVt_IV)
2633 sv_upgrade(sv, SVt_PVNV);
2635 sv_upgrade(sv, SVt_NV);
2636 #ifdef USE_LONG_DOUBLE
2638 STORE_NUMERIC_LOCAL_SET_STANDARD();
2639 PerlIO_printf(Perl_debug_log,
2640 "0x%"UVxf" num(%" PERL_PRIgldbl ")\n",
2641 PTR2UV(sv), SvNVX(sv));
2642 RESTORE_NUMERIC_LOCAL();
2646 STORE_NUMERIC_LOCAL_SET_STANDARD();
2647 PerlIO_printf(Perl_debug_log, "0x%"UVxf" num(%"NVgf")\n",
2648 PTR2UV(sv), SvNVX(sv));
2649 RESTORE_NUMERIC_LOCAL();
2653 else if (SvTYPE(sv) < SVt_PVNV)
2654 sv_upgrade(sv, SVt_PVNV);
2659 SvNVX(sv) = SvIsUV(sv) ? (NV)SvUVX(sv) : (NV)SvIVX(sv);
2660 #ifdef NV_PRESERVES_UV
2663 /* Only set the public NV OK flag if this NV preserves the IV */
2664 /* Check it's not 0xFFFFFFFFFFFFFFFF */
2665 if (SvIsUV(sv) ? ((SvUVX(sv) != UV_MAX)&&(SvUVX(sv) == U_V(SvNVX(sv))))
2666 : (SvIVX(sv) == I_V(SvNVX(sv))))
2672 else if (SvPOKp(sv) && SvLEN(sv)) {
2674 int numtype = grok_number(SvPVX(sv), SvCUR(sv), &value);
2675 if (ckWARN(WARN_NUMERIC) && !SvIOKp(sv) && !numtype)
2677 #ifdef NV_PRESERVES_UV
2678 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2679 == IS_NUMBER_IN_UV) {
2680 /* It's definitely an integer */
2681 SvNVX(sv) = (numtype & IS_NUMBER_NEG) ? -(NV)value : (NV)value;
2683 SvNVX(sv) = Atof(SvPVX(sv));
2686 SvNVX(sv) = Atof(SvPVX(sv));
2687 /* Only set the public NV OK flag if this NV preserves the value in
2688 the PV at least as well as an IV/UV would.
2689 Not sure how to do this 100% reliably. */
2690 /* if that shift count is out of range then Configure's test is
2691 wonky. We shouldn't be in here with NV_PRESERVES_UV_BITS ==
2693 if (((UV)1 << NV_PRESERVES_UV_BITS) >
2694 U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))) {
2695 SvNOK_on(sv); /* Definitely small enough to preserve all bits */
2696 } else if (!(numtype & IS_NUMBER_IN_UV)) {
2697 /* Can't use strtol etc to convert this string, so don't try.
2698 sv_2iv and sv_2uv will use the NV to convert, not the PV. */
2701 /* value has been set. It may not be precise. */
2702 if ((numtype & IS_NUMBER_NEG) && (value > (UV)IV_MIN)) {
2703 /* 2s complement assumption for (UV)IV_MIN */
2704 SvNOK_on(sv); /* Integer is too negative. */
2709 if (numtype & IS_NUMBER_NEG) {
2710 SvIVX(sv) = -(IV)value;
2711 } else if (value <= (UV)IV_MAX) {
2712 SvIVX(sv) = (IV)value;
2718 if (numtype & IS_NUMBER_NOT_INT) {
2719 /* I believe that even if the original PV had decimals,
2720 they are lost beyond the limit of the FP precision.
2721 However, neither is canonical, so both only get p
2722 flags. NWC, 2000/11/25 */
2723 /* Both already have p flags, so do nothing */
2726 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2727 if (SvIVX(sv) == I_V(nv)) {
2732 /* It had no "." so it must be integer. */
2735 /* between IV_MAX and NV(UV_MAX).
2736 Could be slightly > UV_MAX */
2738 if (numtype & IS_NUMBER_NOT_INT) {
2739 /* UV and NV both imprecise. */
2741 UV nv_as_uv = U_V(nv);
2743 if (value == nv_as_uv && SvUVX(sv) != UV_MAX) {
2754 #endif /* NV_PRESERVES_UV */
2757 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing && !(SvFLAGS(sv) & SVs_PADTMP))
2759 if (SvTYPE(sv) < SVt_NV)
2760 /* Typically the caller expects that sv_any is not NULL now. */
2761 /* XXX Ilya implies that this is a bug in callers that assume this
2762 and ideally should be fixed. */
2763 sv_upgrade(sv, SVt_NV);
2766 #if defined(USE_LONG_DOUBLE)
2768 STORE_NUMERIC_LOCAL_SET_STANDARD();
2769 PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2nv(%" PERL_PRIgldbl ")\n",
2770 PTR2UV(sv), SvNVX(sv));
2771 RESTORE_NUMERIC_LOCAL();
2775 STORE_NUMERIC_LOCAL_SET_STANDARD();
2776 PerlIO_printf(Perl_debug_log, "0x%"UVxf" 1nv(%"NVgf")\n",
2777 PTR2UV(sv), SvNVX(sv));
2778 RESTORE_NUMERIC_LOCAL();
2784 /* asIV(): extract an integer from the string value of an SV.
2785 * Caller must validate PVX */
2788 S_asIV(pTHX_ SV *sv)
2791 int numtype = grok_number(SvPVX(sv), SvCUR(sv), &value);
2793 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2794 == IS_NUMBER_IN_UV) {
2795 /* It's definitely an integer */
2796 if (numtype & IS_NUMBER_NEG) {
2797 if (value < (UV)IV_MIN)
2800 if (value < (UV)IV_MAX)
2805 if (ckWARN(WARN_NUMERIC))
2808 return I_V(Atof(SvPVX(sv)));
2811 /* asUV(): extract an unsigned integer from the string value of an SV
2812 * Caller must validate PVX */
2815 S_asUV(pTHX_ SV *sv)
2818 int numtype = grok_number(SvPVX(sv), SvCUR(sv), &value);
2820 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2821 == IS_NUMBER_IN_UV) {
2822 /* It's definitely an integer */
2823 if (!(numtype & IS_NUMBER_NEG))
2827 if (ckWARN(WARN_NUMERIC))
2830 return U_V(Atof(SvPVX(sv)));
2834 =for apidoc sv_2pv_nolen
2836 Like C<sv_2pv()>, but doesn't return the length too. You should usually
2837 use the macro wrapper C<SvPV_nolen(sv)> instead.
2842 Perl_sv_2pv_nolen(pTHX_ register SV *sv)
2845 return sv_2pv(sv, &n_a);
2848 /* uiv_2buf(): private routine for use by sv_2pv_flags(): print an IV or
2849 * UV as a string towards the end of buf, and return pointers to start and
2852 * We assume that buf is at least TYPE_CHARS(UV) long.
2856 uiv_2buf(char *buf, IV iv, UV uv, int is_uv, char **peob)
2858 char *ptr = buf + TYPE_CHARS(UV);
2872 *--ptr = '0' + (char)(uv % 10);
2881 =for apidoc sv_2pv_flags
2883 Returns a pointer to the string value of an SV, and sets *lp to its length.
2884 If flags includes SV_GMAGIC, does an mg_get() first. Coerces sv to a string
2886 Normally invoked via the C<SvPV_flags> macro. C<sv_2pv()> and C<sv_2pv_nomg>
2887 usually end up here too.
2893 Perl_sv_2pv_flags(pTHX_ register SV *sv, STRLEN *lp, I32 flags)
2898 char tbuf[64]; /* Must fit sprintf/Gconvert of longest IV/NV */
2899 char *tmpbuf = tbuf;
2905 if (SvGMAGICAL(sv)) {
2906 if (flags & SV_GMAGIC)
2914 (void)sprintf(tmpbuf,"%"UVuf, (UV)SvUVX(sv));
2916 (void)sprintf(tmpbuf,"%"IVdf, (IV)SvIVX(sv));
2921 Gconvert(SvNVX(sv), NV_DIG, 0, tmpbuf);
2926 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
2927 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
2934 if (SvTHINKFIRST(sv)) {
2937 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv,string)) &&
2938 (SvTYPE(tmpstr) != SVt_RV || (SvRV(tmpstr) != SvRV(sv))))
2939 return SvPV(tmpstr,*lp);
2946 switch (SvTYPE(sv)) {
2948 if ( ((SvFLAGS(sv) &
2949 (SVs_OBJECT|SVf_OK|SVs_GMG|SVs_SMG|SVs_RMG))
2950 == (SVs_OBJECT|SVs_RMG))
2951 && (mg = mg_find(sv, PERL_MAGIC_qr))) {
2952 regexp *re = (regexp *)mg->mg_obj;
2955 char *fptr = "msix";
2960 char need_newline = 0;
2961 U16 reganch = (U16)((re->reganch & PMf_COMPILETIME) >> 12);
2963 while((ch = *fptr++)) {
2965 reflags[left++] = ch;
2968 reflags[right--] = ch;
2973 reflags[left] = '-';
2977 mg->mg_len = re->prelen + 4 + left;
2979 * If /x was used, we have to worry about a regex
2980 * ending with a comment later being embedded
2981 * within another regex. If so, we don't want this
2982 * regex's "commentization" to leak out to the
2983 * right part of the enclosing regex, we must cap
2984 * it with a newline.
2986 * So, if /x was used, we scan backwards from the
2987 * end of the regex. If we find a '#' before we
2988 * find a newline, we need to add a newline
2989 * ourself. If we find a '\n' first (or if we
2990 * don't find '#' or '\n'), we don't need to add
2991 * anything. -jfriedl
2993 if (PMf_EXTENDED & re->reganch)
2995 char *endptr = re->precomp + re->prelen;
2996 while (endptr >= re->precomp)
2998 char c = *(endptr--);
3000 break; /* don't need another */
3002 /* we end while in a comment, so we
3004 mg->mg_len++; /* save space for it */
3005 need_newline = 1; /* note to add it */
3010 New(616, mg->mg_ptr, mg->mg_len + 1 + left, char);
3011 Copy("(?", mg->mg_ptr, 2, char);
3012 Copy(reflags, mg->mg_ptr+2, left, char);
3013 Copy(":", mg->mg_ptr+left+2, 1, char);
3014 Copy(re->precomp, mg->mg_ptr+3+left, re->prelen, char);
3016 mg->mg_ptr[mg->mg_len - 2] = '\n';
3017 mg->mg_ptr[mg->mg_len - 1] = ')';
3018 mg->mg_ptr[mg->mg_len] = 0;
3020 PL_reginterp_cnt += re->program[0].next_off;
3032 case SVt_PVBM: if (SvROK(sv))
3035 s = "SCALAR"; break;
3036 case SVt_PVLV: s = "LVALUE"; break;
3037 case SVt_PVAV: s = "ARRAY"; break;
3038 case SVt_PVHV: s = "HASH"; break;
3039 case SVt_PVCV: s = "CODE"; break;
3040 case SVt_PVGV: s = "GLOB"; break;
3041 case SVt_PVFM: s = "FORMAT"; break;
3042 case SVt_PVIO: s = "IO"; break;
3043 default: s = "UNKNOWN"; break;
3047 HV *svs = SvSTASH(sv);
3050 /* [20011101.072] This bandaid for C<package;>
3051 should eventually be removed. AMS 20011103 */
3052 (svs ? HvNAME(svs) : "<none>"), s
3057 Perl_sv_catpvf(aTHX_ tsv, "(0x%"UVxf")", PTR2UV(sv));
3063 if (SvREADONLY(sv) && !SvOK(sv)) {
3064 if (ckWARN(WARN_UNINITIALIZED))
3070 if (SvIOK(sv) || ((SvIOKp(sv) && !SvNOKp(sv)))) {
3071 /* I'm assuming that if both IV and NV are equally valid then
3072 converting the IV is going to be more efficient */
3073 U32 isIOK = SvIOK(sv);
3074 U32 isUIOK = SvIsUV(sv);
3075 char buf[TYPE_CHARS(UV)];
3078 if (SvTYPE(sv) < SVt_PVIV)
3079 sv_upgrade(sv, SVt_PVIV);
3081 ptr = uiv_2buf(buf, 0, SvUVX(sv), 1, &ebuf);
3083 ptr = uiv_2buf(buf, SvIVX(sv), 0, 0, &ebuf);
3084 SvGROW(sv, (STRLEN)(ebuf - ptr + 1)); /* inlined from sv_setpvn */
3085 Move(ptr,SvPVX(sv),ebuf - ptr,char);
3086 SvCUR_set(sv, ebuf - ptr);
3096 else if (SvNOKp(sv)) {
3097 if (SvTYPE(sv) < SVt_PVNV)
3098 sv_upgrade(sv, SVt_PVNV);
3099 /* The +20 is pure guesswork. Configure test needed. --jhi */
3100 SvGROW(sv, NV_DIG + 20);
3102 olderrno = errno; /* some Xenix systems wipe out errno here */
3104 if (SvNVX(sv) == 0.0)
3105 (void)strcpy(s,"0");
3109 Gconvert(SvNVX(sv), NV_DIG, 0, s);
3112 #ifdef FIXNEGATIVEZERO
3113 if (*s == '-' && s[1] == '0' && !s[2])
3123 if (ckWARN(WARN_UNINITIALIZED)
3124 && !PL_localizing && !(SvFLAGS(sv) & SVs_PADTMP))
3127 if (SvTYPE(sv) < SVt_PV)
3128 /* Typically the caller expects that sv_any is not NULL now. */
3129 sv_upgrade(sv, SVt_PV);
3132 *lp = s - SvPVX(sv);
3135 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2pv(%s)\n",
3136 PTR2UV(sv),SvPVX(sv)));
3140 if (SvROK(sv)) { /* XXX Skip this when sv_pvn_force calls */
3141 /* Sneaky stuff here */
3145 tsv = newSVpv(tmpbuf, 0);
3161 len = strlen(tmpbuf);
3163 #ifdef FIXNEGATIVEZERO
3164 if (len == 2 && t[0] == '-' && t[1] == '0') {
3169 (void)SvUPGRADE(sv, SVt_PV);
3171 s = SvGROW(sv, len + 1);
3180 =for apidoc sv_copypv
3182 Copies a stringified representation of the source SV into the
3183 destination SV. Automatically performs any necessary mg_get and
3184 coercion of numeric values into strings. Guaranteed to preserve
3185 UTF-8 flag even from overloaded objects. Similar in nature to
3186 sv_2pv[_flags] but operates directly on an SV instead of just the
3187 string. Mostly uses sv_2pv_flags to do its work, except when that
3188 would lose the UTF-8'ness of the PV.
3194 Perl_sv_copypv(pTHX_ SV *dsv, register SV *ssv)
3198 if ( SvTHINKFIRST(ssv) && SvROK(ssv) && SvAMAGIC(ssv) &&
3199 (tmpsv = AMG_CALLun(ssv,string))) {
3200 if (SvTYPE(tmpsv) != SVt_RV || (SvRV(tmpsv) != SvRV(ssv))) {
3205 tmpsv = sv_newmortal();
3211 sv_setpvn(tmpsv,s,len);
3221 =for apidoc sv_2pvbyte_nolen
3223 Return a pointer to the byte-encoded representation of the SV.
3224 May cause the SV to be downgraded from UTF8 as a side-effect.
3226 Usually accessed via the C<SvPVbyte_nolen> macro.
3232 Perl_sv_2pvbyte_nolen(pTHX_ register SV *sv)
3235 return sv_2pvbyte(sv, &n_a);
3239 =for apidoc sv_2pvbyte
3241 Return a pointer to the byte-encoded representation of the SV, and set *lp
3242 to its length. May cause the SV to be downgraded from UTF8 as a
3245 Usually accessed via the C<SvPVbyte> macro.
3251 Perl_sv_2pvbyte(pTHX_ register SV *sv, STRLEN *lp)
3253 sv_utf8_downgrade(sv,0);
3254 return SvPV(sv,*lp);
3258 =for apidoc sv_2pvutf8_nolen
3260 Return a pointer to the UTF8-encoded representation of the SV.
3261 May cause the SV to be upgraded to UTF8 as a side-effect.
3263 Usually accessed via the C<SvPVutf8_nolen> macro.
3269 Perl_sv_2pvutf8_nolen(pTHX_ register SV *sv)
3272 return sv_2pvutf8(sv, &n_a);
3276 =for apidoc sv_2pvutf8
3278 Return a pointer to the UTF8-encoded representation of the SV, and set *lp
3279 to its length. May cause the SV to be upgraded to UTF8 as a side-effect.
3281 Usually accessed via the C<SvPVutf8> macro.
3287 Perl_sv_2pvutf8(pTHX_ register SV *sv, STRLEN *lp)
3289 sv_utf8_upgrade(sv);
3290 return SvPV(sv,*lp);
3294 =for apidoc sv_2bool
3296 This function is only called on magical items, and is only used by
3297 sv_true() or its macro equivalent.
3303 Perl_sv_2bool(pTHX_ register SV *sv)
3312 if (SvAMAGIC(sv) && (tmpsv=AMG_CALLun(sv,bool_)) &&
3313 (!SvROK(tmpsv) || (SvRV(tmpsv) != SvRV(sv))))
3314 return (bool)SvTRUE(tmpsv);
3315 return SvRV(sv) != 0;
3318 register XPV* Xpvtmp;
3319 if ((Xpvtmp = (XPV*)SvANY(sv)) &&
3320 (*Xpvtmp->xpv_pv > '0' ||
3321 Xpvtmp->xpv_cur > 1 ||
3322 (Xpvtmp->xpv_cur && *Xpvtmp->xpv_pv != '0')))
3329 return SvIVX(sv) != 0;
3332 return SvNVX(sv) != 0.0;
3340 =for apidoc sv_utf8_upgrade
3342 Convert the PV of an SV to its UTF8-encoded form.
3343 Forces the SV to string form if it is not already.
3344 Always sets the SvUTF8 flag to avoid future validity checks even
3345 if all the bytes have hibit clear.
3347 This is not as a general purpose byte encoding to Unicode interface:
3348 use the Encode extension for that.
3350 =for apidoc sv_utf8_upgrade_flags
3352 Convert the PV of an SV to its UTF8-encoded form.
3353 Forces the SV to string form if it is not already.
3354 Always sets the SvUTF8 flag to avoid future validity checks even
3355 if all the bytes have hibit clear. If C<flags> has C<SV_GMAGIC> bit set,
3356 will C<mg_get> on C<sv> if appropriate, else not. C<sv_utf8_upgrade> and
3357 C<sv_utf8_upgrade_nomg> are implemented in terms of this function.
3359 This is not as a general purpose byte encoding to Unicode interface:
3360 use the Encode extension for that.
3366 Perl_sv_utf8_upgrade_flags(pTHX_ register SV *sv, I32 flags)
3376 (void) sv_2pv_flags(sv,&len, flags);
3385 sv_force_normal_flags(sv, 0);
3389 sv_recode_to_utf8(sv, PL_encoding);
3390 else { /* Assume Latin-1/EBCDIC */
3391 /* This function could be much more efficient if we
3392 * had a FLAG in SVs to signal if there are any hibit
3393 * chars in the PV. Given that there isn't such a flag
3394 * make the loop as fast as possible. */
3395 s = (U8 *) SvPVX(sv);
3396 e = (U8 *) SvEND(sv);
3400 if ((hibit = !NATIVE_IS_INVARIANT(ch)))
3406 len = SvCUR(sv) + 1; /* Plus the \0 */
3407 SvPVX(sv) = (char*)bytes_to_utf8((U8*)s, &len);
3408 SvCUR(sv) = len - 1;
3410 Safefree(s); /* No longer using what was there before. */
3411 SvLEN(sv) = len; /* No longer know the real size. */
3413 /* Mark as UTF-8 even if no hibit - saves scanning loop */
3420 =for apidoc sv_utf8_downgrade
3422 Attempt to convert the PV of an SV from UTF8-encoded to byte encoding.
3423 This may not be possible if the PV contains non-byte encoding characters;
3424 if this is the case, either returns false or, if C<fail_ok> is not
3427 This is not as a general purpose Unicode to byte encoding interface:
3428 use the Encode extension for that.
3434 Perl_sv_utf8_downgrade(pTHX_ register SV* sv, bool fail_ok)
3436 if (SvPOK(sv) && SvUTF8(sv)) {
3442 sv_force_normal_flags(sv, 0);
3444 s = (U8 *) SvPV(sv, len);
3445 if (!utf8_to_bytes(s, &len)) {
3450 Perl_croak(aTHX_ "Wide character in %s",
3453 Perl_croak(aTHX_ "Wide character");
3464 =for apidoc sv_utf8_encode
3466 Convert the PV of an SV to UTF8-encoded, but then turn off the C<SvUTF8>
3467 flag so that it looks like octets again. Used as a building block
3468 for encode_utf8 in Encode.xs
3474 Perl_sv_utf8_encode(pTHX_ register SV *sv)
3476 (void) sv_utf8_upgrade(sv);
3481 =for apidoc sv_utf8_decode
3483 Convert the octets in the PV from UTF-8 to chars. Scan for validity and then
3484 turn off SvUTF8 if needed so that we see characters. Used as a building block
3485 for decode_utf8 in Encode.xs
3491 Perl_sv_utf8_decode(pTHX_ register SV *sv)
3497 /* The octets may have got themselves encoded - get them back as
3500 if (!sv_utf8_downgrade(sv, TRUE))
3503 /* it is actually just a matter of turning the utf8 flag on, but
3504 * we want to make sure everything inside is valid utf8 first.
3506 c = (U8 *) SvPVX(sv);
3507 if (!is_utf8_string(c, SvCUR(sv)+1))
3509 e = (U8 *) SvEND(sv);
3512 if (!UTF8_IS_INVARIANT(ch)) {
3522 =for apidoc sv_setsv
3524 Copies the contents of the source SV C<ssv> into the destination SV
3525 C<dsv>. The source SV may be destroyed if it is mortal, so don't use this
3526 function if the source SV needs to be reused. Does not handle 'set' magic.
3527 Loosely speaking, it performs a copy-by-value, obliterating any previous
3528 content of the destination.
3530 You probably want to use one of the assortment of wrappers, such as
3531 C<SvSetSV>, C<SvSetSV_nosteal>, C<SvSetMagicSV> and
3532 C<SvSetMagicSV_nosteal>.
3534 =for apidoc sv_setsv_flags
3536 Copies the contents of the source SV C<ssv> into the destination SV
3537 C<dsv>. The source SV may be destroyed if it is mortal, so don't use this
3538 function if the source SV needs to be reused. Does not handle 'set' magic.
3539 Loosely speaking, it performs a copy-by-value, obliterating any previous
3540 content of the destination.
3541 If the C<flags> parameter has the C<SV_GMAGIC> bit set, will C<mg_get> on
3542 C<ssv> if appropriate, else not. C<sv_setsv> and C<sv_setsv_nomg> are
3543 implemented in terms of this function.
3545 You probably want to use one of the assortment of wrappers, such as
3546 C<SvSetSV>, C<SvSetSV_nosteal>, C<SvSetMagicSV> and
3547 C<SvSetMagicSV_nosteal>.
3549 This is the primary function for copying scalars, and most other
3550 copy-ish functions and macros use this underneath.
3556 Perl_sv_setsv_flags(pTHX_ SV *dstr, register SV *sstr, I32 flags)
3558 register U32 sflags;
3564 SV_CHECK_THINKFIRST_COW_DROP(dstr);
3566 sstr = &PL_sv_undef;
3567 stype = SvTYPE(sstr);
3568 dtype = SvTYPE(dstr);
3572 /* There's a lot of redundancy below but we're going for speed here */
3577 if (dtype != SVt_PVGV) {
3578 (void)SvOK_off(dstr);
3586 sv_upgrade(dstr, SVt_IV);
3589 sv_upgrade(dstr, SVt_PVNV);
3593 sv_upgrade(dstr, SVt_PVIV);
3596 (void)SvIOK_only(dstr);
3597 SvIVX(dstr) = SvIVX(sstr);
3600 if (SvTAINTED(sstr))
3611 sv_upgrade(dstr, SVt_NV);
3616 sv_upgrade(dstr, SVt_PVNV);
3619 SvNVX(dstr) = SvNVX(sstr);
3620 (void)SvNOK_only(dstr);
3621 if (SvTAINTED(sstr))
3629 sv_upgrade(dstr, SVt_RV);
3630 else if (dtype == SVt_PVGV &&
3631 SvTYPE(SvRV(sstr)) == SVt_PVGV) {
3634 if (GvIMPORTED(dstr) != GVf_IMPORTED
3635 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3637 GvIMPORTED_on(dstr);
3648 sv_upgrade(dstr, SVt_PV);
3651 if (dtype < SVt_PVIV)
3652 sv_upgrade(dstr, SVt_PVIV);
3655 if (dtype < SVt_PVNV)
3656 sv_upgrade(dstr, SVt_PVNV);
3663 Perl_croak(aTHX_ "Bizarre copy of %s in %s", sv_reftype(sstr, 0),
3666 Perl_croak(aTHX_ "Bizarre copy of %s", sv_reftype(sstr, 0));
3670 if (dtype <= SVt_PVGV) {
3672 if (dtype != SVt_PVGV) {
3673 char *name = GvNAME(sstr);
3674 STRLEN len = GvNAMELEN(sstr);
3675 sv_upgrade(dstr, SVt_PVGV);
3676 sv_magic(dstr, dstr, PERL_MAGIC_glob, Nullch, 0);
3677 GvSTASH(dstr) = (HV*)SvREFCNT_inc(GvSTASH(sstr));
3678 GvNAME(dstr) = savepvn(name, len);
3679 GvNAMELEN(dstr) = len;
3680 SvFAKE_on(dstr); /* can coerce to non-glob */
3682 /* ahem, death to those who redefine active sort subs */
3683 else if (PL_curstackinfo->si_type == PERLSI_SORT
3684 && GvCV(dstr) && PL_sortcop == CvSTART(GvCV(dstr)))
3685 Perl_croak(aTHX_ "Can't redefine active sort subroutine %s",
3688 #ifdef GV_UNIQUE_CHECK
3689 if (GvUNIQUE((GV*)dstr)) {
3690 Perl_croak(aTHX_ PL_no_modify);
3694 (void)SvOK_off(dstr);
3695 GvINTRO_off(dstr); /* one-shot flag */
3697 GvGP(dstr) = gp_ref(GvGP(sstr));
3698 if (SvTAINTED(sstr))
3700 if (GvIMPORTED(dstr) != GVf_IMPORTED
3701 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3703 GvIMPORTED_on(dstr);
3711 if (SvGMAGICAL(sstr) && (flags & SV_GMAGIC)) {
3713 if ((int)SvTYPE(sstr) != stype) {
3714 stype = SvTYPE(sstr);
3715 if (stype == SVt_PVGV && dtype <= SVt_PVGV)
3719 if (stype == SVt_PVLV)
3720 (void)SvUPGRADE(dstr, SVt_PVNV);
3722 (void)SvUPGRADE(dstr, (U32)stype);
3725 sflags = SvFLAGS(sstr);
3727 if (sflags & SVf_ROK) {
3728 if (dtype >= SVt_PV) {
3729 if (dtype == SVt_PVGV) {
3730 SV *sref = SvREFCNT_inc(SvRV(sstr));
3732 int intro = GvINTRO(dstr);
3734 #ifdef GV_UNIQUE_CHECK
3735 if (GvUNIQUE((GV*)dstr)) {
3736 Perl_croak(aTHX_ PL_no_modify);
3741 GvINTRO_off(dstr); /* one-shot flag */
3742 GvLINE(dstr) = CopLINE(PL_curcop);
3743 GvEGV(dstr) = (GV*)dstr;
3746 switch (SvTYPE(sref)) {
3749 SAVESPTR(GvAV(dstr));
3751 dref = (SV*)GvAV(dstr);
3752 GvAV(dstr) = (AV*)sref;
3753 if (!GvIMPORTED_AV(dstr)
3754 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3756 GvIMPORTED_AV_on(dstr);
3761 SAVESPTR(GvHV(dstr));
3763 dref = (SV*)GvHV(dstr);
3764 GvHV(dstr) = (HV*)sref;
3765 if (!GvIMPORTED_HV(dstr)
3766 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3768 GvIMPORTED_HV_on(dstr);
3773 if (GvCVGEN(dstr) && GvCV(dstr) != (CV*)sref) {
3774 SvREFCNT_dec(GvCV(dstr));
3775 GvCV(dstr) = Nullcv;
3776 GvCVGEN(dstr) = 0; /* Switch off cacheness. */
3777 PL_sub_generation++;
3779 SAVESPTR(GvCV(dstr));
3782 dref = (SV*)GvCV(dstr);
3783 if (GvCV(dstr) != (CV*)sref) {
3784 CV* cv = GvCV(dstr);
3786 if (!GvCVGEN((GV*)dstr) &&
3787 (CvROOT(cv) || CvXSUB(cv)))
3789 /* ahem, death to those who redefine
3790 * active sort subs */
3791 if (PL_curstackinfo->si_type == PERLSI_SORT &&
3792 PL_sortcop == CvSTART(cv))
3794 "Can't redefine active sort subroutine %s",
3795 GvENAME((GV*)dstr));
3796 /* Redefining a sub - warning is mandatory if
3797 it was a const and its value changed. */
3798 if (ckWARN(WARN_REDEFINE)
3800 && (!CvCONST((CV*)sref)
3801 || sv_cmp(cv_const_sv(cv),
3802 cv_const_sv((CV*)sref)))))
3804 Perl_warner(aTHX_ packWARN(WARN_REDEFINE),
3806 ? "Constant subroutine %s::%s redefined"
3807 : "Subroutine %s::%s redefined",
3808 HvNAME(GvSTASH((GV*)dstr)),
3809 GvENAME((GV*)dstr));
3813 cv_ckproto(cv, (GV*)dstr,
3814 SvPOK(sref) ? SvPVX(sref) : Nullch);
3816 GvCV(dstr) = (CV*)sref;
3817 GvCVGEN(dstr) = 0; /* Switch off cacheness. */
3818 GvASSUMECV_on(dstr);
3819 PL_sub_generation++;
3821 if (!GvIMPORTED_CV(dstr)
3822 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3824 GvIMPORTED_CV_on(dstr);
3829 SAVESPTR(GvIOp(dstr));
3831 dref = (SV*)GvIOp(dstr);
3832 GvIOp(dstr) = (IO*)sref;
3836 SAVESPTR(GvFORM(dstr));
3838 dref = (SV*)GvFORM(dstr);
3839 GvFORM(dstr) = (CV*)sref;
3843 SAVESPTR(GvSV(dstr));
3845 dref = (SV*)GvSV(dstr);
3847 if (!GvIMPORTED_SV(dstr)
3848 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3850 GvIMPORTED_SV_on(dstr);
3858 if (SvTAINTED(sstr))
3863 (void)SvOOK_off(dstr); /* backoff */
3865 Safefree(SvPVX(dstr));
3866 SvLEN(dstr)=SvCUR(dstr)=0;
3869 (void)SvOK_off(dstr);
3870 SvRV(dstr) = SvREFCNT_inc(SvRV(sstr));
3872 if (sflags & SVp_NOK) {
3874 /* Only set the public OK flag if the source has public OK. */
3875 if (sflags & SVf_NOK)
3876 SvFLAGS(dstr) |= SVf_NOK;
3877 SvNVX(dstr) = SvNVX(sstr);
3879 if (sflags & SVp_IOK) {
3880 (void)SvIOKp_on(dstr);
3881 if (sflags & SVf_IOK)
3882 SvFLAGS(dstr) |= SVf_IOK;
3883 if (sflags & SVf_IVisUV)
3885 SvIVX(dstr) = SvIVX(sstr);
3887 if (SvAMAGIC(sstr)) {
3891 else if (sflags & SVp_POK) {
3895 * Check to see if we can just swipe the string. If so, it's a
3896 * possible small lose on short strings, but a big win on long ones.
3897 * It might even be a win on short strings if SvPVX(dstr)
3898 * has to be allocated and SvPVX(sstr) has to be freed.
3902 #ifdef PERL_COPY_ON_WRITE
3903 (sflags & (SVf_FAKE | SVf_READONLY)) != (SVf_FAKE | SVf_READONLY)
3907 (sflags & SVs_TEMP) && /* slated for free anyway? */
3908 !(sflags & SVf_OOK) && /* and not involved in OOK hack? */
3909 SvREFCNT(sstr) == 1 && /* and no other references to it? */
3910 SvLEN(sstr) && /* and really is a string */
3911 /* and won't be needed again, potentially */
3912 !(PL_op && PL_op->op_type == OP_AASSIGN))
3913 #ifdef PERL_COPY_ON_WRITE
3914 && !((sflags & CAN_COW_MASK) == CAN_COW_FLAGS
3915 && SvTYPE(sstr) >= SVt_PVIV)
3918 /* Failed the swipe test, and it's not a shared hash key either.
3919 Have to copy the string. */
3920 STRLEN len = SvCUR(sstr);
3921 SvGROW(dstr, len + 1); /* inlined from sv_setpvn */
3922 Move(SvPVX(sstr),SvPVX(dstr),len,char);
3923 SvCUR_set(dstr, len);
3924 *SvEND(dstr) = '\0';
3925 (void)SvPOK_only(dstr);
3927 /* If PERL_COPY_ON_WRITE is not defined, then isSwipe will always
3929 #ifdef PERL_COPY_ON_WRITE
3930 /* Either it's a shared hash key, or it's suitable for
3931 copy-on-write or we can swipe the string. */
3933 PerlIO_printf(Perl_debug_log,
3934 "Copy on write: sstr --> dstr\n");
3939 /* I believe I should acquire a global SV mutex if
3940 it's a COW sv (not a shared hash key) to stop
3941 it going un copy-on-write.
3942 If the source SV has gone un copy on write between up there
3943 and down here, then (assert() that) it is of the correct
3944 form to make it copy on write again */
3945 if ((sflags & (SVf_FAKE | SVf_READONLY))
3946 != (SVf_FAKE | SVf_READONLY)) {
3947 SvREADONLY_on(sstr);
3949 /* Make the source SV into a loop of 1.
3950 (about to become 2) */
3951 SV_COW_NEXT_SV(sstr) = sstr;
3955 /* Initial code is common. */
3956 if (SvPVX(dstr)) { /* we know that dtype >= SVt_PV */
3958 SvFLAGS(dstr) &= ~SVf_OOK;
3959 Safefree(SvPVX(dstr) - SvIVX(dstr));
3961 else if (SvLEN(dstr))
3962 Safefree(SvPVX(dstr));
3964 (void)SvPOK_only(dstr);
3966 #ifdef PERL_COPY_ON_WRITE
3968 /* making another shared SV. */
3969 STRLEN cur = SvCUR(sstr);
3970 STRLEN len = SvLEN(sstr);
3972 /* SvIsCOW_normal */
3973 /* splice us in between source and next-after-source. */
3974 SV_COW_NEXT_SV(dstr) = SV_COW_NEXT_SV(sstr);
3975 SV_COW_NEXT_SV(sstr) = dstr;
3976 SvPV_set(dstr, SvPVX(sstr));
3978 /* SvIsCOW_shared_hash */
3979 UV hash = SvUVX(sstr);
3980 DEBUG_C(PerlIO_printf(Perl_debug_log,
3981 "Copy on write: Sharing hash\n"));
3983 sharepvn(SvPVX(sstr),
3984 (sflags & SVf_UTF8?-cur:cur), hash));
3989 SvREADONLY_on(dstr);
3991 /* Relesase a global SV mutex. */
3995 { /* Passes the swipe test. */
3996 SvPV_set(dstr, SvPVX(sstr));
3997 SvLEN_set(dstr, SvLEN(sstr));
3998 SvCUR_set(dstr, SvCUR(sstr));
4001 (void)SvOK_off(sstr); /* NOTE: nukes most SvFLAGS on sstr */
4002 SvPV_set(sstr, Nullch);
4008 if (sflags & SVf_UTF8)
4011 if (sflags & SVp_NOK) {
4013 if (sflags & SVf_NOK)
4014 SvFLAGS(dstr) |= SVf_NOK;
4015 SvNVX(dstr) = SvNVX(sstr);
4017 if (sflags & SVp_IOK) {
4018 (void)SvIOKp_on(dstr);
4019 if (sflags & SVf_IOK)
4020 SvFLAGS(dstr) |= SVf_IOK;
4021 if (sflags & SVf_IVisUV)
4023 SvIVX(dstr) = SvIVX(sstr);
4026 MAGIC *mg = SvMAGIC(sstr);
4027 sv_magicext(dstr, NULL, PERL_MAGIC_vstring, NULL,
4028 mg->mg_ptr, mg->mg_len);
4029 SvRMAGICAL_on(dstr);
4032 else if (sflags & SVp_IOK) {
4033 if (sflags & SVf_IOK)
4034 (void)SvIOK_only(dstr);
4036 (void)SvOK_off(dstr);
4037 (void)SvIOKp_on(dstr);
4039 /* XXXX Do we want to set IsUV for IV(ROK)? Be extra safe... */
4040 if (sflags & SVf_IVisUV)
4042 SvIVX(dstr) = SvIVX(sstr);
4043 if (sflags & SVp_NOK) {
4044 if (sflags & SVf_NOK)
4045 (void)SvNOK_on(dstr);
4047 (void)SvNOKp_on(dstr);
4048 SvNVX(dstr) = SvNVX(sstr);
4051 else if (sflags & SVp_NOK) {
4052 if (sflags & SVf_NOK)
4053 (void)SvNOK_only(dstr);
4055 (void)SvOK_off(dstr);
4058 SvNVX(dstr) = SvNVX(sstr);
4061 if (dtype == SVt_PVGV) {
4062 if (ckWARN(WARN_MISC))
4063 Perl_warner(aTHX_ packWARN(WARN_MISC), "Undefined value assigned to typeglob");
4066 (void)SvOK_off(dstr);
4068 if (SvTAINTED(sstr))
4073 =for apidoc sv_setsv_mg
4075 Like C<sv_setsv>, but also handles 'set' magic.
4081 Perl_sv_setsv_mg(pTHX_ SV *dstr, register SV *sstr)
4083 sv_setsv(dstr,sstr);
4088 =for apidoc sv_setpvn
4090 Copies a string into an SV. The C<len> parameter indicates the number of
4091 bytes to be copied. Does not handle 'set' magic. See C<sv_setpvn_mg>.
4097 Perl_sv_setpvn(pTHX_ register SV *sv, register const char *ptr, register STRLEN len)
4099 register char *dptr;
4101 SV_CHECK_THINKFIRST_COW_DROP(sv);
4107 /* len is STRLEN which is unsigned, need to copy to signed */
4110 Perl_croak(aTHX_ "panic: sv_setpvn called with negative strlen");
4112 (void)SvUPGRADE(sv, SVt_PV);
4114 SvGROW(sv, len + 1);
4116 Move(ptr,dptr,len,char);
4119 (void)SvPOK_only_UTF8(sv); /* validate pointer */
4124 =for apidoc sv_setpvn_mg
4126 Like C<sv_setpvn>, but also handles 'set' magic.
4132 Perl_sv_setpvn_mg(pTHX_ register SV *sv, register const char *ptr, register STRLEN len)
4134 sv_setpvn(sv,ptr,len);
4139 =for apidoc sv_setpv
4141 Copies a string into an SV. The string must be null-terminated. Does not
4142 handle 'set' magic. See C<sv_setpv_mg>.
4148 Perl_sv_setpv(pTHX_ register SV *sv, register const char *ptr)
4150 register STRLEN len;
4152 SV_CHECK_THINKFIRST_COW_DROP(sv);
4158 (void)SvUPGRADE(sv, SVt_PV);
4160 SvGROW(sv, len + 1);
4161 Move(ptr,SvPVX(sv),len+1,char);
4163 (void)SvPOK_only_UTF8(sv); /* validate pointer */
4168 =for apidoc sv_setpv_mg
4170 Like C<sv_setpv>, but also handles 'set' magic.
4176 Perl_sv_setpv_mg(pTHX_ register SV *sv, register const char *ptr)
4183 =for apidoc sv_usepvn
4185 Tells an SV to use C<ptr> to find its string value. Normally the string is
4186 stored inside the SV but sv_usepvn allows the SV to use an outside string.
4187 The C<ptr> should point to memory that was allocated by C<malloc>. The
4188 string length, C<len>, must be supplied. This function will realloc the
4189 memory pointed to by C<ptr>, so that pointer should not be freed or used by
4190 the programmer after giving it to sv_usepvn. Does not handle 'set' magic.
4191 See C<sv_usepvn_mg>.
4197 Perl_sv_usepvn(pTHX_ register SV *sv, register char *ptr, register STRLEN len)
4199 SV_CHECK_THINKFIRST_COW_DROP(sv);
4200 (void)SvUPGRADE(sv, SVt_PV);
4205 (void)SvOOK_off(sv);
4206 if (SvPVX(sv) && SvLEN(sv))
4207 Safefree(SvPVX(sv));
4208 Renew(ptr, len+1, char);
4211 SvLEN_set(sv, len+1);
4213 (void)SvPOK_only_UTF8(sv); /* validate pointer */
4218 =for apidoc sv_usepvn_mg
4220 Like C<sv_usepvn>, but also handles 'set' magic.
4226 Perl_sv_usepvn_mg(pTHX_ register SV *sv, register char *ptr, register STRLEN len)
4228 sv_usepvn(sv,ptr,len);
4232 #ifdef PERL_COPY_ON_WRITE
4233 /* Need to do this *after* making the SV normal, as we need the buffer
4234 pointer to remain valid until after we've copied it. If we let go too early,
4235 another thread could invalidate it by unsharing last of the same hash key
4236 (which it can do by means other than releasing copy-on-write Svs)
4237 or by changing the other copy-on-write SVs in the loop. */
4239 S_sv_release_COW(pTHX_ register SV *sv, char *pvx, STRLEN cur, STRLEN len,
4240 U32 hash, SV *after)
4242 if (len) { /* this SV was SvIsCOW_normal(sv) */
4243 /* we need to find the SV pointing to us. */
4244 SV *current = SV_COW_NEXT_SV(after);
4246 if (current == sv) {
4247 /* The SV we point to points back to us (there were only two of us
4249 Hence other SV is no longer copy on write either. */
4251 SvREADONLY_off(after);
4253 /* We need to follow the pointers around the loop. */
4255 while ((next = SV_COW_NEXT_SV(current)) != sv) {
4258 /* don't loop forever if the structure is bust, and we have
4259 a pointer into a closed loop. */
4260 assert (current != after);
4262 /* Make the SV before us point to the SV after us. */
4263 SV_COW_NEXT_SV(current) = after;
4266 unsharepvn(pvx, SvUTF8(sv) ? -(I32)cur : cur, hash);
4271 Perl_sv_release_IVX(pTHX_ register SV *sv)
4274 sv_force_normal_flags(sv, 0);
4275 return SvOOK_off(sv);
4279 =for apidoc sv_force_normal_flags
4281 Undo various types of fakery on an SV: if the PV is a shared string, make
4282 a private copy; if we're a ref, stop refing; if we're a glob, downgrade to
4283 an xpvmg; if we're a copy-on-write scalar, this is the on-write time when
4284 we do the copy, and is also used locally. If C<SV_COW_DROP_PV> is set
4285 then a copy-on-write scalar drops its PV buffer (if any) and becomes
4286 SvPOK_off rather than making a copy. (Used where this scalar is about to be
4287 set to some other value. In addtion, the C<flags> parameter gets passed to
4288 C<sv_unref_flags()> when unrefing. C<sv_force_normal> calls this function
4289 with flags set to 0.
4295 Perl_sv_force_normal_flags(pTHX_ register SV *sv, U32 flags)
4297 #ifdef PERL_COPY_ON_WRITE
4298 if (SvREADONLY(sv)) {
4299 /* At this point I believe I should acquire a global SV mutex. */
4301 char *pvx = SvPVX(sv);
4302 STRLEN len = SvLEN(sv);
4303 STRLEN cur = SvCUR(sv);
4304 U32 hash = SvUVX(sv);
4305 SV *next = SV_COW_NEXT_SV(sv); /* next COW sv in the loop. */
4307 PerlIO_printf(Perl_debug_log,
4308 "Copy on write: Force normal %ld\n",
4314 /* This SV doesn't own the buffer, so need to New() a new one: */
4317 if (flags & SV_COW_DROP_PV) {
4318 /* OK, so we don't need to copy our buffer. */
4321 SvGROW(sv, cur + 1);
4322 Move(pvx,SvPVX(sv),cur,char);
4326 S_sv_release_COW(sv, pvx, cur, len, hash, next);
4331 else if (PL_curcop != &PL_compiling)
4332 Perl_croak(aTHX_ PL_no_modify);
4333 /* At this point I believe that I can drop the global SV mutex. */
4336 if (SvREADONLY(sv)) {
4338 char *pvx = SvPVX(sv);
4339 STRLEN len = SvCUR(sv);
4340 U32 hash = SvUVX(sv);
4341 SvGROW(sv, len + 1);
4342 Move(pvx,SvPVX(sv),len,char);
4346 unsharepvn(pvx, SvUTF8(sv) ? -(I32)len : len, hash);
4348 else if (PL_curcop != &PL_compiling)
4349 Perl_croak(aTHX_ PL_no_modify);
4353 sv_unref_flags(sv, flags);
4354 else if (SvFAKE(sv) && SvTYPE(sv) == SVt_PVGV)
4359 =for apidoc sv_force_normal
4361 Undo various types of fakery on an SV: if the PV is a shared string, make
4362 a private copy; if we're a ref, stop refing; if we're a glob, downgrade to
4363 an xpvmg. See also C<sv_force_normal_flags>.
4369 Perl_sv_force_normal(pTHX_ register SV *sv)
4371 sv_force_normal_flags(sv, 0);
4377 Efficient removal of characters from the beginning of the string buffer.
4378 SvPOK(sv) must be true and the C<ptr> must be a pointer to somewhere inside
4379 the string buffer. The C<ptr> becomes the first character of the adjusted
4380 string. Uses the "OOK hack".
4386 Perl_sv_chop(pTHX_ register SV *sv, register char *ptr)
4388 register STRLEN delta;
4390 if (!ptr || !SvPOKp(sv))
4392 SV_CHECK_THINKFIRST(sv);
4393 if (SvTYPE(sv) < SVt_PVIV)
4394 sv_upgrade(sv,SVt_PVIV);
4397 if (!SvLEN(sv)) { /* make copy of shared string */
4398 char *pvx = SvPVX(sv);
4399 STRLEN len = SvCUR(sv);
4400 SvGROW(sv, len + 1);
4401 Move(pvx,SvPVX(sv),len,char);
4405 SvFLAGS(sv) |= SVf_OOK;
4407 SvFLAGS(sv) &= ~(SVf_IOK|SVf_NOK|SVp_IOK|SVp_NOK|SVf_IVisUV);
4408 delta = ptr - SvPVX(sv);
4416 =for apidoc sv_catpvn
4418 Concatenates the string onto the end of the string which is in the SV. The
4419 C<len> indicates number of bytes to copy. If the SV has the UTF8
4420 status set, then the bytes appended should be valid UTF8.
4421 Handles 'get' magic, but not 'set' magic. See C<sv_catpvn_mg>.
4423 =for apidoc sv_catpvn_flags
4425 Concatenates the string onto the end of the string which is in the SV. The
4426 C<len> indicates number of bytes to copy. If the SV has the UTF8
4427 status set, then the bytes appended should be valid UTF8.
4428 If C<flags> has C<SV_GMAGIC> bit set, will C<mg_get> on C<dsv> if
4429 appropriate, else not. C<sv_catpvn> and C<sv_catpvn_nomg> are implemented
4430 in terms of this function.
4436 Perl_sv_catpvn_flags(pTHX_ register SV *dsv, register const char *sstr, register STRLEN slen, I32 flags)
4441 dstr = SvPV_force_flags(dsv, dlen, flags);
4442 SvGROW(dsv, dlen + slen + 1);
4445 Move(sstr, SvPVX(dsv) + dlen, slen, char);
4448 (void)SvPOK_only_UTF8(dsv); /* validate pointer */
4453 =for apidoc sv_catpvn_mg
4455 Like C<sv_catpvn>, but also handles 'set' magic.
4461 Perl_sv_catpvn_mg(pTHX_ register SV *sv, register const char *ptr, register STRLEN len)
4463 sv_catpvn(sv,ptr,len);
4468 =for apidoc sv_catsv
4470 Concatenates the string from SV C<ssv> onto the end of the string in
4471 SV C<dsv>. Modifies C<dsv> but not C<ssv>. Handles 'get' magic, but
4472 not 'set' magic. See C<sv_catsv_mg>.
4474 =for apidoc sv_catsv_flags
4476 Concatenates the string from SV C<ssv> onto the end of the string in
4477 SV C<dsv>. Modifies C<dsv> but not C<ssv>. If C<flags> has C<SV_GMAGIC>
4478 bit set, will C<mg_get> on the SVs if appropriate, else not. C<sv_catsv>
4479 and C<sv_catsv_nomg> are implemented in terms of this function.
4484 Perl_sv_catsv_flags(pTHX_ SV *dsv, register SV *ssv, I32 flags)
4490 if ((spv = SvPV(ssv, slen))) {
4491 /* sutf8 and dutf8 were type bool, but under USE_ITHREADS,
4492 gcc version 2.95.2 20000220 (Debian GNU/Linux) for
4493 Linux xxx 2.2.17 on sparc64 with gcc -O2, we erroneously
4494 get dutf8 = 0x20000000, (i.e. SVf_UTF8) even though
4495 dsv->sv_flags doesn't have that bit set.
4496 Andy Dougherty 12 Oct 2001
4498 I32 sutf8 = DO_UTF8(ssv);
4501 if (SvGMAGICAL(dsv) && (flags & SV_GMAGIC))
4503 dutf8 = DO_UTF8(dsv);
4505 if (dutf8 != sutf8) {
4507 /* Not modifying source SV, so taking a temporary copy. */
4508 SV* csv = sv_2mortal(newSVpvn(spv, slen));
4510 sv_utf8_upgrade(csv);
4511 spv = SvPV(csv, slen);
4514 sv_utf8_upgrade_nomg(dsv);
4516 sv_catpvn_nomg(dsv, spv, slen);
4521 =for apidoc sv_catsv_mg
4523 Like C<sv_catsv>, but also handles 'set' magic.
4529 Perl_sv_catsv_mg(pTHX_ SV *dsv, register SV *ssv)
4536 =for apidoc sv_catpv
4538 Concatenates the string onto the end of the string which is in the SV.
4539 If the SV has the UTF8 status set, then the bytes appended should be
4540 valid UTF8. Handles 'get' magic, but not 'set' magic. See C<sv_catpv_mg>.
4545 Perl_sv_catpv(pTHX_ register SV *sv, register const char *ptr)
4547 register STRLEN len;
4553 junk = SvPV_force(sv, tlen);
4555 SvGROW(sv, tlen + len + 1);
4558 Move(ptr,SvPVX(sv)+tlen,len+1,char);
4560 (void)SvPOK_only_UTF8(sv); /* validate pointer */
4565 =for apidoc sv_catpv_mg
4567 Like C<sv_catpv>, but also handles 'set' magic.
4573 Perl_sv_catpv_mg(pTHX_ register SV *sv, register const char *ptr)
4582 Create a new null SV, or if len > 0, create a new empty SVt_PV type SV
4583 with an initial PV allocation of len+1. Normally accessed via the C<NEWSV>
4590 Perl_newSV(pTHX_ STRLEN len)
4596 sv_upgrade(sv, SVt_PV);
4597 SvGROW(sv, len + 1);
4602 =for apidoc sv_magicext
4604 Adds magic to an SV, upgrading it if necessary. Applies the
4605 supplied vtable and returns pointer to the magic added.
4607 Note that sv_magicext will allow things that sv_magic will not.
4608 In particular you can add magic to SvREADONLY SVs and and more than
4609 one instance of the same 'how'
4611 I C<namelen> is greater then zero then a savepvn() I<copy> of C<name> is stored,
4612 if C<namelen> is zero then C<name> is stored as-is and - as another special
4613 case - if C<(name && namelen == HEf_SVKEY)> then C<name> is assumed to contain
4614 an C<SV*> and has its REFCNT incremented
4616 (This is now used as a subroutine by sv_magic.)
4621 Perl_sv_magicext(pTHX_ SV* sv, SV* obj, int how, MGVTBL *vtable,
4622 const char* name, I32 namlen)
4626 if (SvTYPE(sv) < SVt_PVMG) {
4627 (void)SvUPGRADE(sv, SVt_PVMG);
4629 Newz(702,mg, 1, MAGIC);
4630 mg->mg_moremagic = SvMAGIC(sv);
4633 /* Some magic sontains a reference loop, where the sv and object refer to
4634 each other. To prevent a reference loop that would prevent such
4635 objects being freed, we look for such loops and if we find one we
4636 avoid incrementing the object refcount.
4638 Note we cannot do this to avoid self-tie loops as intervening RV must
4639 have its REFCNT incremented to keep it in existence - instead we could
4640 special case them in sv_free() -- NI-S
4643 if (!obj || obj == sv ||
4644 how == PERL_MAGIC_arylen ||
4645 how == PERL_MAGIC_qr ||
4646 (SvTYPE(obj) == SVt_PVGV &&
4647 (GvSV(obj) == sv || GvHV(obj) == (HV*)sv || GvAV(obj) == (AV*)sv ||
4648 GvCV(obj) == (CV*)sv || GvIOp(obj) == (IO*)sv ||
4649 GvFORM(obj) == (CV*)sv)))
4654 mg->mg_obj = SvREFCNT_inc(obj);
4655 mg->mg_flags |= MGf_REFCOUNTED;
4658 mg->mg_len = namlen;
4661 mg->mg_ptr = savepvn(name, namlen);
4662 else if (namlen == HEf_SVKEY)
4663 mg->mg_ptr = (char*)SvREFCNT_inc((SV*)name);
4665 mg->mg_ptr = (char *) name;
4667 mg->mg_virtual = vtable;
4671 SvFLAGS(sv) &= ~(SVf_IOK|SVf_NOK|SVf_POK);
4676 =for apidoc sv_magic
4678 Adds magic to an SV. First upgrades C<sv> to type C<SVt_PVMG> if necessary,
4679 then adds a new magic item of type C<how> to the head of the magic list.
4685 Perl_sv_magic(pTHX_ register SV *sv, SV *obj, int how, const char *name, I32 namlen)
4690 #ifdef PERL_COPY_ON_WRITE
4692 sv_force_normal_flags(sv, 0);
4694 if (SvREADONLY(sv)) {
4695 if (PL_curcop != &PL_compiling
4696 && how != PERL_MAGIC_regex_global
4697 && how != PERL_MAGIC_bm
4698 && how != PERL_MAGIC_fm
4699 && how != PERL_MAGIC_sv
4702 Perl_croak(aTHX_ PL_no_modify);
4705 if (SvMAGICAL(sv) || (how == PERL_MAGIC_taint && SvTYPE(sv) >= SVt_PVMG)) {
4706 if (SvMAGIC(sv) && (mg = mg_find(sv, how))) {
4707 /* sv_magic() refuses to add a magic of the same 'how' as an
4710 if (how == PERL_MAGIC_taint)
4718 vtable = &PL_vtbl_sv;
4720 case PERL_MAGIC_overload:
4721 vtable = &PL_vtbl_amagic;
4723 case PERL_MAGIC_overload_elem:
4724 vtable = &PL_vtbl_amagicelem;
4726 case PERL_MAGIC_overload_table:
4727 vtable = &PL_vtbl_ovrld;
4730 vtable = &PL_vtbl_bm;
4732 case PERL_MAGIC_regdata:
4733 vtable = &PL_vtbl_regdata;
4735 case PERL_MAGIC_regdatum:
4736 vtable = &PL_vtbl_regdatum;
4738 case PERL_MAGIC_env:
4739 vtable = &PL_vtbl_env;
4742 vtable = &PL_vtbl_fm;
4744 case PERL_MAGIC_envelem:
4745 vtable = &PL_vtbl_envelem;
4747 case PERL_MAGIC_regex_global:
4748 vtable = &PL_vtbl_mglob;
4750 case PERL_MAGIC_isa:
4751 vtable = &PL_vtbl_isa;
4753 case PERL_MAGIC_isaelem:
4754 vtable = &PL_vtbl_isaelem;
4756 case PERL_MAGIC_nkeys:
4757 vtable = &PL_vtbl_nkeys;
4759 case PERL_MAGIC_dbfile:
4762 case PERL_MAGIC_dbline:
4763 vtable = &PL_vtbl_dbline;
4765 #ifdef USE_5005THREADS
4766 case PERL_MAGIC_mutex:
4767 vtable = &PL_vtbl_mutex;
4769 #endif /* USE_5005THREADS */
4770 #ifdef USE_LOCALE_COLLATE
4771 case PERL_MAGIC_collxfrm:
4772 vtable = &PL_vtbl_collxfrm;
4774 #endif /* USE_LOCALE_COLLATE */
4775 case PERL_MAGIC_tied:
4776 vtable = &PL_vtbl_pack;
4778 case PERL_MAGIC_tiedelem:
4779 case PERL_MAGIC_tiedscalar:
4780 vtable = &PL_vtbl_packelem;
4783 vtable = &PL_vtbl_regexp;
4785 case PERL_MAGIC_sig:
4786 vtable = &PL_vtbl_sig;
4788 case PERL_MAGIC_sigelem:
4789 vtable = &PL_vtbl_sigelem;
4791 case PERL_MAGIC_taint:
4792 vtable = &PL_vtbl_taint;
4794 case PERL_MAGIC_uvar:
4795 vtable = &PL_vtbl_uvar;
4797 case PERL_MAGIC_vec:
4798 vtable = &PL_vtbl_vec;
4800 case PERL_MAGIC_substr:
4801 vtable = &PL_vtbl_substr;
4803 case PERL_MAGIC_defelem:
4804 vtable = &PL_vtbl_defelem;
4806 case PERL_MAGIC_glob:
4807 vtable = &PL_vtbl_glob;
4809 case PERL_MAGIC_arylen:
4810 vtable = &PL_vtbl_arylen;
4812 case PERL_MAGIC_pos:
4813 vtable = &PL_vtbl_pos;
4815 case PERL_MAGIC_backref:
4816 vtable = &PL_vtbl_backref;
4818 case PERL_MAGIC_ext:
4819 /* Reserved for use by extensions not perl internals. */
4820 /* Useful for attaching extension internal data to perl vars. */
4821 /* Note that multiple extensions may clash if magical scalars */
4822 /* etc holding private data from one are passed to another. */
4825 Perl_croak(aTHX_ "Don't know how to handle magic of type \\%o", how);
4828 /* Rest of work is done else where */
4829 mg = sv_magicext(sv,obj,how,vtable,name,namlen);
4832 case PERL_MAGIC_taint:
4835 case PERL_MAGIC_ext:
4836 case PERL_MAGIC_dbfile:
4843 =for apidoc sv_unmagic
4845 Removes all magic of type C<type> from an SV.
4851 Perl_sv_unmagic(pTHX_ SV *sv, int type)
4855 if (SvTYPE(sv) < SVt_PVMG || !SvMAGIC(sv))
4858 for (mg = *mgp; mg; mg = *mgp) {
4859 if (mg->mg_type == type) {
4860 MGVTBL* vtbl = mg->mg_virtual;
4861 *mgp = mg->mg_moremagic;
4862 if (vtbl && vtbl->svt_free)
4863 CALL_FPTR(vtbl->svt_free)(aTHX_ sv, mg);
4864 if (mg->mg_ptr && mg->mg_type != PERL_MAGIC_regex_global) {
4866 Safefree(mg->mg_ptr);
4867 else if (mg->mg_len == HEf_SVKEY)
4868 SvREFCNT_dec((SV*)mg->mg_ptr);
4870 if (mg->mg_flags & MGf_REFCOUNTED)
4871 SvREFCNT_dec(mg->mg_obj);
4875 mgp = &mg->mg_moremagic;
4879 SvFLAGS(sv) |= (SvFLAGS(sv) & (SVp_NOK|SVp_POK)) >> PRIVSHIFT;
4886 =for apidoc sv_rvweaken
4888 Weaken a reference: set the C<SvWEAKREF> flag on this RV; give the
4889 referred-to SV C<PERL_MAGIC_backref> magic if it hasn't already; and
4890 push a back-reference to this RV onto the array of backreferences
4891 associated with that magic.
4897 Perl_sv_rvweaken(pTHX_ SV *sv)
4900 if (!SvOK(sv)) /* let undefs pass */
4903 Perl_croak(aTHX_ "Can't weaken a nonreference");
4904 else if (SvWEAKREF(sv)) {
4905 if (ckWARN(WARN_MISC))
4906 Perl_warner(aTHX_ packWARN(WARN_MISC), "Reference is already weak");
4910 sv_add_backref(tsv, sv);
4916 /* Give tsv backref magic if it hasn't already got it, then push a
4917 * back-reference to sv onto the array associated with the backref magic.
4921 S_sv_add_backref(pTHX_ SV *tsv, SV *sv)
4925 if (SvMAGICAL(tsv) && (mg = mg_find(tsv, PERL_MAGIC_backref)))
4926 av = (AV*)mg->mg_obj;
4929 sv_magic(tsv, (SV*)av, PERL_MAGIC_backref, NULL, 0);
4930 SvREFCNT_dec(av); /* for sv_magic */
4935 /* delete a back-reference to ourselves from the backref magic associated
4936 * with the SV we point to.
4940 S_sv_del_backref(pTHX_ SV *sv)
4947 if (!SvMAGICAL(tsv) || !(mg = mg_find(tsv, PERL_MAGIC_backref)))
4948 Perl_croak(aTHX_ "panic: del_backref");
4949 av = (AV *)mg->mg_obj;
4954 svp[i] = &PL_sv_undef; /* XXX */
4961 =for apidoc sv_insert
4963 Inserts a string at the specified offset/length within the SV. Similar to
4964 the Perl substr() function.
4970 Perl_sv_insert(pTHX_ SV *bigstr, STRLEN offset, STRLEN len, char *little, STRLEN littlelen)
4974 register char *midend;
4975 register char *bigend;
4981 Perl_croak(aTHX_ "Can't modify non-existent substring");
4982 SvPV_force(bigstr, curlen);
4983 (void)SvPOK_only_UTF8(bigstr);
4984 if (offset + len > curlen) {
4985 SvGROW(bigstr, offset+len+1);
4986 Zero(SvPVX(bigstr)+curlen, offset+len-curlen, char);
4987 SvCUR_set(bigstr, offset+len);
4991 i = littlelen - len;
4992 if (i > 0) { /* string might grow */
4993 big = SvGROW(bigstr, SvCUR(bigstr) + i + 1);
4994 mid = big + offset + len;
4995 midend = bigend = big + SvCUR(bigstr);
4998 while (midend > mid) /* shove everything down */
4999 *--bigend = *--midend;
5000 Move(little,big+offset,littlelen,char);
5006 Move(little,SvPVX(bigstr)+offset,len,char);
5011 big = SvPVX(bigstr);
5014 bigend = big + SvCUR(bigstr);
5016 if (midend > bigend)
5017 Perl_croak(aTHX_ "panic: sv_insert");
5019 if (mid - big > bigend - midend) { /* faster to shorten from end */
5021 Move(little, mid, littlelen,char);
5024 i = bigend - midend;
5026 Move(midend, mid, i,char);
5030 SvCUR_set(bigstr, mid - big);
5033 else if ((i = mid - big)) { /* faster from front */
5034 midend -= littlelen;
5036 sv_chop(bigstr,midend-i);
5041 Move(little, mid, littlelen,char);
5043 else if (littlelen) {
5044 midend -= littlelen;
5045 sv_chop(bigstr,midend);
5046 Move(little,midend,littlelen,char);
5049 sv_chop(bigstr,midend);
5055 =for apidoc sv_replace
5057 Make the first argument a copy of the second, then delete the original.
5058 The target SV physically takes over ownership of the body of the source SV
5059 and inherits its flags; however, the target keeps any magic it owns,
5060 and any magic in the source is discarded.
5061 Note that this is a rather specialist SV copying operation; most of the
5062 time you'll want to use C<sv_setsv> or one of its many macro front-ends.
5068 Perl_sv_replace(pTHX_ register SV *sv, register SV *nsv)
5070 U32 refcnt = SvREFCNT(sv);
5071 SV_CHECK_THINKFIRST_COW_DROP(sv);
5072 if (SvREFCNT(nsv) != 1 && ckWARN_d(WARN_INTERNAL))
5073 Perl_warner(aTHX_ packWARN(WARN_INTERNAL), "Reference miscount in sv_replace()");
5074 if (SvMAGICAL(sv)) {
5078 sv_upgrade(nsv, SVt_PVMG);
5079 SvMAGIC(nsv) = SvMAGIC(sv);
5080 SvFLAGS(nsv) |= SvMAGICAL(sv);
5086 assert(!SvREFCNT(sv));
5087 StructCopy(nsv,sv,SV);
5088 SvREFCNT(sv) = refcnt;
5089 SvFLAGS(nsv) |= SVTYPEMASK; /* Mark as freed */
5094 =for apidoc sv_clear
5096 Clear an SV: call any destructors, free up any memory used by the body,
5097 and free the body itself. The SV's head is I<not> freed, although
5098 its type is set to all 1's so that it won't inadvertently be assumed
5099 to be live during global destruction etc.
5100 This function should only be called when REFCNT is zero. Most of the time
5101 you'll want to call C<sv_free()> (or its macro wrapper C<SvREFCNT_dec>)
5108 Perl_sv_clear(pTHX_ register SV *sv)
5112 assert(SvREFCNT(sv) == 0);
5115 if (PL_defstash) { /* Still have a symbol table? */
5120 Zero(&tmpref, 1, SV);
5121 sv_upgrade(&tmpref, SVt_RV);
5123 SvREADONLY_on(&tmpref); /* DESTROY() could be naughty */
5124 SvREFCNT(&tmpref) = 1;
5127 stash = SvSTASH(sv);
5128 destructor = StashHANDLER(stash,DESTROY);
5131 PUSHSTACKi(PERLSI_DESTROY);
5132 SvRV(&tmpref) = SvREFCNT_inc(sv);
5137 call_sv((SV*)destructor, G_DISCARD|G_EVAL|G_KEEPERR);
5143 } while (SvOBJECT(sv) && SvSTASH(sv) != stash);
5145 del_XRV(SvANY(&tmpref));
5148 if (PL_in_clean_objs)
5149 Perl_croak(aTHX_ "DESTROY created new reference to dead object '%s'",
5151 /* DESTROY gave object new lease on life */
5157 SvREFCNT_dec(SvSTASH(sv)); /* possibly of changed persuasion */
5158 SvOBJECT_off(sv); /* Curse the object. */
5159 if (SvTYPE(sv) != SVt_PVIO)
5160 --PL_sv_objcount; /* XXX Might want something more general */
5163 if (SvTYPE(sv) >= SVt_PVMG) {
5166 if (SvFLAGS(sv) & SVpad_TYPED)
5167 SvREFCNT_dec(SvSTASH(sv));
5170 switch (SvTYPE(sv)) {
5173 IoIFP(sv) != PerlIO_stdin() &&
5174 IoIFP(sv) != PerlIO_stdout() &&
5175 IoIFP(sv) != PerlIO_stderr())
5177 io_close((IO*)sv, FALSE);
5179 if (IoDIRP(sv) && !(IoFLAGS(sv) & IOf_FAKE_DIRP))
5180 PerlDir_close(IoDIRP(sv));
5181 IoDIRP(sv) = (DIR*)NULL;
5182 Safefree(IoTOP_NAME(sv));
5183 Safefree(IoFMT_NAME(sv));
5184 Safefree(IoBOTTOM_NAME(sv));
5199 SvREFCNT_dec(LvTARG(sv));
5203 Safefree(GvNAME(sv));
5204 /* cannot decrease stash refcount yet, as we might recursively delete
5205 ourselves when the refcnt drops to zero. Delay SvREFCNT_dec
5206 of stash until current sv is completely gone.
5207 -- JohnPC, 27 Mar 1998 */
5208 stash = GvSTASH(sv);
5214 (void)SvOOK_off(sv);
5222 SvREFCNT_dec(SvRV(sv));
5224 #ifdef PERL_COPY_ON_WRITE
5225 else if (SvPVX(sv)) {
5227 /* I believe I need to grab the global SV mutex here and
5228 then recheck the COW status. */
5230 PerlIO_printf(Perl_debug_log, "Copy on write: clear\n");
5233 S_sv_release_COW(sv, SvPVX(sv), SvCUR(sv), SvLEN(sv),
5234 SvUVX(sv), SV_COW_NEXT_SV(sv));
5235 /* And drop it here. */
5237 } else if (SvLEN(sv)) {
5238 Safefree(SvPVX(sv));
5242 else if (SvPVX(sv) && SvLEN(sv))
5243 Safefree(SvPVX(sv));
5244 else if (SvPVX(sv) && SvREADONLY(sv) && SvFAKE(sv)) {
5245 unsharepvn(SvPVX(sv),
5246 SvUTF8(sv) ? -(I32)SvCUR(sv) : SvCUR(sv),
5260 switch (SvTYPE(sv)) {
5276 del_XPVIV(SvANY(sv));
5279 del_XPVNV(SvANY(sv));
5282 del_XPVMG(SvANY(sv));
5285 del_XPVLV(SvANY(sv));
5288 del_XPVAV(SvANY(sv));
5291 del_XPVHV(SvANY(sv));
5294 del_XPVCV(SvANY(sv));
5297 del_XPVGV(SvANY(sv));
5298 /* code duplication for increased performance. */
5299 SvFLAGS(sv) &= SVf_BREAK;
5300 SvFLAGS(sv) |= SVTYPEMASK;
5301 /* decrease refcount of the stash that owns this GV, if any */
5303 SvREFCNT_dec(stash);
5304 return; /* not break, SvFLAGS reset already happened */
5306 del_XPVBM(SvANY(sv));
5309 del_XPVFM(SvANY(sv));
5312 del_XPVIO(SvANY(sv));
5315 SvFLAGS(sv) &= SVf_BREAK;
5316 SvFLAGS(sv) |= SVTYPEMASK;
5320 =for apidoc sv_newref
5322 Increment an SV's reference count. Use the C<SvREFCNT_inc()> wrapper
5329 Perl_sv_newref(pTHX_ SV *sv)
5332 ATOMIC_INC(SvREFCNT(sv));
5339 Decrement an SV's reference count, and if it drops to zero, call
5340 C<sv_clear> to invoke destructors and free up any memory used by
5341 the body; finally, deallocate the SV's head itself.
5342 Normally called via a wrapper macro C<SvREFCNT_dec>.
5348 Perl_sv_free(pTHX_ SV *sv)
5350 int refcount_is_zero;
5354 if (SvREFCNT(sv) == 0) {
5355 if (SvFLAGS(sv) & SVf_BREAK)
5356 /* this SV's refcnt has been artificially decremented to
5357 * trigger cleanup */
5359 if (PL_in_clean_all) /* All is fair */
5361 if (SvREADONLY(sv) && SvIMMORTAL(sv)) {
5362 /* make sure SvREFCNT(sv)==0 happens very seldom */
5363 SvREFCNT(sv) = (~(U32)0)/2;
5366 if (ckWARN_d(WARN_INTERNAL))
5367 Perl_warner(aTHX_ packWARN(WARN_INTERNAL), "Attempt to free unreferenced scalar");
5370 ATOMIC_DEC_AND_TEST(refcount_is_zero, SvREFCNT(sv));
5371 if (!refcount_is_zero)
5375 if (ckWARN_d(WARN_DEBUGGING))
5376 Perl_warner(aTHX_ packWARN(WARN_DEBUGGING),
5377 "Attempt to free temp prematurely: SV 0x%"UVxf,
5382 if (SvREADONLY(sv) && SvIMMORTAL(sv)) {
5383 /* make sure SvREFCNT(sv)==0 happens very seldom */
5384 SvREFCNT(sv) = (~(U32)0)/2;
5395 Returns the length of the string in the SV. Handles magic and type
5396 coercion. See also C<SvCUR>, which gives raw access to the xpv_cur slot.
5402 Perl_sv_len(pTHX_ register SV *sv)
5410 len = mg_length(sv);
5412 (void)SvPV(sv, len);
5417 =for apidoc sv_len_utf8
5419 Returns the number of characters in the string in an SV, counting wide
5420 UTF8 bytes as a single character. Handles magic and type coercion.
5426 Perl_sv_len_utf8(pTHX_ register SV *sv)
5432 return mg_length(sv);
5436 U8 *s = (U8*)SvPV(sv, len);
5438 return Perl_utf8_length(aTHX_ s, s + len);
5443 =for apidoc sv_pos_u2b
5445 Converts the value pointed to by offsetp from a count of UTF8 chars from
5446 the start of the string, to a count of the equivalent number of bytes; if
5447 lenp is non-zero, it does the same to lenp, but this time starting from
5448 the offset, rather than from the start of the string. Handles magic and
5455 Perl_sv_pos_u2b(pTHX_ register SV *sv, I32* offsetp, I32* lenp)
5460 I32 uoffset = *offsetp;
5466 start = s = (U8*)SvPV(sv, len);
5468 while (s < send && uoffset--)
5472 *offsetp = s - start;
5476 while (s < send && ulen--)
5486 =for apidoc sv_pos_b2u
5488 Converts the value pointed to by offsetp from a count of bytes from the
5489 start of the string, to a count of the equivalent number of UTF8 chars.
5490 Handles magic and type coercion.
5496 Perl_sv_pos_b2u(pTHX_ register SV *sv, I32* offsetp)
5505 s = (U8*)SvPV(sv, len);
5506 if ((I32)len < *offsetp)
5507 Perl_croak(aTHX_ "panic: sv_pos_b2u: bad byte offset");
5508 send = s + *offsetp;
5512 /* Call utf8n_to_uvchr() to validate the sequence
5513 * (unless a simple non-UTF character) */
5514 if (!UTF8_IS_INVARIANT(*s))
5515 utf8n_to_uvchr(s, UTF8SKIP(s), &n, 0);
5530 Returns a boolean indicating whether the strings in the two SVs are
5531 identical. Is UTF-8 and 'use bytes' aware, handles get magic, and will
5532 coerce its args to strings if necessary.
5538 Perl_sv_eq(pTHX_ register SV *sv1, register SV *sv2)
5546 SV* svrecode = Nullsv;
5553 pv1 = SvPV(sv1, cur1);
5560 pv2 = SvPV(sv2, cur2);
5562 if (cur1 && cur2 && SvUTF8(sv1) != SvUTF8(sv2) && !IN_BYTES) {
5563 /* Differing utf8ness.
5564 * Do not UTF8size the comparands as a side-effect. */
5567 svrecode = newSVpvn(pv2, cur2);
5568 sv_recode_to_utf8(svrecode, PL_encoding);
5569 pv2 = SvPV(svrecode, cur2);
5572 svrecode = newSVpvn(pv1, cur1);
5573 sv_recode_to_utf8(svrecode, PL_encoding);
5574 pv1 = SvPV(svrecode, cur1);
5576 /* Now both are in UTF-8. */
5581 bool is_utf8 = TRUE;
5584 /* sv1 is the UTF-8 one,
5585 * if is equal it must be downgrade-able */
5586 char *pv = (char*)bytes_from_utf8((U8*)pv1,
5592 /* sv2 is the UTF-8 one,
5593 * if is equal it must be downgrade-able */
5594 char *pv = (char *)bytes_from_utf8((U8*)pv2,
5600 /* Downgrade not possible - cannot be eq */
5607 eq = (pv1 == pv2) || memEQ(pv1, pv2, cur1);
5610 SvREFCNT_dec(svrecode);
5621 Compares the strings in two SVs. Returns -1, 0, or 1 indicating whether the
5622 string in C<sv1> is less than, equal to, or greater than the string in
5623 C<sv2>. Is UTF-8 and 'use bytes' aware, handles get magic, and will
5624 coerce its args to strings if necessary. See also C<sv_cmp_locale>.
5630 Perl_sv_cmp(pTHX_ register SV *sv1, register SV *sv2)
5633 char *pv1, *pv2, *tpv = Nullch;
5635 SV *svrecode = Nullsv;
5642 pv1 = SvPV(sv1, cur1);
5649 pv2 = SvPV(sv2, cur2);
5651 if (cur1 && cur2 && SvUTF8(sv1) != SvUTF8(sv2) && !IN_BYTES) {
5652 /* Differing utf8ness.
5653 * Do not UTF8size the comparands as a side-effect. */
5656 svrecode = newSVpvn(pv2, cur2);
5657 sv_recode_to_utf8(svrecode, PL_encoding);
5658 pv2 = SvPV(svrecode, cur2);
5661 pv2 = tpv = (char*)bytes_to_utf8((U8*)pv2, &cur2);
5666 svrecode = newSVpvn(pv1, cur1);
5667 sv_recode_to_utf8(svrecode, PL_encoding);
5668 pv1 = SvPV(svrecode, cur1);
5671 pv1 = tpv = (char*)bytes_to_utf8((U8*)pv1, &cur1);
5677 cmp = cur2 ? -1 : 0;
5681 I32 retval = memcmp((void*)pv1, (void*)pv2, cur1 < cur2 ? cur1 : cur2);
5684 cmp = retval < 0 ? -1 : 1;
5685 } else if (cur1 == cur2) {
5688 cmp = cur1 < cur2 ? -1 : 1;
5693 SvREFCNT_dec(svrecode);
5702 =for apidoc sv_cmp_locale
5704 Compares the strings in two SVs in a locale-aware manner. Is UTF-8 and
5705 'use bytes' aware, handles get magic, and will coerce its args to strings
5706 if necessary. See also C<sv_cmp_locale>. See also C<sv_cmp>.
5712 Perl_sv_cmp_locale(pTHX_ register SV *sv1, register SV *sv2)
5714 #ifdef USE_LOCALE_COLLATE
5720 if (PL_collation_standard)
5724 pv1 = sv1 ? sv_collxfrm(sv1, &len1) : (char *) NULL;
5726 pv2 = sv2 ? sv_collxfrm(sv2, &len2) : (char *) NULL;
5728 if (!pv1 || !len1) {
5739 retval = memcmp((void*)pv1, (void*)pv2, len1 < len2 ? len1 : len2);
5742 return retval < 0 ? -1 : 1;
5745 * When the result of collation is equality, that doesn't mean
5746 * that there are no differences -- some locales exclude some
5747 * characters from consideration. So to avoid false equalities,
5748 * we use the raw string as a tiebreaker.
5754 #endif /* USE_LOCALE_COLLATE */
5756 return sv_cmp(sv1, sv2);
5760 #ifdef USE_LOCALE_COLLATE
5763 =for apidoc sv_collxfrm
5765 Add Collate Transform magic to an SV if it doesn't already have it.
5767 Any scalar variable may carry PERL_MAGIC_collxfrm magic that contains the
5768 scalar data of the variable, but transformed to such a format that a normal
5769 memory comparison can be used to compare the data according to the locale
5776 Perl_sv_collxfrm(pTHX_ SV *sv, STRLEN *nxp)
5780 mg = SvMAGICAL(sv) ? mg_find(sv, PERL_MAGIC_collxfrm) : (MAGIC *) NULL;
5781 if (!mg || !mg->mg_ptr || *(U32*)mg->mg_ptr != PL_collation_ix) {
5786 Safefree(mg->mg_ptr);
5788 if ((xf = mem_collxfrm(s, len, &xlen))) {
5789 if (SvREADONLY(sv)) {
5792 return xf + sizeof(PL_collation_ix);
5795 sv_magic(sv, 0, PERL_MAGIC_collxfrm, 0, 0);
5796 mg = mg_find(sv, PERL_MAGIC_collxfrm);
5809 if (mg && mg->mg_ptr) {
5811 return mg->mg_ptr + sizeof(PL_collation_ix);
5819 #endif /* USE_LOCALE_COLLATE */
5824 Get a line from the filehandle and store it into the SV, optionally
5825 appending to the currently-stored string.
5831 Perl_sv_gets(pTHX_ register SV *sv, register PerlIO *fp, I32 append)
5835 register STDCHAR rslast;
5836 register STDCHAR *bp;
5841 SV_CHECK_THINKFIRST_COW_DROP(sv);
5842 /* XXX. If you make this PVIV, then copy on write can copy scalars read
5844 However, perlbench says it's slower, because the existing swipe code
5845 is faster than copy on write.
5846 Swings and roundabouts. */
5847 (void)SvUPGRADE(sv, SVt_PV);
5851 if (PL_curcop == &PL_compiling) {
5852 /* we always read code in line mode */
5856 else if (RsSNARF(PL_rs)) {
5860 else if (RsRECORD(PL_rs)) {
5861 I32 recsize, bytesread;
5864 /* Grab the size of the record we're getting */
5865 recsize = SvIV(SvRV(PL_rs));
5866 (void)SvPOK_only(sv); /* Validate pointer */
5867 buffer = SvGROW(sv, (STRLEN)(recsize + 1));
5870 /* VMS wants read instead of fread, because fread doesn't respect */
5871 /* RMS record boundaries. This is not necessarily a good thing to be */
5872 /* doing, but we've got no other real choice */
5873 bytesread = PerlLIO_read(PerlIO_fileno(fp), buffer, recsize);
5875 bytesread = PerlIO_read(fp, buffer, recsize);
5877 SvCUR_set(sv, bytesread);
5878 buffer[bytesread] = '\0';
5879 if (PerlIO_isutf8(fp))
5883 return(SvCUR(sv) ? SvPVX(sv) : Nullch);
5885 else if (RsPARA(PL_rs)) {
5891 /* Get $/ i.e. PL_rs into same encoding as stream wants */
5892 if (PerlIO_isutf8(fp)) {
5893 rsptr = SvPVutf8(PL_rs, rslen);
5896 if (SvUTF8(PL_rs)) {
5897 if (!sv_utf8_downgrade(PL_rs, TRUE)) {
5898 Perl_croak(aTHX_ "Wide character in $/");
5901 rsptr = SvPV(PL_rs, rslen);
5905 rslast = rslen ? rsptr[rslen - 1] : '\0';
5907 if (rspara) { /* have to do this both before and after */
5908 do { /* to make sure file boundaries work right */
5911 i = PerlIO_getc(fp);
5915 PerlIO_ungetc(fp,i);
5921 /* See if we know enough about I/O mechanism to cheat it ! */
5923 /* This used to be #ifdef test - it is made run-time test for ease
5924 of abstracting out stdio interface. One call should be cheap
5925 enough here - and may even be a macro allowing compile
5929 if (PerlIO_fast_gets(fp)) {
5932 * We're going to steal some values from the stdio struct
5933 * and put EVERYTHING in the innermost loop into registers.
5935 register STDCHAR *ptr;
5939 #if defined(VMS) && defined(PERLIO_IS_STDIO)
5940 /* An ungetc()d char is handled separately from the regular
5941 * buffer, so we getc() it back out and stuff it in the buffer.
5943 i = PerlIO_getc(fp);
5944 if (i == EOF) return 0;
5945 *(--((*fp)->_ptr)) = (unsigned char) i;
5949 /* Here is some breathtakingly efficient cheating */
5951 cnt = PerlIO_get_cnt(fp); /* get count into register */
5952 (void)SvPOK_only(sv); /* validate pointer */
5953 if ((I32)(SvLEN(sv) - append) <= cnt + 1) { /* make sure we have the room */
5954 if (cnt > 80 && (I32)SvLEN(sv) > append) {
5955 shortbuffered = cnt - SvLEN(sv) + append + 1;
5956 cnt -= shortbuffered;
5960 /* remember that cnt can be negative */
5961 SvGROW(sv, (STRLEN)(append + (cnt <= 0 ? 2 : (cnt + 1))));
5966 bp = (STDCHAR*)SvPVX(sv) + append; /* move these two too to registers */
5967 ptr = (STDCHAR*)PerlIO_get_ptr(fp);
5968 DEBUG_P(PerlIO_printf(Perl_debug_log,
5969 "Screamer: entering, ptr=%"UVuf", cnt=%ld\n",PTR2UV(ptr),(long)cnt));
5970 DEBUG_P(PerlIO_printf(Perl_debug_log,
5971 "Screamer: entering: PerlIO * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
5972 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
5973 PTR2UV(PerlIO_has_base(fp) ? PerlIO_get_base(fp) : 0)));
5978 while (cnt > 0) { /* this | eat */
5980 if ((*bp++ = *ptr++) == rslast) /* really | dust */
5981 goto thats_all_folks; /* screams | sed :-) */
5985 Copy(ptr, bp, cnt, char); /* this | eat */
5986 bp += cnt; /* screams | dust */
5987 ptr += cnt; /* louder | sed :-) */
5992 if (shortbuffered) { /* oh well, must extend */
5993 cnt = shortbuffered;
5995 bpx = bp - (STDCHAR*)SvPVX(sv); /* box up before relocation */
5997 SvGROW(sv, SvLEN(sv) + append + cnt + 2);
5998 bp = (STDCHAR*)SvPVX(sv) + bpx; /* unbox after relocation */
6002 DEBUG_P(PerlIO_printf(Perl_debug_log,
6003 "Screamer: going to getc, ptr=%"UVuf", cnt=%ld\n",
6004 PTR2UV(ptr),(long)cnt));
6005 PerlIO_set_ptrcnt(fp, (STDCHAR*)ptr, cnt); /* deregisterize cnt and ptr */
6007 DEBUG_P(PerlIO_printf(Perl_debug_log,
6008 "Screamer: pre: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
6009 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
6010 PTR2UV(PerlIO_has_base (fp) ? PerlIO_get_base(fp) : 0)));
6012 /* This used to call 'filbuf' in stdio form, but as that behaves like
6013 getc when cnt <= 0 we use PerlIO_getc here to avoid introducing
6014 another abstraction. */
6015 i = PerlIO_getc(fp); /* get more characters */
6017 DEBUG_P(PerlIO_printf(Perl_debug_log,
6018 "Screamer: post: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
6019 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
6020 PTR2UV(PerlIO_has_base (fp) ? PerlIO_get_base(fp) : 0)));
6022 cnt = PerlIO_get_cnt(fp);
6023 ptr = (STDCHAR*)PerlIO_get_ptr(fp); /* reregisterize cnt and ptr */
6024 DEBUG_P(PerlIO_printf(Perl_debug_log,
6025 "Screamer: after getc, ptr=%"UVuf", cnt=%ld\n",PTR2UV(ptr),(long)cnt));
6027 if (i == EOF) /* all done for ever? */
6028 goto thats_really_all_folks;
6030 bpx = bp - (STDCHAR*)SvPVX(sv); /* box up before relocation */
6032 SvGROW(sv, bpx + cnt + 2);
6033 bp = (STDCHAR*)SvPVX(sv) + bpx; /* unbox after relocation */
6035 *bp++ = (STDCHAR)i; /* store character from PerlIO_getc */
6037 if (rslen && (STDCHAR)i == rslast) /* all done for now? */
6038 goto thats_all_folks;
6042 if ((rslen > 1 && (STRLEN)(bp - (STDCHAR*)SvPVX(sv)) < rslen) ||
6043 memNE((char*)bp - rslen, rsptr, rslen))
6044 goto screamer; /* go back to the fray */
6045 thats_really_all_folks:
6047 cnt += shortbuffered;
6048 DEBUG_P(PerlIO_printf(Perl_debug_log,
6049 "Screamer: quitting, ptr=%"UVuf", cnt=%ld\n",PTR2UV(ptr),(long)cnt));
6050 PerlIO_set_ptrcnt(fp, (STDCHAR*)ptr, cnt); /* put these back or we're in trouble */
6051 DEBUG_P(PerlIO_printf(Perl_debug_log,
6052 "Screamer: end: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
6053 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
6054 PTR2UV(PerlIO_has_base (fp) ? PerlIO_get_base(fp) : 0)));
6056 SvCUR_set(sv, bp - (STDCHAR*)SvPVX(sv)); /* set length */
6057 DEBUG_P(PerlIO_printf(Perl_debug_log,
6058 "Screamer: done, len=%ld, string=|%.*s|\n",
6059 (long)SvCUR(sv),(int)SvCUR(sv),SvPVX(sv)));
6064 /*The big, slow, and stupid way */
6067 /* Need to work around EPOC SDK features */
6068 /* On WINS: MS VC5 generates calls to _chkstk, */
6069 /* if a `large' stack frame is allocated */
6070 /* gcc on MARM does not generate calls like these */
6076 register STDCHAR *bpe = buf + sizeof(buf);
6078 while ((i = PerlIO_getc(fp)) != EOF && (*bp++ = (STDCHAR)i) != rslast && bp < bpe)
6079 ; /* keep reading */
6083 cnt = PerlIO_read(fp,(char*)buf, sizeof(buf));
6084 /* Accomodate broken VAXC compiler, which applies U8 cast to
6085 * both args of ?: operator, causing EOF to change into 255
6088 i = (U8)buf[cnt - 1];
6094 cnt = 0; /* we do need to re-set the sv even when cnt <= 0 */
6096 sv_catpvn(sv, (char *) buf, cnt);
6098 sv_setpvn(sv, (char *) buf, cnt);
6100 if (i != EOF && /* joy */
6102 SvCUR(sv) < rslen ||
6103 memNE(SvPVX(sv) + SvCUR(sv) - rslen, rsptr, rslen)))
6107 * If we're reading from a TTY and we get a short read,
6108 * indicating that the user hit his EOF character, we need
6109 * to notice it now, because if we try to read from the TTY
6110 * again, the EOF condition will disappear.
6112 * The comparison of cnt to sizeof(buf) is an optimization
6113 * that prevents unnecessary calls to feof().
6117 if (!(cnt < sizeof(buf) && PerlIO_eof(fp)))
6122 if (rspara) { /* have to do this both before and after */
6123 while (i != EOF) { /* to make sure file boundaries work right */
6124 i = PerlIO_getc(fp);
6126 PerlIO_ungetc(fp,i);
6132 if (PerlIO_isutf8(fp))
6137 return (SvCUR(sv) - append) ? SvPVX(sv) : Nullch;
6143 Auto-increment of the value in the SV, doing string to numeric conversion
6144 if necessary. Handles 'get' magic.
6150 Perl_sv_inc(pTHX_ register SV *sv)
6159 if (SvTHINKFIRST(sv)) {
6161 sv_force_normal_flags(sv, 0);
6162 if (SvREADONLY(sv)) {
6163 if (PL_curcop != &PL_compiling)
6164 Perl_croak(aTHX_ PL_no_modify);
6168 if (SvAMAGIC(sv) && AMG_CALLun(sv,inc))
6170 i = PTR2IV(SvRV(sv));
6175 flags = SvFLAGS(sv);
6176 if ((flags & (SVp_NOK|SVp_IOK)) == SVp_NOK) {
6177 /* It's (privately or publicly) a float, but not tested as an
6178 integer, so test it to see. */
6180 flags = SvFLAGS(sv);
6182 if ((flags & SVf_IOK) || ((flags & (SVp_IOK | SVp_NOK)) == SVp_IOK)) {
6183 /* It's publicly an integer, or privately an integer-not-float */
6184 #ifdef PERL_PRESERVE_IVUV
6188 if (SvUVX(sv) == UV_MAX)
6189 sv_setnv(sv, UV_MAX_P1);
6191 (void)SvIOK_only_UV(sv);
6194 if (SvIVX(sv) == IV_MAX)
6195 sv_setuv(sv, (UV)IV_MAX + 1);
6197 (void)SvIOK_only(sv);
6203 if (flags & SVp_NOK) {
6204 (void)SvNOK_only(sv);
6209 if (!(flags & SVp_POK) || !*SvPVX(sv)) {
6210 if ((flags & SVTYPEMASK) < SVt_PVIV)
6211 sv_upgrade(sv, SVt_IV);
6212 (void)SvIOK_only(sv);
6217 while (isALPHA(*d)) d++;
6218 while (isDIGIT(*d)) d++;
6220 #ifdef PERL_PRESERVE_IVUV
6221 /* Got to punt this as an integer if needs be, but we don't issue
6222 warnings. Probably ought to make the sv_iv_please() that does
6223 the conversion if possible, and silently. */
6224 int numtype = grok_number(SvPVX(sv), SvCUR(sv), NULL);
6225 if (numtype && !(numtype & IS_NUMBER_INFINITY)) {
6226 /* Need to try really hard to see if it's an integer.
6227 9.22337203685478e+18 is an integer.
6228 but "9.22337203685478e+18" + 0 is UV=9223372036854779904
6229 so $a="9.22337203685478e+18"; $a+0; $a++
6230 needs to be the same as $a="9.22337203685478e+18"; $a++
6237 /* sv_2iv *should* have made this an NV */
6238 if (flags & SVp_NOK) {
6239 (void)SvNOK_only(sv);
6243 /* I don't think we can get here. Maybe I should assert this
6244 And if we do get here I suspect that sv_setnv will croak. NWC
6246 #if defined(USE_LONG_DOUBLE)
6247 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",
6248 SvPVX(sv), SvIVX(sv), SvNVX(sv)));
6250 DEBUG_c(PerlIO_printf(Perl_debug_log,"sv_inc punt failed to convert '%s' to IOK or NOKp, UV=0x%"UVxf" NV=%"NVgf"\n",
6251 SvPVX(sv), SvIVX(sv), SvNVX(sv)));
6254 #endif /* PERL_PRESERVE_IVUV */
6255 sv_setnv(sv,Atof(SvPVX(sv)) + 1.0);
6259 while (d >= SvPVX(sv)) {
6267 /* MKS: The original code here died if letters weren't consecutive.
6268 * at least it didn't have to worry about non-C locales. The
6269 * new code assumes that ('z'-'a')==('Z'-'A'), letters are
6270 * arranged in order (although not consecutively) and that only
6271 * [A-Za-z] are accepted by isALPHA in the C locale.
6273 if (*d != 'z' && *d != 'Z') {
6274 do { ++*d; } while (!isALPHA(*d));
6277 *(d--) -= 'z' - 'a';
6282 *(d--) -= 'z' - 'a' + 1;
6286 /* oh,oh, the number grew */
6287 SvGROW(sv, SvCUR(sv) + 2);
6289 for (d = SvPVX(sv) + SvCUR(sv); d > SvPVX(sv); d--)
6300 Auto-decrement of the value in the SV, doing string to numeric conversion
6301 if necessary. Handles 'get' magic.
6307 Perl_sv_dec(pTHX_ register SV *sv)
6315 if (SvTHINKFIRST(sv)) {
6317 sv_force_normal_flags(sv, 0);
6318 if (SvREADONLY(sv)) {
6319 if (PL_curcop != &PL_compiling)
6320 Perl_croak(aTHX_ PL_no_modify);
6324 if (SvAMAGIC(sv) && AMG_CALLun(sv,dec))
6326 i = PTR2IV(SvRV(sv));
6331 /* Unlike sv_inc we don't have to worry about string-never-numbers
6332 and keeping them magic. But we mustn't warn on punting */
6333 flags = SvFLAGS(sv);
6334 if ((flags & SVf_IOK) || ((flags & (SVp_IOK | SVp_NOK)) == SVp_IOK)) {
6335 /* It's publicly an integer, or privately an integer-not-float */
6336 #ifdef PERL_PRESERVE_IVUV
6340 if (SvUVX(sv) == 0) {
6341 (void)SvIOK_only(sv);
6345 (void)SvIOK_only_UV(sv);
6349 if (SvIVX(sv) == IV_MIN)
6350 sv_setnv(sv, (NV)IV_MIN - 1.0);
6352 (void)SvIOK_only(sv);
6358 if (flags & SVp_NOK) {
6360 (void)SvNOK_only(sv);
6363 if (!(flags & SVp_POK)) {
6364 if ((flags & SVTYPEMASK) < SVt_PVNV)
6365 sv_upgrade(sv, SVt_NV);
6367 (void)SvNOK_only(sv);
6370 #ifdef PERL_PRESERVE_IVUV
6372 int numtype = grok_number(SvPVX(sv), SvCUR(sv), NULL);
6373 if (numtype && !(numtype & IS_NUMBER_INFINITY)) {
6374 /* Need to try really hard to see if it's an integer.
6375 9.22337203685478e+18 is an integer.
6376 but "9.22337203685478e+18" + 0 is UV=9223372036854779904
6377 so $a="9.22337203685478e+18"; $a+0; $a--
6378 needs to be the same as $a="9.22337203685478e+18"; $a--
6385 /* sv_2iv *should* have made this an NV */
6386 if (flags & SVp_NOK) {
6387 (void)SvNOK_only(sv);
6391 /* I don't think we can get here. Maybe I should assert this
6392 And if we do get here I suspect that sv_setnv will croak. NWC
6394 #if defined(USE_LONG_DOUBLE)
6395 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",
6396 SvPVX(sv), SvIVX(sv), SvNVX(sv)));
6398 DEBUG_c(PerlIO_printf(Perl_debug_log,"sv_dec punt failed to convert '%s' to IOK or NOKp, UV=0x%"UVxf" NV=%"NVgf"\n",
6399 SvPVX(sv), SvIVX(sv), SvNVX(sv)));
6403 #endif /* PERL_PRESERVE_IVUV */
6404 sv_setnv(sv,Atof(SvPVX(sv)) - 1.0); /* punt */
6408 =for apidoc sv_mortalcopy
6410 Creates a new SV which is a copy of the original SV (using C<sv_setsv>).
6411 The new SV is marked as mortal. It will be destroyed "soon", either by an
6412 explicit call to FREETMPS, or by an implicit call at places such as
6413 statement boundaries. See also C<sv_newmortal> and C<sv_2mortal>.
6418 /* Make a string that will exist for the duration of the expression
6419 * evaluation. Actually, it may have to last longer than that, but
6420 * hopefully we won't free it until it has been assigned to a
6421 * permanent location. */
6424 Perl_sv_mortalcopy(pTHX_ SV *oldstr)
6429 sv_setsv(sv,oldstr);
6431 PL_tmps_stack[++PL_tmps_ix] = sv;
6437 =for apidoc sv_newmortal
6439 Creates a new null SV which is mortal. The reference count of the SV is
6440 set to 1. It will be destroyed "soon", either by an explicit call to
6441 FREETMPS, or by an implicit call at places such as statement boundaries.
6442 See also C<sv_mortalcopy> and C<sv_2mortal>.
6448 Perl_sv_newmortal(pTHX)
6453 SvFLAGS(sv) = SVs_TEMP;
6455 PL_tmps_stack[++PL_tmps_ix] = sv;
6460 =for apidoc sv_2mortal
6462 Marks an existing SV as mortal. The SV will be destroyed "soon", either
6463 by an explicit call to FREETMPS, or by an implicit call at places such as
6464 statement boundaries. See also C<sv_newmortal> and C<sv_mortalcopy>.
6470 Perl_sv_2mortal(pTHX_ register SV *sv)
6474 if (SvREADONLY(sv) && SvIMMORTAL(sv))
6477 PL_tmps_stack[++PL_tmps_ix] = sv;
6485 Creates a new SV and copies a string into it. The reference count for the
6486 SV is set to 1. If C<len> is zero, Perl will compute the length using
6487 strlen(). For efficiency, consider using C<newSVpvn> instead.
6493 Perl_newSVpv(pTHX_ const char *s, STRLEN len)
6500 sv_setpvn(sv,s,len);
6505 =for apidoc newSVpvn
6507 Creates a new SV and copies a string into it. The reference count for the
6508 SV is set to 1. Note that if C<len> is zero, Perl will create a zero length
6509 string. You are responsible for ensuring that the source string is at least
6516 Perl_newSVpvn(pTHX_ const char *s, STRLEN len)
6521 sv_setpvn(sv,s,len);
6526 =for apidoc newSVpvn_share
6528 Creates a new SV with its SvPVX pointing to a shared string in the string
6529 table. If the string does not already exist in the table, it is created
6530 first. Turns on READONLY and FAKE. The string's hash is stored in the UV
6531 slot of the SV; if the C<hash> parameter is non-zero, that value is used;
6532 otherwise the hash is computed. The idea here is that as the string table
6533 is used for shared hash keys these strings will have SvPVX == HeKEY and
6534 hash lookup will avoid string compare.
6540 Perl_newSVpvn_share(pTHX_ const char *src, I32 len, U32 hash)
6543 bool is_utf8 = FALSE;
6545 STRLEN tmplen = -len;
6547 /* See the note in hv.c:hv_fetch() --jhi */
6548 src = (char*)bytes_from_utf8((U8*)src, &tmplen, &is_utf8);
6552 PERL_HASH(hash, src, len);
6554 sv_upgrade(sv, SVt_PVIV);
6555 SvPVX(sv) = sharepvn(src, is_utf8?-len:len, hash);
6568 #if defined(PERL_IMPLICIT_CONTEXT)
6570 /* pTHX_ magic can't cope with varargs, so this is a no-context
6571 * version of the main function, (which may itself be aliased to us).
6572 * Don't access this version directly.
6576 Perl_newSVpvf_nocontext(const char* pat, ...)
6581 va_start(args, pat);
6582 sv = vnewSVpvf(pat, &args);
6589 =for apidoc newSVpvf
6591 Creates a new SV and initializes it with the string formatted like
6598 Perl_newSVpvf(pTHX_ const char* pat, ...)
6602 va_start(args, pat);
6603 sv = vnewSVpvf(pat, &args);
6608 /* backend for newSVpvf() and newSVpvf_nocontext() */
6611 Perl_vnewSVpvf(pTHX_ const char* pat, va_list* args)
6615 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
6622 Creates a new SV and copies a floating point value into it.
6623 The reference count for the SV is set to 1.
6629 Perl_newSVnv(pTHX_ NV n)
6641 Creates a new SV and copies an integer into it. The reference count for the
6648 Perl_newSViv(pTHX_ IV i)
6660 Creates a new SV and copies an unsigned integer into it.
6661 The reference count for the SV is set to 1.
6667 Perl_newSVuv(pTHX_ UV u)
6677 =for apidoc newRV_noinc
6679 Creates an RV wrapper for an SV. The reference count for the original
6680 SV is B<not> incremented.
6686 Perl_newRV_noinc(pTHX_ SV *tmpRef)
6691 sv_upgrade(sv, SVt_RV);
6698 /* newRV_inc is the official function name to use now.
6699 * newRV_inc is in fact #defined to newRV in sv.h
6703 Perl_newRV(pTHX_ SV *tmpRef)
6705 return newRV_noinc(SvREFCNT_inc(tmpRef));
6711 Creates a new SV which is an exact duplicate of the original SV.
6718 Perl_newSVsv(pTHX_ register SV *old)
6724 if (SvTYPE(old) == SVTYPEMASK) {
6725 if (ckWARN_d(WARN_INTERNAL))
6726 Perl_warner(aTHX_ packWARN(WARN_INTERNAL), "semi-panic: attempt to dup freed string");
6741 =for apidoc sv_reset
6743 Underlying implementation for the C<reset> Perl function.
6744 Note that the perl-level function is vaguely deprecated.
6750 Perl_sv_reset(pTHX_ register char *s, HV *stash)
6758 char todo[PERL_UCHAR_MAX+1];
6763 if (!*s) { /* reset ?? searches */
6764 for (pm = HvPMROOT(stash); pm; pm = pm->op_pmnext) {
6765 pm->op_pmdynflags &= ~PMdf_USED;
6770 /* reset variables */
6772 if (!HvARRAY(stash))
6775 Zero(todo, 256, char);
6777 i = (unsigned char)*s;
6781 max = (unsigned char)*s++;
6782 for ( ; i <= max; i++) {
6785 for (i = 0; i <= (I32) HvMAX(stash); i++) {
6786 for (entry = HvARRAY(stash)[i];
6788 entry = HeNEXT(entry))
6790 if (!todo[(U8)*HeKEY(entry)])
6792 gv = (GV*)HeVAL(entry);
6794 if (SvTHINKFIRST(sv)) {
6795 if (!SvREADONLY(sv) && SvROK(sv))
6800 if (SvTYPE(sv) >= SVt_PV) {
6802 if (SvPVX(sv) != Nullch)
6809 if (GvHV(gv) && !HvNAME(GvHV(gv))) {
6811 #ifdef USE_ENVIRON_ARRAY
6813 # ifdef USE_ITHREADS
6814 && PL_curinterp == aTHX
6818 environ[0] = Nullch;
6830 Using various gambits, try to get an IO from an SV: the IO slot if its a
6831 GV; or the recursive result if we're an RV; or the IO slot of the symbol
6832 named after the PV if we're a string.
6838 Perl_sv_2io(pTHX_ SV *sv)
6844 switch (SvTYPE(sv)) {
6852 Perl_croak(aTHX_ "Bad filehandle: %s", GvNAME(gv));
6856 Perl_croak(aTHX_ PL_no_usym, "filehandle");
6858 return sv_2io(SvRV(sv));
6859 gv = gv_fetchpv(SvPV(sv,n_a), FALSE, SVt_PVIO);
6865 Perl_croak(aTHX_ "Bad filehandle: %s", SvPV(sv,n_a));
6874 Using various gambits, try to get a CV from an SV; in addition, try if
6875 possible to set C<*st> and C<*gvp> to the stash and GV associated with it.
6881 Perl_sv_2cv(pTHX_ SV *sv, HV **st, GV **gvp, I32 lref)
6888 return *gvp = Nullgv, Nullcv;
6889 switch (SvTYPE(sv)) {
6908 SV **sp = &sv; /* Used in tryAMAGICunDEREF macro. */
6909 tryAMAGICunDEREF(to_cv);
6912 if (SvTYPE(sv) == SVt_PVCV) {
6921 Perl_croak(aTHX_ "Not a subroutine reference");
6926 gv = gv_fetchpv(SvPV(sv, n_a), lref, SVt_PVCV);
6932 if (lref && !GvCVu(gv)) {
6935 tmpsv = NEWSV(704,0);
6936 gv_efullname3(tmpsv, gv, Nullch);
6937 /* XXX this is probably not what they think they're getting.
6938 * It has the same effect as "sub name;", i.e. just a forward
6940 newSUB(start_subparse(FALSE, 0),
6941 newSVOP(OP_CONST, 0, tmpsv),
6946 Perl_croak(aTHX_ "Unable to create sub named \"%s\"", SvPV(sv,n_a));
6955 Returns true if the SV has a true value by Perl's rules.
6956 Use the C<SvTRUE> macro instead, which may call C<sv_true()> or may
6957 instead use an in-line version.
6963 Perl_sv_true(pTHX_ register SV *sv)
6969 if ((tXpv = (XPV*)SvANY(sv)) &&
6970 (tXpv->xpv_cur > 1 ||
6971 (tXpv->xpv_cur && *tXpv->xpv_pv != '0')))
6978 return SvIVX(sv) != 0;
6981 return SvNVX(sv) != 0.0;
6983 return sv_2bool(sv);
6991 A private implementation of the C<SvIVx> macro for compilers which can't
6992 cope with complex macro expressions. Always use the macro instead.
6998 Perl_sv_iv(pTHX_ register SV *sv)
7002 return (IV)SvUVX(sv);
7011 A private implementation of the C<SvUVx> macro for compilers which can't
7012 cope with complex macro expressions. Always use the macro instead.
7018 Perl_sv_uv(pTHX_ register SV *sv)
7023 return (UV)SvIVX(sv);
7031 A private implementation of the C<SvNVx> macro for compilers which can't
7032 cope with complex macro expressions. Always use the macro instead.
7038 Perl_sv_nv(pTHX_ register SV *sv)
7048 Use the C<SvPV_nolen> macro instead
7052 A private implementation of the C<SvPV> macro for compilers which can't
7053 cope with complex macro expressions. Always use the macro instead.
7059 Perl_sv_pvn(pTHX_ SV *sv, STRLEN *lp)
7065 return sv_2pv(sv, lp);
7070 Perl_sv_pvn_nomg(pTHX_ register SV *sv, STRLEN *lp)
7076 return sv_2pv_flags(sv, lp, 0);
7080 =for apidoc sv_pvn_force
7082 Get a sensible string out of the SV somehow.
7083 A private implementation of the C<SvPV_force> macro for compilers which
7084 can't cope with complex macro expressions. Always use the macro instead.
7086 =for apidoc sv_pvn_force_flags
7088 Get a sensible string out of the SV somehow.
7089 If C<flags> has C<SV_GMAGIC> bit set, will C<mg_get> on C<sv> if
7090 appropriate, else not. C<sv_pvn_force> and C<sv_pvn_force_nomg> are
7091 implemented in terms of this function.
7092 You normally want to use the various wrapper macros instead: see
7093 C<SvPV_force> and C<SvPV_force_nomg>
7099 Perl_sv_pvn_force_flags(pTHX_ SV *sv, STRLEN *lp, I32 flags)
7103 if (SvTHINKFIRST(sv) && !SvROK(sv))
7104 sv_force_normal_flags(sv, 0);
7110 if (SvTYPE(sv) > SVt_PVLV && SvTYPE(sv) != SVt_PVFM) {
7111 Perl_croak(aTHX_ "Can't coerce %s to string in %s", sv_reftype(sv,0),
7115 s = sv_2pv_flags(sv, lp, flags);
7116 if (s != SvPVX(sv)) { /* Almost, but not quite, sv_setpvn() */
7121 (void)SvUPGRADE(sv, SVt_PV); /* Never FALSE */
7122 SvGROW(sv, len + 1);
7123 Move(s,SvPVX(sv),len,char);
7128 SvPOK_on(sv); /* validate pointer */
7130 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2pv(%s)\n",
7131 PTR2UV(sv),SvPVX(sv)));
7138 =for apidoc sv_pvbyte
7140 Use C<SvPVbyte_nolen> instead.
7142 =for apidoc sv_pvbyten
7144 A private implementation of the C<SvPVbyte> macro for compilers
7145 which can't cope with complex macro expressions. Always use the macro
7152 Perl_sv_pvbyten(pTHX_ SV *sv, STRLEN *lp)
7154 sv_utf8_downgrade(sv,0);
7155 return sv_pvn(sv,lp);
7159 =for apidoc sv_pvbyten_force
7161 A private implementation of the C<SvPVbytex_force> macro for compilers
7162 which can't cope with complex macro expressions. Always use the macro
7169 Perl_sv_pvbyten_force(pTHX_ SV *sv, STRLEN *lp)
7171 sv_utf8_downgrade(sv,0);
7172 return sv_pvn_force(sv,lp);
7176 =for apidoc sv_pvutf8
7178 Use the C<SvPVutf8_nolen> macro instead
7180 =for apidoc sv_pvutf8n
7182 A private implementation of the C<SvPVutf8> macro for compilers
7183 which can't cope with complex macro expressions. Always use the macro
7190 Perl_sv_pvutf8n(pTHX_ SV *sv, STRLEN *lp)
7192 sv_utf8_upgrade(sv);
7193 return sv_pvn(sv,lp);
7197 =for apidoc sv_pvutf8n_force
7199 A private implementation of the C<SvPVutf8_force> macro for compilers
7200 which can't cope with complex macro expressions. Always use the macro
7207 Perl_sv_pvutf8n_force(pTHX_ SV *sv, STRLEN *lp)
7209 sv_utf8_upgrade(sv);
7210 return sv_pvn_force(sv,lp);
7214 =for apidoc sv_reftype
7216 Returns a string describing what the SV is a reference to.
7222 Perl_sv_reftype(pTHX_ SV *sv, int ob)
7224 if (ob && SvOBJECT(sv)) {
7225 HV *svs = SvSTASH(sv);
7226 /* [20011101.072] This bandaid for C<package;> should eventually
7227 be removed. AMS 20011103 */
7228 return (svs ? HvNAME(svs) : "<none>");
7231 switch (SvTYPE(sv)) {
7247 case SVt_PVLV: return "LVALUE";
7248 case SVt_PVAV: return "ARRAY";
7249 case SVt_PVHV: return "HASH";
7250 case SVt_PVCV: return "CODE";
7251 case SVt_PVGV: return "GLOB";
7252 case SVt_PVFM: return "FORMAT";
7253 case SVt_PVIO: return "IO";
7254 default: return "UNKNOWN";
7260 =for apidoc sv_isobject
7262 Returns a boolean indicating whether the SV is an RV pointing to a blessed
7263 object. If the SV is not an RV, or if the object is not blessed, then this
7270 Perl_sv_isobject(pTHX_ SV *sv)
7287 Returns a boolean indicating whether the SV is blessed into the specified
7288 class. This does not check for subtypes; use C<sv_derived_from> to verify
7289 an inheritance relationship.
7295 Perl_sv_isa(pTHX_ SV *sv, const char *name)
7307 return strEQ(HvNAME(SvSTASH(sv)), name);
7313 Creates a new SV for the RV, C<rv>, to point to. If C<rv> is not an RV then
7314 it will be upgraded to one. If C<classname> is non-null then the new SV will
7315 be blessed in the specified package. The new SV is returned and its
7316 reference count is 1.
7322 Perl_newSVrv(pTHX_ SV *rv, const char *classname)
7328 SV_CHECK_THINKFIRST_COW_DROP(rv);
7331 if (SvTYPE(rv) >= SVt_PVMG) {
7332 U32 refcnt = SvREFCNT(rv);
7336 SvREFCNT(rv) = refcnt;
7339 if (SvTYPE(rv) < SVt_RV)
7340 sv_upgrade(rv, SVt_RV);
7341 else if (SvTYPE(rv) > SVt_RV) {
7342 (void)SvOOK_off(rv);
7343 if (SvPVX(rv) && SvLEN(rv))
7344 Safefree(SvPVX(rv));
7354 HV* stash = gv_stashpv(classname, TRUE);
7355 (void)sv_bless(rv, stash);
7361 =for apidoc sv_setref_pv
7363 Copies a pointer into a new SV, optionally blessing the SV. The C<rv>
7364 argument will be upgraded to an RV. That RV will be modified to point to
7365 the new SV. If the C<pv> argument is NULL then C<PL_sv_undef> will be placed
7366 into the SV. The C<classname> argument indicates the package for the
7367 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
7368 will be returned and will have a reference count of 1.
7370 Do not use with other Perl types such as HV, AV, SV, CV, because those
7371 objects will become corrupted by the pointer copy process.
7373 Note that C<sv_setref_pvn> copies the string while this copies the pointer.
7379 Perl_sv_setref_pv(pTHX_ SV *rv, const char *classname, void *pv)
7382 sv_setsv(rv, &PL_sv_undef);
7386 sv_setiv(newSVrv(rv,classname), PTR2IV(pv));
7391 =for apidoc sv_setref_iv
7393 Copies an integer into a new SV, optionally blessing the SV. The C<rv>
7394 argument will be upgraded to an RV. That RV will be modified to point to
7395 the new SV. The C<classname> argument indicates the package for the
7396 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
7397 will be returned and will have a reference count of 1.
7403 Perl_sv_setref_iv(pTHX_ SV *rv, const char *classname, IV iv)
7405 sv_setiv(newSVrv(rv,classname), iv);
7410 =for apidoc sv_setref_uv
7412 Copies an unsigned integer into a new SV, optionally blessing the SV. The C<rv>
7413 argument will be upgraded to an RV. That RV will be modified to point to
7414 the new SV. The C<classname> argument indicates the package for the
7415 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
7416 will be returned and will have a reference count of 1.
7422 Perl_sv_setref_uv(pTHX_ SV *rv, const char *classname, UV uv)
7424 sv_setuv(newSVrv(rv,classname), uv);
7429 =for apidoc sv_setref_nv
7431 Copies a double into a new SV, optionally blessing the SV. The C<rv>
7432 argument will be upgraded to an RV. That RV will be modified to point to
7433 the new SV. The C<classname> argument indicates the package for the
7434 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
7435 will be returned and will have a reference count of 1.
7441 Perl_sv_setref_nv(pTHX_ SV *rv, const char *classname, NV nv)
7443 sv_setnv(newSVrv(rv,classname), nv);
7448 =for apidoc sv_setref_pvn
7450 Copies a string into a new SV, optionally blessing the SV. The length of the
7451 string must be specified with C<n>. The C<rv> argument will be upgraded to
7452 an RV. That RV will be modified to point to the new SV. The C<classname>
7453 argument indicates the package for the blessing. Set C<classname> to
7454 C<Nullch> to avoid the blessing. The new SV will be returned and will have
7455 a reference count of 1.
7457 Note that C<sv_setref_pv> copies the pointer while this copies the string.
7463 Perl_sv_setref_pvn(pTHX_ SV *rv, const char *classname, char *pv, STRLEN n)
7465 sv_setpvn(newSVrv(rv,classname), pv, n);
7470 =for apidoc sv_bless
7472 Blesses an SV into a specified package. The SV must be an RV. The package
7473 must be designated by its stash (see C<gv_stashpv()>). The reference count
7474 of the SV is unaffected.
7480 Perl_sv_bless(pTHX_ SV *sv, HV *stash)
7484 Perl_croak(aTHX_ "Can't bless non-reference value");
7486 if (SvFLAGS(tmpRef) & (SVs_OBJECT|SVf_READONLY)) {
7487 if (SvREADONLY(tmpRef))
7488 Perl_croak(aTHX_ PL_no_modify);
7489 if (SvOBJECT(tmpRef)) {
7490 if (SvTYPE(tmpRef) != SVt_PVIO)
7492 SvREFCNT_dec(SvSTASH(tmpRef));
7495 SvOBJECT_on(tmpRef);
7496 if (SvTYPE(tmpRef) != SVt_PVIO)
7498 (void)SvUPGRADE(tmpRef, SVt_PVMG);
7499 SvSTASH(tmpRef) = (HV*)SvREFCNT_inc(stash);
7506 if(SvSMAGICAL(tmpRef))
7507 if(mg_find(tmpRef, PERL_MAGIC_ext) || mg_find(tmpRef, PERL_MAGIC_uvar))
7515 /* Downgrades a PVGV to a PVMG.
7519 S_sv_unglob(pTHX_ SV *sv)
7523 assert(SvTYPE(sv) == SVt_PVGV);
7528 SvREFCNT_dec(GvSTASH(sv));
7529 GvSTASH(sv) = Nullhv;
7531 sv_unmagic(sv, PERL_MAGIC_glob);
7532 Safefree(GvNAME(sv));
7535 /* need to keep SvANY(sv) in the right arena */
7536 xpvmg = new_XPVMG();
7537 StructCopy(SvANY(sv), xpvmg, XPVMG);
7538 del_XPVGV(SvANY(sv));
7541 SvFLAGS(sv) &= ~SVTYPEMASK;
7542 SvFLAGS(sv) |= SVt_PVMG;
7546 =for apidoc sv_unref_flags
7548 Unsets the RV status of the SV, and decrements the reference count of
7549 whatever was being referenced by the RV. This can almost be thought of
7550 as a reversal of C<newSVrv>. The C<cflags> argument can contain
7551 C<SV_IMMEDIATE_UNREF> to force the reference count to be decremented
7552 (otherwise the decrementing is conditional on the reference count being
7553 different from one or the reference being a readonly SV).
7560 Perl_sv_unref_flags(pTHX_ SV *sv, U32 flags)
7564 if (SvWEAKREF(sv)) {
7572 if (SvREFCNT(rv) != 1 || SvREADONLY(rv) || (flags & SV_IMMEDIATE_UNREF))
7574 else /* XXX Hack, but hard to make $a=$a->[1] work otherwise */
7575 sv_2mortal(rv); /* Schedule for freeing later */
7579 =for apidoc sv_unref
7581 Unsets the RV status of the SV, and decrements the reference count of
7582 whatever was being referenced by the RV. This can almost be thought of
7583 as a reversal of C<newSVrv>. This is C<sv_unref_flags> with the C<flag>
7584 being zero. See C<SvROK_off>.
7590 Perl_sv_unref(pTHX_ SV *sv)
7592 sv_unref_flags(sv, 0);
7596 =for apidoc sv_taint
7598 Taint an SV. Use C<SvTAINTED_on> instead.
7603 Perl_sv_taint(pTHX_ SV *sv)
7605 sv_magic((sv), Nullsv, PERL_MAGIC_taint, Nullch, 0);
7609 =for apidoc sv_untaint
7611 Untaint an SV. Use C<SvTAINTED_off> instead.
7616 Perl_sv_untaint(pTHX_ SV *sv)
7618 if (SvTYPE(sv) >= SVt_PVMG && SvMAGIC(sv)) {
7619 MAGIC *mg = mg_find(sv, PERL_MAGIC_taint);
7626 =for apidoc sv_tainted
7628 Test an SV for taintedness. Use C<SvTAINTED> instead.
7633 Perl_sv_tainted(pTHX_ SV *sv)
7635 if (SvTYPE(sv) >= SVt_PVMG && SvMAGIC(sv)) {
7636 MAGIC *mg = mg_find(sv, PERL_MAGIC_taint);
7637 if (mg && ((mg->mg_len & 1) || ((mg->mg_len & 2) && mg->mg_obj == sv)))
7643 #if defined(PERL_IMPLICIT_CONTEXT)
7645 /* pTHX_ magic can't cope with varargs, so this is a no-context
7646 * version of the main function, (which may itself be aliased to us).
7647 * Don't access this version directly.
7651 Perl_sv_setpvf_nocontext(SV *sv, const char* pat, ...)
7655 va_start(args, pat);
7656 sv_vsetpvf(sv, pat, &args);
7660 /* pTHX_ magic can't cope with varargs, so this is a no-context
7661 * version of the main function, (which may itself be aliased to us).
7662 * Don't access this version directly.
7666 Perl_sv_setpvf_mg_nocontext(SV *sv, const char* pat, ...)
7670 va_start(args, pat);
7671 sv_vsetpvf_mg(sv, pat, &args);
7677 =for apidoc sv_setpvf
7679 Processes its arguments like C<sprintf> and sets an SV to the formatted
7680 output. Does not handle 'set' magic. See C<sv_setpvf_mg>.
7686 Perl_sv_setpvf(pTHX_ SV *sv, const char* pat, ...)
7689 va_start(args, pat);
7690 sv_vsetpvf(sv, pat, &args);
7694 /* backend for C<sv_setpvf> and C<sv_setpvf_nocontext> */
7697 Perl_sv_vsetpvf(pTHX_ SV *sv, const char* pat, va_list* args)
7699 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
7703 =for apidoc sv_setpvf_mg
7705 Like C<sv_setpvf>, but also handles 'set' magic.
7711 Perl_sv_setpvf_mg(pTHX_ SV *sv, const char* pat, ...)
7714 va_start(args, pat);
7715 sv_vsetpvf_mg(sv, pat, &args);
7719 /* backend for C<sv_setpvf_mg> C<setpvf_mg_nocontext> */
7722 Perl_sv_vsetpvf_mg(pTHX_ SV *sv, const char* pat, va_list* args)
7724 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
7728 #if defined(PERL_IMPLICIT_CONTEXT)
7730 /* pTHX_ magic can't cope with varargs, so this is a no-context
7731 * version of the main function, (which may itself be aliased to us).
7732 * Don't access this version directly.
7736 Perl_sv_catpvf_nocontext(SV *sv, const char* pat, ...)
7740 va_start(args, pat);
7741 sv_vcatpvf(sv, pat, &args);
7745 /* pTHX_ magic can't cope with varargs, so this is a no-context
7746 * version of the main function, (which may itself be aliased to us).
7747 * Don't access this version directly.
7751 Perl_sv_catpvf_mg_nocontext(SV *sv, const char* pat, ...)
7755 va_start(args, pat);
7756 sv_vcatpvf_mg(sv, pat, &args);
7762 =for apidoc sv_catpvf
7764 Processes its arguments like C<sprintf> and appends the formatted
7765 output to an SV. If the appended data contains "wide" characters
7766 (including, but not limited to, SVs with a UTF-8 PV formatted with %s,
7767 and characters >255 formatted with %c), the original SV might get
7768 upgraded to UTF-8. Handles 'get' magic, but not 'set' magic.
7769 C<SvSETMAGIC()> must typically be called after calling this function
7770 to handle 'set' magic.
7775 Perl_sv_catpvf(pTHX_ SV *sv, const char* pat, ...)
7778 va_start(args, pat);
7779 sv_vcatpvf(sv, pat, &args);
7783 /* backend for C<sv_catpvf> and C<catpvf_mg_nocontext> */
7786 Perl_sv_vcatpvf(pTHX_ SV *sv, const char* pat, va_list* args)
7788 sv_vcatpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
7792 =for apidoc sv_catpvf_mg
7794 Like C<sv_catpvf>, but also handles 'set' magic.
7800 Perl_sv_catpvf_mg(pTHX_ SV *sv, const char* pat, ...)
7803 va_start(args, pat);
7804 sv_vcatpvf_mg(sv, pat, &args);
7808 /* backend for C<catpvf_mg> and C<catpvf_mg_nocontext> */
7811 Perl_sv_vcatpvf_mg(pTHX_ SV *sv, const char* pat, va_list* args)
7813 sv_vcatpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
7818 =for apidoc sv_vsetpvfn
7820 Works like C<vcatpvfn> but copies the text into the SV instead of
7823 Usually used via one of its frontends C<sv_setpvf> and C<sv_setpvf_mg>.
7829 Perl_sv_vsetpvfn(pTHX_ SV *sv, const char *pat, STRLEN patlen, va_list *args, SV **svargs, I32 svmax, bool *maybe_tainted)
7831 sv_setpvn(sv, "", 0);
7832 sv_vcatpvfn(sv, pat, patlen, args, svargs, svmax, maybe_tainted);
7835 /* private function for use in sv_vcatpvfn via the EXPECT_NUMBER macro */
7838 S_expect_number(pTHX_ char** pattern)
7841 switch (**pattern) {
7842 case '1': case '2': case '3':
7843 case '4': case '5': case '6':
7844 case '7': case '8': case '9':
7845 while (isDIGIT(**pattern))
7846 var = var * 10 + (*(*pattern)++ - '0');
7850 #define EXPECT_NUMBER(pattern, var) (var = S_expect_number(aTHX_ &pattern))
7853 =for apidoc sv_vcatpvfn
7855 Processes its arguments like C<vsprintf> and appends the formatted output
7856 to an SV. Uses an array of SVs if the C style variable argument list is
7857 missing (NULL). When running with taint checks enabled, indicates via
7858 C<maybe_tainted> if results are untrustworthy (often due to the use of
7861 Usually used via one of its frontends C<sv_catpvf> and C<sv_catpvf_mg>.
7867 Perl_sv_vcatpvfn(pTHX_ SV *sv, const char *pat, STRLEN patlen, va_list *args, SV **svargs, I32 svmax, bool *maybe_tainted)
7874 static char nullstr[] = "(null)";
7876 bool has_utf8 = FALSE; /* has the result utf8? */
7878 /* no matter what, this is a string now */
7879 (void)SvPV_force(sv, origlen);
7881 /* special-case "", "%s", and "%_" */
7884 if (patlen == 2 && pat[0] == '%') {
7888 char *s = va_arg(*args, char*);
7889 sv_catpv(sv, s ? s : nullstr);
7891 else if (svix < svmax) {
7892 sv_catsv(sv, *svargs);
7893 if (DO_UTF8(*svargs))
7899 argsv = va_arg(*args, SV*);
7900 sv_catsv(sv, argsv);
7905 /* See comment on '_' below */
7910 if (!args && svix < svmax && DO_UTF8(*svargs))
7913 patend = (char*)pat + patlen;
7914 for (p = (char*)pat; p < patend; p = q) {
7917 bool vectorize = FALSE;
7918 bool vectorarg = FALSE;
7919 bool vec_utf8 = FALSE;
7925 bool has_precis = FALSE;
7927 bool is_utf8 = FALSE; /* is this item utf8? */
7930 U8 utf8buf[UTF8_MAXLEN+1];
7931 STRLEN esignlen = 0;
7933 char *eptr = Nullch;
7935 /* Times 4: a decimal digit takes more than 3 binary digits.
7936 * NV_DIG: mantissa takes than many decimal digits.
7937 * Plus 32: Playing safe. */
7938 char ebuf[IV_DIG * 4 + NV_DIG + 32];
7939 /* large enough for "%#.#f" --chip */
7940 /* what about long double NVs? --jhi */
7943 U8 *vecstr = Null(U8*);
7950 /* we need a long double target in case HAS_LONG_DOUBLE but
7953 #if defined(HAS_LONG_DOUBLE) && LONG_DOUBLESIZE > DOUBLESIZE
7962 STRLEN dotstrlen = 1;
7963 I32 efix = 0; /* explicit format parameter index */
7964 I32 ewix = 0; /* explicit width index */
7965 I32 epix = 0; /* explicit precision index */
7966 I32 evix = 0; /* explicit vector index */
7967 bool asterisk = FALSE;
7969 /* echo everything up to the next format specification */
7970 for (q = p; q < patend && *q != '%'; ++q) ;
7972 sv_catpvn(sv, p, q - p);
7979 We allow format specification elements in this order:
7980 \d+\$ explicit format parameter index
7982 v|\*(\d+\$)?v vector with optional (optionally specified) arg
7983 \d+|\*(\d+\$)? width using optional (optionally specified) arg
7984 \.(\d*|\*(\d+\$)?) precision using optional (optionally specified) arg
7986 [%bcdefginopsux_DFOUX] format (mandatory)
7988 if (EXPECT_NUMBER(q, width)) {
8029 if (EXPECT_NUMBER(q, ewix))
8038 if ((vectorarg = asterisk)) {
8048 EXPECT_NUMBER(q, width);
8053 vecsv = va_arg(*args, SV*);
8055 vecsv = (evix ? evix <= svmax : svix < svmax) ?
8056 svargs[ewix ? ewix-1 : svix++] : &PL_sv_undef;
8057 dotstr = SvPVx(vecsv, dotstrlen);
8062 vecsv = va_arg(*args, SV*);
8063 vecstr = (U8*)SvPVx(vecsv,veclen);
8064 vec_utf8 = DO_UTF8(vecsv);
8066 else if (efix ? efix <= svmax : svix < svmax) {
8067 vecsv = svargs[efix ? efix-1 : svix++];
8068 vecstr = (U8*)SvPVx(vecsv,veclen);
8069 vec_utf8 = DO_UTF8(vecsv);
8079 i = va_arg(*args, int);
8081 i = (ewix ? ewix <= svmax : svix < svmax) ?
8082 SvIVx(svargs[ewix ? ewix-1 : svix++]) : 0;
8084 width = (i < 0) ? -i : i;
8094 if (EXPECT_NUMBER(q, epix) && *q++ != '$')
8096 /* XXX: todo, support specified precision parameter */
8100 i = va_arg(*args, int);
8102 i = (ewix ? ewix <= svmax : svix < svmax)
8103 ? SvIVx(svargs[ewix ? ewix-1 : svix++]) : 0;
8104 precis = (i < 0) ? 0 : i;
8109 precis = precis * 10 + (*q++ - '0');
8118 case 'I': /* Ix, I32x, and I64x */
8120 if (q[1] == '6' && q[2] == '4') {
8126 if (q[1] == '3' && q[2] == '2') {
8136 #if defined(HAS_QUAD) || defined(HAS_LONG_DOUBLE)
8147 #if defined(HAS_QUAD) || defined(HAS_LONG_DOUBLE)
8148 if (*(q + 1) == 'l') { /* lld, llf */
8173 argsv = (efix ? efix <= svmax : svix < svmax) ?
8174 svargs[efix ? efix-1 : svix++] : &PL_sv_undef;
8181 uv = (args && !vectorize) ? va_arg(*args, int) : SvIVx(argsv);
8183 (!UNI_IS_INVARIANT(uv) && SvUTF8(sv)))
8185 eptr = (char*)utf8buf;
8186 elen = uvchr_to_utf8((U8*)eptr, uv) - utf8buf;
8197 if (args && !vectorize) {
8198 eptr = va_arg(*args, char*);
8200 #ifdef MACOS_TRADITIONAL
8201 /* On MacOS, %#s format is used for Pascal strings */
8206 elen = strlen(eptr);
8209 elen = sizeof nullstr - 1;
8213 eptr = SvPVx(argsv, elen);
8214 if (DO_UTF8(argsv)) {
8215 if (has_precis && precis < elen) {
8217 sv_pos_u2b(argsv, &p, 0); /* sticks at end */
8220 if (width) { /* fudge width (can't fudge elen) */
8221 width += elen - sv_len_utf8(argsv);
8230 * The "%_" hack might have to be changed someday,
8231 * if ISO or ANSI decide to use '_' for something.
8232 * So we keep it hidden from users' code.
8234 if (!args || vectorize)
8236 argsv = va_arg(*args, SV*);
8237 eptr = SvPVx(argsv, elen);
8243 if (has_precis && elen > precis)
8250 if (alt || vectorize)
8252 uv = PTR2UV(args ? va_arg(*args, void*) : argsv);
8270 uv = utf8n_to_uvchr(vecstr, veclen, &ulen,
8279 esignbuf[esignlen++] = plus;
8283 case 'h': iv = (short)va_arg(*args, int); break;
8284 default: iv = va_arg(*args, int); break;
8285 case 'l': iv = va_arg(*args, long); break;
8286 case 'V': iv = va_arg(*args, IV); break;
8288 case 'q': iv = va_arg(*args, Quad_t); break;
8295 case 'h': iv = (short)iv; break;
8297 case 'l': iv = (long)iv; break;
8300 case 'q': iv = (Quad_t)iv; break;
8304 if ( !vectorize ) /* we already set uv above */
8309 esignbuf[esignlen++] = plus;
8313 esignbuf[esignlen++] = '-';
8356 uv = utf8n_to_uvchr(vecstr, veclen, &ulen,
8367 case 'h': uv = (unsigned short)va_arg(*args, unsigned); break;
8368 default: uv = va_arg(*args, unsigned); break;
8369 case 'l': uv = va_arg(*args, unsigned long); break;
8370 case 'V': uv = va_arg(*args, UV); break;
8372 case 'q': uv = va_arg(*args, Quad_t); break;
8379 case 'h': uv = (unsigned short)uv; break;
8381 case 'l': uv = (unsigned long)uv; break;
8384 case 'q': uv = (Quad_t)uv; break;
8390 eptr = ebuf + sizeof ebuf;
8396 p = (char*)((c == 'X')
8397 ? "0123456789ABCDEF" : "0123456789abcdef");
8403 esignbuf[esignlen++] = '0';
8404 esignbuf[esignlen++] = c; /* 'x' or 'X' */
8410 *--eptr = '0' + dig;
8412 if (alt && *eptr != '0')
8418 *--eptr = '0' + dig;
8421 esignbuf[esignlen++] = '0';
8422 esignbuf[esignlen++] = 'b';
8425 default: /* it had better be ten or less */
8426 #if defined(PERL_Y2KWARN)
8427 if (ckWARN(WARN_Y2K)) {
8429 char *s = SvPV(sv,n);
8430 if (n >= 2 && s[n-2] == '1' && s[n-1] == '9'
8431 && (n == 2 || !isDIGIT(s[n-3])))
8433 Perl_warner(aTHX_ packWARN(WARN_Y2K),
8434 "Possible Y2K bug: %%%c %s",
8435 c, "format string following '19'");
8441 *--eptr = '0' + dig;
8442 } while (uv /= base);
8445 elen = (ebuf + sizeof ebuf) - eptr;
8448 zeros = precis - elen;
8449 else if (precis == 0 && elen == 1 && *eptr == '0')
8454 /* FLOATING POINT */
8457 c = 'f'; /* maybe %F isn't supported here */
8463 /* This is evil, but floating point is even more evil */
8465 /* for SV-style calling, we can only get NV
8466 for C-style calling, we assume %f is double;
8467 for simplicity we allow any of %Lf, %llf, %qf for long double
8471 #if defined(USE_LONG_DOUBLE)
8476 #if defined(USE_LONG_DOUBLE)
8477 intsize = args ? 0 : 'q';
8481 #if defined(HAS_LONG_DOUBLE)
8492 /* now we need (long double) if intsize == 'q', else (double) */
8493 nv = (args && !vectorize) ?
8494 #if LONG_DOUBLESIZE > DOUBLESIZE
8496 va_arg(*args, long double) :
8497 va_arg(*args, double)
8499 va_arg(*args, double)
8505 if (c != 'e' && c != 'E') {
8507 /* FIXME: if HAS_LONG_DOUBLE but not USE_LONG_DOUBLE this
8508 will cast our (long double) to (double) */
8509 (void)Perl_frexp(nv, &i);
8510 if (i == PERL_INT_MIN)
8511 Perl_die(aTHX_ "panic: frexp");
8513 need = BIT_DIGITS(i);
8515 need += has_precis ? precis : 6; /* known default */
8519 need += 20; /* fudge factor */
8520 if (PL_efloatsize < need) {
8521 Safefree(PL_efloatbuf);
8522 PL_efloatsize = need + 20; /* more fudge */
8523 New(906, PL_efloatbuf, PL_efloatsize, char);
8524 PL_efloatbuf[0] = '\0';
8527 eptr = ebuf + sizeof ebuf;
8530 /* FIXME: what to do if HAS_LONG_DOUBLE but not PERL_PRIfldbl? */
8531 #if defined(HAS_LONG_DOUBLE) && defined(PERL_PRIfldbl)
8532 if (intsize == 'q') {
8533 /* Copy the one or more characters in a long double
8534 * format before the 'base' ([efgEFG]) character to
8535 * the format string. */
8536 static char const prifldbl[] = PERL_PRIfldbl;
8537 char const *p = prifldbl + sizeof(prifldbl) - 3;
8538 while (p >= prifldbl) { *--eptr = *p--; }
8543 do { *--eptr = '0' + (base % 10); } while (base /= 10);
8548 do { *--eptr = '0' + (base % 10); } while (base /= 10);
8560 /* No taint. Otherwise we are in the strange situation
8561 * where printf() taints but print($float) doesn't.
8563 #if defined(HAS_LONG_DOUBLE)
8565 (void)sprintf(PL_efloatbuf, eptr, nv);
8567 (void)sprintf(PL_efloatbuf, eptr, (double)nv);
8569 (void)sprintf(PL_efloatbuf, eptr, nv);
8571 eptr = PL_efloatbuf;
8572 elen = strlen(PL_efloatbuf);
8578 i = SvCUR(sv) - origlen;
8579 if (args && !vectorize) {
8581 case 'h': *(va_arg(*args, short*)) = i; break;
8582 default: *(va_arg(*args, int*)) = i; break;
8583 case 'l': *(va_arg(*args, long*)) = i; break;
8584 case 'V': *(va_arg(*args, IV*)) = i; break;
8586 case 'q': *(va_arg(*args, Quad_t*)) = i; break;
8591 sv_setuv_mg(argsv, (UV)i);
8593 continue; /* not "break" */
8600 if (!args && ckWARN(WARN_PRINTF) &&
8601 (PL_op->op_type == OP_PRTF || PL_op->op_type == OP_SPRINTF)) {
8602 SV *msg = sv_newmortal();
8603 Perl_sv_setpvf(aTHX_ msg, "Invalid conversion in %s: ",
8604 (PL_op->op_type == OP_PRTF) ? "printf" : "sprintf");
8607 Perl_sv_catpvf(aTHX_ msg,
8608 "\"%%%c\"", c & 0xFF);
8610 Perl_sv_catpvf(aTHX_ msg,
8611 "\"%%\\%03"UVof"\"",
8614 sv_catpv(msg, "end of string");
8615 Perl_warner(aTHX_ packWARN(WARN_PRINTF), "%"SVf, msg); /* yes, this is reentrant */
8618 /* output mangled stuff ... */
8624 /* ... right here, because formatting flags should not apply */
8625 SvGROW(sv, SvCUR(sv) + elen + 1);
8627 Copy(eptr, p, elen, char);
8630 SvCUR(sv) = p - SvPVX(sv);
8631 continue; /* not "break" */
8634 if (is_utf8 != has_utf8) {
8637 sv_utf8_upgrade(sv);
8640 SV *nsv = sv_2mortal(newSVpvn(eptr, elen));
8641 sv_utf8_upgrade(nsv);
8645 SvGROW(sv, SvCUR(sv) + elen + 1);
8650 have = esignlen + zeros + elen;
8651 need = (have > width ? have : width);
8654 SvGROW(sv, SvCUR(sv) + need + dotstrlen + 1);
8656 if (esignlen && fill == '0') {
8657 for (i = 0; i < (int)esignlen; i++)
8661 memset(p, fill, gap);
8664 if (esignlen && fill != '0') {
8665 for (i = 0; i < (int)esignlen; i++)
8669 for (i = zeros; i; i--)
8673 Copy(eptr, p, elen, char);
8677 memset(p, ' ', gap);
8682 Copy(dotstr, p, dotstrlen, char);
8686 vectorize = FALSE; /* done iterating over vecstr */
8693 SvCUR(sv) = p - SvPVX(sv);
8701 /* =========================================================================
8703 =head1 Cloning an interpreter
8705 All the macros and functions in this section are for the private use of
8706 the main function, perl_clone().
8708 The foo_dup() functions make an exact copy of an existing foo thinngy.
8709 During the course of a cloning, a hash table is used to map old addresses
8710 to new addresses. The table is created and manipulated with the
8711 ptr_table_* functions.
8715 ============================================================================*/
8718 #if defined(USE_ITHREADS)
8720 #if defined(USE_5005THREADS)
8721 # include "error: USE_5005THREADS and USE_ITHREADS are incompatible"
8724 #ifndef GpREFCNT_inc
8725 # define GpREFCNT_inc(gp) ((gp) ? (++(gp)->gp_refcnt, (gp)) : (GP*)NULL)
8729 #define sv_dup_inc(s,t) SvREFCNT_inc(sv_dup(s,t))
8730 #define av_dup(s,t) (AV*)sv_dup((SV*)s,t)
8731 #define av_dup_inc(s,t) (AV*)SvREFCNT_inc(sv_dup((SV*)s,t))
8732 #define hv_dup(s,t) (HV*)sv_dup((SV*)s,t)
8733 #define hv_dup_inc(s,t) (HV*)SvREFCNT_inc(sv_dup((SV*)s,t))
8734 #define cv_dup(s,t) (CV*)sv_dup((SV*)s,t)
8735 #define cv_dup_inc(s,t) (CV*)SvREFCNT_inc(sv_dup((SV*)s,t))
8736 #define io_dup(s,t) (IO*)sv_dup((SV*)s,t)
8737 #define io_dup_inc(s,t) (IO*)SvREFCNT_inc(sv_dup((SV*)s,t))
8738 #define gv_dup(s,t) (GV*)sv_dup((SV*)s,t)
8739 #define gv_dup_inc(s,t) (GV*)SvREFCNT_inc(sv_dup((SV*)s,t))
8740 #define SAVEPV(p) (p ? savepv(p) : Nullch)
8741 #define SAVEPVN(p,n) (p ? savepvn(p,n) : Nullch)
8744 /* Duplicate a regexp. Required reading: pregcomp() and pregfree() in
8745 regcomp.c. AMS 20010712 */
8748 Perl_re_dup(pTHX_ REGEXP *r, CLONE_PARAMS *param)
8752 struct reg_substr_datum *s;
8755 return (REGEXP *)NULL;
8757 if ((ret = (REGEXP *)ptr_table_fetch(PL_ptr_table, r)))
8760 len = r->offsets[0];
8761 npar = r->nparens+1;
8763 Newc(0, ret, sizeof(regexp) + (len+1)*sizeof(regnode), char, regexp);
8764 Copy(r->program, ret->program, len+1, regnode);
8766 New(0, ret->startp, npar, I32);
8767 Copy(r->startp, ret->startp, npar, I32);
8768 New(0, ret->endp, npar, I32);
8769 Copy(r->startp, ret->startp, npar, I32);
8771 New(0, ret->substrs, 1, struct reg_substr_data);
8772 for (s = ret->substrs->data, i = 0; i < 3; i++, s++) {
8773 s->min_offset = r->substrs->data[i].min_offset;
8774 s->max_offset = r->substrs->data[i].max_offset;
8775 s->substr = sv_dup_inc(r->substrs->data[i].substr, param);
8776 s->utf8_substr = sv_dup_inc(r->substrs->data[i].utf8_substr, param);
8779 ret->regstclass = NULL;
8782 int count = r->data->count;
8784 Newc(0, d, sizeof(struct reg_data) + count*sizeof(void *),
8785 char, struct reg_data);
8786 New(0, d->what, count, U8);
8789 for (i = 0; i < count; i++) {
8790 d->what[i] = r->data->what[i];
8791 switch (d->what[i]) {
8793 d->data[i] = sv_dup_inc((SV *)r->data->data[i], param);
8796 d->data[i] = av_dup_inc((AV *)r->data->data[i], param);
8799 /* This is cheating. */
8800 New(0, d->data[i], 1, struct regnode_charclass_class);
8801 StructCopy(r->data->data[i], d->data[i],
8802 struct regnode_charclass_class);
8803 ret->regstclass = (regnode*)d->data[i];
8806 /* Compiled op trees are readonly, and can thus be
8807 shared without duplication. */
8808 d->data[i] = (void*)OpREFCNT_inc((OP*)r->data->data[i]);
8811 d->data[i] = r->data->data[i];
8821 New(0, ret->offsets, 2*len+1, U32);
8822 Copy(r->offsets, ret->offsets, 2*len+1, U32);
8824 ret->precomp = SAVEPV(r->precomp);
8825 ret->refcnt = r->refcnt;
8826 ret->minlen = r->minlen;
8827 ret->prelen = r->prelen;
8828 ret->nparens = r->nparens;
8829 ret->lastparen = r->lastparen;
8830 ret->lastcloseparen = r->lastcloseparen;
8831 ret->reganch = r->reganch;
8833 ret->sublen = r->sublen;
8835 if (RX_MATCH_COPIED(ret))
8836 ret->subbeg = SAVEPV(r->subbeg);
8838 ret->subbeg = Nullch;
8840 ptr_table_store(PL_ptr_table, r, ret);
8844 /* duplicate a file handle */
8847 Perl_fp_dup(pTHX_ PerlIO *fp, char type, CLONE_PARAMS *param)
8851 return (PerlIO*)NULL;
8853 /* look for it in the table first */
8854 ret = (PerlIO*)ptr_table_fetch(PL_ptr_table, fp);
8858 /* create anew and remember what it is */
8859 ret = PerlIO_fdupopen(aTHX_ fp, param, PERLIO_DUP_CLONE);
8860 ptr_table_store(PL_ptr_table, fp, ret);
8864 /* duplicate a directory handle */
8867 Perl_dirp_dup(pTHX_ DIR *dp)
8875 /* duplicate a typeglob */
8878 Perl_gp_dup(pTHX_ GP *gp, CLONE_PARAMS* param)
8883 /* look for it in the table first */
8884 ret = (GP*)ptr_table_fetch(PL_ptr_table, gp);
8888 /* create anew and remember what it is */
8889 Newz(0, ret, 1, GP);
8890 ptr_table_store(PL_ptr_table, gp, ret);
8893 ret->gp_refcnt = 0; /* must be before any other dups! */
8894 ret->gp_sv = sv_dup_inc(gp->gp_sv, param);
8895 ret->gp_io = io_dup_inc(gp->gp_io, param);
8896 ret->gp_form = cv_dup_inc(gp->gp_form, param);
8897 ret->gp_av = av_dup_inc(gp->gp_av, param);
8898 ret->gp_hv = hv_dup_inc(gp->gp_hv, param);
8899 ret->gp_egv = gv_dup(gp->gp_egv, param);/* GvEGV is not refcounted */
8900 ret->gp_cv = cv_dup_inc(gp->gp_cv, param);
8901 ret->gp_cvgen = gp->gp_cvgen;
8902 ret->gp_flags = gp->gp_flags;
8903 ret->gp_line = gp->gp_line;
8904 ret->gp_file = gp->gp_file; /* points to COP.cop_file */
8908 /* duplicate a chain of magic */
8911 Perl_mg_dup(pTHX_ MAGIC *mg, CLONE_PARAMS* param)
8913 MAGIC *mgprev = (MAGIC*)NULL;
8916 return (MAGIC*)NULL;
8917 /* look for it in the table first */
8918 mgret = (MAGIC*)ptr_table_fetch(PL_ptr_table, mg);
8922 for (; mg; mg = mg->mg_moremagic) {
8924 Newz(0, nmg, 1, MAGIC);
8926 mgprev->mg_moremagic = nmg;
8929 nmg->mg_virtual = mg->mg_virtual; /* XXX copy dynamic vtable? */
8930 nmg->mg_private = mg->mg_private;
8931 nmg->mg_type = mg->mg_type;
8932 nmg->mg_flags = mg->mg_flags;
8933 if (mg->mg_type == PERL_MAGIC_qr) {
8934 nmg->mg_obj = (SV*)re_dup((REGEXP*)mg->mg_obj, param);
8936 else if(mg->mg_type == PERL_MAGIC_backref) {
8937 AV *av = (AV*) mg->mg_obj;
8940 nmg->mg_obj = (SV*)newAV();
8944 av_push((AV*)nmg->mg_obj,sv_dup(svp[i],param));
8949 nmg->mg_obj = (mg->mg_flags & MGf_REFCOUNTED)
8950 ? sv_dup_inc(mg->mg_obj, param)
8951 : sv_dup(mg->mg_obj, param);
8953 nmg->mg_len = mg->mg_len;
8954 nmg->mg_ptr = mg->mg_ptr; /* XXX random ptr? */
8955 if (mg->mg_ptr && mg->mg_type != PERL_MAGIC_regex_global) {
8956 if (mg->mg_len > 0) {
8957 nmg->mg_ptr = SAVEPVN(mg->mg_ptr, mg->mg_len);
8958 if (mg->mg_type == PERL_MAGIC_overload_table &&
8959 AMT_AMAGIC((AMT*)mg->mg_ptr))
8961 AMT *amtp = (AMT*)mg->mg_ptr;
8962 AMT *namtp = (AMT*)nmg->mg_ptr;
8964 for (i = 1; i < NofAMmeth; i++) {
8965 namtp->table[i] = cv_dup_inc(amtp->table[i], param);
8969 else if (mg->mg_len == HEf_SVKEY)
8970 nmg->mg_ptr = (char*)sv_dup_inc((SV*)mg->mg_ptr, param);
8972 if ((mg->mg_flags & MGf_DUP) && mg->mg_virtual && mg->mg_virtual->svt_dup) {
8973 CALL_FPTR(nmg->mg_virtual->svt_dup)(aTHX_ nmg, param);
8980 /* create a new pointer-mapping table */
8983 Perl_ptr_table_new(pTHX)
8986 Newz(0, tbl, 1, PTR_TBL_t);
8989 Newz(0, tbl->tbl_ary, tbl->tbl_max + 1, PTR_TBL_ENT_t*);
8993 /* map an existing pointer using a table */
8996 Perl_ptr_table_fetch(pTHX_ PTR_TBL_t *tbl, void *sv)
8998 PTR_TBL_ENT_t *tblent;
8999 UV hash = PTR2UV(sv);
9001 tblent = tbl->tbl_ary[hash & tbl->tbl_max];
9002 for (; tblent; tblent = tblent->next) {
9003 if (tblent->oldval == sv)
9004 return tblent->newval;
9009 /* add a new entry to a pointer-mapping table */
9012 Perl_ptr_table_store(pTHX_ PTR_TBL_t *tbl, void *oldv, void *newv)
9014 PTR_TBL_ENT_t *tblent, **otblent;
9015 /* XXX this may be pessimal on platforms where pointers aren't good
9016 * hash values e.g. if they grow faster in the most significant
9018 UV hash = PTR2UV(oldv);
9022 otblent = &tbl->tbl_ary[hash & tbl->tbl_max];
9023 for (tblent = *otblent; tblent; i=0, tblent = tblent->next) {
9024 if (tblent->oldval == oldv) {
9025 tblent->newval = newv;
9029 Newz(0, tblent, 1, PTR_TBL_ENT_t);
9030 tblent->oldval = oldv;
9031 tblent->newval = newv;
9032 tblent->next = *otblent;
9035 if (i && tbl->tbl_items > tbl->tbl_max)
9036 ptr_table_split(tbl);
9039 /* double the hash bucket size of an existing ptr table */
9042 Perl_ptr_table_split(pTHX_ PTR_TBL_t *tbl)
9044 PTR_TBL_ENT_t **ary = tbl->tbl_ary;
9045 UV oldsize = tbl->tbl_max + 1;
9046 UV newsize = oldsize * 2;
9049 Renew(ary, newsize, PTR_TBL_ENT_t*);
9050 Zero(&ary[oldsize], newsize-oldsize, PTR_TBL_ENT_t*);
9051 tbl->tbl_max = --newsize;
9053 for (i=0; i < oldsize; i++, ary++) {
9054 PTR_TBL_ENT_t **curentp, **entp, *ent;
9057 curentp = ary + oldsize;
9058 for (entp = ary, ent = *ary; ent; ent = *entp) {
9059 if ((newsize & PTR2UV(ent->oldval)) != i) {
9061 ent->next = *curentp;
9071 /* remove all the entries from a ptr table */
9074 Perl_ptr_table_clear(pTHX_ PTR_TBL_t *tbl)
9076 register PTR_TBL_ENT_t **array;
9077 register PTR_TBL_ENT_t *entry;
9078 register PTR_TBL_ENT_t *oentry = Null(PTR_TBL_ENT_t*);
9082 if (!tbl || !tbl->tbl_items) {
9086 array = tbl->tbl_ary;
9093 entry = entry->next;
9097 if (++riter > max) {
9100 entry = array[riter];
9107 /* clear and free a ptr table */
9110 Perl_ptr_table_free(pTHX_ PTR_TBL_t *tbl)
9115 ptr_table_clear(tbl);
9116 Safefree(tbl->tbl_ary);
9124 /* attempt to make everything in the typeglob readonly */
9127 S_gv_share(pTHX_ SV *sstr, CLONE_PARAMS *param)
9130 SV *sv = ¶m->proto_perl->Isv_no; /* just need SvREADONLY-ness */
9132 if (GvIO(gv) || GvFORM(gv)) {
9133 GvUNIQUE_off(gv); /* GvIOs cannot be shared. nor can GvFORMs */
9135 else if (!GvCV(gv)) {
9139 /* CvPADLISTs cannot be shared */
9140 if (!SvREADONLY(GvCV(gv)) && !CvXSUB(GvCV(gv))) {
9145 if (!GvUNIQUE(gv)) {
9147 PerlIO_printf(Perl_debug_log, "gv_share: unable to share %s::%s\n",
9148 HvNAME(GvSTASH(gv)), GvNAME(gv));
9154 * write attempts will die with
9155 * "Modification of a read-only value attempted"
9161 SvREADONLY_on(GvSV(gv));
9168 SvREADONLY_on(GvAV(gv));
9175 SvREADONLY_on(GvAV(gv));
9178 return sstr; /* he_dup() will SvREFCNT_inc() */
9181 /* duplicate an SV of any type (including AV, HV etc) */
9184 Perl_rvpv_dup(pTHX_ SV *dstr, SV *sstr, CLONE_PARAMS* param)
9187 SvRV(dstr) = SvWEAKREF(sstr)
9188 ? sv_dup(SvRV(sstr), param)
9189 : sv_dup_inc(SvRV(sstr), param);
9191 else if (SvPVX(sstr)) {
9192 /* Has something there */
9194 /* Normal PV - clone whole allocated space */
9195 SvPVX(dstr) = SAVEPVN(SvPVX(sstr), SvLEN(sstr)-1);
9198 /* Special case - not normally malloced for some reason */
9199 if (SvREADONLY(sstr) && SvFAKE(sstr)) {
9200 /* A "shared" PV - clone it as unshared string */
9202 SvREADONLY_off(dstr);
9203 SvPVX(dstr) = SAVEPVN(SvPVX(sstr), SvCUR(sstr));
9206 /* Some other special case - random pointer */
9207 SvPVX(dstr) = SvPVX(sstr);
9213 SvPVX(dstr) = SvPVX(sstr);
9218 Perl_sv_dup(pTHX_ SV *sstr, CLONE_PARAMS* param)
9222 if (!sstr || SvTYPE(sstr) == SVTYPEMASK)
9224 /* look for it in the table first */
9225 dstr = (SV*)ptr_table_fetch(PL_ptr_table, sstr);
9229 /* create anew and remember what it is */
9231 ptr_table_store(PL_ptr_table, sstr, dstr);
9234 SvFLAGS(dstr) = SvFLAGS(sstr);
9235 SvFLAGS(dstr) &= ~SVf_OOK; /* don't propagate OOK hack */
9236 SvREFCNT(dstr) = 0; /* must be before any other dups! */
9239 if (SvANY(sstr) && PL_watch_pvx && SvPVX(sstr) == PL_watch_pvx)
9240 PerlIO_printf(Perl_debug_log, "watch at %p hit, found string \"%s\"\n",
9241 PL_watch_pvx, SvPVX(sstr));
9244 switch (SvTYPE(sstr)) {
9249 SvANY(dstr) = new_XIV();
9250 SvIVX(dstr) = SvIVX(sstr);
9253 SvANY(dstr) = new_XNV();
9254 SvNVX(dstr) = SvNVX(sstr);
9257 SvANY(dstr) = new_XRV();
9258 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
9261 SvANY(dstr) = new_XPV();
9262 SvCUR(dstr) = SvCUR(sstr);
9263 SvLEN(dstr) = SvLEN(sstr);
9264 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
9267 SvANY(dstr) = new_XPVIV();
9268 SvCUR(dstr) = SvCUR(sstr);
9269 SvLEN(dstr) = SvLEN(sstr);
9270 SvIVX(dstr) = SvIVX(sstr);
9271 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
9274 SvANY(dstr) = new_XPVNV();
9275 SvCUR(dstr) = SvCUR(sstr);
9276 SvLEN(dstr) = SvLEN(sstr);
9277 SvIVX(dstr) = SvIVX(sstr);
9278 SvNVX(dstr) = SvNVX(sstr);
9279 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
9282 SvANY(dstr) = new_XPVMG();
9283 SvCUR(dstr) = SvCUR(sstr);
9284 SvLEN(dstr) = SvLEN(sstr);
9285 SvIVX(dstr) = SvIVX(sstr);
9286 SvNVX(dstr) = SvNVX(sstr);
9287 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr), param);
9288 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr), param);
9289 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
9292 SvANY(dstr) = new_XPVBM();
9293 SvCUR(dstr) = SvCUR(sstr);
9294 SvLEN(dstr) = SvLEN(sstr);
9295 SvIVX(dstr) = SvIVX(sstr);
9296 SvNVX(dstr) = SvNVX(sstr);
9297 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr), param);
9298 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr), param);
9299 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
9300 BmRARE(dstr) = BmRARE(sstr);
9301 BmUSEFUL(dstr) = BmUSEFUL(sstr);
9302 BmPREVIOUS(dstr)= BmPREVIOUS(sstr);
9305 SvANY(dstr) = new_XPVLV();
9306 SvCUR(dstr) = SvCUR(sstr);
9307 SvLEN(dstr) = SvLEN(sstr);
9308 SvIVX(dstr) = SvIVX(sstr);
9309 SvNVX(dstr) = SvNVX(sstr);
9310 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr), param);
9311 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr), param);
9312 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
9313 LvTARGOFF(dstr) = LvTARGOFF(sstr); /* XXX sometimes holds PMOP* when DEBUGGING */
9314 LvTARGLEN(dstr) = LvTARGLEN(sstr);
9315 LvTARG(dstr) = sv_dup_inc(LvTARG(sstr), param);
9316 LvTYPE(dstr) = LvTYPE(sstr);
9319 if (GvUNIQUE((GV*)sstr)) {
9321 if ((share = gv_share(sstr, param))) {
9324 ptr_table_store(PL_ptr_table, sstr, dstr);
9326 PerlIO_printf(Perl_debug_log, "sv_dup: sharing %s::%s\n",
9327 HvNAME(GvSTASH(share)), GvNAME(share));
9332 SvANY(dstr) = new_XPVGV();
9333 SvCUR(dstr) = SvCUR(sstr);
9334 SvLEN(dstr) = SvLEN(sstr);
9335 SvIVX(dstr) = SvIVX(sstr);
9336 SvNVX(dstr) = SvNVX(sstr);
9337 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr), param);
9338 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr), param);
9339 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
9340 GvNAMELEN(dstr) = GvNAMELEN(sstr);
9341 GvNAME(dstr) = SAVEPVN(GvNAME(sstr), GvNAMELEN(sstr));
9342 GvSTASH(dstr) = hv_dup_inc(GvSTASH(sstr), param);
9343 GvFLAGS(dstr) = GvFLAGS(sstr);
9344 GvGP(dstr) = gp_dup(GvGP(sstr), param);
9345 (void)GpREFCNT_inc(GvGP(dstr));
9348 SvANY(dstr) = new_XPVIO();
9349 SvCUR(dstr) = SvCUR(sstr);
9350 SvLEN(dstr) = SvLEN(sstr);
9351 SvIVX(dstr) = SvIVX(sstr);
9352 SvNVX(dstr) = SvNVX(sstr);
9353 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr), param);
9354 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr), param);
9355 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
9356 IoIFP(dstr) = fp_dup(IoIFP(sstr), IoTYPE(sstr), param);
9357 if (IoOFP(sstr) == IoIFP(sstr))
9358 IoOFP(dstr) = IoIFP(dstr);
9360 IoOFP(dstr) = fp_dup(IoOFP(sstr), IoTYPE(sstr), param);
9361 /* PL_rsfp_filters entries have fake IoDIRP() */
9362 if (IoDIRP(sstr) && !(IoFLAGS(sstr) & IOf_FAKE_DIRP))
9363 IoDIRP(dstr) = dirp_dup(IoDIRP(sstr));
9365 IoDIRP(dstr) = IoDIRP(sstr);
9366 IoLINES(dstr) = IoLINES(sstr);
9367 IoPAGE(dstr) = IoPAGE(sstr);
9368 IoPAGE_LEN(dstr) = IoPAGE_LEN(sstr);
9369 IoLINES_LEFT(dstr) = IoLINES_LEFT(sstr);
9370 IoTOP_NAME(dstr) = SAVEPV(IoTOP_NAME(sstr));
9371 IoTOP_GV(dstr) = gv_dup(IoTOP_GV(sstr), param);
9372 IoFMT_NAME(dstr) = SAVEPV(IoFMT_NAME(sstr));
9373 IoFMT_GV(dstr) = gv_dup(IoFMT_GV(sstr), param);
9374 IoBOTTOM_NAME(dstr) = SAVEPV(IoBOTTOM_NAME(sstr));
9375 IoBOTTOM_GV(dstr) = gv_dup(IoBOTTOM_GV(sstr), param);
9376 IoSUBPROCESS(dstr) = IoSUBPROCESS(sstr);
9377 IoTYPE(dstr) = IoTYPE(sstr);
9378 IoFLAGS(dstr) = IoFLAGS(sstr);
9381 SvANY(dstr) = new_XPVAV();
9382 SvCUR(dstr) = SvCUR(sstr);
9383 SvLEN(dstr) = SvLEN(sstr);
9384 SvIVX(dstr) = SvIVX(sstr);
9385 SvNVX(dstr) = SvNVX(sstr);
9386 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr), param);
9387 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr), param);
9388 AvARYLEN((AV*)dstr) = sv_dup_inc(AvARYLEN((AV*)sstr), param);
9389 AvFLAGS((AV*)dstr) = AvFLAGS((AV*)sstr);
9390 if (AvARRAY((AV*)sstr)) {
9391 SV **dst_ary, **src_ary;
9392 SSize_t items = AvFILLp((AV*)sstr) + 1;
9394 src_ary = AvARRAY((AV*)sstr);
9395 Newz(0, dst_ary, AvMAX((AV*)sstr)+1, SV*);
9396 ptr_table_store(PL_ptr_table, src_ary, dst_ary);
9397 SvPVX(dstr) = (char*)dst_ary;
9398 AvALLOC((AV*)dstr) = dst_ary;
9399 if (AvREAL((AV*)sstr)) {
9401 *dst_ary++ = sv_dup_inc(*src_ary++, param);
9405 *dst_ary++ = sv_dup(*src_ary++, param);
9407 items = AvMAX((AV*)sstr) - AvFILLp((AV*)sstr);
9408 while (items-- > 0) {
9409 *dst_ary++ = &PL_sv_undef;
9413 SvPVX(dstr) = Nullch;
9414 AvALLOC((AV*)dstr) = (SV**)NULL;
9418 SvANY(dstr) = new_XPVHV();
9419 SvCUR(dstr) = SvCUR(sstr);
9420 SvLEN(dstr) = SvLEN(sstr);
9421 SvIVX(dstr) = SvIVX(sstr);
9422 SvNVX(dstr) = SvNVX(sstr);
9423 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr), param);
9424 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr), param);
9425 HvRITER((HV*)dstr) = HvRITER((HV*)sstr);
9426 if (HvARRAY((HV*)sstr)) {
9428 XPVHV *dxhv = (XPVHV*)SvANY(dstr);
9429 XPVHV *sxhv = (XPVHV*)SvANY(sstr);
9430 Newz(0, dxhv->xhv_array,
9431 PERL_HV_ARRAY_ALLOC_BYTES(dxhv->xhv_max+1), char);
9432 while (i <= sxhv->xhv_max) {
9433 ((HE**)dxhv->xhv_array)[i] = he_dup(((HE**)sxhv->xhv_array)[i],
9434 (bool)!!HvSHAREKEYS(sstr),
9438 dxhv->xhv_eiter = he_dup(sxhv->xhv_eiter,
9439 (bool)!!HvSHAREKEYS(sstr), param);
9442 SvPVX(dstr) = Nullch;
9443 HvEITER((HV*)dstr) = (HE*)NULL;
9445 HvPMROOT((HV*)dstr) = HvPMROOT((HV*)sstr); /* XXX */
9446 HvNAME((HV*)dstr) = SAVEPV(HvNAME((HV*)sstr));
9447 /* Record stashes for possible cloning in Perl_clone(). */
9448 if(HvNAME((HV*)dstr))
9449 av_push(param->stashes, dstr);
9452 SvANY(dstr) = new_XPVFM();
9453 FmLINES(dstr) = FmLINES(sstr);
9457 SvANY(dstr) = new_XPVCV();
9459 SvCUR(dstr) = SvCUR(sstr);
9460 SvLEN(dstr) = SvLEN(sstr);
9461 SvIVX(dstr) = SvIVX(sstr);
9462 SvNVX(dstr) = SvNVX(sstr);
9463 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr), param);
9464 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr), param);
9465 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
9466 CvSTASH(dstr) = hv_dup(CvSTASH(sstr), param); /* NOTE: not refcounted */
9467 CvSTART(dstr) = CvSTART(sstr);
9468 CvROOT(dstr) = OpREFCNT_inc(CvROOT(sstr));
9469 CvXSUB(dstr) = CvXSUB(sstr);
9470 CvXSUBANY(dstr) = CvXSUBANY(sstr);
9471 if (CvCONST(sstr)) {
9472 CvXSUBANY(dstr).any_ptr = GvUNIQUE(CvGV(sstr)) ?
9473 SvREFCNT_inc(CvXSUBANY(sstr).any_ptr) :
9474 sv_dup_inc(CvXSUBANY(sstr).any_ptr, param);
9476 CvGV(dstr) = gv_dup(CvGV(sstr), param);
9477 if (param->flags & CLONEf_COPY_STACKS) {
9478 CvDEPTH(dstr) = CvDEPTH(sstr);
9482 if (CvPADLIST(sstr) && !AvREAL(CvPADLIST(sstr))) {
9483 /* XXX padlists are real, but pretend to be not */
9484 AvREAL_on(CvPADLIST(sstr));
9485 CvPADLIST(dstr) = av_dup_inc(CvPADLIST(sstr), param);
9486 AvREAL_off(CvPADLIST(sstr));
9487 AvREAL_off(CvPADLIST(dstr));
9490 CvPADLIST(dstr) = av_dup_inc(CvPADLIST(sstr), param);
9491 if (!CvANON(sstr) || CvCLONED(sstr))
9492 CvOUTSIDE(dstr) = cv_dup_inc(CvOUTSIDE(sstr), param);
9494 CvOUTSIDE(dstr) = cv_dup(CvOUTSIDE(sstr), param);
9495 CvFLAGS(dstr) = CvFLAGS(sstr);
9496 CvFILE(dstr) = CvXSUB(sstr) ? CvFILE(sstr) : SAVEPV(CvFILE(sstr));
9499 Perl_croak(aTHX_ "Bizarre SvTYPE [%" IVdf "]", (IV)SvTYPE(sstr));
9503 if (SvOBJECT(dstr) && SvTYPE(dstr) != SVt_PVIO)
9509 /* duplicate a context */
9512 Perl_cx_dup(pTHX_ PERL_CONTEXT *cxs, I32 ix, I32 max, CLONE_PARAMS* param)
9517 return (PERL_CONTEXT*)NULL;
9519 /* look for it in the table first */
9520 ncxs = (PERL_CONTEXT*)ptr_table_fetch(PL_ptr_table, cxs);
9524 /* create anew and remember what it is */
9525 Newz(56, ncxs, max + 1, PERL_CONTEXT);
9526 ptr_table_store(PL_ptr_table, cxs, ncxs);
9529 PERL_CONTEXT *cx = &cxs[ix];
9530 PERL_CONTEXT *ncx = &ncxs[ix];
9531 ncx->cx_type = cx->cx_type;
9532 if (CxTYPE(cx) == CXt_SUBST) {
9533 Perl_croak(aTHX_ "Cloning substitution context is unimplemented");
9536 ncx->blk_oldsp = cx->blk_oldsp;
9537 ncx->blk_oldcop = cx->blk_oldcop;
9538 ncx->blk_oldretsp = cx->blk_oldretsp;
9539 ncx->blk_oldmarksp = cx->blk_oldmarksp;
9540 ncx->blk_oldscopesp = cx->blk_oldscopesp;
9541 ncx->blk_oldpm = cx->blk_oldpm;
9542 ncx->blk_gimme = cx->blk_gimme;
9543 switch (CxTYPE(cx)) {
9545 ncx->blk_sub.cv = (cx->blk_sub.olddepth == 0
9546 ? cv_dup_inc(cx->blk_sub.cv, param)
9547 : cv_dup(cx->blk_sub.cv,param));
9548 ncx->blk_sub.argarray = (cx->blk_sub.hasargs
9549 ? av_dup_inc(cx->blk_sub.argarray, param)
9551 ncx->blk_sub.savearray = av_dup_inc(cx->blk_sub.savearray, param);
9552 ncx->blk_sub.olddepth = cx->blk_sub.olddepth;
9553 ncx->blk_sub.hasargs = cx->blk_sub.hasargs;
9554 ncx->blk_sub.lval = cx->blk_sub.lval;
9557 ncx->blk_eval.old_in_eval = cx->blk_eval.old_in_eval;
9558 ncx->blk_eval.old_op_type = cx->blk_eval.old_op_type;
9559 ncx->blk_eval.old_namesv = sv_dup_inc(cx->blk_eval.old_namesv, param);
9560 ncx->blk_eval.old_eval_root = cx->blk_eval.old_eval_root;
9561 ncx->blk_eval.cur_text = sv_dup(cx->blk_eval.cur_text, param);
9564 ncx->blk_loop.label = cx->blk_loop.label;
9565 ncx->blk_loop.resetsp = cx->blk_loop.resetsp;
9566 ncx->blk_loop.redo_op = cx->blk_loop.redo_op;
9567 ncx->blk_loop.next_op = cx->blk_loop.next_op;
9568 ncx->blk_loop.last_op = cx->blk_loop.last_op;
9569 ncx->blk_loop.iterdata = (CxPADLOOP(cx)
9570 ? cx->blk_loop.iterdata
9571 : gv_dup((GV*)cx->blk_loop.iterdata, param));
9572 ncx->blk_loop.oldcurpad
9573 = (SV**)ptr_table_fetch(PL_ptr_table,
9574 cx->blk_loop.oldcurpad);
9575 ncx->blk_loop.itersave = sv_dup_inc(cx->blk_loop.itersave, param);
9576 ncx->blk_loop.iterlval = sv_dup_inc(cx->blk_loop.iterlval, param);
9577 ncx->blk_loop.iterary = av_dup_inc(cx->blk_loop.iterary, param);
9578 ncx->blk_loop.iterix = cx->blk_loop.iterix;
9579 ncx->blk_loop.itermax = cx->blk_loop.itermax;
9582 ncx->blk_sub.cv = cv_dup(cx->blk_sub.cv, param);
9583 ncx->blk_sub.gv = gv_dup(cx->blk_sub.gv, param);
9584 ncx->blk_sub.dfoutgv = gv_dup_inc(cx->blk_sub.dfoutgv, param);
9585 ncx->blk_sub.hasargs = cx->blk_sub.hasargs;
9597 /* duplicate a stack info structure */
9600 Perl_si_dup(pTHX_ PERL_SI *si, CLONE_PARAMS* param)
9605 return (PERL_SI*)NULL;
9607 /* look for it in the table first */
9608 nsi = (PERL_SI*)ptr_table_fetch(PL_ptr_table, si);
9612 /* create anew and remember what it is */
9613 Newz(56, nsi, 1, PERL_SI);
9614 ptr_table_store(PL_ptr_table, si, nsi);
9616 nsi->si_stack = av_dup_inc(si->si_stack, param);
9617 nsi->si_cxix = si->si_cxix;
9618 nsi->si_cxmax = si->si_cxmax;
9619 nsi->si_cxstack = cx_dup(si->si_cxstack, si->si_cxix, si->si_cxmax, param);
9620 nsi->si_type = si->si_type;
9621 nsi->si_prev = si_dup(si->si_prev, param);
9622 nsi->si_next = si_dup(si->si_next, param);
9623 nsi->si_markoff = si->si_markoff;
9628 #define POPINT(ss,ix) ((ss)[--(ix)].any_i32)
9629 #define TOPINT(ss,ix) ((ss)[ix].any_i32)
9630 #define POPLONG(ss,ix) ((ss)[--(ix)].any_long)
9631 #define TOPLONG(ss,ix) ((ss)[ix].any_long)
9632 #define POPIV(ss,ix) ((ss)[--(ix)].any_iv)
9633 #define TOPIV(ss,ix) ((ss)[ix].any_iv)
9634 #define POPPTR(ss,ix) ((ss)[--(ix)].any_ptr)
9635 #define TOPPTR(ss,ix) ((ss)[ix].any_ptr)
9636 #define POPDPTR(ss,ix) ((ss)[--(ix)].any_dptr)
9637 #define TOPDPTR(ss,ix) ((ss)[ix].any_dptr)
9638 #define POPDXPTR(ss,ix) ((ss)[--(ix)].any_dxptr)
9639 #define TOPDXPTR(ss,ix) ((ss)[ix].any_dxptr)
9642 #define pv_dup_inc(p) SAVEPV(p)
9643 #define pv_dup(p) SAVEPV(p)
9644 #define svp_dup_inc(p,pp) any_dup(p,pp)
9646 /* map any object to the new equivent - either something in the
9647 * ptr table, or something in the interpreter structure
9651 Perl_any_dup(pTHX_ void *v, PerlInterpreter *proto_perl)
9658 /* look for it in the table first */
9659 ret = ptr_table_fetch(PL_ptr_table, v);
9663 /* see if it is part of the interpreter structure */
9664 if (v >= (void*)proto_perl && v < (void*)(proto_perl+1))
9665 ret = (void*)(((char*)aTHX) + (((char*)v) - (char*)proto_perl));
9673 /* duplicate the save stack */
9676 Perl_ss_dup(pTHX_ PerlInterpreter *proto_perl, CLONE_PARAMS* param)
9678 ANY *ss = proto_perl->Tsavestack;
9679 I32 ix = proto_perl->Tsavestack_ix;
9680 I32 max = proto_perl->Tsavestack_max;
9693 void (*dptr) (void*);
9694 void (*dxptr) (pTHX_ void*);
9697 Newz(54, nss, max, ANY);
9703 case SAVEt_ITEM: /* normal string */
9704 sv = (SV*)POPPTR(ss,ix);
9705 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
9706 sv = (SV*)POPPTR(ss,ix);
9707 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
9709 case SAVEt_SV: /* scalar reference */
9710 sv = (SV*)POPPTR(ss,ix);
9711 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
9712 gv = (GV*)POPPTR(ss,ix);
9713 TOPPTR(nss,ix) = gv_dup_inc(gv, param);
9715 case SAVEt_GENERIC_PVREF: /* generic char* */
9716 c = (char*)POPPTR(ss,ix);
9717 TOPPTR(nss,ix) = pv_dup(c);
9718 ptr = POPPTR(ss,ix);
9719 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
9721 case SAVEt_SHARED_PVREF: /* char* in shared space */
9722 c = (char*)POPPTR(ss,ix);
9723 TOPPTR(nss,ix) = savesharedpv(c);
9724 ptr = POPPTR(ss,ix);
9725 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
9727 case SAVEt_GENERIC_SVREF: /* generic sv */
9728 case SAVEt_SVREF: /* scalar reference */
9729 sv = (SV*)POPPTR(ss,ix);
9730 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
9731 ptr = POPPTR(ss,ix);
9732 TOPPTR(nss,ix) = svp_dup_inc((SV**)ptr, proto_perl);/* XXXXX */
9734 case SAVEt_AV: /* array reference */
9735 av = (AV*)POPPTR(ss,ix);
9736 TOPPTR(nss,ix) = av_dup_inc(av, param);
9737 gv = (GV*)POPPTR(ss,ix);
9738 TOPPTR(nss,ix) = gv_dup(gv, param);
9740 case SAVEt_HV: /* hash reference */
9741 hv = (HV*)POPPTR(ss,ix);
9742 TOPPTR(nss,ix) = hv_dup_inc(hv, param);
9743 gv = (GV*)POPPTR(ss,ix);
9744 TOPPTR(nss,ix) = gv_dup(gv, param);
9746 case SAVEt_INT: /* int reference */
9747 ptr = POPPTR(ss,ix);
9748 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
9749 intval = (int)POPINT(ss,ix);
9750 TOPINT(nss,ix) = intval;
9752 case SAVEt_LONG: /* long reference */
9753 ptr = POPPTR(ss,ix);
9754 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
9755 longval = (long)POPLONG(ss,ix);
9756 TOPLONG(nss,ix) = longval;
9758 case SAVEt_I32: /* I32 reference */
9759 case SAVEt_I16: /* I16 reference */
9760 case SAVEt_I8: /* I8 reference */
9761 ptr = POPPTR(ss,ix);
9762 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
9766 case SAVEt_IV: /* IV reference */
9767 ptr = POPPTR(ss,ix);
9768 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
9772 case SAVEt_SPTR: /* SV* reference */
9773 ptr = POPPTR(ss,ix);
9774 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
9775 sv = (SV*)POPPTR(ss,ix);
9776 TOPPTR(nss,ix) = sv_dup(sv, param);
9778 case SAVEt_VPTR: /* random* reference */
9779 ptr = POPPTR(ss,ix);
9780 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
9781 ptr = POPPTR(ss,ix);
9782 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
9784 case SAVEt_PPTR: /* char* reference */
9785 ptr = POPPTR(ss,ix);
9786 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
9787 c = (char*)POPPTR(ss,ix);
9788 TOPPTR(nss,ix) = pv_dup(c);
9790 case SAVEt_HPTR: /* HV* reference */
9791 ptr = POPPTR(ss,ix);
9792 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
9793 hv = (HV*)POPPTR(ss,ix);
9794 TOPPTR(nss,ix) = hv_dup(hv, param);
9796 case SAVEt_APTR: /* AV* reference */
9797 ptr = POPPTR(ss,ix);
9798 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
9799 av = (AV*)POPPTR(ss,ix);
9800 TOPPTR(nss,ix) = av_dup(av, param);
9803 gv = (GV*)POPPTR(ss,ix);
9804 TOPPTR(nss,ix) = gv_dup(gv, param);
9806 case SAVEt_GP: /* scalar reference */
9807 gp = (GP*)POPPTR(ss,ix);
9808 TOPPTR(nss,ix) = gp = gp_dup(gp, param);
9809 (void)GpREFCNT_inc(gp);
9810 gv = (GV*)POPPTR(ss,ix);
9811 TOPPTR(nss,ix) = gv_dup_inc(gv, param);
9812 c = (char*)POPPTR(ss,ix);
9813 TOPPTR(nss,ix) = pv_dup(c);
9820 case SAVEt_MORTALIZESV:
9821 sv = (SV*)POPPTR(ss,ix);
9822 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
9825 ptr = POPPTR(ss,ix);
9826 if (ptr && (((OP*)ptr)->op_private & OPpREFCOUNTED)) {
9827 /* these are assumed to be refcounted properly */
9828 switch (((OP*)ptr)->op_type) {
9835 TOPPTR(nss,ix) = ptr;
9840 TOPPTR(nss,ix) = Nullop;
9845 TOPPTR(nss,ix) = Nullop;
9848 c = (char*)POPPTR(ss,ix);
9849 TOPPTR(nss,ix) = pv_dup_inc(c);
9852 longval = POPLONG(ss,ix);
9853 TOPLONG(nss,ix) = longval;
9856 hv = (HV*)POPPTR(ss,ix);
9857 TOPPTR(nss,ix) = hv_dup_inc(hv, param);
9858 c = (char*)POPPTR(ss,ix);
9859 TOPPTR(nss,ix) = pv_dup_inc(c);
9863 case SAVEt_DESTRUCTOR:
9864 ptr = POPPTR(ss,ix);
9865 TOPPTR(nss,ix) = any_dup(ptr, proto_perl); /* XXX quite arbitrary */
9866 dptr = POPDPTR(ss,ix);
9867 TOPDPTR(nss,ix) = (void (*)(void*))any_dup((void *)dptr, proto_perl);
9869 case SAVEt_DESTRUCTOR_X:
9870 ptr = POPPTR(ss,ix);
9871 TOPPTR(nss,ix) = any_dup(ptr, proto_perl); /* XXX quite arbitrary */
9872 dxptr = POPDXPTR(ss,ix);
9873 TOPDXPTR(nss,ix) = (void (*)(pTHX_ void*))any_dup((void *)dxptr, proto_perl);
9875 case SAVEt_REGCONTEXT:
9881 case SAVEt_STACK_POS: /* Position on Perl stack */
9885 case SAVEt_AELEM: /* array element */
9886 sv = (SV*)POPPTR(ss,ix);
9887 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
9890 av = (AV*)POPPTR(ss,ix);
9891 TOPPTR(nss,ix) = av_dup_inc(av, param);
9893 case SAVEt_HELEM: /* hash element */
9894 sv = (SV*)POPPTR(ss,ix);
9895 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
9896 sv = (SV*)POPPTR(ss,ix);
9897 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
9898 hv = (HV*)POPPTR(ss,ix);
9899 TOPPTR(nss,ix) = hv_dup_inc(hv, param);
9902 ptr = POPPTR(ss,ix);
9903 TOPPTR(nss,ix) = ptr;
9910 av = (AV*)POPPTR(ss,ix);
9911 TOPPTR(nss,ix) = av_dup(av, param);
9914 longval = (long)POPLONG(ss,ix);
9915 TOPLONG(nss,ix) = longval;
9916 ptr = POPPTR(ss,ix);
9917 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
9918 sv = (SV*)POPPTR(ss,ix);
9919 TOPPTR(nss,ix) = sv_dup(sv, param);
9922 Perl_croak(aTHX_ "panic: ss_dup inconsistency");
9930 =for apidoc perl_clone
9932 Create and return a new interpreter by cloning the current one.
9937 /* XXX the above needs expanding by someone who actually understands it ! */
9938 EXTERN_C PerlInterpreter *
9939 perl_clone_host(PerlInterpreter* proto_perl, UV flags);
9942 perl_clone(PerlInterpreter *proto_perl, UV flags)
9944 #ifdef PERL_IMPLICIT_SYS
9946 /* perlhost.h so we need to call into it
9947 to clone the host, CPerlHost should have a c interface, sky */
9949 if (flags & CLONEf_CLONE_HOST) {
9950 return perl_clone_host(proto_perl,flags);
9952 return perl_clone_using(proto_perl, flags,
9954 proto_perl->IMemShared,
9955 proto_perl->IMemParse,
9965 perl_clone_using(PerlInterpreter *proto_perl, UV flags,
9966 struct IPerlMem* ipM, struct IPerlMem* ipMS,
9967 struct IPerlMem* ipMP, struct IPerlEnv* ipE,
9968 struct IPerlStdIO* ipStd, struct IPerlLIO* ipLIO,
9969 struct IPerlDir* ipD, struct IPerlSock* ipS,
9970 struct IPerlProc* ipP)
9972 /* XXX many of the string copies here can be optimized if they're
9973 * constants; they need to be allocated as common memory and just
9974 * their pointers copied. */
9977 CLONE_PARAMS clone_params;
9978 CLONE_PARAMS* param = &clone_params;
9980 PerlInterpreter *my_perl = (PerlInterpreter*)(*ipM->pMalloc)(ipM, sizeof(PerlInterpreter));
9981 PERL_SET_THX(my_perl);
9984 Poison(my_perl, 1, PerlInterpreter);
9990 Zero(&PL_debug_pad, 1, struct perl_debug_pad);
9991 # else /* !DEBUGGING */
9992 Zero(my_perl, 1, PerlInterpreter);
9993 # endif /* DEBUGGING */
9997 PL_MemShared = ipMS;
10005 #else /* !PERL_IMPLICIT_SYS */
10007 CLONE_PARAMS clone_params;
10008 CLONE_PARAMS* param = &clone_params;
10009 PerlInterpreter *my_perl = (PerlInterpreter*)PerlMem_malloc(sizeof(PerlInterpreter));
10010 PERL_SET_THX(my_perl);
10015 Poison(my_perl, 1, PerlInterpreter);
10020 PL_sig_pending = 0;
10021 Zero(&PL_debug_pad, 1, struct perl_debug_pad);
10022 # else /* !DEBUGGING */
10023 Zero(my_perl, 1, PerlInterpreter);
10024 # endif /* DEBUGGING */
10025 #endif /* PERL_IMPLICIT_SYS */
10026 param->flags = flags;
10027 param->proto_perl = proto_perl;
10030 PL_xiv_arenaroot = NULL;
10031 PL_xiv_root = NULL;
10032 PL_xnv_arenaroot = NULL;
10033 PL_xnv_root = NULL;
10034 PL_xrv_arenaroot = NULL;
10035 PL_xrv_root = NULL;
10036 PL_xpv_arenaroot = NULL;
10037 PL_xpv_root = NULL;
10038 PL_xpviv_arenaroot = NULL;
10039 PL_xpviv_root = NULL;
10040 PL_xpvnv_arenaroot = NULL;
10041 PL_xpvnv_root = NULL;
10042 PL_xpvcv_arenaroot = NULL;
10043 PL_xpvcv_root = NULL;
10044 PL_xpvav_arenaroot = NULL;
10045 PL_xpvav_root = NULL;
10046 PL_xpvhv_arenaroot = NULL;
10047 PL_xpvhv_root = NULL;
10048 PL_xpvmg_arenaroot = NULL;
10049 PL_xpvmg_root = NULL;
10050 PL_xpvlv_arenaroot = NULL;
10051 PL_xpvlv_root = NULL;
10052 PL_xpvbm_arenaroot = NULL;
10053 PL_xpvbm_root = NULL;
10054 PL_he_arenaroot = NULL;
10056 PL_nice_chunk = NULL;
10057 PL_nice_chunk_size = 0;
10059 PL_sv_objcount = 0;
10060 PL_sv_root = Nullsv;
10061 PL_sv_arenaroot = Nullsv;
10063 PL_debug = proto_perl->Idebug;
10065 #ifdef USE_REENTRANT_API
10066 Perl_reentrant_init(aTHX);
10069 /* create SV map for pointer relocation */
10070 PL_ptr_table = ptr_table_new();
10072 /* initialize these special pointers as early as possible */
10073 SvANY(&PL_sv_undef) = NULL;
10074 SvREFCNT(&PL_sv_undef) = (~(U32)0)/2;
10075 SvFLAGS(&PL_sv_undef) = SVf_READONLY|SVt_NULL;
10076 ptr_table_store(PL_ptr_table, &proto_perl->Isv_undef, &PL_sv_undef);
10078 SvANY(&PL_sv_no) = new_XPVNV();
10079 SvREFCNT(&PL_sv_no) = (~(U32)0)/2;
10080 SvFLAGS(&PL_sv_no) = SVp_NOK|SVf_NOK|SVp_POK|SVf_POK|SVf_READONLY|SVt_PVNV;
10081 SvPVX(&PL_sv_no) = SAVEPVN(PL_No, 0);
10082 SvCUR(&PL_sv_no) = 0;
10083 SvLEN(&PL_sv_no) = 1;
10084 SvNVX(&PL_sv_no) = 0;
10085 ptr_table_store(PL_ptr_table, &proto_perl->Isv_no, &PL_sv_no);
10087 SvANY(&PL_sv_yes) = new_XPVNV();
10088 SvREFCNT(&PL_sv_yes) = (~(U32)0)/2;
10089 SvFLAGS(&PL_sv_yes) = SVp_NOK|SVf_NOK|SVp_POK|SVf_POK|SVf_READONLY|SVt_PVNV;
10090 SvPVX(&PL_sv_yes) = SAVEPVN(PL_Yes, 1);
10091 SvCUR(&PL_sv_yes) = 1;
10092 SvLEN(&PL_sv_yes) = 2;
10093 SvNVX(&PL_sv_yes) = 1;
10094 ptr_table_store(PL_ptr_table, &proto_perl->Isv_yes, &PL_sv_yes);
10096 /* create (a non-shared!) shared string table */
10097 PL_strtab = newHV();
10098 HvSHAREKEYS_off(PL_strtab);
10099 hv_ksplit(PL_strtab, 512);
10100 ptr_table_store(PL_ptr_table, proto_perl->Istrtab, PL_strtab);
10102 PL_compiling = proto_perl->Icompiling;
10104 /* These two PVs will be free'd special way so must set them same way op.c does */
10105 PL_compiling.cop_stashpv = savesharedpv(PL_compiling.cop_stashpv);
10106 ptr_table_store(PL_ptr_table, proto_perl->Icompiling.cop_stashpv, PL_compiling.cop_stashpv);
10108 PL_compiling.cop_file = savesharedpv(PL_compiling.cop_file);
10109 ptr_table_store(PL_ptr_table, proto_perl->Icompiling.cop_file, PL_compiling.cop_file);
10111 ptr_table_store(PL_ptr_table, &proto_perl->Icompiling, &PL_compiling);
10112 if (!specialWARN(PL_compiling.cop_warnings))
10113 PL_compiling.cop_warnings = sv_dup_inc(PL_compiling.cop_warnings, param);
10114 if (!specialCopIO(PL_compiling.cop_io))
10115 PL_compiling.cop_io = sv_dup_inc(PL_compiling.cop_io, param);
10116 PL_curcop = (COP*)any_dup(proto_perl->Tcurcop, proto_perl);
10118 /* pseudo environmental stuff */
10119 PL_origargc = proto_perl->Iorigargc;
10121 New(0, PL_origargv, i+1, char*);
10122 PL_origargv[i] = '\0';
10124 PL_origargv[i] = SAVEPV(proto_perl->Iorigargv[i]);
10127 param->stashes = newAV(); /* Setup array of objects to call clone on */
10129 #ifdef PERLIO_LAYERS
10130 /* Clone PerlIO tables as soon as we can handle general xx_dup() */
10131 PerlIO_clone(aTHX_ proto_perl, param);
10134 PL_envgv = gv_dup(proto_perl->Ienvgv, param);
10135 PL_incgv = gv_dup(proto_perl->Iincgv, param);
10136 PL_hintgv = gv_dup(proto_perl->Ihintgv, param);
10137 PL_origfilename = SAVEPV(proto_perl->Iorigfilename);
10138 PL_diehook = sv_dup_inc(proto_perl->Idiehook, param);
10139 PL_warnhook = sv_dup_inc(proto_perl->Iwarnhook, param);
10142 PL_minus_c = proto_perl->Iminus_c;
10143 PL_patchlevel = sv_dup_inc(proto_perl->Ipatchlevel, param);
10144 PL_localpatches = proto_perl->Ilocalpatches;
10145 PL_splitstr = proto_perl->Isplitstr;
10146 PL_preprocess = proto_perl->Ipreprocess;
10147 PL_minus_n = proto_perl->Iminus_n;
10148 PL_minus_p = proto_perl->Iminus_p;
10149 PL_minus_l = proto_perl->Iminus_l;
10150 PL_minus_a = proto_perl->Iminus_a;
10151 PL_minus_F = proto_perl->Iminus_F;
10152 PL_doswitches = proto_perl->Idoswitches;
10153 PL_dowarn = proto_perl->Idowarn;
10154 PL_doextract = proto_perl->Idoextract;
10155 PL_sawampersand = proto_perl->Isawampersand;
10156 PL_unsafe = proto_perl->Iunsafe;
10157 PL_inplace = SAVEPV(proto_perl->Iinplace);
10158 PL_e_script = sv_dup_inc(proto_perl->Ie_script, param);
10159 PL_perldb = proto_perl->Iperldb;
10160 PL_perl_destruct_level = proto_perl->Iperl_destruct_level;
10161 PL_exit_flags = proto_perl->Iexit_flags;
10163 /* magical thingies */
10164 /* XXX time(&PL_basetime) when asked for? */
10165 PL_basetime = proto_perl->Ibasetime;
10166 PL_formfeed = sv_dup(proto_perl->Iformfeed, param);
10168 PL_maxsysfd = proto_perl->Imaxsysfd;
10169 PL_multiline = proto_perl->Imultiline;
10170 PL_statusvalue = proto_perl->Istatusvalue;
10172 PL_statusvalue_vms = proto_perl->Istatusvalue_vms;
10174 PL_encoding = sv_dup(proto_perl->Iencoding, param);
10176 sv_setpvn(PERL_DEBUG_PAD(0), "", 0); /* For regex debugging. */
10177 sv_setpvn(PERL_DEBUG_PAD(1), "", 0); /* ext/re needs these */
10178 sv_setpvn(PERL_DEBUG_PAD(2), "", 0); /* even without DEBUGGING. */
10180 /* Clone the regex array */
10181 PL_regex_padav = newAV();
10183 I32 len = av_len((AV*)proto_perl->Iregex_padav);
10184 SV** regexen = AvARRAY((AV*)proto_perl->Iregex_padav);
10185 av_push(PL_regex_padav,
10186 sv_dup_inc(regexen[0],param));
10187 for(i = 1; i <= len; i++) {
10188 if(SvREPADTMP(regexen[i])) {
10189 av_push(PL_regex_padav, sv_dup_inc(regexen[i], param));
10191 av_push(PL_regex_padav,
10193 newSViv(PTR2IV(re_dup(INT2PTR(REGEXP *,
10194 SvIVX(regexen[i])), param)))
10199 PL_regex_pad = AvARRAY(PL_regex_padav);
10201 /* shortcuts to various I/O objects */
10202 PL_stdingv = gv_dup(proto_perl->Istdingv, param);
10203 PL_stderrgv = gv_dup(proto_perl->Istderrgv, param);
10204 PL_defgv = gv_dup(proto_perl->Idefgv, param);
10205 PL_argvgv = gv_dup(proto_perl->Iargvgv, param);
10206 PL_argvoutgv = gv_dup(proto_perl->Iargvoutgv, param);
10207 PL_argvout_stack = av_dup_inc(proto_perl->Iargvout_stack, param);
10209 /* shortcuts to regexp stuff */
10210 PL_replgv = gv_dup(proto_perl->Ireplgv, param);
10212 /* shortcuts to misc objects */
10213 PL_errgv = gv_dup(proto_perl->Ierrgv, param);
10215 /* shortcuts to debugging objects */
10216 PL_DBgv = gv_dup(proto_perl->IDBgv, param);
10217 PL_DBline = gv_dup(proto_perl->IDBline, param);
10218 PL_DBsub = gv_dup(proto_perl->IDBsub, param);
10219 PL_DBsingle = sv_dup(proto_perl->IDBsingle, param);
10220 PL_DBtrace = sv_dup(proto_perl->IDBtrace, param);
10221 PL_DBsignal = sv_dup(proto_perl->IDBsignal, param);
10222 PL_lineary = av_dup(proto_perl->Ilineary, param);
10223 PL_dbargs = av_dup(proto_perl->Idbargs, param);
10225 /* symbol tables */
10226 PL_defstash = hv_dup_inc(proto_perl->Tdefstash, param);
10227 PL_curstash = hv_dup(proto_perl->Tcurstash, param);
10228 PL_nullstash = hv_dup(proto_perl->Inullstash, param);
10229 PL_debstash = hv_dup(proto_perl->Idebstash, param);
10230 PL_globalstash = hv_dup(proto_perl->Iglobalstash, param);
10231 PL_curstname = sv_dup_inc(proto_perl->Icurstname, param);
10233 PL_beginav = av_dup_inc(proto_perl->Ibeginav, param);
10234 PL_beginav_save = av_dup_inc(proto_perl->Ibeginav_save, param);
10235 PL_checkav_save = av_dup_inc(proto_perl->Icheckav_save, param);
10236 PL_endav = av_dup_inc(proto_perl->Iendav, param);
10237 PL_checkav = av_dup_inc(proto_perl->Icheckav, param);
10238 PL_initav = av_dup_inc(proto_perl->Iinitav, param);
10240 PL_sub_generation = proto_perl->Isub_generation;
10242 /* funky return mechanisms */
10243 PL_forkprocess = proto_perl->Iforkprocess;
10245 /* subprocess state */
10246 PL_fdpid = av_dup_inc(proto_perl->Ifdpid, param);
10248 /* internal state */
10249 PL_tainting = proto_perl->Itainting;
10250 PL_maxo = proto_perl->Imaxo;
10251 if (proto_perl->Iop_mask)
10252 PL_op_mask = SAVEPVN(proto_perl->Iop_mask, PL_maxo);
10254 PL_op_mask = Nullch;
10256 /* current interpreter roots */
10257 PL_main_cv = cv_dup_inc(proto_perl->Imain_cv, param);
10258 PL_main_root = OpREFCNT_inc(proto_perl->Imain_root);
10259 PL_main_start = proto_perl->Imain_start;
10260 PL_eval_root = proto_perl->Ieval_root;
10261 PL_eval_start = proto_perl->Ieval_start;
10263 /* runtime control stuff */
10264 PL_curcopdb = (COP*)any_dup(proto_perl->Icurcopdb, proto_perl);
10265 PL_copline = proto_perl->Icopline;
10267 PL_filemode = proto_perl->Ifilemode;
10268 PL_lastfd = proto_perl->Ilastfd;
10269 PL_oldname = proto_perl->Ioldname; /* XXX not quite right */
10272 PL_gensym = proto_perl->Igensym;
10273 PL_preambled = proto_perl->Ipreambled;
10274 PL_preambleav = av_dup_inc(proto_perl->Ipreambleav, param);
10275 PL_laststatval = proto_perl->Ilaststatval;
10276 PL_laststype = proto_perl->Ilaststype;
10277 PL_mess_sv = Nullsv;
10279 PL_ors_sv = sv_dup_inc(proto_perl->Iors_sv, param);
10280 PL_ofmt = SAVEPV(proto_perl->Iofmt);
10282 /* interpreter atexit processing */
10283 PL_exitlistlen = proto_perl->Iexitlistlen;
10284 if (PL_exitlistlen) {
10285 New(0, PL_exitlist, PL_exitlistlen, PerlExitListEntry);
10286 Copy(proto_perl->Iexitlist, PL_exitlist, PL_exitlistlen, PerlExitListEntry);
10289 PL_exitlist = (PerlExitListEntry*)NULL;
10290 PL_modglobal = hv_dup_inc(proto_perl->Imodglobal, param);
10291 PL_custom_op_names = hv_dup_inc(proto_perl->Icustom_op_names,param);
10292 PL_custom_op_descs = hv_dup_inc(proto_perl->Icustom_op_descs,param);
10294 PL_profiledata = NULL;
10295 PL_rsfp = fp_dup(proto_perl->Irsfp, '<', param);
10296 /* PL_rsfp_filters entries have fake IoDIRP() */
10297 PL_rsfp_filters = av_dup_inc(proto_perl->Irsfp_filters, param);
10299 PL_compcv = cv_dup(proto_perl->Icompcv, param);
10300 PL_comppad = av_dup(proto_perl->Icomppad, param);
10301 PL_comppad_name = av_dup(proto_perl->Icomppad_name, param);
10302 PL_comppad_name_fill = proto_perl->Icomppad_name_fill;
10303 PL_comppad_name_floor = proto_perl->Icomppad_name_floor;
10304 PL_curpad = (SV**)ptr_table_fetch(PL_ptr_table,
10305 proto_perl->Tcurpad);
10307 #ifdef HAVE_INTERP_INTERN
10308 sys_intern_dup(&proto_perl->Isys_intern, &PL_sys_intern);
10311 /* more statics moved here */
10312 PL_generation = proto_perl->Igeneration;
10313 PL_DBcv = cv_dup(proto_perl->IDBcv, param);
10315 PL_in_clean_objs = proto_perl->Iin_clean_objs;
10316 PL_in_clean_all = proto_perl->Iin_clean_all;
10318 PL_uid = proto_perl->Iuid;
10319 PL_euid = proto_perl->Ieuid;
10320 PL_gid = proto_perl->Igid;
10321 PL_egid = proto_perl->Iegid;
10322 PL_nomemok = proto_perl->Inomemok;
10323 PL_an = proto_perl->Ian;
10324 PL_cop_seqmax = proto_perl->Icop_seqmax;
10325 PL_op_seqmax = proto_perl->Iop_seqmax;
10326 PL_evalseq = proto_perl->Ievalseq;
10327 PL_origenviron = proto_perl->Iorigenviron; /* XXX not quite right */
10328 PL_origalen = proto_perl->Iorigalen;
10329 PL_pidstatus = newHV(); /* XXX flag for cloning? */
10330 PL_osname = SAVEPV(proto_perl->Iosname);
10331 PL_sh_path = proto_perl->Ish_path; /* XXX never deallocated */
10332 PL_sighandlerp = proto_perl->Isighandlerp;
10335 PL_runops = proto_perl->Irunops;
10337 Copy(proto_perl->Itokenbuf, PL_tokenbuf, 256, char);
10340 PL_cshlen = proto_perl->Icshlen;
10341 PL_cshname = proto_perl->Icshname; /* XXX never deallocated */
10344 PL_lex_state = proto_perl->Ilex_state;
10345 PL_lex_defer = proto_perl->Ilex_defer;
10346 PL_lex_expect = proto_perl->Ilex_expect;
10347 PL_lex_formbrack = proto_perl->Ilex_formbrack;
10348 PL_lex_dojoin = proto_perl->Ilex_dojoin;
10349 PL_lex_starts = proto_perl->Ilex_starts;
10350 PL_lex_stuff = sv_dup_inc(proto_perl->Ilex_stuff, param);
10351 PL_lex_repl = sv_dup_inc(proto_perl->Ilex_repl, param);
10352 PL_lex_op = proto_perl->Ilex_op;
10353 PL_lex_inpat = proto_perl->Ilex_inpat;
10354 PL_lex_inwhat = proto_perl->Ilex_inwhat;
10355 PL_lex_brackets = proto_perl->Ilex_brackets;
10356 i = (PL_lex_brackets < 120 ? 120 : PL_lex_brackets);
10357 PL_lex_brackstack = SAVEPVN(proto_perl->Ilex_brackstack,i);
10358 PL_lex_casemods = proto_perl->Ilex_casemods;
10359 i = (PL_lex_casemods < 12 ? 12 : PL_lex_casemods);
10360 PL_lex_casestack = SAVEPVN(proto_perl->Ilex_casestack,i);
10362 Copy(proto_perl->Inextval, PL_nextval, 5, YYSTYPE);
10363 Copy(proto_perl->Inexttype, PL_nexttype, 5, I32);
10364 PL_nexttoke = proto_perl->Inexttoke;
10366 /* XXX This is probably masking the deeper issue of why
10367 * SvANY(proto_perl->Ilinestr) can be NULL at this point. For test case:
10368 * http://archive.develooper.com/perl5-porters%40perl.org/msg83298.html
10369 * (A little debugging with a watchpoint on it may help.)
10371 if (SvANY(proto_perl->Ilinestr)) {
10372 PL_linestr = sv_dup_inc(proto_perl->Ilinestr, param);
10373 i = proto_perl->Ibufptr - SvPVX(proto_perl->Ilinestr);
10374 PL_bufptr = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
10375 i = proto_perl->Ioldbufptr - SvPVX(proto_perl->Ilinestr);
10376 PL_oldbufptr = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
10377 i = proto_perl->Ioldoldbufptr - SvPVX(proto_perl->Ilinestr);
10378 PL_oldoldbufptr = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
10379 i = proto_perl->Ilinestart - SvPVX(proto_perl->Ilinestr);
10380 PL_linestart = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
10383 PL_linestr = NEWSV(65,79);
10384 sv_upgrade(PL_linestr,SVt_PVIV);
10385 sv_setpvn(PL_linestr,"",0);
10386 PL_bufptr = PL_oldbufptr = PL_oldoldbufptr = PL_linestart = SvPVX(PL_linestr);
10388 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
10389 PL_pending_ident = proto_perl->Ipending_ident;
10390 PL_sublex_info = proto_perl->Isublex_info; /* XXX not quite right */
10392 PL_expect = proto_perl->Iexpect;
10394 PL_multi_start = proto_perl->Imulti_start;
10395 PL_multi_end = proto_perl->Imulti_end;
10396 PL_multi_open = proto_perl->Imulti_open;
10397 PL_multi_close = proto_perl->Imulti_close;
10399 PL_error_count = proto_perl->Ierror_count;
10400 PL_subline = proto_perl->Isubline;
10401 PL_subname = sv_dup_inc(proto_perl->Isubname, param);
10403 PL_min_intro_pending = proto_perl->Imin_intro_pending;
10404 PL_max_intro_pending = proto_perl->Imax_intro_pending;
10405 PL_padix = proto_perl->Ipadix;
10406 PL_padix_floor = proto_perl->Ipadix_floor;
10407 PL_pad_reset_pending = proto_perl->Ipad_reset_pending;
10409 /* XXX See comment on SvANY(proto_perl->Ilinestr) above */
10410 if (SvANY(proto_perl->Ilinestr)) {
10411 i = proto_perl->Ilast_uni - SvPVX(proto_perl->Ilinestr);
10412 PL_last_uni = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
10413 i = proto_perl->Ilast_lop - SvPVX(proto_perl->Ilinestr);
10414 PL_last_lop = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
10415 PL_last_lop_op = proto_perl->Ilast_lop_op;
10418 PL_last_uni = SvPVX(PL_linestr);
10419 PL_last_lop = SvPVX(PL_linestr);
10420 PL_last_lop_op = 0;
10422 PL_in_my = proto_perl->Iin_my;
10423 PL_in_my_stash = hv_dup(proto_perl->Iin_my_stash, param);
10425 PL_cryptseen = proto_perl->Icryptseen;
10428 PL_hints = proto_perl->Ihints;
10430 PL_amagic_generation = proto_perl->Iamagic_generation;
10432 #ifdef USE_LOCALE_COLLATE
10433 PL_collation_ix = proto_perl->Icollation_ix;
10434 PL_collation_name = SAVEPV(proto_perl->Icollation_name);
10435 PL_collation_standard = proto_perl->Icollation_standard;
10436 PL_collxfrm_base = proto_perl->Icollxfrm_base;
10437 PL_collxfrm_mult = proto_perl->Icollxfrm_mult;
10438 #endif /* USE_LOCALE_COLLATE */
10440 #ifdef USE_LOCALE_NUMERIC
10441 PL_numeric_name = SAVEPV(proto_perl->Inumeric_name);
10442 PL_numeric_standard = proto_perl->Inumeric_standard;
10443 PL_numeric_local = proto_perl->Inumeric_local;
10444 PL_numeric_radix_sv = sv_dup_inc(proto_perl->Inumeric_radix_sv, param);
10445 #endif /* !USE_LOCALE_NUMERIC */
10447 /* utf8 character classes */
10448 PL_utf8_alnum = sv_dup_inc(proto_perl->Iutf8_alnum, param);
10449 PL_utf8_alnumc = sv_dup_inc(proto_perl->Iutf8_alnumc, param);
10450 PL_utf8_ascii = sv_dup_inc(proto_perl->Iutf8_ascii, param);
10451 PL_utf8_alpha = sv_dup_inc(proto_perl->Iutf8_alpha, param);
10452 PL_utf8_space = sv_dup_inc(proto_perl->Iutf8_space, param);
10453 PL_utf8_cntrl = sv_dup_inc(proto_perl->Iutf8_cntrl, param);
10454 PL_utf8_graph = sv_dup_inc(proto_perl->Iutf8_graph, param);
10455 PL_utf8_digit = sv_dup_inc(proto_perl->Iutf8_digit, param);
10456 PL_utf8_upper = sv_dup_inc(proto_perl->Iutf8_upper, param);
10457 PL_utf8_lower = sv_dup_inc(proto_perl->Iutf8_lower, param);
10458 PL_utf8_print = sv_dup_inc(proto_perl->Iutf8_print, param);
10459 PL_utf8_punct = sv_dup_inc(proto_perl->Iutf8_punct, param);
10460 PL_utf8_xdigit = sv_dup_inc(proto_perl->Iutf8_xdigit, param);
10461 PL_utf8_mark = sv_dup_inc(proto_perl->Iutf8_mark, param);
10462 PL_utf8_toupper = sv_dup_inc(proto_perl->Iutf8_toupper, param);
10463 PL_utf8_totitle = sv_dup_inc(proto_perl->Iutf8_totitle, param);
10464 PL_utf8_tolower = sv_dup_inc(proto_perl->Iutf8_tolower, param);
10465 PL_utf8_tofold = sv_dup_inc(proto_perl->Iutf8_tofold, param);
10466 PL_utf8_idstart = sv_dup_inc(proto_perl->Iutf8_idstart, param);
10467 PL_utf8_idcont = sv_dup_inc(proto_perl->Iutf8_idcont, param);
10470 PL_last_swash_hv = Nullhv; /* reinits on demand */
10471 PL_last_swash_klen = 0;
10472 PL_last_swash_key[0]= '\0';
10473 PL_last_swash_tmps = (U8*)NULL;
10474 PL_last_swash_slen = 0;
10476 /* perly.c globals */
10477 PL_yydebug = proto_perl->Iyydebug;
10478 PL_yynerrs = proto_perl->Iyynerrs;
10479 PL_yyerrflag = proto_perl->Iyyerrflag;
10480 PL_yychar = proto_perl->Iyychar;
10481 PL_yyval = proto_perl->Iyyval;
10482 PL_yylval = proto_perl->Iyylval;
10484 PL_glob_index = proto_perl->Iglob_index;
10485 PL_srand_called = proto_perl->Isrand_called;
10486 PL_uudmap['M'] = 0; /* reinits on demand */
10487 PL_bitcount = Nullch; /* reinits on demand */
10489 if (proto_perl->Ipsig_pend) {
10490 Newz(0, PL_psig_pend, SIG_SIZE, int);
10493 PL_psig_pend = (int*)NULL;
10496 if (proto_perl->Ipsig_ptr) {
10497 Newz(0, PL_psig_ptr, SIG_SIZE, SV*);
10498 Newz(0, PL_psig_name, SIG_SIZE, SV*);
10499 for (i = 1; i < SIG_SIZE; i++) {
10500 PL_psig_ptr[i] = sv_dup_inc(proto_perl->Ipsig_ptr[i], param);
10501 PL_psig_name[i] = sv_dup_inc(proto_perl->Ipsig_name[i], param);
10505 PL_psig_ptr = (SV**)NULL;
10506 PL_psig_name = (SV**)NULL;
10509 /* thrdvar.h stuff */
10511 if (flags & CLONEf_COPY_STACKS) {
10512 /* next allocation will be PL_tmps_stack[PL_tmps_ix+1] */
10513 PL_tmps_ix = proto_perl->Ttmps_ix;
10514 PL_tmps_max = proto_perl->Ttmps_max;
10515 PL_tmps_floor = proto_perl->Ttmps_floor;
10516 Newz(50, PL_tmps_stack, PL_tmps_max, SV*);
10518 while (i <= PL_tmps_ix) {
10519 PL_tmps_stack[i] = sv_dup_inc(proto_perl->Ttmps_stack[i], param);
10523 /* next PUSHMARK() sets *(PL_markstack_ptr+1) */
10524 i = proto_perl->Tmarkstack_max - proto_perl->Tmarkstack;
10525 Newz(54, PL_markstack, i, I32);
10526 PL_markstack_max = PL_markstack + (proto_perl->Tmarkstack_max
10527 - proto_perl->Tmarkstack);
10528 PL_markstack_ptr = PL_markstack + (proto_perl->Tmarkstack_ptr
10529 - proto_perl->Tmarkstack);
10530 Copy(proto_perl->Tmarkstack, PL_markstack,
10531 PL_markstack_ptr - PL_markstack + 1, I32);
10533 /* next push_scope()/ENTER sets PL_scopestack[PL_scopestack_ix]
10534 * NOTE: unlike the others! */
10535 PL_scopestack_ix = proto_perl->Tscopestack_ix;
10536 PL_scopestack_max = proto_perl->Tscopestack_max;
10537 Newz(54, PL_scopestack, PL_scopestack_max, I32);
10538 Copy(proto_perl->Tscopestack, PL_scopestack, PL_scopestack_ix, I32);
10540 /* next push_return() sets PL_retstack[PL_retstack_ix]
10541 * NOTE: unlike the others! */
10542 PL_retstack_ix = proto_perl->Tretstack_ix;
10543 PL_retstack_max = proto_perl->Tretstack_max;
10544 Newz(54, PL_retstack, PL_retstack_max, OP*);
10545 Copy(proto_perl->Tretstack, PL_retstack, PL_retstack_ix, OP*);
10547 /* NOTE: si_dup() looks at PL_markstack */
10548 PL_curstackinfo = si_dup(proto_perl->Tcurstackinfo, param);
10550 /* PL_curstack = PL_curstackinfo->si_stack; */
10551 PL_curstack = av_dup(proto_perl->Tcurstack, param);
10552 PL_mainstack = av_dup(proto_perl->Tmainstack, param);
10554 /* next PUSHs() etc. set *(PL_stack_sp+1) */
10555 PL_stack_base = AvARRAY(PL_curstack);
10556 PL_stack_sp = PL_stack_base + (proto_perl->Tstack_sp
10557 - proto_perl->Tstack_base);
10558 PL_stack_max = PL_stack_base + AvMAX(PL_curstack);
10560 /* next SSPUSHFOO() sets PL_savestack[PL_savestack_ix]
10561 * NOTE: unlike the others! */
10562 PL_savestack_ix = proto_perl->Tsavestack_ix;
10563 PL_savestack_max = proto_perl->Tsavestack_max;
10564 /*Newz(54, PL_savestack, PL_savestack_max, ANY);*/
10565 PL_savestack = ss_dup(proto_perl, param);
10569 ENTER; /* perl_destruct() wants to LEAVE; */
10572 PL_start_env = proto_perl->Tstart_env; /* XXXXXX */
10573 PL_top_env = &PL_start_env;
10575 PL_op = proto_perl->Top;
10578 PL_Xpv = (XPV*)NULL;
10579 PL_na = proto_perl->Tna;
10581 PL_statbuf = proto_perl->Tstatbuf;
10582 PL_statcache = proto_perl->Tstatcache;
10583 PL_statgv = gv_dup(proto_perl->Tstatgv, param);
10584 PL_statname = sv_dup_inc(proto_perl->Tstatname, param);
10586 PL_timesbuf = proto_perl->Ttimesbuf;
10589 PL_tainted = proto_perl->Ttainted;
10590 PL_curpm = proto_perl->Tcurpm; /* XXX No PMOP ref count */
10591 PL_rs = sv_dup_inc(proto_perl->Trs, param);
10592 PL_last_in_gv = gv_dup(proto_perl->Tlast_in_gv, param);
10593 PL_ofs_sv = sv_dup_inc(proto_perl->Tofs_sv, param);
10594 PL_defoutgv = gv_dup_inc(proto_perl->Tdefoutgv, param);
10595 PL_chopset = proto_perl->Tchopset; /* XXX never deallocated */
10596 PL_toptarget = sv_dup_inc(proto_perl->Ttoptarget, param);
10597 PL_bodytarget = sv_dup_inc(proto_perl->Tbodytarget, param);
10598 PL_formtarget = sv_dup(proto_perl->Tformtarget, param);
10600 PL_restartop = proto_perl->Trestartop;
10601 PL_in_eval = proto_perl->Tin_eval;
10602 PL_delaymagic = proto_perl->Tdelaymagic;
10603 PL_dirty = proto_perl->Tdirty;
10604 PL_localizing = proto_perl->Tlocalizing;
10606 #ifdef PERL_FLEXIBLE_EXCEPTIONS
10607 PL_protect = proto_perl->Tprotect;
10609 PL_errors = sv_dup_inc(proto_perl->Terrors, param);
10610 PL_av_fetch_sv = Nullsv;
10611 PL_hv_fetch_sv = Nullsv;
10612 Zero(&PL_hv_fetch_ent_mh, 1, HE); /* XXX */
10613 PL_modcount = proto_perl->Tmodcount;
10614 PL_lastgotoprobe = Nullop;
10615 PL_dumpindent = proto_perl->Tdumpindent;
10617 PL_sortcop = (OP*)any_dup(proto_perl->Tsortcop, proto_perl);
10618 PL_sortstash = hv_dup(proto_perl->Tsortstash, param);
10619 PL_firstgv = gv_dup(proto_perl->Tfirstgv, param);
10620 PL_secondgv = gv_dup(proto_perl->Tsecondgv, param);
10621 PL_sortcxix = proto_perl->Tsortcxix;
10622 PL_efloatbuf = Nullch; /* reinits on demand */
10623 PL_efloatsize = 0; /* reinits on demand */
10627 PL_screamfirst = NULL;
10628 PL_screamnext = NULL;
10629 PL_maxscream = -1; /* reinits on demand */
10630 PL_lastscream = Nullsv;
10632 PL_watchaddr = NULL;
10633 PL_watchok = Nullch;
10635 PL_regdummy = proto_perl->Tregdummy;
10636 PL_regcomp_parse = Nullch;
10637 PL_regxend = Nullch;
10638 PL_regcode = (regnode*)NULL;
10641 PL_regprecomp = Nullch;
10646 PL_seen_zerolen = 0;
10648 PL_regcomp_rx = (regexp*)NULL;
10650 PL_colorset = 0; /* reinits PL_colors[] */
10651 /*PL_colors[6] = {0,0,0,0,0,0};*/
10652 PL_reg_whilem_seen = 0;
10653 PL_reginput = Nullch;
10654 PL_regbol = Nullch;
10655 PL_regeol = Nullch;
10656 PL_regstartp = (I32*)NULL;
10657 PL_regendp = (I32*)NULL;
10658 PL_reglastparen = (U32*)NULL;
10659 PL_regtill = Nullch;
10660 PL_reg_start_tmp = (char**)NULL;
10661 PL_reg_start_tmpl = 0;
10662 PL_regdata = (struct reg_data*)NULL;
10665 PL_reg_eval_set = 0;
10667 PL_regprogram = (regnode*)NULL;
10669 PL_regcc = (CURCUR*)NULL;
10670 PL_reg_call_cc = (struct re_cc_state*)NULL;
10671 PL_reg_re = (regexp*)NULL;
10672 PL_reg_ganch = Nullch;
10673 PL_reg_sv = Nullsv;
10674 PL_reg_match_utf8 = FALSE;
10675 PL_reg_magic = (MAGIC*)NULL;
10677 PL_reg_oldcurpm = (PMOP*)NULL;
10678 PL_reg_curpm = (PMOP*)NULL;
10679 PL_reg_oldsaved = Nullch;
10680 PL_reg_oldsavedlen = 0;
10681 PL_reg_maxiter = 0;
10682 PL_reg_leftiter = 0;
10683 PL_reg_poscache = Nullch;
10684 PL_reg_poscache_size= 0;
10686 /* RE engine - function pointers */
10687 PL_regcompp = proto_perl->Tregcompp;
10688 PL_regexecp = proto_perl->Tregexecp;
10689 PL_regint_start = proto_perl->Tregint_start;
10690 PL_regint_string = proto_perl->Tregint_string;
10691 PL_regfree = proto_perl->Tregfree;
10693 PL_reginterp_cnt = 0;
10694 PL_reg_starttry = 0;
10696 /* Pluggable optimizer */
10697 PL_peepp = proto_perl->Tpeepp;
10699 if (!(flags & CLONEf_KEEP_PTR_TABLE)) {
10700 ptr_table_free(PL_ptr_table);
10701 PL_ptr_table = NULL;
10704 /* Call the ->CLONE method, if it exists, for each of the stashes
10705 identified by sv_dup() above.
10707 while(av_len(param->stashes) != -1) {
10708 HV* stash = (HV*) av_shift(param->stashes);
10709 GV* cloner = gv_fetchmethod_autoload(stash, "CLONE", 0);
10710 if (cloner && GvCV(cloner)) {
10715 XPUSHs(sv_2mortal(newSVpv(HvNAME(stash), 0)));
10717 call_sv((SV*)GvCV(cloner), G_DISCARD);
10723 SvREFCNT_dec(param->stashes);
10728 #endif /* USE_ITHREADS */
10731 =head1 Unicode Support
10733 =for apidoc sv_recode_to_utf8
10735 The encoding is assumed to be an Encode object, on entry the PV
10736 of the sv is assumed to be octets in that encoding, and the sv
10737 will be converted into Unicode (and UTF-8).
10739 If the sv already is UTF-8 (or if it is not POK), or if the encoding
10740 is not a reference, nothing is done to the sv. If the encoding is not
10741 an C<Encode::XS> Encoding object, bad things will happen.
10742 (See F<lib/encoding.pm> and L<Encode>).
10744 The PV of the sv is returned.
10749 Perl_sv_recode_to_utf8(pTHX_ SV *sv, SV *encoding)
10751 if (SvPOK(sv) && !DO_UTF8(sv) && SvROK(encoding)) {
10764 Passing sv_yes is wrong - it needs to be or'ed set of constants
10765 for Encode::XS, while UTf-8 decode (currently) assumes a true value means
10766 remove converted chars from source.
10768 Both will default the value - let them.
10770 XPUSHs(&PL_sv_yes);
10773 call_method("decode", G_SCALAR);
10777 s = SvPV(uni, len);
10778 if (s != SvPVX(sv)) {
10779 SvGROW(sv, len + 1);
10780 Move(s, SvPVX(sv), len, char);
10781 SvCUR_set(sv, len);
10782 SvPVX(sv)[len] = 0;