3 * Copyright (c) 1991-2001, 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 * Manipulation of scalar values (SVs). This file contains the code that
12 * creates, manipulates and destroys SVs. (Opcode-level functions on SVs
13 * can be found in the various pp*.c files.) Note that the basic structure
14 * of an SV is also used to hold the other major Perl data types - AVs,
15 * HVs, GVs, IO etc. Low-level functions on these other types - such as
16 * memory allocation and destruction - are handled within this file, while
17 * higher-level stuff can be found in the individual files av.c, hv.c,
26 #define SV_CHECK_THINKFIRST(sv) if (SvTHINKFIRST(sv)) sv_force_normal(sv)
29 /* ============================================================================
31 =head1 Allocation and deallocation of SVs.
33 An SV (or AV, HV etc) is in 2 parts: the head and the body. There is only
34 one type of head, but around 13 body types. Head and body are each
35 separately allocated. Normally, this allocation is done using arenas,
36 which are approximately 1K chunks of memory parcelled up into N heads or
37 bodies. The first slot in each arena is reserved, and is used to hold a
38 link to the next arena. In the case of heads, the unused first slot
39 also contains some flags and a note of the number of slots. Snaked through
40 each arena chain is a linked list of free items; when this becomes empty,
41 an extra arena is allocated and divided up into N items which are threaded
44 The following global variables are associated with arenas:
46 PL_sv_arenaroot pointer to list of SV arenas
47 PL_sv_root pointer to list of free SV structures
49 PL_foo_arenaroot pointer to list of foo arenas,
50 PL_foo_root pointer to list of free foo bodies
51 ... for foo in xiv, xnv, xrv, xpv etc.
53 Note that some of the larger and more rarely used body types (eg xpvio)
54 are not allocated using arenas, but are instead just malloc()/free()ed as
55 required. Also, if PURIFY is defined, arenas are abandoned altogether,
56 with all items individually malloc()ed. In addition, a few SV heads are
57 not allocated from an arena, but are instead directly created as static
58 or auto variables, eg PL_sv_undef.
60 The SV arena serves the secondary purpose of allowing still-live SVs
61 to be located and destroyed during final cleanup.
63 At the lowest level, the macros new_SV() and del_SV() grab and free
64 an SV head. (If debugging with -DD, del_SV() calls the function S_del_sv()
65 to return the SV to the free list with error checking.) new_SV() calls
66 more_sv() / sv_add_arena() to add an extra arena if the free list is empty.
67 SVs in the free list have their SvTYPE field set to all ones.
69 Similarly, there are macros new_XIV()/del_XIV(), new_XNV()/del_XNV() etc
70 that allocate and return individual body types. Normally these are mapped
71 to the arena-manipulating functions new_xiv()/del_xiv() etc, but may be
72 instead mapped directly to malloc()/free() if PURIFY is defined. The
73 new/del functions remove from, or add to, the appropriate PL_foo_root
74 list, and call more_xiv() etc to add a new arena if the list is empty.
76 At the time of very final cleanup, sv_free_arenas() is called from
77 perl_destruct() to physically free all the arenas allocated since the
78 start of the interpreter. Note that this also clears PL_he_arenaroot,
79 which is otherwise dealt with in hv.c.
81 Manipulation of any of the PL_*root pointers is protected by enclosing
82 LOCK_SV_MUTEX; ... UNLOCK_SV_MUTEX calls which should Do the Right Thing
83 if threads are enabled.
85 The function visit() scans the SV arenas list, and calls a specified
86 function for each SV it finds which is still live - ie which has an SvTYPE
87 other than all 1's, and a non-zero SvREFCNT. visit() is used by the
88 following functions (specified as [function that calls visit()] / [function
89 called by visit() for each SV]):
91 sv_report_used() / do_report_used()
92 dump all remaining SVs (debugging aid)
94 sv_clean_objs() / do_clean_objs(),do_clean_named_objs()
95 Attempt to free all objects pointed to by RVs,
96 and, unless DISABLE_DESTRUCTOR_KLUDGE is defined,
97 try to do the same for all objects indirectly
98 referenced by typeglobs too. Called once from
99 perl_destruct(), prior to calling sv_clean_all()
102 sv_clean_all() / do_clean_all()
103 SvREFCNT_dec(sv) each remaining SV, possibly
104 triggering an sv_free(). It also sets the
105 SVf_BREAK flag on the SV to indicate that the
106 refcnt has been artificially lowered, and thus
107 stopping sv_free() from giving spurious warnings
108 about SVs which unexpectedly have a refcnt
109 of zero. called repeatedly from perl_destruct()
110 until there are no SVs left.
114 Private API to rest of sv.c
118 new_XIV(), del_XIV(),
119 new_XNV(), del_XNV(),
124 sv_report_used(), sv_clean_objs(), sv_clean_all(), sv_free_arenas()
129 ============================================================================ */
134 * "A time to plant, and a time to uproot what was planted..."
137 #define plant_SV(p) \
139 SvANY(p) = (void *)PL_sv_root; \
140 SvFLAGS(p) = SVTYPEMASK; \
145 /* sv_mutex must be held while calling uproot_SV() */
146 #define uproot_SV(p) \
149 PL_sv_root = (SV*)SvANY(p); \
154 /* new_SV(): return a new, empty SV head */
170 /* del_SV(): return an empty SV head to the free list */
185 S_del_sv(pTHX_ SV *p)
192 for (sva = PL_sv_arenaroot; sva; sva = (SV *) SvANY(sva)) {
194 svend = &sva[SvREFCNT(sva)];
195 if (p >= sv && p < svend)
199 if (ckWARN_d(WARN_INTERNAL))
200 Perl_warner(aTHX_ WARN_INTERNAL,
201 "Attempt to free non-arena SV: 0x%"UVxf,
209 #else /* ! DEBUGGING */
211 #define del_SV(p) plant_SV(p)
213 #endif /* DEBUGGING */
217 =for apidoc sv_add_arena
219 Given a chunk of memory, link it to the head of the list of arenas,
220 and split it into a list of free SVs.
226 Perl_sv_add_arena(pTHX_ char *ptr, U32 size, U32 flags)
231 Zero(ptr, size, char);
233 /* The first SV in an arena isn't an SV. */
234 SvANY(sva) = (void *) PL_sv_arenaroot; /* ptr to next arena */
235 SvREFCNT(sva) = size / sizeof(SV); /* number of SV slots */
236 SvFLAGS(sva) = flags; /* FAKE if not to be freed */
238 PL_sv_arenaroot = sva;
239 PL_sv_root = sva + 1;
241 svend = &sva[SvREFCNT(sva) - 1];
244 SvANY(sv) = (void *)(SV*)(sv + 1);
245 SvFLAGS(sv) = SVTYPEMASK;
249 SvFLAGS(sv) = SVTYPEMASK;
252 /* make some more SVs by adding another arena */
254 /* sv_mutex must be held while calling more_sv() */
261 sv_add_arena(PL_nice_chunk, PL_nice_chunk_size, 0);
262 PL_nice_chunk = Nullch;
263 PL_nice_chunk_size = 0;
266 char *chunk; /* must use New here to match call to */
267 New(704,chunk,1008,char); /* Safefree() in sv_free_arenas() */
268 sv_add_arena(chunk, 1008, 0);
274 /* visit(): call the named function for each non-free SV in the arenas. */
277 S_visit(pTHX_ SVFUNC_t f)
284 for (sva = PL_sv_arenaroot; sva; sva = (SV*)SvANY(sva)) {
285 svend = &sva[SvREFCNT(sva)];
286 for (sv = sva + 1; sv < svend; ++sv) {
287 if (SvTYPE(sv) != SVTYPEMASK && SvREFCNT(sv)) {
296 /* called by sv_report_used() for each live SV */
299 do_report_used(pTHXo_ SV *sv)
301 if (SvTYPE(sv) != SVTYPEMASK) {
302 PerlIO_printf(Perl_debug_log, "****\n");
308 =for apidoc sv_report_used
310 Dump the contents of all SVs not yet freed. (Debugging aid).
316 Perl_sv_report_used(pTHX)
318 visit(do_report_used);
321 /* called by sv_clean_objs() for each live SV */
324 do_clean_objs(pTHXo_ SV *sv)
328 if (SvROK(sv) && SvOBJECT(rv = SvRV(sv))) {
329 DEBUG_D((PerlIO_printf(Perl_debug_log, "Cleaning object ref:\n "), sv_dump(sv)));
341 /* XXX Might want to check arrays, etc. */
344 /* called by sv_clean_objs() for each live SV */
346 #ifndef DISABLE_DESTRUCTOR_KLUDGE
348 do_clean_named_objs(pTHXo_ SV *sv)
350 if (SvTYPE(sv) == SVt_PVGV && GvGP(sv)) {
351 if ( SvOBJECT(GvSV(sv)) ||
352 (GvAV(sv) && SvOBJECT(GvAV(sv))) ||
353 (GvHV(sv) && SvOBJECT(GvHV(sv))) ||
354 (GvIO(sv) && SvOBJECT(GvIO(sv))) ||
355 (GvCV(sv) && SvOBJECT(GvCV(sv))) )
357 DEBUG_D((PerlIO_printf(Perl_debug_log, "Cleaning named glob object:\n "), sv_dump(sv)));
365 =for apidoc sv_clean_objs
367 Attempt to destroy all objects not yet freed
373 Perl_sv_clean_objs(pTHX)
375 PL_in_clean_objs = TRUE;
376 visit(do_clean_objs);
377 #ifndef DISABLE_DESTRUCTOR_KLUDGE
378 /* some barnacles may yet remain, clinging to typeglobs */
379 visit(do_clean_named_objs);
381 PL_in_clean_objs = FALSE;
384 /* called by sv_clean_all() for each live SV */
387 do_clean_all(pTHXo_ SV *sv)
389 DEBUG_D((PerlIO_printf(Perl_debug_log, "Cleaning loops: SV at 0x%"UVxf"\n", PTR2UV(sv)) ));
390 SvFLAGS(sv) |= SVf_BREAK;
395 =for apidoc sv_clean_all
397 Decrement the refcnt of each remaining SV, possibly triggering a
398 cleanup. This function may have to be called multiple times to free
399 SVs which are in complex self-referential hierarchies.
405 Perl_sv_clean_all(pTHX)
408 PL_in_clean_all = TRUE;
409 cleaned = visit(do_clean_all);
410 PL_in_clean_all = FALSE;
415 =for apidoc sv_free_arenas
417 Deallocate the memory used by all arenas. Note that all the individual SV
418 heads and bodies within the arenas must already have been freed.
424 Perl_sv_free_arenas(pTHX)
428 XPV *arena, *arenanext;
430 /* Free arenas here, but be careful about fake ones. (We assume
431 contiguity of the fake ones with the corresponding real ones.) */
433 for (sva = PL_sv_arenaroot; sva; sva = svanext) {
434 svanext = (SV*) SvANY(sva);
435 while (svanext && SvFAKE(svanext))
436 svanext = (SV*) SvANY(svanext);
439 Safefree((void *)sva);
442 for (arena = PL_xiv_arenaroot; arena; arena = arenanext) {
443 arenanext = (XPV*)arena->xpv_pv;
446 PL_xiv_arenaroot = 0;
448 for (arena = PL_xnv_arenaroot; arena; arena = arenanext) {
449 arenanext = (XPV*)arena->xpv_pv;
452 PL_xnv_arenaroot = 0;
454 for (arena = PL_xrv_arenaroot; arena; arena = arenanext) {
455 arenanext = (XPV*)arena->xpv_pv;
458 PL_xrv_arenaroot = 0;
460 for (arena = PL_xpv_arenaroot; arena; arena = arenanext) {
461 arenanext = (XPV*)arena->xpv_pv;
464 PL_xpv_arenaroot = 0;
466 for (arena = (XPV*)PL_xpviv_arenaroot; arena; arena = arenanext) {
467 arenanext = (XPV*)arena->xpv_pv;
470 PL_xpviv_arenaroot = 0;
472 for (arena = (XPV*)PL_xpvnv_arenaroot; arena; arena = arenanext) {
473 arenanext = (XPV*)arena->xpv_pv;
476 PL_xpvnv_arenaroot = 0;
478 for (arena = (XPV*)PL_xpvcv_arenaroot; arena; arena = arenanext) {
479 arenanext = (XPV*)arena->xpv_pv;
482 PL_xpvcv_arenaroot = 0;
484 for (arena = (XPV*)PL_xpvav_arenaroot; arena; arena = arenanext) {
485 arenanext = (XPV*)arena->xpv_pv;
488 PL_xpvav_arenaroot = 0;
490 for (arena = (XPV*)PL_xpvhv_arenaroot; arena; arena = arenanext) {
491 arenanext = (XPV*)arena->xpv_pv;
494 PL_xpvhv_arenaroot = 0;
496 for (arena = (XPV*)PL_xpvmg_arenaroot; arena; arena = arenanext) {
497 arenanext = (XPV*)arena->xpv_pv;
500 PL_xpvmg_arenaroot = 0;
502 for (arena = (XPV*)PL_xpvlv_arenaroot; arena; arena = arenanext) {
503 arenanext = (XPV*)arena->xpv_pv;
506 PL_xpvlv_arenaroot = 0;
508 for (arena = (XPV*)PL_xpvbm_arenaroot; arena; arena = arenanext) {
509 arenanext = (XPV*)arena->xpv_pv;
512 PL_xpvbm_arenaroot = 0;
514 for (arena = (XPV*)PL_he_arenaroot; arena; arena = arenanext) {
515 arenanext = (XPV*)arena->xpv_pv;
521 Safefree(PL_nice_chunk);
522 PL_nice_chunk = Nullch;
523 PL_nice_chunk_size = 0;
529 =for apidoc report_uninit
531 Print appropriate "Use of uninitialized variable" warning
537 Perl_report_uninit(pTHX)
540 Perl_warner(aTHX_ WARN_UNINITIALIZED, PL_warn_uninit,
541 " in ", PL_op_desc[PL_op->op_type]);
543 Perl_warner(aTHX_ WARN_UNINITIALIZED, PL_warn_uninit, "", "");
546 /* grab a new IV body from the free list, allocating more if necessary */
557 * See comment in more_xiv() -- RAM.
559 PL_xiv_root = *(IV**)xiv;
561 return (XPVIV*)((char*)xiv - STRUCT_OFFSET(XPVIV, xiv_iv));
564 /* return an IV body to the free list */
567 S_del_xiv(pTHX_ XPVIV *p)
569 IV* xiv = (IV*)((char*)(p) + STRUCT_OFFSET(XPVIV, xiv_iv));
571 *(IV**)xiv = PL_xiv_root;
576 /* allocate another arena's worth of IV bodies */
584 New(705, ptr, 1008/sizeof(XPV), XPV);
585 ptr->xpv_pv = (char*)PL_xiv_arenaroot; /* linked list of xiv arenas */
586 PL_xiv_arenaroot = ptr; /* to keep Purify happy */
589 xivend = &xiv[1008 / sizeof(IV) - 1];
590 xiv += (sizeof(XPV) - 1) / sizeof(IV) + 1; /* fudge by size of XPV */
592 while (xiv < xivend) {
593 *(IV**)xiv = (IV *)(xiv + 1);
599 /* grab a new NV body from the free list, allocating more if necessary */
609 PL_xnv_root = *(NV**)xnv;
611 return (XPVNV*)((char*)xnv - STRUCT_OFFSET(XPVNV, xnv_nv));
614 /* return an NV body to the free list */
617 S_del_xnv(pTHX_ XPVNV *p)
619 NV* xnv = (NV*)((char*)(p) + STRUCT_OFFSET(XPVNV, xnv_nv));
621 *(NV**)xnv = PL_xnv_root;
626 /* allocate another arena's worth of NV bodies */
634 New(711, ptr, 1008/sizeof(XPV), XPV);
635 ptr->xpv_pv = (char*)PL_xnv_arenaroot;
636 PL_xnv_arenaroot = ptr;
639 xnvend = &xnv[1008 / sizeof(NV) - 1];
640 xnv += (sizeof(XPVIV) - 1) / sizeof(NV) + 1; /* fudge by sizeof XPVIV */
642 while (xnv < xnvend) {
643 *(NV**)xnv = (NV*)(xnv + 1);
649 /* grab a new struct xrv from the free list, allocating more if necessary */
659 PL_xrv_root = (XRV*)xrv->xrv_rv;
664 /* return a struct xrv to the free list */
667 S_del_xrv(pTHX_ XRV *p)
670 p->xrv_rv = (SV*)PL_xrv_root;
675 /* allocate another arena's worth of struct xrv */
681 register XRV* xrvend;
683 New(712, ptr, 1008/sizeof(XPV), XPV);
684 ptr->xpv_pv = (char*)PL_xrv_arenaroot;
685 PL_xrv_arenaroot = ptr;
688 xrvend = &xrv[1008 / sizeof(XRV) - 1];
689 xrv += (sizeof(XPV) - 1) / sizeof(XRV) + 1;
691 while (xrv < xrvend) {
692 xrv->xrv_rv = (SV*)(xrv + 1);
698 /* grab a new struct xpv from the free list, allocating more if necessary */
708 PL_xpv_root = (XPV*)xpv->xpv_pv;
713 /* return a struct xpv to the free list */
716 S_del_xpv(pTHX_ XPV *p)
719 p->xpv_pv = (char*)PL_xpv_root;
724 /* allocate another arena's worth of struct xpv */
730 register XPV* xpvend;
731 New(713, xpv, 1008/sizeof(XPV), XPV);
732 xpv->xpv_pv = (char*)PL_xpv_arenaroot;
733 PL_xpv_arenaroot = xpv;
735 xpvend = &xpv[1008 / sizeof(XPV) - 1];
737 while (xpv < xpvend) {
738 xpv->xpv_pv = (char*)(xpv + 1);
744 /* grab a new struct xpviv from the free list, allocating more if necessary */
753 xpviv = PL_xpviv_root;
754 PL_xpviv_root = (XPVIV*)xpviv->xpv_pv;
759 /* return a struct xpviv to the free list */
762 S_del_xpviv(pTHX_ XPVIV *p)
765 p->xpv_pv = (char*)PL_xpviv_root;
770 /* allocate another arena's worth of struct xpviv */
775 register XPVIV* xpviv;
776 register XPVIV* xpvivend;
777 New(714, xpviv, 1008/sizeof(XPVIV), XPVIV);
778 xpviv->xpv_pv = (char*)PL_xpviv_arenaroot;
779 PL_xpviv_arenaroot = xpviv;
781 xpvivend = &xpviv[1008 / sizeof(XPVIV) - 1];
782 PL_xpviv_root = ++xpviv;
783 while (xpviv < xpvivend) {
784 xpviv->xpv_pv = (char*)(xpviv + 1);
790 /* grab a new struct xpvnv from the free list, allocating more if necessary */
799 xpvnv = PL_xpvnv_root;
800 PL_xpvnv_root = (XPVNV*)xpvnv->xpv_pv;
805 /* return a struct xpvnv to the free list */
808 S_del_xpvnv(pTHX_ XPVNV *p)
811 p->xpv_pv = (char*)PL_xpvnv_root;
816 /* allocate another arena's worth of struct xpvnv */
821 register XPVNV* xpvnv;
822 register XPVNV* xpvnvend;
823 New(715, xpvnv, 1008/sizeof(XPVNV), XPVNV);
824 xpvnv->xpv_pv = (char*)PL_xpvnv_arenaroot;
825 PL_xpvnv_arenaroot = xpvnv;
827 xpvnvend = &xpvnv[1008 / sizeof(XPVNV) - 1];
828 PL_xpvnv_root = ++xpvnv;
829 while (xpvnv < xpvnvend) {
830 xpvnv->xpv_pv = (char*)(xpvnv + 1);
836 /* grab a new struct xpvcv from the free list, allocating more if necessary */
845 xpvcv = PL_xpvcv_root;
846 PL_xpvcv_root = (XPVCV*)xpvcv->xpv_pv;
851 /* return a struct xpvcv to the free list */
854 S_del_xpvcv(pTHX_ XPVCV *p)
857 p->xpv_pv = (char*)PL_xpvcv_root;
862 /* allocate another arena's worth of struct xpvcv */
867 register XPVCV* xpvcv;
868 register XPVCV* xpvcvend;
869 New(716, xpvcv, 1008/sizeof(XPVCV), XPVCV);
870 xpvcv->xpv_pv = (char*)PL_xpvcv_arenaroot;
871 PL_xpvcv_arenaroot = xpvcv;
873 xpvcvend = &xpvcv[1008 / sizeof(XPVCV) - 1];
874 PL_xpvcv_root = ++xpvcv;
875 while (xpvcv < xpvcvend) {
876 xpvcv->xpv_pv = (char*)(xpvcv + 1);
882 /* grab a new struct xpvav from the free list, allocating more if necessary */
891 xpvav = PL_xpvav_root;
892 PL_xpvav_root = (XPVAV*)xpvav->xav_array;
897 /* return a struct xpvav to the free list */
900 S_del_xpvav(pTHX_ XPVAV *p)
903 p->xav_array = (char*)PL_xpvav_root;
908 /* allocate another arena's worth of struct xpvav */
913 register XPVAV* xpvav;
914 register XPVAV* xpvavend;
915 New(717, xpvav, 1008/sizeof(XPVAV), XPVAV);
916 xpvav->xav_array = (char*)PL_xpvav_arenaroot;
917 PL_xpvav_arenaroot = xpvav;
919 xpvavend = &xpvav[1008 / sizeof(XPVAV) - 1];
920 PL_xpvav_root = ++xpvav;
921 while (xpvav < xpvavend) {
922 xpvav->xav_array = (char*)(xpvav + 1);
925 xpvav->xav_array = 0;
928 /* grab a new struct xpvhv from the free list, allocating more if necessary */
937 xpvhv = PL_xpvhv_root;
938 PL_xpvhv_root = (XPVHV*)xpvhv->xhv_array;
943 /* return a struct xpvhv to the free list */
946 S_del_xpvhv(pTHX_ XPVHV *p)
949 p->xhv_array = (char*)PL_xpvhv_root;
954 /* allocate another arena's worth of struct xpvhv */
959 register XPVHV* xpvhv;
960 register XPVHV* xpvhvend;
961 New(718, xpvhv, 1008/sizeof(XPVHV), XPVHV);
962 xpvhv->xhv_array = (char*)PL_xpvhv_arenaroot;
963 PL_xpvhv_arenaroot = xpvhv;
965 xpvhvend = &xpvhv[1008 / sizeof(XPVHV) - 1];
966 PL_xpvhv_root = ++xpvhv;
967 while (xpvhv < xpvhvend) {
968 xpvhv->xhv_array = (char*)(xpvhv + 1);
971 xpvhv->xhv_array = 0;
974 /* grab a new struct xpvmg from the free list, allocating more if necessary */
983 xpvmg = PL_xpvmg_root;
984 PL_xpvmg_root = (XPVMG*)xpvmg->xpv_pv;
989 /* return a struct xpvmg to the free list */
992 S_del_xpvmg(pTHX_ XPVMG *p)
995 p->xpv_pv = (char*)PL_xpvmg_root;
1000 /* allocate another arena's worth of struct xpvmg */
1005 register XPVMG* xpvmg;
1006 register XPVMG* xpvmgend;
1007 New(719, xpvmg, 1008/sizeof(XPVMG), XPVMG);
1008 xpvmg->xpv_pv = (char*)PL_xpvmg_arenaroot;
1009 PL_xpvmg_arenaroot = xpvmg;
1011 xpvmgend = &xpvmg[1008 / sizeof(XPVMG) - 1];
1012 PL_xpvmg_root = ++xpvmg;
1013 while (xpvmg < xpvmgend) {
1014 xpvmg->xpv_pv = (char*)(xpvmg + 1);
1020 /* grab a new struct xpvlv from the free list, allocating more if necessary */
1029 xpvlv = PL_xpvlv_root;
1030 PL_xpvlv_root = (XPVLV*)xpvlv->xpv_pv;
1035 /* return a struct xpvlv to the free list */
1038 S_del_xpvlv(pTHX_ XPVLV *p)
1041 p->xpv_pv = (char*)PL_xpvlv_root;
1046 /* allocate another arena's worth of struct xpvlv */
1051 register XPVLV* xpvlv;
1052 register XPVLV* xpvlvend;
1053 New(720, xpvlv, 1008/sizeof(XPVLV), XPVLV);
1054 xpvlv->xpv_pv = (char*)PL_xpvlv_arenaroot;
1055 PL_xpvlv_arenaroot = xpvlv;
1057 xpvlvend = &xpvlv[1008 / sizeof(XPVLV) - 1];
1058 PL_xpvlv_root = ++xpvlv;
1059 while (xpvlv < xpvlvend) {
1060 xpvlv->xpv_pv = (char*)(xpvlv + 1);
1066 /* grab a new struct xpvbm from the free list, allocating more if necessary */
1075 xpvbm = PL_xpvbm_root;
1076 PL_xpvbm_root = (XPVBM*)xpvbm->xpv_pv;
1081 /* return a struct xpvbm to the free list */
1084 S_del_xpvbm(pTHX_ XPVBM *p)
1087 p->xpv_pv = (char*)PL_xpvbm_root;
1092 /* allocate another arena's worth of struct xpvbm */
1097 register XPVBM* xpvbm;
1098 register XPVBM* xpvbmend;
1099 New(721, xpvbm, 1008/sizeof(XPVBM), XPVBM);
1100 xpvbm->xpv_pv = (char*)PL_xpvbm_arenaroot;
1101 PL_xpvbm_arenaroot = xpvbm;
1103 xpvbmend = &xpvbm[1008 / sizeof(XPVBM) - 1];
1104 PL_xpvbm_root = ++xpvbm;
1105 while (xpvbm < xpvbmend) {
1106 xpvbm->xpv_pv = (char*)(xpvbm + 1);
1113 # define my_safemalloc(s) (void*)safexmalloc(717,s)
1114 # define my_safefree(p) safexfree((char*)p)
1116 # define my_safemalloc(s) (void*)safemalloc(s)
1117 # define my_safefree(p) safefree((char*)p)
1122 #define new_XIV() my_safemalloc(sizeof(XPVIV))
1123 #define del_XIV(p) my_safefree(p)
1125 #define new_XNV() my_safemalloc(sizeof(XPVNV))
1126 #define del_XNV(p) my_safefree(p)
1128 #define new_XRV() my_safemalloc(sizeof(XRV))
1129 #define del_XRV(p) my_safefree(p)
1131 #define new_XPV() my_safemalloc(sizeof(XPV))
1132 #define del_XPV(p) my_safefree(p)
1134 #define new_XPVIV() my_safemalloc(sizeof(XPVIV))
1135 #define del_XPVIV(p) my_safefree(p)
1137 #define new_XPVNV() my_safemalloc(sizeof(XPVNV))
1138 #define del_XPVNV(p) my_safefree(p)
1140 #define new_XPVCV() my_safemalloc(sizeof(XPVCV))
1141 #define del_XPVCV(p) my_safefree(p)
1143 #define new_XPVAV() my_safemalloc(sizeof(XPVAV))
1144 #define del_XPVAV(p) my_safefree(p)
1146 #define new_XPVHV() my_safemalloc(sizeof(XPVHV))
1147 #define del_XPVHV(p) my_safefree(p)
1149 #define new_XPVMG() my_safemalloc(sizeof(XPVMG))
1150 #define del_XPVMG(p) my_safefree(p)
1152 #define new_XPVLV() my_safemalloc(sizeof(XPVLV))
1153 #define del_XPVLV(p) my_safefree(p)
1155 #define new_XPVBM() my_safemalloc(sizeof(XPVBM))
1156 #define del_XPVBM(p) my_safefree(p)
1160 #define new_XIV() (void*)new_xiv()
1161 #define del_XIV(p) del_xiv((XPVIV*) p)
1163 #define new_XNV() (void*)new_xnv()
1164 #define del_XNV(p) del_xnv((XPVNV*) p)
1166 #define new_XRV() (void*)new_xrv()
1167 #define del_XRV(p) del_xrv((XRV*) p)
1169 #define new_XPV() (void*)new_xpv()
1170 #define del_XPV(p) del_xpv((XPV *)p)
1172 #define new_XPVIV() (void*)new_xpviv()
1173 #define del_XPVIV(p) del_xpviv((XPVIV *)p)
1175 #define new_XPVNV() (void*)new_xpvnv()
1176 #define del_XPVNV(p) del_xpvnv((XPVNV *)p)
1178 #define new_XPVCV() (void*)new_xpvcv()
1179 #define del_XPVCV(p) del_xpvcv((XPVCV *)p)
1181 #define new_XPVAV() (void*)new_xpvav()
1182 #define del_XPVAV(p) del_xpvav((XPVAV *)p)
1184 #define new_XPVHV() (void*)new_xpvhv()
1185 #define del_XPVHV(p) del_xpvhv((XPVHV *)p)
1187 #define new_XPVMG() (void*)new_xpvmg()
1188 #define del_XPVMG(p) del_xpvmg((XPVMG *)p)
1190 #define new_XPVLV() (void*)new_xpvlv()
1191 #define del_XPVLV(p) del_xpvlv((XPVLV *)p)
1193 #define new_XPVBM() (void*)new_xpvbm()
1194 #define del_XPVBM(p) del_xpvbm((XPVBM *)p)
1198 #define new_XPVGV() my_safemalloc(sizeof(XPVGV))
1199 #define del_XPVGV(p) my_safefree(p)
1201 #define new_XPVFM() my_safemalloc(sizeof(XPVFM))
1202 #define del_XPVFM(p) my_safefree(p)
1204 #define new_XPVIO() my_safemalloc(sizeof(XPVIO))
1205 #define del_XPVIO(p) my_safefree(p)
1208 =for apidoc sv_upgrade
1210 Upgrade an SV to a more complex form. Generally adds a new body type to the
1211 SV, then copies across as much information as possible from the old body.
1212 You generally want to use the C<SvUPGRADE> macro wrapper. See also C<svtype>.
1218 Perl_sv_upgrade(pTHX_ register SV *sv, U32 mt)
1228 if (mt != SVt_PV && SvREADONLY(sv) && SvFAKE(sv)) {
1229 sv_force_normal(sv);
1232 if (SvTYPE(sv) == mt)
1236 (void)SvOOK_off(sv);
1238 switch (SvTYPE(sv)) {
1259 else if (mt < SVt_PVIV)
1276 pv = (char*)SvRV(sv);
1296 else if (mt == SVt_NV)
1307 del_XPVIV(SvANY(sv));
1317 del_XPVNV(SvANY(sv));
1325 magic = SvMAGIC(sv);
1326 stash = SvSTASH(sv);
1327 del_XPVMG(SvANY(sv));
1330 Perl_croak(aTHX_ "Can't upgrade that kind of scalar");
1335 Perl_croak(aTHX_ "Can't upgrade to undef");
1337 SvANY(sv) = new_XIV();
1341 SvANY(sv) = new_XNV();
1345 SvANY(sv) = new_XRV();
1349 SvANY(sv) = new_XPV();
1355 SvANY(sv) = new_XPVIV();
1365 SvANY(sv) = new_XPVNV();
1373 SvANY(sv) = new_XPVMG();
1379 SvMAGIC(sv) = magic;
1380 SvSTASH(sv) = stash;
1383 SvANY(sv) = new_XPVLV();
1389 SvMAGIC(sv) = magic;
1390 SvSTASH(sv) = stash;
1397 SvANY(sv) = new_XPVAV();
1405 SvMAGIC(sv) = magic;
1406 SvSTASH(sv) = stash;
1412 SvANY(sv) = new_XPVHV();
1420 SvMAGIC(sv) = magic;
1421 SvSTASH(sv) = stash;
1428 SvANY(sv) = new_XPVCV();
1429 Zero(SvANY(sv), 1, XPVCV);
1435 SvMAGIC(sv) = magic;
1436 SvSTASH(sv) = stash;
1439 SvANY(sv) = new_XPVGV();
1445 SvMAGIC(sv) = magic;
1446 SvSTASH(sv) = stash;
1454 SvANY(sv) = new_XPVBM();
1460 SvMAGIC(sv) = magic;
1461 SvSTASH(sv) = stash;
1467 SvANY(sv) = new_XPVFM();
1468 Zero(SvANY(sv), 1, XPVFM);
1474 SvMAGIC(sv) = magic;
1475 SvSTASH(sv) = stash;
1478 SvANY(sv) = new_XPVIO();
1479 Zero(SvANY(sv), 1, XPVIO);
1485 SvMAGIC(sv) = magic;
1486 SvSTASH(sv) = stash;
1487 IoPAGE_LEN(sv) = 60;
1490 SvFLAGS(sv) &= ~SVTYPEMASK;
1496 =for apidoc sv_backoff
1498 Remove any string offset. You should normally use the C<SvOOK_off> macro
1505 Perl_sv_backoff(pTHX_ register SV *sv)
1509 char *s = SvPVX(sv);
1510 SvLEN(sv) += SvIVX(sv);
1511 SvPVX(sv) -= SvIVX(sv);
1513 Move(s, SvPVX(sv), SvCUR(sv)+1, char);
1515 SvFLAGS(sv) &= ~SVf_OOK;
1522 Expands the character buffer in the SV. If necessary, uses C<sv_unref> and
1523 upgrades the SV to C<SVt_PV>. Returns a pointer to the character buffer.
1524 Use the C<SvGROW> wrapper instead.
1530 Perl_sv_grow(pTHX_ register SV *sv, register STRLEN newlen)
1534 #ifdef HAS_64K_LIMIT
1535 if (newlen >= 0x10000) {
1536 PerlIO_printf(Perl_debug_log,
1537 "Allocation too large: %"UVxf"\n", (UV)newlen);
1540 #endif /* HAS_64K_LIMIT */
1543 if (SvTYPE(sv) < SVt_PV) {
1544 sv_upgrade(sv, SVt_PV);
1547 else if (SvOOK(sv)) { /* pv is offset? */
1550 if (newlen > SvLEN(sv))
1551 newlen += 10 * (newlen - SvCUR(sv)); /* avoid copy each time */
1552 #ifdef HAS_64K_LIMIT
1553 if (newlen >= 0x10000)
1559 if (newlen > SvLEN(sv)) { /* need more room? */
1560 if (SvLEN(sv) && s) {
1561 #if defined(MYMALLOC) && !defined(LEAKTEST)
1562 STRLEN l = malloced_size((void*)SvPVX(sv));
1568 Renew(s,newlen,char);
1571 New(703,s,newlen,char);
1573 SvLEN_set(sv, newlen);
1579 =for apidoc sv_setiv
1581 Copies an integer into the given SV, upgrading first if necessary.
1582 Does not handle 'set' magic. See also C<sv_setiv_mg>.
1588 Perl_sv_setiv(pTHX_ register SV *sv, IV i)
1590 SV_CHECK_THINKFIRST(sv);
1591 switch (SvTYPE(sv)) {
1593 sv_upgrade(sv, SVt_IV);
1596 sv_upgrade(sv, SVt_PVNV);
1600 sv_upgrade(sv, SVt_PVIV);
1609 Perl_croak(aTHX_ "Can't coerce %s to integer in %s", sv_reftype(sv,0),
1610 PL_op_desc[PL_op->op_type]);
1612 (void)SvIOK_only(sv); /* validate number */
1618 =for apidoc sv_setiv_mg
1620 Like C<sv_setiv>, but also handles 'set' magic.
1626 Perl_sv_setiv_mg(pTHX_ register SV *sv, IV i)
1633 =for apidoc sv_setuv
1635 Copies an unsigned integer into the given SV, upgrading first if necessary.
1636 Does not handle 'set' magic. See also C<sv_setuv_mg>.
1642 Perl_sv_setuv(pTHX_ register SV *sv, UV u)
1644 /* With these two if statements:
1645 u=1.49 s=0.52 cu=72.49 cs=10.64 scripts=270 tests=20865
1648 u=1.35 s=0.47 cu=73.45 cs=11.43 scripts=270 tests=20865
1650 If you wish to remove them, please benchmark to see what the effect is
1652 if (u <= (UV)IV_MAX) {
1653 sv_setiv(sv, (IV)u);
1662 =for apidoc sv_setuv_mg
1664 Like C<sv_setuv>, but also handles 'set' magic.
1670 Perl_sv_setuv_mg(pTHX_ register SV *sv, UV u)
1672 /* With these two if statements:
1673 u=1.49 s=0.52 cu=72.49 cs=10.64 scripts=270 tests=20865
1676 u=1.35 s=0.47 cu=73.45 cs=11.43 scripts=270 tests=20865
1678 If you wish to remove them, please benchmark to see what the effect is
1680 if (u <= (UV)IV_MAX) {
1681 sv_setiv(sv, (IV)u);
1691 =for apidoc sv_setnv
1693 Copies a double into the given SV, upgrading first if necessary.
1694 Does not handle 'set' magic. See also C<sv_setnv_mg>.
1700 Perl_sv_setnv(pTHX_ register SV *sv, NV num)
1702 SV_CHECK_THINKFIRST(sv);
1703 switch (SvTYPE(sv)) {
1706 sv_upgrade(sv, SVt_NV);
1711 sv_upgrade(sv, SVt_PVNV);
1720 Perl_croak(aTHX_ "Can't coerce %s to number in %s", sv_reftype(sv,0),
1721 PL_op_name[PL_op->op_type]);
1724 (void)SvNOK_only(sv); /* validate number */
1729 =for apidoc sv_setnv_mg
1731 Like C<sv_setnv>, but also handles 'set' magic.
1737 Perl_sv_setnv_mg(pTHX_ register SV *sv, NV num)
1743 /* Print an "isn't numeric" warning, using a cleaned-up,
1744 * printable version of the offending string
1748 S_not_a_number(pTHX_ SV *sv)
1752 char *limit = tmpbuf + sizeof(tmpbuf) - 8;
1753 /* each *s can expand to 4 chars + "...\0",
1754 i.e. need room for 8 chars */
1757 for (s = SvPVX(sv), end = s + SvCUR(sv); s < end && d < limit; s++) {
1759 if (ch & 128 && !isPRINT_LC(ch)) {
1768 else if (ch == '\r') {
1772 else if (ch == '\f') {
1776 else if (ch == '\\') {
1780 else if (ch == '\0') {
1784 else if (isPRINT_LC(ch))
1799 Perl_warner(aTHX_ WARN_NUMERIC,
1800 "Argument \"%s\" isn't numeric in %s", tmpbuf,
1801 PL_op_desc[PL_op->op_type]);
1803 Perl_warner(aTHX_ WARN_NUMERIC,
1804 "Argument \"%s\" isn't numeric", tmpbuf);
1808 =for apidoc looks_like_number
1810 Test if the content of an SV looks like a number (or is a number).
1811 C<Inf> and C<Infinity> are treated as numbers (so will not issue a
1812 non-numeric warning), even if your atof() doesn't grok them.
1818 Perl_looks_like_number(pTHX_ SV *sv)
1820 register char *sbegin;
1827 else if (SvPOKp(sv))
1828 sbegin = SvPV(sv, len);
1830 return 1; /* Historic. Wrong? */
1831 return grok_number(sbegin, len, NULL);
1834 /* Actually, ISO C leaves conversion of UV to IV undefined, but
1835 until proven guilty, assume that things are not that bad... */
1840 As 64 bit platforms often have an NV that doesn't preserve all bits of
1841 an IV (an assumption perl has been based on to date) it becomes necessary
1842 to remove the assumption that the NV always carries enough precision to
1843 recreate the IV whenever needed, and that the NV is the canonical form.
1844 Instead, IV/UV and NV need to be given equal rights. So as to not lose
1845 precision as a side effect of conversion (which would lead to insanity
1846 and the dragon(s) in t/op/numconvert.t getting very angry) the intent is
1847 1) to distinguish between IV/UV/NV slots that have cached a valid
1848 conversion where precision was lost and IV/UV/NV slots that have a
1849 valid conversion which has lost no precision
1850 2) to ensure that if a numeric conversion to one form is requested that
1851 would lose precision, the precise conversion (or differently
1852 imprecise conversion) is also performed and cached, to prevent
1853 requests for different numeric formats on the same SV causing
1854 lossy conversion chains. (lossless conversion chains are perfectly
1859 SvIOKp is true if the IV slot contains a valid value
1860 SvIOK is true only if the IV value is accurate (UV if SvIOK_UV true)
1861 SvNOKp is true if the NV slot contains a valid value
1862 SvNOK is true only if the NV value is accurate
1865 while converting from PV to NV, check to see if converting that NV to an
1866 IV(or UV) would lose accuracy over a direct conversion from PV to
1867 IV(or UV). If it would, cache both conversions, return NV, but mark
1868 SV as IOK NOKp (ie not NOK).
1870 While converting from PV to IV, check to see if converting that IV to an
1871 NV would lose accuracy over a direct conversion from PV to NV. If it
1872 would, cache both conversions, flag similarly.
1874 Before, the SV value "3.2" could become NV=3.2 IV=3 NOK, IOK quite
1875 correctly because if IV & NV were set NV *always* overruled.
1876 Now, "3.2" will become NV=3.2 IV=3 NOK, IOKp, because the flag's meaning
1877 changes - now IV and NV together means that the two are interchangeable:
1878 SvIVX == (IV) SvNVX && SvNVX == (NV) SvIVX;
1880 The benefit of this is that operations such as pp_add know that if
1881 SvIOK is true for both left and right operands, then integer addition
1882 can be used instead of floating point (for cases where the result won't
1883 overflow). Before, floating point was always used, which could lead to
1884 loss of precision compared with integer addition.
1886 * making IV and NV equal status should make maths accurate on 64 bit
1888 * may speed up maths somewhat if pp_add and friends start to use
1889 integers when possible instead of fp. (Hopefully the overhead in
1890 looking for SvIOK and checking for overflow will not outweigh the
1891 fp to integer speedup)
1892 * will slow down integer operations (callers of SvIV) on "inaccurate"
1893 values, as the change from SvIOK to SvIOKp will cause a call into
1894 sv_2iv each time rather than a macro access direct to the IV slot
1895 * should speed up number->string conversion on integers as IV is
1896 favoured when IV and NV are equally accurate
1898 ####################################################################
1899 You had better be using SvIOK_notUV if you want an IV for arithmetic:
1900 SvIOK is true if (IV or UV), so you might be getting (IV)SvUV.
1901 On the other hand, SvUOK is true iff UV.
1902 ####################################################################
1904 Your mileage will vary depending your CPU's relative fp to integer
1908 #ifndef NV_PRESERVES_UV
1909 # define IS_NUMBER_UNDERFLOW_IV 1
1910 # define IS_NUMBER_UNDERFLOW_UV 2
1911 # define IS_NUMBER_IV_AND_UV 2
1912 # define IS_NUMBER_OVERFLOW_IV 4
1913 # define IS_NUMBER_OVERFLOW_UV 5
1915 /* sv_2iuv_non_preserve(): private routine for use by sv_2iv() and sv_2uv() */
1917 /* For sv_2nv these three cases are "SvNOK and don't bother casting" */
1919 S_sv_2iuv_non_preserve(pTHX_ register SV *sv, I32 numtype)
1921 DEBUG_c(PerlIO_printf(Perl_debug_log,"sv_2iuv_non '%s', IV=0x%"UVxf" NV=%g inttype=%"UVXf"\n", SvPVX(sv), SvIVX(sv), SvNVX(sv), (UV)numtype));
1922 if (SvNVX(sv) < (NV)IV_MIN) {
1923 (void)SvIOKp_on(sv);
1926 return IS_NUMBER_UNDERFLOW_IV;
1928 if (SvNVX(sv) > (NV)UV_MAX) {
1929 (void)SvIOKp_on(sv);
1933 return IS_NUMBER_OVERFLOW_UV;
1935 (void)SvIOKp_on(sv);
1937 /* Can't use strtol etc to convert this string. (See truth table in
1939 if (SvNVX(sv) <= (UV)IV_MAX) {
1940 SvIVX(sv) = I_V(SvNVX(sv));
1941 if ((NV)(SvIVX(sv)) == SvNVX(sv)) {
1942 SvIOK_on(sv); /* Integer is precise. NOK, IOK */
1944 /* Integer is imprecise. NOK, IOKp */
1946 return SvNVX(sv) < 0 ? IS_NUMBER_UNDERFLOW_UV : IS_NUMBER_IV_AND_UV;
1949 SvUVX(sv) = U_V(SvNVX(sv));
1950 if ((NV)(SvUVX(sv)) == SvNVX(sv)) {
1951 if (SvUVX(sv) == UV_MAX) {
1952 /* As we know that NVs don't preserve UVs, UV_MAX cannot
1953 possibly be preserved by NV. Hence, it must be overflow.
1955 return IS_NUMBER_OVERFLOW_UV;
1957 SvIOK_on(sv); /* Integer is precise. NOK, UOK */
1959 /* Integer is imprecise. NOK, IOKp */
1961 return IS_NUMBER_OVERFLOW_IV;
1963 #endif /* !NV_PRESERVES_UV*/
1968 Return the integer value of an SV, doing any necessary string conversion,
1969 magic etc. Normally used via the C<SvIV(sv)> and C<SvIVx(sv)> macros.
1975 Perl_sv_2iv(pTHX_ register SV *sv)
1979 if (SvGMAGICAL(sv)) {
1984 return I_V(SvNVX(sv));
1986 if (SvPOKp(sv) && SvLEN(sv))
1989 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
1990 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
1996 if (SvTHINKFIRST(sv)) {
1999 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv,numer)) &&
2000 (SvTYPE(tmpstr) != SVt_RV || (SvRV(tmpstr) != SvRV(sv))))
2001 return SvIV(tmpstr);
2002 return PTR2IV(SvRV(sv));
2004 if (SvREADONLY(sv) && SvFAKE(sv)) {
2005 sv_force_normal(sv);
2007 if (SvREADONLY(sv) && !SvOK(sv)) {
2008 if (ckWARN(WARN_UNINITIALIZED))
2015 return (IV)(SvUVX(sv));
2022 /* erm. not sure. *should* never get NOKp (without NOK) from sv_2nv
2023 * without also getting a cached IV/UV from it at the same time
2024 * (ie PV->NV conversion should detect loss of accuracy and cache
2025 * IV or UV at same time to avoid this. NWC */
2027 if (SvTYPE(sv) == SVt_NV)
2028 sv_upgrade(sv, SVt_PVNV);
2030 (void)SvIOKp_on(sv); /* Must do this first, to clear any SvOOK */
2031 /* < not <= as for NV doesn't preserve UV, ((NV)IV_MAX+1) will almost
2032 certainly cast into the IV range at IV_MAX, whereas the correct
2033 answer is the UV IV_MAX +1. Hence < ensures that dodgy boundary
2035 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2036 SvIVX(sv) = I_V(SvNVX(sv));
2037 if (SvNVX(sv) == (NV) SvIVX(sv)
2038 #ifndef NV_PRESERVES_UV
2039 && (((UV)1 << NV_PRESERVES_UV_BITS) >
2040 (UV)(SvIVX(sv) > 0 ? SvIVX(sv) : -SvIVX(sv)))
2041 /* Don't flag it as "accurately an integer" if the number
2042 came from a (by definition imprecise) NV operation, and
2043 we're outside the range of NV integer precision */
2046 SvIOK_on(sv); /* Can this go wrong with rounding? NWC */
2047 DEBUG_c(PerlIO_printf(Perl_debug_log,
2048 "0x%"UVxf" iv(%g => %"IVdf") (precise)\n",
2054 /* IV not precise. No need to convert from PV, as NV
2055 conversion would already have cached IV if it detected
2056 that PV->IV would be better than PV->NV->IV
2057 flags already correct - don't set public IOK. */
2058 DEBUG_c(PerlIO_printf(Perl_debug_log,
2059 "0x%"UVxf" iv(%g => %"IVdf") (imprecise)\n",
2064 /* Can the above go wrong if SvIVX == IV_MIN and SvNVX < IV_MIN,
2065 but the cast (NV)IV_MIN rounds to a the value less (more
2066 negative) than IV_MIN which happens to be equal to SvNVX ??
2067 Analogous to 0xFFFFFFFFFFFFFFFF rounding up to NV (2**64) and
2068 NV rounding back to 0xFFFFFFFFFFFFFFFF, so UVX == UV(NVX) and
2069 (NV)UVX == NVX are both true, but the values differ. :-(
2070 Hopefully for 2s complement IV_MIN is something like
2071 0x8000000000000000 which will be exact. NWC */
2074 SvUVX(sv) = U_V(SvNVX(sv));
2076 (SvNVX(sv) == (NV) SvUVX(sv))
2077 #ifndef NV_PRESERVES_UV
2078 /* Make sure it's not 0xFFFFFFFFFFFFFFFF */
2079 /*&& (SvUVX(sv) != UV_MAX) irrelevant with code below */
2080 && (((UV)1 << NV_PRESERVES_UV_BITS) > SvUVX(sv))
2081 /* Don't flag it as "accurately an integer" if the number
2082 came from a (by definition imprecise) NV operation, and
2083 we're outside the range of NV integer precision */
2089 DEBUG_c(PerlIO_printf(Perl_debug_log,
2090 "0x%"UVxf" 2iv(%"UVuf" => %"IVdf") (as unsigned)\n",
2094 return (IV)SvUVX(sv);
2097 else if (SvPOKp(sv) && SvLEN(sv)) {
2099 int numtype = grok_number(SvPVX(sv), SvCUR(sv), &value);
2100 /* We want to avoid a possible problem when we cache an IV which
2101 may be later translated to an NV, and the resulting NV is not
2102 the same as the direct translation of the initial string
2103 (eg 123.456 can shortcut to the IV 123 with atol(), but we must
2104 be careful to ensure that the value with the .456 is around if the
2105 NV value is requested in the future).
2107 This means that if we cache such an IV, we need to cache the
2108 NV as well. Moreover, we trade speed for space, and do not
2109 cache the NV if we are sure it's not needed.
2112 /* SVt_PVNV is one higher than SVt_PVIV, hence this order */
2113 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2114 == IS_NUMBER_IN_UV) {
2115 /* It's defintately an integer, only upgrade to PVIV */
2116 if (SvTYPE(sv) < SVt_PVIV)
2117 sv_upgrade(sv, SVt_PVIV);
2119 } else if (SvTYPE(sv) < SVt_PVNV)
2120 sv_upgrade(sv, SVt_PVNV);
2122 /* If NV preserves UV then we only use the UV value if we know that
2123 we aren't going to call atof() below. If NVs don't preserve UVs
2124 then the value returned may have more precision than atof() will
2125 return, even though value isn't perfectly accurate. */
2126 if ((numtype & (IS_NUMBER_IN_UV
2127 #ifdef NV_PRESERVES_UV
2130 )) == IS_NUMBER_IN_UV) {
2131 /* This won't turn off the public IOK flag if it was set above */
2132 (void)SvIOKp_on(sv);
2134 if (!(numtype & IS_NUMBER_NEG)) {
2136 if (value <= (UV)IV_MAX) {
2137 SvIVX(sv) = (IV)value;
2143 /* 2s complement assumption */
2144 if (value <= (UV)IV_MIN) {
2145 SvIVX(sv) = -(IV)value;
2147 /* Too negative for an IV. This is a double upgrade, but
2148 I'm assuming it will be be rare. */
2149 if (SvTYPE(sv) < SVt_PVNV)
2150 sv_upgrade(sv, SVt_PVNV);
2154 SvNVX(sv) = -(NV)value;
2159 /* For !NV_PRESERVES_UV and IS_NUMBER_IN_UV and IS_NUMBER_NOT_INT we
2160 will be in the previous block to set the IV slot, and the next
2161 block to set the NV slot. So no else here. */
2163 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2164 != IS_NUMBER_IN_UV) {
2165 /* It wasn't an (integer that doesn't overflow the UV). */
2166 SvNVX(sv) = Atof(SvPVX(sv));
2168 if (! numtype && ckWARN(WARN_NUMERIC))
2171 #if defined(USE_LONG_DOUBLE)
2172 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2iv(%" PERL_PRIgldbl ")\n",
2173 PTR2UV(sv), SvNVX(sv)));
2175 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2iv(%g)\n",
2176 PTR2UV(sv), SvNVX(sv)));
2180 #ifdef NV_PRESERVES_UV
2181 (void)SvIOKp_on(sv);
2183 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2184 SvIVX(sv) = I_V(SvNVX(sv));
2185 if ((NV)(SvIVX(sv)) == SvNVX(sv)) {
2188 /* Integer is imprecise. NOK, IOKp */
2190 /* UV will not work better than IV */
2192 if (SvNVX(sv) > (NV)UV_MAX) {
2194 /* Integer is inaccurate. NOK, IOKp, is UV */
2198 SvUVX(sv) = U_V(SvNVX(sv));
2199 /* 0xFFFFFFFFFFFFFFFF not an issue in here */
2200 if ((NV)(SvUVX(sv)) == SvNVX(sv)) {
2204 /* Integer is imprecise. NOK, IOKp, is UV */
2210 #else /* NV_PRESERVES_UV */
2211 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2212 == (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT)) {
2213 /* The IV slot will have been set from value returned by
2214 grok_number above. The NV slot has just been set using
2217 assert (SvIOKp(sv));
2219 if (((UV)1 << NV_PRESERVES_UV_BITS) >
2220 U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))) {
2221 /* Small enough to preserve all bits. */
2222 (void)SvIOKp_on(sv);
2224 SvIVX(sv) = I_V(SvNVX(sv));
2225 if ((NV)(SvIVX(sv)) == SvNVX(sv))
2227 /* Assumption: first non-preserved integer is < IV_MAX,
2228 this NV is in the preserved range, therefore: */
2229 if (!(U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))
2231 Perl_croak(aTHX_ "sv_2iv assumed (U_V(fabs(SvNVX(sv))) < (UV)IV_MAX) but SvNVX(sv)=%g U_V is 0x%"UVxf", IV_MAX is 0x%"UVxf"\n", SvNVX(sv), U_V(SvNVX(sv)), (UV)IV_MAX);
2235 0 0 already failed to read UV.
2236 0 1 already failed to read UV.
2237 1 0 you won't get here in this case. IV/UV
2238 slot set, public IOK, Atof() unneeded.
2239 1 1 already read UV.
2240 so there's no point in sv_2iuv_non_preserve() attempting
2241 to use atol, strtol, strtoul etc. */
2242 if (sv_2iuv_non_preserve (sv, numtype)
2243 >= IS_NUMBER_OVERFLOW_IV)
2247 #endif /* NV_PRESERVES_UV */
2250 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing && !(SvFLAGS(sv) & SVs_PADTMP))
2252 if (SvTYPE(sv) < SVt_IV)
2253 /* Typically the caller expects that sv_any is not NULL now. */
2254 sv_upgrade(sv, SVt_IV);
2257 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2iv(%"IVdf")\n",
2258 PTR2UV(sv),SvIVX(sv)));
2259 return SvIsUV(sv) ? (IV)SvUVX(sv) : SvIVX(sv);
2265 Return the unsigned integer value of an SV, doing any necessary string
2266 conversion, magic etc. Normally used via the C<SvUV(sv)> and C<SvUVx(sv)>
2273 Perl_sv_2uv(pTHX_ register SV *sv)
2277 if (SvGMAGICAL(sv)) {
2282 return U_V(SvNVX(sv));
2283 if (SvPOKp(sv) && SvLEN(sv))
2286 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
2287 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
2293 if (SvTHINKFIRST(sv)) {
2296 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv,numer)) &&
2297 (SvTYPE(tmpstr) != SVt_RV || (SvRV(tmpstr) != SvRV(sv))))
2298 return SvUV(tmpstr);
2299 return PTR2UV(SvRV(sv));
2301 if (SvREADONLY(sv) && SvFAKE(sv)) {
2302 sv_force_normal(sv);
2304 if (SvREADONLY(sv) && !SvOK(sv)) {
2305 if (ckWARN(WARN_UNINITIALIZED))
2315 return (UV)SvIVX(sv);
2319 /* erm. not sure. *should* never get NOKp (without NOK) from sv_2nv
2320 * without also getting a cached IV/UV from it at the same time
2321 * (ie PV->NV conversion should detect loss of accuracy and cache
2322 * IV or UV at same time to avoid this. */
2323 /* IV-over-UV optimisation - choose to cache IV if possible */
2325 if (SvTYPE(sv) == SVt_NV)
2326 sv_upgrade(sv, SVt_PVNV);
2328 (void)SvIOKp_on(sv); /* Must do this first, to clear any SvOOK */
2329 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2330 SvIVX(sv) = I_V(SvNVX(sv));
2331 if (SvNVX(sv) == (NV) SvIVX(sv)
2332 #ifndef NV_PRESERVES_UV
2333 && (((UV)1 << NV_PRESERVES_UV_BITS) >
2334 (UV)(SvIVX(sv) > 0 ? SvIVX(sv) : -SvIVX(sv)))
2335 /* Don't flag it as "accurately an integer" if the number
2336 came from a (by definition imprecise) NV operation, and
2337 we're outside the range of NV integer precision */
2340 SvIOK_on(sv); /* Can this go wrong with rounding? NWC */
2341 DEBUG_c(PerlIO_printf(Perl_debug_log,
2342 "0x%"UVxf" uv(%g => %"IVdf") (precise)\n",
2348 /* IV not precise. No need to convert from PV, as NV
2349 conversion would already have cached IV if it detected
2350 that PV->IV would be better than PV->NV->IV
2351 flags already correct - don't set public IOK. */
2352 DEBUG_c(PerlIO_printf(Perl_debug_log,
2353 "0x%"UVxf" uv(%g => %"IVdf") (imprecise)\n",
2358 /* Can the above go wrong if SvIVX == IV_MIN and SvNVX < IV_MIN,
2359 but the cast (NV)IV_MIN rounds to a the value less (more
2360 negative) than IV_MIN which happens to be equal to SvNVX ??
2361 Analogous to 0xFFFFFFFFFFFFFFFF rounding up to NV (2**64) and
2362 NV rounding back to 0xFFFFFFFFFFFFFFFF, so UVX == UV(NVX) and
2363 (NV)UVX == NVX are both true, but the values differ. :-(
2364 Hopefully for 2s complement IV_MIN is something like
2365 0x8000000000000000 which will be exact. NWC */
2368 SvUVX(sv) = U_V(SvNVX(sv));
2370 (SvNVX(sv) == (NV) SvUVX(sv))
2371 #ifndef NV_PRESERVES_UV
2372 /* Make sure it's not 0xFFFFFFFFFFFFFFFF */
2373 /*&& (SvUVX(sv) != UV_MAX) irrelevant with code below */
2374 && (((UV)1 << NV_PRESERVES_UV_BITS) > SvUVX(sv))
2375 /* Don't flag it as "accurately an integer" if the number
2376 came from a (by definition imprecise) NV operation, and
2377 we're outside the range of NV integer precision */
2382 DEBUG_c(PerlIO_printf(Perl_debug_log,
2383 "0x%"UVxf" 2uv(%"UVuf" => %"IVdf") (as unsigned)\n",
2389 else if (SvPOKp(sv) && SvLEN(sv)) {
2391 int numtype = grok_number(SvPVX(sv), SvCUR(sv), &value);
2393 /* We want to avoid a possible problem when we cache a UV which
2394 may be later translated to an NV, and the resulting NV is not
2395 the translation of the initial data.
2397 This means that if we cache such a UV, we need to cache the
2398 NV as well. Moreover, we trade speed for space, and do not
2399 cache the NV if not needed.
2402 /* SVt_PVNV is one higher than SVt_PVIV, hence this order */
2403 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2404 == IS_NUMBER_IN_UV) {
2405 /* It's defintately an integer, only upgrade to PVIV */
2406 if (SvTYPE(sv) < SVt_PVIV)
2407 sv_upgrade(sv, SVt_PVIV);
2409 } else if (SvTYPE(sv) < SVt_PVNV)
2410 sv_upgrade(sv, SVt_PVNV);
2412 /* If NV preserves UV then we only use the UV value if we know that
2413 we aren't going to call atof() below. If NVs don't preserve UVs
2414 then the value returned may have more precision than atof() will
2415 return, even though it isn't accurate. */
2416 if ((numtype & (IS_NUMBER_IN_UV
2417 #ifdef NV_PRESERVES_UV
2420 )) == IS_NUMBER_IN_UV) {
2421 /* This won't turn off the public IOK flag if it was set above */
2422 (void)SvIOKp_on(sv);
2424 if (!(numtype & IS_NUMBER_NEG)) {
2426 if (value <= (UV)IV_MAX) {
2427 SvIVX(sv) = (IV)value;
2429 /* it didn't overflow, and it was positive. */
2434 /* 2s complement assumption */
2435 if (value <= (UV)IV_MIN) {
2436 SvIVX(sv) = -(IV)value;
2438 /* Too negative for an IV. This is a double upgrade, but
2439 I'm assuming it will be be rare. */
2440 if (SvTYPE(sv) < SVt_PVNV)
2441 sv_upgrade(sv, SVt_PVNV);
2445 SvNVX(sv) = -(NV)value;
2451 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2452 != IS_NUMBER_IN_UV) {
2453 /* It wasn't an integer, or it overflowed the UV. */
2454 SvNVX(sv) = Atof(SvPVX(sv));
2456 if (! numtype && ckWARN(WARN_NUMERIC))
2459 #if defined(USE_LONG_DOUBLE)
2460 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2uv(%" PERL_PRIgldbl ")\n",
2461 PTR2UV(sv), SvNVX(sv)));
2463 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2uv(%g)\n",
2464 PTR2UV(sv), SvNVX(sv)));
2467 #ifdef NV_PRESERVES_UV
2468 (void)SvIOKp_on(sv);
2470 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2471 SvIVX(sv) = I_V(SvNVX(sv));
2472 if ((NV)(SvIVX(sv)) == SvNVX(sv)) {
2475 /* Integer is imprecise. NOK, IOKp */
2477 /* UV will not work better than IV */
2479 if (SvNVX(sv) > (NV)UV_MAX) {
2481 /* Integer is inaccurate. NOK, IOKp, is UV */
2485 SvUVX(sv) = U_V(SvNVX(sv));
2486 /* 0xFFFFFFFFFFFFFFFF not an issue in here, NVs
2487 NV preservse UV so can do correct comparison. */
2488 if ((NV)(SvUVX(sv)) == SvNVX(sv)) {
2492 /* Integer is imprecise. NOK, IOKp, is UV */
2497 #else /* NV_PRESERVES_UV */
2498 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2499 == (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT)) {
2500 /* The UV slot will have been set from value returned by
2501 grok_number above. The NV slot has just been set using
2504 assert (SvIOKp(sv));
2506 if (((UV)1 << NV_PRESERVES_UV_BITS) >
2507 U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))) {
2508 /* Small enough to preserve all bits. */
2509 (void)SvIOKp_on(sv);
2511 SvIVX(sv) = I_V(SvNVX(sv));
2512 if ((NV)(SvIVX(sv)) == SvNVX(sv))
2514 /* Assumption: first non-preserved integer is < IV_MAX,
2515 this NV is in the preserved range, therefore: */
2516 if (!(U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))
2518 Perl_croak(aTHX_ "sv_2uv assumed (U_V(fabs(SvNVX(sv))) < (UV)IV_MAX) but SvNVX(sv)=%g U_V is 0x%"UVxf", IV_MAX is 0x%"UVxf"\n", SvNVX(sv), U_V(SvNVX(sv)), (UV)IV_MAX);
2521 sv_2iuv_non_preserve (sv, numtype);
2523 #endif /* NV_PRESERVES_UV */
2527 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
2528 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
2531 if (SvTYPE(sv) < SVt_IV)
2532 /* Typically the caller expects that sv_any is not NULL now. */
2533 sv_upgrade(sv, SVt_IV);
2537 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2uv(%"UVuf")\n",
2538 PTR2UV(sv),SvUVX(sv)));
2539 return SvIsUV(sv) ? SvUVX(sv) : (UV)SvIVX(sv);
2545 Return the num value of an SV, doing any necessary string or integer
2546 conversion, magic etc. Normally used via the C<SvNV(sv)> and C<SvNVx(sv)>
2553 Perl_sv_2nv(pTHX_ register SV *sv)
2557 if (SvGMAGICAL(sv)) {
2561 if (SvPOKp(sv) && SvLEN(sv)) {
2562 if (ckWARN(WARN_NUMERIC) && !SvIOKp(sv) &&
2563 !grok_number(SvPVX(sv), SvCUR(sv), NULL))
2565 return Atof(SvPVX(sv));
2569 return (NV)SvUVX(sv);
2571 return (NV)SvIVX(sv);
2574 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
2575 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
2581 if (SvTHINKFIRST(sv)) {
2584 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv,numer)) &&
2585 (SvTYPE(tmpstr) != SVt_RV || (SvRV(tmpstr) != SvRV(sv))))
2586 return SvNV(tmpstr);
2587 return PTR2NV(SvRV(sv));
2589 if (SvREADONLY(sv) && SvFAKE(sv)) {
2590 sv_force_normal(sv);
2592 if (SvREADONLY(sv) && !SvOK(sv)) {
2593 if (ckWARN(WARN_UNINITIALIZED))
2598 if (SvTYPE(sv) < SVt_NV) {
2599 if (SvTYPE(sv) == SVt_IV)
2600 sv_upgrade(sv, SVt_PVNV);
2602 sv_upgrade(sv, SVt_NV);
2603 #ifdef USE_LONG_DOUBLE
2605 STORE_NUMERIC_LOCAL_SET_STANDARD();
2606 PerlIO_printf(Perl_debug_log,
2607 "0x%"UVxf" num(%" PERL_PRIgldbl ")\n",
2608 PTR2UV(sv), SvNVX(sv));
2609 RESTORE_NUMERIC_LOCAL();
2613 STORE_NUMERIC_LOCAL_SET_STANDARD();
2614 PerlIO_printf(Perl_debug_log, "0x%"UVxf" num(%g)\n",
2615 PTR2UV(sv), SvNVX(sv));
2616 RESTORE_NUMERIC_LOCAL();
2620 else if (SvTYPE(sv) < SVt_PVNV)
2621 sv_upgrade(sv, SVt_PVNV);
2622 if (SvNOKp(sv) && !(SvIOK(sv) || SvPOK(sv))) {
2625 else if (SvIOKp(sv)) {
2626 SvNVX(sv) = SvIsUV(sv) ? (NV)SvUVX(sv) : (NV)SvIVX(sv);
2627 #ifdef NV_PRESERVES_UV
2630 /* Only set the public NV OK flag if this NV preserves the IV */
2631 /* Check it's not 0xFFFFFFFFFFFFFFFF */
2632 if (SvIsUV(sv) ? ((SvUVX(sv) != UV_MAX)&&(SvUVX(sv) == U_V(SvNVX(sv))))
2633 : (SvIVX(sv) == I_V(SvNVX(sv))))
2639 else if (SvPOKp(sv) && SvLEN(sv)) {
2641 int numtype = grok_number(SvPVX(sv), SvCUR(sv), &value);
2642 if (ckWARN(WARN_NUMERIC) && !SvIOKp(sv) && !numtype)
2644 #ifdef NV_PRESERVES_UV
2645 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2646 == IS_NUMBER_IN_UV) {
2647 /* It's defintately an integer */
2648 SvNVX(sv) = (numtype & IS_NUMBER_NEG) ? -(NV)value : (NV)value;
2650 SvNVX(sv) = Atof(SvPVX(sv));
2653 SvNVX(sv) = Atof(SvPVX(sv));
2654 /* Only set the public NV OK flag if this NV preserves the value in
2655 the PV at least as well as an IV/UV would.
2656 Not sure how to do this 100% reliably. */
2657 /* if that shift count is out of range then Configure's test is
2658 wonky. We shouldn't be in here with NV_PRESERVES_UV_BITS ==
2660 if (((UV)1 << NV_PRESERVES_UV_BITS) >
2661 U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))) {
2662 SvNOK_on(sv); /* Definitely small enough to preserve all bits */
2663 } else if (!(numtype & IS_NUMBER_IN_UV)) {
2664 /* Can't use strtol etc to convert this string, so don't try.
2665 sv_2iv and sv_2uv will use the NV to convert, not the PV. */
2668 /* value has been set. It may not be precise. */
2669 if ((numtype & IS_NUMBER_NEG) && (value > (UV)IV_MIN)) {
2670 /* 2s complement assumption for (UV)IV_MIN */
2671 SvNOK_on(sv); /* Integer is too negative. */
2676 if (numtype & IS_NUMBER_NEG) {
2677 SvIVX(sv) = -(IV)value;
2678 } else if (value <= (UV)IV_MAX) {
2679 SvIVX(sv) = (IV)value;
2685 if (numtype & IS_NUMBER_NOT_INT) {
2686 /* I believe that even if the original PV had decimals,
2687 they are lost beyond the limit of the FP precision.
2688 However, neither is canonical, so both only get p
2689 flags. NWC, 2000/11/25 */
2690 /* Both already have p flags, so do nothing */
2693 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2694 if (SvIVX(sv) == I_V(nv)) {
2699 /* It had no "." so it must be integer. */
2702 /* between IV_MAX and NV(UV_MAX).
2703 Could be slightly > UV_MAX */
2705 if (numtype & IS_NUMBER_NOT_INT) {
2706 /* UV and NV both imprecise. */
2708 UV nv_as_uv = U_V(nv);
2710 if (value == nv_as_uv && SvUVX(sv) != UV_MAX) {
2721 #endif /* NV_PRESERVES_UV */
2724 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing && !(SvFLAGS(sv) & SVs_PADTMP))
2726 if (SvTYPE(sv) < SVt_NV)
2727 /* Typically the caller expects that sv_any is not NULL now. */
2728 /* XXX Ilya implies that this is a bug in callers that assume this
2729 and ideally should be fixed. */
2730 sv_upgrade(sv, SVt_NV);
2733 #if defined(USE_LONG_DOUBLE)
2735 STORE_NUMERIC_LOCAL_SET_STANDARD();
2736 PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2nv(%" PERL_PRIgldbl ")\n",
2737 PTR2UV(sv), SvNVX(sv));
2738 RESTORE_NUMERIC_LOCAL();
2742 STORE_NUMERIC_LOCAL_SET_STANDARD();
2743 PerlIO_printf(Perl_debug_log, "0x%"UVxf" 1nv(%g)\n",
2744 PTR2UV(sv), SvNVX(sv));
2745 RESTORE_NUMERIC_LOCAL();
2751 /* asIV(): extract an integer from the string value of an SV.
2752 * Caller must validate PVX */
2755 S_asIV(pTHX_ SV *sv)
2758 int numtype = grok_number(SvPVX(sv), SvCUR(sv), &value);
2760 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2761 == IS_NUMBER_IN_UV) {
2762 /* It's definitely an integer */
2763 if (numtype & IS_NUMBER_NEG) {
2764 if (value < (UV)IV_MIN)
2767 if (value < (UV)IV_MAX)
2772 if (ckWARN(WARN_NUMERIC))
2775 return I_V(Atof(SvPVX(sv)));
2778 /* asUV(): extract an unsigned integer from the string value of an SV
2779 * Caller must validate PVX */
2782 S_asUV(pTHX_ SV *sv)
2785 int numtype = grok_number(SvPVX(sv), SvCUR(sv), &value);
2787 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2788 == IS_NUMBER_IN_UV) {
2789 /* It's definitely an integer */
2790 if (!(numtype & IS_NUMBER_NEG))
2794 if (ckWARN(WARN_NUMERIC))
2797 return U_V(Atof(SvPVX(sv)));
2801 =for apidoc sv_2pv_nolen
2803 Like C<sv_2pv()>, but doesn't return the length too. You should usually
2804 use the macro wrapper C<SvPV_nolen(sv)> instead.
2809 Perl_sv_2pv_nolen(pTHX_ register SV *sv)
2812 return sv_2pv(sv, &n_a);
2815 /* uiv_2buf(): private routine for use by sv_2pv_flags(): print an IV or
2816 * UV as a string towards the end of buf, and return pointers to start and
2819 * We assume that buf is at least TYPE_CHARS(UV) long.
2823 uiv_2buf(char *buf, IV iv, UV uv, int is_uv, char **peob)
2825 char *ptr = buf + TYPE_CHARS(UV);
2839 *--ptr = '0' + (uv % 10);
2847 /* For backwards-compatibility only. sv_2pv() is normally #def'ed to
2848 * C<sv_2pv_macro()>. See also C<sv_2pv_flags()>.
2852 Perl_sv_2pv(pTHX_ register SV *sv, STRLEN *lp)
2854 return sv_2pv_flags(sv, lp, SV_GMAGIC);
2858 =for apidoc sv_2pv_flags
2860 Returns a pointer to the string value of an SV, and sets *lp to its length.
2861 If flags includes SV_GMAGIC, does an mg_get() first. Coerces sv to a string
2863 Normally invoked via the C<SvPV_flags> macro. C<sv_2pv()> and C<sv_2pv_nomg>
2864 usually end up here too.
2870 Perl_sv_2pv_flags(pTHX_ register SV *sv, STRLEN *lp, I32 flags)
2875 char tbuf[64]; /* Must fit sprintf/Gconvert of longest IV/NV */
2876 char *tmpbuf = tbuf;
2882 if (SvGMAGICAL(sv)) {
2883 if (flags & SV_GMAGIC)
2891 (void)sprintf(tmpbuf,"%"UVuf, (UV)SvUVX(sv));
2893 (void)sprintf(tmpbuf,"%"IVdf, (IV)SvIVX(sv));
2898 Gconvert(SvNVX(sv), NV_DIG, 0, tmpbuf);
2903 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
2904 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
2911 if (SvTHINKFIRST(sv)) {
2914 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv,string)) &&
2915 (SvTYPE(tmpstr) != SVt_RV || (SvRV(tmpstr) != SvRV(sv))))
2916 return SvPV(tmpstr,*lp);
2923 switch (SvTYPE(sv)) {
2925 if ( ((SvFLAGS(sv) &
2926 (SVs_OBJECT|SVf_OK|SVs_GMG|SVs_SMG|SVs_RMG))
2927 == (SVs_OBJECT|SVs_RMG))
2928 && strEQ(s=HvNAME(SvSTASH(sv)), "Regexp")
2929 && (mg = mg_find(sv, PERL_MAGIC_qr))) {
2930 regexp *re = (regexp *)mg->mg_obj;
2933 char *fptr = "msix";
2938 U16 reganch = (re->reganch & PMf_COMPILETIME) >> 12;
2940 while((ch = *fptr++)) {
2942 reflags[left++] = ch;
2945 reflags[right--] = ch;
2950 reflags[left] = '-';
2954 mg->mg_len = re->prelen + 4 + left;
2955 New(616, mg->mg_ptr, mg->mg_len + 1 + left, char);
2956 Copy("(?", mg->mg_ptr, 2, char);
2957 Copy(reflags, mg->mg_ptr+2, left, char);
2958 Copy(":", mg->mg_ptr+left+2, 1, char);
2959 Copy(re->precomp, mg->mg_ptr+3+left, re->prelen, char);
2960 mg->mg_ptr[mg->mg_len - 1] = ')';
2961 mg->mg_ptr[mg->mg_len] = 0;
2963 PL_reginterp_cnt += re->program[0].next_off;
2975 case SVt_PVBM: if (SvROK(sv))
2978 s = "SCALAR"; break;
2979 case SVt_PVLV: s = "LVALUE"; break;
2980 case SVt_PVAV: s = "ARRAY"; break;
2981 case SVt_PVHV: s = "HASH"; break;
2982 case SVt_PVCV: s = "CODE"; break;
2983 case SVt_PVGV: s = "GLOB"; break;
2984 case SVt_PVFM: s = "FORMAT"; break;
2985 case SVt_PVIO: s = "IO"; break;
2986 default: s = "UNKNOWN"; break;
2990 Perl_sv_setpvf(aTHX_ tsv, "%s=%s", HvNAME(SvSTASH(sv)), s);
2993 Perl_sv_catpvf(aTHX_ tsv, "(0x%"UVxf")", PTR2UV(sv));
2999 if (SvREADONLY(sv) && !SvOK(sv)) {
3000 if (ckWARN(WARN_UNINITIALIZED))
3006 if (SvIOK(sv) || ((SvIOKp(sv) && !SvNOKp(sv)))) {
3007 /* I'm assuming that if both IV and NV are equally valid then
3008 converting the IV is going to be more efficient */
3009 U32 isIOK = SvIOK(sv);
3010 U32 isUIOK = SvIsUV(sv);
3011 char buf[TYPE_CHARS(UV)];
3014 if (SvTYPE(sv) < SVt_PVIV)
3015 sv_upgrade(sv, SVt_PVIV);
3017 ptr = uiv_2buf(buf, 0, SvUVX(sv), 1, &ebuf);
3019 ptr = uiv_2buf(buf, SvIVX(sv), 0, 0, &ebuf);
3020 SvGROW(sv, ebuf - ptr + 1); /* inlined from sv_setpvn */
3021 Move(ptr,SvPVX(sv),ebuf - ptr,char);
3022 SvCUR_set(sv, ebuf - ptr);
3032 else if (SvNOKp(sv)) {
3033 if (SvTYPE(sv) < SVt_PVNV)
3034 sv_upgrade(sv, SVt_PVNV);
3035 /* The +20 is pure guesswork. Configure test needed. --jhi */
3036 SvGROW(sv, NV_DIG + 20);
3038 olderrno = errno; /* some Xenix systems wipe out errno here */
3040 if (SvNVX(sv) == 0.0)
3041 (void)strcpy(s,"0");
3045 Gconvert(SvNVX(sv), NV_DIG, 0, s);
3048 #ifdef FIXNEGATIVEZERO
3049 if (*s == '-' && s[1] == '0' && !s[2])
3059 if (ckWARN(WARN_UNINITIALIZED)
3060 && !PL_localizing && !(SvFLAGS(sv) & SVs_PADTMP))
3063 if (SvTYPE(sv) < SVt_PV)
3064 /* Typically the caller expects that sv_any is not NULL now. */
3065 sv_upgrade(sv, SVt_PV);
3068 *lp = s - SvPVX(sv);
3071 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2pv(%s)\n",
3072 PTR2UV(sv),SvPVX(sv)));
3076 if (SvROK(sv)) { /* XXX Skip this when sv_pvn_force calls */
3077 /* Sneaky stuff here */
3081 tsv = newSVpv(tmpbuf, 0);
3097 len = strlen(tmpbuf);
3099 #ifdef FIXNEGATIVEZERO
3100 if (len == 2 && t[0] == '-' && t[1] == '0') {
3105 (void)SvUPGRADE(sv, SVt_PV);
3107 s = SvGROW(sv, len + 1);
3116 =for apidoc sv_2pvbyte_nolen
3118 Return a pointer to the byte-encoded representation of the SV.
3119 May cause the SV to be downgraded from UTF8 as a side-effect.
3121 Usually accessed via the C<SvPVbyte_nolen> macro.
3127 Perl_sv_2pvbyte_nolen(pTHX_ register SV *sv)
3130 return sv_2pvbyte(sv, &n_a);
3134 =for apidoc sv_2pvbyte
3136 Return a pointer to the byte-encoded representation of the SV, and set *lp
3137 to its length. May cause the SV to be downgraded from UTF8 as a
3140 Usually accessed via the C<SvPVbyte> macro.
3146 Perl_sv_2pvbyte(pTHX_ register SV *sv, STRLEN *lp)
3148 sv_utf8_downgrade(sv,0);
3149 return SvPV(sv,*lp);
3153 =for apidoc sv_2pvutf8_nolen
3155 Return a pointer to the UTF8-encoded representation of the SV.
3156 May cause the SV to be upgraded to UTF8 as a side-effect.
3158 Usually accessed via the C<SvPVutf8_nolen> macro.
3164 Perl_sv_2pvutf8_nolen(pTHX_ register SV *sv)
3167 return sv_2pvutf8(sv, &n_a);
3171 =for apidoc sv_2pvutf8
3173 Return a pointer to the UTF8-encoded representation of the SV, and set *lp
3174 to its length. May cause the SV to be upgraded to UTF8 as a side-effect.
3176 Usually accessed via the C<SvPVutf8> macro.
3182 Perl_sv_2pvutf8(pTHX_ register SV *sv, STRLEN *lp)
3184 sv_utf8_upgrade(sv);
3185 return SvPV(sv,*lp);
3189 =for apidoc sv_2bool
3191 This function is only called on magical items, and is only used by
3192 sv_true() or its macro equivalent.
3198 Perl_sv_2bool(pTHX_ register SV *sv)
3207 if (SvAMAGIC(sv) && (tmpsv=AMG_CALLun(sv,bool_)) &&
3208 (SvTYPE(tmpsv) != SVt_RV || (SvRV(tmpsv) != SvRV(sv))))
3209 return SvTRUE(tmpsv);
3210 return SvRV(sv) != 0;
3213 register XPV* Xpvtmp;
3214 if ((Xpvtmp = (XPV*)SvANY(sv)) &&
3215 (*Xpvtmp->xpv_pv > '0' ||
3216 Xpvtmp->xpv_cur > 1 ||
3217 (Xpvtmp->xpv_cur && *Xpvtmp->xpv_pv != '0')))
3224 return SvIVX(sv) != 0;
3227 return SvNVX(sv) != 0.0;
3235 =for apidoc sv_utf8_upgrade
3237 Convert the PV of an SV to its UTF8-encoded form.
3238 Forces the SV to string form if it is not already.
3239 Always sets the SvUTF8 flag to avoid future validity checks even
3240 if all the bytes have hibit clear.
3246 Perl_sv_utf8_upgrade(pTHX_ register SV *sv)
3248 return sv_utf8_upgrade_flags(sv, SV_GMAGIC);
3252 =for apidoc sv_utf8_upgrade_flags
3254 Convert the PV of an SV to its UTF8-encoded form.
3255 Forces the SV to string form if it is not already.
3256 Always sets the SvUTF8 flag to avoid future validity checks even
3257 if all the bytes have hibit clear. If C<flags> has C<SV_GMAGIC> bit set,
3258 will C<mg_get> on C<sv> if appropriate, else not. C<sv_utf8_upgrade> and
3259 C<sv_utf8_upgrade_nomg> are implemented in terms of this function.
3265 Perl_sv_utf8_upgrade_flags(pTHX_ register SV *sv, I32 flags)
3275 (void) sv_2pv_flags(sv,&len, flags);
3283 if (SvREADONLY(sv) && SvFAKE(sv)) {
3284 sv_force_normal(sv);
3287 /* This function could be much more efficient if we had a FLAG in SVs
3288 * to signal if there are any hibit chars in the PV.
3289 * Given that there isn't make loop fast as possible
3291 s = (U8 *) SvPVX(sv);
3292 e = (U8 *) SvEND(sv);
3296 if ((hibit = !NATIVE_IS_INVARIANT(ch)))
3302 len = SvCUR(sv) + 1; /* Plus the \0 */
3303 SvPVX(sv) = (char*)bytes_to_utf8((U8*)s, &len);
3304 SvCUR(sv) = len - 1;
3306 Safefree(s); /* No longer using what was there before. */
3307 SvLEN(sv) = len; /* No longer know the real size. */
3309 /* Mark as UTF-8 even if no hibit - saves scanning loop */
3315 =for apidoc sv_utf8_downgrade
3317 Attempt to convert the PV of an SV from UTF8-encoded to byte encoding.
3318 This may not be possible if the PV contains non-byte encoding characters;
3319 if this is the case, either returns false or, if C<fail_ok> is not
3326 Perl_sv_utf8_downgrade(pTHX_ register SV* sv, bool fail_ok)
3328 if (SvPOK(sv) && SvUTF8(sv)) {
3333 if (SvREADONLY(sv) && SvFAKE(sv))
3334 sv_force_normal(sv);
3335 s = (U8 *) SvPV(sv, len);
3336 if (!utf8_to_bytes(s, &len)) {
3339 #ifdef USE_BYTES_DOWNGRADES
3340 else if (IN_BYTES) {
3342 U8 *e = (U8 *) SvEND(sv);
3345 UV ch = utf8n_to_uvchr(s,(e-s),&len,0);
3346 if (first && ch > 255) {
3348 Perl_warner(aTHX_ WARN_UTF8, "Wide character in byte %s",
3349 PL_op_desc[PL_op->op_type]);
3351 Perl_warner(aTHX_ WARN_UTF8, "Wide character in byte");
3358 len = (d - (U8 *) SvPVX(sv));
3363 Perl_croak(aTHX_ "Wide character in %s",
3364 PL_op_desc[PL_op->op_type]);
3366 Perl_croak(aTHX_ "Wide character");
3377 =for apidoc sv_utf8_encode
3379 Convert the PV of an SV to UTF8-encoded, but then turn off the C<SvUTF8>
3380 flag so that it looks like octets again. Used as a building block
3381 for encode_utf8 in Encode.xs
3387 Perl_sv_utf8_encode(pTHX_ register SV *sv)
3389 (void) sv_utf8_upgrade(sv);
3394 =for apidoc sv_utf8_decode
3396 Convert the octets in the PV from UTF-8 to chars. Scan for validity and then
3397 turn off SvUTF8 if needed so that we see characters. Used as a building block
3398 for decode_utf8 in Encode.xs
3404 Perl_sv_utf8_decode(pTHX_ register SV *sv)
3410 /* The octets may have got themselves encoded - get them back as
3413 if (!sv_utf8_downgrade(sv, TRUE))
3416 /* it is actually just a matter of turning the utf8 flag on, but
3417 * we want to make sure everything inside is valid utf8 first.
3419 c = (U8 *) SvPVX(sv);
3420 if (!is_utf8_string(c, SvCUR(sv)+1))
3422 e = (U8 *) SvEND(sv);
3425 if (!UTF8_IS_INVARIANT(ch)) {
3435 =for apidoc sv_setsv
3437 Copies the contents of the source SV C<ssv> into the destination SV
3438 C<dsv>. The source SV may be destroyed if it is mortal, so don't use this
3439 function if the source SV needs to be reused. Does not handle 'set' magic.
3440 Loosely speaking, it performs a copy-by-value, obliterating any previous
3441 content of the destination.
3443 You probably want to use one of the assortment of wrappers, such as
3444 C<SvSetSV>, C<SvSetSV_nosteal>, C<SvSetMagicSV> and
3445 C<SvSetMagicSV_nosteal>.
3451 /* sv_setsv() is aliased to Perl_sv_setsv_macro; this function provided
3452 for binary compatibility only
3455 Perl_sv_setsv(pTHX_ SV *dstr, register SV *sstr)
3457 sv_setsv_flags(dstr, sstr, SV_GMAGIC);
3461 =for apidoc sv_setsv_flags
3463 Copies the contents of the source SV C<ssv> into the destination SV
3464 C<dsv>. The source SV may be destroyed if it is mortal, so don't use this
3465 function if the source SV needs to be reused. Does not handle 'set' magic.
3466 Loosely speaking, it performs a copy-by-value, obliterating any previous
3467 content of the destination.
3468 If the C<flags> parameter has the C<SV_GMAGIC> bit set, will C<mg_get> on
3469 C<ssv> if appropriate, else not. C<sv_setsv> and C<sv_setsv_nomg> are
3470 implemented in terms of this function.
3472 You probably want to use one of the assortment of wrappers, such as
3473 C<SvSetSV>, C<SvSetSV_nosteal>, C<SvSetMagicSV> and
3474 C<SvSetMagicSV_nosteal>.
3476 This is the primary function for copying scalars, and most other
3477 copy-ish functions and macros use this underneath.
3483 Perl_sv_setsv_flags(pTHX_ SV *dstr, register SV *sstr, I32 flags)
3485 register U32 sflags;
3491 SV_CHECK_THINKFIRST(dstr);
3493 sstr = &PL_sv_undef;
3494 stype = SvTYPE(sstr);
3495 dtype = SvTYPE(dstr);
3499 /* There's a lot of redundancy below but we're going for speed here */
3504 if (dtype != SVt_PVGV) {
3505 (void)SvOK_off(dstr);
3513 sv_upgrade(dstr, SVt_IV);
3516 sv_upgrade(dstr, SVt_PVNV);
3520 sv_upgrade(dstr, SVt_PVIV);
3523 (void)SvIOK_only(dstr);
3524 SvIVX(dstr) = SvIVX(sstr);
3527 if (SvTAINTED(sstr))
3538 sv_upgrade(dstr, SVt_NV);
3543 sv_upgrade(dstr, SVt_PVNV);
3546 SvNVX(dstr) = SvNVX(sstr);
3547 (void)SvNOK_only(dstr);
3548 if (SvTAINTED(sstr))
3556 sv_upgrade(dstr, SVt_RV);
3557 else if (dtype == SVt_PVGV &&
3558 SvTYPE(SvRV(sstr)) == SVt_PVGV) {
3561 if (GvIMPORTED(dstr) != GVf_IMPORTED
3562 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3564 GvIMPORTED_on(dstr);
3575 sv_upgrade(dstr, SVt_PV);
3578 if (dtype < SVt_PVIV)
3579 sv_upgrade(dstr, SVt_PVIV);
3582 if (dtype < SVt_PVNV)
3583 sv_upgrade(dstr, SVt_PVNV);
3590 Perl_croak(aTHX_ "Bizarre copy of %s in %s", sv_reftype(sstr, 0),
3591 PL_op_name[PL_op->op_type]);
3593 Perl_croak(aTHX_ "Bizarre copy of %s", sv_reftype(sstr, 0));
3597 if (dtype <= SVt_PVGV) {
3599 if (dtype != SVt_PVGV) {
3600 char *name = GvNAME(sstr);
3601 STRLEN len = GvNAMELEN(sstr);
3602 sv_upgrade(dstr, SVt_PVGV);
3603 sv_magic(dstr, dstr, PERL_MAGIC_glob, Nullch, 0);
3604 GvSTASH(dstr) = (HV*)SvREFCNT_inc(GvSTASH(sstr));
3605 GvNAME(dstr) = savepvn(name, len);
3606 GvNAMELEN(dstr) = len;
3607 SvFAKE_on(dstr); /* can coerce to non-glob */
3609 /* ahem, death to those who redefine active sort subs */
3610 else if (PL_curstackinfo->si_type == PERLSI_SORT
3611 && GvCV(dstr) && PL_sortcop == CvSTART(GvCV(dstr)))
3612 Perl_croak(aTHX_ "Can't redefine active sort subroutine %s",
3615 #ifdef GV_SHARED_CHECK
3616 if (GvSHARED((GV*)dstr)) {
3617 Perl_croak(aTHX_ PL_no_modify);
3621 (void)SvOK_off(dstr);
3622 GvINTRO_off(dstr); /* one-shot flag */
3624 GvGP(dstr) = gp_ref(GvGP(sstr));
3625 if (SvTAINTED(sstr))
3627 if (GvIMPORTED(dstr) != GVf_IMPORTED
3628 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3630 GvIMPORTED_on(dstr);
3638 if (SvGMAGICAL(sstr) && (flags & SV_GMAGIC)) {
3640 if (SvTYPE(sstr) != stype) {
3641 stype = SvTYPE(sstr);
3642 if (stype == SVt_PVGV && dtype <= SVt_PVGV)
3646 if (stype == SVt_PVLV)
3647 (void)SvUPGRADE(dstr, SVt_PVNV);
3649 (void)SvUPGRADE(dstr, stype);
3652 sflags = SvFLAGS(sstr);
3654 if (sflags & SVf_ROK) {
3655 if (dtype >= SVt_PV) {
3656 if (dtype == SVt_PVGV) {
3657 SV *sref = SvREFCNT_inc(SvRV(sstr));
3659 int intro = GvINTRO(dstr);
3661 #ifdef GV_SHARED_CHECK
3662 if (GvSHARED((GV*)dstr)) {
3663 Perl_croak(aTHX_ PL_no_modify);
3668 GvINTRO_off(dstr); /* one-shot flag */
3669 GvLINE(dstr) = CopLINE(PL_curcop);
3670 GvEGV(dstr) = (GV*)dstr;
3673 switch (SvTYPE(sref)) {
3676 SAVESPTR(GvAV(dstr));
3678 dref = (SV*)GvAV(dstr);
3679 GvAV(dstr) = (AV*)sref;
3680 if (!GvIMPORTED_AV(dstr)
3681 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3683 GvIMPORTED_AV_on(dstr);
3688 SAVESPTR(GvHV(dstr));
3690 dref = (SV*)GvHV(dstr);
3691 GvHV(dstr) = (HV*)sref;
3692 if (!GvIMPORTED_HV(dstr)
3693 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3695 GvIMPORTED_HV_on(dstr);
3700 if (GvCVGEN(dstr) && GvCV(dstr) != (CV*)sref) {
3701 SvREFCNT_dec(GvCV(dstr));
3702 GvCV(dstr) = Nullcv;
3703 GvCVGEN(dstr) = 0; /* Switch off cacheness. */
3704 PL_sub_generation++;
3706 SAVESPTR(GvCV(dstr));
3709 dref = (SV*)GvCV(dstr);
3710 if (GvCV(dstr) != (CV*)sref) {
3711 CV* cv = GvCV(dstr);
3713 if (!GvCVGEN((GV*)dstr) &&
3714 (CvROOT(cv) || CvXSUB(cv)))
3716 /* ahem, death to those who redefine
3717 * active sort subs */
3718 if (PL_curstackinfo->si_type == PERLSI_SORT &&
3719 PL_sortcop == CvSTART(cv))
3721 "Can't redefine active sort subroutine %s",
3722 GvENAME((GV*)dstr));
3723 /* Redefining a sub - warning is mandatory if
3724 it was a const and its value changed. */
3725 if (ckWARN(WARN_REDEFINE)
3727 && (!CvCONST((CV*)sref)
3728 || sv_cmp(cv_const_sv(cv),
3729 cv_const_sv((CV*)sref)))))
3731 Perl_warner(aTHX_ WARN_REDEFINE,
3733 ? "Constant subroutine %s redefined"
3734 : "Subroutine %s redefined",
3735 GvENAME((GV*)dstr));
3738 cv_ckproto(cv, (GV*)dstr,
3739 SvPOK(sref) ? SvPVX(sref) : Nullch);
3741 GvCV(dstr) = (CV*)sref;
3742 GvCVGEN(dstr) = 0; /* Switch off cacheness. */
3743 GvASSUMECV_on(dstr);
3744 PL_sub_generation++;
3746 if (!GvIMPORTED_CV(dstr)
3747 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3749 GvIMPORTED_CV_on(dstr);
3754 SAVESPTR(GvIOp(dstr));
3756 dref = (SV*)GvIOp(dstr);
3757 GvIOp(dstr) = (IO*)sref;
3761 SAVESPTR(GvFORM(dstr));
3763 dref = (SV*)GvFORM(dstr);
3764 GvFORM(dstr) = (CV*)sref;
3768 SAVESPTR(GvSV(dstr));
3770 dref = (SV*)GvSV(dstr);
3772 if (!GvIMPORTED_SV(dstr)
3773 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3775 GvIMPORTED_SV_on(dstr);
3783 if (SvTAINTED(sstr))
3788 (void)SvOOK_off(dstr); /* backoff */
3790 Safefree(SvPVX(dstr));
3791 SvLEN(dstr)=SvCUR(dstr)=0;
3794 (void)SvOK_off(dstr);
3795 SvRV(dstr) = SvREFCNT_inc(SvRV(sstr));
3797 if (sflags & SVp_NOK) {
3799 /* Only set the public OK flag if the source has public OK. */
3800 if (sflags & SVf_NOK)
3801 SvFLAGS(dstr) |= SVf_NOK;
3802 SvNVX(dstr) = SvNVX(sstr);
3804 if (sflags & SVp_IOK) {
3805 (void)SvIOKp_on(dstr);
3806 if (sflags & SVf_IOK)
3807 SvFLAGS(dstr) |= SVf_IOK;
3808 if (sflags & SVf_IVisUV)
3810 SvIVX(dstr) = SvIVX(sstr);
3812 if (SvAMAGIC(sstr)) {
3816 else if (sflags & SVp_POK) {
3819 * Check to see if we can just swipe the string. If so, it's a
3820 * possible small lose on short strings, but a big win on long ones.
3821 * It might even be a win on short strings if SvPVX(dstr)
3822 * has to be allocated and SvPVX(sstr) has to be freed.
3825 if (SvTEMP(sstr) && /* slated for free anyway? */
3826 SvREFCNT(sstr) == 1 && /* and no other references to it? */
3827 !(sflags & SVf_OOK) && /* and not involved in OOK hack? */
3828 SvLEN(sstr) && /* and really is a string */
3829 /* and won't be needed again, potentially */
3830 !(PL_op && PL_op->op_type == OP_AASSIGN))
3832 if (SvPVX(dstr)) { /* we know that dtype >= SVt_PV */
3834 SvFLAGS(dstr) &= ~SVf_OOK;
3835 Safefree(SvPVX(dstr) - SvIVX(dstr));
3837 else if (SvLEN(dstr))
3838 Safefree(SvPVX(dstr));
3840 (void)SvPOK_only(dstr);
3841 SvPV_set(dstr, SvPVX(sstr));
3842 SvLEN_set(dstr, SvLEN(sstr));
3843 SvCUR_set(dstr, SvCUR(sstr));
3846 (void)SvOK_off(sstr); /* NOTE: nukes most SvFLAGS on sstr */
3847 SvPV_set(sstr, Nullch);
3852 else { /* have to copy actual string */
3853 STRLEN len = SvCUR(sstr);
3855 SvGROW(dstr, len + 1); /* inlined from sv_setpvn */
3856 Move(SvPVX(sstr),SvPVX(dstr),len,char);
3857 SvCUR_set(dstr, len);
3858 *SvEND(dstr) = '\0';
3859 (void)SvPOK_only(dstr);
3861 if (sflags & SVf_UTF8)
3864 if (sflags & SVp_NOK) {
3866 if (sflags & SVf_NOK)
3867 SvFLAGS(dstr) |= SVf_NOK;
3868 SvNVX(dstr) = SvNVX(sstr);
3870 if (sflags & SVp_IOK) {
3871 (void)SvIOKp_on(dstr);
3872 if (sflags & SVf_IOK)
3873 SvFLAGS(dstr) |= SVf_IOK;
3874 if (sflags & SVf_IVisUV)
3876 SvIVX(dstr) = SvIVX(sstr);
3879 else if (sflags & SVp_IOK) {
3880 if (sflags & SVf_IOK)
3881 (void)SvIOK_only(dstr);
3883 (void)SvOK_off(dstr);
3884 (void)SvIOKp_on(dstr);
3886 /* XXXX Do we want to set IsUV for IV(ROK)? Be extra safe... */
3887 if (sflags & SVf_IVisUV)
3889 SvIVX(dstr) = SvIVX(sstr);
3890 if (sflags & SVp_NOK) {
3891 if (sflags & SVf_NOK)
3892 (void)SvNOK_on(dstr);
3894 (void)SvNOKp_on(dstr);
3895 SvNVX(dstr) = SvNVX(sstr);
3898 else if (sflags & SVp_NOK) {
3899 if (sflags & SVf_NOK)
3900 (void)SvNOK_only(dstr);
3902 (void)SvOK_off(dstr);
3905 SvNVX(dstr) = SvNVX(sstr);
3908 if (dtype == SVt_PVGV) {
3909 if (ckWARN(WARN_MISC))
3910 Perl_warner(aTHX_ WARN_MISC, "Undefined value assigned to typeglob");
3913 (void)SvOK_off(dstr);
3915 if (SvTAINTED(sstr))
3920 =for apidoc sv_setsv_mg
3922 Like C<sv_setsv>, but also handles 'set' magic.
3928 Perl_sv_setsv_mg(pTHX_ SV *dstr, register SV *sstr)
3930 sv_setsv(dstr,sstr);
3935 =for apidoc sv_setpvn
3937 Copies a string into an SV. The C<len> parameter indicates the number of
3938 bytes to be copied. Does not handle 'set' magic. See C<sv_setpvn_mg>.
3944 Perl_sv_setpvn(pTHX_ register SV *sv, register const char *ptr, register STRLEN len)
3946 register char *dptr;
3948 SV_CHECK_THINKFIRST(sv);
3954 /* len is STRLEN which is unsigned, need to copy to signed */
3957 Perl_croak(aTHX_ "panic: sv_setpvn called with negative strlen");
3959 (void)SvUPGRADE(sv, SVt_PV);
3961 SvGROW(sv, len + 1);
3963 Move(ptr,dptr,len,char);
3966 (void)SvPOK_only_UTF8(sv); /* validate pointer */
3971 =for apidoc sv_setpvn_mg
3973 Like C<sv_setpvn>, but also handles 'set' magic.
3979 Perl_sv_setpvn_mg(pTHX_ register SV *sv, register const char *ptr, register STRLEN len)
3981 sv_setpvn(sv,ptr,len);
3986 =for apidoc sv_setpv
3988 Copies a string into an SV. The string must be null-terminated. Does not
3989 handle 'set' magic. See C<sv_setpv_mg>.
3995 Perl_sv_setpv(pTHX_ register SV *sv, register const char *ptr)
3997 register STRLEN len;
3999 SV_CHECK_THINKFIRST(sv);
4005 (void)SvUPGRADE(sv, SVt_PV);
4007 SvGROW(sv, len + 1);
4008 Move(ptr,SvPVX(sv),len+1,char);
4010 (void)SvPOK_only_UTF8(sv); /* validate pointer */
4015 =for apidoc sv_setpv_mg
4017 Like C<sv_setpv>, but also handles 'set' magic.
4023 Perl_sv_setpv_mg(pTHX_ register SV *sv, register const char *ptr)
4030 =for apidoc sv_usepvn
4032 Tells an SV to use C<ptr> to find its string value. Normally the string is
4033 stored inside the SV but sv_usepvn allows the SV to use an outside string.
4034 The C<ptr> should point to memory that was allocated by C<malloc>. The
4035 string length, C<len>, must be supplied. This function will realloc the
4036 memory pointed to by C<ptr>, so that pointer should not be freed or used by
4037 the programmer after giving it to sv_usepvn. Does not handle 'set' magic.
4038 See C<sv_usepvn_mg>.
4044 Perl_sv_usepvn(pTHX_ register SV *sv, register char *ptr, register STRLEN len)
4046 SV_CHECK_THINKFIRST(sv);
4047 (void)SvUPGRADE(sv, SVt_PV);
4052 (void)SvOOK_off(sv);
4053 if (SvPVX(sv) && SvLEN(sv))
4054 Safefree(SvPVX(sv));
4055 Renew(ptr, len+1, char);
4058 SvLEN_set(sv, len+1);
4060 (void)SvPOK_only_UTF8(sv); /* validate pointer */
4065 =for apidoc sv_usepvn_mg
4067 Like C<sv_usepvn>, but also handles 'set' magic.
4073 Perl_sv_usepvn_mg(pTHX_ register SV *sv, register char *ptr, register STRLEN len)
4075 sv_usepvn(sv,ptr,len);
4080 =for apidoc sv_force_normal_flags
4082 Undo various types of fakery on an SV: if the PV is a shared string, make
4083 a private copy; if we're a ref, stop refing; if we're a glob, downgrade to
4084 an xpvmg. The C<flags> parameter gets passed to C<sv_unref_flags()>
4085 when unrefing. C<sv_force_normal> calls this function with flags set to 0.
4091 Perl_sv_force_normal_flags(pTHX_ register SV *sv, U32 flags)
4093 if (SvREADONLY(sv)) {
4095 char *pvx = SvPVX(sv);
4096 STRLEN len = SvCUR(sv);
4097 U32 hash = SvUVX(sv);
4098 SvGROW(sv, len + 1);
4099 Move(pvx,SvPVX(sv),len,char);
4103 unsharepvn(pvx,SvUTF8(sv)?-len:len,hash);
4105 else if (PL_curcop != &PL_compiling)
4106 Perl_croak(aTHX_ PL_no_modify);
4109 sv_unref_flags(sv, flags);
4110 else if (SvFAKE(sv) && SvTYPE(sv) == SVt_PVGV)
4115 =for apidoc sv_force_normal
4117 Undo various types of fakery on an SV: if the PV is a shared string, make
4118 a private copy; if we're a ref, stop refing; if we're a glob, downgrade to
4119 an xpvmg. See also C<sv_force_normal_flags>.
4125 Perl_sv_force_normal(pTHX_ register SV *sv)
4127 sv_force_normal_flags(sv, 0);
4133 Efficient removal of characters from the beginning of the string buffer.
4134 SvPOK(sv) must be true and the C<ptr> must be a pointer to somewhere inside
4135 the string buffer. The C<ptr> becomes the first character of the adjusted
4136 string. Uses the "OOK hack".
4142 Perl_sv_chop(pTHX_ register SV *sv, register char *ptr)
4144 register STRLEN delta;
4146 if (!ptr || !SvPOKp(sv))
4148 SV_CHECK_THINKFIRST(sv);
4149 if (SvTYPE(sv) < SVt_PVIV)
4150 sv_upgrade(sv,SVt_PVIV);
4153 if (!SvLEN(sv)) { /* make copy of shared string */
4154 char *pvx = SvPVX(sv);
4155 STRLEN len = SvCUR(sv);
4156 SvGROW(sv, len + 1);
4157 Move(pvx,SvPVX(sv),len,char);
4161 SvFLAGS(sv) |= SVf_OOK;
4163 SvFLAGS(sv) &= ~(SVf_IOK|SVf_NOK|SVp_IOK|SVp_NOK|SVf_IVisUV);
4164 delta = ptr - SvPVX(sv);
4172 =for apidoc sv_catpvn
4174 Concatenates the string onto the end of the string which is in the SV. The
4175 C<len> indicates number of bytes to copy. If the SV has the UTF8
4176 status set, then the bytes appended should be valid UTF8.
4177 Handles 'get' magic, but not 'set' magic. See C<sv_catpvn_mg>.
4182 /* sv_catpvn() is aliased to Perl_sv_catpvn_macro; this function provided
4183 for binary compatibility only
4186 Perl_sv_catpvn(pTHX_ SV *dsv, const char* sstr, STRLEN slen)
4188 sv_catpvn_flags(dsv, sstr, slen, SV_GMAGIC);
4192 =for apidoc sv_catpvn_flags
4194 Concatenates the string onto the end of the string which is in the SV. The
4195 C<len> indicates number of bytes to copy. If the SV has the UTF8
4196 status set, then the bytes appended should be valid UTF8.
4197 If C<flags> has C<SV_GMAGIC> bit set, will C<mg_get> on C<dsv> if
4198 appropriate, else not. C<sv_catpvn> and C<sv_catpvn_nomg> are implemented
4199 in terms of this function.
4205 Perl_sv_catpvn_flags(pTHX_ register SV *dsv, register const char *sstr, register STRLEN slen, I32 flags)
4210 dstr = SvPV_force_flags(dsv, dlen, flags);
4211 SvGROW(dsv, dlen + slen + 1);
4214 Move(sstr, SvPVX(dsv) + dlen, slen, char);
4217 (void)SvPOK_only_UTF8(dsv); /* validate pointer */
4222 =for apidoc sv_catpvn_mg
4224 Like C<sv_catpvn>, but also handles 'set' magic.
4230 Perl_sv_catpvn_mg(pTHX_ register SV *sv, register const char *ptr, register STRLEN len)
4232 sv_catpvn(sv,ptr,len);
4237 =for apidoc sv_catsv
4239 Concatenates the string from SV C<ssv> onto the end of the string in
4240 SV C<dsv>. Modifies C<dsv> but not C<ssv>. Handles 'get' magic, but
4241 not 'set' magic. See C<sv_catsv_mg>.
4245 /* sv_catsv() is aliased to Perl_sv_catsv_macro; this function provided
4246 for binary compatibility only
4249 Perl_sv_catsv(pTHX_ SV *dstr, register SV *sstr)
4251 sv_catsv_flags(dstr, sstr, SV_GMAGIC);
4255 =for apidoc sv_catsv_flags
4257 Concatenates the string from SV C<ssv> onto the end of the string in
4258 SV C<dsv>. Modifies C<dsv> but not C<ssv>. If C<flags> has C<SV_GMAGIC>
4259 bit set, will C<mg_get> on the SVs if appropriate, else not. C<sv_catsv>
4260 and C<sv_catsv_nomg> are implemented in terms of this function.
4265 Perl_sv_catsv_flags(pTHX_ SV *dsv, register SV *ssv, I32 flags)
4271 if ((spv = SvPV(ssv, slen))) {
4272 bool sutf8 = DO_UTF8(ssv);
4275 if (SvGMAGICAL(dsv) && (flags & SV_GMAGIC))
4277 dutf8 = DO_UTF8(dsv);
4279 if (dutf8 != sutf8) {
4281 /* Not modifying source SV, so taking a temporary copy. */
4282 SV* csv = sv_2mortal(newSVpvn(spv, slen));
4284 sv_utf8_upgrade(csv);
4285 spv = SvPV(csv, slen);
4288 sv_utf8_upgrade_nomg(dsv);
4290 sv_catpvn_nomg(dsv, spv, slen);
4295 =for apidoc sv_catsv_mg
4297 Like C<sv_catsv>, but also handles 'set' magic.
4303 Perl_sv_catsv_mg(pTHX_ SV *dsv, register SV *ssv)
4310 =for apidoc sv_catpv
4312 Concatenates the string onto the end of the string which is in the SV.
4313 If the SV has the UTF8 status set, then the bytes appended should be
4314 valid UTF8. Handles 'get' magic, but not 'set' magic. See C<sv_catpv_mg>.
4319 Perl_sv_catpv(pTHX_ register SV *sv, register const char *ptr)
4321 register STRLEN len;
4327 junk = SvPV_force(sv, tlen);
4329 SvGROW(sv, tlen + len + 1);
4332 Move(ptr,SvPVX(sv)+tlen,len+1,char);
4334 (void)SvPOK_only_UTF8(sv); /* validate pointer */
4339 =for apidoc sv_catpv_mg
4341 Like C<sv_catpv>, but also handles 'set' magic.
4347 Perl_sv_catpv_mg(pTHX_ register SV *sv, register const char *ptr)
4356 Create a new null SV, or if len > 0, create a new empty SVt_PV type SV
4357 with an initial PV allocation of len+1. Normally accessed via the C<NEWSV>
4364 Perl_newSV(pTHX_ STRLEN len)
4370 sv_upgrade(sv, SVt_PV);
4371 SvGROW(sv, len + 1);
4377 =for apidoc sv_magic
4379 Adds magic to an SV. First upgrades C<sv> to type C<SVt_PVMG> if necessary,
4380 then adds a new magic item of type C<how> to the head of the magic list.
4382 C<name> is assumed to contain an C<SV*> if C<(name && namelen == HEf_SVKEY)>
4388 Perl_sv_magic(pTHX_ register SV *sv, SV *obj, int how, const char *name, I32 namlen)
4392 if (SvREADONLY(sv)) {
4393 if (PL_curcop != &PL_compiling
4394 && how != PERL_MAGIC_regex_global
4395 && how != PERL_MAGIC_bm
4396 && how != PERL_MAGIC_fm
4397 && how != PERL_MAGIC_sv
4400 Perl_croak(aTHX_ PL_no_modify);
4403 if (SvMAGICAL(sv) || (how == PERL_MAGIC_taint && SvTYPE(sv) >= SVt_PVMG)) {
4404 if (SvMAGIC(sv) && (mg = mg_find(sv, how))) {
4405 if (how == PERL_MAGIC_taint)
4411 (void)SvUPGRADE(sv, SVt_PVMG);
4413 Newz(702,mg, 1, MAGIC);
4414 mg->mg_moremagic = SvMAGIC(sv);
4417 /* Some magic sontains a reference loop, where the sv and object refer to
4418 each other. To prevent a avoid a reference loop that would prevent such
4419 objects being freed, we look for such loops and if we find one we avoid
4420 incrementing the object refcount. */
4421 if (!obj || obj == sv ||
4422 how == PERL_MAGIC_arylen ||
4423 how == PERL_MAGIC_qr ||
4424 (SvTYPE(obj) == SVt_PVGV &&
4425 (GvSV(obj) == sv || GvHV(obj) == (HV*)sv || GvAV(obj) == (AV*)sv ||
4426 GvCV(obj) == (CV*)sv || GvIOp(obj) == (IO*)sv ||
4427 GvFORM(obj) == (CV*)sv)))
4432 mg->mg_obj = SvREFCNT_inc(obj);
4433 mg->mg_flags |= MGf_REFCOUNTED;
4436 mg->mg_len = namlen;
4439 mg->mg_ptr = savepvn(name, namlen);
4440 else if (namlen == HEf_SVKEY)
4441 mg->mg_ptr = (char*)SvREFCNT_inc((SV*)name);
4446 mg->mg_virtual = &PL_vtbl_sv;
4448 case PERL_MAGIC_overload:
4449 mg->mg_virtual = &PL_vtbl_amagic;
4451 case PERL_MAGIC_overload_elem:
4452 mg->mg_virtual = &PL_vtbl_amagicelem;
4454 case PERL_MAGIC_overload_table:
4455 mg->mg_virtual = &PL_vtbl_ovrld;
4458 mg->mg_virtual = &PL_vtbl_bm;
4460 case PERL_MAGIC_regdata:
4461 mg->mg_virtual = &PL_vtbl_regdata;
4463 case PERL_MAGIC_regdatum:
4464 mg->mg_virtual = &PL_vtbl_regdatum;
4466 case PERL_MAGIC_env:
4467 mg->mg_virtual = &PL_vtbl_env;
4470 mg->mg_virtual = &PL_vtbl_fm;
4472 case PERL_MAGIC_envelem:
4473 mg->mg_virtual = &PL_vtbl_envelem;
4475 case PERL_MAGIC_regex_global:
4476 mg->mg_virtual = &PL_vtbl_mglob;
4478 case PERL_MAGIC_isa:
4479 mg->mg_virtual = &PL_vtbl_isa;
4481 case PERL_MAGIC_isaelem:
4482 mg->mg_virtual = &PL_vtbl_isaelem;
4484 case PERL_MAGIC_nkeys:
4485 mg->mg_virtual = &PL_vtbl_nkeys;
4487 case PERL_MAGIC_dbfile:
4491 case PERL_MAGIC_dbline:
4492 mg->mg_virtual = &PL_vtbl_dbline;
4495 case PERL_MAGIC_mutex:
4496 mg->mg_virtual = &PL_vtbl_mutex;
4498 #endif /* USE_THREADS */
4499 #ifdef USE_LOCALE_COLLATE
4500 case PERL_MAGIC_collxfrm:
4501 mg->mg_virtual = &PL_vtbl_collxfrm;
4503 #endif /* USE_LOCALE_COLLATE */
4504 case PERL_MAGIC_tied:
4505 mg->mg_virtual = &PL_vtbl_pack;
4507 case PERL_MAGIC_tiedelem:
4508 case PERL_MAGIC_tiedscalar:
4509 mg->mg_virtual = &PL_vtbl_packelem;
4512 mg->mg_virtual = &PL_vtbl_regexp;
4514 case PERL_MAGIC_sig:
4515 mg->mg_virtual = &PL_vtbl_sig;
4517 case PERL_MAGIC_sigelem:
4518 mg->mg_virtual = &PL_vtbl_sigelem;
4520 case PERL_MAGIC_taint:
4521 mg->mg_virtual = &PL_vtbl_taint;
4524 case PERL_MAGIC_uvar:
4525 mg->mg_virtual = &PL_vtbl_uvar;
4527 case PERL_MAGIC_vec:
4528 mg->mg_virtual = &PL_vtbl_vec;
4530 case PERL_MAGIC_substr:
4531 mg->mg_virtual = &PL_vtbl_substr;
4533 case PERL_MAGIC_defelem:
4534 mg->mg_virtual = &PL_vtbl_defelem;
4536 case PERL_MAGIC_glob:
4537 mg->mg_virtual = &PL_vtbl_glob;
4539 case PERL_MAGIC_arylen:
4540 mg->mg_virtual = &PL_vtbl_arylen;
4542 case PERL_MAGIC_pos:
4543 mg->mg_virtual = &PL_vtbl_pos;
4545 case PERL_MAGIC_backref:
4546 mg->mg_virtual = &PL_vtbl_backref;
4548 case PERL_MAGIC_ext:
4549 /* Reserved for use by extensions not perl internals. */
4550 /* Useful for attaching extension internal data to perl vars. */
4551 /* Note that multiple extensions may clash if magical scalars */
4552 /* etc holding private data from one are passed to another. */
4556 Perl_croak(aTHX_ "Don't know how to handle magic of type \\%o", how);
4560 SvFLAGS(sv) &= ~(SVf_IOK|SVf_NOK|SVf_POK);
4564 =for apidoc sv_unmagic
4566 Removes all magic of type C<type> from an SV.
4572 Perl_sv_unmagic(pTHX_ SV *sv, int type)
4576 if (SvTYPE(sv) < SVt_PVMG || !SvMAGIC(sv))
4579 for (mg = *mgp; mg; mg = *mgp) {
4580 if (mg->mg_type == type) {
4581 MGVTBL* vtbl = mg->mg_virtual;
4582 *mgp = mg->mg_moremagic;
4583 if (vtbl && vtbl->svt_free)
4584 CALL_FPTR(vtbl->svt_free)(aTHX_ sv, mg);
4585 if (mg->mg_ptr && mg->mg_type != PERL_MAGIC_regex_global) {
4586 if (mg->mg_len >= 0)
4587 Safefree(mg->mg_ptr);
4588 else if (mg->mg_len == HEf_SVKEY)
4589 SvREFCNT_dec((SV*)mg->mg_ptr);
4591 if (mg->mg_flags & MGf_REFCOUNTED)
4592 SvREFCNT_dec(mg->mg_obj);
4596 mgp = &mg->mg_moremagic;
4600 SvFLAGS(sv) |= (SvFLAGS(sv) & (SVp_NOK|SVp_POK)) >> PRIVSHIFT;
4607 =for apidoc sv_rvweaken
4609 Weaken a reference: set the C<SvWEAKREF> flag on this RV; give the
4610 referred-to SV C<PERL_MAGIC_backref> magic if it hasn't already; and
4611 push a back-reference to this RV onto the array of backreferences
4612 associated with that magic.
4618 Perl_sv_rvweaken(pTHX_ SV *sv)
4621 if (!SvOK(sv)) /* let undefs pass */
4624 Perl_croak(aTHX_ "Can't weaken a nonreference");
4625 else if (SvWEAKREF(sv)) {
4626 if (ckWARN(WARN_MISC))
4627 Perl_warner(aTHX_ WARN_MISC, "Reference is already weak");
4631 sv_add_backref(tsv, sv);
4637 /* Give tsv backref magic if it hasn't already got it, then push a
4638 * back-reference to sv onto the array associated with the backref magic.
4642 S_sv_add_backref(pTHX_ SV *tsv, SV *sv)
4646 if (SvMAGICAL(tsv) && (mg = mg_find(tsv, PERL_MAGIC_backref)))
4647 av = (AV*)mg->mg_obj;
4650 sv_magic(tsv, (SV*)av, PERL_MAGIC_backref, NULL, 0);
4651 SvREFCNT_dec(av); /* for sv_magic */
4656 /* delete a back-reference to ourselves from the backref magic associated
4657 * with the SV we point to.
4661 S_sv_del_backref(pTHX_ SV *sv)
4668 if (!SvMAGICAL(tsv) || !(mg = mg_find(tsv, PERL_MAGIC_backref)))
4669 Perl_croak(aTHX_ "panic: del_backref");
4670 av = (AV *)mg->mg_obj;
4675 svp[i] = &PL_sv_undef; /* XXX */
4682 =for apidoc sv_insert
4684 Inserts a string at the specified offset/length within the SV. Similar to
4685 the Perl substr() function.
4691 Perl_sv_insert(pTHX_ SV *bigstr, STRLEN offset, STRLEN len, char *little, STRLEN littlelen)
4695 register char *midend;
4696 register char *bigend;
4702 Perl_croak(aTHX_ "Can't modify non-existent substring");
4703 SvPV_force(bigstr, curlen);
4704 (void)SvPOK_only_UTF8(bigstr);
4705 if (offset + len > curlen) {
4706 SvGROW(bigstr, offset+len+1);
4707 Zero(SvPVX(bigstr)+curlen, offset+len-curlen, char);
4708 SvCUR_set(bigstr, offset+len);
4712 i = littlelen - len;
4713 if (i > 0) { /* string might grow */
4714 big = SvGROW(bigstr, SvCUR(bigstr) + i + 1);
4715 mid = big + offset + len;
4716 midend = bigend = big + SvCUR(bigstr);
4719 while (midend > mid) /* shove everything down */
4720 *--bigend = *--midend;
4721 Move(little,big+offset,littlelen,char);
4727 Move(little,SvPVX(bigstr)+offset,len,char);
4732 big = SvPVX(bigstr);
4735 bigend = big + SvCUR(bigstr);
4737 if (midend > bigend)
4738 Perl_croak(aTHX_ "panic: sv_insert");
4740 if (mid - big > bigend - midend) { /* faster to shorten from end */
4742 Move(little, mid, littlelen,char);
4745 i = bigend - midend;
4747 Move(midend, mid, i,char);
4751 SvCUR_set(bigstr, mid - big);
4754 else if ((i = mid - big)) { /* faster from front */
4755 midend -= littlelen;
4757 sv_chop(bigstr,midend-i);
4762 Move(little, mid, littlelen,char);
4764 else if (littlelen) {
4765 midend -= littlelen;
4766 sv_chop(bigstr,midend);
4767 Move(little,midend,littlelen,char);
4770 sv_chop(bigstr,midend);
4776 =for apidoc sv_replace
4778 Make the first argument a copy of the second, then delete the original.
4779 The target SV physically takes over ownership of the body of the source SV
4780 and inherits its flags; however, the target keeps any magic it owns,
4781 and any magic in the source is discarded.
4782 Note that this is a rather specialist SV copying operation; most of the
4783 time you'll want to use C<sv_setsv> or one of its many macro front-ends.
4789 Perl_sv_replace(pTHX_ register SV *sv, register SV *nsv)
4791 U32 refcnt = SvREFCNT(sv);
4792 SV_CHECK_THINKFIRST(sv);
4793 if (SvREFCNT(nsv) != 1 && ckWARN_d(WARN_INTERNAL))
4794 Perl_warner(aTHX_ WARN_INTERNAL, "Reference miscount in sv_replace()");
4795 if (SvMAGICAL(sv)) {
4799 sv_upgrade(nsv, SVt_PVMG);
4800 SvMAGIC(nsv) = SvMAGIC(sv);
4801 SvFLAGS(nsv) |= SvMAGICAL(sv);
4807 assert(!SvREFCNT(sv));
4808 StructCopy(nsv,sv,SV);
4809 SvREFCNT(sv) = refcnt;
4810 SvFLAGS(nsv) |= SVTYPEMASK; /* Mark as freed */
4815 =for apidoc sv_clear
4817 Clear an SV: call any destructors, free up any memory used by the body,
4818 and free the body itself. The SV's head is I<not> freed, although
4819 its type is set to all 1's so that it won't inadvertently be assumed
4820 to be live during global destruction etc.
4821 This function should only be called when REFCNT is zero. Most of the time
4822 you'll want to call C<sv_free()> (or its macro wrapper C<SvREFCNT_dec>)
4829 Perl_sv_clear(pTHX_ register SV *sv)
4833 assert(SvREFCNT(sv) == 0);
4836 if (PL_defstash) { /* Still have a symbol table? */
4841 Zero(&tmpref, 1, SV);
4842 sv_upgrade(&tmpref, SVt_RV);
4844 SvREADONLY_on(&tmpref); /* DESTROY() could be naughty */
4845 SvREFCNT(&tmpref) = 1;
4848 stash = SvSTASH(sv);
4849 destructor = StashHANDLER(stash,DESTROY);
4852 PUSHSTACKi(PERLSI_DESTROY);
4853 SvRV(&tmpref) = SvREFCNT_inc(sv);
4858 call_sv((SV*)destructor, G_DISCARD|G_EVAL|G_KEEPERR);
4864 } while (SvOBJECT(sv) && SvSTASH(sv) != stash);
4866 del_XRV(SvANY(&tmpref));
4869 if (PL_in_clean_objs)
4870 Perl_croak(aTHX_ "DESTROY created new reference to dead object '%s'",
4872 /* DESTROY gave object new lease on life */
4878 SvREFCNT_dec(SvSTASH(sv)); /* possibly of changed persuasion */
4879 SvOBJECT_off(sv); /* Curse the object. */
4880 if (SvTYPE(sv) != SVt_PVIO)
4881 --PL_sv_objcount; /* XXX Might want something more general */
4884 if (SvTYPE(sv) >= SVt_PVMG) {
4887 if (SvFLAGS(sv) & SVpad_TYPED)
4888 SvREFCNT_dec(SvSTASH(sv));
4891 switch (SvTYPE(sv)) {
4894 IoIFP(sv) != PerlIO_stdin() &&
4895 IoIFP(sv) != PerlIO_stdout() &&
4896 IoIFP(sv) != PerlIO_stderr())
4898 io_close((IO*)sv, FALSE);
4900 if (IoDIRP(sv) && !(IoFLAGS(sv) & IOf_FAKE_DIRP))
4901 PerlDir_close(IoDIRP(sv));
4902 IoDIRP(sv) = (DIR*)NULL;
4903 Safefree(IoTOP_NAME(sv));
4904 Safefree(IoFMT_NAME(sv));
4905 Safefree(IoBOTTOM_NAME(sv));
4920 SvREFCNT_dec(LvTARG(sv));
4924 Safefree(GvNAME(sv));
4925 /* cannot decrease stash refcount yet, as we might recursively delete
4926 ourselves when the refcnt drops to zero. Delay SvREFCNT_dec
4927 of stash until current sv is completely gone.
4928 -- JohnPC, 27 Mar 1998 */
4929 stash = GvSTASH(sv);
4935 (void)SvOOK_off(sv);
4943 SvREFCNT_dec(SvRV(sv));
4945 else if (SvPVX(sv) && SvLEN(sv))
4946 Safefree(SvPVX(sv));
4947 else if (SvPVX(sv) && SvREADONLY(sv) && SvFAKE(sv)) {
4948 unsharepvn(SvPVX(sv),SvUTF8(sv)?-SvCUR(sv):SvCUR(sv),SvUVX(sv));
4960 switch (SvTYPE(sv)) {
4976 del_XPVIV(SvANY(sv));
4979 del_XPVNV(SvANY(sv));
4982 del_XPVMG(SvANY(sv));
4985 del_XPVLV(SvANY(sv));
4988 del_XPVAV(SvANY(sv));
4991 del_XPVHV(SvANY(sv));
4994 del_XPVCV(SvANY(sv));
4997 del_XPVGV(SvANY(sv));
4998 /* code duplication for increased performance. */
4999 SvFLAGS(sv) &= SVf_BREAK;
5000 SvFLAGS(sv) |= SVTYPEMASK;
5001 /* decrease refcount of the stash that owns this GV, if any */
5003 SvREFCNT_dec(stash);
5004 return; /* not break, SvFLAGS reset already happened */
5006 del_XPVBM(SvANY(sv));
5009 del_XPVFM(SvANY(sv));
5012 del_XPVIO(SvANY(sv));
5015 SvFLAGS(sv) &= SVf_BREAK;
5016 SvFLAGS(sv) |= SVTYPEMASK;
5020 =for apidoc sv_newref
5022 Increment an SV's reference count. Use the C<SvREFCNT_inc()> wrapper
5029 Perl_sv_newref(pTHX_ SV *sv)
5032 ATOMIC_INC(SvREFCNT(sv));
5039 Decrement an SV's reference count, and if it drops to zero, call
5040 C<sv_clear> to invoke destructors and free up any memory used by
5041 the body; finally, deallocate the SV's head itself.
5042 Normally called via a wrapper macro C<SvREFCNT_dec>.
5048 Perl_sv_free(pTHX_ SV *sv)
5050 int refcount_is_zero;
5054 if (SvREFCNT(sv) == 0) {
5055 if (SvFLAGS(sv) & SVf_BREAK)
5056 /* this SV's refcnt has been artificially decremented to
5057 * trigger cleanup */
5059 if (PL_in_clean_all) /* All is fair */
5061 if (SvREADONLY(sv) && SvIMMORTAL(sv)) {
5062 /* make sure SvREFCNT(sv)==0 happens very seldom */
5063 SvREFCNT(sv) = (~(U32)0)/2;
5066 if (ckWARN_d(WARN_INTERNAL))
5067 Perl_warner(aTHX_ WARN_INTERNAL, "Attempt to free unreferenced scalar");
5070 ATOMIC_DEC_AND_TEST(refcount_is_zero, SvREFCNT(sv));
5071 if (!refcount_is_zero)
5075 if (ckWARN_d(WARN_DEBUGGING))
5076 Perl_warner(aTHX_ WARN_DEBUGGING,
5077 "Attempt to free temp prematurely: SV 0x%"UVxf,
5082 if (SvREADONLY(sv) && SvIMMORTAL(sv)) {
5083 /* make sure SvREFCNT(sv)==0 happens very seldom */
5084 SvREFCNT(sv) = (~(U32)0)/2;
5095 Returns the length of the string in the SV. Handles magic and type
5096 coercion. See also C<SvCUR>, which gives raw access to the xpv_cur slot.
5102 Perl_sv_len(pTHX_ register SV *sv)
5111 len = mg_length(sv);
5113 junk = SvPV(sv, len);
5118 =for apidoc sv_len_utf8
5120 Returns the number of characters in the string in an SV, counting wide
5121 UTF8 bytes as a single character. Handles magic and type coercion.
5127 Perl_sv_len_utf8(pTHX_ register SV *sv)
5133 return mg_length(sv);
5137 U8 *s = (U8*)SvPV(sv, len);
5139 return Perl_utf8_length(aTHX_ s, s + len);
5144 =for apidoc sv_pos_u2b
5146 Converts the value pointed to by offsetp from a count of UTF8 chars from
5147 the start of the string, to a count of the equivalent number of bytes; if
5148 lenp is non-zero, it does the same to lenp, but this time starting from
5149 the offset, rather than from the start of the string. Handles magic and
5156 Perl_sv_pos_u2b(pTHX_ register SV *sv, I32* offsetp, I32* lenp)
5161 I32 uoffset = *offsetp;
5167 start = s = (U8*)SvPV(sv, len);
5169 while (s < send && uoffset--)
5173 *offsetp = s - start;
5177 while (s < send && ulen--)
5187 =for apidoc sv_pos_b2u
5189 Converts the value pointed to by offsetp from a count of bytes from the
5190 start of the string, to a count of the equivalent number of UTF8 chars.
5191 Handles magic and type coercion.
5197 Perl_sv_pos_b2u(pTHX_ register SV *sv, I32* offsetp)
5206 s = (U8*)SvPV(sv, len);
5208 Perl_croak(aTHX_ "panic: sv_pos_b2u: bad byte offset");
5209 send = s + *offsetp;
5213 /* Call utf8n_to_uvchr() to validate the sequence */
5214 utf8n_to_uvchr(s, UTF8SKIP(s), &n, 0);
5229 Returns a boolean indicating whether the strings in the two SVs are
5230 identical. Is UTF-8 and 'use bytes' aware, handles get magic, and will
5231 coerce its args to strings if necessary.
5237 Perl_sv_eq(pTHX_ register SV *sv1, register SV *sv2)
5251 pv1 = SvPV(sv1, cur1);
5258 pv2 = SvPV(sv2, cur2);
5260 /* do not utf8ize the comparands as a side-effect */
5261 if (cur1 && cur2 && SvUTF8(sv1) != SvUTF8(sv2) && !IN_BYTES) {
5262 bool is_utf8 = TRUE;
5263 /* UTF-8ness differs */
5264 if (PL_hints & HINT_UTF8_DISTINCT)
5268 /* sv1 is the UTF-8 one , If is equal it must be downgrade-able */
5269 char *pv = (char*)bytes_from_utf8((U8*)pv1, &cur1, &is_utf8);
5274 /* sv2 is the UTF-8 one , If is equal it must be downgrade-able */
5275 char *pv = (char *)bytes_from_utf8((U8*)pv2, &cur2, &is_utf8);
5280 /* Downgrade not possible - cannot be eq */
5286 eq = memEQ(pv1, pv2, cur1);
5297 Compares the strings in two SVs. Returns -1, 0, or 1 indicating whether the
5298 string in C<sv1> is less than, equal to, or greater than the string in
5299 C<sv2>. Is UTF-8 and 'use bytes' aware, handles get magic, and will
5300 coerce its args to strings if necessary. See also C<sv_cmp_locale>.
5306 Perl_sv_cmp(pTHX_ register SV *sv1, register SV *sv2)
5311 bool pv1tmp = FALSE;
5312 bool pv2tmp = FALSE;
5319 pv1 = SvPV(sv1, cur1);
5326 pv2 = SvPV(sv2, cur2);
5328 /* do not utf8ize the comparands as a side-effect */
5329 if (cur1 && cur2 && SvUTF8(sv1) != SvUTF8(sv2) && !IN_BYTES) {
5330 if (PL_hints & HINT_UTF8_DISTINCT)
5331 return SvUTF8(sv1) ? 1 : -1;
5334 pv2 = (char*)bytes_to_utf8((U8*)pv2, &cur2);
5338 pv1 = (char*)bytes_to_utf8((U8*)pv1, &cur1);
5344 cmp = cur2 ? -1 : 0;
5348 I32 retval = memcmp((void*)pv1, (void*)pv2, cur1 < cur2 ? cur1 : cur2);
5351 cmp = retval < 0 ? -1 : 1;
5352 } else if (cur1 == cur2) {
5355 cmp = cur1 < cur2 ? -1 : 1;
5368 =for apidoc sv_cmp_locale
5370 Compares the strings in two SVs in a locale-aware manner. Is UTF-8 and
5371 'use bytes' aware, handles get magic, and will coerce its args to strings
5372 if necessary. See also C<sv_cmp_locale>. See also C<sv_cmp>.
5378 Perl_sv_cmp_locale(pTHX_ register SV *sv1, register SV *sv2)
5380 #ifdef USE_LOCALE_COLLATE
5386 if (PL_collation_standard)
5390 pv1 = sv1 ? sv_collxfrm(sv1, &len1) : (char *) NULL;
5392 pv2 = sv2 ? sv_collxfrm(sv2, &len2) : (char *) NULL;
5394 if (!pv1 || !len1) {
5405 retval = memcmp((void*)pv1, (void*)pv2, len1 < len2 ? len1 : len2);
5408 return retval < 0 ? -1 : 1;
5411 * When the result of collation is equality, that doesn't mean
5412 * that there are no differences -- some locales exclude some
5413 * characters from consideration. So to avoid false equalities,
5414 * we use the raw string as a tiebreaker.
5420 #endif /* USE_LOCALE_COLLATE */
5422 return sv_cmp(sv1, sv2);
5426 #ifdef USE_LOCALE_COLLATE
5429 =for apidoc sv_collxfrm
5431 Add Collate Transform magic to an SV if it doesn't already have it.
5433 Any scalar variable may carry PERL_MAGIC_collxfrm magic that contains the
5434 scalar data of the variable, but transformed to such a format that a normal
5435 memory comparison can be used to compare the data according to the locale
5442 Perl_sv_collxfrm(pTHX_ SV *sv, STRLEN *nxp)
5446 mg = SvMAGICAL(sv) ? mg_find(sv, PERL_MAGIC_collxfrm) : (MAGIC *) NULL;
5447 if (!mg || !mg->mg_ptr || *(U32*)mg->mg_ptr != PL_collation_ix) {
5452 Safefree(mg->mg_ptr);
5454 if ((xf = mem_collxfrm(s, len, &xlen))) {
5455 if (SvREADONLY(sv)) {
5458 return xf + sizeof(PL_collation_ix);
5461 sv_magic(sv, 0, PERL_MAGIC_collxfrm, 0, 0);
5462 mg = mg_find(sv, PERL_MAGIC_collxfrm);
5475 if (mg && mg->mg_ptr) {
5477 return mg->mg_ptr + sizeof(PL_collation_ix);
5485 #endif /* USE_LOCALE_COLLATE */
5490 Get a line from the filehandle and store it into the SV, optionally
5491 appending to the currently-stored string.
5497 Perl_sv_gets(pTHX_ register SV *sv, register PerlIO *fp, I32 append)
5501 register STDCHAR rslast;
5502 register STDCHAR *bp;
5506 SV_CHECK_THINKFIRST(sv);
5507 (void)SvUPGRADE(sv, SVt_PV);
5511 if (RsSNARF(PL_rs)) {
5515 else if (RsRECORD(PL_rs)) {
5516 I32 recsize, bytesread;
5519 /* Grab the size of the record we're getting */
5520 recsize = SvIV(SvRV(PL_rs));
5521 (void)SvPOK_only(sv); /* Validate pointer */
5522 buffer = SvGROW(sv, recsize + 1);
5525 /* VMS wants read instead of fread, because fread doesn't respect */
5526 /* RMS record boundaries. This is not necessarily a good thing to be */
5527 /* doing, but we've got no other real choice */
5528 bytesread = PerlLIO_read(PerlIO_fileno(fp), buffer, recsize);
5530 bytesread = PerlIO_read(fp, buffer, recsize);
5532 SvCUR_set(sv, bytesread);
5533 buffer[bytesread] = '\0';
5534 if (PerlIO_isutf8(fp))
5538 return(SvCUR(sv) ? SvPVX(sv) : Nullch);
5540 else if (RsPARA(PL_rs)) {
5545 /* Get $/ i.e. PL_rs into same encoding as stream wants */
5546 if (PerlIO_isutf8(fp)) {
5547 rsptr = SvPVutf8(PL_rs, rslen);
5550 if (SvUTF8(PL_rs)) {
5551 if (!sv_utf8_downgrade(PL_rs, TRUE)) {
5552 Perl_croak(aTHX_ "Wide character in $/");
5555 rsptr = SvPV(PL_rs, rslen);
5559 rslast = rslen ? rsptr[rslen - 1] : '\0';
5561 if (RsPARA(PL_rs)) { /* have to do this both before and after */
5562 do { /* to make sure file boundaries work right */
5565 i = PerlIO_getc(fp);
5569 PerlIO_ungetc(fp,i);
5575 /* See if we know enough about I/O mechanism to cheat it ! */
5577 /* This used to be #ifdef test - it is made run-time test for ease
5578 of abstracting out stdio interface. One call should be cheap
5579 enough here - and may even be a macro allowing compile
5583 if (PerlIO_fast_gets(fp)) {
5586 * We're going to steal some values from the stdio struct
5587 * and put EVERYTHING in the innermost loop into registers.
5589 register STDCHAR *ptr;
5593 #if defined(VMS) && defined(PERLIO_IS_STDIO)
5594 /* An ungetc()d char is handled separately from the regular
5595 * buffer, so we getc() it back out and stuff it in the buffer.
5597 i = PerlIO_getc(fp);
5598 if (i == EOF) return 0;
5599 *(--((*fp)->_ptr)) = (unsigned char) i;
5603 /* Here is some breathtakingly efficient cheating */
5605 cnt = PerlIO_get_cnt(fp); /* get count into register */
5606 (void)SvPOK_only(sv); /* validate pointer */
5607 if (SvLEN(sv) - append <= cnt + 1) { /* make sure we have the room */
5608 if (cnt > 80 && SvLEN(sv) > append) {
5609 shortbuffered = cnt - SvLEN(sv) + append + 1;
5610 cnt -= shortbuffered;
5614 /* remember that cnt can be negative */
5615 SvGROW(sv, append + (cnt <= 0 ? 2 : (cnt + 1)));
5620 bp = (STDCHAR*)SvPVX(sv) + append; /* move these two too to registers */
5621 ptr = (STDCHAR*)PerlIO_get_ptr(fp);
5622 DEBUG_P(PerlIO_printf(Perl_debug_log,
5623 "Screamer: entering, ptr=%"UVuf", cnt=%ld\n",PTR2UV(ptr),(long)cnt));
5624 DEBUG_P(PerlIO_printf(Perl_debug_log,
5625 "Screamer: entering: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
5626 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
5627 PTR2UV(PerlIO_has_base(fp) ? PerlIO_get_base(fp) : 0)));
5632 while (cnt > 0) { /* this | eat */
5634 if ((*bp++ = *ptr++) == rslast) /* really | dust */
5635 goto thats_all_folks; /* screams | sed :-) */
5639 Copy(ptr, bp, cnt, char); /* this | eat */
5640 bp += cnt; /* screams | dust */
5641 ptr += cnt; /* louder | sed :-) */
5646 if (shortbuffered) { /* oh well, must extend */
5647 cnt = shortbuffered;
5649 bpx = bp - (STDCHAR*)SvPVX(sv); /* box up before relocation */
5651 SvGROW(sv, SvLEN(sv) + append + cnt + 2);
5652 bp = (STDCHAR*)SvPVX(sv) + bpx; /* unbox after relocation */
5656 DEBUG_P(PerlIO_printf(Perl_debug_log,
5657 "Screamer: going to getc, ptr=%"UVuf", cnt=%ld\n",
5658 PTR2UV(ptr),(long)cnt));
5659 PerlIO_set_ptrcnt(fp, ptr, cnt); /* deregisterize cnt and ptr */
5660 DEBUG_P(PerlIO_printf(Perl_debug_log,
5661 "Screamer: pre: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
5662 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
5663 PTR2UV(PerlIO_has_base (fp) ? PerlIO_get_base(fp) : 0)));
5664 /* This used to call 'filbuf' in stdio form, but as that behaves like
5665 getc when cnt <= 0 we use PerlIO_getc here to avoid introducing
5666 another abstraction. */
5667 i = PerlIO_getc(fp); /* get more characters */
5668 DEBUG_P(PerlIO_printf(Perl_debug_log,
5669 "Screamer: post: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
5670 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
5671 PTR2UV(PerlIO_has_base (fp) ? PerlIO_get_base(fp) : 0)));
5672 cnt = PerlIO_get_cnt(fp);
5673 ptr = (STDCHAR*)PerlIO_get_ptr(fp); /* reregisterize cnt and ptr */
5674 DEBUG_P(PerlIO_printf(Perl_debug_log,
5675 "Screamer: after getc, ptr=%"UVuf", cnt=%ld\n",PTR2UV(ptr),(long)cnt));
5677 if (i == EOF) /* all done for ever? */
5678 goto thats_really_all_folks;
5680 bpx = bp - (STDCHAR*)SvPVX(sv); /* box up before relocation */
5682 SvGROW(sv, bpx + cnt + 2);
5683 bp = (STDCHAR*)SvPVX(sv) + bpx; /* unbox after relocation */
5685 *bp++ = i; /* store character from PerlIO_getc */
5687 if (rslen && (STDCHAR)i == rslast) /* all done for now? */
5688 goto thats_all_folks;
5692 if ((rslen > 1 && (bp - (STDCHAR*)SvPVX(sv) < rslen)) ||
5693 memNE((char*)bp - rslen, rsptr, rslen))
5694 goto screamer; /* go back to the fray */
5695 thats_really_all_folks:
5697 cnt += shortbuffered;
5698 DEBUG_P(PerlIO_printf(Perl_debug_log,
5699 "Screamer: quitting, ptr=%"UVuf", cnt=%ld\n",PTR2UV(ptr),(long)cnt));
5700 PerlIO_set_ptrcnt(fp, ptr, cnt); /* put these back or we're in trouble */
5701 DEBUG_P(PerlIO_printf(Perl_debug_log,
5702 "Screamer: end: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
5703 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
5704 PTR2UV(PerlIO_has_base (fp) ? PerlIO_get_base(fp) : 0)));
5706 SvCUR_set(sv, bp - (STDCHAR*)SvPVX(sv)); /* set length */
5707 DEBUG_P(PerlIO_printf(Perl_debug_log,
5708 "Screamer: done, len=%ld, string=|%.*s|\n",
5709 (long)SvCUR(sv),(int)SvCUR(sv),SvPVX(sv)));
5714 /*The big, slow, and stupid way */
5717 /* Need to work around EPOC SDK features */
5718 /* On WINS: MS VC5 generates calls to _chkstk, */
5719 /* if a `large' stack frame is allocated */
5720 /* gcc on MARM does not generate calls like these */
5726 register STDCHAR *bpe = buf + sizeof(buf);
5728 while ((i = PerlIO_getc(fp)) != EOF && (*bp++ = i) != rslast && bp < bpe)
5729 ; /* keep reading */
5733 cnt = PerlIO_read(fp,(char*)buf, sizeof(buf));
5734 /* Accomodate broken VAXC compiler, which applies U8 cast to
5735 * both args of ?: operator, causing EOF to change into 255
5737 if (cnt) { i = (U8)buf[cnt - 1]; } else { i = EOF; }
5741 sv_catpvn(sv, (char *) buf, cnt);
5743 sv_setpvn(sv, (char *) buf, cnt);
5745 if (i != EOF && /* joy */
5747 SvCUR(sv) < rslen ||
5748 memNE(SvPVX(sv) + SvCUR(sv) - rslen, rsptr, rslen)))
5752 * If we're reading from a TTY and we get a short read,
5753 * indicating that the user hit his EOF character, we need
5754 * to notice it now, because if we try to read from the TTY
5755 * again, the EOF condition will disappear.
5757 * The comparison of cnt to sizeof(buf) is an optimization
5758 * that prevents unnecessary calls to feof().
5762 if (!(cnt < sizeof(buf) && PerlIO_eof(fp)))
5767 if (RsPARA(PL_rs)) { /* have to do this both before and after */
5768 while (i != EOF) { /* to make sure file boundaries work right */
5769 i = PerlIO_getc(fp);
5771 PerlIO_ungetc(fp,i);
5777 if (PerlIO_isutf8(fp))
5782 return (SvCUR(sv) - append) ? SvPVX(sv) : Nullch;
5788 Auto-increment of the value in the SV, doing string to numeric conversion
5789 if necessary. Handles 'get' magic.
5795 Perl_sv_inc(pTHX_ register SV *sv)
5804 if (SvTHINKFIRST(sv)) {
5805 if (SvREADONLY(sv)) {
5806 if (PL_curcop != &PL_compiling)
5807 Perl_croak(aTHX_ PL_no_modify);
5811 if (SvAMAGIC(sv) && AMG_CALLun(sv,inc))
5813 i = PTR2IV(SvRV(sv));
5818 flags = SvFLAGS(sv);
5819 if ((flags & (SVp_NOK|SVp_IOK)) == SVp_NOK) {
5820 /* It's (privately or publicly) a float, but not tested as an
5821 integer, so test it to see. */
5823 flags = SvFLAGS(sv);
5825 if ((flags & SVf_IOK) || ((flags & (SVp_IOK | SVp_NOK)) == SVp_IOK)) {
5826 /* It's publicly an integer, or privately an integer-not-float */
5829 if (SvUVX(sv) == UV_MAX)
5830 sv_setnv(sv, (NV)UV_MAX + 1.0);
5832 (void)SvIOK_only_UV(sv);
5835 if (SvIVX(sv) == IV_MAX)
5836 sv_setuv(sv, (UV)IV_MAX + 1);
5838 (void)SvIOK_only(sv);
5844 if (flags & SVp_NOK) {
5845 (void)SvNOK_only(sv);
5850 if (!(flags & SVp_POK) || !*SvPVX(sv)) {
5851 if ((flags & SVTYPEMASK) < SVt_PVIV)
5852 sv_upgrade(sv, SVt_IV);
5853 (void)SvIOK_only(sv);
5858 while (isALPHA(*d)) d++;
5859 while (isDIGIT(*d)) d++;
5861 #ifdef PERL_PRESERVE_IVUV
5862 /* Got to punt this an an integer if needs be, but we don't issue
5863 warnings. Probably ought to make the sv_iv_please() that does
5864 the conversion if possible, and silently. */
5865 int numtype = grok_number(SvPVX(sv), SvCUR(sv), NULL);
5866 if (numtype && !(numtype & IS_NUMBER_INFINITY)) {
5867 /* Need to try really hard to see if it's an integer.
5868 9.22337203685478e+18 is an integer.
5869 but "9.22337203685478e+18" + 0 is UV=9223372036854779904
5870 so $a="9.22337203685478e+18"; $a+0; $a++
5871 needs to be the same as $a="9.22337203685478e+18"; $a++
5878 /* sv_2iv *should* have made this an NV */
5879 if (flags & SVp_NOK) {
5880 (void)SvNOK_only(sv);
5884 /* I don't think we can get here. Maybe I should assert this
5885 And if we do get here I suspect that sv_setnv will croak. NWC
5887 #if defined(USE_LONG_DOUBLE)
5888 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",
5889 SvPVX(sv), SvIVX(sv), SvNVX(sv)));
5891 DEBUG_c(PerlIO_printf(Perl_debug_log,"sv_inc punt failed to convert '%s' to IOK or NOKp, UV=0x%"UVxf" NV=%g\n",
5892 SvPVX(sv), SvIVX(sv), SvNVX(sv)));
5895 #endif /* PERL_PRESERVE_IVUV */
5896 sv_setnv(sv,Atof(SvPVX(sv)) + 1.0);
5900 while (d >= SvPVX(sv)) {
5908 /* MKS: The original code here died if letters weren't consecutive.
5909 * at least it didn't have to worry about non-C locales. The
5910 * new code assumes that ('z'-'a')==('Z'-'A'), letters are
5911 * arranged in order (although not consecutively) and that only
5912 * [A-Za-z] are accepted by isALPHA in the C locale.
5914 if (*d != 'z' && *d != 'Z') {
5915 do { ++*d; } while (!isALPHA(*d));
5918 *(d--) -= 'z' - 'a';
5923 *(d--) -= 'z' - 'a' + 1;
5927 /* oh,oh, the number grew */
5928 SvGROW(sv, SvCUR(sv) + 2);
5930 for (d = SvPVX(sv) + SvCUR(sv); d > SvPVX(sv); d--)
5941 Auto-decrement of the value in the SV, doing string to numeric conversion
5942 if necessary. Handles 'get' magic.
5948 Perl_sv_dec(pTHX_ register SV *sv)
5956 if (SvTHINKFIRST(sv)) {
5957 if (SvREADONLY(sv)) {
5958 if (PL_curcop != &PL_compiling)
5959 Perl_croak(aTHX_ PL_no_modify);
5963 if (SvAMAGIC(sv) && AMG_CALLun(sv,dec))
5965 i = PTR2IV(SvRV(sv));
5970 /* Unlike sv_inc we don't have to worry about string-never-numbers
5971 and keeping them magic. But we mustn't warn on punting */
5972 flags = SvFLAGS(sv);
5973 if ((flags & SVf_IOK) || ((flags & (SVp_IOK | SVp_NOK)) == SVp_IOK)) {
5974 /* It's publicly an integer, or privately an integer-not-float */
5977 if (SvUVX(sv) == 0) {
5978 (void)SvIOK_only(sv);
5982 (void)SvIOK_only_UV(sv);
5986 if (SvIVX(sv) == IV_MIN)
5987 sv_setnv(sv, (NV)IV_MIN - 1.0);
5989 (void)SvIOK_only(sv);
5995 if (flags & SVp_NOK) {
5997 (void)SvNOK_only(sv);
6000 if (!(flags & SVp_POK)) {
6001 if ((flags & SVTYPEMASK) < SVt_PVNV)
6002 sv_upgrade(sv, SVt_NV);
6004 (void)SvNOK_only(sv);
6007 #ifdef PERL_PRESERVE_IVUV
6009 int numtype = grok_number(SvPVX(sv), SvCUR(sv), NULL);
6010 if (numtype && !(numtype & IS_NUMBER_INFINITY)) {
6011 /* Need to try really hard to see if it's an integer.
6012 9.22337203685478e+18 is an integer.
6013 but "9.22337203685478e+18" + 0 is UV=9223372036854779904
6014 so $a="9.22337203685478e+18"; $a+0; $a--
6015 needs to be the same as $a="9.22337203685478e+18"; $a--
6022 /* sv_2iv *should* have made this an NV */
6023 if (flags & SVp_NOK) {
6024 (void)SvNOK_only(sv);
6028 /* I don't think we can get here. Maybe I should assert this
6029 And if we do get here I suspect that sv_setnv will croak. NWC
6031 #if defined(USE_LONG_DOUBLE)
6032 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",
6033 SvPVX(sv), SvIVX(sv), SvNVX(sv)));
6035 DEBUG_c(PerlIO_printf(Perl_debug_log,"sv_dec punt failed to convert '%s' to IOK or NOKp, UV=0x%"UVxf" NV=%g\n",
6036 SvPVX(sv), SvIVX(sv), SvNVX(sv)));
6040 #endif /* PERL_PRESERVE_IVUV */
6041 sv_setnv(sv,Atof(SvPVX(sv)) - 1.0); /* punt */
6045 =for apidoc sv_mortalcopy
6047 Creates a new SV which is a copy of the original SV (using C<sv_setsv>).
6048 The new SV is marked as mortal. It will be destroyed when the current
6049 context ends. See also C<sv_newmortal> and C<sv_2mortal>.
6054 /* Make a string that will exist for the duration of the expression
6055 * evaluation. Actually, it may have to last longer than that, but
6056 * hopefully we won't free it until it has been assigned to a
6057 * permanent location. */
6060 Perl_sv_mortalcopy(pTHX_ SV *oldstr)
6065 sv_setsv(sv,oldstr);
6067 PL_tmps_stack[++PL_tmps_ix] = sv;
6073 =for apidoc sv_newmortal
6075 Creates a new null SV which is mortal. The reference count of the SV is
6076 set to 1. It will be destroyed when the current context ends. See
6077 also C<sv_mortalcopy> and C<sv_2mortal>.
6083 Perl_sv_newmortal(pTHX)
6088 SvFLAGS(sv) = SVs_TEMP;
6090 PL_tmps_stack[++PL_tmps_ix] = sv;
6095 =for apidoc sv_2mortal
6097 Marks an existing SV as mortal. The SV will be destroyed when the current
6098 context ends. See also C<sv_newmortal> and C<sv_mortalcopy>.
6104 Perl_sv_2mortal(pTHX_ register SV *sv)
6108 if (SvREADONLY(sv) && SvIMMORTAL(sv))
6111 PL_tmps_stack[++PL_tmps_ix] = sv;
6119 Creates a new SV and copies a string into it. The reference count for the
6120 SV is set to 1. If C<len> is zero, Perl will compute the length using
6121 strlen(). For efficiency, consider using C<newSVpvn> instead.
6127 Perl_newSVpv(pTHX_ const char *s, STRLEN len)
6134 sv_setpvn(sv,s,len);
6139 =for apidoc newSVpvn
6141 Creates a new SV and copies a string into it. The reference count for the
6142 SV is set to 1. Note that if C<len> is zero, Perl will create a zero length
6143 string. You are responsible for ensuring that the source string is at least
6150 Perl_newSVpvn(pTHX_ const char *s, STRLEN len)
6155 sv_setpvn(sv,s,len);
6160 =for apidoc newSVpvn_share
6162 Creates a new SV with its SvPVX pointing to a shared string in the string
6163 table. If the string does not already exist in the table, it is created
6164 first. Turns on READONLY and FAKE. The string's hash is stored in the UV
6165 slot of the SV; if the C<hash> parameter is non-zero, that value is used;
6166 otherwise the hash is computed. The idea here is that as the string table
6167 is used for shared hash keys these strings will have SvPVX == HeKEY and
6168 hash lookup will avoid string compare.
6174 Perl_newSVpvn_share(pTHX_ const char *src, I32 len, U32 hash)
6177 bool is_utf8 = FALSE;
6182 if (is_utf8 && !(PL_hints & HINT_UTF8_DISTINCT)) {
6183 STRLEN tmplen = len;
6184 /* See the note in hv.c:hv_fetch() --jhi */
6185 src = (char*)bytes_from_utf8((U8*)src, &tmplen, &is_utf8);
6189 PERL_HASH(hash, src, len);
6191 sv_upgrade(sv, SVt_PVIV);
6192 SvPVX(sv) = sharepvn(src, is_utf8?-len:len, hash);
6205 #if defined(PERL_IMPLICIT_CONTEXT)
6207 /* pTHX_ magic can't cope with varargs, so this is a no-context
6208 * version of the main function, (which may itself be aliased to us).
6209 * Don't access this version directly.
6213 Perl_newSVpvf_nocontext(const char* pat, ...)
6218 va_start(args, pat);
6219 sv = vnewSVpvf(pat, &args);
6226 =for apidoc newSVpvf
6228 Creates a new SV and initializes it with the string formatted like
6235 Perl_newSVpvf(pTHX_ const char* pat, ...)
6239 va_start(args, pat);
6240 sv = vnewSVpvf(pat, &args);
6245 /* backend for newSVpvf() and newSVpvf_nocontext() */
6248 Perl_vnewSVpvf(pTHX_ const char* pat, va_list* args)
6252 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
6259 Creates a new SV and copies a floating point value into it.
6260 The reference count for the SV is set to 1.
6266 Perl_newSVnv(pTHX_ NV n)
6278 Creates a new SV and copies an integer into it. The reference count for the
6285 Perl_newSViv(pTHX_ IV i)
6297 Creates a new SV and copies an unsigned integer into it.
6298 The reference count for the SV is set to 1.
6304 Perl_newSVuv(pTHX_ UV u)
6314 =for apidoc newRV_noinc
6316 Creates an RV wrapper for an SV. The reference count for the original
6317 SV is B<not> incremented.
6323 Perl_newRV_noinc(pTHX_ SV *tmpRef)
6328 sv_upgrade(sv, SVt_RV);
6335 /* newRV_inc is the official function name to use now.
6336 * newRV_inc is in fact #defined to newRV in sv.h
6340 Perl_newRV(pTHX_ SV *tmpRef)
6342 return newRV_noinc(SvREFCNT_inc(tmpRef));
6348 Creates a new SV which is an exact duplicate of the original SV.
6355 Perl_newSVsv(pTHX_ register SV *old)
6361 if (SvTYPE(old) == SVTYPEMASK) {
6362 if (ckWARN_d(WARN_INTERNAL))
6363 Perl_warner(aTHX_ WARN_INTERNAL, "semi-panic: attempt to dup freed string");
6378 =for apidoc sv_reset
6380 Underlying implementation for the C<reset> Perl function.
6381 Note that the perl-level function is vaguely deprecated.
6387 Perl_sv_reset(pTHX_ register char *s, HV *stash)
6395 char todo[PERL_UCHAR_MAX+1];
6400 if (!*s) { /* reset ?? searches */
6401 for (pm = HvPMROOT(stash); pm; pm = pm->op_pmnext) {
6402 pm->op_pmdynflags &= ~PMdf_USED;
6407 /* reset variables */
6409 if (!HvARRAY(stash))
6412 Zero(todo, 256, char);
6414 i = (unsigned char)*s;
6418 max = (unsigned char)*s++;
6419 for ( ; i <= max; i++) {
6422 for (i = 0; i <= (I32) HvMAX(stash); i++) {
6423 for (entry = HvARRAY(stash)[i];
6425 entry = HeNEXT(entry))
6427 if (!todo[(U8)*HeKEY(entry)])
6429 gv = (GV*)HeVAL(entry);
6431 if (SvTHINKFIRST(sv)) {
6432 if (!SvREADONLY(sv) && SvROK(sv))
6437 if (SvTYPE(sv) >= SVt_PV) {
6439 if (SvPVX(sv) != Nullch)
6446 if (GvHV(gv) && !HvNAME(GvHV(gv))) {
6448 #ifdef USE_ENVIRON_ARRAY
6450 environ[0] = Nullch;
6461 Using various gambits, try to get an IO from an SV: the IO slot if its a
6462 GV; or the recursive result if we're an RV; or the IO slot of the symbol
6463 named after the PV if we're a string.
6469 Perl_sv_2io(pTHX_ SV *sv)
6475 switch (SvTYPE(sv)) {
6483 Perl_croak(aTHX_ "Bad filehandle: %s", GvNAME(gv));
6487 Perl_croak(aTHX_ PL_no_usym, "filehandle");
6489 return sv_2io(SvRV(sv));
6490 gv = gv_fetchpv(SvPV(sv,n_a), FALSE, SVt_PVIO);
6496 Perl_croak(aTHX_ "Bad filehandle: %s", SvPV(sv,n_a));
6505 Using various gambits, try to get a CV from an SV; in addition, try if
6506 possible to set C<*st> and C<*gvp> to the stash and GV associated with it.
6512 Perl_sv_2cv(pTHX_ SV *sv, HV **st, GV **gvp, I32 lref)
6519 return *gvp = Nullgv, Nullcv;
6520 switch (SvTYPE(sv)) {
6539 SV **sp = &sv; /* Used in tryAMAGICunDEREF macro. */
6540 tryAMAGICunDEREF(to_cv);
6543 if (SvTYPE(sv) == SVt_PVCV) {
6552 Perl_croak(aTHX_ "Not a subroutine reference");
6557 gv = gv_fetchpv(SvPV(sv, n_a), lref, SVt_PVCV);
6563 if (lref && !GvCVu(gv)) {
6566 tmpsv = NEWSV(704,0);
6567 gv_efullname3(tmpsv, gv, Nullch);
6568 /* XXX this is probably not what they think they're getting.
6569 * It has the same effect as "sub name;", i.e. just a forward
6571 newSUB(start_subparse(FALSE, 0),
6572 newSVOP(OP_CONST, 0, tmpsv),
6577 Perl_croak(aTHX_ "Unable to create sub named \"%s\"", SvPV(sv,n_a));
6586 Returns true if the SV has a true value by Perl's rules.
6587 Use the C<SvTRUE> macro instead, which may call C<sv_true()> or may
6588 instead use an in-line version.
6594 Perl_sv_true(pTHX_ register SV *sv)
6600 if ((tXpv = (XPV*)SvANY(sv)) &&
6601 (tXpv->xpv_cur > 1 ||
6602 (tXpv->xpv_cur && *tXpv->xpv_pv != '0')))
6609 return SvIVX(sv) != 0;
6612 return SvNVX(sv) != 0.0;
6614 return sv_2bool(sv);
6622 A private implementation of the C<SvIVx> macro for compilers which can't
6623 cope with complex macro expressions. Always use the macro instead.
6629 Perl_sv_iv(pTHX_ register SV *sv)
6633 return (IV)SvUVX(sv);
6642 A private implementation of the C<SvUVx> macro for compilers which can't
6643 cope with complex macro expressions. Always use the macro instead.
6649 Perl_sv_uv(pTHX_ register SV *sv)
6654 return (UV)SvIVX(sv);
6662 A private implementation of the C<SvNVx> macro for compilers which can't
6663 cope with complex macro expressions. Always use the macro instead.
6669 Perl_sv_nv(pTHX_ register SV *sv)
6679 A private implementation of the C<SvPV_nolen> macro for compilers which can't
6680 cope with complex macro expressions. Always use the macro instead.
6686 Perl_sv_pv(pTHX_ SV *sv)
6693 return sv_2pv(sv, &n_a);
6699 A private implementation of the C<SvPV> macro for compilers which can't
6700 cope with complex macro expressions. Always use the macro instead.
6706 Perl_sv_pvn(pTHX_ SV *sv, STRLEN *lp)
6712 return sv_2pv(sv, lp);
6716 =for apidoc sv_pvn_force
6718 Get a sensible string out of the SV somehow.
6719 A private implementation of the C<SvPV_force> macro for compilers which
6720 can't cope with complex macro expressions. Always use the macro instead.
6726 Perl_sv_pvn_force(pTHX_ SV *sv, STRLEN *lp)
6728 return sv_pvn_force_flags(sv, lp, SV_GMAGIC);
6732 =for apidoc sv_pvn_force_flags
6734 Get a sensible string out of the SV somehow.
6735 If C<flags> has C<SV_GMAGIC> bit set, will C<mg_get> on C<sv> if
6736 appropriate, else not. C<sv_pvn_force> and C<sv_pvn_force_nomg> are
6737 implemented in terms of this function.
6738 You normally want to use the various wrapper macros instead: see
6739 C<SvPV_force> and C<SvPV_force_nomg>
6745 Perl_sv_pvn_force_flags(pTHX_ SV *sv, STRLEN *lp, I32 flags)
6749 if (SvTHINKFIRST(sv) && !SvROK(sv))
6750 sv_force_normal(sv);
6756 if (SvTYPE(sv) > SVt_PVLV && SvTYPE(sv) != SVt_PVFM) {
6757 Perl_croak(aTHX_ "Can't coerce %s to string in %s", sv_reftype(sv,0),
6758 PL_op_name[PL_op->op_type]);
6761 s = sv_2pv_flags(sv, lp, flags);
6762 if (s != SvPVX(sv)) { /* Almost, but not quite, sv_setpvn() */
6767 (void)SvUPGRADE(sv, SVt_PV); /* Never FALSE */
6768 SvGROW(sv, len + 1);
6769 Move(s,SvPVX(sv),len,char);
6774 SvPOK_on(sv); /* validate pointer */
6776 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2pv(%s)\n",
6777 PTR2UV(sv),SvPVX(sv)));
6784 =for apidoc sv_pvbyte
6786 A private implementation of the C<SvPVbyte_nolen> macro for compilers
6787 which can't cope with complex macro expressions. Always use the macro
6794 Perl_sv_pvbyte(pTHX_ SV *sv)
6796 sv_utf8_downgrade(sv,0);
6801 =for apidoc sv_pvbyten
6803 A private implementation of the C<SvPVbyte> macro for compilers
6804 which can't cope with complex macro expressions. Always use the macro
6811 Perl_sv_pvbyten(pTHX_ SV *sv, STRLEN *lp)
6813 sv_utf8_downgrade(sv,0);
6814 return sv_pvn(sv,lp);
6818 =for apidoc sv_pvbyten_force
6820 A private implementation of the C<SvPVbytex_force> macro for compilers
6821 which can't cope with complex macro expressions. Always use the macro
6828 Perl_sv_pvbyten_force(pTHX_ SV *sv, STRLEN *lp)
6830 sv_utf8_downgrade(sv,0);
6831 return sv_pvn_force(sv,lp);
6835 =for apidoc sv_pvutf8
6837 A private implementation of the C<SvPVutf8_nolen> macro for compilers
6838 which can't cope with complex macro expressions. Always use the macro
6845 Perl_sv_pvutf8(pTHX_ SV *sv)
6847 sv_utf8_upgrade(sv);
6852 =for apidoc sv_pvutf8n
6854 A private implementation of the C<SvPVutf8> macro for compilers
6855 which can't cope with complex macro expressions. Always use the macro
6862 Perl_sv_pvutf8n(pTHX_ SV *sv, STRLEN *lp)
6864 sv_utf8_upgrade(sv);
6865 return sv_pvn(sv,lp);
6869 =for apidoc sv_pvutf8n_force
6871 A private implementation of the C<SvPVutf8_force> macro for compilers
6872 which can't cope with complex macro expressions. Always use the macro
6879 Perl_sv_pvutf8n_force(pTHX_ SV *sv, STRLEN *lp)
6881 sv_utf8_upgrade(sv);
6882 return sv_pvn_force(sv,lp);
6886 =for apidoc sv_reftype
6888 Returns a string describing what the SV is a reference to.
6894 Perl_sv_reftype(pTHX_ SV *sv, int ob)
6896 if (ob && SvOBJECT(sv))
6897 return HvNAME(SvSTASH(sv));
6899 switch (SvTYPE(sv)) {
6913 case SVt_PVLV: return "LVALUE";
6914 case SVt_PVAV: return "ARRAY";
6915 case SVt_PVHV: return "HASH";
6916 case SVt_PVCV: return "CODE";
6917 case SVt_PVGV: return "GLOB";
6918 case SVt_PVFM: return "FORMAT";
6919 case SVt_PVIO: return "IO";
6920 default: return "UNKNOWN";
6926 =for apidoc sv_isobject
6928 Returns a boolean indicating whether the SV is an RV pointing to a blessed
6929 object. If the SV is not an RV, or if the object is not blessed, then this
6936 Perl_sv_isobject(pTHX_ SV *sv)
6953 Returns a boolean indicating whether the SV is blessed into the specified
6954 class. This does not check for subtypes; use C<sv_derived_from> to verify
6955 an inheritance relationship.
6961 Perl_sv_isa(pTHX_ SV *sv, const char *name)
6973 return strEQ(HvNAME(SvSTASH(sv)), name);
6979 Creates a new SV for the RV, C<rv>, to point to. If C<rv> is not an RV then
6980 it will be upgraded to one. If C<classname> is non-null then the new SV will
6981 be blessed in the specified package. The new SV is returned and its
6982 reference count is 1.
6988 Perl_newSVrv(pTHX_ SV *rv, const char *classname)
6994 SV_CHECK_THINKFIRST(rv);
6997 if (SvTYPE(rv) >= SVt_PVMG) {
6998 U32 refcnt = SvREFCNT(rv);
7002 SvREFCNT(rv) = refcnt;
7005 if (SvTYPE(rv) < SVt_RV)
7006 sv_upgrade(rv, SVt_RV);
7007 else if (SvTYPE(rv) > SVt_RV) {
7008 (void)SvOOK_off(rv);
7009 if (SvPVX(rv) && SvLEN(rv))
7010 Safefree(SvPVX(rv));
7020 HV* stash = gv_stashpv(classname, TRUE);
7021 (void)sv_bless(rv, stash);
7027 =for apidoc sv_setref_pv
7029 Copies a pointer into a new SV, optionally blessing the SV. The C<rv>
7030 argument will be upgraded to an RV. That RV will be modified to point to
7031 the new SV. If the C<pv> argument is NULL then C<PL_sv_undef> will be placed
7032 into the SV. The C<classname> argument indicates the package for the
7033 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
7034 will be returned and will have a reference count of 1.
7036 Do not use with other Perl types such as HV, AV, SV, CV, because those
7037 objects will become corrupted by the pointer copy process.
7039 Note that C<sv_setref_pvn> copies the string while this copies the pointer.
7045 Perl_sv_setref_pv(pTHX_ SV *rv, const char *classname, void *pv)
7048 sv_setsv(rv, &PL_sv_undef);
7052 sv_setiv(newSVrv(rv,classname), PTR2IV(pv));
7057 =for apidoc sv_setref_iv
7059 Copies an integer into a new SV, optionally blessing the SV. The C<rv>
7060 argument will be upgraded to an RV. That RV will be modified to point to
7061 the new SV. The C<classname> argument indicates the package for the
7062 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
7063 will be returned and will have a reference count of 1.
7069 Perl_sv_setref_iv(pTHX_ SV *rv, const char *classname, IV iv)
7071 sv_setiv(newSVrv(rv,classname), iv);
7076 =for apidoc sv_setref_uv
7078 Copies an unsigned integer into a new SV, optionally blessing the SV. The C<rv>
7079 argument will be upgraded to an RV. That RV will be modified to point to
7080 the new SV. The C<classname> argument indicates the package for the
7081 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
7082 will be returned and will have a reference count of 1.
7088 Perl_sv_setref_uv(pTHX_ SV *rv, const char *classname, UV uv)
7090 sv_setuv(newSVrv(rv,classname), uv);
7095 =for apidoc sv_setref_nv
7097 Copies a double into a new SV, optionally blessing the SV. The C<rv>
7098 argument will be upgraded to an RV. That RV will be modified to point to
7099 the new SV. The C<classname> argument indicates the package for the
7100 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
7101 will be returned and will have a reference count of 1.
7107 Perl_sv_setref_nv(pTHX_ SV *rv, const char *classname, NV nv)
7109 sv_setnv(newSVrv(rv,classname), nv);
7114 =for apidoc sv_setref_pvn
7116 Copies a string into a new SV, optionally blessing the SV. The length of the
7117 string must be specified with C<n>. The C<rv> argument will be upgraded to
7118 an RV. That RV will be modified to point to the new SV. The C<classname>
7119 argument indicates the package for the blessing. Set C<classname> to
7120 C<Nullch> to avoid the blessing. The new SV will be returned and will have
7121 a reference count of 1.
7123 Note that C<sv_setref_pv> copies the pointer while this copies the string.
7129 Perl_sv_setref_pvn(pTHX_ SV *rv, const char *classname, char *pv, STRLEN n)
7131 sv_setpvn(newSVrv(rv,classname), pv, n);
7136 =for apidoc sv_bless
7138 Blesses an SV into a specified package. The SV must be an RV. The package
7139 must be designated by its stash (see C<gv_stashpv()>). The reference count
7140 of the SV is unaffected.
7146 Perl_sv_bless(pTHX_ SV *sv, HV *stash)
7150 Perl_croak(aTHX_ "Can't bless non-reference value");
7152 if (SvFLAGS(tmpRef) & (SVs_OBJECT|SVf_READONLY)) {
7153 if (SvREADONLY(tmpRef))
7154 Perl_croak(aTHX_ PL_no_modify);
7155 if (SvOBJECT(tmpRef)) {
7156 if (SvTYPE(tmpRef) != SVt_PVIO)
7158 SvREFCNT_dec(SvSTASH(tmpRef));
7161 SvOBJECT_on(tmpRef);
7162 if (SvTYPE(tmpRef) != SVt_PVIO)
7164 (void)SvUPGRADE(tmpRef, SVt_PVMG);
7165 SvSTASH(tmpRef) = (HV*)SvREFCNT_inc(stash);
7175 /* Downgrades a PVGV to a PVMG.
7177 * XXX This function doesn't actually appear to be used anywhere
7182 S_sv_unglob(pTHX_ SV *sv)
7186 assert(SvTYPE(sv) == SVt_PVGV);
7191 SvREFCNT_dec(GvSTASH(sv));
7192 GvSTASH(sv) = Nullhv;
7194 sv_unmagic(sv, PERL_MAGIC_glob);
7195 Safefree(GvNAME(sv));
7198 /* need to keep SvANY(sv) in the right arena */
7199 xpvmg = new_XPVMG();
7200 StructCopy(SvANY(sv), xpvmg, XPVMG);
7201 del_XPVGV(SvANY(sv));
7204 SvFLAGS(sv) &= ~SVTYPEMASK;
7205 SvFLAGS(sv) |= SVt_PVMG;
7209 =for apidoc sv_unref_flags
7211 Unsets the RV status of the SV, and decrements the reference count of
7212 whatever was being referenced by the RV. This can almost be thought of
7213 as a reversal of C<newSVrv>. The C<cflags> argument can contain
7214 C<SV_IMMEDIATE_UNREF> to force the reference count to be decremented
7215 (otherwise the decrementing is conditional on the reference count being
7216 different from one or the reference being a readonly SV).
7223 Perl_sv_unref_flags(pTHX_ SV *sv, U32 flags)
7227 if (SvWEAKREF(sv)) {
7235 if (SvREFCNT(rv) != 1 || SvREADONLY(rv) || flags) /* SV_IMMEDIATE_UNREF */
7237 else /* XXX Hack, but hard to make $a=$a->[1] work otherwise */
7238 sv_2mortal(rv); /* Schedule for freeing later */
7242 =for apidoc sv_unref
7244 Unsets the RV status of the SV, and decrements the reference count of
7245 whatever was being referenced by the RV. This can almost be thought of
7246 as a reversal of C<newSVrv>. This is C<sv_unref_flags> with the C<flag>
7247 being zero. See C<SvROK_off>.
7253 Perl_sv_unref(pTHX_ SV *sv)
7255 sv_unref_flags(sv, 0);
7259 =for apidoc sv_taint
7261 Taint an SV. Use C<SvTAINTED_on> instead.
7266 Perl_sv_taint(pTHX_ SV *sv)
7268 sv_magic((sv), Nullsv, PERL_MAGIC_taint, Nullch, 0);
7272 =for apidoc sv_untaint
7274 Untaint an SV. Use C<SvTAINTED_off> instead.
7279 Perl_sv_untaint(pTHX_ SV *sv)
7281 if (SvTYPE(sv) >= SVt_PVMG && SvMAGIC(sv)) {
7282 MAGIC *mg = mg_find(sv, PERL_MAGIC_taint);
7289 =for apidoc sv_tainted
7291 Test an SV for taintedness. Use C<SvTAINTED> instead.
7296 Perl_sv_tainted(pTHX_ SV *sv)
7298 if (SvTYPE(sv) >= SVt_PVMG && SvMAGIC(sv)) {
7299 MAGIC *mg = mg_find(sv, PERL_MAGIC_taint);
7300 if (mg && ((mg->mg_len & 1) || ((mg->mg_len & 2) && mg->mg_obj == sv)))
7307 =for apidoc sv_setpviv
7309 Copies an integer into the given SV, also updating its string value.
7310 Does not handle 'set' magic. See C<sv_setpviv_mg>.
7316 Perl_sv_setpviv(pTHX_ SV *sv, IV iv)
7318 char buf[TYPE_CHARS(UV)];
7320 char *ptr = uiv_2buf(buf, iv, 0, 0, &ebuf);
7322 sv_setpvn(sv, ptr, ebuf - ptr);
7326 =for apidoc sv_setpviv_mg
7328 Like C<sv_setpviv>, but also handles 'set' magic.
7334 Perl_sv_setpviv_mg(pTHX_ SV *sv, IV iv)
7336 char buf[TYPE_CHARS(UV)];
7338 char *ptr = uiv_2buf(buf, iv, 0, 0, &ebuf);
7340 sv_setpvn(sv, ptr, ebuf - ptr);
7344 #if defined(PERL_IMPLICIT_CONTEXT)
7346 /* pTHX_ magic can't cope with varargs, so this is a no-context
7347 * version of the main function, (which may itself be aliased to us).
7348 * Don't access this version directly.
7352 Perl_sv_setpvf_nocontext(SV *sv, const char* pat, ...)
7356 va_start(args, pat);
7357 sv_vsetpvf(sv, pat, &args);
7361 /* pTHX_ magic can't cope with varargs, so this is a no-context
7362 * version of the main function, (which may itself be aliased to us).
7363 * Don't access this version directly.
7367 Perl_sv_setpvf_mg_nocontext(SV *sv, const char* pat, ...)
7371 va_start(args, pat);
7372 sv_vsetpvf_mg(sv, pat, &args);
7378 =for apidoc sv_setpvf
7380 Processes its arguments like C<sprintf> and sets an SV to the formatted
7381 output. Does not handle 'set' magic. See C<sv_setpvf_mg>.
7387 Perl_sv_setpvf(pTHX_ SV *sv, const char* pat, ...)
7390 va_start(args, pat);
7391 sv_vsetpvf(sv, pat, &args);
7395 /* backend for C<sv_setpvf> and C<sv_setpvf_nocontext> */
7398 Perl_sv_vsetpvf(pTHX_ SV *sv, const char* pat, va_list* args)
7400 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
7404 =for apidoc sv_setpvf_mg
7406 Like C<sv_setpvf>, but also handles 'set' magic.
7412 Perl_sv_setpvf_mg(pTHX_ SV *sv, const char* pat, ...)
7415 va_start(args, pat);
7416 sv_vsetpvf_mg(sv, pat, &args);
7420 /* backend for C<sv_setpvf_mg> C<setpvf_mg_nocontext> */
7423 Perl_sv_vsetpvf_mg(pTHX_ SV *sv, const char* pat, va_list* args)
7425 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
7429 #if defined(PERL_IMPLICIT_CONTEXT)
7431 /* pTHX_ magic can't cope with varargs, so this is a no-context
7432 * version of the main function, (which may itself be aliased to us).
7433 * Don't access this version directly.
7437 Perl_sv_catpvf_nocontext(SV *sv, const char* pat, ...)
7441 va_start(args, pat);
7442 sv_vcatpvf(sv, pat, &args);
7446 /* pTHX_ magic can't cope with varargs, so this is a no-context
7447 * version of the main function, (which may itself be aliased to us).
7448 * Don't access this version directly.
7452 Perl_sv_catpvf_mg_nocontext(SV *sv, const char* pat, ...)
7456 va_start(args, pat);
7457 sv_vcatpvf_mg(sv, pat, &args);
7463 =for apidoc sv_catpvf
7465 Processes its arguments like C<sprintf> and appends the formatted
7466 output to an SV. If the appended data contains "wide" characters
7467 (including, but not limited to, SVs with a UTF-8 PV formatted with %s,
7468 and characters >255 formatted with %c), the original SV might get
7469 upgraded to UTF-8. Handles 'get' magic, but not 'set' magic.
7470 C<SvSETMAGIC()> must typically be called after calling this function
7471 to handle 'set' magic.
7476 Perl_sv_catpvf(pTHX_ SV *sv, const char* pat, ...)
7479 va_start(args, pat);
7480 sv_vcatpvf(sv, pat, &args);
7484 /* backend for C<sv_catpvf> and C<catpvf_mg_nocontext> */
7487 Perl_sv_vcatpvf(pTHX_ SV *sv, const char* pat, va_list* args)
7489 sv_vcatpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
7493 =for apidoc sv_catpvf_mg
7495 Like C<sv_catpvf>, but also handles 'set' magic.
7501 Perl_sv_catpvf_mg(pTHX_ SV *sv, const char* pat, ...)
7504 va_start(args, pat);
7505 sv_vcatpvf_mg(sv, pat, &args);
7509 /* backend for C<catpvf_mg> and C<catpvf_mg_nocontext> */
7512 Perl_sv_vcatpvf_mg(pTHX_ SV *sv, const char* pat, va_list* args)
7514 sv_vcatpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
7519 =for apidoc sv_vsetpvfn
7521 Works like C<vcatpvfn> but copies the text into the SV instead of
7524 Usually used via one of its frontends C<sv_setpvf> and C<sv_setpvf_mg>.
7530 Perl_sv_vsetpvfn(pTHX_ SV *sv, const char *pat, STRLEN patlen, va_list *args, SV **svargs, I32 svmax, bool *maybe_tainted)
7532 sv_setpvn(sv, "", 0);
7533 sv_vcatpvfn(sv, pat, patlen, args, svargs, svmax, maybe_tainted);
7536 /* private function for use in sv_vcatpvfn via the EXPECT_NUMBER macro */
7539 S_expect_number(pTHX_ char** pattern)
7542 switch (**pattern) {
7543 case '1': case '2': case '3':
7544 case '4': case '5': case '6':
7545 case '7': case '8': case '9':
7546 while (isDIGIT(**pattern))
7547 var = var * 10 + (*(*pattern)++ - '0');
7551 #define EXPECT_NUMBER(pattern, var) (var = S_expect_number(aTHX_ &pattern))
7554 =for apidoc sv_vcatpvfn
7556 Processes its arguments like C<vsprintf> and appends the formatted output
7557 to an SV. Uses an array of SVs if the C style variable argument list is
7558 missing (NULL). When running with taint checks enabled, indicates via
7559 C<maybe_tainted> if results are untrustworthy (often due to the use of
7562 Usually used via one of its frontends C<sv_catpvf> and C<sv_catpvf_mg>.
7568 Perl_sv_vcatpvfn(pTHX_ SV *sv, const char *pat, STRLEN patlen, va_list *args, SV **svargs, I32 svmax, bool *maybe_tainted)
7575 static char nullstr[] = "(null)";
7578 /* no matter what, this is a string now */
7579 (void)SvPV_force(sv, origlen);
7581 /* special-case "", "%s", and "%_" */
7584 if (patlen == 2 && pat[0] == '%') {
7588 char *s = va_arg(*args, char*);
7589 sv_catpv(sv, s ? s : nullstr);
7591 else if (svix < svmax) {
7592 sv_catsv(sv, *svargs);
7593 if (DO_UTF8(*svargs))
7599 argsv = va_arg(*args, SV*);
7600 sv_catsv(sv, argsv);
7605 /* See comment on '_' below */
7610 patend = (char*)pat + patlen;
7611 for (p = (char*)pat; p < patend; p = q) {
7614 bool vectorize = FALSE;
7615 bool vectorarg = FALSE;
7616 bool vec_utf = FALSE;
7622 bool has_precis = FALSE;
7624 bool is_utf = FALSE;
7627 U8 utf8buf[UTF8_MAXLEN+1];
7628 STRLEN esignlen = 0;
7630 char *eptr = Nullch;
7632 /* Times 4: a decimal digit takes more than 3 binary digits.
7633 * NV_DIG: mantissa takes than many decimal digits.
7634 * Plus 32: Playing safe. */
7635 char ebuf[IV_DIG * 4 + NV_DIG + 32];
7636 /* large enough for "%#.#f" --chip */
7637 /* what about long double NVs? --jhi */
7640 U8 *vecstr = Null(U8*);
7652 STRLEN dotstrlen = 1;
7653 I32 efix = 0; /* explicit format parameter index */
7654 I32 ewix = 0; /* explicit width index */
7655 I32 epix = 0; /* explicit precision index */
7656 I32 evix = 0; /* explicit vector index */
7657 bool asterisk = FALSE;
7659 /* echo everything up to the next format specification */
7660 for (q = p; q < patend && *q != '%'; ++q) ;
7662 sv_catpvn(sv, p, q - p);
7669 We allow format specification elements in this order:
7670 \d+\$ explicit format parameter index
7672 \*?(\d+\$)?v vector with optional (optionally specified) arg
7673 \d+|\*(\d+\$)? width using optional (optionally specified) arg
7674 \.(\d*|\*(\d+\$)?) precision using optional (optionally specified) arg
7676 [%bcdefginopsux_DFOUX] format (mandatory)
7678 if (EXPECT_NUMBER(q, width)) {
7719 if (EXPECT_NUMBER(q, ewix))
7728 if ((vectorarg = asterisk)) {
7738 EXPECT_NUMBER(q, width);
7743 vecsv = va_arg(*args, SV*);
7745 vecsv = (evix ? evix <= svmax : svix < svmax) ?
7746 svargs[ewix ? ewix-1 : svix++] : &PL_sv_undef;
7747 dotstr = SvPVx(vecsv, dotstrlen);
7752 vecsv = va_arg(*args, SV*);
7753 vecstr = (U8*)SvPVx(vecsv,veclen);
7754 vec_utf = DO_UTF8(vecsv);
7756 else if (efix ? efix <= svmax : svix < svmax) {
7757 vecsv = svargs[efix ? efix-1 : svix++];
7758 vecstr = (U8*)SvPVx(vecsv,veclen);
7759 vec_utf = DO_UTF8(vecsv);
7769 i = va_arg(*args, int);
7771 i = (ewix ? ewix <= svmax : svix < svmax) ?
7772 SvIVx(svargs[ewix ? ewix-1 : svix++]) : 0;
7774 width = (i < 0) ? -i : i;
7784 if (EXPECT_NUMBER(q, epix) && *q++ != '$')
7787 i = va_arg(*args, int);
7789 i = (ewix ? ewix <= svmax : svix < svmax)
7790 ? SvIVx(svargs[ewix ? ewix-1 : svix++]) : 0;
7791 precis = (i < 0) ? 0 : i;
7796 precis = precis * 10 + (*q++ - '0');
7804 #if defined(HAS_QUAD) || (defined(HAS_LONG_DOUBLE) && defined(USE_LONG_DOUBLE))
7815 #if defined(HAS_QUAD) || (defined(HAS_LONG_DOUBLE) && defined(USE_LONG_DOUBLE))
7816 if (*(q + 1) == 'l') { /* lld, llf */
7839 argsv = (efix ? efix <= svmax : svix < svmax) ?
7840 svargs[efix ? efix-1 : svix++] : &PL_sv_undef;
7847 uv = args ? va_arg(*args, int) : SvIVx(argsv);
7849 (!UNI_IS_INVARIANT(uv) && SvUTF8(sv)))
7851 eptr = (char*)utf8buf;
7852 elen = uvchr_to_utf8((U8*)eptr, uv) - utf8buf;
7864 eptr = va_arg(*args, char*);
7866 #ifdef MACOS_TRADITIONAL
7867 /* On MacOS, %#s format is used for Pascal strings */
7872 elen = strlen(eptr);
7875 elen = sizeof nullstr - 1;
7879 eptr = SvPVx(argsv, elen);
7880 if (DO_UTF8(argsv)) {
7881 if (has_precis && precis < elen) {
7883 sv_pos_u2b(argsv, &p, 0); /* sticks at end */
7886 if (width) { /* fudge width (can't fudge elen) */
7887 width += elen - sv_len_utf8(argsv);
7896 * The "%_" hack might have to be changed someday,
7897 * if ISO or ANSI decide to use '_' for something.
7898 * So we keep it hidden from users' code.
7902 argsv = va_arg(*args, SV*);
7903 eptr = SvPVx(argsv, elen);
7909 if (has_precis && elen > precis)
7918 uv = PTR2UV(args ? va_arg(*args, void*) : argsv);
7936 iv = (IV)utf8n_to_uvchr(vecstr, veclen, &ulen, 0);
7946 case 'h': iv = (short)va_arg(*args, int); break;
7947 default: iv = va_arg(*args, int); break;
7948 case 'l': iv = va_arg(*args, long); break;
7949 case 'V': iv = va_arg(*args, IV); break;
7951 case 'q': iv = va_arg(*args, Quad_t); break;
7958 case 'h': iv = (short)iv; break;
7960 case 'l': iv = (long)iv; break;
7963 case 'q': iv = (Quad_t)iv; break;
7970 esignbuf[esignlen++] = plus;
7974 esignbuf[esignlen++] = '-';
8016 uv = utf8n_to_uvchr(vecstr, veclen, &ulen, 0);
8026 case 'h': uv = (unsigned short)va_arg(*args, unsigned); break;
8027 default: uv = va_arg(*args, unsigned); break;
8028 case 'l': uv = va_arg(*args, unsigned long); break;
8029 case 'V': uv = va_arg(*args, UV); break;
8031 case 'q': uv = va_arg(*args, Quad_t); break;
8038 case 'h': uv = (unsigned short)uv; break;
8040 case 'l': uv = (unsigned long)uv; break;
8043 case 'q': uv = (Quad_t)uv; break;
8049 eptr = ebuf + sizeof ebuf;
8055 p = (char*)((c == 'X')
8056 ? "0123456789ABCDEF" : "0123456789abcdef");
8062 esignbuf[esignlen++] = '0';
8063 esignbuf[esignlen++] = c; /* 'x' or 'X' */
8069 *--eptr = '0' + dig;
8071 if (alt && *eptr != '0')
8077 *--eptr = '0' + dig;
8080 esignbuf[esignlen++] = '0';
8081 esignbuf[esignlen++] = 'b';
8084 default: /* it had better be ten or less */
8085 #if defined(PERL_Y2KWARN)
8086 if (ckWARN(WARN_Y2K)) {
8088 char *s = SvPV(sv,n);
8089 if (n >= 2 && s[n-2] == '1' && s[n-1] == '9'
8090 && (n == 2 || !isDIGIT(s[n-3])))
8092 Perl_warner(aTHX_ WARN_Y2K,
8093 "Possible Y2K bug: %%%c %s",
8094 c, "format string following '19'");
8100 *--eptr = '0' + dig;
8101 } while (uv /= base);
8104 elen = (ebuf + sizeof ebuf) - eptr;
8107 zeros = precis - elen;
8108 else if (precis == 0 && elen == 1 && *eptr == '0')
8113 /* FLOATING POINT */
8116 c = 'f'; /* maybe %F isn't supported here */
8122 /* This is evil, but floating point is even more evil */
8125 nv = args ? va_arg(*args, NV) : SvNVx(argsv);
8128 if (c != 'e' && c != 'E') {
8130 (void)Perl_frexp(nv, &i);
8131 if (i == PERL_INT_MIN)
8132 Perl_die(aTHX_ "panic: frexp");
8134 need = BIT_DIGITS(i);
8136 need += has_precis ? precis : 6; /* known default */
8140 need += 20; /* fudge factor */
8141 if (PL_efloatsize < need) {
8142 Safefree(PL_efloatbuf);
8143 PL_efloatsize = need + 20; /* more fudge */
8144 New(906, PL_efloatbuf, PL_efloatsize, char);
8145 PL_efloatbuf[0] = '\0';
8148 eptr = ebuf + sizeof ebuf;
8151 #if defined(USE_LONG_DOUBLE) && defined(PERL_PRIfldbl)
8153 /* Copy the one or more characters in a long double
8154 * format before the 'base' ([efgEFG]) character to
8155 * the format string. */
8156 static char const prifldbl[] = PERL_PRIfldbl;
8157 char const *p = prifldbl + sizeof(prifldbl) - 3;
8158 while (p >= prifldbl) { *--eptr = *p--; }
8163 do { *--eptr = '0' + (base % 10); } while (base /= 10);
8168 do { *--eptr = '0' + (base % 10); } while (base /= 10);
8180 /* No taint. Otherwise we are in the strange situation
8181 * where printf() taints but print($float) doesn't.
8183 (void)sprintf(PL_efloatbuf, eptr, nv);
8185 eptr = PL_efloatbuf;
8186 elen = strlen(PL_efloatbuf);
8193 i = SvCUR(sv) - origlen;
8196 case 'h': *(va_arg(*args, short*)) = i; break;
8197 default: *(va_arg(*args, int*)) = i; break;
8198 case 'l': *(va_arg(*args, long*)) = i; break;
8199 case 'V': *(va_arg(*args, IV*)) = i; break;
8201 case 'q': *(va_arg(*args, Quad_t*)) = i; break;
8206 sv_setuv_mg(argsv, (UV)i);
8207 continue; /* not "break" */
8214 if (!args && ckWARN(WARN_PRINTF) &&
8215 (PL_op->op_type == OP_PRTF || PL_op->op_type == OP_SPRINTF)) {
8216 SV *msg = sv_newmortal();
8217 Perl_sv_setpvf(aTHX_ msg, "Invalid conversion in %s: ",
8218 (PL_op->op_type == OP_PRTF) ? "printf" : "sprintf");
8221 Perl_sv_catpvf(aTHX_ msg,
8222 "\"%%%c\"", c & 0xFF);
8224 Perl_sv_catpvf(aTHX_ msg,
8225 "\"%%\\%03"UVof"\"",
8228 sv_catpv(msg, "end of string");
8229 Perl_warner(aTHX_ WARN_PRINTF, "%"SVf, msg); /* yes, this is reentrant */
8232 /* output mangled stuff ... */
8238 /* ... right here, because formatting flags should not apply */
8239 SvGROW(sv, SvCUR(sv) + elen + 1);
8241 Copy(eptr, p, elen, char);
8244 SvCUR(sv) = p - SvPVX(sv);
8245 continue; /* not "break" */
8248 have = esignlen + zeros + elen;
8249 need = (have > width ? have : width);
8252 SvGROW(sv, SvCUR(sv) + need + dotstrlen + 1);
8254 if (esignlen && fill == '0') {
8255 for (i = 0; i < esignlen; i++)
8259 memset(p, fill, gap);
8262 if (esignlen && fill != '0') {
8263 for (i = 0; i < esignlen; i++)
8267 for (i = zeros; i; i--)
8271 Copy(eptr, p, elen, char);
8275 memset(p, ' ', gap);
8280 Copy(dotstr, p, dotstrlen, char);
8284 vectorize = FALSE; /* done iterating over vecstr */
8289 SvCUR(sv) = p - SvPVX(sv);
8297 /* =========================================================================
8299 =head1 Cloning an interpreter
8301 All the macros and functions in this section are for the private use of
8302 the main function, perl_clone().
8304 The foo_dup() functions make an exact copy of an existing foo thinngy.
8305 During the course of a cloning, a hash table is used to map old addresses
8306 to new addresses. The table is created and manipulated with the
8307 ptr_table_* functions.
8311 ============================================================================*/
8314 #if defined(USE_ITHREADS)
8316 #if defined(USE_THREADS)
8317 # include "error: USE_THREADS and USE_ITHREADS are incompatible"
8320 #ifndef GpREFCNT_inc
8321 # define GpREFCNT_inc(gp) ((gp) ? (++(gp)->gp_refcnt, (gp)) : (GP*)NULL)
8325 #define sv_dup_inc(s,t) SvREFCNT_inc(sv_dup(s,t))
8326 #define av_dup(s,t) (AV*)sv_dup((SV*)s,t)
8327 #define av_dup_inc(s,t) (AV*)SvREFCNT_inc(sv_dup((SV*)s,t))
8328 #define hv_dup(s,t) (HV*)sv_dup((SV*)s,t)
8329 #define hv_dup_inc(s,t) (HV*)SvREFCNT_inc(sv_dup((SV*)s,t))
8330 #define cv_dup(s,t) (CV*)sv_dup((SV*)s,t)
8331 #define cv_dup_inc(s,t) (CV*)SvREFCNT_inc(sv_dup((SV*)s,t))
8332 #define io_dup(s,t) (IO*)sv_dup((SV*)s,t)
8333 #define io_dup_inc(s,t) (IO*)SvREFCNT_inc(sv_dup((SV*)s,t))
8334 #define gv_dup(s,t) (GV*)sv_dup((SV*)s,t)
8335 #define gv_dup_inc(s,t) (GV*)SvREFCNT_inc(sv_dup((SV*)s,t))
8336 #define SAVEPV(p) (p ? savepv(p) : Nullch)
8337 #define SAVEPVN(p,n) (p ? savepvn(p,n) : Nullch)
8341 /* duplicate a regexp */
8344 Perl_re_dup(pTHX_ REGEXP *r)
8346 /* XXX fix when pmop->op_pmregexp becomes shared */
8347 return ReREFCNT_inc(r);
8350 /* duplicate a file handle */
8353 Perl_fp_dup(pTHX_ PerlIO *fp, char type)
8357 return (PerlIO*)NULL;
8359 /* look for it in the table first */
8360 ret = (PerlIO*)ptr_table_fetch(PL_ptr_table, fp);
8364 /* create anew and remember what it is */
8365 ret = PerlIO_fdupopen(aTHX_ fp);
8366 ptr_table_store(PL_ptr_table, fp, ret);
8370 /* duplicate a directory handle */
8373 Perl_dirp_dup(pTHX_ DIR *dp)
8381 /* duplicate a typeglob */
8384 Perl_gp_dup(pTHX_ GP *gp, clone_params* param)
8389 /* look for it in the table first */
8390 ret = (GP*)ptr_table_fetch(PL_ptr_table, gp);
8394 /* create anew and remember what it is */
8395 Newz(0, ret, 1, GP);
8396 ptr_table_store(PL_ptr_table, gp, ret);
8399 ret->gp_refcnt = 0; /* must be before any other dups! */
8400 ret->gp_sv = sv_dup_inc(gp->gp_sv, param);
8401 ret->gp_io = io_dup_inc(gp->gp_io, param);
8402 ret->gp_form = cv_dup_inc(gp->gp_form, param);
8403 ret->gp_av = av_dup_inc(gp->gp_av, param);
8404 ret->gp_hv = hv_dup_inc(gp->gp_hv, param);
8405 ret->gp_egv = gv_dup(gp->gp_egv, param);/* GvEGV is not refcounted */
8406 ret->gp_cv = cv_dup_inc(gp->gp_cv, param);
8407 ret->gp_cvgen = gp->gp_cvgen;
8408 ret->gp_flags = gp->gp_flags;
8409 ret->gp_line = gp->gp_line;
8410 ret->gp_file = gp->gp_file; /* points to COP.cop_file */
8414 /* duplicate a chain of magic */
8417 Perl_mg_dup(pTHX_ MAGIC *mg, clone_params* param)
8419 MAGIC *mgprev = (MAGIC*)NULL;
8422 return (MAGIC*)NULL;
8423 /* look for it in the table first */
8424 mgret = (MAGIC*)ptr_table_fetch(PL_ptr_table, mg);
8428 for (; mg; mg = mg->mg_moremagic) {
8430 Newz(0, nmg, 1, MAGIC);
8432 mgprev->mg_moremagic = nmg;
8435 nmg->mg_virtual = mg->mg_virtual; /* XXX copy dynamic vtable? */
8436 nmg->mg_private = mg->mg_private;
8437 nmg->mg_type = mg->mg_type;
8438 nmg->mg_flags = mg->mg_flags;
8439 if (mg->mg_type == PERL_MAGIC_qr) {
8440 nmg->mg_obj = (SV*)re_dup((REGEXP*)mg->mg_obj);
8443 nmg->mg_obj = (mg->mg_flags & MGf_REFCOUNTED)
8444 ? sv_dup_inc(mg->mg_obj, param)
8445 : sv_dup(mg->mg_obj, param);
8447 nmg->mg_len = mg->mg_len;
8448 nmg->mg_ptr = mg->mg_ptr; /* XXX random ptr? */
8449 if (mg->mg_ptr && mg->mg_type != PERL_MAGIC_regex_global) {
8450 if (mg->mg_len >= 0) {
8451 nmg->mg_ptr = SAVEPVN(mg->mg_ptr, mg->mg_len);
8452 if (mg->mg_type == PERL_MAGIC_overload_table &&
8453 AMT_AMAGIC((AMT*)mg->mg_ptr))
8455 AMT *amtp = (AMT*)mg->mg_ptr;
8456 AMT *namtp = (AMT*)nmg->mg_ptr;
8458 for (i = 1; i < NofAMmeth; i++) {
8459 namtp->table[i] = cv_dup_inc(amtp->table[i], param);
8463 else if (mg->mg_len == HEf_SVKEY)
8464 nmg->mg_ptr = (char*)sv_dup_inc((SV*)mg->mg_ptr, param);
8471 /* create a new pointer-mapping table */
8474 Perl_ptr_table_new(pTHX)
8477 Newz(0, tbl, 1, PTR_TBL_t);
8480 Newz(0, tbl->tbl_ary, tbl->tbl_max + 1, PTR_TBL_ENT_t*);
8484 /* map an existing pointer using a table */
8487 Perl_ptr_table_fetch(pTHX_ PTR_TBL_t *tbl, void *sv)
8489 PTR_TBL_ENT_t *tblent;
8490 UV hash = PTR2UV(sv);
8492 tblent = tbl->tbl_ary[hash & tbl->tbl_max];
8493 for (; tblent; tblent = tblent->next) {
8494 if (tblent->oldval == sv)
8495 return tblent->newval;
8500 /* add a new entry to a pointer-mapping table */
8503 Perl_ptr_table_store(pTHX_ PTR_TBL_t *tbl, void *oldv, void *newv)
8505 PTR_TBL_ENT_t *tblent, **otblent;
8506 /* XXX this may be pessimal on platforms where pointers aren't good
8507 * hash values e.g. if they grow faster in the most significant
8509 UV hash = PTR2UV(oldv);
8513 otblent = &tbl->tbl_ary[hash & tbl->tbl_max];
8514 for (tblent = *otblent; tblent; i=0, tblent = tblent->next) {
8515 if (tblent->oldval == oldv) {
8516 tblent->newval = newv;
8521 Newz(0, tblent, 1, PTR_TBL_ENT_t);
8522 tblent->oldval = oldv;
8523 tblent->newval = newv;
8524 tblent->next = *otblent;
8527 if (i && tbl->tbl_items > tbl->tbl_max)
8528 ptr_table_split(tbl);
8531 /* double the hash bucket size of an existing ptr table */
8534 Perl_ptr_table_split(pTHX_ PTR_TBL_t *tbl)
8536 PTR_TBL_ENT_t **ary = tbl->tbl_ary;
8537 UV oldsize = tbl->tbl_max + 1;
8538 UV newsize = oldsize * 2;
8541 Renew(ary, newsize, PTR_TBL_ENT_t*);
8542 Zero(&ary[oldsize], newsize-oldsize, PTR_TBL_ENT_t*);
8543 tbl->tbl_max = --newsize;
8545 for (i=0; i < oldsize; i++, ary++) {
8546 PTR_TBL_ENT_t **curentp, **entp, *ent;
8549 curentp = ary + oldsize;
8550 for (entp = ary, ent = *ary; ent; ent = *entp) {
8551 if ((newsize & PTR2UV(ent->oldval)) != i) {
8553 ent->next = *curentp;
8563 /* remove all the entries from a ptr table */
8566 Perl_ptr_table_clear(pTHX_ PTR_TBL_t *tbl)
8568 register PTR_TBL_ENT_t **array;
8569 register PTR_TBL_ENT_t *entry;
8570 register PTR_TBL_ENT_t *oentry = Null(PTR_TBL_ENT_t*);
8574 if (!tbl || !tbl->tbl_items) {
8578 array = tbl->tbl_ary;
8585 entry = entry->next;
8589 if (++riter > max) {
8592 entry = array[riter];
8599 /* clear and free a ptr table */
8602 Perl_ptr_table_free(pTHX_ PTR_TBL_t *tbl)
8607 ptr_table_clear(tbl);
8608 Safefree(tbl->tbl_ary);
8616 /* attempt to make everything in the typeglob readonly */
8619 S_gv_share(pTHX_ SV *sstr)
8622 SV *sv = &PL_sv_no; /* just need SvREADONLY-ness */
8624 if (GvIO(gv) || GvFORM(gv)) {
8625 GvSHARED_off(gv); /* GvIOs cannot be shared. nor can GvFORMs */
8627 else if (!GvCV(gv)) {
8631 /* CvPADLISTs cannot be shared */
8632 if (!CvXSUB(GvCV(gv))) {
8637 if (!GvSHARED(gv)) {
8639 PerlIO_printf(Perl_debug_log, "gv_share: unable to share %s::%s\n",
8640 HvNAME(GvSTASH(gv)), GvNAME(gv));
8646 * write attempts will die with
8647 * "Modification of a read-only value attempted"
8653 SvREADONLY_on(GvSV(gv));
8660 SvREADONLY_on(GvAV(gv));
8667 SvREADONLY_on(GvAV(gv));
8670 return sstr; /* he_dup() will SvREFCNT_inc() */
8673 /* duplicate an SV of any type (including AV, HV etc) */
8676 Perl_sv_dup(pTHX_ SV *sstr, clone_params* param)
8680 if (!sstr || SvTYPE(sstr) == SVTYPEMASK)
8682 /* look for it in the table first */
8683 dstr = (SV*)ptr_table_fetch(PL_ptr_table, sstr);
8687 /* create anew and remember what it is */
8689 ptr_table_store(PL_ptr_table, sstr, dstr);
8692 SvFLAGS(dstr) = SvFLAGS(sstr);
8693 SvFLAGS(dstr) &= ~SVf_OOK; /* don't propagate OOK hack */
8694 SvREFCNT(dstr) = 0; /* must be before any other dups! */
8697 if (SvANY(sstr) && PL_watch_pvx && SvPVX(sstr) == PL_watch_pvx)
8698 PerlIO_printf(Perl_debug_log, "watch at %p hit, found string \"%s\"\n",
8699 PL_watch_pvx, SvPVX(sstr));
8702 switch (SvTYPE(sstr)) {
8707 SvANY(dstr) = new_XIV();
8708 SvIVX(dstr) = SvIVX(sstr);
8711 SvANY(dstr) = new_XNV();
8712 SvNVX(dstr) = SvNVX(sstr);
8715 SvANY(dstr) = new_XRV();
8716 SvRV(dstr) = SvRV(sstr) && SvWEAKREF(SvRV(sstr))
8717 ? sv_dup(SvRV(sstr), param)
8718 : sv_dup_inc(SvRV(sstr), param);
8721 SvANY(dstr) = new_XPV();
8722 SvCUR(dstr) = SvCUR(sstr);
8723 SvLEN(dstr) = SvLEN(sstr);
8725 SvRV(dstr) = SvWEAKREF(SvRV(sstr))
8726 ? sv_dup(SvRV(sstr), param)
8727 : sv_dup_inc(SvRV(sstr), param);
8728 else if (SvPVX(sstr) && SvLEN(sstr))
8729 SvPVX(dstr) = SAVEPVN(SvPVX(sstr), SvLEN(sstr)-1);
8731 SvPVX(dstr) = SvPVX(sstr); /* XXX shared string/random ptr? */
8734 SvANY(dstr) = new_XPVIV();
8735 SvCUR(dstr) = SvCUR(sstr);
8736 SvLEN(dstr) = SvLEN(sstr);
8737 SvIVX(dstr) = SvIVX(sstr);
8739 SvRV(dstr) = SvWEAKREF(SvRV(sstr))
8740 ? sv_dup(SvRV(sstr), param)
8741 : sv_dup_inc(SvRV(sstr), param);
8742 else if (SvPVX(sstr) && SvLEN(sstr))
8743 SvPVX(dstr) = SAVEPVN(SvPVX(sstr), SvLEN(sstr)-1);
8745 SvPVX(dstr) = SvPVX(sstr); /* XXX shared string/random ptr? */
8748 SvANY(dstr) = new_XPVNV();
8749 SvCUR(dstr) = SvCUR(sstr);
8750 SvLEN(dstr) = SvLEN(sstr);
8751 SvIVX(dstr) = SvIVX(sstr);
8752 SvNVX(dstr) = SvNVX(sstr);
8754 SvRV(dstr) = SvWEAKREF(SvRV(sstr))
8755 ? sv_dup(SvRV(sstr), param)
8756 : sv_dup_inc(SvRV(sstr), param);
8757 else if (SvPVX(sstr) && SvLEN(sstr))
8758 SvPVX(dstr) = SAVEPVN(SvPVX(sstr), SvLEN(sstr)-1);
8760 SvPVX(dstr) = SvPVX(sstr); /* XXX shared string/random ptr? */
8763 SvANY(dstr) = new_XPVMG();
8764 SvCUR(dstr) = SvCUR(sstr);
8765 SvLEN(dstr) = SvLEN(sstr);
8766 SvIVX(dstr) = SvIVX(sstr);
8767 SvNVX(dstr) = SvNVX(sstr);
8768 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr), param);
8769 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr), param);
8771 SvRV(dstr) = SvWEAKREF(SvRV(sstr))
8772 ? sv_dup(SvRV(sstr), param)
8773 : sv_dup_inc(SvRV(sstr), param);
8774 else if (SvPVX(sstr) && SvLEN(sstr))
8775 SvPVX(dstr) = SAVEPVN(SvPVX(sstr), SvLEN(sstr)-1);
8777 SvPVX(dstr) = SvPVX(sstr); /* XXX shared string/random ptr? */
8780 SvANY(dstr) = new_XPVBM();
8781 SvCUR(dstr) = SvCUR(sstr);
8782 SvLEN(dstr) = SvLEN(sstr);
8783 SvIVX(dstr) = SvIVX(sstr);
8784 SvNVX(dstr) = SvNVX(sstr);
8785 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr), param);
8786 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr), param);
8788 SvRV(dstr) = SvWEAKREF(SvRV(sstr))
8789 ? sv_dup(SvRV(sstr), param)
8790 : sv_dup_inc(SvRV(sstr), param);
8791 else if (SvPVX(sstr) && SvLEN(sstr))
8792 SvPVX(dstr) = SAVEPVN(SvPVX(sstr), SvLEN(sstr)-1);
8794 SvPVX(dstr) = SvPVX(sstr); /* XXX shared string/random ptr? */
8795 BmRARE(dstr) = BmRARE(sstr);
8796 BmUSEFUL(dstr) = BmUSEFUL(sstr);
8797 BmPREVIOUS(dstr)= BmPREVIOUS(sstr);
8800 SvANY(dstr) = new_XPVLV();
8801 SvCUR(dstr) = SvCUR(sstr);
8802 SvLEN(dstr) = SvLEN(sstr);
8803 SvIVX(dstr) = SvIVX(sstr);
8804 SvNVX(dstr) = SvNVX(sstr);
8805 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr), param);
8806 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr), param);
8808 SvRV(dstr) = SvWEAKREF(SvRV(sstr))
8809 ? sv_dup(SvRV(sstr), param)
8810 : sv_dup_inc(SvRV(sstr), param);
8811 else if (SvPVX(sstr) && SvLEN(sstr))
8812 SvPVX(dstr) = SAVEPVN(SvPVX(sstr), SvLEN(sstr)-1);
8814 SvPVX(dstr) = SvPVX(sstr); /* XXX shared string/random ptr? */
8815 LvTARGOFF(dstr) = LvTARGOFF(sstr); /* XXX sometimes holds PMOP* when DEBUGGING */
8816 LvTARGLEN(dstr) = LvTARGLEN(sstr);
8817 LvTARG(dstr) = sv_dup_inc(LvTARG(sstr), param);
8818 LvTYPE(dstr) = LvTYPE(sstr);
8821 if (GvSHARED((GV*)sstr)) {
8823 if ((share = gv_share(sstr))) {
8827 PerlIO_printf(Perl_debug_log, "sv_dup: sharing %s::%s\n",
8828 HvNAME(GvSTASH(share)), GvNAME(share));
8833 SvANY(dstr) = new_XPVGV();
8834 SvCUR(dstr) = SvCUR(sstr);
8835 SvLEN(dstr) = SvLEN(sstr);
8836 SvIVX(dstr) = SvIVX(sstr);
8837 SvNVX(dstr) = SvNVX(sstr);
8838 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr), param);
8839 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr), param);
8841 SvRV(dstr) = SvWEAKREF(SvRV(sstr))
8842 ? sv_dup(SvRV(sstr), param)
8843 : sv_dup_inc(SvRV(sstr), param);
8844 else if (SvPVX(sstr) && SvLEN(sstr))
8845 SvPVX(dstr) = SAVEPVN(SvPVX(sstr), SvLEN(sstr)-1);
8847 SvPVX(dstr) = SvPVX(sstr); /* XXX shared string/random ptr? */
8848 GvNAMELEN(dstr) = GvNAMELEN(sstr);
8849 GvNAME(dstr) = SAVEPVN(GvNAME(sstr), GvNAMELEN(sstr));
8850 GvSTASH(dstr) = hv_dup_inc(GvSTASH(sstr), param);
8851 GvFLAGS(dstr) = GvFLAGS(sstr);
8852 GvGP(dstr) = gp_dup(GvGP(sstr), param);
8853 (void)GpREFCNT_inc(GvGP(dstr));
8856 SvANY(dstr) = new_XPVIO();
8857 SvCUR(dstr) = SvCUR(sstr);
8858 SvLEN(dstr) = SvLEN(sstr);
8859 SvIVX(dstr) = SvIVX(sstr);
8860 SvNVX(dstr) = SvNVX(sstr);
8861 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr), param);
8862 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr), param);
8864 SvRV(dstr) = SvWEAKREF(SvRV(sstr))
8865 ? sv_dup(SvRV(sstr), param)
8866 : sv_dup_inc(SvRV(sstr), param);
8867 else if (SvPVX(sstr) && SvLEN(sstr))
8868 SvPVX(dstr) = SAVEPVN(SvPVX(sstr), SvLEN(sstr)-1);
8870 SvPVX(dstr) = SvPVX(sstr); /* XXX shared string/random ptr? */
8871 IoIFP(dstr) = fp_dup(IoIFP(sstr), IoTYPE(sstr));
8872 if (IoOFP(sstr) == IoIFP(sstr))
8873 IoOFP(dstr) = IoIFP(dstr);
8875 IoOFP(dstr) = fp_dup(IoOFP(sstr), IoTYPE(sstr));
8876 /* PL_rsfp_filters entries have fake IoDIRP() */
8877 if (IoDIRP(sstr) && !(IoFLAGS(sstr) & IOf_FAKE_DIRP))
8878 IoDIRP(dstr) = dirp_dup(IoDIRP(sstr));
8880 IoDIRP(dstr) = IoDIRP(sstr);
8881 IoLINES(dstr) = IoLINES(sstr);
8882 IoPAGE(dstr) = IoPAGE(sstr);
8883 IoPAGE_LEN(dstr) = IoPAGE_LEN(sstr);
8884 IoLINES_LEFT(dstr) = IoLINES_LEFT(sstr);
8885 IoTOP_NAME(dstr) = SAVEPV(IoTOP_NAME(sstr));
8886 IoTOP_GV(dstr) = gv_dup(IoTOP_GV(sstr), param);
8887 IoFMT_NAME(dstr) = SAVEPV(IoFMT_NAME(sstr));
8888 IoFMT_GV(dstr) = gv_dup(IoFMT_GV(sstr), param);
8889 IoBOTTOM_NAME(dstr) = SAVEPV(IoBOTTOM_NAME(sstr));
8890 IoBOTTOM_GV(dstr) = gv_dup(IoBOTTOM_GV(sstr), param);
8891 IoSUBPROCESS(dstr) = IoSUBPROCESS(sstr);
8892 IoTYPE(dstr) = IoTYPE(sstr);
8893 IoFLAGS(dstr) = IoFLAGS(sstr);
8896 SvANY(dstr) = new_XPVAV();
8897 SvCUR(dstr) = SvCUR(sstr);
8898 SvLEN(dstr) = SvLEN(sstr);
8899 SvIVX(dstr) = SvIVX(sstr);
8900 SvNVX(dstr) = SvNVX(sstr);
8901 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr), param);
8902 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr), param);
8903 AvARYLEN((AV*)dstr) = sv_dup_inc(AvARYLEN((AV*)sstr), param);
8904 AvFLAGS((AV*)dstr) = AvFLAGS((AV*)sstr);
8905 if (AvARRAY((AV*)sstr)) {
8906 SV **dst_ary, **src_ary;
8907 SSize_t items = AvFILLp((AV*)sstr) + 1;
8909 src_ary = AvARRAY((AV*)sstr);
8910 Newz(0, dst_ary, AvMAX((AV*)sstr)+1, SV*);
8911 ptr_table_store(PL_ptr_table, src_ary, dst_ary);
8912 SvPVX(dstr) = (char*)dst_ary;
8913 AvALLOC((AV*)dstr) = dst_ary;
8914 if (AvREAL((AV*)sstr)) {
8916 *dst_ary++ = sv_dup_inc(*src_ary++, param);
8920 *dst_ary++ = sv_dup(*src_ary++, param);
8922 items = AvMAX((AV*)sstr) - AvFILLp((AV*)sstr);
8923 while (items-- > 0) {
8924 *dst_ary++ = &PL_sv_undef;
8928 SvPVX(dstr) = Nullch;
8929 AvALLOC((AV*)dstr) = (SV**)NULL;
8933 SvANY(dstr) = new_XPVHV();
8934 SvCUR(dstr) = SvCUR(sstr);
8935 SvLEN(dstr) = SvLEN(sstr);
8936 SvIVX(dstr) = SvIVX(sstr);
8937 SvNVX(dstr) = SvNVX(sstr);
8938 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr), param);
8939 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr), param);
8940 HvRITER((HV*)dstr) = HvRITER((HV*)sstr);
8941 if (HvARRAY((HV*)sstr)) {
8943 XPVHV *dxhv = (XPVHV*)SvANY(dstr);
8944 XPVHV *sxhv = (XPVHV*)SvANY(sstr);
8945 Newz(0, dxhv->xhv_array,
8946 PERL_HV_ARRAY_ALLOC_BYTES(dxhv->xhv_max+1), char);
8947 while (i <= sxhv->xhv_max) {
8948 ((HE**)dxhv->xhv_array)[i] = he_dup(((HE**)sxhv->xhv_array)[i],
8949 !!HvSHAREKEYS(sstr), param);
8952 dxhv->xhv_eiter = he_dup(sxhv->xhv_eiter, !!HvSHAREKEYS(sstr), param);
8955 SvPVX(dstr) = Nullch;
8956 HvEITER((HV*)dstr) = (HE*)NULL;
8958 HvPMROOT((HV*)dstr) = HvPMROOT((HV*)sstr); /* XXX */
8959 HvNAME((HV*)dstr) = SAVEPV(HvNAME((HV*)sstr));
8960 /* Record stashes for possible cloning in Perl_clone_using(). */
8961 if(HvNAME((HV*)dstr))
8962 av_push(param->stashes, dstr);
8965 SvANY(dstr) = new_XPVFM();
8966 FmLINES(dstr) = FmLINES(sstr);
8970 SvANY(dstr) = new_XPVCV();
8972 SvCUR(dstr) = SvCUR(sstr);
8973 SvLEN(dstr) = SvLEN(sstr);
8974 SvIVX(dstr) = SvIVX(sstr);
8975 SvNVX(dstr) = SvNVX(sstr);
8976 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr), param);
8977 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr), param);
8978 if (SvPVX(sstr) && SvLEN(sstr))
8979 SvPVX(dstr) = SAVEPVN(SvPVX(sstr), SvLEN(sstr)-1);
8981 SvPVX(dstr) = SvPVX(sstr); /* XXX shared string/random ptr? */
8982 CvSTASH(dstr) = hv_dup(CvSTASH(sstr), param); /* NOTE: not refcounted */
8983 CvSTART(dstr) = CvSTART(sstr);
8984 CvROOT(dstr) = OpREFCNT_inc(CvROOT(sstr));
8985 CvXSUB(dstr) = CvXSUB(sstr);
8986 CvXSUBANY(dstr) = CvXSUBANY(sstr);
8987 CvGV(dstr) = gv_dup(CvGV(sstr), param);
8988 if (param->flags & CLONEf_COPY_STACKS) {
8989 CvDEPTH(dstr) = CvDEPTH(sstr);
8993 if (CvPADLIST(sstr) && !AvREAL(CvPADLIST(sstr))) {
8994 /* XXX padlists are real, but pretend to be not */
8995 AvREAL_on(CvPADLIST(sstr));
8996 CvPADLIST(dstr) = av_dup_inc(CvPADLIST(sstr), param);
8997 AvREAL_off(CvPADLIST(sstr));
8998 AvREAL_off(CvPADLIST(dstr));
9001 CvPADLIST(dstr) = av_dup_inc(CvPADLIST(sstr), param);
9002 if (!CvANON(sstr) || CvCLONED(sstr))
9003 CvOUTSIDE(dstr) = cv_dup_inc(CvOUTSIDE(sstr), param);
9005 CvOUTSIDE(dstr) = cv_dup(CvOUTSIDE(sstr), param);
9006 CvFLAGS(dstr) = CvFLAGS(sstr);
9009 Perl_croak(aTHX_ "Bizarre SvTYPE [%d]", SvTYPE(sstr));
9013 if (SvOBJECT(dstr) && SvTYPE(dstr) != SVt_PVIO)
9019 /* duplicate a context */
9022 Perl_cx_dup(pTHX_ PERL_CONTEXT *cxs, I32 ix, I32 max, clone_params* param)
9027 return (PERL_CONTEXT*)NULL;
9029 /* look for it in the table first */
9030 ncxs = (PERL_CONTEXT*)ptr_table_fetch(PL_ptr_table, cxs);
9034 /* create anew and remember what it is */
9035 Newz(56, ncxs, max + 1, PERL_CONTEXT);
9036 ptr_table_store(PL_ptr_table, cxs, ncxs);
9039 PERL_CONTEXT *cx = &cxs[ix];
9040 PERL_CONTEXT *ncx = &ncxs[ix];
9041 ncx->cx_type = cx->cx_type;
9042 if (CxTYPE(cx) == CXt_SUBST) {
9043 Perl_croak(aTHX_ "Cloning substitution context is unimplemented");
9046 ncx->blk_oldsp = cx->blk_oldsp;
9047 ncx->blk_oldcop = cx->blk_oldcop;
9048 ncx->blk_oldretsp = cx->blk_oldretsp;
9049 ncx->blk_oldmarksp = cx->blk_oldmarksp;
9050 ncx->blk_oldscopesp = cx->blk_oldscopesp;
9051 ncx->blk_oldpm = cx->blk_oldpm;
9052 ncx->blk_gimme = cx->blk_gimme;
9053 switch (CxTYPE(cx)) {
9055 ncx->blk_sub.cv = (cx->blk_sub.olddepth == 0
9056 ? cv_dup_inc(cx->blk_sub.cv, param)
9057 : cv_dup(cx->blk_sub.cv,param));
9058 ncx->blk_sub.argarray = (cx->blk_sub.hasargs
9059 ? av_dup_inc(cx->blk_sub.argarray, param)
9061 ncx->blk_sub.savearray = av_dup_inc(cx->blk_sub.savearray, param);
9062 ncx->blk_sub.olddepth = cx->blk_sub.olddepth;
9063 ncx->blk_sub.hasargs = cx->blk_sub.hasargs;
9064 ncx->blk_sub.lval = cx->blk_sub.lval;
9067 ncx->blk_eval.old_in_eval = cx->blk_eval.old_in_eval;
9068 ncx->blk_eval.old_op_type = cx->blk_eval.old_op_type;
9069 ncx->blk_eval.old_namesv = sv_dup_inc(cx->blk_eval.old_namesv, param);;
9070 ncx->blk_eval.old_eval_root = cx->blk_eval.old_eval_root;
9071 ncx->blk_eval.cur_text = sv_dup(cx->blk_eval.cur_text, param);
9074 ncx->blk_loop.label = cx->blk_loop.label;
9075 ncx->blk_loop.resetsp = cx->blk_loop.resetsp;
9076 ncx->blk_loop.redo_op = cx->blk_loop.redo_op;
9077 ncx->blk_loop.next_op = cx->blk_loop.next_op;
9078 ncx->blk_loop.last_op = cx->blk_loop.last_op;
9079 ncx->blk_loop.iterdata = (CxPADLOOP(cx)
9080 ? cx->blk_loop.iterdata
9081 : gv_dup((GV*)cx->blk_loop.iterdata, param));
9082 ncx->blk_loop.oldcurpad
9083 = (SV**)ptr_table_fetch(PL_ptr_table,
9084 cx->blk_loop.oldcurpad);
9085 ncx->blk_loop.itersave = sv_dup_inc(cx->blk_loop.itersave, param);
9086 ncx->blk_loop.iterlval = sv_dup_inc(cx->blk_loop.iterlval, param);
9087 ncx->blk_loop.iterary = av_dup_inc(cx->blk_loop.iterary, param);
9088 ncx->blk_loop.iterix = cx->blk_loop.iterix;
9089 ncx->blk_loop.itermax = cx->blk_loop.itermax;
9092 ncx->blk_sub.cv = cv_dup(cx->blk_sub.cv, param);
9093 ncx->blk_sub.gv = gv_dup(cx->blk_sub.gv, param);
9094 ncx->blk_sub.dfoutgv = gv_dup_inc(cx->blk_sub.dfoutgv, param);
9095 ncx->blk_sub.hasargs = cx->blk_sub.hasargs;
9107 /* duplicate a stack info structure */
9110 Perl_si_dup(pTHX_ PERL_SI *si, clone_params* param)
9115 return (PERL_SI*)NULL;
9117 /* look for it in the table first */
9118 nsi = (PERL_SI*)ptr_table_fetch(PL_ptr_table, si);
9122 /* create anew and remember what it is */
9123 Newz(56, nsi, 1, PERL_SI);
9124 ptr_table_store(PL_ptr_table, si, nsi);
9126 nsi->si_stack = av_dup_inc(si->si_stack, param);
9127 nsi->si_cxix = si->si_cxix;
9128 nsi->si_cxmax = si->si_cxmax;
9129 nsi->si_cxstack = cx_dup(si->si_cxstack, si->si_cxix, si->si_cxmax, param);
9130 nsi->si_type = si->si_type;
9131 nsi->si_prev = si_dup(si->si_prev, param);
9132 nsi->si_next = si_dup(si->si_next, param);
9133 nsi->si_markoff = si->si_markoff;
9138 #define POPINT(ss,ix) ((ss)[--(ix)].any_i32)
9139 #define TOPINT(ss,ix) ((ss)[ix].any_i32)
9140 #define POPLONG(ss,ix) ((ss)[--(ix)].any_long)
9141 #define TOPLONG(ss,ix) ((ss)[ix].any_long)
9142 #define POPIV(ss,ix) ((ss)[--(ix)].any_iv)
9143 #define TOPIV(ss,ix) ((ss)[ix].any_iv)
9144 #define POPPTR(ss,ix) ((ss)[--(ix)].any_ptr)
9145 #define TOPPTR(ss,ix) ((ss)[ix].any_ptr)
9146 #define POPDPTR(ss,ix) ((ss)[--(ix)].any_dptr)
9147 #define TOPDPTR(ss,ix) ((ss)[ix].any_dptr)
9148 #define POPDXPTR(ss,ix) ((ss)[--(ix)].any_dxptr)
9149 #define TOPDXPTR(ss,ix) ((ss)[ix].any_dxptr)
9152 #define pv_dup_inc(p) SAVEPV(p)
9153 #define pv_dup(p) SAVEPV(p)
9154 #define svp_dup_inc(p,pp) any_dup(p,pp)
9156 /* map any object to the new equivent - either something in the
9157 * ptr table, or something in the interpreter structure
9161 Perl_any_dup(pTHX_ void *v, PerlInterpreter *proto_perl)
9168 /* look for it in the table first */
9169 ret = ptr_table_fetch(PL_ptr_table, v);
9173 /* see if it is part of the interpreter structure */
9174 if (v >= (void*)proto_perl && v < (void*)(proto_perl+1))
9175 ret = (void*)(((char*)aTHXo) + (((char*)v) - (char*)proto_perl));
9182 /* duplicate the save stack */
9185 Perl_ss_dup(pTHX_ PerlInterpreter *proto_perl, clone_params* param)
9187 ANY *ss = proto_perl->Tsavestack;
9188 I32 ix = proto_perl->Tsavestack_ix;
9189 I32 max = proto_perl->Tsavestack_max;
9202 void (*dptr) (void*);
9203 void (*dxptr) (pTHXo_ void*);
9206 Newz(54, nss, max, ANY);
9212 case SAVEt_ITEM: /* normal string */
9213 sv = (SV*)POPPTR(ss,ix);
9214 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
9215 sv = (SV*)POPPTR(ss,ix);
9216 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
9218 case SAVEt_SV: /* scalar reference */
9219 sv = (SV*)POPPTR(ss,ix);
9220 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
9221 gv = (GV*)POPPTR(ss,ix);
9222 TOPPTR(nss,ix) = gv_dup_inc(gv, param);
9224 case SAVEt_GENERIC_PVREF: /* generic char* */
9225 c = (char*)POPPTR(ss,ix);
9226 TOPPTR(nss,ix) = pv_dup(c);
9227 ptr = POPPTR(ss,ix);
9228 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
9230 case SAVEt_GENERIC_SVREF: /* generic sv */
9231 case SAVEt_SVREF: /* scalar reference */
9232 sv = (SV*)POPPTR(ss,ix);
9233 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
9234 ptr = POPPTR(ss,ix);
9235 TOPPTR(nss,ix) = svp_dup_inc((SV**)ptr, proto_perl);/* XXXXX */
9237 case SAVEt_AV: /* array reference */
9238 av = (AV*)POPPTR(ss,ix);
9239 TOPPTR(nss,ix) = av_dup_inc(av, param);
9240 gv = (GV*)POPPTR(ss,ix);
9241 TOPPTR(nss,ix) = gv_dup(gv, param);
9243 case SAVEt_HV: /* hash reference */
9244 hv = (HV*)POPPTR(ss,ix);
9245 TOPPTR(nss,ix) = hv_dup_inc(hv, param);
9246 gv = (GV*)POPPTR(ss,ix);
9247 TOPPTR(nss,ix) = gv_dup(gv, param);
9249 case SAVEt_INT: /* int reference */
9250 ptr = POPPTR(ss,ix);
9251 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
9252 intval = (int)POPINT(ss,ix);
9253 TOPINT(nss,ix) = intval;
9255 case SAVEt_LONG: /* long reference */
9256 ptr = POPPTR(ss,ix);
9257 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
9258 longval = (long)POPLONG(ss,ix);
9259 TOPLONG(nss,ix) = longval;
9261 case SAVEt_I32: /* I32 reference */
9262 case SAVEt_I16: /* I16 reference */
9263 case SAVEt_I8: /* I8 reference */
9264 ptr = POPPTR(ss,ix);
9265 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
9269 case SAVEt_IV: /* IV reference */
9270 ptr = POPPTR(ss,ix);
9271 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
9275 case SAVEt_SPTR: /* SV* reference */
9276 ptr = POPPTR(ss,ix);
9277 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
9278 sv = (SV*)POPPTR(ss,ix);
9279 TOPPTR(nss,ix) = sv_dup(sv, param);
9281 case SAVEt_VPTR: /* random* reference */
9282 ptr = POPPTR(ss,ix);
9283 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
9284 ptr = POPPTR(ss,ix);
9285 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
9287 case SAVEt_PPTR: /* char* reference */
9288 ptr = POPPTR(ss,ix);
9289 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
9290 c = (char*)POPPTR(ss,ix);
9291 TOPPTR(nss,ix) = pv_dup(c);
9293 case SAVEt_HPTR: /* HV* reference */
9294 ptr = POPPTR(ss,ix);
9295 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
9296 hv = (HV*)POPPTR(ss,ix);
9297 TOPPTR(nss,ix) = hv_dup(hv, param);
9299 case SAVEt_APTR: /* AV* reference */
9300 ptr = POPPTR(ss,ix);
9301 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
9302 av = (AV*)POPPTR(ss,ix);
9303 TOPPTR(nss,ix) = av_dup(av, param);
9306 gv = (GV*)POPPTR(ss,ix);
9307 TOPPTR(nss,ix) = gv_dup(gv, param);
9309 case SAVEt_GP: /* scalar reference */
9310 gp = (GP*)POPPTR(ss,ix);
9311 TOPPTR(nss,ix) = gp = gp_dup(gp, param);
9312 (void)GpREFCNT_inc(gp);
9313 gv = (GV*)POPPTR(ss,ix);
9314 TOPPTR(nss,ix) = gv_dup_inc(c, param);
9315 c = (char*)POPPTR(ss,ix);
9316 TOPPTR(nss,ix) = pv_dup(c);
9323 case SAVEt_MORTALIZESV:
9324 sv = (SV*)POPPTR(ss,ix);
9325 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
9328 ptr = POPPTR(ss,ix);
9329 if (ptr && (((OP*)ptr)->op_private & OPpREFCOUNTED)) {
9330 /* these are assumed to be refcounted properly */
9331 switch (((OP*)ptr)->op_type) {
9338 TOPPTR(nss,ix) = ptr;
9343 TOPPTR(nss,ix) = Nullop;
9348 TOPPTR(nss,ix) = Nullop;
9351 c = (char*)POPPTR(ss,ix);
9352 TOPPTR(nss,ix) = pv_dup_inc(c);
9355 longval = POPLONG(ss,ix);
9356 TOPLONG(nss,ix) = longval;
9359 hv = (HV*)POPPTR(ss,ix);
9360 TOPPTR(nss,ix) = hv_dup_inc(hv, param);
9361 c = (char*)POPPTR(ss,ix);
9362 TOPPTR(nss,ix) = pv_dup_inc(c);
9366 case SAVEt_DESTRUCTOR:
9367 ptr = POPPTR(ss,ix);
9368 TOPPTR(nss,ix) = any_dup(ptr, proto_perl); /* XXX quite arbitrary */
9369 dptr = POPDPTR(ss,ix);
9370 TOPDPTR(nss,ix) = (void (*)(void*))any_dup((void *)dptr, proto_perl);
9372 case SAVEt_DESTRUCTOR_X:
9373 ptr = POPPTR(ss,ix);
9374 TOPPTR(nss,ix) = any_dup(ptr, proto_perl); /* XXX quite arbitrary */
9375 dxptr = POPDXPTR(ss,ix);
9376 TOPDXPTR(nss,ix) = (void (*)(pTHXo_ void*))any_dup((void *)dxptr, proto_perl);
9378 case SAVEt_REGCONTEXT:
9384 case SAVEt_STACK_POS: /* Position on Perl stack */
9388 case SAVEt_AELEM: /* array element */
9389 sv = (SV*)POPPTR(ss,ix);
9390 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
9393 av = (AV*)POPPTR(ss,ix);
9394 TOPPTR(nss,ix) = av_dup_inc(av, param);
9396 case SAVEt_HELEM: /* hash element */
9397 sv = (SV*)POPPTR(ss,ix);
9398 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
9399 sv = (SV*)POPPTR(ss,ix);
9400 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
9401 hv = (HV*)POPPTR(ss,ix);
9402 TOPPTR(nss,ix) = hv_dup_inc(hv, param);
9405 ptr = POPPTR(ss,ix);
9406 TOPPTR(nss,ix) = ptr;
9413 av = (AV*)POPPTR(ss,ix);
9414 TOPPTR(nss,ix) = av_dup(av, param);
9417 longval = (long)POPLONG(ss,ix);
9418 TOPLONG(nss,ix) = longval;
9419 ptr = POPPTR(ss,ix);
9420 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
9421 sv = (SV*)POPPTR(ss,ix);
9422 TOPPTR(nss,ix) = sv_dup(sv, param);
9425 Perl_croak(aTHX_ "panic: ss_dup inconsistency");
9437 =for apidoc perl_clone
9439 Create and return a new interpreter by cloning the current one.
9444 /* XXX the above needs expanding by someone who actually understands it ! */
9447 perl_clone(PerlInterpreter *proto_perl, UV flags)
9450 CPerlObj *pPerl = (CPerlObj*)proto_perl;
9453 #ifdef PERL_IMPLICIT_SYS
9454 return perl_clone_using(proto_perl, flags,
9456 proto_perl->IMemShared,
9457 proto_perl->IMemParse,
9467 perl_clone_using(PerlInterpreter *proto_perl, UV flags,
9468 struct IPerlMem* ipM, struct IPerlMem* ipMS,
9469 struct IPerlMem* ipMP, struct IPerlEnv* ipE,
9470 struct IPerlStdIO* ipStd, struct IPerlLIO* ipLIO,
9471 struct IPerlDir* ipD, struct IPerlSock* ipS,
9472 struct IPerlProc* ipP)
9474 /* XXX many of the string copies here can be optimized if they're
9475 * constants; they need to be allocated as common memory and just
9476 * their pointers copied. */
9479 clone_params* param = (clone_params*) malloc(sizeof(clone_params));
9484 CPerlObj *pPerl = new(ipM) CPerlObj(ipM, ipMS, ipMP, ipE, ipStd, ipLIO,
9486 PERL_SET_THX(pPerl);
9487 # else /* !PERL_OBJECT */
9488 PerlInterpreter *my_perl = (PerlInterpreter*)(*ipM->pMalloc)(ipM, sizeof(PerlInterpreter));
9489 PERL_SET_THX(my_perl);
9492 memset(my_perl, 0xab, sizeof(PerlInterpreter));
9498 # else /* !DEBUGGING */
9499 Zero(my_perl, 1, PerlInterpreter);
9500 # endif /* DEBUGGING */
9504 PL_MemShared = ipMS;
9512 # endif /* PERL_OBJECT */
9513 #else /* !PERL_IMPLICIT_SYS */
9515 clone_params* param = (clone_params*) malloc(sizeof(clone_params));
9516 PerlInterpreter *my_perl = (PerlInterpreter*)PerlMem_malloc(sizeof(PerlInterpreter));
9517 PERL_SET_THX(my_perl);
9522 memset(my_perl, 0xab, sizeof(PerlInterpreter));
9528 # else /* !DEBUGGING */
9529 Zero(my_perl, 1, PerlInterpreter);
9530 # endif /* DEBUGGING */
9531 #endif /* PERL_IMPLICIT_SYS */
9532 param->flags = flags;
9535 PL_xiv_arenaroot = NULL;
9537 PL_xnv_arenaroot = NULL;
9539 PL_xrv_arenaroot = NULL;
9541 PL_xpv_arenaroot = NULL;
9543 PL_xpviv_arenaroot = NULL;
9544 PL_xpviv_root = NULL;
9545 PL_xpvnv_arenaroot = NULL;
9546 PL_xpvnv_root = NULL;
9547 PL_xpvcv_arenaroot = NULL;
9548 PL_xpvcv_root = NULL;
9549 PL_xpvav_arenaroot = NULL;
9550 PL_xpvav_root = NULL;
9551 PL_xpvhv_arenaroot = NULL;
9552 PL_xpvhv_root = NULL;
9553 PL_xpvmg_arenaroot = NULL;
9554 PL_xpvmg_root = NULL;
9555 PL_xpvlv_arenaroot = NULL;
9556 PL_xpvlv_root = NULL;
9557 PL_xpvbm_arenaroot = NULL;
9558 PL_xpvbm_root = NULL;
9559 PL_he_arenaroot = NULL;
9561 PL_nice_chunk = NULL;
9562 PL_nice_chunk_size = 0;
9565 PL_sv_root = Nullsv;
9566 PL_sv_arenaroot = Nullsv;
9568 PL_debug = proto_perl->Idebug;
9570 /* create SV map for pointer relocation */
9571 PL_ptr_table = ptr_table_new();
9573 /* initialize these special pointers as early as possible */
9574 SvANY(&PL_sv_undef) = NULL;
9575 SvREFCNT(&PL_sv_undef) = (~(U32)0)/2;
9576 SvFLAGS(&PL_sv_undef) = SVf_READONLY|SVt_NULL;
9577 ptr_table_store(PL_ptr_table, &proto_perl->Isv_undef, &PL_sv_undef);
9580 SvUPGRADE(&PL_sv_no, SVt_PVNV);
9582 SvANY(&PL_sv_no) = new_XPVNV();
9584 SvREFCNT(&PL_sv_no) = (~(U32)0)/2;
9585 SvFLAGS(&PL_sv_no) = SVp_NOK|SVf_NOK|SVp_POK|SVf_POK|SVf_READONLY|SVt_PVNV;
9586 SvPVX(&PL_sv_no) = SAVEPVN(PL_No, 0);
9587 SvCUR(&PL_sv_no) = 0;
9588 SvLEN(&PL_sv_no) = 1;
9589 SvNVX(&PL_sv_no) = 0;
9590 ptr_table_store(PL_ptr_table, &proto_perl->Isv_no, &PL_sv_no);
9593 SvUPGRADE(&PL_sv_yes, SVt_PVNV);
9595 SvANY(&PL_sv_yes) = new_XPVNV();
9597 SvREFCNT(&PL_sv_yes) = (~(U32)0)/2;
9598 SvFLAGS(&PL_sv_yes) = SVp_NOK|SVf_NOK|SVp_POK|SVf_POK|SVf_READONLY|SVt_PVNV;
9599 SvPVX(&PL_sv_yes) = SAVEPVN(PL_Yes, 1);
9600 SvCUR(&PL_sv_yes) = 1;
9601 SvLEN(&PL_sv_yes) = 2;
9602 SvNVX(&PL_sv_yes) = 1;
9603 ptr_table_store(PL_ptr_table, &proto_perl->Isv_yes, &PL_sv_yes);
9605 /* create shared string table */
9606 PL_strtab = newHV();
9607 HvSHAREKEYS_off(PL_strtab);
9608 hv_ksplit(PL_strtab, 512);
9609 ptr_table_store(PL_ptr_table, proto_perl->Istrtab, PL_strtab);
9611 PL_compiling = proto_perl->Icompiling;
9612 PL_compiling.cop_stashpv = SAVEPV(PL_compiling.cop_stashpv);
9613 PL_compiling.cop_file = SAVEPV(PL_compiling.cop_file);
9614 ptr_table_store(PL_ptr_table, &proto_perl->Icompiling, &PL_compiling);
9615 if (!specialWARN(PL_compiling.cop_warnings))
9616 PL_compiling.cop_warnings = sv_dup_inc(PL_compiling.cop_warnings, param);
9617 if (!specialCopIO(PL_compiling.cop_io))
9618 PL_compiling.cop_io = sv_dup_inc(PL_compiling.cop_io, param);
9619 PL_curcop = (COP*)any_dup(proto_perl->Tcurcop, proto_perl);
9621 /* pseudo environmental stuff */
9622 PL_origargc = proto_perl->Iorigargc;
9624 New(0, PL_origargv, i+1, char*);
9625 PL_origargv[i] = '\0';
9627 PL_origargv[i] = SAVEPV(proto_perl->Iorigargv[i]);
9631 param->stashes = newAV(); /* Setup array of objects to call clone on */
9634 PL_envgv = gv_dup(proto_perl->Ienvgv, param);
9635 PL_incgv = gv_dup(proto_perl->Iincgv, param);
9636 PL_hintgv = gv_dup(proto_perl->Ihintgv, param);
9637 PL_origfilename = SAVEPV(proto_perl->Iorigfilename);
9638 PL_diehook = sv_dup_inc(proto_perl->Idiehook, param);
9639 PL_warnhook = sv_dup_inc(proto_perl->Iwarnhook, param);
9642 PL_minus_c = proto_perl->Iminus_c;
9643 PL_patchlevel = sv_dup_inc(proto_perl->Ipatchlevel, param);
9644 PL_localpatches = proto_perl->Ilocalpatches;
9645 PL_splitstr = proto_perl->Isplitstr;
9646 PL_preprocess = proto_perl->Ipreprocess;
9647 PL_minus_n = proto_perl->Iminus_n;
9648 PL_minus_p = proto_perl->Iminus_p;
9649 PL_minus_l = proto_perl->Iminus_l;
9650 PL_minus_a = proto_perl->Iminus_a;
9651 PL_minus_F = proto_perl->Iminus_F;
9652 PL_doswitches = proto_perl->Idoswitches;
9653 PL_dowarn = proto_perl->Idowarn;
9654 PL_doextract = proto_perl->Idoextract;
9655 PL_sawampersand = proto_perl->Isawampersand;
9656 PL_unsafe = proto_perl->Iunsafe;
9657 PL_inplace = SAVEPV(proto_perl->Iinplace);
9658 PL_e_script = sv_dup_inc(proto_perl->Ie_script, param);
9659 PL_perldb = proto_perl->Iperldb;
9660 PL_perl_destruct_level = proto_perl->Iperl_destruct_level;
9662 /* magical thingies */
9663 /* XXX time(&PL_basetime) when asked for? */
9664 PL_basetime = proto_perl->Ibasetime;
9665 PL_formfeed = sv_dup(proto_perl->Iformfeed, param);
9667 PL_maxsysfd = proto_perl->Imaxsysfd;
9668 PL_multiline = proto_perl->Imultiline;
9669 PL_statusvalue = proto_perl->Istatusvalue;
9671 PL_statusvalue_vms = proto_perl->Istatusvalue_vms;
9674 /* shortcuts to various I/O objects */
9675 PL_stdingv = gv_dup(proto_perl->Istdingv, param);
9676 PL_stderrgv = gv_dup(proto_perl->Istderrgv, param);
9677 PL_defgv = gv_dup(proto_perl->Idefgv, param);
9678 PL_argvgv = gv_dup(proto_perl->Iargvgv, param);
9679 PL_argvoutgv = gv_dup(proto_perl->Iargvoutgv, param);
9680 PL_argvout_stack = av_dup_inc(proto_perl->Iargvout_stack, param);
9682 /* shortcuts to regexp stuff */
9683 PL_replgv = gv_dup(proto_perl->Ireplgv, param);
9685 /* shortcuts to misc objects */
9686 PL_errgv = gv_dup(proto_perl->Ierrgv, param);
9688 /* shortcuts to debugging objects */
9689 PL_DBgv = gv_dup(proto_perl->IDBgv, param);
9690 PL_DBline = gv_dup(proto_perl->IDBline, param);
9691 PL_DBsub = gv_dup(proto_perl->IDBsub, param);
9692 PL_DBsingle = sv_dup(proto_perl->IDBsingle, param);
9693 PL_DBtrace = sv_dup(proto_perl->IDBtrace, param);
9694 PL_DBsignal = sv_dup(proto_perl->IDBsignal, param);
9695 PL_lineary = av_dup(proto_perl->Ilineary, param);
9696 PL_dbargs = av_dup(proto_perl->Idbargs, param);
9699 PL_defstash = hv_dup_inc(proto_perl->Tdefstash, param);
9700 PL_curstash = hv_dup(proto_perl->Tcurstash, param);
9701 PL_nullstash = hv_dup(proto_perl->Inullstash, param);
9702 PL_debstash = hv_dup(proto_perl->Idebstash, param);
9703 PL_globalstash = hv_dup(proto_perl->Iglobalstash, param);
9704 PL_curstname = sv_dup_inc(proto_perl->Icurstname, param);
9706 PL_beginav = av_dup_inc(proto_perl->Ibeginav, param);
9707 PL_endav = av_dup_inc(proto_perl->Iendav, param);
9708 PL_checkav = av_dup_inc(proto_perl->Icheckav, param);
9709 PL_initav = av_dup_inc(proto_perl->Iinitav, param);
9711 PL_sub_generation = proto_perl->Isub_generation;
9713 /* funky return mechanisms */
9714 PL_forkprocess = proto_perl->Iforkprocess;
9716 /* subprocess state */
9717 PL_fdpid = av_dup_inc(proto_perl->Ifdpid, param);
9719 /* internal state */
9720 PL_tainting = proto_perl->Itainting;
9721 PL_maxo = proto_perl->Imaxo;
9722 if (proto_perl->Iop_mask)
9723 PL_op_mask = SAVEPVN(proto_perl->Iop_mask, PL_maxo);
9725 PL_op_mask = Nullch;
9727 /* current interpreter roots */
9728 PL_main_cv = cv_dup_inc(proto_perl->Imain_cv, param);
9729 PL_main_root = OpREFCNT_inc(proto_perl->Imain_root);
9730 PL_main_start = proto_perl->Imain_start;
9731 PL_eval_root = proto_perl->Ieval_root;
9732 PL_eval_start = proto_perl->Ieval_start;
9734 /* runtime control stuff */
9735 PL_curcopdb = (COP*)any_dup(proto_perl->Icurcopdb, proto_perl);
9736 PL_copline = proto_perl->Icopline;
9738 PL_filemode = proto_perl->Ifilemode;
9739 PL_lastfd = proto_perl->Ilastfd;
9740 PL_oldname = proto_perl->Ioldname; /* XXX not quite right */
9743 PL_gensym = proto_perl->Igensym;
9744 PL_preambled = proto_perl->Ipreambled;
9745 PL_preambleav = av_dup_inc(proto_perl->Ipreambleav, param);
9746 PL_laststatval = proto_perl->Ilaststatval;
9747 PL_laststype = proto_perl->Ilaststype;
9748 PL_mess_sv = Nullsv;
9750 PL_ors_sv = sv_dup_inc(proto_perl->Iors_sv, param);
9751 PL_ofmt = SAVEPV(proto_perl->Iofmt);
9753 /* interpreter atexit processing */
9754 PL_exitlistlen = proto_perl->Iexitlistlen;
9755 if (PL_exitlistlen) {
9756 New(0, PL_exitlist, PL_exitlistlen, PerlExitListEntry);
9757 Copy(proto_perl->Iexitlist, PL_exitlist, PL_exitlistlen, PerlExitListEntry);
9760 PL_exitlist = (PerlExitListEntry*)NULL;
9761 PL_modglobal = hv_dup_inc(proto_perl->Imodglobal, param);
9763 PL_profiledata = NULL;
9764 PL_rsfp = fp_dup(proto_perl->Irsfp, '<');
9765 /* PL_rsfp_filters entries have fake IoDIRP() */
9766 PL_rsfp_filters = av_dup_inc(proto_perl->Irsfp_filters, param);
9768 PL_compcv = cv_dup(proto_perl->Icompcv, param);
9769 PL_comppad = av_dup(proto_perl->Icomppad, param);
9770 PL_comppad_name = av_dup(proto_perl->Icomppad_name, param);
9771 PL_comppad_name_fill = proto_perl->Icomppad_name_fill;
9772 PL_comppad_name_floor = proto_perl->Icomppad_name_floor;
9773 PL_curpad = (SV**)ptr_table_fetch(PL_ptr_table,
9774 proto_perl->Tcurpad);
9776 #ifdef HAVE_INTERP_INTERN
9777 sys_intern_dup(&proto_perl->Isys_intern, &PL_sys_intern);
9780 /* more statics moved here */
9781 PL_generation = proto_perl->Igeneration;
9782 PL_DBcv = cv_dup(proto_perl->IDBcv, param);
9784 PL_in_clean_objs = proto_perl->Iin_clean_objs;
9785 PL_in_clean_all = proto_perl->Iin_clean_all;
9787 PL_uid = proto_perl->Iuid;
9788 PL_euid = proto_perl->Ieuid;
9789 PL_gid = proto_perl->Igid;
9790 PL_egid = proto_perl->Iegid;
9791 PL_nomemok = proto_perl->Inomemok;
9792 PL_an = proto_perl->Ian;
9793 PL_cop_seqmax = proto_perl->Icop_seqmax;
9794 PL_op_seqmax = proto_perl->Iop_seqmax;
9795 PL_evalseq = proto_perl->Ievalseq;
9796 PL_origenviron = proto_perl->Iorigenviron; /* XXX not quite right */
9797 PL_origalen = proto_perl->Iorigalen;
9798 PL_pidstatus = newHV(); /* XXX flag for cloning? */
9799 PL_osname = SAVEPV(proto_perl->Iosname);
9800 PL_sh_path = SAVEPV(proto_perl->Ish_path);
9801 PL_sighandlerp = proto_perl->Isighandlerp;
9804 PL_runops = proto_perl->Irunops;
9806 Copy(proto_perl->Itokenbuf, PL_tokenbuf, 256, char);
9809 PL_cshlen = proto_perl->Icshlen;
9810 PL_cshname = SAVEPVN(proto_perl->Icshname, PL_cshlen);
9813 PL_lex_state = proto_perl->Ilex_state;
9814 PL_lex_defer = proto_perl->Ilex_defer;
9815 PL_lex_expect = proto_perl->Ilex_expect;
9816 PL_lex_formbrack = proto_perl->Ilex_formbrack;
9817 PL_lex_dojoin = proto_perl->Ilex_dojoin;
9818 PL_lex_starts = proto_perl->Ilex_starts;
9819 PL_lex_stuff = sv_dup_inc(proto_perl->Ilex_stuff, param);
9820 PL_lex_repl = sv_dup_inc(proto_perl->Ilex_repl, param);
9821 PL_lex_op = proto_perl->Ilex_op;
9822 PL_lex_inpat = proto_perl->Ilex_inpat;
9823 PL_lex_inwhat = proto_perl->Ilex_inwhat;
9824 PL_lex_brackets = proto_perl->Ilex_brackets;
9825 i = (PL_lex_brackets < 120 ? 120 : PL_lex_brackets);
9826 PL_lex_brackstack = SAVEPVN(proto_perl->Ilex_brackstack,i);
9827 PL_lex_casemods = proto_perl->Ilex_casemods;
9828 i = (PL_lex_casemods < 12 ? 12 : PL_lex_casemods);
9829 PL_lex_casestack = SAVEPVN(proto_perl->Ilex_casestack,i);
9831 Copy(proto_perl->Inextval, PL_nextval, 5, YYSTYPE);
9832 Copy(proto_perl->Inexttype, PL_nexttype, 5, I32);
9833 PL_nexttoke = proto_perl->Inexttoke;
9835 PL_linestr = sv_dup_inc(proto_perl->Ilinestr, param);
9836 i = proto_perl->Ibufptr - SvPVX(proto_perl->Ilinestr);
9837 PL_bufptr = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
9838 i = proto_perl->Ioldbufptr - SvPVX(proto_perl->Ilinestr);
9839 PL_oldbufptr = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
9840 i = proto_perl->Ioldoldbufptr - SvPVX(proto_perl->Ilinestr);
9841 PL_oldoldbufptr = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
9842 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
9843 i = proto_perl->Ilinestart - SvPVX(proto_perl->Ilinestr);
9844 PL_linestart = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
9845 PL_pending_ident = proto_perl->Ipending_ident;
9846 PL_sublex_info = proto_perl->Isublex_info; /* XXX not quite right */
9848 PL_expect = proto_perl->Iexpect;
9850 PL_multi_start = proto_perl->Imulti_start;
9851 PL_multi_end = proto_perl->Imulti_end;
9852 PL_multi_open = proto_perl->Imulti_open;
9853 PL_multi_close = proto_perl->Imulti_close;
9855 PL_error_count = proto_perl->Ierror_count;
9856 PL_subline = proto_perl->Isubline;
9857 PL_subname = sv_dup_inc(proto_perl->Isubname, param);
9859 PL_min_intro_pending = proto_perl->Imin_intro_pending;
9860 PL_max_intro_pending = proto_perl->Imax_intro_pending;
9861 PL_padix = proto_perl->Ipadix;
9862 PL_padix_floor = proto_perl->Ipadix_floor;
9863 PL_pad_reset_pending = proto_perl->Ipad_reset_pending;
9865 i = proto_perl->Ilast_uni - SvPVX(proto_perl->Ilinestr);
9866 PL_last_uni = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
9867 i = proto_perl->Ilast_lop - SvPVX(proto_perl->Ilinestr);
9868 PL_last_lop = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
9869 PL_last_lop_op = proto_perl->Ilast_lop_op;
9870 PL_in_my = proto_perl->Iin_my;
9871 PL_in_my_stash = hv_dup(proto_perl->Iin_my_stash, param);
9873 PL_cryptseen = proto_perl->Icryptseen;
9876 PL_hints = proto_perl->Ihints;
9878 PL_amagic_generation = proto_perl->Iamagic_generation;
9880 #ifdef USE_LOCALE_COLLATE
9881 PL_collation_ix = proto_perl->Icollation_ix;
9882 PL_collation_name = SAVEPV(proto_perl->Icollation_name);
9883 PL_collation_standard = proto_perl->Icollation_standard;
9884 PL_collxfrm_base = proto_perl->Icollxfrm_base;
9885 PL_collxfrm_mult = proto_perl->Icollxfrm_mult;
9886 #endif /* USE_LOCALE_COLLATE */
9888 #ifdef USE_LOCALE_NUMERIC
9889 PL_numeric_name = SAVEPV(proto_perl->Inumeric_name);
9890 PL_numeric_standard = proto_perl->Inumeric_standard;
9891 PL_numeric_local = proto_perl->Inumeric_local;
9892 PL_numeric_radix_sv = sv_dup_inc(proto_perl->Inumeric_radix_sv, param);
9893 #endif /* !USE_LOCALE_NUMERIC */
9895 /* utf8 character classes */
9896 PL_utf8_alnum = sv_dup_inc(proto_perl->Iutf8_alnum, param);
9897 PL_utf8_alnumc = sv_dup_inc(proto_perl->Iutf8_alnumc, param);
9898 PL_utf8_ascii = sv_dup_inc(proto_perl->Iutf8_ascii, param);
9899 PL_utf8_alpha = sv_dup_inc(proto_perl->Iutf8_alpha, param);
9900 PL_utf8_space = sv_dup_inc(proto_perl->Iutf8_space, param);
9901 PL_utf8_cntrl = sv_dup_inc(proto_perl->Iutf8_cntrl, param);
9902 PL_utf8_graph = sv_dup_inc(proto_perl->Iutf8_graph, param);
9903 PL_utf8_digit = sv_dup_inc(proto_perl->Iutf8_digit, param);
9904 PL_utf8_upper = sv_dup_inc(proto_perl->Iutf8_upper, param);
9905 PL_utf8_lower = sv_dup_inc(proto_perl->Iutf8_lower, param);
9906 PL_utf8_print = sv_dup_inc(proto_perl->Iutf8_print, param);
9907 PL_utf8_punct = sv_dup_inc(proto_perl->Iutf8_punct, param);
9908 PL_utf8_xdigit = sv_dup_inc(proto_perl->Iutf8_xdigit, param);
9909 PL_utf8_mark = sv_dup_inc(proto_perl->Iutf8_mark, param);
9910 PL_utf8_toupper = sv_dup_inc(proto_perl->Iutf8_toupper, param);
9911 PL_utf8_totitle = sv_dup_inc(proto_perl->Iutf8_totitle, param);
9912 PL_utf8_tolower = sv_dup_inc(proto_perl->Iutf8_tolower, param);
9915 PL_last_swash_hv = Nullhv; /* reinits on demand */
9916 PL_last_swash_klen = 0;
9917 PL_last_swash_key[0]= '\0';
9918 PL_last_swash_tmps = (U8*)NULL;
9919 PL_last_swash_slen = 0;
9921 /* perly.c globals */
9922 PL_yydebug = proto_perl->Iyydebug;
9923 PL_yynerrs = proto_perl->Iyynerrs;
9924 PL_yyerrflag = proto_perl->Iyyerrflag;
9925 PL_yychar = proto_perl->Iyychar;
9926 PL_yyval = proto_perl->Iyyval;
9927 PL_yylval = proto_perl->Iyylval;
9929 PL_glob_index = proto_perl->Iglob_index;
9930 PL_srand_called = proto_perl->Isrand_called;
9931 PL_uudmap['M'] = 0; /* reinits on demand */
9932 PL_bitcount = Nullch; /* reinits on demand */
9934 if (proto_perl->Ipsig_pend) {
9935 Newz(0, PL_psig_pend, SIG_SIZE, int);
9938 PL_psig_pend = (int*)NULL;
9941 if (proto_perl->Ipsig_ptr) {
9942 Newz(0, PL_psig_ptr, SIG_SIZE, SV*);
9943 Newz(0, PL_psig_name, SIG_SIZE, SV*);
9944 for (i = 1; i < SIG_SIZE; i++) {
9945 PL_psig_ptr[i] = sv_dup_inc(proto_perl->Ipsig_ptr[i], param);
9946 PL_psig_name[i] = sv_dup_inc(proto_perl->Ipsig_name[i], param);
9950 PL_psig_ptr = (SV**)NULL;
9951 PL_psig_name = (SV**)NULL;
9954 /* thrdvar.h stuff */
9956 if (flags & CLONEf_COPY_STACKS) {
9957 /* next allocation will be PL_tmps_stack[PL_tmps_ix+1] */
9958 PL_tmps_ix = proto_perl->Ttmps_ix;
9959 PL_tmps_max = proto_perl->Ttmps_max;
9960 PL_tmps_floor = proto_perl->Ttmps_floor;
9961 Newz(50, PL_tmps_stack, PL_tmps_max, SV*);
9963 while (i <= PL_tmps_ix) {
9964 PL_tmps_stack[i] = sv_dup_inc(proto_perl->Ttmps_stack[i], param);
9968 /* next PUSHMARK() sets *(PL_markstack_ptr+1) */
9969 i = proto_perl->Tmarkstack_max - proto_perl->Tmarkstack;
9970 Newz(54, PL_markstack, i, I32);
9971 PL_markstack_max = PL_markstack + (proto_perl->Tmarkstack_max
9972 - proto_perl->Tmarkstack);
9973 PL_markstack_ptr = PL_markstack + (proto_perl->Tmarkstack_ptr
9974 - proto_perl->Tmarkstack);
9975 Copy(proto_perl->Tmarkstack, PL_markstack,
9976 PL_markstack_ptr - PL_markstack + 1, I32);
9978 /* next push_scope()/ENTER sets PL_scopestack[PL_scopestack_ix]
9979 * NOTE: unlike the others! */
9980 PL_scopestack_ix = proto_perl->Tscopestack_ix;
9981 PL_scopestack_max = proto_perl->Tscopestack_max;
9982 Newz(54, PL_scopestack, PL_scopestack_max, I32);
9983 Copy(proto_perl->Tscopestack, PL_scopestack, PL_scopestack_ix, I32);
9985 /* next push_return() sets PL_retstack[PL_retstack_ix]
9986 * NOTE: unlike the others! */
9987 PL_retstack_ix = proto_perl->Tretstack_ix;
9988 PL_retstack_max = proto_perl->Tretstack_max;
9989 Newz(54, PL_retstack, PL_retstack_max, OP*);
9990 Copy(proto_perl->Tretstack, PL_retstack, PL_retstack_ix, I32);
9992 /* NOTE: si_dup() looks at PL_markstack */
9993 PL_curstackinfo = si_dup(proto_perl->Tcurstackinfo, param);
9995 /* PL_curstack = PL_curstackinfo->si_stack; */
9996 PL_curstack = av_dup(proto_perl->Tcurstack, param);
9997 PL_mainstack = av_dup(proto_perl->Tmainstack, param);
9999 /* next PUSHs() etc. set *(PL_stack_sp+1) */
10000 PL_stack_base = AvARRAY(PL_curstack);
10001 PL_stack_sp = PL_stack_base + (proto_perl->Tstack_sp
10002 - proto_perl->Tstack_base);
10003 PL_stack_max = PL_stack_base + AvMAX(PL_curstack);
10005 /* next SSPUSHFOO() sets PL_savestack[PL_savestack_ix]
10006 * NOTE: unlike the others! */
10007 PL_savestack_ix = proto_perl->Tsavestack_ix;
10008 PL_savestack_max = proto_perl->Tsavestack_max;
10009 /*Newz(54, PL_savestack, PL_savestack_max, ANY);*/
10010 PL_savestack = ss_dup(proto_perl, param);
10014 ENTER; /* perl_destruct() wants to LEAVE; */
10017 PL_start_env = proto_perl->Tstart_env; /* XXXXXX */
10018 PL_top_env = &PL_start_env;
10020 PL_op = proto_perl->Top;
10023 PL_Xpv = (XPV*)NULL;
10024 PL_na = proto_perl->Tna;
10026 PL_statbuf = proto_perl->Tstatbuf;
10027 PL_statcache = proto_perl->Tstatcache;
10028 PL_statgv = gv_dup(proto_perl->Tstatgv, param);
10029 PL_statname = sv_dup_inc(proto_perl->Tstatname, param);
10031 PL_timesbuf = proto_perl->Ttimesbuf;
10034 PL_tainted = proto_perl->Ttainted;
10035 PL_curpm = proto_perl->Tcurpm; /* XXX No PMOP ref count */
10036 PL_nrs = sv_dup_inc(proto_perl->Tnrs, param);
10037 PL_rs = sv_dup_inc(proto_perl->Trs, param);
10038 PL_last_in_gv = gv_dup(proto_perl->Tlast_in_gv, param);
10039 PL_ofs_sv = sv_dup_inc(proto_perl->Tofs_sv, param);
10040 PL_defoutgv = gv_dup_inc(proto_perl->Tdefoutgv, param);
10041 PL_chopset = proto_perl->Tchopset; /* XXX never deallocated */
10042 PL_toptarget = sv_dup_inc(proto_perl->Ttoptarget, param);
10043 PL_bodytarget = sv_dup_inc(proto_perl->Tbodytarget, param);
10044 PL_formtarget = sv_dup(proto_perl->Tformtarget, param);
10046 PL_restartop = proto_perl->Trestartop;
10047 PL_in_eval = proto_perl->Tin_eval;
10048 PL_delaymagic = proto_perl->Tdelaymagic;
10049 PL_dirty = proto_perl->Tdirty;
10050 PL_localizing = proto_perl->Tlocalizing;
10052 #ifdef PERL_FLEXIBLE_EXCEPTIONS
10053 PL_protect = proto_perl->Tprotect;
10055 PL_errors = sv_dup_inc(proto_perl->Terrors, param);
10056 PL_av_fetch_sv = Nullsv;
10057 PL_hv_fetch_sv = Nullsv;
10058 Zero(&PL_hv_fetch_ent_mh, 1, HE); /* XXX */
10059 PL_modcount = proto_perl->Tmodcount;
10060 PL_lastgotoprobe = Nullop;
10061 PL_dumpindent = proto_perl->Tdumpindent;
10063 PL_sortcop = (OP*)any_dup(proto_perl->Tsortcop, proto_perl);
10064 PL_sortstash = hv_dup(proto_perl->Tsortstash, param);
10065 PL_firstgv = gv_dup(proto_perl->Tfirstgv, param);
10066 PL_secondgv = gv_dup(proto_perl->Tsecondgv, param);
10067 PL_sortcxix = proto_perl->Tsortcxix;
10068 PL_efloatbuf = Nullch; /* reinits on demand */
10069 PL_efloatsize = 0; /* reinits on demand */
10073 PL_screamfirst = NULL;
10074 PL_screamnext = NULL;
10075 PL_maxscream = -1; /* reinits on demand */
10076 PL_lastscream = Nullsv;
10078 PL_watchaddr = NULL;
10079 PL_watchok = Nullch;
10081 PL_regdummy = proto_perl->Tregdummy;
10082 PL_regcomp_parse = Nullch;
10083 PL_regxend = Nullch;
10084 PL_regcode = (regnode*)NULL;
10087 PL_regprecomp = Nullch;
10092 PL_seen_zerolen = 0;
10094 PL_regcomp_rx = (regexp*)NULL;
10096 PL_colorset = 0; /* reinits PL_colors[] */
10097 /*PL_colors[6] = {0,0,0,0,0,0};*/
10098 PL_reg_whilem_seen = 0;
10099 PL_reginput = Nullch;
10100 PL_regbol = Nullch;
10101 PL_regeol = Nullch;
10102 PL_regstartp = (I32*)NULL;
10103 PL_regendp = (I32*)NULL;
10104 PL_reglastparen = (U32*)NULL;
10105 PL_regtill = Nullch;
10106 PL_reg_start_tmp = (char**)NULL;
10107 PL_reg_start_tmpl = 0;
10108 PL_regdata = (struct reg_data*)NULL;
10111 PL_reg_eval_set = 0;
10113 PL_regprogram = (regnode*)NULL;
10115 PL_regcc = (CURCUR*)NULL;
10116 PL_reg_call_cc = (struct re_cc_state*)NULL;
10117 PL_reg_re = (regexp*)NULL;
10118 PL_reg_ganch = Nullch;
10119 PL_reg_sv = Nullsv;
10120 PL_reg_magic = (MAGIC*)NULL;
10122 PL_reg_oldcurpm = (PMOP*)NULL;
10123 PL_reg_curpm = (PMOP*)NULL;
10124 PL_reg_oldsaved = Nullch;
10125 PL_reg_oldsavedlen = 0;
10126 PL_reg_maxiter = 0;
10127 PL_reg_leftiter = 0;
10128 PL_reg_poscache = Nullch;
10129 PL_reg_poscache_size= 0;
10131 /* RE engine - function pointers */
10132 PL_regcompp = proto_perl->Tregcompp;
10133 PL_regexecp = proto_perl->Tregexecp;
10134 PL_regint_start = proto_perl->Tregint_start;
10135 PL_regint_string = proto_perl->Tregint_string;
10136 PL_regfree = proto_perl->Tregfree;
10138 PL_reginterp_cnt = 0;
10139 PL_reg_starttry = 0;
10141 if (!(flags & CLONEf_KEEP_PTR_TABLE)) {
10142 ptr_table_free(PL_ptr_table);
10143 PL_ptr_table = NULL;
10146 /* Call the ->CLONE method, if it exists, for each of the stashes
10147 identified by sv_dup() above.
10149 while(av_len(param->stashes) != -1) {
10150 HV* stash = (HV*) av_shift(param->stashes);
10151 GV* cloner = gv_fetchmethod_autoload(stash, "CLONE", 0);
10152 if (cloner && GvCV(cloner)) {
10157 XPUSHs(newSVpv(HvNAME(stash), 0));
10159 call_sv((SV*)GvCV(cloner), G_DISCARD);
10166 return (PerlInterpreter*)pPerl;
10172 #else /* !USE_ITHREADS */
10178 #endif /* USE_ITHREADS */