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 && strEQ(s=HvNAME(SvSTASH(sv)), "Regexp")
2952 && (mg = mg_find(sv, PERL_MAGIC_qr))) {
2953 regexp *re = (regexp *)mg->mg_obj;
2956 char *fptr = "msix";
2961 char need_newline = 0;
2962 U16 reganch = (U16)((re->reganch & PMf_COMPILETIME) >> 12);
2964 while((ch = *fptr++)) {
2966 reflags[left++] = ch;
2969 reflags[right--] = ch;
2974 reflags[left] = '-';
2978 mg->mg_len = re->prelen + 4 + left;
2980 * If /x was used, we have to worry about a regex
2981 * ending with a comment later being embedded
2982 * within another regex. If so, we don't want this
2983 * regex's "commentization" to leak out to the
2984 * right part of the enclosing regex, we must cap
2985 * it with a newline.
2987 * So, if /x was used, we scan backwards from the
2988 * end of the regex. If we find a '#' before we
2989 * find a newline, we need to add a newline
2990 * ourself. If we find a '\n' first (or if we
2991 * don't find '#' or '\n'), we don't need to add
2992 * anything. -jfriedl
2994 if (PMf_EXTENDED & re->reganch)
2996 char *endptr = re->precomp + re->prelen;
2997 while (endptr >= re->precomp)
2999 char c = *(endptr--);
3001 break; /* don't need another */
3003 /* we end while in a comment, so we
3005 mg->mg_len++; /* save space for it */
3006 need_newline = 1; /* note to add it */
3011 New(616, mg->mg_ptr, mg->mg_len + 1 + left, char);
3012 Copy("(?", mg->mg_ptr, 2, char);
3013 Copy(reflags, mg->mg_ptr+2, left, char);
3014 Copy(":", mg->mg_ptr+left+2, 1, char);
3015 Copy(re->precomp, mg->mg_ptr+3+left, re->prelen, char);
3017 mg->mg_ptr[mg->mg_len - 2] = '\n';
3018 mg->mg_ptr[mg->mg_len - 1] = ')';
3019 mg->mg_ptr[mg->mg_len] = 0;
3021 PL_reginterp_cnt += re->program[0].next_off;
3033 case SVt_PVBM: if (SvROK(sv))
3036 s = "SCALAR"; break;
3037 case SVt_PVLV: s = "LVALUE"; break;
3038 case SVt_PVAV: s = "ARRAY"; break;
3039 case SVt_PVHV: s = "HASH"; break;
3040 case SVt_PVCV: s = "CODE"; break;
3041 case SVt_PVGV: s = "GLOB"; break;
3042 case SVt_PVFM: s = "FORMAT"; break;
3043 case SVt_PVIO: s = "IO"; break;
3044 default: s = "UNKNOWN"; break;
3048 HV *svs = SvSTASH(sv);
3051 /* [20011101.072] This bandaid for C<package;>
3052 should eventually be removed. AMS 20011103 */
3053 (svs ? HvNAME(svs) : "<none>"), s
3058 Perl_sv_catpvf(aTHX_ tsv, "(0x%"UVxf")", PTR2UV(sv));
3064 if (SvREADONLY(sv) && !SvOK(sv)) {
3065 if (ckWARN(WARN_UNINITIALIZED))
3071 if (SvIOK(sv) || ((SvIOKp(sv) && !SvNOKp(sv)))) {
3072 /* I'm assuming that if both IV and NV are equally valid then
3073 converting the IV is going to be more efficient */
3074 U32 isIOK = SvIOK(sv);
3075 U32 isUIOK = SvIsUV(sv);
3076 char buf[TYPE_CHARS(UV)];
3079 if (SvTYPE(sv) < SVt_PVIV)
3080 sv_upgrade(sv, SVt_PVIV);
3082 ptr = uiv_2buf(buf, 0, SvUVX(sv), 1, &ebuf);
3084 ptr = uiv_2buf(buf, SvIVX(sv), 0, 0, &ebuf);
3085 SvGROW(sv, (STRLEN)(ebuf - ptr + 1)); /* inlined from sv_setpvn */
3086 Move(ptr,SvPVX(sv),ebuf - ptr,char);
3087 SvCUR_set(sv, ebuf - ptr);
3097 else if (SvNOKp(sv)) {
3098 if (SvTYPE(sv) < SVt_PVNV)
3099 sv_upgrade(sv, SVt_PVNV);
3100 /* The +20 is pure guesswork. Configure test needed. --jhi */
3101 SvGROW(sv, NV_DIG + 20);
3103 olderrno = errno; /* some Xenix systems wipe out errno here */
3105 if (SvNVX(sv) == 0.0)
3106 (void)strcpy(s,"0");
3110 Gconvert(SvNVX(sv), NV_DIG, 0, s);
3113 #ifdef FIXNEGATIVEZERO
3114 if (*s == '-' && s[1] == '0' && !s[2])
3124 if (ckWARN(WARN_UNINITIALIZED)
3125 && !PL_localizing && !(SvFLAGS(sv) & SVs_PADTMP))
3128 if (SvTYPE(sv) < SVt_PV)
3129 /* Typically the caller expects that sv_any is not NULL now. */
3130 sv_upgrade(sv, SVt_PV);
3133 *lp = s - SvPVX(sv);
3136 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2pv(%s)\n",
3137 PTR2UV(sv),SvPVX(sv)));
3141 if (SvROK(sv)) { /* XXX Skip this when sv_pvn_force calls */
3142 /* Sneaky stuff here */
3146 tsv = newSVpv(tmpbuf, 0);
3162 len = strlen(tmpbuf);
3164 #ifdef FIXNEGATIVEZERO
3165 if (len == 2 && t[0] == '-' && t[1] == '0') {
3170 (void)SvUPGRADE(sv, SVt_PV);
3172 s = SvGROW(sv, len + 1);
3181 =for apidoc sv_copypv
3183 Copies a stringified representation of the source SV into the
3184 destination SV. Automatically performs any necessary mg_get and
3185 coercion of numeric values into strings. Guaranteed to preserve
3186 UTF-8 flag even from overloaded objects. Similar in nature to
3187 sv_2pv[_flags] but operates directly on an SV instead of just the
3188 string. Mostly uses sv_2pv_flags to do its work, except when that
3189 would lose the UTF-8'ness of the PV.
3195 Perl_sv_copypv(pTHX_ SV *dsv, register SV *ssv)
3199 if ( SvTHINKFIRST(ssv) && SvROK(ssv) && SvAMAGIC(ssv) &&
3200 (tmpsv = AMG_CALLun(ssv,string))) {
3201 if (SvTYPE(tmpsv) != SVt_RV || (SvRV(tmpsv) != SvRV(ssv))) {
3206 tmpsv = sv_newmortal();
3212 sv_setpvn(tmpsv,s,len);
3222 =for apidoc sv_2pvbyte_nolen
3224 Return a pointer to the byte-encoded representation of the SV.
3225 May cause the SV to be downgraded from UTF8 as a side-effect.
3227 Usually accessed via the C<SvPVbyte_nolen> macro.
3233 Perl_sv_2pvbyte_nolen(pTHX_ register SV *sv)
3236 return sv_2pvbyte(sv, &n_a);
3240 =for apidoc sv_2pvbyte
3242 Return a pointer to the byte-encoded representation of the SV, and set *lp
3243 to its length. May cause the SV to be downgraded from UTF8 as a
3246 Usually accessed via the C<SvPVbyte> macro.
3252 Perl_sv_2pvbyte(pTHX_ register SV *sv, STRLEN *lp)
3254 sv_utf8_downgrade(sv,0);
3255 return SvPV(sv,*lp);
3259 =for apidoc sv_2pvutf8_nolen
3261 Return a pointer to the UTF8-encoded representation of the SV.
3262 May cause the SV to be upgraded to UTF8 as a side-effect.
3264 Usually accessed via the C<SvPVutf8_nolen> macro.
3270 Perl_sv_2pvutf8_nolen(pTHX_ register SV *sv)
3273 return sv_2pvutf8(sv, &n_a);
3277 =for apidoc sv_2pvutf8
3279 Return a pointer to the UTF8-encoded representation of the SV, and set *lp
3280 to its length. May cause the SV to be upgraded to UTF8 as a side-effect.
3282 Usually accessed via the C<SvPVutf8> macro.
3288 Perl_sv_2pvutf8(pTHX_ register SV *sv, STRLEN *lp)
3290 sv_utf8_upgrade(sv);
3291 return SvPV(sv,*lp);
3295 =for apidoc sv_2bool
3297 This function is only called on magical items, and is only used by
3298 sv_true() or its macro equivalent.
3304 Perl_sv_2bool(pTHX_ register SV *sv)
3313 if (SvAMAGIC(sv) && (tmpsv=AMG_CALLun(sv,bool_)) &&
3314 (!SvROK(tmpsv) || (SvRV(tmpsv) != SvRV(sv))))
3315 return (bool)SvTRUE(tmpsv);
3316 return SvRV(sv) != 0;
3319 register XPV* Xpvtmp;
3320 if ((Xpvtmp = (XPV*)SvANY(sv)) &&
3321 (*Xpvtmp->xpv_pv > '0' ||
3322 Xpvtmp->xpv_cur > 1 ||
3323 (Xpvtmp->xpv_cur && *Xpvtmp->xpv_pv != '0')))
3330 return SvIVX(sv) != 0;
3333 return SvNVX(sv) != 0.0;
3341 =for apidoc sv_utf8_upgrade
3343 Convert the PV of an SV to its UTF8-encoded form.
3344 Forces the SV to string form if it is not already.
3345 Always sets the SvUTF8 flag to avoid future validity checks even
3346 if all the bytes have hibit clear.
3348 This is not as a general purpose byte encoding to Unicode interface:
3349 use the Encode extension for that.
3351 =for apidoc sv_utf8_upgrade_flags
3353 Convert the PV of an SV to its UTF8-encoded form.
3354 Forces the SV to string form if it is not already.
3355 Always sets the SvUTF8 flag to avoid future validity checks even
3356 if all the bytes have hibit clear. If C<flags> has C<SV_GMAGIC> bit set,
3357 will C<mg_get> on C<sv> if appropriate, else not. C<sv_utf8_upgrade> and
3358 C<sv_utf8_upgrade_nomg> are implemented in terms of this function.
3360 This is not as a general purpose byte encoding to Unicode interface:
3361 use the Encode extension for that.
3367 Perl_sv_utf8_upgrade_flags(pTHX_ register SV *sv, I32 flags)
3377 (void) sv_2pv_flags(sv,&len, flags);
3386 sv_force_normal_flags(sv, 0);
3390 sv_recode_to_utf8(sv, PL_encoding);
3391 else { /* Assume Latin-1/EBCDIC */
3392 /* This function could be much more efficient if we
3393 * had a FLAG in SVs to signal if there are any hibit
3394 * chars in the PV. Given that there isn't such a flag
3395 * make the loop as fast as possible. */
3396 s = (U8 *) SvPVX(sv);
3397 e = (U8 *) SvEND(sv);
3401 if ((hibit = !NATIVE_IS_INVARIANT(ch)))
3407 len = SvCUR(sv) + 1; /* Plus the \0 */
3408 SvPVX(sv) = (char*)bytes_to_utf8((U8*)s, &len);
3409 SvCUR(sv) = len - 1;
3411 Safefree(s); /* No longer using what was there before. */
3412 SvLEN(sv) = len; /* No longer know the real size. */
3414 /* Mark as UTF-8 even if no hibit - saves scanning loop */
3421 =for apidoc sv_utf8_downgrade
3423 Attempt to convert the PV of an SV from UTF8-encoded to byte encoding.
3424 This may not be possible if the PV contains non-byte encoding characters;
3425 if this is the case, either returns false or, if C<fail_ok> is not
3428 This is not as a general purpose Unicode to byte encoding interface:
3429 use the Encode extension for that.
3435 Perl_sv_utf8_downgrade(pTHX_ register SV* sv, bool fail_ok)
3437 if (SvPOK(sv) && SvUTF8(sv)) {
3443 sv_force_normal_flags(sv, 0);
3445 s = (U8 *) SvPV(sv, len);
3446 if (!utf8_to_bytes(s, &len)) {
3451 Perl_croak(aTHX_ "Wide character in %s",
3454 Perl_croak(aTHX_ "Wide character");
3465 =for apidoc sv_utf8_encode
3467 Convert the PV of an SV to UTF8-encoded, but then turn off the C<SvUTF8>
3468 flag so that it looks like octets again. Used as a building block
3469 for encode_utf8 in Encode.xs
3475 Perl_sv_utf8_encode(pTHX_ register SV *sv)
3477 (void) sv_utf8_upgrade(sv);
3482 =for apidoc sv_utf8_decode
3484 Convert the octets in the PV from UTF-8 to chars. Scan for validity and then
3485 turn off SvUTF8 if needed so that we see characters. Used as a building block
3486 for decode_utf8 in Encode.xs
3492 Perl_sv_utf8_decode(pTHX_ register SV *sv)
3498 /* The octets may have got themselves encoded - get them back as
3501 if (!sv_utf8_downgrade(sv, TRUE))
3504 /* it is actually just a matter of turning the utf8 flag on, but
3505 * we want to make sure everything inside is valid utf8 first.
3507 c = (U8 *) SvPVX(sv);
3508 if (!is_utf8_string(c, SvCUR(sv)+1))
3510 e = (U8 *) SvEND(sv);
3513 if (!UTF8_IS_INVARIANT(ch)) {
3523 =for apidoc sv_setsv
3525 Copies the contents of the source SV C<ssv> into the destination SV
3526 C<dsv>. The source SV may be destroyed if it is mortal, so don't use this
3527 function if the source SV needs to be reused. Does not handle 'set' magic.
3528 Loosely speaking, it performs a copy-by-value, obliterating any previous
3529 content of the destination.
3531 You probably want to use one of the assortment of wrappers, such as
3532 C<SvSetSV>, C<SvSetSV_nosteal>, C<SvSetMagicSV> and
3533 C<SvSetMagicSV_nosteal>.
3535 =for apidoc sv_setsv_flags
3537 Copies the contents of the source SV C<ssv> into the destination SV
3538 C<dsv>. The source SV may be destroyed if it is mortal, so don't use this
3539 function if the source SV needs to be reused. Does not handle 'set' magic.
3540 Loosely speaking, it performs a copy-by-value, obliterating any previous
3541 content of the destination.
3542 If the C<flags> parameter has the C<SV_GMAGIC> bit set, will C<mg_get> on
3543 C<ssv> if appropriate, else not. C<sv_setsv> and C<sv_setsv_nomg> are
3544 implemented in terms of this function.
3546 You probably want to use one of the assortment of wrappers, such as
3547 C<SvSetSV>, C<SvSetSV_nosteal>, C<SvSetMagicSV> and
3548 C<SvSetMagicSV_nosteal>.
3550 This is the primary function for copying scalars, and most other
3551 copy-ish functions and macros use this underneath.
3557 Perl_sv_setsv_flags(pTHX_ SV *dstr, register SV *sstr, I32 flags)
3559 register U32 sflags;
3565 SV_CHECK_THINKFIRST_COW_DROP(dstr);
3567 sstr = &PL_sv_undef;
3568 stype = SvTYPE(sstr);
3569 dtype = SvTYPE(dstr);
3573 /* There's a lot of redundancy below but we're going for speed here */
3578 if (dtype != SVt_PVGV) {
3579 (void)SvOK_off(dstr);
3587 sv_upgrade(dstr, SVt_IV);
3590 sv_upgrade(dstr, SVt_PVNV);
3594 sv_upgrade(dstr, SVt_PVIV);
3597 (void)SvIOK_only(dstr);
3598 SvIVX(dstr) = SvIVX(sstr);
3601 if (SvTAINTED(sstr))
3612 sv_upgrade(dstr, SVt_NV);
3617 sv_upgrade(dstr, SVt_PVNV);
3620 SvNVX(dstr) = SvNVX(sstr);
3621 (void)SvNOK_only(dstr);
3622 if (SvTAINTED(sstr))
3630 sv_upgrade(dstr, SVt_RV);
3631 else if (dtype == SVt_PVGV &&
3632 SvTYPE(SvRV(sstr)) == SVt_PVGV) {
3635 if (GvIMPORTED(dstr) != GVf_IMPORTED
3636 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3638 GvIMPORTED_on(dstr);
3649 sv_upgrade(dstr, SVt_PV);
3652 if (dtype < SVt_PVIV)
3653 sv_upgrade(dstr, SVt_PVIV);
3656 if (dtype < SVt_PVNV)
3657 sv_upgrade(dstr, SVt_PVNV);
3664 Perl_croak(aTHX_ "Bizarre copy of %s in %s", sv_reftype(sstr, 0),
3667 Perl_croak(aTHX_ "Bizarre copy of %s", sv_reftype(sstr, 0));
3671 if (dtype <= SVt_PVGV) {
3673 if (dtype != SVt_PVGV) {
3674 char *name = GvNAME(sstr);
3675 STRLEN len = GvNAMELEN(sstr);
3676 sv_upgrade(dstr, SVt_PVGV);
3677 sv_magic(dstr, dstr, PERL_MAGIC_glob, Nullch, 0);
3678 GvSTASH(dstr) = (HV*)SvREFCNT_inc(GvSTASH(sstr));
3679 GvNAME(dstr) = savepvn(name, len);
3680 GvNAMELEN(dstr) = len;
3681 SvFAKE_on(dstr); /* can coerce to non-glob */
3683 /* ahem, death to those who redefine active sort subs */
3684 else if (PL_curstackinfo->si_type == PERLSI_SORT
3685 && GvCV(dstr) && PL_sortcop == CvSTART(GvCV(dstr)))
3686 Perl_croak(aTHX_ "Can't redefine active sort subroutine %s",
3689 #ifdef GV_UNIQUE_CHECK
3690 if (GvUNIQUE((GV*)dstr)) {
3691 Perl_croak(aTHX_ PL_no_modify);
3695 (void)SvOK_off(dstr);
3696 GvINTRO_off(dstr); /* one-shot flag */
3698 GvGP(dstr) = gp_ref(GvGP(sstr));
3699 if (SvTAINTED(sstr))
3701 if (GvIMPORTED(dstr) != GVf_IMPORTED
3702 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3704 GvIMPORTED_on(dstr);
3712 if (SvGMAGICAL(sstr) && (flags & SV_GMAGIC)) {
3714 if ((int)SvTYPE(sstr) != stype) {
3715 stype = SvTYPE(sstr);
3716 if (stype == SVt_PVGV && dtype <= SVt_PVGV)
3720 if (stype == SVt_PVLV)
3721 (void)SvUPGRADE(dstr, SVt_PVNV);
3723 (void)SvUPGRADE(dstr, (U32)stype);
3726 sflags = SvFLAGS(sstr);
3728 if (sflags & SVf_ROK) {
3729 if (dtype >= SVt_PV) {
3730 if (dtype == SVt_PVGV) {
3731 SV *sref = SvREFCNT_inc(SvRV(sstr));
3733 int intro = GvINTRO(dstr);
3735 #ifdef GV_UNIQUE_CHECK
3736 if (GvUNIQUE((GV*)dstr)) {
3737 Perl_croak(aTHX_ PL_no_modify);
3742 GvINTRO_off(dstr); /* one-shot flag */
3743 GvLINE(dstr) = CopLINE(PL_curcop);
3744 GvEGV(dstr) = (GV*)dstr;
3747 switch (SvTYPE(sref)) {
3750 SAVESPTR(GvAV(dstr));
3752 dref = (SV*)GvAV(dstr);
3753 GvAV(dstr) = (AV*)sref;
3754 if (!GvIMPORTED_AV(dstr)
3755 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3757 GvIMPORTED_AV_on(dstr);
3762 SAVESPTR(GvHV(dstr));
3764 dref = (SV*)GvHV(dstr);
3765 GvHV(dstr) = (HV*)sref;
3766 if (!GvIMPORTED_HV(dstr)
3767 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3769 GvIMPORTED_HV_on(dstr);
3774 if (GvCVGEN(dstr) && GvCV(dstr) != (CV*)sref) {
3775 SvREFCNT_dec(GvCV(dstr));
3776 GvCV(dstr) = Nullcv;
3777 GvCVGEN(dstr) = 0; /* Switch off cacheness. */
3778 PL_sub_generation++;
3780 SAVESPTR(GvCV(dstr));
3783 dref = (SV*)GvCV(dstr);
3784 if (GvCV(dstr) != (CV*)sref) {
3785 CV* cv = GvCV(dstr);
3787 if (!GvCVGEN((GV*)dstr) &&
3788 (CvROOT(cv) || CvXSUB(cv)))
3790 /* ahem, death to those who redefine
3791 * active sort subs */
3792 if (PL_curstackinfo->si_type == PERLSI_SORT &&
3793 PL_sortcop == CvSTART(cv))
3795 "Can't redefine active sort subroutine %s",
3796 GvENAME((GV*)dstr));
3797 /* Redefining a sub - warning is mandatory if
3798 it was a const and its value changed. */
3799 if (ckWARN(WARN_REDEFINE)
3801 && (!CvCONST((CV*)sref)
3802 || sv_cmp(cv_const_sv(cv),
3803 cv_const_sv((CV*)sref)))))
3805 Perl_warner(aTHX_ packWARN(WARN_REDEFINE),
3807 ? "Constant subroutine %s::%s redefined"
3808 : "Subroutine %s::%s redefined",
3809 HvNAME(GvSTASH((GV*)dstr)),
3810 GvENAME((GV*)dstr));
3814 cv_ckproto(cv, (GV*)dstr,
3815 SvPOK(sref) ? SvPVX(sref) : Nullch);
3817 GvCV(dstr) = (CV*)sref;
3818 GvCVGEN(dstr) = 0; /* Switch off cacheness. */
3819 GvASSUMECV_on(dstr);
3820 PL_sub_generation++;
3822 if (!GvIMPORTED_CV(dstr)
3823 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3825 GvIMPORTED_CV_on(dstr);
3830 SAVESPTR(GvIOp(dstr));
3832 dref = (SV*)GvIOp(dstr);
3833 GvIOp(dstr) = (IO*)sref;
3837 SAVESPTR(GvFORM(dstr));
3839 dref = (SV*)GvFORM(dstr);
3840 GvFORM(dstr) = (CV*)sref;
3844 SAVESPTR(GvSV(dstr));
3846 dref = (SV*)GvSV(dstr);
3848 if (!GvIMPORTED_SV(dstr)
3849 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3851 GvIMPORTED_SV_on(dstr);
3859 if (SvTAINTED(sstr))
3864 (void)SvOOK_off(dstr); /* backoff */
3866 Safefree(SvPVX(dstr));
3867 SvLEN(dstr)=SvCUR(dstr)=0;
3870 (void)SvOK_off(dstr);
3871 SvRV(dstr) = SvREFCNT_inc(SvRV(sstr));
3873 if (sflags & SVp_NOK) {
3875 /* Only set the public OK flag if the source has public OK. */
3876 if (sflags & SVf_NOK)
3877 SvFLAGS(dstr) |= SVf_NOK;
3878 SvNVX(dstr) = SvNVX(sstr);
3880 if (sflags & SVp_IOK) {
3881 (void)SvIOKp_on(dstr);
3882 if (sflags & SVf_IOK)
3883 SvFLAGS(dstr) |= SVf_IOK;
3884 if (sflags & SVf_IVisUV)
3886 SvIVX(dstr) = SvIVX(sstr);
3888 if (SvAMAGIC(sstr)) {
3892 else if (sflags & SVp_POK) {
3896 * Check to see if we can just swipe the string. If so, it's a
3897 * possible small lose on short strings, but a big win on long ones.
3898 * It might even be a win on short strings if SvPVX(dstr)
3899 * has to be allocated and SvPVX(sstr) has to be freed.
3903 #ifdef PERL_COPY_ON_WRITE
3904 (sflags & (SVf_FAKE | SVf_READONLY)) != (SVf_FAKE | SVf_READONLY)
3908 (sflags & SVs_TEMP) && /* slated for free anyway? */
3909 !(sflags & SVf_OOK) && /* and not involved in OOK hack? */
3910 SvREFCNT(sstr) == 1 && /* and no other references to it? */
3911 SvLEN(sstr) && /* and really is a string */
3912 /* and won't be needed again, potentially */
3913 !(PL_op && PL_op->op_type == OP_AASSIGN))
3914 #ifdef PERL_COPY_ON_WRITE
3915 && !((sflags & CAN_COW_MASK) == CAN_COW_FLAGS
3916 && SvTYPE(sstr) >= SVt_PVIV)
3919 /* Failed the swipe test, and it's not a shared hash key either.
3920 Have to copy the string. */
3921 STRLEN len = SvCUR(sstr);
3922 SvGROW(dstr, len + 1); /* inlined from sv_setpvn */
3923 Move(SvPVX(sstr),SvPVX(dstr),len,char);
3924 SvCUR_set(dstr, len);
3925 *SvEND(dstr) = '\0';
3926 (void)SvPOK_only(dstr);
3928 /* If PERL_COPY_ON_WRITE is not defined, then isSwipe will always
3930 #ifdef PERL_COPY_ON_WRITE
3931 /* Either it's a shared hash key, or it's suitable for
3932 copy-on-write or we can swipe the string. */
3934 PerlIO_printf(Perl_debug_log,
3935 "Copy on write: sstr --> dstr\n");
3940 /* I believe I should acquire a global SV mutex if
3941 it's a COW sv (not a shared hash key) to stop
3942 it going un copy-on-write.
3943 If the source SV has gone un copy on write between up there
3944 and down here, then (assert() that) it is of the correct
3945 form to make it copy on write again */
3946 if ((sflags & (SVf_FAKE | SVf_READONLY))
3947 != (SVf_FAKE | SVf_READONLY)) {
3948 SvREADONLY_on(sstr);
3950 /* Make the source SV into a loop of 1.
3951 (about to become 2) */
3952 SV_COW_NEXT_SV(sstr) = sstr;
3956 /* Initial code is common. */
3957 if (SvPVX(dstr)) { /* we know that dtype >= SVt_PV */
3959 SvFLAGS(dstr) &= ~SVf_OOK;
3960 Safefree(SvPVX(dstr) - SvIVX(dstr));
3962 else if (SvLEN(dstr))
3963 Safefree(SvPVX(dstr));
3965 (void)SvPOK_only(dstr);
3967 #ifdef PERL_COPY_ON_WRITE
3969 /* making another shared SV. */
3970 STRLEN cur = SvCUR(sstr);
3971 STRLEN len = SvLEN(sstr);
3973 /* SvIsCOW_normal */
3974 /* splice us in between source and next-after-source. */
3975 SV_COW_NEXT_SV(dstr) = SV_COW_NEXT_SV(sstr);
3976 SV_COW_NEXT_SV(sstr) = dstr;
3977 SvPV_set(dstr, SvPVX(sstr));
3979 /* SvIsCOW_shared_hash */
3980 UV hash = SvUVX(sstr);
3981 DEBUG_C(PerlIO_printf(Perl_debug_log,
3982 "Copy on write: Sharing hash\n"));
3984 sharepvn(SvPVX(sstr),
3985 (sflags & SVf_UTF8?-cur:cur), hash));
3990 SvREADONLY_on(dstr);
3992 /* Relesase a global SV mutex. */
3996 { /* Passes the swipe test. */
3997 SvPV_set(dstr, SvPVX(sstr));
3998 SvLEN_set(dstr, SvLEN(sstr));
3999 SvCUR_set(dstr, SvCUR(sstr));
4002 (void)SvOK_off(sstr); /* NOTE: nukes most SvFLAGS on sstr */
4003 SvPV_set(sstr, Nullch);
4009 if (sflags & SVf_UTF8)
4012 if (sflags & SVp_NOK) {
4014 if (sflags & SVf_NOK)
4015 SvFLAGS(dstr) |= SVf_NOK;
4016 SvNVX(dstr) = SvNVX(sstr);
4018 if (sflags & SVp_IOK) {
4019 (void)SvIOKp_on(dstr);
4020 if (sflags & SVf_IOK)
4021 SvFLAGS(dstr) |= SVf_IOK;
4022 if (sflags & SVf_IVisUV)
4024 SvIVX(dstr) = SvIVX(sstr);
4027 MAGIC *mg = SvMAGIC(sstr);
4028 sv_magicext(dstr, NULL, PERL_MAGIC_vstring, NULL,
4029 mg->mg_ptr, mg->mg_len);
4030 SvRMAGICAL_on(dstr);
4033 else if (sflags & SVp_IOK) {
4034 if (sflags & SVf_IOK)
4035 (void)SvIOK_only(dstr);
4037 (void)SvOK_off(dstr);
4038 (void)SvIOKp_on(dstr);
4040 /* XXXX Do we want to set IsUV for IV(ROK)? Be extra safe... */
4041 if (sflags & SVf_IVisUV)
4043 SvIVX(dstr) = SvIVX(sstr);
4044 if (sflags & SVp_NOK) {
4045 if (sflags & SVf_NOK)
4046 (void)SvNOK_on(dstr);
4048 (void)SvNOKp_on(dstr);
4049 SvNVX(dstr) = SvNVX(sstr);
4052 else if (sflags & SVp_NOK) {
4053 if (sflags & SVf_NOK)
4054 (void)SvNOK_only(dstr);
4056 (void)SvOK_off(dstr);
4059 SvNVX(dstr) = SvNVX(sstr);
4062 if (dtype == SVt_PVGV) {
4063 if (ckWARN(WARN_MISC))
4064 Perl_warner(aTHX_ packWARN(WARN_MISC), "Undefined value assigned to typeglob");
4067 (void)SvOK_off(dstr);
4069 if (SvTAINTED(sstr))
4074 =for apidoc sv_setsv_mg
4076 Like C<sv_setsv>, but also handles 'set' magic.
4082 Perl_sv_setsv_mg(pTHX_ SV *dstr, register SV *sstr)
4084 sv_setsv(dstr,sstr);
4089 =for apidoc sv_setpvn
4091 Copies a string into an SV. The C<len> parameter indicates the number of
4092 bytes to be copied. Does not handle 'set' magic. See C<sv_setpvn_mg>.
4098 Perl_sv_setpvn(pTHX_ register SV *sv, register const char *ptr, register STRLEN len)
4100 register char *dptr;
4102 SV_CHECK_THINKFIRST_COW_DROP(sv);
4108 /* len is STRLEN which is unsigned, need to copy to signed */
4111 Perl_croak(aTHX_ "panic: sv_setpvn called with negative strlen");
4113 (void)SvUPGRADE(sv, SVt_PV);
4115 SvGROW(sv, len + 1);
4117 Move(ptr,dptr,len,char);
4120 (void)SvPOK_only_UTF8(sv); /* validate pointer */
4125 =for apidoc sv_setpvn_mg
4127 Like C<sv_setpvn>, but also handles 'set' magic.
4133 Perl_sv_setpvn_mg(pTHX_ register SV *sv, register const char *ptr, register STRLEN len)
4135 sv_setpvn(sv,ptr,len);
4140 =for apidoc sv_setpv
4142 Copies a string into an SV. The string must be null-terminated. Does not
4143 handle 'set' magic. See C<sv_setpv_mg>.
4149 Perl_sv_setpv(pTHX_ register SV *sv, register const char *ptr)
4151 register STRLEN len;
4153 SV_CHECK_THINKFIRST_COW_DROP(sv);
4159 (void)SvUPGRADE(sv, SVt_PV);
4161 SvGROW(sv, len + 1);
4162 Move(ptr,SvPVX(sv),len+1,char);
4164 (void)SvPOK_only_UTF8(sv); /* validate pointer */
4169 =for apidoc sv_setpv_mg
4171 Like C<sv_setpv>, but also handles 'set' magic.
4177 Perl_sv_setpv_mg(pTHX_ register SV *sv, register const char *ptr)
4184 =for apidoc sv_usepvn
4186 Tells an SV to use C<ptr> to find its string value. Normally the string is
4187 stored inside the SV but sv_usepvn allows the SV to use an outside string.
4188 The C<ptr> should point to memory that was allocated by C<malloc>. The
4189 string length, C<len>, must be supplied. This function will realloc the
4190 memory pointed to by C<ptr>, so that pointer should not be freed or used by
4191 the programmer after giving it to sv_usepvn. Does not handle 'set' magic.
4192 See C<sv_usepvn_mg>.
4198 Perl_sv_usepvn(pTHX_ register SV *sv, register char *ptr, register STRLEN len)
4200 SV_CHECK_THINKFIRST_COW_DROP(sv);
4201 (void)SvUPGRADE(sv, SVt_PV);
4206 (void)SvOOK_off(sv);
4207 if (SvPVX(sv) && SvLEN(sv))
4208 Safefree(SvPVX(sv));
4209 Renew(ptr, len+1, char);
4212 SvLEN_set(sv, len+1);
4214 (void)SvPOK_only_UTF8(sv); /* validate pointer */
4219 =for apidoc sv_usepvn_mg
4221 Like C<sv_usepvn>, but also handles 'set' magic.
4227 Perl_sv_usepvn_mg(pTHX_ register SV *sv, register char *ptr, register STRLEN len)
4229 sv_usepvn(sv,ptr,len);
4233 #ifdef PERL_COPY_ON_WRITE
4234 /* Need to do this *after* making the SV normal, as we need the buffer
4235 pointer to remain valid until after we've copied it. If we let go too early,
4236 another thread could invalidate it by unsharing last of the same hash key
4237 (which it can do by means other than releasing copy-on-write Svs)
4238 or by changing the other copy-on-write SVs in the loop. */
4240 S_sv_release_COW(pTHX_ register SV *sv, char *pvx, STRLEN cur, STRLEN len,
4241 U32 hash, SV *after)
4243 if (len) { /* this SV was SvIsCOW_normal(sv) */
4244 /* we need to find the SV pointing to us. */
4245 SV *current = SV_COW_NEXT_SV(after);
4247 if (current == sv) {
4248 /* The SV we point to points back to us (there were only two of us
4250 Hence other SV is no longer copy on write either. */
4252 SvREADONLY_off(after);
4254 /* We need to follow the pointers around the loop. */
4256 while ((next = SV_COW_NEXT_SV(current)) != sv) {
4259 /* don't loop forever if the structure is bust, and we have
4260 a pointer into a closed loop. */
4261 assert (current != after);
4263 /* Make the SV before us point to the SV after us. */
4264 SV_COW_NEXT_SV(current) = after;
4267 unsharepvn(pvx, SvUTF8(sv) ? -(I32)cur : cur, hash);
4272 Perl_sv_release_IVX(pTHX_ register SV *sv)
4275 sv_force_normal_flags(sv, 0);
4276 return SvOOK_off(sv);
4280 =for apidoc sv_force_normal_flags
4282 Undo various types of fakery on an SV: if the PV is a shared string, make
4283 a private copy; if we're a ref, stop refing; if we're a glob, downgrade to
4284 an xpvmg; if we're a copy-on-write scalar, this is the on-write time when
4285 we do the copy, and is also used locally. If C<SV_COW_DROP_PV> is set
4286 then a copy-on-write scalar drops its PV buffer (if any) and becomes
4287 SvPOK_off rather than making a copy. (Used where this scalar is about to be
4288 set to some other value. In addtion, the C<flags> parameter gets passed to
4289 C<sv_unref_flags()> when unrefing. C<sv_force_normal> calls this function
4290 with flags set to 0.
4296 Perl_sv_force_normal_flags(pTHX_ register SV *sv, U32 flags)
4298 #ifdef PERL_COPY_ON_WRITE
4299 if (SvREADONLY(sv)) {
4300 /* At this point I believe I should acquire a global SV mutex. */
4302 char *pvx = SvPVX(sv);
4303 STRLEN len = SvLEN(sv);
4304 STRLEN cur = SvCUR(sv);
4305 U32 hash = SvUVX(sv);
4306 SV *next = SV_COW_NEXT_SV(sv); /* next COW sv in the loop. */
4308 PerlIO_printf(Perl_debug_log,
4309 "Copy on write: Force normal %ld\n",
4315 /* This SV doesn't own the buffer, so need to New() a new one: */
4318 if (flags & SV_COW_DROP_PV) {
4319 /* OK, so we don't need to copy our buffer. */
4322 SvGROW(sv, cur + 1);
4323 Move(pvx,SvPVX(sv),cur,char);
4327 S_sv_release_COW(sv, pvx, cur, len, hash, next);
4332 else if (PL_curcop != &PL_compiling)
4333 Perl_croak(aTHX_ PL_no_modify);
4334 /* At this point I believe that I can drop the global SV mutex. */
4337 if (SvREADONLY(sv)) {
4339 char *pvx = SvPVX(sv);
4340 STRLEN len = SvCUR(sv);
4341 U32 hash = SvUVX(sv);
4342 SvGROW(sv, len + 1);
4343 Move(pvx,SvPVX(sv),len,char);
4347 unsharepvn(pvx, SvUTF8(sv) ? -(I32)len : len, hash);
4349 else if (PL_curcop != &PL_compiling)
4350 Perl_croak(aTHX_ PL_no_modify);
4354 sv_unref_flags(sv, flags);
4355 else if (SvFAKE(sv) && SvTYPE(sv) == SVt_PVGV)
4360 =for apidoc sv_force_normal
4362 Undo various types of fakery on an SV: if the PV is a shared string, make
4363 a private copy; if we're a ref, stop refing; if we're a glob, downgrade to
4364 an xpvmg. See also C<sv_force_normal_flags>.
4370 Perl_sv_force_normal(pTHX_ register SV *sv)
4372 sv_force_normal_flags(sv, 0);
4378 Efficient removal of characters from the beginning of the string buffer.
4379 SvPOK(sv) must be true and the C<ptr> must be a pointer to somewhere inside
4380 the string buffer. The C<ptr> becomes the first character of the adjusted
4381 string. Uses the "OOK hack".
4387 Perl_sv_chop(pTHX_ register SV *sv, register char *ptr)
4389 register STRLEN delta;
4391 if (!ptr || !SvPOKp(sv))
4393 SV_CHECK_THINKFIRST(sv);
4394 if (SvTYPE(sv) < SVt_PVIV)
4395 sv_upgrade(sv,SVt_PVIV);
4398 if (!SvLEN(sv)) { /* make copy of shared string */
4399 char *pvx = SvPVX(sv);
4400 STRLEN len = SvCUR(sv);
4401 SvGROW(sv, len + 1);
4402 Move(pvx,SvPVX(sv),len,char);
4406 SvFLAGS(sv) |= SVf_OOK;
4408 SvFLAGS(sv) &= ~(SVf_IOK|SVf_NOK|SVp_IOK|SVp_NOK|SVf_IVisUV);
4409 delta = ptr - SvPVX(sv);
4417 =for apidoc sv_catpvn
4419 Concatenates the string onto the end of the string which is in the SV. The
4420 C<len> indicates number of bytes to copy. If the SV has the UTF8
4421 status set, then the bytes appended should be valid UTF8.
4422 Handles 'get' magic, but not 'set' magic. See C<sv_catpvn_mg>.
4424 =for apidoc sv_catpvn_flags
4426 Concatenates the string onto the end of the string which is in the SV. The
4427 C<len> indicates number of bytes to copy. If the SV has the UTF8
4428 status set, then the bytes appended should be valid UTF8.
4429 If C<flags> has C<SV_GMAGIC> bit set, will C<mg_get> on C<dsv> if
4430 appropriate, else not. C<sv_catpvn> and C<sv_catpvn_nomg> are implemented
4431 in terms of this function.
4437 Perl_sv_catpvn_flags(pTHX_ register SV *dsv, register const char *sstr, register STRLEN slen, I32 flags)
4442 dstr = SvPV_force_flags(dsv, dlen, flags);
4443 SvGROW(dsv, dlen + slen + 1);
4446 Move(sstr, SvPVX(dsv) + dlen, slen, char);
4449 (void)SvPOK_only_UTF8(dsv); /* validate pointer */
4454 =for apidoc sv_catpvn_mg
4456 Like C<sv_catpvn>, but also handles 'set' magic.
4462 Perl_sv_catpvn_mg(pTHX_ register SV *sv, register const char *ptr, register STRLEN len)
4464 sv_catpvn(sv,ptr,len);
4469 =for apidoc sv_catsv
4471 Concatenates the string from SV C<ssv> onto the end of the string in
4472 SV C<dsv>. Modifies C<dsv> but not C<ssv>. Handles 'get' magic, but
4473 not 'set' magic. See C<sv_catsv_mg>.
4475 =for apidoc sv_catsv_flags
4477 Concatenates the string from SV C<ssv> onto the end of the string in
4478 SV C<dsv>. Modifies C<dsv> but not C<ssv>. If C<flags> has C<SV_GMAGIC>
4479 bit set, will C<mg_get> on the SVs if appropriate, else not. C<sv_catsv>
4480 and C<sv_catsv_nomg> are implemented in terms of this function.
4485 Perl_sv_catsv_flags(pTHX_ SV *dsv, register SV *ssv, I32 flags)
4491 if ((spv = SvPV(ssv, slen))) {
4492 /* sutf8 and dutf8 were type bool, but under USE_ITHREADS,
4493 gcc version 2.95.2 20000220 (Debian GNU/Linux) for
4494 Linux xxx 2.2.17 on sparc64 with gcc -O2, we erroneously
4495 get dutf8 = 0x20000000, (i.e. SVf_UTF8) even though
4496 dsv->sv_flags doesn't have that bit set.
4497 Andy Dougherty 12 Oct 2001
4499 I32 sutf8 = DO_UTF8(ssv);
4502 if (SvGMAGICAL(dsv) && (flags & SV_GMAGIC))
4504 dutf8 = DO_UTF8(dsv);
4506 if (dutf8 != sutf8) {
4508 /* Not modifying source SV, so taking a temporary copy. */
4509 SV* csv = sv_2mortal(newSVpvn(spv, slen));
4511 sv_utf8_upgrade(csv);
4512 spv = SvPV(csv, slen);
4515 sv_utf8_upgrade_nomg(dsv);
4517 sv_catpvn_nomg(dsv, spv, slen);
4522 =for apidoc sv_catsv_mg
4524 Like C<sv_catsv>, but also handles 'set' magic.
4530 Perl_sv_catsv_mg(pTHX_ SV *dsv, register SV *ssv)
4537 =for apidoc sv_catpv
4539 Concatenates the string onto the end of the string which is in the SV.
4540 If the SV has the UTF8 status set, then the bytes appended should be
4541 valid UTF8. Handles 'get' magic, but not 'set' magic. See C<sv_catpv_mg>.
4546 Perl_sv_catpv(pTHX_ register SV *sv, register const char *ptr)
4548 register STRLEN len;
4554 junk = SvPV_force(sv, tlen);
4556 SvGROW(sv, tlen + len + 1);
4559 Move(ptr,SvPVX(sv)+tlen,len+1,char);
4561 (void)SvPOK_only_UTF8(sv); /* validate pointer */
4566 =for apidoc sv_catpv_mg
4568 Like C<sv_catpv>, but also handles 'set' magic.
4574 Perl_sv_catpv_mg(pTHX_ register SV *sv, register const char *ptr)
4583 Create a new null SV, or if len > 0, create a new empty SVt_PV type SV
4584 with an initial PV allocation of len+1. Normally accessed via the C<NEWSV>
4591 Perl_newSV(pTHX_ STRLEN len)
4597 sv_upgrade(sv, SVt_PV);
4598 SvGROW(sv, len + 1);
4603 =for apidoc sv_magicext
4605 Adds magic to an SV, upgrading it if necessary. Applies the
4606 supplied vtable and returns pointer to the magic added.
4608 Note that sv_magicext will allow things that sv_magic will not.
4609 In particular you can add magic to SvREADONLY SVs and and more than
4610 one instance of the same 'how'
4612 I C<namelen> is greater then zero then a savepvn() I<copy> of C<name> is stored,
4613 if C<namelen> is zero then C<name> is stored as-is and - as another special
4614 case - if C<(name && namelen == HEf_SVKEY)> then C<name> is assumed to contain
4615 an C<SV*> and has its REFCNT incremented
4617 (This is now used as a subroutine by sv_magic.)
4622 Perl_sv_magicext(pTHX_ SV* sv, SV* obj, int how, MGVTBL *vtable,
4623 const char* name, I32 namlen)
4627 if (SvTYPE(sv) < SVt_PVMG) {
4628 (void)SvUPGRADE(sv, SVt_PVMG);
4630 Newz(702,mg, 1, MAGIC);
4631 mg->mg_moremagic = SvMAGIC(sv);
4634 /* Some magic sontains a reference loop, where the sv and object refer to
4635 each other. To prevent a reference loop that would prevent such
4636 objects being freed, we look for such loops and if we find one we
4637 avoid incrementing the object refcount.
4639 Note we cannot do this to avoid self-tie loops as intervening RV must
4640 have its REFCNT incremented to keep it in existence - instead we could
4641 special case them in sv_free() -- NI-S
4644 if (!obj || obj == sv ||
4645 how == PERL_MAGIC_arylen ||
4646 how == PERL_MAGIC_qr ||
4647 (SvTYPE(obj) == SVt_PVGV &&
4648 (GvSV(obj) == sv || GvHV(obj) == (HV*)sv || GvAV(obj) == (AV*)sv ||
4649 GvCV(obj) == (CV*)sv || GvIOp(obj) == (IO*)sv ||
4650 GvFORM(obj) == (CV*)sv)))
4655 mg->mg_obj = SvREFCNT_inc(obj);
4656 mg->mg_flags |= MGf_REFCOUNTED;
4659 mg->mg_len = namlen;
4662 mg->mg_ptr = savepvn(name, namlen);
4663 else if (namlen == HEf_SVKEY)
4664 mg->mg_ptr = (char*)SvREFCNT_inc((SV*)name);
4666 mg->mg_ptr = (char *) name;
4668 mg->mg_virtual = vtable;
4672 SvFLAGS(sv) &= ~(SVf_IOK|SVf_NOK|SVf_POK);
4677 =for apidoc sv_magic
4679 Adds magic to an SV. First upgrades C<sv> to type C<SVt_PVMG> if necessary,
4680 then adds a new magic item of type C<how> to the head of the magic list.
4686 Perl_sv_magic(pTHX_ register SV *sv, SV *obj, int how, const char *name, I32 namlen)
4691 #ifdef PERL_COPY_ON_WRITE
4693 sv_force_normal_flags(sv, 0);
4695 if (SvREADONLY(sv)) {
4696 if (PL_curcop != &PL_compiling
4697 && how != PERL_MAGIC_regex_global
4698 && how != PERL_MAGIC_bm
4699 && how != PERL_MAGIC_fm
4700 && how != PERL_MAGIC_sv
4703 Perl_croak(aTHX_ PL_no_modify);
4706 if (SvMAGICAL(sv) || (how == PERL_MAGIC_taint && SvTYPE(sv) >= SVt_PVMG)) {
4707 if (SvMAGIC(sv) && (mg = mg_find(sv, how))) {
4708 /* sv_magic() refuses to add a magic of the same 'how' as an
4711 if (how == PERL_MAGIC_taint)
4719 vtable = &PL_vtbl_sv;
4721 case PERL_MAGIC_overload:
4722 vtable = &PL_vtbl_amagic;
4724 case PERL_MAGIC_overload_elem:
4725 vtable = &PL_vtbl_amagicelem;
4727 case PERL_MAGIC_overload_table:
4728 vtable = &PL_vtbl_ovrld;
4731 vtable = &PL_vtbl_bm;
4733 case PERL_MAGIC_regdata:
4734 vtable = &PL_vtbl_regdata;
4736 case PERL_MAGIC_regdatum:
4737 vtable = &PL_vtbl_regdatum;
4739 case PERL_MAGIC_env:
4740 vtable = &PL_vtbl_env;
4743 vtable = &PL_vtbl_fm;
4745 case PERL_MAGIC_envelem:
4746 vtable = &PL_vtbl_envelem;
4748 case PERL_MAGIC_regex_global:
4749 vtable = &PL_vtbl_mglob;
4751 case PERL_MAGIC_isa:
4752 vtable = &PL_vtbl_isa;
4754 case PERL_MAGIC_isaelem:
4755 vtable = &PL_vtbl_isaelem;
4757 case PERL_MAGIC_nkeys:
4758 vtable = &PL_vtbl_nkeys;
4760 case PERL_MAGIC_dbfile:
4763 case PERL_MAGIC_dbline:
4764 vtable = &PL_vtbl_dbline;
4766 #ifdef USE_5005THREADS
4767 case PERL_MAGIC_mutex:
4768 vtable = &PL_vtbl_mutex;
4770 #endif /* USE_5005THREADS */
4771 #ifdef USE_LOCALE_COLLATE
4772 case PERL_MAGIC_collxfrm:
4773 vtable = &PL_vtbl_collxfrm;
4775 #endif /* USE_LOCALE_COLLATE */
4776 case PERL_MAGIC_tied:
4777 vtable = &PL_vtbl_pack;
4779 case PERL_MAGIC_tiedelem:
4780 case PERL_MAGIC_tiedscalar:
4781 vtable = &PL_vtbl_packelem;
4784 vtable = &PL_vtbl_regexp;
4786 case PERL_MAGIC_sig:
4787 vtable = &PL_vtbl_sig;
4789 case PERL_MAGIC_sigelem:
4790 vtable = &PL_vtbl_sigelem;
4792 case PERL_MAGIC_taint:
4793 vtable = &PL_vtbl_taint;
4795 case PERL_MAGIC_uvar:
4796 vtable = &PL_vtbl_uvar;
4798 case PERL_MAGIC_vec:
4799 vtable = &PL_vtbl_vec;
4801 case PERL_MAGIC_substr:
4802 vtable = &PL_vtbl_substr;
4804 case PERL_MAGIC_defelem:
4805 vtable = &PL_vtbl_defelem;
4807 case PERL_MAGIC_glob:
4808 vtable = &PL_vtbl_glob;
4810 case PERL_MAGIC_arylen:
4811 vtable = &PL_vtbl_arylen;
4813 case PERL_MAGIC_pos:
4814 vtable = &PL_vtbl_pos;
4816 case PERL_MAGIC_backref:
4817 vtable = &PL_vtbl_backref;
4819 case PERL_MAGIC_ext:
4820 /* Reserved for use by extensions not perl internals. */
4821 /* Useful for attaching extension internal data to perl vars. */
4822 /* Note that multiple extensions may clash if magical scalars */
4823 /* etc holding private data from one are passed to another. */
4826 Perl_croak(aTHX_ "Don't know how to handle magic of type \\%o", how);
4829 /* Rest of work is done else where */
4830 mg = sv_magicext(sv,obj,how,vtable,name,namlen);
4833 case PERL_MAGIC_taint:
4836 case PERL_MAGIC_ext:
4837 case PERL_MAGIC_dbfile:
4844 =for apidoc sv_unmagic
4846 Removes all magic of type C<type> from an SV.
4852 Perl_sv_unmagic(pTHX_ SV *sv, int type)
4856 if (SvTYPE(sv) < SVt_PVMG || !SvMAGIC(sv))
4859 for (mg = *mgp; mg; mg = *mgp) {
4860 if (mg->mg_type == type) {
4861 MGVTBL* vtbl = mg->mg_virtual;
4862 *mgp = mg->mg_moremagic;
4863 if (vtbl && vtbl->svt_free)
4864 CALL_FPTR(vtbl->svt_free)(aTHX_ sv, mg);
4865 if (mg->mg_ptr && mg->mg_type != PERL_MAGIC_regex_global) {
4867 Safefree(mg->mg_ptr);
4868 else if (mg->mg_len == HEf_SVKEY)
4869 SvREFCNT_dec((SV*)mg->mg_ptr);
4871 if (mg->mg_flags & MGf_REFCOUNTED)
4872 SvREFCNT_dec(mg->mg_obj);
4876 mgp = &mg->mg_moremagic;
4880 SvFLAGS(sv) |= (SvFLAGS(sv) & (SVp_NOK|SVp_POK)) >> PRIVSHIFT;
4887 =for apidoc sv_rvweaken
4889 Weaken a reference: set the C<SvWEAKREF> flag on this RV; give the
4890 referred-to SV C<PERL_MAGIC_backref> magic if it hasn't already; and
4891 push a back-reference to this RV onto the array of backreferences
4892 associated with that magic.
4898 Perl_sv_rvweaken(pTHX_ SV *sv)
4901 if (!SvOK(sv)) /* let undefs pass */
4904 Perl_croak(aTHX_ "Can't weaken a nonreference");
4905 else if (SvWEAKREF(sv)) {
4906 if (ckWARN(WARN_MISC))
4907 Perl_warner(aTHX_ packWARN(WARN_MISC), "Reference is already weak");
4911 sv_add_backref(tsv, sv);
4917 /* Give tsv backref magic if it hasn't already got it, then push a
4918 * back-reference to sv onto the array associated with the backref magic.
4922 S_sv_add_backref(pTHX_ SV *tsv, SV *sv)
4926 if (SvMAGICAL(tsv) && (mg = mg_find(tsv, PERL_MAGIC_backref)))
4927 av = (AV*)mg->mg_obj;
4930 sv_magic(tsv, (SV*)av, PERL_MAGIC_backref, NULL, 0);
4931 SvREFCNT_dec(av); /* for sv_magic */
4936 /* delete a back-reference to ourselves from the backref magic associated
4937 * with the SV we point to.
4941 S_sv_del_backref(pTHX_ SV *sv)
4948 if (!SvMAGICAL(tsv) || !(mg = mg_find(tsv, PERL_MAGIC_backref)))
4949 Perl_croak(aTHX_ "panic: del_backref");
4950 av = (AV *)mg->mg_obj;
4955 svp[i] = &PL_sv_undef; /* XXX */
4962 =for apidoc sv_insert
4964 Inserts a string at the specified offset/length within the SV. Similar to
4965 the Perl substr() function.
4971 Perl_sv_insert(pTHX_ SV *bigstr, STRLEN offset, STRLEN len, char *little, STRLEN littlelen)
4975 register char *midend;
4976 register char *bigend;
4982 Perl_croak(aTHX_ "Can't modify non-existent substring");
4983 SvPV_force(bigstr, curlen);
4984 (void)SvPOK_only_UTF8(bigstr);
4985 if (offset + len > curlen) {
4986 SvGROW(bigstr, offset+len+1);
4987 Zero(SvPVX(bigstr)+curlen, offset+len-curlen, char);
4988 SvCUR_set(bigstr, offset+len);
4992 i = littlelen - len;
4993 if (i > 0) { /* string might grow */
4994 big = SvGROW(bigstr, SvCUR(bigstr) + i + 1);
4995 mid = big + offset + len;
4996 midend = bigend = big + SvCUR(bigstr);
4999 while (midend > mid) /* shove everything down */
5000 *--bigend = *--midend;
5001 Move(little,big+offset,littlelen,char);
5007 Move(little,SvPVX(bigstr)+offset,len,char);
5012 big = SvPVX(bigstr);
5015 bigend = big + SvCUR(bigstr);
5017 if (midend > bigend)
5018 Perl_croak(aTHX_ "panic: sv_insert");
5020 if (mid - big > bigend - midend) { /* faster to shorten from end */
5022 Move(little, mid, littlelen,char);
5025 i = bigend - midend;
5027 Move(midend, mid, i,char);
5031 SvCUR_set(bigstr, mid - big);
5034 else if ((i = mid - big)) { /* faster from front */
5035 midend -= littlelen;
5037 sv_chop(bigstr,midend-i);
5042 Move(little, mid, littlelen,char);
5044 else if (littlelen) {
5045 midend -= littlelen;
5046 sv_chop(bigstr,midend);
5047 Move(little,midend,littlelen,char);
5050 sv_chop(bigstr,midend);
5056 =for apidoc sv_replace
5058 Make the first argument a copy of the second, then delete the original.
5059 The target SV physically takes over ownership of the body of the source SV
5060 and inherits its flags; however, the target keeps any magic it owns,
5061 and any magic in the source is discarded.
5062 Note that this is a rather specialist SV copying operation; most of the
5063 time you'll want to use C<sv_setsv> or one of its many macro front-ends.
5069 Perl_sv_replace(pTHX_ register SV *sv, register SV *nsv)
5071 U32 refcnt = SvREFCNT(sv);
5072 SV_CHECK_THINKFIRST_COW_DROP(sv);
5073 if (SvREFCNT(nsv) != 1 && ckWARN_d(WARN_INTERNAL))
5074 Perl_warner(aTHX_ packWARN(WARN_INTERNAL), "Reference miscount in sv_replace()");
5075 if (SvMAGICAL(sv)) {
5079 sv_upgrade(nsv, SVt_PVMG);
5080 SvMAGIC(nsv) = SvMAGIC(sv);
5081 SvFLAGS(nsv) |= SvMAGICAL(sv);
5087 assert(!SvREFCNT(sv));
5088 StructCopy(nsv,sv,SV);
5089 SvREFCNT(sv) = refcnt;
5090 SvFLAGS(nsv) |= SVTYPEMASK; /* Mark as freed */
5095 =for apidoc sv_clear
5097 Clear an SV: call any destructors, free up any memory used by the body,
5098 and free the body itself. The SV's head is I<not> freed, although
5099 its type is set to all 1's so that it won't inadvertently be assumed
5100 to be live during global destruction etc.
5101 This function should only be called when REFCNT is zero. Most of the time
5102 you'll want to call C<sv_free()> (or its macro wrapper C<SvREFCNT_dec>)
5109 Perl_sv_clear(pTHX_ register SV *sv)
5113 assert(SvREFCNT(sv) == 0);
5116 if (PL_defstash) { /* Still have a symbol table? */
5121 Zero(&tmpref, 1, SV);
5122 sv_upgrade(&tmpref, SVt_RV);
5124 SvREADONLY_on(&tmpref); /* DESTROY() could be naughty */
5125 SvREFCNT(&tmpref) = 1;
5128 stash = SvSTASH(sv);
5129 destructor = StashHANDLER(stash,DESTROY);
5132 PUSHSTACKi(PERLSI_DESTROY);
5133 SvRV(&tmpref) = SvREFCNT_inc(sv);
5138 call_sv((SV*)destructor, G_DISCARD|G_EVAL|G_KEEPERR);
5144 } while (SvOBJECT(sv) && SvSTASH(sv) != stash);
5146 del_XRV(SvANY(&tmpref));
5149 if (PL_in_clean_objs)
5150 Perl_croak(aTHX_ "DESTROY created new reference to dead object '%s'",
5152 /* DESTROY gave object new lease on life */
5158 SvREFCNT_dec(SvSTASH(sv)); /* possibly of changed persuasion */
5159 SvOBJECT_off(sv); /* Curse the object. */
5160 if (SvTYPE(sv) != SVt_PVIO)
5161 --PL_sv_objcount; /* XXX Might want something more general */
5164 if (SvTYPE(sv) >= SVt_PVMG) {
5167 if (SvFLAGS(sv) & SVpad_TYPED)
5168 SvREFCNT_dec(SvSTASH(sv));
5171 switch (SvTYPE(sv)) {
5174 IoIFP(sv) != PerlIO_stdin() &&
5175 IoIFP(sv) != PerlIO_stdout() &&
5176 IoIFP(sv) != PerlIO_stderr())
5178 io_close((IO*)sv, FALSE);
5180 if (IoDIRP(sv) && !(IoFLAGS(sv) & IOf_FAKE_DIRP))
5181 PerlDir_close(IoDIRP(sv));
5182 IoDIRP(sv) = (DIR*)NULL;
5183 Safefree(IoTOP_NAME(sv));
5184 Safefree(IoFMT_NAME(sv));
5185 Safefree(IoBOTTOM_NAME(sv));
5200 SvREFCNT_dec(LvTARG(sv));
5204 Safefree(GvNAME(sv));
5205 /* cannot decrease stash refcount yet, as we might recursively delete
5206 ourselves when the refcnt drops to zero. Delay SvREFCNT_dec
5207 of stash until current sv is completely gone.
5208 -- JohnPC, 27 Mar 1998 */
5209 stash = GvSTASH(sv);
5215 (void)SvOOK_off(sv);
5223 SvREFCNT_dec(SvRV(sv));
5225 #ifdef PERL_COPY_ON_WRITE
5226 else if (SvPVX(sv)) {
5228 /* I believe I need to grab the global SV mutex here and
5229 then recheck the COW status. */
5231 PerlIO_printf(Perl_debug_log, "Copy on write: clear\n");
5234 S_sv_release_COW(sv, SvPVX(sv), SvCUR(sv), SvLEN(sv),
5235 SvUVX(sv), SV_COW_NEXT_SV(sv));
5236 /* And drop it here. */
5238 } else if (SvLEN(sv)) {
5239 Safefree(SvPVX(sv));
5243 else if (SvPVX(sv) && SvLEN(sv))
5244 Safefree(SvPVX(sv));
5245 else if (SvPVX(sv) && SvREADONLY(sv) && SvFAKE(sv)) {
5246 unsharepvn(SvPVX(sv),
5247 SvUTF8(sv) ? -(I32)SvCUR(sv) : SvCUR(sv),
5261 switch (SvTYPE(sv)) {
5277 del_XPVIV(SvANY(sv));
5280 del_XPVNV(SvANY(sv));
5283 del_XPVMG(SvANY(sv));
5286 del_XPVLV(SvANY(sv));
5289 del_XPVAV(SvANY(sv));
5292 del_XPVHV(SvANY(sv));
5295 del_XPVCV(SvANY(sv));
5298 del_XPVGV(SvANY(sv));
5299 /* code duplication for increased performance. */
5300 SvFLAGS(sv) &= SVf_BREAK;
5301 SvFLAGS(sv) |= SVTYPEMASK;
5302 /* decrease refcount of the stash that owns this GV, if any */
5304 SvREFCNT_dec(stash);
5305 return; /* not break, SvFLAGS reset already happened */
5307 del_XPVBM(SvANY(sv));
5310 del_XPVFM(SvANY(sv));
5313 del_XPVIO(SvANY(sv));
5316 SvFLAGS(sv) &= SVf_BREAK;
5317 SvFLAGS(sv) |= SVTYPEMASK;
5321 =for apidoc sv_newref
5323 Increment an SV's reference count. Use the C<SvREFCNT_inc()> wrapper
5330 Perl_sv_newref(pTHX_ SV *sv)
5333 ATOMIC_INC(SvREFCNT(sv));
5340 Decrement an SV's reference count, and if it drops to zero, call
5341 C<sv_clear> to invoke destructors and free up any memory used by
5342 the body; finally, deallocate the SV's head itself.
5343 Normally called via a wrapper macro C<SvREFCNT_dec>.
5349 Perl_sv_free(pTHX_ SV *sv)
5351 int refcount_is_zero;
5355 if (SvREFCNT(sv) == 0) {
5356 if (SvFLAGS(sv) & SVf_BREAK)
5357 /* this SV's refcnt has been artificially decremented to
5358 * trigger cleanup */
5360 if (PL_in_clean_all) /* All is fair */
5362 if (SvREADONLY(sv) && SvIMMORTAL(sv)) {
5363 /* make sure SvREFCNT(sv)==0 happens very seldom */
5364 SvREFCNT(sv) = (~(U32)0)/2;
5367 if (ckWARN_d(WARN_INTERNAL))
5368 Perl_warner(aTHX_ packWARN(WARN_INTERNAL), "Attempt to free unreferenced scalar");
5371 ATOMIC_DEC_AND_TEST(refcount_is_zero, SvREFCNT(sv));
5372 if (!refcount_is_zero)
5376 if (ckWARN_d(WARN_DEBUGGING))
5377 Perl_warner(aTHX_ packWARN(WARN_DEBUGGING),
5378 "Attempt to free temp prematurely: SV 0x%"UVxf,
5383 if (SvREADONLY(sv) && SvIMMORTAL(sv)) {
5384 /* make sure SvREFCNT(sv)==0 happens very seldom */
5385 SvREFCNT(sv) = (~(U32)0)/2;
5396 Returns the length of the string in the SV. Handles magic and type
5397 coercion. See also C<SvCUR>, which gives raw access to the xpv_cur slot.
5403 Perl_sv_len(pTHX_ register SV *sv)
5411 len = mg_length(sv);
5413 (void)SvPV(sv, len);
5418 =for apidoc sv_len_utf8
5420 Returns the number of characters in the string in an SV, counting wide
5421 UTF8 bytes as a single character. Handles magic and type coercion.
5427 Perl_sv_len_utf8(pTHX_ register SV *sv)
5433 return mg_length(sv);
5437 U8 *s = (U8*)SvPV(sv, len);
5439 return Perl_utf8_length(aTHX_ s, s + len);
5444 =for apidoc sv_pos_u2b
5446 Converts the value pointed to by offsetp from a count of UTF8 chars from
5447 the start of the string, to a count of the equivalent number of bytes; if
5448 lenp is non-zero, it does the same to lenp, but this time starting from
5449 the offset, rather than from the start of the string. Handles magic and
5456 Perl_sv_pos_u2b(pTHX_ register SV *sv, I32* offsetp, I32* lenp)
5461 I32 uoffset = *offsetp;
5467 start = s = (U8*)SvPV(sv, len);
5469 while (s < send && uoffset--)
5473 *offsetp = s - start;
5477 while (s < send && ulen--)
5487 =for apidoc sv_pos_b2u
5489 Converts the value pointed to by offsetp from a count of bytes from the
5490 start of the string, to a count of the equivalent number of UTF8 chars.
5491 Handles magic and type coercion.
5497 Perl_sv_pos_b2u(pTHX_ register SV *sv, I32* offsetp)
5506 s = (U8*)SvPV(sv, len);
5507 if ((I32)len < *offsetp)
5508 Perl_croak(aTHX_ "panic: sv_pos_b2u: bad byte offset");
5509 send = s + *offsetp;
5513 /* Call utf8n_to_uvchr() to validate the sequence
5514 * (unless a simple non-UTF character) */
5515 if (!UTF8_IS_INVARIANT(*s))
5516 utf8n_to_uvchr(s, UTF8SKIP(s), &n, 0);
5531 Returns a boolean indicating whether the strings in the two SVs are
5532 identical. Is UTF-8 and 'use bytes' aware, handles get magic, and will
5533 coerce its args to strings if necessary.
5539 Perl_sv_eq(pTHX_ register SV *sv1, register SV *sv2)
5547 SV* svrecode = Nullsv;
5554 pv1 = SvPV(sv1, cur1);
5561 pv2 = SvPV(sv2, cur2);
5563 if (cur1 && cur2 && SvUTF8(sv1) != SvUTF8(sv2) && !IN_BYTES) {
5564 /* Differing utf8ness.
5565 * Do not UTF8size the comparands as a side-effect. */
5568 svrecode = newSVpvn(pv2, cur2);
5569 sv_recode_to_utf8(svrecode, PL_encoding);
5570 pv2 = SvPV(svrecode, cur2);
5573 svrecode = newSVpvn(pv1, cur1);
5574 sv_recode_to_utf8(svrecode, PL_encoding);
5575 pv1 = SvPV(svrecode, cur1);
5577 /* Now both are in UTF-8. */
5582 bool is_utf8 = TRUE;
5585 /* sv1 is the UTF-8 one,
5586 * if is equal it must be downgrade-able */
5587 char *pv = (char*)bytes_from_utf8((U8*)pv1,
5593 /* sv2 is the UTF-8 one,
5594 * if is equal it must be downgrade-able */
5595 char *pv = (char *)bytes_from_utf8((U8*)pv2,
5601 /* Downgrade not possible - cannot be eq */
5608 eq = (pv1 == pv2) || memEQ(pv1, pv2, cur1);
5611 SvREFCNT_dec(svrecode);
5622 Compares the strings in two SVs. Returns -1, 0, or 1 indicating whether the
5623 string in C<sv1> is less than, equal to, or greater than the string in
5624 C<sv2>. Is UTF-8 and 'use bytes' aware, handles get magic, and will
5625 coerce its args to strings if necessary. See also C<sv_cmp_locale>.
5631 Perl_sv_cmp(pTHX_ register SV *sv1, register SV *sv2)
5634 char *pv1, *pv2, *tpv = Nullch;
5636 SV *svrecode = Nullsv;
5643 pv1 = SvPV(sv1, cur1);
5650 pv2 = SvPV(sv2, cur2);
5652 if (cur1 && cur2 && SvUTF8(sv1) != SvUTF8(sv2) && !IN_BYTES) {
5653 /* Differing utf8ness.
5654 * Do not UTF8size the comparands as a side-effect. */
5657 svrecode = newSVpvn(pv2, cur2);
5658 sv_recode_to_utf8(svrecode, PL_encoding);
5659 pv2 = SvPV(svrecode, cur2);
5662 pv2 = tpv = (char*)bytes_to_utf8((U8*)pv2, &cur2);
5667 svrecode = newSVpvn(pv1, cur1);
5668 sv_recode_to_utf8(svrecode, PL_encoding);
5669 pv1 = SvPV(svrecode, cur1);
5672 pv1 = tpv = (char*)bytes_to_utf8((U8*)pv1, &cur1);
5678 cmp = cur2 ? -1 : 0;
5682 I32 retval = memcmp((void*)pv1, (void*)pv2, cur1 < cur2 ? cur1 : cur2);
5685 cmp = retval < 0 ? -1 : 1;
5686 } else if (cur1 == cur2) {
5689 cmp = cur1 < cur2 ? -1 : 1;
5694 SvREFCNT_dec(svrecode);
5703 =for apidoc sv_cmp_locale
5705 Compares the strings in two SVs in a locale-aware manner. Is UTF-8 and
5706 'use bytes' aware, handles get magic, and will coerce its args to strings
5707 if necessary. See also C<sv_cmp_locale>. See also C<sv_cmp>.
5713 Perl_sv_cmp_locale(pTHX_ register SV *sv1, register SV *sv2)
5715 #ifdef USE_LOCALE_COLLATE
5721 if (PL_collation_standard)
5725 pv1 = sv1 ? sv_collxfrm(sv1, &len1) : (char *) NULL;
5727 pv2 = sv2 ? sv_collxfrm(sv2, &len2) : (char *) NULL;
5729 if (!pv1 || !len1) {
5740 retval = memcmp((void*)pv1, (void*)pv2, len1 < len2 ? len1 : len2);
5743 return retval < 0 ? -1 : 1;
5746 * When the result of collation is equality, that doesn't mean
5747 * that there are no differences -- some locales exclude some
5748 * characters from consideration. So to avoid false equalities,
5749 * we use the raw string as a tiebreaker.
5755 #endif /* USE_LOCALE_COLLATE */
5757 return sv_cmp(sv1, sv2);
5761 #ifdef USE_LOCALE_COLLATE
5764 =for apidoc sv_collxfrm
5766 Add Collate Transform magic to an SV if it doesn't already have it.
5768 Any scalar variable may carry PERL_MAGIC_collxfrm magic that contains the
5769 scalar data of the variable, but transformed to such a format that a normal
5770 memory comparison can be used to compare the data according to the locale
5777 Perl_sv_collxfrm(pTHX_ SV *sv, STRLEN *nxp)
5781 mg = SvMAGICAL(sv) ? mg_find(sv, PERL_MAGIC_collxfrm) : (MAGIC *) NULL;
5782 if (!mg || !mg->mg_ptr || *(U32*)mg->mg_ptr != PL_collation_ix) {
5787 Safefree(mg->mg_ptr);
5789 if ((xf = mem_collxfrm(s, len, &xlen))) {
5790 if (SvREADONLY(sv)) {
5793 return xf + sizeof(PL_collation_ix);
5796 sv_magic(sv, 0, PERL_MAGIC_collxfrm, 0, 0);
5797 mg = mg_find(sv, PERL_MAGIC_collxfrm);
5810 if (mg && mg->mg_ptr) {
5812 return mg->mg_ptr + sizeof(PL_collation_ix);
5820 #endif /* USE_LOCALE_COLLATE */
5825 Get a line from the filehandle and store it into the SV, optionally
5826 appending to the currently-stored string.
5832 Perl_sv_gets(pTHX_ register SV *sv, register PerlIO *fp, I32 append)
5836 register STDCHAR rslast;
5837 register STDCHAR *bp;
5842 SV_CHECK_THINKFIRST_COW_DROP(sv);
5843 /* XXX. If you make this PVIV, then copy on write can copy scalars read
5845 However, perlbench says it's slower, because the existing swipe code
5846 is faster than copy on write.
5847 Swings and roundabouts. */
5848 (void)SvUPGRADE(sv, SVt_PV);
5852 if (PL_curcop == &PL_compiling) {
5853 /* we always read code in line mode */
5857 else if (RsSNARF(PL_rs)) {
5861 else if (RsRECORD(PL_rs)) {
5862 I32 recsize, bytesread;
5865 /* Grab the size of the record we're getting */
5866 recsize = SvIV(SvRV(PL_rs));
5867 (void)SvPOK_only(sv); /* Validate pointer */
5868 buffer = SvGROW(sv, (STRLEN)(recsize + 1));
5871 /* VMS wants read instead of fread, because fread doesn't respect */
5872 /* RMS record boundaries. This is not necessarily a good thing to be */
5873 /* doing, but we've got no other real choice */
5874 bytesread = PerlLIO_read(PerlIO_fileno(fp), buffer, recsize);
5876 bytesread = PerlIO_read(fp, buffer, recsize);
5878 SvCUR_set(sv, bytesread);
5879 buffer[bytesread] = '\0';
5880 if (PerlIO_isutf8(fp))
5884 return(SvCUR(sv) ? SvPVX(sv) : Nullch);
5886 else if (RsPARA(PL_rs)) {
5892 /* Get $/ i.e. PL_rs into same encoding as stream wants */
5893 if (PerlIO_isutf8(fp)) {
5894 rsptr = SvPVutf8(PL_rs, rslen);
5897 if (SvUTF8(PL_rs)) {
5898 if (!sv_utf8_downgrade(PL_rs, TRUE)) {
5899 Perl_croak(aTHX_ "Wide character in $/");
5902 rsptr = SvPV(PL_rs, rslen);
5906 rslast = rslen ? rsptr[rslen - 1] : '\0';
5908 if (rspara) { /* have to do this both before and after */
5909 do { /* to make sure file boundaries work right */
5912 i = PerlIO_getc(fp);
5916 PerlIO_ungetc(fp,i);
5922 /* See if we know enough about I/O mechanism to cheat it ! */
5924 /* This used to be #ifdef test - it is made run-time test for ease
5925 of abstracting out stdio interface. One call should be cheap
5926 enough here - and may even be a macro allowing compile
5930 if (PerlIO_fast_gets(fp)) {
5933 * We're going to steal some values from the stdio struct
5934 * and put EVERYTHING in the innermost loop into registers.
5936 register STDCHAR *ptr;
5940 #if defined(VMS) && defined(PERLIO_IS_STDIO)
5941 /* An ungetc()d char is handled separately from the regular
5942 * buffer, so we getc() it back out and stuff it in the buffer.
5944 i = PerlIO_getc(fp);
5945 if (i == EOF) return 0;
5946 *(--((*fp)->_ptr)) = (unsigned char) i;
5950 /* Here is some breathtakingly efficient cheating */
5952 cnt = PerlIO_get_cnt(fp); /* get count into register */
5953 (void)SvPOK_only(sv); /* validate pointer */
5954 if ((I32)(SvLEN(sv) - append) <= cnt + 1) { /* make sure we have the room */
5955 if (cnt > 80 && (I32)SvLEN(sv) > append) {
5956 shortbuffered = cnt - SvLEN(sv) + append + 1;
5957 cnt -= shortbuffered;
5961 /* remember that cnt can be negative */
5962 SvGROW(sv, (STRLEN)(append + (cnt <= 0 ? 2 : (cnt + 1))));
5967 bp = (STDCHAR*)SvPVX(sv) + append; /* move these two too to registers */
5968 ptr = (STDCHAR*)PerlIO_get_ptr(fp);
5969 DEBUG_P(PerlIO_printf(Perl_debug_log,
5970 "Screamer: entering, ptr=%"UVuf", cnt=%ld\n",PTR2UV(ptr),(long)cnt));
5971 DEBUG_P(PerlIO_printf(Perl_debug_log,
5972 "Screamer: entering: PerlIO * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
5973 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
5974 PTR2UV(PerlIO_has_base(fp) ? PerlIO_get_base(fp) : 0)));
5979 while (cnt > 0) { /* this | eat */
5981 if ((*bp++ = *ptr++) == rslast) /* really | dust */
5982 goto thats_all_folks; /* screams | sed :-) */
5986 Copy(ptr, bp, cnt, char); /* this | eat */
5987 bp += cnt; /* screams | dust */
5988 ptr += cnt; /* louder | sed :-) */
5993 if (shortbuffered) { /* oh well, must extend */
5994 cnt = shortbuffered;
5996 bpx = bp - (STDCHAR*)SvPVX(sv); /* box up before relocation */
5998 SvGROW(sv, SvLEN(sv) + append + cnt + 2);
5999 bp = (STDCHAR*)SvPVX(sv) + bpx; /* unbox after relocation */
6003 DEBUG_P(PerlIO_printf(Perl_debug_log,
6004 "Screamer: going to getc, ptr=%"UVuf", cnt=%ld\n",
6005 PTR2UV(ptr),(long)cnt));
6006 PerlIO_set_ptrcnt(fp, (STDCHAR*)ptr, cnt); /* deregisterize cnt and ptr */
6008 DEBUG_P(PerlIO_printf(Perl_debug_log,
6009 "Screamer: pre: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
6010 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
6011 PTR2UV(PerlIO_has_base (fp) ? PerlIO_get_base(fp) : 0)));
6013 /* This used to call 'filbuf' in stdio form, but as that behaves like
6014 getc when cnt <= 0 we use PerlIO_getc here to avoid introducing
6015 another abstraction. */
6016 i = PerlIO_getc(fp); /* get more characters */
6018 DEBUG_P(PerlIO_printf(Perl_debug_log,
6019 "Screamer: post: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
6020 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
6021 PTR2UV(PerlIO_has_base (fp) ? PerlIO_get_base(fp) : 0)));
6023 cnt = PerlIO_get_cnt(fp);
6024 ptr = (STDCHAR*)PerlIO_get_ptr(fp); /* reregisterize cnt and ptr */
6025 DEBUG_P(PerlIO_printf(Perl_debug_log,
6026 "Screamer: after getc, ptr=%"UVuf", cnt=%ld\n",PTR2UV(ptr),(long)cnt));
6028 if (i == EOF) /* all done for ever? */
6029 goto thats_really_all_folks;
6031 bpx = bp - (STDCHAR*)SvPVX(sv); /* box up before relocation */
6033 SvGROW(sv, bpx + cnt + 2);
6034 bp = (STDCHAR*)SvPVX(sv) + bpx; /* unbox after relocation */
6036 *bp++ = (STDCHAR)i; /* store character from PerlIO_getc */
6038 if (rslen && (STDCHAR)i == rslast) /* all done for now? */
6039 goto thats_all_folks;
6043 if ((rslen > 1 && (STRLEN)(bp - (STDCHAR*)SvPVX(sv)) < rslen) ||
6044 memNE((char*)bp - rslen, rsptr, rslen))
6045 goto screamer; /* go back to the fray */
6046 thats_really_all_folks:
6048 cnt += shortbuffered;
6049 DEBUG_P(PerlIO_printf(Perl_debug_log,
6050 "Screamer: quitting, ptr=%"UVuf", cnt=%ld\n",PTR2UV(ptr),(long)cnt));
6051 PerlIO_set_ptrcnt(fp, (STDCHAR*)ptr, cnt); /* put these back or we're in trouble */
6052 DEBUG_P(PerlIO_printf(Perl_debug_log,
6053 "Screamer: end: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
6054 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
6055 PTR2UV(PerlIO_has_base (fp) ? PerlIO_get_base(fp) : 0)));
6057 SvCUR_set(sv, bp - (STDCHAR*)SvPVX(sv)); /* set length */
6058 DEBUG_P(PerlIO_printf(Perl_debug_log,
6059 "Screamer: done, len=%ld, string=|%.*s|\n",
6060 (long)SvCUR(sv),(int)SvCUR(sv),SvPVX(sv)));
6065 /*The big, slow, and stupid way */
6068 /* Need to work around EPOC SDK features */
6069 /* On WINS: MS VC5 generates calls to _chkstk, */
6070 /* if a `large' stack frame is allocated */
6071 /* gcc on MARM does not generate calls like these */
6077 register STDCHAR *bpe = buf + sizeof(buf);
6079 while ((i = PerlIO_getc(fp)) != EOF && (*bp++ = (STDCHAR)i) != rslast && bp < bpe)
6080 ; /* keep reading */
6084 cnt = PerlIO_read(fp,(char*)buf, sizeof(buf));
6085 /* Accomodate broken VAXC compiler, which applies U8 cast to
6086 * both args of ?: operator, causing EOF to change into 255
6089 i = (U8)buf[cnt - 1];
6095 cnt = 0; /* we do need to re-set the sv even when cnt <= 0 */
6097 sv_catpvn(sv, (char *) buf, cnt);
6099 sv_setpvn(sv, (char *) buf, cnt);
6101 if (i != EOF && /* joy */
6103 SvCUR(sv) < rslen ||
6104 memNE(SvPVX(sv) + SvCUR(sv) - rslen, rsptr, rslen)))
6108 * If we're reading from a TTY and we get a short read,
6109 * indicating that the user hit his EOF character, we need
6110 * to notice it now, because if we try to read from the TTY
6111 * again, the EOF condition will disappear.
6113 * The comparison of cnt to sizeof(buf) is an optimization
6114 * that prevents unnecessary calls to feof().
6118 if (!(cnt < sizeof(buf) && PerlIO_eof(fp)))
6123 if (rspara) { /* have to do this both before and after */
6124 while (i != EOF) { /* to make sure file boundaries work right */
6125 i = PerlIO_getc(fp);
6127 PerlIO_ungetc(fp,i);
6133 if (PerlIO_isutf8(fp))
6138 return (SvCUR(sv) - append) ? SvPVX(sv) : Nullch;
6144 Auto-increment of the value in the SV, doing string to numeric conversion
6145 if necessary. Handles 'get' magic.
6151 Perl_sv_inc(pTHX_ register SV *sv)
6160 if (SvTHINKFIRST(sv)) {
6162 sv_force_normal_flags(sv, 0);
6163 if (SvREADONLY(sv)) {
6164 if (PL_curcop != &PL_compiling)
6165 Perl_croak(aTHX_ PL_no_modify);
6169 if (SvAMAGIC(sv) && AMG_CALLun(sv,inc))
6171 i = PTR2IV(SvRV(sv));
6176 flags = SvFLAGS(sv);
6177 if ((flags & (SVp_NOK|SVp_IOK)) == SVp_NOK) {
6178 /* It's (privately or publicly) a float, but not tested as an
6179 integer, so test it to see. */
6181 flags = SvFLAGS(sv);
6183 if ((flags & SVf_IOK) || ((flags & (SVp_IOK | SVp_NOK)) == SVp_IOK)) {
6184 /* It's publicly an integer, or privately an integer-not-float */
6185 #ifdef PERL_PRESERVE_IVUV
6189 if (SvUVX(sv) == UV_MAX)
6190 sv_setnv(sv, UV_MAX_P1);
6192 (void)SvIOK_only_UV(sv);
6195 if (SvIVX(sv) == IV_MAX)
6196 sv_setuv(sv, (UV)IV_MAX + 1);
6198 (void)SvIOK_only(sv);
6204 if (flags & SVp_NOK) {
6205 (void)SvNOK_only(sv);
6210 if (!(flags & SVp_POK) || !*SvPVX(sv)) {
6211 if ((flags & SVTYPEMASK) < SVt_PVIV)
6212 sv_upgrade(sv, SVt_IV);
6213 (void)SvIOK_only(sv);
6218 while (isALPHA(*d)) d++;
6219 while (isDIGIT(*d)) d++;
6221 #ifdef PERL_PRESERVE_IVUV
6222 /* Got to punt this as an integer if needs be, but we don't issue
6223 warnings. Probably ought to make the sv_iv_please() that does
6224 the conversion if possible, and silently. */
6225 int numtype = grok_number(SvPVX(sv), SvCUR(sv), NULL);
6226 if (numtype && !(numtype & IS_NUMBER_INFINITY)) {
6227 /* Need to try really hard to see if it's an integer.
6228 9.22337203685478e+18 is an integer.
6229 but "9.22337203685478e+18" + 0 is UV=9223372036854779904
6230 so $a="9.22337203685478e+18"; $a+0; $a++
6231 needs to be the same as $a="9.22337203685478e+18"; $a++
6238 /* sv_2iv *should* have made this an NV */
6239 if (flags & SVp_NOK) {
6240 (void)SvNOK_only(sv);
6244 /* I don't think we can get here. Maybe I should assert this
6245 And if we do get here I suspect that sv_setnv will croak. NWC
6247 #if defined(USE_LONG_DOUBLE)
6248 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",
6249 SvPVX(sv), SvIVX(sv), SvNVX(sv)));
6251 DEBUG_c(PerlIO_printf(Perl_debug_log,"sv_inc punt failed to convert '%s' to IOK or NOKp, UV=0x%"UVxf" NV=%"NVgf"\n",
6252 SvPVX(sv), SvIVX(sv), SvNVX(sv)));
6255 #endif /* PERL_PRESERVE_IVUV */
6256 sv_setnv(sv,Atof(SvPVX(sv)) + 1.0);
6260 while (d >= SvPVX(sv)) {
6268 /* MKS: The original code here died if letters weren't consecutive.
6269 * at least it didn't have to worry about non-C locales. The
6270 * new code assumes that ('z'-'a')==('Z'-'A'), letters are
6271 * arranged in order (although not consecutively) and that only
6272 * [A-Za-z] are accepted by isALPHA in the C locale.
6274 if (*d != 'z' && *d != 'Z') {
6275 do { ++*d; } while (!isALPHA(*d));
6278 *(d--) -= 'z' - 'a';
6283 *(d--) -= 'z' - 'a' + 1;
6287 /* oh,oh, the number grew */
6288 SvGROW(sv, SvCUR(sv) + 2);
6290 for (d = SvPVX(sv) + SvCUR(sv); d > SvPVX(sv); d--)
6301 Auto-decrement of the value in the SV, doing string to numeric conversion
6302 if necessary. Handles 'get' magic.
6308 Perl_sv_dec(pTHX_ register SV *sv)
6316 if (SvTHINKFIRST(sv)) {
6318 sv_force_normal_flags(sv, 0);
6319 if (SvREADONLY(sv)) {
6320 if (PL_curcop != &PL_compiling)
6321 Perl_croak(aTHX_ PL_no_modify);
6325 if (SvAMAGIC(sv) && AMG_CALLun(sv,dec))
6327 i = PTR2IV(SvRV(sv));
6332 /* Unlike sv_inc we don't have to worry about string-never-numbers
6333 and keeping them magic. But we mustn't warn on punting */
6334 flags = SvFLAGS(sv);
6335 if ((flags & SVf_IOK) || ((flags & (SVp_IOK | SVp_NOK)) == SVp_IOK)) {
6336 /* It's publicly an integer, or privately an integer-not-float */
6337 #ifdef PERL_PRESERVE_IVUV
6341 if (SvUVX(sv) == 0) {
6342 (void)SvIOK_only(sv);
6346 (void)SvIOK_only_UV(sv);
6350 if (SvIVX(sv) == IV_MIN)
6351 sv_setnv(sv, (NV)IV_MIN - 1.0);
6353 (void)SvIOK_only(sv);
6359 if (flags & SVp_NOK) {
6361 (void)SvNOK_only(sv);
6364 if (!(flags & SVp_POK)) {
6365 if ((flags & SVTYPEMASK) < SVt_PVNV)
6366 sv_upgrade(sv, SVt_NV);
6368 (void)SvNOK_only(sv);
6371 #ifdef PERL_PRESERVE_IVUV
6373 int numtype = grok_number(SvPVX(sv), SvCUR(sv), NULL);
6374 if (numtype && !(numtype & IS_NUMBER_INFINITY)) {
6375 /* Need to try really hard to see if it's an integer.
6376 9.22337203685478e+18 is an integer.
6377 but "9.22337203685478e+18" + 0 is UV=9223372036854779904
6378 so $a="9.22337203685478e+18"; $a+0; $a--
6379 needs to be the same as $a="9.22337203685478e+18"; $a--
6386 /* sv_2iv *should* have made this an NV */
6387 if (flags & SVp_NOK) {
6388 (void)SvNOK_only(sv);
6392 /* I don't think we can get here. Maybe I should assert this
6393 And if we do get here I suspect that sv_setnv will croak. NWC
6395 #if defined(USE_LONG_DOUBLE)
6396 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",
6397 SvPVX(sv), SvIVX(sv), SvNVX(sv)));
6399 DEBUG_c(PerlIO_printf(Perl_debug_log,"sv_dec punt failed to convert '%s' to IOK or NOKp, UV=0x%"UVxf" NV=%"NVgf"\n",
6400 SvPVX(sv), SvIVX(sv), SvNVX(sv)));
6404 #endif /* PERL_PRESERVE_IVUV */
6405 sv_setnv(sv,Atof(SvPVX(sv)) - 1.0); /* punt */
6409 =for apidoc sv_mortalcopy
6411 Creates a new SV which is a copy of the original SV (using C<sv_setsv>).
6412 The new SV is marked as mortal. It will be destroyed "soon", either by an
6413 explicit call to FREETMPS, or by an implicit call at places such as
6414 statement boundaries. See also C<sv_newmortal> and C<sv_2mortal>.
6419 /* Make a string that will exist for the duration of the expression
6420 * evaluation. Actually, it may have to last longer than that, but
6421 * hopefully we won't free it until it has been assigned to a
6422 * permanent location. */
6425 Perl_sv_mortalcopy(pTHX_ SV *oldstr)
6430 sv_setsv(sv,oldstr);
6432 PL_tmps_stack[++PL_tmps_ix] = sv;
6438 =for apidoc sv_newmortal
6440 Creates a new null SV which is mortal. The reference count of the SV is
6441 set to 1. It will be destroyed "soon", either by an explicit call to
6442 FREETMPS, or by an implicit call at places such as statement boundaries.
6443 See also C<sv_mortalcopy> and C<sv_2mortal>.
6449 Perl_sv_newmortal(pTHX)
6454 SvFLAGS(sv) = SVs_TEMP;
6456 PL_tmps_stack[++PL_tmps_ix] = sv;
6461 =for apidoc sv_2mortal
6463 Marks an existing SV as mortal. The SV will be destroyed "soon", either
6464 by an explicit call to FREETMPS, or by an implicit call at places such as
6465 statement boundaries. See also C<sv_newmortal> and C<sv_mortalcopy>.
6471 Perl_sv_2mortal(pTHX_ register SV *sv)
6475 if (SvREADONLY(sv) && SvIMMORTAL(sv))
6478 PL_tmps_stack[++PL_tmps_ix] = sv;
6486 Creates a new SV and copies a string into it. The reference count for the
6487 SV is set to 1. If C<len> is zero, Perl will compute the length using
6488 strlen(). For efficiency, consider using C<newSVpvn> instead.
6494 Perl_newSVpv(pTHX_ const char *s, STRLEN len)
6501 sv_setpvn(sv,s,len);
6506 =for apidoc newSVpvn
6508 Creates a new SV and copies a string into it. The reference count for the
6509 SV is set to 1. Note that if C<len> is zero, Perl will create a zero length
6510 string. You are responsible for ensuring that the source string is at least
6517 Perl_newSVpvn(pTHX_ const char *s, STRLEN len)
6522 sv_setpvn(sv,s,len);
6527 =for apidoc newSVpvn_share
6529 Creates a new SV with its SvPVX pointing to a shared string in the string
6530 table. If the string does not already exist in the table, it is created
6531 first. Turns on READONLY and FAKE. The string's hash is stored in the UV
6532 slot of the SV; if the C<hash> parameter is non-zero, that value is used;
6533 otherwise the hash is computed. The idea here is that as the string table
6534 is used for shared hash keys these strings will have SvPVX == HeKEY and
6535 hash lookup will avoid string compare.
6541 Perl_newSVpvn_share(pTHX_ const char *src, I32 len, U32 hash)
6544 bool is_utf8 = FALSE;
6546 STRLEN tmplen = -len;
6548 /* See the note in hv.c:hv_fetch() --jhi */
6549 src = (char*)bytes_from_utf8((U8*)src, &tmplen, &is_utf8);
6553 PERL_HASH(hash, src, len);
6555 sv_upgrade(sv, SVt_PVIV);
6556 SvPVX(sv) = sharepvn(src, is_utf8?-len:len, hash);
6569 #if defined(PERL_IMPLICIT_CONTEXT)
6571 /* pTHX_ magic can't cope with varargs, so this is a no-context
6572 * version of the main function, (which may itself be aliased to us).
6573 * Don't access this version directly.
6577 Perl_newSVpvf_nocontext(const char* pat, ...)
6582 va_start(args, pat);
6583 sv = vnewSVpvf(pat, &args);
6590 =for apidoc newSVpvf
6592 Creates a new SV and initializes it with the string formatted like
6599 Perl_newSVpvf(pTHX_ const char* pat, ...)
6603 va_start(args, pat);
6604 sv = vnewSVpvf(pat, &args);
6609 /* backend for newSVpvf() and newSVpvf_nocontext() */
6612 Perl_vnewSVpvf(pTHX_ const char* pat, va_list* args)
6616 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
6623 Creates a new SV and copies a floating point value into it.
6624 The reference count for the SV is set to 1.
6630 Perl_newSVnv(pTHX_ NV n)
6642 Creates a new SV and copies an integer into it. The reference count for the
6649 Perl_newSViv(pTHX_ IV i)
6661 Creates a new SV and copies an unsigned integer into it.
6662 The reference count for the SV is set to 1.
6668 Perl_newSVuv(pTHX_ UV u)
6678 =for apidoc newRV_noinc
6680 Creates an RV wrapper for an SV. The reference count for the original
6681 SV is B<not> incremented.
6687 Perl_newRV_noinc(pTHX_ SV *tmpRef)
6692 sv_upgrade(sv, SVt_RV);
6699 /* newRV_inc is the official function name to use now.
6700 * newRV_inc is in fact #defined to newRV in sv.h
6704 Perl_newRV(pTHX_ SV *tmpRef)
6706 return newRV_noinc(SvREFCNT_inc(tmpRef));
6712 Creates a new SV which is an exact duplicate of the original SV.
6719 Perl_newSVsv(pTHX_ register SV *old)
6725 if (SvTYPE(old) == SVTYPEMASK) {
6726 if (ckWARN_d(WARN_INTERNAL))
6727 Perl_warner(aTHX_ packWARN(WARN_INTERNAL), "semi-panic: attempt to dup freed string");
6742 =for apidoc sv_reset
6744 Underlying implementation for the C<reset> Perl function.
6745 Note that the perl-level function is vaguely deprecated.
6751 Perl_sv_reset(pTHX_ register char *s, HV *stash)
6759 char todo[PERL_UCHAR_MAX+1];
6764 if (!*s) { /* reset ?? searches */
6765 for (pm = HvPMROOT(stash); pm; pm = pm->op_pmnext) {
6766 pm->op_pmdynflags &= ~PMdf_USED;
6771 /* reset variables */
6773 if (!HvARRAY(stash))
6776 Zero(todo, 256, char);
6778 i = (unsigned char)*s;
6782 max = (unsigned char)*s++;
6783 for ( ; i <= max; i++) {
6786 for (i = 0; i <= (I32) HvMAX(stash); i++) {
6787 for (entry = HvARRAY(stash)[i];
6789 entry = HeNEXT(entry))
6791 if (!todo[(U8)*HeKEY(entry)])
6793 gv = (GV*)HeVAL(entry);
6795 if (SvTHINKFIRST(sv)) {
6796 if (!SvREADONLY(sv) && SvROK(sv))
6801 if (SvTYPE(sv) >= SVt_PV) {
6803 if (SvPVX(sv) != Nullch)
6810 if (GvHV(gv) && !HvNAME(GvHV(gv))) {
6812 #ifdef USE_ENVIRON_ARRAY
6814 # ifdef USE_ITHREADS
6815 && PL_curinterp == aTHX
6819 environ[0] = Nullch;
6831 Using various gambits, try to get an IO from an SV: the IO slot if its a
6832 GV; or the recursive result if we're an RV; or the IO slot of the symbol
6833 named after the PV if we're a string.
6839 Perl_sv_2io(pTHX_ SV *sv)
6845 switch (SvTYPE(sv)) {
6853 Perl_croak(aTHX_ "Bad filehandle: %s", GvNAME(gv));
6857 Perl_croak(aTHX_ PL_no_usym, "filehandle");
6859 return sv_2io(SvRV(sv));
6860 gv = gv_fetchpv(SvPV(sv,n_a), FALSE, SVt_PVIO);
6866 Perl_croak(aTHX_ "Bad filehandle: %s", SvPV(sv,n_a));
6875 Using various gambits, try to get a CV from an SV; in addition, try if
6876 possible to set C<*st> and C<*gvp> to the stash and GV associated with it.
6882 Perl_sv_2cv(pTHX_ SV *sv, HV **st, GV **gvp, I32 lref)
6889 return *gvp = Nullgv, Nullcv;
6890 switch (SvTYPE(sv)) {
6909 SV **sp = &sv; /* Used in tryAMAGICunDEREF macro. */
6910 tryAMAGICunDEREF(to_cv);
6913 if (SvTYPE(sv) == SVt_PVCV) {
6922 Perl_croak(aTHX_ "Not a subroutine reference");
6927 gv = gv_fetchpv(SvPV(sv, n_a), lref, SVt_PVCV);
6933 if (lref && !GvCVu(gv)) {
6936 tmpsv = NEWSV(704,0);
6937 gv_efullname3(tmpsv, gv, Nullch);
6938 /* XXX this is probably not what they think they're getting.
6939 * It has the same effect as "sub name;", i.e. just a forward
6941 newSUB(start_subparse(FALSE, 0),
6942 newSVOP(OP_CONST, 0, tmpsv),
6947 Perl_croak(aTHX_ "Unable to create sub named \"%s\"", SvPV(sv,n_a));
6956 Returns true if the SV has a true value by Perl's rules.
6957 Use the C<SvTRUE> macro instead, which may call C<sv_true()> or may
6958 instead use an in-line version.
6964 Perl_sv_true(pTHX_ register SV *sv)
6970 if ((tXpv = (XPV*)SvANY(sv)) &&
6971 (tXpv->xpv_cur > 1 ||
6972 (tXpv->xpv_cur && *tXpv->xpv_pv != '0')))
6979 return SvIVX(sv) != 0;
6982 return SvNVX(sv) != 0.0;
6984 return sv_2bool(sv);
6992 A private implementation of the C<SvIVx> macro for compilers which can't
6993 cope with complex macro expressions. Always use the macro instead.
6999 Perl_sv_iv(pTHX_ register SV *sv)
7003 return (IV)SvUVX(sv);
7012 A private implementation of the C<SvUVx> macro for compilers which can't
7013 cope with complex macro expressions. Always use the macro instead.
7019 Perl_sv_uv(pTHX_ register SV *sv)
7024 return (UV)SvIVX(sv);
7032 A private implementation of the C<SvNVx> macro for compilers which can't
7033 cope with complex macro expressions. Always use the macro instead.
7039 Perl_sv_nv(pTHX_ register SV *sv)
7049 Use the C<SvPV_nolen> macro instead
7053 A private implementation of the C<SvPV> macro for compilers which can't
7054 cope with complex macro expressions. Always use the macro instead.
7060 Perl_sv_pvn(pTHX_ SV *sv, STRLEN *lp)
7066 return sv_2pv(sv, lp);
7071 Perl_sv_pvn_nomg(pTHX_ register SV *sv, STRLEN *lp)
7077 return sv_2pv_flags(sv, lp, 0);
7081 =for apidoc sv_pvn_force
7083 Get a sensible string out of the SV somehow.
7084 A private implementation of the C<SvPV_force> macro for compilers which
7085 can't cope with complex macro expressions. Always use the macro instead.
7087 =for apidoc sv_pvn_force_flags
7089 Get a sensible string out of the SV somehow.
7090 If C<flags> has C<SV_GMAGIC> bit set, will C<mg_get> on C<sv> if
7091 appropriate, else not. C<sv_pvn_force> and C<sv_pvn_force_nomg> are
7092 implemented in terms of this function.
7093 You normally want to use the various wrapper macros instead: see
7094 C<SvPV_force> and C<SvPV_force_nomg>
7100 Perl_sv_pvn_force_flags(pTHX_ SV *sv, STRLEN *lp, I32 flags)
7104 if (SvTHINKFIRST(sv) && !SvROK(sv))
7105 sv_force_normal_flags(sv, 0);
7111 if (SvTYPE(sv) > SVt_PVLV && SvTYPE(sv) != SVt_PVFM) {
7112 Perl_croak(aTHX_ "Can't coerce %s to string in %s", sv_reftype(sv,0),
7116 s = sv_2pv_flags(sv, lp, flags);
7117 if (s != SvPVX(sv)) { /* Almost, but not quite, sv_setpvn() */
7122 (void)SvUPGRADE(sv, SVt_PV); /* Never FALSE */
7123 SvGROW(sv, len + 1);
7124 Move(s,SvPVX(sv),len,char);
7129 SvPOK_on(sv); /* validate pointer */
7131 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2pv(%s)\n",
7132 PTR2UV(sv),SvPVX(sv)));
7139 =for apidoc sv_pvbyte
7141 Use C<SvPVbyte_nolen> instead.
7143 =for apidoc sv_pvbyten
7145 A private implementation of the C<SvPVbyte> macro for compilers
7146 which can't cope with complex macro expressions. Always use the macro
7153 Perl_sv_pvbyten(pTHX_ SV *sv, STRLEN *lp)
7155 sv_utf8_downgrade(sv,0);
7156 return sv_pvn(sv,lp);
7160 =for apidoc sv_pvbyten_force
7162 A private implementation of the C<SvPVbytex_force> macro for compilers
7163 which can't cope with complex macro expressions. Always use the macro
7170 Perl_sv_pvbyten_force(pTHX_ SV *sv, STRLEN *lp)
7172 sv_utf8_downgrade(sv,0);
7173 return sv_pvn_force(sv,lp);
7177 =for apidoc sv_pvutf8
7179 Use the C<SvPVutf8_nolen> macro instead
7181 =for apidoc sv_pvutf8n
7183 A private implementation of the C<SvPVutf8> macro for compilers
7184 which can't cope with complex macro expressions. Always use the macro
7191 Perl_sv_pvutf8n(pTHX_ SV *sv, STRLEN *lp)
7193 sv_utf8_upgrade(sv);
7194 return sv_pvn(sv,lp);
7198 =for apidoc sv_pvutf8n_force
7200 A private implementation of the C<SvPVutf8_force> macro for compilers
7201 which can't cope with complex macro expressions. Always use the macro
7208 Perl_sv_pvutf8n_force(pTHX_ SV *sv, STRLEN *lp)
7210 sv_utf8_upgrade(sv);
7211 return sv_pvn_force(sv,lp);
7215 =for apidoc sv_reftype
7217 Returns a string describing what the SV is a reference to.
7223 Perl_sv_reftype(pTHX_ SV *sv, int ob)
7225 if (ob && SvOBJECT(sv)) {
7226 HV *svs = SvSTASH(sv);
7227 /* [20011101.072] This bandaid for C<package;> should eventually
7228 be removed. AMS 20011103 */
7229 return (svs ? HvNAME(svs) : "<none>");
7232 switch (SvTYPE(sv)) {
7248 case SVt_PVLV: return "LVALUE";
7249 case SVt_PVAV: return "ARRAY";
7250 case SVt_PVHV: return "HASH";
7251 case SVt_PVCV: return "CODE";
7252 case SVt_PVGV: return "GLOB";
7253 case SVt_PVFM: return "FORMAT";
7254 case SVt_PVIO: return "IO";
7255 default: return "UNKNOWN";
7261 =for apidoc sv_isobject
7263 Returns a boolean indicating whether the SV is an RV pointing to a blessed
7264 object. If the SV is not an RV, or if the object is not blessed, then this
7271 Perl_sv_isobject(pTHX_ SV *sv)
7288 Returns a boolean indicating whether the SV is blessed into the specified
7289 class. This does not check for subtypes; use C<sv_derived_from> to verify
7290 an inheritance relationship.
7296 Perl_sv_isa(pTHX_ SV *sv, const char *name)
7308 return strEQ(HvNAME(SvSTASH(sv)), name);
7314 Creates a new SV for the RV, C<rv>, to point to. If C<rv> is not an RV then
7315 it will be upgraded to one. If C<classname> is non-null then the new SV will
7316 be blessed in the specified package. The new SV is returned and its
7317 reference count is 1.
7323 Perl_newSVrv(pTHX_ SV *rv, const char *classname)
7329 SV_CHECK_THINKFIRST_COW_DROP(rv);
7332 if (SvTYPE(rv) >= SVt_PVMG) {
7333 U32 refcnt = SvREFCNT(rv);
7337 SvREFCNT(rv) = refcnt;
7340 if (SvTYPE(rv) < SVt_RV)
7341 sv_upgrade(rv, SVt_RV);
7342 else if (SvTYPE(rv) > SVt_RV) {
7343 (void)SvOOK_off(rv);
7344 if (SvPVX(rv) && SvLEN(rv))
7345 Safefree(SvPVX(rv));
7355 HV* stash = gv_stashpv(classname, TRUE);
7356 (void)sv_bless(rv, stash);
7362 =for apidoc sv_setref_pv
7364 Copies a pointer into a new SV, optionally blessing the SV. The C<rv>
7365 argument will be upgraded to an RV. That RV will be modified to point to
7366 the new SV. If the C<pv> argument is NULL then C<PL_sv_undef> will be placed
7367 into the SV. The C<classname> argument indicates the package for the
7368 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
7369 will be returned and will have a reference count of 1.
7371 Do not use with other Perl types such as HV, AV, SV, CV, because those
7372 objects will become corrupted by the pointer copy process.
7374 Note that C<sv_setref_pvn> copies the string while this copies the pointer.
7380 Perl_sv_setref_pv(pTHX_ SV *rv, const char *classname, void *pv)
7383 sv_setsv(rv, &PL_sv_undef);
7387 sv_setiv(newSVrv(rv,classname), PTR2IV(pv));
7392 =for apidoc sv_setref_iv
7394 Copies an integer into a new SV, optionally blessing the SV. The C<rv>
7395 argument will be upgraded to an RV. That RV will be modified to point to
7396 the new SV. The C<classname> argument indicates the package for the
7397 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
7398 will be returned and will have a reference count of 1.
7404 Perl_sv_setref_iv(pTHX_ SV *rv, const char *classname, IV iv)
7406 sv_setiv(newSVrv(rv,classname), iv);
7411 =for apidoc sv_setref_uv
7413 Copies an unsigned integer into a new SV, optionally blessing the SV. The C<rv>
7414 argument will be upgraded to an RV. That RV will be modified to point to
7415 the new SV. The C<classname> argument indicates the package for the
7416 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
7417 will be returned and will have a reference count of 1.
7423 Perl_sv_setref_uv(pTHX_ SV *rv, const char *classname, UV uv)
7425 sv_setuv(newSVrv(rv,classname), uv);
7430 =for apidoc sv_setref_nv
7432 Copies a double into a new SV, optionally blessing the SV. The C<rv>
7433 argument will be upgraded to an RV. That RV will be modified to point to
7434 the new SV. The C<classname> argument indicates the package for the
7435 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
7436 will be returned and will have a reference count of 1.
7442 Perl_sv_setref_nv(pTHX_ SV *rv, const char *classname, NV nv)
7444 sv_setnv(newSVrv(rv,classname), nv);
7449 =for apidoc sv_setref_pvn
7451 Copies a string into a new SV, optionally blessing the SV. The length of the
7452 string must be specified with C<n>. The C<rv> argument will be upgraded to
7453 an RV. That RV will be modified to point to the new SV. The C<classname>
7454 argument indicates the package for the blessing. Set C<classname> to
7455 C<Nullch> to avoid the blessing. The new SV will be returned and will have
7456 a reference count of 1.
7458 Note that C<sv_setref_pv> copies the pointer while this copies the string.
7464 Perl_sv_setref_pvn(pTHX_ SV *rv, const char *classname, char *pv, STRLEN n)
7466 sv_setpvn(newSVrv(rv,classname), pv, n);
7471 =for apidoc sv_bless
7473 Blesses an SV into a specified package. The SV must be an RV. The package
7474 must be designated by its stash (see C<gv_stashpv()>). The reference count
7475 of the SV is unaffected.
7481 Perl_sv_bless(pTHX_ SV *sv, HV *stash)
7485 Perl_croak(aTHX_ "Can't bless non-reference value");
7487 if (SvFLAGS(tmpRef) & (SVs_OBJECT|SVf_READONLY)) {
7488 if (SvREADONLY(tmpRef))
7489 Perl_croak(aTHX_ PL_no_modify);
7490 if (SvOBJECT(tmpRef)) {
7491 if (SvTYPE(tmpRef) != SVt_PVIO)
7493 SvREFCNT_dec(SvSTASH(tmpRef));
7496 SvOBJECT_on(tmpRef);
7497 if (SvTYPE(tmpRef) != SVt_PVIO)
7499 (void)SvUPGRADE(tmpRef, SVt_PVMG);
7500 SvSTASH(tmpRef) = (HV*)SvREFCNT_inc(stash);
7507 if(SvSMAGICAL(tmpRef))
7508 if(mg_find(tmpRef, PERL_MAGIC_ext) || mg_find(tmpRef, PERL_MAGIC_uvar))
7516 /* Downgrades a PVGV to a PVMG.
7520 S_sv_unglob(pTHX_ SV *sv)
7524 assert(SvTYPE(sv) == SVt_PVGV);
7529 SvREFCNT_dec(GvSTASH(sv));
7530 GvSTASH(sv) = Nullhv;
7532 sv_unmagic(sv, PERL_MAGIC_glob);
7533 Safefree(GvNAME(sv));
7536 /* need to keep SvANY(sv) in the right arena */
7537 xpvmg = new_XPVMG();
7538 StructCopy(SvANY(sv), xpvmg, XPVMG);
7539 del_XPVGV(SvANY(sv));
7542 SvFLAGS(sv) &= ~SVTYPEMASK;
7543 SvFLAGS(sv) |= SVt_PVMG;
7547 =for apidoc sv_unref_flags
7549 Unsets the RV status of the SV, and decrements the reference count of
7550 whatever was being referenced by the RV. This can almost be thought of
7551 as a reversal of C<newSVrv>. The C<cflags> argument can contain
7552 C<SV_IMMEDIATE_UNREF> to force the reference count to be decremented
7553 (otherwise the decrementing is conditional on the reference count being
7554 different from one or the reference being a readonly SV).
7561 Perl_sv_unref_flags(pTHX_ SV *sv, U32 flags)
7565 if (SvWEAKREF(sv)) {
7573 if (SvREFCNT(rv) != 1 || SvREADONLY(rv) || (flags & SV_IMMEDIATE_UNREF))
7575 else /* XXX Hack, but hard to make $a=$a->[1] work otherwise */
7576 sv_2mortal(rv); /* Schedule for freeing later */
7580 =for apidoc sv_unref
7582 Unsets the RV status of the SV, and decrements the reference count of
7583 whatever was being referenced by the RV. This can almost be thought of
7584 as a reversal of C<newSVrv>. This is C<sv_unref_flags> with the C<flag>
7585 being zero. See C<SvROK_off>.
7591 Perl_sv_unref(pTHX_ SV *sv)
7593 sv_unref_flags(sv, 0);
7597 =for apidoc sv_taint
7599 Taint an SV. Use C<SvTAINTED_on> instead.
7604 Perl_sv_taint(pTHX_ SV *sv)
7606 sv_magic((sv), Nullsv, PERL_MAGIC_taint, Nullch, 0);
7610 =for apidoc sv_untaint
7612 Untaint an SV. Use C<SvTAINTED_off> instead.
7617 Perl_sv_untaint(pTHX_ SV *sv)
7619 if (SvTYPE(sv) >= SVt_PVMG && SvMAGIC(sv)) {
7620 MAGIC *mg = mg_find(sv, PERL_MAGIC_taint);
7627 =for apidoc sv_tainted
7629 Test an SV for taintedness. Use C<SvTAINTED> instead.
7634 Perl_sv_tainted(pTHX_ SV *sv)
7636 if (SvTYPE(sv) >= SVt_PVMG && SvMAGIC(sv)) {
7637 MAGIC *mg = mg_find(sv, PERL_MAGIC_taint);
7638 if (mg && ((mg->mg_len & 1) || ((mg->mg_len & 2) && mg->mg_obj == sv)))
7644 #if defined(PERL_IMPLICIT_CONTEXT)
7646 /* pTHX_ magic can't cope with varargs, so this is a no-context
7647 * version of the main function, (which may itself be aliased to us).
7648 * Don't access this version directly.
7652 Perl_sv_setpvf_nocontext(SV *sv, const char* pat, ...)
7656 va_start(args, pat);
7657 sv_vsetpvf(sv, pat, &args);
7661 /* pTHX_ magic can't cope with varargs, so this is a no-context
7662 * version of the main function, (which may itself be aliased to us).
7663 * Don't access this version directly.
7667 Perl_sv_setpvf_mg_nocontext(SV *sv, const char* pat, ...)
7671 va_start(args, pat);
7672 sv_vsetpvf_mg(sv, pat, &args);
7678 =for apidoc sv_setpvf
7680 Processes its arguments like C<sprintf> and sets an SV to the formatted
7681 output. Does not handle 'set' magic. See C<sv_setpvf_mg>.
7687 Perl_sv_setpvf(pTHX_ SV *sv, const char* pat, ...)
7690 va_start(args, pat);
7691 sv_vsetpvf(sv, pat, &args);
7695 /* backend for C<sv_setpvf> and C<sv_setpvf_nocontext> */
7698 Perl_sv_vsetpvf(pTHX_ SV *sv, const char* pat, va_list* args)
7700 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
7704 =for apidoc sv_setpvf_mg
7706 Like C<sv_setpvf>, but also handles 'set' magic.
7712 Perl_sv_setpvf_mg(pTHX_ SV *sv, const char* pat, ...)
7715 va_start(args, pat);
7716 sv_vsetpvf_mg(sv, pat, &args);
7720 /* backend for C<sv_setpvf_mg> C<setpvf_mg_nocontext> */
7723 Perl_sv_vsetpvf_mg(pTHX_ SV *sv, const char* pat, va_list* args)
7725 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
7729 #if defined(PERL_IMPLICIT_CONTEXT)
7731 /* pTHX_ magic can't cope with varargs, so this is a no-context
7732 * version of the main function, (which may itself be aliased to us).
7733 * Don't access this version directly.
7737 Perl_sv_catpvf_nocontext(SV *sv, const char* pat, ...)
7741 va_start(args, pat);
7742 sv_vcatpvf(sv, pat, &args);
7746 /* pTHX_ magic can't cope with varargs, so this is a no-context
7747 * version of the main function, (which may itself be aliased to us).
7748 * Don't access this version directly.
7752 Perl_sv_catpvf_mg_nocontext(SV *sv, const char* pat, ...)
7756 va_start(args, pat);
7757 sv_vcatpvf_mg(sv, pat, &args);
7763 =for apidoc sv_catpvf
7765 Processes its arguments like C<sprintf> and appends the formatted
7766 output to an SV. If the appended data contains "wide" characters
7767 (including, but not limited to, SVs with a UTF-8 PV formatted with %s,
7768 and characters >255 formatted with %c), the original SV might get
7769 upgraded to UTF-8. Handles 'get' magic, but not 'set' magic.
7770 C<SvSETMAGIC()> must typically be called after calling this function
7771 to handle 'set' magic.
7776 Perl_sv_catpvf(pTHX_ SV *sv, const char* pat, ...)
7779 va_start(args, pat);
7780 sv_vcatpvf(sv, pat, &args);
7784 /* backend for C<sv_catpvf> and C<catpvf_mg_nocontext> */
7787 Perl_sv_vcatpvf(pTHX_ SV *sv, const char* pat, va_list* args)
7789 sv_vcatpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
7793 =for apidoc sv_catpvf_mg
7795 Like C<sv_catpvf>, but also handles 'set' magic.
7801 Perl_sv_catpvf_mg(pTHX_ SV *sv, const char* pat, ...)
7804 va_start(args, pat);
7805 sv_vcatpvf_mg(sv, pat, &args);
7809 /* backend for C<catpvf_mg> and C<catpvf_mg_nocontext> */
7812 Perl_sv_vcatpvf_mg(pTHX_ SV *sv, const char* pat, va_list* args)
7814 sv_vcatpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
7819 =for apidoc sv_vsetpvfn
7821 Works like C<vcatpvfn> but copies the text into the SV instead of
7824 Usually used via one of its frontends C<sv_setpvf> and C<sv_setpvf_mg>.
7830 Perl_sv_vsetpvfn(pTHX_ SV *sv, const char *pat, STRLEN patlen, va_list *args, SV **svargs, I32 svmax, bool *maybe_tainted)
7832 sv_setpvn(sv, "", 0);
7833 sv_vcatpvfn(sv, pat, patlen, args, svargs, svmax, maybe_tainted);
7836 /* private function for use in sv_vcatpvfn via the EXPECT_NUMBER macro */
7839 S_expect_number(pTHX_ char** pattern)
7842 switch (**pattern) {
7843 case '1': case '2': case '3':
7844 case '4': case '5': case '6':
7845 case '7': case '8': case '9':
7846 while (isDIGIT(**pattern))
7847 var = var * 10 + (*(*pattern)++ - '0');
7851 #define EXPECT_NUMBER(pattern, var) (var = S_expect_number(aTHX_ &pattern))
7854 =for apidoc sv_vcatpvfn
7856 Processes its arguments like C<vsprintf> and appends the formatted output
7857 to an SV. Uses an array of SVs if the C style variable argument list is
7858 missing (NULL). When running with taint checks enabled, indicates via
7859 C<maybe_tainted> if results are untrustworthy (often due to the use of
7862 Usually used via one of its frontends C<sv_catpvf> and C<sv_catpvf_mg>.
7868 Perl_sv_vcatpvfn(pTHX_ SV *sv, const char *pat, STRLEN patlen, va_list *args, SV **svargs, I32 svmax, bool *maybe_tainted)
7875 static char nullstr[] = "(null)";
7877 bool has_utf8 = FALSE; /* has the result utf8? */
7879 /* no matter what, this is a string now */
7880 (void)SvPV_force(sv, origlen);
7882 /* special-case "", "%s", and "%_" */
7885 if (patlen == 2 && pat[0] == '%') {
7889 char *s = va_arg(*args, char*);
7890 sv_catpv(sv, s ? s : nullstr);
7892 else if (svix < svmax) {
7893 sv_catsv(sv, *svargs);
7894 if (DO_UTF8(*svargs))
7900 argsv = va_arg(*args, SV*);
7901 sv_catsv(sv, argsv);
7906 /* See comment on '_' below */
7911 if (!args && svix < svmax && DO_UTF8(*svargs))
7914 patend = (char*)pat + patlen;
7915 for (p = (char*)pat; p < patend; p = q) {
7918 bool vectorize = FALSE;
7919 bool vectorarg = FALSE;
7920 bool vec_utf8 = FALSE;
7926 bool has_precis = FALSE;
7928 bool is_utf8 = FALSE; /* is this item utf8? */
7931 U8 utf8buf[UTF8_MAXLEN+1];
7932 STRLEN esignlen = 0;
7934 char *eptr = Nullch;
7936 /* Times 4: a decimal digit takes more than 3 binary digits.
7937 * NV_DIG: mantissa takes than many decimal digits.
7938 * Plus 32: Playing safe. */
7939 char ebuf[IV_DIG * 4 + NV_DIG + 32];
7940 /* large enough for "%#.#f" --chip */
7941 /* what about long double NVs? --jhi */
7944 U8 *vecstr = Null(U8*);
7951 /* we need a long double target in case HAS_LONG_DOUBLE but
7954 #if defined(HAS_LONG_DOUBLE) && LONG_DOUBLESIZE > DOUBLESIZE
7963 STRLEN dotstrlen = 1;
7964 I32 efix = 0; /* explicit format parameter index */
7965 I32 ewix = 0; /* explicit width index */
7966 I32 epix = 0; /* explicit precision index */
7967 I32 evix = 0; /* explicit vector index */
7968 bool asterisk = FALSE;
7970 /* echo everything up to the next format specification */
7971 for (q = p; q < patend && *q != '%'; ++q) ;
7973 sv_catpvn(sv, p, q - p);
7980 We allow format specification elements in this order:
7981 \d+\$ explicit format parameter index
7983 v|\*(\d+\$)?v vector with optional (optionally specified) arg
7984 \d+|\*(\d+\$)? width using optional (optionally specified) arg
7985 \.(\d*|\*(\d+\$)?) precision using optional (optionally specified) arg
7987 [%bcdefginopsux_DFOUX] format (mandatory)
7989 if (EXPECT_NUMBER(q, width)) {
8030 if (EXPECT_NUMBER(q, ewix))
8039 if ((vectorarg = asterisk)) {
8049 EXPECT_NUMBER(q, width);
8054 vecsv = va_arg(*args, SV*);
8056 vecsv = (evix ? evix <= svmax : svix < svmax) ?
8057 svargs[ewix ? ewix-1 : svix++] : &PL_sv_undef;
8058 dotstr = SvPVx(vecsv, dotstrlen);
8063 vecsv = va_arg(*args, SV*);
8064 vecstr = (U8*)SvPVx(vecsv,veclen);
8065 vec_utf8 = DO_UTF8(vecsv);
8067 else if (efix ? efix <= svmax : svix < svmax) {
8068 vecsv = svargs[efix ? efix-1 : svix++];
8069 vecstr = (U8*)SvPVx(vecsv,veclen);
8070 vec_utf8 = DO_UTF8(vecsv);
8080 i = va_arg(*args, int);
8082 i = (ewix ? ewix <= svmax : svix < svmax) ?
8083 SvIVx(svargs[ewix ? ewix-1 : svix++]) : 0;
8085 width = (i < 0) ? -i : i;
8095 if (EXPECT_NUMBER(q, epix) && *q++ != '$')
8097 /* XXX: todo, support specified precision parameter */
8101 i = va_arg(*args, int);
8103 i = (ewix ? ewix <= svmax : svix < svmax)
8104 ? SvIVx(svargs[ewix ? ewix-1 : svix++]) : 0;
8105 precis = (i < 0) ? 0 : i;
8110 precis = precis * 10 + (*q++ - '0');
8119 case 'I': /* Ix, I32x, and I64x */
8121 if (q[1] == '6' && q[2] == '4') {
8127 if (q[1] == '3' && q[2] == '2') {
8137 #if defined(HAS_QUAD) || defined(HAS_LONG_DOUBLE)
8148 #if defined(HAS_QUAD) || defined(HAS_LONG_DOUBLE)
8149 if (*(q + 1) == 'l') { /* lld, llf */
8174 argsv = (efix ? efix <= svmax : svix < svmax) ?
8175 svargs[efix ? efix-1 : svix++] : &PL_sv_undef;
8182 uv = (args && !vectorize) ? va_arg(*args, int) : SvIVx(argsv);
8184 (!UNI_IS_INVARIANT(uv) && SvUTF8(sv)))
8186 eptr = (char*)utf8buf;
8187 elen = uvchr_to_utf8((U8*)eptr, uv) - utf8buf;
8198 if (args && !vectorize) {
8199 eptr = va_arg(*args, char*);
8201 #ifdef MACOS_TRADITIONAL
8202 /* On MacOS, %#s format is used for Pascal strings */
8207 elen = strlen(eptr);
8210 elen = sizeof nullstr - 1;
8214 eptr = SvPVx(argsv, elen);
8215 if (DO_UTF8(argsv)) {
8216 if (has_precis && precis < elen) {
8218 sv_pos_u2b(argsv, &p, 0); /* sticks at end */
8221 if (width) { /* fudge width (can't fudge elen) */
8222 width += elen - sv_len_utf8(argsv);
8231 * The "%_" hack might have to be changed someday,
8232 * if ISO or ANSI decide to use '_' for something.
8233 * So we keep it hidden from users' code.
8235 if (!args || vectorize)
8237 argsv = va_arg(*args, SV*);
8238 eptr = SvPVx(argsv, elen);
8244 if (has_precis && elen > precis)
8251 if (alt || vectorize)
8253 uv = PTR2UV(args ? va_arg(*args, void*) : argsv);
8271 uv = utf8n_to_uvchr(vecstr, veclen, &ulen,
8280 esignbuf[esignlen++] = plus;
8284 case 'h': iv = (short)va_arg(*args, int); break;
8285 default: iv = va_arg(*args, int); break;
8286 case 'l': iv = va_arg(*args, long); break;
8287 case 'V': iv = va_arg(*args, IV); break;
8289 case 'q': iv = va_arg(*args, Quad_t); break;
8296 case 'h': iv = (short)iv; break;
8298 case 'l': iv = (long)iv; break;
8301 case 'q': iv = (Quad_t)iv; break;
8305 if ( !vectorize ) /* we already set uv above */
8310 esignbuf[esignlen++] = plus;
8314 esignbuf[esignlen++] = '-';
8357 uv = utf8n_to_uvchr(vecstr, veclen, &ulen,
8368 case 'h': uv = (unsigned short)va_arg(*args, unsigned); break;
8369 default: uv = va_arg(*args, unsigned); break;
8370 case 'l': uv = va_arg(*args, unsigned long); break;
8371 case 'V': uv = va_arg(*args, UV); break;
8373 case 'q': uv = va_arg(*args, Quad_t); break;
8380 case 'h': uv = (unsigned short)uv; break;
8382 case 'l': uv = (unsigned long)uv; break;
8385 case 'q': uv = (Quad_t)uv; break;
8391 eptr = ebuf + sizeof ebuf;
8397 p = (char*)((c == 'X')
8398 ? "0123456789ABCDEF" : "0123456789abcdef");
8404 esignbuf[esignlen++] = '0';
8405 esignbuf[esignlen++] = c; /* 'x' or 'X' */
8411 *--eptr = '0' + dig;
8413 if (alt && *eptr != '0')
8419 *--eptr = '0' + dig;
8422 esignbuf[esignlen++] = '0';
8423 esignbuf[esignlen++] = 'b';
8426 default: /* it had better be ten or less */
8427 #if defined(PERL_Y2KWARN)
8428 if (ckWARN(WARN_Y2K)) {
8430 char *s = SvPV(sv,n);
8431 if (n >= 2 && s[n-2] == '1' && s[n-1] == '9'
8432 && (n == 2 || !isDIGIT(s[n-3])))
8434 Perl_warner(aTHX_ packWARN(WARN_Y2K),
8435 "Possible Y2K bug: %%%c %s",
8436 c, "format string following '19'");
8442 *--eptr = '0' + dig;
8443 } while (uv /= base);
8446 elen = (ebuf + sizeof ebuf) - eptr;
8449 zeros = precis - elen;
8450 else if (precis == 0 && elen == 1 && *eptr == '0')
8455 /* FLOATING POINT */
8458 c = 'f'; /* maybe %F isn't supported here */
8464 /* This is evil, but floating point is even more evil */
8466 /* for SV-style calling, we can only get NV
8467 for C-style calling, we assume %f is double;
8468 for simplicity we allow any of %Lf, %llf, %qf for long double
8472 #if defined(USE_LONG_DOUBLE)
8477 #if defined(USE_LONG_DOUBLE)
8478 intsize = args ? 0 : 'q';
8482 #if defined(HAS_LONG_DOUBLE)
8493 /* now we need (long double) if intsize == 'q', else (double) */
8494 nv = (args && !vectorize) ?
8495 #if LONG_DOUBLESIZE > DOUBLESIZE
8497 va_arg(*args, long double) :
8498 va_arg(*args, double)
8500 va_arg(*args, double)
8506 if (c != 'e' && c != 'E') {
8508 /* FIXME: if HAS_LONG_DOUBLE but not USE_LONG_DOUBLE this
8509 will cast our (long double) to (double) */
8510 (void)Perl_frexp(nv, &i);
8511 if (i == PERL_INT_MIN)
8512 Perl_die(aTHX_ "panic: frexp");
8514 need = BIT_DIGITS(i);
8516 need += has_precis ? precis : 6; /* known default */
8520 need += 20; /* fudge factor */
8521 if (PL_efloatsize < need) {
8522 Safefree(PL_efloatbuf);
8523 PL_efloatsize = need + 20; /* more fudge */
8524 New(906, PL_efloatbuf, PL_efloatsize, char);
8525 PL_efloatbuf[0] = '\0';
8528 eptr = ebuf + sizeof ebuf;
8531 /* FIXME: what to do if HAS_LONG_DOUBLE but not PERL_PRIfldbl? */
8532 #if defined(HAS_LONG_DOUBLE) && defined(PERL_PRIfldbl)
8533 if (intsize == 'q') {
8534 /* Copy the one or more characters in a long double
8535 * format before the 'base' ([efgEFG]) character to
8536 * the format string. */
8537 static char const prifldbl[] = PERL_PRIfldbl;
8538 char const *p = prifldbl + sizeof(prifldbl) - 3;
8539 while (p >= prifldbl) { *--eptr = *p--; }
8544 do { *--eptr = '0' + (base % 10); } while (base /= 10);
8549 do { *--eptr = '0' + (base % 10); } while (base /= 10);
8561 /* No taint. Otherwise we are in the strange situation
8562 * where printf() taints but print($float) doesn't.
8564 #if defined(HAS_LONG_DOUBLE)
8566 (void)sprintf(PL_efloatbuf, eptr, nv);
8568 (void)sprintf(PL_efloatbuf, eptr, (double)nv);
8570 (void)sprintf(PL_efloatbuf, eptr, nv);
8572 eptr = PL_efloatbuf;
8573 elen = strlen(PL_efloatbuf);
8579 i = SvCUR(sv) - origlen;
8580 if (args && !vectorize) {
8582 case 'h': *(va_arg(*args, short*)) = i; break;
8583 default: *(va_arg(*args, int*)) = i; break;
8584 case 'l': *(va_arg(*args, long*)) = i; break;
8585 case 'V': *(va_arg(*args, IV*)) = i; break;
8587 case 'q': *(va_arg(*args, Quad_t*)) = i; break;
8592 sv_setuv_mg(argsv, (UV)i);
8594 continue; /* not "break" */
8601 if (!args && ckWARN(WARN_PRINTF) &&
8602 (PL_op->op_type == OP_PRTF || PL_op->op_type == OP_SPRINTF)) {
8603 SV *msg = sv_newmortal();
8604 Perl_sv_setpvf(aTHX_ msg, "Invalid conversion in %s: ",
8605 (PL_op->op_type == OP_PRTF) ? "printf" : "sprintf");
8608 Perl_sv_catpvf(aTHX_ msg,
8609 "\"%%%c\"", c & 0xFF);
8611 Perl_sv_catpvf(aTHX_ msg,
8612 "\"%%\\%03"UVof"\"",
8615 sv_catpv(msg, "end of string");
8616 Perl_warner(aTHX_ packWARN(WARN_PRINTF), "%"SVf, msg); /* yes, this is reentrant */
8619 /* output mangled stuff ... */
8625 /* ... right here, because formatting flags should not apply */
8626 SvGROW(sv, SvCUR(sv) + elen + 1);
8628 Copy(eptr, p, elen, char);
8631 SvCUR(sv) = p - SvPVX(sv);
8632 continue; /* not "break" */
8635 if (is_utf8 != has_utf8) {
8638 sv_utf8_upgrade(sv);
8641 SV *nsv = sv_2mortal(newSVpvn(eptr, elen));
8642 sv_utf8_upgrade(nsv);
8646 SvGROW(sv, SvCUR(sv) + elen + 1);
8651 have = esignlen + zeros + elen;
8652 need = (have > width ? have : width);
8655 SvGROW(sv, SvCUR(sv) + need + dotstrlen + 1);
8657 if (esignlen && fill == '0') {
8658 for (i = 0; i < (int)esignlen; i++)
8662 memset(p, fill, gap);
8665 if (esignlen && fill != '0') {
8666 for (i = 0; i < (int)esignlen; i++)
8670 for (i = zeros; i; i--)
8674 Copy(eptr, p, elen, char);
8678 memset(p, ' ', gap);
8683 Copy(dotstr, p, dotstrlen, char);
8687 vectorize = FALSE; /* done iterating over vecstr */
8694 SvCUR(sv) = p - SvPVX(sv);
8702 /* =========================================================================
8704 =head1 Cloning an interpreter
8706 All the macros and functions in this section are for the private use of
8707 the main function, perl_clone().
8709 The foo_dup() functions make an exact copy of an existing foo thinngy.
8710 During the course of a cloning, a hash table is used to map old addresses
8711 to new addresses. The table is created and manipulated with the
8712 ptr_table_* functions.
8716 ============================================================================*/
8719 #if defined(USE_ITHREADS)
8721 #if defined(USE_5005THREADS)
8722 # include "error: USE_5005THREADS and USE_ITHREADS are incompatible"
8725 #ifndef GpREFCNT_inc
8726 # define GpREFCNT_inc(gp) ((gp) ? (++(gp)->gp_refcnt, (gp)) : (GP*)NULL)
8730 #define sv_dup_inc(s,t) SvREFCNT_inc(sv_dup(s,t))
8731 #define av_dup(s,t) (AV*)sv_dup((SV*)s,t)
8732 #define av_dup_inc(s,t) (AV*)SvREFCNT_inc(sv_dup((SV*)s,t))
8733 #define hv_dup(s,t) (HV*)sv_dup((SV*)s,t)
8734 #define hv_dup_inc(s,t) (HV*)SvREFCNT_inc(sv_dup((SV*)s,t))
8735 #define cv_dup(s,t) (CV*)sv_dup((SV*)s,t)
8736 #define cv_dup_inc(s,t) (CV*)SvREFCNT_inc(sv_dup((SV*)s,t))
8737 #define io_dup(s,t) (IO*)sv_dup((SV*)s,t)
8738 #define io_dup_inc(s,t) (IO*)SvREFCNT_inc(sv_dup((SV*)s,t))
8739 #define gv_dup(s,t) (GV*)sv_dup((SV*)s,t)
8740 #define gv_dup_inc(s,t) (GV*)SvREFCNT_inc(sv_dup((SV*)s,t))
8741 #define SAVEPV(p) (p ? savepv(p) : Nullch)
8742 #define SAVEPVN(p,n) (p ? savepvn(p,n) : Nullch)
8745 /* Duplicate a regexp. Required reading: pregcomp() and pregfree() in
8746 regcomp.c. AMS 20010712 */
8749 Perl_re_dup(pTHX_ REGEXP *r, CLONE_PARAMS *param)
8753 struct reg_substr_datum *s;
8756 return (REGEXP *)NULL;
8758 if ((ret = (REGEXP *)ptr_table_fetch(PL_ptr_table, r)))
8761 len = r->offsets[0];
8762 npar = r->nparens+1;
8764 Newc(0, ret, sizeof(regexp) + (len+1)*sizeof(regnode), char, regexp);
8765 Copy(r->program, ret->program, len+1, regnode);
8767 New(0, ret->startp, npar, I32);
8768 Copy(r->startp, ret->startp, npar, I32);
8769 New(0, ret->endp, npar, I32);
8770 Copy(r->startp, ret->startp, npar, I32);
8772 New(0, ret->substrs, 1, struct reg_substr_data);
8773 for (s = ret->substrs->data, i = 0; i < 3; i++, s++) {
8774 s->min_offset = r->substrs->data[i].min_offset;
8775 s->max_offset = r->substrs->data[i].max_offset;
8776 s->substr = sv_dup_inc(r->substrs->data[i].substr, param);
8777 s->utf8_substr = sv_dup_inc(r->substrs->data[i].utf8_substr, param);
8780 ret->regstclass = NULL;
8783 int count = r->data->count;
8785 Newc(0, d, sizeof(struct reg_data) + count*sizeof(void *),
8786 char, struct reg_data);
8787 New(0, d->what, count, U8);
8790 for (i = 0; i < count; i++) {
8791 d->what[i] = r->data->what[i];
8792 switch (d->what[i]) {
8794 d->data[i] = sv_dup_inc((SV *)r->data->data[i], param);
8797 d->data[i] = av_dup_inc((AV *)r->data->data[i], param);
8800 /* This is cheating. */
8801 New(0, d->data[i], 1, struct regnode_charclass_class);
8802 StructCopy(r->data->data[i], d->data[i],
8803 struct regnode_charclass_class);
8804 ret->regstclass = (regnode*)d->data[i];
8807 /* Compiled op trees are readonly, and can thus be
8808 shared without duplication. */
8809 d->data[i] = (void*)OpREFCNT_inc((OP*)r->data->data[i]);
8812 d->data[i] = r->data->data[i];
8822 New(0, ret->offsets, 2*len+1, U32);
8823 Copy(r->offsets, ret->offsets, 2*len+1, U32);
8825 ret->precomp = SAVEPV(r->precomp);
8826 ret->refcnt = r->refcnt;
8827 ret->minlen = r->minlen;
8828 ret->prelen = r->prelen;
8829 ret->nparens = r->nparens;
8830 ret->lastparen = r->lastparen;
8831 ret->lastcloseparen = r->lastcloseparen;
8832 ret->reganch = r->reganch;
8834 ret->sublen = r->sublen;
8836 if (RX_MATCH_COPIED(ret))
8837 ret->subbeg = SAVEPV(r->subbeg);
8839 ret->subbeg = Nullch;
8841 ptr_table_store(PL_ptr_table, r, ret);
8845 /* duplicate a file handle */
8848 Perl_fp_dup(pTHX_ PerlIO *fp, char type, CLONE_PARAMS *param)
8852 return (PerlIO*)NULL;
8854 /* look for it in the table first */
8855 ret = (PerlIO*)ptr_table_fetch(PL_ptr_table, fp);
8859 /* create anew and remember what it is */
8860 ret = PerlIO_fdupopen(aTHX_ fp, param, PERLIO_DUP_CLONE);
8861 ptr_table_store(PL_ptr_table, fp, ret);
8865 /* duplicate a directory handle */
8868 Perl_dirp_dup(pTHX_ DIR *dp)
8876 /* duplicate a typeglob */
8879 Perl_gp_dup(pTHX_ GP *gp, CLONE_PARAMS* param)
8884 /* look for it in the table first */
8885 ret = (GP*)ptr_table_fetch(PL_ptr_table, gp);
8889 /* create anew and remember what it is */
8890 Newz(0, ret, 1, GP);
8891 ptr_table_store(PL_ptr_table, gp, ret);
8894 ret->gp_refcnt = 0; /* must be before any other dups! */
8895 ret->gp_sv = sv_dup_inc(gp->gp_sv, param);
8896 ret->gp_io = io_dup_inc(gp->gp_io, param);
8897 ret->gp_form = cv_dup_inc(gp->gp_form, param);
8898 ret->gp_av = av_dup_inc(gp->gp_av, param);
8899 ret->gp_hv = hv_dup_inc(gp->gp_hv, param);
8900 ret->gp_egv = gv_dup(gp->gp_egv, param);/* GvEGV is not refcounted */
8901 ret->gp_cv = cv_dup_inc(gp->gp_cv, param);
8902 ret->gp_cvgen = gp->gp_cvgen;
8903 ret->gp_flags = gp->gp_flags;
8904 ret->gp_line = gp->gp_line;
8905 ret->gp_file = gp->gp_file; /* points to COP.cop_file */
8909 /* duplicate a chain of magic */
8912 Perl_mg_dup(pTHX_ MAGIC *mg, CLONE_PARAMS* param)
8914 MAGIC *mgprev = (MAGIC*)NULL;
8917 return (MAGIC*)NULL;
8918 /* look for it in the table first */
8919 mgret = (MAGIC*)ptr_table_fetch(PL_ptr_table, mg);
8923 for (; mg; mg = mg->mg_moremagic) {
8925 Newz(0, nmg, 1, MAGIC);
8927 mgprev->mg_moremagic = nmg;
8930 nmg->mg_virtual = mg->mg_virtual; /* XXX copy dynamic vtable? */
8931 nmg->mg_private = mg->mg_private;
8932 nmg->mg_type = mg->mg_type;
8933 nmg->mg_flags = mg->mg_flags;
8934 if (mg->mg_type == PERL_MAGIC_qr) {
8935 nmg->mg_obj = (SV*)re_dup((REGEXP*)mg->mg_obj, param);
8937 else if(mg->mg_type == PERL_MAGIC_backref) {
8938 AV *av = (AV*) mg->mg_obj;
8941 nmg->mg_obj = (SV*)newAV();
8945 av_push((AV*)nmg->mg_obj,sv_dup(svp[i],param));
8950 nmg->mg_obj = (mg->mg_flags & MGf_REFCOUNTED)
8951 ? sv_dup_inc(mg->mg_obj, param)
8952 : sv_dup(mg->mg_obj, param);
8954 nmg->mg_len = mg->mg_len;
8955 nmg->mg_ptr = mg->mg_ptr; /* XXX random ptr? */
8956 if (mg->mg_ptr && mg->mg_type != PERL_MAGIC_regex_global) {
8957 if (mg->mg_len > 0) {
8958 nmg->mg_ptr = SAVEPVN(mg->mg_ptr, mg->mg_len);
8959 if (mg->mg_type == PERL_MAGIC_overload_table &&
8960 AMT_AMAGIC((AMT*)mg->mg_ptr))
8962 AMT *amtp = (AMT*)mg->mg_ptr;
8963 AMT *namtp = (AMT*)nmg->mg_ptr;
8965 for (i = 1; i < NofAMmeth; i++) {
8966 namtp->table[i] = cv_dup_inc(amtp->table[i], param);
8970 else if (mg->mg_len == HEf_SVKEY)
8971 nmg->mg_ptr = (char*)sv_dup_inc((SV*)mg->mg_ptr, param);
8973 if ((mg->mg_flags & MGf_DUP) && mg->mg_virtual && mg->mg_virtual->svt_dup) {
8974 CALL_FPTR(nmg->mg_virtual->svt_dup)(aTHX_ nmg, param);
8981 /* create a new pointer-mapping table */
8984 Perl_ptr_table_new(pTHX)
8987 Newz(0, tbl, 1, PTR_TBL_t);
8990 Newz(0, tbl->tbl_ary, tbl->tbl_max + 1, PTR_TBL_ENT_t*);
8994 /* map an existing pointer using a table */
8997 Perl_ptr_table_fetch(pTHX_ PTR_TBL_t *tbl, void *sv)
8999 PTR_TBL_ENT_t *tblent;
9000 UV hash = PTR2UV(sv);
9002 tblent = tbl->tbl_ary[hash & tbl->tbl_max];
9003 for (; tblent; tblent = tblent->next) {
9004 if (tblent->oldval == sv)
9005 return tblent->newval;
9010 /* add a new entry to a pointer-mapping table */
9013 Perl_ptr_table_store(pTHX_ PTR_TBL_t *tbl, void *oldv, void *newv)
9015 PTR_TBL_ENT_t *tblent, **otblent;
9016 /* XXX this may be pessimal on platforms where pointers aren't good
9017 * hash values e.g. if they grow faster in the most significant
9019 UV hash = PTR2UV(oldv);
9023 otblent = &tbl->tbl_ary[hash & tbl->tbl_max];
9024 for (tblent = *otblent; tblent; i=0, tblent = tblent->next) {
9025 if (tblent->oldval == oldv) {
9026 tblent->newval = newv;
9030 Newz(0, tblent, 1, PTR_TBL_ENT_t);
9031 tblent->oldval = oldv;
9032 tblent->newval = newv;
9033 tblent->next = *otblent;
9036 if (i && tbl->tbl_items > tbl->tbl_max)
9037 ptr_table_split(tbl);
9040 /* double the hash bucket size of an existing ptr table */
9043 Perl_ptr_table_split(pTHX_ PTR_TBL_t *tbl)
9045 PTR_TBL_ENT_t **ary = tbl->tbl_ary;
9046 UV oldsize = tbl->tbl_max + 1;
9047 UV newsize = oldsize * 2;
9050 Renew(ary, newsize, PTR_TBL_ENT_t*);
9051 Zero(&ary[oldsize], newsize-oldsize, PTR_TBL_ENT_t*);
9052 tbl->tbl_max = --newsize;
9054 for (i=0; i < oldsize; i++, ary++) {
9055 PTR_TBL_ENT_t **curentp, **entp, *ent;
9058 curentp = ary + oldsize;
9059 for (entp = ary, ent = *ary; ent; ent = *entp) {
9060 if ((newsize & PTR2UV(ent->oldval)) != i) {
9062 ent->next = *curentp;
9072 /* remove all the entries from a ptr table */
9075 Perl_ptr_table_clear(pTHX_ PTR_TBL_t *tbl)
9077 register PTR_TBL_ENT_t **array;
9078 register PTR_TBL_ENT_t *entry;
9079 register PTR_TBL_ENT_t *oentry = Null(PTR_TBL_ENT_t*);
9083 if (!tbl || !tbl->tbl_items) {
9087 array = tbl->tbl_ary;
9094 entry = entry->next;
9098 if (++riter > max) {
9101 entry = array[riter];
9108 /* clear and free a ptr table */
9111 Perl_ptr_table_free(pTHX_ PTR_TBL_t *tbl)
9116 ptr_table_clear(tbl);
9117 Safefree(tbl->tbl_ary);
9125 /* attempt to make everything in the typeglob readonly */
9128 S_gv_share(pTHX_ SV *sstr, CLONE_PARAMS *param)
9131 SV *sv = ¶m->proto_perl->Isv_no; /* just need SvREADONLY-ness */
9133 if (GvIO(gv) || GvFORM(gv)) {
9134 GvUNIQUE_off(gv); /* GvIOs cannot be shared. nor can GvFORMs */
9136 else if (!GvCV(gv)) {
9140 /* CvPADLISTs cannot be shared */
9141 if (!SvREADONLY(GvCV(gv)) && !CvXSUB(GvCV(gv))) {
9146 if (!GvUNIQUE(gv)) {
9148 PerlIO_printf(Perl_debug_log, "gv_share: unable to share %s::%s\n",
9149 HvNAME(GvSTASH(gv)), GvNAME(gv));
9155 * write attempts will die with
9156 * "Modification of a read-only value attempted"
9162 SvREADONLY_on(GvSV(gv));
9169 SvREADONLY_on(GvAV(gv));
9176 SvREADONLY_on(GvAV(gv));
9179 return sstr; /* he_dup() will SvREFCNT_inc() */
9182 /* duplicate an SV of any type (including AV, HV etc) */
9185 Perl_rvpv_dup(pTHX_ SV *dstr, SV *sstr, CLONE_PARAMS* param)
9188 SvRV(dstr) = SvWEAKREF(sstr)
9189 ? sv_dup(SvRV(sstr), param)
9190 : sv_dup_inc(SvRV(sstr), param);
9192 else if (SvPVX(sstr)) {
9193 /* Has something there */
9195 /* Normal PV - clone whole allocated space */
9196 SvPVX(dstr) = SAVEPVN(SvPVX(sstr), SvLEN(sstr)-1);
9199 /* Special case - not normally malloced for some reason */
9200 if (SvREADONLY(sstr) && SvFAKE(sstr)) {
9201 /* A "shared" PV - clone it as unshared string */
9203 SvREADONLY_off(dstr);
9204 SvPVX(dstr) = SAVEPVN(SvPVX(sstr), SvCUR(sstr));
9207 /* Some other special case - random pointer */
9208 SvPVX(dstr) = SvPVX(sstr);
9214 SvPVX(dstr) = SvPVX(sstr);
9219 Perl_sv_dup(pTHX_ SV *sstr, CLONE_PARAMS* param)
9223 if (!sstr || SvTYPE(sstr) == SVTYPEMASK)
9225 /* look for it in the table first */
9226 dstr = (SV*)ptr_table_fetch(PL_ptr_table, sstr);
9230 /* create anew and remember what it is */
9232 ptr_table_store(PL_ptr_table, sstr, dstr);
9235 SvFLAGS(dstr) = SvFLAGS(sstr);
9236 SvFLAGS(dstr) &= ~SVf_OOK; /* don't propagate OOK hack */
9237 SvREFCNT(dstr) = 0; /* must be before any other dups! */
9240 if (SvANY(sstr) && PL_watch_pvx && SvPVX(sstr) == PL_watch_pvx)
9241 PerlIO_printf(Perl_debug_log, "watch at %p hit, found string \"%s\"\n",
9242 PL_watch_pvx, SvPVX(sstr));
9245 switch (SvTYPE(sstr)) {
9250 SvANY(dstr) = new_XIV();
9251 SvIVX(dstr) = SvIVX(sstr);
9254 SvANY(dstr) = new_XNV();
9255 SvNVX(dstr) = SvNVX(sstr);
9258 SvANY(dstr) = new_XRV();
9259 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
9262 SvANY(dstr) = new_XPV();
9263 SvCUR(dstr) = SvCUR(sstr);
9264 SvLEN(dstr) = SvLEN(sstr);
9265 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
9268 SvANY(dstr) = new_XPVIV();
9269 SvCUR(dstr) = SvCUR(sstr);
9270 SvLEN(dstr) = SvLEN(sstr);
9271 SvIVX(dstr) = SvIVX(sstr);
9272 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
9275 SvANY(dstr) = new_XPVNV();
9276 SvCUR(dstr) = SvCUR(sstr);
9277 SvLEN(dstr) = SvLEN(sstr);
9278 SvIVX(dstr) = SvIVX(sstr);
9279 SvNVX(dstr) = SvNVX(sstr);
9280 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
9283 SvANY(dstr) = new_XPVMG();
9284 SvCUR(dstr) = SvCUR(sstr);
9285 SvLEN(dstr) = SvLEN(sstr);
9286 SvIVX(dstr) = SvIVX(sstr);
9287 SvNVX(dstr) = SvNVX(sstr);
9288 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr), param);
9289 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr), param);
9290 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
9293 SvANY(dstr) = new_XPVBM();
9294 SvCUR(dstr) = SvCUR(sstr);
9295 SvLEN(dstr) = SvLEN(sstr);
9296 SvIVX(dstr) = SvIVX(sstr);
9297 SvNVX(dstr) = SvNVX(sstr);
9298 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr), param);
9299 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr), param);
9300 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
9301 BmRARE(dstr) = BmRARE(sstr);
9302 BmUSEFUL(dstr) = BmUSEFUL(sstr);
9303 BmPREVIOUS(dstr)= BmPREVIOUS(sstr);
9306 SvANY(dstr) = new_XPVLV();
9307 SvCUR(dstr) = SvCUR(sstr);
9308 SvLEN(dstr) = SvLEN(sstr);
9309 SvIVX(dstr) = SvIVX(sstr);
9310 SvNVX(dstr) = SvNVX(sstr);
9311 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr), param);
9312 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr), param);
9313 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
9314 LvTARGOFF(dstr) = LvTARGOFF(sstr); /* XXX sometimes holds PMOP* when DEBUGGING */
9315 LvTARGLEN(dstr) = LvTARGLEN(sstr);
9316 LvTARG(dstr) = sv_dup_inc(LvTARG(sstr), param);
9317 LvTYPE(dstr) = LvTYPE(sstr);
9320 if (GvUNIQUE((GV*)sstr)) {
9322 if ((share = gv_share(sstr, param))) {
9325 ptr_table_store(PL_ptr_table, sstr, dstr);
9327 PerlIO_printf(Perl_debug_log, "sv_dup: sharing %s::%s\n",
9328 HvNAME(GvSTASH(share)), GvNAME(share));
9333 SvANY(dstr) = new_XPVGV();
9334 SvCUR(dstr) = SvCUR(sstr);
9335 SvLEN(dstr) = SvLEN(sstr);
9336 SvIVX(dstr) = SvIVX(sstr);
9337 SvNVX(dstr) = SvNVX(sstr);
9338 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr), param);
9339 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr), param);
9340 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
9341 GvNAMELEN(dstr) = GvNAMELEN(sstr);
9342 GvNAME(dstr) = SAVEPVN(GvNAME(sstr), GvNAMELEN(sstr));
9343 GvSTASH(dstr) = hv_dup_inc(GvSTASH(sstr), param);
9344 GvFLAGS(dstr) = GvFLAGS(sstr);
9345 GvGP(dstr) = gp_dup(GvGP(sstr), param);
9346 (void)GpREFCNT_inc(GvGP(dstr));
9349 SvANY(dstr) = new_XPVIO();
9350 SvCUR(dstr) = SvCUR(sstr);
9351 SvLEN(dstr) = SvLEN(sstr);
9352 SvIVX(dstr) = SvIVX(sstr);
9353 SvNVX(dstr) = SvNVX(sstr);
9354 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr), param);
9355 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr), param);
9356 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
9357 IoIFP(dstr) = fp_dup(IoIFP(sstr), IoTYPE(sstr), param);
9358 if (IoOFP(sstr) == IoIFP(sstr))
9359 IoOFP(dstr) = IoIFP(dstr);
9361 IoOFP(dstr) = fp_dup(IoOFP(sstr), IoTYPE(sstr), param);
9362 /* PL_rsfp_filters entries have fake IoDIRP() */
9363 if (IoDIRP(sstr) && !(IoFLAGS(sstr) & IOf_FAKE_DIRP))
9364 IoDIRP(dstr) = dirp_dup(IoDIRP(sstr));
9366 IoDIRP(dstr) = IoDIRP(sstr);
9367 IoLINES(dstr) = IoLINES(sstr);
9368 IoPAGE(dstr) = IoPAGE(sstr);
9369 IoPAGE_LEN(dstr) = IoPAGE_LEN(sstr);
9370 IoLINES_LEFT(dstr) = IoLINES_LEFT(sstr);
9371 IoTOP_NAME(dstr) = SAVEPV(IoTOP_NAME(sstr));
9372 IoTOP_GV(dstr) = gv_dup(IoTOP_GV(sstr), param);
9373 IoFMT_NAME(dstr) = SAVEPV(IoFMT_NAME(sstr));
9374 IoFMT_GV(dstr) = gv_dup(IoFMT_GV(sstr), param);
9375 IoBOTTOM_NAME(dstr) = SAVEPV(IoBOTTOM_NAME(sstr));
9376 IoBOTTOM_GV(dstr) = gv_dup(IoBOTTOM_GV(sstr), param);
9377 IoSUBPROCESS(dstr) = IoSUBPROCESS(sstr);
9378 IoTYPE(dstr) = IoTYPE(sstr);
9379 IoFLAGS(dstr) = IoFLAGS(sstr);
9382 SvANY(dstr) = new_XPVAV();
9383 SvCUR(dstr) = SvCUR(sstr);
9384 SvLEN(dstr) = SvLEN(sstr);
9385 SvIVX(dstr) = SvIVX(sstr);
9386 SvNVX(dstr) = SvNVX(sstr);
9387 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr), param);
9388 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr), param);
9389 AvARYLEN((AV*)dstr) = sv_dup_inc(AvARYLEN((AV*)sstr), param);
9390 AvFLAGS((AV*)dstr) = AvFLAGS((AV*)sstr);
9391 if (AvARRAY((AV*)sstr)) {
9392 SV **dst_ary, **src_ary;
9393 SSize_t items = AvFILLp((AV*)sstr) + 1;
9395 src_ary = AvARRAY((AV*)sstr);
9396 Newz(0, dst_ary, AvMAX((AV*)sstr)+1, SV*);
9397 ptr_table_store(PL_ptr_table, src_ary, dst_ary);
9398 SvPVX(dstr) = (char*)dst_ary;
9399 AvALLOC((AV*)dstr) = dst_ary;
9400 if (AvREAL((AV*)sstr)) {
9402 *dst_ary++ = sv_dup_inc(*src_ary++, param);
9406 *dst_ary++ = sv_dup(*src_ary++, param);
9408 items = AvMAX((AV*)sstr) - AvFILLp((AV*)sstr);
9409 while (items-- > 0) {
9410 *dst_ary++ = &PL_sv_undef;
9414 SvPVX(dstr) = Nullch;
9415 AvALLOC((AV*)dstr) = (SV**)NULL;
9419 SvANY(dstr) = new_XPVHV();
9420 SvCUR(dstr) = SvCUR(sstr);
9421 SvLEN(dstr) = SvLEN(sstr);
9422 SvIVX(dstr) = SvIVX(sstr);
9423 SvNVX(dstr) = SvNVX(sstr);
9424 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr), param);
9425 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr), param);
9426 HvRITER((HV*)dstr) = HvRITER((HV*)sstr);
9427 if (HvARRAY((HV*)sstr)) {
9429 XPVHV *dxhv = (XPVHV*)SvANY(dstr);
9430 XPVHV *sxhv = (XPVHV*)SvANY(sstr);
9431 Newz(0, dxhv->xhv_array,
9432 PERL_HV_ARRAY_ALLOC_BYTES(dxhv->xhv_max+1), char);
9433 while (i <= sxhv->xhv_max) {
9434 ((HE**)dxhv->xhv_array)[i] = he_dup(((HE**)sxhv->xhv_array)[i],
9435 (bool)!!HvSHAREKEYS(sstr),
9439 dxhv->xhv_eiter = he_dup(sxhv->xhv_eiter,
9440 (bool)!!HvSHAREKEYS(sstr), param);
9443 SvPVX(dstr) = Nullch;
9444 HvEITER((HV*)dstr) = (HE*)NULL;
9446 HvPMROOT((HV*)dstr) = HvPMROOT((HV*)sstr); /* XXX */
9447 HvNAME((HV*)dstr) = SAVEPV(HvNAME((HV*)sstr));
9448 /* Record stashes for possible cloning in Perl_clone(). */
9449 if(HvNAME((HV*)dstr))
9450 av_push(param->stashes, dstr);
9453 SvANY(dstr) = new_XPVFM();
9454 FmLINES(dstr) = FmLINES(sstr);
9458 SvANY(dstr) = new_XPVCV();
9460 SvCUR(dstr) = SvCUR(sstr);
9461 SvLEN(dstr) = SvLEN(sstr);
9462 SvIVX(dstr) = SvIVX(sstr);
9463 SvNVX(dstr) = SvNVX(sstr);
9464 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr), param);
9465 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr), param);
9466 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
9467 CvSTASH(dstr) = hv_dup(CvSTASH(sstr), param); /* NOTE: not refcounted */
9468 CvSTART(dstr) = CvSTART(sstr);
9469 CvROOT(dstr) = OpREFCNT_inc(CvROOT(sstr));
9470 CvXSUB(dstr) = CvXSUB(sstr);
9471 CvXSUBANY(dstr) = CvXSUBANY(sstr);
9472 if (CvCONST(sstr)) {
9473 CvXSUBANY(dstr).any_ptr = GvUNIQUE(CvGV(sstr)) ?
9474 SvREFCNT_inc(CvXSUBANY(sstr).any_ptr) :
9475 sv_dup_inc(CvXSUBANY(sstr).any_ptr, param);
9477 CvGV(dstr) = gv_dup(CvGV(sstr), param);
9478 if (param->flags & CLONEf_COPY_STACKS) {
9479 CvDEPTH(dstr) = CvDEPTH(sstr);
9483 if (CvPADLIST(sstr) && !AvREAL(CvPADLIST(sstr))) {
9484 /* XXX padlists are real, but pretend to be not */
9485 AvREAL_on(CvPADLIST(sstr));
9486 CvPADLIST(dstr) = av_dup_inc(CvPADLIST(sstr), param);
9487 AvREAL_off(CvPADLIST(sstr));
9488 AvREAL_off(CvPADLIST(dstr));
9491 CvPADLIST(dstr) = av_dup_inc(CvPADLIST(sstr), param);
9492 if (!CvANON(sstr) || CvCLONED(sstr))
9493 CvOUTSIDE(dstr) = cv_dup_inc(CvOUTSIDE(sstr), param);
9495 CvOUTSIDE(dstr) = cv_dup(CvOUTSIDE(sstr), param);
9496 CvFLAGS(dstr) = CvFLAGS(sstr);
9497 CvFILE(dstr) = CvXSUB(sstr) ? CvFILE(sstr) : SAVEPV(CvFILE(sstr));
9500 Perl_croak(aTHX_ "Bizarre SvTYPE [%" IVdf "]", (IV)SvTYPE(sstr));
9504 if (SvOBJECT(dstr) && SvTYPE(dstr) != SVt_PVIO)
9510 /* duplicate a context */
9513 Perl_cx_dup(pTHX_ PERL_CONTEXT *cxs, I32 ix, I32 max, CLONE_PARAMS* param)
9518 return (PERL_CONTEXT*)NULL;
9520 /* look for it in the table first */
9521 ncxs = (PERL_CONTEXT*)ptr_table_fetch(PL_ptr_table, cxs);
9525 /* create anew and remember what it is */
9526 Newz(56, ncxs, max + 1, PERL_CONTEXT);
9527 ptr_table_store(PL_ptr_table, cxs, ncxs);
9530 PERL_CONTEXT *cx = &cxs[ix];
9531 PERL_CONTEXT *ncx = &ncxs[ix];
9532 ncx->cx_type = cx->cx_type;
9533 if (CxTYPE(cx) == CXt_SUBST) {
9534 Perl_croak(aTHX_ "Cloning substitution context is unimplemented");
9537 ncx->blk_oldsp = cx->blk_oldsp;
9538 ncx->blk_oldcop = cx->blk_oldcop;
9539 ncx->blk_oldretsp = cx->blk_oldretsp;
9540 ncx->blk_oldmarksp = cx->blk_oldmarksp;
9541 ncx->blk_oldscopesp = cx->blk_oldscopesp;
9542 ncx->blk_oldpm = cx->blk_oldpm;
9543 ncx->blk_gimme = cx->blk_gimme;
9544 switch (CxTYPE(cx)) {
9546 ncx->blk_sub.cv = (cx->blk_sub.olddepth == 0
9547 ? cv_dup_inc(cx->blk_sub.cv, param)
9548 : cv_dup(cx->blk_sub.cv,param));
9549 ncx->blk_sub.argarray = (cx->blk_sub.hasargs
9550 ? av_dup_inc(cx->blk_sub.argarray, param)
9552 ncx->blk_sub.savearray = av_dup_inc(cx->blk_sub.savearray, param);
9553 ncx->blk_sub.olddepth = cx->blk_sub.olddepth;
9554 ncx->blk_sub.hasargs = cx->blk_sub.hasargs;
9555 ncx->blk_sub.lval = cx->blk_sub.lval;
9558 ncx->blk_eval.old_in_eval = cx->blk_eval.old_in_eval;
9559 ncx->blk_eval.old_op_type = cx->blk_eval.old_op_type;
9560 ncx->blk_eval.old_namesv = sv_dup_inc(cx->blk_eval.old_namesv, param);
9561 ncx->blk_eval.old_eval_root = cx->blk_eval.old_eval_root;
9562 ncx->blk_eval.cur_text = sv_dup(cx->blk_eval.cur_text, param);
9565 ncx->blk_loop.label = cx->blk_loop.label;
9566 ncx->blk_loop.resetsp = cx->blk_loop.resetsp;
9567 ncx->blk_loop.redo_op = cx->blk_loop.redo_op;
9568 ncx->blk_loop.next_op = cx->blk_loop.next_op;
9569 ncx->blk_loop.last_op = cx->blk_loop.last_op;
9570 ncx->blk_loop.iterdata = (CxPADLOOP(cx)
9571 ? cx->blk_loop.iterdata
9572 : gv_dup((GV*)cx->blk_loop.iterdata, param));
9573 ncx->blk_loop.oldcurpad
9574 = (SV**)ptr_table_fetch(PL_ptr_table,
9575 cx->blk_loop.oldcurpad);
9576 ncx->blk_loop.itersave = sv_dup_inc(cx->blk_loop.itersave, param);
9577 ncx->blk_loop.iterlval = sv_dup_inc(cx->blk_loop.iterlval, param);
9578 ncx->blk_loop.iterary = av_dup_inc(cx->blk_loop.iterary, param);
9579 ncx->blk_loop.iterix = cx->blk_loop.iterix;
9580 ncx->blk_loop.itermax = cx->blk_loop.itermax;
9583 ncx->blk_sub.cv = cv_dup(cx->blk_sub.cv, param);
9584 ncx->blk_sub.gv = gv_dup(cx->blk_sub.gv, param);
9585 ncx->blk_sub.dfoutgv = gv_dup_inc(cx->blk_sub.dfoutgv, param);
9586 ncx->blk_sub.hasargs = cx->blk_sub.hasargs;
9598 /* duplicate a stack info structure */
9601 Perl_si_dup(pTHX_ PERL_SI *si, CLONE_PARAMS* param)
9606 return (PERL_SI*)NULL;
9608 /* look for it in the table first */
9609 nsi = (PERL_SI*)ptr_table_fetch(PL_ptr_table, si);
9613 /* create anew and remember what it is */
9614 Newz(56, nsi, 1, PERL_SI);
9615 ptr_table_store(PL_ptr_table, si, nsi);
9617 nsi->si_stack = av_dup_inc(si->si_stack, param);
9618 nsi->si_cxix = si->si_cxix;
9619 nsi->si_cxmax = si->si_cxmax;
9620 nsi->si_cxstack = cx_dup(si->si_cxstack, si->si_cxix, si->si_cxmax, param);
9621 nsi->si_type = si->si_type;
9622 nsi->si_prev = si_dup(si->si_prev, param);
9623 nsi->si_next = si_dup(si->si_next, param);
9624 nsi->si_markoff = si->si_markoff;
9629 #define POPINT(ss,ix) ((ss)[--(ix)].any_i32)
9630 #define TOPINT(ss,ix) ((ss)[ix].any_i32)
9631 #define POPLONG(ss,ix) ((ss)[--(ix)].any_long)
9632 #define TOPLONG(ss,ix) ((ss)[ix].any_long)
9633 #define POPIV(ss,ix) ((ss)[--(ix)].any_iv)
9634 #define TOPIV(ss,ix) ((ss)[ix].any_iv)
9635 #define POPPTR(ss,ix) ((ss)[--(ix)].any_ptr)
9636 #define TOPPTR(ss,ix) ((ss)[ix].any_ptr)
9637 #define POPDPTR(ss,ix) ((ss)[--(ix)].any_dptr)
9638 #define TOPDPTR(ss,ix) ((ss)[ix].any_dptr)
9639 #define POPDXPTR(ss,ix) ((ss)[--(ix)].any_dxptr)
9640 #define TOPDXPTR(ss,ix) ((ss)[ix].any_dxptr)
9643 #define pv_dup_inc(p) SAVEPV(p)
9644 #define pv_dup(p) SAVEPV(p)
9645 #define svp_dup_inc(p,pp) any_dup(p,pp)
9647 /* map any object to the new equivent - either something in the
9648 * ptr table, or something in the interpreter structure
9652 Perl_any_dup(pTHX_ void *v, PerlInterpreter *proto_perl)
9659 /* look for it in the table first */
9660 ret = ptr_table_fetch(PL_ptr_table, v);
9664 /* see if it is part of the interpreter structure */
9665 if (v >= (void*)proto_perl && v < (void*)(proto_perl+1))
9666 ret = (void*)(((char*)aTHX) + (((char*)v) - (char*)proto_perl));
9674 /* duplicate the save stack */
9677 Perl_ss_dup(pTHX_ PerlInterpreter *proto_perl, CLONE_PARAMS* param)
9679 ANY *ss = proto_perl->Tsavestack;
9680 I32 ix = proto_perl->Tsavestack_ix;
9681 I32 max = proto_perl->Tsavestack_max;
9694 void (*dptr) (void*);
9695 void (*dxptr) (pTHX_ void*);
9698 Newz(54, nss, max, ANY);
9704 case SAVEt_ITEM: /* normal string */
9705 sv = (SV*)POPPTR(ss,ix);
9706 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
9707 sv = (SV*)POPPTR(ss,ix);
9708 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
9710 case SAVEt_SV: /* scalar reference */
9711 sv = (SV*)POPPTR(ss,ix);
9712 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
9713 gv = (GV*)POPPTR(ss,ix);
9714 TOPPTR(nss,ix) = gv_dup_inc(gv, param);
9716 case SAVEt_GENERIC_PVREF: /* generic char* */
9717 c = (char*)POPPTR(ss,ix);
9718 TOPPTR(nss,ix) = pv_dup(c);
9719 ptr = POPPTR(ss,ix);
9720 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
9722 case SAVEt_SHARED_PVREF: /* char* in shared space */
9723 c = (char*)POPPTR(ss,ix);
9724 TOPPTR(nss,ix) = savesharedpv(c);
9725 ptr = POPPTR(ss,ix);
9726 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
9728 case SAVEt_GENERIC_SVREF: /* generic sv */
9729 case SAVEt_SVREF: /* scalar reference */
9730 sv = (SV*)POPPTR(ss,ix);
9731 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
9732 ptr = POPPTR(ss,ix);
9733 TOPPTR(nss,ix) = svp_dup_inc((SV**)ptr, proto_perl);/* XXXXX */
9735 case SAVEt_AV: /* array reference */
9736 av = (AV*)POPPTR(ss,ix);
9737 TOPPTR(nss,ix) = av_dup_inc(av, param);
9738 gv = (GV*)POPPTR(ss,ix);
9739 TOPPTR(nss,ix) = gv_dup(gv, param);
9741 case SAVEt_HV: /* hash reference */
9742 hv = (HV*)POPPTR(ss,ix);
9743 TOPPTR(nss,ix) = hv_dup_inc(hv, param);
9744 gv = (GV*)POPPTR(ss,ix);
9745 TOPPTR(nss,ix) = gv_dup(gv, param);
9747 case SAVEt_INT: /* int reference */
9748 ptr = POPPTR(ss,ix);
9749 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
9750 intval = (int)POPINT(ss,ix);
9751 TOPINT(nss,ix) = intval;
9753 case SAVEt_LONG: /* long reference */
9754 ptr = POPPTR(ss,ix);
9755 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
9756 longval = (long)POPLONG(ss,ix);
9757 TOPLONG(nss,ix) = longval;
9759 case SAVEt_I32: /* I32 reference */
9760 case SAVEt_I16: /* I16 reference */
9761 case SAVEt_I8: /* I8 reference */
9762 ptr = POPPTR(ss,ix);
9763 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
9767 case SAVEt_IV: /* IV reference */
9768 ptr = POPPTR(ss,ix);
9769 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
9773 case SAVEt_SPTR: /* SV* reference */
9774 ptr = POPPTR(ss,ix);
9775 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
9776 sv = (SV*)POPPTR(ss,ix);
9777 TOPPTR(nss,ix) = sv_dup(sv, param);
9779 case SAVEt_VPTR: /* random* reference */
9780 ptr = POPPTR(ss,ix);
9781 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
9782 ptr = POPPTR(ss,ix);
9783 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
9785 case SAVEt_PPTR: /* char* reference */
9786 ptr = POPPTR(ss,ix);
9787 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
9788 c = (char*)POPPTR(ss,ix);
9789 TOPPTR(nss,ix) = pv_dup(c);
9791 case SAVEt_HPTR: /* HV* reference */
9792 ptr = POPPTR(ss,ix);
9793 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
9794 hv = (HV*)POPPTR(ss,ix);
9795 TOPPTR(nss,ix) = hv_dup(hv, param);
9797 case SAVEt_APTR: /* AV* reference */
9798 ptr = POPPTR(ss,ix);
9799 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
9800 av = (AV*)POPPTR(ss,ix);
9801 TOPPTR(nss,ix) = av_dup(av, param);
9804 gv = (GV*)POPPTR(ss,ix);
9805 TOPPTR(nss,ix) = gv_dup(gv, param);
9807 case SAVEt_GP: /* scalar reference */
9808 gp = (GP*)POPPTR(ss,ix);
9809 TOPPTR(nss,ix) = gp = gp_dup(gp, param);
9810 (void)GpREFCNT_inc(gp);
9811 gv = (GV*)POPPTR(ss,ix);
9812 TOPPTR(nss,ix) = gv_dup_inc(gv, param);
9813 c = (char*)POPPTR(ss,ix);
9814 TOPPTR(nss,ix) = pv_dup(c);
9821 case SAVEt_MORTALIZESV:
9822 sv = (SV*)POPPTR(ss,ix);
9823 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
9826 ptr = POPPTR(ss,ix);
9827 if (ptr && (((OP*)ptr)->op_private & OPpREFCOUNTED)) {
9828 /* these are assumed to be refcounted properly */
9829 switch (((OP*)ptr)->op_type) {
9836 TOPPTR(nss,ix) = ptr;
9841 TOPPTR(nss,ix) = Nullop;
9846 TOPPTR(nss,ix) = Nullop;
9849 c = (char*)POPPTR(ss,ix);
9850 TOPPTR(nss,ix) = pv_dup_inc(c);
9853 longval = POPLONG(ss,ix);
9854 TOPLONG(nss,ix) = longval;
9857 hv = (HV*)POPPTR(ss,ix);
9858 TOPPTR(nss,ix) = hv_dup_inc(hv, param);
9859 c = (char*)POPPTR(ss,ix);
9860 TOPPTR(nss,ix) = pv_dup_inc(c);
9864 case SAVEt_DESTRUCTOR:
9865 ptr = POPPTR(ss,ix);
9866 TOPPTR(nss,ix) = any_dup(ptr, proto_perl); /* XXX quite arbitrary */
9867 dptr = POPDPTR(ss,ix);
9868 TOPDPTR(nss,ix) = (void (*)(void*))any_dup((void *)dptr, proto_perl);
9870 case SAVEt_DESTRUCTOR_X:
9871 ptr = POPPTR(ss,ix);
9872 TOPPTR(nss,ix) = any_dup(ptr, proto_perl); /* XXX quite arbitrary */
9873 dxptr = POPDXPTR(ss,ix);
9874 TOPDXPTR(nss,ix) = (void (*)(pTHX_ void*))any_dup((void *)dxptr, proto_perl);
9876 case SAVEt_REGCONTEXT:
9882 case SAVEt_STACK_POS: /* Position on Perl stack */
9886 case SAVEt_AELEM: /* array element */
9887 sv = (SV*)POPPTR(ss,ix);
9888 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
9891 av = (AV*)POPPTR(ss,ix);
9892 TOPPTR(nss,ix) = av_dup_inc(av, param);
9894 case SAVEt_HELEM: /* hash element */
9895 sv = (SV*)POPPTR(ss,ix);
9896 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
9897 sv = (SV*)POPPTR(ss,ix);
9898 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
9899 hv = (HV*)POPPTR(ss,ix);
9900 TOPPTR(nss,ix) = hv_dup_inc(hv, param);
9903 ptr = POPPTR(ss,ix);
9904 TOPPTR(nss,ix) = ptr;
9911 av = (AV*)POPPTR(ss,ix);
9912 TOPPTR(nss,ix) = av_dup(av, param);
9915 longval = (long)POPLONG(ss,ix);
9916 TOPLONG(nss,ix) = longval;
9917 ptr = POPPTR(ss,ix);
9918 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
9919 sv = (SV*)POPPTR(ss,ix);
9920 TOPPTR(nss,ix) = sv_dup(sv, param);
9923 Perl_croak(aTHX_ "panic: ss_dup inconsistency");
9931 =for apidoc perl_clone
9933 Create and return a new interpreter by cloning the current one.
9938 /* XXX the above needs expanding by someone who actually understands it ! */
9939 EXTERN_C PerlInterpreter *
9940 perl_clone_host(PerlInterpreter* proto_perl, UV flags);
9943 perl_clone(PerlInterpreter *proto_perl, UV flags)
9945 #ifdef PERL_IMPLICIT_SYS
9947 /* perlhost.h so we need to call into it
9948 to clone the host, CPerlHost should have a c interface, sky */
9950 if (flags & CLONEf_CLONE_HOST) {
9951 return perl_clone_host(proto_perl,flags);
9953 return perl_clone_using(proto_perl, flags,
9955 proto_perl->IMemShared,
9956 proto_perl->IMemParse,
9966 perl_clone_using(PerlInterpreter *proto_perl, UV flags,
9967 struct IPerlMem* ipM, struct IPerlMem* ipMS,
9968 struct IPerlMem* ipMP, struct IPerlEnv* ipE,
9969 struct IPerlStdIO* ipStd, struct IPerlLIO* ipLIO,
9970 struct IPerlDir* ipD, struct IPerlSock* ipS,
9971 struct IPerlProc* ipP)
9973 /* XXX many of the string copies here can be optimized if they're
9974 * constants; they need to be allocated as common memory and just
9975 * their pointers copied. */
9978 CLONE_PARAMS clone_params;
9979 CLONE_PARAMS* param = &clone_params;
9981 PerlInterpreter *my_perl = (PerlInterpreter*)(*ipM->pMalloc)(ipM, sizeof(PerlInterpreter));
9982 PERL_SET_THX(my_perl);
9985 Poison(my_perl, 1, PerlInterpreter);
9991 Zero(&PL_debug_pad, 1, struct perl_debug_pad);
9992 # else /* !DEBUGGING */
9993 Zero(my_perl, 1, PerlInterpreter);
9994 # endif /* DEBUGGING */
9998 PL_MemShared = ipMS;
10006 #else /* !PERL_IMPLICIT_SYS */
10008 CLONE_PARAMS clone_params;
10009 CLONE_PARAMS* param = &clone_params;
10010 PerlInterpreter *my_perl = (PerlInterpreter*)PerlMem_malloc(sizeof(PerlInterpreter));
10011 PERL_SET_THX(my_perl);
10016 Poison(my_perl, 1, PerlInterpreter);
10021 PL_sig_pending = 0;
10022 Zero(&PL_debug_pad, 1, struct perl_debug_pad);
10023 # else /* !DEBUGGING */
10024 Zero(my_perl, 1, PerlInterpreter);
10025 # endif /* DEBUGGING */
10026 #endif /* PERL_IMPLICIT_SYS */
10027 param->flags = flags;
10028 param->proto_perl = proto_perl;
10031 PL_xiv_arenaroot = NULL;
10032 PL_xiv_root = NULL;
10033 PL_xnv_arenaroot = NULL;
10034 PL_xnv_root = NULL;
10035 PL_xrv_arenaroot = NULL;
10036 PL_xrv_root = NULL;
10037 PL_xpv_arenaroot = NULL;
10038 PL_xpv_root = NULL;
10039 PL_xpviv_arenaroot = NULL;
10040 PL_xpviv_root = NULL;
10041 PL_xpvnv_arenaroot = NULL;
10042 PL_xpvnv_root = NULL;
10043 PL_xpvcv_arenaroot = NULL;
10044 PL_xpvcv_root = NULL;
10045 PL_xpvav_arenaroot = NULL;
10046 PL_xpvav_root = NULL;
10047 PL_xpvhv_arenaroot = NULL;
10048 PL_xpvhv_root = NULL;
10049 PL_xpvmg_arenaroot = NULL;
10050 PL_xpvmg_root = NULL;
10051 PL_xpvlv_arenaroot = NULL;
10052 PL_xpvlv_root = NULL;
10053 PL_xpvbm_arenaroot = NULL;
10054 PL_xpvbm_root = NULL;
10055 PL_he_arenaroot = NULL;
10057 PL_nice_chunk = NULL;
10058 PL_nice_chunk_size = 0;
10060 PL_sv_objcount = 0;
10061 PL_sv_root = Nullsv;
10062 PL_sv_arenaroot = Nullsv;
10064 PL_debug = proto_perl->Idebug;
10066 #ifdef USE_REENTRANT_API
10067 Perl_reentrant_init(aTHX);
10070 /* create SV map for pointer relocation */
10071 PL_ptr_table = ptr_table_new();
10073 /* initialize these special pointers as early as possible */
10074 SvANY(&PL_sv_undef) = NULL;
10075 SvREFCNT(&PL_sv_undef) = (~(U32)0)/2;
10076 SvFLAGS(&PL_sv_undef) = SVf_READONLY|SVt_NULL;
10077 ptr_table_store(PL_ptr_table, &proto_perl->Isv_undef, &PL_sv_undef);
10079 SvANY(&PL_sv_no) = new_XPVNV();
10080 SvREFCNT(&PL_sv_no) = (~(U32)0)/2;
10081 SvFLAGS(&PL_sv_no) = SVp_NOK|SVf_NOK|SVp_POK|SVf_POK|SVf_READONLY|SVt_PVNV;
10082 SvPVX(&PL_sv_no) = SAVEPVN(PL_No, 0);
10083 SvCUR(&PL_sv_no) = 0;
10084 SvLEN(&PL_sv_no) = 1;
10085 SvNVX(&PL_sv_no) = 0;
10086 ptr_table_store(PL_ptr_table, &proto_perl->Isv_no, &PL_sv_no);
10088 SvANY(&PL_sv_yes) = new_XPVNV();
10089 SvREFCNT(&PL_sv_yes) = (~(U32)0)/2;
10090 SvFLAGS(&PL_sv_yes) = SVp_NOK|SVf_NOK|SVp_POK|SVf_POK|SVf_READONLY|SVt_PVNV;
10091 SvPVX(&PL_sv_yes) = SAVEPVN(PL_Yes, 1);
10092 SvCUR(&PL_sv_yes) = 1;
10093 SvLEN(&PL_sv_yes) = 2;
10094 SvNVX(&PL_sv_yes) = 1;
10095 ptr_table_store(PL_ptr_table, &proto_perl->Isv_yes, &PL_sv_yes);
10097 /* create (a non-shared!) shared string table */
10098 PL_strtab = newHV();
10099 HvSHAREKEYS_off(PL_strtab);
10100 hv_ksplit(PL_strtab, 512);
10101 ptr_table_store(PL_ptr_table, proto_perl->Istrtab, PL_strtab);
10103 PL_compiling = proto_perl->Icompiling;
10105 /* These two PVs will be free'd special way so must set them same way op.c does */
10106 PL_compiling.cop_stashpv = savesharedpv(PL_compiling.cop_stashpv);
10107 ptr_table_store(PL_ptr_table, proto_perl->Icompiling.cop_stashpv, PL_compiling.cop_stashpv);
10109 PL_compiling.cop_file = savesharedpv(PL_compiling.cop_file);
10110 ptr_table_store(PL_ptr_table, proto_perl->Icompiling.cop_file, PL_compiling.cop_file);
10112 ptr_table_store(PL_ptr_table, &proto_perl->Icompiling, &PL_compiling);
10113 if (!specialWARN(PL_compiling.cop_warnings))
10114 PL_compiling.cop_warnings = sv_dup_inc(PL_compiling.cop_warnings, param);
10115 if (!specialCopIO(PL_compiling.cop_io))
10116 PL_compiling.cop_io = sv_dup_inc(PL_compiling.cop_io, param);
10117 PL_curcop = (COP*)any_dup(proto_perl->Tcurcop, proto_perl);
10119 /* pseudo environmental stuff */
10120 PL_origargc = proto_perl->Iorigargc;
10122 New(0, PL_origargv, i+1, char*);
10123 PL_origargv[i] = '\0';
10125 PL_origargv[i] = SAVEPV(proto_perl->Iorigargv[i]);
10128 param->stashes = newAV(); /* Setup array of objects to call clone on */
10130 #ifdef PERLIO_LAYERS
10131 /* Clone PerlIO tables as soon as we can handle general xx_dup() */
10132 PerlIO_clone(aTHX_ proto_perl, param);
10135 PL_envgv = gv_dup(proto_perl->Ienvgv, param);
10136 PL_incgv = gv_dup(proto_perl->Iincgv, param);
10137 PL_hintgv = gv_dup(proto_perl->Ihintgv, param);
10138 PL_origfilename = SAVEPV(proto_perl->Iorigfilename);
10139 PL_diehook = sv_dup_inc(proto_perl->Idiehook, param);
10140 PL_warnhook = sv_dup_inc(proto_perl->Iwarnhook, param);
10143 PL_minus_c = proto_perl->Iminus_c;
10144 PL_patchlevel = sv_dup_inc(proto_perl->Ipatchlevel, param);
10145 PL_localpatches = proto_perl->Ilocalpatches;
10146 PL_splitstr = proto_perl->Isplitstr;
10147 PL_preprocess = proto_perl->Ipreprocess;
10148 PL_minus_n = proto_perl->Iminus_n;
10149 PL_minus_p = proto_perl->Iminus_p;
10150 PL_minus_l = proto_perl->Iminus_l;
10151 PL_minus_a = proto_perl->Iminus_a;
10152 PL_minus_F = proto_perl->Iminus_F;
10153 PL_doswitches = proto_perl->Idoswitches;
10154 PL_dowarn = proto_perl->Idowarn;
10155 PL_doextract = proto_perl->Idoextract;
10156 PL_sawampersand = proto_perl->Isawampersand;
10157 PL_unsafe = proto_perl->Iunsafe;
10158 PL_inplace = SAVEPV(proto_perl->Iinplace);
10159 PL_e_script = sv_dup_inc(proto_perl->Ie_script, param);
10160 PL_perldb = proto_perl->Iperldb;
10161 PL_perl_destruct_level = proto_perl->Iperl_destruct_level;
10162 PL_exit_flags = proto_perl->Iexit_flags;
10164 /* magical thingies */
10165 /* XXX time(&PL_basetime) when asked for? */
10166 PL_basetime = proto_perl->Ibasetime;
10167 PL_formfeed = sv_dup(proto_perl->Iformfeed, param);
10169 PL_maxsysfd = proto_perl->Imaxsysfd;
10170 PL_multiline = proto_perl->Imultiline;
10171 PL_statusvalue = proto_perl->Istatusvalue;
10173 PL_statusvalue_vms = proto_perl->Istatusvalue_vms;
10175 PL_encoding = sv_dup(proto_perl->Iencoding, param);
10177 sv_setpvn(PERL_DEBUG_PAD(0), "", 0); /* For regex debugging. */
10178 sv_setpvn(PERL_DEBUG_PAD(1), "", 0); /* ext/re needs these */
10179 sv_setpvn(PERL_DEBUG_PAD(2), "", 0); /* even without DEBUGGING. */
10181 /* Clone the regex array */
10182 PL_regex_padav = newAV();
10184 I32 len = av_len((AV*)proto_perl->Iregex_padav);
10185 SV** regexen = AvARRAY((AV*)proto_perl->Iregex_padav);
10186 av_push(PL_regex_padav,
10187 sv_dup_inc(regexen[0],param));
10188 for(i = 1; i <= len; i++) {
10189 if(SvREPADTMP(regexen[i])) {
10190 av_push(PL_regex_padav, sv_dup_inc(regexen[i], param));
10192 av_push(PL_regex_padav,
10194 newSViv(PTR2IV(re_dup(INT2PTR(REGEXP *,
10195 SvIVX(regexen[i])), param)))
10200 PL_regex_pad = AvARRAY(PL_regex_padav);
10202 /* shortcuts to various I/O objects */
10203 PL_stdingv = gv_dup(proto_perl->Istdingv, param);
10204 PL_stderrgv = gv_dup(proto_perl->Istderrgv, param);
10205 PL_defgv = gv_dup(proto_perl->Idefgv, param);
10206 PL_argvgv = gv_dup(proto_perl->Iargvgv, param);
10207 PL_argvoutgv = gv_dup(proto_perl->Iargvoutgv, param);
10208 PL_argvout_stack = av_dup_inc(proto_perl->Iargvout_stack, param);
10210 /* shortcuts to regexp stuff */
10211 PL_replgv = gv_dup(proto_perl->Ireplgv, param);
10213 /* shortcuts to misc objects */
10214 PL_errgv = gv_dup(proto_perl->Ierrgv, param);
10216 /* shortcuts to debugging objects */
10217 PL_DBgv = gv_dup(proto_perl->IDBgv, param);
10218 PL_DBline = gv_dup(proto_perl->IDBline, param);
10219 PL_DBsub = gv_dup(proto_perl->IDBsub, param);
10220 PL_DBsingle = sv_dup(proto_perl->IDBsingle, param);
10221 PL_DBtrace = sv_dup(proto_perl->IDBtrace, param);
10222 PL_DBsignal = sv_dup(proto_perl->IDBsignal, param);
10223 PL_lineary = av_dup(proto_perl->Ilineary, param);
10224 PL_dbargs = av_dup(proto_perl->Idbargs, param);
10226 /* symbol tables */
10227 PL_defstash = hv_dup_inc(proto_perl->Tdefstash, param);
10228 PL_curstash = hv_dup(proto_perl->Tcurstash, param);
10229 PL_nullstash = hv_dup(proto_perl->Inullstash, param);
10230 PL_debstash = hv_dup(proto_perl->Idebstash, param);
10231 PL_globalstash = hv_dup(proto_perl->Iglobalstash, param);
10232 PL_curstname = sv_dup_inc(proto_perl->Icurstname, param);
10234 PL_beginav = av_dup_inc(proto_perl->Ibeginav, param);
10235 PL_beginav_save = av_dup_inc(proto_perl->Ibeginav_save, param);
10236 PL_checkav_save = av_dup_inc(proto_perl->Icheckav_save, param);
10237 PL_endav = av_dup_inc(proto_perl->Iendav, param);
10238 PL_checkav = av_dup_inc(proto_perl->Icheckav, param);
10239 PL_initav = av_dup_inc(proto_perl->Iinitav, param);
10241 PL_sub_generation = proto_perl->Isub_generation;
10243 /* funky return mechanisms */
10244 PL_forkprocess = proto_perl->Iforkprocess;
10246 /* subprocess state */
10247 PL_fdpid = av_dup_inc(proto_perl->Ifdpid, param);
10249 /* internal state */
10250 PL_tainting = proto_perl->Itainting;
10251 PL_maxo = proto_perl->Imaxo;
10252 if (proto_perl->Iop_mask)
10253 PL_op_mask = SAVEPVN(proto_perl->Iop_mask, PL_maxo);
10255 PL_op_mask = Nullch;
10257 /* current interpreter roots */
10258 PL_main_cv = cv_dup_inc(proto_perl->Imain_cv, param);
10259 PL_main_root = OpREFCNT_inc(proto_perl->Imain_root);
10260 PL_main_start = proto_perl->Imain_start;
10261 PL_eval_root = proto_perl->Ieval_root;
10262 PL_eval_start = proto_perl->Ieval_start;
10264 /* runtime control stuff */
10265 PL_curcopdb = (COP*)any_dup(proto_perl->Icurcopdb, proto_perl);
10266 PL_copline = proto_perl->Icopline;
10268 PL_filemode = proto_perl->Ifilemode;
10269 PL_lastfd = proto_perl->Ilastfd;
10270 PL_oldname = proto_perl->Ioldname; /* XXX not quite right */
10273 PL_gensym = proto_perl->Igensym;
10274 PL_preambled = proto_perl->Ipreambled;
10275 PL_preambleav = av_dup_inc(proto_perl->Ipreambleav, param);
10276 PL_laststatval = proto_perl->Ilaststatval;
10277 PL_laststype = proto_perl->Ilaststype;
10278 PL_mess_sv = Nullsv;
10280 PL_ors_sv = sv_dup_inc(proto_perl->Iors_sv, param);
10281 PL_ofmt = SAVEPV(proto_perl->Iofmt);
10283 /* interpreter atexit processing */
10284 PL_exitlistlen = proto_perl->Iexitlistlen;
10285 if (PL_exitlistlen) {
10286 New(0, PL_exitlist, PL_exitlistlen, PerlExitListEntry);
10287 Copy(proto_perl->Iexitlist, PL_exitlist, PL_exitlistlen, PerlExitListEntry);
10290 PL_exitlist = (PerlExitListEntry*)NULL;
10291 PL_modglobal = hv_dup_inc(proto_perl->Imodglobal, param);
10292 PL_custom_op_names = hv_dup_inc(proto_perl->Icustom_op_names,param);
10293 PL_custom_op_descs = hv_dup_inc(proto_perl->Icustom_op_descs,param);
10295 PL_profiledata = NULL;
10296 PL_rsfp = fp_dup(proto_perl->Irsfp, '<', param);
10297 /* PL_rsfp_filters entries have fake IoDIRP() */
10298 PL_rsfp_filters = av_dup_inc(proto_perl->Irsfp_filters, param);
10300 PL_compcv = cv_dup(proto_perl->Icompcv, param);
10301 PL_comppad = av_dup(proto_perl->Icomppad, param);
10302 PL_comppad_name = av_dup(proto_perl->Icomppad_name, param);
10303 PL_comppad_name_fill = proto_perl->Icomppad_name_fill;
10304 PL_comppad_name_floor = proto_perl->Icomppad_name_floor;
10305 PL_curpad = (SV**)ptr_table_fetch(PL_ptr_table,
10306 proto_perl->Tcurpad);
10308 #ifdef HAVE_INTERP_INTERN
10309 sys_intern_dup(&proto_perl->Isys_intern, &PL_sys_intern);
10312 /* more statics moved here */
10313 PL_generation = proto_perl->Igeneration;
10314 PL_DBcv = cv_dup(proto_perl->IDBcv, param);
10316 PL_in_clean_objs = proto_perl->Iin_clean_objs;
10317 PL_in_clean_all = proto_perl->Iin_clean_all;
10319 PL_uid = proto_perl->Iuid;
10320 PL_euid = proto_perl->Ieuid;
10321 PL_gid = proto_perl->Igid;
10322 PL_egid = proto_perl->Iegid;
10323 PL_nomemok = proto_perl->Inomemok;
10324 PL_an = proto_perl->Ian;
10325 PL_cop_seqmax = proto_perl->Icop_seqmax;
10326 PL_op_seqmax = proto_perl->Iop_seqmax;
10327 PL_evalseq = proto_perl->Ievalseq;
10328 PL_origenviron = proto_perl->Iorigenviron; /* XXX not quite right */
10329 PL_origalen = proto_perl->Iorigalen;
10330 PL_pidstatus = newHV(); /* XXX flag for cloning? */
10331 PL_osname = SAVEPV(proto_perl->Iosname);
10332 PL_sh_path = proto_perl->Ish_path; /* XXX never deallocated */
10333 PL_sighandlerp = proto_perl->Isighandlerp;
10336 PL_runops = proto_perl->Irunops;
10338 Copy(proto_perl->Itokenbuf, PL_tokenbuf, 256, char);
10341 PL_cshlen = proto_perl->Icshlen;
10342 PL_cshname = proto_perl->Icshname; /* XXX never deallocated */
10345 PL_lex_state = proto_perl->Ilex_state;
10346 PL_lex_defer = proto_perl->Ilex_defer;
10347 PL_lex_expect = proto_perl->Ilex_expect;
10348 PL_lex_formbrack = proto_perl->Ilex_formbrack;
10349 PL_lex_dojoin = proto_perl->Ilex_dojoin;
10350 PL_lex_starts = proto_perl->Ilex_starts;
10351 PL_lex_stuff = sv_dup_inc(proto_perl->Ilex_stuff, param);
10352 PL_lex_repl = sv_dup_inc(proto_perl->Ilex_repl, param);
10353 PL_lex_op = proto_perl->Ilex_op;
10354 PL_lex_inpat = proto_perl->Ilex_inpat;
10355 PL_lex_inwhat = proto_perl->Ilex_inwhat;
10356 PL_lex_brackets = proto_perl->Ilex_brackets;
10357 i = (PL_lex_brackets < 120 ? 120 : PL_lex_brackets);
10358 PL_lex_brackstack = SAVEPVN(proto_perl->Ilex_brackstack,i);
10359 PL_lex_casemods = proto_perl->Ilex_casemods;
10360 i = (PL_lex_casemods < 12 ? 12 : PL_lex_casemods);
10361 PL_lex_casestack = SAVEPVN(proto_perl->Ilex_casestack,i);
10363 Copy(proto_perl->Inextval, PL_nextval, 5, YYSTYPE);
10364 Copy(proto_perl->Inexttype, PL_nexttype, 5, I32);
10365 PL_nexttoke = proto_perl->Inexttoke;
10367 /* XXX This is probably masking the deeper issue of why
10368 * SvANY(proto_perl->Ilinestr) can be NULL at this point. For test case:
10369 * http://archive.develooper.com/perl5-porters%40perl.org/msg83298.html
10370 * (A little debugging with a watchpoint on it may help.)
10372 if (SvANY(proto_perl->Ilinestr)) {
10373 PL_linestr = sv_dup_inc(proto_perl->Ilinestr, param);
10374 i = proto_perl->Ibufptr - SvPVX(proto_perl->Ilinestr);
10375 PL_bufptr = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
10376 i = proto_perl->Ioldbufptr - SvPVX(proto_perl->Ilinestr);
10377 PL_oldbufptr = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
10378 i = proto_perl->Ioldoldbufptr - SvPVX(proto_perl->Ilinestr);
10379 PL_oldoldbufptr = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
10380 i = proto_perl->Ilinestart - SvPVX(proto_perl->Ilinestr);
10381 PL_linestart = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
10384 PL_linestr = NEWSV(65,79);
10385 sv_upgrade(PL_linestr,SVt_PVIV);
10386 sv_setpvn(PL_linestr,"",0);
10387 PL_bufptr = PL_oldbufptr = PL_oldoldbufptr = PL_linestart = SvPVX(PL_linestr);
10389 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
10390 PL_pending_ident = proto_perl->Ipending_ident;
10391 PL_sublex_info = proto_perl->Isublex_info; /* XXX not quite right */
10393 PL_expect = proto_perl->Iexpect;
10395 PL_multi_start = proto_perl->Imulti_start;
10396 PL_multi_end = proto_perl->Imulti_end;
10397 PL_multi_open = proto_perl->Imulti_open;
10398 PL_multi_close = proto_perl->Imulti_close;
10400 PL_error_count = proto_perl->Ierror_count;
10401 PL_subline = proto_perl->Isubline;
10402 PL_subname = sv_dup_inc(proto_perl->Isubname, param);
10404 PL_min_intro_pending = proto_perl->Imin_intro_pending;
10405 PL_max_intro_pending = proto_perl->Imax_intro_pending;
10406 PL_padix = proto_perl->Ipadix;
10407 PL_padix_floor = proto_perl->Ipadix_floor;
10408 PL_pad_reset_pending = proto_perl->Ipad_reset_pending;
10410 /* XXX See comment on SvANY(proto_perl->Ilinestr) above */
10411 if (SvANY(proto_perl->Ilinestr)) {
10412 i = proto_perl->Ilast_uni - SvPVX(proto_perl->Ilinestr);
10413 PL_last_uni = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
10414 i = proto_perl->Ilast_lop - SvPVX(proto_perl->Ilinestr);
10415 PL_last_lop = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
10416 PL_last_lop_op = proto_perl->Ilast_lop_op;
10419 PL_last_uni = SvPVX(PL_linestr);
10420 PL_last_lop = SvPVX(PL_linestr);
10421 PL_last_lop_op = 0;
10423 PL_in_my = proto_perl->Iin_my;
10424 PL_in_my_stash = hv_dup(proto_perl->Iin_my_stash, param);
10426 PL_cryptseen = proto_perl->Icryptseen;
10429 PL_hints = proto_perl->Ihints;
10431 PL_amagic_generation = proto_perl->Iamagic_generation;
10433 #ifdef USE_LOCALE_COLLATE
10434 PL_collation_ix = proto_perl->Icollation_ix;
10435 PL_collation_name = SAVEPV(proto_perl->Icollation_name);
10436 PL_collation_standard = proto_perl->Icollation_standard;
10437 PL_collxfrm_base = proto_perl->Icollxfrm_base;
10438 PL_collxfrm_mult = proto_perl->Icollxfrm_mult;
10439 #endif /* USE_LOCALE_COLLATE */
10441 #ifdef USE_LOCALE_NUMERIC
10442 PL_numeric_name = SAVEPV(proto_perl->Inumeric_name);
10443 PL_numeric_standard = proto_perl->Inumeric_standard;
10444 PL_numeric_local = proto_perl->Inumeric_local;
10445 PL_numeric_radix_sv = sv_dup_inc(proto_perl->Inumeric_radix_sv, param);
10446 #endif /* !USE_LOCALE_NUMERIC */
10448 /* utf8 character classes */
10449 PL_utf8_alnum = sv_dup_inc(proto_perl->Iutf8_alnum, param);
10450 PL_utf8_alnumc = sv_dup_inc(proto_perl->Iutf8_alnumc, param);
10451 PL_utf8_ascii = sv_dup_inc(proto_perl->Iutf8_ascii, param);
10452 PL_utf8_alpha = sv_dup_inc(proto_perl->Iutf8_alpha, param);
10453 PL_utf8_space = sv_dup_inc(proto_perl->Iutf8_space, param);
10454 PL_utf8_cntrl = sv_dup_inc(proto_perl->Iutf8_cntrl, param);
10455 PL_utf8_graph = sv_dup_inc(proto_perl->Iutf8_graph, param);
10456 PL_utf8_digit = sv_dup_inc(proto_perl->Iutf8_digit, param);
10457 PL_utf8_upper = sv_dup_inc(proto_perl->Iutf8_upper, param);
10458 PL_utf8_lower = sv_dup_inc(proto_perl->Iutf8_lower, param);
10459 PL_utf8_print = sv_dup_inc(proto_perl->Iutf8_print, param);
10460 PL_utf8_punct = sv_dup_inc(proto_perl->Iutf8_punct, param);
10461 PL_utf8_xdigit = sv_dup_inc(proto_perl->Iutf8_xdigit, param);
10462 PL_utf8_mark = sv_dup_inc(proto_perl->Iutf8_mark, param);
10463 PL_utf8_toupper = sv_dup_inc(proto_perl->Iutf8_toupper, param);
10464 PL_utf8_totitle = sv_dup_inc(proto_perl->Iutf8_totitle, param);
10465 PL_utf8_tolower = sv_dup_inc(proto_perl->Iutf8_tolower, param);
10466 PL_utf8_tofold = sv_dup_inc(proto_perl->Iutf8_tofold, param);
10467 PL_utf8_idstart = sv_dup_inc(proto_perl->Iutf8_idstart, param);
10468 PL_utf8_idcont = sv_dup_inc(proto_perl->Iutf8_idcont, param);
10471 PL_last_swash_hv = Nullhv; /* reinits on demand */
10472 PL_last_swash_klen = 0;
10473 PL_last_swash_key[0]= '\0';
10474 PL_last_swash_tmps = (U8*)NULL;
10475 PL_last_swash_slen = 0;
10477 /* perly.c globals */
10478 PL_yydebug = proto_perl->Iyydebug;
10479 PL_yynerrs = proto_perl->Iyynerrs;
10480 PL_yyerrflag = proto_perl->Iyyerrflag;
10481 PL_yychar = proto_perl->Iyychar;
10482 PL_yyval = proto_perl->Iyyval;
10483 PL_yylval = proto_perl->Iyylval;
10485 PL_glob_index = proto_perl->Iglob_index;
10486 PL_srand_called = proto_perl->Isrand_called;
10487 PL_uudmap['M'] = 0; /* reinits on demand */
10488 PL_bitcount = Nullch; /* reinits on demand */
10490 if (proto_perl->Ipsig_pend) {
10491 Newz(0, PL_psig_pend, SIG_SIZE, int);
10494 PL_psig_pend = (int*)NULL;
10497 if (proto_perl->Ipsig_ptr) {
10498 Newz(0, PL_psig_ptr, SIG_SIZE, SV*);
10499 Newz(0, PL_psig_name, SIG_SIZE, SV*);
10500 for (i = 1; i < SIG_SIZE; i++) {
10501 PL_psig_ptr[i] = sv_dup_inc(proto_perl->Ipsig_ptr[i], param);
10502 PL_psig_name[i] = sv_dup_inc(proto_perl->Ipsig_name[i], param);
10506 PL_psig_ptr = (SV**)NULL;
10507 PL_psig_name = (SV**)NULL;
10510 /* thrdvar.h stuff */
10512 if (flags & CLONEf_COPY_STACKS) {
10513 /* next allocation will be PL_tmps_stack[PL_tmps_ix+1] */
10514 PL_tmps_ix = proto_perl->Ttmps_ix;
10515 PL_tmps_max = proto_perl->Ttmps_max;
10516 PL_tmps_floor = proto_perl->Ttmps_floor;
10517 Newz(50, PL_tmps_stack, PL_tmps_max, SV*);
10519 while (i <= PL_tmps_ix) {
10520 PL_tmps_stack[i] = sv_dup_inc(proto_perl->Ttmps_stack[i], param);
10524 /* next PUSHMARK() sets *(PL_markstack_ptr+1) */
10525 i = proto_perl->Tmarkstack_max - proto_perl->Tmarkstack;
10526 Newz(54, PL_markstack, i, I32);
10527 PL_markstack_max = PL_markstack + (proto_perl->Tmarkstack_max
10528 - proto_perl->Tmarkstack);
10529 PL_markstack_ptr = PL_markstack + (proto_perl->Tmarkstack_ptr
10530 - proto_perl->Tmarkstack);
10531 Copy(proto_perl->Tmarkstack, PL_markstack,
10532 PL_markstack_ptr - PL_markstack + 1, I32);
10534 /* next push_scope()/ENTER sets PL_scopestack[PL_scopestack_ix]
10535 * NOTE: unlike the others! */
10536 PL_scopestack_ix = proto_perl->Tscopestack_ix;
10537 PL_scopestack_max = proto_perl->Tscopestack_max;
10538 Newz(54, PL_scopestack, PL_scopestack_max, I32);
10539 Copy(proto_perl->Tscopestack, PL_scopestack, PL_scopestack_ix, I32);
10541 /* next push_return() sets PL_retstack[PL_retstack_ix]
10542 * NOTE: unlike the others! */
10543 PL_retstack_ix = proto_perl->Tretstack_ix;
10544 PL_retstack_max = proto_perl->Tretstack_max;
10545 Newz(54, PL_retstack, PL_retstack_max, OP*);
10546 Copy(proto_perl->Tretstack, PL_retstack, PL_retstack_ix, OP*);
10548 /* NOTE: si_dup() looks at PL_markstack */
10549 PL_curstackinfo = si_dup(proto_perl->Tcurstackinfo, param);
10551 /* PL_curstack = PL_curstackinfo->si_stack; */
10552 PL_curstack = av_dup(proto_perl->Tcurstack, param);
10553 PL_mainstack = av_dup(proto_perl->Tmainstack, param);
10555 /* next PUSHs() etc. set *(PL_stack_sp+1) */
10556 PL_stack_base = AvARRAY(PL_curstack);
10557 PL_stack_sp = PL_stack_base + (proto_perl->Tstack_sp
10558 - proto_perl->Tstack_base);
10559 PL_stack_max = PL_stack_base + AvMAX(PL_curstack);
10561 /* next SSPUSHFOO() sets PL_savestack[PL_savestack_ix]
10562 * NOTE: unlike the others! */
10563 PL_savestack_ix = proto_perl->Tsavestack_ix;
10564 PL_savestack_max = proto_perl->Tsavestack_max;
10565 /*Newz(54, PL_savestack, PL_savestack_max, ANY);*/
10566 PL_savestack = ss_dup(proto_perl, param);
10570 ENTER; /* perl_destruct() wants to LEAVE; */
10573 PL_start_env = proto_perl->Tstart_env; /* XXXXXX */
10574 PL_top_env = &PL_start_env;
10576 PL_op = proto_perl->Top;
10579 PL_Xpv = (XPV*)NULL;
10580 PL_na = proto_perl->Tna;
10582 PL_statbuf = proto_perl->Tstatbuf;
10583 PL_statcache = proto_perl->Tstatcache;
10584 PL_statgv = gv_dup(proto_perl->Tstatgv, param);
10585 PL_statname = sv_dup_inc(proto_perl->Tstatname, param);
10587 PL_timesbuf = proto_perl->Ttimesbuf;
10590 PL_tainted = proto_perl->Ttainted;
10591 PL_curpm = proto_perl->Tcurpm; /* XXX No PMOP ref count */
10592 PL_rs = sv_dup_inc(proto_perl->Trs, param);
10593 PL_last_in_gv = gv_dup(proto_perl->Tlast_in_gv, param);
10594 PL_ofs_sv = sv_dup_inc(proto_perl->Tofs_sv, param);
10595 PL_defoutgv = gv_dup_inc(proto_perl->Tdefoutgv, param);
10596 PL_chopset = proto_perl->Tchopset; /* XXX never deallocated */
10597 PL_toptarget = sv_dup_inc(proto_perl->Ttoptarget, param);
10598 PL_bodytarget = sv_dup_inc(proto_perl->Tbodytarget, param);
10599 PL_formtarget = sv_dup(proto_perl->Tformtarget, param);
10601 PL_restartop = proto_perl->Trestartop;
10602 PL_in_eval = proto_perl->Tin_eval;
10603 PL_delaymagic = proto_perl->Tdelaymagic;
10604 PL_dirty = proto_perl->Tdirty;
10605 PL_localizing = proto_perl->Tlocalizing;
10607 #ifdef PERL_FLEXIBLE_EXCEPTIONS
10608 PL_protect = proto_perl->Tprotect;
10610 PL_errors = sv_dup_inc(proto_perl->Terrors, param);
10611 PL_av_fetch_sv = Nullsv;
10612 PL_hv_fetch_sv = Nullsv;
10613 Zero(&PL_hv_fetch_ent_mh, 1, HE); /* XXX */
10614 PL_modcount = proto_perl->Tmodcount;
10615 PL_lastgotoprobe = Nullop;
10616 PL_dumpindent = proto_perl->Tdumpindent;
10618 PL_sortcop = (OP*)any_dup(proto_perl->Tsortcop, proto_perl);
10619 PL_sortstash = hv_dup(proto_perl->Tsortstash, param);
10620 PL_firstgv = gv_dup(proto_perl->Tfirstgv, param);
10621 PL_secondgv = gv_dup(proto_perl->Tsecondgv, param);
10622 PL_sortcxix = proto_perl->Tsortcxix;
10623 PL_efloatbuf = Nullch; /* reinits on demand */
10624 PL_efloatsize = 0; /* reinits on demand */
10628 PL_screamfirst = NULL;
10629 PL_screamnext = NULL;
10630 PL_maxscream = -1; /* reinits on demand */
10631 PL_lastscream = Nullsv;
10633 PL_watchaddr = NULL;
10634 PL_watchok = Nullch;
10636 PL_regdummy = proto_perl->Tregdummy;
10637 PL_regcomp_parse = Nullch;
10638 PL_regxend = Nullch;
10639 PL_regcode = (regnode*)NULL;
10642 PL_regprecomp = Nullch;
10647 PL_seen_zerolen = 0;
10649 PL_regcomp_rx = (regexp*)NULL;
10651 PL_colorset = 0; /* reinits PL_colors[] */
10652 /*PL_colors[6] = {0,0,0,0,0,0};*/
10653 PL_reg_whilem_seen = 0;
10654 PL_reginput = Nullch;
10655 PL_regbol = Nullch;
10656 PL_regeol = Nullch;
10657 PL_regstartp = (I32*)NULL;
10658 PL_regendp = (I32*)NULL;
10659 PL_reglastparen = (U32*)NULL;
10660 PL_regtill = Nullch;
10661 PL_reg_start_tmp = (char**)NULL;
10662 PL_reg_start_tmpl = 0;
10663 PL_regdata = (struct reg_data*)NULL;
10666 PL_reg_eval_set = 0;
10668 PL_regprogram = (regnode*)NULL;
10670 PL_regcc = (CURCUR*)NULL;
10671 PL_reg_call_cc = (struct re_cc_state*)NULL;
10672 PL_reg_re = (regexp*)NULL;
10673 PL_reg_ganch = Nullch;
10674 PL_reg_sv = Nullsv;
10675 PL_reg_match_utf8 = FALSE;
10676 PL_reg_magic = (MAGIC*)NULL;
10678 PL_reg_oldcurpm = (PMOP*)NULL;
10679 PL_reg_curpm = (PMOP*)NULL;
10680 PL_reg_oldsaved = Nullch;
10681 PL_reg_oldsavedlen = 0;
10682 PL_reg_maxiter = 0;
10683 PL_reg_leftiter = 0;
10684 PL_reg_poscache = Nullch;
10685 PL_reg_poscache_size= 0;
10687 /* RE engine - function pointers */
10688 PL_regcompp = proto_perl->Tregcompp;
10689 PL_regexecp = proto_perl->Tregexecp;
10690 PL_regint_start = proto_perl->Tregint_start;
10691 PL_regint_string = proto_perl->Tregint_string;
10692 PL_regfree = proto_perl->Tregfree;
10694 PL_reginterp_cnt = 0;
10695 PL_reg_starttry = 0;
10697 /* Pluggable optimizer */
10698 PL_peepp = proto_perl->Tpeepp;
10700 if (!(flags & CLONEf_KEEP_PTR_TABLE)) {
10701 ptr_table_free(PL_ptr_table);
10702 PL_ptr_table = NULL;
10705 /* Call the ->CLONE method, if it exists, for each of the stashes
10706 identified by sv_dup() above.
10708 while(av_len(param->stashes) != -1) {
10709 HV* stash = (HV*) av_shift(param->stashes);
10710 GV* cloner = gv_fetchmethod_autoload(stash, "CLONE", 0);
10711 if (cloner && GvCV(cloner)) {
10716 XPUSHs(sv_2mortal(newSVpv(HvNAME(stash), 0)));
10718 call_sv((SV*)GvCV(cloner), G_DISCARD);
10724 SvREFCNT_dec(param->stashes);
10729 #endif /* USE_ITHREADS */
10732 =head1 Unicode Support
10734 =for apidoc sv_recode_to_utf8
10736 The encoding is assumed to be an Encode object, on entry the PV
10737 of the sv is assumed to be octets in that encoding, and the sv
10738 will be converted into Unicode (and UTF-8).
10740 If the sv already is UTF-8 (or if it is not POK), or if the encoding
10741 is not a reference, nothing is done to the sv. If the encoding is not
10742 an C<Encode::XS> Encoding object, bad things will happen.
10743 (See F<lib/encoding.pm> and L<Encode>).
10745 The PV of the sv is returned.
10750 Perl_sv_recode_to_utf8(pTHX_ SV *sv, SV *encoding)
10752 if (SvPOK(sv) && !DO_UTF8(sv) && SvROK(encoding)) {
10765 Passing sv_yes is wrong - it needs to be or'ed set of constants
10766 for Encode::XS, while UTf-8 decode (currently) assumes a true value means
10767 remove converted chars from source.
10769 Both will default the value - let them.
10771 XPUSHs(&PL_sv_yes);
10774 call_method("decode", G_SCALAR);
10778 s = SvPV(uni, len);
10779 if (s != SvPVX(sv)) {
10780 SvGROW(sv, len + 1);
10781 Move(s, SvPVX(sv), len, char);
10782 SvCUR_set(sv, len);
10783 SvPVX(sv)[len] = 0;