3 * Copyright (c) 1991-2002, Larry Wall
5 * You may distribute under the terms of either the GNU General Public
6 * License or the Artistic License, as specified in the README file.
8 * "I wonder what the Entish is for 'yes' and 'no'," he thought.
11 * This file contains the code that creates, manipulates and destroys
12 * scalar values (SVs). The other types (AV, HV, GV, etc.) reuse the
13 * structure of an SV, so their creation and destruction is handled
14 * here; higher-level functions are in av.c, hv.c, and so on. Opcode
15 * level functions (eg. substr, split, join) for each of the types are
26 #ifdef PERL_COPY_ON_WRITE
27 #define SV_COW_NEXT_SV(sv) INT2PTR(SV *,SvUVX(sv))
28 #define SV_COW_NEXT_SV_SET(current,next) SvUVX(current) = PTR2UV(next)
29 /* This is a pessamistic view. Scalar must be purely a read-write PV to copy-
31 #define CAN_COW_MASK (SVs_OBJECT|SVs_GMG|SVs_SMG|SVs_RMG|SVf_IOK|SVf_NOK| \
32 SVf_POK|SVf_ROK|SVp_IOK|SVp_NOK|SVp_POK|SVf_FAKE| \
33 SVf_OOK|SVf_BREAK|SVf_READONLY|SVf_AMAGIC)
34 #define CAN_COW_FLAGS (SVp_POK|SVf_POK)
37 /* ============================================================================
39 =head1 Allocation and deallocation of SVs.
41 An SV (or AV, HV, etc.) is allocated in two parts: the head (struct sv,
42 av, hv...) contains type and reference count information, as well as a
43 pointer to the body (struct xrv, xpv, xpviv...), which contains fields
44 specific to each type.
46 Normally, this allocation is done using arenas, which are approximately
47 1K chunks of memory parcelled up into N heads or bodies. The first slot
48 in each arena is reserved, and is used to hold a link to the next arena.
49 In the case of heads, the unused first slot also contains some flags and
50 a note of the number of slots. Snaked through each arena chain is a
51 linked list of free items; when this becomes empty, an extra arena is
52 allocated and divided up into N items which are threaded into the free
55 The following global variables are associated with arenas:
57 PL_sv_arenaroot pointer to list of SV arenas
58 PL_sv_root pointer to list of free SV structures
60 PL_foo_arenaroot pointer to list of foo arenas,
61 PL_foo_root pointer to list of free foo bodies
62 ... for foo in xiv, xnv, xrv, xpv etc.
64 Note that some of the larger and more rarely used body types (eg xpvio)
65 are not allocated using arenas, but are instead just malloc()/free()ed as
66 required. Also, if PURIFY is defined, arenas are abandoned altogether,
67 with all items individually malloc()ed. In addition, a few SV heads are
68 not allocated from an arena, but are instead directly created as static
69 or auto variables, eg PL_sv_undef.
71 The SV arena serves the secondary purpose of allowing still-live SVs
72 to be located and destroyed during final cleanup.
74 At the lowest level, the macros new_SV() and del_SV() grab and free
75 an SV head. (If debugging with -DD, del_SV() calls the function S_del_sv()
76 to return the SV to the free list with error checking.) new_SV() calls
77 more_sv() / sv_add_arena() to add an extra arena if the free list is empty.
78 SVs in the free list have their SvTYPE field set to all ones.
80 Similarly, there are macros new_XIV()/del_XIV(), new_XNV()/del_XNV() etc
81 that allocate and return individual body types. Normally these are mapped
82 to the arena-manipulating functions new_xiv()/del_xiv() etc, but may be
83 instead mapped directly to malloc()/free() if PURIFY is defined. The
84 new/del functions remove from, or add to, the appropriate PL_foo_root
85 list, and call more_xiv() etc to add a new arena if the list is empty.
87 At the time of very final cleanup, sv_free_arenas() is called from
88 perl_destruct() to physically free all the arenas allocated since the
89 start of the interpreter. Note that this also clears PL_he_arenaroot,
90 which is otherwise dealt with in hv.c.
92 Manipulation of any of the PL_*root pointers is protected by enclosing
93 LOCK_SV_MUTEX; ... UNLOCK_SV_MUTEX calls which should Do the Right Thing
94 if threads are enabled.
96 The function visit() scans the SV arenas list, and calls a specified
97 function for each SV it finds which is still live - ie which has an SvTYPE
98 other than all 1's, and a non-zero SvREFCNT. visit() is used by the
99 following functions (specified as [function that calls visit()] / [function
100 called by visit() for each SV]):
102 sv_report_used() / do_report_used()
103 dump all remaining SVs (debugging aid)
105 sv_clean_objs() / do_clean_objs(),do_clean_named_objs()
106 Attempt to free all objects pointed to by RVs,
107 and, unless DISABLE_DESTRUCTOR_KLUDGE is defined,
108 try to do the same for all objects indirectly
109 referenced by typeglobs too. Called once from
110 perl_destruct(), prior to calling sv_clean_all()
113 sv_clean_all() / do_clean_all()
114 SvREFCNT_dec(sv) each remaining SV, possibly
115 triggering an sv_free(). It also sets the
116 SVf_BREAK flag on the SV to indicate that the
117 refcnt has been artificially lowered, and thus
118 stopping sv_free() from giving spurious warnings
119 about SVs which unexpectedly have a refcnt
120 of zero. called repeatedly from perl_destruct()
121 until there are no SVs left.
125 Private API to rest of sv.c
129 new_XIV(), del_XIV(),
130 new_XNV(), del_XNV(),
135 sv_report_used(), sv_clean_objs(), sv_clean_all(), sv_free_arenas()
140 ============================================================================ */
145 * "A time to plant, and a time to uproot what was planted..."
148 #define plant_SV(p) \
150 SvANY(p) = (void *)PL_sv_root; \
151 SvFLAGS(p) = SVTYPEMASK; \
156 /* sv_mutex must be held while calling uproot_SV() */
157 #define uproot_SV(p) \
160 PL_sv_root = (SV*)SvANY(p); \
165 /* new_SV(): return a new, empty SV head */
181 /* del_SV(): return an empty SV head to the free list */
196 S_del_sv(pTHX_ SV *p)
203 for (sva = PL_sv_arenaroot; sva; sva = (SV *) SvANY(sva)) {
205 svend = &sva[SvREFCNT(sva)];
206 if (p >= sv && p < svend)
210 if (ckWARN_d(WARN_INTERNAL))
211 Perl_warner(aTHX_ packWARN(WARN_INTERNAL),
212 "Attempt to free non-arena SV: 0x%"UVxf,
220 #else /* ! DEBUGGING */
222 #define del_SV(p) plant_SV(p)
224 #endif /* DEBUGGING */
228 =head1 SV Manipulation Functions
230 =for apidoc sv_add_arena
232 Given a chunk of memory, link it to the head of the list of arenas,
233 and split it into a list of free SVs.
239 Perl_sv_add_arena(pTHX_ char *ptr, U32 size, U32 flags)
244 Zero(ptr, size, char);
246 /* The first SV in an arena isn't an SV. */
247 SvANY(sva) = (void *) PL_sv_arenaroot; /* ptr to next arena */
248 SvREFCNT(sva) = size / sizeof(SV); /* number of SV slots */
249 SvFLAGS(sva) = flags; /* FAKE if not to be freed */
251 PL_sv_arenaroot = sva;
252 PL_sv_root = sva + 1;
254 svend = &sva[SvREFCNT(sva) - 1];
257 SvANY(sv) = (void *)(SV*)(sv + 1);
258 SvFLAGS(sv) = SVTYPEMASK;
262 SvFLAGS(sv) = SVTYPEMASK;
265 /* make some more SVs by adding another arena */
267 /* sv_mutex must be held while calling more_sv() */
274 sv_add_arena(PL_nice_chunk, PL_nice_chunk_size, 0);
275 PL_nice_chunk = Nullch;
276 PL_nice_chunk_size = 0;
279 char *chunk; /* must use New here to match call to */
280 New(704,chunk,1008,char); /* Safefree() in sv_free_arenas() */
281 sv_add_arena(chunk, 1008, 0);
287 /* visit(): call the named function for each non-free SV in the arenas. */
290 S_visit(pTHX_ SVFUNC_t f)
297 for (sva = PL_sv_arenaroot; sva; sva = (SV*)SvANY(sva)) {
298 svend = &sva[SvREFCNT(sva)];
299 for (sv = sva + 1; sv < svend; ++sv) {
300 if (SvTYPE(sv) != SVTYPEMASK && SvREFCNT(sv)) {
311 /* called by sv_report_used() for each live SV */
314 do_report_used(pTHX_ SV *sv)
316 if (SvTYPE(sv) != SVTYPEMASK) {
317 PerlIO_printf(Perl_debug_log, "****\n");
324 =for apidoc sv_report_used
326 Dump the contents of all SVs not yet freed. (Debugging aid).
332 Perl_sv_report_used(pTHX)
335 visit(do_report_used);
339 /* called by sv_clean_objs() for each live SV */
342 do_clean_objs(pTHX_ SV *sv)
346 if (SvROK(sv) && SvOBJECT(rv = SvRV(sv))) {
347 DEBUG_D((PerlIO_printf(Perl_debug_log, "Cleaning object ref:\n "), sv_dump(sv)));
359 /* XXX Might want to check arrays, etc. */
362 /* called by sv_clean_objs() for each live SV */
364 #ifndef DISABLE_DESTRUCTOR_KLUDGE
366 do_clean_named_objs(pTHX_ SV *sv)
368 if (SvTYPE(sv) == SVt_PVGV && GvGP(sv)) {
369 if ( SvOBJECT(GvSV(sv)) ||
370 (GvAV(sv) && SvOBJECT(GvAV(sv))) ||
371 (GvHV(sv) && SvOBJECT(GvHV(sv))) ||
372 (GvIO(sv) && SvOBJECT(GvIO(sv))) ||
373 (GvCV(sv) && SvOBJECT(GvCV(sv))) )
375 DEBUG_D((PerlIO_printf(Perl_debug_log, "Cleaning named glob object:\n "), sv_dump(sv)));
383 =for apidoc sv_clean_objs
385 Attempt to destroy all objects not yet freed
391 Perl_sv_clean_objs(pTHX)
393 PL_in_clean_objs = TRUE;
394 visit(do_clean_objs);
395 #ifndef DISABLE_DESTRUCTOR_KLUDGE
396 /* some barnacles may yet remain, clinging to typeglobs */
397 visit(do_clean_named_objs);
399 PL_in_clean_objs = FALSE;
402 /* called by sv_clean_all() for each live SV */
405 do_clean_all(pTHX_ SV *sv)
407 DEBUG_D((PerlIO_printf(Perl_debug_log, "Cleaning loops: SV at 0x%"UVxf"\n", PTR2UV(sv)) ));
408 SvFLAGS(sv) |= SVf_BREAK;
413 =for apidoc sv_clean_all
415 Decrement the refcnt of each remaining SV, possibly triggering a
416 cleanup. This function may have to be called multiple times to free
417 SVs which are in complex self-referential hierarchies.
423 Perl_sv_clean_all(pTHX)
426 PL_in_clean_all = TRUE;
427 cleaned = visit(do_clean_all);
428 PL_in_clean_all = FALSE;
433 =for apidoc sv_free_arenas
435 Deallocate the memory used by all arenas. Note that all the individual SV
436 heads and bodies within the arenas must already have been freed.
442 Perl_sv_free_arenas(pTHX)
446 XPV *arena, *arenanext;
448 /* Free arenas here, but be careful about fake ones. (We assume
449 contiguity of the fake ones with the corresponding real ones.) */
451 for (sva = PL_sv_arenaroot; sva; sva = svanext) {
452 svanext = (SV*) SvANY(sva);
453 while (svanext && SvFAKE(svanext))
454 svanext = (SV*) SvANY(svanext);
457 Safefree((void *)sva);
460 for (arena = PL_xiv_arenaroot; arena; arena = arenanext) {
461 arenanext = (XPV*)arena->xpv_pv;
464 PL_xiv_arenaroot = 0;
466 for (arena = PL_xnv_arenaroot; arena; arena = arenanext) {
467 arenanext = (XPV*)arena->xpv_pv;
470 PL_xnv_arenaroot = 0;
472 for (arena = PL_xrv_arenaroot; arena; arena = arenanext) {
473 arenanext = (XPV*)arena->xpv_pv;
476 PL_xrv_arenaroot = 0;
478 for (arena = PL_xpv_arenaroot; arena; arena = arenanext) {
479 arenanext = (XPV*)arena->xpv_pv;
482 PL_xpv_arenaroot = 0;
484 for (arena = (XPV*)PL_xpviv_arenaroot; arena; arena = arenanext) {
485 arenanext = (XPV*)arena->xpv_pv;
488 PL_xpviv_arenaroot = 0;
490 for (arena = (XPV*)PL_xpvnv_arenaroot; arena; arena = arenanext) {
491 arenanext = (XPV*)arena->xpv_pv;
494 PL_xpvnv_arenaroot = 0;
496 for (arena = (XPV*)PL_xpvcv_arenaroot; arena; arena = arenanext) {
497 arenanext = (XPV*)arena->xpv_pv;
500 PL_xpvcv_arenaroot = 0;
502 for (arena = (XPV*)PL_xpvav_arenaroot; arena; arena = arenanext) {
503 arenanext = (XPV*)arena->xpv_pv;
506 PL_xpvav_arenaroot = 0;
508 for (arena = (XPV*)PL_xpvhv_arenaroot; arena; arena = arenanext) {
509 arenanext = (XPV*)arena->xpv_pv;
512 PL_xpvhv_arenaroot = 0;
514 for (arena = (XPV*)PL_xpvmg_arenaroot; arena; arena = arenanext) {
515 arenanext = (XPV*)arena->xpv_pv;
518 PL_xpvmg_arenaroot = 0;
520 for (arena = (XPV*)PL_xpvlv_arenaroot; arena; arena = arenanext) {
521 arenanext = (XPV*)arena->xpv_pv;
524 PL_xpvlv_arenaroot = 0;
526 for (arena = (XPV*)PL_xpvbm_arenaroot; arena; arena = arenanext) {
527 arenanext = (XPV*)arena->xpv_pv;
530 PL_xpvbm_arenaroot = 0;
532 for (arena = (XPV*)PL_he_arenaroot; arena; arena = arenanext) {
533 arenanext = (XPV*)arena->xpv_pv;
539 Safefree(PL_nice_chunk);
540 PL_nice_chunk = Nullch;
541 PL_nice_chunk_size = 0;
547 =for apidoc report_uninit
549 Print appropriate "Use of uninitialized variable" warning
555 Perl_report_uninit(pTHX)
558 Perl_warner(aTHX_ packWARN(WARN_UNINITIALIZED), PL_warn_uninit,
559 " in ", OP_DESC(PL_op));
561 Perl_warner(aTHX_ packWARN(WARN_UNINITIALIZED), PL_warn_uninit, "", "");
564 /* grab a new IV body from the free list, allocating more if necessary */
575 * See comment in more_xiv() -- RAM.
577 PL_xiv_root = *(IV**)xiv;
579 return (XPVIV*)((char*)xiv - STRUCT_OFFSET(XPVIV, xiv_iv));
582 /* return an IV body to the free list */
585 S_del_xiv(pTHX_ XPVIV *p)
587 IV* xiv = (IV*)((char*)(p) + STRUCT_OFFSET(XPVIV, xiv_iv));
589 *(IV**)xiv = PL_xiv_root;
594 /* allocate another arena's worth of IV bodies */
602 New(705, ptr, 1008/sizeof(XPV), XPV);
603 ptr->xpv_pv = (char*)PL_xiv_arenaroot; /* linked list of xiv arenas */
604 PL_xiv_arenaroot = ptr; /* to keep Purify happy */
607 xivend = &xiv[1008 / sizeof(IV) - 1];
608 xiv += (sizeof(XPV) - 1) / sizeof(IV) + 1; /* fudge by size of XPV */
610 while (xiv < xivend) {
611 *(IV**)xiv = (IV *)(xiv + 1);
617 /* grab a new NV body from the free list, allocating more if necessary */
627 PL_xnv_root = *(NV**)xnv;
629 return (XPVNV*)((char*)xnv - STRUCT_OFFSET(XPVNV, xnv_nv));
632 /* return an NV body to the free list */
635 S_del_xnv(pTHX_ XPVNV *p)
637 NV* xnv = (NV*)((char*)(p) + STRUCT_OFFSET(XPVNV, xnv_nv));
639 *(NV**)xnv = PL_xnv_root;
644 /* allocate another arena's worth of NV bodies */
652 New(711, ptr, 1008/sizeof(XPV), XPV);
653 ptr->xpv_pv = (char*)PL_xnv_arenaroot;
654 PL_xnv_arenaroot = ptr;
657 xnvend = &xnv[1008 / sizeof(NV) - 1];
658 xnv += (sizeof(XPVIV) - 1) / sizeof(NV) + 1; /* fudge by sizeof XPVIV */
660 while (xnv < xnvend) {
661 *(NV**)xnv = (NV*)(xnv + 1);
667 /* grab a new struct xrv from the free list, allocating more if necessary */
677 PL_xrv_root = (XRV*)xrv->xrv_rv;
682 /* return a struct xrv to the free list */
685 S_del_xrv(pTHX_ XRV *p)
688 p->xrv_rv = (SV*)PL_xrv_root;
693 /* allocate another arena's worth of struct xrv */
699 register XRV* xrvend;
701 New(712, ptr, 1008/sizeof(XPV), XPV);
702 ptr->xpv_pv = (char*)PL_xrv_arenaroot;
703 PL_xrv_arenaroot = ptr;
706 xrvend = &xrv[1008 / sizeof(XRV) - 1];
707 xrv += (sizeof(XPV) - 1) / sizeof(XRV) + 1;
709 while (xrv < xrvend) {
710 xrv->xrv_rv = (SV*)(xrv + 1);
716 /* grab a new struct xpv from the free list, allocating more if necessary */
726 PL_xpv_root = (XPV*)xpv->xpv_pv;
731 /* return a struct xpv to the free list */
734 S_del_xpv(pTHX_ XPV *p)
737 p->xpv_pv = (char*)PL_xpv_root;
742 /* allocate another arena's worth of struct xpv */
748 register XPV* xpvend;
749 New(713, xpv, 1008/sizeof(XPV), XPV);
750 xpv->xpv_pv = (char*)PL_xpv_arenaroot;
751 PL_xpv_arenaroot = xpv;
753 xpvend = &xpv[1008 / sizeof(XPV) - 1];
755 while (xpv < xpvend) {
756 xpv->xpv_pv = (char*)(xpv + 1);
762 /* grab a new struct xpviv from the free list, allocating more if necessary */
771 xpviv = PL_xpviv_root;
772 PL_xpviv_root = (XPVIV*)xpviv->xpv_pv;
777 /* return a struct xpviv to the free list */
780 S_del_xpviv(pTHX_ XPVIV *p)
783 p->xpv_pv = (char*)PL_xpviv_root;
788 /* allocate another arena's worth of struct xpviv */
793 register XPVIV* xpviv;
794 register XPVIV* xpvivend;
795 New(714, xpviv, 1008/sizeof(XPVIV), XPVIV);
796 xpviv->xpv_pv = (char*)PL_xpviv_arenaroot;
797 PL_xpviv_arenaroot = xpviv;
799 xpvivend = &xpviv[1008 / sizeof(XPVIV) - 1];
800 PL_xpviv_root = ++xpviv;
801 while (xpviv < xpvivend) {
802 xpviv->xpv_pv = (char*)(xpviv + 1);
808 /* grab a new struct xpvnv from the free list, allocating more if necessary */
817 xpvnv = PL_xpvnv_root;
818 PL_xpvnv_root = (XPVNV*)xpvnv->xpv_pv;
823 /* return a struct xpvnv to the free list */
826 S_del_xpvnv(pTHX_ XPVNV *p)
829 p->xpv_pv = (char*)PL_xpvnv_root;
834 /* allocate another arena's worth of struct xpvnv */
839 register XPVNV* xpvnv;
840 register XPVNV* xpvnvend;
841 New(715, xpvnv, 1008/sizeof(XPVNV), XPVNV);
842 xpvnv->xpv_pv = (char*)PL_xpvnv_arenaroot;
843 PL_xpvnv_arenaroot = xpvnv;
845 xpvnvend = &xpvnv[1008 / sizeof(XPVNV) - 1];
846 PL_xpvnv_root = ++xpvnv;
847 while (xpvnv < xpvnvend) {
848 xpvnv->xpv_pv = (char*)(xpvnv + 1);
854 /* grab a new struct xpvcv from the free list, allocating more if necessary */
863 xpvcv = PL_xpvcv_root;
864 PL_xpvcv_root = (XPVCV*)xpvcv->xpv_pv;
869 /* return a struct xpvcv to the free list */
872 S_del_xpvcv(pTHX_ XPVCV *p)
875 p->xpv_pv = (char*)PL_xpvcv_root;
880 /* allocate another arena's worth of struct xpvcv */
885 register XPVCV* xpvcv;
886 register XPVCV* xpvcvend;
887 New(716, xpvcv, 1008/sizeof(XPVCV), XPVCV);
888 xpvcv->xpv_pv = (char*)PL_xpvcv_arenaroot;
889 PL_xpvcv_arenaroot = xpvcv;
891 xpvcvend = &xpvcv[1008 / sizeof(XPVCV) - 1];
892 PL_xpvcv_root = ++xpvcv;
893 while (xpvcv < xpvcvend) {
894 xpvcv->xpv_pv = (char*)(xpvcv + 1);
900 /* grab a new struct xpvav from the free list, allocating more if necessary */
909 xpvav = PL_xpvav_root;
910 PL_xpvav_root = (XPVAV*)xpvav->xav_array;
915 /* return a struct xpvav to the free list */
918 S_del_xpvav(pTHX_ XPVAV *p)
921 p->xav_array = (char*)PL_xpvav_root;
926 /* allocate another arena's worth of struct xpvav */
931 register XPVAV* xpvav;
932 register XPVAV* xpvavend;
933 New(717, xpvav, 1008/sizeof(XPVAV), XPVAV);
934 xpvav->xav_array = (char*)PL_xpvav_arenaroot;
935 PL_xpvav_arenaroot = xpvav;
937 xpvavend = &xpvav[1008 / sizeof(XPVAV) - 1];
938 PL_xpvav_root = ++xpvav;
939 while (xpvav < xpvavend) {
940 xpvav->xav_array = (char*)(xpvav + 1);
943 xpvav->xav_array = 0;
946 /* grab a new struct xpvhv from the free list, allocating more if necessary */
955 xpvhv = PL_xpvhv_root;
956 PL_xpvhv_root = (XPVHV*)xpvhv->xhv_array;
961 /* return a struct xpvhv to the free list */
964 S_del_xpvhv(pTHX_ XPVHV *p)
967 p->xhv_array = (char*)PL_xpvhv_root;
972 /* allocate another arena's worth of struct xpvhv */
977 register XPVHV* xpvhv;
978 register XPVHV* xpvhvend;
979 New(718, xpvhv, 1008/sizeof(XPVHV), XPVHV);
980 xpvhv->xhv_array = (char*)PL_xpvhv_arenaroot;
981 PL_xpvhv_arenaroot = xpvhv;
983 xpvhvend = &xpvhv[1008 / sizeof(XPVHV) - 1];
984 PL_xpvhv_root = ++xpvhv;
985 while (xpvhv < xpvhvend) {
986 xpvhv->xhv_array = (char*)(xpvhv + 1);
989 xpvhv->xhv_array = 0;
992 /* grab a new struct xpvmg from the free list, allocating more if necessary */
1001 xpvmg = PL_xpvmg_root;
1002 PL_xpvmg_root = (XPVMG*)xpvmg->xpv_pv;
1007 /* return a struct xpvmg to the free list */
1010 S_del_xpvmg(pTHX_ XPVMG *p)
1013 p->xpv_pv = (char*)PL_xpvmg_root;
1018 /* allocate another arena's worth of struct xpvmg */
1023 register XPVMG* xpvmg;
1024 register XPVMG* xpvmgend;
1025 New(719, xpvmg, 1008/sizeof(XPVMG), XPVMG);
1026 xpvmg->xpv_pv = (char*)PL_xpvmg_arenaroot;
1027 PL_xpvmg_arenaroot = xpvmg;
1029 xpvmgend = &xpvmg[1008 / sizeof(XPVMG) - 1];
1030 PL_xpvmg_root = ++xpvmg;
1031 while (xpvmg < xpvmgend) {
1032 xpvmg->xpv_pv = (char*)(xpvmg + 1);
1038 /* grab a new struct xpvlv from the free list, allocating more if necessary */
1047 xpvlv = PL_xpvlv_root;
1048 PL_xpvlv_root = (XPVLV*)xpvlv->xpv_pv;
1053 /* return a struct xpvlv to the free list */
1056 S_del_xpvlv(pTHX_ XPVLV *p)
1059 p->xpv_pv = (char*)PL_xpvlv_root;
1064 /* allocate another arena's worth of struct xpvlv */
1069 register XPVLV* xpvlv;
1070 register XPVLV* xpvlvend;
1071 New(720, xpvlv, 1008/sizeof(XPVLV), XPVLV);
1072 xpvlv->xpv_pv = (char*)PL_xpvlv_arenaroot;
1073 PL_xpvlv_arenaroot = xpvlv;
1075 xpvlvend = &xpvlv[1008 / sizeof(XPVLV) - 1];
1076 PL_xpvlv_root = ++xpvlv;
1077 while (xpvlv < xpvlvend) {
1078 xpvlv->xpv_pv = (char*)(xpvlv + 1);
1084 /* grab a new struct xpvbm from the free list, allocating more if necessary */
1093 xpvbm = PL_xpvbm_root;
1094 PL_xpvbm_root = (XPVBM*)xpvbm->xpv_pv;
1099 /* return a struct xpvbm to the free list */
1102 S_del_xpvbm(pTHX_ XPVBM *p)
1105 p->xpv_pv = (char*)PL_xpvbm_root;
1110 /* allocate another arena's worth of struct xpvbm */
1115 register XPVBM* xpvbm;
1116 register XPVBM* xpvbmend;
1117 New(721, xpvbm, 1008/sizeof(XPVBM), XPVBM);
1118 xpvbm->xpv_pv = (char*)PL_xpvbm_arenaroot;
1119 PL_xpvbm_arenaroot = xpvbm;
1121 xpvbmend = &xpvbm[1008 / sizeof(XPVBM) - 1];
1122 PL_xpvbm_root = ++xpvbm;
1123 while (xpvbm < xpvbmend) {
1124 xpvbm->xpv_pv = (char*)(xpvbm + 1);
1130 #define my_safemalloc(s) (void*)safemalloc(s)
1131 #define my_safefree(p) safefree((char*)p)
1135 #define new_XIV() my_safemalloc(sizeof(XPVIV))
1136 #define del_XIV(p) my_safefree(p)
1138 #define new_XNV() my_safemalloc(sizeof(XPVNV))
1139 #define del_XNV(p) my_safefree(p)
1141 #define new_XRV() my_safemalloc(sizeof(XRV))
1142 #define del_XRV(p) my_safefree(p)
1144 #define new_XPV() my_safemalloc(sizeof(XPV))
1145 #define del_XPV(p) my_safefree(p)
1147 #define new_XPVIV() my_safemalloc(sizeof(XPVIV))
1148 #define del_XPVIV(p) my_safefree(p)
1150 #define new_XPVNV() my_safemalloc(sizeof(XPVNV))
1151 #define del_XPVNV(p) my_safefree(p)
1153 #define new_XPVCV() my_safemalloc(sizeof(XPVCV))
1154 #define del_XPVCV(p) my_safefree(p)
1156 #define new_XPVAV() my_safemalloc(sizeof(XPVAV))
1157 #define del_XPVAV(p) my_safefree(p)
1159 #define new_XPVHV() my_safemalloc(sizeof(XPVHV))
1160 #define del_XPVHV(p) my_safefree(p)
1162 #define new_XPVMG() my_safemalloc(sizeof(XPVMG))
1163 #define del_XPVMG(p) my_safefree(p)
1165 #define new_XPVLV() my_safemalloc(sizeof(XPVLV))
1166 #define del_XPVLV(p) my_safefree(p)
1168 #define new_XPVBM() my_safemalloc(sizeof(XPVBM))
1169 #define del_XPVBM(p) my_safefree(p)
1173 #define new_XIV() (void*)new_xiv()
1174 #define del_XIV(p) del_xiv((XPVIV*) p)
1176 #define new_XNV() (void*)new_xnv()
1177 #define del_XNV(p) del_xnv((XPVNV*) p)
1179 #define new_XRV() (void*)new_xrv()
1180 #define del_XRV(p) del_xrv((XRV*) p)
1182 #define new_XPV() (void*)new_xpv()
1183 #define del_XPV(p) del_xpv((XPV *)p)
1185 #define new_XPVIV() (void*)new_xpviv()
1186 #define del_XPVIV(p) del_xpviv((XPVIV *)p)
1188 #define new_XPVNV() (void*)new_xpvnv()
1189 #define del_XPVNV(p) del_xpvnv((XPVNV *)p)
1191 #define new_XPVCV() (void*)new_xpvcv()
1192 #define del_XPVCV(p) del_xpvcv((XPVCV *)p)
1194 #define new_XPVAV() (void*)new_xpvav()
1195 #define del_XPVAV(p) del_xpvav((XPVAV *)p)
1197 #define new_XPVHV() (void*)new_xpvhv()
1198 #define del_XPVHV(p) del_xpvhv((XPVHV *)p)
1200 #define new_XPVMG() (void*)new_xpvmg()
1201 #define del_XPVMG(p) del_xpvmg((XPVMG *)p)
1203 #define new_XPVLV() (void*)new_xpvlv()
1204 #define del_XPVLV(p) del_xpvlv((XPVLV *)p)
1206 #define new_XPVBM() (void*)new_xpvbm()
1207 #define del_XPVBM(p) del_xpvbm((XPVBM *)p)
1211 #define new_XPVGV() my_safemalloc(sizeof(XPVGV))
1212 #define del_XPVGV(p) my_safefree(p)
1214 #define new_XPVFM() my_safemalloc(sizeof(XPVFM))
1215 #define del_XPVFM(p) my_safefree(p)
1217 #define new_XPVIO() my_safemalloc(sizeof(XPVIO))
1218 #define del_XPVIO(p) my_safefree(p)
1221 =for apidoc sv_upgrade
1223 Upgrade an SV to a more complex form. Generally adds a new body type to the
1224 SV, then copies across as much information as possible from the old body.
1225 You generally want to use the C<SvUPGRADE> macro wrapper. See also C<svtype>.
1231 Perl_sv_upgrade(pTHX_ register SV *sv, U32 mt)
1238 MAGIC* magic = NULL;
1241 if (mt != SVt_PV && SvIsCOW(sv)) {
1242 sv_force_normal_flags(sv, 0);
1245 if (SvTYPE(sv) == mt)
1249 (void)SvOOK_off(sv);
1251 switch (SvTYPE(sv)) {
1272 else if (mt < SVt_PVIV)
1289 pv = (char*)SvRV(sv);
1309 else if (mt == SVt_NV)
1320 del_XPVIV(SvANY(sv));
1330 del_XPVNV(SvANY(sv));
1338 magic = SvMAGIC(sv);
1339 stash = SvSTASH(sv);
1340 del_XPVMG(SvANY(sv));
1343 Perl_croak(aTHX_ "Can't upgrade that kind of scalar");
1348 Perl_croak(aTHX_ "Can't upgrade to undef");
1350 SvANY(sv) = new_XIV();
1354 SvANY(sv) = new_XNV();
1358 SvANY(sv) = new_XRV();
1362 SvANY(sv) = new_XPV();
1368 SvANY(sv) = new_XPVIV();
1378 SvANY(sv) = new_XPVNV();
1386 SvANY(sv) = new_XPVMG();
1392 SvMAGIC(sv) = magic;
1393 SvSTASH(sv) = stash;
1396 SvANY(sv) = new_XPVLV();
1402 SvMAGIC(sv) = magic;
1403 SvSTASH(sv) = stash;
1410 SvANY(sv) = new_XPVAV();
1418 SvMAGIC(sv) = magic;
1419 SvSTASH(sv) = stash;
1425 SvANY(sv) = new_XPVHV();
1431 HvTOTALKEYS(sv) = 0;
1432 HvPLACEHOLDERS(sv) = 0;
1433 SvMAGIC(sv) = magic;
1434 SvSTASH(sv) = stash;
1441 SvANY(sv) = new_XPVCV();
1442 Zero(SvANY(sv), 1, XPVCV);
1448 SvMAGIC(sv) = magic;
1449 SvSTASH(sv) = stash;
1452 SvANY(sv) = new_XPVGV();
1458 SvMAGIC(sv) = magic;
1459 SvSTASH(sv) = stash;
1467 SvANY(sv) = new_XPVBM();
1473 SvMAGIC(sv) = magic;
1474 SvSTASH(sv) = stash;
1480 SvANY(sv) = new_XPVFM();
1481 Zero(SvANY(sv), 1, XPVFM);
1487 SvMAGIC(sv) = magic;
1488 SvSTASH(sv) = stash;
1491 SvANY(sv) = new_XPVIO();
1492 Zero(SvANY(sv), 1, XPVIO);
1498 SvMAGIC(sv) = magic;
1499 SvSTASH(sv) = stash;
1500 IoPAGE_LEN(sv) = 60;
1503 SvFLAGS(sv) &= ~SVTYPEMASK;
1509 =for apidoc sv_backoff
1511 Remove any string offset. You should normally use the C<SvOOK_off> macro
1518 Perl_sv_backoff(pTHX_ register SV *sv)
1522 char *s = SvPVX(sv);
1523 SvLEN(sv) += SvIVX(sv);
1524 SvPVX(sv) -= SvIVX(sv);
1526 Move(s, SvPVX(sv), SvCUR(sv)+1, char);
1528 SvFLAGS(sv) &= ~SVf_OOK;
1535 Expands the character buffer in the SV. If necessary, uses C<sv_unref> and
1536 upgrades the SV to C<SVt_PV>. Returns a pointer to the character buffer.
1537 Use the C<SvGROW> wrapper instead.
1543 Perl_sv_grow(pTHX_ register SV *sv, register STRLEN newlen)
1549 #ifdef HAS_64K_LIMIT
1550 if (newlen >= 0x10000) {
1551 PerlIO_printf(Perl_debug_log,
1552 "Allocation too large: %"UVxf"\n", (UV)newlen);
1555 #endif /* HAS_64K_LIMIT */
1558 if (SvTYPE(sv) < SVt_PV) {
1559 sv_upgrade(sv, SVt_PV);
1562 else if (SvOOK(sv)) { /* pv is offset? */
1565 if (newlen > SvLEN(sv))
1566 newlen += 10 * (newlen - SvCUR(sv)); /* avoid copy each time */
1567 #ifdef HAS_64K_LIMIT
1568 if (newlen >= 0x10000)
1575 if (newlen > SvLEN(sv)) { /* need more room? */
1576 if (SvLEN(sv) && s) {
1578 STRLEN l = malloced_size((void*)SvPVX(sv));
1584 Renew(s,newlen,char);
1587 New(703, s, newlen, char);
1588 if (SvPVX(sv) && SvCUR(sv)) {
1589 Move(SvPVX(sv), s, (newlen < SvCUR(sv)) ? newlen : SvCUR(sv), char);
1593 SvLEN_set(sv, newlen);
1599 =for apidoc sv_setiv
1601 Copies an integer into the given SV, upgrading first if necessary.
1602 Does not handle 'set' magic. See also C<sv_setiv_mg>.
1608 Perl_sv_setiv(pTHX_ register SV *sv, IV i)
1610 SV_CHECK_THINKFIRST_COW_DROP(sv);
1611 switch (SvTYPE(sv)) {
1613 sv_upgrade(sv, SVt_IV);
1616 sv_upgrade(sv, SVt_PVNV);
1620 sv_upgrade(sv, SVt_PVIV);
1629 Perl_croak(aTHX_ "Can't coerce %s to integer in %s", sv_reftype(sv,0),
1632 (void)SvIOK_only(sv); /* validate number */
1638 =for apidoc sv_setiv_mg
1640 Like C<sv_setiv>, but also handles 'set' magic.
1646 Perl_sv_setiv_mg(pTHX_ register SV *sv, IV i)
1653 =for apidoc sv_setuv
1655 Copies an unsigned integer into the given SV, upgrading first if necessary.
1656 Does not handle 'set' magic. See also C<sv_setuv_mg>.
1662 Perl_sv_setuv(pTHX_ register SV *sv, UV u)
1664 /* With these two if statements:
1665 u=1.49 s=0.52 cu=72.49 cs=10.64 scripts=270 tests=20865
1668 u=1.35 s=0.47 cu=73.45 cs=11.43 scripts=270 tests=20865
1670 If you wish to remove them, please benchmark to see what the effect is
1672 if (u <= (UV)IV_MAX) {
1673 sv_setiv(sv, (IV)u);
1682 =for apidoc sv_setuv_mg
1684 Like C<sv_setuv>, but also handles 'set' magic.
1690 Perl_sv_setuv_mg(pTHX_ register SV *sv, UV u)
1692 /* With these two if statements:
1693 u=1.49 s=0.52 cu=72.49 cs=10.64 scripts=270 tests=20865
1696 u=1.35 s=0.47 cu=73.45 cs=11.43 scripts=270 tests=20865
1698 If you wish to remove them, please benchmark to see what the effect is
1700 if (u <= (UV)IV_MAX) {
1701 sv_setiv(sv, (IV)u);
1711 =for apidoc sv_setnv
1713 Copies a double into the given SV, upgrading first if necessary.
1714 Does not handle 'set' magic. See also C<sv_setnv_mg>.
1720 Perl_sv_setnv(pTHX_ register SV *sv, NV num)
1722 SV_CHECK_THINKFIRST_COW_DROP(sv);
1723 switch (SvTYPE(sv)) {
1726 sv_upgrade(sv, SVt_NV);
1731 sv_upgrade(sv, SVt_PVNV);
1740 Perl_croak(aTHX_ "Can't coerce %s to number in %s", sv_reftype(sv,0),
1744 (void)SvNOK_only(sv); /* validate number */
1749 =for apidoc sv_setnv_mg
1751 Like C<sv_setnv>, but also handles 'set' magic.
1757 Perl_sv_setnv_mg(pTHX_ register SV *sv, NV num)
1763 /* Print an "isn't numeric" warning, using a cleaned-up,
1764 * printable version of the offending string
1768 S_not_a_number(pTHX_ SV *sv)
1775 dsv = sv_2mortal(newSVpv("", 0));
1776 pv = sv_uni_display(dsv, sv, 10, 0);
1779 char *limit = tmpbuf + sizeof(tmpbuf) - 8;
1780 /* each *s can expand to 4 chars + "...\0",
1781 i.e. need room for 8 chars */
1784 for (s = SvPVX(sv), end = s + SvCUR(sv); s < end && d < limit; s++) {
1786 if (ch & 128 && !isPRINT_LC(ch)) {
1795 else if (ch == '\r') {
1799 else if (ch == '\f') {
1803 else if (ch == '\\') {
1807 else if (ch == '\0') {
1811 else if (isPRINT_LC(ch))
1828 Perl_warner(aTHX_ packWARN(WARN_NUMERIC),
1829 "Argument \"%s\" isn't numeric in %s", pv,
1832 Perl_warner(aTHX_ packWARN(WARN_NUMERIC),
1833 "Argument \"%s\" isn't numeric", pv);
1837 =for apidoc looks_like_number
1839 Test if the content of an SV looks like a number (or is a number).
1840 C<Inf> and C<Infinity> are treated as numbers (so will not issue a
1841 non-numeric warning), even if your atof() doesn't grok them.
1847 Perl_looks_like_number(pTHX_ SV *sv)
1849 register char *sbegin;
1856 else if (SvPOKp(sv))
1857 sbegin = SvPV(sv, len);
1859 return 1; /* Historic. Wrong? */
1860 return grok_number(sbegin, len, NULL);
1863 /* Actually, ISO C leaves conversion of UV to IV undefined, but
1864 until proven guilty, assume that things are not that bad... */
1869 As 64 bit platforms often have an NV that doesn't preserve all bits of
1870 an IV (an assumption perl has been based on to date) it becomes necessary
1871 to remove the assumption that the NV always carries enough precision to
1872 recreate the IV whenever needed, and that the NV is the canonical form.
1873 Instead, IV/UV and NV need to be given equal rights. So as to not lose
1874 precision as a side effect of conversion (which would lead to insanity
1875 and the dragon(s) in t/op/numconvert.t getting very angry) the intent is
1876 1) to distinguish between IV/UV/NV slots that have cached a valid
1877 conversion where precision was lost and IV/UV/NV slots that have a
1878 valid conversion which has lost no precision
1879 2) to ensure that if a numeric conversion to one form is requested that
1880 would lose precision, the precise conversion (or differently
1881 imprecise conversion) is also performed and cached, to prevent
1882 requests for different numeric formats on the same SV causing
1883 lossy conversion chains. (lossless conversion chains are perfectly
1888 SvIOKp is true if the IV slot contains a valid value
1889 SvIOK is true only if the IV value is accurate (UV if SvIOK_UV true)
1890 SvNOKp is true if the NV slot contains a valid value
1891 SvNOK is true only if the NV value is accurate
1894 while converting from PV to NV, check to see if converting that NV to an
1895 IV(or UV) would lose accuracy over a direct conversion from PV to
1896 IV(or UV). If it would, cache both conversions, return NV, but mark
1897 SV as IOK NOKp (ie not NOK).
1899 While converting from PV to IV, check to see if converting that IV to an
1900 NV would lose accuracy over a direct conversion from PV to NV. If it
1901 would, cache both conversions, flag similarly.
1903 Before, the SV value "3.2" could become NV=3.2 IV=3 NOK, IOK quite
1904 correctly because if IV & NV were set NV *always* overruled.
1905 Now, "3.2" will become NV=3.2 IV=3 NOK, IOKp, because the flag's meaning
1906 changes - now IV and NV together means that the two are interchangeable:
1907 SvIVX == (IV) SvNVX && SvNVX == (NV) SvIVX;
1909 The benefit of this is that operations such as pp_add know that if
1910 SvIOK is true for both left and right operands, then integer addition
1911 can be used instead of floating point (for cases where the result won't
1912 overflow). Before, floating point was always used, which could lead to
1913 loss of precision compared with integer addition.
1915 * making IV and NV equal status should make maths accurate on 64 bit
1917 * may speed up maths somewhat if pp_add and friends start to use
1918 integers when possible instead of fp. (Hopefully the overhead in
1919 looking for SvIOK and checking for overflow will not outweigh the
1920 fp to integer speedup)
1921 * will slow down integer operations (callers of SvIV) on "inaccurate"
1922 values, as the change from SvIOK to SvIOKp will cause a call into
1923 sv_2iv each time rather than a macro access direct to the IV slot
1924 * should speed up number->string conversion on integers as IV is
1925 favoured when IV and NV are equally accurate
1927 ####################################################################
1928 You had better be using SvIOK_notUV if you want an IV for arithmetic:
1929 SvIOK is true if (IV or UV), so you might be getting (IV)SvUV.
1930 On the other hand, SvUOK is true iff UV.
1931 ####################################################################
1933 Your mileage will vary depending your CPU's relative fp to integer
1937 #ifndef NV_PRESERVES_UV
1938 # define IS_NUMBER_UNDERFLOW_IV 1
1939 # define IS_NUMBER_UNDERFLOW_UV 2
1940 # define IS_NUMBER_IV_AND_UV 2
1941 # define IS_NUMBER_OVERFLOW_IV 4
1942 # define IS_NUMBER_OVERFLOW_UV 5
1944 /* sv_2iuv_non_preserve(): private routine for use by sv_2iv() and sv_2uv() */
1946 /* For sv_2nv these three cases are "SvNOK and don't bother casting" */
1948 S_sv_2iuv_non_preserve(pTHX_ register SV *sv, I32 numtype)
1950 DEBUG_c(PerlIO_printf(Perl_debug_log,"sv_2iuv_non '%s', IV=0x%"UVxf" NV=%"NVgf" inttype=%"UVXf"\n", SvPVX(sv), SvIVX(sv), SvNVX(sv), (UV)numtype));
1951 if (SvNVX(sv) < (NV)IV_MIN) {
1952 (void)SvIOKp_on(sv);
1955 return IS_NUMBER_UNDERFLOW_IV;
1957 if (SvNVX(sv) > (NV)UV_MAX) {
1958 (void)SvIOKp_on(sv);
1962 return IS_NUMBER_OVERFLOW_UV;
1964 (void)SvIOKp_on(sv);
1966 /* Can't use strtol etc to convert this string. (See truth table in
1968 if (SvNVX(sv) <= (UV)IV_MAX) {
1969 SvIVX(sv) = I_V(SvNVX(sv));
1970 if ((NV)(SvIVX(sv)) == SvNVX(sv)) {
1971 SvIOK_on(sv); /* Integer is precise. NOK, IOK */
1973 /* Integer is imprecise. NOK, IOKp */
1975 return SvNVX(sv) < 0 ? IS_NUMBER_UNDERFLOW_UV : IS_NUMBER_IV_AND_UV;
1978 SvUVX(sv) = U_V(SvNVX(sv));
1979 if ((NV)(SvUVX(sv)) == SvNVX(sv)) {
1980 if (SvUVX(sv) == UV_MAX) {
1981 /* As we know that NVs don't preserve UVs, UV_MAX cannot
1982 possibly be preserved by NV. Hence, it must be overflow.
1984 return IS_NUMBER_OVERFLOW_UV;
1986 SvIOK_on(sv); /* Integer is precise. NOK, UOK */
1988 /* Integer is imprecise. NOK, IOKp */
1990 return IS_NUMBER_OVERFLOW_IV;
1992 #endif /* !NV_PRESERVES_UV*/
1997 Return the integer value of an SV, doing any necessary string conversion,
1998 magic etc. Normally used via the C<SvIV(sv)> and C<SvIVx(sv)> macros.
2004 Perl_sv_2iv(pTHX_ register SV *sv)
2008 if (SvGMAGICAL(sv)) {
2013 return I_V(SvNVX(sv));
2015 if (SvPOKp(sv) && SvLEN(sv))
2018 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
2019 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
2025 if (SvTHINKFIRST(sv)) {
2028 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv,numer)) &&
2029 (SvTYPE(tmpstr) != SVt_RV || (SvRV(tmpstr) != SvRV(sv))))
2030 return SvIV(tmpstr);
2031 return PTR2IV(SvRV(sv));
2034 sv_force_normal_flags(sv, 0);
2036 if (SvREADONLY(sv) && !SvOK(sv)) {
2037 if (ckWARN(WARN_UNINITIALIZED))
2044 return (IV)(SvUVX(sv));
2051 /* erm. not sure. *should* never get NOKp (without NOK) from sv_2nv
2052 * without also getting a cached IV/UV from it at the same time
2053 * (ie PV->NV conversion should detect loss of accuracy and cache
2054 * IV or UV at same time to avoid this. NWC */
2056 if (SvTYPE(sv) == SVt_NV)
2057 sv_upgrade(sv, SVt_PVNV);
2059 (void)SvIOKp_on(sv); /* Must do this first, to clear any SvOOK */
2060 /* < not <= as for NV doesn't preserve UV, ((NV)IV_MAX+1) will almost
2061 certainly cast into the IV range at IV_MAX, whereas the correct
2062 answer is the UV IV_MAX +1. Hence < ensures that dodgy boundary
2064 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2065 SvIVX(sv) = I_V(SvNVX(sv));
2066 if (SvNVX(sv) == (NV) SvIVX(sv)
2067 #ifndef NV_PRESERVES_UV
2068 && (((UV)1 << NV_PRESERVES_UV_BITS) >
2069 (UV)(SvIVX(sv) > 0 ? SvIVX(sv) : -SvIVX(sv)))
2070 /* Don't flag it as "accurately an integer" if the number
2071 came from a (by definition imprecise) NV operation, and
2072 we're outside the range of NV integer precision */
2075 SvIOK_on(sv); /* Can this go wrong with rounding? NWC */
2076 DEBUG_c(PerlIO_printf(Perl_debug_log,
2077 "0x%"UVxf" iv(%"NVgf" => %"IVdf") (precise)\n",
2083 /* IV not precise. No need to convert from PV, as NV
2084 conversion would already have cached IV if it detected
2085 that PV->IV would be better than PV->NV->IV
2086 flags already correct - don't set public IOK. */
2087 DEBUG_c(PerlIO_printf(Perl_debug_log,
2088 "0x%"UVxf" iv(%"NVgf" => %"IVdf") (imprecise)\n",
2093 /* Can the above go wrong if SvIVX == IV_MIN and SvNVX < IV_MIN,
2094 but the cast (NV)IV_MIN rounds to a the value less (more
2095 negative) than IV_MIN which happens to be equal to SvNVX ??
2096 Analogous to 0xFFFFFFFFFFFFFFFF rounding up to NV (2**64) and
2097 NV rounding back to 0xFFFFFFFFFFFFFFFF, so UVX == UV(NVX) and
2098 (NV)UVX == NVX are both true, but the values differ. :-(
2099 Hopefully for 2s complement IV_MIN is something like
2100 0x8000000000000000 which will be exact. NWC */
2103 SvUVX(sv) = U_V(SvNVX(sv));
2105 (SvNVX(sv) == (NV) SvUVX(sv))
2106 #ifndef NV_PRESERVES_UV
2107 /* Make sure it's not 0xFFFFFFFFFFFFFFFF */
2108 /*&& (SvUVX(sv) != UV_MAX) irrelevant with code below */
2109 && (((UV)1 << NV_PRESERVES_UV_BITS) > SvUVX(sv))
2110 /* Don't flag it as "accurately an integer" if the number
2111 came from a (by definition imprecise) NV operation, and
2112 we're outside the range of NV integer precision */
2118 DEBUG_c(PerlIO_printf(Perl_debug_log,
2119 "0x%"UVxf" 2iv(%"UVuf" => %"IVdf") (as unsigned)\n",
2123 return (IV)SvUVX(sv);
2126 else if (SvPOKp(sv) && SvLEN(sv)) {
2128 int numtype = grok_number(SvPVX(sv), SvCUR(sv), &value);
2129 /* We want to avoid a possible problem when we cache an IV which
2130 may be later translated to an NV, and the resulting NV is not
2131 the same as the direct translation of the initial string
2132 (eg 123.456 can shortcut to the IV 123 with atol(), but we must
2133 be careful to ensure that the value with the .456 is around if the
2134 NV value is requested in the future).
2136 This means that if we cache such an IV, we need to cache the
2137 NV as well. Moreover, we trade speed for space, and do not
2138 cache the NV if we are sure it's not needed.
2141 /* SVt_PVNV is one higher than SVt_PVIV, hence this order */
2142 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2143 == IS_NUMBER_IN_UV) {
2144 /* It's definitely an integer, only upgrade to PVIV */
2145 if (SvTYPE(sv) < SVt_PVIV)
2146 sv_upgrade(sv, SVt_PVIV);
2148 } else if (SvTYPE(sv) < SVt_PVNV)
2149 sv_upgrade(sv, SVt_PVNV);
2151 /* If NV preserves UV then we only use the UV value if we know that
2152 we aren't going to call atof() below. If NVs don't preserve UVs
2153 then the value returned may have more precision than atof() will
2154 return, even though value isn't perfectly accurate. */
2155 if ((numtype & (IS_NUMBER_IN_UV
2156 #ifdef NV_PRESERVES_UV
2159 )) == IS_NUMBER_IN_UV) {
2160 /* This won't turn off the public IOK flag if it was set above */
2161 (void)SvIOKp_on(sv);
2163 if (!(numtype & IS_NUMBER_NEG)) {
2165 if (value <= (UV)IV_MAX) {
2166 SvIVX(sv) = (IV)value;
2172 /* 2s complement assumption */
2173 if (value <= (UV)IV_MIN) {
2174 SvIVX(sv) = -(IV)value;
2176 /* Too negative for an IV. This is a double upgrade, but
2177 I'm assuming it will be rare. */
2178 if (SvTYPE(sv) < SVt_PVNV)
2179 sv_upgrade(sv, SVt_PVNV);
2183 SvNVX(sv) = -(NV)value;
2188 /* For !NV_PRESERVES_UV and IS_NUMBER_IN_UV and IS_NUMBER_NOT_INT we
2189 will be in the previous block to set the IV slot, and the next
2190 block to set the NV slot. So no else here. */
2192 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2193 != IS_NUMBER_IN_UV) {
2194 /* It wasn't an (integer that doesn't overflow the UV). */
2195 SvNVX(sv) = Atof(SvPVX(sv));
2197 if (! numtype && ckWARN(WARN_NUMERIC))
2200 #if defined(USE_LONG_DOUBLE)
2201 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2iv(%" PERL_PRIgldbl ")\n",
2202 PTR2UV(sv), SvNVX(sv)));
2204 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2iv(%"NVgf")\n",
2205 PTR2UV(sv), SvNVX(sv)));
2209 #ifdef NV_PRESERVES_UV
2210 (void)SvIOKp_on(sv);
2212 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2213 SvIVX(sv) = I_V(SvNVX(sv));
2214 if ((NV)(SvIVX(sv)) == SvNVX(sv)) {
2217 /* Integer is imprecise. NOK, IOKp */
2219 /* UV will not work better than IV */
2221 if (SvNVX(sv) > (NV)UV_MAX) {
2223 /* Integer is inaccurate. NOK, IOKp, is UV */
2227 SvUVX(sv) = U_V(SvNVX(sv));
2228 /* 0xFFFFFFFFFFFFFFFF not an issue in here */
2229 if ((NV)(SvUVX(sv)) == SvNVX(sv)) {
2233 /* Integer is imprecise. NOK, IOKp, is UV */
2239 #else /* NV_PRESERVES_UV */
2240 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2241 == (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT)) {
2242 /* The IV slot will have been set from value returned by
2243 grok_number above. The NV slot has just been set using
2246 assert (SvIOKp(sv));
2248 if (((UV)1 << NV_PRESERVES_UV_BITS) >
2249 U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))) {
2250 /* Small enough to preserve all bits. */
2251 (void)SvIOKp_on(sv);
2253 SvIVX(sv) = I_V(SvNVX(sv));
2254 if ((NV)(SvIVX(sv)) == SvNVX(sv))
2256 /* Assumption: first non-preserved integer is < IV_MAX,
2257 this NV is in the preserved range, therefore: */
2258 if (!(U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))
2260 Perl_croak(aTHX_ "sv_2iv assumed (U_V(fabs(SvNVX(sv))) < (UV)IV_MAX) but SvNVX(sv)=%"NVgf" U_V is 0x%"UVxf", IV_MAX is 0x%"UVxf"\n", SvNVX(sv), U_V(SvNVX(sv)), (UV)IV_MAX);
2264 0 0 already failed to read UV.
2265 0 1 already failed to read UV.
2266 1 0 you won't get here in this case. IV/UV
2267 slot set, public IOK, Atof() unneeded.
2268 1 1 already read UV.
2269 so there's no point in sv_2iuv_non_preserve() attempting
2270 to use atol, strtol, strtoul etc. */
2271 if (sv_2iuv_non_preserve (sv, numtype)
2272 >= IS_NUMBER_OVERFLOW_IV)
2276 #endif /* NV_PRESERVES_UV */
2279 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing && !(SvFLAGS(sv) & SVs_PADTMP))
2281 if (SvTYPE(sv) < SVt_IV)
2282 /* Typically the caller expects that sv_any is not NULL now. */
2283 sv_upgrade(sv, SVt_IV);
2286 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2iv(%"IVdf")\n",
2287 PTR2UV(sv),SvIVX(sv)));
2288 return SvIsUV(sv) ? (IV)SvUVX(sv) : SvIVX(sv);
2294 Return the unsigned integer value of an SV, doing any necessary string
2295 conversion, magic etc. Normally used via the C<SvUV(sv)> and C<SvUVx(sv)>
2302 Perl_sv_2uv(pTHX_ register SV *sv)
2306 if (SvGMAGICAL(sv)) {
2311 return U_V(SvNVX(sv));
2312 if (SvPOKp(sv) && SvLEN(sv))
2315 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
2316 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
2322 if (SvTHINKFIRST(sv)) {
2325 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv,numer)) &&
2326 (SvTYPE(tmpstr) != SVt_RV || (SvRV(tmpstr) != SvRV(sv))))
2327 return SvUV(tmpstr);
2328 return PTR2UV(SvRV(sv));
2331 sv_force_normal_flags(sv, 0);
2333 if (SvREADONLY(sv) && !SvOK(sv)) {
2334 if (ckWARN(WARN_UNINITIALIZED))
2344 return (UV)SvIVX(sv);
2348 /* erm. not sure. *should* never get NOKp (without NOK) from sv_2nv
2349 * without also getting a cached IV/UV from it at the same time
2350 * (ie PV->NV conversion should detect loss of accuracy and cache
2351 * IV or UV at same time to avoid this. */
2352 /* IV-over-UV optimisation - choose to cache IV if possible */
2354 if (SvTYPE(sv) == SVt_NV)
2355 sv_upgrade(sv, SVt_PVNV);
2357 (void)SvIOKp_on(sv); /* Must do this first, to clear any SvOOK */
2358 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2359 SvIVX(sv) = I_V(SvNVX(sv));
2360 if (SvNVX(sv) == (NV) SvIVX(sv)
2361 #ifndef NV_PRESERVES_UV
2362 && (((UV)1 << NV_PRESERVES_UV_BITS) >
2363 (UV)(SvIVX(sv) > 0 ? SvIVX(sv) : -SvIVX(sv)))
2364 /* Don't flag it as "accurately an integer" if the number
2365 came from a (by definition imprecise) NV operation, and
2366 we're outside the range of NV integer precision */
2369 SvIOK_on(sv); /* Can this go wrong with rounding? NWC */
2370 DEBUG_c(PerlIO_printf(Perl_debug_log,
2371 "0x%"UVxf" uv(%"NVgf" => %"IVdf") (precise)\n",
2377 /* IV not precise. No need to convert from PV, as NV
2378 conversion would already have cached IV if it detected
2379 that PV->IV would be better than PV->NV->IV
2380 flags already correct - don't set public IOK. */
2381 DEBUG_c(PerlIO_printf(Perl_debug_log,
2382 "0x%"UVxf" uv(%"NVgf" => %"IVdf") (imprecise)\n",
2387 /* Can the above go wrong if SvIVX == IV_MIN and SvNVX < IV_MIN,
2388 but the cast (NV)IV_MIN rounds to a the value less (more
2389 negative) than IV_MIN which happens to be equal to SvNVX ??
2390 Analogous to 0xFFFFFFFFFFFFFFFF rounding up to NV (2**64) and
2391 NV rounding back to 0xFFFFFFFFFFFFFFFF, so UVX == UV(NVX) and
2392 (NV)UVX == NVX are both true, but the values differ. :-(
2393 Hopefully for 2s complement IV_MIN is something like
2394 0x8000000000000000 which will be exact. NWC */
2397 SvUVX(sv) = U_V(SvNVX(sv));
2399 (SvNVX(sv) == (NV) SvUVX(sv))
2400 #ifndef NV_PRESERVES_UV
2401 /* Make sure it's not 0xFFFFFFFFFFFFFFFF */
2402 /*&& (SvUVX(sv) != UV_MAX) irrelevant with code below */
2403 && (((UV)1 << NV_PRESERVES_UV_BITS) > SvUVX(sv))
2404 /* Don't flag it as "accurately an integer" if the number
2405 came from a (by definition imprecise) NV operation, and
2406 we're outside the range of NV integer precision */
2411 DEBUG_c(PerlIO_printf(Perl_debug_log,
2412 "0x%"UVxf" 2uv(%"UVuf" => %"IVdf") (as unsigned)\n",
2418 else if (SvPOKp(sv) && SvLEN(sv)) {
2420 int numtype = grok_number(SvPVX(sv), SvCUR(sv), &value);
2422 /* We want to avoid a possible problem when we cache a UV which
2423 may be later translated to an NV, and the resulting NV is not
2424 the translation of the initial data.
2426 This means that if we cache such a UV, we need to cache the
2427 NV as well. Moreover, we trade speed for space, and do not
2428 cache the NV if not needed.
2431 /* SVt_PVNV is one higher than SVt_PVIV, hence this order */
2432 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2433 == IS_NUMBER_IN_UV) {
2434 /* It's definitely an integer, only upgrade to PVIV */
2435 if (SvTYPE(sv) < SVt_PVIV)
2436 sv_upgrade(sv, SVt_PVIV);
2438 } else if (SvTYPE(sv) < SVt_PVNV)
2439 sv_upgrade(sv, SVt_PVNV);
2441 /* If NV preserves UV then we only use the UV value if we know that
2442 we aren't going to call atof() below. If NVs don't preserve UVs
2443 then the value returned may have more precision than atof() will
2444 return, even though it isn't accurate. */
2445 if ((numtype & (IS_NUMBER_IN_UV
2446 #ifdef NV_PRESERVES_UV
2449 )) == IS_NUMBER_IN_UV) {
2450 /* This won't turn off the public IOK flag if it was set above */
2451 (void)SvIOKp_on(sv);
2453 if (!(numtype & IS_NUMBER_NEG)) {
2455 if (value <= (UV)IV_MAX) {
2456 SvIVX(sv) = (IV)value;
2458 /* it didn't overflow, and it was positive. */
2463 /* 2s complement assumption */
2464 if (value <= (UV)IV_MIN) {
2465 SvIVX(sv) = -(IV)value;
2467 /* Too negative for an IV. This is a double upgrade, but
2468 I'm assuming it will be rare. */
2469 if (SvTYPE(sv) < SVt_PVNV)
2470 sv_upgrade(sv, SVt_PVNV);
2474 SvNVX(sv) = -(NV)value;
2480 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2481 != IS_NUMBER_IN_UV) {
2482 /* It wasn't an integer, or it overflowed the UV. */
2483 SvNVX(sv) = Atof(SvPVX(sv));
2485 if (! numtype && ckWARN(WARN_NUMERIC))
2488 #if defined(USE_LONG_DOUBLE)
2489 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2uv(%" PERL_PRIgldbl ")\n",
2490 PTR2UV(sv), SvNVX(sv)));
2492 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2uv(%"NVgf")\n",
2493 PTR2UV(sv), SvNVX(sv)));
2496 #ifdef NV_PRESERVES_UV
2497 (void)SvIOKp_on(sv);
2499 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2500 SvIVX(sv) = I_V(SvNVX(sv));
2501 if ((NV)(SvIVX(sv)) == SvNVX(sv)) {
2504 /* Integer is imprecise. NOK, IOKp */
2506 /* UV will not work better than IV */
2508 if (SvNVX(sv) > (NV)UV_MAX) {
2510 /* Integer is inaccurate. NOK, IOKp, is UV */
2514 SvUVX(sv) = U_V(SvNVX(sv));
2515 /* 0xFFFFFFFFFFFFFFFF not an issue in here, NVs
2516 NV preservse UV so can do correct comparison. */
2517 if ((NV)(SvUVX(sv)) == SvNVX(sv)) {
2521 /* Integer is imprecise. NOK, IOKp, is UV */
2526 #else /* NV_PRESERVES_UV */
2527 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2528 == (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT)) {
2529 /* The UV slot will have been set from value returned by
2530 grok_number above. The NV slot has just been set using
2533 assert (SvIOKp(sv));
2535 if (((UV)1 << NV_PRESERVES_UV_BITS) >
2536 U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))) {
2537 /* Small enough to preserve all bits. */
2538 (void)SvIOKp_on(sv);
2540 SvIVX(sv) = I_V(SvNVX(sv));
2541 if ((NV)(SvIVX(sv)) == SvNVX(sv))
2543 /* Assumption: first non-preserved integer is < IV_MAX,
2544 this NV is in the preserved range, therefore: */
2545 if (!(U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))
2547 Perl_croak(aTHX_ "sv_2uv assumed (U_V(fabs(SvNVX(sv))) < (UV)IV_MAX) but SvNVX(sv)=%"NVgf" U_V is 0x%"UVxf", IV_MAX is 0x%"UVxf"\n", SvNVX(sv), U_V(SvNVX(sv)), (UV)IV_MAX);
2550 sv_2iuv_non_preserve (sv, numtype);
2552 #endif /* NV_PRESERVES_UV */
2556 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
2557 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
2560 if (SvTYPE(sv) < SVt_IV)
2561 /* Typically the caller expects that sv_any is not NULL now. */
2562 sv_upgrade(sv, SVt_IV);
2566 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2uv(%"UVuf")\n",
2567 PTR2UV(sv),SvUVX(sv)));
2568 return SvIsUV(sv) ? SvUVX(sv) : (UV)SvIVX(sv);
2574 Return the num value of an SV, doing any necessary string or integer
2575 conversion, magic etc. Normally used via the C<SvNV(sv)> and C<SvNVx(sv)>
2582 Perl_sv_2nv(pTHX_ register SV *sv)
2586 if (SvGMAGICAL(sv)) {
2590 if (SvPOKp(sv) && SvLEN(sv)) {
2591 if (ckWARN(WARN_NUMERIC) && !SvIOKp(sv) &&
2592 !grok_number(SvPVX(sv), SvCUR(sv), NULL))
2594 return Atof(SvPVX(sv));
2598 return (NV)SvUVX(sv);
2600 return (NV)SvIVX(sv);
2603 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
2604 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
2610 if (SvTHINKFIRST(sv)) {
2613 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv,numer)) &&
2614 (SvTYPE(tmpstr) != SVt_RV || (SvRV(tmpstr) != SvRV(sv))))
2615 return SvNV(tmpstr);
2616 return PTR2NV(SvRV(sv));
2619 sv_force_normal_flags(sv, 0);
2621 if (SvREADONLY(sv) && !SvOK(sv)) {
2622 if (ckWARN(WARN_UNINITIALIZED))
2627 if (SvTYPE(sv) < SVt_NV) {
2628 if (SvTYPE(sv) == SVt_IV)
2629 sv_upgrade(sv, SVt_PVNV);
2631 sv_upgrade(sv, SVt_NV);
2632 #ifdef USE_LONG_DOUBLE
2634 STORE_NUMERIC_LOCAL_SET_STANDARD();
2635 PerlIO_printf(Perl_debug_log,
2636 "0x%"UVxf" num(%" PERL_PRIgldbl ")\n",
2637 PTR2UV(sv), SvNVX(sv));
2638 RESTORE_NUMERIC_LOCAL();
2642 STORE_NUMERIC_LOCAL_SET_STANDARD();
2643 PerlIO_printf(Perl_debug_log, "0x%"UVxf" num(%"NVgf")\n",
2644 PTR2UV(sv), SvNVX(sv));
2645 RESTORE_NUMERIC_LOCAL();
2649 else if (SvTYPE(sv) < SVt_PVNV)
2650 sv_upgrade(sv, SVt_PVNV);
2655 SvNVX(sv) = SvIsUV(sv) ? (NV)SvUVX(sv) : (NV)SvIVX(sv);
2656 #ifdef NV_PRESERVES_UV
2659 /* Only set the public NV OK flag if this NV preserves the IV */
2660 /* Check it's not 0xFFFFFFFFFFFFFFFF */
2661 if (SvIsUV(sv) ? ((SvUVX(sv) != UV_MAX)&&(SvUVX(sv) == U_V(SvNVX(sv))))
2662 : (SvIVX(sv) == I_V(SvNVX(sv))))
2668 else if (SvPOKp(sv) && SvLEN(sv)) {
2670 int numtype = grok_number(SvPVX(sv), SvCUR(sv), &value);
2671 if (ckWARN(WARN_NUMERIC) && !SvIOKp(sv) && !numtype)
2673 #ifdef NV_PRESERVES_UV
2674 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2675 == IS_NUMBER_IN_UV) {
2676 /* It's definitely an integer */
2677 SvNVX(sv) = (numtype & IS_NUMBER_NEG) ? -(NV)value : (NV)value;
2679 SvNVX(sv) = Atof(SvPVX(sv));
2682 SvNVX(sv) = Atof(SvPVX(sv));
2683 /* Only set the public NV OK flag if this NV preserves the value in
2684 the PV at least as well as an IV/UV would.
2685 Not sure how to do this 100% reliably. */
2686 /* if that shift count is out of range then Configure's test is
2687 wonky. We shouldn't be in here with NV_PRESERVES_UV_BITS ==
2689 if (((UV)1 << NV_PRESERVES_UV_BITS) >
2690 U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))) {
2691 SvNOK_on(sv); /* Definitely small enough to preserve all bits */
2692 } else if (!(numtype & IS_NUMBER_IN_UV)) {
2693 /* Can't use strtol etc to convert this string, so don't try.
2694 sv_2iv and sv_2uv will use the NV to convert, not the PV. */
2697 /* value has been set. It may not be precise. */
2698 if ((numtype & IS_NUMBER_NEG) && (value > (UV)IV_MIN)) {
2699 /* 2s complement assumption for (UV)IV_MIN */
2700 SvNOK_on(sv); /* Integer is too negative. */
2705 if (numtype & IS_NUMBER_NEG) {
2706 SvIVX(sv) = -(IV)value;
2707 } else if (value <= (UV)IV_MAX) {
2708 SvIVX(sv) = (IV)value;
2714 if (numtype & IS_NUMBER_NOT_INT) {
2715 /* I believe that even if the original PV had decimals,
2716 they are lost beyond the limit of the FP precision.
2717 However, neither is canonical, so both only get p
2718 flags. NWC, 2000/11/25 */
2719 /* Both already have p flags, so do nothing */
2722 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2723 if (SvIVX(sv) == I_V(nv)) {
2728 /* It had no "." so it must be integer. */
2731 /* between IV_MAX and NV(UV_MAX).
2732 Could be slightly > UV_MAX */
2734 if (numtype & IS_NUMBER_NOT_INT) {
2735 /* UV and NV both imprecise. */
2737 UV nv_as_uv = U_V(nv);
2739 if (value == nv_as_uv && SvUVX(sv) != UV_MAX) {
2750 #endif /* NV_PRESERVES_UV */
2753 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing && !(SvFLAGS(sv) & SVs_PADTMP))
2755 if (SvTYPE(sv) < SVt_NV)
2756 /* Typically the caller expects that sv_any is not NULL now. */
2757 /* XXX Ilya implies that this is a bug in callers that assume this
2758 and ideally should be fixed. */
2759 sv_upgrade(sv, SVt_NV);
2762 #if defined(USE_LONG_DOUBLE)
2764 STORE_NUMERIC_LOCAL_SET_STANDARD();
2765 PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2nv(%" PERL_PRIgldbl ")\n",
2766 PTR2UV(sv), SvNVX(sv));
2767 RESTORE_NUMERIC_LOCAL();
2771 STORE_NUMERIC_LOCAL_SET_STANDARD();
2772 PerlIO_printf(Perl_debug_log, "0x%"UVxf" 1nv(%"NVgf")\n",
2773 PTR2UV(sv), SvNVX(sv));
2774 RESTORE_NUMERIC_LOCAL();
2780 /* asIV(): extract an integer from the string value of an SV.
2781 * Caller must validate PVX */
2784 S_asIV(pTHX_ SV *sv)
2787 int numtype = grok_number(SvPVX(sv), SvCUR(sv), &value);
2789 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2790 == IS_NUMBER_IN_UV) {
2791 /* It's definitely an integer */
2792 if (numtype & IS_NUMBER_NEG) {
2793 if (value < (UV)IV_MIN)
2796 if (value < (UV)IV_MAX)
2801 if (ckWARN(WARN_NUMERIC))
2804 return I_V(Atof(SvPVX(sv)));
2807 /* asUV(): extract an unsigned integer from the string value of an SV
2808 * Caller must validate PVX */
2811 S_asUV(pTHX_ SV *sv)
2814 int numtype = grok_number(SvPVX(sv), SvCUR(sv), &value);
2816 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2817 == IS_NUMBER_IN_UV) {
2818 /* It's definitely an integer */
2819 if (!(numtype & IS_NUMBER_NEG))
2823 if (ckWARN(WARN_NUMERIC))
2826 return U_V(Atof(SvPVX(sv)));
2830 =for apidoc sv_2pv_nolen
2832 Like C<sv_2pv()>, but doesn't return the length too. You should usually
2833 use the macro wrapper C<SvPV_nolen(sv)> instead.
2838 Perl_sv_2pv_nolen(pTHX_ register SV *sv)
2841 return sv_2pv(sv, &n_a);
2844 /* uiv_2buf(): private routine for use by sv_2pv_flags(): print an IV or
2845 * UV as a string towards the end of buf, and return pointers to start and
2848 * We assume that buf is at least TYPE_CHARS(UV) long.
2852 uiv_2buf(char *buf, IV iv, UV uv, int is_uv, char **peob)
2854 char *ptr = buf + TYPE_CHARS(UV);
2868 *--ptr = '0' + (char)(uv % 10);
2877 =for apidoc sv_2pv_flags
2879 Returns a pointer to the string value of an SV, and sets *lp to its length.
2880 If flags includes SV_GMAGIC, does an mg_get() first. Coerces sv to a string
2882 Normally invoked via the C<SvPV_flags> macro. C<sv_2pv()> and C<sv_2pv_nomg>
2883 usually end up here too.
2889 Perl_sv_2pv_flags(pTHX_ register SV *sv, STRLEN *lp, I32 flags)
2894 char tbuf[64]; /* Must fit sprintf/Gconvert of longest IV/NV */
2895 char *tmpbuf = tbuf;
2901 if (SvGMAGICAL(sv)) {
2902 if (flags & SV_GMAGIC)
2910 (void)sprintf(tmpbuf,"%"UVuf, (UV)SvUVX(sv));
2912 (void)sprintf(tmpbuf,"%"IVdf, (IV)SvIVX(sv));
2917 Gconvert(SvNVX(sv), NV_DIG, 0, tmpbuf);
2922 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
2923 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
2930 if (SvTHINKFIRST(sv)) {
2933 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv,string)) &&
2934 (SvTYPE(tmpstr) != SVt_RV || (SvRV(tmpstr) != SvRV(sv)))) {
2935 char *pv = SvPV(tmpstr, *lp);
2948 switch (SvTYPE(sv)) {
2950 if ( ((SvFLAGS(sv) &
2951 (SVs_OBJECT|SVf_OK|SVs_GMG|SVs_SMG|SVs_RMG))
2952 == (SVs_OBJECT|SVs_RMG))
2953 && (mg = mg_find(sv, PERL_MAGIC_qr))) {
2954 regexp *re = (regexp *)mg->mg_obj;
2957 char *fptr = "msix";
2962 char need_newline = 0;
2963 U16 reganch = (U16)((re->reganch & PMf_COMPILETIME) >> 12);
2965 while((ch = *fptr++)) {
2967 reflags[left++] = ch;
2970 reflags[right--] = ch;
2975 reflags[left] = '-';
2979 mg->mg_len = re->prelen + 4 + left;
2981 * If /x was used, we have to worry about a regex
2982 * ending with a comment later being embedded
2983 * within another regex. If so, we don't want this
2984 * regex's "commentization" to leak out to the
2985 * right part of the enclosing regex, we must cap
2986 * it with a newline.
2988 * So, if /x was used, we scan backwards from the
2989 * end of the regex. If we find a '#' before we
2990 * find a newline, we need to add a newline
2991 * ourself. If we find a '\n' first (or if we
2992 * don't find '#' or '\n'), we don't need to add
2993 * anything. -jfriedl
2995 if (PMf_EXTENDED & re->reganch)
2997 char *endptr = re->precomp + re->prelen;
2998 while (endptr >= re->precomp)
3000 char c = *(endptr--);
3002 break; /* don't need another */
3004 /* we end while in a comment, so we
3006 mg->mg_len++; /* save space for it */
3007 need_newline = 1; /* note to add it */
3012 New(616, mg->mg_ptr, mg->mg_len + 1 + left, char);
3013 Copy("(?", mg->mg_ptr, 2, char);
3014 Copy(reflags, mg->mg_ptr+2, left, char);
3015 Copy(":", mg->mg_ptr+left+2, 1, char);
3016 Copy(re->precomp, mg->mg_ptr+3+left, re->prelen, char);
3018 mg->mg_ptr[mg->mg_len - 2] = '\n';
3019 mg->mg_ptr[mg->mg_len - 1] = ')';
3020 mg->mg_ptr[mg->mg_len] = 0;
3022 PL_reginterp_cnt += re->program[0].next_off;
3034 case SVt_PVBM: if (SvROK(sv))
3037 s = "SCALAR"; break;
3038 case SVt_PVLV: s = "LVALUE"; break;
3039 case SVt_PVAV: s = "ARRAY"; break;
3040 case SVt_PVHV: s = "HASH"; break;
3041 case SVt_PVCV: s = "CODE"; break;
3042 case SVt_PVGV: s = "GLOB"; break;
3043 case SVt_PVFM: s = "FORMAT"; break;
3044 case SVt_PVIO: s = "IO"; break;
3045 default: s = "UNKNOWN"; break;
3049 HV *svs = SvSTASH(sv);
3052 /* [20011101.072] This bandaid for C<package;>
3053 should eventually be removed. AMS 20011103 */
3054 (svs ? HvNAME(svs) : "<none>"), s
3059 Perl_sv_catpvf(aTHX_ tsv, "(0x%"UVxf")", PTR2UV(sv));
3065 if (SvREADONLY(sv) && !SvOK(sv)) {
3066 if (ckWARN(WARN_UNINITIALIZED))
3072 if (SvIOK(sv) || ((SvIOKp(sv) && !SvNOKp(sv)))) {
3073 /* I'm assuming that if both IV and NV are equally valid then
3074 converting the IV is going to be more efficient */
3075 U32 isIOK = SvIOK(sv);
3076 U32 isUIOK = SvIsUV(sv);
3077 char buf[TYPE_CHARS(UV)];
3080 if (SvTYPE(sv) < SVt_PVIV)
3081 sv_upgrade(sv, SVt_PVIV);
3083 ptr = uiv_2buf(buf, 0, SvUVX(sv), 1, &ebuf);
3085 ptr = uiv_2buf(buf, SvIVX(sv), 0, 0, &ebuf);
3086 SvGROW(sv, (STRLEN)(ebuf - ptr + 1)); /* inlined from sv_setpvn */
3087 Move(ptr,SvPVX(sv),ebuf - ptr,char);
3088 SvCUR_set(sv, ebuf - ptr);
3098 else if (SvNOKp(sv)) {
3099 if (SvTYPE(sv) < SVt_PVNV)
3100 sv_upgrade(sv, SVt_PVNV);
3101 /* The +20 is pure guesswork. Configure test needed. --jhi */
3102 SvGROW(sv, NV_DIG + 20);
3104 olderrno = errno; /* some Xenix systems wipe out errno here */
3106 if (SvNVX(sv) == 0.0)
3107 (void)strcpy(s,"0");
3111 Gconvert(SvNVX(sv), NV_DIG, 0, s);
3114 #ifdef FIXNEGATIVEZERO
3115 if (*s == '-' && s[1] == '0' && !s[2])
3125 if (ckWARN(WARN_UNINITIALIZED)
3126 && !PL_localizing && !(SvFLAGS(sv) & SVs_PADTMP))
3129 if (SvTYPE(sv) < SVt_PV)
3130 /* Typically the caller expects that sv_any is not NULL now. */
3131 sv_upgrade(sv, SVt_PV);
3134 *lp = s - SvPVX(sv);
3137 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2pv(%s)\n",
3138 PTR2UV(sv),SvPVX(sv)));
3142 if (SvROK(sv)) { /* XXX Skip this when sv_pvn_force calls */
3143 /* Sneaky stuff here */
3147 tsv = newSVpv(tmpbuf, 0);
3163 len = strlen(tmpbuf);
3165 #ifdef FIXNEGATIVEZERO
3166 if (len == 2 && t[0] == '-' && t[1] == '0') {
3171 (void)SvUPGRADE(sv, SVt_PV);
3173 s = SvGROW(sv, len + 1);
3182 =for apidoc sv_copypv
3184 Copies a stringified representation of the source SV into the
3185 destination SV. Automatically performs any necessary mg_get and
3186 coercion of numeric values into strings. Guaranteed to preserve
3187 UTF-8 flag even from overloaded objects. Similar in nature to
3188 sv_2pv[_flags] but operates directly on an SV instead of just the
3189 string. Mostly uses sv_2pv_flags to do its work, except when that
3190 would lose the UTF-8'ness of the PV.
3196 Perl_sv_copypv(pTHX_ SV *dsv, register SV *ssv)
3198 SV *tmpsv = sv_newmortal();
3202 sv_setpvn(tmpsv,s,len);
3211 =for apidoc sv_2pvbyte_nolen
3213 Return a pointer to the byte-encoded representation of the SV.
3214 May cause the SV to be downgraded from UTF8 as a side-effect.
3216 Usually accessed via the C<SvPVbyte_nolen> macro.
3222 Perl_sv_2pvbyte_nolen(pTHX_ register SV *sv)
3225 return sv_2pvbyte(sv, &n_a);
3229 =for apidoc sv_2pvbyte
3231 Return a pointer to the byte-encoded representation of the SV, and set *lp
3232 to its length. May cause the SV to be downgraded from UTF8 as a
3235 Usually accessed via the C<SvPVbyte> macro.
3241 Perl_sv_2pvbyte(pTHX_ register SV *sv, STRLEN *lp)
3243 sv_utf8_downgrade(sv,0);
3244 return SvPV(sv,*lp);
3248 =for apidoc sv_2pvutf8_nolen
3250 Return a pointer to the UTF8-encoded representation of the SV.
3251 May cause the SV to be upgraded to UTF8 as a side-effect.
3253 Usually accessed via the C<SvPVutf8_nolen> macro.
3259 Perl_sv_2pvutf8_nolen(pTHX_ register SV *sv)
3262 return sv_2pvutf8(sv, &n_a);
3266 =for apidoc sv_2pvutf8
3268 Return a pointer to the UTF8-encoded representation of the SV, and set *lp
3269 to its length. May cause the SV to be upgraded to UTF8 as a side-effect.
3271 Usually accessed via the C<SvPVutf8> macro.
3277 Perl_sv_2pvutf8(pTHX_ register SV *sv, STRLEN *lp)
3279 sv_utf8_upgrade(sv);
3280 return SvPV(sv,*lp);
3284 =for apidoc sv_2bool
3286 This function is only called on magical items, and is only used by
3287 sv_true() or its macro equivalent.
3293 Perl_sv_2bool(pTHX_ register SV *sv)
3302 if (SvAMAGIC(sv) && (tmpsv=AMG_CALLun(sv,bool_)) &&
3303 (!SvROK(tmpsv) || (SvRV(tmpsv) != SvRV(sv))))
3304 return (bool)SvTRUE(tmpsv);
3305 return SvRV(sv) != 0;
3308 register XPV* Xpvtmp;
3309 if ((Xpvtmp = (XPV*)SvANY(sv)) &&
3310 (*Xpvtmp->xpv_pv > '0' ||
3311 Xpvtmp->xpv_cur > 1 ||
3312 (Xpvtmp->xpv_cur && *Xpvtmp->xpv_pv != '0')))
3319 return SvIVX(sv) != 0;
3322 return SvNVX(sv) != 0.0;
3330 =for apidoc sv_utf8_upgrade
3332 Convert the PV of an SV to its UTF8-encoded form.
3333 Forces the SV to string form if it is not already.
3334 Always sets the SvUTF8 flag to avoid future validity checks even
3335 if all the bytes have hibit clear.
3337 This is not as a general purpose byte encoding to Unicode interface:
3338 use the Encode extension for that.
3340 =for apidoc sv_utf8_upgrade_flags
3342 Convert the PV of an SV to its UTF8-encoded form.
3343 Forces the SV to string form if it is not already.
3344 Always sets the SvUTF8 flag to avoid future validity checks even
3345 if all the bytes have hibit clear. If C<flags> has C<SV_GMAGIC> bit set,
3346 will C<mg_get> on C<sv> if appropriate, else not. C<sv_utf8_upgrade> and
3347 C<sv_utf8_upgrade_nomg> are implemented in terms of this function.
3349 This is not as a general purpose byte encoding to Unicode interface:
3350 use the Encode extension for that.
3356 Perl_sv_utf8_upgrade_flags(pTHX_ register SV *sv, I32 flags)
3366 (void) sv_2pv_flags(sv,&len, flags);
3375 sv_force_normal_flags(sv, 0);
3379 sv_recode_to_utf8(sv, PL_encoding);
3380 else { /* Assume Latin-1/EBCDIC */
3381 /* This function could be much more efficient if we
3382 * had a FLAG in SVs to signal if there are any hibit
3383 * chars in the PV. Given that there isn't such a flag
3384 * make the loop as fast as possible. */
3385 s = (U8 *) SvPVX(sv);
3386 e = (U8 *) SvEND(sv);
3390 if ((hibit = !NATIVE_IS_INVARIANT(ch)))
3396 len = SvCUR(sv) + 1; /* Plus the \0 */
3397 SvPVX(sv) = (char*)bytes_to_utf8((U8*)s, &len);
3398 SvCUR(sv) = len - 1;
3400 Safefree(s); /* No longer using what was there before. */
3401 SvLEN(sv) = len; /* No longer know the real size. */
3403 /* Mark as UTF-8 even if no hibit - saves scanning loop */
3410 =for apidoc sv_utf8_downgrade
3412 Attempt to convert the PV of an SV from UTF8-encoded to byte encoding.
3413 This may not be possible if the PV contains non-byte encoding characters;
3414 if this is the case, either returns false or, if C<fail_ok> is not
3417 This is not as a general purpose Unicode to byte encoding interface:
3418 use the Encode extension for that.
3424 Perl_sv_utf8_downgrade(pTHX_ register SV* sv, bool fail_ok)
3426 if (SvPOK(sv) && SvUTF8(sv)) {
3432 sv_force_normal_flags(sv, 0);
3434 s = (U8 *) SvPV(sv, len);
3435 if (!utf8_to_bytes(s, &len)) {
3440 Perl_croak(aTHX_ "Wide character in %s",
3443 Perl_croak(aTHX_ "Wide character");
3454 =for apidoc sv_utf8_encode
3456 Convert the PV of an SV to UTF8-encoded, but then turn off the C<SvUTF8>
3457 flag so that it looks like octets again. Used as a building block
3458 for encode_utf8 in Encode.xs
3464 Perl_sv_utf8_encode(pTHX_ register SV *sv)
3466 (void) sv_utf8_upgrade(sv);
3471 =for apidoc sv_utf8_decode
3473 Convert the octets in the PV from UTF-8 to chars. Scan for validity and then
3474 turn off SvUTF8 if needed so that we see characters. Used as a building block
3475 for decode_utf8 in Encode.xs
3481 Perl_sv_utf8_decode(pTHX_ register SV *sv)
3487 /* The octets may have got themselves encoded - get them back as
3490 if (!sv_utf8_downgrade(sv, TRUE))
3493 /* it is actually just a matter of turning the utf8 flag on, but
3494 * we want to make sure everything inside is valid utf8 first.
3496 c = (U8 *) SvPVX(sv);
3497 if (!is_utf8_string(c, SvCUR(sv)+1))
3499 e = (U8 *) SvEND(sv);
3502 if (!UTF8_IS_INVARIANT(ch)) {
3512 =for apidoc sv_setsv
3514 Copies the contents of the source SV C<ssv> into the destination SV
3515 C<dsv>. The source SV may be destroyed if it is mortal, so don't use this
3516 function if the source SV needs to be reused. Does not handle 'set' magic.
3517 Loosely speaking, it performs a copy-by-value, obliterating any previous
3518 content of the destination.
3520 You probably want to use one of the assortment of wrappers, such as
3521 C<SvSetSV>, C<SvSetSV_nosteal>, C<SvSetMagicSV> and
3522 C<SvSetMagicSV_nosteal>.
3524 =for apidoc sv_setsv_flags
3526 Copies the contents of the source SV C<ssv> into the destination SV
3527 C<dsv>. The source SV may be destroyed if it is mortal, so don't use this
3528 function if the source SV needs to be reused. Does not handle 'set' magic.
3529 Loosely speaking, it performs a copy-by-value, obliterating any previous
3530 content of the destination.
3531 If the C<flags> parameter has the C<SV_GMAGIC> bit set, will C<mg_get> on
3532 C<ssv> if appropriate, else not. C<sv_setsv> and C<sv_setsv_nomg> are
3533 implemented in terms of this function.
3535 You probably want to use one of the assortment of wrappers, such as
3536 C<SvSetSV>, C<SvSetSV_nosteal>, C<SvSetMagicSV> and
3537 C<SvSetMagicSV_nosteal>.
3539 This is the primary function for copying scalars, and most other
3540 copy-ish functions and macros use this underneath.
3546 Perl_sv_setsv_flags(pTHX_ SV *dstr, register SV *sstr, I32 flags)
3548 register U32 sflags;
3554 SV_CHECK_THINKFIRST_COW_DROP(dstr);
3556 sstr = &PL_sv_undef;
3557 stype = SvTYPE(sstr);
3558 dtype = SvTYPE(dstr);
3562 /* There's a lot of redundancy below but we're going for speed here */
3567 if (dtype != SVt_PVGV) {
3568 (void)SvOK_off(dstr);
3576 sv_upgrade(dstr, SVt_IV);
3579 sv_upgrade(dstr, SVt_PVNV);
3583 sv_upgrade(dstr, SVt_PVIV);
3586 (void)SvIOK_only(dstr);
3587 SvIVX(dstr) = SvIVX(sstr);
3590 if (SvTAINTED(sstr))
3601 sv_upgrade(dstr, SVt_NV);
3606 sv_upgrade(dstr, SVt_PVNV);
3609 SvNVX(dstr) = SvNVX(sstr);
3610 (void)SvNOK_only(dstr);
3611 if (SvTAINTED(sstr))
3619 sv_upgrade(dstr, SVt_RV);
3620 else if (dtype == SVt_PVGV &&
3621 SvTYPE(SvRV(sstr)) == SVt_PVGV) {
3624 if (GvIMPORTED(dstr) != GVf_IMPORTED
3625 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3627 GvIMPORTED_on(dstr);
3638 sv_upgrade(dstr, SVt_PV);
3641 if (dtype < SVt_PVIV)
3642 sv_upgrade(dstr, SVt_PVIV);
3645 if (dtype < SVt_PVNV)
3646 sv_upgrade(dstr, SVt_PVNV);
3653 Perl_croak(aTHX_ "Bizarre copy of %s in %s", sv_reftype(sstr, 0),
3656 Perl_croak(aTHX_ "Bizarre copy of %s", sv_reftype(sstr, 0));
3660 if (dtype <= SVt_PVGV) {
3662 if (dtype != SVt_PVGV) {
3663 char *name = GvNAME(sstr);
3664 STRLEN len = GvNAMELEN(sstr);
3665 sv_upgrade(dstr, SVt_PVGV);
3666 sv_magic(dstr, dstr, PERL_MAGIC_glob, Nullch, 0);
3667 GvSTASH(dstr) = (HV*)SvREFCNT_inc(GvSTASH(sstr));
3668 GvNAME(dstr) = savepvn(name, len);
3669 GvNAMELEN(dstr) = len;
3670 SvFAKE_on(dstr); /* can coerce to non-glob */
3672 /* ahem, death to those who redefine active sort subs */
3673 else if (PL_curstackinfo->si_type == PERLSI_SORT
3674 && GvCV(dstr) && PL_sortcop == CvSTART(GvCV(dstr)))
3675 Perl_croak(aTHX_ "Can't redefine active sort subroutine %s",
3678 #ifdef GV_UNIQUE_CHECK
3679 if (GvUNIQUE((GV*)dstr)) {
3680 Perl_croak(aTHX_ PL_no_modify);
3684 (void)SvOK_off(dstr);
3685 GvINTRO_off(dstr); /* one-shot flag */
3687 GvGP(dstr) = gp_ref(GvGP(sstr));
3688 if (SvTAINTED(sstr))
3690 if (GvIMPORTED(dstr) != GVf_IMPORTED
3691 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3693 GvIMPORTED_on(dstr);
3701 if (SvGMAGICAL(sstr) && (flags & SV_GMAGIC)) {
3703 if ((int)SvTYPE(sstr) != stype) {
3704 stype = SvTYPE(sstr);
3705 if (stype == SVt_PVGV && dtype <= SVt_PVGV)
3709 if (stype == SVt_PVLV)
3710 (void)SvUPGRADE(dstr, SVt_PVNV);
3712 (void)SvUPGRADE(dstr, (U32)stype);
3715 sflags = SvFLAGS(sstr);
3717 if (sflags & SVf_ROK) {
3718 if (dtype >= SVt_PV) {
3719 if (dtype == SVt_PVGV) {
3720 SV *sref = SvREFCNT_inc(SvRV(sstr));
3722 int intro = GvINTRO(dstr);
3724 #ifdef GV_UNIQUE_CHECK
3725 if (GvUNIQUE((GV*)dstr)) {
3726 Perl_croak(aTHX_ PL_no_modify);
3731 GvINTRO_off(dstr); /* one-shot flag */
3732 GvLINE(dstr) = CopLINE(PL_curcop);
3733 GvEGV(dstr) = (GV*)dstr;
3736 switch (SvTYPE(sref)) {
3739 SAVESPTR(GvAV(dstr));
3741 dref = (SV*)GvAV(dstr);
3742 GvAV(dstr) = (AV*)sref;
3743 if (!GvIMPORTED_AV(dstr)
3744 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3746 GvIMPORTED_AV_on(dstr);
3751 SAVESPTR(GvHV(dstr));
3753 dref = (SV*)GvHV(dstr);
3754 GvHV(dstr) = (HV*)sref;
3755 if (!GvIMPORTED_HV(dstr)
3756 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3758 GvIMPORTED_HV_on(dstr);
3763 if (GvCVGEN(dstr) && GvCV(dstr) != (CV*)sref) {
3764 SvREFCNT_dec(GvCV(dstr));
3765 GvCV(dstr) = Nullcv;
3766 GvCVGEN(dstr) = 0; /* Switch off cacheness. */
3767 PL_sub_generation++;
3769 SAVESPTR(GvCV(dstr));
3772 dref = (SV*)GvCV(dstr);
3773 if (GvCV(dstr) != (CV*)sref) {
3774 CV* cv = GvCV(dstr);
3776 if (!GvCVGEN((GV*)dstr) &&
3777 (CvROOT(cv) || CvXSUB(cv)))
3779 /* ahem, death to those who redefine
3780 * active sort subs */
3781 if (PL_curstackinfo->si_type == PERLSI_SORT &&
3782 PL_sortcop == CvSTART(cv))
3784 "Can't redefine active sort subroutine %s",
3785 GvENAME((GV*)dstr));
3786 /* Redefining a sub - warning is mandatory if
3787 it was a const and its value changed. */
3788 if (ckWARN(WARN_REDEFINE)
3790 && (!CvCONST((CV*)sref)
3791 || sv_cmp(cv_const_sv(cv),
3792 cv_const_sv((CV*)sref)))))
3794 Perl_warner(aTHX_ packWARN(WARN_REDEFINE),
3796 ? "Constant subroutine %s::%s redefined"
3797 : "Subroutine %s::%s redefined",
3798 HvNAME(GvSTASH((GV*)dstr)),
3799 GvENAME((GV*)dstr));
3803 cv_ckproto(cv, (GV*)dstr,
3804 SvPOK(sref) ? SvPVX(sref) : Nullch);
3806 GvCV(dstr) = (CV*)sref;
3807 GvCVGEN(dstr) = 0; /* Switch off cacheness. */
3808 GvASSUMECV_on(dstr);
3809 PL_sub_generation++;
3811 if (!GvIMPORTED_CV(dstr)
3812 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3814 GvIMPORTED_CV_on(dstr);
3819 SAVESPTR(GvIOp(dstr));
3821 dref = (SV*)GvIOp(dstr);
3822 GvIOp(dstr) = (IO*)sref;
3826 SAVESPTR(GvFORM(dstr));
3828 dref = (SV*)GvFORM(dstr);
3829 GvFORM(dstr) = (CV*)sref;
3833 SAVESPTR(GvSV(dstr));
3835 dref = (SV*)GvSV(dstr);
3837 if (!GvIMPORTED_SV(dstr)
3838 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3840 GvIMPORTED_SV_on(dstr);
3848 if (SvTAINTED(sstr))
3853 (void)SvOOK_off(dstr); /* backoff */
3855 Safefree(SvPVX(dstr));
3856 SvLEN(dstr)=SvCUR(dstr)=0;
3859 (void)SvOK_off(dstr);
3860 SvRV(dstr) = SvREFCNT_inc(SvRV(sstr));
3862 if (sflags & SVp_NOK) {
3864 /* Only set the public OK flag if the source has public OK. */
3865 if (sflags & SVf_NOK)
3866 SvFLAGS(dstr) |= SVf_NOK;
3867 SvNVX(dstr) = SvNVX(sstr);
3869 if (sflags & SVp_IOK) {
3870 (void)SvIOKp_on(dstr);
3871 if (sflags & SVf_IOK)
3872 SvFLAGS(dstr) |= SVf_IOK;
3873 if (sflags & SVf_IVisUV)
3875 SvIVX(dstr) = SvIVX(sstr);
3877 if (SvAMAGIC(sstr)) {
3881 else if (sflags & SVp_POK) {
3885 * Check to see if we can just swipe the string. If so, it's a
3886 * possible small lose on short strings, but a big win on long ones.
3887 * It might even be a win on short strings if SvPVX(dstr)
3888 * has to be allocated and SvPVX(sstr) has to be freed.
3892 #ifdef PERL_COPY_ON_WRITE
3893 (sflags & (SVf_FAKE | SVf_READONLY)) != (SVf_FAKE | SVf_READONLY)
3897 (sflags & SVs_TEMP) && /* slated for free anyway? */
3898 !(sflags & SVf_OOK) && /* and not involved in OOK hack? */
3899 SvREFCNT(sstr) == 1 && /* and no other references to it? */
3900 SvLEN(sstr) && /* and really is a string */
3901 /* and won't be needed again, potentially */
3902 !(PL_op && PL_op->op_type == OP_AASSIGN))
3903 #ifdef PERL_COPY_ON_WRITE
3904 && !((sflags & CAN_COW_MASK) == CAN_COW_FLAGS
3905 && SvTYPE(sstr) >= SVt_PVIV)
3908 /* Failed the swipe test, and it's not a shared hash key either.
3909 Have to copy the string. */
3910 STRLEN len = SvCUR(sstr);
3911 SvGROW(dstr, len + 1); /* inlined from sv_setpvn */
3912 Move(SvPVX(sstr),SvPVX(dstr),len,char);
3913 SvCUR_set(dstr, len);
3914 *SvEND(dstr) = '\0';
3915 (void)SvPOK_only(dstr);
3917 /* If PERL_COPY_ON_WRITE is not defined, then isSwipe will always
3919 #ifdef PERL_COPY_ON_WRITE
3920 /* Either it's a shared hash key, or it's suitable for
3921 copy-on-write or we can swipe the string. */
3923 PerlIO_printf(Perl_debug_log,
3924 "Copy on write: sstr --> dstr\n");
3929 /* I believe I should acquire a global SV mutex if
3930 it's a COW sv (not a shared hash key) to stop
3931 it going un copy-on-write.
3932 If the source SV has gone un copy on write between up there
3933 and down here, then (assert() that) it is of the correct
3934 form to make it copy on write again */
3935 if ((sflags & (SVf_FAKE | SVf_READONLY))
3936 != (SVf_FAKE | SVf_READONLY)) {
3937 SvREADONLY_on(sstr);
3939 /* Make the source SV into a loop of 1.
3940 (about to become 2) */
3941 SV_COW_NEXT_SV_SET(sstr, sstr);
3945 /* Initial code is common. */
3946 if (SvPVX(dstr)) { /* we know that dtype >= SVt_PV */
3948 SvFLAGS(dstr) &= ~SVf_OOK;
3949 Safefree(SvPVX(dstr) - SvIVX(dstr));
3951 else if (SvLEN(dstr))
3952 Safefree(SvPVX(dstr));
3954 (void)SvPOK_only(dstr);
3956 #ifdef PERL_COPY_ON_WRITE
3958 /* making another shared SV. */
3959 STRLEN cur = SvCUR(sstr);
3960 STRLEN len = SvLEN(sstr);
3962 /* SvIsCOW_normal */
3963 /* splice us in between source and next-after-source. */
3964 SV_COW_NEXT_SV_SET(dstr, SV_COW_NEXT_SV(sstr));
3965 SV_COW_NEXT_SV_SET(sstr, dstr);
3966 SvPV_set(dstr, SvPVX(sstr));
3968 /* SvIsCOW_shared_hash */
3969 UV hash = SvUVX(sstr);
3970 DEBUG_C(PerlIO_printf(Perl_debug_log,
3971 "Copy on write: Sharing hash\n"));
3973 sharepvn(SvPVX(sstr),
3974 (sflags & SVf_UTF8?-cur:cur), hash));
3979 SvREADONLY_on(dstr);
3981 /* Relesase a global SV mutex. */
3985 { /* Passes the swipe test. */
3986 SvPV_set(dstr, SvPVX(sstr));
3987 SvLEN_set(dstr, SvLEN(sstr));
3988 SvCUR_set(dstr, SvCUR(sstr));
3991 (void)SvOK_off(sstr); /* NOTE: nukes most SvFLAGS on sstr */
3992 SvPV_set(sstr, Nullch);
3998 if (sflags & SVf_UTF8)
4001 if (sflags & SVp_NOK) {
4003 if (sflags & SVf_NOK)
4004 SvFLAGS(dstr) |= SVf_NOK;
4005 SvNVX(dstr) = SvNVX(sstr);
4007 if (sflags & SVp_IOK) {
4008 (void)SvIOKp_on(dstr);
4009 if (sflags & SVf_IOK)
4010 SvFLAGS(dstr) |= SVf_IOK;
4011 if (sflags & SVf_IVisUV)
4013 SvIVX(dstr) = SvIVX(sstr);
4016 MAGIC *mg = SvMAGIC(sstr);
4017 sv_magicext(dstr, NULL, PERL_MAGIC_vstring, NULL,
4018 mg->mg_ptr, mg->mg_len);
4019 SvRMAGICAL_on(dstr);
4022 else if (sflags & SVp_IOK) {
4023 if (sflags & SVf_IOK)
4024 (void)SvIOK_only(dstr);
4026 (void)SvOK_off(dstr);
4027 (void)SvIOKp_on(dstr);
4029 /* XXXX Do we want to set IsUV for IV(ROK)? Be extra safe... */
4030 if (sflags & SVf_IVisUV)
4032 SvIVX(dstr) = SvIVX(sstr);
4033 if (sflags & SVp_NOK) {
4034 if (sflags & SVf_NOK)
4035 (void)SvNOK_on(dstr);
4037 (void)SvNOKp_on(dstr);
4038 SvNVX(dstr) = SvNVX(sstr);
4041 else if (sflags & SVp_NOK) {
4042 if (sflags & SVf_NOK)
4043 (void)SvNOK_only(dstr);
4045 (void)SvOK_off(dstr);
4048 SvNVX(dstr) = SvNVX(sstr);
4051 if (dtype == SVt_PVGV) {
4052 if (ckWARN(WARN_MISC))
4053 Perl_warner(aTHX_ packWARN(WARN_MISC), "Undefined value assigned to typeglob");
4056 (void)SvOK_off(dstr);
4058 if (SvTAINTED(sstr))
4063 =for apidoc sv_setsv_mg
4065 Like C<sv_setsv>, but also handles 'set' magic.
4071 Perl_sv_setsv_mg(pTHX_ SV *dstr, register SV *sstr)
4073 sv_setsv(dstr,sstr);
4078 =for apidoc sv_setpvn
4080 Copies a string into an SV. The C<len> parameter indicates the number of
4081 bytes to be copied. Does not handle 'set' magic. See C<sv_setpvn_mg>.
4087 Perl_sv_setpvn(pTHX_ register SV *sv, register const char *ptr, register STRLEN len)
4089 register char *dptr;
4091 SV_CHECK_THINKFIRST_COW_DROP(sv);
4097 /* len is STRLEN which is unsigned, need to copy to signed */
4100 Perl_croak(aTHX_ "panic: sv_setpvn called with negative strlen");
4102 (void)SvUPGRADE(sv, SVt_PV);
4104 SvGROW(sv, len + 1);
4106 Move(ptr,dptr,len,char);
4109 (void)SvPOK_only_UTF8(sv); /* validate pointer */
4114 =for apidoc sv_setpvn_mg
4116 Like C<sv_setpvn>, but also handles 'set' magic.
4122 Perl_sv_setpvn_mg(pTHX_ register SV *sv, register const char *ptr, register STRLEN len)
4124 sv_setpvn(sv,ptr,len);
4129 =for apidoc sv_setpv
4131 Copies a string into an SV. The string must be null-terminated. Does not
4132 handle 'set' magic. See C<sv_setpv_mg>.
4138 Perl_sv_setpv(pTHX_ register SV *sv, register const char *ptr)
4140 register STRLEN len;
4142 SV_CHECK_THINKFIRST_COW_DROP(sv);
4148 (void)SvUPGRADE(sv, SVt_PV);
4150 SvGROW(sv, len + 1);
4151 Move(ptr,SvPVX(sv),len+1,char);
4153 (void)SvPOK_only_UTF8(sv); /* validate pointer */
4158 =for apidoc sv_setpv_mg
4160 Like C<sv_setpv>, but also handles 'set' magic.
4166 Perl_sv_setpv_mg(pTHX_ register SV *sv, register const char *ptr)
4173 =for apidoc sv_usepvn
4175 Tells an SV to use C<ptr> to find its string value. Normally the string is
4176 stored inside the SV but sv_usepvn allows the SV to use an outside string.
4177 The C<ptr> should point to memory that was allocated by C<malloc>. The
4178 string length, C<len>, must be supplied. This function will realloc the
4179 memory pointed to by C<ptr>, so that pointer should not be freed or used by
4180 the programmer after giving it to sv_usepvn. Does not handle 'set' magic.
4181 See C<sv_usepvn_mg>.
4187 Perl_sv_usepvn(pTHX_ register SV *sv, register char *ptr, register STRLEN len)
4189 SV_CHECK_THINKFIRST_COW_DROP(sv);
4190 (void)SvUPGRADE(sv, SVt_PV);
4195 (void)SvOOK_off(sv);
4196 if (SvPVX(sv) && SvLEN(sv))
4197 Safefree(SvPVX(sv));
4198 Renew(ptr, len+1, char);
4201 SvLEN_set(sv, len+1);
4203 (void)SvPOK_only_UTF8(sv); /* validate pointer */
4208 =for apidoc sv_usepvn_mg
4210 Like C<sv_usepvn>, but also handles 'set' magic.
4216 Perl_sv_usepvn_mg(pTHX_ register SV *sv, register char *ptr, register STRLEN len)
4218 sv_usepvn(sv,ptr,len);
4222 #ifdef PERL_COPY_ON_WRITE
4223 /* Need to do this *after* making the SV normal, as we need the buffer
4224 pointer to remain valid until after we've copied it. If we let go too early,
4225 another thread could invalidate it by unsharing last of the same hash key
4226 (which it can do by means other than releasing copy-on-write Svs)
4227 or by changing the other copy-on-write SVs in the loop. */
4229 S_sv_release_COW(pTHX_ register SV *sv, char *pvx, STRLEN cur, STRLEN len,
4230 U32 hash, SV *after)
4232 if (len) { /* this SV was SvIsCOW_normal(sv) */
4233 /* we need to find the SV pointing to us. */
4234 SV *current = SV_COW_NEXT_SV(after);
4236 if (current == sv) {
4237 /* The SV we point to points back to us (there were only two of us
4239 Hence other SV is no longer copy on write either. */
4241 SvREADONLY_off(after);
4243 /* We need to follow the pointers around the loop. */
4245 while ((next = SV_COW_NEXT_SV(current)) != sv) {
4248 /* don't loop forever if the structure is bust, and we have
4249 a pointer into a closed loop. */
4250 assert (current != after);
4251 assert (SvPVX(current) == pvx);
4253 /* Make the SV before us point to the SV after us. */
4254 SV_COW_NEXT_SV_SET(current, after);
4257 unsharepvn(pvx, SvUTF8(sv) ? -(I32)cur : cur, hash);
4262 Perl_sv_release_IVX(pTHX_ register SV *sv)
4265 sv_force_normal_flags(sv, 0);
4266 return SvOOK_off(sv);
4270 =for apidoc sv_force_normal_flags
4272 Undo various types of fakery on an SV: if the PV is a shared string, make
4273 a private copy; if we're a ref, stop refing; if we're a glob, downgrade to
4274 an xpvmg; if we're a copy-on-write scalar, this is the on-write time when
4275 we do the copy, and is also used locally. If C<SV_COW_DROP_PV> is set
4276 then a copy-on-write scalar drops its PV buffer (if any) and becomes
4277 SvPOK_off rather than making a copy. (Used where this scalar is about to be
4278 set to some other value. In addtion, the C<flags> parameter gets passed to
4279 C<sv_unref_flags()> when unrefing. C<sv_force_normal> calls this function
4280 with flags set to 0.
4286 Perl_sv_force_normal_flags(pTHX_ register SV *sv, U32 flags)
4288 #ifdef PERL_COPY_ON_WRITE
4289 if (SvREADONLY(sv)) {
4290 /* At this point I believe I should acquire a global SV mutex. */
4292 char *pvx = SvPVX(sv);
4293 STRLEN len = SvLEN(sv);
4294 STRLEN cur = SvCUR(sv);
4295 U32 hash = SvUVX(sv);
4296 SV *next = SV_COW_NEXT_SV(sv); /* next COW sv in the loop. */
4298 PerlIO_printf(Perl_debug_log,
4299 "Copy on write: Force normal %ld\n",
4305 /* This SV doesn't own the buffer, so need to New() a new one: */
4308 if (flags & SV_COW_DROP_PV) {
4309 /* OK, so we don't need to copy our buffer. */
4312 SvGROW(sv, cur + 1);
4313 Move(pvx,SvPVX(sv),cur,char);
4317 sv_release_COW(sv, pvx, cur, len, hash, next);
4322 else if (PL_curcop != &PL_compiling)
4323 Perl_croak(aTHX_ PL_no_modify);
4324 /* At this point I believe that I can drop the global SV mutex. */
4327 if (SvREADONLY(sv)) {
4329 char *pvx = SvPVX(sv);
4330 STRLEN len = SvCUR(sv);
4331 U32 hash = SvUVX(sv);
4332 SvGROW(sv, len + 1);
4333 Move(pvx,SvPVX(sv),len,char);
4337 unsharepvn(pvx, SvUTF8(sv) ? -(I32)len : len, hash);
4339 else if (PL_curcop != &PL_compiling)
4340 Perl_croak(aTHX_ PL_no_modify);
4344 sv_unref_flags(sv, flags);
4345 else if (SvFAKE(sv) && SvTYPE(sv) == SVt_PVGV)
4350 =for apidoc sv_force_normal
4352 Undo various types of fakery on an SV: if the PV is a shared string, make
4353 a private copy; if we're a ref, stop refing; if we're a glob, downgrade to
4354 an xpvmg. See also C<sv_force_normal_flags>.
4360 Perl_sv_force_normal(pTHX_ register SV *sv)
4362 sv_force_normal_flags(sv, 0);
4368 Efficient removal of characters from the beginning of the string buffer.
4369 SvPOK(sv) must be true and the C<ptr> must be a pointer to somewhere inside
4370 the string buffer. The C<ptr> becomes the first character of the adjusted
4371 string. Uses the "OOK hack".
4377 Perl_sv_chop(pTHX_ register SV *sv, register char *ptr)
4379 register STRLEN delta;
4381 if (!ptr || !SvPOKp(sv))
4383 SV_CHECK_THINKFIRST(sv);
4384 if (SvTYPE(sv) < SVt_PVIV)
4385 sv_upgrade(sv,SVt_PVIV);
4388 if (!SvLEN(sv)) { /* make copy of shared string */
4389 char *pvx = SvPVX(sv);
4390 STRLEN len = SvCUR(sv);
4391 SvGROW(sv, len + 1);
4392 Move(pvx,SvPVX(sv),len,char);
4396 SvFLAGS(sv) |= SVf_OOK;
4398 SvFLAGS(sv) &= ~(SVf_IOK|SVf_NOK|SVp_IOK|SVp_NOK|SVf_IVisUV);
4399 delta = ptr - SvPVX(sv);
4407 =for apidoc sv_catpvn
4409 Concatenates the string onto the end of the string which is in the SV. The
4410 C<len> indicates number of bytes to copy. If the SV has the UTF8
4411 status set, then the bytes appended should be valid UTF8.
4412 Handles 'get' magic, but not 'set' magic. See C<sv_catpvn_mg>.
4414 =for apidoc sv_catpvn_flags
4416 Concatenates the string onto the end of the string which is in the SV. The
4417 C<len> indicates number of bytes to copy. If the SV has the UTF8
4418 status set, then the bytes appended should be valid UTF8.
4419 If C<flags> has C<SV_GMAGIC> bit set, will C<mg_get> on C<dsv> if
4420 appropriate, else not. C<sv_catpvn> and C<sv_catpvn_nomg> are implemented
4421 in terms of this function.
4427 Perl_sv_catpvn_flags(pTHX_ register SV *dsv, register const char *sstr, register STRLEN slen, I32 flags)
4432 dstr = SvPV_force_flags(dsv, dlen, flags);
4433 SvGROW(dsv, dlen + slen + 1);
4436 Move(sstr, SvPVX(dsv) + dlen, slen, char);
4439 (void)SvPOK_only_UTF8(dsv); /* validate pointer */
4444 =for apidoc sv_catpvn_mg
4446 Like C<sv_catpvn>, but also handles 'set' magic.
4452 Perl_sv_catpvn_mg(pTHX_ register SV *sv, register const char *ptr, register STRLEN len)
4454 sv_catpvn(sv,ptr,len);
4459 =for apidoc sv_catsv
4461 Concatenates the string from SV C<ssv> onto the end of the string in
4462 SV C<dsv>. Modifies C<dsv> but not C<ssv>. Handles 'get' magic, but
4463 not 'set' magic. See C<sv_catsv_mg>.
4465 =for apidoc sv_catsv_flags
4467 Concatenates the string from SV C<ssv> onto the end of the string in
4468 SV C<dsv>. Modifies C<dsv> but not C<ssv>. If C<flags> has C<SV_GMAGIC>
4469 bit set, will C<mg_get> on the SVs if appropriate, else not. C<sv_catsv>
4470 and C<sv_catsv_nomg> are implemented in terms of this function.
4475 Perl_sv_catsv_flags(pTHX_ SV *dsv, register SV *ssv, I32 flags)
4481 if ((spv = SvPV(ssv, slen))) {
4482 /* sutf8 and dutf8 were type bool, but under USE_ITHREADS,
4483 gcc version 2.95.2 20000220 (Debian GNU/Linux) for
4484 Linux xxx 2.2.17 on sparc64 with gcc -O2, we erroneously
4485 get dutf8 = 0x20000000, (i.e. SVf_UTF8) even though
4486 dsv->sv_flags doesn't have that bit set.
4487 Andy Dougherty 12 Oct 2001
4489 I32 sutf8 = DO_UTF8(ssv);
4492 if (SvGMAGICAL(dsv) && (flags & SV_GMAGIC))
4494 dutf8 = DO_UTF8(dsv);
4496 if (dutf8 != sutf8) {
4498 /* Not modifying source SV, so taking a temporary copy. */
4499 SV* csv = sv_2mortal(newSVpvn(spv, slen));
4501 sv_utf8_upgrade(csv);
4502 spv = SvPV(csv, slen);
4505 sv_utf8_upgrade_nomg(dsv);
4507 sv_catpvn_nomg(dsv, spv, slen);
4512 =for apidoc sv_catsv_mg
4514 Like C<sv_catsv>, but also handles 'set' magic.
4520 Perl_sv_catsv_mg(pTHX_ SV *dsv, register SV *ssv)
4527 =for apidoc sv_catpv
4529 Concatenates the string onto the end of the string which is in the SV.
4530 If the SV has the UTF8 status set, then the bytes appended should be
4531 valid UTF8. Handles 'get' magic, but not 'set' magic. See C<sv_catpv_mg>.
4536 Perl_sv_catpv(pTHX_ register SV *sv, register const char *ptr)
4538 register STRLEN len;
4544 junk = SvPV_force(sv, tlen);
4546 SvGROW(sv, tlen + len + 1);
4549 Move(ptr,SvPVX(sv)+tlen,len+1,char);
4551 (void)SvPOK_only_UTF8(sv); /* validate pointer */
4556 =for apidoc sv_catpv_mg
4558 Like C<sv_catpv>, but also handles 'set' magic.
4564 Perl_sv_catpv_mg(pTHX_ register SV *sv, register const char *ptr)
4573 Create a new null SV, or if len > 0, create a new empty SVt_PV type SV
4574 with an initial PV allocation of len+1. Normally accessed via the C<NEWSV>
4581 Perl_newSV(pTHX_ STRLEN len)
4587 sv_upgrade(sv, SVt_PV);
4588 SvGROW(sv, len + 1);
4593 =for apidoc sv_magicext
4595 Adds magic to an SV, upgrading it if necessary. Applies the
4596 supplied vtable and returns pointer to the magic added.
4598 Note that sv_magicext will allow things that sv_magic will not.
4599 In particular you can add magic to SvREADONLY SVs and and more than
4600 one instance of the same 'how'
4602 I C<namelen> is greater then zero then a savepvn() I<copy> of C<name> is stored,
4603 if C<namelen> is zero then C<name> is stored as-is and - as another special
4604 case - if C<(name && namelen == HEf_SVKEY)> then C<name> is assumed to contain
4605 an C<SV*> and has its REFCNT incremented
4607 (This is now used as a subroutine by sv_magic.)
4612 Perl_sv_magicext(pTHX_ SV* sv, SV* obj, int how, MGVTBL *vtable,
4613 const char* name, I32 namlen)
4617 if (SvTYPE(sv) < SVt_PVMG) {
4618 (void)SvUPGRADE(sv, SVt_PVMG);
4620 Newz(702,mg, 1, MAGIC);
4621 mg->mg_moremagic = SvMAGIC(sv);
4624 /* Some magic sontains a reference loop, where the sv and object refer to
4625 each other. To prevent a reference loop that would prevent such
4626 objects being freed, we look for such loops and if we find one we
4627 avoid incrementing the object refcount.
4629 Note we cannot do this to avoid self-tie loops as intervening RV must
4630 have its REFCNT incremented to keep it in existence - instead we could
4631 special case them in sv_free() -- NI-S
4634 if (!obj || obj == sv ||
4635 how == PERL_MAGIC_arylen ||
4636 how == PERL_MAGIC_qr ||
4637 (SvTYPE(obj) == SVt_PVGV &&
4638 (GvSV(obj) == sv || GvHV(obj) == (HV*)sv || GvAV(obj) == (AV*)sv ||
4639 GvCV(obj) == (CV*)sv || GvIOp(obj) == (IO*)sv ||
4640 GvFORM(obj) == (CV*)sv)))
4645 mg->mg_obj = SvREFCNT_inc(obj);
4646 mg->mg_flags |= MGf_REFCOUNTED;
4649 mg->mg_len = namlen;
4652 mg->mg_ptr = savepvn(name, namlen);
4653 else if (namlen == HEf_SVKEY)
4654 mg->mg_ptr = (char*)SvREFCNT_inc((SV*)name);
4656 mg->mg_ptr = (char *) name;
4658 mg->mg_virtual = vtable;
4662 SvFLAGS(sv) &= ~(SVf_IOK|SVf_NOK|SVf_POK);
4667 =for apidoc sv_magic
4669 Adds magic to an SV. First upgrades C<sv> to type C<SVt_PVMG> if necessary,
4670 then adds a new magic item of type C<how> to the head of the magic list.
4676 Perl_sv_magic(pTHX_ register SV *sv, SV *obj, int how, const char *name, I32 namlen)
4681 #ifdef PERL_COPY_ON_WRITE
4683 sv_force_normal_flags(sv, 0);
4685 if (SvREADONLY(sv)) {
4686 if (PL_curcop != &PL_compiling
4687 && how != PERL_MAGIC_regex_global
4688 && how != PERL_MAGIC_bm
4689 && how != PERL_MAGIC_fm
4690 && how != PERL_MAGIC_sv
4693 Perl_croak(aTHX_ PL_no_modify);
4696 if (SvMAGICAL(sv) || (how == PERL_MAGIC_taint && SvTYPE(sv) >= SVt_PVMG)) {
4697 if (SvMAGIC(sv) && (mg = mg_find(sv, how))) {
4698 /* sv_magic() refuses to add a magic of the same 'how' as an
4701 if (how == PERL_MAGIC_taint)
4709 vtable = &PL_vtbl_sv;
4711 case PERL_MAGIC_overload:
4712 vtable = &PL_vtbl_amagic;
4714 case PERL_MAGIC_overload_elem:
4715 vtable = &PL_vtbl_amagicelem;
4717 case PERL_MAGIC_overload_table:
4718 vtable = &PL_vtbl_ovrld;
4721 vtable = &PL_vtbl_bm;
4723 case PERL_MAGIC_regdata:
4724 vtable = &PL_vtbl_regdata;
4726 case PERL_MAGIC_regdatum:
4727 vtable = &PL_vtbl_regdatum;
4729 case PERL_MAGIC_env:
4730 vtable = &PL_vtbl_env;
4733 vtable = &PL_vtbl_fm;
4735 case PERL_MAGIC_envelem:
4736 vtable = &PL_vtbl_envelem;
4738 case PERL_MAGIC_regex_global:
4739 vtable = &PL_vtbl_mglob;
4741 case PERL_MAGIC_isa:
4742 vtable = &PL_vtbl_isa;
4744 case PERL_MAGIC_isaelem:
4745 vtable = &PL_vtbl_isaelem;
4747 case PERL_MAGIC_nkeys:
4748 vtable = &PL_vtbl_nkeys;
4750 case PERL_MAGIC_dbfile:
4753 case PERL_MAGIC_dbline:
4754 vtable = &PL_vtbl_dbline;
4756 #ifdef USE_5005THREADS
4757 case PERL_MAGIC_mutex:
4758 vtable = &PL_vtbl_mutex;
4760 #endif /* USE_5005THREADS */
4761 #ifdef USE_LOCALE_COLLATE
4762 case PERL_MAGIC_collxfrm:
4763 vtable = &PL_vtbl_collxfrm;
4765 #endif /* USE_LOCALE_COLLATE */
4766 case PERL_MAGIC_tied:
4767 vtable = &PL_vtbl_pack;
4769 case PERL_MAGIC_tiedelem:
4770 case PERL_MAGIC_tiedscalar:
4771 vtable = &PL_vtbl_packelem;
4774 vtable = &PL_vtbl_regexp;
4776 case PERL_MAGIC_sig:
4777 vtable = &PL_vtbl_sig;
4779 case PERL_MAGIC_sigelem:
4780 vtable = &PL_vtbl_sigelem;
4782 case PERL_MAGIC_taint:
4783 vtable = &PL_vtbl_taint;
4785 case PERL_MAGIC_uvar:
4786 vtable = &PL_vtbl_uvar;
4788 case PERL_MAGIC_vec:
4789 vtable = &PL_vtbl_vec;
4791 case PERL_MAGIC_substr:
4792 vtable = &PL_vtbl_substr;
4794 case PERL_MAGIC_defelem:
4795 vtable = &PL_vtbl_defelem;
4797 case PERL_MAGIC_glob:
4798 vtable = &PL_vtbl_glob;
4800 case PERL_MAGIC_arylen:
4801 vtable = &PL_vtbl_arylen;
4803 case PERL_MAGIC_pos:
4804 vtable = &PL_vtbl_pos;
4806 case PERL_MAGIC_backref:
4807 vtable = &PL_vtbl_backref;
4809 case PERL_MAGIC_ext:
4810 /* Reserved for use by extensions not perl internals. */
4811 /* Useful for attaching extension internal data to perl vars. */
4812 /* Note that multiple extensions may clash if magical scalars */
4813 /* etc holding private data from one are passed to another. */
4816 Perl_croak(aTHX_ "Don't know how to handle magic of type \\%o", how);
4819 /* Rest of work is done else where */
4820 mg = sv_magicext(sv,obj,how,vtable,name,namlen);
4823 case PERL_MAGIC_taint:
4826 case PERL_MAGIC_ext:
4827 case PERL_MAGIC_dbfile:
4834 =for apidoc sv_unmagic
4836 Removes all magic of type C<type> from an SV.
4842 Perl_sv_unmagic(pTHX_ SV *sv, int type)
4846 if (SvTYPE(sv) < SVt_PVMG || !SvMAGIC(sv))
4849 for (mg = *mgp; mg; mg = *mgp) {
4850 if (mg->mg_type == type) {
4851 MGVTBL* vtbl = mg->mg_virtual;
4852 *mgp = mg->mg_moremagic;
4853 if (vtbl && vtbl->svt_free)
4854 CALL_FPTR(vtbl->svt_free)(aTHX_ sv, mg);
4855 if (mg->mg_ptr && mg->mg_type != PERL_MAGIC_regex_global) {
4857 Safefree(mg->mg_ptr);
4858 else if (mg->mg_len == HEf_SVKEY)
4859 SvREFCNT_dec((SV*)mg->mg_ptr);
4861 if (mg->mg_flags & MGf_REFCOUNTED)
4862 SvREFCNT_dec(mg->mg_obj);
4866 mgp = &mg->mg_moremagic;
4870 SvFLAGS(sv) |= (SvFLAGS(sv) & (SVp_NOK|SVp_POK)) >> PRIVSHIFT;
4877 =for apidoc sv_rvweaken
4879 Weaken a reference: set the C<SvWEAKREF> flag on this RV; give the
4880 referred-to SV C<PERL_MAGIC_backref> magic if it hasn't already; and
4881 push a back-reference to this RV onto the array of backreferences
4882 associated with that magic.
4888 Perl_sv_rvweaken(pTHX_ SV *sv)
4891 if (!SvOK(sv)) /* let undefs pass */
4894 Perl_croak(aTHX_ "Can't weaken a nonreference");
4895 else if (SvWEAKREF(sv)) {
4896 if (ckWARN(WARN_MISC))
4897 Perl_warner(aTHX_ packWARN(WARN_MISC), "Reference is already weak");
4901 sv_add_backref(tsv, sv);
4907 /* Give tsv backref magic if it hasn't already got it, then push a
4908 * back-reference to sv onto the array associated with the backref magic.
4912 S_sv_add_backref(pTHX_ SV *tsv, SV *sv)
4916 if (SvMAGICAL(tsv) && (mg = mg_find(tsv, PERL_MAGIC_backref)))
4917 av = (AV*)mg->mg_obj;
4920 sv_magic(tsv, (SV*)av, PERL_MAGIC_backref, NULL, 0);
4921 SvREFCNT_dec(av); /* for sv_magic */
4926 /* delete a back-reference to ourselves from the backref magic associated
4927 * with the SV we point to.
4931 S_sv_del_backref(pTHX_ SV *sv)
4938 if (!SvMAGICAL(tsv) || !(mg = mg_find(tsv, PERL_MAGIC_backref)))
4939 Perl_croak(aTHX_ "panic: del_backref");
4940 av = (AV *)mg->mg_obj;
4945 svp[i] = &PL_sv_undef; /* XXX */
4952 =for apidoc sv_insert
4954 Inserts a string at the specified offset/length within the SV. Similar to
4955 the Perl substr() function.
4961 Perl_sv_insert(pTHX_ SV *bigstr, STRLEN offset, STRLEN len, char *little, STRLEN littlelen)
4965 register char *midend;
4966 register char *bigend;
4972 Perl_croak(aTHX_ "Can't modify non-existent substring");
4973 SvPV_force(bigstr, curlen);
4974 (void)SvPOK_only_UTF8(bigstr);
4975 if (offset + len > curlen) {
4976 SvGROW(bigstr, offset+len+1);
4977 Zero(SvPVX(bigstr)+curlen, offset+len-curlen, char);
4978 SvCUR_set(bigstr, offset+len);
4982 i = littlelen - len;
4983 if (i > 0) { /* string might grow */
4984 big = SvGROW(bigstr, SvCUR(bigstr) + i + 1);
4985 mid = big + offset + len;
4986 midend = bigend = big + SvCUR(bigstr);
4989 while (midend > mid) /* shove everything down */
4990 *--bigend = *--midend;
4991 Move(little,big+offset,littlelen,char);
4997 Move(little,SvPVX(bigstr)+offset,len,char);
5002 big = SvPVX(bigstr);
5005 bigend = big + SvCUR(bigstr);
5007 if (midend > bigend)
5008 Perl_croak(aTHX_ "panic: sv_insert");
5010 if (mid - big > bigend - midend) { /* faster to shorten from end */
5012 Move(little, mid, littlelen,char);
5015 i = bigend - midend;
5017 Move(midend, mid, i,char);
5021 SvCUR_set(bigstr, mid - big);
5024 else if ((i = mid - big)) { /* faster from front */
5025 midend -= littlelen;
5027 sv_chop(bigstr,midend-i);
5032 Move(little, mid, littlelen,char);
5034 else if (littlelen) {
5035 midend -= littlelen;
5036 sv_chop(bigstr,midend);
5037 Move(little,midend,littlelen,char);
5040 sv_chop(bigstr,midend);
5046 =for apidoc sv_replace
5048 Make the first argument a copy of the second, then delete the original.
5049 The target SV physically takes over ownership of the body of the source SV
5050 and inherits its flags; however, the target keeps any magic it owns,
5051 and any magic in the source is discarded.
5052 Note that this is a rather specialist SV copying operation; most of the
5053 time you'll want to use C<sv_setsv> or one of its many macro front-ends.
5059 Perl_sv_replace(pTHX_ register SV *sv, register SV *nsv)
5061 U32 refcnt = SvREFCNT(sv);
5062 SV_CHECK_THINKFIRST_COW_DROP(sv);
5063 if (SvREFCNT(nsv) != 1 && ckWARN_d(WARN_INTERNAL))
5064 Perl_warner(aTHX_ packWARN(WARN_INTERNAL), "Reference miscount in sv_replace()");
5065 if (SvMAGICAL(sv)) {
5069 sv_upgrade(nsv, SVt_PVMG);
5070 SvMAGIC(nsv) = SvMAGIC(sv);
5071 SvFLAGS(nsv) |= SvMAGICAL(sv);
5077 assert(!SvREFCNT(sv));
5078 StructCopy(nsv,sv,SV);
5079 #ifdef PERL_COPY_ON_WRITE
5080 if (SvIsCOW_normal(nsv)) {
5081 /* We need to follow the pointers around the loop to make the
5082 previous SV point to sv, rather than nsv. */
5085 while ((next = SV_COW_NEXT_SV(current)) != nsv) {
5088 assert(SvPVX(current) == SvPVX(nsv));
5090 /* Make the SV before us point to the SV after us. */
5092 PerlIO_printf(Perl_debug_log, "previous is\n");
5094 PerlIO_printf(Perl_debug_log,
5095 "move it from 0x%"UVxf" to 0x%"UVxf"\n",
5096 (UV) SV_COW_NEXT_SV(current), (UV) sv);
5098 SV_COW_NEXT_SV_SET(current, sv);
5101 SvREFCNT(sv) = refcnt;
5102 SvFLAGS(nsv) |= SVTYPEMASK; /* Mark as freed */
5107 =for apidoc sv_clear
5109 Clear an SV: call any destructors, free up any memory used by the body,
5110 and free the body itself. The SV's head is I<not> freed, although
5111 its type is set to all 1's so that it won't inadvertently be assumed
5112 to be live during global destruction etc.
5113 This function should only be called when REFCNT is zero. Most of the time
5114 you'll want to call C<sv_free()> (or its macro wrapper C<SvREFCNT_dec>)
5121 Perl_sv_clear(pTHX_ register SV *sv)
5125 assert(SvREFCNT(sv) == 0);
5128 if (PL_defstash) { /* Still have a symbol table? */
5133 Zero(&tmpref, 1, SV);
5134 sv_upgrade(&tmpref, SVt_RV);
5136 SvREADONLY_on(&tmpref); /* DESTROY() could be naughty */
5137 SvREFCNT(&tmpref) = 1;
5140 stash = SvSTASH(sv);
5141 destructor = StashHANDLER(stash,DESTROY);
5144 PUSHSTACKi(PERLSI_DESTROY);
5145 SvRV(&tmpref) = SvREFCNT_inc(sv);
5150 call_sv((SV*)destructor, G_DISCARD|G_EVAL|G_KEEPERR);
5156 } while (SvOBJECT(sv) && SvSTASH(sv) != stash);
5158 del_XRV(SvANY(&tmpref));
5161 if (PL_in_clean_objs)
5162 Perl_croak(aTHX_ "DESTROY created new reference to dead object '%s'",
5164 /* DESTROY gave object new lease on life */
5170 SvREFCNT_dec(SvSTASH(sv)); /* possibly of changed persuasion */
5171 SvOBJECT_off(sv); /* Curse the object. */
5172 if (SvTYPE(sv) != SVt_PVIO)
5173 --PL_sv_objcount; /* XXX Might want something more general */
5176 if (SvTYPE(sv) >= SVt_PVMG) {
5179 if (SvFLAGS(sv) & SVpad_TYPED)
5180 SvREFCNT_dec(SvSTASH(sv));
5183 switch (SvTYPE(sv)) {
5186 IoIFP(sv) != PerlIO_stdin() &&
5187 IoIFP(sv) != PerlIO_stdout() &&
5188 IoIFP(sv) != PerlIO_stderr())
5190 io_close((IO*)sv, FALSE);
5192 if (IoDIRP(sv) && !(IoFLAGS(sv) & IOf_FAKE_DIRP))
5193 PerlDir_close(IoDIRP(sv));
5194 IoDIRP(sv) = (DIR*)NULL;
5195 Safefree(IoTOP_NAME(sv));
5196 Safefree(IoFMT_NAME(sv));
5197 Safefree(IoBOTTOM_NAME(sv));
5212 SvREFCNT_dec(LvTARG(sv));
5216 Safefree(GvNAME(sv));
5217 /* cannot decrease stash refcount yet, as we might recursively delete
5218 ourselves when the refcnt drops to zero. Delay SvREFCNT_dec
5219 of stash until current sv is completely gone.
5220 -- JohnPC, 27 Mar 1998 */
5221 stash = GvSTASH(sv);
5227 (void)SvOOK_off(sv);
5235 SvREFCNT_dec(SvRV(sv));
5237 #ifdef PERL_COPY_ON_WRITE
5238 else if (SvPVX(sv)) {
5240 /* I believe I need to grab the global SV mutex here and
5241 then recheck the COW status. */
5243 PerlIO_printf(Perl_debug_log, "Copy on write: clear\n");
5246 sv_release_COW(sv, SvPVX(sv), SvCUR(sv), SvLEN(sv),
5247 SvUVX(sv), SV_COW_NEXT_SV(sv));
5248 /* And drop it here. */
5250 } else if (SvLEN(sv)) {
5251 Safefree(SvPVX(sv));
5255 else if (SvPVX(sv) && SvLEN(sv))
5256 Safefree(SvPVX(sv));
5257 else if (SvPVX(sv) && SvREADONLY(sv) && SvFAKE(sv)) {
5258 unsharepvn(SvPVX(sv),
5259 SvUTF8(sv) ? -(I32)SvCUR(sv) : SvCUR(sv),
5273 switch (SvTYPE(sv)) {
5289 del_XPVIV(SvANY(sv));
5292 del_XPVNV(SvANY(sv));
5295 del_XPVMG(SvANY(sv));
5298 del_XPVLV(SvANY(sv));
5301 del_XPVAV(SvANY(sv));
5304 del_XPVHV(SvANY(sv));
5307 del_XPVCV(SvANY(sv));
5310 del_XPVGV(SvANY(sv));
5311 /* code duplication for increased performance. */
5312 SvFLAGS(sv) &= SVf_BREAK;
5313 SvFLAGS(sv) |= SVTYPEMASK;
5314 /* decrease refcount of the stash that owns this GV, if any */
5316 SvREFCNT_dec(stash);
5317 return; /* not break, SvFLAGS reset already happened */
5319 del_XPVBM(SvANY(sv));
5322 del_XPVFM(SvANY(sv));
5325 del_XPVIO(SvANY(sv));
5328 SvFLAGS(sv) &= SVf_BREAK;
5329 SvFLAGS(sv) |= SVTYPEMASK;
5333 =for apidoc sv_newref
5335 Increment an SV's reference count. Use the C<SvREFCNT_inc()> wrapper
5342 Perl_sv_newref(pTHX_ SV *sv)
5345 ATOMIC_INC(SvREFCNT(sv));
5352 Decrement an SV's reference count, and if it drops to zero, call
5353 C<sv_clear> to invoke destructors and free up any memory used by
5354 the body; finally, deallocate the SV's head itself.
5355 Normally called via a wrapper macro C<SvREFCNT_dec>.
5361 Perl_sv_free(pTHX_ SV *sv)
5363 int refcount_is_zero;
5367 if (SvREFCNT(sv) == 0) {
5368 if (SvFLAGS(sv) & SVf_BREAK)
5369 /* this SV's refcnt has been artificially decremented to
5370 * trigger cleanup */
5372 if (PL_in_clean_all) /* All is fair */
5374 if (SvREADONLY(sv) && SvIMMORTAL(sv)) {
5375 /* make sure SvREFCNT(sv)==0 happens very seldom */
5376 SvREFCNT(sv) = (~(U32)0)/2;
5379 if (ckWARN_d(WARN_INTERNAL))
5380 Perl_warner(aTHX_ packWARN(WARN_INTERNAL), "Attempt to free unreferenced scalar");
5383 ATOMIC_DEC_AND_TEST(refcount_is_zero, SvREFCNT(sv));
5384 if (!refcount_is_zero)
5388 if (ckWARN_d(WARN_DEBUGGING))
5389 Perl_warner(aTHX_ packWARN(WARN_DEBUGGING),
5390 "Attempt to free temp prematurely: SV 0x%"UVxf,
5395 if (SvREADONLY(sv) && SvIMMORTAL(sv)) {
5396 /* make sure SvREFCNT(sv)==0 happens very seldom */
5397 SvREFCNT(sv) = (~(U32)0)/2;
5408 Returns the length of the string in the SV. Handles magic and type
5409 coercion. See also C<SvCUR>, which gives raw access to the xpv_cur slot.
5415 Perl_sv_len(pTHX_ register SV *sv)
5423 len = mg_length(sv);
5425 (void)SvPV(sv, len);
5430 =for apidoc sv_len_utf8
5432 Returns the number of characters in the string in an SV, counting wide
5433 UTF8 bytes as a single character. Handles magic and type coercion.
5439 Perl_sv_len_utf8(pTHX_ register SV *sv)
5445 return mg_length(sv);
5449 U8 *s = (U8*)SvPV(sv, len);
5451 return Perl_utf8_length(aTHX_ s, s + len);
5456 =for apidoc sv_pos_u2b
5458 Converts the value pointed to by offsetp from a count of UTF8 chars from
5459 the start of the string, to a count of the equivalent number of bytes; if
5460 lenp is non-zero, it does the same to lenp, but this time starting from
5461 the offset, rather than from the start of the string. Handles magic and
5468 Perl_sv_pos_u2b(pTHX_ register SV *sv, I32* offsetp, I32* lenp)
5473 I32 uoffset = *offsetp;
5479 start = s = (U8*)SvPV(sv, len);
5481 while (s < send && uoffset--)
5485 *offsetp = s - start;
5489 while (s < send && ulen--)
5499 =for apidoc sv_pos_b2u
5501 Converts the value pointed to by offsetp from a count of bytes from the
5502 start of the string, to a count of the equivalent number of UTF8 chars.
5503 Handles magic and type coercion.
5509 Perl_sv_pos_b2u(pTHX_ register SV *sv, I32* offsetp)
5518 s = (U8*)SvPV(sv, len);
5519 if ((I32)len < *offsetp)
5520 Perl_croak(aTHX_ "panic: sv_pos_b2u: bad byte offset");
5521 send = s + *offsetp;
5525 /* Call utf8n_to_uvchr() to validate the sequence
5526 * (unless a simple non-UTF character) */
5527 if (!UTF8_IS_INVARIANT(*s))
5528 utf8n_to_uvchr(s, UTF8SKIP(s), &n, 0);
5543 Returns a boolean indicating whether the strings in the two SVs are
5544 identical. Is UTF-8 and 'use bytes' aware, handles get magic, and will
5545 coerce its args to strings if necessary.
5551 Perl_sv_eq(pTHX_ register SV *sv1, register SV *sv2)
5559 SV* svrecode = Nullsv;
5566 pv1 = SvPV(sv1, cur1);
5573 pv2 = SvPV(sv2, cur2);
5575 if (cur1 && cur2 && SvUTF8(sv1) != SvUTF8(sv2) && !IN_BYTES) {
5576 /* Differing utf8ness.
5577 * Do not UTF8size the comparands as a side-effect. */
5580 svrecode = newSVpvn(pv2, cur2);
5581 sv_recode_to_utf8(svrecode, PL_encoding);
5582 pv2 = SvPV(svrecode, cur2);
5585 svrecode = newSVpvn(pv1, cur1);
5586 sv_recode_to_utf8(svrecode, PL_encoding);
5587 pv1 = SvPV(svrecode, cur1);
5589 /* Now both are in UTF-8. */
5594 bool is_utf8 = TRUE;
5597 /* sv1 is the UTF-8 one,
5598 * if is equal it must be downgrade-able */
5599 char *pv = (char*)bytes_from_utf8((U8*)pv1,
5605 /* sv2 is the UTF-8 one,
5606 * if is equal it must be downgrade-able */
5607 char *pv = (char *)bytes_from_utf8((U8*)pv2,
5613 /* Downgrade not possible - cannot be eq */
5620 eq = (pv1 == pv2) || memEQ(pv1, pv2, cur1);
5623 SvREFCNT_dec(svrecode);
5634 Compares the strings in two SVs. Returns -1, 0, or 1 indicating whether the
5635 string in C<sv1> is less than, equal to, or greater than the string in
5636 C<sv2>. Is UTF-8 and 'use bytes' aware, handles get magic, and will
5637 coerce its args to strings if necessary. See also C<sv_cmp_locale>.
5643 Perl_sv_cmp(pTHX_ register SV *sv1, register SV *sv2)
5646 char *pv1, *pv2, *tpv = Nullch;
5648 SV *svrecode = Nullsv;
5655 pv1 = SvPV(sv1, cur1);
5662 pv2 = SvPV(sv2, cur2);
5664 if (cur1 && cur2 && SvUTF8(sv1) != SvUTF8(sv2) && !IN_BYTES) {
5665 /* Differing utf8ness.
5666 * Do not UTF8size the comparands as a side-effect. */
5669 svrecode = newSVpvn(pv2, cur2);
5670 sv_recode_to_utf8(svrecode, PL_encoding);
5671 pv2 = SvPV(svrecode, cur2);
5674 pv2 = tpv = (char*)bytes_to_utf8((U8*)pv2, &cur2);
5679 svrecode = newSVpvn(pv1, cur1);
5680 sv_recode_to_utf8(svrecode, PL_encoding);
5681 pv1 = SvPV(svrecode, cur1);
5684 pv1 = tpv = (char*)bytes_to_utf8((U8*)pv1, &cur1);
5690 cmp = cur2 ? -1 : 0;
5694 I32 retval = memcmp((void*)pv1, (void*)pv2, cur1 < cur2 ? cur1 : cur2);
5697 cmp = retval < 0 ? -1 : 1;
5698 } else if (cur1 == cur2) {
5701 cmp = cur1 < cur2 ? -1 : 1;
5706 SvREFCNT_dec(svrecode);
5715 =for apidoc sv_cmp_locale
5717 Compares the strings in two SVs in a locale-aware manner. Is UTF-8 and
5718 'use bytes' aware, handles get magic, and will coerce its args to strings
5719 if necessary. See also C<sv_cmp_locale>. See also C<sv_cmp>.
5725 Perl_sv_cmp_locale(pTHX_ register SV *sv1, register SV *sv2)
5727 #ifdef USE_LOCALE_COLLATE
5733 if (PL_collation_standard)
5737 pv1 = sv1 ? sv_collxfrm(sv1, &len1) : (char *) NULL;
5739 pv2 = sv2 ? sv_collxfrm(sv2, &len2) : (char *) NULL;
5741 if (!pv1 || !len1) {
5752 retval = memcmp((void*)pv1, (void*)pv2, len1 < len2 ? len1 : len2);
5755 return retval < 0 ? -1 : 1;
5758 * When the result of collation is equality, that doesn't mean
5759 * that there are no differences -- some locales exclude some
5760 * characters from consideration. So to avoid false equalities,
5761 * we use the raw string as a tiebreaker.
5767 #endif /* USE_LOCALE_COLLATE */
5769 return sv_cmp(sv1, sv2);
5773 #ifdef USE_LOCALE_COLLATE
5776 =for apidoc sv_collxfrm
5778 Add Collate Transform magic to an SV if it doesn't already have it.
5780 Any scalar variable may carry PERL_MAGIC_collxfrm magic that contains the
5781 scalar data of the variable, but transformed to such a format that a normal
5782 memory comparison can be used to compare the data according to the locale
5789 Perl_sv_collxfrm(pTHX_ SV *sv, STRLEN *nxp)
5793 mg = SvMAGICAL(sv) ? mg_find(sv, PERL_MAGIC_collxfrm) : (MAGIC *) NULL;
5794 if (!mg || !mg->mg_ptr || *(U32*)mg->mg_ptr != PL_collation_ix) {
5799 Safefree(mg->mg_ptr);
5801 if ((xf = mem_collxfrm(s, len, &xlen))) {
5802 if (SvREADONLY(sv)) {
5805 return xf + sizeof(PL_collation_ix);
5808 sv_magic(sv, 0, PERL_MAGIC_collxfrm, 0, 0);
5809 mg = mg_find(sv, PERL_MAGIC_collxfrm);
5822 if (mg && mg->mg_ptr) {
5824 return mg->mg_ptr + sizeof(PL_collation_ix);
5832 #endif /* USE_LOCALE_COLLATE */
5837 Get a line from the filehandle and store it into the SV, optionally
5838 appending to the currently-stored string.
5844 Perl_sv_gets(pTHX_ register SV *sv, register PerlIO *fp, I32 append)
5848 register STDCHAR rslast;
5849 register STDCHAR *bp;
5854 SV_CHECK_THINKFIRST_COW_DROP(sv);
5855 /* XXX. If you make this PVIV, then copy on write can copy scalars read
5857 However, perlbench says it's slower, because the existing swipe code
5858 is faster than copy on write.
5859 Swings and roundabouts. */
5860 (void)SvUPGRADE(sv, SVt_PV);
5864 if (PL_curcop == &PL_compiling) {
5865 /* we always read code in line mode */
5869 else if (RsSNARF(PL_rs)) {
5873 else if (RsRECORD(PL_rs)) {
5874 I32 recsize, bytesread;
5877 /* Grab the size of the record we're getting */
5878 recsize = SvIV(SvRV(PL_rs));
5879 (void)SvPOK_only(sv); /* Validate pointer */
5880 buffer = SvGROW(sv, (STRLEN)(recsize + 1));
5883 /* VMS wants read instead of fread, because fread doesn't respect */
5884 /* RMS record boundaries. This is not necessarily a good thing to be */
5885 /* doing, but we've got no other real choice */
5886 bytesread = PerlLIO_read(PerlIO_fileno(fp), buffer, recsize);
5888 bytesread = PerlIO_read(fp, buffer, recsize);
5890 SvCUR_set(sv, bytesread);
5891 buffer[bytesread] = '\0';
5892 if (PerlIO_isutf8(fp))
5896 return(SvCUR(sv) ? SvPVX(sv) : Nullch);
5898 else if (RsPARA(PL_rs)) {
5904 /* Get $/ i.e. PL_rs into same encoding as stream wants */
5905 if (PerlIO_isutf8(fp)) {
5906 rsptr = SvPVutf8(PL_rs, rslen);
5909 if (SvUTF8(PL_rs)) {
5910 if (!sv_utf8_downgrade(PL_rs, TRUE)) {
5911 Perl_croak(aTHX_ "Wide character in $/");
5914 rsptr = SvPV(PL_rs, rslen);
5918 rslast = rslen ? rsptr[rslen - 1] : '\0';
5920 if (rspara) { /* have to do this both before and after */
5921 do { /* to make sure file boundaries work right */
5924 i = PerlIO_getc(fp);
5928 PerlIO_ungetc(fp,i);
5934 /* See if we know enough about I/O mechanism to cheat it ! */
5936 /* This used to be #ifdef test - it is made run-time test for ease
5937 of abstracting out stdio interface. One call should be cheap
5938 enough here - and may even be a macro allowing compile
5942 if (PerlIO_fast_gets(fp)) {
5945 * We're going to steal some values from the stdio struct
5946 * and put EVERYTHING in the innermost loop into registers.
5948 register STDCHAR *ptr;
5952 #if defined(VMS) && defined(PERLIO_IS_STDIO)
5953 /* An ungetc()d char is handled separately from the regular
5954 * buffer, so we getc() it back out and stuff it in the buffer.
5956 i = PerlIO_getc(fp);
5957 if (i == EOF) return 0;
5958 *(--((*fp)->_ptr)) = (unsigned char) i;
5962 /* Here is some breathtakingly efficient cheating */
5964 cnt = PerlIO_get_cnt(fp); /* get count into register */
5965 (void)SvPOK_only(sv); /* validate pointer */
5966 if ((I32)(SvLEN(sv) - append) <= cnt + 1) { /* make sure we have the room */
5967 if (cnt > 80 && (I32)SvLEN(sv) > append) {
5968 shortbuffered = cnt - SvLEN(sv) + append + 1;
5969 cnt -= shortbuffered;
5973 /* remember that cnt can be negative */
5974 SvGROW(sv, (STRLEN)(append + (cnt <= 0 ? 2 : (cnt + 1))));
5979 bp = (STDCHAR*)SvPVX(sv) + append; /* move these two too to registers */
5980 ptr = (STDCHAR*)PerlIO_get_ptr(fp);
5981 DEBUG_P(PerlIO_printf(Perl_debug_log,
5982 "Screamer: entering, ptr=%"UVuf", cnt=%ld\n",PTR2UV(ptr),(long)cnt));
5983 DEBUG_P(PerlIO_printf(Perl_debug_log,
5984 "Screamer: entering: PerlIO * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
5985 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
5986 PTR2UV(PerlIO_has_base(fp) ? PerlIO_get_base(fp) : 0)));
5991 while (cnt > 0) { /* this | eat */
5993 if ((*bp++ = *ptr++) == rslast) /* really | dust */
5994 goto thats_all_folks; /* screams | sed :-) */
5998 Copy(ptr, bp, cnt, char); /* this | eat */
5999 bp += cnt; /* screams | dust */
6000 ptr += cnt; /* louder | sed :-) */
6005 if (shortbuffered) { /* oh well, must extend */
6006 cnt = shortbuffered;
6008 bpx = bp - (STDCHAR*)SvPVX(sv); /* box up before relocation */
6010 SvGROW(sv, SvLEN(sv) + append + cnt + 2);
6011 bp = (STDCHAR*)SvPVX(sv) + bpx; /* unbox after relocation */
6015 DEBUG_P(PerlIO_printf(Perl_debug_log,
6016 "Screamer: going to getc, ptr=%"UVuf", cnt=%ld\n",
6017 PTR2UV(ptr),(long)cnt));
6018 PerlIO_set_ptrcnt(fp, (STDCHAR*)ptr, cnt); /* deregisterize cnt and ptr */
6020 DEBUG_P(PerlIO_printf(Perl_debug_log,
6021 "Screamer: pre: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
6022 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
6023 PTR2UV(PerlIO_has_base (fp) ? PerlIO_get_base(fp) : 0)));
6025 /* This used to call 'filbuf' in stdio form, but as that behaves like
6026 getc when cnt <= 0 we use PerlIO_getc here to avoid introducing
6027 another abstraction. */
6028 i = PerlIO_getc(fp); /* get more characters */
6030 DEBUG_P(PerlIO_printf(Perl_debug_log,
6031 "Screamer: post: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
6032 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
6033 PTR2UV(PerlIO_has_base (fp) ? PerlIO_get_base(fp) : 0)));
6035 cnt = PerlIO_get_cnt(fp);
6036 ptr = (STDCHAR*)PerlIO_get_ptr(fp); /* reregisterize cnt and ptr */
6037 DEBUG_P(PerlIO_printf(Perl_debug_log,
6038 "Screamer: after getc, ptr=%"UVuf", cnt=%ld\n",PTR2UV(ptr),(long)cnt));
6040 if (i == EOF) /* all done for ever? */
6041 goto thats_really_all_folks;
6043 bpx = bp - (STDCHAR*)SvPVX(sv); /* box up before relocation */
6045 SvGROW(sv, bpx + cnt + 2);
6046 bp = (STDCHAR*)SvPVX(sv) + bpx; /* unbox after relocation */
6048 *bp++ = (STDCHAR)i; /* store character from PerlIO_getc */
6050 if (rslen && (STDCHAR)i == rslast) /* all done for now? */
6051 goto thats_all_folks;
6055 if ((rslen > 1 && (STRLEN)(bp - (STDCHAR*)SvPVX(sv)) < rslen) ||
6056 memNE((char*)bp - rslen, rsptr, rslen))
6057 goto screamer; /* go back to the fray */
6058 thats_really_all_folks:
6060 cnt += shortbuffered;
6061 DEBUG_P(PerlIO_printf(Perl_debug_log,
6062 "Screamer: quitting, ptr=%"UVuf", cnt=%ld\n",PTR2UV(ptr),(long)cnt));
6063 PerlIO_set_ptrcnt(fp, (STDCHAR*)ptr, cnt); /* put these back or we're in trouble */
6064 DEBUG_P(PerlIO_printf(Perl_debug_log,
6065 "Screamer: end: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
6066 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
6067 PTR2UV(PerlIO_has_base (fp) ? PerlIO_get_base(fp) : 0)));
6069 SvCUR_set(sv, bp - (STDCHAR*)SvPVX(sv)); /* set length */
6070 DEBUG_P(PerlIO_printf(Perl_debug_log,
6071 "Screamer: done, len=%ld, string=|%.*s|\n",
6072 (long)SvCUR(sv),(int)SvCUR(sv),SvPVX(sv)));
6077 /*The big, slow, and stupid way */
6080 /* Need to work around EPOC SDK features */
6081 /* On WINS: MS VC5 generates calls to _chkstk, */
6082 /* if a `large' stack frame is allocated */
6083 /* gcc on MARM does not generate calls like these */
6089 register STDCHAR *bpe = buf + sizeof(buf);
6091 while ((i = PerlIO_getc(fp)) != EOF && (*bp++ = (STDCHAR)i) != rslast && bp < bpe)
6092 ; /* keep reading */
6096 cnt = PerlIO_read(fp,(char*)buf, sizeof(buf));
6097 /* Accomodate broken VAXC compiler, which applies U8 cast to
6098 * both args of ?: operator, causing EOF to change into 255
6101 i = (U8)buf[cnt - 1];
6107 cnt = 0; /* we do need to re-set the sv even when cnt <= 0 */
6109 sv_catpvn(sv, (char *) buf, cnt);
6111 sv_setpvn(sv, (char *) buf, cnt);
6113 if (i != EOF && /* joy */
6115 SvCUR(sv) < rslen ||
6116 memNE(SvPVX(sv) + SvCUR(sv) - rslen, rsptr, rslen)))
6120 * If we're reading from a TTY and we get a short read,
6121 * indicating that the user hit his EOF character, we need
6122 * to notice it now, because if we try to read from the TTY
6123 * again, the EOF condition will disappear.
6125 * The comparison of cnt to sizeof(buf) is an optimization
6126 * that prevents unnecessary calls to feof().
6130 if (!(cnt < sizeof(buf) && PerlIO_eof(fp)))
6135 if (rspara) { /* have to do this both before and after */
6136 while (i != EOF) { /* to make sure file boundaries work right */
6137 i = PerlIO_getc(fp);
6139 PerlIO_ungetc(fp,i);
6145 if (PerlIO_isutf8(fp))
6150 return (SvCUR(sv) - append) ? SvPVX(sv) : Nullch;
6156 Auto-increment of the value in the SV, doing string to numeric conversion
6157 if necessary. Handles 'get' magic.
6163 Perl_sv_inc(pTHX_ register SV *sv)
6172 if (SvTHINKFIRST(sv)) {
6174 sv_force_normal_flags(sv, 0);
6175 if (SvREADONLY(sv)) {
6176 if (PL_curcop != &PL_compiling)
6177 Perl_croak(aTHX_ PL_no_modify);
6181 if (SvAMAGIC(sv) && AMG_CALLun(sv,inc))
6183 i = PTR2IV(SvRV(sv));
6188 flags = SvFLAGS(sv);
6189 if ((flags & (SVp_NOK|SVp_IOK)) == SVp_NOK) {
6190 /* It's (privately or publicly) a float, but not tested as an
6191 integer, so test it to see. */
6193 flags = SvFLAGS(sv);
6195 if ((flags & SVf_IOK) || ((flags & (SVp_IOK | SVp_NOK)) == SVp_IOK)) {
6196 /* It's publicly an integer, or privately an integer-not-float */
6197 #ifdef PERL_PRESERVE_IVUV
6201 if (SvUVX(sv) == UV_MAX)
6202 sv_setnv(sv, UV_MAX_P1);
6204 (void)SvIOK_only_UV(sv);
6207 if (SvIVX(sv) == IV_MAX)
6208 sv_setuv(sv, (UV)IV_MAX + 1);
6210 (void)SvIOK_only(sv);
6216 if (flags & SVp_NOK) {
6217 (void)SvNOK_only(sv);
6222 if (!(flags & SVp_POK) || !*SvPVX(sv)) {
6223 if ((flags & SVTYPEMASK) < SVt_PVIV)
6224 sv_upgrade(sv, SVt_IV);
6225 (void)SvIOK_only(sv);
6230 while (isALPHA(*d)) d++;
6231 while (isDIGIT(*d)) d++;
6233 #ifdef PERL_PRESERVE_IVUV
6234 /* Got to punt this as an integer if needs be, but we don't issue
6235 warnings. Probably ought to make the sv_iv_please() that does
6236 the conversion if possible, and silently. */
6237 int numtype = grok_number(SvPVX(sv), SvCUR(sv), NULL);
6238 if (numtype && !(numtype & IS_NUMBER_INFINITY)) {
6239 /* Need to try really hard to see if it's an integer.
6240 9.22337203685478e+18 is an integer.
6241 but "9.22337203685478e+18" + 0 is UV=9223372036854779904
6242 so $a="9.22337203685478e+18"; $a+0; $a++
6243 needs to be the same as $a="9.22337203685478e+18"; $a++
6250 /* sv_2iv *should* have made this an NV */
6251 if (flags & SVp_NOK) {
6252 (void)SvNOK_only(sv);
6256 /* I don't think we can get here. Maybe I should assert this
6257 And if we do get here I suspect that sv_setnv will croak. NWC
6259 #if defined(USE_LONG_DOUBLE)
6260 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",
6261 SvPVX(sv), SvIVX(sv), SvNVX(sv)));
6263 DEBUG_c(PerlIO_printf(Perl_debug_log,"sv_inc punt failed to convert '%s' to IOK or NOKp, UV=0x%"UVxf" NV=%"NVgf"\n",
6264 SvPVX(sv), SvIVX(sv), SvNVX(sv)));
6267 #endif /* PERL_PRESERVE_IVUV */
6268 sv_setnv(sv,Atof(SvPVX(sv)) + 1.0);
6272 while (d >= SvPVX(sv)) {
6280 /* MKS: The original code here died if letters weren't consecutive.
6281 * at least it didn't have to worry about non-C locales. The
6282 * new code assumes that ('z'-'a')==('Z'-'A'), letters are
6283 * arranged in order (although not consecutively) and that only
6284 * [A-Za-z] are accepted by isALPHA in the C locale.
6286 if (*d != 'z' && *d != 'Z') {
6287 do { ++*d; } while (!isALPHA(*d));
6290 *(d--) -= 'z' - 'a';
6295 *(d--) -= 'z' - 'a' + 1;
6299 /* oh,oh, the number grew */
6300 SvGROW(sv, SvCUR(sv) + 2);
6302 for (d = SvPVX(sv) + SvCUR(sv); d > SvPVX(sv); d--)
6313 Auto-decrement of the value in the SV, doing string to numeric conversion
6314 if necessary. Handles 'get' magic.
6320 Perl_sv_dec(pTHX_ register SV *sv)
6328 if (SvTHINKFIRST(sv)) {
6330 sv_force_normal_flags(sv, 0);
6331 if (SvREADONLY(sv)) {
6332 if (PL_curcop != &PL_compiling)
6333 Perl_croak(aTHX_ PL_no_modify);
6337 if (SvAMAGIC(sv) && AMG_CALLun(sv,dec))
6339 i = PTR2IV(SvRV(sv));
6344 /* Unlike sv_inc we don't have to worry about string-never-numbers
6345 and keeping them magic. But we mustn't warn on punting */
6346 flags = SvFLAGS(sv);
6347 if ((flags & SVf_IOK) || ((flags & (SVp_IOK | SVp_NOK)) == SVp_IOK)) {
6348 /* It's publicly an integer, or privately an integer-not-float */
6349 #ifdef PERL_PRESERVE_IVUV
6353 if (SvUVX(sv) == 0) {
6354 (void)SvIOK_only(sv);
6358 (void)SvIOK_only_UV(sv);
6362 if (SvIVX(sv) == IV_MIN)
6363 sv_setnv(sv, (NV)IV_MIN - 1.0);
6365 (void)SvIOK_only(sv);
6371 if (flags & SVp_NOK) {
6373 (void)SvNOK_only(sv);
6376 if (!(flags & SVp_POK)) {
6377 if ((flags & SVTYPEMASK) < SVt_PVNV)
6378 sv_upgrade(sv, SVt_NV);
6380 (void)SvNOK_only(sv);
6383 #ifdef PERL_PRESERVE_IVUV
6385 int numtype = grok_number(SvPVX(sv), SvCUR(sv), NULL);
6386 if (numtype && !(numtype & IS_NUMBER_INFINITY)) {
6387 /* Need to try really hard to see if it's an integer.
6388 9.22337203685478e+18 is an integer.
6389 but "9.22337203685478e+18" + 0 is UV=9223372036854779904
6390 so $a="9.22337203685478e+18"; $a+0; $a--
6391 needs to be the same as $a="9.22337203685478e+18"; $a--
6398 /* sv_2iv *should* have made this an NV */
6399 if (flags & SVp_NOK) {
6400 (void)SvNOK_only(sv);
6404 /* I don't think we can get here. Maybe I should assert this
6405 And if we do get here I suspect that sv_setnv will croak. NWC
6407 #if defined(USE_LONG_DOUBLE)
6408 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",
6409 SvPVX(sv), SvIVX(sv), SvNVX(sv)));
6411 DEBUG_c(PerlIO_printf(Perl_debug_log,"sv_dec punt failed to convert '%s' to IOK or NOKp, UV=0x%"UVxf" NV=%"NVgf"\n",
6412 SvPVX(sv), SvIVX(sv), SvNVX(sv)));
6416 #endif /* PERL_PRESERVE_IVUV */
6417 sv_setnv(sv,Atof(SvPVX(sv)) - 1.0); /* punt */
6421 =for apidoc sv_mortalcopy
6423 Creates a new SV which is a copy of the original SV (using C<sv_setsv>).
6424 The new SV is marked as mortal. It will be destroyed "soon", either by an
6425 explicit call to FREETMPS, or by an implicit call at places such as
6426 statement boundaries. See also C<sv_newmortal> and C<sv_2mortal>.
6431 /* Make a string that will exist for the duration of the expression
6432 * evaluation. Actually, it may have to last longer than that, but
6433 * hopefully we won't free it until it has been assigned to a
6434 * permanent location. */
6437 Perl_sv_mortalcopy(pTHX_ SV *oldstr)
6442 sv_setsv(sv,oldstr);
6444 PL_tmps_stack[++PL_tmps_ix] = sv;
6450 =for apidoc sv_newmortal
6452 Creates a new null SV which is mortal. The reference count of the SV is
6453 set to 1. It will be destroyed "soon", either by an explicit call to
6454 FREETMPS, or by an implicit call at places such as statement boundaries.
6455 See also C<sv_mortalcopy> and C<sv_2mortal>.
6461 Perl_sv_newmortal(pTHX)
6466 SvFLAGS(sv) = SVs_TEMP;
6468 PL_tmps_stack[++PL_tmps_ix] = sv;
6473 =for apidoc sv_2mortal
6475 Marks an existing SV as mortal. The SV will be destroyed "soon", either
6476 by an explicit call to FREETMPS, or by an implicit call at places such as
6477 statement boundaries. See also C<sv_newmortal> and C<sv_mortalcopy>.
6483 Perl_sv_2mortal(pTHX_ register SV *sv)
6487 if (SvREADONLY(sv) && SvIMMORTAL(sv))
6490 PL_tmps_stack[++PL_tmps_ix] = sv;
6498 Creates a new SV and copies a string into it. The reference count for the
6499 SV is set to 1. If C<len> is zero, Perl will compute the length using
6500 strlen(). For efficiency, consider using C<newSVpvn> instead.
6506 Perl_newSVpv(pTHX_ const char *s, STRLEN len)
6513 sv_setpvn(sv,s,len);
6518 =for apidoc newSVpvn
6520 Creates a new SV and copies a string into it. The reference count for the
6521 SV is set to 1. Note that if C<len> is zero, Perl will create a zero length
6522 string. You are responsible for ensuring that the source string is at least
6529 Perl_newSVpvn(pTHX_ const char *s, STRLEN len)
6534 sv_setpvn(sv,s,len);
6539 =for apidoc newSVpvn_share
6541 Creates a new SV with its SvPVX pointing to a shared string in the string
6542 table. If the string does not already exist in the table, it is created
6543 first. Turns on READONLY and FAKE. The string's hash is stored in the UV
6544 slot of the SV; if the C<hash> parameter is non-zero, that value is used;
6545 otherwise the hash is computed. The idea here is that as the string table
6546 is used for shared hash keys these strings will have SvPVX == HeKEY and
6547 hash lookup will avoid string compare.
6553 Perl_newSVpvn_share(pTHX_ const char *src, I32 len, U32 hash)
6556 bool is_utf8 = FALSE;
6558 STRLEN tmplen = -len;
6560 /* See the note in hv.c:hv_fetch() --jhi */
6561 src = (char*)bytes_from_utf8((U8*)src, &tmplen, &is_utf8);
6565 PERL_HASH(hash, src, len);
6567 sv_upgrade(sv, SVt_PVIV);
6568 SvPVX(sv) = sharepvn(src, is_utf8?-len:len, hash);
6581 #if defined(PERL_IMPLICIT_CONTEXT)
6583 /* pTHX_ magic can't cope with varargs, so this is a no-context
6584 * version of the main function, (which may itself be aliased to us).
6585 * Don't access this version directly.
6589 Perl_newSVpvf_nocontext(const char* pat, ...)
6594 va_start(args, pat);
6595 sv = vnewSVpvf(pat, &args);
6602 =for apidoc newSVpvf
6604 Creates a new SV and initializes it with the string formatted like
6611 Perl_newSVpvf(pTHX_ const char* pat, ...)
6615 va_start(args, pat);
6616 sv = vnewSVpvf(pat, &args);
6621 /* backend for newSVpvf() and newSVpvf_nocontext() */
6624 Perl_vnewSVpvf(pTHX_ const char* pat, va_list* args)
6628 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
6635 Creates a new SV and copies a floating point value into it.
6636 The reference count for the SV is set to 1.
6642 Perl_newSVnv(pTHX_ NV n)
6654 Creates a new SV and copies an integer into it. The reference count for the
6661 Perl_newSViv(pTHX_ IV i)
6673 Creates a new SV and copies an unsigned integer into it.
6674 The reference count for the SV is set to 1.
6680 Perl_newSVuv(pTHX_ UV u)
6690 =for apidoc newRV_noinc
6692 Creates an RV wrapper for an SV. The reference count for the original
6693 SV is B<not> incremented.
6699 Perl_newRV_noinc(pTHX_ SV *tmpRef)
6704 sv_upgrade(sv, SVt_RV);
6711 /* newRV_inc is the official function name to use now.
6712 * newRV_inc is in fact #defined to newRV in sv.h
6716 Perl_newRV(pTHX_ SV *tmpRef)
6718 return newRV_noinc(SvREFCNT_inc(tmpRef));
6724 Creates a new SV which is an exact duplicate of the original SV.
6731 Perl_newSVsv(pTHX_ register SV *old)
6737 if (SvTYPE(old) == SVTYPEMASK) {
6738 if (ckWARN_d(WARN_INTERNAL))
6739 Perl_warner(aTHX_ packWARN(WARN_INTERNAL), "semi-panic: attempt to dup freed string");
6754 =for apidoc sv_reset
6756 Underlying implementation for the C<reset> Perl function.
6757 Note that the perl-level function is vaguely deprecated.
6763 Perl_sv_reset(pTHX_ register char *s, HV *stash)
6771 char todo[PERL_UCHAR_MAX+1];
6776 if (!*s) { /* reset ?? searches */
6777 for (pm = HvPMROOT(stash); pm; pm = pm->op_pmnext) {
6778 pm->op_pmdynflags &= ~PMdf_USED;
6783 /* reset variables */
6785 if (!HvARRAY(stash))
6788 Zero(todo, 256, char);
6790 i = (unsigned char)*s;
6794 max = (unsigned char)*s++;
6795 for ( ; i <= max; i++) {
6798 for (i = 0; i <= (I32) HvMAX(stash); i++) {
6799 for (entry = HvARRAY(stash)[i];
6801 entry = HeNEXT(entry))
6803 if (!todo[(U8)*HeKEY(entry)])
6805 gv = (GV*)HeVAL(entry);
6807 if (SvTHINKFIRST(sv)) {
6808 if (!SvREADONLY(sv) && SvROK(sv))
6813 if (SvTYPE(sv) >= SVt_PV) {
6815 if (SvPVX(sv) != Nullch)
6822 if (GvHV(gv) && !HvNAME(GvHV(gv))) {
6824 #ifdef USE_ENVIRON_ARRAY
6826 # ifdef USE_ITHREADS
6827 && PL_curinterp == aTHX
6831 environ[0] = Nullch;
6843 Using various gambits, try to get an IO from an SV: the IO slot if its a
6844 GV; or the recursive result if we're an RV; or the IO slot of the symbol
6845 named after the PV if we're a string.
6851 Perl_sv_2io(pTHX_ SV *sv)
6857 switch (SvTYPE(sv)) {
6865 Perl_croak(aTHX_ "Bad filehandle: %s", GvNAME(gv));
6869 Perl_croak(aTHX_ PL_no_usym, "filehandle");
6871 return sv_2io(SvRV(sv));
6872 gv = gv_fetchpv(SvPV(sv,n_a), FALSE, SVt_PVIO);
6878 Perl_croak(aTHX_ "Bad filehandle: %s", SvPV(sv,n_a));
6887 Using various gambits, try to get a CV from an SV; in addition, try if
6888 possible to set C<*st> and C<*gvp> to the stash and GV associated with it.
6894 Perl_sv_2cv(pTHX_ SV *sv, HV **st, GV **gvp, I32 lref)
6901 return *gvp = Nullgv, Nullcv;
6902 switch (SvTYPE(sv)) {
6921 SV **sp = &sv; /* Used in tryAMAGICunDEREF macro. */
6922 tryAMAGICunDEREF(to_cv);
6925 if (SvTYPE(sv) == SVt_PVCV) {
6934 Perl_croak(aTHX_ "Not a subroutine reference");
6939 gv = gv_fetchpv(SvPV(sv, n_a), lref, SVt_PVCV);
6945 if (lref && !GvCVu(gv)) {
6948 tmpsv = NEWSV(704,0);
6949 gv_efullname3(tmpsv, gv, Nullch);
6950 /* XXX this is probably not what they think they're getting.
6951 * It has the same effect as "sub name;", i.e. just a forward
6953 newSUB(start_subparse(FALSE, 0),
6954 newSVOP(OP_CONST, 0, tmpsv),
6959 Perl_croak(aTHX_ "Unable to create sub named \"%s\"", SvPV(sv,n_a));
6968 Returns true if the SV has a true value by Perl's rules.
6969 Use the C<SvTRUE> macro instead, which may call C<sv_true()> or may
6970 instead use an in-line version.
6976 Perl_sv_true(pTHX_ register SV *sv)
6982 if ((tXpv = (XPV*)SvANY(sv)) &&
6983 (tXpv->xpv_cur > 1 ||
6984 (tXpv->xpv_cur && *tXpv->xpv_pv != '0')))
6991 return SvIVX(sv) != 0;
6994 return SvNVX(sv) != 0.0;
6996 return sv_2bool(sv);
7004 A private implementation of the C<SvIVx> macro for compilers which can't
7005 cope with complex macro expressions. Always use the macro instead.
7011 Perl_sv_iv(pTHX_ register SV *sv)
7015 return (IV)SvUVX(sv);
7024 A private implementation of the C<SvUVx> macro for compilers which can't
7025 cope with complex macro expressions. Always use the macro instead.
7031 Perl_sv_uv(pTHX_ register SV *sv)
7036 return (UV)SvIVX(sv);
7044 A private implementation of the C<SvNVx> macro for compilers which can't
7045 cope with complex macro expressions. Always use the macro instead.
7051 Perl_sv_nv(pTHX_ register SV *sv)
7061 Use the C<SvPV_nolen> macro instead
7065 A private implementation of the C<SvPV> macro for compilers which can't
7066 cope with complex macro expressions. Always use the macro instead.
7072 Perl_sv_pvn(pTHX_ SV *sv, STRLEN *lp)
7078 return sv_2pv(sv, lp);
7083 Perl_sv_pvn_nomg(pTHX_ register SV *sv, STRLEN *lp)
7089 return sv_2pv_flags(sv, lp, 0);
7093 =for apidoc sv_pvn_force
7095 Get a sensible string out of the SV somehow.
7096 A private implementation of the C<SvPV_force> macro for compilers which
7097 can't cope with complex macro expressions. Always use the macro instead.
7099 =for apidoc sv_pvn_force_flags
7101 Get a sensible string out of the SV somehow.
7102 If C<flags> has C<SV_GMAGIC> bit set, will C<mg_get> on C<sv> if
7103 appropriate, else not. C<sv_pvn_force> and C<sv_pvn_force_nomg> are
7104 implemented in terms of this function.
7105 You normally want to use the various wrapper macros instead: see
7106 C<SvPV_force> and C<SvPV_force_nomg>
7112 Perl_sv_pvn_force_flags(pTHX_ SV *sv, STRLEN *lp, I32 flags)
7116 if (SvTHINKFIRST(sv) && !SvROK(sv))
7117 sv_force_normal_flags(sv, 0);
7123 if (SvTYPE(sv) > SVt_PVLV && SvTYPE(sv) != SVt_PVFM) {
7124 Perl_croak(aTHX_ "Can't coerce %s to string in %s", sv_reftype(sv,0),
7128 s = sv_2pv_flags(sv, lp, flags);
7129 if (s != SvPVX(sv)) { /* Almost, but not quite, sv_setpvn() */
7134 (void)SvUPGRADE(sv, SVt_PV); /* Never FALSE */
7135 SvGROW(sv, len + 1);
7136 Move(s,SvPVX(sv),len,char);
7141 SvPOK_on(sv); /* validate pointer */
7143 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2pv(%s)\n",
7144 PTR2UV(sv),SvPVX(sv)));
7151 =for apidoc sv_pvbyte
7153 Use C<SvPVbyte_nolen> instead.
7155 =for apidoc sv_pvbyten
7157 A private implementation of the C<SvPVbyte> macro for compilers
7158 which can't cope with complex macro expressions. Always use the macro
7165 Perl_sv_pvbyten(pTHX_ SV *sv, STRLEN *lp)
7167 sv_utf8_downgrade(sv,0);
7168 return sv_pvn(sv,lp);
7172 =for apidoc sv_pvbyten_force
7174 A private implementation of the C<SvPVbytex_force> macro for compilers
7175 which can't cope with complex macro expressions. Always use the macro
7182 Perl_sv_pvbyten_force(pTHX_ SV *sv, STRLEN *lp)
7184 sv_utf8_downgrade(sv,0);
7185 return sv_pvn_force(sv,lp);
7189 =for apidoc sv_pvutf8
7191 Use the C<SvPVutf8_nolen> macro instead
7193 =for apidoc sv_pvutf8n
7195 A private implementation of the C<SvPVutf8> macro for compilers
7196 which can't cope with complex macro expressions. Always use the macro
7203 Perl_sv_pvutf8n(pTHX_ SV *sv, STRLEN *lp)
7205 sv_utf8_upgrade(sv);
7206 return sv_pvn(sv,lp);
7210 =for apidoc sv_pvutf8n_force
7212 A private implementation of the C<SvPVutf8_force> macro for compilers
7213 which can't cope with complex macro expressions. Always use the macro
7220 Perl_sv_pvutf8n_force(pTHX_ SV *sv, STRLEN *lp)
7222 sv_utf8_upgrade(sv);
7223 return sv_pvn_force(sv,lp);
7227 =for apidoc sv_reftype
7229 Returns a string describing what the SV is a reference to.
7235 Perl_sv_reftype(pTHX_ SV *sv, int ob)
7237 if (ob && SvOBJECT(sv)) {
7238 HV *svs = SvSTASH(sv);
7239 /* [20011101.072] This bandaid for C<package;> should eventually
7240 be removed. AMS 20011103 */
7241 return (svs ? HvNAME(svs) : "<none>");
7244 switch (SvTYPE(sv)) {
7260 case SVt_PVLV: return "LVALUE";
7261 case SVt_PVAV: return "ARRAY";
7262 case SVt_PVHV: return "HASH";
7263 case SVt_PVCV: return "CODE";
7264 case SVt_PVGV: return "GLOB";
7265 case SVt_PVFM: return "FORMAT";
7266 case SVt_PVIO: return "IO";
7267 default: return "UNKNOWN";
7273 =for apidoc sv_isobject
7275 Returns a boolean indicating whether the SV is an RV pointing to a blessed
7276 object. If the SV is not an RV, or if the object is not blessed, then this
7283 Perl_sv_isobject(pTHX_ SV *sv)
7300 Returns a boolean indicating whether the SV is blessed into the specified
7301 class. This does not check for subtypes; use C<sv_derived_from> to verify
7302 an inheritance relationship.
7308 Perl_sv_isa(pTHX_ SV *sv, const char *name)
7320 return strEQ(HvNAME(SvSTASH(sv)), name);
7326 Creates a new SV for the RV, C<rv>, to point to. If C<rv> is not an RV then
7327 it will be upgraded to one. If C<classname> is non-null then the new SV will
7328 be blessed in the specified package. The new SV is returned and its
7329 reference count is 1.
7335 Perl_newSVrv(pTHX_ SV *rv, const char *classname)
7341 SV_CHECK_THINKFIRST_COW_DROP(rv);
7344 if (SvTYPE(rv) >= SVt_PVMG) {
7345 U32 refcnt = SvREFCNT(rv);
7349 SvREFCNT(rv) = refcnt;
7352 if (SvTYPE(rv) < SVt_RV)
7353 sv_upgrade(rv, SVt_RV);
7354 else if (SvTYPE(rv) > SVt_RV) {
7355 (void)SvOOK_off(rv);
7356 if (SvPVX(rv) && SvLEN(rv))
7357 Safefree(SvPVX(rv));
7367 HV* stash = gv_stashpv(classname, TRUE);
7368 (void)sv_bless(rv, stash);
7374 =for apidoc sv_setref_pv
7376 Copies a pointer into a new SV, optionally blessing the SV. The C<rv>
7377 argument will be upgraded to an RV. That RV will be modified to point to
7378 the new SV. If the C<pv> argument is NULL then C<PL_sv_undef> will be placed
7379 into the SV. The C<classname> argument indicates the package for the
7380 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
7381 will be returned and will have a reference count of 1.
7383 Do not use with other Perl types such as HV, AV, SV, CV, because those
7384 objects will become corrupted by the pointer copy process.
7386 Note that C<sv_setref_pvn> copies the string while this copies the pointer.
7392 Perl_sv_setref_pv(pTHX_ SV *rv, const char *classname, void *pv)
7395 sv_setsv(rv, &PL_sv_undef);
7399 sv_setiv(newSVrv(rv,classname), PTR2IV(pv));
7404 =for apidoc sv_setref_iv
7406 Copies an integer into a new SV, optionally blessing the SV. The C<rv>
7407 argument will be upgraded to an RV. That RV will be modified to point to
7408 the new SV. The C<classname> argument indicates the package for the
7409 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
7410 will be returned and will have a reference count of 1.
7416 Perl_sv_setref_iv(pTHX_ SV *rv, const char *classname, IV iv)
7418 sv_setiv(newSVrv(rv,classname), iv);
7423 =for apidoc sv_setref_uv
7425 Copies an unsigned integer into a new SV, optionally blessing the SV. The C<rv>
7426 argument will be upgraded to an RV. That RV will be modified to point to
7427 the new SV. The C<classname> argument indicates the package for the
7428 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
7429 will be returned and will have a reference count of 1.
7435 Perl_sv_setref_uv(pTHX_ SV *rv, const char *classname, UV uv)
7437 sv_setuv(newSVrv(rv,classname), uv);
7442 =for apidoc sv_setref_nv
7444 Copies a double into a new SV, optionally blessing the SV. The C<rv>
7445 argument will be upgraded to an RV. That RV will be modified to point to
7446 the new SV. The C<classname> argument indicates the package for the
7447 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
7448 will be returned and will have a reference count of 1.
7454 Perl_sv_setref_nv(pTHX_ SV *rv, const char *classname, NV nv)
7456 sv_setnv(newSVrv(rv,classname), nv);
7461 =for apidoc sv_setref_pvn
7463 Copies a string into a new SV, optionally blessing the SV. The length of the
7464 string must be specified with C<n>. The C<rv> argument will be upgraded to
7465 an RV. That RV will be modified to point to the new SV. The C<classname>
7466 argument indicates the package for the blessing. Set C<classname> to
7467 C<Nullch> to avoid the blessing. The new SV will be returned and will have
7468 a reference count of 1.
7470 Note that C<sv_setref_pv> copies the pointer while this copies the string.
7476 Perl_sv_setref_pvn(pTHX_ SV *rv, const char *classname, char *pv, STRLEN n)
7478 sv_setpvn(newSVrv(rv,classname), pv, n);
7483 =for apidoc sv_bless
7485 Blesses an SV into a specified package. The SV must be an RV. The package
7486 must be designated by its stash (see C<gv_stashpv()>). The reference count
7487 of the SV is unaffected.
7493 Perl_sv_bless(pTHX_ SV *sv, HV *stash)
7497 Perl_croak(aTHX_ "Can't bless non-reference value");
7499 if (SvFLAGS(tmpRef) & (SVs_OBJECT|SVf_READONLY)) {
7500 if (SvREADONLY(tmpRef))
7501 Perl_croak(aTHX_ PL_no_modify);
7502 if (SvOBJECT(tmpRef)) {
7503 if (SvTYPE(tmpRef) != SVt_PVIO)
7505 SvREFCNT_dec(SvSTASH(tmpRef));
7508 SvOBJECT_on(tmpRef);
7509 if (SvTYPE(tmpRef) != SVt_PVIO)
7511 (void)SvUPGRADE(tmpRef, SVt_PVMG);
7512 SvSTASH(tmpRef) = (HV*)SvREFCNT_inc(stash);
7519 if(SvSMAGICAL(tmpRef))
7520 if(mg_find(tmpRef, PERL_MAGIC_ext) || mg_find(tmpRef, PERL_MAGIC_uvar))
7528 /* Downgrades a PVGV to a PVMG.
7532 S_sv_unglob(pTHX_ SV *sv)
7536 assert(SvTYPE(sv) == SVt_PVGV);
7541 SvREFCNT_dec(GvSTASH(sv));
7542 GvSTASH(sv) = Nullhv;
7544 sv_unmagic(sv, PERL_MAGIC_glob);
7545 Safefree(GvNAME(sv));
7548 /* need to keep SvANY(sv) in the right arena */
7549 xpvmg = new_XPVMG();
7550 StructCopy(SvANY(sv), xpvmg, XPVMG);
7551 del_XPVGV(SvANY(sv));
7554 SvFLAGS(sv) &= ~SVTYPEMASK;
7555 SvFLAGS(sv) |= SVt_PVMG;
7559 =for apidoc sv_unref_flags
7561 Unsets the RV status of the SV, and decrements the reference count of
7562 whatever was being referenced by the RV. This can almost be thought of
7563 as a reversal of C<newSVrv>. The C<cflags> argument can contain
7564 C<SV_IMMEDIATE_UNREF> to force the reference count to be decremented
7565 (otherwise the decrementing is conditional on the reference count being
7566 different from one or the reference being a readonly SV).
7573 Perl_sv_unref_flags(pTHX_ SV *sv, U32 flags)
7577 if (SvWEAKREF(sv)) {
7585 if (SvREFCNT(rv) != 1 || SvREADONLY(rv) || (flags & SV_IMMEDIATE_UNREF))
7587 else /* XXX Hack, but hard to make $a=$a->[1] work otherwise */
7588 sv_2mortal(rv); /* Schedule for freeing later */
7592 =for apidoc sv_unref
7594 Unsets the RV status of the SV, and decrements the reference count of
7595 whatever was being referenced by the RV. This can almost be thought of
7596 as a reversal of C<newSVrv>. This is C<sv_unref_flags> with the C<flag>
7597 being zero. See C<SvROK_off>.
7603 Perl_sv_unref(pTHX_ SV *sv)
7605 sv_unref_flags(sv, 0);
7609 =for apidoc sv_taint
7611 Taint an SV. Use C<SvTAINTED_on> instead.
7616 Perl_sv_taint(pTHX_ SV *sv)
7618 sv_magic((sv), Nullsv, PERL_MAGIC_taint, Nullch, 0);
7622 =for apidoc sv_untaint
7624 Untaint an SV. Use C<SvTAINTED_off> instead.
7629 Perl_sv_untaint(pTHX_ SV *sv)
7631 if (SvTYPE(sv) >= SVt_PVMG && SvMAGIC(sv)) {
7632 MAGIC *mg = mg_find(sv, PERL_MAGIC_taint);
7639 =for apidoc sv_tainted
7641 Test an SV for taintedness. Use C<SvTAINTED> instead.
7646 Perl_sv_tainted(pTHX_ SV *sv)
7648 if (SvTYPE(sv) >= SVt_PVMG && SvMAGIC(sv)) {
7649 MAGIC *mg = mg_find(sv, PERL_MAGIC_taint);
7650 if (mg && ((mg->mg_len & 1) || ((mg->mg_len & 2) && mg->mg_obj == sv)))
7656 #if defined(PERL_IMPLICIT_CONTEXT)
7658 /* pTHX_ magic can't cope with varargs, so this is a no-context
7659 * version of the main function, (which may itself be aliased to us).
7660 * Don't access this version directly.
7664 Perl_sv_setpvf_nocontext(SV *sv, const char* pat, ...)
7668 va_start(args, pat);
7669 sv_vsetpvf(sv, pat, &args);
7673 /* pTHX_ magic can't cope with varargs, so this is a no-context
7674 * version of the main function, (which may itself be aliased to us).
7675 * Don't access this version directly.
7679 Perl_sv_setpvf_mg_nocontext(SV *sv, const char* pat, ...)
7683 va_start(args, pat);
7684 sv_vsetpvf_mg(sv, pat, &args);
7690 =for apidoc sv_setpvf
7692 Processes its arguments like C<sprintf> and sets an SV to the formatted
7693 output. Does not handle 'set' magic. See C<sv_setpvf_mg>.
7699 Perl_sv_setpvf(pTHX_ SV *sv, const char* pat, ...)
7702 va_start(args, pat);
7703 sv_vsetpvf(sv, pat, &args);
7707 /* backend for C<sv_setpvf> and C<sv_setpvf_nocontext> */
7710 Perl_sv_vsetpvf(pTHX_ SV *sv, const char* pat, va_list* args)
7712 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
7716 =for apidoc sv_setpvf_mg
7718 Like C<sv_setpvf>, but also handles 'set' magic.
7724 Perl_sv_setpvf_mg(pTHX_ SV *sv, const char* pat, ...)
7727 va_start(args, pat);
7728 sv_vsetpvf_mg(sv, pat, &args);
7732 /* backend for C<sv_setpvf_mg> C<setpvf_mg_nocontext> */
7735 Perl_sv_vsetpvf_mg(pTHX_ SV *sv, const char* pat, va_list* args)
7737 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
7741 #if defined(PERL_IMPLICIT_CONTEXT)
7743 /* pTHX_ magic can't cope with varargs, so this is a no-context
7744 * version of the main function, (which may itself be aliased to us).
7745 * Don't access this version directly.
7749 Perl_sv_catpvf_nocontext(SV *sv, const char* pat, ...)
7753 va_start(args, pat);
7754 sv_vcatpvf(sv, pat, &args);
7758 /* pTHX_ magic can't cope with varargs, so this is a no-context
7759 * version of the main function, (which may itself be aliased to us).
7760 * Don't access this version directly.
7764 Perl_sv_catpvf_mg_nocontext(SV *sv, const char* pat, ...)
7768 va_start(args, pat);
7769 sv_vcatpvf_mg(sv, pat, &args);
7775 =for apidoc sv_catpvf
7777 Processes its arguments like C<sprintf> and appends the formatted
7778 output to an SV. If the appended data contains "wide" characters
7779 (including, but not limited to, SVs with a UTF-8 PV formatted with %s,
7780 and characters >255 formatted with %c), the original SV might get
7781 upgraded to UTF-8. Handles 'get' magic, but not 'set' magic.
7782 C<SvSETMAGIC()> must typically be called after calling this function
7783 to handle 'set' magic.
7788 Perl_sv_catpvf(pTHX_ SV *sv, const char* pat, ...)
7791 va_start(args, pat);
7792 sv_vcatpvf(sv, pat, &args);
7796 /* backend for C<sv_catpvf> and C<catpvf_mg_nocontext> */
7799 Perl_sv_vcatpvf(pTHX_ SV *sv, const char* pat, va_list* args)
7801 sv_vcatpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
7805 =for apidoc sv_catpvf_mg
7807 Like C<sv_catpvf>, but also handles 'set' magic.
7813 Perl_sv_catpvf_mg(pTHX_ SV *sv, const char* pat, ...)
7816 va_start(args, pat);
7817 sv_vcatpvf_mg(sv, pat, &args);
7821 /* backend for C<catpvf_mg> and C<catpvf_mg_nocontext> */
7824 Perl_sv_vcatpvf_mg(pTHX_ SV *sv, const char* pat, va_list* args)
7826 sv_vcatpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
7831 =for apidoc sv_vsetpvfn
7833 Works like C<vcatpvfn> but copies the text into the SV instead of
7836 Usually used via one of its frontends C<sv_setpvf> and C<sv_setpvf_mg>.
7842 Perl_sv_vsetpvfn(pTHX_ SV *sv, const char *pat, STRLEN patlen, va_list *args, SV **svargs, I32 svmax, bool *maybe_tainted)
7844 sv_setpvn(sv, "", 0);
7845 sv_vcatpvfn(sv, pat, patlen, args, svargs, svmax, maybe_tainted);
7848 /* private function for use in sv_vcatpvfn via the EXPECT_NUMBER macro */
7851 S_expect_number(pTHX_ char** pattern)
7854 switch (**pattern) {
7855 case '1': case '2': case '3':
7856 case '4': case '5': case '6':
7857 case '7': case '8': case '9':
7858 while (isDIGIT(**pattern))
7859 var = var * 10 + (*(*pattern)++ - '0');
7863 #define EXPECT_NUMBER(pattern, var) (var = S_expect_number(aTHX_ &pattern))
7866 =for apidoc sv_vcatpvfn
7868 Processes its arguments like C<vsprintf> and appends the formatted output
7869 to an SV. Uses an array of SVs if the C style variable argument list is
7870 missing (NULL). When running with taint checks enabled, indicates via
7871 C<maybe_tainted> if results are untrustworthy (often due to the use of
7874 Usually used via one of its frontends C<sv_catpvf> and C<sv_catpvf_mg>.
7880 Perl_sv_vcatpvfn(pTHX_ SV *sv, const char *pat, STRLEN patlen, va_list *args, SV **svargs, I32 svmax, bool *maybe_tainted)
7887 static char nullstr[] = "(null)";
7889 bool has_utf8 = FALSE; /* has the result utf8? */
7891 /* no matter what, this is a string now */
7892 (void)SvPV_force(sv, origlen);
7894 /* special-case "", "%s", and "%_" */
7897 if (patlen == 2 && pat[0] == '%') {
7901 char *s = va_arg(*args, char*);
7902 sv_catpv(sv, s ? s : nullstr);
7904 else if (svix < svmax) {
7905 sv_catsv(sv, *svargs);
7906 if (DO_UTF8(*svargs))
7912 argsv = va_arg(*args, SV*);
7913 sv_catsv(sv, argsv);
7918 /* See comment on '_' below */
7923 if (!args && svix < svmax && DO_UTF8(*svargs))
7926 patend = (char*)pat + patlen;
7927 for (p = (char*)pat; p < patend; p = q) {
7930 bool vectorize = FALSE;
7931 bool vectorarg = FALSE;
7932 bool vec_utf8 = FALSE;
7938 bool has_precis = FALSE;
7940 bool is_utf8 = FALSE; /* is this item utf8? */
7941 #ifdef HAS_LDBL_SPRINTF_BUG
7942 /* This is to try to fix a bug with irix/nonstop-ux/powerux and
7943 with sfio - Allen <allens@cpan.org> */
7944 bool fix_ldbl_sprintf_bug = FALSE;
7948 U8 utf8buf[UTF8_MAXLEN+1];
7949 STRLEN esignlen = 0;
7951 char *eptr = Nullch;
7953 /* Times 4: a decimal digit takes more than 3 binary digits.
7954 * NV_DIG: mantissa takes than many decimal digits.
7955 * Plus 32: Playing safe. */
7956 char ebuf[IV_DIG * 4 + NV_DIG + 32];
7957 /* large enough for "%#.#f" --chip */
7958 /* what about long double NVs? --jhi */
7961 U8 *vecstr = Null(U8*);
7968 /* we need a long double target in case HAS_LONG_DOUBLE but
7971 #if defined(HAS_LONG_DOUBLE) && LONG_DOUBLESIZE > DOUBLESIZE
7980 STRLEN dotstrlen = 1;
7981 I32 efix = 0; /* explicit format parameter index */
7982 I32 ewix = 0; /* explicit width index */
7983 I32 epix = 0; /* explicit precision index */
7984 I32 evix = 0; /* explicit vector index */
7985 bool asterisk = FALSE;
7987 /* echo everything up to the next format specification */
7988 for (q = p; q < patend && *q != '%'; ++q) ;
7990 sv_catpvn(sv, p, q - p);
7997 We allow format specification elements in this order:
7998 \d+\$ explicit format parameter index
8000 v|\*(\d+\$)?v vector with optional (optionally specified) arg
8001 \d+|\*(\d+\$)? width using optional (optionally specified) arg
8002 \.(\d*|\*(\d+\$)?) precision using optional (optionally specified) arg
8004 [%bcdefginopsux_DFOUX] format (mandatory)
8006 if (EXPECT_NUMBER(q, width)) {
8047 if (EXPECT_NUMBER(q, ewix))
8056 if ((vectorarg = asterisk)) {
8066 EXPECT_NUMBER(q, width);
8071 vecsv = va_arg(*args, SV*);
8073 vecsv = (evix ? evix <= svmax : svix < svmax) ?
8074 svargs[ewix ? ewix-1 : svix++] : &PL_sv_undef;
8075 dotstr = SvPVx(vecsv, dotstrlen);
8080 vecsv = va_arg(*args, SV*);
8081 vecstr = (U8*)SvPVx(vecsv,veclen);
8082 vec_utf8 = DO_UTF8(vecsv);
8084 else if (efix ? efix <= svmax : svix < svmax) {
8085 vecsv = svargs[efix ? efix-1 : svix++];
8086 vecstr = (U8*)SvPVx(vecsv,veclen);
8087 vec_utf8 = DO_UTF8(vecsv);
8097 i = va_arg(*args, int);
8099 i = (ewix ? ewix <= svmax : svix < svmax) ?
8100 SvIVx(svargs[ewix ? ewix-1 : svix++]) : 0;
8102 width = (i < 0) ? -i : i;
8112 if (EXPECT_NUMBER(q, epix) && *q++ != '$')
8114 /* XXX: todo, support specified precision parameter */
8118 i = va_arg(*args, int);
8120 i = (ewix ? ewix <= svmax : svix < svmax)
8121 ? SvIVx(svargs[ewix ? ewix-1 : svix++]) : 0;
8122 precis = (i < 0) ? 0 : i;
8127 precis = precis * 10 + (*q++ - '0');
8136 case 'I': /* Ix, I32x, and I64x */
8138 if (q[1] == '6' && q[2] == '4') {
8144 if (q[1] == '3' && q[2] == '2') {
8154 #if defined(HAS_QUAD) || defined(HAS_LONG_DOUBLE)
8165 #if defined(HAS_QUAD) || defined(HAS_LONG_DOUBLE)
8166 if (*(q + 1) == 'l') { /* lld, llf */
8191 argsv = (efix ? efix <= svmax : svix < svmax) ?
8192 svargs[efix ? efix-1 : svix++] : &PL_sv_undef;
8199 uv = (args && !vectorize) ? va_arg(*args, int) : SvIVx(argsv);
8201 (!UNI_IS_INVARIANT(uv) && SvUTF8(sv)))
8203 eptr = (char*)utf8buf;
8204 elen = uvchr_to_utf8((U8*)eptr, uv) - utf8buf;
8215 if (args && !vectorize) {
8216 eptr = va_arg(*args, char*);
8218 #ifdef MACOS_TRADITIONAL
8219 /* On MacOS, %#s format is used for Pascal strings */
8224 elen = strlen(eptr);
8227 elen = sizeof nullstr - 1;
8231 eptr = SvPVx(argsv, elen);
8232 if (DO_UTF8(argsv)) {
8233 if (has_precis && precis < elen) {
8235 sv_pos_u2b(argsv, &p, 0); /* sticks at end */
8238 if (width) { /* fudge width (can't fudge elen) */
8239 width += elen - sv_len_utf8(argsv);
8248 * The "%_" hack might have to be changed someday,
8249 * if ISO or ANSI decide to use '_' for something.
8250 * So we keep it hidden from users' code.
8252 if (!args || vectorize)
8254 argsv = va_arg(*args, SV*);
8255 eptr = SvPVx(argsv, elen);
8261 if (has_precis && elen > precis)
8268 if (alt || vectorize)
8270 uv = PTR2UV(args ? va_arg(*args, void*) : argsv);
8288 uv = utf8n_to_uvchr(vecstr, veclen, &ulen,
8297 esignbuf[esignlen++] = plus;
8301 case 'h': iv = (short)va_arg(*args, int); break;
8302 default: iv = va_arg(*args, int); break;
8303 case 'l': iv = va_arg(*args, long); break;
8304 case 'V': iv = va_arg(*args, IV); break;
8306 case 'q': iv = va_arg(*args, Quad_t); break;
8313 case 'h': iv = (short)iv; break;
8315 case 'l': iv = (long)iv; break;
8318 case 'q': iv = (Quad_t)iv; break;
8322 if ( !vectorize ) /* we already set uv above */
8327 esignbuf[esignlen++] = plus;
8331 esignbuf[esignlen++] = '-';
8374 uv = utf8n_to_uvchr(vecstr, veclen, &ulen,
8385 case 'h': uv = (unsigned short)va_arg(*args, unsigned); break;
8386 default: uv = va_arg(*args, unsigned); break;
8387 case 'l': uv = va_arg(*args, unsigned long); break;
8388 case 'V': uv = va_arg(*args, UV); break;
8390 case 'q': uv = va_arg(*args, Quad_t); break;
8397 case 'h': uv = (unsigned short)uv; break;
8399 case 'l': uv = (unsigned long)uv; break;
8402 case 'q': uv = (Quad_t)uv; break;
8408 eptr = ebuf + sizeof ebuf;
8414 p = (char*)((c == 'X')
8415 ? "0123456789ABCDEF" : "0123456789abcdef");
8421 esignbuf[esignlen++] = '0';
8422 esignbuf[esignlen++] = c; /* 'x' or 'X' */
8428 *--eptr = '0' + dig;
8430 if (alt && *eptr != '0')
8436 *--eptr = '0' + dig;
8439 esignbuf[esignlen++] = '0';
8440 esignbuf[esignlen++] = 'b';
8443 default: /* it had better be ten or less */
8444 #if defined(PERL_Y2KWARN)
8445 if (ckWARN(WARN_Y2K)) {
8447 char *s = SvPV(sv,n);
8448 if (n >= 2 && s[n-2] == '1' && s[n-1] == '9'
8449 && (n == 2 || !isDIGIT(s[n-3])))
8451 Perl_warner(aTHX_ packWARN(WARN_Y2K),
8452 "Possible Y2K bug: %%%c %s",
8453 c, "format string following '19'");
8459 *--eptr = '0' + dig;
8460 } while (uv /= base);
8463 elen = (ebuf + sizeof ebuf) - eptr;
8466 zeros = precis - elen;
8467 else if (precis == 0 && elen == 1 && *eptr == '0')
8472 /* FLOATING POINT */
8475 c = 'f'; /* maybe %F isn't supported here */
8481 /* This is evil, but floating point is even more evil */
8483 /* for SV-style calling, we can only get NV
8484 for C-style calling, we assume %f is double;
8485 for simplicity we allow any of %Lf, %llf, %qf for long double
8489 #if defined(USE_LONG_DOUBLE)
8494 #if defined(USE_LONG_DOUBLE)
8495 intsize = args ? 0 : 'q';
8499 #if defined(HAS_LONG_DOUBLE)
8510 /* now we need (long double) if intsize == 'q', else (double) */
8511 nv = (args && !vectorize) ?
8512 #if LONG_DOUBLESIZE > DOUBLESIZE
8514 va_arg(*args, long double) :
8515 va_arg(*args, double)
8517 va_arg(*args, double)
8523 if (c != 'e' && c != 'E') {
8525 /* FIXME: if HAS_LONG_DOUBLE but not USE_LONG_DOUBLE this
8526 will cast our (long double) to (double) */
8527 (void)Perl_frexp(nv, &i);
8528 if (i == PERL_INT_MIN)
8529 Perl_die(aTHX_ "panic: frexp");
8531 need = BIT_DIGITS(i);
8533 need += has_precis ? precis : 6; /* known default */
8538 #ifdef HAS_LDBL_SPRINTF_BUG
8539 /* This is to try to fix a bug with irix/nonstop-ux/powerux and
8540 with sfio - Allen <allens@cpan.org> */
8543 # define MY_DBL_MAX DBL_MAX
8544 # else /* XXX guessing! HUGE_VAL may be defined as infinity, so not using */
8545 # if DOUBLESIZE >= 8
8546 # define MY_DBL_MAX 1.7976931348623157E+308L
8548 # define MY_DBL_MAX 3.40282347E+38L
8552 # ifdef HAS_LDBL_SPRINTF_BUG_LESS1 /* only between -1L & 1L - Allen */
8553 # define MY_DBL_MAX_BUG 1L
8555 # define MY_DBL_MAX_BUG MY_DBL_MAX
8559 # define MY_DBL_MIN DBL_MIN
8560 # else /* XXX guessing! -Allen */
8561 # if DOUBLESIZE >= 8
8562 # define MY_DBL_MIN 2.2250738585072014E-308L
8564 # define MY_DBL_MIN 1.17549435E-38L
8568 if ((intsize == 'q') && (c == 'f') &&
8569 ((nv < MY_DBL_MAX_BUG) && (nv > -MY_DBL_MAX_BUG)) &&
8571 /* it's going to be short enough that
8572 * long double precision is not needed */
8574 if ((nv <= 0L) && (nv >= -0L))
8575 fix_ldbl_sprintf_bug = TRUE; /* 0 is 0 - easiest */
8577 /* would use Perl_fp_class as a double-check but not
8578 * functional on IRIX - see perl.h comments */
8580 if ((nv >= MY_DBL_MIN) || (nv <= -MY_DBL_MIN)) {
8581 /* It's within the range that a double can represent */
8582 #if defined(DBL_MAX) && !defined(DBL_MIN)
8583 if ((nv >= ((long double)1/DBL_MAX)) ||
8584 (nv <= (-(long double)1/DBL_MAX)))
8586 fix_ldbl_sprintf_bug = TRUE;
8589 if (fix_ldbl_sprintf_bug == TRUE) {
8599 # undef MY_DBL_MAX_BUG
8602 #endif /* HAS_LDBL_SPRINTF_BUG */
8604 need += 20; /* fudge factor */
8605 if (PL_efloatsize < need) {
8606 Safefree(PL_efloatbuf);
8607 PL_efloatsize = need + 20; /* more fudge */
8608 New(906, PL_efloatbuf, PL_efloatsize, char);
8609 PL_efloatbuf[0] = '\0';
8612 eptr = ebuf + sizeof ebuf;
8615 /* FIXME: what to do if HAS_LONG_DOUBLE but not PERL_PRIfldbl? */
8616 #if defined(HAS_LONG_DOUBLE) && defined(PERL_PRIfldbl)
8617 if (intsize == 'q') {
8618 /* Copy the one or more characters in a long double
8619 * format before the 'base' ([efgEFG]) character to
8620 * the format string. */
8621 static char const prifldbl[] = PERL_PRIfldbl;
8622 char const *p = prifldbl + sizeof(prifldbl) - 3;
8623 while (p >= prifldbl) { *--eptr = *p--; }
8628 do { *--eptr = '0' + (base % 10); } while (base /= 10);
8633 do { *--eptr = '0' + (base % 10); } while (base /= 10);
8645 /* No taint. Otherwise we are in the strange situation
8646 * where printf() taints but print($float) doesn't.
8648 #if defined(HAS_LONG_DOUBLE)
8650 (void)sprintf(PL_efloatbuf, eptr, nv);
8652 (void)sprintf(PL_efloatbuf, eptr, (double)nv);
8654 (void)sprintf(PL_efloatbuf, eptr, nv);
8656 eptr = PL_efloatbuf;
8657 elen = strlen(PL_efloatbuf);
8663 i = SvCUR(sv) - origlen;
8664 if (args && !vectorize) {
8666 case 'h': *(va_arg(*args, short*)) = i; break;
8667 default: *(va_arg(*args, int*)) = i; break;
8668 case 'l': *(va_arg(*args, long*)) = i; break;
8669 case 'V': *(va_arg(*args, IV*)) = i; break;
8671 case 'q': *(va_arg(*args, Quad_t*)) = i; break;
8676 sv_setuv_mg(argsv, (UV)i);
8678 continue; /* not "break" */
8685 if (!args && ckWARN(WARN_PRINTF) &&
8686 (PL_op->op_type == OP_PRTF || PL_op->op_type == OP_SPRINTF)) {
8687 SV *msg = sv_newmortal();
8688 Perl_sv_setpvf(aTHX_ msg, "Invalid conversion in %s: ",
8689 (PL_op->op_type == OP_PRTF) ? "printf" : "sprintf");
8692 Perl_sv_catpvf(aTHX_ msg,
8693 "\"%%%c\"", c & 0xFF);
8695 Perl_sv_catpvf(aTHX_ msg,
8696 "\"%%\\%03"UVof"\"",
8699 sv_catpv(msg, "end of string");
8700 Perl_warner(aTHX_ packWARN(WARN_PRINTF), "%"SVf, msg); /* yes, this is reentrant */
8703 /* output mangled stuff ... */
8709 /* ... right here, because formatting flags should not apply */
8710 SvGROW(sv, SvCUR(sv) + elen + 1);
8712 Copy(eptr, p, elen, char);
8715 SvCUR(sv) = p - SvPVX(sv);
8716 continue; /* not "break" */
8719 if (is_utf8 != has_utf8) {
8722 sv_utf8_upgrade(sv);
8725 SV *nsv = sv_2mortal(newSVpvn(eptr, elen));
8726 sv_utf8_upgrade(nsv);
8730 SvGROW(sv, SvCUR(sv) + elen + 1);
8735 have = esignlen + zeros + elen;
8736 need = (have > width ? have : width);
8739 SvGROW(sv, SvCUR(sv) + need + dotstrlen + 1);
8741 if (esignlen && fill == '0') {
8742 for (i = 0; i < (int)esignlen; i++)
8746 memset(p, fill, gap);
8749 if (esignlen && fill != '0') {
8750 for (i = 0; i < (int)esignlen; i++)
8754 for (i = zeros; i; i--)
8758 Copy(eptr, p, elen, char);
8762 memset(p, ' ', gap);
8767 Copy(dotstr, p, dotstrlen, char);
8771 vectorize = FALSE; /* done iterating over vecstr */
8778 SvCUR(sv) = p - SvPVX(sv);
8786 /* =========================================================================
8788 =head1 Cloning an interpreter
8790 All the macros and functions in this section are for the private use of
8791 the main function, perl_clone().
8793 The foo_dup() functions make an exact copy of an existing foo thinngy.
8794 During the course of a cloning, a hash table is used to map old addresses
8795 to new addresses. The table is created and manipulated with the
8796 ptr_table_* functions.
8800 ============================================================================*/
8803 #if defined(USE_ITHREADS)
8805 #if defined(USE_5005THREADS)
8806 # include "error: USE_5005THREADS and USE_ITHREADS are incompatible"
8809 #ifndef GpREFCNT_inc
8810 # define GpREFCNT_inc(gp) ((gp) ? (++(gp)->gp_refcnt, (gp)) : (GP*)NULL)
8814 #define sv_dup_inc(s,t) SvREFCNT_inc(sv_dup(s,t))
8815 #define av_dup(s,t) (AV*)sv_dup((SV*)s,t)
8816 #define av_dup_inc(s,t) (AV*)SvREFCNT_inc(sv_dup((SV*)s,t))
8817 #define hv_dup(s,t) (HV*)sv_dup((SV*)s,t)
8818 #define hv_dup_inc(s,t) (HV*)SvREFCNT_inc(sv_dup((SV*)s,t))
8819 #define cv_dup(s,t) (CV*)sv_dup((SV*)s,t)
8820 #define cv_dup_inc(s,t) (CV*)SvREFCNT_inc(sv_dup((SV*)s,t))
8821 #define io_dup(s,t) (IO*)sv_dup((SV*)s,t)
8822 #define io_dup_inc(s,t) (IO*)SvREFCNT_inc(sv_dup((SV*)s,t))
8823 #define gv_dup(s,t) (GV*)sv_dup((SV*)s,t)
8824 #define gv_dup_inc(s,t) (GV*)SvREFCNT_inc(sv_dup((SV*)s,t))
8825 #define SAVEPV(p) (p ? savepv(p) : Nullch)
8826 #define SAVEPVN(p,n) (p ? savepvn(p,n) : Nullch)
8829 /* Duplicate a regexp. Required reading: pregcomp() and pregfree() in
8830 regcomp.c. AMS 20010712 */
8833 Perl_re_dup(pTHX_ REGEXP *r, CLONE_PARAMS *param)
8837 struct reg_substr_datum *s;
8840 return (REGEXP *)NULL;
8842 if ((ret = (REGEXP *)ptr_table_fetch(PL_ptr_table, r)))
8845 len = r->offsets[0];
8846 npar = r->nparens+1;
8848 Newc(0, ret, sizeof(regexp) + (len+1)*sizeof(regnode), char, regexp);
8849 Copy(r->program, ret->program, len+1, regnode);
8851 New(0, ret->startp, npar, I32);
8852 Copy(r->startp, ret->startp, npar, I32);
8853 New(0, ret->endp, npar, I32);
8854 Copy(r->startp, ret->startp, npar, I32);
8856 New(0, ret->substrs, 1, struct reg_substr_data);
8857 for (s = ret->substrs->data, i = 0; i < 3; i++, s++) {
8858 s->min_offset = r->substrs->data[i].min_offset;
8859 s->max_offset = r->substrs->data[i].max_offset;
8860 s->substr = sv_dup_inc(r->substrs->data[i].substr, param);
8861 s->utf8_substr = sv_dup_inc(r->substrs->data[i].utf8_substr, param);
8864 ret->regstclass = NULL;
8867 int count = r->data->count;
8869 Newc(0, d, sizeof(struct reg_data) + count*sizeof(void *),
8870 char, struct reg_data);
8871 New(0, d->what, count, U8);
8874 for (i = 0; i < count; i++) {
8875 d->what[i] = r->data->what[i];
8876 switch (d->what[i]) {
8878 d->data[i] = sv_dup_inc((SV *)r->data->data[i], param);
8881 d->data[i] = av_dup_inc((AV *)r->data->data[i], param);
8884 /* This is cheating. */
8885 New(0, d->data[i], 1, struct regnode_charclass_class);
8886 StructCopy(r->data->data[i], d->data[i],
8887 struct regnode_charclass_class);
8888 ret->regstclass = (regnode*)d->data[i];
8891 /* Compiled op trees are readonly, and can thus be
8892 shared without duplication. */
8893 d->data[i] = (void*)OpREFCNT_inc((OP*)r->data->data[i]);
8896 d->data[i] = r->data->data[i];
8906 New(0, ret->offsets, 2*len+1, U32);
8907 Copy(r->offsets, ret->offsets, 2*len+1, U32);
8909 ret->precomp = SAVEPV(r->precomp);
8910 ret->refcnt = r->refcnt;
8911 ret->minlen = r->minlen;
8912 ret->prelen = r->prelen;
8913 ret->nparens = r->nparens;
8914 ret->lastparen = r->lastparen;
8915 ret->lastcloseparen = r->lastcloseparen;
8916 ret->reganch = r->reganch;
8918 ret->sublen = r->sublen;
8920 if (RX_MATCH_COPIED(ret))
8921 ret->subbeg = SAVEPV(r->subbeg);
8923 ret->subbeg = Nullch;
8925 ptr_table_store(PL_ptr_table, r, ret);
8929 /* duplicate a file handle */
8932 Perl_fp_dup(pTHX_ PerlIO *fp, char type, CLONE_PARAMS *param)
8936 return (PerlIO*)NULL;
8938 /* look for it in the table first */
8939 ret = (PerlIO*)ptr_table_fetch(PL_ptr_table, fp);
8943 /* create anew and remember what it is */
8944 ret = PerlIO_fdupopen(aTHX_ fp, param, PERLIO_DUP_CLONE);
8945 ptr_table_store(PL_ptr_table, fp, ret);
8949 /* duplicate a directory handle */
8952 Perl_dirp_dup(pTHX_ DIR *dp)
8960 /* duplicate a typeglob */
8963 Perl_gp_dup(pTHX_ GP *gp, CLONE_PARAMS* param)
8968 /* look for it in the table first */
8969 ret = (GP*)ptr_table_fetch(PL_ptr_table, gp);
8973 /* create anew and remember what it is */
8974 Newz(0, ret, 1, GP);
8975 ptr_table_store(PL_ptr_table, gp, ret);
8978 ret->gp_refcnt = 0; /* must be before any other dups! */
8979 ret->gp_sv = sv_dup_inc(gp->gp_sv, param);
8980 ret->gp_io = io_dup_inc(gp->gp_io, param);
8981 ret->gp_form = cv_dup_inc(gp->gp_form, param);
8982 ret->gp_av = av_dup_inc(gp->gp_av, param);
8983 ret->gp_hv = hv_dup_inc(gp->gp_hv, param);
8984 ret->gp_egv = gv_dup(gp->gp_egv, param);/* GvEGV is not refcounted */
8985 ret->gp_cv = cv_dup_inc(gp->gp_cv, param);
8986 ret->gp_cvgen = gp->gp_cvgen;
8987 ret->gp_flags = gp->gp_flags;
8988 ret->gp_line = gp->gp_line;
8989 ret->gp_file = gp->gp_file; /* points to COP.cop_file */
8993 /* duplicate a chain of magic */
8996 Perl_mg_dup(pTHX_ MAGIC *mg, CLONE_PARAMS* param)
8998 MAGIC *mgprev = (MAGIC*)NULL;
9001 return (MAGIC*)NULL;
9002 /* look for it in the table first */
9003 mgret = (MAGIC*)ptr_table_fetch(PL_ptr_table, mg);
9007 for (; mg; mg = mg->mg_moremagic) {
9009 Newz(0, nmg, 1, MAGIC);
9011 mgprev->mg_moremagic = nmg;
9014 nmg->mg_virtual = mg->mg_virtual; /* XXX copy dynamic vtable? */
9015 nmg->mg_private = mg->mg_private;
9016 nmg->mg_type = mg->mg_type;
9017 nmg->mg_flags = mg->mg_flags;
9018 if (mg->mg_type == PERL_MAGIC_qr) {
9019 nmg->mg_obj = (SV*)re_dup((REGEXP*)mg->mg_obj, param);
9021 else if(mg->mg_type == PERL_MAGIC_backref) {
9022 AV *av = (AV*) mg->mg_obj;
9025 nmg->mg_obj = (SV*)newAV();
9029 av_push((AV*)nmg->mg_obj,sv_dup(svp[i],param));
9034 nmg->mg_obj = (mg->mg_flags & MGf_REFCOUNTED)
9035 ? sv_dup_inc(mg->mg_obj, param)
9036 : sv_dup(mg->mg_obj, param);
9038 nmg->mg_len = mg->mg_len;
9039 nmg->mg_ptr = mg->mg_ptr; /* XXX random ptr? */
9040 if (mg->mg_ptr && mg->mg_type != PERL_MAGIC_regex_global) {
9041 if (mg->mg_len > 0) {
9042 nmg->mg_ptr = SAVEPVN(mg->mg_ptr, mg->mg_len);
9043 if (mg->mg_type == PERL_MAGIC_overload_table &&
9044 AMT_AMAGIC((AMT*)mg->mg_ptr))
9046 AMT *amtp = (AMT*)mg->mg_ptr;
9047 AMT *namtp = (AMT*)nmg->mg_ptr;
9049 for (i = 1; i < NofAMmeth; i++) {
9050 namtp->table[i] = cv_dup_inc(amtp->table[i], param);
9054 else if (mg->mg_len == HEf_SVKEY)
9055 nmg->mg_ptr = (char*)sv_dup_inc((SV*)mg->mg_ptr, param);
9057 if ((mg->mg_flags & MGf_DUP) && mg->mg_virtual && mg->mg_virtual->svt_dup) {
9058 CALL_FPTR(nmg->mg_virtual->svt_dup)(aTHX_ nmg, param);
9065 /* create a new pointer-mapping table */
9068 Perl_ptr_table_new(pTHX)
9071 Newz(0, tbl, 1, PTR_TBL_t);
9074 Newz(0, tbl->tbl_ary, tbl->tbl_max + 1, PTR_TBL_ENT_t*);
9078 /* map an existing pointer using a table */
9081 Perl_ptr_table_fetch(pTHX_ PTR_TBL_t *tbl, void *sv)
9083 PTR_TBL_ENT_t *tblent;
9084 UV hash = PTR2UV(sv);
9086 tblent = tbl->tbl_ary[hash & tbl->tbl_max];
9087 for (; tblent; tblent = tblent->next) {
9088 if (tblent->oldval == sv)
9089 return tblent->newval;
9094 /* add a new entry to a pointer-mapping table */
9097 Perl_ptr_table_store(pTHX_ PTR_TBL_t *tbl, void *oldv, void *newv)
9099 PTR_TBL_ENT_t *tblent, **otblent;
9100 /* XXX this may be pessimal on platforms where pointers aren't good
9101 * hash values e.g. if they grow faster in the most significant
9103 UV hash = PTR2UV(oldv);
9107 otblent = &tbl->tbl_ary[hash & tbl->tbl_max];
9108 for (tblent = *otblent; tblent; i=0, tblent = tblent->next) {
9109 if (tblent->oldval == oldv) {
9110 tblent->newval = newv;
9114 Newz(0, tblent, 1, PTR_TBL_ENT_t);
9115 tblent->oldval = oldv;
9116 tblent->newval = newv;
9117 tblent->next = *otblent;
9120 if (i && tbl->tbl_items > tbl->tbl_max)
9121 ptr_table_split(tbl);
9124 /* double the hash bucket size of an existing ptr table */
9127 Perl_ptr_table_split(pTHX_ PTR_TBL_t *tbl)
9129 PTR_TBL_ENT_t **ary = tbl->tbl_ary;
9130 UV oldsize = tbl->tbl_max + 1;
9131 UV newsize = oldsize * 2;
9134 Renew(ary, newsize, PTR_TBL_ENT_t*);
9135 Zero(&ary[oldsize], newsize-oldsize, PTR_TBL_ENT_t*);
9136 tbl->tbl_max = --newsize;
9138 for (i=0; i < oldsize; i++, ary++) {
9139 PTR_TBL_ENT_t **curentp, **entp, *ent;
9142 curentp = ary + oldsize;
9143 for (entp = ary, ent = *ary; ent; ent = *entp) {
9144 if ((newsize & PTR2UV(ent->oldval)) != i) {
9146 ent->next = *curentp;
9156 /* remove all the entries from a ptr table */
9159 Perl_ptr_table_clear(pTHX_ PTR_TBL_t *tbl)
9161 register PTR_TBL_ENT_t **array;
9162 register PTR_TBL_ENT_t *entry;
9163 register PTR_TBL_ENT_t *oentry = Null(PTR_TBL_ENT_t*);
9167 if (!tbl || !tbl->tbl_items) {
9171 array = tbl->tbl_ary;
9178 entry = entry->next;
9182 if (++riter > max) {
9185 entry = array[riter];
9192 /* clear and free a ptr table */
9195 Perl_ptr_table_free(pTHX_ PTR_TBL_t *tbl)
9200 ptr_table_clear(tbl);
9201 Safefree(tbl->tbl_ary);
9209 /* attempt to make everything in the typeglob readonly */
9212 S_gv_share(pTHX_ SV *sstr, CLONE_PARAMS *param)
9215 SV *sv = ¶m->proto_perl->Isv_no; /* just need SvREADONLY-ness */
9217 if (GvIO(gv) || GvFORM(gv)) {
9218 GvUNIQUE_off(gv); /* GvIOs cannot be shared. nor can GvFORMs */
9220 else if (!GvCV(gv)) {
9224 /* CvPADLISTs cannot be shared */
9225 if (!SvREADONLY(GvCV(gv)) && !CvXSUB(GvCV(gv))) {
9230 if (!GvUNIQUE(gv)) {
9232 PerlIO_printf(Perl_debug_log, "gv_share: unable to share %s::%s\n",
9233 HvNAME(GvSTASH(gv)), GvNAME(gv));
9239 * write attempts will die with
9240 * "Modification of a read-only value attempted"
9246 SvREADONLY_on(GvSV(gv));
9253 SvREADONLY_on(GvAV(gv));
9260 SvREADONLY_on(GvAV(gv));
9263 return sstr; /* he_dup() will SvREFCNT_inc() */
9266 /* duplicate an SV of any type (including AV, HV etc) */
9269 Perl_rvpv_dup(pTHX_ SV *dstr, SV *sstr, CLONE_PARAMS* param)
9272 SvRV(dstr) = SvWEAKREF(sstr)
9273 ? sv_dup(SvRV(sstr), param)
9274 : sv_dup_inc(SvRV(sstr), param);
9276 else if (SvPVX(sstr)) {
9277 /* Has something there */
9279 /* Normal PV - clone whole allocated space */
9280 SvPVX(dstr) = SAVEPVN(SvPVX(sstr), SvLEN(sstr)-1);
9281 if (SvREADONLY(sstr) && SvFAKE(sstr)) {
9282 /* Not that normal - actually sstr is copy on write.
9283 But we are a true, independant SV, so: */
9284 SvREADONLY_off(dstr);
9289 /* Special case - not normally malloced for some reason */
9290 if (SvREADONLY(sstr) && SvFAKE(sstr)) {
9291 /* A "shared" PV - clone it as unshared string */
9293 SvREADONLY_off(dstr);
9294 SvPVX(dstr) = SAVEPVN(SvPVX(sstr), SvCUR(sstr));
9297 /* Some other special case - random pointer */
9298 SvPVX(dstr) = SvPVX(sstr);
9304 SvPVX(dstr) = SvPVX(sstr);
9309 Perl_sv_dup(pTHX_ SV *sstr, CLONE_PARAMS* param)
9313 if (!sstr || SvTYPE(sstr) == SVTYPEMASK)
9315 /* look for it in the table first */
9316 dstr = (SV*)ptr_table_fetch(PL_ptr_table, sstr);
9320 /* create anew and remember what it is */
9322 ptr_table_store(PL_ptr_table, sstr, dstr);
9325 SvFLAGS(dstr) = SvFLAGS(sstr);
9326 SvFLAGS(dstr) &= ~SVf_OOK; /* don't propagate OOK hack */
9327 SvREFCNT(dstr) = 0; /* must be before any other dups! */
9330 if (SvANY(sstr) && PL_watch_pvx && SvPVX(sstr) == PL_watch_pvx)
9331 PerlIO_printf(Perl_debug_log, "watch at %p hit, found string \"%s\"\n",
9332 PL_watch_pvx, SvPVX(sstr));
9335 switch (SvTYPE(sstr)) {
9340 SvANY(dstr) = new_XIV();
9341 SvIVX(dstr) = SvIVX(sstr);
9344 SvANY(dstr) = new_XNV();
9345 SvNVX(dstr) = SvNVX(sstr);
9348 SvANY(dstr) = new_XRV();
9349 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
9352 SvANY(dstr) = new_XPV();
9353 SvCUR(dstr) = SvCUR(sstr);
9354 SvLEN(dstr) = SvLEN(sstr);
9355 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
9358 SvANY(dstr) = new_XPVIV();
9359 SvCUR(dstr) = SvCUR(sstr);
9360 SvLEN(dstr) = SvLEN(sstr);
9361 SvIVX(dstr) = SvIVX(sstr);
9362 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
9365 SvANY(dstr) = new_XPVNV();
9366 SvCUR(dstr) = SvCUR(sstr);
9367 SvLEN(dstr) = SvLEN(sstr);
9368 SvIVX(dstr) = SvIVX(sstr);
9369 SvNVX(dstr) = SvNVX(sstr);
9370 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
9373 SvANY(dstr) = new_XPVMG();
9374 SvCUR(dstr) = SvCUR(sstr);
9375 SvLEN(dstr) = SvLEN(sstr);
9376 SvIVX(dstr) = SvIVX(sstr);
9377 SvNVX(dstr) = SvNVX(sstr);
9378 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr), param);
9379 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr), param);
9380 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
9383 SvANY(dstr) = new_XPVBM();
9384 SvCUR(dstr) = SvCUR(sstr);
9385 SvLEN(dstr) = SvLEN(sstr);
9386 SvIVX(dstr) = SvIVX(sstr);
9387 SvNVX(dstr) = SvNVX(sstr);
9388 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr), param);
9389 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr), param);
9390 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
9391 BmRARE(dstr) = BmRARE(sstr);
9392 BmUSEFUL(dstr) = BmUSEFUL(sstr);
9393 BmPREVIOUS(dstr)= BmPREVIOUS(sstr);
9396 SvANY(dstr) = new_XPVLV();
9397 SvCUR(dstr) = SvCUR(sstr);
9398 SvLEN(dstr) = SvLEN(sstr);
9399 SvIVX(dstr) = SvIVX(sstr);
9400 SvNVX(dstr) = SvNVX(sstr);
9401 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr), param);
9402 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr), param);
9403 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
9404 LvTARGOFF(dstr) = LvTARGOFF(sstr); /* XXX sometimes holds PMOP* when DEBUGGING */
9405 LvTARGLEN(dstr) = LvTARGLEN(sstr);
9406 LvTARG(dstr) = sv_dup_inc(LvTARG(sstr), param);
9407 LvTYPE(dstr) = LvTYPE(sstr);
9410 if (GvUNIQUE((GV*)sstr)) {
9412 if ((share = gv_share(sstr, param))) {
9415 ptr_table_store(PL_ptr_table, sstr, dstr);
9417 PerlIO_printf(Perl_debug_log, "sv_dup: sharing %s::%s\n",
9418 HvNAME(GvSTASH(share)), GvNAME(share));
9423 SvANY(dstr) = new_XPVGV();
9424 SvCUR(dstr) = SvCUR(sstr);
9425 SvLEN(dstr) = SvLEN(sstr);
9426 SvIVX(dstr) = SvIVX(sstr);
9427 SvNVX(dstr) = SvNVX(sstr);
9428 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr), param);
9429 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr), param);
9430 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
9431 GvNAMELEN(dstr) = GvNAMELEN(sstr);
9432 GvNAME(dstr) = SAVEPVN(GvNAME(sstr), GvNAMELEN(sstr));
9433 GvSTASH(dstr) = hv_dup_inc(GvSTASH(sstr), param);
9434 GvFLAGS(dstr) = GvFLAGS(sstr);
9435 GvGP(dstr) = gp_dup(GvGP(sstr), param);
9436 (void)GpREFCNT_inc(GvGP(dstr));
9439 SvANY(dstr) = new_XPVIO();
9440 SvCUR(dstr) = SvCUR(sstr);
9441 SvLEN(dstr) = SvLEN(sstr);
9442 SvIVX(dstr) = SvIVX(sstr);
9443 SvNVX(dstr) = SvNVX(sstr);
9444 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr), param);
9445 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr), param);
9446 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
9447 IoIFP(dstr) = fp_dup(IoIFP(sstr), IoTYPE(sstr), param);
9448 if (IoOFP(sstr) == IoIFP(sstr))
9449 IoOFP(dstr) = IoIFP(dstr);
9451 IoOFP(dstr) = fp_dup(IoOFP(sstr), IoTYPE(sstr), param);
9452 /* PL_rsfp_filters entries have fake IoDIRP() */
9453 if (IoDIRP(sstr) && !(IoFLAGS(sstr) & IOf_FAKE_DIRP))
9454 IoDIRP(dstr) = dirp_dup(IoDIRP(sstr));
9456 IoDIRP(dstr) = IoDIRP(sstr);
9457 IoLINES(dstr) = IoLINES(sstr);
9458 IoPAGE(dstr) = IoPAGE(sstr);
9459 IoPAGE_LEN(dstr) = IoPAGE_LEN(sstr);
9460 IoLINES_LEFT(dstr) = IoLINES_LEFT(sstr);
9461 IoTOP_NAME(dstr) = SAVEPV(IoTOP_NAME(sstr));
9462 IoTOP_GV(dstr) = gv_dup(IoTOP_GV(sstr), param);
9463 IoFMT_NAME(dstr) = SAVEPV(IoFMT_NAME(sstr));
9464 IoFMT_GV(dstr) = gv_dup(IoFMT_GV(sstr), param);
9465 IoBOTTOM_NAME(dstr) = SAVEPV(IoBOTTOM_NAME(sstr));
9466 IoBOTTOM_GV(dstr) = gv_dup(IoBOTTOM_GV(sstr), param);
9467 IoSUBPROCESS(dstr) = IoSUBPROCESS(sstr);
9468 IoTYPE(dstr) = IoTYPE(sstr);
9469 IoFLAGS(dstr) = IoFLAGS(sstr);
9472 SvANY(dstr) = new_XPVAV();
9473 SvCUR(dstr) = SvCUR(sstr);
9474 SvLEN(dstr) = SvLEN(sstr);
9475 SvIVX(dstr) = SvIVX(sstr);
9476 SvNVX(dstr) = SvNVX(sstr);
9477 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr), param);
9478 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr), param);
9479 AvARYLEN((AV*)dstr) = sv_dup_inc(AvARYLEN((AV*)sstr), param);
9480 AvFLAGS((AV*)dstr) = AvFLAGS((AV*)sstr);
9481 if (AvARRAY((AV*)sstr)) {
9482 SV **dst_ary, **src_ary;
9483 SSize_t items = AvFILLp((AV*)sstr) + 1;
9485 src_ary = AvARRAY((AV*)sstr);
9486 Newz(0, dst_ary, AvMAX((AV*)sstr)+1, SV*);
9487 ptr_table_store(PL_ptr_table, src_ary, dst_ary);
9488 SvPVX(dstr) = (char*)dst_ary;
9489 AvALLOC((AV*)dstr) = dst_ary;
9490 if (AvREAL((AV*)sstr)) {
9492 *dst_ary++ = sv_dup_inc(*src_ary++, param);
9496 *dst_ary++ = sv_dup(*src_ary++, param);
9498 items = AvMAX((AV*)sstr) - AvFILLp((AV*)sstr);
9499 while (items-- > 0) {
9500 *dst_ary++ = &PL_sv_undef;
9504 SvPVX(dstr) = Nullch;
9505 AvALLOC((AV*)dstr) = (SV**)NULL;
9509 SvANY(dstr) = new_XPVHV();
9510 SvCUR(dstr) = SvCUR(sstr);
9511 SvLEN(dstr) = SvLEN(sstr);
9512 SvIVX(dstr) = SvIVX(sstr);
9513 SvNVX(dstr) = SvNVX(sstr);
9514 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr), param);
9515 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr), param);
9516 HvRITER((HV*)dstr) = HvRITER((HV*)sstr);
9517 if (HvARRAY((HV*)sstr)) {
9519 XPVHV *dxhv = (XPVHV*)SvANY(dstr);
9520 XPVHV *sxhv = (XPVHV*)SvANY(sstr);
9521 Newz(0, dxhv->xhv_array,
9522 PERL_HV_ARRAY_ALLOC_BYTES(dxhv->xhv_max+1), char);
9523 while (i <= sxhv->xhv_max) {
9524 ((HE**)dxhv->xhv_array)[i] = he_dup(((HE**)sxhv->xhv_array)[i],
9525 (bool)!!HvSHAREKEYS(sstr),
9529 dxhv->xhv_eiter = he_dup(sxhv->xhv_eiter,
9530 (bool)!!HvSHAREKEYS(sstr), param);
9533 SvPVX(dstr) = Nullch;
9534 HvEITER((HV*)dstr) = (HE*)NULL;
9536 HvPMROOT((HV*)dstr) = HvPMROOT((HV*)sstr); /* XXX */
9537 HvNAME((HV*)dstr) = SAVEPV(HvNAME((HV*)sstr));
9538 /* Record stashes for possible cloning in Perl_clone(). */
9539 if(HvNAME((HV*)dstr))
9540 av_push(param->stashes, dstr);
9543 SvANY(dstr) = new_XPVFM();
9544 FmLINES(dstr) = FmLINES(sstr);
9548 SvANY(dstr) = new_XPVCV();
9550 SvCUR(dstr) = SvCUR(sstr);
9551 SvLEN(dstr) = SvLEN(sstr);
9552 SvIVX(dstr) = SvIVX(sstr);
9553 SvNVX(dstr) = SvNVX(sstr);
9554 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr), param);
9555 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr), param);
9556 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
9557 CvSTASH(dstr) = hv_dup(CvSTASH(sstr), param); /* NOTE: not refcounted */
9558 CvSTART(dstr) = CvSTART(sstr);
9559 CvROOT(dstr) = OpREFCNT_inc(CvROOT(sstr));
9560 CvXSUB(dstr) = CvXSUB(sstr);
9561 CvXSUBANY(dstr) = CvXSUBANY(sstr);
9562 if (CvCONST(sstr)) {
9563 CvXSUBANY(dstr).any_ptr = GvUNIQUE(CvGV(sstr)) ?
9564 SvREFCNT_inc(CvXSUBANY(sstr).any_ptr) :
9565 sv_dup_inc(CvXSUBANY(sstr).any_ptr, param);
9567 CvGV(dstr) = gv_dup(CvGV(sstr), param);
9568 if (param->flags & CLONEf_COPY_STACKS) {
9569 CvDEPTH(dstr) = CvDEPTH(sstr);
9573 if (CvPADLIST(sstr) && !AvREAL(CvPADLIST(sstr))) {
9574 /* XXX padlists are real, but pretend to be not */
9575 AvREAL_on(CvPADLIST(sstr));
9576 CvPADLIST(dstr) = av_dup_inc(CvPADLIST(sstr), param);
9577 AvREAL_off(CvPADLIST(sstr));
9578 AvREAL_off(CvPADLIST(dstr));
9581 CvPADLIST(dstr) = av_dup_inc(CvPADLIST(sstr), param);
9582 if (!CvANON(sstr) || CvCLONED(sstr))
9583 CvOUTSIDE(dstr) = cv_dup_inc(CvOUTSIDE(sstr), param);
9585 CvOUTSIDE(dstr) = cv_dup(CvOUTSIDE(sstr), param);
9586 CvFLAGS(dstr) = CvFLAGS(sstr);
9587 CvFILE(dstr) = CvXSUB(sstr) ? CvFILE(sstr) : SAVEPV(CvFILE(sstr));
9590 Perl_croak(aTHX_ "Bizarre SvTYPE [%" IVdf "]", (IV)SvTYPE(sstr));
9594 if (SvOBJECT(dstr) && SvTYPE(dstr) != SVt_PVIO)
9600 /* duplicate a context */
9603 Perl_cx_dup(pTHX_ PERL_CONTEXT *cxs, I32 ix, I32 max, CLONE_PARAMS* param)
9608 return (PERL_CONTEXT*)NULL;
9610 /* look for it in the table first */
9611 ncxs = (PERL_CONTEXT*)ptr_table_fetch(PL_ptr_table, cxs);
9615 /* create anew and remember what it is */
9616 Newz(56, ncxs, max + 1, PERL_CONTEXT);
9617 ptr_table_store(PL_ptr_table, cxs, ncxs);
9620 PERL_CONTEXT *cx = &cxs[ix];
9621 PERL_CONTEXT *ncx = &ncxs[ix];
9622 ncx->cx_type = cx->cx_type;
9623 if (CxTYPE(cx) == CXt_SUBST) {
9624 Perl_croak(aTHX_ "Cloning substitution context is unimplemented");
9627 ncx->blk_oldsp = cx->blk_oldsp;
9628 ncx->blk_oldcop = cx->blk_oldcop;
9629 ncx->blk_oldretsp = cx->blk_oldretsp;
9630 ncx->blk_oldmarksp = cx->blk_oldmarksp;
9631 ncx->blk_oldscopesp = cx->blk_oldscopesp;
9632 ncx->blk_oldpm = cx->blk_oldpm;
9633 ncx->blk_gimme = cx->blk_gimme;
9634 switch (CxTYPE(cx)) {
9636 ncx->blk_sub.cv = (cx->blk_sub.olddepth == 0
9637 ? cv_dup_inc(cx->blk_sub.cv, param)
9638 : cv_dup(cx->blk_sub.cv,param));
9639 ncx->blk_sub.argarray = (cx->blk_sub.hasargs
9640 ? av_dup_inc(cx->blk_sub.argarray, param)
9642 ncx->blk_sub.savearray = av_dup_inc(cx->blk_sub.savearray, param);
9643 ncx->blk_sub.olddepth = cx->blk_sub.olddepth;
9644 ncx->blk_sub.hasargs = cx->blk_sub.hasargs;
9645 ncx->blk_sub.lval = cx->blk_sub.lval;
9648 ncx->blk_eval.old_in_eval = cx->blk_eval.old_in_eval;
9649 ncx->blk_eval.old_op_type = cx->blk_eval.old_op_type;
9650 ncx->blk_eval.old_namesv = sv_dup_inc(cx->blk_eval.old_namesv, param);
9651 ncx->blk_eval.old_eval_root = cx->blk_eval.old_eval_root;
9652 ncx->blk_eval.cur_text = sv_dup(cx->blk_eval.cur_text, param);
9655 ncx->blk_loop.label = cx->blk_loop.label;
9656 ncx->blk_loop.resetsp = cx->blk_loop.resetsp;
9657 ncx->blk_loop.redo_op = cx->blk_loop.redo_op;
9658 ncx->blk_loop.next_op = cx->blk_loop.next_op;
9659 ncx->blk_loop.last_op = cx->blk_loop.last_op;
9660 ncx->blk_loop.iterdata = (CxPADLOOP(cx)
9661 ? cx->blk_loop.iterdata
9662 : gv_dup((GV*)cx->blk_loop.iterdata, param));
9663 ncx->blk_loop.oldcurpad
9664 = (SV**)ptr_table_fetch(PL_ptr_table,
9665 cx->blk_loop.oldcurpad);
9666 ncx->blk_loop.itersave = sv_dup_inc(cx->blk_loop.itersave, param);
9667 ncx->blk_loop.iterlval = sv_dup_inc(cx->blk_loop.iterlval, param);
9668 ncx->blk_loop.iterary = av_dup_inc(cx->blk_loop.iterary, param);
9669 ncx->blk_loop.iterix = cx->blk_loop.iterix;
9670 ncx->blk_loop.itermax = cx->blk_loop.itermax;
9673 ncx->blk_sub.cv = cv_dup(cx->blk_sub.cv, param);
9674 ncx->blk_sub.gv = gv_dup(cx->blk_sub.gv, param);
9675 ncx->blk_sub.dfoutgv = gv_dup_inc(cx->blk_sub.dfoutgv, param);
9676 ncx->blk_sub.hasargs = cx->blk_sub.hasargs;
9688 /* duplicate a stack info structure */
9691 Perl_si_dup(pTHX_ PERL_SI *si, CLONE_PARAMS* param)
9696 return (PERL_SI*)NULL;
9698 /* look for it in the table first */
9699 nsi = (PERL_SI*)ptr_table_fetch(PL_ptr_table, si);
9703 /* create anew and remember what it is */
9704 Newz(56, nsi, 1, PERL_SI);
9705 ptr_table_store(PL_ptr_table, si, nsi);
9707 nsi->si_stack = av_dup_inc(si->si_stack, param);
9708 nsi->si_cxix = si->si_cxix;
9709 nsi->si_cxmax = si->si_cxmax;
9710 nsi->si_cxstack = cx_dup(si->si_cxstack, si->si_cxix, si->si_cxmax, param);
9711 nsi->si_type = si->si_type;
9712 nsi->si_prev = si_dup(si->si_prev, param);
9713 nsi->si_next = si_dup(si->si_next, param);
9714 nsi->si_markoff = si->si_markoff;
9719 #define POPINT(ss,ix) ((ss)[--(ix)].any_i32)
9720 #define TOPINT(ss,ix) ((ss)[ix].any_i32)
9721 #define POPLONG(ss,ix) ((ss)[--(ix)].any_long)
9722 #define TOPLONG(ss,ix) ((ss)[ix].any_long)
9723 #define POPIV(ss,ix) ((ss)[--(ix)].any_iv)
9724 #define TOPIV(ss,ix) ((ss)[ix].any_iv)
9725 #define POPPTR(ss,ix) ((ss)[--(ix)].any_ptr)
9726 #define TOPPTR(ss,ix) ((ss)[ix].any_ptr)
9727 #define POPDPTR(ss,ix) ((ss)[--(ix)].any_dptr)
9728 #define TOPDPTR(ss,ix) ((ss)[ix].any_dptr)
9729 #define POPDXPTR(ss,ix) ((ss)[--(ix)].any_dxptr)
9730 #define TOPDXPTR(ss,ix) ((ss)[ix].any_dxptr)
9733 #define pv_dup_inc(p) SAVEPV(p)
9734 #define pv_dup(p) SAVEPV(p)
9735 #define svp_dup_inc(p,pp) any_dup(p,pp)
9737 /* map any object to the new equivent - either something in the
9738 * ptr table, or something in the interpreter structure
9742 Perl_any_dup(pTHX_ void *v, PerlInterpreter *proto_perl)
9749 /* look for it in the table first */
9750 ret = ptr_table_fetch(PL_ptr_table, v);
9754 /* see if it is part of the interpreter structure */
9755 if (v >= (void*)proto_perl && v < (void*)(proto_perl+1))
9756 ret = (void*)(((char*)aTHX) + (((char*)v) - (char*)proto_perl));
9764 /* duplicate the save stack */
9767 Perl_ss_dup(pTHX_ PerlInterpreter *proto_perl, CLONE_PARAMS* param)
9769 ANY *ss = proto_perl->Tsavestack;
9770 I32 ix = proto_perl->Tsavestack_ix;
9771 I32 max = proto_perl->Tsavestack_max;
9784 void (*dptr) (void*);
9785 void (*dxptr) (pTHX_ void*);
9788 Newz(54, nss, max, ANY);
9794 case SAVEt_ITEM: /* normal string */
9795 sv = (SV*)POPPTR(ss,ix);
9796 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
9797 sv = (SV*)POPPTR(ss,ix);
9798 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
9800 case SAVEt_SV: /* scalar reference */
9801 sv = (SV*)POPPTR(ss,ix);
9802 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
9803 gv = (GV*)POPPTR(ss,ix);
9804 TOPPTR(nss,ix) = gv_dup_inc(gv, param);
9806 case SAVEt_GENERIC_PVREF: /* generic char* */
9807 c = (char*)POPPTR(ss,ix);
9808 TOPPTR(nss,ix) = pv_dup(c);
9809 ptr = POPPTR(ss,ix);
9810 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
9812 case SAVEt_SHARED_PVREF: /* char* in shared space */
9813 c = (char*)POPPTR(ss,ix);
9814 TOPPTR(nss,ix) = savesharedpv(c);
9815 ptr = POPPTR(ss,ix);
9816 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
9818 case SAVEt_GENERIC_SVREF: /* generic sv */
9819 case SAVEt_SVREF: /* scalar reference */
9820 sv = (SV*)POPPTR(ss,ix);
9821 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
9822 ptr = POPPTR(ss,ix);
9823 TOPPTR(nss,ix) = svp_dup_inc((SV**)ptr, proto_perl);/* XXXXX */
9825 case SAVEt_AV: /* array reference */
9826 av = (AV*)POPPTR(ss,ix);
9827 TOPPTR(nss,ix) = av_dup_inc(av, param);
9828 gv = (GV*)POPPTR(ss,ix);
9829 TOPPTR(nss,ix) = gv_dup(gv, param);
9831 case SAVEt_HV: /* hash reference */
9832 hv = (HV*)POPPTR(ss,ix);
9833 TOPPTR(nss,ix) = hv_dup_inc(hv, param);
9834 gv = (GV*)POPPTR(ss,ix);
9835 TOPPTR(nss,ix) = gv_dup(gv, param);
9837 case SAVEt_INT: /* int reference */
9838 ptr = POPPTR(ss,ix);
9839 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
9840 intval = (int)POPINT(ss,ix);
9841 TOPINT(nss,ix) = intval;
9843 case SAVEt_LONG: /* long reference */
9844 ptr = POPPTR(ss,ix);
9845 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
9846 longval = (long)POPLONG(ss,ix);
9847 TOPLONG(nss,ix) = longval;
9849 case SAVEt_I32: /* I32 reference */
9850 case SAVEt_I16: /* I16 reference */
9851 case SAVEt_I8: /* I8 reference */
9852 ptr = POPPTR(ss,ix);
9853 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
9857 case SAVEt_IV: /* IV reference */
9858 ptr = POPPTR(ss,ix);
9859 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
9863 case SAVEt_SPTR: /* SV* reference */
9864 ptr = POPPTR(ss,ix);
9865 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
9866 sv = (SV*)POPPTR(ss,ix);
9867 TOPPTR(nss,ix) = sv_dup(sv, param);
9869 case SAVEt_VPTR: /* random* reference */
9870 ptr = POPPTR(ss,ix);
9871 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
9872 ptr = POPPTR(ss,ix);
9873 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
9875 case SAVEt_PPTR: /* char* reference */
9876 ptr = POPPTR(ss,ix);
9877 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
9878 c = (char*)POPPTR(ss,ix);
9879 TOPPTR(nss,ix) = pv_dup(c);
9881 case SAVEt_HPTR: /* HV* reference */
9882 ptr = POPPTR(ss,ix);
9883 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
9884 hv = (HV*)POPPTR(ss,ix);
9885 TOPPTR(nss,ix) = hv_dup(hv, param);
9887 case SAVEt_APTR: /* AV* reference */
9888 ptr = POPPTR(ss,ix);
9889 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
9890 av = (AV*)POPPTR(ss,ix);
9891 TOPPTR(nss,ix) = av_dup(av, param);
9894 gv = (GV*)POPPTR(ss,ix);
9895 TOPPTR(nss,ix) = gv_dup(gv, param);
9897 case SAVEt_GP: /* scalar reference */
9898 gp = (GP*)POPPTR(ss,ix);
9899 TOPPTR(nss,ix) = gp = gp_dup(gp, param);
9900 (void)GpREFCNT_inc(gp);
9901 gv = (GV*)POPPTR(ss,ix);
9902 TOPPTR(nss,ix) = gv_dup_inc(gv, param);
9903 c = (char*)POPPTR(ss,ix);
9904 TOPPTR(nss,ix) = pv_dup(c);
9911 case SAVEt_MORTALIZESV:
9912 sv = (SV*)POPPTR(ss,ix);
9913 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
9916 ptr = POPPTR(ss,ix);
9917 if (ptr && (((OP*)ptr)->op_private & OPpREFCOUNTED)) {
9918 /* these are assumed to be refcounted properly */
9919 switch (((OP*)ptr)->op_type) {
9926 TOPPTR(nss,ix) = ptr;
9931 TOPPTR(nss,ix) = Nullop;
9936 TOPPTR(nss,ix) = Nullop;
9939 c = (char*)POPPTR(ss,ix);
9940 TOPPTR(nss,ix) = pv_dup_inc(c);
9943 longval = POPLONG(ss,ix);
9944 TOPLONG(nss,ix) = longval;
9947 hv = (HV*)POPPTR(ss,ix);
9948 TOPPTR(nss,ix) = hv_dup_inc(hv, param);
9949 c = (char*)POPPTR(ss,ix);
9950 TOPPTR(nss,ix) = pv_dup_inc(c);
9954 case SAVEt_DESTRUCTOR:
9955 ptr = POPPTR(ss,ix);
9956 TOPPTR(nss,ix) = any_dup(ptr, proto_perl); /* XXX quite arbitrary */
9957 dptr = POPDPTR(ss,ix);
9958 TOPDPTR(nss,ix) = (void (*)(void*))any_dup((void *)dptr, proto_perl);
9960 case SAVEt_DESTRUCTOR_X:
9961 ptr = POPPTR(ss,ix);
9962 TOPPTR(nss,ix) = any_dup(ptr, proto_perl); /* XXX quite arbitrary */
9963 dxptr = POPDXPTR(ss,ix);
9964 TOPDXPTR(nss,ix) = (void (*)(pTHX_ void*))any_dup((void *)dxptr, proto_perl);
9966 case SAVEt_REGCONTEXT:
9972 case SAVEt_STACK_POS: /* Position on Perl stack */
9976 case SAVEt_AELEM: /* array element */
9977 sv = (SV*)POPPTR(ss,ix);
9978 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
9981 av = (AV*)POPPTR(ss,ix);
9982 TOPPTR(nss,ix) = av_dup_inc(av, param);
9984 case SAVEt_HELEM: /* hash element */
9985 sv = (SV*)POPPTR(ss,ix);
9986 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
9987 sv = (SV*)POPPTR(ss,ix);
9988 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
9989 hv = (HV*)POPPTR(ss,ix);
9990 TOPPTR(nss,ix) = hv_dup_inc(hv, param);
9993 ptr = POPPTR(ss,ix);
9994 TOPPTR(nss,ix) = ptr;
10000 case SAVEt_COMPPAD:
10001 av = (AV*)POPPTR(ss,ix);
10002 TOPPTR(nss,ix) = av_dup(av, param);
10005 longval = (long)POPLONG(ss,ix);
10006 TOPLONG(nss,ix) = longval;
10007 ptr = POPPTR(ss,ix);
10008 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10009 sv = (SV*)POPPTR(ss,ix);
10010 TOPPTR(nss,ix) = sv_dup(sv, param);
10013 Perl_croak(aTHX_ "panic: ss_dup inconsistency");
10021 =for apidoc perl_clone
10023 Create and return a new interpreter by cloning the current one.
10028 /* XXX the above needs expanding by someone who actually understands it ! */
10029 EXTERN_C PerlInterpreter *
10030 perl_clone_host(PerlInterpreter* proto_perl, UV flags);
10033 perl_clone(PerlInterpreter *proto_perl, UV flags)
10035 #ifdef PERL_IMPLICIT_SYS
10037 /* perlhost.h so we need to call into it
10038 to clone the host, CPerlHost should have a c interface, sky */
10040 if (flags & CLONEf_CLONE_HOST) {
10041 return perl_clone_host(proto_perl,flags);
10043 return perl_clone_using(proto_perl, flags,
10045 proto_perl->IMemShared,
10046 proto_perl->IMemParse,
10048 proto_perl->IStdIO,
10052 proto_perl->IProc);
10056 perl_clone_using(PerlInterpreter *proto_perl, UV flags,
10057 struct IPerlMem* ipM, struct IPerlMem* ipMS,
10058 struct IPerlMem* ipMP, struct IPerlEnv* ipE,
10059 struct IPerlStdIO* ipStd, struct IPerlLIO* ipLIO,
10060 struct IPerlDir* ipD, struct IPerlSock* ipS,
10061 struct IPerlProc* ipP)
10063 /* XXX many of the string copies here can be optimized if they're
10064 * constants; they need to be allocated as common memory and just
10065 * their pointers copied. */
10068 CLONE_PARAMS clone_params;
10069 CLONE_PARAMS* param = &clone_params;
10071 PerlInterpreter *my_perl = (PerlInterpreter*)(*ipM->pMalloc)(ipM, sizeof(PerlInterpreter));
10072 PERL_SET_THX(my_perl);
10075 Poison(my_perl, 1, PerlInterpreter);
10080 PL_sig_pending = 0;
10081 Zero(&PL_debug_pad, 1, struct perl_debug_pad);
10082 # else /* !DEBUGGING */
10083 Zero(my_perl, 1, PerlInterpreter);
10084 # endif /* DEBUGGING */
10086 /* host pointers */
10088 PL_MemShared = ipMS;
10089 PL_MemParse = ipMP;
10096 #else /* !PERL_IMPLICIT_SYS */
10098 CLONE_PARAMS clone_params;
10099 CLONE_PARAMS* param = &clone_params;
10100 PerlInterpreter *my_perl = (PerlInterpreter*)PerlMem_malloc(sizeof(PerlInterpreter));
10101 PERL_SET_THX(my_perl);
10106 Poison(my_perl, 1, PerlInterpreter);
10111 PL_sig_pending = 0;
10112 Zero(&PL_debug_pad, 1, struct perl_debug_pad);
10113 # else /* !DEBUGGING */
10114 Zero(my_perl, 1, PerlInterpreter);
10115 # endif /* DEBUGGING */
10116 #endif /* PERL_IMPLICIT_SYS */
10117 param->flags = flags;
10118 param->proto_perl = proto_perl;
10121 PL_xiv_arenaroot = NULL;
10122 PL_xiv_root = NULL;
10123 PL_xnv_arenaroot = NULL;
10124 PL_xnv_root = NULL;
10125 PL_xrv_arenaroot = NULL;
10126 PL_xrv_root = NULL;
10127 PL_xpv_arenaroot = NULL;
10128 PL_xpv_root = NULL;
10129 PL_xpviv_arenaroot = NULL;
10130 PL_xpviv_root = NULL;
10131 PL_xpvnv_arenaroot = NULL;
10132 PL_xpvnv_root = NULL;
10133 PL_xpvcv_arenaroot = NULL;
10134 PL_xpvcv_root = NULL;
10135 PL_xpvav_arenaroot = NULL;
10136 PL_xpvav_root = NULL;
10137 PL_xpvhv_arenaroot = NULL;
10138 PL_xpvhv_root = NULL;
10139 PL_xpvmg_arenaroot = NULL;
10140 PL_xpvmg_root = NULL;
10141 PL_xpvlv_arenaroot = NULL;
10142 PL_xpvlv_root = NULL;
10143 PL_xpvbm_arenaroot = NULL;
10144 PL_xpvbm_root = NULL;
10145 PL_he_arenaroot = NULL;
10147 PL_nice_chunk = NULL;
10148 PL_nice_chunk_size = 0;
10150 PL_sv_objcount = 0;
10151 PL_sv_root = Nullsv;
10152 PL_sv_arenaroot = Nullsv;
10154 PL_debug = proto_perl->Idebug;
10156 #ifdef USE_REENTRANT_API
10157 Perl_reentrant_init(aTHX);
10160 /* create SV map for pointer relocation */
10161 PL_ptr_table = ptr_table_new();
10163 /* initialize these special pointers as early as possible */
10164 SvANY(&PL_sv_undef) = NULL;
10165 SvREFCNT(&PL_sv_undef) = (~(U32)0)/2;
10166 SvFLAGS(&PL_sv_undef) = SVf_READONLY|SVt_NULL;
10167 ptr_table_store(PL_ptr_table, &proto_perl->Isv_undef, &PL_sv_undef);
10169 SvANY(&PL_sv_no) = new_XPVNV();
10170 SvREFCNT(&PL_sv_no) = (~(U32)0)/2;
10171 SvFLAGS(&PL_sv_no) = SVp_NOK|SVf_NOK|SVp_POK|SVf_POK|SVf_READONLY|SVt_PVNV;
10172 SvPVX(&PL_sv_no) = SAVEPVN(PL_No, 0);
10173 SvCUR(&PL_sv_no) = 0;
10174 SvLEN(&PL_sv_no) = 1;
10175 SvNVX(&PL_sv_no) = 0;
10176 ptr_table_store(PL_ptr_table, &proto_perl->Isv_no, &PL_sv_no);
10178 SvANY(&PL_sv_yes) = new_XPVNV();
10179 SvREFCNT(&PL_sv_yes) = (~(U32)0)/2;
10180 SvFLAGS(&PL_sv_yes) = SVp_NOK|SVf_NOK|SVp_POK|SVf_POK|SVf_READONLY|SVt_PVNV;
10181 SvPVX(&PL_sv_yes) = SAVEPVN(PL_Yes, 1);
10182 SvCUR(&PL_sv_yes) = 1;
10183 SvLEN(&PL_sv_yes) = 2;
10184 SvNVX(&PL_sv_yes) = 1;
10185 ptr_table_store(PL_ptr_table, &proto_perl->Isv_yes, &PL_sv_yes);
10187 /* create (a non-shared!) shared string table */
10188 PL_strtab = newHV();
10189 HvSHAREKEYS_off(PL_strtab);
10190 hv_ksplit(PL_strtab, 512);
10191 ptr_table_store(PL_ptr_table, proto_perl->Istrtab, PL_strtab);
10193 PL_compiling = proto_perl->Icompiling;
10195 /* These two PVs will be free'd special way so must set them same way op.c does */
10196 PL_compiling.cop_stashpv = savesharedpv(PL_compiling.cop_stashpv);
10197 ptr_table_store(PL_ptr_table, proto_perl->Icompiling.cop_stashpv, PL_compiling.cop_stashpv);
10199 PL_compiling.cop_file = savesharedpv(PL_compiling.cop_file);
10200 ptr_table_store(PL_ptr_table, proto_perl->Icompiling.cop_file, PL_compiling.cop_file);
10202 ptr_table_store(PL_ptr_table, &proto_perl->Icompiling, &PL_compiling);
10203 if (!specialWARN(PL_compiling.cop_warnings))
10204 PL_compiling.cop_warnings = sv_dup_inc(PL_compiling.cop_warnings, param);
10205 if (!specialCopIO(PL_compiling.cop_io))
10206 PL_compiling.cop_io = sv_dup_inc(PL_compiling.cop_io, param);
10207 PL_curcop = (COP*)any_dup(proto_perl->Tcurcop, proto_perl);
10209 /* pseudo environmental stuff */
10210 PL_origargc = proto_perl->Iorigargc;
10212 New(0, PL_origargv, i+1, char*);
10213 PL_origargv[i] = '\0';
10215 PL_origargv[i] = SAVEPV(proto_perl->Iorigargv[i]);
10218 param->stashes = newAV(); /* Setup array of objects to call clone on */
10220 #ifdef PERLIO_LAYERS
10221 /* Clone PerlIO tables as soon as we can handle general xx_dup() */
10222 PerlIO_clone(aTHX_ proto_perl, param);
10225 PL_envgv = gv_dup(proto_perl->Ienvgv, param);
10226 PL_incgv = gv_dup(proto_perl->Iincgv, param);
10227 PL_hintgv = gv_dup(proto_perl->Ihintgv, param);
10228 PL_origfilename = SAVEPV(proto_perl->Iorigfilename);
10229 PL_diehook = sv_dup_inc(proto_perl->Idiehook, param);
10230 PL_warnhook = sv_dup_inc(proto_perl->Iwarnhook, param);
10233 PL_minus_c = proto_perl->Iminus_c;
10234 PL_patchlevel = sv_dup_inc(proto_perl->Ipatchlevel, param);
10235 PL_localpatches = proto_perl->Ilocalpatches;
10236 PL_splitstr = proto_perl->Isplitstr;
10237 PL_preprocess = proto_perl->Ipreprocess;
10238 PL_minus_n = proto_perl->Iminus_n;
10239 PL_minus_p = proto_perl->Iminus_p;
10240 PL_minus_l = proto_perl->Iminus_l;
10241 PL_minus_a = proto_perl->Iminus_a;
10242 PL_minus_F = proto_perl->Iminus_F;
10243 PL_doswitches = proto_perl->Idoswitches;
10244 PL_dowarn = proto_perl->Idowarn;
10245 PL_doextract = proto_perl->Idoextract;
10246 PL_sawampersand = proto_perl->Isawampersand;
10247 PL_unsafe = proto_perl->Iunsafe;
10248 PL_inplace = SAVEPV(proto_perl->Iinplace);
10249 PL_e_script = sv_dup_inc(proto_perl->Ie_script, param);
10250 PL_perldb = proto_perl->Iperldb;
10251 PL_perl_destruct_level = proto_perl->Iperl_destruct_level;
10252 PL_exit_flags = proto_perl->Iexit_flags;
10254 /* magical thingies */
10255 /* XXX time(&PL_basetime) when asked for? */
10256 PL_basetime = proto_perl->Ibasetime;
10257 PL_formfeed = sv_dup(proto_perl->Iformfeed, param);
10259 PL_maxsysfd = proto_perl->Imaxsysfd;
10260 PL_multiline = proto_perl->Imultiline;
10261 PL_statusvalue = proto_perl->Istatusvalue;
10263 PL_statusvalue_vms = proto_perl->Istatusvalue_vms;
10265 PL_encoding = sv_dup(proto_perl->Iencoding, param);
10267 sv_setpvn(PERL_DEBUG_PAD(0), "", 0); /* For regex debugging. */
10268 sv_setpvn(PERL_DEBUG_PAD(1), "", 0); /* ext/re needs these */
10269 sv_setpvn(PERL_DEBUG_PAD(2), "", 0); /* even without DEBUGGING. */
10271 /* Clone the regex array */
10272 PL_regex_padav = newAV();
10274 I32 len = av_len((AV*)proto_perl->Iregex_padav);
10275 SV** regexen = AvARRAY((AV*)proto_perl->Iregex_padav);
10276 av_push(PL_regex_padav,
10277 sv_dup_inc(regexen[0],param));
10278 for(i = 1; i <= len; i++) {
10279 if(SvREPADTMP(regexen[i])) {
10280 av_push(PL_regex_padav, sv_dup_inc(regexen[i], param));
10282 av_push(PL_regex_padav,
10284 newSViv(PTR2IV(re_dup(INT2PTR(REGEXP *,
10285 SvIVX(regexen[i])), param)))
10290 PL_regex_pad = AvARRAY(PL_regex_padav);
10292 /* shortcuts to various I/O objects */
10293 PL_stdingv = gv_dup(proto_perl->Istdingv, param);
10294 PL_stderrgv = gv_dup(proto_perl->Istderrgv, param);
10295 PL_defgv = gv_dup(proto_perl->Idefgv, param);
10296 PL_argvgv = gv_dup(proto_perl->Iargvgv, param);
10297 PL_argvoutgv = gv_dup(proto_perl->Iargvoutgv, param);
10298 PL_argvout_stack = av_dup_inc(proto_perl->Iargvout_stack, param);
10300 /* shortcuts to regexp stuff */
10301 PL_replgv = gv_dup(proto_perl->Ireplgv, param);
10303 /* shortcuts to misc objects */
10304 PL_errgv = gv_dup(proto_perl->Ierrgv, param);
10306 /* shortcuts to debugging objects */
10307 PL_DBgv = gv_dup(proto_perl->IDBgv, param);
10308 PL_DBline = gv_dup(proto_perl->IDBline, param);
10309 PL_DBsub = gv_dup(proto_perl->IDBsub, param);
10310 PL_DBsingle = sv_dup(proto_perl->IDBsingle, param);
10311 PL_DBtrace = sv_dup(proto_perl->IDBtrace, param);
10312 PL_DBsignal = sv_dup(proto_perl->IDBsignal, param);
10313 PL_lineary = av_dup(proto_perl->Ilineary, param);
10314 PL_dbargs = av_dup(proto_perl->Idbargs, param);
10316 /* symbol tables */
10317 PL_defstash = hv_dup_inc(proto_perl->Tdefstash, param);
10318 PL_curstash = hv_dup(proto_perl->Tcurstash, param);
10319 PL_nullstash = hv_dup(proto_perl->Inullstash, param);
10320 PL_debstash = hv_dup(proto_perl->Idebstash, param);
10321 PL_globalstash = hv_dup(proto_perl->Iglobalstash, param);
10322 PL_curstname = sv_dup_inc(proto_perl->Icurstname, param);
10324 PL_beginav = av_dup_inc(proto_perl->Ibeginav, param);
10325 PL_beginav_save = av_dup_inc(proto_perl->Ibeginav_save, param);
10326 PL_checkav_save = av_dup_inc(proto_perl->Icheckav_save, param);
10327 PL_endav = av_dup_inc(proto_perl->Iendav, param);
10328 PL_checkav = av_dup_inc(proto_perl->Icheckav, param);
10329 PL_initav = av_dup_inc(proto_perl->Iinitav, param);
10331 PL_sub_generation = proto_perl->Isub_generation;
10333 /* funky return mechanisms */
10334 PL_forkprocess = proto_perl->Iforkprocess;
10336 /* subprocess state */
10337 PL_fdpid = av_dup_inc(proto_perl->Ifdpid, param);
10339 /* internal state */
10340 PL_tainting = proto_perl->Itainting;
10341 PL_maxo = proto_perl->Imaxo;
10342 if (proto_perl->Iop_mask)
10343 PL_op_mask = SAVEPVN(proto_perl->Iop_mask, PL_maxo);
10345 PL_op_mask = Nullch;
10347 /* current interpreter roots */
10348 PL_main_cv = cv_dup_inc(proto_perl->Imain_cv, param);
10349 PL_main_root = OpREFCNT_inc(proto_perl->Imain_root);
10350 PL_main_start = proto_perl->Imain_start;
10351 PL_eval_root = proto_perl->Ieval_root;
10352 PL_eval_start = proto_perl->Ieval_start;
10354 /* runtime control stuff */
10355 PL_curcopdb = (COP*)any_dup(proto_perl->Icurcopdb, proto_perl);
10356 PL_copline = proto_perl->Icopline;
10358 PL_filemode = proto_perl->Ifilemode;
10359 PL_lastfd = proto_perl->Ilastfd;
10360 PL_oldname = proto_perl->Ioldname; /* XXX not quite right */
10363 PL_gensym = proto_perl->Igensym;
10364 PL_preambled = proto_perl->Ipreambled;
10365 PL_preambleav = av_dup_inc(proto_perl->Ipreambleav, param);
10366 PL_laststatval = proto_perl->Ilaststatval;
10367 PL_laststype = proto_perl->Ilaststype;
10368 PL_mess_sv = Nullsv;
10370 PL_ors_sv = sv_dup_inc(proto_perl->Iors_sv, param);
10371 PL_ofmt = SAVEPV(proto_perl->Iofmt);
10373 /* interpreter atexit processing */
10374 PL_exitlistlen = proto_perl->Iexitlistlen;
10375 if (PL_exitlistlen) {
10376 New(0, PL_exitlist, PL_exitlistlen, PerlExitListEntry);
10377 Copy(proto_perl->Iexitlist, PL_exitlist, PL_exitlistlen, PerlExitListEntry);
10380 PL_exitlist = (PerlExitListEntry*)NULL;
10381 PL_modglobal = hv_dup_inc(proto_perl->Imodglobal, param);
10382 PL_custom_op_names = hv_dup_inc(proto_perl->Icustom_op_names,param);
10383 PL_custom_op_descs = hv_dup_inc(proto_perl->Icustom_op_descs,param);
10385 PL_profiledata = NULL;
10386 PL_rsfp = fp_dup(proto_perl->Irsfp, '<', param);
10387 /* PL_rsfp_filters entries have fake IoDIRP() */
10388 PL_rsfp_filters = av_dup_inc(proto_perl->Irsfp_filters, param);
10390 PL_compcv = cv_dup(proto_perl->Icompcv, param);
10391 PL_comppad = av_dup(proto_perl->Icomppad, param);
10392 PL_comppad_name = av_dup(proto_perl->Icomppad_name, param);
10393 PL_comppad_name_fill = proto_perl->Icomppad_name_fill;
10394 PL_comppad_name_floor = proto_perl->Icomppad_name_floor;
10395 PL_curpad = (SV**)ptr_table_fetch(PL_ptr_table,
10396 proto_perl->Tcurpad);
10398 #ifdef HAVE_INTERP_INTERN
10399 sys_intern_dup(&proto_perl->Isys_intern, &PL_sys_intern);
10402 /* more statics moved here */
10403 PL_generation = proto_perl->Igeneration;
10404 PL_DBcv = cv_dup(proto_perl->IDBcv, param);
10406 PL_in_clean_objs = proto_perl->Iin_clean_objs;
10407 PL_in_clean_all = proto_perl->Iin_clean_all;
10409 PL_uid = proto_perl->Iuid;
10410 PL_euid = proto_perl->Ieuid;
10411 PL_gid = proto_perl->Igid;
10412 PL_egid = proto_perl->Iegid;
10413 PL_nomemok = proto_perl->Inomemok;
10414 PL_an = proto_perl->Ian;
10415 PL_cop_seqmax = proto_perl->Icop_seqmax;
10416 PL_op_seqmax = proto_perl->Iop_seqmax;
10417 PL_evalseq = proto_perl->Ievalseq;
10418 PL_origenviron = proto_perl->Iorigenviron; /* XXX not quite right */
10419 PL_origalen = proto_perl->Iorigalen;
10420 PL_pidstatus = newHV(); /* XXX flag for cloning? */
10421 PL_osname = SAVEPV(proto_perl->Iosname);
10422 PL_sh_path = proto_perl->Ish_path; /* XXX never deallocated */
10423 PL_sighandlerp = proto_perl->Isighandlerp;
10426 PL_runops = proto_perl->Irunops;
10428 Copy(proto_perl->Itokenbuf, PL_tokenbuf, 256, char);
10431 PL_cshlen = proto_perl->Icshlen;
10432 PL_cshname = proto_perl->Icshname; /* XXX never deallocated */
10435 PL_lex_state = proto_perl->Ilex_state;
10436 PL_lex_defer = proto_perl->Ilex_defer;
10437 PL_lex_expect = proto_perl->Ilex_expect;
10438 PL_lex_formbrack = proto_perl->Ilex_formbrack;
10439 PL_lex_dojoin = proto_perl->Ilex_dojoin;
10440 PL_lex_starts = proto_perl->Ilex_starts;
10441 PL_lex_stuff = sv_dup_inc(proto_perl->Ilex_stuff, param);
10442 PL_lex_repl = sv_dup_inc(proto_perl->Ilex_repl, param);
10443 PL_lex_op = proto_perl->Ilex_op;
10444 PL_lex_inpat = proto_perl->Ilex_inpat;
10445 PL_lex_inwhat = proto_perl->Ilex_inwhat;
10446 PL_lex_brackets = proto_perl->Ilex_brackets;
10447 i = (PL_lex_brackets < 120 ? 120 : PL_lex_brackets);
10448 PL_lex_brackstack = SAVEPVN(proto_perl->Ilex_brackstack,i);
10449 PL_lex_casemods = proto_perl->Ilex_casemods;
10450 i = (PL_lex_casemods < 12 ? 12 : PL_lex_casemods);
10451 PL_lex_casestack = SAVEPVN(proto_perl->Ilex_casestack,i);
10453 Copy(proto_perl->Inextval, PL_nextval, 5, YYSTYPE);
10454 Copy(proto_perl->Inexttype, PL_nexttype, 5, I32);
10455 PL_nexttoke = proto_perl->Inexttoke;
10457 /* XXX This is probably masking the deeper issue of why
10458 * SvANY(proto_perl->Ilinestr) can be NULL at this point. For test case:
10459 * http://archive.develooper.com/perl5-porters%40perl.org/msg83298.html
10460 * (A little debugging with a watchpoint on it may help.)
10462 if (SvANY(proto_perl->Ilinestr)) {
10463 PL_linestr = sv_dup_inc(proto_perl->Ilinestr, param);
10464 i = proto_perl->Ibufptr - SvPVX(proto_perl->Ilinestr);
10465 PL_bufptr = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
10466 i = proto_perl->Ioldbufptr - SvPVX(proto_perl->Ilinestr);
10467 PL_oldbufptr = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
10468 i = proto_perl->Ioldoldbufptr - SvPVX(proto_perl->Ilinestr);
10469 PL_oldoldbufptr = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
10470 i = proto_perl->Ilinestart - SvPVX(proto_perl->Ilinestr);
10471 PL_linestart = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
10474 PL_linestr = NEWSV(65,79);
10475 sv_upgrade(PL_linestr,SVt_PVIV);
10476 sv_setpvn(PL_linestr,"",0);
10477 PL_bufptr = PL_oldbufptr = PL_oldoldbufptr = PL_linestart = SvPVX(PL_linestr);
10479 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
10480 PL_pending_ident = proto_perl->Ipending_ident;
10481 PL_sublex_info = proto_perl->Isublex_info; /* XXX not quite right */
10483 PL_expect = proto_perl->Iexpect;
10485 PL_multi_start = proto_perl->Imulti_start;
10486 PL_multi_end = proto_perl->Imulti_end;
10487 PL_multi_open = proto_perl->Imulti_open;
10488 PL_multi_close = proto_perl->Imulti_close;
10490 PL_error_count = proto_perl->Ierror_count;
10491 PL_subline = proto_perl->Isubline;
10492 PL_subname = sv_dup_inc(proto_perl->Isubname, param);
10494 PL_min_intro_pending = proto_perl->Imin_intro_pending;
10495 PL_max_intro_pending = proto_perl->Imax_intro_pending;
10496 PL_padix = proto_perl->Ipadix;
10497 PL_padix_floor = proto_perl->Ipadix_floor;
10498 PL_pad_reset_pending = proto_perl->Ipad_reset_pending;
10500 /* XXX See comment on SvANY(proto_perl->Ilinestr) above */
10501 if (SvANY(proto_perl->Ilinestr)) {
10502 i = proto_perl->Ilast_uni - SvPVX(proto_perl->Ilinestr);
10503 PL_last_uni = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
10504 i = proto_perl->Ilast_lop - SvPVX(proto_perl->Ilinestr);
10505 PL_last_lop = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
10506 PL_last_lop_op = proto_perl->Ilast_lop_op;
10509 PL_last_uni = SvPVX(PL_linestr);
10510 PL_last_lop = SvPVX(PL_linestr);
10511 PL_last_lop_op = 0;
10513 PL_in_my = proto_perl->Iin_my;
10514 PL_in_my_stash = hv_dup(proto_perl->Iin_my_stash, param);
10516 PL_cryptseen = proto_perl->Icryptseen;
10519 PL_hints = proto_perl->Ihints;
10521 PL_amagic_generation = proto_perl->Iamagic_generation;
10523 #ifdef USE_LOCALE_COLLATE
10524 PL_collation_ix = proto_perl->Icollation_ix;
10525 PL_collation_name = SAVEPV(proto_perl->Icollation_name);
10526 PL_collation_standard = proto_perl->Icollation_standard;
10527 PL_collxfrm_base = proto_perl->Icollxfrm_base;
10528 PL_collxfrm_mult = proto_perl->Icollxfrm_mult;
10529 #endif /* USE_LOCALE_COLLATE */
10531 #ifdef USE_LOCALE_NUMERIC
10532 PL_numeric_name = SAVEPV(proto_perl->Inumeric_name);
10533 PL_numeric_standard = proto_perl->Inumeric_standard;
10534 PL_numeric_local = proto_perl->Inumeric_local;
10535 PL_numeric_radix_sv = sv_dup_inc(proto_perl->Inumeric_radix_sv, param);
10536 #endif /* !USE_LOCALE_NUMERIC */
10538 /* utf8 character classes */
10539 PL_utf8_alnum = sv_dup_inc(proto_perl->Iutf8_alnum, param);
10540 PL_utf8_alnumc = sv_dup_inc(proto_perl->Iutf8_alnumc, param);
10541 PL_utf8_ascii = sv_dup_inc(proto_perl->Iutf8_ascii, param);
10542 PL_utf8_alpha = sv_dup_inc(proto_perl->Iutf8_alpha, param);
10543 PL_utf8_space = sv_dup_inc(proto_perl->Iutf8_space, param);
10544 PL_utf8_cntrl = sv_dup_inc(proto_perl->Iutf8_cntrl, param);
10545 PL_utf8_graph = sv_dup_inc(proto_perl->Iutf8_graph, param);
10546 PL_utf8_digit = sv_dup_inc(proto_perl->Iutf8_digit, param);
10547 PL_utf8_upper = sv_dup_inc(proto_perl->Iutf8_upper, param);
10548 PL_utf8_lower = sv_dup_inc(proto_perl->Iutf8_lower, param);
10549 PL_utf8_print = sv_dup_inc(proto_perl->Iutf8_print, param);
10550 PL_utf8_punct = sv_dup_inc(proto_perl->Iutf8_punct, param);
10551 PL_utf8_xdigit = sv_dup_inc(proto_perl->Iutf8_xdigit, param);
10552 PL_utf8_mark = sv_dup_inc(proto_perl->Iutf8_mark, param);
10553 PL_utf8_toupper = sv_dup_inc(proto_perl->Iutf8_toupper, param);
10554 PL_utf8_totitle = sv_dup_inc(proto_perl->Iutf8_totitle, param);
10555 PL_utf8_tolower = sv_dup_inc(proto_perl->Iutf8_tolower, param);
10556 PL_utf8_tofold = sv_dup_inc(proto_perl->Iutf8_tofold, param);
10557 PL_utf8_idstart = sv_dup_inc(proto_perl->Iutf8_idstart, param);
10558 PL_utf8_idcont = sv_dup_inc(proto_perl->Iutf8_idcont, param);
10561 PL_last_swash_hv = Nullhv; /* reinits on demand */
10562 PL_last_swash_klen = 0;
10563 PL_last_swash_key[0]= '\0';
10564 PL_last_swash_tmps = (U8*)NULL;
10565 PL_last_swash_slen = 0;
10567 /* perly.c globals */
10568 PL_yydebug = proto_perl->Iyydebug;
10569 PL_yynerrs = proto_perl->Iyynerrs;
10570 PL_yyerrflag = proto_perl->Iyyerrflag;
10571 PL_yychar = proto_perl->Iyychar;
10572 PL_yyval = proto_perl->Iyyval;
10573 PL_yylval = proto_perl->Iyylval;
10575 PL_glob_index = proto_perl->Iglob_index;
10576 PL_srand_called = proto_perl->Isrand_called;
10577 PL_uudmap['M'] = 0; /* reinits on demand */
10578 PL_bitcount = Nullch; /* reinits on demand */
10580 if (proto_perl->Ipsig_pend) {
10581 Newz(0, PL_psig_pend, SIG_SIZE, int);
10584 PL_psig_pend = (int*)NULL;
10587 if (proto_perl->Ipsig_ptr) {
10588 Newz(0, PL_psig_ptr, SIG_SIZE, SV*);
10589 Newz(0, PL_psig_name, SIG_SIZE, SV*);
10590 for (i = 1; i < SIG_SIZE; i++) {
10591 PL_psig_ptr[i] = sv_dup_inc(proto_perl->Ipsig_ptr[i], param);
10592 PL_psig_name[i] = sv_dup_inc(proto_perl->Ipsig_name[i], param);
10596 PL_psig_ptr = (SV**)NULL;
10597 PL_psig_name = (SV**)NULL;
10600 /* thrdvar.h stuff */
10602 if (flags & CLONEf_COPY_STACKS) {
10603 /* next allocation will be PL_tmps_stack[PL_tmps_ix+1] */
10604 PL_tmps_ix = proto_perl->Ttmps_ix;
10605 PL_tmps_max = proto_perl->Ttmps_max;
10606 PL_tmps_floor = proto_perl->Ttmps_floor;
10607 Newz(50, PL_tmps_stack, PL_tmps_max, SV*);
10609 while (i <= PL_tmps_ix) {
10610 PL_tmps_stack[i] = sv_dup_inc(proto_perl->Ttmps_stack[i], param);
10614 /* next PUSHMARK() sets *(PL_markstack_ptr+1) */
10615 i = proto_perl->Tmarkstack_max - proto_perl->Tmarkstack;
10616 Newz(54, PL_markstack, i, I32);
10617 PL_markstack_max = PL_markstack + (proto_perl->Tmarkstack_max
10618 - proto_perl->Tmarkstack);
10619 PL_markstack_ptr = PL_markstack + (proto_perl->Tmarkstack_ptr
10620 - proto_perl->Tmarkstack);
10621 Copy(proto_perl->Tmarkstack, PL_markstack,
10622 PL_markstack_ptr - PL_markstack + 1, I32);
10624 /* next push_scope()/ENTER sets PL_scopestack[PL_scopestack_ix]
10625 * NOTE: unlike the others! */
10626 PL_scopestack_ix = proto_perl->Tscopestack_ix;
10627 PL_scopestack_max = proto_perl->Tscopestack_max;
10628 Newz(54, PL_scopestack, PL_scopestack_max, I32);
10629 Copy(proto_perl->Tscopestack, PL_scopestack, PL_scopestack_ix, I32);
10631 /* next push_return() sets PL_retstack[PL_retstack_ix]
10632 * NOTE: unlike the others! */
10633 PL_retstack_ix = proto_perl->Tretstack_ix;
10634 PL_retstack_max = proto_perl->Tretstack_max;
10635 Newz(54, PL_retstack, PL_retstack_max, OP*);
10636 Copy(proto_perl->Tretstack, PL_retstack, PL_retstack_ix, OP*);
10638 /* NOTE: si_dup() looks at PL_markstack */
10639 PL_curstackinfo = si_dup(proto_perl->Tcurstackinfo, param);
10641 /* PL_curstack = PL_curstackinfo->si_stack; */
10642 PL_curstack = av_dup(proto_perl->Tcurstack, param);
10643 PL_mainstack = av_dup(proto_perl->Tmainstack, param);
10645 /* next PUSHs() etc. set *(PL_stack_sp+1) */
10646 PL_stack_base = AvARRAY(PL_curstack);
10647 PL_stack_sp = PL_stack_base + (proto_perl->Tstack_sp
10648 - proto_perl->Tstack_base);
10649 PL_stack_max = PL_stack_base + AvMAX(PL_curstack);
10651 /* next SSPUSHFOO() sets PL_savestack[PL_savestack_ix]
10652 * NOTE: unlike the others! */
10653 PL_savestack_ix = proto_perl->Tsavestack_ix;
10654 PL_savestack_max = proto_perl->Tsavestack_max;
10655 /*Newz(54, PL_savestack, PL_savestack_max, ANY);*/
10656 PL_savestack = ss_dup(proto_perl, param);
10660 ENTER; /* perl_destruct() wants to LEAVE; */
10663 PL_start_env = proto_perl->Tstart_env; /* XXXXXX */
10664 PL_top_env = &PL_start_env;
10666 PL_op = proto_perl->Top;
10669 PL_Xpv = (XPV*)NULL;
10670 PL_na = proto_perl->Tna;
10672 PL_statbuf = proto_perl->Tstatbuf;
10673 PL_statcache = proto_perl->Tstatcache;
10674 PL_statgv = gv_dup(proto_perl->Tstatgv, param);
10675 PL_statname = sv_dup_inc(proto_perl->Tstatname, param);
10677 PL_timesbuf = proto_perl->Ttimesbuf;
10680 PL_tainted = proto_perl->Ttainted;
10681 PL_curpm = proto_perl->Tcurpm; /* XXX No PMOP ref count */
10682 PL_rs = sv_dup_inc(proto_perl->Trs, param);
10683 PL_last_in_gv = gv_dup(proto_perl->Tlast_in_gv, param);
10684 PL_ofs_sv = sv_dup_inc(proto_perl->Tofs_sv, param);
10685 PL_defoutgv = gv_dup_inc(proto_perl->Tdefoutgv, param);
10686 PL_chopset = proto_perl->Tchopset; /* XXX never deallocated */
10687 PL_toptarget = sv_dup_inc(proto_perl->Ttoptarget, param);
10688 PL_bodytarget = sv_dup_inc(proto_perl->Tbodytarget, param);
10689 PL_formtarget = sv_dup(proto_perl->Tformtarget, param);
10691 PL_restartop = proto_perl->Trestartop;
10692 PL_in_eval = proto_perl->Tin_eval;
10693 PL_delaymagic = proto_perl->Tdelaymagic;
10694 PL_dirty = proto_perl->Tdirty;
10695 PL_localizing = proto_perl->Tlocalizing;
10697 #ifdef PERL_FLEXIBLE_EXCEPTIONS
10698 PL_protect = proto_perl->Tprotect;
10700 PL_errors = sv_dup_inc(proto_perl->Terrors, param);
10701 PL_av_fetch_sv = Nullsv;
10702 PL_hv_fetch_sv = Nullsv;
10703 Zero(&PL_hv_fetch_ent_mh, 1, HE); /* XXX */
10704 PL_modcount = proto_perl->Tmodcount;
10705 PL_lastgotoprobe = Nullop;
10706 PL_dumpindent = proto_perl->Tdumpindent;
10708 PL_sortcop = (OP*)any_dup(proto_perl->Tsortcop, proto_perl);
10709 PL_sortstash = hv_dup(proto_perl->Tsortstash, param);
10710 PL_firstgv = gv_dup(proto_perl->Tfirstgv, param);
10711 PL_secondgv = gv_dup(proto_perl->Tsecondgv, param);
10712 PL_sortcxix = proto_perl->Tsortcxix;
10713 PL_efloatbuf = Nullch; /* reinits on demand */
10714 PL_efloatsize = 0; /* reinits on demand */
10718 PL_screamfirst = NULL;
10719 PL_screamnext = NULL;
10720 PL_maxscream = -1; /* reinits on demand */
10721 PL_lastscream = Nullsv;
10723 PL_watchaddr = NULL;
10724 PL_watchok = Nullch;
10726 PL_regdummy = proto_perl->Tregdummy;
10727 PL_regcomp_parse = Nullch;
10728 PL_regxend = Nullch;
10729 PL_regcode = (regnode*)NULL;
10732 PL_regprecomp = Nullch;
10737 PL_seen_zerolen = 0;
10739 PL_regcomp_rx = (regexp*)NULL;
10741 PL_colorset = 0; /* reinits PL_colors[] */
10742 /*PL_colors[6] = {0,0,0,0,0,0};*/
10743 PL_reg_whilem_seen = 0;
10744 PL_reginput = Nullch;
10745 PL_regbol = Nullch;
10746 PL_regeol = Nullch;
10747 PL_regstartp = (I32*)NULL;
10748 PL_regendp = (I32*)NULL;
10749 PL_reglastparen = (U32*)NULL;
10750 PL_regtill = Nullch;
10751 PL_reg_start_tmp = (char**)NULL;
10752 PL_reg_start_tmpl = 0;
10753 PL_regdata = (struct reg_data*)NULL;
10756 PL_reg_eval_set = 0;
10758 PL_regprogram = (regnode*)NULL;
10760 PL_regcc = (CURCUR*)NULL;
10761 PL_reg_call_cc = (struct re_cc_state*)NULL;
10762 PL_reg_re = (regexp*)NULL;
10763 PL_reg_ganch = Nullch;
10764 PL_reg_sv = Nullsv;
10765 PL_reg_match_utf8 = FALSE;
10766 PL_reg_magic = (MAGIC*)NULL;
10768 PL_reg_oldcurpm = (PMOP*)NULL;
10769 PL_reg_curpm = (PMOP*)NULL;
10770 PL_reg_oldsaved = Nullch;
10771 PL_reg_oldsavedlen = 0;
10772 PL_reg_maxiter = 0;
10773 PL_reg_leftiter = 0;
10774 PL_reg_poscache = Nullch;
10775 PL_reg_poscache_size= 0;
10777 /* RE engine - function pointers */
10778 PL_regcompp = proto_perl->Tregcompp;
10779 PL_regexecp = proto_perl->Tregexecp;
10780 PL_regint_start = proto_perl->Tregint_start;
10781 PL_regint_string = proto_perl->Tregint_string;
10782 PL_regfree = proto_perl->Tregfree;
10784 PL_reginterp_cnt = 0;
10785 PL_reg_starttry = 0;
10787 /* Pluggable optimizer */
10788 PL_peepp = proto_perl->Tpeepp;
10790 if (!(flags & CLONEf_KEEP_PTR_TABLE)) {
10791 ptr_table_free(PL_ptr_table);
10792 PL_ptr_table = NULL;
10795 /* Call the ->CLONE method, if it exists, for each of the stashes
10796 identified by sv_dup() above.
10798 while(av_len(param->stashes) != -1) {
10799 HV* stash = (HV*) av_shift(param->stashes);
10800 GV* cloner = gv_fetchmethod_autoload(stash, "CLONE", 0);
10801 if (cloner && GvCV(cloner)) {
10806 XPUSHs(sv_2mortal(newSVpv(HvNAME(stash), 0)));
10808 call_sv((SV*)GvCV(cloner), G_DISCARD);
10814 SvREFCNT_dec(param->stashes);
10819 #endif /* USE_ITHREADS */
10822 =head1 Unicode Support
10824 =for apidoc sv_recode_to_utf8
10826 The encoding is assumed to be an Encode object, on entry the PV
10827 of the sv is assumed to be octets in that encoding, and the sv
10828 will be converted into Unicode (and UTF-8).
10830 If the sv already is UTF-8 (or if it is not POK), or if the encoding
10831 is not a reference, nothing is done to the sv. If the encoding is not
10832 an C<Encode::XS> Encoding object, bad things will happen.
10833 (See F<lib/encoding.pm> and L<Encode>).
10835 The PV of the sv is returned.
10840 Perl_sv_recode_to_utf8(pTHX_ SV *sv, SV *encoding)
10842 if (SvPOK(sv) && !DO_UTF8(sv) && SvROK(encoding)) {
10855 Passing sv_yes is wrong - it needs to be or'ed set of constants
10856 for Encode::XS, while UTf-8 decode (currently) assumes a true value means
10857 remove converted chars from source.
10859 Both will default the value - let them.
10861 XPUSHs(&PL_sv_yes);
10864 call_method("decode", G_SCALAR);
10868 s = SvPV(uni, len);
10869 if (s != SvPVX(sv)) {
10870 SvGROW(sv, len + 1);
10871 Move(s, SvPVX(sv), len, char);
10872 SvCUR_set(sv, len);
10873 SvPVX(sv)[len] = 0;