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|SVs_RMG|SVf_IOK|SVf_NOK| \
31 SVf_POK|SVf_ROK|SVp_IOK|SVp_NOK|SVp_POK|SVf_FAKE| \
32 SVf_OOK|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 char *pv = SvPV(tmpstr, *lp);
2952 switch (SvTYPE(sv)) {
2954 if ( ((SvFLAGS(sv) &
2955 (SVs_OBJECT|SVf_OK|SVs_GMG|SVs_SMG|SVs_RMG))
2956 == (SVs_OBJECT|SVs_RMG))
2957 && (mg = mg_find(sv, PERL_MAGIC_qr))) {
2958 regexp *re = (regexp *)mg->mg_obj;
2961 char *fptr = "msix";
2966 char need_newline = 0;
2967 U16 reganch = (U16)((re->reganch & PMf_COMPILETIME) >> 12);
2969 while((ch = *fptr++)) {
2971 reflags[left++] = ch;
2974 reflags[right--] = ch;
2979 reflags[left] = '-';
2983 mg->mg_len = re->prelen + 4 + left;
2985 * If /x was used, we have to worry about a regex
2986 * ending with a comment later being embedded
2987 * within another regex. If so, we don't want this
2988 * regex's "commentization" to leak out to the
2989 * right part of the enclosing regex, we must cap
2990 * it with a newline.
2992 * So, if /x was used, we scan backwards from the
2993 * end of the regex. If we find a '#' before we
2994 * find a newline, we need to add a newline
2995 * ourself. If we find a '\n' first (or if we
2996 * don't find '#' or '\n'), we don't need to add
2997 * anything. -jfriedl
2999 if (PMf_EXTENDED & re->reganch)
3001 char *endptr = re->precomp + re->prelen;
3002 while (endptr >= re->precomp)
3004 char c = *(endptr--);
3006 break; /* don't need another */
3008 /* we end while in a comment, so we
3010 mg->mg_len++; /* save space for it */
3011 need_newline = 1; /* note to add it */
3016 New(616, mg->mg_ptr, mg->mg_len + 1 + left, char);
3017 Copy("(?", mg->mg_ptr, 2, char);
3018 Copy(reflags, mg->mg_ptr+2, left, char);
3019 Copy(":", mg->mg_ptr+left+2, 1, char);
3020 Copy(re->precomp, mg->mg_ptr+3+left, re->prelen, char);
3022 mg->mg_ptr[mg->mg_len - 2] = '\n';
3023 mg->mg_ptr[mg->mg_len - 1] = ')';
3024 mg->mg_ptr[mg->mg_len] = 0;
3026 PL_reginterp_cnt += re->program[0].next_off;
3038 case SVt_PVBM: if (SvROK(sv))
3041 s = "SCALAR"; break;
3042 case SVt_PVLV: s = "LVALUE"; break;
3043 case SVt_PVAV: s = "ARRAY"; break;
3044 case SVt_PVHV: s = "HASH"; break;
3045 case SVt_PVCV: s = "CODE"; break;
3046 case SVt_PVGV: s = "GLOB"; break;
3047 case SVt_PVFM: s = "FORMAT"; break;
3048 case SVt_PVIO: s = "IO"; break;
3049 default: s = "UNKNOWN"; break;
3053 HV *svs = SvSTASH(sv);
3056 /* [20011101.072] This bandaid for C<package;>
3057 should eventually be removed. AMS 20011103 */
3058 (svs ? HvNAME(svs) : "<none>"), s
3063 Perl_sv_catpvf(aTHX_ tsv, "(0x%"UVxf")", PTR2UV(sv));
3069 if (SvREADONLY(sv) && !SvOK(sv)) {
3070 if (ckWARN(WARN_UNINITIALIZED))
3076 if (SvIOK(sv) || ((SvIOKp(sv) && !SvNOKp(sv)))) {
3077 /* I'm assuming that if both IV and NV are equally valid then
3078 converting the IV is going to be more efficient */
3079 U32 isIOK = SvIOK(sv);
3080 U32 isUIOK = SvIsUV(sv);
3081 char buf[TYPE_CHARS(UV)];
3084 if (SvTYPE(sv) < SVt_PVIV)
3085 sv_upgrade(sv, SVt_PVIV);
3087 ptr = uiv_2buf(buf, 0, SvUVX(sv), 1, &ebuf);
3089 ptr = uiv_2buf(buf, SvIVX(sv), 0, 0, &ebuf);
3090 SvGROW(sv, (STRLEN)(ebuf - ptr + 1)); /* inlined from sv_setpvn */
3091 Move(ptr,SvPVX(sv),ebuf - ptr,char);
3092 SvCUR_set(sv, ebuf - ptr);
3102 else if (SvNOKp(sv)) {
3103 if (SvTYPE(sv) < SVt_PVNV)
3104 sv_upgrade(sv, SVt_PVNV);
3105 /* The +20 is pure guesswork. Configure test needed. --jhi */
3106 SvGROW(sv, NV_DIG + 20);
3108 olderrno = errno; /* some Xenix systems wipe out errno here */
3110 if (SvNVX(sv) == 0.0)
3111 (void)strcpy(s,"0");
3115 Gconvert(SvNVX(sv), NV_DIG, 0, s);
3118 #ifdef FIXNEGATIVEZERO
3119 if (*s == '-' && s[1] == '0' && !s[2])
3129 if (ckWARN(WARN_UNINITIALIZED)
3130 && !PL_localizing && !(SvFLAGS(sv) & SVs_PADTMP))
3133 if (SvTYPE(sv) < SVt_PV)
3134 /* Typically the caller expects that sv_any is not NULL now. */
3135 sv_upgrade(sv, SVt_PV);
3138 *lp = s - SvPVX(sv);
3141 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2pv(%s)\n",
3142 PTR2UV(sv),SvPVX(sv)));
3146 if (SvROK(sv)) { /* XXX Skip this when sv_pvn_force calls */
3147 /* Sneaky stuff here */
3151 tsv = newSVpv(tmpbuf, 0);
3167 len = strlen(tmpbuf);
3169 #ifdef FIXNEGATIVEZERO
3170 if (len == 2 && t[0] == '-' && t[1] == '0') {
3175 (void)SvUPGRADE(sv, SVt_PV);
3177 s = SvGROW(sv, len + 1);
3186 =for apidoc sv_copypv
3188 Copies a stringified representation of the source SV into the
3189 destination SV. Automatically performs any necessary mg_get and
3190 coercion of numeric values into strings. Guaranteed to preserve
3191 UTF-8 flag even from overloaded objects. Similar in nature to
3192 sv_2pv[_flags] but operates directly on an SV instead of just the
3193 string. Mostly uses sv_2pv_flags to do its work, except when that
3194 would lose the UTF-8'ness of the PV.
3200 Perl_sv_copypv(pTHX_ SV *dsv, register SV *ssv)
3202 SV *tmpsv = sv_newmortal();
3206 sv_setpvn(tmpsv,s,len);
3215 =for apidoc sv_2pvbyte_nolen
3217 Return a pointer to the byte-encoded representation of the SV.
3218 May cause the SV to be downgraded from UTF8 as a side-effect.
3220 Usually accessed via the C<SvPVbyte_nolen> macro.
3226 Perl_sv_2pvbyte_nolen(pTHX_ register SV *sv)
3229 return sv_2pvbyte(sv, &n_a);
3233 =for apidoc sv_2pvbyte
3235 Return a pointer to the byte-encoded representation of the SV, and set *lp
3236 to its length. May cause the SV to be downgraded from UTF8 as a
3239 Usually accessed via the C<SvPVbyte> macro.
3245 Perl_sv_2pvbyte(pTHX_ register SV *sv, STRLEN *lp)
3247 sv_utf8_downgrade(sv,0);
3248 return SvPV(sv,*lp);
3252 =for apidoc sv_2pvutf8_nolen
3254 Return a pointer to the UTF8-encoded representation of the SV.
3255 May cause the SV to be upgraded to UTF8 as a side-effect.
3257 Usually accessed via the C<SvPVutf8_nolen> macro.
3263 Perl_sv_2pvutf8_nolen(pTHX_ register SV *sv)
3266 return sv_2pvutf8(sv, &n_a);
3270 =for apidoc sv_2pvutf8
3272 Return a pointer to the UTF8-encoded representation of the SV, and set *lp
3273 to its length. May cause the SV to be upgraded to UTF8 as a side-effect.
3275 Usually accessed via the C<SvPVutf8> macro.
3281 Perl_sv_2pvutf8(pTHX_ register SV *sv, STRLEN *lp)
3283 sv_utf8_upgrade(sv);
3284 return SvPV(sv,*lp);
3288 =for apidoc sv_2bool
3290 This function is only called on magical items, and is only used by
3291 sv_true() or its macro equivalent.
3297 Perl_sv_2bool(pTHX_ register SV *sv)
3306 if (SvAMAGIC(sv) && (tmpsv=AMG_CALLun(sv,bool_)) &&
3307 (!SvROK(tmpsv) || (SvRV(tmpsv) != SvRV(sv))))
3308 return (bool)SvTRUE(tmpsv);
3309 return SvRV(sv) != 0;
3312 register XPV* Xpvtmp;
3313 if ((Xpvtmp = (XPV*)SvANY(sv)) &&
3314 (*Xpvtmp->xpv_pv > '0' ||
3315 Xpvtmp->xpv_cur > 1 ||
3316 (Xpvtmp->xpv_cur && *Xpvtmp->xpv_pv != '0')))
3323 return SvIVX(sv) != 0;
3326 return SvNVX(sv) != 0.0;
3334 =for apidoc sv_utf8_upgrade
3336 Convert the PV of an SV to its UTF8-encoded form.
3337 Forces the SV to string form if it is not already.
3338 Always sets the SvUTF8 flag to avoid future validity checks even
3339 if all the bytes have hibit clear.
3341 This is not as a general purpose byte encoding to Unicode interface:
3342 use the Encode extension for that.
3344 =for apidoc sv_utf8_upgrade_flags
3346 Convert the PV of an SV to its UTF8-encoded form.
3347 Forces the SV to string form if it is not already.
3348 Always sets the SvUTF8 flag to avoid future validity checks even
3349 if all the bytes have hibit clear. If C<flags> has C<SV_GMAGIC> bit set,
3350 will C<mg_get> on C<sv> if appropriate, else not. C<sv_utf8_upgrade> and
3351 C<sv_utf8_upgrade_nomg> are implemented in terms of this function.
3353 This is not as a general purpose byte encoding to Unicode interface:
3354 use the Encode extension for that.
3360 Perl_sv_utf8_upgrade_flags(pTHX_ register SV *sv, I32 flags)
3370 (void) sv_2pv_flags(sv,&len, flags);
3379 sv_force_normal_flags(sv, 0);
3383 sv_recode_to_utf8(sv, PL_encoding);
3384 else { /* Assume Latin-1/EBCDIC */
3385 /* This function could be much more efficient if we
3386 * had a FLAG in SVs to signal if there are any hibit
3387 * chars in the PV. Given that there isn't such a flag
3388 * make the loop as fast as possible. */
3389 s = (U8 *) SvPVX(sv);
3390 e = (U8 *) SvEND(sv);
3394 if ((hibit = !NATIVE_IS_INVARIANT(ch)))
3400 len = SvCUR(sv) + 1; /* Plus the \0 */
3401 SvPVX(sv) = (char*)bytes_to_utf8((U8*)s, &len);
3402 SvCUR(sv) = len - 1;
3404 Safefree(s); /* No longer using what was there before. */
3405 SvLEN(sv) = len; /* No longer know the real size. */
3407 /* Mark as UTF-8 even if no hibit - saves scanning loop */
3414 =for apidoc sv_utf8_downgrade
3416 Attempt to convert the PV of an SV from UTF8-encoded to byte encoding.
3417 This may not be possible if the PV contains non-byte encoding characters;
3418 if this is the case, either returns false or, if C<fail_ok> is not
3421 This is not as a general purpose Unicode to byte encoding interface:
3422 use the Encode extension for that.
3428 Perl_sv_utf8_downgrade(pTHX_ register SV* sv, bool fail_ok)
3430 if (SvPOK(sv) && SvUTF8(sv)) {
3436 sv_force_normal_flags(sv, 0);
3438 s = (U8 *) SvPV(sv, len);
3439 if (!utf8_to_bytes(s, &len)) {
3444 Perl_croak(aTHX_ "Wide character in %s",
3447 Perl_croak(aTHX_ "Wide character");
3458 =for apidoc sv_utf8_encode
3460 Convert the PV of an SV to UTF8-encoded, but then turn off the C<SvUTF8>
3461 flag so that it looks like octets again. Used as a building block
3462 for encode_utf8 in Encode.xs
3468 Perl_sv_utf8_encode(pTHX_ register SV *sv)
3470 (void) sv_utf8_upgrade(sv);
3475 =for apidoc sv_utf8_decode
3477 Convert the octets in the PV from UTF-8 to chars. Scan for validity and then
3478 turn off SvUTF8 if needed so that we see characters. Used as a building block
3479 for decode_utf8 in Encode.xs
3485 Perl_sv_utf8_decode(pTHX_ register SV *sv)
3491 /* The octets may have got themselves encoded - get them back as
3494 if (!sv_utf8_downgrade(sv, TRUE))
3497 /* it is actually just a matter of turning the utf8 flag on, but
3498 * we want to make sure everything inside is valid utf8 first.
3500 c = (U8 *) SvPVX(sv);
3501 if (!is_utf8_string(c, SvCUR(sv)+1))
3503 e = (U8 *) SvEND(sv);
3506 if (!UTF8_IS_INVARIANT(ch)) {
3516 =for apidoc sv_setsv
3518 Copies the contents of the source SV C<ssv> into the destination SV
3519 C<dsv>. The source SV may be destroyed if it is mortal, so don't use this
3520 function if the source SV needs to be reused. Does not handle 'set' magic.
3521 Loosely speaking, it performs a copy-by-value, obliterating any previous
3522 content of the destination.
3524 You probably want to use one of the assortment of wrappers, such as
3525 C<SvSetSV>, C<SvSetSV_nosteal>, C<SvSetMagicSV> and
3526 C<SvSetMagicSV_nosteal>.
3528 =for apidoc sv_setsv_flags
3530 Copies the contents of the source SV C<ssv> into the destination SV
3531 C<dsv>. The source SV may be destroyed if it is mortal, so don't use this
3532 function if the source SV needs to be reused. Does not handle 'set' magic.
3533 Loosely speaking, it performs a copy-by-value, obliterating any previous
3534 content of the destination.
3535 If the C<flags> parameter has the C<SV_GMAGIC> bit set, will C<mg_get> on
3536 C<ssv> if appropriate, else not. C<sv_setsv> and C<sv_setsv_nomg> are
3537 implemented in terms of this function.
3539 You probably want to use one of the assortment of wrappers, such as
3540 C<SvSetSV>, C<SvSetSV_nosteal>, C<SvSetMagicSV> and
3541 C<SvSetMagicSV_nosteal>.
3543 This is the primary function for copying scalars, and most other
3544 copy-ish functions and macros use this underneath.
3550 Perl_sv_setsv_flags(pTHX_ SV *dstr, register SV *sstr, I32 flags)
3552 register U32 sflags;
3558 SV_CHECK_THINKFIRST_COW_DROP(dstr);
3560 sstr = &PL_sv_undef;
3561 stype = SvTYPE(sstr);
3562 dtype = SvTYPE(dstr);
3566 /* There's a lot of redundancy below but we're going for speed here */
3571 if (dtype != SVt_PVGV) {
3572 (void)SvOK_off(dstr);
3580 sv_upgrade(dstr, SVt_IV);
3583 sv_upgrade(dstr, SVt_PVNV);
3587 sv_upgrade(dstr, SVt_PVIV);
3590 (void)SvIOK_only(dstr);
3591 SvIVX(dstr) = SvIVX(sstr);
3594 if (SvTAINTED(sstr))
3605 sv_upgrade(dstr, SVt_NV);
3610 sv_upgrade(dstr, SVt_PVNV);
3613 SvNVX(dstr) = SvNVX(sstr);
3614 (void)SvNOK_only(dstr);
3615 if (SvTAINTED(sstr))
3623 sv_upgrade(dstr, SVt_RV);
3624 else if (dtype == SVt_PVGV &&
3625 SvTYPE(SvRV(sstr)) == SVt_PVGV) {
3628 if (GvIMPORTED(dstr) != GVf_IMPORTED
3629 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3631 GvIMPORTED_on(dstr);
3642 sv_upgrade(dstr, SVt_PV);
3645 if (dtype < SVt_PVIV)
3646 sv_upgrade(dstr, SVt_PVIV);
3649 if (dtype < SVt_PVNV)
3650 sv_upgrade(dstr, SVt_PVNV);
3657 Perl_croak(aTHX_ "Bizarre copy of %s in %s", sv_reftype(sstr, 0),
3660 Perl_croak(aTHX_ "Bizarre copy of %s", sv_reftype(sstr, 0));
3664 if (dtype <= SVt_PVGV) {
3666 if (dtype != SVt_PVGV) {
3667 char *name = GvNAME(sstr);
3668 STRLEN len = GvNAMELEN(sstr);
3669 sv_upgrade(dstr, SVt_PVGV);
3670 sv_magic(dstr, dstr, PERL_MAGIC_glob, Nullch, 0);
3671 GvSTASH(dstr) = (HV*)SvREFCNT_inc(GvSTASH(sstr));
3672 GvNAME(dstr) = savepvn(name, len);
3673 GvNAMELEN(dstr) = len;
3674 SvFAKE_on(dstr); /* can coerce to non-glob */
3676 /* ahem, death to those who redefine active sort subs */
3677 else if (PL_curstackinfo->si_type == PERLSI_SORT
3678 && GvCV(dstr) && PL_sortcop == CvSTART(GvCV(dstr)))
3679 Perl_croak(aTHX_ "Can't redefine active sort subroutine %s",
3682 #ifdef GV_UNIQUE_CHECK
3683 if (GvUNIQUE((GV*)dstr)) {
3684 Perl_croak(aTHX_ PL_no_modify);
3688 (void)SvOK_off(dstr);
3689 GvINTRO_off(dstr); /* one-shot flag */
3691 GvGP(dstr) = gp_ref(GvGP(sstr));
3692 if (SvTAINTED(sstr))
3694 if (GvIMPORTED(dstr) != GVf_IMPORTED
3695 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3697 GvIMPORTED_on(dstr);
3705 if (SvGMAGICAL(sstr) && (flags & SV_GMAGIC)) {
3707 if ((int)SvTYPE(sstr) != stype) {
3708 stype = SvTYPE(sstr);
3709 if (stype == SVt_PVGV && dtype <= SVt_PVGV)
3713 if (stype == SVt_PVLV)
3714 (void)SvUPGRADE(dstr, SVt_PVNV);
3716 (void)SvUPGRADE(dstr, (U32)stype);
3719 sflags = SvFLAGS(sstr);
3721 if (sflags & SVf_ROK) {
3722 if (dtype >= SVt_PV) {
3723 if (dtype == SVt_PVGV) {
3724 SV *sref = SvREFCNT_inc(SvRV(sstr));
3726 int intro = GvINTRO(dstr);
3728 #ifdef GV_UNIQUE_CHECK
3729 if (GvUNIQUE((GV*)dstr)) {
3730 Perl_croak(aTHX_ PL_no_modify);
3735 GvINTRO_off(dstr); /* one-shot flag */
3736 GvLINE(dstr) = CopLINE(PL_curcop);
3737 GvEGV(dstr) = (GV*)dstr;
3740 switch (SvTYPE(sref)) {
3743 SAVESPTR(GvAV(dstr));
3745 dref = (SV*)GvAV(dstr);
3746 GvAV(dstr) = (AV*)sref;
3747 if (!GvIMPORTED_AV(dstr)
3748 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3750 GvIMPORTED_AV_on(dstr);
3755 SAVESPTR(GvHV(dstr));
3757 dref = (SV*)GvHV(dstr);
3758 GvHV(dstr) = (HV*)sref;
3759 if (!GvIMPORTED_HV(dstr)
3760 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3762 GvIMPORTED_HV_on(dstr);
3767 if (GvCVGEN(dstr) && GvCV(dstr) != (CV*)sref) {
3768 SvREFCNT_dec(GvCV(dstr));
3769 GvCV(dstr) = Nullcv;
3770 GvCVGEN(dstr) = 0; /* Switch off cacheness. */
3771 PL_sub_generation++;
3773 SAVESPTR(GvCV(dstr));
3776 dref = (SV*)GvCV(dstr);
3777 if (GvCV(dstr) != (CV*)sref) {
3778 CV* cv = GvCV(dstr);
3780 if (!GvCVGEN((GV*)dstr) &&
3781 (CvROOT(cv) || CvXSUB(cv)))
3783 /* ahem, death to those who redefine
3784 * active sort subs */
3785 if (PL_curstackinfo->si_type == PERLSI_SORT &&
3786 PL_sortcop == CvSTART(cv))
3788 "Can't redefine active sort subroutine %s",
3789 GvENAME((GV*)dstr));
3790 /* Redefining a sub - warning is mandatory if
3791 it was a const and its value changed. */
3792 if (ckWARN(WARN_REDEFINE)
3794 && (!CvCONST((CV*)sref)
3795 || sv_cmp(cv_const_sv(cv),
3796 cv_const_sv((CV*)sref)))))
3798 Perl_warner(aTHX_ packWARN(WARN_REDEFINE),
3800 ? "Constant subroutine %s::%s redefined"
3801 : "Subroutine %s::%s redefined",
3802 HvNAME(GvSTASH((GV*)dstr)),
3803 GvENAME((GV*)dstr));
3807 cv_ckproto(cv, (GV*)dstr,
3808 SvPOK(sref) ? SvPVX(sref) : Nullch);
3810 GvCV(dstr) = (CV*)sref;
3811 GvCVGEN(dstr) = 0; /* Switch off cacheness. */
3812 GvASSUMECV_on(dstr);
3813 PL_sub_generation++;
3815 if (!GvIMPORTED_CV(dstr)
3816 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3818 GvIMPORTED_CV_on(dstr);
3823 SAVESPTR(GvIOp(dstr));
3825 dref = (SV*)GvIOp(dstr);
3826 GvIOp(dstr) = (IO*)sref;
3830 SAVESPTR(GvFORM(dstr));
3832 dref = (SV*)GvFORM(dstr);
3833 GvFORM(dstr) = (CV*)sref;
3837 SAVESPTR(GvSV(dstr));
3839 dref = (SV*)GvSV(dstr);
3841 if (!GvIMPORTED_SV(dstr)
3842 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3844 GvIMPORTED_SV_on(dstr);
3852 if (SvTAINTED(sstr))
3857 (void)SvOOK_off(dstr); /* backoff */
3859 Safefree(SvPVX(dstr));
3860 SvLEN(dstr)=SvCUR(dstr)=0;
3863 (void)SvOK_off(dstr);
3864 SvRV(dstr) = SvREFCNT_inc(SvRV(sstr));
3866 if (sflags & SVp_NOK) {
3868 /* Only set the public OK flag if the source has public OK. */
3869 if (sflags & SVf_NOK)
3870 SvFLAGS(dstr) |= SVf_NOK;
3871 SvNVX(dstr) = SvNVX(sstr);
3873 if (sflags & SVp_IOK) {
3874 (void)SvIOKp_on(dstr);
3875 if (sflags & SVf_IOK)
3876 SvFLAGS(dstr) |= SVf_IOK;
3877 if (sflags & SVf_IVisUV)
3879 SvIVX(dstr) = SvIVX(sstr);
3881 if (SvAMAGIC(sstr)) {
3885 else if (sflags & SVp_POK) {
3889 * Check to see if we can just swipe the string. If so, it's a
3890 * possible small lose on short strings, but a big win on long ones.
3891 * It might even be a win on short strings if SvPVX(dstr)
3892 * has to be allocated and SvPVX(sstr) has to be freed.
3896 #ifdef PERL_COPY_ON_WRITE
3897 (sflags & (SVf_FAKE | SVf_READONLY)) != (SVf_FAKE | SVf_READONLY)
3901 (sflags & SVs_TEMP) && /* slated for free anyway? */
3902 !(sflags & SVf_OOK) && /* and not involved in OOK hack? */
3903 SvREFCNT(sstr) == 1 && /* and no other references to it? */
3904 SvLEN(sstr) && /* and really is a string */
3905 /* and won't be needed again, potentially */
3906 !(PL_op && PL_op->op_type == OP_AASSIGN))
3907 #ifdef PERL_COPY_ON_WRITE
3908 && !((sflags & CAN_COW_MASK) == CAN_COW_FLAGS
3909 && SvTYPE(sstr) >= SVt_PVIV)
3912 /* Failed the swipe test, and it's not a shared hash key either.
3913 Have to copy the string. */
3914 STRLEN len = SvCUR(sstr);
3915 SvGROW(dstr, len + 1); /* inlined from sv_setpvn */
3916 Move(SvPVX(sstr),SvPVX(dstr),len,char);
3917 SvCUR_set(dstr, len);
3918 *SvEND(dstr) = '\0';
3919 (void)SvPOK_only(dstr);
3921 /* If PERL_COPY_ON_WRITE is not defined, then isSwipe will always
3923 #ifdef PERL_COPY_ON_WRITE
3924 /* Either it's a shared hash key, or it's suitable for
3925 copy-on-write or we can swipe the string. */
3927 PerlIO_printf(Perl_debug_log,
3928 "Copy on write: sstr --> dstr\n");
3933 /* I believe I should acquire a global SV mutex if
3934 it's a COW sv (not a shared hash key) to stop
3935 it going un copy-on-write.
3936 If the source SV has gone un copy on write between up there
3937 and down here, then (assert() that) it is of the correct
3938 form to make it copy on write again */
3939 if ((sflags & (SVf_FAKE | SVf_READONLY))
3940 != (SVf_FAKE | SVf_READONLY)) {
3941 SvREADONLY_on(sstr);
3943 /* Make the source SV into a loop of 1.
3944 (about to become 2) */
3945 SV_COW_NEXT_SV(sstr) = sstr;
3949 /* Initial code is common. */
3950 if (SvPVX(dstr)) { /* we know that dtype >= SVt_PV */
3952 SvFLAGS(dstr) &= ~SVf_OOK;
3953 Safefree(SvPVX(dstr) - SvIVX(dstr));
3955 else if (SvLEN(dstr))
3956 Safefree(SvPVX(dstr));
3958 (void)SvPOK_only(dstr);
3960 #ifdef PERL_COPY_ON_WRITE
3962 /* making another shared SV. */
3963 STRLEN cur = SvCUR(sstr);
3964 STRLEN len = SvLEN(sstr);
3966 /* SvIsCOW_normal */
3967 /* splice us in between source and next-after-source. */
3968 SV_COW_NEXT_SV(dstr) = SV_COW_NEXT_SV(sstr);
3969 SV_COW_NEXT_SV(sstr) = dstr;
3970 SvPV_set(dstr, SvPVX(sstr));
3972 /* SvIsCOW_shared_hash */
3973 UV hash = SvUVX(sstr);
3974 DEBUG_C(PerlIO_printf(Perl_debug_log,
3975 "Copy on write: Sharing hash\n"));
3977 sharepvn(SvPVX(sstr),
3978 (sflags & SVf_UTF8?-cur:cur), hash));
3983 SvREADONLY_on(dstr);
3985 /* Relesase a global SV mutex. */
3989 { /* Passes the swipe test. */
3990 SvPV_set(dstr, SvPVX(sstr));
3991 SvLEN_set(dstr, SvLEN(sstr));
3992 SvCUR_set(dstr, SvCUR(sstr));
3995 (void)SvOK_off(sstr); /* NOTE: nukes most SvFLAGS on sstr */
3996 SvPV_set(sstr, Nullch);
4002 if (sflags & SVf_UTF8)
4005 if (sflags & SVp_NOK) {
4007 if (sflags & SVf_NOK)
4008 SvFLAGS(dstr) |= SVf_NOK;
4009 SvNVX(dstr) = SvNVX(sstr);
4011 if (sflags & SVp_IOK) {
4012 (void)SvIOKp_on(dstr);
4013 if (sflags & SVf_IOK)
4014 SvFLAGS(dstr) |= SVf_IOK;
4015 if (sflags & SVf_IVisUV)
4017 SvIVX(dstr) = SvIVX(sstr);
4020 MAGIC *mg = SvMAGIC(sstr);
4021 sv_magicext(dstr, NULL, PERL_MAGIC_vstring, NULL,
4022 mg->mg_ptr, mg->mg_len);
4023 SvRMAGICAL_on(dstr);
4026 else if (sflags & SVp_IOK) {
4027 if (sflags & SVf_IOK)
4028 (void)SvIOK_only(dstr);
4030 (void)SvOK_off(dstr);
4031 (void)SvIOKp_on(dstr);
4033 /* XXXX Do we want to set IsUV for IV(ROK)? Be extra safe... */
4034 if (sflags & SVf_IVisUV)
4036 SvIVX(dstr) = SvIVX(sstr);
4037 if (sflags & SVp_NOK) {
4038 if (sflags & SVf_NOK)
4039 (void)SvNOK_on(dstr);
4041 (void)SvNOKp_on(dstr);
4042 SvNVX(dstr) = SvNVX(sstr);
4045 else if (sflags & SVp_NOK) {
4046 if (sflags & SVf_NOK)
4047 (void)SvNOK_only(dstr);
4049 (void)SvOK_off(dstr);
4052 SvNVX(dstr) = SvNVX(sstr);
4055 if (dtype == SVt_PVGV) {
4056 if (ckWARN(WARN_MISC))
4057 Perl_warner(aTHX_ packWARN(WARN_MISC), "Undefined value assigned to typeglob");
4060 (void)SvOK_off(dstr);
4062 if (SvTAINTED(sstr))
4067 =for apidoc sv_setsv_mg
4069 Like C<sv_setsv>, but also handles 'set' magic.
4075 Perl_sv_setsv_mg(pTHX_ SV *dstr, register SV *sstr)
4077 sv_setsv(dstr,sstr);
4082 =for apidoc sv_setpvn
4084 Copies a string into an SV. The C<len> parameter indicates the number of
4085 bytes to be copied. Does not handle 'set' magic. See C<sv_setpvn_mg>.
4091 Perl_sv_setpvn(pTHX_ register SV *sv, register const char *ptr, register STRLEN len)
4093 register char *dptr;
4095 SV_CHECK_THINKFIRST_COW_DROP(sv);
4101 /* len is STRLEN which is unsigned, need to copy to signed */
4104 Perl_croak(aTHX_ "panic: sv_setpvn called with negative strlen");
4106 (void)SvUPGRADE(sv, SVt_PV);
4108 SvGROW(sv, len + 1);
4110 Move(ptr,dptr,len,char);
4113 (void)SvPOK_only_UTF8(sv); /* validate pointer */
4118 =for apidoc sv_setpvn_mg
4120 Like C<sv_setpvn>, but also handles 'set' magic.
4126 Perl_sv_setpvn_mg(pTHX_ register SV *sv, register const char *ptr, register STRLEN len)
4128 sv_setpvn(sv,ptr,len);
4133 =for apidoc sv_setpv
4135 Copies a string into an SV. The string must be null-terminated. Does not
4136 handle 'set' magic. See C<sv_setpv_mg>.
4142 Perl_sv_setpv(pTHX_ register SV *sv, register const char *ptr)
4144 register STRLEN len;
4146 SV_CHECK_THINKFIRST_COW_DROP(sv);
4152 (void)SvUPGRADE(sv, SVt_PV);
4154 SvGROW(sv, len + 1);
4155 Move(ptr,SvPVX(sv),len+1,char);
4157 (void)SvPOK_only_UTF8(sv); /* validate pointer */
4162 =for apidoc sv_setpv_mg
4164 Like C<sv_setpv>, but also handles 'set' magic.
4170 Perl_sv_setpv_mg(pTHX_ register SV *sv, register const char *ptr)
4177 =for apidoc sv_usepvn
4179 Tells an SV to use C<ptr> to find its string value. Normally the string is
4180 stored inside the SV but sv_usepvn allows the SV to use an outside string.
4181 The C<ptr> should point to memory that was allocated by C<malloc>. The
4182 string length, C<len>, must be supplied. This function will realloc the
4183 memory pointed to by C<ptr>, so that pointer should not be freed or used by
4184 the programmer after giving it to sv_usepvn. Does not handle 'set' magic.
4185 See C<sv_usepvn_mg>.
4191 Perl_sv_usepvn(pTHX_ register SV *sv, register char *ptr, register STRLEN len)
4193 SV_CHECK_THINKFIRST_COW_DROP(sv);
4194 (void)SvUPGRADE(sv, SVt_PV);
4199 (void)SvOOK_off(sv);
4200 if (SvPVX(sv) && SvLEN(sv))
4201 Safefree(SvPVX(sv));
4202 Renew(ptr, len+1, char);
4205 SvLEN_set(sv, len+1);
4207 (void)SvPOK_only_UTF8(sv); /* validate pointer */
4212 =for apidoc sv_usepvn_mg
4214 Like C<sv_usepvn>, but also handles 'set' magic.
4220 Perl_sv_usepvn_mg(pTHX_ register SV *sv, register char *ptr, register STRLEN len)
4222 sv_usepvn(sv,ptr,len);
4226 #ifdef PERL_COPY_ON_WRITE
4227 /* Need to do this *after* making the SV normal, as we need the buffer
4228 pointer to remain valid until after we've copied it. If we let go too early,
4229 another thread could invalidate it by unsharing last of the same hash key
4230 (which it can do by means other than releasing copy-on-write Svs)
4231 or by changing the other copy-on-write SVs in the loop. */
4233 S_sv_release_COW(pTHX_ register SV *sv, char *pvx, STRLEN cur, STRLEN len,
4234 U32 hash, SV *after)
4236 if (len) { /* this SV was SvIsCOW_normal(sv) */
4237 /* we need to find the SV pointing to us. */
4238 SV *current = SV_COW_NEXT_SV(after);
4240 if (current == sv) {
4241 /* The SV we point to points back to us (there were only two of us
4243 Hence other SV is no longer copy on write either. */
4245 SvREADONLY_off(after);
4247 /* We need to follow the pointers around the loop. */
4249 while ((next = SV_COW_NEXT_SV(current)) != sv) {
4252 /* don't loop forever if the structure is bust, and we have
4253 a pointer into a closed loop. */
4254 assert (current != after);
4255 assert (SvPVX(current) == pvx);
4257 /* Make the SV before us point to the SV after us. */
4258 SV_COW_NEXT_SV(current) = after;
4261 unsharepvn(pvx, SvUTF8(sv) ? -(I32)cur : cur, hash);
4266 Perl_sv_release_IVX(pTHX_ register SV *sv)
4269 sv_force_normal_flags(sv, 0);
4270 return SvOOK_off(sv);
4274 =for apidoc sv_force_normal_flags
4276 Undo various types of fakery on an SV: if the PV is a shared string, make
4277 a private copy; if we're a ref, stop refing; if we're a glob, downgrade to
4278 an xpvmg; if we're a copy-on-write scalar, this is the on-write time when
4279 we do the copy, and is also used locally. If C<SV_COW_DROP_PV> is set
4280 then a copy-on-write scalar drops its PV buffer (if any) and becomes
4281 SvPOK_off rather than making a copy. (Used where this scalar is about to be
4282 set to some other value. In addtion, the C<flags> parameter gets passed to
4283 C<sv_unref_flags()> when unrefing. C<sv_force_normal> calls this function
4284 with flags set to 0.
4290 Perl_sv_force_normal_flags(pTHX_ register SV *sv, U32 flags)
4292 #ifdef PERL_COPY_ON_WRITE
4293 if (SvREADONLY(sv)) {
4294 /* At this point I believe I should acquire a global SV mutex. */
4296 char *pvx = SvPVX(sv);
4297 STRLEN len = SvLEN(sv);
4298 STRLEN cur = SvCUR(sv);
4299 U32 hash = SvUVX(sv);
4300 SV *next = SV_COW_NEXT_SV(sv); /* next COW sv in the loop. */
4302 PerlIO_printf(Perl_debug_log,
4303 "Copy on write: Force normal %ld\n",
4309 /* This SV doesn't own the buffer, so need to New() a new one: */
4312 if (flags & SV_COW_DROP_PV) {
4313 /* OK, so we don't need to copy our buffer. */
4316 SvGROW(sv, cur + 1);
4317 Move(pvx,SvPVX(sv),cur,char);
4321 sv_release_COW(sv, pvx, cur, len, hash, next);
4326 else if (PL_curcop != &PL_compiling)
4327 Perl_croak(aTHX_ PL_no_modify);
4328 /* At this point I believe that I can drop the global SV mutex. */
4331 if (SvREADONLY(sv)) {
4333 char *pvx = SvPVX(sv);
4334 STRLEN len = SvCUR(sv);
4335 U32 hash = SvUVX(sv);
4336 SvGROW(sv, len + 1);
4337 Move(pvx,SvPVX(sv),len,char);
4341 unsharepvn(pvx, SvUTF8(sv) ? -(I32)len : len, hash);
4343 else if (PL_curcop != &PL_compiling)
4344 Perl_croak(aTHX_ PL_no_modify);
4348 sv_unref_flags(sv, flags);
4349 else if (SvFAKE(sv) && SvTYPE(sv) == SVt_PVGV)
4354 =for apidoc sv_force_normal
4356 Undo various types of fakery on an SV: if the PV is a shared string, make
4357 a private copy; if we're a ref, stop refing; if we're a glob, downgrade to
4358 an xpvmg. See also C<sv_force_normal_flags>.
4364 Perl_sv_force_normal(pTHX_ register SV *sv)
4366 sv_force_normal_flags(sv, 0);
4372 Efficient removal of characters from the beginning of the string buffer.
4373 SvPOK(sv) must be true and the C<ptr> must be a pointer to somewhere inside
4374 the string buffer. The C<ptr> becomes the first character of the adjusted
4375 string. Uses the "OOK hack".
4381 Perl_sv_chop(pTHX_ register SV *sv, register char *ptr)
4383 register STRLEN delta;
4385 if (!ptr || !SvPOKp(sv))
4387 SV_CHECK_THINKFIRST(sv);
4388 if (SvTYPE(sv) < SVt_PVIV)
4389 sv_upgrade(sv,SVt_PVIV);
4392 if (!SvLEN(sv)) { /* make copy of shared string */
4393 char *pvx = SvPVX(sv);
4394 STRLEN len = SvCUR(sv);
4395 SvGROW(sv, len + 1);
4396 Move(pvx,SvPVX(sv),len,char);
4400 SvFLAGS(sv) |= SVf_OOK;
4402 SvFLAGS(sv) &= ~(SVf_IOK|SVf_NOK|SVp_IOK|SVp_NOK|SVf_IVisUV);
4403 delta = ptr - SvPVX(sv);
4411 =for apidoc sv_catpvn
4413 Concatenates the string onto the end of the string which is in the SV. The
4414 C<len> indicates number of bytes to copy. If the SV has the UTF8
4415 status set, then the bytes appended should be valid UTF8.
4416 Handles 'get' magic, but not 'set' magic. See C<sv_catpvn_mg>.
4418 =for apidoc sv_catpvn_flags
4420 Concatenates the string onto the end of the string which is in the SV. The
4421 C<len> indicates number of bytes to copy. If the SV has the UTF8
4422 status set, then the bytes appended should be valid UTF8.
4423 If C<flags> has C<SV_GMAGIC> bit set, will C<mg_get> on C<dsv> if
4424 appropriate, else not. C<sv_catpvn> and C<sv_catpvn_nomg> are implemented
4425 in terms of this function.
4431 Perl_sv_catpvn_flags(pTHX_ register SV *dsv, register const char *sstr, register STRLEN slen, I32 flags)
4436 dstr = SvPV_force_flags(dsv, dlen, flags);
4437 SvGROW(dsv, dlen + slen + 1);
4440 Move(sstr, SvPVX(dsv) + dlen, slen, char);
4443 (void)SvPOK_only_UTF8(dsv); /* validate pointer */
4448 =for apidoc sv_catpvn_mg
4450 Like C<sv_catpvn>, but also handles 'set' magic.
4456 Perl_sv_catpvn_mg(pTHX_ register SV *sv, register const char *ptr, register STRLEN len)
4458 sv_catpvn(sv,ptr,len);
4463 =for apidoc sv_catsv
4465 Concatenates the string from SV C<ssv> onto the end of the string in
4466 SV C<dsv>. Modifies C<dsv> but not C<ssv>. Handles 'get' magic, but
4467 not 'set' magic. See C<sv_catsv_mg>.
4469 =for apidoc sv_catsv_flags
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>. If C<flags> has C<SV_GMAGIC>
4473 bit set, will C<mg_get> on the SVs if appropriate, else not. C<sv_catsv>
4474 and C<sv_catsv_nomg> are implemented in terms of this function.
4479 Perl_sv_catsv_flags(pTHX_ SV *dsv, register SV *ssv, I32 flags)
4485 if ((spv = SvPV(ssv, slen))) {
4486 /* sutf8 and dutf8 were type bool, but under USE_ITHREADS,
4487 gcc version 2.95.2 20000220 (Debian GNU/Linux) for
4488 Linux xxx 2.2.17 on sparc64 with gcc -O2, we erroneously
4489 get dutf8 = 0x20000000, (i.e. SVf_UTF8) even though
4490 dsv->sv_flags doesn't have that bit set.
4491 Andy Dougherty 12 Oct 2001
4493 I32 sutf8 = DO_UTF8(ssv);
4496 if (SvGMAGICAL(dsv) && (flags & SV_GMAGIC))
4498 dutf8 = DO_UTF8(dsv);
4500 if (dutf8 != sutf8) {
4502 /* Not modifying source SV, so taking a temporary copy. */
4503 SV* csv = sv_2mortal(newSVpvn(spv, slen));
4505 sv_utf8_upgrade(csv);
4506 spv = SvPV(csv, slen);
4509 sv_utf8_upgrade_nomg(dsv);
4511 sv_catpvn_nomg(dsv, spv, slen);
4516 =for apidoc sv_catsv_mg
4518 Like C<sv_catsv>, but also handles 'set' magic.
4524 Perl_sv_catsv_mg(pTHX_ SV *dsv, register SV *ssv)
4531 =for apidoc sv_catpv
4533 Concatenates the string onto the end of the string which is in the SV.
4534 If the SV has the UTF8 status set, then the bytes appended should be
4535 valid UTF8. Handles 'get' magic, but not 'set' magic. See C<sv_catpv_mg>.
4540 Perl_sv_catpv(pTHX_ register SV *sv, register const char *ptr)
4542 register STRLEN len;
4548 junk = SvPV_force(sv, tlen);
4550 SvGROW(sv, tlen + len + 1);
4553 Move(ptr,SvPVX(sv)+tlen,len+1,char);
4555 (void)SvPOK_only_UTF8(sv); /* validate pointer */
4560 =for apidoc sv_catpv_mg
4562 Like C<sv_catpv>, but also handles 'set' magic.
4568 Perl_sv_catpv_mg(pTHX_ register SV *sv, register const char *ptr)
4577 Create a new null SV, or if len > 0, create a new empty SVt_PV type SV
4578 with an initial PV allocation of len+1. Normally accessed via the C<NEWSV>
4585 Perl_newSV(pTHX_ STRLEN len)
4591 sv_upgrade(sv, SVt_PV);
4592 SvGROW(sv, len + 1);
4597 =for apidoc sv_magicext
4599 Adds magic to an SV, upgrading it if necessary. Applies the
4600 supplied vtable and returns pointer to the magic added.
4602 Note that sv_magicext will allow things that sv_magic will not.
4603 In particular you can add magic to SvREADONLY SVs and and more than
4604 one instance of the same 'how'
4606 I C<namelen> is greater then zero then a savepvn() I<copy> of C<name> is stored,
4607 if C<namelen> is zero then C<name> is stored as-is and - as another special
4608 case - if C<(name && namelen == HEf_SVKEY)> then C<name> is assumed to contain
4609 an C<SV*> and has its REFCNT incremented
4611 (This is now used as a subroutine by sv_magic.)
4616 Perl_sv_magicext(pTHX_ SV* sv, SV* obj, int how, MGVTBL *vtable,
4617 const char* name, I32 namlen)
4621 if (SvTYPE(sv) < SVt_PVMG) {
4622 (void)SvUPGRADE(sv, SVt_PVMG);
4624 Newz(702,mg, 1, MAGIC);
4625 mg->mg_moremagic = SvMAGIC(sv);
4628 /* Some magic sontains a reference loop, where the sv and object refer to
4629 each other. To prevent a reference loop that would prevent such
4630 objects being freed, we look for such loops and if we find one we
4631 avoid incrementing the object refcount.
4633 Note we cannot do this to avoid self-tie loops as intervening RV must
4634 have its REFCNT incremented to keep it in existence - instead we could
4635 special case them in sv_free() -- NI-S
4638 if (!obj || obj == sv ||
4639 how == PERL_MAGIC_arylen ||
4640 how == PERL_MAGIC_qr ||
4641 (SvTYPE(obj) == SVt_PVGV &&
4642 (GvSV(obj) == sv || GvHV(obj) == (HV*)sv || GvAV(obj) == (AV*)sv ||
4643 GvCV(obj) == (CV*)sv || GvIOp(obj) == (IO*)sv ||
4644 GvFORM(obj) == (CV*)sv)))
4649 mg->mg_obj = SvREFCNT_inc(obj);
4650 mg->mg_flags |= MGf_REFCOUNTED;
4653 mg->mg_len = namlen;
4656 mg->mg_ptr = savepvn(name, namlen);
4657 else if (namlen == HEf_SVKEY)
4658 mg->mg_ptr = (char*)SvREFCNT_inc((SV*)name);
4660 mg->mg_ptr = (char *) name;
4662 mg->mg_virtual = vtable;
4666 SvFLAGS(sv) &= ~(SVf_IOK|SVf_NOK|SVf_POK);
4671 =for apidoc sv_magic
4673 Adds magic to an SV. First upgrades C<sv> to type C<SVt_PVMG> if necessary,
4674 then adds a new magic item of type C<how> to the head of the magic list.
4680 Perl_sv_magic(pTHX_ register SV *sv, SV *obj, int how, const char *name, I32 namlen)
4685 #ifdef PERL_COPY_ON_WRITE
4687 sv_force_normal_flags(sv, 0);
4689 if (SvREADONLY(sv)) {
4690 if (PL_curcop != &PL_compiling
4691 && how != PERL_MAGIC_regex_global
4692 && how != PERL_MAGIC_bm
4693 && how != PERL_MAGIC_fm
4694 && how != PERL_MAGIC_sv
4697 Perl_croak(aTHX_ PL_no_modify);
4700 if (SvMAGICAL(sv) || (how == PERL_MAGIC_taint && SvTYPE(sv) >= SVt_PVMG)) {
4701 if (SvMAGIC(sv) && (mg = mg_find(sv, how))) {
4702 /* sv_magic() refuses to add a magic of the same 'how' as an
4705 if (how == PERL_MAGIC_taint)
4713 vtable = &PL_vtbl_sv;
4715 case PERL_MAGIC_overload:
4716 vtable = &PL_vtbl_amagic;
4718 case PERL_MAGIC_overload_elem:
4719 vtable = &PL_vtbl_amagicelem;
4721 case PERL_MAGIC_overload_table:
4722 vtable = &PL_vtbl_ovrld;
4725 vtable = &PL_vtbl_bm;
4727 case PERL_MAGIC_regdata:
4728 vtable = &PL_vtbl_regdata;
4730 case PERL_MAGIC_regdatum:
4731 vtable = &PL_vtbl_regdatum;
4733 case PERL_MAGIC_env:
4734 vtable = &PL_vtbl_env;
4737 vtable = &PL_vtbl_fm;
4739 case PERL_MAGIC_envelem:
4740 vtable = &PL_vtbl_envelem;
4742 case PERL_MAGIC_regex_global:
4743 vtable = &PL_vtbl_mglob;
4745 case PERL_MAGIC_isa:
4746 vtable = &PL_vtbl_isa;
4748 case PERL_MAGIC_isaelem:
4749 vtable = &PL_vtbl_isaelem;
4751 case PERL_MAGIC_nkeys:
4752 vtable = &PL_vtbl_nkeys;
4754 case PERL_MAGIC_dbfile:
4757 case PERL_MAGIC_dbline:
4758 vtable = &PL_vtbl_dbline;
4760 #ifdef USE_5005THREADS
4761 case PERL_MAGIC_mutex:
4762 vtable = &PL_vtbl_mutex;
4764 #endif /* USE_5005THREADS */
4765 #ifdef USE_LOCALE_COLLATE
4766 case PERL_MAGIC_collxfrm:
4767 vtable = &PL_vtbl_collxfrm;
4769 #endif /* USE_LOCALE_COLLATE */
4770 case PERL_MAGIC_tied:
4771 vtable = &PL_vtbl_pack;
4773 case PERL_MAGIC_tiedelem:
4774 case PERL_MAGIC_tiedscalar:
4775 vtable = &PL_vtbl_packelem;
4778 vtable = &PL_vtbl_regexp;
4780 case PERL_MAGIC_sig:
4781 vtable = &PL_vtbl_sig;
4783 case PERL_MAGIC_sigelem:
4784 vtable = &PL_vtbl_sigelem;
4786 case PERL_MAGIC_taint:
4787 vtable = &PL_vtbl_taint;
4789 case PERL_MAGIC_uvar:
4790 vtable = &PL_vtbl_uvar;
4792 case PERL_MAGIC_vec:
4793 vtable = &PL_vtbl_vec;
4795 case PERL_MAGIC_substr:
4796 vtable = &PL_vtbl_substr;
4798 case PERL_MAGIC_defelem:
4799 vtable = &PL_vtbl_defelem;
4801 case PERL_MAGIC_glob:
4802 vtable = &PL_vtbl_glob;
4804 case PERL_MAGIC_arylen:
4805 vtable = &PL_vtbl_arylen;
4807 case PERL_MAGIC_pos:
4808 vtable = &PL_vtbl_pos;
4810 case PERL_MAGIC_backref:
4811 vtable = &PL_vtbl_backref;
4813 case PERL_MAGIC_ext:
4814 /* Reserved for use by extensions not perl internals. */
4815 /* Useful for attaching extension internal data to perl vars. */
4816 /* Note that multiple extensions may clash if magical scalars */
4817 /* etc holding private data from one are passed to another. */
4820 Perl_croak(aTHX_ "Don't know how to handle magic of type \\%o", how);
4823 /* Rest of work is done else where */
4824 mg = sv_magicext(sv,obj,how,vtable,name,namlen);
4827 case PERL_MAGIC_taint:
4830 case PERL_MAGIC_ext:
4831 case PERL_MAGIC_dbfile:
4838 =for apidoc sv_unmagic
4840 Removes all magic of type C<type> from an SV.
4846 Perl_sv_unmagic(pTHX_ SV *sv, int type)
4850 if (SvTYPE(sv) < SVt_PVMG || !SvMAGIC(sv))
4853 for (mg = *mgp; mg; mg = *mgp) {
4854 if (mg->mg_type == type) {
4855 MGVTBL* vtbl = mg->mg_virtual;
4856 *mgp = mg->mg_moremagic;
4857 if (vtbl && vtbl->svt_free)
4858 CALL_FPTR(vtbl->svt_free)(aTHX_ sv, mg);
4859 if (mg->mg_ptr && mg->mg_type != PERL_MAGIC_regex_global) {
4861 Safefree(mg->mg_ptr);
4862 else if (mg->mg_len == HEf_SVKEY)
4863 SvREFCNT_dec((SV*)mg->mg_ptr);
4865 if (mg->mg_flags & MGf_REFCOUNTED)
4866 SvREFCNT_dec(mg->mg_obj);
4870 mgp = &mg->mg_moremagic;
4874 SvFLAGS(sv) |= (SvFLAGS(sv) & (SVp_NOK|SVp_POK)) >> PRIVSHIFT;
4881 =for apidoc sv_rvweaken
4883 Weaken a reference: set the C<SvWEAKREF> flag on this RV; give the
4884 referred-to SV C<PERL_MAGIC_backref> magic if it hasn't already; and
4885 push a back-reference to this RV onto the array of backreferences
4886 associated with that magic.
4892 Perl_sv_rvweaken(pTHX_ SV *sv)
4895 if (!SvOK(sv)) /* let undefs pass */
4898 Perl_croak(aTHX_ "Can't weaken a nonreference");
4899 else if (SvWEAKREF(sv)) {
4900 if (ckWARN(WARN_MISC))
4901 Perl_warner(aTHX_ packWARN(WARN_MISC), "Reference is already weak");
4905 sv_add_backref(tsv, sv);
4911 /* Give tsv backref magic if it hasn't already got it, then push a
4912 * back-reference to sv onto the array associated with the backref magic.
4916 S_sv_add_backref(pTHX_ SV *tsv, SV *sv)
4920 if (SvMAGICAL(tsv) && (mg = mg_find(tsv, PERL_MAGIC_backref)))
4921 av = (AV*)mg->mg_obj;
4924 sv_magic(tsv, (SV*)av, PERL_MAGIC_backref, NULL, 0);
4925 SvREFCNT_dec(av); /* for sv_magic */
4930 /* delete a back-reference to ourselves from the backref magic associated
4931 * with the SV we point to.
4935 S_sv_del_backref(pTHX_ SV *sv)
4942 if (!SvMAGICAL(tsv) || !(mg = mg_find(tsv, PERL_MAGIC_backref)))
4943 Perl_croak(aTHX_ "panic: del_backref");
4944 av = (AV *)mg->mg_obj;
4949 svp[i] = &PL_sv_undef; /* XXX */
4956 =for apidoc sv_insert
4958 Inserts a string at the specified offset/length within the SV. Similar to
4959 the Perl substr() function.
4965 Perl_sv_insert(pTHX_ SV *bigstr, STRLEN offset, STRLEN len, char *little, STRLEN littlelen)
4969 register char *midend;
4970 register char *bigend;
4976 Perl_croak(aTHX_ "Can't modify non-existent substring");
4977 SvPV_force(bigstr, curlen);
4978 (void)SvPOK_only_UTF8(bigstr);
4979 if (offset + len > curlen) {
4980 SvGROW(bigstr, offset+len+1);
4981 Zero(SvPVX(bigstr)+curlen, offset+len-curlen, char);
4982 SvCUR_set(bigstr, offset+len);
4986 i = littlelen - len;
4987 if (i > 0) { /* string might grow */
4988 big = SvGROW(bigstr, SvCUR(bigstr) + i + 1);
4989 mid = big + offset + len;
4990 midend = bigend = big + SvCUR(bigstr);
4993 while (midend > mid) /* shove everything down */
4994 *--bigend = *--midend;
4995 Move(little,big+offset,littlelen,char);
5001 Move(little,SvPVX(bigstr)+offset,len,char);
5006 big = SvPVX(bigstr);
5009 bigend = big + SvCUR(bigstr);
5011 if (midend > bigend)
5012 Perl_croak(aTHX_ "panic: sv_insert");
5014 if (mid - big > bigend - midend) { /* faster to shorten from end */
5016 Move(little, mid, littlelen,char);
5019 i = bigend - midend;
5021 Move(midend, mid, i,char);
5025 SvCUR_set(bigstr, mid - big);
5028 else if ((i = mid - big)) { /* faster from front */
5029 midend -= littlelen;
5031 sv_chop(bigstr,midend-i);
5036 Move(little, mid, littlelen,char);
5038 else if (littlelen) {
5039 midend -= littlelen;
5040 sv_chop(bigstr,midend);
5041 Move(little,midend,littlelen,char);
5044 sv_chop(bigstr,midend);
5050 =for apidoc sv_replace
5052 Make the first argument a copy of the second, then delete the original.
5053 The target SV physically takes over ownership of the body of the source SV
5054 and inherits its flags; however, the target keeps any magic it owns,
5055 and any magic in the source is discarded.
5056 Note that this is a rather specialist SV copying operation; most of the
5057 time you'll want to use C<sv_setsv> or one of its many macro front-ends.
5063 Perl_sv_replace(pTHX_ register SV *sv, register SV *nsv)
5065 U32 refcnt = SvREFCNT(sv);
5066 SV_CHECK_THINKFIRST_COW_DROP(sv);
5067 if (SvREFCNT(nsv) != 1 && ckWARN_d(WARN_INTERNAL))
5068 Perl_warner(aTHX_ packWARN(WARN_INTERNAL), "Reference miscount in sv_replace()");
5069 if (SvMAGICAL(sv)) {
5073 sv_upgrade(nsv, SVt_PVMG);
5074 SvMAGIC(nsv) = SvMAGIC(sv);
5075 SvFLAGS(nsv) |= SvMAGICAL(sv);
5081 assert(!SvREFCNT(sv));
5082 StructCopy(nsv,sv,SV);
5083 #ifdef PERL_COPY_ON_WRITE
5084 if (SvIsCOW_normal(nsv)) {
5085 /* We need to follow the pointers around the loop to make the
5086 previous SV point to sv, rather than nsv. */
5089 while ((next = SV_COW_NEXT_SV(current)) != nsv) {
5092 assert(SvPVX(current) == SvPVX(nsv));
5094 /* Make the SV before us point to the SV after us. */
5096 PerlIO_printf(Perl_debug_log, "previous is\n");
5098 PerlIO_printf(Perl_debug_log, "move it from "UVxf" to "UVxf"\n",
5099 (UV) SV_COW_NEXT_SV(current), (UV) sv);
5101 SV_COW_NEXT_SV(current) = sv;
5104 SvREFCNT(sv) = refcnt;
5105 SvFLAGS(nsv) |= SVTYPEMASK; /* Mark as freed */
5110 =for apidoc sv_clear
5112 Clear an SV: call any destructors, free up any memory used by the body,
5113 and free the body itself. The SV's head is I<not> freed, although
5114 its type is set to all 1's so that it won't inadvertently be assumed
5115 to be live during global destruction etc.
5116 This function should only be called when REFCNT is zero. Most of the time
5117 you'll want to call C<sv_free()> (or its macro wrapper C<SvREFCNT_dec>)
5124 Perl_sv_clear(pTHX_ register SV *sv)
5128 assert(SvREFCNT(sv) == 0);
5131 if (PL_defstash) { /* Still have a symbol table? */
5136 Zero(&tmpref, 1, SV);
5137 sv_upgrade(&tmpref, SVt_RV);
5139 SvREADONLY_on(&tmpref); /* DESTROY() could be naughty */
5140 SvREFCNT(&tmpref) = 1;
5143 stash = SvSTASH(sv);
5144 destructor = StashHANDLER(stash,DESTROY);
5147 PUSHSTACKi(PERLSI_DESTROY);
5148 SvRV(&tmpref) = SvREFCNT_inc(sv);
5153 call_sv((SV*)destructor, G_DISCARD|G_EVAL|G_KEEPERR);
5159 } while (SvOBJECT(sv) && SvSTASH(sv) != stash);
5161 del_XRV(SvANY(&tmpref));
5164 if (PL_in_clean_objs)
5165 Perl_croak(aTHX_ "DESTROY created new reference to dead object '%s'",
5167 /* DESTROY gave object new lease on life */
5173 SvREFCNT_dec(SvSTASH(sv)); /* possibly of changed persuasion */
5174 SvOBJECT_off(sv); /* Curse the object. */
5175 if (SvTYPE(sv) != SVt_PVIO)
5176 --PL_sv_objcount; /* XXX Might want something more general */
5179 if (SvTYPE(sv) >= SVt_PVMG) {
5182 if (SvFLAGS(sv) & SVpad_TYPED)
5183 SvREFCNT_dec(SvSTASH(sv));
5186 switch (SvTYPE(sv)) {
5189 IoIFP(sv) != PerlIO_stdin() &&
5190 IoIFP(sv) != PerlIO_stdout() &&
5191 IoIFP(sv) != PerlIO_stderr())
5193 io_close((IO*)sv, FALSE);
5195 if (IoDIRP(sv) && !(IoFLAGS(sv) & IOf_FAKE_DIRP))
5196 PerlDir_close(IoDIRP(sv));
5197 IoDIRP(sv) = (DIR*)NULL;
5198 Safefree(IoTOP_NAME(sv));
5199 Safefree(IoFMT_NAME(sv));
5200 Safefree(IoBOTTOM_NAME(sv));
5215 SvREFCNT_dec(LvTARG(sv));
5219 Safefree(GvNAME(sv));
5220 /* cannot decrease stash refcount yet, as we might recursively delete
5221 ourselves when the refcnt drops to zero. Delay SvREFCNT_dec
5222 of stash until current sv is completely gone.
5223 -- JohnPC, 27 Mar 1998 */
5224 stash = GvSTASH(sv);
5230 (void)SvOOK_off(sv);
5238 SvREFCNT_dec(SvRV(sv));
5240 #ifdef PERL_COPY_ON_WRITE
5241 else if (SvPVX(sv)) {
5243 /* I believe I need to grab the global SV mutex here and
5244 then recheck the COW status. */
5246 PerlIO_printf(Perl_debug_log, "Copy on write: clear\n");
5249 sv_release_COW(sv, SvPVX(sv), SvCUR(sv), SvLEN(sv),
5250 SvUVX(sv), SV_COW_NEXT_SV(sv));
5251 /* And drop it here. */
5253 } else if (SvLEN(sv)) {
5254 Safefree(SvPVX(sv));
5258 else if (SvPVX(sv) && SvLEN(sv))
5259 Safefree(SvPVX(sv));
5260 else if (SvPVX(sv) && SvREADONLY(sv) && SvFAKE(sv)) {
5261 unsharepvn(SvPVX(sv),
5262 SvUTF8(sv) ? -(I32)SvCUR(sv) : SvCUR(sv),
5276 switch (SvTYPE(sv)) {
5292 del_XPVIV(SvANY(sv));
5295 del_XPVNV(SvANY(sv));
5298 del_XPVMG(SvANY(sv));
5301 del_XPVLV(SvANY(sv));
5304 del_XPVAV(SvANY(sv));
5307 del_XPVHV(SvANY(sv));
5310 del_XPVCV(SvANY(sv));
5313 del_XPVGV(SvANY(sv));
5314 /* code duplication for increased performance. */
5315 SvFLAGS(sv) &= SVf_BREAK;
5316 SvFLAGS(sv) |= SVTYPEMASK;
5317 /* decrease refcount of the stash that owns this GV, if any */
5319 SvREFCNT_dec(stash);
5320 return; /* not break, SvFLAGS reset already happened */
5322 del_XPVBM(SvANY(sv));
5325 del_XPVFM(SvANY(sv));
5328 del_XPVIO(SvANY(sv));
5331 SvFLAGS(sv) &= SVf_BREAK;
5332 SvFLAGS(sv) |= SVTYPEMASK;
5336 =for apidoc sv_newref
5338 Increment an SV's reference count. Use the C<SvREFCNT_inc()> wrapper
5345 Perl_sv_newref(pTHX_ SV *sv)
5348 ATOMIC_INC(SvREFCNT(sv));
5355 Decrement an SV's reference count, and if it drops to zero, call
5356 C<sv_clear> to invoke destructors and free up any memory used by
5357 the body; finally, deallocate the SV's head itself.
5358 Normally called via a wrapper macro C<SvREFCNT_dec>.
5364 Perl_sv_free(pTHX_ SV *sv)
5366 int refcount_is_zero;
5370 if (SvREFCNT(sv) == 0) {
5371 if (SvFLAGS(sv) & SVf_BREAK)
5372 /* this SV's refcnt has been artificially decremented to
5373 * trigger cleanup */
5375 if (PL_in_clean_all) /* All is fair */
5377 if (SvREADONLY(sv) && SvIMMORTAL(sv)) {
5378 /* make sure SvREFCNT(sv)==0 happens very seldom */
5379 SvREFCNT(sv) = (~(U32)0)/2;
5382 if (ckWARN_d(WARN_INTERNAL))
5383 Perl_warner(aTHX_ packWARN(WARN_INTERNAL), "Attempt to free unreferenced scalar");
5386 ATOMIC_DEC_AND_TEST(refcount_is_zero, SvREFCNT(sv));
5387 if (!refcount_is_zero)
5391 if (ckWARN_d(WARN_DEBUGGING))
5392 Perl_warner(aTHX_ packWARN(WARN_DEBUGGING),
5393 "Attempt to free temp prematurely: SV 0x%"UVxf,
5398 if (SvREADONLY(sv) && SvIMMORTAL(sv)) {
5399 /* make sure SvREFCNT(sv)==0 happens very seldom */
5400 SvREFCNT(sv) = (~(U32)0)/2;
5411 Returns the length of the string in the SV. Handles magic and type
5412 coercion. See also C<SvCUR>, which gives raw access to the xpv_cur slot.
5418 Perl_sv_len(pTHX_ register SV *sv)
5426 len = mg_length(sv);
5428 (void)SvPV(sv, len);
5433 =for apidoc sv_len_utf8
5435 Returns the number of characters in the string in an SV, counting wide
5436 UTF8 bytes as a single character. Handles magic and type coercion.
5442 Perl_sv_len_utf8(pTHX_ register SV *sv)
5448 return mg_length(sv);
5452 U8 *s = (U8*)SvPV(sv, len);
5454 return Perl_utf8_length(aTHX_ s, s + len);
5459 =for apidoc sv_pos_u2b
5461 Converts the value pointed to by offsetp from a count of UTF8 chars from
5462 the start of the string, to a count of the equivalent number of bytes; if
5463 lenp is non-zero, it does the same to lenp, but this time starting from
5464 the offset, rather than from the start of the string. Handles magic and
5471 Perl_sv_pos_u2b(pTHX_ register SV *sv, I32* offsetp, I32* lenp)
5476 I32 uoffset = *offsetp;
5482 start = s = (U8*)SvPV(sv, len);
5484 while (s < send && uoffset--)
5488 *offsetp = s - start;
5492 while (s < send && ulen--)
5502 =for apidoc sv_pos_b2u
5504 Converts the value pointed to by offsetp from a count of bytes from the
5505 start of the string, to a count of the equivalent number of UTF8 chars.
5506 Handles magic and type coercion.
5512 Perl_sv_pos_b2u(pTHX_ register SV *sv, I32* offsetp)
5521 s = (U8*)SvPV(sv, len);
5522 if ((I32)len < *offsetp)
5523 Perl_croak(aTHX_ "panic: sv_pos_b2u: bad byte offset");
5524 send = s + *offsetp;
5528 /* Call utf8n_to_uvchr() to validate the sequence
5529 * (unless a simple non-UTF character) */
5530 if (!UTF8_IS_INVARIANT(*s))
5531 utf8n_to_uvchr(s, UTF8SKIP(s), &n, 0);
5546 Returns a boolean indicating whether the strings in the two SVs are
5547 identical. Is UTF-8 and 'use bytes' aware, handles get magic, and will
5548 coerce its args to strings if necessary.
5554 Perl_sv_eq(pTHX_ register SV *sv1, register SV *sv2)
5562 SV* svrecode = Nullsv;
5569 pv1 = SvPV(sv1, cur1);
5576 pv2 = SvPV(sv2, cur2);
5578 if (cur1 && cur2 && SvUTF8(sv1) != SvUTF8(sv2) && !IN_BYTES) {
5579 /* Differing utf8ness.
5580 * Do not UTF8size the comparands as a side-effect. */
5583 svrecode = newSVpvn(pv2, cur2);
5584 sv_recode_to_utf8(svrecode, PL_encoding);
5585 pv2 = SvPV(svrecode, cur2);
5588 svrecode = newSVpvn(pv1, cur1);
5589 sv_recode_to_utf8(svrecode, PL_encoding);
5590 pv1 = SvPV(svrecode, cur1);
5592 /* Now both are in UTF-8. */
5597 bool is_utf8 = TRUE;
5600 /* sv1 is the UTF-8 one,
5601 * if is equal it must be downgrade-able */
5602 char *pv = (char*)bytes_from_utf8((U8*)pv1,
5608 /* sv2 is the UTF-8 one,
5609 * if is equal it must be downgrade-able */
5610 char *pv = (char *)bytes_from_utf8((U8*)pv2,
5616 /* Downgrade not possible - cannot be eq */
5623 eq = (pv1 == pv2) || memEQ(pv1, pv2, cur1);
5626 SvREFCNT_dec(svrecode);
5637 Compares the strings in two SVs. Returns -1, 0, or 1 indicating whether the
5638 string in C<sv1> is less than, equal to, or greater than the string in
5639 C<sv2>. Is UTF-8 and 'use bytes' aware, handles get magic, and will
5640 coerce its args to strings if necessary. See also C<sv_cmp_locale>.
5646 Perl_sv_cmp(pTHX_ register SV *sv1, register SV *sv2)
5649 char *pv1, *pv2, *tpv = Nullch;
5651 SV *svrecode = Nullsv;
5658 pv1 = SvPV(sv1, cur1);
5665 pv2 = SvPV(sv2, cur2);
5667 if (cur1 && cur2 && SvUTF8(sv1) != SvUTF8(sv2) && !IN_BYTES) {
5668 /* Differing utf8ness.
5669 * Do not UTF8size the comparands as a side-effect. */
5672 svrecode = newSVpvn(pv2, cur2);
5673 sv_recode_to_utf8(svrecode, PL_encoding);
5674 pv2 = SvPV(svrecode, cur2);
5677 pv2 = tpv = (char*)bytes_to_utf8((U8*)pv2, &cur2);
5682 svrecode = newSVpvn(pv1, cur1);
5683 sv_recode_to_utf8(svrecode, PL_encoding);
5684 pv1 = SvPV(svrecode, cur1);
5687 pv1 = tpv = (char*)bytes_to_utf8((U8*)pv1, &cur1);
5693 cmp = cur2 ? -1 : 0;
5697 I32 retval = memcmp((void*)pv1, (void*)pv2, cur1 < cur2 ? cur1 : cur2);
5700 cmp = retval < 0 ? -1 : 1;
5701 } else if (cur1 == cur2) {
5704 cmp = cur1 < cur2 ? -1 : 1;
5709 SvREFCNT_dec(svrecode);
5718 =for apidoc sv_cmp_locale
5720 Compares the strings in two SVs in a locale-aware manner. Is UTF-8 and
5721 'use bytes' aware, handles get magic, and will coerce its args to strings
5722 if necessary. See also C<sv_cmp_locale>. See also C<sv_cmp>.
5728 Perl_sv_cmp_locale(pTHX_ register SV *sv1, register SV *sv2)
5730 #ifdef USE_LOCALE_COLLATE
5736 if (PL_collation_standard)
5740 pv1 = sv1 ? sv_collxfrm(sv1, &len1) : (char *) NULL;
5742 pv2 = sv2 ? sv_collxfrm(sv2, &len2) : (char *) NULL;
5744 if (!pv1 || !len1) {
5755 retval = memcmp((void*)pv1, (void*)pv2, len1 < len2 ? len1 : len2);
5758 return retval < 0 ? -1 : 1;
5761 * When the result of collation is equality, that doesn't mean
5762 * that there are no differences -- some locales exclude some
5763 * characters from consideration. So to avoid false equalities,
5764 * we use the raw string as a tiebreaker.
5770 #endif /* USE_LOCALE_COLLATE */
5772 return sv_cmp(sv1, sv2);
5776 #ifdef USE_LOCALE_COLLATE
5779 =for apidoc sv_collxfrm
5781 Add Collate Transform magic to an SV if it doesn't already have it.
5783 Any scalar variable may carry PERL_MAGIC_collxfrm magic that contains the
5784 scalar data of the variable, but transformed to such a format that a normal
5785 memory comparison can be used to compare the data according to the locale
5792 Perl_sv_collxfrm(pTHX_ SV *sv, STRLEN *nxp)
5796 mg = SvMAGICAL(sv) ? mg_find(sv, PERL_MAGIC_collxfrm) : (MAGIC *) NULL;
5797 if (!mg || !mg->mg_ptr || *(U32*)mg->mg_ptr != PL_collation_ix) {
5802 Safefree(mg->mg_ptr);
5804 if ((xf = mem_collxfrm(s, len, &xlen))) {
5805 if (SvREADONLY(sv)) {
5808 return xf + sizeof(PL_collation_ix);
5811 sv_magic(sv, 0, PERL_MAGIC_collxfrm, 0, 0);
5812 mg = mg_find(sv, PERL_MAGIC_collxfrm);
5825 if (mg && mg->mg_ptr) {
5827 return mg->mg_ptr + sizeof(PL_collation_ix);
5835 #endif /* USE_LOCALE_COLLATE */
5840 Get a line from the filehandle and store it into the SV, optionally
5841 appending to the currently-stored string.
5847 Perl_sv_gets(pTHX_ register SV *sv, register PerlIO *fp, I32 append)
5851 register STDCHAR rslast;
5852 register STDCHAR *bp;
5857 SV_CHECK_THINKFIRST_COW_DROP(sv);
5858 /* XXX. If you make this PVIV, then copy on write can copy scalars read
5860 However, perlbench says it's slower, because the existing swipe code
5861 is faster than copy on write.
5862 Swings and roundabouts. */
5863 (void)SvUPGRADE(sv, SVt_PV);
5867 if (PL_curcop == &PL_compiling) {
5868 /* we always read code in line mode */
5872 else if (RsSNARF(PL_rs)) {
5876 else if (RsRECORD(PL_rs)) {
5877 I32 recsize, bytesread;
5880 /* Grab the size of the record we're getting */
5881 recsize = SvIV(SvRV(PL_rs));
5882 (void)SvPOK_only(sv); /* Validate pointer */
5883 buffer = SvGROW(sv, (STRLEN)(recsize + 1));
5886 /* VMS wants read instead of fread, because fread doesn't respect */
5887 /* RMS record boundaries. This is not necessarily a good thing to be */
5888 /* doing, but we've got no other real choice */
5889 bytesread = PerlLIO_read(PerlIO_fileno(fp), buffer, recsize);
5891 bytesread = PerlIO_read(fp, buffer, recsize);
5893 SvCUR_set(sv, bytesread);
5894 buffer[bytesread] = '\0';
5895 if (PerlIO_isutf8(fp))
5899 return(SvCUR(sv) ? SvPVX(sv) : Nullch);
5901 else if (RsPARA(PL_rs)) {
5907 /* Get $/ i.e. PL_rs into same encoding as stream wants */
5908 if (PerlIO_isutf8(fp)) {
5909 rsptr = SvPVutf8(PL_rs, rslen);
5912 if (SvUTF8(PL_rs)) {
5913 if (!sv_utf8_downgrade(PL_rs, TRUE)) {
5914 Perl_croak(aTHX_ "Wide character in $/");
5917 rsptr = SvPV(PL_rs, rslen);
5921 rslast = rslen ? rsptr[rslen - 1] : '\0';
5923 if (rspara) { /* have to do this both before and after */
5924 do { /* to make sure file boundaries work right */
5927 i = PerlIO_getc(fp);
5931 PerlIO_ungetc(fp,i);
5937 /* See if we know enough about I/O mechanism to cheat it ! */
5939 /* This used to be #ifdef test - it is made run-time test for ease
5940 of abstracting out stdio interface. One call should be cheap
5941 enough here - and may even be a macro allowing compile
5945 if (PerlIO_fast_gets(fp)) {
5948 * We're going to steal some values from the stdio struct
5949 * and put EVERYTHING in the innermost loop into registers.
5951 register STDCHAR *ptr;
5955 #if defined(VMS) && defined(PERLIO_IS_STDIO)
5956 /* An ungetc()d char is handled separately from the regular
5957 * buffer, so we getc() it back out and stuff it in the buffer.
5959 i = PerlIO_getc(fp);
5960 if (i == EOF) return 0;
5961 *(--((*fp)->_ptr)) = (unsigned char) i;
5965 /* Here is some breathtakingly efficient cheating */
5967 cnt = PerlIO_get_cnt(fp); /* get count into register */
5968 (void)SvPOK_only(sv); /* validate pointer */
5969 if ((I32)(SvLEN(sv) - append) <= cnt + 1) { /* make sure we have the room */
5970 if (cnt > 80 && (I32)SvLEN(sv) > append) {
5971 shortbuffered = cnt - SvLEN(sv) + append + 1;
5972 cnt -= shortbuffered;
5976 /* remember that cnt can be negative */
5977 SvGROW(sv, (STRLEN)(append + (cnt <= 0 ? 2 : (cnt + 1))));
5982 bp = (STDCHAR*)SvPVX(sv) + append; /* move these two too to registers */
5983 ptr = (STDCHAR*)PerlIO_get_ptr(fp);
5984 DEBUG_P(PerlIO_printf(Perl_debug_log,
5985 "Screamer: entering, ptr=%"UVuf", cnt=%ld\n",PTR2UV(ptr),(long)cnt));
5986 DEBUG_P(PerlIO_printf(Perl_debug_log,
5987 "Screamer: entering: PerlIO * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
5988 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
5989 PTR2UV(PerlIO_has_base(fp) ? PerlIO_get_base(fp) : 0)));
5994 while (cnt > 0) { /* this | eat */
5996 if ((*bp++ = *ptr++) == rslast) /* really | dust */
5997 goto thats_all_folks; /* screams | sed :-) */
6001 Copy(ptr, bp, cnt, char); /* this | eat */
6002 bp += cnt; /* screams | dust */
6003 ptr += cnt; /* louder | sed :-) */
6008 if (shortbuffered) { /* oh well, must extend */
6009 cnt = shortbuffered;
6011 bpx = bp - (STDCHAR*)SvPVX(sv); /* box up before relocation */
6013 SvGROW(sv, SvLEN(sv) + append + cnt + 2);
6014 bp = (STDCHAR*)SvPVX(sv) + bpx; /* unbox after relocation */
6018 DEBUG_P(PerlIO_printf(Perl_debug_log,
6019 "Screamer: going to getc, ptr=%"UVuf", cnt=%ld\n",
6020 PTR2UV(ptr),(long)cnt));
6021 PerlIO_set_ptrcnt(fp, (STDCHAR*)ptr, cnt); /* deregisterize cnt and ptr */
6023 DEBUG_P(PerlIO_printf(Perl_debug_log,
6024 "Screamer: pre: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
6025 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
6026 PTR2UV(PerlIO_has_base (fp) ? PerlIO_get_base(fp) : 0)));
6028 /* This used to call 'filbuf' in stdio form, but as that behaves like
6029 getc when cnt <= 0 we use PerlIO_getc here to avoid introducing
6030 another abstraction. */
6031 i = PerlIO_getc(fp); /* get more characters */
6033 DEBUG_P(PerlIO_printf(Perl_debug_log,
6034 "Screamer: post: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
6035 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
6036 PTR2UV(PerlIO_has_base (fp) ? PerlIO_get_base(fp) : 0)));
6038 cnt = PerlIO_get_cnt(fp);
6039 ptr = (STDCHAR*)PerlIO_get_ptr(fp); /* reregisterize cnt and ptr */
6040 DEBUG_P(PerlIO_printf(Perl_debug_log,
6041 "Screamer: after getc, ptr=%"UVuf", cnt=%ld\n",PTR2UV(ptr),(long)cnt));
6043 if (i == EOF) /* all done for ever? */
6044 goto thats_really_all_folks;
6046 bpx = bp - (STDCHAR*)SvPVX(sv); /* box up before relocation */
6048 SvGROW(sv, bpx + cnt + 2);
6049 bp = (STDCHAR*)SvPVX(sv) + bpx; /* unbox after relocation */
6051 *bp++ = (STDCHAR)i; /* store character from PerlIO_getc */
6053 if (rslen && (STDCHAR)i == rslast) /* all done for now? */
6054 goto thats_all_folks;
6058 if ((rslen > 1 && (STRLEN)(bp - (STDCHAR*)SvPVX(sv)) < rslen) ||
6059 memNE((char*)bp - rslen, rsptr, rslen))
6060 goto screamer; /* go back to the fray */
6061 thats_really_all_folks:
6063 cnt += shortbuffered;
6064 DEBUG_P(PerlIO_printf(Perl_debug_log,
6065 "Screamer: quitting, ptr=%"UVuf", cnt=%ld\n",PTR2UV(ptr),(long)cnt));
6066 PerlIO_set_ptrcnt(fp, (STDCHAR*)ptr, cnt); /* put these back or we're in trouble */
6067 DEBUG_P(PerlIO_printf(Perl_debug_log,
6068 "Screamer: end: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
6069 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
6070 PTR2UV(PerlIO_has_base (fp) ? PerlIO_get_base(fp) : 0)));
6072 SvCUR_set(sv, bp - (STDCHAR*)SvPVX(sv)); /* set length */
6073 DEBUG_P(PerlIO_printf(Perl_debug_log,
6074 "Screamer: done, len=%ld, string=|%.*s|\n",
6075 (long)SvCUR(sv),(int)SvCUR(sv),SvPVX(sv)));
6080 /*The big, slow, and stupid way */
6083 /* Need to work around EPOC SDK features */
6084 /* On WINS: MS VC5 generates calls to _chkstk, */
6085 /* if a `large' stack frame is allocated */
6086 /* gcc on MARM does not generate calls like these */
6092 register STDCHAR *bpe = buf + sizeof(buf);
6094 while ((i = PerlIO_getc(fp)) != EOF && (*bp++ = (STDCHAR)i) != rslast && bp < bpe)
6095 ; /* keep reading */
6099 cnt = PerlIO_read(fp,(char*)buf, sizeof(buf));
6100 /* Accomodate broken VAXC compiler, which applies U8 cast to
6101 * both args of ?: operator, causing EOF to change into 255
6104 i = (U8)buf[cnt - 1];
6110 cnt = 0; /* we do need to re-set the sv even when cnt <= 0 */
6112 sv_catpvn(sv, (char *) buf, cnt);
6114 sv_setpvn(sv, (char *) buf, cnt);
6116 if (i != EOF && /* joy */
6118 SvCUR(sv) < rslen ||
6119 memNE(SvPVX(sv) + SvCUR(sv) - rslen, rsptr, rslen)))
6123 * If we're reading from a TTY and we get a short read,
6124 * indicating that the user hit his EOF character, we need
6125 * to notice it now, because if we try to read from the TTY
6126 * again, the EOF condition will disappear.
6128 * The comparison of cnt to sizeof(buf) is an optimization
6129 * that prevents unnecessary calls to feof().
6133 if (!(cnt < sizeof(buf) && PerlIO_eof(fp)))
6138 if (rspara) { /* have to do this both before and after */
6139 while (i != EOF) { /* to make sure file boundaries work right */
6140 i = PerlIO_getc(fp);
6142 PerlIO_ungetc(fp,i);
6148 if (PerlIO_isutf8(fp))
6153 return (SvCUR(sv) - append) ? SvPVX(sv) : Nullch;
6159 Auto-increment of the value in the SV, doing string to numeric conversion
6160 if necessary. Handles 'get' magic.
6166 Perl_sv_inc(pTHX_ register SV *sv)
6175 if (SvTHINKFIRST(sv)) {
6177 sv_force_normal_flags(sv, 0);
6178 if (SvREADONLY(sv)) {
6179 if (PL_curcop != &PL_compiling)
6180 Perl_croak(aTHX_ PL_no_modify);
6184 if (SvAMAGIC(sv) && AMG_CALLun(sv,inc))
6186 i = PTR2IV(SvRV(sv));
6191 flags = SvFLAGS(sv);
6192 if ((flags & (SVp_NOK|SVp_IOK)) == SVp_NOK) {
6193 /* It's (privately or publicly) a float, but not tested as an
6194 integer, so test it to see. */
6196 flags = SvFLAGS(sv);
6198 if ((flags & SVf_IOK) || ((flags & (SVp_IOK | SVp_NOK)) == SVp_IOK)) {
6199 /* It's publicly an integer, or privately an integer-not-float */
6200 #ifdef PERL_PRESERVE_IVUV
6204 if (SvUVX(sv) == UV_MAX)
6205 sv_setnv(sv, UV_MAX_P1);
6207 (void)SvIOK_only_UV(sv);
6210 if (SvIVX(sv) == IV_MAX)
6211 sv_setuv(sv, (UV)IV_MAX + 1);
6213 (void)SvIOK_only(sv);
6219 if (flags & SVp_NOK) {
6220 (void)SvNOK_only(sv);
6225 if (!(flags & SVp_POK) || !*SvPVX(sv)) {
6226 if ((flags & SVTYPEMASK) < SVt_PVIV)
6227 sv_upgrade(sv, SVt_IV);
6228 (void)SvIOK_only(sv);
6233 while (isALPHA(*d)) d++;
6234 while (isDIGIT(*d)) d++;
6236 #ifdef PERL_PRESERVE_IVUV
6237 /* Got to punt this as an integer if needs be, but we don't issue
6238 warnings. Probably ought to make the sv_iv_please() that does
6239 the conversion if possible, and silently. */
6240 int numtype = grok_number(SvPVX(sv), SvCUR(sv), NULL);
6241 if (numtype && !(numtype & IS_NUMBER_INFINITY)) {
6242 /* Need to try really hard to see if it's an integer.
6243 9.22337203685478e+18 is an integer.
6244 but "9.22337203685478e+18" + 0 is UV=9223372036854779904
6245 so $a="9.22337203685478e+18"; $a+0; $a++
6246 needs to be the same as $a="9.22337203685478e+18"; $a++
6253 /* sv_2iv *should* have made this an NV */
6254 if (flags & SVp_NOK) {
6255 (void)SvNOK_only(sv);
6259 /* I don't think we can get here. Maybe I should assert this
6260 And if we do get here I suspect that sv_setnv will croak. NWC
6262 #if defined(USE_LONG_DOUBLE)
6263 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",
6264 SvPVX(sv), SvIVX(sv), SvNVX(sv)));
6266 DEBUG_c(PerlIO_printf(Perl_debug_log,"sv_inc punt failed to convert '%s' to IOK or NOKp, UV=0x%"UVxf" NV=%"NVgf"\n",
6267 SvPVX(sv), SvIVX(sv), SvNVX(sv)));
6270 #endif /* PERL_PRESERVE_IVUV */
6271 sv_setnv(sv,Atof(SvPVX(sv)) + 1.0);
6275 while (d >= SvPVX(sv)) {
6283 /* MKS: The original code here died if letters weren't consecutive.
6284 * at least it didn't have to worry about non-C locales. The
6285 * new code assumes that ('z'-'a')==('Z'-'A'), letters are
6286 * arranged in order (although not consecutively) and that only
6287 * [A-Za-z] are accepted by isALPHA in the C locale.
6289 if (*d != 'z' && *d != 'Z') {
6290 do { ++*d; } while (!isALPHA(*d));
6293 *(d--) -= 'z' - 'a';
6298 *(d--) -= 'z' - 'a' + 1;
6302 /* oh,oh, the number grew */
6303 SvGROW(sv, SvCUR(sv) + 2);
6305 for (d = SvPVX(sv) + SvCUR(sv); d > SvPVX(sv); d--)
6316 Auto-decrement of the value in the SV, doing string to numeric conversion
6317 if necessary. Handles 'get' magic.
6323 Perl_sv_dec(pTHX_ register SV *sv)
6331 if (SvTHINKFIRST(sv)) {
6333 sv_force_normal_flags(sv, 0);
6334 if (SvREADONLY(sv)) {
6335 if (PL_curcop != &PL_compiling)
6336 Perl_croak(aTHX_ PL_no_modify);
6340 if (SvAMAGIC(sv) && AMG_CALLun(sv,dec))
6342 i = PTR2IV(SvRV(sv));
6347 /* Unlike sv_inc we don't have to worry about string-never-numbers
6348 and keeping them magic. But we mustn't warn on punting */
6349 flags = SvFLAGS(sv);
6350 if ((flags & SVf_IOK) || ((flags & (SVp_IOK | SVp_NOK)) == SVp_IOK)) {
6351 /* It's publicly an integer, or privately an integer-not-float */
6352 #ifdef PERL_PRESERVE_IVUV
6356 if (SvUVX(sv) == 0) {
6357 (void)SvIOK_only(sv);
6361 (void)SvIOK_only_UV(sv);
6365 if (SvIVX(sv) == IV_MIN)
6366 sv_setnv(sv, (NV)IV_MIN - 1.0);
6368 (void)SvIOK_only(sv);
6374 if (flags & SVp_NOK) {
6376 (void)SvNOK_only(sv);
6379 if (!(flags & SVp_POK)) {
6380 if ((flags & SVTYPEMASK) < SVt_PVNV)
6381 sv_upgrade(sv, SVt_NV);
6383 (void)SvNOK_only(sv);
6386 #ifdef PERL_PRESERVE_IVUV
6388 int numtype = grok_number(SvPVX(sv), SvCUR(sv), NULL);
6389 if (numtype && !(numtype & IS_NUMBER_INFINITY)) {
6390 /* Need to try really hard to see if it's an integer.
6391 9.22337203685478e+18 is an integer.
6392 but "9.22337203685478e+18" + 0 is UV=9223372036854779904
6393 so $a="9.22337203685478e+18"; $a+0; $a--
6394 needs to be the same as $a="9.22337203685478e+18"; $a--
6401 /* sv_2iv *should* have made this an NV */
6402 if (flags & SVp_NOK) {
6403 (void)SvNOK_only(sv);
6407 /* I don't think we can get here. Maybe I should assert this
6408 And if we do get here I suspect that sv_setnv will croak. NWC
6410 #if defined(USE_LONG_DOUBLE)
6411 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",
6412 SvPVX(sv), SvIVX(sv), SvNVX(sv)));
6414 DEBUG_c(PerlIO_printf(Perl_debug_log,"sv_dec punt failed to convert '%s' to IOK or NOKp, UV=0x%"UVxf" NV=%"NVgf"\n",
6415 SvPVX(sv), SvIVX(sv), SvNVX(sv)));
6419 #endif /* PERL_PRESERVE_IVUV */
6420 sv_setnv(sv,Atof(SvPVX(sv)) - 1.0); /* punt */
6424 =for apidoc sv_mortalcopy
6426 Creates a new SV which is a copy of the original SV (using C<sv_setsv>).
6427 The new SV is marked as mortal. It will be destroyed "soon", either by an
6428 explicit call to FREETMPS, or by an implicit call at places such as
6429 statement boundaries. See also C<sv_newmortal> and C<sv_2mortal>.
6434 /* Make a string that will exist for the duration of the expression
6435 * evaluation. Actually, it may have to last longer than that, but
6436 * hopefully we won't free it until it has been assigned to a
6437 * permanent location. */
6440 Perl_sv_mortalcopy(pTHX_ SV *oldstr)
6445 sv_setsv(sv,oldstr);
6447 PL_tmps_stack[++PL_tmps_ix] = sv;
6453 =for apidoc sv_newmortal
6455 Creates a new null SV which is mortal. The reference count of the SV is
6456 set to 1. It will be destroyed "soon", either by an explicit call to
6457 FREETMPS, or by an implicit call at places such as statement boundaries.
6458 See also C<sv_mortalcopy> and C<sv_2mortal>.
6464 Perl_sv_newmortal(pTHX)
6469 SvFLAGS(sv) = SVs_TEMP;
6471 PL_tmps_stack[++PL_tmps_ix] = sv;
6476 =for apidoc sv_2mortal
6478 Marks an existing SV as mortal. The SV will be destroyed "soon", either
6479 by an explicit call to FREETMPS, or by an implicit call at places such as
6480 statement boundaries. See also C<sv_newmortal> and C<sv_mortalcopy>.
6486 Perl_sv_2mortal(pTHX_ register SV *sv)
6490 if (SvREADONLY(sv) && SvIMMORTAL(sv))
6493 PL_tmps_stack[++PL_tmps_ix] = sv;
6501 Creates a new SV and copies a string into it. The reference count for the
6502 SV is set to 1. If C<len> is zero, Perl will compute the length using
6503 strlen(). For efficiency, consider using C<newSVpvn> instead.
6509 Perl_newSVpv(pTHX_ const char *s, STRLEN len)
6516 sv_setpvn(sv,s,len);
6521 =for apidoc newSVpvn
6523 Creates a new SV and copies a string into it. The reference count for the
6524 SV is set to 1. Note that if C<len> is zero, Perl will create a zero length
6525 string. You are responsible for ensuring that the source string is at least
6532 Perl_newSVpvn(pTHX_ const char *s, STRLEN len)
6537 sv_setpvn(sv,s,len);
6542 =for apidoc newSVpvn_share
6544 Creates a new SV with its SvPVX pointing to a shared string in the string
6545 table. If the string does not already exist in the table, it is created
6546 first. Turns on READONLY and FAKE. The string's hash is stored in the UV
6547 slot of the SV; if the C<hash> parameter is non-zero, that value is used;
6548 otherwise the hash is computed. The idea here is that as the string table
6549 is used for shared hash keys these strings will have SvPVX == HeKEY and
6550 hash lookup will avoid string compare.
6556 Perl_newSVpvn_share(pTHX_ const char *src, I32 len, U32 hash)
6559 bool is_utf8 = FALSE;
6561 STRLEN tmplen = -len;
6563 /* See the note in hv.c:hv_fetch() --jhi */
6564 src = (char*)bytes_from_utf8((U8*)src, &tmplen, &is_utf8);
6568 PERL_HASH(hash, src, len);
6570 sv_upgrade(sv, SVt_PVIV);
6571 SvPVX(sv) = sharepvn(src, is_utf8?-len:len, hash);
6584 #if defined(PERL_IMPLICIT_CONTEXT)
6586 /* pTHX_ magic can't cope with varargs, so this is a no-context
6587 * version of the main function, (which may itself be aliased to us).
6588 * Don't access this version directly.
6592 Perl_newSVpvf_nocontext(const char* pat, ...)
6597 va_start(args, pat);
6598 sv = vnewSVpvf(pat, &args);
6605 =for apidoc newSVpvf
6607 Creates a new SV and initializes it with the string formatted like
6614 Perl_newSVpvf(pTHX_ const char* pat, ...)
6618 va_start(args, pat);
6619 sv = vnewSVpvf(pat, &args);
6624 /* backend for newSVpvf() and newSVpvf_nocontext() */
6627 Perl_vnewSVpvf(pTHX_ const char* pat, va_list* args)
6631 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
6638 Creates a new SV and copies a floating point value into it.
6639 The reference count for the SV is set to 1.
6645 Perl_newSVnv(pTHX_ NV n)
6657 Creates a new SV and copies an integer into it. The reference count for the
6664 Perl_newSViv(pTHX_ IV i)
6676 Creates a new SV and copies an unsigned integer into it.
6677 The reference count for the SV is set to 1.
6683 Perl_newSVuv(pTHX_ UV u)
6693 =for apidoc newRV_noinc
6695 Creates an RV wrapper for an SV. The reference count for the original
6696 SV is B<not> incremented.
6702 Perl_newRV_noinc(pTHX_ SV *tmpRef)
6707 sv_upgrade(sv, SVt_RV);
6714 /* newRV_inc is the official function name to use now.
6715 * newRV_inc is in fact #defined to newRV in sv.h
6719 Perl_newRV(pTHX_ SV *tmpRef)
6721 return newRV_noinc(SvREFCNT_inc(tmpRef));
6727 Creates a new SV which is an exact duplicate of the original SV.
6734 Perl_newSVsv(pTHX_ register SV *old)
6740 if (SvTYPE(old) == SVTYPEMASK) {
6741 if (ckWARN_d(WARN_INTERNAL))
6742 Perl_warner(aTHX_ packWARN(WARN_INTERNAL), "semi-panic: attempt to dup freed string");
6757 =for apidoc sv_reset
6759 Underlying implementation for the C<reset> Perl function.
6760 Note that the perl-level function is vaguely deprecated.
6766 Perl_sv_reset(pTHX_ register char *s, HV *stash)
6774 char todo[PERL_UCHAR_MAX+1];
6779 if (!*s) { /* reset ?? searches */
6780 for (pm = HvPMROOT(stash); pm; pm = pm->op_pmnext) {
6781 pm->op_pmdynflags &= ~PMdf_USED;
6786 /* reset variables */
6788 if (!HvARRAY(stash))
6791 Zero(todo, 256, char);
6793 i = (unsigned char)*s;
6797 max = (unsigned char)*s++;
6798 for ( ; i <= max; i++) {
6801 for (i = 0; i <= (I32) HvMAX(stash); i++) {
6802 for (entry = HvARRAY(stash)[i];
6804 entry = HeNEXT(entry))
6806 if (!todo[(U8)*HeKEY(entry)])
6808 gv = (GV*)HeVAL(entry);
6810 if (SvTHINKFIRST(sv)) {
6811 if (!SvREADONLY(sv) && SvROK(sv))
6816 if (SvTYPE(sv) >= SVt_PV) {
6818 if (SvPVX(sv) != Nullch)
6825 if (GvHV(gv) && !HvNAME(GvHV(gv))) {
6827 #ifdef USE_ENVIRON_ARRAY
6829 # ifdef USE_ITHREADS
6830 && PL_curinterp == aTHX
6834 environ[0] = Nullch;
6846 Using various gambits, try to get an IO from an SV: the IO slot if its a
6847 GV; or the recursive result if we're an RV; or the IO slot of the symbol
6848 named after the PV if we're a string.
6854 Perl_sv_2io(pTHX_ SV *sv)
6860 switch (SvTYPE(sv)) {
6868 Perl_croak(aTHX_ "Bad filehandle: %s", GvNAME(gv));
6872 Perl_croak(aTHX_ PL_no_usym, "filehandle");
6874 return sv_2io(SvRV(sv));
6875 gv = gv_fetchpv(SvPV(sv,n_a), FALSE, SVt_PVIO);
6881 Perl_croak(aTHX_ "Bad filehandle: %s", SvPV(sv,n_a));
6890 Using various gambits, try to get a CV from an SV; in addition, try if
6891 possible to set C<*st> and C<*gvp> to the stash and GV associated with it.
6897 Perl_sv_2cv(pTHX_ SV *sv, HV **st, GV **gvp, I32 lref)
6904 return *gvp = Nullgv, Nullcv;
6905 switch (SvTYPE(sv)) {
6924 SV **sp = &sv; /* Used in tryAMAGICunDEREF macro. */
6925 tryAMAGICunDEREF(to_cv);
6928 if (SvTYPE(sv) == SVt_PVCV) {
6937 Perl_croak(aTHX_ "Not a subroutine reference");
6942 gv = gv_fetchpv(SvPV(sv, n_a), lref, SVt_PVCV);
6948 if (lref && !GvCVu(gv)) {
6951 tmpsv = NEWSV(704,0);
6952 gv_efullname3(tmpsv, gv, Nullch);
6953 /* XXX this is probably not what they think they're getting.
6954 * It has the same effect as "sub name;", i.e. just a forward
6956 newSUB(start_subparse(FALSE, 0),
6957 newSVOP(OP_CONST, 0, tmpsv),
6962 Perl_croak(aTHX_ "Unable to create sub named \"%s\"", SvPV(sv,n_a));
6971 Returns true if the SV has a true value by Perl's rules.
6972 Use the C<SvTRUE> macro instead, which may call C<sv_true()> or may
6973 instead use an in-line version.
6979 Perl_sv_true(pTHX_ register SV *sv)
6985 if ((tXpv = (XPV*)SvANY(sv)) &&
6986 (tXpv->xpv_cur > 1 ||
6987 (tXpv->xpv_cur && *tXpv->xpv_pv != '0')))
6994 return SvIVX(sv) != 0;
6997 return SvNVX(sv) != 0.0;
6999 return sv_2bool(sv);
7007 A private implementation of the C<SvIVx> macro for compilers which can't
7008 cope with complex macro expressions. Always use the macro instead.
7014 Perl_sv_iv(pTHX_ register SV *sv)
7018 return (IV)SvUVX(sv);
7027 A private implementation of the C<SvUVx> macro for compilers which can't
7028 cope with complex macro expressions. Always use the macro instead.
7034 Perl_sv_uv(pTHX_ register SV *sv)
7039 return (UV)SvIVX(sv);
7047 A private implementation of the C<SvNVx> macro for compilers which can't
7048 cope with complex macro expressions. Always use the macro instead.
7054 Perl_sv_nv(pTHX_ register SV *sv)
7064 Use the C<SvPV_nolen> macro instead
7068 A private implementation of the C<SvPV> macro for compilers which can't
7069 cope with complex macro expressions. Always use the macro instead.
7075 Perl_sv_pvn(pTHX_ SV *sv, STRLEN *lp)
7081 return sv_2pv(sv, lp);
7086 Perl_sv_pvn_nomg(pTHX_ register SV *sv, STRLEN *lp)
7092 return sv_2pv_flags(sv, lp, 0);
7096 =for apidoc sv_pvn_force
7098 Get a sensible string out of the SV somehow.
7099 A private implementation of the C<SvPV_force> macro for compilers which
7100 can't cope with complex macro expressions. Always use the macro instead.
7102 =for apidoc sv_pvn_force_flags
7104 Get a sensible string out of the SV somehow.
7105 If C<flags> has C<SV_GMAGIC> bit set, will C<mg_get> on C<sv> if
7106 appropriate, else not. C<sv_pvn_force> and C<sv_pvn_force_nomg> are
7107 implemented in terms of this function.
7108 You normally want to use the various wrapper macros instead: see
7109 C<SvPV_force> and C<SvPV_force_nomg>
7115 Perl_sv_pvn_force_flags(pTHX_ SV *sv, STRLEN *lp, I32 flags)
7119 if (SvTHINKFIRST(sv) && !SvROK(sv))
7120 sv_force_normal_flags(sv, 0);
7126 if (SvTYPE(sv) > SVt_PVLV && SvTYPE(sv) != SVt_PVFM) {
7127 Perl_croak(aTHX_ "Can't coerce %s to string in %s", sv_reftype(sv,0),
7131 s = sv_2pv_flags(sv, lp, flags);
7132 if (s != SvPVX(sv)) { /* Almost, but not quite, sv_setpvn() */
7137 (void)SvUPGRADE(sv, SVt_PV); /* Never FALSE */
7138 SvGROW(sv, len + 1);
7139 Move(s,SvPVX(sv),len,char);
7144 SvPOK_on(sv); /* validate pointer */
7146 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2pv(%s)\n",
7147 PTR2UV(sv),SvPVX(sv)));
7154 =for apidoc sv_pvbyte
7156 Use C<SvPVbyte_nolen> instead.
7158 =for apidoc sv_pvbyten
7160 A private implementation of the C<SvPVbyte> macro for compilers
7161 which can't cope with complex macro expressions. Always use the macro
7168 Perl_sv_pvbyten(pTHX_ SV *sv, STRLEN *lp)
7170 sv_utf8_downgrade(sv,0);
7171 return sv_pvn(sv,lp);
7175 =for apidoc sv_pvbyten_force
7177 A private implementation of the C<SvPVbytex_force> macro for compilers
7178 which can't cope with complex macro expressions. Always use the macro
7185 Perl_sv_pvbyten_force(pTHX_ SV *sv, STRLEN *lp)
7187 sv_utf8_downgrade(sv,0);
7188 return sv_pvn_force(sv,lp);
7192 =for apidoc sv_pvutf8
7194 Use the C<SvPVutf8_nolen> macro instead
7196 =for apidoc sv_pvutf8n
7198 A private implementation of the C<SvPVutf8> macro for compilers
7199 which can't cope with complex macro expressions. Always use the macro
7206 Perl_sv_pvutf8n(pTHX_ SV *sv, STRLEN *lp)
7208 sv_utf8_upgrade(sv);
7209 return sv_pvn(sv,lp);
7213 =for apidoc sv_pvutf8n_force
7215 A private implementation of the C<SvPVutf8_force> macro for compilers
7216 which can't cope with complex macro expressions. Always use the macro
7223 Perl_sv_pvutf8n_force(pTHX_ SV *sv, STRLEN *lp)
7225 sv_utf8_upgrade(sv);
7226 return sv_pvn_force(sv,lp);
7230 =for apidoc sv_reftype
7232 Returns a string describing what the SV is a reference to.
7238 Perl_sv_reftype(pTHX_ SV *sv, int ob)
7240 if (ob && SvOBJECT(sv)) {
7241 HV *svs = SvSTASH(sv);
7242 /* [20011101.072] This bandaid for C<package;> should eventually
7243 be removed. AMS 20011103 */
7244 return (svs ? HvNAME(svs) : "<none>");
7247 switch (SvTYPE(sv)) {
7263 case SVt_PVLV: return "LVALUE";
7264 case SVt_PVAV: return "ARRAY";
7265 case SVt_PVHV: return "HASH";
7266 case SVt_PVCV: return "CODE";
7267 case SVt_PVGV: return "GLOB";
7268 case SVt_PVFM: return "FORMAT";
7269 case SVt_PVIO: return "IO";
7270 default: return "UNKNOWN";
7276 =for apidoc sv_isobject
7278 Returns a boolean indicating whether the SV is an RV pointing to a blessed
7279 object. If the SV is not an RV, or if the object is not blessed, then this
7286 Perl_sv_isobject(pTHX_ SV *sv)
7303 Returns a boolean indicating whether the SV is blessed into the specified
7304 class. This does not check for subtypes; use C<sv_derived_from> to verify
7305 an inheritance relationship.
7311 Perl_sv_isa(pTHX_ SV *sv, const char *name)
7323 return strEQ(HvNAME(SvSTASH(sv)), name);
7329 Creates a new SV for the RV, C<rv>, to point to. If C<rv> is not an RV then
7330 it will be upgraded to one. If C<classname> is non-null then the new SV will
7331 be blessed in the specified package. The new SV is returned and its
7332 reference count is 1.
7338 Perl_newSVrv(pTHX_ SV *rv, const char *classname)
7344 SV_CHECK_THINKFIRST_COW_DROP(rv);
7347 if (SvTYPE(rv) >= SVt_PVMG) {
7348 U32 refcnt = SvREFCNT(rv);
7352 SvREFCNT(rv) = refcnt;
7355 if (SvTYPE(rv) < SVt_RV)
7356 sv_upgrade(rv, SVt_RV);
7357 else if (SvTYPE(rv) > SVt_RV) {
7358 (void)SvOOK_off(rv);
7359 if (SvPVX(rv) && SvLEN(rv))
7360 Safefree(SvPVX(rv));
7370 HV* stash = gv_stashpv(classname, TRUE);
7371 (void)sv_bless(rv, stash);
7377 =for apidoc sv_setref_pv
7379 Copies a pointer into a new SV, optionally blessing the SV. The C<rv>
7380 argument will be upgraded to an RV. That RV will be modified to point to
7381 the new SV. If the C<pv> argument is NULL then C<PL_sv_undef> will be placed
7382 into the SV. The C<classname> argument indicates the package for the
7383 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
7384 will be returned and will have a reference count of 1.
7386 Do not use with other Perl types such as HV, AV, SV, CV, because those
7387 objects will become corrupted by the pointer copy process.
7389 Note that C<sv_setref_pvn> copies the string while this copies the pointer.
7395 Perl_sv_setref_pv(pTHX_ SV *rv, const char *classname, void *pv)
7398 sv_setsv(rv, &PL_sv_undef);
7402 sv_setiv(newSVrv(rv,classname), PTR2IV(pv));
7407 =for apidoc sv_setref_iv
7409 Copies an integer into a new SV, optionally blessing the SV. The C<rv>
7410 argument will be upgraded to an RV. That RV will be modified to point to
7411 the new SV. The C<classname> argument indicates the package for the
7412 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
7413 will be returned and will have a reference count of 1.
7419 Perl_sv_setref_iv(pTHX_ SV *rv, const char *classname, IV iv)
7421 sv_setiv(newSVrv(rv,classname), iv);
7426 =for apidoc sv_setref_uv
7428 Copies an unsigned integer into a new SV, optionally blessing the SV. The C<rv>
7429 argument will be upgraded to an RV. That RV will be modified to point to
7430 the new SV. The C<classname> argument indicates the package for the
7431 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
7432 will be returned and will have a reference count of 1.
7438 Perl_sv_setref_uv(pTHX_ SV *rv, const char *classname, UV uv)
7440 sv_setuv(newSVrv(rv,classname), uv);
7445 =for apidoc sv_setref_nv
7447 Copies a double into a new SV, optionally blessing the SV. The C<rv>
7448 argument will be upgraded to an RV. That RV will be modified to point to
7449 the new SV. The C<classname> argument indicates the package for the
7450 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
7451 will be returned and will have a reference count of 1.
7457 Perl_sv_setref_nv(pTHX_ SV *rv, const char *classname, NV nv)
7459 sv_setnv(newSVrv(rv,classname), nv);
7464 =for apidoc sv_setref_pvn
7466 Copies a string into a new SV, optionally blessing the SV. The length of the
7467 string must be specified with C<n>. The C<rv> argument will be upgraded to
7468 an RV. That RV will be modified to point to the new SV. The C<classname>
7469 argument indicates the package for the blessing. Set C<classname> to
7470 C<Nullch> to avoid the blessing. The new SV will be returned and will have
7471 a reference count of 1.
7473 Note that C<sv_setref_pv> copies the pointer while this copies the string.
7479 Perl_sv_setref_pvn(pTHX_ SV *rv, const char *classname, char *pv, STRLEN n)
7481 sv_setpvn(newSVrv(rv,classname), pv, n);
7486 =for apidoc sv_bless
7488 Blesses an SV into a specified package. The SV must be an RV. The package
7489 must be designated by its stash (see C<gv_stashpv()>). The reference count
7490 of the SV is unaffected.
7496 Perl_sv_bless(pTHX_ SV *sv, HV *stash)
7500 Perl_croak(aTHX_ "Can't bless non-reference value");
7502 if (SvFLAGS(tmpRef) & (SVs_OBJECT|SVf_READONLY)) {
7503 if (SvREADONLY(tmpRef))
7504 Perl_croak(aTHX_ PL_no_modify);
7505 if (SvOBJECT(tmpRef)) {
7506 if (SvTYPE(tmpRef) != SVt_PVIO)
7508 SvREFCNT_dec(SvSTASH(tmpRef));
7511 SvOBJECT_on(tmpRef);
7512 if (SvTYPE(tmpRef) != SVt_PVIO)
7514 (void)SvUPGRADE(tmpRef, SVt_PVMG);
7515 SvSTASH(tmpRef) = (HV*)SvREFCNT_inc(stash);
7522 if(SvSMAGICAL(tmpRef))
7523 if(mg_find(tmpRef, PERL_MAGIC_ext) || mg_find(tmpRef, PERL_MAGIC_uvar))
7531 /* Downgrades a PVGV to a PVMG.
7535 S_sv_unglob(pTHX_ SV *sv)
7539 assert(SvTYPE(sv) == SVt_PVGV);
7544 SvREFCNT_dec(GvSTASH(sv));
7545 GvSTASH(sv) = Nullhv;
7547 sv_unmagic(sv, PERL_MAGIC_glob);
7548 Safefree(GvNAME(sv));
7551 /* need to keep SvANY(sv) in the right arena */
7552 xpvmg = new_XPVMG();
7553 StructCopy(SvANY(sv), xpvmg, XPVMG);
7554 del_XPVGV(SvANY(sv));
7557 SvFLAGS(sv) &= ~SVTYPEMASK;
7558 SvFLAGS(sv) |= SVt_PVMG;
7562 =for apidoc sv_unref_flags
7564 Unsets the RV status of the SV, and decrements the reference count of
7565 whatever was being referenced by the RV. This can almost be thought of
7566 as a reversal of C<newSVrv>. The C<cflags> argument can contain
7567 C<SV_IMMEDIATE_UNREF> to force the reference count to be decremented
7568 (otherwise the decrementing is conditional on the reference count being
7569 different from one or the reference being a readonly SV).
7576 Perl_sv_unref_flags(pTHX_ SV *sv, U32 flags)
7580 if (SvWEAKREF(sv)) {
7588 if (SvREFCNT(rv) != 1 || SvREADONLY(rv) || (flags & SV_IMMEDIATE_UNREF))
7590 else /* XXX Hack, but hard to make $a=$a->[1] work otherwise */
7591 sv_2mortal(rv); /* Schedule for freeing later */
7595 =for apidoc sv_unref
7597 Unsets the RV status of the SV, and decrements the reference count of
7598 whatever was being referenced by the RV. This can almost be thought of
7599 as a reversal of C<newSVrv>. This is C<sv_unref_flags> with the C<flag>
7600 being zero. See C<SvROK_off>.
7606 Perl_sv_unref(pTHX_ SV *sv)
7608 sv_unref_flags(sv, 0);
7612 =for apidoc sv_taint
7614 Taint an SV. Use C<SvTAINTED_on> instead.
7619 Perl_sv_taint(pTHX_ SV *sv)
7621 sv_magic((sv), Nullsv, PERL_MAGIC_taint, Nullch, 0);
7625 =for apidoc sv_untaint
7627 Untaint an SV. Use C<SvTAINTED_off> instead.
7632 Perl_sv_untaint(pTHX_ SV *sv)
7634 if (SvTYPE(sv) >= SVt_PVMG && SvMAGIC(sv)) {
7635 MAGIC *mg = mg_find(sv, PERL_MAGIC_taint);
7642 =for apidoc sv_tainted
7644 Test an SV for taintedness. Use C<SvTAINTED> instead.
7649 Perl_sv_tainted(pTHX_ SV *sv)
7651 if (SvTYPE(sv) >= SVt_PVMG && SvMAGIC(sv)) {
7652 MAGIC *mg = mg_find(sv, PERL_MAGIC_taint);
7653 if (mg && ((mg->mg_len & 1) || ((mg->mg_len & 2) && mg->mg_obj == sv)))
7659 #if defined(PERL_IMPLICIT_CONTEXT)
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_nocontext(SV *sv, const char* pat, ...)
7671 va_start(args, pat);
7672 sv_vsetpvf(sv, pat, &args);
7676 /* pTHX_ magic can't cope with varargs, so this is a no-context
7677 * version of the main function, (which may itself be aliased to us).
7678 * Don't access this version directly.
7682 Perl_sv_setpvf_mg_nocontext(SV *sv, const char* pat, ...)
7686 va_start(args, pat);
7687 sv_vsetpvf_mg(sv, pat, &args);
7693 =for apidoc sv_setpvf
7695 Processes its arguments like C<sprintf> and sets an SV to the formatted
7696 output. Does not handle 'set' magic. See C<sv_setpvf_mg>.
7702 Perl_sv_setpvf(pTHX_ SV *sv, const char* pat, ...)
7705 va_start(args, pat);
7706 sv_vsetpvf(sv, pat, &args);
7710 /* backend for C<sv_setpvf> and C<sv_setpvf_nocontext> */
7713 Perl_sv_vsetpvf(pTHX_ SV *sv, const char* pat, va_list* args)
7715 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
7719 =for apidoc sv_setpvf_mg
7721 Like C<sv_setpvf>, but also handles 'set' magic.
7727 Perl_sv_setpvf_mg(pTHX_ SV *sv, const char* pat, ...)
7730 va_start(args, pat);
7731 sv_vsetpvf_mg(sv, pat, &args);
7735 /* backend for C<sv_setpvf_mg> C<setpvf_mg_nocontext> */
7738 Perl_sv_vsetpvf_mg(pTHX_ SV *sv, const char* pat, va_list* args)
7740 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
7744 #if defined(PERL_IMPLICIT_CONTEXT)
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_nocontext(SV *sv, const char* pat, ...)
7756 va_start(args, pat);
7757 sv_vcatpvf(sv, pat, &args);
7761 /* pTHX_ magic can't cope with varargs, so this is a no-context
7762 * version of the main function, (which may itself be aliased to us).
7763 * Don't access this version directly.
7767 Perl_sv_catpvf_mg_nocontext(SV *sv, const char* pat, ...)
7771 va_start(args, pat);
7772 sv_vcatpvf_mg(sv, pat, &args);
7778 =for apidoc sv_catpvf
7780 Processes its arguments like C<sprintf> and appends the formatted
7781 output to an SV. If the appended data contains "wide" characters
7782 (including, but not limited to, SVs with a UTF-8 PV formatted with %s,
7783 and characters >255 formatted with %c), the original SV might get
7784 upgraded to UTF-8. Handles 'get' magic, but not 'set' magic.
7785 C<SvSETMAGIC()> must typically be called after calling this function
7786 to handle 'set' magic.
7791 Perl_sv_catpvf(pTHX_ SV *sv, const char* pat, ...)
7794 va_start(args, pat);
7795 sv_vcatpvf(sv, pat, &args);
7799 /* backend for C<sv_catpvf> and C<catpvf_mg_nocontext> */
7802 Perl_sv_vcatpvf(pTHX_ SV *sv, const char* pat, va_list* args)
7804 sv_vcatpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
7808 =for apidoc sv_catpvf_mg
7810 Like C<sv_catpvf>, but also handles 'set' magic.
7816 Perl_sv_catpvf_mg(pTHX_ SV *sv, const char* pat, ...)
7819 va_start(args, pat);
7820 sv_vcatpvf_mg(sv, pat, &args);
7824 /* backend for C<catpvf_mg> and C<catpvf_mg_nocontext> */
7827 Perl_sv_vcatpvf_mg(pTHX_ SV *sv, const char* pat, va_list* args)
7829 sv_vcatpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
7834 =for apidoc sv_vsetpvfn
7836 Works like C<vcatpvfn> but copies the text into the SV instead of
7839 Usually used via one of its frontends C<sv_setpvf> and C<sv_setpvf_mg>.
7845 Perl_sv_vsetpvfn(pTHX_ SV *sv, const char *pat, STRLEN patlen, va_list *args, SV **svargs, I32 svmax, bool *maybe_tainted)
7847 sv_setpvn(sv, "", 0);
7848 sv_vcatpvfn(sv, pat, patlen, args, svargs, svmax, maybe_tainted);
7851 /* private function for use in sv_vcatpvfn via the EXPECT_NUMBER macro */
7854 S_expect_number(pTHX_ char** pattern)
7857 switch (**pattern) {
7858 case '1': case '2': case '3':
7859 case '4': case '5': case '6':
7860 case '7': case '8': case '9':
7861 while (isDIGIT(**pattern))
7862 var = var * 10 + (*(*pattern)++ - '0');
7866 #define EXPECT_NUMBER(pattern, var) (var = S_expect_number(aTHX_ &pattern))
7869 =for apidoc sv_vcatpvfn
7871 Processes its arguments like C<vsprintf> and appends the formatted output
7872 to an SV. Uses an array of SVs if the C style variable argument list is
7873 missing (NULL). When running with taint checks enabled, indicates via
7874 C<maybe_tainted> if results are untrustworthy (often due to the use of
7877 Usually used via one of its frontends C<sv_catpvf> and C<sv_catpvf_mg>.
7883 Perl_sv_vcatpvfn(pTHX_ SV *sv, const char *pat, STRLEN patlen, va_list *args, SV **svargs, I32 svmax, bool *maybe_tainted)
7890 static char nullstr[] = "(null)";
7892 bool has_utf8 = FALSE; /* has the result utf8? */
7894 /* no matter what, this is a string now */
7895 (void)SvPV_force(sv, origlen);
7897 /* special-case "", "%s", and "%_" */
7900 if (patlen == 2 && pat[0] == '%') {
7904 char *s = va_arg(*args, char*);
7905 sv_catpv(sv, s ? s : nullstr);
7907 else if (svix < svmax) {
7908 sv_catsv(sv, *svargs);
7909 if (DO_UTF8(*svargs))
7915 argsv = va_arg(*args, SV*);
7916 sv_catsv(sv, argsv);
7921 /* See comment on '_' below */
7926 if (!args && svix < svmax && DO_UTF8(*svargs))
7929 patend = (char*)pat + patlen;
7930 for (p = (char*)pat; p < patend; p = q) {
7933 bool vectorize = FALSE;
7934 bool vectorarg = FALSE;
7935 bool vec_utf8 = FALSE;
7941 bool has_precis = FALSE;
7943 bool is_utf8 = FALSE; /* is this item utf8? */
7944 #ifdef HAS_LDBL_SPRINTF_BUG
7945 /* This is to try to fix a bug with irix/nonstop-ux/powerux and
7946 with sfio - Allen <easmith@beatrice.rutgers.edu> */
7947 bool fix_ldbl_sprintf_bug = FALSE;
7951 U8 utf8buf[UTF8_MAXLEN+1];
7952 STRLEN esignlen = 0;
7954 char *eptr = Nullch;
7956 /* Times 4: a decimal digit takes more than 3 binary digits.
7957 * NV_DIG: mantissa takes than many decimal digits.
7958 * Plus 32: Playing safe. */
7959 char ebuf[IV_DIG * 4 + NV_DIG + 32];
7960 /* large enough for "%#.#f" --chip */
7961 /* what about long double NVs? --jhi */
7964 U8 *vecstr = Null(U8*);
7971 /* we need a long double target in case HAS_LONG_DOUBLE but
7974 #if defined(HAS_LONG_DOUBLE) && LONG_DOUBLESIZE > DOUBLESIZE
7983 STRLEN dotstrlen = 1;
7984 I32 efix = 0; /* explicit format parameter index */
7985 I32 ewix = 0; /* explicit width index */
7986 I32 epix = 0; /* explicit precision index */
7987 I32 evix = 0; /* explicit vector index */
7988 bool asterisk = FALSE;
7990 /* echo everything up to the next format specification */
7991 for (q = p; q < patend && *q != '%'; ++q) ;
7993 sv_catpvn(sv, p, q - p);
8000 We allow format specification elements in this order:
8001 \d+\$ explicit format parameter index
8003 v|\*(\d+\$)?v vector with optional (optionally specified) arg
8004 \d+|\*(\d+\$)? width using optional (optionally specified) arg
8005 \.(\d*|\*(\d+\$)?) precision using optional (optionally specified) arg
8007 [%bcdefginopsux_DFOUX] format (mandatory)
8009 if (EXPECT_NUMBER(q, width)) {
8050 if (EXPECT_NUMBER(q, ewix))
8059 if ((vectorarg = asterisk)) {
8069 EXPECT_NUMBER(q, width);
8074 vecsv = va_arg(*args, SV*);
8076 vecsv = (evix ? evix <= svmax : svix < svmax) ?
8077 svargs[ewix ? ewix-1 : svix++] : &PL_sv_undef;
8078 dotstr = SvPVx(vecsv, dotstrlen);
8083 vecsv = va_arg(*args, SV*);
8084 vecstr = (U8*)SvPVx(vecsv,veclen);
8085 vec_utf8 = DO_UTF8(vecsv);
8087 else if (efix ? efix <= svmax : svix < svmax) {
8088 vecsv = svargs[efix ? efix-1 : svix++];
8089 vecstr = (U8*)SvPVx(vecsv,veclen);
8090 vec_utf8 = DO_UTF8(vecsv);
8100 i = va_arg(*args, int);
8102 i = (ewix ? ewix <= svmax : svix < svmax) ?
8103 SvIVx(svargs[ewix ? ewix-1 : svix++]) : 0;
8105 width = (i < 0) ? -i : i;
8115 if (EXPECT_NUMBER(q, epix) && *q++ != '$')
8117 /* XXX: todo, support specified precision parameter */
8121 i = va_arg(*args, int);
8123 i = (ewix ? ewix <= svmax : svix < svmax)
8124 ? SvIVx(svargs[ewix ? ewix-1 : svix++]) : 0;
8125 precis = (i < 0) ? 0 : i;
8130 precis = precis * 10 + (*q++ - '0');
8139 case 'I': /* Ix, I32x, and I64x */
8141 if (q[1] == '6' && q[2] == '4') {
8147 if (q[1] == '3' && q[2] == '2') {
8157 #if defined(HAS_QUAD) || defined(HAS_LONG_DOUBLE)
8168 #if defined(HAS_QUAD) || defined(HAS_LONG_DOUBLE)
8169 if (*(q + 1) == 'l') { /* lld, llf */
8194 argsv = (efix ? efix <= svmax : svix < svmax) ?
8195 svargs[efix ? efix-1 : svix++] : &PL_sv_undef;
8202 uv = (args && !vectorize) ? va_arg(*args, int) : SvIVx(argsv);
8204 (!UNI_IS_INVARIANT(uv) && SvUTF8(sv)))
8206 eptr = (char*)utf8buf;
8207 elen = uvchr_to_utf8((U8*)eptr, uv) - utf8buf;
8218 if (args && !vectorize) {
8219 eptr = va_arg(*args, char*);
8221 #ifdef MACOS_TRADITIONAL
8222 /* On MacOS, %#s format is used for Pascal strings */
8227 elen = strlen(eptr);
8230 elen = sizeof nullstr - 1;
8234 eptr = SvPVx(argsv, elen);
8235 if (DO_UTF8(argsv)) {
8236 if (has_precis && precis < elen) {
8238 sv_pos_u2b(argsv, &p, 0); /* sticks at end */
8241 if (width) { /* fudge width (can't fudge elen) */
8242 width += elen - sv_len_utf8(argsv);
8251 * The "%_" hack might have to be changed someday,
8252 * if ISO or ANSI decide to use '_' for something.
8253 * So we keep it hidden from users' code.
8255 if (!args || vectorize)
8257 argsv = va_arg(*args, SV*);
8258 eptr = SvPVx(argsv, elen);
8264 if (has_precis && elen > precis)
8271 if (alt || vectorize)
8273 uv = PTR2UV(args ? va_arg(*args, void*) : argsv);
8291 uv = utf8n_to_uvchr(vecstr, veclen, &ulen,
8300 esignbuf[esignlen++] = plus;
8304 case 'h': iv = (short)va_arg(*args, int); break;
8305 default: iv = va_arg(*args, int); break;
8306 case 'l': iv = va_arg(*args, long); break;
8307 case 'V': iv = va_arg(*args, IV); break;
8309 case 'q': iv = va_arg(*args, Quad_t); break;
8316 case 'h': iv = (short)iv; break;
8318 case 'l': iv = (long)iv; break;
8321 case 'q': iv = (Quad_t)iv; break;
8325 if ( !vectorize ) /* we already set uv above */
8330 esignbuf[esignlen++] = plus;
8334 esignbuf[esignlen++] = '-';
8377 uv = utf8n_to_uvchr(vecstr, veclen, &ulen,
8388 case 'h': uv = (unsigned short)va_arg(*args, unsigned); break;
8389 default: uv = va_arg(*args, unsigned); break;
8390 case 'l': uv = va_arg(*args, unsigned long); break;
8391 case 'V': uv = va_arg(*args, UV); break;
8393 case 'q': uv = va_arg(*args, Quad_t); break;
8400 case 'h': uv = (unsigned short)uv; break;
8402 case 'l': uv = (unsigned long)uv; break;
8405 case 'q': uv = (Quad_t)uv; break;
8411 eptr = ebuf + sizeof ebuf;
8417 p = (char*)((c == 'X')
8418 ? "0123456789ABCDEF" : "0123456789abcdef");
8424 esignbuf[esignlen++] = '0';
8425 esignbuf[esignlen++] = c; /* 'x' or 'X' */
8431 *--eptr = '0' + dig;
8433 if (alt && *eptr != '0')
8439 *--eptr = '0' + dig;
8442 esignbuf[esignlen++] = '0';
8443 esignbuf[esignlen++] = 'b';
8446 default: /* it had better be ten or less */
8447 #if defined(PERL_Y2KWARN)
8448 if (ckWARN(WARN_Y2K)) {
8450 char *s = SvPV(sv,n);
8451 if (n >= 2 && s[n-2] == '1' && s[n-1] == '9'
8452 && (n == 2 || !isDIGIT(s[n-3])))
8454 Perl_warner(aTHX_ packWARN(WARN_Y2K),
8455 "Possible Y2K bug: %%%c %s",
8456 c, "format string following '19'");
8462 *--eptr = '0' + dig;
8463 } while (uv /= base);
8466 elen = (ebuf + sizeof ebuf) - eptr;
8469 zeros = precis - elen;
8470 else if (precis == 0 && elen == 1 && *eptr == '0')
8475 /* FLOATING POINT */
8478 c = 'f'; /* maybe %F isn't supported here */
8484 /* This is evil, but floating point is even more evil */
8486 /* for SV-style calling, we can only get NV
8487 for C-style calling, we assume %f is double;
8488 for simplicity we allow any of %Lf, %llf, %qf for long double
8492 #if defined(USE_LONG_DOUBLE)
8497 #if defined(USE_LONG_DOUBLE)
8498 intsize = args ? 0 : 'q';
8502 #if defined(HAS_LONG_DOUBLE)
8513 /* now we need (long double) if intsize == 'q', else (double) */
8514 nv = (args && !vectorize) ?
8515 #if LONG_DOUBLESIZE > DOUBLESIZE
8517 va_arg(*args, long double) :
8518 va_arg(*args, double)
8520 va_arg(*args, double)
8526 if (c != 'e' && c != 'E') {
8528 /* FIXME: if HAS_LONG_DOUBLE but not USE_LONG_DOUBLE this
8529 will cast our (long double) to (double) */
8530 (void)Perl_frexp(nv, &i);
8531 if (i == PERL_INT_MIN)
8532 Perl_die(aTHX_ "panic: frexp");
8534 need = BIT_DIGITS(i);
8536 need += has_precis ? precis : 6; /* known default */
8541 #ifdef HAS_LDBL_SPRINTF_BUG
8542 /* This is to try to fix a bug with irix/nonstop-ux/powerux and
8543 with sfio - Allen <easmith@beatrice.rutgers.edu> */
8544 if ((intsize == 'q') && (c == 'f') &&
8545 #ifdef HAS_LDBL_SPRINTF_BUG_LESS1
8546 /* Only happens between -1 and 1 ??? - Allen */
8547 ((nv < 1L) && (nv > -1L)) &&
8549 (need < DBL_DIG)) { /* it's going to be short enough that
8550 long double precision is not needed */
8552 if ((nv <= 0L) && (nv >= -0L)) {
8553 fix_ldbl_sprintf_bug = TRUE; /* Easiest */
8555 /* SGI has fpclassl... but not with the same result values,
8556 and it's via a typedef, so will need to redo Configure
8557 to use. Not worth the trouble IMO. Also has fp_class_l,
8558 BTW, via fp_class.h - Allen */
8560 /* #if defined(HAS_FPCLASSL) && defined(USE_LONG_DOUBLE) */
8561 /* if (Perl_fp_class_zero((long double)nv)) { */
8562 /* fix_ldbl_sprintf_bug = TRUE; */ /* Easiest */
8563 /* } elsif (Perl_fp_class_norm((long double)nv)) { */
8565 #if !defined(DBL_MIN) || !defined(HAS_LDBL_SPRINTF_BUG_LESS1)
8567 # define MY_DBL_MAX DBL_MAX
8568 # else /* XXX guessing! HUGE_VAL may be defined as infinity, so not using */
8569 # if DOUBLESIZE >= 8
8570 # define MY_DBL_MAX 1.7976931348623157E+308L
8572 # define MY_DBL_MAX 3.40282347E+38L
8575 #endif /* !defined(DBL_MIN) || !defined(HAS_LDBL_SPRINTF_BUG_LESS1 */
8577 #ifndef HAS_LDBL_SPRINTF_BUG_LESS1
8578 if ((nv < MY_DBL_MAX) && (nv > -MY_DBL_MAX)) {
8582 # define MY_DBL_MIN DBL_MIN
8583 #else /* XXX guessing! -Allen */
8584 # if DOUBLESIZE >= 8
8585 # define MY_DBL_MIN 2.2250738585072014E-308L
8587 # define MY_DBL_MIN 1.17549435E-38L
8590 if (((nv > 0L) && (nv >= MY_DBL_MIN)
8592 && ((long double)1/MY_DBL_MAX <= nv)
8594 ) || ((nv < -0L) && (nv <= -MY_DBL_MIN)
8596 && (-(long double)1/MY_DBL_MAX >= nv)
8599 /* It's within the range that a double can represent */
8600 fix_ldbl_sprintf_bug = TRUE;
8603 #ifndef HAS_LDBL_SPRINTF_BUG_LESS1
8606 #if !defined(DBL_MIN) || !defined(HAS_LDBL_SPRINTF_BUG_LESS1)
8609 /* #if defined(HAS_FPCLASSL) && defined(USE_LONG_DOUBLE) */
8613 if (fix_ldbl_sprintf_bug == TRUE) {
8621 #endif /* HAS_LDBL_SPRINTF_BUG */
8623 need += 20; /* fudge factor */
8624 if (PL_efloatsize < need) {
8625 Safefree(PL_efloatbuf);
8626 PL_efloatsize = need + 20; /* more fudge */
8627 New(906, PL_efloatbuf, PL_efloatsize, char);
8628 PL_efloatbuf[0] = '\0';
8631 eptr = ebuf + sizeof ebuf;
8634 /* FIXME: what to do if HAS_LONG_DOUBLE but not PERL_PRIfldbl? */
8635 #if defined(HAS_LONG_DOUBLE) && defined(PERL_PRIfldbl)
8636 if (intsize == 'q') {
8637 /* Copy the one or more characters in a long double
8638 * format before the 'base' ([efgEFG]) character to
8639 * the format string. */
8640 static char const prifldbl[] = PERL_PRIfldbl;
8641 char const *p = prifldbl + sizeof(prifldbl) - 3;
8642 while (p >= prifldbl) { *--eptr = *p--; }
8647 do { *--eptr = '0' + (base % 10); } while (base /= 10);
8652 do { *--eptr = '0' + (base % 10); } while (base /= 10);
8664 /* No taint. Otherwise we are in the strange situation
8665 * where printf() taints but print($float) doesn't.
8667 #if defined(HAS_LONG_DOUBLE)
8669 (void)sprintf(PL_efloatbuf, eptr, nv);
8671 (void)sprintf(PL_efloatbuf, eptr, (double)nv);
8673 (void)sprintf(PL_efloatbuf, eptr, nv);
8675 eptr = PL_efloatbuf;
8676 elen = strlen(PL_efloatbuf);
8682 i = SvCUR(sv) - origlen;
8683 if (args && !vectorize) {
8685 case 'h': *(va_arg(*args, short*)) = i; break;
8686 default: *(va_arg(*args, int*)) = i; break;
8687 case 'l': *(va_arg(*args, long*)) = i; break;
8688 case 'V': *(va_arg(*args, IV*)) = i; break;
8690 case 'q': *(va_arg(*args, Quad_t*)) = i; break;
8695 sv_setuv_mg(argsv, (UV)i);
8697 continue; /* not "break" */
8704 if (!args && ckWARN(WARN_PRINTF) &&
8705 (PL_op->op_type == OP_PRTF || PL_op->op_type == OP_SPRINTF)) {
8706 SV *msg = sv_newmortal();
8707 Perl_sv_setpvf(aTHX_ msg, "Invalid conversion in %s: ",
8708 (PL_op->op_type == OP_PRTF) ? "printf" : "sprintf");
8711 Perl_sv_catpvf(aTHX_ msg,
8712 "\"%%%c\"", c & 0xFF);
8714 Perl_sv_catpvf(aTHX_ msg,
8715 "\"%%\\%03"UVof"\"",
8718 sv_catpv(msg, "end of string");
8719 Perl_warner(aTHX_ packWARN(WARN_PRINTF), "%"SVf, msg); /* yes, this is reentrant */
8722 /* output mangled stuff ... */
8728 /* ... right here, because formatting flags should not apply */
8729 SvGROW(sv, SvCUR(sv) + elen + 1);
8731 Copy(eptr, p, elen, char);
8734 SvCUR(sv) = p - SvPVX(sv);
8735 continue; /* not "break" */
8738 if (is_utf8 != has_utf8) {
8741 sv_utf8_upgrade(sv);
8744 SV *nsv = sv_2mortal(newSVpvn(eptr, elen));
8745 sv_utf8_upgrade(nsv);
8749 SvGROW(sv, SvCUR(sv) + elen + 1);
8754 have = esignlen + zeros + elen;
8755 need = (have > width ? have : width);
8758 SvGROW(sv, SvCUR(sv) + need + dotstrlen + 1);
8760 if (esignlen && fill == '0') {
8761 for (i = 0; i < (int)esignlen; i++)
8765 memset(p, fill, gap);
8768 if (esignlen && fill != '0') {
8769 for (i = 0; i < (int)esignlen; i++)
8773 for (i = zeros; i; i--)
8777 Copy(eptr, p, elen, char);
8781 memset(p, ' ', gap);
8786 Copy(dotstr, p, dotstrlen, char);
8790 vectorize = FALSE; /* done iterating over vecstr */
8797 SvCUR(sv) = p - SvPVX(sv);
8805 /* =========================================================================
8807 =head1 Cloning an interpreter
8809 All the macros and functions in this section are for the private use of
8810 the main function, perl_clone().
8812 The foo_dup() functions make an exact copy of an existing foo thinngy.
8813 During the course of a cloning, a hash table is used to map old addresses
8814 to new addresses. The table is created and manipulated with the
8815 ptr_table_* functions.
8819 ============================================================================*/
8822 #if defined(USE_ITHREADS)
8824 #if defined(USE_5005THREADS)
8825 # include "error: USE_5005THREADS and USE_ITHREADS are incompatible"
8828 #ifndef GpREFCNT_inc
8829 # define GpREFCNT_inc(gp) ((gp) ? (++(gp)->gp_refcnt, (gp)) : (GP*)NULL)
8833 #define sv_dup_inc(s,t) SvREFCNT_inc(sv_dup(s,t))
8834 #define av_dup(s,t) (AV*)sv_dup((SV*)s,t)
8835 #define av_dup_inc(s,t) (AV*)SvREFCNT_inc(sv_dup((SV*)s,t))
8836 #define hv_dup(s,t) (HV*)sv_dup((SV*)s,t)
8837 #define hv_dup_inc(s,t) (HV*)SvREFCNT_inc(sv_dup((SV*)s,t))
8838 #define cv_dup(s,t) (CV*)sv_dup((SV*)s,t)
8839 #define cv_dup_inc(s,t) (CV*)SvREFCNT_inc(sv_dup((SV*)s,t))
8840 #define io_dup(s,t) (IO*)sv_dup((SV*)s,t)
8841 #define io_dup_inc(s,t) (IO*)SvREFCNT_inc(sv_dup((SV*)s,t))
8842 #define gv_dup(s,t) (GV*)sv_dup((SV*)s,t)
8843 #define gv_dup_inc(s,t) (GV*)SvREFCNT_inc(sv_dup((SV*)s,t))
8844 #define SAVEPV(p) (p ? savepv(p) : Nullch)
8845 #define SAVEPVN(p,n) (p ? savepvn(p,n) : Nullch)
8848 /* Duplicate a regexp. Required reading: pregcomp() and pregfree() in
8849 regcomp.c. AMS 20010712 */
8852 Perl_re_dup(pTHX_ REGEXP *r, CLONE_PARAMS *param)
8856 struct reg_substr_datum *s;
8859 return (REGEXP *)NULL;
8861 if ((ret = (REGEXP *)ptr_table_fetch(PL_ptr_table, r)))
8864 len = r->offsets[0];
8865 npar = r->nparens+1;
8867 Newc(0, ret, sizeof(regexp) + (len+1)*sizeof(regnode), char, regexp);
8868 Copy(r->program, ret->program, len+1, regnode);
8870 New(0, ret->startp, npar, I32);
8871 Copy(r->startp, ret->startp, npar, I32);
8872 New(0, ret->endp, npar, I32);
8873 Copy(r->startp, ret->startp, npar, I32);
8875 New(0, ret->substrs, 1, struct reg_substr_data);
8876 for (s = ret->substrs->data, i = 0; i < 3; i++, s++) {
8877 s->min_offset = r->substrs->data[i].min_offset;
8878 s->max_offset = r->substrs->data[i].max_offset;
8879 s->substr = sv_dup_inc(r->substrs->data[i].substr, param);
8880 s->utf8_substr = sv_dup_inc(r->substrs->data[i].utf8_substr, param);
8883 ret->regstclass = NULL;
8886 int count = r->data->count;
8888 Newc(0, d, sizeof(struct reg_data) + count*sizeof(void *),
8889 char, struct reg_data);
8890 New(0, d->what, count, U8);
8893 for (i = 0; i < count; i++) {
8894 d->what[i] = r->data->what[i];
8895 switch (d->what[i]) {
8897 d->data[i] = sv_dup_inc((SV *)r->data->data[i], param);
8900 d->data[i] = av_dup_inc((AV *)r->data->data[i], param);
8903 /* This is cheating. */
8904 New(0, d->data[i], 1, struct regnode_charclass_class);
8905 StructCopy(r->data->data[i], d->data[i],
8906 struct regnode_charclass_class);
8907 ret->regstclass = (regnode*)d->data[i];
8910 /* Compiled op trees are readonly, and can thus be
8911 shared without duplication. */
8912 d->data[i] = (void*)OpREFCNT_inc((OP*)r->data->data[i]);
8915 d->data[i] = r->data->data[i];
8925 New(0, ret->offsets, 2*len+1, U32);
8926 Copy(r->offsets, ret->offsets, 2*len+1, U32);
8928 ret->precomp = SAVEPV(r->precomp);
8929 ret->refcnt = r->refcnt;
8930 ret->minlen = r->minlen;
8931 ret->prelen = r->prelen;
8932 ret->nparens = r->nparens;
8933 ret->lastparen = r->lastparen;
8934 ret->lastcloseparen = r->lastcloseparen;
8935 ret->reganch = r->reganch;
8937 ret->sublen = r->sublen;
8939 if (RX_MATCH_COPIED(ret))
8940 ret->subbeg = SAVEPV(r->subbeg);
8942 ret->subbeg = Nullch;
8944 ptr_table_store(PL_ptr_table, r, ret);
8948 /* duplicate a file handle */
8951 Perl_fp_dup(pTHX_ PerlIO *fp, char type, CLONE_PARAMS *param)
8955 return (PerlIO*)NULL;
8957 /* look for it in the table first */
8958 ret = (PerlIO*)ptr_table_fetch(PL_ptr_table, fp);
8962 /* create anew and remember what it is */
8963 ret = PerlIO_fdupopen(aTHX_ fp, param, PERLIO_DUP_CLONE);
8964 ptr_table_store(PL_ptr_table, fp, ret);
8968 /* duplicate a directory handle */
8971 Perl_dirp_dup(pTHX_ DIR *dp)
8979 /* duplicate a typeglob */
8982 Perl_gp_dup(pTHX_ GP *gp, CLONE_PARAMS* param)
8987 /* look for it in the table first */
8988 ret = (GP*)ptr_table_fetch(PL_ptr_table, gp);
8992 /* create anew and remember what it is */
8993 Newz(0, ret, 1, GP);
8994 ptr_table_store(PL_ptr_table, gp, ret);
8997 ret->gp_refcnt = 0; /* must be before any other dups! */
8998 ret->gp_sv = sv_dup_inc(gp->gp_sv, param);
8999 ret->gp_io = io_dup_inc(gp->gp_io, param);
9000 ret->gp_form = cv_dup_inc(gp->gp_form, param);
9001 ret->gp_av = av_dup_inc(gp->gp_av, param);
9002 ret->gp_hv = hv_dup_inc(gp->gp_hv, param);
9003 ret->gp_egv = gv_dup(gp->gp_egv, param);/* GvEGV is not refcounted */
9004 ret->gp_cv = cv_dup_inc(gp->gp_cv, param);
9005 ret->gp_cvgen = gp->gp_cvgen;
9006 ret->gp_flags = gp->gp_flags;
9007 ret->gp_line = gp->gp_line;
9008 ret->gp_file = gp->gp_file; /* points to COP.cop_file */
9012 /* duplicate a chain of magic */
9015 Perl_mg_dup(pTHX_ MAGIC *mg, CLONE_PARAMS* param)
9017 MAGIC *mgprev = (MAGIC*)NULL;
9020 return (MAGIC*)NULL;
9021 /* look for it in the table first */
9022 mgret = (MAGIC*)ptr_table_fetch(PL_ptr_table, mg);
9026 for (; mg; mg = mg->mg_moremagic) {
9028 Newz(0, nmg, 1, MAGIC);
9030 mgprev->mg_moremagic = nmg;
9033 nmg->mg_virtual = mg->mg_virtual; /* XXX copy dynamic vtable? */
9034 nmg->mg_private = mg->mg_private;
9035 nmg->mg_type = mg->mg_type;
9036 nmg->mg_flags = mg->mg_flags;
9037 if (mg->mg_type == PERL_MAGIC_qr) {
9038 nmg->mg_obj = (SV*)re_dup((REGEXP*)mg->mg_obj, param);
9040 else if(mg->mg_type == PERL_MAGIC_backref) {
9041 AV *av = (AV*) mg->mg_obj;
9044 nmg->mg_obj = (SV*)newAV();
9048 av_push((AV*)nmg->mg_obj,sv_dup(svp[i],param));
9053 nmg->mg_obj = (mg->mg_flags & MGf_REFCOUNTED)
9054 ? sv_dup_inc(mg->mg_obj, param)
9055 : sv_dup(mg->mg_obj, param);
9057 nmg->mg_len = mg->mg_len;
9058 nmg->mg_ptr = mg->mg_ptr; /* XXX random ptr? */
9059 if (mg->mg_ptr && mg->mg_type != PERL_MAGIC_regex_global) {
9060 if (mg->mg_len > 0) {
9061 nmg->mg_ptr = SAVEPVN(mg->mg_ptr, mg->mg_len);
9062 if (mg->mg_type == PERL_MAGIC_overload_table &&
9063 AMT_AMAGIC((AMT*)mg->mg_ptr))
9065 AMT *amtp = (AMT*)mg->mg_ptr;
9066 AMT *namtp = (AMT*)nmg->mg_ptr;
9068 for (i = 1; i < NofAMmeth; i++) {
9069 namtp->table[i] = cv_dup_inc(amtp->table[i], param);
9073 else if (mg->mg_len == HEf_SVKEY)
9074 nmg->mg_ptr = (char*)sv_dup_inc((SV*)mg->mg_ptr, param);
9076 if ((mg->mg_flags & MGf_DUP) && mg->mg_virtual && mg->mg_virtual->svt_dup) {
9077 CALL_FPTR(nmg->mg_virtual->svt_dup)(aTHX_ nmg, param);
9084 /* create a new pointer-mapping table */
9087 Perl_ptr_table_new(pTHX)
9090 Newz(0, tbl, 1, PTR_TBL_t);
9093 Newz(0, tbl->tbl_ary, tbl->tbl_max + 1, PTR_TBL_ENT_t*);
9097 /* map an existing pointer using a table */
9100 Perl_ptr_table_fetch(pTHX_ PTR_TBL_t *tbl, void *sv)
9102 PTR_TBL_ENT_t *tblent;
9103 UV hash = PTR2UV(sv);
9105 tblent = tbl->tbl_ary[hash & tbl->tbl_max];
9106 for (; tblent; tblent = tblent->next) {
9107 if (tblent->oldval == sv)
9108 return tblent->newval;
9113 /* add a new entry to a pointer-mapping table */
9116 Perl_ptr_table_store(pTHX_ PTR_TBL_t *tbl, void *oldv, void *newv)
9118 PTR_TBL_ENT_t *tblent, **otblent;
9119 /* XXX this may be pessimal on platforms where pointers aren't good
9120 * hash values e.g. if they grow faster in the most significant
9122 UV hash = PTR2UV(oldv);
9126 otblent = &tbl->tbl_ary[hash & tbl->tbl_max];
9127 for (tblent = *otblent; tblent; i=0, tblent = tblent->next) {
9128 if (tblent->oldval == oldv) {
9129 tblent->newval = newv;
9133 Newz(0, tblent, 1, PTR_TBL_ENT_t);
9134 tblent->oldval = oldv;
9135 tblent->newval = newv;
9136 tblent->next = *otblent;
9139 if (i && tbl->tbl_items > tbl->tbl_max)
9140 ptr_table_split(tbl);
9143 /* double the hash bucket size of an existing ptr table */
9146 Perl_ptr_table_split(pTHX_ PTR_TBL_t *tbl)
9148 PTR_TBL_ENT_t **ary = tbl->tbl_ary;
9149 UV oldsize = tbl->tbl_max + 1;
9150 UV newsize = oldsize * 2;
9153 Renew(ary, newsize, PTR_TBL_ENT_t*);
9154 Zero(&ary[oldsize], newsize-oldsize, PTR_TBL_ENT_t*);
9155 tbl->tbl_max = --newsize;
9157 for (i=0; i < oldsize; i++, ary++) {
9158 PTR_TBL_ENT_t **curentp, **entp, *ent;
9161 curentp = ary + oldsize;
9162 for (entp = ary, ent = *ary; ent; ent = *entp) {
9163 if ((newsize & PTR2UV(ent->oldval)) != i) {
9165 ent->next = *curentp;
9175 /* remove all the entries from a ptr table */
9178 Perl_ptr_table_clear(pTHX_ PTR_TBL_t *tbl)
9180 register PTR_TBL_ENT_t **array;
9181 register PTR_TBL_ENT_t *entry;
9182 register PTR_TBL_ENT_t *oentry = Null(PTR_TBL_ENT_t*);
9186 if (!tbl || !tbl->tbl_items) {
9190 array = tbl->tbl_ary;
9197 entry = entry->next;
9201 if (++riter > max) {
9204 entry = array[riter];
9211 /* clear and free a ptr table */
9214 Perl_ptr_table_free(pTHX_ PTR_TBL_t *tbl)
9219 ptr_table_clear(tbl);
9220 Safefree(tbl->tbl_ary);
9228 /* attempt to make everything in the typeglob readonly */
9231 S_gv_share(pTHX_ SV *sstr, CLONE_PARAMS *param)
9234 SV *sv = ¶m->proto_perl->Isv_no; /* just need SvREADONLY-ness */
9236 if (GvIO(gv) || GvFORM(gv)) {
9237 GvUNIQUE_off(gv); /* GvIOs cannot be shared. nor can GvFORMs */
9239 else if (!GvCV(gv)) {
9243 /* CvPADLISTs cannot be shared */
9244 if (!SvREADONLY(GvCV(gv)) && !CvXSUB(GvCV(gv))) {
9249 if (!GvUNIQUE(gv)) {
9251 PerlIO_printf(Perl_debug_log, "gv_share: unable to share %s::%s\n",
9252 HvNAME(GvSTASH(gv)), GvNAME(gv));
9258 * write attempts will die with
9259 * "Modification of a read-only value attempted"
9265 SvREADONLY_on(GvSV(gv));
9272 SvREADONLY_on(GvAV(gv));
9279 SvREADONLY_on(GvAV(gv));
9282 return sstr; /* he_dup() will SvREFCNT_inc() */
9285 /* duplicate an SV of any type (including AV, HV etc) */
9288 Perl_rvpv_dup(pTHX_ SV *dstr, SV *sstr, CLONE_PARAMS* param)
9291 SvRV(dstr) = SvWEAKREF(sstr)
9292 ? sv_dup(SvRV(sstr), param)
9293 : sv_dup_inc(SvRV(sstr), param);
9295 else if (SvPVX(sstr)) {
9296 /* Has something there */
9298 /* Normal PV - clone whole allocated space */
9299 SvPVX(dstr) = SAVEPVN(SvPVX(sstr), SvLEN(sstr)-1);
9300 if (SvREADONLY(sstr) && SvFAKE(sstr)) {
9301 /* Not that normal - actually sstr is copy on write.
9302 But we are a true, independant SV, so: */
9303 SvREADONLY_off(dstr);
9308 /* Special case - not normally malloced for some reason */
9309 if (SvREADONLY(sstr) && SvFAKE(sstr)) {
9310 /* A "shared" PV - clone it as unshared string */
9312 SvREADONLY_off(dstr);
9313 SvPVX(dstr) = SAVEPVN(SvPVX(sstr), SvCUR(sstr));
9316 /* Some other special case - random pointer */
9317 SvPVX(dstr) = SvPVX(sstr);
9323 SvPVX(dstr) = SvPVX(sstr);
9328 Perl_sv_dup(pTHX_ SV *sstr, CLONE_PARAMS* param)
9332 if (!sstr || SvTYPE(sstr) == SVTYPEMASK)
9334 /* look for it in the table first */
9335 dstr = (SV*)ptr_table_fetch(PL_ptr_table, sstr);
9339 /* create anew and remember what it is */
9341 ptr_table_store(PL_ptr_table, sstr, dstr);
9344 SvFLAGS(dstr) = SvFLAGS(sstr);
9345 SvFLAGS(dstr) &= ~SVf_OOK; /* don't propagate OOK hack */
9346 SvREFCNT(dstr) = 0; /* must be before any other dups! */
9349 if (SvANY(sstr) && PL_watch_pvx && SvPVX(sstr) == PL_watch_pvx)
9350 PerlIO_printf(Perl_debug_log, "watch at %p hit, found string \"%s\"\n",
9351 PL_watch_pvx, SvPVX(sstr));
9354 switch (SvTYPE(sstr)) {
9359 SvANY(dstr) = new_XIV();
9360 SvIVX(dstr) = SvIVX(sstr);
9363 SvANY(dstr) = new_XNV();
9364 SvNVX(dstr) = SvNVX(sstr);
9367 SvANY(dstr) = new_XRV();
9368 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
9371 SvANY(dstr) = new_XPV();
9372 SvCUR(dstr) = SvCUR(sstr);
9373 SvLEN(dstr) = SvLEN(sstr);
9374 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
9377 SvANY(dstr) = new_XPVIV();
9378 SvCUR(dstr) = SvCUR(sstr);
9379 SvLEN(dstr) = SvLEN(sstr);
9380 SvIVX(dstr) = SvIVX(sstr);
9381 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
9384 SvANY(dstr) = new_XPVNV();
9385 SvCUR(dstr) = SvCUR(sstr);
9386 SvLEN(dstr) = SvLEN(sstr);
9387 SvIVX(dstr) = SvIVX(sstr);
9388 SvNVX(dstr) = SvNVX(sstr);
9389 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
9392 SvANY(dstr) = new_XPVMG();
9393 SvCUR(dstr) = SvCUR(sstr);
9394 SvLEN(dstr) = SvLEN(sstr);
9395 SvIVX(dstr) = SvIVX(sstr);
9396 SvNVX(dstr) = SvNVX(sstr);
9397 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr), param);
9398 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr), param);
9399 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
9402 SvANY(dstr) = new_XPVBM();
9403 SvCUR(dstr) = SvCUR(sstr);
9404 SvLEN(dstr) = SvLEN(sstr);
9405 SvIVX(dstr) = SvIVX(sstr);
9406 SvNVX(dstr) = SvNVX(sstr);
9407 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr), param);
9408 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr), param);
9409 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
9410 BmRARE(dstr) = BmRARE(sstr);
9411 BmUSEFUL(dstr) = BmUSEFUL(sstr);
9412 BmPREVIOUS(dstr)= BmPREVIOUS(sstr);
9415 SvANY(dstr) = new_XPVLV();
9416 SvCUR(dstr) = SvCUR(sstr);
9417 SvLEN(dstr) = SvLEN(sstr);
9418 SvIVX(dstr) = SvIVX(sstr);
9419 SvNVX(dstr) = SvNVX(sstr);
9420 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr), param);
9421 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr), param);
9422 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
9423 LvTARGOFF(dstr) = LvTARGOFF(sstr); /* XXX sometimes holds PMOP* when DEBUGGING */
9424 LvTARGLEN(dstr) = LvTARGLEN(sstr);
9425 LvTARG(dstr) = sv_dup_inc(LvTARG(sstr), param);
9426 LvTYPE(dstr) = LvTYPE(sstr);
9429 if (GvUNIQUE((GV*)sstr)) {
9431 if ((share = gv_share(sstr, param))) {
9434 ptr_table_store(PL_ptr_table, sstr, dstr);
9436 PerlIO_printf(Perl_debug_log, "sv_dup: sharing %s::%s\n",
9437 HvNAME(GvSTASH(share)), GvNAME(share));
9442 SvANY(dstr) = new_XPVGV();
9443 SvCUR(dstr) = SvCUR(sstr);
9444 SvLEN(dstr) = SvLEN(sstr);
9445 SvIVX(dstr) = SvIVX(sstr);
9446 SvNVX(dstr) = SvNVX(sstr);
9447 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr), param);
9448 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr), param);
9449 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
9450 GvNAMELEN(dstr) = GvNAMELEN(sstr);
9451 GvNAME(dstr) = SAVEPVN(GvNAME(sstr), GvNAMELEN(sstr));
9452 GvSTASH(dstr) = hv_dup_inc(GvSTASH(sstr), param);
9453 GvFLAGS(dstr) = GvFLAGS(sstr);
9454 GvGP(dstr) = gp_dup(GvGP(sstr), param);
9455 (void)GpREFCNT_inc(GvGP(dstr));
9458 SvANY(dstr) = new_XPVIO();
9459 SvCUR(dstr) = SvCUR(sstr);
9460 SvLEN(dstr) = SvLEN(sstr);
9461 SvIVX(dstr) = SvIVX(sstr);
9462 SvNVX(dstr) = SvNVX(sstr);
9463 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr), param);
9464 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr), param);
9465 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
9466 IoIFP(dstr) = fp_dup(IoIFP(sstr), IoTYPE(sstr), param);
9467 if (IoOFP(sstr) == IoIFP(sstr))
9468 IoOFP(dstr) = IoIFP(dstr);
9470 IoOFP(dstr) = fp_dup(IoOFP(sstr), IoTYPE(sstr), param);
9471 /* PL_rsfp_filters entries have fake IoDIRP() */
9472 if (IoDIRP(sstr) && !(IoFLAGS(sstr) & IOf_FAKE_DIRP))
9473 IoDIRP(dstr) = dirp_dup(IoDIRP(sstr));
9475 IoDIRP(dstr) = IoDIRP(sstr);
9476 IoLINES(dstr) = IoLINES(sstr);
9477 IoPAGE(dstr) = IoPAGE(sstr);
9478 IoPAGE_LEN(dstr) = IoPAGE_LEN(sstr);
9479 IoLINES_LEFT(dstr) = IoLINES_LEFT(sstr);
9480 IoTOP_NAME(dstr) = SAVEPV(IoTOP_NAME(sstr));
9481 IoTOP_GV(dstr) = gv_dup(IoTOP_GV(sstr), param);
9482 IoFMT_NAME(dstr) = SAVEPV(IoFMT_NAME(sstr));
9483 IoFMT_GV(dstr) = gv_dup(IoFMT_GV(sstr), param);
9484 IoBOTTOM_NAME(dstr) = SAVEPV(IoBOTTOM_NAME(sstr));
9485 IoBOTTOM_GV(dstr) = gv_dup(IoBOTTOM_GV(sstr), param);
9486 IoSUBPROCESS(dstr) = IoSUBPROCESS(sstr);
9487 IoTYPE(dstr) = IoTYPE(sstr);
9488 IoFLAGS(dstr) = IoFLAGS(sstr);
9491 SvANY(dstr) = new_XPVAV();
9492 SvCUR(dstr) = SvCUR(sstr);
9493 SvLEN(dstr) = SvLEN(sstr);
9494 SvIVX(dstr) = SvIVX(sstr);
9495 SvNVX(dstr) = SvNVX(sstr);
9496 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr), param);
9497 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr), param);
9498 AvARYLEN((AV*)dstr) = sv_dup_inc(AvARYLEN((AV*)sstr), param);
9499 AvFLAGS((AV*)dstr) = AvFLAGS((AV*)sstr);
9500 if (AvARRAY((AV*)sstr)) {
9501 SV **dst_ary, **src_ary;
9502 SSize_t items = AvFILLp((AV*)sstr) + 1;
9504 src_ary = AvARRAY((AV*)sstr);
9505 Newz(0, dst_ary, AvMAX((AV*)sstr)+1, SV*);
9506 ptr_table_store(PL_ptr_table, src_ary, dst_ary);
9507 SvPVX(dstr) = (char*)dst_ary;
9508 AvALLOC((AV*)dstr) = dst_ary;
9509 if (AvREAL((AV*)sstr)) {
9511 *dst_ary++ = sv_dup_inc(*src_ary++, param);
9515 *dst_ary++ = sv_dup(*src_ary++, param);
9517 items = AvMAX((AV*)sstr) - AvFILLp((AV*)sstr);
9518 while (items-- > 0) {
9519 *dst_ary++ = &PL_sv_undef;
9523 SvPVX(dstr) = Nullch;
9524 AvALLOC((AV*)dstr) = (SV**)NULL;
9528 SvANY(dstr) = new_XPVHV();
9529 SvCUR(dstr) = SvCUR(sstr);
9530 SvLEN(dstr) = SvLEN(sstr);
9531 SvIVX(dstr) = SvIVX(sstr);
9532 SvNVX(dstr) = SvNVX(sstr);
9533 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr), param);
9534 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr), param);
9535 HvRITER((HV*)dstr) = HvRITER((HV*)sstr);
9536 if (HvARRAY((HV*)sstr)) {
9538 XPVHV *dxhv = (XPVHV*)SvANY(dstr);
9539 XPVHV *sxhv = (XPVHV*)SvANY(sstr);
9540 Newz(0, dxhv->xhv_array,
9541 PERL_HV_ARRAY_ALLOC_BYTES(dxhv->xhv_max+1), char);
9542 while (i <= sxhv->xhv_max) {
9543 ((HE**)dxhv->xhv_array)[i] = he_dup(((HE**)sxhv->xhv_array)[i],
9544 (bool)!!HvSHAREKEYS(sstr),
9548 dxhv->xhv_eiter = he_dup(sxhv->xhv_eiter,
9549 (bool)!!HvSHAREKEYS(sstr), param);
9552 SvPVX(dstr) = Nullch;
9553 HvEITER((HV*)dstr) = (HE*)NULL;
9555 HvPMROOT((HV*)dstr) = HvPMROOT((HV*)sstr); /* XXX */
9556 HvNAME((HV*)dstr) = SAVEPV(HvNAME((HV*)sstr));
9557 /* Record stashes for possible cloning in Perl_clone(). */
9558 if(HvNAME((HV*)dstr))
9559 av_push(param->stashes, dstr);
9562 SvANY(dstr) = new_XPVFM();
9563 FmLINES(dstr) = FmLINES(sstr);
9567 SvANY(dstr) = new_XPVCV();
9569 SvCUR(dstr) = SvCUR(sstr);
9570 SvLEN(dstr) = SvLEN(sstr);
9571 SvIVX(dstr) = SvIVX(sstr);
9572 SvNVX(dstr) = SvNVX(sstr);
9573 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr), param);
9574 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr), param);
9575 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
9576 CvSTASH(dstr) = hv_dup(CvSTASH(sstr), param); /* NOTE: not refcounted */
9577 CvSTART(dstr) = CvSTART(sstr);
9578 CvROOT(dstr) = OpREFCNT_inc(CvROOT(sstr));
9579 CvXSUB(dstr) = CvXSUB(sstr);
9580 CvXSUBANY(dstr) = CvXSUBANY(sstr);
9581 if (CvCONST(sstr)) {
9582 CvXSUBANY(dstr).any_ptr = GvUNIQUE(CvGV(sstr)) ?
9583 SvREFCNT_inc(CvXSUBANY(sstr).any_ptr) :
9584 sv_dup_inc(CvXSUBANY(sstr).any_ptr, param);
9586 CvGV(dstr) = gv_dup(CvGV(sstr), param);
9587 if (param->flags & CLONEf_COPY_STACKS) {
9588 CvDEPTH(dstr) = CvDEPTH(sstr);
9592 if (CvPADLIST(sstr) && !AvREAL(CvPADLIST(sstr))) {
9593 /* XXX padlists are real, but pretend to be not */
9594 AvREAL_on(CvPADLIST(sstr));
9595 CvPADLIST(dstr) = av_dup_inc(CvPADLIST(sstr), param);
9596 AvREAL_off(CvPADLIST(sstr));
9597 AvREAL_off(CvPADLIST(dstr));
9600 CvPADLIST(dstr) = av_dup_inc(CvPADLIST(sstr), param);
9601 if (!CvANON(sstr) || CvCLONED(sstr))
9602 CvOUTSIDE(dstr) = cv_dup_inc(CvOUTSIDE(sstr), param);
9604 CvOUTSIDE(dstr) = cv_dup(CvOUTSIDE(sstr), param);
9605 CvFLAGS(dstr) = CvFLAGS(sstr);
9606 CvFILE(dstr) = CvXSUB(sstr) ? CvFILE(sstr) : SAVEPV(CvFILE(sstr));
9609 Perl_croak(aTHX_ "Bizarre SvTYPE [%" IVdf "]", (IV)SvTYPE(sstr));
9613 if (SvOBJECT(dstr) && SvTYPE(dstr) != SVt_PVIO)
9619 /* duplicate a context */
9622 Perl_cx_dup(pTHX_ PERL_CONTEXT *cxs, I32 ix, I32 max, CLONE_PARAMS* param)
9627 return (PERL_CONTEXT*)NULL;
9629 /* look for it in the table first */
9630 ncxs = (PERL_CONTEXT*)ptr_table_fetch(PL_ptr_table, cxs);
9634 /* create anew and remember what it is */
9635 Newz(56, ncxs, max + 1, PERL_CONTEXT);
9636 ptr_table_store(PL_ptr_table, cxs, ncxs);
9639 PERL_CONTEXT *cx = &cxs[ix];
9640 PERL_CONTEXT *ncx = &ncxs[ix];
9641 ncx->cx_type = cx->cx_type;
9642 if (CxTYPE(cx) == CXt_SUBST) {
9643 Perl_croak(aTHX_ "Cloning substitution context is unimplemented");
9646 ncx->blk_oldsp = cx->blk_oldsp;
9647 ncx->blk_oldcop = cx->blk_oldcop;
9648 ncx->blk_oldretsp = cx->blk_oldretsp;
9649 ncx->blk_oldmarksp = cx->blk_oldmarksp;
9650 ncx->blk_oldscopesp = cx->blk_oldscopesp;
9651 ncx->blk_oldpm = cx->blk_oldpm;
9652 ncx->blk_gimme = cx->blk_gimme;
9653 switch (CxTYPE(cx)) {
9655 ncx->blk_sub.cv = (cx->blk_sub.olddepth == 0
9656 ? cv_dup_inc(cx->blk_sub.cv, param)
9657 : cv_dup(cx->blk_sub.cv,param));
9658 ncx->blk_sub.argarray = (cx->blk_sub.hasargs
9659 ? av_dup_inc(cx->blk_sub.argarray, param)
9661 ncx->blk_sub.savearray = av_dup_inc(cx->blk_sub.savearray, param);
9662 ncx->blk_sub.olddepth = cx->blk_sub.olddepth;
9663 ncx->blk_sub.hasargs = cx->blk_sub.hasargs;
9664 ncx->blk_sub.lval = cx->blk_sub.lval;
9667 ncx->blk_eval.old_in_eval = cx->blk_eval.old_in_eval;
9668 ncx->blk_eval.old_op_type = cx->blk_eval.old_op_type;
9669 ncx->blk_eval.old_namesv = sv_dup_inc(cx->blk_eval.old_namesv, param);
9670 ncx->blk_eval.old_eval_root = cx->blk_eval.old_eval_root;
9671 ncx->blk_eval.cur_text = sv_dup(cx->blk_eval.cur_text, param);
9674 ncx->blk_loop.label = cx->blk_loop.label;
9675 ncx->blk_loop.resetsp = cx->blk_loop.resetsp;
9676 ncx->blk_loop.redo_op = cx->blk_loop.redo_op;
9677 ncx->blk_loop.next_op = cx->blk_loop.next_op;
9678 ncx->blk_loop.last_op = cx->blk_loop.last_op;
9679 ncx->blk_loop.iterdata = (CxPADLOOP(cx)
9680 ? cx->blk_loop.iterdata
9681 : gv_dup((GV*)cx->blk_loop.iterdata, param));
9682 ncx->blk_loop.oldcurpad
9683 = (SV**)ptr_table_fetch(PL_ptr_table,
9684 cx->blk_loop.oldcurpad);
9685 ncx->blk_loop.itersave = sv_dup_inc(cx->blk_loop.itersave, param);
9686 ncx->blk_loop.iterlval = sv_dup_inc(cx->blk_loop.iterlval, param);
9687 ncx->blk_loop.iterary = av_dup_inc(cx->blk_loop.iterary, param);
9688 ncx->blk_loop.iterix = cx->blk_loop.iterix;
9689 ncx->blk_loop.itermax = cx->blk_loop.itermax;
9692 ncx->blk_sub.cv = cv_dup(cx->blk_sub.cv, param);
9693 ncx->blk_sub.gv = gv_dup(cx->blk_sub.gv, param);
9694 ncx->blk_sub.dfoutgv = gv_dup_inc(cx->blk_sub.dfoutgv, param);
9695 ncx->blk_sub.hasargs = cx->blk_sub.hasargs;
9707 /* duplicate a stack info structure */
9710 Perl_si_dup(pTHX_ PERL_SI *si, CLONE_PARAMS* param)
9715 return (PERL_SI*)NULL;
9717 /* look for it in the table first */
9718 nsi = (PERL_SI*)ptr_table_fetch(PL_ptr_table, si);
9722 /* create anew and remember what it is */
9723 Newz(56, nsi, 1, PERL_SI);
9724 ptr_table_store(PL_ptr_table, si, nsi);
9726 nsi->si_stack = av_dup_inc(si->si_stack, param);
9727 nsi->si_cxix = si->si_cxix;
9728 nsi->si_cxmax = si->si_cxmax;
9729 nsi->si_cxstack = cx_dup(si->si_cxstack, si->si_cxix, si->si_cxmax, param);
9730 nsi->si_type = si->si_type;
9731 nsi->si_prev = si_dup(si->si_prev, param);
9732 nsi->si_next = si_dup(si->si_next, param);
9733 nsi->si_markoff = si->si_markoff;
9738 #define POPINT(ss,ix) ((ss)[--(ix)].any_i32)
9739 #define TOPINT(ss,ix) ((ss)[ix].any_i32)
9740 #define POPLONG(ss,ix) ((ss)[--(ix)].any_long)
9741 #define TOPLONG(ss,ix) ((ss)[ix].any_long)
9742 #define POPIV(ss,ix) ((ss)[--(ix)].any_iv)
9743 #define TOPIV(ss,ix) ((ss)[ix].any_iv)
9744 #define POPPTR(ss,ix) ((ss)[--(ix)].any_ptr)
9745 #define TOPPTR(ss,ix) ((ss)[ix].any_ptr)
9746 #define POPDPTR(ss,ix) ((ss)[--(ix)].any_dptr)
9747 #define TOPDPTR(ss,ix) ((ss)[ix].any_dptr)
9748 #define POPDXPTR(ss,ix) ((ss)[--(ix)].any_dxptr)
9749 #define TOPDXPTR(ss,ix) ((ss)[ix].any_dxptr)
9752 #define pv_dup_inc(p) SAVEPV(p)
9753 #define pv_dup(p) SAVEPV(p)
9754 #define svp_dup_inc(p,pp) any_dup(p,pp)
9756 /* map any object to the new equivent - either something in the
9757 * ptr table, or something in the interpreter structure
9761 Perl_any_dup(pTHX_ void *v, PerlInterpreter *proto_perl)
9768 /* look for it in the table first */
9769 ret = ptr_table_fetch(PL_ptr_table, v);
9773 /* see if it is part of the interpreter structure */
9774 if (v >= (void*)proto_perl && v < (void*)(proto_perl+1))
9775 ret = (void*)(((char*)aTHX) + (((char*)v) - (char*)proto_perl));
9783 /* duplicate the save stack */
9786 Perl_ss_dup(pTHX_ PerlInterpreter *proto_perl, CLONE_PARAMS* param)
9788 ANY *ss = proto_perl->Tsavestack;
9789 I32 ix = proto_perl->Tsavestack_ix;
9790 I32 max = proto_perl->Tsavestack_max;
9803 void (*dptr) (void*);
9804 void (*dxptr) (pTHX_ void*);
9807 Newz(54, nss, max, ANY);
9813 case SAVEt_ITEM: /* normal string */
9814 sv = (SV*)POPPTR(ss,ix);
9815 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
9816 sv = (SV*)POPPTR(ss,ix);
9817 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
9819 case SAVEt_SV: /* scalar reference */
9820 sv = (SV*)POPPTR(ss,ix);
9821 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
9822 gv = (GV*)POPPTR(ss,ix);
9823 TOPPTR(nss,ix) = gv_dup_inc(gv, param);
9825 case SAVEt_GENERIC_PVREF: /* generic char* */
9826 c = (char*)POPPTR(ss,ix);
9827 TOPPTR(nss,ix) = pv_dup(c);
9828 ptr = POPPTR(ss,ix);
9829 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
9831 case SAVEt_SHARED_PVREF: /* char* in shared space */
9832 c = (char*)POPPTR(ss,ix);
9833 TOPPTR(nss,ix) = savesharedpv(c);
9834 ptr = POPPTR(ss,ix);
9835 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
9837 case SAVEt_GENERIC_SVREF: /* generic sv */
9838 case SAVEt_SVREF: /* scalar reference */
9839 sv = (SV*)POPPTR(ss,ix);
9840 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
9841 ptr = POPPTR(ss,ix);
9842 TOPPTR(nss,ix) = svp_dup_inc((SV**)ptr, proto_perl);/* XXXXX */
9844 case SAVEt_AV: /* array reference */
9845 av = (AV*)POPPTR(ss,ix);
9846 TOPPTR(nss,ix) = av_dup_inc(av, param);
9847 gv = (GV*)POPPTR(ss,ix);
9848 TOPPTR(nss,ix) = gv_dup(gv, param);
9850 case SAVEt_HV: /* hash reference */
9851 hv = (HV*)POPPTR(ss,ix);
9852 TOPPTR(nss,ix) = hv_dup_inc(hv, param);
9853 gv = (GV*)POPPTR(ss,ix);
9854 TOPPTR(nss,ix) = gv_dup(gv, param);
9856 case SAVEt_INT: /* int reference */
9857 ptr = POPPTR(ss,ix);
9858 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
9859 intval = (int)POPINT(ss,ix);
9860 TOPINT(nss,ix) = intval;
9862 case SAVEt_LONG: /* long reference */
9863 ptr = POPPTR(ss,ix);
9864 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
9865 longval = (long)POPLONG(ss,ix);
9866 TOPLONG(nss,ix) = longval;
9868 case SAVEt_I32: /* I32 reference */
9869 case SAVEt_I16: /* I16 reference */
9870 case SAVEt_I8: /* I8 reference */
9871 ptr = POPPTR(ss,ix);
9872 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
9876 case SAVEt_IV: /* IV reference */
9877 ptr = POPPTR(ss,ix);
9878 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
9882 case SAVEt_SPTR: /* SV* reference */
9883 ptr = POPPTR(ss,ix);
9884 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
9885 sv = (SV*)POPPTR(ss,ix);
9886 TOPPTR(nss,ix) = sv_dup(sv, param);
9888 case SAVEt_VPTR: /* random* reference */
9889 ptr = POPPTR(ss,ix);
9890 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
9891 ptr = POPPTR(ss,ix);
9892 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
9894 case SAVEt_PPTR: /* char* reference */
9895 ptr = POPPTR(ss,ix);
9896 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
9897 c = (char*)POPPTR(ss,ix);
9898 TOPPTR(nss,ix) = pv_dup(c);
9900 case SAVEt_HPTR: /* HV* reference */
9901 ptr = POPPTR(ss,ix);
9902 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
9903 hv = (HV*)POPPTR(ss,ix);
9904 TOPPTR(nss,ix) = hv_dup(hv, param);
9906 case SAVEt_APTR: /* AV* reference */
9907 ptr = POPPTR(ss,ix);
9908 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
9909 av = (AV*)POPPTR(ss,ix);
9910 TOPPTR(nss,ix) = av_dup(av, param);
9913 gv = (GV*)POPPTR(ss,ix);
9914 TOPPTR(nss,ix) = gv_dup(gv, param);
9916 case SAVEt_GP: /* scalar reference */
9917 gp = (GP*)POPPTR(ss,ix);
9918 TOPPTR(nss,ix) = gp = gp_dup(gp, param);
9919 (void)GpREFCNT_inc(gp);
9920 gv = (GV*)POPPTR(ss,ix);
9921 TOPPTR(nss,ix) = gv_dup_inc(gv, param);
9922 c = (char*)POPPTR(ss,ix);
9923 TOPPTR(nss,ix) = pv_dup(c);
9930 case SAVEt_MORTALIZESV:
9931 sv = (SV*)POPPTR(ss,ix);
9932 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
9935 ptr = POPPTR(ss,ix);
9936 if (ptr && (((OP*)ptr)->op_private & OPpREFCOUNTED)) {
9937 /* these are assumed to be refcounted properly */
9938 switch (((OP*)ptr)->op_type) {
9945 TOPPTR(nss,ix) = ptr;
9950 TOPPTR(nss,ix) = Nullop;
9955 TOPPTR(nss,ix) = Nullop;
9958 c = (char*)POPPTR(ss,ix);
9959 TOPPTR(nss,ix) = pv_dup_inc(c);
9962 longval = POPLONG(ss,ix);
9963 TOPLONG(nss,ix) = longval;
9966 hv = (HV*)POPPTR(ss,ix);
9967 TOPPTR(nss,ix) = hv_dup_inc(hv, param);
9968 c = (char*)POPPTR(ss,ix);
9969 TOPPTR(nss,ix) = pv_dup_inc(c);
9973 case SAVEt_DESTRUCTOR:
9974 ptr = POPPTR(ss,ix);
9975 TOPPTR(nss,ix) = any_dup(ptr, proto_perl); /* XXX quite arbitrary */
9976 dptr = POPDPTR(ss,ix);
9977 TOPDPTR(nss,ix) = (void (*)(void*))any_dup((void *)dptr, proto_perl);
9979 case SAVEt_DESTRUCTOR_X:
9980 ptr = POPPTR(ss,ix);
9981 TOPPTR(nss,ix) = any_dup(ptr, proto_perl); /* XXX quite arbitrary */
9982 dxptr = POPDXPTR(ss,ix);
9983 TOPDXPTR(nss,ix) = (void (*)(pTHX_ void*))any_dup((void *)dxptr, proto_perl);
9985 case SAVEt_REGCONTEXT:
9991 case SAVEt_STACK_POS: /* Position on Perl stack */
9995 case SAVEt_AELEM: /* array element */
9996 sv = (SV*)POPPTR(ss,ix);
9997 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
10000 av = (AV*)POPPTR(ss,ix);
10001 TOPPTR(nss,ix) = av_dup_inc(av, param);
10003 case SAVEt_HELEM: /* hash element */
10004 sv = (SV*)POPPTR(ss,ix);
10005 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
10006 sv = (SV*)POPPTR(ss,ix);
10007 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
10008 hv = (HV*)POPPTR(ss,ix);
10009 TOPPTR(nss,ix) = hv_dup_inc(hv, param);
10012 ptr = POPPTR(ss,ix);
10013 TOPPTR(nss,ix) = ptr;
10017 TOPINT(nss,ix) = i;
10019 case SAVEt_COMPPAD:
10020 av = (AV*)POPPTR(ss,ix);
10021 TOPPTR(nss,ix) = av_dup(av, param);
10024 longval = (long)POPLONG(ss,ix);
10025 TOPLONG(nss,ix) = longval;
10026 ptr = POPPTR(ss,ix);
10027 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10028 sv = (SV*)POPPTR(ss,ix);
10029 TOPPTR(nss,ix) = sv_dup(sv, param);
10032 Perl_croak(aTHX_ "panic: ss_dup inconsistency");
10040 =for apidoc perl_clone
10042 Create and return a new interpreter by cloning the current one.
10047 /* XXX the above needs expanding by someone who actually understands it ! */
10048 EXTERN_C PerlInterpreter *
10049 perl_clone_host(PerlInterpreter* proto_perl, UV flags);
10052 perl_clone(PerlInterpreter *proto_perl, UV flags)
10054 #ifdef PERL_IMPLICIT_SYS
10056 /* perlhost.h so we need to call into it
10057 to clone the host, CPerlHost should have a c interface, sky */
10059 if (flags & CLONEf_CLONE_HOST) {
10060 return perl_clone_host(proto_perl,flags);
10062 return perl_clone_using(proto_perl, flags,
10064 proto_perl->IMemShared,
10065 proto_perl->IMemParse,
10067 proto_perl->IStdIO,
10071 proto_perl->IProc);
10075 perl_clone_using(PerlInterpreter *proto_perl, UV flags,
10076 struct IPerlMem* ipM, struct IPerlMem* ipMS,
10077 struct IPerlMem* ipMP, struct IPerlEnv* ipE,
10078 struct IPerlStdIO* ipStd, struct IPerlLIO* ipLIO,
10079 struct IPerlDir* ipD, struct IPerlSock* ipS,
10080 struct IPerlProc* ipP)
10082 /* XXX many of the string copies here can be optimized if they're
10083 * constants; they need to be allocated as common memory and just
10084 * their pointers copied. */
10087 CLONE_PARAMS clone_params;
10088 CLONE_PARAMS* param = &clone_params;
10090 PerlInterpreter *my_perl = (PerlInterpreter*)(*ipM->pMalloc)(ipM, sizeof(PerlInterpreter));
10091 PERL_SET_THX(my_perl);
10094 Poison(my_perl, 1, PerlInterpreter);
10099 PL_sig_pending = 0;
10100 Zero(&PL_debug_pad, 1, struct perl_debug_pad);
10101 # else /* !DEBUGGING */
10102 Zero(my_perl, 1, PerlInterpreter);
10103 # endif /* DEBUGGING */
10105 /* host pointers */
10107 PL_MemShared = ipMS;
10108 PL_MemParse = ipMP;
10115 #else /* !PERL_IMPLICIT_SYS */
10117 CLONE_PARAMS clone_params;
10118 CLONE_PARAMS* param = &clone_params;
10119 PerlInterpreter *my_perl = (PerlInterpreter*)PerlMem_malloc(sizeof(PerlInterpreter));
10120 PERL_SET_THX(my_perl);
10125 Poison(my_perl, 1, PerlInterpreter);
10130 PL_sig_pending = 0;
10131 Zero(&PL_debug_pad, 1, struct perl_debug_pad);
10132 # else /* !DEBUGGING */
10133 Zero(my_perl, 1, PerlInterpreter);
10134 # endif /* DEBUGGING */
10135 #endif /* PERL_IMPLICIT_SYS */
10136 param->flags = flags;
10137 param->proto_perl = proto_perl;
10140 PL_xiv_arenaroot = NULL;
10141 PL_xiv_root = NULL;
10142 PL_xnv_arenaroot = NULL;
10143 PL_xnv_root = NULL;
10144 PL_xrv_arenaroot = NULL;
10145 PL_xrv_root = NULL;
10146 PL_xpv_arenaroot = NULL;
10147 PL_xpv_root = NULL;
10148 PL_xpviv_arenaroot = NULL;
10149 PL_xpviv_root = NULL;
10150 PL_xpvnv_arenaroot = NULL;
10151 PL_xpvnv_root = NULL;
10152 PL_xpvcv_arenaroot = NULL;
10153 PL_xpvcv_root = NULL;
10154 PL_xpvav_arenaroot = NULL;
10155 PL_xpvav_root = NULL;
10156 PL_xpvhv_arenaroot = NULL;
10157 PL_xpvhv_root = NULL;
10158 PL_xpvmg_arenaroot = NULL;
10159 PL_xpvmg_root = NULL;
10160 PL_xpvlv_arenaroot = NULL;
10161 PL_xpvlv_root = NULL;
10162 PL_xpvbm_arenaroot = NULL;
10163 PL_xpvbm_root = NULL;
10164 PL_he_arenaroot = NULL;
10166 PL_nice_chunk = NULL;
10167 PL_nice_chunk_size = 0;
10169 PL_sv_objcount = 0;
10170 PL_sv_root = Nullsv;
10171 PL_sv_arenaroot = Nullsv;
10173 PL_debug = proto_perl->Idebug;
10175 #ifdef USE_REENTRANT_API
10176 Perl_reentrant_init(aTHX);
10179 /* create SV map for pointer relocation */
10180 PL_ptr_table = ptr_table_new();
10182 /* initialize these special pointers as early as possible */
10183 SvANY(&PL_sv_undef) = NULL;
10184 SvREFCNT(&PL_sv_undef) = (~(U32)0)/2;
10185 SvFLAGS(&PL_sv_undef) = SVf_READONLY|SVt_NULL;
10186 ptr_table_store(PL_ptr_table, &proto_perl->Isv_undef, &PL_sv_undef);
10188 SvANY(&PL_sv_no) = new_XPVNV();
10189 SvREFCNT(&PL_sv_no) = (~(U32)0)/2;
10190 SvFLAGS(&PL_sv_no) = SVp_NOK|SVf_NOK|SVp_POK|SVf_POK|SVf_READONLY|SVt_PVNV;
10191 SvPVX(&PL_sv_no) = SAVEPVN(PL_No, 0);
10192 SvCUR(&PL_sv_no) = 0;
10193 SvLEN(&PL_sv_no) = 1;
10194 SvNVX(&PL_sv_no) = 0;
10195 ptr_table_store(PL_ptr_table, &proto_perl->Isv_no, &PL_sv_no);
10197 SvANY(&PL_sv_yes) = new_XPVNV();
10198 SvREFCNT(&PL_sv_yes) = (~(U32)0)/2;
10199 SvFLAGS(&PL_sv_yes) = SVp_NOK|SVf_NOK|SVp_POK|SVf_POK|SVf_READONLY|SVt_PVNV;
10200 SvPVX(&PL_sv_yes) = SAVEPVN(PL_Yes, 1);
10201 SvCUR(&PL_sv_yes) = 1;
10202 SvLEN(&PL_sv_yes) = 2;
10203 SvNVX(&PL_sv_yes) = 1;
10204 ptr_table_store(PL_ptr_table, &proto_perl->Isv_yes, &PL_sv_yes);
10206 /* create (a non-shared!) shared string table */
10207 PL_strtab = newHV();
10208 HvSHAREKEYS_off(PL_strtab);
10209 hv_ksplit(PL_strtab, 512);
10210 ptr_table_store(PL_ptr_table, proto_perl->Istrtab, PL_strtab);
10212 PL_compiling = proto_perl->Icompiling;
10214 /* These two PVs will be free'd special way so must set them same way op.c does */
10215 PL_compiling.cop_stashpv = savesharedpv(PL_compiling.cop_stashpv);
10216 ptr_table_store(PL_ptr_table, proto_perl->Icompiling.cop_stashpv, PL_compiling.cop_stashpv);
10218 PL_compiling.cop_file = savesharedpv(PL_compiling.cop_file);
10219 ptr_table_store(PL_ptr_table, proto_perl->Icompiling.cop_file, PL_compiling.cop_file);
10221 ptr_table_store(PL_ptr_table, &proto_perl->Icompiling, &PL_compiling);
10222 if (!specialWARN(PL_compiling.cop_warnings))
10223 PL_compiling.cop_warnings = sv_dup_inc(PL_compiling.cop_warnings, param);
10224 if (!specialCopIO(PL_compiling.cop_io))
10225 PL_compiling.cop_io = sv_dup_inc(PL_compiling.cop_io, param);
10226 PL_curcop = (COP*)any_dup(proto_perl->Tcurcop, proto_perl);
10228 /* pseudo environmental stuff */
10229 PL_origargc = proto_perl->Iorigargc;
10231 New(0, PL_origargv, i+1, char*);
10232 PL_origargv[i] = '\0';
10234 PL_origargv[i] = SAVEPV(proto_perl->Iorigargv[i]);
10237 param->stashes = newAV(); /* Setup array of objects to call clone on */
10239 #ifdef PERLIO_LAYERS
10240 /* Clone PerlIO tables as soon as we can handle general xx_dup() */
10241 PerlIO_clone(aTHX_ proto_perl, param);
10244 PL_envgv = gv_dup(proto_perl->Ienvgv, param);
10245 PL_incgv = gv_dup(proto_perl->Iincgv, param);
10246 PL_hintgv = gv_dup(proto_perl->Ihintgv, param);
10247 PL_origfilename = SAVEPV(proto_perl->Iorigfilename);
10248 PL_diehook = sv_dup_inc(proto_perl->Idiehook, param);
10249 PL_warnhook = sv_dup_inc(proto_perl->Iwarnhook, param);
10252 PL_minus_c = proto_perl->Iminus_c;
10253 PL_patchlevel = sv_dup_inc(proto_perl->Ipatchlevel, param);
10254 PL_localpatches = proto_perl->Ilocalpatches;
10255 PL_splitstr = proto_perl->Isplitstr;
10256 PL_preprocess = proto_perl->Ipreprocess;
10257 PL_minus_n = proto_perl->Iminus_n;
10258 PL_minus_p = proto_perl->Iminus_p;
10259 PL_minus_l = proto_perl->Iminus_l;
10260 PL_minus_a = proto_perl->Iminus_a;
10261 PL_minus_F = proto_perl->Iminus_F;
10262 PL_doswitches = proto_perl->Idoswitches;
10263 PL_dowarn = proto_perl->Idowarn;
10264 PL_doextract = proto_perl->Idoextract;
10265 PL_sawampersand = proto_perl->Isawampersand;
10266 PL_unsafe = proto_perl->Iunsafe;
10267 PL_inplace = SAVEPV(proto_perl->Iinplace);
10268 PL_e_script = sv_dup_inc(proto_perl->Ie_script, param);
10269 PL_perldb = proto_perl->Iperldb;
10270 PL_perl_destruct_level = proto_perl->Iperl_destruct_level;
10271 PL_exit_flags = proto_perl->Iexit_flags;
10273 /* magical thingies */
10274 /* XXX time(&PL_basetime) when asked for? */
10275 PL_basetime = proto_perl->Ibasetime;
10276 PL_formfeed = sv_dup(proto_perl->Iformfeed, param);
10278 PL_maxsysfd = proto_perl->Imaxsysfd;
10279 PL_multiline = proto_perl->Imultiline;
10280 PL_statusvalue = proto_perl->Istatusvalue;
10282 PL_statusvalue_vms = proto_perl->Istatusvalue_vms;
10284 PL_encoding = sv_dup(proto_perl->Iencoding, param);
10286 sv_setpvn(PERL_DEBUG_PAD(0), "", 0); /* For regex debugging. */
10287 sv_setpvn(PERL_DEBUG_PAD(1), "", 0); /* ext/re needs these */
10288 sv_setpvn(PERL_DEBUG_PAD(2), "", 0); /* even without DEBUGGING. */
10290 /* Clone the regex array */
10291 PL_regex_padav = newAV();
10293 I32 len = av_len((AV*)proto_perl->Iregex_padav);
10294 SV** regexen = AvARRAY((AV*)proto_perl->Iregex_padav);
10295 av_push(PL_regex_padav,
10296 sv_dup_inc(regexen[0],param));
10297 for(i = 1; i <= len; i++) {
10298 if(SvREPADTMP(regexen[i])) {
10299 av_push(PL_regex_padav, sv_dup_inc(regexen[i], param));
10301 av_push(PL_regex_padav,
10303 newSViv(PTR2IV(re_dup(INT2PTR(REGEXP *,
10304 SvIVX(regexen[i])), param)))
10309 PL_regex_pad = AvARRAY(PL_regex_padav);
10311 /* shortcuts to various I/O objects */
10312 PL_stdingv = gv_dup(proto_perl->Istdingv, param);
10313 PL_stderrgv = gv_dup(proto_perl->Istderrgv, param);
10314 PL_defgv = gv_dup(proto_perl->Idefgv, param);
10315 PL_argvgv = gv_dup(proto_perl->Iargvgv, param);
10316 PL_argvoutgv = gv_dup(proto_perl->Iargvoutgv, param);
10317 PL_argvout_stack = av_dup_inc(proto_perl->Iargvout_stack, param);
10319 /* shortcuts to regexp stuff */
10320 PL_replgv = gv_dup(proto_perl->Ireplgv, param);
10322 /* shortcuts to misc objects */
10323 PL_errgv = gv_dup(proto_perl->Ierrgv, param);
10325 /* shortcuts to debugging objects */
10326 PL_DBgv = gv_dup(proto_perl->IDBgv, param);
10327 PL_DBline = gv_dup(proto_perl->IDBline, param);
10328 PL_DBsub = gv_dup(proto_perl->IDBsub, param);
10329 PL_DBsingle = sv_dup(proto_perl->IDBsingle, param);
10330 PL_DBtrace = sv_dup(proto_perl->IDBtrace, param);
10331 PL_DBsignal = sv_dup(proto_perl->IDBsignal, param);
10332 PL_lineary = av_dup(proto_perl->Ilineary, param);
10333 PL_dbargs = av_dup(proto_perl->Idbargs, param);
10335 /* symbol tables */
10336 PL_defstash = hv_dup_inc(proto_perl->Tdefstash, param);
10337 PL_curstash = hv_dup(proto_perl->Tcurstash, param);
10338 PL_nullstash = hv_dup(proto_perl->Inullstash, param);
10339 PL_debstash = hv_dup(proto_perl->Idebstash, param);
10340 PL_globalstash = hv_dup(proto_perl->Iglobalstash, param);
10341 PL_curstname = sv_dup_inc(proto_perl->Icurstname, param);
10343 PL_beginav = av_dup_inc(proto_perl->Ibeginav, param);
10344 PL_beginav_save = av_dup_inc(proto_perl->Ibeginav_save, param);
10345 PL_checkav_save = av_dup_inc(proto_perl->Icheckav_save, param);
10346 PL_endav = av_dup_inc(proto_perl->Iendav, param);
10347 PL_checkav = av_dup_inc(proto_perl->Icheckav, param);
10348 PL_initav = av_dup_inc(proto_perl->Iinitav, param);
10350 PL_sub_generation = proto_perl->Isub_generation;
10352 /* funky return mechanisms */
10353 PL_forkprocess = proto_perl->Iforkprocess;
10355 /* subprocess state */
10356 PL_fdpid = av_dup_inc(proto_perl->Ifdpid, param);
10358 /* internal state */
10359 PL_tainting = proto_perl->Itainting;
10360 PL_maxo = proto_perl->Imaxo;
10361 if (proto_perl->Iop_mask)
10362 PL_op_mask = SAVEPVN(proto_perl->Iop_mask, PL_maxo);
10364 PL_op_mask = Nullch;
10366 /* current interpreter roots */
10367 PL_main_cv = cv_dup_inc(proto_perl->Imain_cv, param);
10368 PL_main_root = OpREFCNT_inc(proto_perl->Imain_root);
10369 PL_main_start = proto_perl->Imain_start;
10370 PL_eval_root = proto_perl->Ieval_root;
10371 PL_eval_start = proto_perl->Ieval_start;
10373 /* runtime control stuff */
10374 PL_curcopdb = (COP*)any_dup(proto_perl->Icurcopdb, proto_perl);
10375 PL_copline = proto_perl->Icopline;
10377 PL_filemode = proto_perl->Ifilemode;
10378 PL_lastfd = proto_perl->Ilastfd;
10379 PL_oldname = proto_perl->Ioldname; /* XXX not quite right */
10382 PL_gensym = proto_perl->Igensym;
10383 PL_preambled = proto_perl->Ipreambled;
10384 PL_preambleav = av_dup_inc(proto_perl->Ipreambleav, param);
10385 PL_laststatval = proto_perl->Ilaststatval;
10386 PL_laststype = proto_perl->Ilaststype;
10387 PL_mess_sv = Nullsv;
10389 PL_ors_sv = sv_dup_inc(proto_perl->Iors_sv, param);
10390 PL_ofmt = SAVEPV(proto_perl->Iofmt);
10392 /* interpreter atexit processing */
10393 PL_exitlistlen = proto_perl->Iexitlistlen;
10394 if (PL_exitlistlen) {
10395 New(0, PL_exitlist, PL_exitlistlen, PerlExitListEntry);
10396 Copy(proto_perl->Iexitlist, PL_exitlist, PL_exitlistlen, PerlExitListEntry);
10399 PL_exitlist = (PerlExitListEntry*)NULL;
10400 PL_modglobal = hv_dup_inc(proto_perl->Imodglobal, param);
10401 PL_custom_op_names = hv_dup_inc(proto_perl->Icustom_op_names,param);
10402 PL_custom_op_descs = hv_dup_inc(proto_perl->Icustom_op_descs,param);
10404 PL_profiledata = NULL;
10405 PL_rsfp = fp_dup(proto_perl->Irsfp, '<', param);
10406 /* PL_rsfp_filters entries have fake IoDIRP() */
10407 PL_rsfp_filters = av_dup_inc(proto_perl->Irsfp_filters, param);
10409 PL_compcv = cv_dup(proto_perl->Icompcv, param);
10410 PL_comppad = av_dup(proto_perl->Icomppad, param);
10411 PL_comppad_name = av_dup(proto_perl->Icomppad_name, param);
10412 PL_comppad_name_fill = proto_perl->Icomppad_name_fill;
10413 PL_comppad_name_floor = proto_perl->Icomppad_name_floor;
10414 PL_curpad = (SV**)ptr_table_fetch(PL_ptr_table,
10415 proto_perl->Tcurpad);
10417 #ifdef HAVE_INTERP_INTERN
10418 sys_intern_dup(&proto_perl->Isys_intern, &PL_sys_intern);
10421 /* more statics moved here */
10422 PL_generation = proto_perl->Igeneration;
10423 PL_DBcv = cv_dup(proto_perl->IDBcv, param);
10425 PL_in_clean_objs = proto_perl->Iin_clean_objs;
10426 PL_in_clean_all = proto_perl->Iin_clean_all;
10428 PL_uid = proto_perl->Iuid;
10429 PL_euid = proto_perl->Ieuid;
10430 PL_gid = proto_perl->Igid;
10431 PL_egid = proto_perl->Iegid;
10432 PL_nomemok = proto_perl->Inomemok;
10433 PL_an = proto_perl->Ian;
10434 PL_cop_seqmax = proto_perl->Icop_seqmax;
10435 PL_op_seqmax = proto_perl->Iop_seqmax;
10436 PL_evalseq = proto_perl->Ievalseq;
10437 PL_origenviron = proto_perl->Iorigenviron; /* XXX not quite right */
10438 PL_origalen = proto_perl->Iorigalen;
10439 PL_pidstatus = newHV(); /* XXX flag for cloning? */
10440 PL_osname = SAVEPV(proto_perl->Iosname);
10441 PL_sh_path = proto_perl->Ish_path; /* XXX never deallocated */
10442 PL_sighandlerp = proto_perl->Isighandlerp;
10445 PL_runops = proto_perl->Irunops;
10447 Copy(proto_perl->Itokenbuf, PL_tokenbuf, 256, char);
10450 PL_cshlen = proto_perl->Icshlen;
10451 PL_cshname = proto_perl->Icshname; /* XXX never deallocated */
10454 PL_lex_state = proto_perl->Ilex_state;
10455 PL_lex_defer = proto_perl->Ilex_defer;
10456 PL_lex_expect = proto_perl->Ilex_expect;
10457 PL_lex_formbrack = proto_perl->Ilex_formbrack;
10458 PL_lex_dojoin = proto_perl->Ilex_dojoin;
10459 PL_lex_starts = proto_perl->Ilex_starts;
10460 PL_lex_stuff = sv_dup_inc(proto_perl->Ilex_stuff, param);
10461 PL_lex_repl = sv_dup_inc(proto_perl->Ilex_repl, param);
10462 PL_lex_op = proto_perl->Ilex_op;
10463 PL_lex_inpat = proto_perl->Ilex_inpat;
10464 PL_lex_inwhat = proto_perl->Ilex_inwhat;
10465 PL_lex_brackets = proto_perl->Ilex_brackets;
10466 i = (PL_lex_brackets < 120 ? 120 : PL_lex_brackets);
10467 PL_lex_brackstack = SAVEPVN(proto_perl->Ilex_brackstack,i);
10468 PL_lex_casemods = proto_perl->Ilex_casemods;
10469 i = (PL_lex_casemods < 12 ? 12 : PL_lex_casemods);
10470 PL_lex_casestack = SAVEPVN(proto_perl->Ilex_casestack,i);
10472 Copy(proto_perl->Inextval, PL_nextval, 5, YYSTYPE);
10473 Copy(proto_perl->Inexttype, PL_nexttype, 5, I32);
10474 PL_nexttoke = proto_perl->Inexttoke;
10476 /* XXX This is probably masking the deeper issue of why
10477 * SvANY(proto_perl->Ilinestr) can be NULL at this point. For test case:
10478 * http://archive.develooper.com/perl5-porters%40perl.org/msg83298.html
10479 * (A little debugging with a watchpoint on it may help.)
10481 if (SvANY(proto_perl->Ilinestr)) {
10482 PL_linestr = sv_dup_inc(proto_perl->Ilinestr, param);
10483 i = proto_perl->Ibufptr - SvPVX(proto_perl->Ilinestr);
10484 PL_bufptr = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
10485 i = proto_perl->Ioldbufptr - SvPVX(proto_perl->Ilinestr);
10486 PL_oldbufptr = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
10487 i = proto_perl->Ioldoldbufptr - SvPVX(proto_perl->Ilinestr);
10488 PL_oldoldbufptr = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
10489 i = proto_perl->Ilinestart - SvPVX(proto_perl->Ilinestr);
10490 PL_linestart = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
10493 PL_linestr = NEWSV(65,79);
10494 sv_upgrade(PL_linestr,SVt_PVIV);
10495 sv_setpvn(PL_linestr,"",0);
10496 PL_bufptr = PL_oldbufptr = PL_oldoldbufptr = PL_linestart = SvPVX(PL_linestr);
10498 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
10499 PL_pending_ident = proto_perl->Ipending_ident;
10500 PL_sublex_info = proto_perl->Isublex_info; /* XXX not quite right */
10502 PL_expect = proto_perl->Iexpect;
10504 PL_multi_start = proto_perl->Imulti_start;
10505 PL_multi_end = proto_perl->Imulti_end;
10506 PL_multi_open = proto_perl->Imulti_open;
10507 PL_multi_close = proto_perl->Imulti_close;
10509 PL_error_count = proto_perl->Ierror_count;
10510 PL_subline = proto_perl->Isubline;
10511 PL_subname = sv_dup_inc(proto_perl->Isubname, param);
10513 PL_min_intro_pending = proto_perl->Imin_intro_pending;
10514 PL_max_intro_pending = proto_perl->Imax_intro_pending;
10515 PL_padix = proto_perl->Ipadix;
10516 PL_padix_floor = proto_perl->Ipadix_floor;
10517 PL_pad_reset_pending = proto_perl->Ipad_reset_pending;
10519 /* XXX See comment on SvANY(proto_perl->Ilinestr) above */
10520 if (SvANY(proto_perl->Ilinestr)) {
10521 i = proto_perl->Ilast_uni - SvPVX(proto_perl->Ilinestr);
10522 PL_last_uni = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
10523 i = proto_perl->Ilast_lop - SvPVX(proto_perl->Ilinestr);
10524 PL_last_lop = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
10525 PL_last_lop_op = proto_perl->Ilast_lop_op;
10528 PL_last_uni = SvPVX(PL_linestr);
10529 PL_last_lop = SvPVX(PL_linestr);
10530 PL_last_lop_op = 0;
10532 PL_in_my = proto_perl->Iin_my;
10533 PL_in_my_stash = hv_dup(proto_perl->Iin_my_stash, param);
10535 PL_cryptseen = proto_perl->Icryptseen;
10538 PL_hints = proto_perl->Ihints;
10540 PL_amagic_generation = proto_perl->Iamagic_generation;
10542 #ifdef USE_LOCALE_COLLATE
10543 PL_collation_ix = proto_perl->Icollation_ix;
10544 PL_collation_name = SAVEPV(proto_perl->Icollation_name);
10545 PL_collation_standard = proto_perl->Icollation_standard;
10546 PL_collxfrm_base = proto_perl->Icollxfrm_base;
10547 PL_collxfrm_mult = proto_perl->Icollxfrm_mult;
10548 #endif /* USE_LOCALE_COLLATE */
10550 #ifdef USE_LOCALE_NUMERIC
10551 PL_numeric_name = SAVEPV(proto_perl->Inumeric_name);
10552 PL_numeric_standard = proto_perl->Inumeric_standard;
10553 PL_numeric_local = proto_perl->Inumeric_local;
10554 PL_numeric_radix_sv = sv_dup_inc(proto_perl->Inumeric_radix_sv, param);
10555 #endif /* !USE_LOCALE_NUMERIC */
10557 /* utf8 character classes */
10558 PL_utf8_alnum = sv_dup_inc(proto_perl->Iutf8_alnum, param);
10559 PL_utf8_alnumc = sv_dup_inc(proto_perl->Iutf8_alnumc, param);
10560 PL_utf8_ascii = sv_dup_inc(proto_perl->Iutf8_ascii, param);
10561 PL_utf8_alpha = sv_dup_inc(proto_perl->Iutf8_alpha, param);
10562 PL_utf8_space = sv_dup_inc(proto_perl->Iutf8_space, param);
10563 PL_utf8_cntrl = sv_dup_inc(proto_perl->Iutf8_cntrl, param);
10564 PL_utf8_graph = sv_dup_inc(proto_perl->Iutf8_graph, param);
10565 PL_utf8_digit = sv_dup_inc(proto_perl->Iutf8_digit, param);
10566 PL_utf8_upper = sv_dup_inc(proto_perl->Iutf8_upper, param);
10567 PL_utf8_lower = sv_dup_inc(proto_perl->Iutf8_lower, param);
10568 PL_utf8_print = sv_dup_inc(proto_perl->Iutf8_print, param);
10569 PL_utf8_punct = sv_dup_inc(proto_perl->Iutf8_punct, param);
10570 PL_utf8_xdigit = sv_dup_inc(proto_perl->Iutf8_xdigit, param);
10571 PL_utf8_mark = sv_dup_inc(proto_perl->Iutf8_mark, param);
10572 PL_utf8_toupper = sv_dup_inc(proto_perl->Iutf8_toupper, param);
10573 PL_utf8_totitle = sv_dup_inc(proto_perl->Iutf8_totitle, param);
10574 PL_utf8_tolower = sv_dup_inc(proto_perl->Iutf8_tolower, param);
10575 PL_utf8_tofold = sv_dup_inc(proto_perl->Iutf8_tofold, param);
10576 PL_utf8_idstart = sv_dup_inc(proto_perl->Iutf8_idstart, param);
10577 PL_utf8_idcont = sv_dup_inc(proto_perl->Iutf8_idcont, param);
10580 PL_last_swash_hv = Nullhv; /* reinits on demand */
10581 PL_last_swash_klen = 0;
10582 PL_last_swash_key[0]= '\0';
10583 PL_last_swash_tmps = (U8*)NULL;
10584 PL_last_swash_slen = 0;
10586 /* perly.c globals */
10587 PL_yydebug = proto_perl->Iyydebug;
10588 PL_yynerrs = proto_perl->Iyynerrs;
10589 PL_yyerrflag = proto_perl->Iyyerrflag;
10590 PL_yychar = proto_perl->Iyychar;
10591 PL_yyval = proto_perl->Iyyval;
10592 PL_yylval = proto_perl->Iyylval;
10594 PL_glob_index = proto_perl->Iglob_index;
10595 PL_srand_called = proto_perl->Isrand_called;
10596 PL_uudmap['M'] = 0; /* reinits on demand */
10597 PL_bitcount = Nullch; /* reinits on demand */
10599 if (proto_perl->Ipsig_pend) {
10600 Newz(0, PL_psig_pend, SIG_SIZE, int);
10603 PL_psig_pend = (int*)NULL;
10606 if (proto_perl->Ipsig_ptr) {
10607 Newz(0, PL_psig_ptr, SIG_SIZE, SV*);
10608 Newz(0, PL_psig_name, SIG_SIZE, SV*);
10609 for (i = 1; i < SIG_SIZE; i++) {
10610 PL_psig_ptr[i] = sv_dup_inc(proto_perl->Ipsig_ptr[i], param);
10611 PL_psig_name[i] = sv_dup_inc(proto_perl->Ipsig_name[i], param);
10615 PL_psig_ptr = (SV**)NULL;
10616 PL_psig_name = (SV**)NULL;
10619 /* thrdvar.h stuff */
10621 if (flags & CLONEf_COPY_STACKS) {
10622 /* next allocation will be PL_tmps_stack[PL_tmps_ix+1] */
10623 PL_tmps_ix = proto_perl->Ttmps_ix;
10624 PL_tmps_max = proto_perl->Ttmps_max;
10625 PL_tmps_floor = proto_perl->Ttmps_floor;
10626 Newz(50, PL_tmps_stack, PL_tmps_max, SV*);
10628 while (i <= PL_tmps_ix) {
10629 PL_tmps_stack[i] = sv_dup_inc(proto_perl->Ttmps_stack[i], param);
10633 /* next PUSHMARK() sets *(PL_markstack_ptr+1) */
10634 i = proto_perl->Tmarkstack_max - proto_perl->Tmarkstack;
10635 Newz(54, PL_markstack, i, I32);
10636 PL_markstack_max = PL_markstack + (proto_perl->Tmarkstack_max
10637 - proto_perl->Tmarkstack);
10638 PL_markstack_ptr = PL_markstack + (proto_perl->Tmarkstack_ptr
10639 - proto_perl->Tmarkstack);
10640 Copy(proto_perl->Tmarkstack, PL_markstack,
10641 PL_markstack_ptr - PL_markstack + 1, I32);
10643 /* next push_scope()/ENTER sets PL_scopestack[PL_scopestack_ix]
10644 * NOTE: unlike the others! */
10645 PL_scopestack_ix = proto_perl->Tscopestack_ix;
10646 PL_scopestack_max = proto_perl->Tscopestack_max;
10647 Newz(54, PL_scopestack, PL_scopestack_max, I32);
10648 Copy(proto_perl->Tscopestack, PL_scopestack, PL_scopestack_ix, I32);
10650 /* next push_return() sets PL_retstack[PL_retstack_ix]
10651 * NOTE: unlike the others! */
10652 PL_retstack_ix = proto_perl->Tretstack_ix;
10653 PL_retstack_max = proto_perl->Tretstack_max;
10654 Newz(54, PL_retstack, PL_retstack_max, OP*);
10655 Copy(proto_perl->Tretstack, PL_retstack, PL_retstack_ix, OP*);
10657 /* NOTE: si_dup() looks at PL_markstack */
10658 PL_curstackinfo = si_dup(proto_perl->Tcurstackinfo, param);
10660 /* PL_curstack = PL_curstackinfo->si_stack; */
10661 PL_curstack = av_dup(proto_perl->Tcurstack, param);
10662 PL_mainstack = av_dup(proto_perl->Tmainstack, param);
10664 /* next PUSHs() etc. set *(PL_stack_sp+1) */
10665 PL_stack_base = AvARRAY(PL_curstack);
10666 PL_stack_sp = PL_stack_base + (proto_perl->Tstack_sp
10667 - proto_perl->Tstack_base);
10668 PL_stack_max = PL_stack_base + AvMAX(PL_curstack);
10670 /* next SSPUSHFOO() sets PL_savestack[PL_savestack_ix]
10671 * NOTE: unlike the others! */
10672 PL_savestack_ix = proto_perl->Tsavestack_ix;
10673 PL_savestack_max = proto_perl->Tsavestack_max;
10674 /*Newz(54, PL_savestack, PL_savestack_max, ANY);*/
10675 PL_savestack = ss_dup(proto_perl, param);
10679 ENTER; /* perl_destruct() wants to LEAVE; */
10682 PL_start_env = proto_perl->Tstart_env; /* XXXXXX */
10683 PL_top_env = &PL_start_env;
10685 PL_op = proto_perl->Top;
10688 PL_Xpv = (XPV*)NULL;
10689 PL_na = proto_perl->Tna;
10691 PL_statbuf = proto_perl->Tstatbuf;
10692 PL_statcache = proto_perl->Tstatcache;
10693 PL_statgv = gv_dup(proto_perl->Tstatgv, param);
10694 PL_statname = sv_dup_inc(proto_perl->Tstatname, param);
10696 PL_timesbuf = proto_perl->Ttimesbuf;
10699 PL_tainted = proto_perl->Ttainted;
10700 PL_curpm = proto_perl->Tcurpm; /* XXX No PMOP ref count */
10701 PL_rs = sv_dup_inc(proto_perl->Trs, param);
10702 PL_last_in_gv = gv_dup(proto_perl->Tlast_in_gv, param);
10703 PL_ofs_sv = sv_dup_inc(proto_perl->Tofs_sv, param);
10704 PL_defoutgv = gv_dup_inc(proto_perl->Tdefoutgv, param);
10705 PL_chopset = proto_perl->Tchopset; /* XXX never deallocated */
10706 PL_toptarget = sv_dup_inc(proto_perl->Ttoptarget, param);
10707 PL_bodytarget = sv_dup_inc(proto_perl->Tbodytarget, param);
10708 PL_formtarget = sv_dup(proto_perl->Tformtarget, param);
10710 PL_restartop = proto_perl->Trestartop;
10711 PL_in_eval = proto_perl->Tin_eval;
10712 PL_delaymagic = proto_perl->Tdelaymagic;
10713 PL_dirty = proto_perl->Tdirty;
10714 PL_localizing = proto_perl->Tlocalizing;
10716 #ifdef PERL_FLEXIBLE_EXCEPTIONS
10717 PL_protect = proto_perl->Tprotect;
10719 PL_errors = sv_dup_inc(proto_perl->Terrors, param);
10720 PL_av_fetch_sv = Nullsv;
10721 PL_hv_fetch_sv = Nullsv;
10722 Zero(&PL_hv_fetch_ent_mh, 1, HE); /* XXX */
10723 PL_modcount = proto_perl->Tmodcount;
10724 PL_lastgotoprobe = Nullop;
10725 PL_dumpindent = proto_perl->Tdumpindent;
10727 PL_sortcop = (OP*)any_dup(proto_perl->Tsortcop, proto_perl);
10728 PL_sortstash = hv_dup(proto_perl->Tsortstash, param);
10729 PL_firstgv = gv_dup(proto_perl->Tfirstgv, param);
10730 PL_secondgv = gv_dup(proto_perl->Tsecondgv, param);
10731 PL_sortcxix = proto_perl->Tsortcxix;
10732 PL_efloatbuf = Nullch; /* reinits on demand */
10733 PL_efloatsize = 0; /* reinits on demand */
10737 PL_screamfirst = NULL;
10738 PL_screamnext = NULL;
10739 PL_maxscream = -1; /* reinits on demand */
10740 PL_lastscream = Nullsv;
10742 PL_watchaddr = NULL;
10743 PL_watchok = Nullch;
10745 PL_regdummy = proto_perl->Tregdummy;
10746 PL_regcomp_parse = Nullch;
10747 PL_regxend = Nullch;
10748 PL_regcode = (regnode*)NULL;
10751 PL_regprecomp = Nullch;
10756 PL_seen_zerolen = 0;
10758 PL_regcomp_rx = (regexp*)NULL;
10760 PL_colorset = 0; /* reinits PL_colors[] */
10761 /*PL_colors[6] = {0,0,0,0,0,0};*/
10762 PL_reg_whilem_seen = 0;
10763 PL_reginput = Nullch;
10764 PL_regbol = Nullch;
10765 PL_regeol = Nullch;
10766 PL_regstartp = (I32*)NULL;
10767 PL_regendp = (I32*)NULL;
10768 PL_reglastparen = (U32*)NULL;
10769 PL_regtill = Nullch;
10770 PL_reg_start_tmp = (char**)NULL;
10771 PL_reg_start_tmpl = 0;
10772 PL_regdata = (struct reg_data*)NULL;
10775 PL_reg_eval_set = 0;
10777 PL_regprogram = (regnode*)NULL;
10779 PL_regcc = (CURCUR*)NULL;
10780 PL_reg_call_cc = (struct re_cc_state*)NULL;
10781 PL_reg_re = (regexp*)NULL;
10782 PL_reg_ganch = Nullch;
10783 PL_reg_sv = Nullsv;
10784 PL_reg_match_utf8 = FALSE;
10785 PL_reg_magic = (MAGIC*)NULL;
10787 PL_reg_oldcurpm = (PMOP*)NULL;
10788 PL_reg_curpm = (PMOP*)NULL;
10789 PL_reg_oldsaved = Nullch;
10790 PL_reg_oldsavedlen = 0;
10791 PL_reg_maxiter = 0;
10792 PL_reg_leftiter = 0;
10793 PL_reg_poscache = Nullch;
10794 PL_reg_poscache_size= 0;
10796 /* RE engine - function pointers */
10797 PL_regcompp = proto_perl->Tregcompp;
10798 PL_regexecp = proto_perl->Tregexecp;
10799 PL_regint_start = proto_perl->Tregint_start;
10800 PL_regint_string = proto_perl->Tregint_string;
10801 PL_regfree = proto_perl->Tregfree;
10803 PL_reginterp_cnt = 0;
10804 PL_reg_starttry = 0;
10806 /* Pluggable optimizer */
10807 PL_peepp = proto_perl->Tpeepp;
10809 if (!(flags & CLONEf_KEEP_PTR_TABLE)) {
10810 ptr_table_free(PL_ptr_table);
10811 PL_ptr_table = NULL;
10814 /* Call the ->CLONE method, if it exists, for each of the stashes
10815 identified by sv_dup() above.
10817 while(av_len(param->stashes) != -1) {
10818 HV* stash = (HV*) av_shift(param->stashes);
10819 GV* cloner = gv_fetchmethod_autoload(stash, "CLONE", 0);
10820 if (cloner && GvCV(cloner)) {
10825 XPUSHs(sv_2mortal(newSVpv(HvNAME(stash), 0)));
10827 call_sv((SV*)GvCV(cloner), G_DISCARD);
10833 SvREFCNT_dec(param->stashes);
10838 #endif /* USE_ITHREADS */
10841 =head1 Unicode Support
10843 =for apidoc sv_recode_to_utf8
10845 The encoding is assumed to be an Encode object, on entry the PV
10846 of the sv is assumed to be octets in that encoding, and the sv
10847 will be converted into Unicode (and UTF-8).
10849 If the sv already is UTF-8 (or if it is not POK), or if the encoding
10850 is not a reference, nothing is done to the sv. If the encoding is not
10851 an C<Encode::XS> Encoding object, bad things will happen.
10852 (See F<lib/encoding.pm> and L<Encode>).
10854 The PV of the sv is returned.
10859 Perl_sv_recode_to_utf8(pTHX_ SV *sv, SV *encoding)
10861 if (SvPOK(sv) && !DO_UTF8(sv) && SvROK(encoding)) {
10874 Passing sv_yes is wrong - it needs to be or'ed set of constants
10875 for Encode::XS, while UTf-8 decode (currently) assumes a true value means
10876 remove converted chars from source.
10878 Both will default the value - let them.
10880 XPUSHs(&PL_sv_yes);
10883 call_method("decode", G_SCALAR);
10887 s = SvPV(uni, len);
10888 if (s != SvPVX(sv)) {
10889 SvGROW(sv, len + 1);
10890 Move(s, SvPVX(sv), len, char);
10891 SvCUR_set(sv, len);
10892 SvPVX(sv)[len] = 0;