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);
2949 switch (SvTYPE(sv)) {
2951 if ( ((SvFLAGS(sv) &
2952 (SVs_OBJECT|SVf_OK|SVs_GMG|SVs_SMG|SVs_RMG))
2953 == (SVs_OBJECT|SVs_RMG))
2954 && (mg = mg_find(sv, PERL_MAGIC_qr))) {
2955 regexp *re = (regexp *)mg->mg_obj;
2958 char *fptr = "msix";
2963 char need_newline = 0;
2964 U16 reganch = (U16)((re->reganch & PMf_COMPILETIME) >> 12);
2966 while((ch = *fptr++)) {
2968 reflags[left++] = ch;
2971 reflags[right--] = ch;
2976 reflags[left] = '-';
2980 mg->mg_len = re->prelen + 4 + left;
2982 * If /x was used, we have to worry about a regex
2983 * ending with a comment later being embedded
2984 * within another regex. If so, we don't want this
2985 * regex's "commentization" to leak out to the
2986 * right part of the enclosing regex, we must cap
2987 * it with a newline.
2989 * So, if /x was used, we scan backwards from the
2990 * end of the regex. If we find a '#' before we
2991 * find a newline, we need to add a newline
2992 * ourself. If we find a '\n' first (or if we
2993 * don't find '#' or '\n'), we don't need to add
2994 * anything. -jfriedl
2996 if (PMf_EXTENDED & re->reganch)
2998 char *endptr = re->precomp + re->prelen;
2999 while (endptr >= re->precomp)
3001 char c = *(endptr--);
3003 break; /* don't need another */
3005 /* we end while in a comment, so we
3007 mg->mg_len++; /* save space for it */
3008 need_newline = 1; /* note to add it */
3014 New(616, mg->mg_ptr, mg->mg_len + 1 + left, char);
3015 Copy("(?", mg->mg_ptr, 2, char);
3016 Copy(reflags, mg->mg_ptr+2, left, char);
3017 Copy(":", mg->mg_ptr+left+2, 1, char);
3018 Copy(re->precomp, mg->mg_ptr+3+left, re->prelen, char);
3020 mg->mg_ptr[mg->mg_len - 2] = '\n';
3021 mg->mg_ptr[mg->mg_len - 1] = ')';
3022 mg->mg_ptr[mg->mg_len] = 0;
3024 PL_reginterp_cnt += re->program[0].next_off;
3026 if (re->reganch & ROPT_UTF8)
3041 case SVt_PVBM: if (SvROK(sv))
3044 s = "SCALAR"; break;
3045 case SVt_PVLV: s = "LVALUE"; break;
3046 case SVt_PVAV: s = "ARRAY"; break;
3047 case SVt_PVHV: s = "HASH"; break;
3048 case SVt_PVCV: s = "CODE"; break;
3049 case SVt_PVGV: s = "GLOB"; break;
3050 case SVt_PVFM: s = "FORMAT"; break;
3051 case SVt_PVIO: s = "IO"; break;
3052 default: s = "UNKNOWN"; break;
3056 Perl_sv_setpvf(aTHX_ tsv, "%s=%s", HvNAME(SvSTASH(sv)), 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)
3201 sv_setpvn(dsv,s,len);
3209 =for apidoc sv_2pvbyte_nolen
3211 Return a pointer to the byte-encoded representation of the SV.
3212 May cause the SV to be downgraded from UTF8 as a side-effect.
3214 Usually accessed via the C<SvPVbyte_nolen> macro.
3220 Perl_sv_2pvbyte_nolen(pTHX_ register SV *sv)
3223 return sv_2pvbyte(sv, &n_a);
3227 =for apidoc sv_2pvbyte
3229 Return a pointer to the byte-encoded representation of the SV, and set *lp
3230 to its length. May cause the SV to be downgraded from UTF8 as a
3233 Usually accessed via the C<SvPVbyte> macro.
3239 Perl_sv_2pvbyte(pTHX_ register SV *sv, STRLEN *lp)
3241 sv_utf8_downgrade(sv,0);
3242 return SvPV(sv,*lp);
3246 =for apidoc sv_2pvutf8_nolen
3248 Return a pointer to the UTF8-encoded representation of the SV.
3249 May cause the SV to be upgraded to UTF8 as a side-effect.
3251 Usually accessed via the C<SvPVutf8_nolen> macro.
3257 Perl_sv_2pvutf8_nolen(pTHX_ register SV *sv)
3260 return sv_2pvutf8(sv, &n_a);
3264 =for apidoc sv_2pvutf8
3266 Return a pointer to the UTF8-encoded representation of the SV, and set *lp
3267 to its length. May cause the SV to be upgraded to UTF8 as a side-effect.
3269 Usually accessed via the C<SvPVutf8> macro.
3275 Perl_sv_2pvutf8(pTHX_ register SV *sv, STRLEN *lp)
3277 sv_utf8_upgrade(sv);
3278 return SvPV(sv,*lp);
3282 =for apidoc sv_2bool
3284 This function is only called on magical items, and is only used by
3285 sv_true() or its macro equivalent.
3291 Perl_sv_2bool(pTHX_ register SV *sv)
3300 if (SvAMAGIC(sv) && (tmpsv=AMG_CALLun(sv,bool_)) &&
3301 (!SvROK(tmpsv) || (SvRV(tmpsv) != SvRV(sv))))
3302 return (bool)SvTRUE(tmpsv);
3303 return SvRV(sv) != 0;
3306 register XPV* Xpvtmp;
3307 if ((Xpvtmp = (XPV*)SvANY(sv)) &&
3308 (*Xpvtmp->xpv_pv > '0' ||
3309 Xpvtmp->xpv_cur > 1 ||
3310 (Xpvtmp->xpv_cur && *Xpvtmp->xpv_pv != '0')))
3317 return SvIVX(sv) != 0;
3320 return SvNVX(sv) != 0.0;
3328 =for apidoc sv_utf8_upgrade
3330 Convert the PV of an SV to its UTF8-encoded form.
3331 Forces the SV to string form if it is not already.
3332 Always sets the SvUTF8 flag to avoid future validity checks even
3333 if all the bytes have hibit clear.
3335 This is not as a general purpose byte encoding to Unicode interface:
3336 use the Encode extension for that.
3338 =for apidoc sv_utf8_upgrade_flags
3340 Convert the PV of an SV to its UTF8-encoded form.
3341 Forces the SV to string form if it is not already.
3342 Always sets the SvUTF8 flag to avoid future validity checks even
3343 if all the bytes have hibit clear. If C<flags> has C<SV_GMAGIC> bit set,
3344 will C<mg_get> on C<sv> if appropriate, else not. C<sv_utf8_upgrade> and
3345 C<sv_utf8_upgrade_nomg> are implemented in terms of this function.
3347 This is not as a general purpose byte encoding to Unicode interface:
3348 use the Encode extension for that.
3354 Perl_sv_utf8_upgrade_flags(pTHX_ register SV *sv, I32 flags)
3364 (void) sv_2pv_flags(sv,&len, flags);
3373 sv_force_normal_flags(sv, 0);
3377 sv_recode_to_utf8(sv, PL_encoding);
3378 else { /* Assume Latin-1/EBCDIC */
3379 /* This function could be much more efficient if we
3380 * had a FLAG in SVs to signal if there are any hibit
3381 * chars in the PV. Given that there isn't such a flag
3382 * make the loop as fast as possible. */
3383 s = (U8 *) SvPVX(sv);
3384 e = (U8 *) SvEND(sv);
3388 if ((hibit = !NATIVE_IS_INVARIANT(ch)))
3394 len = SvCUR(sv) + 1; /* Plus the \0 */
3395 SvPVX(sv) = (char*)bytes_to_utf8((U8*)s, &len);
3396 SvCUR(sv) = len - 1;
3398 Safefree(s); /* No longer using what was there before. */
3399 SvLEN(sv) = len; /* No longer know the real size. */
3401 /* Mark as UTF-8 even if no hibit - saves scanning loop */
3408 =for apidoc sv_utf8_downgrade
3410 Attempt to convert the PV of an SV from UTF8-encoded to byte encoding.
3411 This may not be possible if the PV contains non-byte encoding characters;
3412 if this is the case, either returns false or, if C<fail_ok> is not
3415 This is not as a general purpose Unicode to byte encoding interface:
3416 use the Encode extension for that.
3422 Perl_sv_utf8_downgrade(pTHX_ register SV* sv, bool fail_ok)
3424 if (SvPOK(sv) && SvUTF8(sv)) {
3430 sv_force_normal_flags(sv, 0);
3432 s = (U8 *) SvPV(sv, len);
3433 if (!utf8_to_bytes(s, &len)) {
3438 Perl_croak(aTHX_ "Wide character in %s",
3441 Perl_croak(aTHX_ "Wide character");
3452 =for apidoc sv_utf8_encode
3454 Convert the PV of an SV to UTF8-encoded, but then turn off the C<SvUTF8>
3455 flag so that it looks like octets again. Used as a building block
3456 for encode_utf8 in Encode.xs
3462 Perl_sv_utf8_encode(pTHX_ register SV *sv)
3464 (void) sv_utf8_upgrade(sv);
3469 =for apidoc sv_utf8_decode
3471 Convert the octets in the PV from UTF-8 to chars. Scan for validity and then
3472 turn off SvUTF8 if needed so that we see characters. Used as a building block
3473 for decode_utf8 in Encode.xs
3479 Perl_sv_utf8_decode(pTHX_ register SV *sv)
3485 /* The octets may have got themselves encoded - get them back as
3488 if (!sv_utf8_downgrade(sv, TRUE))
3491 /* it is actually just a matter of turning the utf8 flag on, but
3492 * we want to make sure everything inside is valid utf8 first.
3494 c = (U8 *) SvPVX(sv);
3495 if (!is_utf8_string(c, SvCUR(sv)+1))
3497 e = (U8 *) SvEND(sv);
3500 if (!UTF8_IS_INVARIANT(ch)) {
3510 =for apidoc sv_setsv
3512 Copies the contents of the source SV C<ssv> into the destination SV
3513 C<dsv>. The source SV may be destroyed if it is mortal, so don't use this
3514 function if the source SV needs to be reused. Does not handle 'set' magic.
3515 Loosely speaking, it performs a copy-by-value, obliterating any previous
3516 content of the destination.
3518 You probably want to use one of the assortment of wrappers, such as
3519 C<SvSetSV>, C<SvSetSV_nosteal>, C<SvSetMagicSV> and
3520 C<SvSetMagicSV_nosteal>.
3522 =for apidoc sv_setsv_flags
3524 Copies the contents of the source SV C<ssv> into the destination SV
3525 C<dsv>. The source SV may be destroyed if it is mortal, so don't use this
3526 function if the source SV needs to be reused. Does not handle 'set' magic.
3527 Loosely speaking, it performs a copy-by-value, obliterating any previous
3528 content of the destination.
3529 If the C<flags> parameter has the C<SV_GMAGIC> bit set, will C<mg_get> on
3530 C<ssv> if appropriate, else not. C<sv_setsv> and C<sv_setsv_nomg> are
3531 implemented in terms of this function.
3533 You probably want to use one of the assortment of wrappers, such as
3534 C<SvSetSV>, C<SvSetSV_nosteal>, C<SvSetMagicSV> and
3535 C<SvSetMagicSV_nosteal>.
3537 This is the primary function for copying scalars, and most other
3538 copy-ish functions and macros use this underneath.
3544 Perl_sv_setsv_flags(pTHX_ SV *dstr, register SV *sstr, I32 flags)
3546 register U32 sflags;
3552 SV_CHECK_THINKFIRST_COW_DROP(dstr);
3554 sstr = &PL_sv_undef;
3555 stype = SvTYPE(sstr);
3556 dtype = SvTYPE(dstr);
3561 /* need to nuke the magic */
3563 SvRMAGICAL_off(dstr);
3566 /* There's a lot of redundancy below but we're going for speed here */
3571 if (dtype != SVt_PVGV) {
3572 (void)SvOK_off(dstr);
3580 sv_upgrade(dstr, SVt_IV);
3583 sv_upgrade(dstr, SVt_PVNV);
3587 sv_upgrade(dstr, SVt_PVIV);
3590 (void)SvIOK_only(dstr);
3591 SvIVX(dstr) = SvIVX(sstr);
3594 if (SvTAINTED(sstr))
3605 sv_upgrade(dstr, SVt_NV);
3610 sv_upgrade(dstr, SVt_PVNV);
3613 SvNVX(dstr) = SvNVX(sstr);
3614 (void)SvNOK_only(dstr);
3615 if (SvTAINTED(sstr))
3623 sv_upgrade(dstr, SVt_RV);
3624 else if (dtype == SVt_PVGV &&
3625 SvTYPE(SvRV(sstr)) == SVt_PVGV) {
3628 if (GvIMPORTED(dstr) != GVf_IMPORTED
3629 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3631 GvIMPORTED_on(dstr);
3642 sv_upgrade(dstr, SVt_PV);
3645 if (dtype < SVt_PVIV)
3646 sv_upgrade(dstr, SVt_PVIV);
3649 if (dtype < SVt_PVNV)
3650 sv_upgrade(dstr, SVt_PVNV);
3657 Perl_croak(aTHX_ "Bizarre copy of %s in %s", sv_reftype(sstr, 0),
3660 Perl_croak(aTHX_ "Bizarre copy of %s", sv_reftype(sstr, 0));
3664 if (dtype <= SVt_PVGV) {
3666 if (dtype != SVt_PVGV) {
3667 char *name = GvNAME(sstr);
3668 STRLEN len = GvNAMELEN(sstr);
3669 sv_upgrade(dstr, SVt_PVGV);
3670 sv_magic(dstr, dstr, PERL_MAGIC_glob, Nullch, 0);
3671 GvSTASH(dstr) = (HV*)SvREFCNT_inc(GvSTASH(sstr));
3672 GvNAME(dstr) = savepvn(name, len);
3673 GvNAMELEN(dstr) = len;
3674 SvFAKE_on(dstr); /* can coerce to non-glob */
3676 /* ahem, death to those who redefine active sort subs */
3677 else if (PL_curstackinfo->si_type == PERLSI_SORT
3678 && GvCV(dstr) && PL_sortcop == CvSTART(GvCV(dstr)))
3679 Perl_croak(aTHX_ "Can't redefine active sort subroutine %s",
3682 #ifdef GV_UNIQUE_CHECK
3683 if (GvUNIQUE((GV*)dstr)) {
3684 Perl_croak(aTHX_ PL_no_modify);
3688 (void)SvOK_off(dstr);
3689 GvINTRO_off(dstr); /* one-shot flag */
3691 GvGP(dstr) = gp_ref(GvGP(sstr));
3692 if (SvTAINTED(sstr))
3694 if (GvIMPORTED(dstr) != GVf_IMPORTED
3695 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3697 GvIMPORTED_on(dstr);
3705 if (SvGMAGICAL(sstr) && (flags & SV_GMAGIC)) {
3707 if ((int)SvTYPE(sstr) != stype) {
3708 stype = SvTYPE(sstr);
3709 if (stype == SVt_PVGV && dtype <= SVt_PVGV)
3713 if (stype == SVt_PVLV)
3714 (void)SvUPGRADE(dstr, SVt_PVNV);
3716 (void)SvUPGRADE(dstr, (U32)stype);
3719 sflags = SvFLAGS(sstr);
3721 if (sflags & SVf_ROK) {
3722 if (dtype >= SVt_PV) {
3723 if (dtype == SVt_PVGV) {
3724 SV *sref = SvREFCNT_inc(SvRV(sstr));
3726 int intro = GvINTRO(dstr);
3728 #ifdef GV_UNIQUE_CHECK
3729 if (GvUNIQUE((GV*)dstr)) {
3730 Perl_croak(aTHX_ PL_no_modify);
3735 GvINTRO_off(dstr); /* one-shot flag */
3736 GvLINE(dstr) = CopLINE(PL_curcop);
3737 GvEGV(dstr) = (GV*)dstr;
3740 switch (SvTYPE(sref)) {
3743 SAVESPTR(GvAV(dstr));
3745 dref = (SV*)GvAV(dstr);
3746 GvAV(dstr) = (AV*)sref;
3747 if (!GvIMPORTED_AV(dstr)
3748 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3750 GvIMPORTED_AV_on(dstr);
3755 SAVESPTR(GvHV(dstr));
3757 dref = (SV*)GvHV(dstr);
3758 GvHV(dstr) = (HV*)sref;
3759 if (!GvIMPORTED_HV(dstr)
3760 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3762 GvIMPORTED_HV_on(dstr);
3767 if (GvCVGEN(dstr) && GvCV(dstr) != (CV*)sref) {
3768 SvREFCNT_dec(GvCV(dstr));
3769 GvCV(dstr) = Nullcv;
3770 GvCVGEN(dstr) = 0; /* Switch off cacheness. */
3771 PL_sub_generation++;
3773 SAVESPTR(GvCV(dstr));
3776 dref = (SV*)GvCV(dstr);
3777 if (GvCV(dstr) != (CV*)sref) {
3778 CV* cv = GvCV(dstr);
3780 if (!GvCVGEN((GV*)dstr) &&
3781 (CvROOT(cv) || CvXSUB(cv)))
3783 /* ahem, death to those who redefine
3784 * active sort subs */
3785 if (PL_curstackinfo->si_type == PERLSI_SORT &&
3786 PL_sortcop == CvSTART(cv))
3788 "Can't redefine active sort subroutine %s",
3789 GvENAME((GV*)dstr));
3790 /* Redefining a sub - warning is mandatory if
3791 it was a const and its value changed. */
3792 if (ckWARN(WARN_REDEFINE)
3794 && (!CvCONST((CV*)sref)
3795 || sv_cmp(cv_const_sv(cv),
3796 cv_const_sv((CV*)sref)))))
3798 Perl_warner(aTHX_ packWARN(WARN_REDEFINE),
3800 ? "Constant subroutine %s::%s redefined"
3801 : "Subroutine %s::%s redefined",
3802 HvNAME(GvSTASH((GV*)dstr)),
3803 GvENAME((GV*)dstr));
3807 cv_ckproto(cv, (GV*)dstr,
3808 SvPOK(sref) ? SvPVX(sref) : Nullch);
3810 GvCV(dstr) = (CV*)sref;
3811 GvCVGEN(dstr) = 0; /* Switch off cacheness. */
3812 GvASSUMECV_on(dstr);
3813 PL_sub_generation++;
3815 if (!GvIMPORTED_CV(dstr)
3816 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3818 GvIMPORTED_CV_on(dstr);
3823 SAVESPTR(GvIOp(dstr));
3825 dref = (SV*)GvIOp(dstr);
3826 GvIOp(dstr) = (IO*)sref;
3830 SAVESPTR(GvFORM(dstr));
3832 dref = (SV*)GvFORM(dstr);
3833 GvFORM(dstr) = (CV*)sref;
3837 SAVESPTR(GvSV(dstr));
3839 dref = (SV*)GvSV(dstr);
3841 if (!GvIMPORTED_SV(dstr)
3842 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3844 GvIMPORTED_SV_on(dstr);
3852 if (SvTAINTED(sstr))
3857 (void)SvOOK_off(dstr); /* backoff */
3859 Safefree(SvPVX(dstr));
3860 SvLEN(dstr)=SvCUR(dstr)=0;
3863 (void)SvOK_off(dstr);
3864 SvRV(dstr) = SvREFCNT_inc(SvRV(sstr));
3866 if (sflags & SVp_NOK) {
3868 /* Only set the public OK flag if the source has public OK. */
3869 if (sflags & SVf_NOK)
3870 SvFLAGS(dstr) |= SVf_NOK;
3871 SvNVX(dstr) = SvNVX(sstr);
3873 if (sflags & SVp_IOK) {
3874 (void)SvIOKp_on(dstr);
3875 if (sflags & SVf_IOK)
3876 SvFLAGS(dstr) |= SVf_IOK;
3877 if (sflags & SVf_IVisUV)
3879 SvIVX(dstr) = SvIVX(sstr);
3881 if (SvAMAGIC(sstr)) {
3885 else if (sflags & SVp_POK) {
3889 * Check to see if we can just swipe the string. If so, it's a
3890 * possible small lose on short strings, but a big win on long ones.
3891 * It might even be a win on short strings if SvPVX(dstr)
3892 * has to be allocated and SvPVX(sstr) has to be freed.
3896 #ifdef PERL_COPY_ON_WRITE
3897 (sflags & (SVf_FAKE | SVf_READONLY)) != (SVf_FAKE | SVf_READONLY)
3901 (sflags & SVs_TEMP) && /* slated for free anyway? */
3902 !(sflags & SVf_OOK) && /* and not involved in OOK hack? */
3903 SvREFCNT(sstr) == 1 && /* and no other references to it? */
3904 SvLEN(sstr) && /* and really is a string */
3905 /* and won't be needed again, potentially */
3906 !(PL_op && PL_op->op_type == OP_AASSIGN))
3907 #ifdef PERL_COPY_ON_WRITE
3908 && !((sflags & CAN_COW_MASK) == CAN_COW_FLAGS
3909 && SvTYPE(sstr) >= SVt_PVIV)
3912 /* Failed the swipe test, and it's not a shared hash key either.
3913 Have to copy the string. */
3914 STRLEN len = SvCUR(sstr);
3915 SvGROW(dstr, len + 1); /* inlined from sv_setpvn */
3916 Move(SvPVX(sstr),SvPVX(dstr),len,char);
3917 SvCUR_set(dstr, len);
3918 *SvEND(dstr) = '\0';
3919 (void)SvPOK_only(dstr);
3921 /* If PERL_COPY_ON_WRITE is not defined, then isSwipe will always
3923 #ifdef PERL_COPY_ON_WRITE
3924 /* Either it's a shared hash key, or it's suitable for
3925 copy-on-write or we can swipe the string. */
3927 PerlIO_printf(Perl_debug_log,
3928 "Copy on write: sstr --> dstr\n");
3933 /* I believe I should acquire a global SV mutex if
3934 it's a COW sv (not a shared hash key) to stop
3935 it going un copy-on-write.
3936 If the source SV has gone un copy on write between up there
3937 and down here, then (assert() that) it is of the correct
3938 form to make it copy on write again */
3939 if ((sflags & (SVf_FAKE | SVf_READONLY))
3940 != (SVf_FAKE | SVf_READONLY)) {
3941 SvREADONLY_on(sstr);
3943 /* Make the source SV into a loop of 1.
3944 (about to become 2) */
3945 SV_COW_NEXT_SV_SET(sstr, sstr);
3949 /* Initial code is common. */
3950 if (SvPVX(dstr)) { /* we know that dtype >= SVt_PV */
3952 SvFLAGS(dstr) &= ~SVf_OOK;
3953 Safefree(SvPVX(dstr) - SvIVX(dstr));
3955 else if (SvLEN(dstr))
3956 Safefree(SvPVX(dstr));
3958 (void)SvPOK_only(dstr);
3960 #ifdef PERL_COPY_ON_WRITE
3962 /* making another shared SV. */
3963 STRLEN cur = SvCUR(sstr);
3964 STRLEN len = SvLEN(sstr);
3966 /* SvIsCOW_normal */
3967 /* splice us in between source and next-after-source. */
3968 SV_COW_NEXT_SV_SET(dstr, SV_COW_NEXT_SV(sstr));
3969 SV_COW_NEXT_SV_SET(sstr, dstr);
3970 SvPV_set(dstr, SvPVX(sstr));
3972 /* SvIsCOW_shared_hash */
3973 UV hash = SvUVX(sstr);
3974 DEBUG_C(PerlIO_printf(Perl_debug_log,
3975 "Copy on write: Sharing hash\n"));
3977 sharepvn(SvPVX(sstr),
3978 (sflags & SVf_UTF8?-cur:cur), hash));
3983 SvREADONLY_on(dstr);
3985 /* Relesase a global SV mutex. */
3989 { /* Passes the swipe test. */
3990 SvPV_set(dstr, SvPVX(sstr));
3991 SvLEN_set(dstr, SvLEN(sstr));
3992 SvCUR_set(dstr, SvCUR(sstr));
3995 (void)SvOK_off(sstr); /* NOTE: nukes most SvFLAGS on sstr */
3996 SvPV_set(sstr, Nullch);
4002 if (sflags & SVf_UTF8)
4005 if (sflags & SVp_NOK) {
4007 if (sflags & SVf_NOK)
4008 SvFLAGS(dstr) |= SVf_NOK;
4009 SvNVX(dstr) = SvNVX(sstr);
4011 if (sflags & SVp_IOK) {
4012 (void)SvIOKp_on(dstr);
4013 if (sflags & SVf_IOK)
4014 SvFLAGS(dstr) |= SVf_IOK;
4015 if (sflags & SVf_IVisUV)
4017 SvIVX(dstr) = SvIVX(sstr);
4020 MAGIC *smg = mg_find(sstr,PERL_MAGIC_vstring);
4021 sv_magic(dstr, NULL, PERL_MAGIC_vstring,
4022 smg->mg_ptr, smg->mg_len);
4023 SvRMAGICAL_on(dstr);
4026 else if (sflags & SVp_IOK) {
4027 if (sflags & SVf_IOK)
4028 (void)SvIOK_only(dstr);
4030 (void)SvOK_off(dstr);
4031 (void)SvIOKp_on(dstr);
4033 /* XXXX Do we want to set IsUV for IV(ROK)? Be extra safe... */
4034 if (sflags & SVf_IVisUV)
4036 SvIVX(dstr) = SvIVX(sstr);
4037 if (sflags & SVp_NOK) {
4038 if (sflags & SVf_NOK)
4039 (void)SvNOK_on(dstr);
4041 (void)SvNOKp_on(dstr);
4042 SvNVX(dstr) = SvNVX(sstr);
4045 else if (sflags & SVp_NOK) {
4046 if (sflags & SVf_NOK)
4047 (void)SvNOK_only(dstr);
4049 (void)SvOK_off(dstr);
4052 SvNVX(dstr) = SvNVX(sstr);
4055 if (dtype == SVt_PVGV) {
4056 if (ckWARN(WARN_MISC))
4057 Perl_warner(aTHX_ packWARN(WARN_MISC), "Undefined value assigned to typeglob");
4060 (void)SvOK_off(dstr);
4062 if (SvTAINTED(sstr))
4067 =for apidoc sv_setsv_mg
4069 Like C<sv_setsv>, but also handles 'set' magic.
4075 Perl_sv_setsv_mg(pTHX_ SV *dstr, register SV *sstr)
4077 sv_setsv(dstr,sstr);
4082 =for apidoc sv_setpvn
4084 Copies a string into an SV. The C<len> parameter indicates the number of
4085 bytes to be copied. Does not handle 'set' magic. See C<sv_setpvn_mg>.
4091 Perl_sv_setpvn(pTHX_ register SV *sv, register const char *ptr, register STRLEN len)
4093 register char *dptr;
4095 SV_CHECK_THINKFIRST_COW_DROP(sv);
4101 /* len is STRLEN which is unsigned, need to copy to signed */
4104 Perl_croak(aTHX_ "panic: sv_setpvn called with negative strlen");
4106 (void)SvUPGRADE(sv, SVt_PV);
4108 SvGROW(sv, len + 1);
4110 Move(ptr,dptr,len,char);
4113 (void)SvPOK_only_UTF8(sv); /* validate pointer */
4118 =for apidoc sv_setpvn_mg
4120 Like C<sv_setpvn>, but also handles 'set' magic.
4126 Perl_sv_setpvn_mg(pTHX_ register SV *sv, register const char *ptr, register STRLEN len)
4128 sv_setpvn(sv,ptr,len);
4133 =for apidoc sv_setpv
4135 Copies a string into an SV. The string must be null-terminated. Does not
4136 handle 'set' magic. See C<sv_setpv_mg>.
4142 Perl_sv_setpv(pTHX_ register SV *sv, register const char *ptr)
4144 register STRLEN len;
4146 SV_CHECK_THINKFIRST_COW_DROP(sv);
4152 (void)SvUPGRADE(sv, SVt_PV);
4154 SvGROW(sv, len + 1);
4155 Move(ptr,SvPVX(sv),len+1,char);
4157 (void)SvPOK_only_UTF8(sv); /* validate pointer */
4162 =for apidoc sv_setpv_mg
4164 Like C<sv_setpv>, but also handles 'set' magic.
4170 Perl_sv_setpv_mg(pTHX_ register SV *sv, register const char *ptr)
4177 =for apidoc sv_usepvn
4179 Tells an SV to use C<ptr> to find its string value. Normally the string is
4180 stored inside the SV but sv_usepvn allows the SV to use an outside string.
4181 The C<ptr> should point to memory that was allocated by C<malloc>. The
4182 string length, C<len>, must be supplied. This function will realloc the
4183 memory pointed to by C<ptr>, so that pointer should not be freed or used by
4184 the programmer after giving it to sv_usepvn. Does not handle 'set' magic.
4185 See C<sv_usepvn_mg>.
4191 Perl_sv_usepvn(pTHX_ register SV *sv, register char *ptr, register STRLEN len)
4193 SV_CHECK_THINKFIRST_COW_DROP(sv);
4194 (void)SvUPGRADE(sv, SVt_PV);
4199 (void)SvOOK_off(sv);
4200 if (SvPVX(sv) && SvLEN(sv))
4201 Safefree(SvPVX(sv));
4202 Renew(ptr, len+1, char);
4205 SvLEN_set(sv, len+1);
4207 (void)SvPOK_only_UTF8(sv); /* validate pointer */
4212 =for apidoc sv_usepvn_mg
4214 Like C<sv_usepvn>, but also handles 'set' magic.
4220 Perl_sv_usepvn_mg(pTHX_ register SV *sv, register char *ptr, register STRLEN len)
4222 sv_usepvn(sv,ptr,len);
4226 #ifdef PERL_COPY_ON_WRITE
4227 /* Need to do this *after* making the SV normal, as we need the buffer
4228 pointer to remain valid until after we've copied it. If we let go too early,
4229 another thread could invalidate it by unsharing last of the same hash key
4230 (which it can do by means other than releasing copy-on-write Svs)
4231 or by changing the other copy-on-write SVs in the loop. */
4233 S_sv_release_COW(pTHX_ register SV *sv, char *pvx, STRLEN cur, STRLEN len,
4234 U32 hash, SV *after)
4236 if (len) { /* this SV was SvIsCOW_normal(sv) */
4237 /* we need to find the SV pointing to us. */
4238 SV *current = SV_COW_NEXT_SV(after);
4240 if (current == sv) {
4241 /* The SV we point to points back to us (there were only two of us
4243 Hence other SV is no longer copy on write either. */
4245 SvREADONLY_off(after);
4247 /* We need to follow the pointers around the loop. */
4249 while ((next = SV_COW_NEXT_SV(current)) != sv) {
4252 /* don't loop forever if the structure is bust, and we have
4253 a pointer into a closed loop. */
4254 assert (current != after);
4255 assert (SvPVX(current) == pvx);
4257 /* Make the SV before us point to the SV after us. */
4258 SV_COW_NEXT_SV_SET(current, after);
4261 unsharepvn(pvx, SvUTF8(sv) ? -(I32)cur : cur, hash);
4266 Perl_sv_release_IVX(pTHX_ register SV *sv)
4269 sv_force_normal_flags(sv, 0);
4270 return SvOOK_off(sv);
4274 =for apidoc sv_force_normal_flags
4276 Undo various types of fakery on an SV: if the PV is a shared string, make
4277 a private copy; if we're a ref, stop refing; if we're a glob, downgrade to
4278 an xpvmg; if we're a copy-on-write scalar, this is the on-write time when
4279 we do the copy, and is also used locally. If C<SV_COW_DROP_PV> is set
4280 then a copy-on-write scalar drops its PV buffer (if any) and becomes
4281 SvPOK_off rather than making a copy. (Used where this scalar is about to be
4282 set to some other value. In addtion, the C<flags> parameter gets passed to
4283 C<sv_unref_flags()> when unrefing. C<sv_force_normal> calls this function
4284 with flags set to 0.
4290 Perl_sv_force_normal_flags(pTHX_ register SV *sv, U32 flags)
4292 #ifdef PERL_COPY_ON_WRITE
4293 if (SvREADONLY(sv)) {
4294 /* At this point I believe I should acquire a global SV mutex. */
4296 char *pvx = SvPVX(sv);
4297 STRLEN len = SvLEN(sv);
4298 STRLEN cur = SvCUR(sv);
4299 U32 hash = SvUVX(sv);
4300 SV *next = SV_COW_NEXT_SV(sv); /* next COW sv in the loop. */
4302 PerlIO_printf(Perl_debug_log,
4303 "Copy on write: Force normal %ld\n",
4309 /* This SV doesn't own the buffer, so need to New() a new one: */
4312 if (flags & SV_COW_DROP_PV) {
4313 /* OK, so we don't need to copy our buffer. */
4316 SvGROW(sv, cur + 1);
4317 Move(pvx,SvPVX(sv),cur,char);
4321 sv_release_COW(sv, pvx, cur, len, hash, next);
4326 else if (PL_curcop != &PL_compiling)
4327 Perl_croak(aTHX_ PL_no_modify);
4328 /* At this point I believe that I can drop the global SV mutex. */
4331 if (SvREADONLY(sv)) {
4333 char *pvx = SvPVX(sv);
4334 STRLEN len = SvCUR(sv);
4335 U32 hash = SvUVX(sv);
4336 SvGROW(sv, len + 1);
4337 Move(pvx,SvPVX(sv),len,char);
4341 unsharepvn(pvx, SvUTF8(sv) ? -(I32)len : len, hash);
4343 else if (PL_curcop != &PL_compiling)
4344 Perl_croak(aTHX_ PL_no_modify);
4348 sv_unref_flags(sv, flags);
4349 else if (SvFAKE(sv) && SvTYPE(sv) == SVt_PVGV)
4354 =for apidoc sv_force_normal
4356 Undo various types of fakery on an SV: if the PV is a shared string, make
4357 a private copy; if we're a ref, stop refing; if we're a glob, downgrade to
4358 an xpvmg. See also C<sv_force_normal_flags>.
4364 Perl_sv_force_normal(pTHX_ register SV *sv)
4366 sv_force_normal_flags(sv, 0);
4372 Efficient removal of characters from the beginning of the string buffer.
4373 SvPOK(sv) must be true and the C<ptr> must be a pointer to somewhere inside
4374 the string buffer. The C<ptr> becomes the first character of the adjusted
4375 string. Uses the "OOK hack".
4381 Perl_sv_chop(pTHX_ register SV *sv, register char *ptr)
4383 register STRLEN delta;
4385 if (!ptr || !SvPOKp(sv))
4387 SV_CHECK_THINKFIRST(sv);
4388 if (SvTYPE(sv) < SVt_PVIV)
4389 sv_upgrade(sv,SVt_PVIV);
4392 if (!SvLEN(sv)) { /* make copy of shared string */
4393 char *pvx = SvPVX(sv);
4394 STRLEN len = SvCUR(sv);
4395 SvGROW(sv, len + 1);
4396 Move(pvx,SvPVX(sv),len,char);
4400 SvFLAGS(sv) |= SVf_OOK;
4402 SvFLAGS(sv) &= ~(SVf_IOK|SVf_NOK|SVp_IOK|SVp_NOK|SVf_IVisUV);
4403 delta = ptr - SvPVX(sv);
4411 =for apidoc sv_catpvn
4413 Concatenates the string onto the end of the string which is in the SV. The
4414 C<len> indicates number of bytes to copy. If the SV has the UTF8
4415 status set, then the bytes appended should be valid UTF8.
4416 Handles 'get' magic, but not 'set' magic. See C<sv_catpvn_mg>.
4418 =for apidoc sv_catpvn_flags
4420 Concatenates the string onto the end of the string which is in the SV. The
4421 C<len> indicates number of bytes to copy. If the SV has the UTF8
4422 status set, then the bytes appended should be valid UTF8.
4423 If C<flags> has C<SV_GMAGIC> bit set, will C<mg_get> on C<dsv> if
4424 appropriate, else not. C<sv_catpvn> and C<sv_catpvn_nomg> are implemented
4425 in terms of this function.
4431 Perl_sv_catpvn_flags(pTHX_ register SV *dsv, register const char *sstr, register STRLEN slen, I32 flags)
4436 dstr = SvPV_force_flags(dsv, dlen, flags);
4437 SvGROW(dsv, dlen + slen + 1);
4440 Move(sstr, SvPVX(dsv) + dlen, slen, char);
4443 (void)SvPOK_only_UTF8(dsv); /* validate pointer */
4448 =for apidoc sv_catpvn_mg
4450 Like C<sv_catpvn>, but also handles 'set' magic.
4456 Perl_sv_catpvn_mg(pTHX_ register SV *sv, register const char *ptr, register STRLEN len)
4458 sv_catpvn(sv,ptr,len);
4463 =for apidoc sv_catsv
4465 Concatenates the string from SV C<ssv> onto the end of the string in
4466 SV C<dsv>. Modifies C<dsv> but not C<ssv>. Handles 'get' magic, but
4467 not 'set' magic. See C<sv_catsv_mg>.
4469 =for apidoc sv_catsv_flags
4471 Concatenates the string from SV C<ssv> onto the end of the string in
4472 SV C<dsv>. Modifies C<dsv> but not C<ssv>. If C<flags> has C<SV_GMAGIC>
4473 bit set, will C<mg_get> on the SVs if appropriate, else not. C<sv_catsv>
4474 and C<sv_catsv_nomg> are implemented in terms of this function.
4479 Perl_sv_catsv_flags(pTHX_ SV *dsv, register SV *ssv, I32 flags)
4485 if ((spv = SvPV(ssv, slen))) {
4486 /* sutf8 and dutf8 were type bool, but under USE_ITHREADS,
4487 gcc version 2.95.2 20000220 (Debian GNU/Linux) for
4488 Linux xxx 2.2.17 on sparc64 with gcc -O2, we erroneously
4489 get dutf8 = 0x20000000, (i.e. SVf_UTF8) even though
4490 dsv->sv_flags doesn't have that bit set.
4491 Andy Dougherty 12 Oct 2001
4493 I32 sutf8 = DO_UTF8(ssv);
4496 if (SvGMAGICAL(dsv) && (flags & SV_GMAGIC))
4498 dutf8 = DO_UTF8(dsv);
4500 if (dutf8 != sutf8) {
4502 /* Not modifying source SV, so taking a temporary copy. */
4503 SV* csv = sv_2mortal(newSVpvn(spv, slen));
4505 sv_utf8_upgrade(csv);
4506 spv = SvPV(csv, slen);
4509 sv_utf8_upgrade_nomg(dsv);
4511 sv_catpvn_nomg(dsv, spv, slen);
4516 =for apidoc sv_catsv_mg
4518 Like C<sv_catsv>, but also handles 'set' magic.
4524 Perl_sv_catsv_mg(pTHX_ SV *dsv, register SV *ssv)
4531 =for apidoc sv_catpv
4533 Concatenates the string onto the end of the string which is in the SV.
4534 If the SV has the UTF8 status set, then the bytes appended should be
4535 valid UTF8. Handles 'get' magic, but not 'set' magic. See C<sv_catpv_mg>.
4540 Perl_sv_catpv(pTHX_ register SV *sv, register const char *ptr)
4542 register STRLEN len;
4548 junk = SvPV_force(sv, tlen);
4550 SvGROW(sv, tlen + len + 1);
4553 Move(ptr,SvPVX(sv)+tlen,len+1,char);
4555 (void)SvPOK_only_UTF8(sv); /* validate pointer */
4560 =for apidoc sv_catpv_mg
4562 Like C<sv_catpv>, but also handles 'set' magic.
4568 Perl_sv_catpv_mg(pTHX_ register SV *sv, register const char *ptr)
4577 Create a new null SV, or if len > 0, create a new empty SVt_PV type SV
4578 with an initial PV allocation of len+1. Normally accessed via the C<NEWSV>
4585 Perl_newSV(pTHX_ STRLEN len)
4591 sv_upgrade(sv, SVt_PV);
4592 SvGROW(sv, len + 1);
4597 =for apidoc sv_magicext
4599 Adds magic to an SV, upgrading it if necessary. Applies the
4600 supplied vtable and returns pointer to the magic added.
4602 Note that sv_magicext will allow things that sv_magic will not.
4603 In particular you can add magic to SvREADONLY SVs and and more than
4604 one instance of the same 'how'
4606 I C<namelen> is greater then zero then a savepvn() I<copy> of C<name> is stored,
4607 if C<namelen> is zero then C<name> is stored as-is and - as another special
4608 case - if C<(name && namelen == HEf_SVKEY)> then C<name> is assumed to contain
4609 an C<SV*> and has its REFCNT incremented
4611 (This is now used as a subroutine by sv_magic.)
4616 Perl_sv_magicext(pTHX_ SV* sv, SV* obj, int how, MGVTBL *vtable,
4617 const char* name, I32 namlen)
4621 if (SvTYPE(sv) < SVt_PVMG) {
4622 (void)SvUPGRADE(sv, SVt_PVMG);
4624 Newz(702,mg, 1, MAGIC);
4625 mg->mg_moremagic = SvMAGIC(sv);
4628 /* Some magic sontains a reference loop, where the sv and object refer to
4629 each other. To prevent a reference loop that would prevent such
4630 objects being freed, we look for such loops and if we find one we
4631 avoid incrementing the object refcount.
4633 Note we cannot do this to avoid self-tie loops as intervening RV must
4634 have its REFCNT incremented to keep it in existence - instead we could
4635 special case them in sv_free() -- NI-S
4638 if (!obj || obj == sv ||
4639 how == PERL_MAGIC_arylen ||
4640 how == PERL_MAGIC_qr ||
4641 (SvTYPE(obj) == SVt_PVGV &&
4642 (GvSV(obj) == sv || GvHV(obj) == (HV*)sv || GvAV(obj) == (AV*)sv ||
4643 GvCV(obj) == (CV*)sv || GvIOp(obj) == (IO*)sv ||
4644 GvFORM(obj) == (CV*)sv)))
4649 mg->mg_obj = SvREFCNT_inc(obj);
4650 mg->mg_flags |= MGf_REFCOUNTED;
4653 mg->mg_len = namlen;
4656 mg->mg_ptr = savepvn(name, namlen);
4657 else if (namlen == HEf_SVKEY)
4658 mg->mg_ptr = (char*)SvREFCNT_inc((SV*)name);
4660 mg->mg_ptr = (char *) name;
4662 mg->mg_virtual = vtable;
4666 SvFLAGS(sv) &= ~(SVf_IOK|SVf_NOK|SVf_POK);
4671 =for apidoc sv_magic
4673 Adds magic to an SV. First upgrades C<sv> to type C<SVt_PVMG> if necessary,
4674 then adds a new magic item of type C<how> to the head of the magic list.
4680 Perl_sv_magic(pTHX_ register SV *sv, SV *obj, int how, const char *name, I32 namlen)
4685 #ifdef PERL_COPY_ON_WRITE
4687 sv_force_normal_flags(sv, 0);
4689 if (SvREADONLY(sv)) {
4690 if (PL_curcop != &PL_compiling
4691 && how != PERL_MAGIC_regex_global
4692 && how != PERL_MAGIC_bm
4693 && how != PERL_MAGIC_fm
4694 && how != PERL_MAGIC_sv
4697 Perl_croak(aTHX_ PL_no_modify);
4700 if (SvMAGICAL(sv) || (how == PERL_MAGIC_taint && SvTYPE(sv) >= SVt_PVMG)) {
4701 if (SvMAGIC(sv) && (mg = mg_find(sv, how))) {
4702 /* sv_magic() refuses to add a magic of the same 'how' as an
4705 if (how == PERL_MAGIC_taint)
4713 vtable = &PL_vtbl_sv;
4715 case PERL_MAGIC_overload:
4716 vtable = &PL_vtbl_amagic;
4718 case PERL_MAGIC_overload_elem:
4719 vtable = &PL_vtbl_amagicelem;
4721 case PERL_MAGIC_overload_table:
4722 vtable = &PL_vtbl_ovrld;
4725 vtable = &PL_vtbl_bm;
4727 case PERL_MAGIC_regdata:
4728 vtable = &PL_vtbl_regdata;
4730 case PERL_MAGIC_regdatum:
4731 vtable = &PL_vtbl_regdatum;
4733 case PERL_MAGIC_env:
4734 vtable = &PL_vtbl_env;
4737 vtable = &PL_vtbl_fm;
4739 case PERL_MAGIC_envelem:
4740 vtable = &PL_vtbl_envelem;
4742 case PERL_MAGIC_regex_global:
4743 vtable = &PL_vtbl_mglob;
4745 case PERL_MAGIC_isa:
4746 vtable = &PL_vtbl_isa;
4748 case PERL_MAGIC_isaelem:
4749 vtable = &PL_vtbl_isaelem;
4751 case PERL_MAGIC_nkeys:
4752 vtable = &PL_vtbl_nkeys;
4754 case PERL_MAGIC_dbfile:
4757 case PERL_MAGIC_dbline:
4758 vtable = &PL_vtbl_dbline;
4760 #ifdef USE_5005THREADS
4761 case PERL_MAGIC_mutex:
4762 vtable = &PL_vtbl_mutex;
4764 #endif /* USE_5005THREADS */
4765 #ifdef USE_LOCALE_COLLATE
4766 case PERL_MAGIC_collxfrm:
4767 vtable = &PL_vtbl_collxfrm;
4769 #endif /* USE_LOCALE_COLLATE */
4770 case PERL_MAGIC_tied:
4771 vtable = &PL_vtbl_pack;
4773 case PERL_MAGIC_tiedelem:
4774 case PERL_MAGIC_tiedscalar:
4775 vtable = &PL_vtbl_packelem;
4778 vtable = &PL_vtbl_regexp;
4780 case PERL_MAGIC_sig:
4781 vtable = &PL_vtbl_sig;
4783 case PERL_MAGIC_sigelem:
4784 vtable = &PL_vtbl_sigelem;
4786 case PERL_MAGIC_taint:
4787 vtable = &PL_vtbl_taint;
4789 case PERL_MAGIC_uvar:
4790 vtable = &PL_vtbl_uvar;
4792 case PERL_MAGIC_vec:
4793 vtable = &PL_vtbl_vec;
4795 case PERL_MAGIC_vstring:
4798 case PERL_MAGIC_substr:
4799 vtable = &PL_vtbl_substr;
4801 case PERL_MAGIC_defelem:
4802 vtable = &PL_vtbl_defelem;
4804 case PERL_MAGIC_glob:
4805 vtable = &PL_vtbl_glob;
4807 case PERL_MAGIC_arylen:
4808 vtable = &PL_vtbl_arylen;
4810 case PERL_MAGIC_pos:
4811 vtable = &PL_vtbl_pos;
4813 case PERL_MAGIC_backref:
4814 vtable = &PL_vtbl_backref;
4816 case PERL_MAGIC_ext:
4817 /* Reserved for use by extensions not perl internals. */
4818 /* Useful for attaching extension internal data to perl vars. */
4819 /* Note that multiple extensions may clash if magical scalars */
4820 /* etc holding private data from one are passed to another. */
4823 Perl_croak(aTHX_ "Don't know how to handle magic of type \\%o", how);
4826 /* Rest of work is done else where */
4827 mg = sv_magicext(sv,obj,how,vtable,name,namlen);
4830 case PERL_MAGIC_taint:
4833 case PERL_MAGIC_ext:
4834 case PERL_MAGIC_dbfile:
4841 =for apidoc sv_unmagic
4843 Removes all magic of type C<type> from an SV.
4849 Perl_sv_unmagic(pTHX_ SV *sv, int type)
4853 if (SvTYPE(sv) < SVt_PVMG || !SvMAGIC(sv))
4856 for (mg = *mgp; mg; mg = *mgp) {
4857 if (mg->mg_type == type) {
4858 MGVTBL* vtbl = mg->mg_virtual;
4859 *mgp = mg->mg_moremagic;
4860 if (vtbl && vtbl->svt_free)
4861 CALL_FPTR(vtbl->svt_free)(aTHX_ sv, mg);
4862 if (mg->mg_ptr && mg->mg_type != PERL_MAGIC_regex_global) {
4864 Safefree(mg->mg_ptr);
4865 else if (mg->mg_len == HEf_SVKEY)
4866 SvREFCNT_dec((SV*)mg->mg_ptr);
4868 if (mg->mg_flags & MGf_REFCOUNTED)
4869 SvREFCNT_dec(mg->mg_obj);
4873 mgp = &mg->mg_moremagic;
4877 SvFLAGS(sv) |= (SvFLAGS(sv) & (SVp_NOK|SVp_POK)) >> PRIVSHIFT;
4884 =for apidoc sv_rvweaken
4886 Weaken a reference: set the C<SvWEAKREF> flag on this RV; give the
4887 referred-to SV C<PERL_MAGIC_backref> magic if it hasn't already; and
4888 push a back-reference to this RV onto the array of backreferences
4889 associated with that magic.
4895 Perl_sv_rvweaken(pTHX_ SV *sv)
4898 if (!SvOK(sv)) /* let undefs pass */
4901 Perl_croak(aTHX_ "Can't weaken a nonreference");
4902 else if (SvWEAKREF(sv)) {
4903 if (ckWARN(WARN_MISC))
4904 Perl_warner(aTHX_ packWARN(WARN_MISC), "Reference is already weak");
4908 sv_add_backref(tsv, sv);
4914 /* Give tsv backref magic if it hasn't already got it, then push a
4915 * back-reference to sv onto the array associated with the backref magic.
4919 S_sv_add_backref(pTHX_ SV *tsv, SV *sv)
4923 if (SvMAGICAL(tsv) && (mg = mg_find(tsv, PERL_MAGIC_backref)))
4924 av = (AV*)mg->mg_obj;
4927 sv_magic(tsv, (SV*)av, PERL_MAGIC_backref, NULL, 0);
4928 SvREFCNT_dec(av); /* for sv_magic */
4933 /* delete a back-reference to ourselves from the backref magic associated
4934 * with the SV we point to.
4938 S_sv_del_backref(pTHX_ SV *sv)
4945 if (!SvMAGICAL(tsv) || !(mg = mg_find(tsv, PERL_MAGIC_backref)))
4946 Perl_croak(aTHX_ "panic: del_backref");
4947 av = (AV *)mg->mg_obj;
4952 svp[i] = &PL_sv_undef; /* XXX */
4959 =for apidoc sv_insert
4961 Inserts a string at the specified offset/length within the SV. Similar to
4962 the Perl substr() function.
4968 Perl_sv_insert(pTHX_ SV *bigstr, STRLEN offset, STRLEN len, char *little, STRLEN littlelen)
4972 register char *midend;
4973 register char *bigend;
4979 Perl_croak(aTHX_ "Can't modify non-existent substring");
4980 SvPV_force(bigstr, curlen);
4981 (void)SvPOK_only_UTF8(bigstr);
4982 if (offset + len > curlen) {
4983 SvGROW(bigstr, offset+len+1);
4984 Zero(SvPVX(bigstr)+curlen, offset+len-curlen, char);
4985 SvCUR_set(bigstr, offset+len);
4989 i = littlelen - len;
4990 if (i > 0) { /* string might grow */
4991 big = SvGROW(bigstr, SvCUR(bigstr) + i + 1);
4992 mid = big + offset + len;
4993 midend = bigend = big + SvCUR(bigstr);
4996 while (midend > mid) /* shove everything down */
4997 *--bigend = *--midend;
4998 Move(little,big+offset,littlelen,char);
5004 Move(little,SvPVX(bigstr)+offset,len,char);
5009 big = SvPVX(bigstr);
5012 bigend = big + SvCUR(bigstr);
5014 if (midend > bigend)
5015 Perl_croak(aTHX_ "panic: sv_insert");
5017 if (mid - big > bigend - midend) { /* faster to shorten from end */
5019 Move(little, mid, littlelen,char);
5022 i = bigend - midend;
5024 Move(midend, mid, i,char);
5028 SvCUR_set(bigstr, mid - big);
5031 else if ((i = mid - big)) { /* faster from front */
5032 midend -= littlelen;
5034 sv_chop(bigstr,midend-i);
5039 Move(little, mid, littlelen,char);
5041 else if (littlelen) {
5042 midend -= littlelen;
5043 sv_chop(bigstr,midend);
5044 Move(little,midend,littlelen,char);
5047 sv_chop(bigstr,midend);
5053 =for apidoc sv_replace
5055 Make the first argument a copy of the second, then delete the original.
5056 The target SV physically takes over ownership of the body of the source SV
5057 and inherits its flags; however, the target keeps any magic it owns,
5058 and any magic in the source is discarded.
5059 Note that this is a rather specialist SV copying operation; most of the
5060 time you'll want to use C<sv_setsv> or one of its many macro front-ends.
5066 Perl_sv_replace(pTHX_ register SV *sv, register SV *nsv)
5068 U32 refcnt = SvREFCNT(sv);
5069 SV_CHECK_THINKFIRST_COW_DROP(sv);
5070 if (SvREFCNT(nsv) != 1 && ckWARN_d(WARN_INTERNAL))
5071 Perl_warner(aTHX_ packWARN(WARN_INTERNAL), "Reference miscount in sv_replace()");
5072 if (SvMAGICAL(sv)) {
5076 sv_upgrade(nsv, SVt_PVMG);
5077 SvMAGIC(nsv) = SvMAGIC(sv);
5078 SvFLAGS(nsv) |= SvMAGICAL(sv);
5084 assert(!SvREFCNT(sv));
5085 StructCopy(nsv,sv,SV);
5086 #ifdef PERL_COPY_ON_WRITE
5087 if (SvIsCOW_normal(nsv)) {
5088 /* We need to follow the pointers around the loop to make the
5089 previous SV point to sv, rather than nsv. */
5092 while ((next = SV_COW_NEXT_SV(current)) != nsv) {
5095 assert(SvPVX(current) == SvPVX(nsv));
5097 /* Make the SV before us point to the SV after us. */
5099 PerlIO_printf(Perl_debug_log, "previous is\n");
5101 PerlIO_printf(Perl_debug_log,
5102 "move it from 0x%"UVxf" to 0x%"UVxf"\n",
5103 (UV) SV_COW_NEXT_SV(current), (UV) sv);
5105 SV_COW_NEXT_SV_SET(current, sv);
5108 SvREFCNT(sv) = refcnt;
5109 SvFLAGS(nsv) |= SVTYPEMASK; /* Mark as freed */
5114 =for apidoc sv_clear
5116 Clear an SV: call any destructors, free up any memory used by the body,
5117 and free the body itself. The SV's head is I<not> freed, although
5118 its type is set to all 1's so that it won't inadvertently be assumed
5119 to be live during global destruction etc.
5120 This function should only be called when REFCNT is zero. Most of the time
5121 you'll want to call C<sv_free()> (or its macro wrapper C<SvREFCNT_dec>)
5128 Perl_sv_clear(pTHX_ register SV *sv)
5132 assert(SvREFCNT(sv) == 0);
5135 if (PL_defstash) { /* Still have a symbol table? */
5140 Zero(&tmpref, 1, SV);
5141 sv_upgrade(&tmpref, SVt_RV);
5143 SvREADONLY_on(&tmpref); /* DESTROY() could be naughty */
5144 SvREFCNT(&tmpref) = 1;
5147 stash = SvSTASH(sv);
5148 destructor = StashHANDLER(stash,DESTROY);
5151 PUSHSTACKi(PERLSI_DESTROY);
5152 SvRV(&tmpref) = SvREFCNT_inc(sv);
5157 call_sv((SV*)destructor, G_DISCARD|G_EVAL|G_KEEPERR);
5163 } while (SvOBJECT(sv) && SvSTASH(sv) != stash);
5165 del_XRV(SvANY(&tmpref));
5168 if (PL_in_clean_objs)
5169 Perl_croak(aTHX_ "DESTROY created new reference to dead object '%s'",
5171 /* DESTROY gave object new lease on life */
5177 SvREFCNT_dec(SvSTASH(sv)); /* possibly of changed persuasion */
5178 SvOBJECT_off(sv); /* Curse the object. */
5179 if (SvTYPE(sv) != SVt_PVIO)
5180 --PL_sv_objcount; /* XXX Might want something more general */
5183 if (SvTYPE(sv) >= SVt_PVMG) {
5186 if (SvFLAGS(sv) & SVpad_TYPED)
5187 SvREFCNT_dec(SvSTASH(sv));
5190 switch (SvTYPE(sv)) {
5193 IoIFP(sv) != PerlIO_stdin() &&
5194 IoIFP(sv) != PerlIO_stdout() &&
5195 IoIFP(sv) != PerlIO_stderr())
5197 io_close((IO*)sv, FALSE);
5199 if (IoDIRP(sv) && !(IoFLAGS(sv) & IOf_FAKE_DIRP))
5200 PerlDir_close(IoDIRP(sv));
5201 IoDIRP(sv) = (DIR*)NULL;
5202 Safefree(IoTOP_NAME(sv));
5203 Safefree(IoFMT_NAME(sv));
5204 Safefree(IoBOTTOM_NAME(sv));
5219 SvREFCNT_dec(LvTARG(sv));
5223 Safefree(GvNAME(sv));
5224 /* cannot decrease stash refcount yet, as we might recursively delete
5225 ourselves when the refcnt drops to zero. Delay SvREFCNT_dec
5226 of stash until current sv is completely gone.
5227 -- JohnPC, 27 Mar 1998 */
5228 stash = GvSTASH(sv);
5234 (void)SvOOK_off(sv);
5242 SvREFCNT_dec(SvRV(sv));
5244 #ifdef PERL_COPY_ON_WRITE
5245 else if (SvPVX(sv)) {
5247 /* I believe I need to grab the global SV mutex here and
5248 then recheck the COW status. */
5250 PerlIO_printf(Perl_debug_log, "Copy on write: clear\n");
5253 sv_release_COW(sv, SvPVX(sv), SvCUR(sv), SvLEN(sv),
5254 SvUVX(sv), SV_COW_NEXT_SV(sv));
5255 /* And drop it here. */
5257 } else if (SvLEN(sv)) {
5258 Safefree(SvPVX(sv));
5262 else if (SvPVX(sv) && SvLEN(sv))
5263 Safefree(SvPVX(sv));
5264 else if (SvPVX(sv) && SvREADONLY(sv) && SvFAKE(sv)) {
5265 unsharepvn(SvPVX(sv),
5266 SvUTF8(sv) ? -(I32)SvCUR(sv) : SvCUR(sv),
5280 switch (SvTYPE(sv)) {
5296 del_XPVIV(SvANY(sv));
5299 del_XPVNV(SvANY(sv));
5302 del_XPVMG(SvANY(sv));
5305 del_XPVLV(SvANY(sv));
5308 del_XPVAV(SvANY(sv));
5311 del_XPVHV(SvANY(sv));
5314 del_XPVCV(SvANY(sv));
5317 del_XPVGV(SvANY(sv));
5318 /* code duplication for increased performance. */
5319 SvFLAGS(sv) &= SVf_BREAK;
5320 SvFLAGS(sv) |= SVTYPEMASK;
5321 /* decrease refcount of the stash that owns this GV, if any */
5323 SvREFCNT_dec(stash);
5324 return; /* not break, SvFLAGS reset already happened */
5326 del_XPVBM(SvANY(sv));
5329 del_XPVFM(SvANY(sv));
5332 del_XPVIO(SvANY(sv));
5335 SvFLAGS(sv) &= SVf_BREAK;
5336 SvFLAGS(sv) |= SVTYPEMASK;
5340 =for apidoc sv_newref
5342 Increment an SV's reference count. Use the C<SvREFCNT_inc()> wrapper
5349 Perl_sv_newref(pTHX_ SV *sv)
5352 ATOMIC_INC(SvREFCNT(sv));
5359 Decrement an SV's reference count, and if it drops to zero, call
5360 C<sv_clear> to invoke destructors and free up any memory used by
5361 the body; finally, deallocate the SV's head itself.
5362 Normally called via a wrapper macro C<SvREFCNT_dec>.
5368 Perl_sv_free(pTHX_ SV *sv)
5370 int refcount_is_zero;
5374 if (SvREFCNT(sv) == 0) {
5375 if (SvFLAGS(sv) & SVf_BREAK)
5376 /* this SV's refcnt has been artificially decremented to
5377 * trigger cleanup */
5379 if (PL_in_clean_all) /* All is fair */
5381 if (SvREADONLY(sv) && SvIMMORTAL(sv)) {
5382 /* make sure SvREFCNT(sv)==0 happens very seldom */
5383 SvREFCNT(sv) = (~(U32)0)/2;
5386 if (ckWARN_d(WARN_INTERNAL))
5387 Perl_warner(aTHX_ packWARN(WARN_INTERNAL), "Attempt to free unreferenced scalar");
5390 ATOMIC_DEC_AND_TEST(refcount_is_zero, SvREFCNT(sv));
5391 if (!refcount_is_zero)
5395 if (ckWARN_d(WARN_DEBUGGING))
5396 Perl_warner(aTHX_ packWARN(WARN_DEBUGGING),
5397 "Attempt to free temp prematurely: SV 0x%"UVxf,
5402 if (SvREADONLY(sv) && SvIMMORTAL(sv)) {
5403 /* make sure SvREFCNT(sv)==0 happens very seldom */
5404 SvREFCNT(sv) = (~(U32)0)/2;
5415 Returns the length of the string in the SV. Handles magic and type
5416 coercion. See also C<SvCUR>, which gives raw access to the xpv_cur slot.
5422 Perl_sv_len(pTHX_ register SV *sv)
5430 len = mg_length(sv);
5432 (void)SvPV(sv, len);
5437 =for apidoc sv_len_utf8
5439 Returns the number of characters in the string in an SV, counting wide
5440 UTF8 bytes as a single character. Handles magic and type coercion.
5446 Perl_sv_len_utf8(pTHX_ register SV *sv)
5452 return mg_length(sv);
5456 U8 *s = (U8*)SvPV(sv, len);
5458 return Perl_utf8_length(aTHX_ s, s + len);
5463 =for apidoc sv_pos_u2b
5465 Converts the value pointed to by offsetp from a count of UTF8 chars from
5466 the start of the string, to a count of the equivalent number of bytes; if
5467 lenp is non-zero, it does the same to lenp, but this time starting from
5468 the offset, rather than from the start of the string. Handles magic and
5475 Perl_sv_pos_u2b(pTHX_ register SV *sv, I32* offsetp, I32* lenp)
5480 I32 uoffset = *offsetp;
5486 start = s = (U8*)SvPV(sv, len);
5488 while (s < send && uoffset--)
5492 *offsetp = s - start;
5496 while (s < send && ulen--)
5506 =for apidoc sv_pos_b2u
5508 Converts the value pointed to by offsetp from a count of bytes from the
5509 start of the string, to a count of the equivalent number of UTF8 chars.
5510 Handles magic and type coercion.
5516 Perl_sv_pos_b2u(pTHX_ register SV *sv, I32* offsetp)
5525 s = (U8*)SvPV(sv, len);
5526 if ((I32)len < *offsetp)
5527 Perl_croak(aTHX_ "panic: sv_pos_b2u: bad byte offset");
5528 send = s + *offsetp;
5532 /* Call utf8n_to_uvchr() to validate the sequence
5533 * (unless a simple non-UTF character) */
5534 if (!UTF8_IS_INVARIANT(*s))
5535 utf8n_to_uvchr(s, UTF8SKIP(s), &n, 0);
5550 Returns a boolean indicating whether the strings in the two SVs are
5551 identical. Is UTF-8 and 'use bytes' aware, handles get magic, and will
5552 coerce its args to strings if necessary.
5558 Perl_sv_eq(pTHX_ register SV *sv1, register SV *sv2)
5566 SV* svrecode = Nullsv;
5573 pv1 = SvPV(sv1, cur1);
5580 pv2 = SvPV(sv2, cur2);
5582 if (cur1 && cur2 && SvUTF8(sv1) != SvUTF8(sv2) && !IN_BYTES) {
5583 /* Differing utf8ness.
5584 * Do not UTF8size the comparands as a side-effect. */
5587 svrecode = newSVpvn(pv2, cur2);
5588 sv_recode_to_utf8(svrecode, PL_encoding);
5589 pv2 = SvPV(svrecode, cur2);
5592 svrecode = newSVpvn(pv1, cur1);
5593 sv_recode_to_utf8(svrecode, PL_encoding);
5594 pv1 = SvPV(svrecode, cur1);
5596 /* Now both are in UTF-8. */
5601 bool is_utf8 = TRUE;
5604 /* sv1 is the UTF-8 one,
5605 * if is equal it must be downgrade-able */
5606 char *pv = (char*)bytes_from_utf8((U8*)pv1,
5612 /* sv2 is the UTF-8 one,
5613 * if is equal it must be downgrade-able */
5614 char *pv = (char *)bytes_from_utf8((U8*)pv2,
5620 /* Downgrade not possible - cannot be eq */
5627 eq = (pv1 == pv2) || memEQ(pv1, pv2, cur1);
5630 SvREFCNT_dec(svrecode);
5641 Compares the strings in two SVs. Returns -1, 0, or 1 indicating whether the
5642 string in C<sv1> is less than, equal to, or greater than the string in
5643 C<sv2>. Is UTF-8 and 'use bytes' aware, handles get magic, and will
5644 coerce its args to strings if necessary. See also C<sv_cmp_locale>.
5650 Perl_sv_cmp(pTHX_ register SV *sv1, register SV *sv2)
5653 char *pv1, *pv2, *tpv = Nullch;
5655 SV *svrecode = Nullsv;
5662 pv1 = SvPV(sv1, cur1);
5669 pv2 = SvPV(sv2, cur2);
5671 if (cur1 && cur2 && SvUTF8(sv1) != SvUTF8(sv2) && !IN_BYTES) {
5672 /* Differing utf8ness.
5673 * Do not UTF8size the comparands as a side-effect. */
5676 svrecode = newSVpvn(pv2, cur2);
5677 sv_recode_to_utf8(svrecode, PL_encoding);
5678 pv2 = SvPV(svrecode, cur2);
5681 pv2 = tpv = (char*)bytes_to_utf8((U8*)pv2, &cur2);
5686 svrecode = newSVpvn(pv1, cur1);
5687 sv_recode_to_utf8(svrecode, PL_encoding);
5688 pv1 = SvPV(svrecode, cur1);
5691 pv1 = tpv = (char*)bytes_to_utf8((U8*)pv1, &cur1);
5697 cmp = cur2 ? -1 : 0;
5701 I32 retval = memcmp((void*)pv1, (void*)pv2, cur1 < cur2 ? cur1 : cur2);
5704 cmp = retval < 0 ? -1 : 1;
5705 } else if (cur1 == cur2) {
5708 cmp = cur1 < cur2 ? -1 : 1;
5713 SvREFCNT_dec(svrecode);
5722 =for apidoc sv_cmp_locale
5724 Compares the strings in two SVs in a locale-aware manner. Is UTF-8 and
5725 'use bytes' aware, handles get magic, and will coerce its args to strings
5726 if necessary. See also C<sv_cmp_locale>. See also C<sv_cmp>.
5732 Perl_sv_cmp_locale(pTHX_ register SV *sv1, register SV *sv2)
5734 #ifdef USE_LOCALE_COLLATE
5740 if (PL_collation_standard)
5744 pv1 = sv1 ? sv_collxfrm(sv1, &len1) : (char *) NULL;
5746 pv2 = sv2 ? sv_collxfrm(sv2, &len2) : (char *) NULL;
5748 if (!pv1 || !len1) {
5759 retval = memcmp((void*)pv1, (void*)pv2, len1 < len2 ? len1 : len2);
5762 return retval < 0 ? -1 : 1;
5765 * When the result of collation is equality, that doesn't mean
5766 * that there are no differences -- some locales exclude some
5767 * characters from consideration. So to avoid false equalities,
5768 * we use the raw string as a tiebreaker.
5774 #endif /* USE_LOCALE_COLLATE */
5776 return sv_cmp(sv1, sv2);
5780 #ifdef USE_LOCALE_COLLATE
5783 =for apidoc sv_collxfrm
5785 Add Collate Transform magic to an SV if it doesn't already have it.
5787 Any scalar variable may carry PERL_MAGIC_collxfrm magic that contains the
5788 scalar data of the variable, but transformed to such a format that a normal
5789 memory comparison can be used to compare the data according to the locale
5796 Perl_sv_collxfrm(pTHX_ SV *sv, STRLEN *nxp)
5800 mg = SvMAGICAL(sv) ? mg_find(sv, PERL_MAGIC_collxfrm) : (MAGIC *) NULL;
5801 if (!mg || !mg->mg_ptr || *(U32*)mg->mg_ptr != PL_collation_ix) {
5806 Safefree(mg->mg_ptr);
5808 if ((xf = mem_collxfrm(s, len, &xlen))) {
5809 if (SvREADONLY(sv)) {
5812 return xf + sizeof(PL_collation_ix);
5815 sv_magic(sv, 0, PERL_MAGIC_collxfrm, 0, 0);
5816 mg = mg_find(sv, PERL_MAGIC_collxfrm);
5829 if (mg && mg->mg_ptr) {
5831 return mg->mg_ptr + sizeof(PL_collation_ix);
5839 #endif /* USE_LOCALE_COLLATE */
5844 Get a line from the filehandle and store it into the SV, optionally
5845 appending to the currently-stored string.
5851 Perl_sv_gets(pTHX_ register SV *sv, register PerlIO *fp, I32 append)
5855 register STDCHAR rslast;
5856 register STDCHAR *bp;
5861 SV_CHECK_THINKFIRST_COW_DROP(sv);
5862 /* XXX. If you make this PVIV, then copy on write can copy scalars read
5864 However, perlbench says it's slower, because the existing swipe code
5865 is faster than copy on write.
5866 Swings and roundabouts. */
5867 (void)SvUPGRADE(sv, SVt_PV);
5871 if (PL_curcop == &PL_compiling) {
5872 /* we always read code in line mode */
5876 else if (RsSNARF(PL_rs)) {
5880 else if (RsRECORD(PL_rs)) {
5881 I32 recsize, bytesread;
5884 /* Grab the size of the record we're getting */
5885 recsize = SvIV(SvRV(PL_rs));
5886 (void)SvPOK_only(sv); /* Validate pointer */
5887 buffer = SvGROW(sv, (STRLEN)(recsize + 1));
5890 /* VMS wants read instead of fread, because fread doesn't respect */
5891 /* RMS record boundaries. This is not necessarily a good thing to be */
5892 /* doing, but we've got no other real choice */
5893 bytesread = PerlLIO_read(PerlIO_fileno(fp), buffer, recsize);
5895 bytesread = PerlIO_read(fp, buffer, recsize);
5897 SvCUR_set(sv, bytesread);
5898 buffer[bytesread] = '\0';
5899 if (PerlIO_isutf8(fp))
5903 return(SvCUR(sv) ? SvPVX(sv) : Nullch);
5905 else if (RsPARA(PL_rs)) {
5911 /* Get $/ i.e. PL_rs into same encoding as stream wants */
5912 if (PerlIO_isutf8(fp)) {
5913 rsptr = SvPVutf8(PL_rs, rslen);
5916 if (SvUTF8(PL_rs)) {
5917 if (!sv_utf8_downgrade(PL_rs, TRUE)) {
5918 Perl_croak(aTHX_ "Wide character in $/");
5921 rsptr = SvPV(PL_rs, rslen);
5925 rslast = rslen ? rsptr[rslen - 1] : '\0';
5927 if (rspara) { /* have to do this both before and after */
5928 do { /* to make sure file boundaries work right */
5931 i = PerlIO_getc(fp);
5935 PerlIO_ungetc(fp,i);
5941 /* See if we know enough about I/O mechanism to cheat it ! */
5943 /* This used to be #ifdef test - it is made run-time test for ease
5944 of abstracting out stdio interface. One call should be cheap
5945 enough here - and may even be a macro allowing compile
5949 if (PerlIO_fast_gets(fp)) {
5952 * We're going to steal some values from the stdio struct
5953 * and put EVERYTHING in the innermost loop into registers.
5955 register STDCHAR *ptr;
5959 #if defined(VMS) && defined(PERLIO_IS_STDIO)
5960 /* An ungetc()d char is handled separately from the regular
5961 * buffer, so we getc() it back out and stuff it in the buffer.
5963 i = PerlIO_getc(fp);
5964 if (i == EOF) return 0;
5965 *(--((*fp)->_ptr)) = (unsigned char) i;
5969 /* Here is some breathtakingly efficient cheating */
5971 cnt = PerlIO_get_cnt(fp); /* get count into register */
5972 (void)SvPOK_only(sv); /* validate pointer */
5973 if ((I32)(SvLEN(sv) - append) <= cnt + 1) { /* make sure we have the room */
5974 if (cnt > 80 && (I32)SvLEN(sv) > append) {
5975 shortbuffered = cnt - SvLEN(sv) + append + 1;
5976 cnt -= shortbuffered;
5980 /* remember that cnt can be negative */
5981 SvGROW(sv, (STRLEN)(append + (cnt <= 0 ? 2 : (cnt + 1))));
5986 bp = (STDCHAR*)SvPVX(sv) + append; /* move these two too to registers */
5987 ptr = (STDCHAR*)PerlIO_get_ptr(fp);
5988 DEBUG_P(PerlIO_printf(Perl_debug_log,
5989 "Screamer: entering, ptr=%"UVuf", cnt=%ld\n",PTR2UV(ptr),(long)cnt));
5990 DEBUG_P(PerlIO_printf(Perl_debug_log,
5991 "Screamer: entering: PerlIO * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
5992 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
5993 PTR2UV(PerlIO_has_base(fp) ? PerlIO_get_base(fp) : 0)));
5998 while (cnt > 0) { /* this | eat */
6000 if ((*bp++ = *ptr++) == rslast) /* really | dust */
6001 goto thats_all_folks; /* screams | sed :-) */
6005 Copy(ptr, bp, cnt, char); /* this | eat */
6006 bp += cnt; /* screams | dust */
6007 ptr += cnt; /* louder | sed :-) */
6012 if (shortbuffered) { /* oh well, must extend */
6013 cnt = shortbuffered;
6015 bpx = bp - (STDCHAR*)SvPVX(sv); /* box up before relocation */
6017 SvGROW(sv, SvLEN(sv) + append + cnt + 2);
6018 bp = (STDCHAR*)SvPVX(sv) + bpx; /* unbox after relocation */
6022 DEBUG_P(PerlIO_printf(Perl_debug_log,
6023 "Screamer: going to getc, ptr=%"UVuf", cnt=%ld\n",
6024 PTR2UV(ptr),(long)cnt));
6025 PerlIO_set_ptrcnt(fp, (STDCHAR*)ptr, cnt); /* deregisterize cnt and ptr */
6027 DEBUG_P(PerlIO_printf(Perl_debug_log,
6028 "Screamer: pre: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
6029 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
6030 PTR2UV(PerlIO_has_base (fp) ? PerlIO_get_base(fp) : 0)));
6032 /* This used to call 'filbuf' in stdio form, but as that behaves like
6033 getc when cnt <= 0 we use PerlIO_getc here to avoid introducing
6034 another abstraction. */
6035 i = PerlIO_getc(fp); /* get more characters */
6037 DEBUG_P(PerlIO_printf(Perl_debug_log,
6038 "Screamer: post: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
6039 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
6040 PTR2UV(PerlIO_has_base (fp) ? PerlIO_get_base(fp) : 0)));
6042 cnt = PerlIO_get_cnt(fp);
6043 ptr = (STDCHAR*)PerlIO_get_ptr(fp); /* reregisterize cnt and ptr */
6044 DEBUG_P(PerlIO_printf(Perl_debug_log,
6045 "Screamer: after getc, ptr=%"UVuf", cnt=%ld\n",PTR2UV(ptr),(long)cnt));
6047 if (i == EOF) /* all done for ever? */
6048 goto thats_really_all_folks;
6050 bpx = bp - (STDCHAR*)SvPVX(sv); /* box up before relocation */
6052 SvGROW(sv, bpx + cnt + 2);
6053 bp = (STDCHAR*)SvPVX(sv) + bpx; /* unbox after relocation */
6055 *bp++ = (STDCHAR)i; /* store character from PerlIO_getc */
6057 if (rslen && (STDCHAR)i == rslast) /* all done for now? */
6058 goto thats_all_folks;
6062 if ((rslen > 1 && (STRLEN)(bp - (STDCHAR*)SvPVX(sv)) < rslen) ||
6063 memNE((char*)bp - rslen, rsptr, rslen))
6064 goto screamer; /* go back to the fray */
6065 thats_really_all_folks:
6067 cnt += shortbuffered;
6068 DEBUG_P(PerlIO_printf(Perl_debug_log,
6069 "Screamer: quitting, ptr=%"UVuf", cnt=%ld\n",PTR2UV(ptr),(long)cnt));
6070 PerlIO_set_ptrcnt(fp, (STDCHAR*)ptr, cnt); /* put these back or we're in trouble */
6071 DEBUG_P(PerlIO_printf(Perl_debug_log,
6072 "Screamer: end: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
6073 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
6074 PTR2UV(PerlIO_has_base (fp) ? PerlIO_get_base(fp) : 0)));
6076 SvCUR_set(sv, bp - (STDCHAR*)SvPVX(sv)); /* set length */
6077 DEBUG_P(PerlIO_printf(Perl_debug_log,
6078 "Screamer: done, len=%ld, string=|%.*s|\n",
6079 (long)SvCUR(sv),(int)SvCUR(sv),SvPVX(sv)));
6084 /*The big, slow, and stupid way */
6087 /* Need to work around EPOC SDK features */
6088 /* On WINS: MS VC5 generates calls to _chkstk, */
6089 /* if a `large' stack frame is allocated */
6090 /* gcc on MARM does not generate calls like these */
6096 register STDCHAR *bpe = buf + sizeof(buf);
6098 while ((i = PerlIO_getc(fp)) != EOF && (*bp++ = (STDCHAR)i) != rslast && bp < bpe)
6099 ; /* keep reading */
6103 cnt = PerlIO_read(fp,(char*)buf, sizeof(buf));
6104 /* Accomodate broken VAXC compiler, which applies U8 cast to
6105 * both args of ?: operator, causing EOF to change into 255
6108 i = (U8)buf[cnt - 1];
6114 cnt = 0; /* we do need to re-set the sv even when cnt <= 0 */
6116 sv_catpvn(sv, (char *) buf, cnt);
6118 sv_setpvn(sv, (char *) buf, cnt);
6120 if (i != EOF && /* joy */
6122 SvCUR(sv) < rslen ||
6123 memNE(SvPVX(sv) + SvCUR(sv) - rslen, rsptr, rslen)))
6127 * If we're reading from a TTY and we get a short read,
6128 * indicating that the user hit his EOF character, we need
6129 * to notice it now, because if we try to read from the TTY
6130 * again, the EOF condition will disappear.
6132 * The comparison of cnt to sizeof(buf) is an optimization
6133 * that prevents unnecessary calls to feof().
6137 if (!(cnt < sizeof(buf) && PerlIO_eof(fp)))
6142 if (rspara) { /* have to do this both before and after */
6143 while (i != EOF) { /* to make sure file boundaries work right */
6144 i = PerlIO_getc(fp);
6146 PerlIO_ungetc(fp,i);
6152 if (PerlIO_isutf8(fp))
6157 return (SvCUR(sv) - append) ? SvPVX(sv) : Nullch;
6163 Auto-increment of the value in the SV, doing string to numeric conversion
6164 if necessary. Handles 'get' magic.
6170 Perl_sv_inc(pTHX_ register SV *sv)
6179 if (SvTHINKFIRST(sv)) {
6181 sv_force_normal_flags(sv, 0);
6182 if (SvREADONLY(sv)) {
6183 if (PL_curcop != &PL_compiling)
6184 Perl_croak(aTHX_ PL_no_modify);
6188 if (SvAMAGIC(sv) && AMG_CALLun(sv,inc))
6190 i = PTR2IV(SvRV(sv));
6195 flags = SvFLAGS(sv);
6196 if ((flags & (SVp_NOK|SVp_IOK)) == SVp_NOK) {
6197 /* It's (privately or publicly) a float, but not tested as an
6198 integer, so test it to see. */
6200 flags = SvFLAGS(sv);
6202 if ((flags & SVf_IOK) || ((flags & (SVp_IOK | SVp_NOK)) == SVp_IOK)) {
6203 /* It's publicly an integer, or privately an integer-not-float */
6204 #ifdef PERL_PRESERVE_IVUV
6208 if (SvUVX(sv) == UV_MAX)
6209 sv_setnv(sv, UV_MAX_P1);
6211 (void)SvIOK_only_UV(sv);
6214 if (SvIVX(sv) == IV_MAX)
6215 sv_setuv(sv, (UV)IV_MAX + 1);
6217 (void)SvIOK_only(sv);
6223 if (flags & SVp_NOK) {
6224 (void)SvNOK_only(sv);
6229 if (!(flags & SVp_POK) || !*SvPVX(sv)) {
6230 if ((flags & SVTYPEMASK) < SVt_PVIV)
6231 sv_upgrade(sv, SVt_IV);
6232 (void)SvIOK_only(sv);
6237 while (isALPHA(*d)) d++;
6238 while (isDIGIT(*d)) d++;
6240 #ifdef PERL_PRESERVE_IVUV
6241 /* Got to punt this as an integer if needs be, but we don't issue
6242 warnings. Probably ought to make the sv_iv_please() that does
6243 the conversion if possible, and silently. */
6244 int numtype = grok_number(SvPVX(sv), SvCUR(sv), NULL);
6245 if (numtype && !(numtype & IS_NUMBER_INFINITY)) {
6246 /* Need to try really hard to see if it's an integer.
6247 9.22337203685478e+18 is an integer.
6248 but "9.22337203685478e+18" + 0 is UV=9223372036854779904
6249 so $a="9.22337203685478e+18"; $a+0; $a++
6250 needs to be the same as $a="9.22337203685478e+18"; $a++
6257 /* sv_2iv *should* have made this an NV */
6258 if (flags & SVp_NOK) {
6259 (void)SvNOK_only(sv);
6263 /* I don't think we can get here. Maybe I should assert this
6264 And if we do get here I suspect that sv_setnv will croak. NWC
6266 #if defined(USE_LONG_DOUBLE)
6267 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",
6268 SvPVX(sv), SvIVX(sv), SvNVX(sv)));
6270 DEBUG_c(PerlIO_printf(Perl_debug_log,"sv_inc punt failed to convert '%s' to IOK or NOKp, UV=0x%"UVxf" NV=%"NVgf"\n",
6271 SvPVX(sv), SvIVX(sv), SvNVX(sv)));
6274 #endif /* PERL_PRESERVE_IVUV */
6275 sv_setnv(sv,Atof(SvPVX(sv)) + 1.0);
6279 while (d >= SvPVX(sv)) {
6287 /* MKS: The original code here died if letters weren't consecutive.
6288 * at least it didn't have to worry about non-C locales. The
6289 * new code assumes that ('z'-'a')==('Z'-'A'), letters are
6290 * arranged in order (although not consecutively) and that only
6291 * [A-Za-z] are accepted by isALPHA in the C locale.
6293 if (*d != 'z' && *d != 'Z') {
6294 do { ++*d; } while (!isALPHA(*d));
6297 *(d--) -= 'z' - 'a';
6302 *(d--) -= 'z' - 'a' + 1;
6306 /* oh,oh, the number grew */
6307 SvGROW(sv, SvCUR(sv) + 2);
6309 for (d = SvPVX(sv) + SvCUR(sv); d > SvPVX(sv); d--)
6320 Auto-decrement of the value in the SV, doing string to numeric conversion
6321 if necessary. Handles 'get' magic.
6327 Perl_sv_dec(pTHX_ register SV *sv)
6335 if (SvTHINKFIRST(sv)) {
6337 sv_force_normal_flags(sv, 0);
6338 if (SvREADONLY(sv)) {
6339 if (PL_curcop != &PL_compiling)
6340 Perl_croak(aTHX_ PL_no_modify);
6344 if (SvAMAGIC(sv) && AMG_CALLun(sv,dec))
6346 i = PTR2IV(SvRV(sv));
6351 /* Unlike sv_inc we don't have to worry about string-never-numbers
6352 and keeping them magic. But we mustn't warn on punting */
6353 flags = SvFLAGS(sv);
6354 if ((flags & SVf_IOK) || ((flags & (SVp_IOK | SVp_NOK)) == SVp_IOK)) {
6355 /* It's publicly an integer, or privately an integer-not-float */
6356 #ifdef PERL_PRESERVE_IVUV
6360 if (SvUVX(sv) == 0) {
6361 (void)SvIOK_only(sv);
6365 (void)SvIOK_only_UV(sv);
6369 if (SvIVX(sv) == IV_MIN)
6370 sv_setnv(sv, (NV)IV_MIN - 1.0);
6372 (void)SvIOK_only(sv);
6378 if (flags & SVp_NOK) {
6380 (void)SvNOK_only(sv);
6383 if (!(flags & SVp_POK)) {
6384 if ((flags & SVTYPEMASK) < SVt_PVNV)
6385 sv_upgrade(sv, SVt_NV);
6387 (void)SvNOK_only(sv);
6390 #ifdef PERL_PRESERVE_IVUV
6392 int numtype = grok_number(SvPVX(sv), SvCUR(sv), NULL);
6393 if (numtype && !(numtype & IS_NUMBER_INFINITY)) {
6394 /* Need to try really hard to see if it's an integer.
6395 9.22337203685478e+18 is an integer.
6396 but "9.22337203685478e+18" + 0 is UV=9223372036854779904
6397 so $a="9.22337203685478e+18"; $a+0; $a--
6398 needs to be the same as $a="9.22337203685478e+18"; $a--
6405 /* sv_2iv *should* have made this an NV */
6406 if (flags & SVp_NOK) {
6407 (void)SvNOK_only(sv);
6411 /* I don't think we can get here. Maybe I should assert this
6412 And if we do get here I suspect that sv_setnv will croak. NWC
6414 #if defined(USE_LONG_DOUBLE)
6415 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",
6416 SvPVX(sv), SvIVX(sv), SvNVX(sv)));
6418 DEBUG_c(PerlIO_printf(Perl_debug_log,"sv_dec punt failed to convert '%s' to IOK or NOKp, UV=0x%"UVxf" NV=%"NVgf"\n",
6419 SvPVX(sv), SvIVX(sv), SvNVX(sv)));
6423 #endif /* PERL_PRESERVE_IVUV */
6424 sv_setnv(sv,Atof(SvPVX(sv)) - 1.0); /* punt */
6428 =for apidoc sv_mortalcopy
6430 Creates a new SV which is a copy of the original SV (using C<sv_setsv>).
6431 The new SV is marked as mortal. It will be destroyed "soon", either by an
6432 explicit call to FREETMPS, or by an implicit call at places such as
6433 statement boundaries. See also C<sv_newmortal> and C<sv_2mortal>.
6438 /* Make a string that will exist for the duration of the expression
6439 * evaluation. Actually, it may have to last longer than that, but
6440 * hopefully we won't free it until it has been assigned to a
6441 * permanent location. */
6444 Perl_sv_mortalcopy(pTHX_ SV *oldstr)
6449 sv_setsv(sv,oldstr);
6451 PL_tmps_stack[++PL_tmps_ix] = sv;
6457 =for apidoc sv_newmortal
6459 Creates a new null SV which is mortal. The reference count of the SV is
6460 set to 1. It will be destroyed "soon", either by an explicit call to
6461 FREETMPS, or by an implicit call at places such as statement boundaries.
6462 See also C<sv_mortalcopy> and C<sv_2mortal>.
6468 Perl_sv_newmortal(pTHX)
6473 SvFLAGS(sv) = SVs_TEMP;
6475 PL_tmps_stack[++PL_tmps_ix] = sv;
6480 =for apidoc sv_2mortal
6482 Marks an existing SV as mortal. The SV will be destroyed "soon", either
6483 by an explicit call to FREETMPS, or by an implicit call at places such as
6484 statement boundaries. See also C<sv_newmortal> and C<sv_mortalcopy>.
6490 Perl_sv_2mortal(pTHX_ register SV *sv)
6494 if (SvREADONLY(sv) && SvIMMORTAL(sv))
6497 PL_tmps_stack[++PL_tmps_ix] = sv;
6505 Creates a new SV and copies a string into it. The reference count for the
6506 SV is set to 1. If C<len> is zero, Perl will compute the length using
6507 strlen(). For efficiency, consider using C<newSVpvn> instead.
6513 Perl_newSVpv(pTHX_ const char *s, STRLEN len)
6520 sv_setpvn(sv,s,len);
6525 =for apidoc newSVpvn
6527 Creates a new SV and copies a string into it. The reference count for the
6528 SV is set to 1. Note that if C<len> is zero, Perl will create a zero length
6529 string. You are responsible for ensuring that the source string is at least
6536 Perl_newSVpvn(pTHX_ const char *s, STRLEN len)
6541 sv_setpvn(sv,s,len);
6546 =for apidoc newSVpvn_share
6548 Creates a new SV with its SvPVX pointing to a shared string in the string
6549 table. If the string does not already exist in the table, it is created
6550 first. Turns on READONLY and FAKE. The string's hash is stored in the UV
6551 slot of the SV; if the C<hash> parameter is non-zero, that value is used;
6552 otherwise the hash is computed. The idea here is that as the string table
6553 is used for shared hash keys these strings will have SvPVX == HeKEY and
6554 hash lookup will avoid string compare.
6560 Perl_newSVpvn_share(pTHX_ const char *src, I32 len, U32 hash)
6563 bool is_utf8 = FALSE;
6565 STRLEN tmplen = -len;
6567 /* See the note in hv.c:hv_fetch() --jhi */
6568 src = (char*)bytes_from_utf8((U8*)src, &tmplen, &is_utf8);
6572 PERL_HASH(hash, src, len);
6574 sv_upgrade(sv, SVt_PVIV);
6575 SvPVX(sv) = sharepvn(src, is_utf8?-len:len, hash);
6588 #if defined(PERL_IMPLICIT_CONTEXT)
6590 /* pTHX_ magic can't cope with varargs, so this is a no-context
6591 * version of the main function, (which may itself be aliased to us).
6592 * Don't access this version directly.
6596 Perl_newSVpvf_nocontext(const char* pat, ...)
6601 va_start(args, pat);
6602 sv = vnewSVpvf(pat, &args);
6609 =for apidoc newSVpvf
6611 Creates a new SV and initializes it with the string formatted like
6618 Perl_newSVpvf(pTHX_ const char* pat, ...)
6622 va_start(args, pat);
6623 sv = vnewSVpvf(pat, &args);
6628 /* backend for newSVpvf() and newSVpvf_nocontext() */
6631 Perl_vnewSVpvf(pTHX_ const char* pat, va_list* args)
6635 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
6642 Creates a new SV and copies a floating point value into it.
6643 The reference count for the SV is set to 1.
6649 Perl_newSVnv(pTHX_ NV n)
6661 Creates a new SV and copies an integer into it. The reference count for the
6668 Perl_newSViv(pTHX_ IV i)
6680 Creates a new SV and copies an unsigned integer into it.
6681 The reference count for the SV is set to 1.
6687 Perl_newSVuv(pTHX_ UV u)
6697 =for apidoc newRV_noinc
6699 Creates an RV wrapper for an SV. The reference count for the original
6700 SV is B<not> incremented.
6706 Perl_newRV_noinc(pTHX_ SV *tmpRef)
6711 sv_upgrade(sv, SVt_RV);
6718 /* newRV_inc is the official function name to use now.
6719 * newRV_inc is in fact #defined to newRV in sv.h
6723 Perl_newRV(pTHX_ SV *tmpRef)
6725 return newRV_noinc(SvREFCNT_inc(tmpRef));
6731 Creates a new SV which is an exact duplicate of the original SV.
6738 Perl_newSVsv(pTHX_ register SV *old)
6744 if (SvTYPE(old) == SVTYPEMASK) {
6745 if (ckWARN_d(WARN_INTERNAL))
6746 Perl_warner(aTHX_ packWARN(WARN_INTERNAL), "semi-panic: attempt to dup freed string");
6761 =for apidoc sv_reset
6763 Underlying implementation for the C<reset> Perl function.
6764 Note that the perl-level function is vaguely deprecated.
6770 Perl_sv_reset(pTHX_ register char *s, HV *stash)
6778 char todo[PERL_UCHAR_MAX+1];
6783 if (!*s) { /* reset ?? searches */
6784 for (pm = HvPMROOT(stash); pm; pm = pm->op_pmnext) {
6785 pm->op_pmdynflags &= ~PMdf_USED;
6790 /* reset variables */
6792 if (!HvARRAY(stash))
6795 Zero(todo, 256, char);
6797 i = (unsigned char)*s;
6801 max = (unsigned char)*s++;
6802 for ( ; i <= max; i++) {
6805 for (i = 0; i <= (I32) HvMAX(stash); i++) {
6806 for (entry = HvARRAY(stash)[i];
6808 entry = HeNEXT(entry))
6810 if (!todo[(U8)*HeKEY(entry)])
6812 gv = (GV*)HeVAL(entry);
6814 if (SvTHINKFIRST(sv)) {
6815 if (!SvREADONLY(sv) && SvROK(sv))
6820 if (SvTYPE(sv) >= SVt_PV) {
6822 if (SvPVX(sv) != Nullch)
6829 if (GvHV(gv) && !HvNAME(GvHV(gv))) {
6831 #ifdef USE_ENVIRON_ARRAY
6833 # ifdef USE_ITHREADS
6834 && PL_curinterp == aTHX
6838 environ[0] = Nullch;
6850 Using various gambits, try to get an IO from an SV: the IO slot if its a
6851 GV; or the recursive result if we're an RV; or the IO slot of the symbol
6852 named after the PV if we're a string.
6858 Perl_sv_2io(pTHX_ SV *sv)
6864 switch (SvTYPE(sv)) {
6872 Perl_croak(aTHX_ "Bad filehandle: %s", GvNAME(gv));
6876 Perl_croak(aTHX_ PL_no_usym, "filehandle");
6878 return sv_2io(SvRV(sv));
6879 gv = gv_fetchpv(SvPV(sv,n_a), FALSE, SVt_PVIO);
6885 Perl_croak(aTHX_ "Bad filehandle: %s", SvPV(sv,n_a));
6894 Using various gambits, try to get a CV from an SV; in addition, try if
6895 possible to set C<*st> and C<*gvp> to the stash and GV associated with it.
6901 Perl_sv_2cv(pTHX_ SV *sv, HV **st, GV **gvp, I32 lref)
6908 return *gvp = Nullgv, Nullcv;
6909 switch (SvTYPE(sv)) {
6928 SV **sp = &sv; /* Used in tryAMAGICunDEREF macro. */
6929 tryAMAGICunDEREF(to_cv);
6932 if (SvTYPE(sv) == SVt_PVCV) {
6941 Perl_croak(aTHX_ "Not a subroutine reference");
6946 gv = gv_fetchpv(SvPV(sv, n_a), lref, SVt_PVCV);
6952 if (lref && !GvCVu(gv)) {
6955 tmpsv = NEWSV(704,0);
6956 gv_efullname3(tmpsv, gv, Nullch);
6957 /* XXX this is probably not what they think they're getting.
6958 * It has the same effect as "sub name;", i.e. just a forward
6960 newSUB(start_subparse(FALSE, 0),
6961 newSVOP(OP_CONST, 0, tmpsv),
6966 Perl_croak(aTHX_ "Unable to create sub named \"%s\"", SvPV(sv,n_a));
6975 Returns true if the SV has a true value by Perl's rules.
6976 Use the C<SvTRUE> macro instead, which may call C<sv_true()> or may
6977 instead use an in-line version.
6983 Perl_sv_true(pTHX_ register SV *sv)
6989 if ((tXpv = (XPV*)SvANY(sv)) &&
6990 (tXpv->xpv_cur > 1 ||
6991 (tXpv->xpv_cur && *tXpv->xpv_pv != '0')))
6998 return SvIVX(sv) != 0;
7001 return SvNVX(sv) != 0.0;
7003 return sv_2bool(sv);
7011 A private implementation of the C<SvIVx> macro for compilers which can't
7012 cope with complex macro expressions. Always use the macro instead.
7018 Perl_sv_iv(pTHX_ register SV *sv)
7022 return (IV)SvUVX(sv);
7031 A private implementation of the C<SvUVx> macro for compilers which can't
7032 cope with complex macro expressions. Always use the macro instead.
7038 Perl_sv_uv(pTHX_ register SV *sv)
7043 return (UV)SvIVX(sv);
7051 A private implementation of the C<SvNVx> macro for compilers which can't
7052 cope with complex macro expressions. Always use the macro instead.
7058 Perl_sv_nv(pTHX_ register SV *sv)
7068 Use the C<SvPV_nolen> macro instead
7072 A private implementation of the C<SvPV> macro for compilers which can't
7073 cope with complex macro expressions. Always use the macro instead.
7079 Perl_sv_pvn(pTHX_ SV *sv, STRLEN *lp)
7085 return sv_2pv(sv, lp);
7090 Perl_sv_pvn_nomg(pTHX_ register SV *sv, STRLEN *lp)
7096 return sv_2pv_flags(sv, lp, 0);
7100 =for apidoc sv_pvn_force
7102 Get a sensible string out of the SV somehow.
7103 A private implementation of the C<SvPV_force> macro for compilers which
7104 can't cope with complex macro expressions. Always use the macro instead.
7106 =for apidoc sv_pvn_force_flags
7108 Get a sensible string out of the SV somehow.
7109 If C<flags> has C<SV_GMAGIC> bit set, will C<mg_get> on C<sv> if
7110 appropriate, else not. C<sv_pvn_force> and C<sv_pvn_force_nomg> are
7111 implemented in terms of this function.
7112 You normally want to use the various wrapper macros instead: see
7113 C<SvPV_force> and C<SvPV_force_nomg>
7119 Perl_sv_pvn_force_flags(pTHX_ SV *sv, STRLEN *lp, I32 flags)
7123 if (SvTHINKFIRST(sv) && !SvROK(sv))
7124 sv_force_normal_flags(sv, 0);
7130 if (SvTYPE(sv) > SVt_PVLV && SvTYPE(sv) != SVt_PVFM) {
7131 Perl_croak(aTHX_ "Can't coerce %s to string in %s", sv_reftype(sv,0),
7135 s = sv_2pv_flags(sv, lp, flags);
7136 if (s != SvPVX(sv)) { /* Almost, but not quite, sv_setpvn() */
7141 (void)SvUPGRADE(sv, SVt_PV); /* Never FALSE */
7142 SvGROW(sv, len + 1);
7143 Move(s,SvPVX(sv),len,char);
7148 SvPOK_on(sv); /* validate pointer */
7150 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2pv(%s)\n",
7151 PTR2UV(sv),SvPVX(sv)));
7158 =for apidoc sv_pvbyte
7160 Use C<SvPVbyte_nolen> instead.
7162 =for apidoc sv_pvbyten
7164 A private implementation of the C<SvPVbyte> macro for compilers
7165 which can't cope with complex macro expressions. Always use the macro
7172 Perl_sv_pvbyten(pTHX_ SV *sv, STRLEN *lp)
7174 sv_utf8_downgrade(sv,0);
7175 return sv_pvn(sv,lp);
7179 =for apidoc sv_pvbyten_force
7181 A private implementation of the C<SvPVbytex_force> macro for compilers
7182 which can't cope with complex macro expressions. Always use the macro
7189 Perl_sv_pvbyten_force(pTHX_ SV *sv, STRLEN *lp)
7191 sv_utf8_downgrade(sv,0);
7192 return sv_pvn_force(sv,lp);
7196 =for apidoc sv_pvutf8
7198 Use the C<SvPVutf8_nolen> macro instead
7200 =for apidoc sv_pvutf8n
7202 A private implementation of the C<SvPVutf8> macro for compilers
7203 which can't cope with complex macro expressions. Always use the macro
7210 Perl_sv_pvutf8n(pTHX_ SV *sv, STRLEN *lp)
7212 sv_utf8_upgrade(sv);
7213 return sv_pvn(sv,lp);
7217 =for apidoc sv_pvutf8n_force
7219 A private implementation of the C<SvPVutf8_force> macro for compilers
7220 which can't cope with complex macro expressions. Always use the macro
7227 Perl_sv_pvutf8n_force(pTHX_ SV *sv, STRLEN *lp)
7229 sv_utf8_upgrade(sv);
7230 return sv_pvn_force(sv,lp);
7234 =for apidoc sv_reftype
7236 Returns a string describing what the SV is a reference to.
7242 Perl_sv_reftype(pTHX_ SV *sv, int ob)
7244 if (ob && SvOBJECT(sv)) {
7245 return HvNAME(SvSTASH(sv));
7248 switch (SvTYPE(sv)) {
7264 case SVt_PVLV: return "LVALUE";
7265 case SVt_PVAV: return "ARRAY";
7266 case SVt_PVHV: return "HASH";
7267 case SVt_PVCV: return "CODE";
7268 case SVt_PVGV: return "GLOB";
7269 case SVt_PVFM: return "FORMAT";
7270 case SVt_PVIO: return "IO";
7271 default: return "UNKNOWN";
7277 =for apidoc sv_isobject
7279 Returns a boolean indicating whether the SV is an RV pointing to a blessed
7280 object. If the SV is not an RV, or if the object is not blessed, then this
7287 Perl_sv_isobject(pTHX_ SV *sv)
7304 Returns a boolean indicating whether the SV is blessed into the specified
7305 class. This does not check for subtypes; use C<sv_derived_from> to verify
7306 an inheritance relationship.
7312 Perl_sv_isa(pTHX_ SV *sv, const char *name)
7324 return strEQ(HvNAME(SvSTASH(sv)), name);
7330 Creates a new SV for the RV, C<rv>, to point to. If C<rv> is not an RV then
7331 it will be upgraded to one. If C<classname> is non-null then the new SV will
7332 be blessed in the specified package. The new SV is returned and its
7333 reference count is 1.
7339 Perl_newSVrv(pTHX_ SV *rv, const char *classname)
7345 SV_CHECK_THINKFIRST_COW_DROP(rv);
7348 if (SvTYPE(rv) >= SVt_PVMG) {
7349 U32 refcnt = SvREFCNT(rv);
7353 SvREFCNT(rv) = refcnt;
7356 if (SvTYPE(rv) < SVt_RV)
7357 sv_upgrade(rv, SVt_RV);
7358 else if (SvTYPE(rv) > SVt_RV) {
7359 (void)SvOOK_off(rv);
7360 if (SvPVX(rv) && SvLEN(rv))
7361 Safefree(SvPVX(rv));
7371 HV* stash = gv_stashpv(classname, TRUE);
7372 (void)sv_bless(rv, stash);
7378 =for apidoc sv_setref_pv
7380 Copies a pointer into a new SV, optionally blessing the SV. The C<rv>
7381 argument will be upgraded to an RV. That RV will be modified to point to
7382 the new SV. If the C<pv> argument is NULL then C<PL_sv_undef> will be placed
7383 into the SV. The C<classname> argument indicates the package for the
7384 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
7385 will be returned and will have a reference count of 1.
7387 Do not use with other Perl types such as HV, AV, SV, CV, because those
7388 objects will become corrupted by the pointer copy process.
7390 Note that C<sv_setref_pvn> copies the string while this copies the pointer.
7396 Perl_sv_setref_pv(pTHX_ SV *rv, const char *classname, void *pv)
7399 sv_setsv(rv, &PL_sv_undef);
7403 sv_setiv(newSVrv(rv,classname), PTR2IV(pv));
7408 =for apidoc sv_setref_iv
7410 Copies an integer into a new SV, optionally blessing the SV. The C<rv>
7411 argument will be upgraded to an RV. That RV will be modified to point to
7412 the new SV. The C<classname> argument indicates the package for the
7413 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
7414 will be returned and will have a reference count of 1.
7420 Perl_sv_setref_iv(pTHX_ SV *rv, const char *classname, IV iv)
7422 sv_setiv(newSVrv(rv,classname), iv);
7427 =for apidoc sv_setref_uv
7429 Copies an unsigned integer into a new SV, optionally blessing the SV. The C<rv>
7430 argument will be upgraded to an RV. That RV will be modified to point to
7431 the new SV. The C<classname> argument indicates the package for the
7432 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
7433 will be returned and will have a reference count of 1.
7439 Perl_sv_setref_uv(pTHX_ SV *rv, const char *classname, UV uv)
7441 sv_setuv(newSVrv(rv,classname), uv);
7446 =for apidoc sv_setref_nv
7448 Copies a double into a new SV, optionally blessing the SV. The C<rv>
7449 argument will be upgraded to an RV. That RV will be modified to point to
7450 the new SV. The C<classname> argument indicates the package for the
7451 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
7452 will be returned and will have a reference count of 1.
7458 Perl_sv_setref_nv(pTHX_ SV *rv, const char *classname, NV nv)
7460 sv_setnv(newSVrv(rv,classname), nv);
7465 =for apidoc sv_setref_pvn
7467 Copies a string into a new SV, optionally blessing the SV. The length of the
7468 string must be specified with C<n>. The C<rv> argument will be upgraded to
7469 an RV. That RV will be modified to point to the new SV. The C<classname>
7470 argument indicates the package for the blessing. Set C<classname> to
7471 C<Nullch> to avoid the blessing. The new SV will be returned and will have
7472 a reference count of 1.
7474 Note that C<sv_setref_pv> copies the pointer while this copies the string.
7480 Perl_sv_setref_pvn(pTHX_ SV *rv, const char *classname, char *pv, STRLEN n)
7482 sv_setpvn(newSVrv(rv,classname), pv, n);
7487 =for apidoc sv_bless
7489 Blesses an SV into a specified package. The SV must be an RV. The package
7490 must be designated by its stash (see C<gv_stashpv()>). The reference count
7491 of the SV is unaffected.
7497 Perl_sv_bless(pTHX_ SV *sv, HV *stash)
7501 Perl_croak(aTHX_ "Can't bless non-reference value");
7503 if (SvFLAGS(tmpRef) & (SVs_OBJECT|SVf_READONLY)) {
7504 if (SvREADONLY(tmpRef))
7505 Perl_croak(aTHX_ PL_no_modify);
7506 if (SvOBJECT(tmpRef)) {
7507 if (SvTYPE(tmpRef) != SVt_PVIO)
7509 SvREFCNT_dec(SvSTASH(tmpRef));
7512 SvOBJECT_on(tmpRef);
7513 if (SvTYPE(tmpRef) != SVt_PVIO)
7515 (void)SvUPGRADE(tmpRef, SVt_PVMG);
7516 SvSTASH(tmpRef) = (HV*)SvREFCNT_inc(stash);
7523 if(SvSMAGICAL(tmpRef))
7524 if(mg_find(tmpRef, PERL_MAGIC_ext) || mg_find(tmpRef, PERL_MAGIC_uvar))
7532 /* Downgrades a PVGV to a PVMG.
7536 S_sv_unglob(pTHX_ SV *sv)
7540 assert(SvTYPE(sv) == SVt_PVGV);
7545 SvREFCNT_dec(GvSTASH(sv));
7546 GvSTASH(sv) = Nullhv;
7548 sv_unmagic(sv, PERL_MAGIC_glob);
7549 Safefree(GvNAME(sv));
7552 /* need to keep SvANY(sv) in the right arena */
7553 xpvmg = new_XPVMG();
7554 StructCopy(SvANY(sv), xpvmg, XPVMG);
7555 del_XPVGV(SvANY(sv));
7558 SvFLAGS(sv) &= ~SVTYPEMASK;
7559 SvFLAGS(sv) |= SVt_PVMG;
7563 =for apidoc sv_unref_flags
7565 Unsets the RV status of the SV, and decrements the reference count of
7566 whatever was being referenced by the RV. This can almost be thought of
7567 as a reversal of C<newSVrv>. The C<cflags> argument can contain
7568 C<SV_IMMEDIATE_UNREF> to force the reference count to be decremented
7569 (otherwise the decrementing is conditional on the reference count being
7570 different from one or the reference being a readonly SV).
7577 Perl_sv_unref_flags(pTHX_ SV *sv, U32 flags)
7581 if (SvWEAKREF(sv)) {
7589 if (SvREFCNT(rv) != 1 || SvREADONLY(rv) || (flags & SV_IMMEDIATE_UNREF))
7591 else /* XXX Hack, but hard to make $a=$a->[1] work otherwise */
7592 sv_2mortal(rv); /* Schedule for freeing later */
7596 =for apidoc sv_unref
7598 Unsets the RV status of the SV, and decrements the reference count of
7599 whatever was being referenced by the RV. This can almost be thought of
7600 as a reversal of C<newSVrv>. This is C<sv_unref_flags> with the C<flag>
7601 being zero. See C<SvROK_off>.
7607 Perl_sv_unref(pTHX_ SV *sv)
7609 sv_unref_flags(sv, 0);
7613 =for apidoc sv_taint
7615 Taint an SV. Use C<SvTAINTED_on> instead.
7620 Perl_sv_taint(pTHX_ SV *sv)
7622 sv_magic((sv), Nullsv, PERL_MAGIC_taint, Nullch, 0);
7626 =for apidoc sv_untaint
7628 Untaint an SV. Use C<SvTAINTED_off> instead.
7633 Perl_sv_untaint(pTHX_ SV *sv)
7635 if (SvTYPE(sv) >= SVt_PVMG && SvMAGIC(sv)) {
7636 MAGIC *mg = mg_find(sv, PERL_MAGIC_taint);
7643 =for apidoc sv_tainted
7645 Test an SV for taintedness. Use C<SvTAINTED> instead.
7650 Perl_sv_tainted(pTHX_ SV *sv)
7652 if (SvTYPE(sv) >= SVt_PVMG && SvMAGIC(sv)) {
7653 MAGIC *mg = mg_find(sv, PERL_MAGIC_taint);
7654 if (mg && ((mg->mg_len & 1) || ((mg->mg_len & 2) && mg->mg_obj == sv)))
7660 #if defined(PERL_IMPLICIT_CONTEXT)
7662 /* pTHX_ magic can't cope with varargs, so this is a no-context
7663 * version of the main function, (which may itself be aliased to us).
7664 * Don't access this version directly.
7668 Perl_sv_setpvf_nocontext(SV *sv, const char* pat, ...)
7672 va_start(args, pat);
7673 sv_vsetpvf(sv, pat, &args);
7677 /* pTHX_ magic can't cope with varargs, so this is a no-context
7678 * version of the main function, (which may itself be aliased to us).
7679 * Don't access this version directly.
7683 Perl_sv_setpvf_mg_nocontext(SV *sv, const char* pat, ...)
7687 va_start(args, pat);
7688 sv_vsetpvf_mg(sv, pat, &args);
7694 =for apidoc sv_setpvf
7696 Processes its arguments like C<sprintf> and sets an SV to the formatted
7697 output. Does not handle 'set' magic. See C<sv_setpvf_mg>.
7703 Perl_sv_setpvf(pTHX_ SV *sv, const char* pat, ...)
7706 va_start(args, pat);
7707 sv_vsetpvf(sv, pat, &args);
7711 /* backend for C<sv_setpvf> and C<sv_setpvf_nocontext> */
7714 Perl_sv_vsetpvf(pTHX_ SV *sv, const char* pat, va_list* args)
7716 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
7720 =for apidoc sv_setpvf_mg
7722 Like C<sv_setpvf>, but also handles 'set' magic.
7728 Perl_sv_setpvf_mg(pTHX_ SV *sv, const char* pat, ...)
7731 va_start(args, pat);
7732 sv_vsetpvf_mg(sv, pat, &args);
7736 /* backend for C<sv_setpvf_mg> C<setpvf_mg_nocontext> */
7739 Perl_sv_vsetpvf_mg(pTHX_ SV *sv, const char* pat, va_list* args)
7741 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
7745 #if defined(PERL_IMPLICIT_CONTEXT)
7747 /* pTHX_ magic can't cope with varargs, so this is a no-context
7748 * version of the main function, (which may itself be aliased to us).
7749 * Don't access this version directly.
7753 Perl_sv_catpvf_nocontext(SV *sv, const char* pat, ...)
7757 va_start(args, pat);
7758 sv_vcatpvf(sv, pat, &args);
7762 /* pTHX_ magic can't cope with varargs, so this is a no-context
7763 * version of the main function, (which may itself be aliased to us).
7764 * Don't access this version directly.
7768 Perl_sv_catpvf_mg_nocontext(SV *sv, const char* pat, ...)
7772 va_start(args, pat);
7773 sv_vcatpvf_mg(sv, pat, &args);
7779 =for apidoc sv_catpvf
7781 Processes its arguments like C<sprintf> and appends the formatted
7782 output to an SV. If the appended data contains "wide" characters
7783 (including, but not limited to, SVs with a UTF-8 PV formatted with %s,
7784 and characters >255 formatted with %c), the original SV might get
7785 upgraded to UTF-8. Handles 'get' magic, but not 'set' magic.
7786 C<SvSETMAGIC()> must typically be called after calling this function
7787 to handle 'set' magic.
7792 Perl_sv_catpvf(pTHX_ SV *sv, const char* pat, ...)
7795 va_start(args, pat);
7796 sv_vcatpvf(sv, pat, &args);
7800 /* backend for C<sv_catpvf> and C<catpvf_mg_nocontext> */
7803 Perl_sv_vcatpvf(pTHX_ SV *sv, const char* pat, va_list* args)
7805 sv_vcatpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
7809 =for apidoc sv_catpvf_mg
7811 Like C<sv_catpvf>, but also handles 'set' magic.
7817 Perl_sv_catpvf_mg(pTHX_ SV *sv, const char* pat, ...)
7820 va_start(args, pat);
7821 sv_vcatpvf_mg(sv, pat, &args);
7825 /* backend for C<catpvf_mg> and C<catpvf_mg_nocontext> */
7828 Perl_sv_vcatpvf_mg(pTHX_ SV *sv, const char* pat, va_list* args)
7830 sv_vcatpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
7835 =for apidoc sv_vsetpvfn
7837 Works like C<vcatpvfn> but copies the text into the SV instead of
7840 Usually used via one of its frontends C<sv_setpvf> and C<sv_setpvf_mg>.
7846 Perl_sv_vsetpvfn(pTHX_ SV *sv, const char *pat, STRLEN patlen, va_list *args, SV **svargs, I32 svmax, bool *maybe_tainted)
7848 sv_setpvn(sv, "", 0);
7849 sv_vcatpvfn(sv, pat, patlen, args, svargs, svmax, maybe_tainted);
7852 /* private function for use in sv_vcatpvfn via the EXPECT_NUMBER macro */
7855 S_expect_number(pTHX_ char** pattern)
7858 switch (**pattern) {
7859 case '1': case '2': case '3':
7860 case '4': case '5': case '6':
7861 case '7': case '8': case '9':
7862 while (isDIGIT(**pattern))
7863 var = var * 10 + (*(*pattern)++ - '0');
7867 #define EXPECT_NUMBER(pattern, var) (var = S_expect_number(aTHX_ &pattern))
7870 =for apidoc sv_vcatpvfn
7872 Processes its arguments like C<vsprintf> and appends the formatted output
7873 to an SV. Uses an array of SVs if the C style variable argument list is
7874 missing (NULL). When running with taint checks enabled, indicates via
7875 C<maybe_tainted> if results are untrustworthy (often due to the use of
7878 Usually used via one of its frontends C<sv_catpvf> and C<sv_catpvf_mg>.
7884 Perl_sv_vcatpvfn(pTHX_ SV *sv, const char *pat, STRLEN patlen, va_list *args, SV **svargs, I32 svmax, bool *maybe_tainted)
7891 static char nullstr[] = "(null)";
7893 bool has_utf8 = FALSE; /* has the result utf8? */
7895 /* no matter what, this is a string now */
7896 (void)SvPV_force(sv, origlen);
7898 /* special-case "", "%s", and "%_" */
7901 if (patlen == 2 && pat[0] == '%') {
7905 char *s = va_arg(*args, char*);
7906 sv_catpv(sv, s ? s : nullstr);
7908 else if (svix < svmax) {
7909 sv_catsv(sv, *svargs);
7910 if (DO_UTF8(*svargs))
7916 argsv = va_arg(*args, SV*);
7917 sv_catsv(sv, argsv);
7922 /* See comment on '_' below */
7927 if (!args && svix < svmax && DO_UTF8(*svargs))
7930 patend = (char*)pat + patlen;
7931 for (p = (char*)pat; p < patend; p = q) {
7934 bool vectorize = FALSE;
7935 bool vectorarg = FALSE;
7936 bool vec_utf8 = FALSE;
7942 bool has_precis = FALSE;
7944 bool is_utf8 = FALSE; /* is this item utf8? */
7945 #ifdef HAS_LDBL_SPRINTF_BUG
7946 /* This is to try to fix a bug with irix/nonstop-ux/powerux and
7947 with sfio - Allen <allens@cpan.org> */
7948 bool fix_ldbl_sprintf_bug = FALSE;
7952 U8 utf8buf[UTF8_MAXLEN+1];
7953 STRLEN esignlen = 0;
7955 char *eptr = Nullch;
7957 /* Times 4: a decimal digit takes more than 3 binary digits.
7958 * NV_DIG: mantissa takes than many decimal digits.
7959 * Plus 32: Playing safe. */
7960 char ebuf[IV_DIG * 4 + NV_DIG + 32];
7961 /* large enough for "%#.#f" --chip */
7962 /* what about long double NVs? --jhi */
7965 U8 *vecstr = Null(U8*);
7972 /* we need a long double target in case HAS_LONG_DOUBLE but
7975 #if defined(HAS_LONG_DOUBLE) && LONG_DOUBLESIZE > DOUBLESIZE
7984 STRLEN dotstrlen = 1;
7985 I32 efix = 0; /* explicit format parameter index */
7986 I32 ewix = 0; /* explicit width index */
7987 I32 epix = 0; /* explicit precision index */
7988 I32 evix = 0; /* explicit vector index */
7989 bool asterisk = FALSE;
7991 /* echo everything up to the next format specification */
7992 for (q = p; q < patend && *q != '%'; ++q) ;
7994 sv_catpvn(sv, p, q - p);
8001 We allow format specification elements in this order:
8002 \d+\$ explicit format parameter index
8004 v|\*(\d+\$)?v vector with optional (optionally specified) arg
8005 \d+|\*(\d+\$)? width using optional (optionally specified) arg
8006 \.(\d*|\*(\d+\$)?) precision using optional (optionally specified) arg
8008 [%bcdefginopsux_DFOUX] format (mandatory)
8010 if (EXPECT_NUMBER(q, width)) {
8051 if (EXPECT_NUMBER(q, ewix))
8060 if ((vectorarg = asterisk)) {
8070 EXPECT_NUMBER(q, width);
8075 vecsv = va_arg(*args, SV*);
8077 vecsv = (evix ? evix <= svmax : svix < svmax) ?
8078 svargs[ewix ? ewix-1 : svix++] : &PL_sv_undef;
8079 dotstr = SvPVx(vecsv, dotstrlen);
8084 vecsv = va_arg(*args, SV*);
8085 vecstr = (U8*)SvPVx(vecsv,veclen);
8086 vec_utf8 = DO_UTF8(vecsv);
8088 else if (efix ? efix <= svmax : svix < svmax) {
8089 vecsv = svargs[efix ? efix-1 : svix++];
8090 vecstr = (U8*)SvPVx(vecsv,veclen);
8091 vec_utf8 = DO_UTF8(vecsv);
8101 i = va_arg(*args, int);
8103 i = (ewix ? ewix <= svmax : svix < svmax) ?
8104 SvIVx(svargs[ewix ? ewix-1 : svix++]) : 0;
8106 width = (i < 0) ? -i : i;
8116 if (EXPECT_NUMBER(q, epix) && *q++ != '$')
8118 /* XXX: todo, support specified precision parameter */
8122 i = va_arg(*args, int);
8124 i = (ewix ? ewix <= svmax : svix < svmax)
8125 ? SvIVx(svargs[ewix ? ewix-1 : svix++]) : 0;
8126 precis = (i < 0) ? 0 : i;
8131 precis = precis * 10 + (*q++ - '0');
8140 case 'I': /* Ix, I32x, and I64x */
8142 if (q[1] == '6' && q[2] == '4') {
8148 if (q[1] == '3' && q[2] == '2') {
8158 #if defined(HAS_QUAD) || defined(HAS_LONG_DOUBLE)
8169 #if defined(HAS_QUAD) || defined(HAS_LONG_DOUBLE)
8170 if (*(q + 1) == 'l') { /* lld, llf */
8195 argsv = (efix ? efix <= svmax : svix < svmax) ?
8196 svargs[efix ? efix-1 : svix++] : &PL_sv_undef;
8203 uv = (args && !vectorize) ? va_arg(*args, int) : SvIVx(argsv);
8205 (!UNI_IS_INVARIANT(uv) && SvUTF8(sv)))
8207 eptr = (char*)utf8buf;
8208 elen = uvchr_to_utf8((U8*)eptr, uv) - utf8buf;
8219 if (args && !vectorize) {
8220 eptr = va_arg(*args, char*);
8222 #ifdef MACOS_TRADITIONAL
8223 /* On MacOS, %#s format is used for Pascal strings */
8228 elen = strlen(eptr);
8231 elen = sizeof nullstr - 1;
8235 eptr = SvPVx(argsv, elen);
8236 if (DO_UTF8(argsv)) {
8237 if (has_precis && precis < elen) {
8239 sv_pos_u2b(argsv, &p, 0); /* sticks at end */
8242 if (width) { /* fudge width (can't fudge elen) */
8243 width += elen - sv_len_utf8(argsv);
8252 * The "%_" hack might have to be changed someday,
8253 * if ISO or ANSI decide to use '_' for something.
8254 * So we keep it hidden from users' code.
8256 if (!args || vectorize)
8258 argsv = va_arg(*args, SV*);
8259 eptr = SvPVx(argsv, elen);
8265 if (has_precis && elen > precis)
8272 if (alt || vectorize)
8274 uv = PTR2UV(args ? va_arg(*args, void*) : argsv);
8292 uv = utf8n_to_uvchr(vecstr, veclen, &ulen,
8301 esignbuf[esignlen++] = plus;
8305 case 'h': iv = (short)va_arg(*args, int); break;
8306 default: iv = va_arg(*args, int); break;
8307 case 'l': iv = va_arg(*args, long); break;
8308 case 'V': iv = va_arg(*args, IV); break;
8310 case 'q': iv = va_arg(*args, Quad_t); break;
8317 case 'h': iv = (short)iv; break;
8319 case 'l': iv = (long)iv; break;
8322 case 'q': iv = (Quad_t)iv; break;
8326 if ( !vectorize ) /* we already set uv above */
8331 esignbuf[esignlen++] = plus;
8335 esignbuf[esignlen++] = '-';
8378 uv = utf8n_to_uvchr(vecstr, veclen, &ulen,
8389 case 'h': uv = (unsigned short)va_arg(*args, unsigned); break;
8390 default: uv = va_arg(*args, unsigned); break;
8391 case 'l': uv = va_arg(*args, unsigned long); break;
8392 case 'V': uv = va_arg(*args, UV); break;
8394 case 'q': uv = va_arg(*args, Quad_t); break;
8401 case 'h': uv = (unsigned short)uv; break;
8403 case 'l': uv = (unsigned long)uv; break;
8406 case 'q': uv = (Quad_t)uv; break;
8412 eptr = ebuf + sizeof ebuf;
8418 p = (char*)((c == 'X')
8419 ? "0123456789ABCDEF" : "0123456789abcdef");
8425 esignbuf[esignlen++] = '0';
8426 esignbuf[esignlen++] = c; /* 'x' or 'X' */
8432 *--eptr = '0' + dig;
8434 if (alt && *eptr != '0')
8440 *--eptr = '0' + dig;
8443 esignbuf[esignlen++] = '0';
8444 esignbuf[esignlen++] = 'b';
8447 default: /* it had better be ten or less */
8448 #if defined(PERL_Y2KWARN)
8449 if (ckWARN(WARN_Y2K)) {
8451 char *s = SvPV(sv,n);
8452 if (n >= 2 && s[n-2] == '1' && s[n-1] == '9'
8453 && (n == 2 || !isDIGIT(s[n-3])))
8455 Perl_warner(aTHX_ packWARN(WARN_Y2K),
8456 "Possible Y2K bug: %%%c %s",
8457 c, "format string following '19'");
8463 *--eptr = '0' + dig;
8464 } while (uv /= base);
8467 elen = (ebuf + sizeof ebuf) - eptr;
8470 zeros = precis - elen;
8471 else if (precis == 0 && elen == 1 && *eptr == '0')
8476 /* FLOATING POINT */
8479 c = 'f'; /* maybe %F isn't supported here */
8485 /* This is evil, but floating point is even more evil */
8487 /* for SV-style calling, we can only get NV
8488 for C-style calling, we assume %f is double;
8489 for simplicity we allow any of %Lf, %llf, %qf for long double
8493 #if defined(USE_LONG_DOUBLE)
8498 #if defined(USE_LONG_DOUBLE)
8499 intsize = args ? 0 : 'q';
8503 #if defined(HAS_LONG_DOUBLE)
8514 /* now we need (long double) if intsize == 'q', else (double) */
8515 nv = (args && !vectorize) ?
8516 #if LONG_DOUBLESIZE > DOUBLESIZE
8518 va_arg(*args, long double) :
8519 va_arg(*args, double)
8521 va_arg(*args, double)
8527 if (c != 'e' && c != 'E') {
8529 /* FIXME: if HAS_LONG_DOUBLE but not USE_LONG_DOUBLE this
8530 will cast our (long double) to (double) */
8531 (void)Perl_frexp(nv, &i);
8532 if (i == PERL_INT_MIN)
8533 Perl_die(aTHX_ "panic: frexp");
8535 need = BIT_DIGITS(i);
8537 need += has_precis ? precis : 6; /* known default */
8542 #ifdef HAS_LDBL_SPRINTF_BUG
8543 /* This is to try to fix a bug with irix/nonstop-ux/powerux and
8544 with sfio - Allen <allens@cpan.org> */
8547 # define MY_DBL_MAX DBL_MAX
8548 # else /* XXX guessing! HUGE_VAL may be defined as infinity, so not using */
8549 # if DOUBLESIZE >= 8
8550 # define MY_DBL_MAX 1.7976931348623157E+308L
8552 # define MY_DBL_MAX 3.40282347E+38L
8556 # ifdef HAS_LDBL_SPRINTF_BUG_LESS1 /* only between -1L & 1L - Allen */
8557 # define MY_DBL_MAX_BUG 1L
8559 # define MY_DBL_MAX_BUG MY_DBL_MAX
8563 # define MY_DBL_MIN DBL_MIN
8564 # else /* XXX guessing! -Allen */
8565 # if DOUBLESIZE >= 8
8566 # define MY_DBL_MIN 2.2250738585072014E-308L
8568 # define MY_DBL_MIN 1.17549435E-38L
8572 if ((intsize == 'q') && (c == 'f') &&
8573 ((nv < MY_DBL_MAX_BUG) && (nv > -MY_DBL_MAX_BUG)) &&
8575 /* it's going to be short enough that
8576 * long double precision is not needed */
8578 if ((nv <= 0L) && (nv >= -0L))
8579 fix_ldbl_sprintf_bug = TRUE; /* 0 is 0 - easiest */
8581 /* would use Perl_fp_class as a double-check but not
8582 * functional on IRIX - see perl.h comments */
8584 if ((nv >= MY_DBL_MIN) || (nv <= -MY_DBL_MIN)) {
8585 /* It's within the range that a double can represent */
8586 #if defined(DBL_MAX) && !defined(DBL_MIN)
8587 if ((nv >= ((long double)1/DBL_MAX)) ||
8588 (nv <= (-(long double)1/DBL_MAX)))
8590 fix_ldbl_sprintf_bug = TRUE;
8593 if (fix_ldbl_sprintf_bug == TRUE) {
8603 # undef MY_DBL_MAX_BUG
8606 #endif /* HAS_LDBL_SPRINTF_BUG */
8608 need += 20; /* fudge factor */
8609 if (PL_efloatsize < need) {
8610 Safefree(PL_efloatbuf);
8611 PL_efloatsize = need + 20; /* more fudge */
8612 New(906, PL_efloatbuf, PL_efloatsize, char);
8613 PL_efloatbuf[0] = '\0';
8616 eptr = ebuf + sizeof ebuf;
8619 /* FIXME: what to do if HAS_LONG_DOUBLE but not PERL_PRIfldbl? */
8620 #if defined(HAS_LONG_DOUBLE) && defined(PERL_PRIfldbl)
8621 if (intsize == 'q') {
8622 /* Copy the one or more characters in a long double
8623 * format before the 'base' ([efgEFG]) character to
8624 * the format string. */
8625 static char const prifldbl[] = PERL_PRIfldbl;
8626 char const *p = prifldbl + sizeof(prifldbl) - 3;
8627 while (p >= prifldbl) { *--eptr = *p--; }
8632 do { *--eptr = '0' + (base % 10); } while (base /= 10);
8637 do { *--eptr = '0' + (base % 10); } while (base /= 10);
8649 /* No taint. Otherwise we are in the strange situation
8650 * where printf() taints but print($float) doesn't.
8652 #if defined(HAS_LONG_DOUBLE)
8654 (void)sprintf(PL_efloatbuf, eptr, nv);
8656 (void)sprintf(PL_efloatbuf, eptr, (double)nv);
8658 (void)sprintf(PL_efloatbuf, eptr, nv);
8660 eptr = PL_efloatbuf;
8661 elen = strlen(PL_efloatbuf);
8667 i = SvCUR(sv) - origlen;
8668 if (args && !vectorize) {
8670 case 'h': *(va_arg(*args, short*)) = i; break;
8671 default: *(va_arg(*args, int*)) = i; break;
8672 case 'l': *(va_arg(*args, long*)) = i; break;
8673 case 'V': *(va_arg(*args, IV*)) = i; break;
8675 case 'q': *(va_arg(*args, Quad_t*)) = i; break;
8680 sv_setuv_mg(argsv, (UV)i);
8682 continue; /* not "break" */
8689 if (!args && ckWARN(WARN_PRINTF) &&
8690 (PL_op->op_type == OP_PRTF || PL_op->op_type == OP_SPRINTF)) {
8691 SV *msg = sv_newmortal();
8692 Perl_sv_setpvf(aTHX_ msg, "Invalid conversion in %s: ",
8693 (PL_op->op_type == OP_PRTF) ? "printf" : "sprintf");
8696 Perl_sv_catpvf(aTHX_ msg,
8697 "\"%%%c\"", c & 0xFF);
8699 Perl_sv_catpvf(aTHX_ msg,
8700 "\"%%\\%03"UVof"\"",
8703 sv_catpv(msg, "end of string");
8704 Perl_warner(aTHX_ packWARN(WARN_PRINTF), "%"SVf, msg); /* yes, this is reentrant */
8707 /* output mangled stuff ... */
8713 /* ... right here, because formatting flags should not apply */
8714 SvGROW(sv, SvCUR(sv) + elen + 1);
8716 Copy(eptr, p, elen, char);
8719 SvCUR(sv) = p - SvPVX(sv);
8720 continue; /* not "break" */
8723 if (is_utf8 != has_utf8) {
8726 sv_utf8_upgrade(sv);
8729 SV *nsv = sv_2mortal(newSVpvn(eptr, elen));
8730 sv_utf8_upgrade(nsv);
8734 SvGROW(sv, SvCUR(sv) + elen + 1);
8739 have = esignlen + zeros + elen;
8740 need = (have > width ? have : width);
8743 SvGROW(sv, SvCUR(sv) + need + dotstrlen + 1);
8745 if (esignlen && fill == '0') {
8746 for (i = 0; i < (int)esignlen; i++)
8750 memset(p, fill, gap);
8753 if (esignlen && fill != '0') {
8754 for (i = 0; i < (int)esignlen; i++)
8758 for (i = zeros; i; i--)
8762 Copy(eptr, p, elen, char);
8766 memset(p, ' ', gap);
8771 Copy(dotstr, p, dotstrlen, char);
8775 vectorize = FALSE; /* done iterating over vecstr */
8782 SvCUR(sv) = p - SvPVX(sv);
8790 /* =========================================================================
8792 =head1 Cloning an interpreter
8794 All the macros and functions in this section are for the private use of
8795 the main function, perl_clone().
8797 The foo_dup() functions make an exact copy of an existing foo thinngy.
8798 During the course of a cloning, a hash table is used to map old addresses
8799 to new addresses. The table is created and manipulated with the
8800 ptr_table_* functions.
8804 ============================================================================*/
8807 #if defined(USE_ITHREADS)
8809 #if defined(USE_5005THREADS)
8810 # include "error: USE_5005THREADS and USE_ITHREADS are incompatible"
8813 #ifndef GpREFCNT_inc
8814 # define GpREFCNT_inc(gp) ((gp) ? (++(gp)->gp_refcnt, (gp)) : (GP*)NULL)
8818 #define sv_dup_inc(s,t) SvREFCNT_inc(sv_dup(s,t))
8819 #define av_dup(s,t) (AV*)sv_dup((SV*)s,t)
8820 #define av_dup_inc(s,t) (AV*)SvREFCNT_inc(sv_dup((SV*)s,t))
8821 #define hv_dup(s,t) (HV*)sv_dup((SV*)s,t)
8822 #define hv_dup_inc(s,t) (HV*)SvREFCNT_inc(sv_dup((SV*)s,t))
8823 #define cv_dup(s,t) (CV*)sv_dup((SV*)s,t)
8824 #define cv_dup_inc(s,t) (CV*)SvREFCNT_inc(sv_dup((SV*)s,t))
8825 #define io_dup(s,t) (IO*)sv_dup((SV*)s,t)
8826 #define io_dup_inc(s,t) (IO*)SvREFCNT_inc(sv_dup((SV*)s,t))
8827 #define gv_dup(s,t) (GV*)sv_dup((SV*)s,t)
8828 #define gv_dup_inc(s,t) (GV*)SvREFCNT_inc(sv_dup((SV*)s,t))
8829 #define SAVEPV(p) (p ? savepv(p) : Nullch)
8830 #define SAVEPVN(p,n) (p ? savepvn(p,n) : Nullch)
8833 /* Duplicate a regexp. Required reading: pregcomp() and pregfree() in
8834 regcomp.c. AMS 20010712 */
8837 Perl_re_dup(pTHX_ REGEXP *r, CLONE_PARAMS *param)
8841 struct reg_substr_datum *s;
8844 return (REGEXP *)NULL;
8846 if ((ret = (REGEXP *)ptr_table_fetch(PL_ptr_table, r)))
8849 len = r->offsets[0];
8850 npar = r->nparens+1;
8852 Newc(0, ret, sizeof(regexp) + (len+1)*sizeof(regnode), char, regexp);
8853 Copy(r->program, ret->program, len+1, regnode);
8855 New(0, ret->startp, npar, I32);
8856 Copy(r->startp, ret->startp, npar, I32);
8857 New(0, ret->endp, npar, I32);
8858 Copy(r->startp, ret->startp, npar, I32);
8860 New(0, ret->substrs, 1, struct reg_substr_data);
8861 for (s = ret->substrs->data, i = 0; i < 3; i++, s++) {
8862 s->min_offset = r->substrs->data[i].min_offset;
8863 s->max_offset = r->substrs->data[i].max_offset;
8864 s->substr = sv_dup_inc(r->substrs->data[i].substr, param);
8865 s->utf8_substr = sv_dup_inc(r->substrs->data[i].utf8_substr, param);
8868 ret->regstclass = NULL;
8871 int count = r->data->count;
8873 Newc(0, d, sizeof(struct reg_data) + count*sizeof(void *),
8874 char, struct reg_data);
8875 New(0, d->what, count, U8);
8878 for (i = 0; i < count; i++) {
8879 d->what[i] = r->data->what[i];
8880 switch (d->what[i]) {
8882 d->data[i] = sv_dup_inc((SV *)r->data->data[i], param);
8885 d->data[i] = av_dup_inc((AV *)r->data->data[i], param);
8888 /* This is cheating. */
8889 New(0, d->data[i], 1, struct regnode_charclass_class);
8890 StructCopy(r->data->data[i], d->data[i],
8891 struct regnode_charclass_class);
8892 ret->regstclass = (regnode*)d->data[i];
8895 /* Compiled op trees are readonly, and can thus be
8896 shared without duplication. */
8897 d->data[i] = (void*)OpREFCNT_inc((OP*)r->data->data[i]);
8900 d->data[i] = r->data->data[i];
8910 New(0, ret->offsets, 2*len+1, U32);
8911 Copy(r->offsets, ret->offsets, 2*len+1, U32);
8913 ret->precomp = SAVEPV(r->precomp);
8914 ret->refcnt = r->refcnt;
8915 ret->minlen = r->minlen;
8916 ret->prelen = r->prelen;
8917 ret->nparens = r->nparens;
8918 ret->lastparen = r->lastparen;
8919 ret->lastcloseparen = r->lastcloseparen;
8920 ret->reganch = r->reganch;
8922 ret->sublen = r->sublen;
8924 if (RX_MATCH_COPIED(ret))
8925 ret->subbeg = SAVEPV(r->subbeg);
8927 ret->subbeg = Nullch;
8929 ptr_table_store(PL_ptr_table, r, ret);
8933 /* duplicate a file handle */
8936 Perl_fp_dup(pTHX_ PerlIO *fp, char type, CLONE_PARAMS *param)
8940 return (PerlIO*)NULL;
8942 /* look for it in the table first */
8943 ret = (PerlIO*)ptr_table_fetch(PL_ptr_table, fp);
8947 /* create anew and remember what it is */
8948 ret = PerlIO_fdupopen(aTHX_ fp, param, PERLIO_DUP_CLONE);
8949 ptr_table_store(PL_ptr_table, fp, ret);
8953 /* duplicate a directory handle */
8956 Perl_dirp_dup(pTHX_ DIR *dp)
8964 /* duplicate a typeglob */
8967 Perl_gp_dup(pTHX_ GP *gp, CLONE_PARAMS* param)
8972 /* look for it in the table first */
8973 ret = (GP*)ptr_table_fetch(PL_ptr_table, gp);
8977 /* create anew and remember what it is */
8978 Newz(0, ret, 1, GP);
8979 ptr_table_store(PL_ptr_table, gp, ret);
8982 ret->gp_refcnt = 0; /* must be before any other dups! */
8983 ret->gp_sv = sv_dup_inc(gp->gp_sv, param);
8984 ret->gp_io = io_dup_inc(gp->gp_io, param);
8985 ret->gp_form = cv_dup_inc(gp->gp_form, param);
8986 ret->gp_av = av_dup_inc(gp->gp_av, param);
8987 ret->gp_hv = hv_dup_inc(gp->gp_hv, param);
8988 ret->gp_egv = gv_dup(gp->gp_egv, param);/* GvEGV is not refcounted */
8989 ret->gp_cv = cv_dup_inc(gp->gp_cv, param);
8990 ret->gp_cvgen = gp->gp_cvgen;
8991 ret->gp_flags = gp->gp_flags;
8992 ret->gp_line = gp->gp_line;
8993 ret->gp_file = gp->gp_file; /* points to COP.cop_file */
8997 /* duplicate a chain of magic */
9000 Perl_mg_dup(pTHX_ MAGIC *mg, CLONE_PARAMS* param)
9002 MAGIC *mgprev = (MAGIC*)NULL;
9005 return (MAGIC*)NULL;
9006 /* look for it in the table first */
9007 mgret = (MAGIC*)ptr_table_fetch(PL_ptr_table, mg);
9011 for (; mg; mg = mg->mg_moremagic) {
9013 Newz(0, nmg, 1, MAGIC);
9015 mgprev->mg_moremagic = nmg;
9018 nmg->mg_virtual = mg->mg_virtual; /* XXX copy dynamic vtable? */
9019 nmg->mg_private = mg->mg_private;
9020 nmg->mg_type = mg->mg_type;
9021 nmg->mg_flags = mg->mg_flags;
9022 if (mg->mg_type == PERL_MAGIC_qr) {
9023 nmg->mg_obj = (SV*)re_dup((REGEXP*)mg->mg_obj, param);
9025 else if(mg->mg_type == PERL_MAGIC_backref) {
9026 AV *av = (AV*) mg->mg_obj;
9029 nmg->mg_obj = (SV*)newAV();
9033 av_push((AV*)nmg->mg_obj,sv_dup(svp[i],param));
9038 nmg->mg_obj = (mg->mg_flags & MGf_REFCOUNTED)
9039 ? sv_dup_inc(mg->mg_obj, param)
9040 : sv_dup(mg->mg_obj, param);
9042 nmg->mg_len = mg->mg_len;
9043 nmg->mg_ptr = mg->mg_ptr; /* XXX random ptr? */
9044 if (mg->mg_ptr && mg->mg_type != PERL_MAGIC_regex_global) {
9045 if (mg->mg_len > 0) {
9046 nmg->mg_ptr = SAVEPVN(mg->mg_ptr, mg->mg_len);
9047 if (mg->mg_type == PERL_MAGIC_overload_table &&
9048 AMT_AMAGIC((AMT*)mg->mg_ptr))
9050 AMT *amtp = (AMT*)mg->mg_ptr;
9051 AMT *namtp = (AMT*)nmg->mg_ptr;
9053 for (i = 1; i < NofAMmeth; i++) {
9054 namtp->table[i] = cv_dup_inc(amtp->table[i], param);
9058 else if (mg->mg_len == HEf_SVKEY)
9059 nmg->mg_ptr = (char*)sv_dup_inc((SV*)mg->mg_ptr, param);
9061 if ((mg->mg_flags & MGf_DUP) && mg->mg_virtual && mg->mg_virtual->svt_dup) {
9062 CALL_FPTR(nmg->mg_virtual->svt_dup)(aTHX_ nmg, param);
9069 /* create a new pointer-mapping table */
9072 Perl_ptr_table_new(pTHX)
9075 Newz(0, tbl, 1, PTR_TBL_t);
9078 Newz(0, tbl->tbl_ary, tbl->tbl_max + 1, PTR_TBL_ENT_t*);
9082 /* map an existing pointer using a table */
9085 Perl_ptr_table_fetch(pTHX_ PTR_TBL_t *tbl, void *sv)
9087 PTR_TBL_ENT_t *tblent;
9088 UV hash = PTR2UV(sv);
9090 tblent = tbl->tbl_ary[hash & tbl->tbl_max];
9091 for (; tblent; tblent = tblent->next) {
9092 if (tblent->oldval == sv)
9093 return tblent->newval;
9098 /* add a new entry to a pointer-mapping table */
9101 Perl_ptr_table_store(pTHX_ PTR_TBL_t *tbl, void *oldv, void *newv)
9103 PTR_TBL_ENT_t *tblent, **otblent;
9104 /* XXX this may be pessimal on platforms where pointers aren't good
9105 * hash values e.g. if they grow faster in the most significant
9107 UV hash = PTR2UV(oldv);
9111 otblent = &tbl->tbl_ary[hash & tbl->tbl_max];
9112 for (tblent = *otblent; tblent; i=0, tblent = tblent->next) {
9113 if (tblent->oldval == oldv) {
9114 tblent->newval = newv;
9118 Newz(0, tblent, 1, PTR_TBL_ENT_t);
9119 tblent->oldval = oldv;
9120 tblent->newval = newv;
9121 tblent->next = *otblent;
9124 if (i && tbl->tbl_items > tbl->tbl_max)
9125 ptr_table_split(tbl);
9128 /* double the hash bucket size of an existing ptr table */
9131 Perl_ptr_table_split(pTHX_ PTR_TBL_t *tbl)
9133 PTR_TBL_ENT_t **ary = tbl->tbl_ary;
9134 UV oldsize = tbl->tbl_max + 1;
9135 UV newsize = oldsize * 2;
9138 Renew(ary, newsize, PTR_TBL_ENT_t*);
9139 Zero(&ary[oldsize], newsize-oldsize, PTR_TBL_ENT_t*);
9140 tbl->tbl_max = --newsize;
9142 for (i=0; i < oldsize; i++, ary++) {
9143 PTR_TBL_ENT_t **curentp, **entp, *ent;
9146 curentp = ary + oldsize;
9147 for (entp = ary, ent = *ary; ent; ent = *entp) {
9148 if ((newsize & PTR2UV(ent->oldval)) != i) {
9150 ent->next = *curentp;
9160 /* remove all the entries from a ptr table */
9163 Perl_ptr_table_clear(pTHX_ PTR_TBL_t *tbl)
9165 register PTR_TBL_ENT_t **array;
9166 register PTR_TBL_ENT_t *entry;
9167 register PTR_TBL_ENT_t *oentry = Null(PTR_TBL_ENT_t*);
9171 if (!tbl || !tbl->tbl_items) {
9175 array = tbl->tbl_ary;
9182 entry = entry->next;
9186 if (++riter > max) {
9189 entry = array[riter];
9196 /* clear and free a ptr table */
9199 Perl_ptr_table_free(pTHX_ PTR_TBL_t *tbl)
9204 ptr_table_clear(tbl);
9205 Safefree(tbl->tbl_ary);
9213 /* attempt to make everything in the typeglob readonly */
9216 S_gv_share(pTHX_ SV *sstr, CLONE_PARAMS *param)
9219 SV *sv = ¶m->proto_perl->Isv_no; /* just need SvREADONLY-ness */
9221 if (GvIO(gv) || GvFORM(gv)) {
9222 GvUNIQUE_off(gv); /* GvIOs cannot be shared. nor can GvFORMs */
9224 else if (!GvCV(gv)) {
9228 /* CvPADLISTs cannot be shared */
9229 if (!SvREADONLY(GvCV(gv)) && !CvXSUB(GvCV(gv))) {
9234 if (!GvUNIQUE(gv)) {
9236 PerlIO_printf(Perl_debug_log, "gv_share: unable to share %s::%s\n",
9237 HvNAME(GvSTASH(gv)), GvNAME(gv));
9243 * write attempts will die with
9244 * "Modification of a read-only value attempted"
9250 SvREADONLY_on(GvSV(gv));
9257 SvREADONLY_on(GvAV(gv));
9264 SvREADONLY_on(GvAV(gv));
9267 return sstr; /* he_dup() will SvREFCNT_inc() */
9270 /* duplicate an SV of any type (including AV, HV etc) */
9273 Perl_rvpv_dup(pTHX_ SV *dstr, SV *sstr, CLONE_PARAMS* param)
9276 SvRV(dstr) = SvWEAKREF(sstr)
9277 ? sv_dup(SvRV(sstr), param)
9278 : sv_dup_inc(SvRV(sstr), param);
9280 else if (SvPVX(sstr)) {
9281 /* Has something there */
9283 /* Normal PV - clone whole allocated space */
9284 SvPVX(dstr) = SAVEPVN(SvPVX(sstr), SvLEN(sstr)-1);
9285 if (SvREADONLY(sstr) && SvFAKE(sstr)) {
9286 /* Not that normal - actually sstr is copy on write.
9287 But we are a true, independant SV, so: */
9288 SvREADONLY_off(dstr);
9293 /* Special case - not normally malloced for some reason */
9294 if (SvREADONLY(sstr) && SvFAKE(sstr)) {
9295 /* A "shared" PV - clone it as unshared string */
9297 SvREADONLY_off(dstr);
9298 SvPVX(dstr) = SAVEPVN(SvPVX(sstr), SvCUR(sstr));
9301 /* Some other special case - random pointer */
9302 SvPVX(dstr) = SvPVX(sstr);
9308 SvPVX(dstr) = SvPVX(sstr);
9313 Perl_sv_dup(pTHX_ SV *sstr, CLONE_PARAMS* param)
9317 if (!sstr || SvTYPE(sstr) == SVTYPEMASK)
9319 /* look for it in the table first */
9320 dstr = (SV*)ptr_table_fetch(PL_ptr_table, sstr);
9324 /* create anew and remember what it is */
9326 ptr_table_store(PL_ptr_table, sstr, dstr);
9329 SvFLAGS(dstr) = SvFLAGS(sstr);
9330 SvFLAGS(dstr) &= ~SVf_OOK; /* don't propagate OOK hack */
9331 SvREFCNT(dstr) = 0; /* must be before any other dups! */
9334 if (SvANY(sstr) && PL_watch_pvx && SvPVX(sstr) == PL_watch_pvx)
9335 PerlIO_printf(Perl_debug_log, "watch at %p hit, found string \"%s\"\n",
9336 PL_watch_pvx, SvPVX(sstr));
9339 switch (SvTYPE(sstr)) {
9344 SvANY(dstr) = new_XIV();
9345 SvIVX(dstr) = SvIVX(sstr);
9348 SvANY(dstr) = new_XNV();
9349 SvNVX(dstr) = SvNVX(sstr);
9352 SvANY(dstr) = new_XRV();
9353 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
9356 SvANY(dstr) = new_XPV();
9357 SvCUR(dstr) = SvCUR(sstr);
9358 SvLEN(dstr) = SvLEN(sstr);
9359 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
9362 SvANY(dstr) = new_XPVIV();
9363 SvCUR(dstr) = SvCUR(sstr);
9364 SvLEN(dstr) = SvLEN(sstr);
9365 SvIVX(dstr) = SvIVX(sstr);
9366 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
9369 SvANY(dstr) = new_XPVNV();
9370 SvCUR(dstr) = SvCUR(sstr);
9371 SvLEN(dstr) = SvLEN(sstr);
9372 SvIVX(dstr) = SvIVX(sstr);
9373 SvNVX(dstr) = SvNVX(sstr);
9374 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
9377 SvANY(dstr) = new_XPVMG();
9378 SvCUR(dstr) = SvCUR(sstr);
9379 SvLEN(dstr) = SvLEN(sstr);
9380 SvIVX(dstr) = SvIVX(sstr);
9381 SvNVX(dstr) = SvNVX(sstr);
9382 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr), param);
9383 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr), param);
9384 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
9387 SvANY(dstr) = new_XPVBM();
9388 SvCUR(dstr) = SvCUR(sstr);
9389 SvLEN(dstr) = SvLEN(sstr);
9390 SvIVX(dstr) = SvIVX(sstr);
9391 SvNVX(dstr) = SvNVX(sstr);
9392 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr), param);
9393 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr), param);
9394 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
9395 BmRARE(dstr) = BmRARE(sstr);
9396 BmUSEFUL(dstr) = BmUSEFUL(sstr);
9397 BmPREVIOUS(dstr)= BmPREVIOUS(sstr);
9400 SvANY(dstr) = new_XPVLV();
9401 SvCUR(dstr) = SvCUR(sstr);
9402 SvLEN(dstr) = SvLEN(sstr);
9403 SvIVX(dstr) = SvIVX(sstr);
9404 SvNVX(dstr) = SvNVX(sstr);
9405 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr), param);
9406 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr), param);
9407 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
9408 LvTARGOFF(dstr) = LvTARGOFF(sstr); /* XXX sometimes holds PMOP* when DEBUGGING */
9409 LvTARGLEN(dstr) = LvTARGLEN(sstr);
9410 LvTARG(dstr) = sv_dup_inc(LvTARG(sstr), param);
9411 LvTYPE(dstr) = LvTYPE(sstr);
9414 if (GvUNIQUE((GV*)sstr)) {
9416 if ((share = gv_share(sstr, param))) {
9419 ptr_table_store(PL_ptr_table, sstr, dstr);
9421 PerlIO_printf(Perl_debug_log, "sv_dup: sharing %s::%s\n",
9422 HvNAME(GvSTASH(share)), GvNAME(share));
9427 SvANY(dstr) = new_XPVGV();
9428 SvCUR(dstr) = SvCUR(sstr);
9429 SvLEN(dstr) = SvLEN(sstr);
9430 SvIVX(dstr) = SvIVX(sstr);
9431 SvNVX(dstr) = SvNVX(sstr);
9432 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr), param);
9433 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr), param);
9434 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
9435 GvNAMELEN(dstr) = GvNAMELEN(sstr);
9436 GvNAME(dstr) = SAVEPVN(GvNAME(sstr), GvNAMELEN(sstr));
9437 GvSTASH(dstr) = hv_dup_inc(GvSTASH(sstr), param);
9438 GvFLAGS(dstr) = GvFLAGS(sstr);
9439 GvGP(dstr) = gp_dup(GvGP(sstr), param);
9440 (void)GpREFCNT_inc(GvGP(dstr));
9443 SvANY(dstr) = new_XPVIO();
9444 SvCUR(dstr) = SvCUR(sstr);
9445 SvLEN(dstr) = SvLEN(sstr);
9446 SvIVX(dstr) = SvIVX(sstr);
9447 SvNVX(dstr) = SvNVX(sstr);
9448 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr), param);
9449 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr), param);
9450 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
9451 IoIFP(dstr) = fp_dup(IoIFP(sstr), IoTYPE(sstr), param);
9452 if (IoOFP(sstr) == IoIFP(sstr))
9453 IoOFP(dstr) = IoIFP(dstr);
9455 IoOFP(dstr) = fp_dup(IoOFP(sstr), IoTYPE(sstr), param);
9456 /* PL_rsfp_filters entries have fake IoDIRP() */
9457 if (IoDIRP(sstr) && !(IoFLAGS(sstr) & IOf_FAKE_DIRP))
9458 IoDIRP(dstr) = dirp_dup(IoDIRP(sstr));
9460 IoDIRP(dstr) = IoDIRP(sstr);
9461 IoLINES(dstr) = IoLINES(sstr);
9462 IoPAGE(dstr) = IoPAGE(sstr);
9463 IoPAGE_LEN(dstr) = IoPAGE_LEN(sstr);
9464 IoLINES_LEFT(dstr) = IoLINES_LEFT(sstr);
9465 IoTOP_NAME(dstr) = SAVEPV(IoTOP_NAME(sstr));
9466 IoTOP_GV(dstr) = gv_dup(IoTOP_GV(sstr), param);
9467 IoFMT_NAME(dstr) = SAVEPV(IoFMT_NAME(sstr));
9468 IoFMT_GV(dstr) = gv_dup(IoFMT_GV(sstr), param);
9469 IoBOTTOM_NAME(dstr) = SAVEPV(IoBOTTOM_NAME(sstr));
9470 IoBOTTOM_GV(dstr) = gv_dup(IoBOTTOM_GV(sstr), param);
9471 IoSUBPROCESS(dstr) = IoSUBPROCESS(sstr);
9472 IoTYPE(dstr) = IoTYPE(sstr);
9473 IoFLAGS(dstr) = IoFLAGS(sstr);
9476 SvANY(dstr) = new_XPVAV();
9477 SvCUR(dstr) = SvCUR(sstr);
9478 SvLEN(dstr) = SvLEN(sstr);
9479 SvIVX(dstr) = SvIVX(sstr);
9480 SvNVX(dstr) = SvNVX(sstr);
9481 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr), param);
9482 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr), param);
9483 AvARYLEN((AV*)dstr) = sv_dup_inc(AvARYLEN((AV*)sstr), param);
9484 AvFLAGS((AV*)dstr) = AvFLAGS((AV*)sstr);
9485 if (AvARRAY((AV*)sstr)) {
9486 SV **dst_ary, **src_ary;
9487 SSize_t items = AvFILLp((AV*)sstr) + 1;
9489 src_ary = AvARRAY((AV*)sstr);
9490 Newz(0, dst_ary, AvMAX((AV*)sstr)+1, SV*);
9491 ptr_table_store(PL_ptr_table, src_ary, dst_ary);
9492 SvPVX(dstr) = (char*)dst_ary;
9493 AvALLOC((AV*)dstr) = dst_ary;
9494 if (AvREAL((AV*)sstr)) {
9496 *dst_ary++ = sv_dup_inc(*src_ary++, param);
9500 *dst_ary++ = sv_dup(*src_ary++, param);
9502 items = AvMAX((AV*)sstr) - AvFILLp((AV*)sstr);
9503 while (items-- > 0) {
9504 *dst_ary++ = &PL_sv_undef;
9508 SvPVX(dstr) = Nullch;
9509 AvALLOC((AV*)dstr) = (SV**)NULL;
9513 SvANY(dstr) = new_XPVHV();
9514 SvCUR(dstr) = SvCUR(sstr);
9515 SvLEN(dstr) = SvLEN(sstr);
9516 SvIVX(dstr) = SvIVX(sstr);
9517 SvNVX(dstr) = SvNVX(sstr);
9518 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr), param);
9519 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr), param);
9520 HvRITER((HV*)dstr) = HvRITER((HV*)sstr);
9521 if (HvARRAY((HV*)sstr)) {
9523 XPVHV *dxhv = (XPVHV*)SvANY(dstr);
9524 XPVHV *sxhv = (XPVHV*)SvANY(sstr);
9525 Newz(0, dxhv->xhv_array,
9526 PERL_HV_ARRAY_ALLOC_BYTES(dxhv->xhv_max+1), char);
9527 while (i <= sxhv->xhv_max) {
9528 ((HE**)dxhv->xhv_array)[i] = he_dup(((HE**)sxhv->xhv_array)[i],
9529 (bool)!!HvSHAREKEYS(sstr),
9533 dxhv->xhv_eiter = he_dup(sxhv->xhv_eiter,
9534 (bool)!!HvSHAREKEYS(sstr), param);
9537 SvPVX(dstr) = Nullch;
9538 HvEITER((HV*)dstr) = (HE*)NULL;
9540 HvPMROOT((HV*)dstr) = HvPMROOT((HV*)sstr); /* XXX */
9541 HvNAME((HV*)dstr) = SAVEPV(HvNAME((HV*)sstr));
9542 /* Record stashes for possible cloning in Perl_clone(). */
9543 if(HvNAME((HV*)dstr))
9544 av_push(param->stashes, dstr);
9547 SvANY(dstr) = new_XPVFM();
9548 FmLINES(dstr) = FmLINES(sstr);
9552 SvANY(dstr) = new_XPVCV();
9554 SvCUR(dstr) = SvCUR(sstr);
9555 SvLEN(dstr) = SvLEN(sstr);
9556 SvIVX(dstr) = SvIVX(sstr);
9557 SvNVX(dstr) = SvNVX(sstr);
9558 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr), param);
9559 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr), param);
9560 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
9561 CvSTASH(dstr) = hv_dup(CvSTASH(sstr), param); /* NOTE: not refcounted */
9562 CvSTART(dstr) = CvSTART(sstr);
9563 CvROOT(dstr) = OpREFCNT_inc(CvROOT(sstr));
9564 CvXSUB(dstr) = CvXSUB(sstr);
9565 CvXSUBANY(dstr) = CvXSUBANY(sstr);
9566 if (CvCONST(sstr)) {
9567 CvXSUBANY(dstr).any_ptr = GvUNIQUE(CvGV(sstr)) ?
9568 SvREFCNT_inc(CvXSUBANY(sstr).any_ptr) :
9569 sv_dup_inc(CvXSUBANY(sstr).any_ptr, param);
9571 CvGV(dstr) = gv_dup(CvGV(sstr), param);
9572 if (param->flags & CLONEf_COPY_STACKS) {
9573 CvDEPTH(dstr) = CvDEPTH(sstr);
9577 PAD_DUP(CvPADLIST(dstr), CvPADLIST(sstr), param);
9578 if (!CvANON(sstr) || CvCLONED(sstr))
9579 CvOUTSIDE(dstr) = cv_dup_inc(CvOUTSIDE(sstr), param);
9581 CvOUTSIDE(dstr) = cv_dup(CvOUTSIDE(sstr), param);
9582 CvFLAGS(dstr) = CvFLAGS(sstr);
9583 CvFILE(dstr) = CvXSUB(sstr) ? CvFILE(sstr) : SAVEPV(CvFILE(sstr));
9586 Perl_croak(aTHX_ "Bizarre SvTYPE [%" IVdf "]", (IV)SvTYPE(sstr));
9590 if (SvOBJECT(dstr) && SvTYPE(dstr) != SVt_PVIO)
9596 /* duplicate a context */
9599 Perl_cx_dup(pTHX_ PERL_CONTEXT *cxs, I32 ix, I32 max, CLONE_PARAMS* param)
9604 return (PERL_CONTEXT*)NULL;
9606 /* look for it in the table first */
9607 ncxs = (PERL_CONTEXT*)ptr_table_fetch(PL_ptr_table, cxs);
9611 /* create anew and remember what it is */
9612 Newz(56, ncxs, max + 1, PERL_CONTEXT);
9613 ptr_table_store(PL_ptr_table, cxs, ncxs);
9616 PERL_CONTEXT *cx = &cxs[ix];
9617 PERL_CONTEXT *ncx = &ncxs[ix];
9618 ncx->cx_type = cx->cx_type;
9619 if (CxTYPE(cx) == CXt_SUBST) {
9620 Perl_croak(aTHX_ "Cloning substitution context is unimplemented");
9623 ncx->blk_oldsp = cx->blk_oldsp;
9624 ncx->blk_oldcop = cx->blk_oldcop;
9625 ncx->blk_oldretsp = cx->blk_oldretsp;
9626 ncx->blk_oldmarksp = cx->blk_oldmarksp;
9627 ncx->blk_oldscopesp = cx->blk_oldscopesp;
9628 ncx->blk_oldpm = cx->blk_oldpm;
9629 ncx->blk_gimme = cx->blk_gimme;
9630 switch (CxTYPE(cx)) {
9632 ncx->blk_sub.cv = (cx->blk_sub.olddepth == 0
9633 ? cv_dup_inc(cx->blk_sub.cv, param)
9634 : cv_dup(cx->blk_sub.cv,param));
9635 ncx->blk_sub.argarray = (cx->blk_sub.hasargs
9636 ? av_dup_inc(cx->blk_sub.argarray, param)
9638 ncx->blk_sub.savearray = av_dup_inc(cx->blk_sub.savearray, param);
9639 ncx->blk_sub.olddepth = cx->blk_sub.olddepth;
9640 ncx->blk_sub.hasargs = cx->blk_sub.hasargs;
9641 ncx->blk_sub.lval = cx->blk_sub.lval;
9644 ncx->blk_eval.old_in_eval = cx->blk_eval.old_in_eval;
9645 ncx->blk_eval.old_op_type = cx->blk_eval.old_op_type;
9646 ncx->blk_eval.old_namesv = sv_dup_inc(cx->blk_eval.old_namesv, param);
9647 ncx->blk_eval.old_eval_root = cx->blk_eval.old_eval_root;
9648 ncx->blk_eval.cur_text = sv_dup(cx->blk_eval.cur_text, param);
9651 ncx->blk_loop.label = cx->blk_loop.label;
9652 ncx->blk_loop.resetsp = cx->blk_loop.resetsp;
9653 ncx->blk_loop.redo_op = cx->blk_loop.redo_op;
9654 ncx->blk_loop.next_op = cx->blk_loop.next_op;
9655 ncx->blk_loop.last_op = cx->blk_loop.last_op;
9656 ncx->blk_loop.iterdata = (CxPADLOOP(cx)
9657 ? cx->blk_loop.iterdata
9658 : gv_dup((GV*)cx->blk_loop.iterdata, param));
9659 ncx->blk_loop.oldcurpad
9660 = (SV**)ptr_table_fetch(PL_ptr_table,
9661 cx->blk_loop.oldcurpad);
9662 ncx->blk_loop.itersave = sv_dup_inc(cx->blk_loop.itersave, param);
9663 ncx->blk_loop.iterlval = sv_dup_inc(cx->blk_loop.iterlval, param);
9664 ncx->blk_loop.iterary = av_dup_inc(cx->blk_loop.iterary, param);
9665 ncx->blk_loop.iterix = cx->blk_loop.iterix;
9666 ncx->blk_loop.itermax = cx->blk_loop.itermax;
9669 ncx->blk_sub.cv = cv_dup(cx->blk_sub.cv, param);
9670 ncx->blk_sub.gv = gv_dup(cx->blk_sub.gv, param);
9671 ncx->blk_sub.dfoutgv = gv_dup_inc(cx->blk_sub.dfoutgv, param);
9672 ncx->blk_sub.hasargs = cx->blk_sub.hasargs;
9684 /* duplicate a stack info structure */
9687 Perl_si_dup(pTHX_ PERL_SI *si, CLONE_PARAMS* param)
9692 return (PERL_SI*)NULL;
9694 /* look for it in the table first */
9695 nsi = (PERL_SI*)ptr_table_fetch(PL_ptr_table, si);
9699 /* create anew and remember what it is */
9700 Newz(56, nsi, 1, PERL_SI);
9701 ptr_table_store(PL_ptr_table, si, nsi);
9703 nsi->si_stack = av_dup_inc(si->si_stack, param);
9704 nsi->si_cxix = si->si_cxix;
9705 nsi->si_cxmax = si->si_cxmax;
9706 nsi->si_cxstack = cx_dup(si->si_cxstack, si->si_cxix, si->si_cxmax, param);
9707 nsi->si_type = si->si_type;
9708 nsi->si_prev = si_dup(si->si_prev, param);
9709 nsi->si_next = si_dup(si->si_next, param);
9710 nsi->si_markoff = si->si_markoff;
9715 #define POPINT(ss,ix) ((ss)[--(ix)].any_i32)
9716 #define TOPINT(ss,ix) ((ss)[ix].any_i32)
9717 #define POPLONG(ss,ix) ((ss)[--(ix)].any_long)
9718 #define TOPLONG(ss,ix) ((ss)[ix].any_long)
9719 #define POPIV(ss,ix) ((ss)[--(ix)].any_iv)
9720 #define TOPIV(ss,ix) ((ss)[ix].any_iv)
9721 #define POPPTR(ss,ix) ((ss)[--(ix)].any_ptr)
9722 #define TOPPTR(ss,ix) ((ss)[ix].any_ptr)
9723 #define POPDPTR(ss,ix) ((ss)[--(ix)].any_dptr)
9724 #define TOPDPTR(ss,ix) ((ss)[ix].any_dptr)
9725 #define POPDXPTR(ss,ix) ((ss)[--(ix)].any_dxptr)
9726 #define TOPDXPTR(ss,ix) ((ss)[ix].any_dxptr)
9729 #define pv_dup_inc(p) SAVEPV(p)
9730 #define pv_dup(p) SAVEPV(p)
9731 #define svp_dup_inc(p,pp) any_dup(p,pp)
9733 /* map any object to the new equivent - either something in the
9734 * ptr table, or something in the interpreter structure
9738 Perl_any_dup(pTHX_ void *v, PerlInterpreter *proto_perl)
9745 /* look for it in the table first */
9746 ret = ptr_table_fetch(PL_ptr_table, v);
9750 /* see if it is part of the interpreter structure */
9751 if (v >= (void*)proto_perl && v < (void*)(proto_perl+1))
9752 ret = (void*)(((char*)aTHX) + (((char*)v) - (char*)proto_perl));
9760 /* duplicate the save stack */
9763 Perl_ss_dup(pTHX_ PerlInterpreter *proto_perl, CLONE_PARAMS* param)
9765 ANY *ss = proto_perl->Tsavestack;
9766 I32 ix = proto_perl->Tsavestack_ix;
9767 I32 max = proto_perl->Tsavestack_max;
9780 void (*dptr) (void*);
9781 void (*dxptr) (pTHX_ void*);
9784 Newz(54, nss, max, ANY);
9790 case SAVEt_ITEM: /* normal string */
9791 sv = (SV*)POPPTR(ss,ix);
9792 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
9793 sv = (SV*)POPPTR(ss,ix);
9794 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
9796 case SAVEt_SV: /* scalar reference */
9797 sv = (SV*)POPPTR(ss,ix);
9798 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
9799 gv = (GV*)POPPTR(ss,ix);
9800 TOPPTR(nss,ix) = gv_dup_inc(gv, param);
9802 case SAVEt_GENERIC_PVREF: /* generic char* */
9803 c = (char*)POPPTR(ss,ix);
9804 TOPPTR(nss,ix) = pv_dup(c);
9805 ptr = POPPTR(ss,ix);
9806 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
9808 case SAVEt_SHARED_PVREF: /* char* in shared space */
9809 c = (char*)POPPTR(ss,ix);
9810 TOPPTR(nss,ix) = savesharedpv(c);
9811 ptr = POPPTR(ss,ix);
9812 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
9814 case SAVEt_GENERIC_SVREF: /* generic sv */
9815 case SAVEt_SVREF: /* scalar reference */
9816 sv = (SV*)POPPTR(ss,ix);
9817 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
9818 ptr = POPPTR(ss,ix);
9819 TOPPTR(nss,ix) = svp_dup_inc((SV**)ptr, proto_perl);/* XXXXX */
9821 case SAVEt_AV: /* array reference */
9822 av = (AV*)POPPTR(ss,ix);
9823 TOPPTR(nss,ix) = av_dup_inc(av, param);
9824 gv = (GV*)POPPTR(ss,ix);
9825 TOPPTR(nss,ix) = gv_dup(gv, param);
9827 case SAVEt_HV: /* hash reference */
9828 hv = (HV*)POPPTR(ss,ix);
9829 TOPPTR(nss,ix) = hv_dup_inc(hv, param);
9830 gv = (GV*)POPPTR(ss,ix);
9831 TOPPTR(nss,ix) = gv_dup(gv, param);
9833 case SAVEt_INT: /* int reference */
9834 ptr = POPPTR(ss,ix);
9835 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
9836 intval = (int)POPINT(ss,ix);
9837 TOPINT(nss,ix) = intval;
9839 case SAVEt_LONG: /* long reference */
9840 ptr = POPPTR(ss,ix);
9841 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
9842 longval = (long)POPLONG(ss,ix);
9843 TOPLONG(nss,ix) = longval;
9845 case SAVEt_I32: /* I32 reference */
9846 case SAVEt_I16: /* I16 reference */
9847 case SAVEt_I8: /* I8 reference */
9848 ptr = POPPTR(ss,ix);
9849 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
9853 case SAVEt_IV: /* IV reference */
9854 ptr = POPPTR(ss,ix);
9855 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
9859 case SAVEt_SPTR: /* SV* reference */
9860 ptr = POPPTR(ss,ix);
9861 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
9862 sv = (SV*)POPPTR(ss,ix);
9863 TOPPTR(nss,ix) = sv_dup(sv, param);
9865 case SAVEt_VPTR: /* random* reference */
9866 ptr = POPPTR(ss,ix);
9867 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
9868 ptr = POPPTR(ss,ix);
9869 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
9871 case SAVEt_PPTR: /* char* reference */
9872 ptr = POPPTR(ss,ix);
9873 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
9874 c = (char*)POPPTR(ss,ix);
9875 TOPPTR(nss,ix) = pv_dup(c);
9877 case SAVEt_HPTR: /* HV* reference */
9878 ptr = POPPTR(ss,ix);
9879 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
9880 hv = (HV*)POPPTR(ss,ix);
9881 TOPPTR(nss,ix) = hv_dup(hv, param);
9883 case SAVEt_APTR: /* AV* reference */
9884 ptr = POPPTR(ss,ix);
9885 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
9886 av = (AV*)POPPTR(ss,ix);
9887 TOPPTR(nss,ix) = av_dup(av, param);
9890 gv = (GV*)POPPTR(ss,ix);
9891 TOPPTR(nss,ix) = gv_dup(gv, param);
9893 case SAVEt_GP: /* scalar reference */
9894 gp = (GP*)POPPTR(ss,ix);
9895 TOPPTR(nss,ix) = gp = gp_dup(gp, param);
9896 (void)GpREFCNT_inc(gp);
9897 gv = (GV*)POPPTR(ss,ix);
9898 TOPPTR(nss,ix) = gv_dup_inc(gv, param);
9899 c = (char*)POPPTR(ss,ix);
9900 TOPPTR(nss,ix) = pv_dup(c);
9907 case SAVEt_MORTALIZESV:
9908 sv = (SV*)POPPTR(ss,ix);
9909 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
9912 ptr = POPPTR(ss,ix);
9913 if (ptr && (((OP*)ptr)->op_private & OPpREFCOUNTED)) {
9914 /* these are assumed to be refcounted properly */
9915 switch (((OP*)ptr)->op_type) {
9922 TOPPTR(nss,ix) = ptr;
9927 TOPPTR(nss,ix) = Nullop;
9932 TOPPTR(nss,ix) = Nullop;
9935 c = (char*)POPPTR(ss,ix);
9936 TOPPTR(nss,ix) = pv_dup_inc(c);
9939 longval = POPLONG(ss,ix);
9940 TOPLONG(nss,ix) = longval;
9943 hv = (HV*)POPPTR(ss,ix);
9944 TOPPTR(nss,ix) = hv_dup_inc(hv, param);
9945 c = (char*)POPPTR(ss,ix);
9946 TOPPTR(nss,ix) = pv_dup_inc(c);
9950 case SAVEt_DESTRUCTOR:
9951 ptr = POPPTR(ss,ix);
9952 TOPPTR(nss,ix) = any_dup(ptr, proto_perl); /* XXX quite arbitrary */
9953 dptr = POPDPTR(ss,ix);
9954 TOPDPTR(nss,ix) = (void (*)(void*))any_dup((void *)dptr, proto_perl);
9956 case SAVEt_DESTRUCTOR_X:
9957 ptr = POPPTR(ss,ix);
9958 TOPPTR(nss,ix) = any_dup(ptr, proto_perl); /* XXX quite arbitrary */
9959 dxptr = POPDXPTR(ss,ix);
9960 TOPDXPTR(nss,ix) = (void (*)(pTHX_ void*))any_dup((void *)dxptr, proto_perl);
9962 case SAVEt_REGCONTEXT:
9968 case SAVEt_STACK_POS: /* Position on Perl stack */
9972 case SAVEt_AELEM: /* array element */
9973 sv = (SV*)POPPTR(ss,ix);
9974 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
9977 av = (AV*)POPPTR(ss,ix);
9978 TOPPTR(nss,ix) = av_dup_inc(av, param);
9980 case SAVEt_HELEM: /* hash element */
9981 sv = (SV*)POPPTR(ss,ix);
9982 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
9983 sv = (SV*)POPPTR(ss,ix);
9984 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
9985 hv = (HV*)POPPTR(ss,ix);
9986 TOPPTR(nss,ix) = hv_dup_inc(hv, param);
9989 ptr = POPPTR(ss,ix);
9990 TOPPTR(nss,ix) = ptr;
9997 av = (AV*)POPPTR(ss,ix);
9998 TOPPTR(nss,ix) = av_dup(av, param);
10001 longval = (long)POPLONG(ss,ix);
10002 TOPLONG(nss,ix) = longval;
10003 ptr = POPPTR(ss,ix);
10004 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10005 sv = (SV*)POPPTR(ss,ix);
10006 TOPPTR(nss,ix) = sv_dup(sv, param);
10009 Perl_croak(aTHX_ "panic: ss_dup inconsistency");
10017 =for apidoc perl_clone
10019 Create and return a new interpreter by cloning the current one.
10024 /* XXX the above needs expanding by someone who actually understands it ! */
10025 EXTERN_C PerlInterpreter *
10026 perl_clone_host(PerlInterpreter* proto_perl, UV flags);
10029 perl_clone(PerlInterpreter *proto_perl, UV flags)
10031 #ifdef PERL_IMPLICIT_SYS
10033 /* perlhost.h so we need to call into it
10034 to clone the host, CPerlHost should have a c interface, sky */
10036 if (flags & CLONEf_CLONE_HOST) {
10037 return perl_clone_host(proto_perl,flags);
10039 return perl_clone_using(proto_perl, flags,
10041 proto_perl->IMemShared,
10042 proto_perl->IMemParse,
10044 proto_perl->IStdIO,
10048 proto_perl->IProc);
10052 perl_clone_using(PerlInterpreter *proto_perl, UV flags,
10053 struct IPerlMem* ipM, struct IPerlMem* ipMS,
10054 struct IPerlMem* ipMP, struct IPerlEnv* ipE,
10055 struct IPerlStdIO* ipStd, struct IPerlLIO* ipLIO,
10056 struct IPerlDir* ipD, struct IPerlSock* ipS,
10057 struct IPerlProc* ipP)
10059 /* XXX many of the string copies here can be optimized if they're
10060 * constants; they need to be allocated as common memory and just
10061 * their pointers copied. */
10064 CLONE_PARAMS clone_params;
10065 CLONE_PARAMS* param = &clone_params;
10067 PerlInterpreter *my_perl = (PerlInterpreter*)(*ipM->pMalloc)(ipM, sizeof(PerlInterpreter));
10068 PERL_SET_THX(my_perl);
10071 Poison(my_perl, 1, PerlInterpreter);
10076 PL_sig_pending = 0;
10077 Zero(&PL_debug_pad, 1, struct perl_debug_pad);
10078 # else /* !DEBUGGING */
10079 Zero(my_perl, 1, PerlInterpreter);
10080 # endif /* DEBUGGING */
10082 /* host pointers */
10084 PL_MemShared = ipMS;
10085 PL_MemParse = ipMP;
10092 #else /* !PERL_IMPLICIT_SYS */
10094 CLONE_PARAMS clone_params;
10095 CLONE_PARAMS* param = &clone_params;
10096 PerlInterpreter *my_perl = (PerlInterpreter*)PerlMem_malloc(sizeof(PerlInterpreter));
10097 PERL_SET_THX(my_perl);
10102 Poison(my_perl, 1, PerlInterpreter);
10107 PL_sig_pending = 0;
10108 Zero(&PL_debug_pad, 1, struct perl_debug_pad);
10109 # else /* !DEBUGGING */
10110 Zero(my_perl, 1, PerlInterpreter);
10111 # endif /* DEBUGGING */
10112 #endif /* PERL_IMPLICIT_SYS */
10113 param->flags = flags;
10114 param->proto_perl = proto_perl;
10117 PL_xiv_arenaroot = NULL;
10118 PL_xiv_root = NULL;
10119 PL_xnv_arenaroot = NULL;
10120 PL_xnv_root = NULL;
10121 PL_xrv_arenaroot = NULL;
10122 PL_xrv_root = NULL;
10123 PL_xpv_arenaroot = NULL;
10124 PL_xpv_root = NULL;
10125 PL_xpviv_arenaroot = NULL;
10126 PL_xpviv_root = NULL;
10127 PL_xpvnv_arenaroot = NULL;
10128 PL_xpvnv_root = NULL;
10129 PL_xpvcv_arenaroot = NULL;
10130 PL_xpvcv_root = NULL;
10131 PL_xpvav_arenaroot = NULL;
10132 PL_xpvav_root = NULL;
10133 PL_xpvhv_arenaroot = NULL;
10134 PL_xpvhv_root = NULL;
10135 PL_xpvmg_arenaroot = NULL;
10136 PL_xpvmg_root = NULL;
10137 PL_xpvlv_arenaroot = NULL;
10138 PL_xpvlv_root = NULL;
10139 PL_xpvbm_arenaroot = NULL;
10140 PL_xpvbm_root = NULL;
10141 PL_he_arenaroot = NULL;
10143 PL_nice_chunk = NULL;
10144 PL_nice_chunk_size = 0;
10146 PL_sv_objcount = 0;
10147 PL_sv_root = Nullsv;
10148 PL_sv_arenaroot = Nullsv;
10150 PL_debug = proto_perl->Idebug;
10152 #ifdef USE_REENTRANT_API
10153 Perl_reentrant_init(aTHX);
10156 /* create SV map for pointer relocation */
10157 PL_ptr_table = ptr_table_new();
10159 /* initialize these special pointers as early as possible */
10160 SvANY(&PL_sv_undef) = NULL;
10161 SvREFCNT(&PL_sv_undef) = (~(U32)0)/2;
10162 SvFLAGS(&PL_sv_undef) = SVf_READONLY|SVt_NULL;
10163 ptr_table_store(PL_ptr_table, &proto_perl->Isv_undef, &PL_sv_undef);
10165 SvANY(&PL_sv_no) = new_XPVNV();
10166 SvREFCNT(&PL_sv_no) = (~(U32)0)/2;
10167 SvFLAGS(&PL_sv_no) = SVp_NOK|SVf_NOK|SVp_POK|SVf_POK|SVf_READONLY|SVt_PVNV;
10168 SvPVX(&PL_sv_no) = SAVEPVN(PL_No, 0);
10169 SvCUR(&PL_sv_no) = 0;
10170 SvLEN(&PL_sv_no) = 1;
10171 SvNVX(&PL_sv_no) = 0;
10172 ptr_table_store(PL_ptr_table, &proto_perl->Isv_no, &PL_sv_no);
10174 SvANY(&PL_sv_yes) = new_XPVNV();
10175 SvREFCNT(&PL_sv_yes) = (~(U32)0)/2;
10176 SvFLAGS(&PL_sv_yes) = SVp_NOK|SVf_NOK|SVp_POK|SVf_POK|SVf_READONLY|SVt_PVNV;
10177 SvPVX(&PL_sv_yes) = SAVEPVN(PL_Yes, 1);
10178 SvCUR(&PL_sv_yes) = 1;
10179 SvLEN(&PL_sv_yes) = 2;
10180 SvNVX(&PL_sv_yes) = 1;
10181 ptr_table_store(PL_ptr_table, &proto_perl->Isv_yes, &PL_sv_yes);
10183 /* create (a non-shared!) shared string table */
10184 PL_strtab = newHV();
10185 HvSHAREKEYS_off(PL_strtab);
10186 hv_ksplit(PL_strtab, 512);
10187 ptr_table_store(PL_ptr_table, proto_perl->Istrtab, PL_strtab);
10189 PL_compiling = proto_perl->Icompiling;
10191 /* These two PVs will be free'd special way so must set them same way op.c does */
10192 PL_compiling.cop_stashpv = savesharedpv(PL_compiling.cop_stashpv);
10193 ptr_table_store(PL_ptr_table, proto_perl->Icompiling.cop_stashpv, PL_compiling.cop_stashpv);
10195 PL_compiling.cop_file = savesharedpv(PL_compiling.cop_file);
10196 ptr_table_store(PL_ptr_table, proto_perl->Icompiling.cop_file, PL_compiling.cop_file);
10198 ptr_table_store(PL_ptr_table, &proto_perl->Icompiling, &PL_compiling);
10199 if (!specialWARN(PL_compiling.cop_warnings))
10200 PL_compiling.cop_warnings = sv_dup_inc(PL_compiling.cop_warnings, param);
10201 if (!specialCopIO(PL_compiling.cop_io))
10202 PL_compiling.cop_io = sv_dup_inc(PL_compiling.cop_io, param);
10203 PL_curcop = (COP*)any_dup(proto_perl->Tcurcop, proto_perl);
10205 /* pseudo environmental stuff */
10206 PL_origargc = proto_perl->Iorigargc;
10208 New(0, PL_origargv, i+1, char*);
10209 PL_origargv[i] = '\0';
10211 PL_origargv[i] = SAVEPV(proto_perl->Iorigargv[i]);
10214 param->stashes = newAV(); /* Setup array of objects to call clone on */
10216 #ifdef PERLIO_LAYERS
10217 /* Clone PerlIO tables as soon as we can handle general xx_dup() */
10218 PerlIO_clone(aTHX_ proto_perl, param);
10221 PL_envgv = gv_dup(proto_perl->Ienvgv, param);
10222 PL_incgv = gv_dup(proto_perl->Iincgv, param);
10223 PL_hintgv = gv_dup(proto_perl->Ihintgv, param);
10224 PL_origfilename = SAVEPV(proto_perl->Iorigfilename);
10225 PL_diehook = sv_dup_inc(proto_perl->Idiehook, param);
10226 PL_warnhook = sv_dup_inc(proto_perl->Iwarnhook, param);
10229 PL_minus_c = proto_perl->Iminus_c;
10230 PL_patchlevel = sv_dup_inc(proto_perl->Ipatchlevel, param);
10231 PL_localpatches = proto_perl->Ilocalpatches;
10232 PL_splitstr = proto_perl->Isplitstr;
10233 PL_preprocess = proto_perl->Ipreprocess;
10234 PL_minus_n = proto_perl->Iminus_n;
10235 PL_minus_p = proto_perl->Iminus_p;
10236 PL_minus_l = proto_perl->Iminus_l;
10237 PL_minus_a = proto_perl->Iminus_a;
10238 PL_minus_F = proto_perl->Iminus_F;
10239 PL_doswitches = proto_perl->Idoswitches;
10240 PL_dowarn = proto_perl->Idowarn;
10241 PL_doextract = proto_perl->Idoextract;
10242 PL_sawampersand = proto_perl->Isawampersand;
10243 PL_unsafe = proto_perl->Iunsafe;
10244 PL_inplace = SAVEPV(proto_perl->Iinplace);
10245 PL_e_script = sv_dup_inc(proto_perl->Ie_script, param);
10246 PL_perldb = proto_perl->Iperldb;
10247 PL_perl_destruct_level = proto_perl->Iperl_destruct_level;
10248 PL_exit_flags = proto_perl->Iexit_flags;
10250 /* magical thingies */
10251 /* XXX time(&PL_basetime) when asked for? */
10252 PL_basetime = proto_perl->Ibasetime;
10253 PL_formfeed = sv_dup(proto_perl->Iformfeed, param);
10255 PL_maxsysfd = proto_perl->Imaxsysfd;
10256 PL_multiline = proto_perl->Imultiline;
10257 PL_statusvalue = proto_perl->Istatusvalue;
10259 PL_statusvalue_vms = proto_perl->Istatusvalue_vms;
10261 PL_encoding = sv_dup(proto_perl->Iencoding, param);
10263 sv_setpvn(PERL_DEBUG_PAD(0), "", 0); /* For regex debugging. */
10264 sv_setpvn(PERL_DEBUG_PAD(1), "", 0); /* ext/re needs these */
10265 sv_setpvn(PERL_DEBUG_PAD(2), "", 0); /* even without DEBUGGING. */
10267 /* Clone the regex array */
10268 PL_regex_padav = newAV();
10270 I32 len = av_len((AV*)proto_perl->Iregex_padav);
10271 SV** regexen = AvARRAY((AV*)proto_perl->Iregex_padav);
10272 av_push(PL_regex_padav,
10273 sv_dup_inc(regexen[0],param));
10274 for(i = 1; i <= len; i++) {
10275 if(SvREPADTMP(regexen[i])) {
10276 av_push(PL_regex_padav, sv_dup_inc(regexen[i], param));
10278 av_push(PL_regex_padav,
10280 newSViv(PTR2IV(re_dup(INT2PTR(REGEXP *,
10281 SvIVX(regexen[i])), param)))
10286 PL_regex_pad = AvARRAY(PL_regex_padav);
10288 /* shortcuts to various I/O objects */
10289 PL_stdingv = gv_dup(proto_perl->Istdingv, param);
10290 PL_stderrgv = gv_dup(proto_perl->Istderrgv, param);
10291 PL_defgv = gv_dup(proto_perl->Idefgv, param);
10292 PL_argvgv = gv_dup(proto_perl->Iargvgv, param);
10293 PL_argvoutgv = gv_dup(proto_perl->Iargvoutgv, param);
10294 PL_argvout_stack = av_dup_inc(proto_perl->Iargvout_stack, param);
10296 /* shortcuts to regexp stuff */
10297 PL_replgv = gv_dup(proto_perl->Ireplgv, param);
10299 /* shortcuts to misc objects */
10300 PL_errgv = gv_dup(proto_perl->Ierrgv, param);
10302 /* shortcuts to debugging objects */
10303 PL_DBgv = gv_dup(proto_perl->IDBgv, param);
10304 PL_DBline = gv_dup(proto_perl->IDBline, param);
10305 PL_DBsub = gv_dup(proto_perl->IDBsub, param);
10306 PL_DBsingle = sv_dup(proto_perl->IDBsingle, param);
10307 PL_DBtrace = sv_dup(proto_perl->IDBtrace, param);
10308 PL_DBsignal = sv_dup(proto_perl->IDBsignal, param);
10309 PL_lineary = av_dup(proto_perl->Ilineary, param);
10310 PL_dbargs = av_dup(proto_perl->Idbargs, param);
10312 /* symbol tables */
10313 PL_defstash = hv_dup_inc(proto_perl->Tdefstash, param);
10314 PL_curstash = hv_dup(proto_perl->Tcurstash, param);
10315 PL_debstash = hv_dup(proto_perl->Idebstash, param);
10316 PL_globalstash = hv_dup(proto_perl->Iglobalstash, param);
10317 PL_curstname = sv_dup_inc(proto_perl->Icurstname, param);
10319 PL_beginav = av_dup_inc(proto_perl->Ibeginav, param);
10320 PL_beginav_save = av_dup_inc(proto_perl->Ibeginav_save, param);
10321 PL_checkav_save = av_dup_inc(proto_perl->Icheckav_save, param);
10322 PL_endav = av_dup_inc(proto_perl->Iendav, param);
10323 PL_checkav = av_dup_inc(proto_perl->Icheckav, param);
10324 PL_initav = av_dup_inc(proto_perl->Iinitav, param);
10326 PL_sub_generation = proto_perl->Isub_generation;
10328 /* funky return mechanisms */
10329 PL_forkprocess = proto_perl->Iforkprocess;
10331 /* subprocess state */
10332 PL_fdpid = av_dup_inc(proto_perl->Ifdpid, param);
10334 /* internal state */
10335 PL_tainting = proto_perl->Itainting;
10336 PL_maxo = proto_perl->Imaxo;
10337 if (proto_perl->Iop_mask)
10338 PL_op_mask = SAVEPVN(proto_perl->Iop_mask, PL_maxo);
10340 PL_op_mask = Nullch;
10342 /* current interpreter roots */
10343 PL_main_cv = cv_dup_inc(proto_perl->Imain_cv, param);
10344 PL_main_root = OpREFCNT_inc(proto_perl->Imain_root);
10345 PL_main_start = proto_perl->Imain_start;
10346 PL_eval_root = proto_perl->Ieval_root;
10347 PL_eval_start = proto_perl->Ieval_start;
10349 /* runtime control stuff */
10350 PL_curcopdb = (COP*)any_dup(proto_perl->Icurcopdb, proto_perl);
10351 PL_copline = proto_perl->Icopline;
10353 PL_filemode = proto_perl->Ifilemode;
10354 PL_lastfd = proto_perl->Ilastfd;
10355 PL_oldname = proto_perl->Ioldname; /* XXX not quite right */
10358 PL_gensym = proto_perl->Igensym;
10359 PL_preambled = proto_perl->Ipreambled;
10360 PL_preambleav = av_dup_inc(proto_perl->Ipreambleav, param);
10361 PL_laststatval = proto_perl->Ilaststatval;
10362 PL_laststype = proto_perl->Ilaststype;
10363 PL_mess_sv = Nullsv;
10365 PL_ors_sv = sv_dup_inc(proto_perl->Iors_sv, param);
10366 PL_ofmt = SAVEPV(proto_perl->Iofmt);
10368 /* interpreter atexit processing */
10369 PL_exitlistlen = proto_perl->Iexitlistlen;
10370 if (PL_exitlistlen) {
10371 New(0, PL_exitlist, PL_exitlistlen, PerlExitListEntry);
10372 Copy(proto_perl->Iexitlist, PL_exitlist, PL_exitlistlen, PerlExitListEntry);
10375 PL_exitlist = (PerlExitListEntry*)NULL;
10376 PL_modglobal = hv_dup_inc(proto_perl->Imodglobal, param);
10377 PL_custom_op_names = hv_dup_inc(proto_perl->Icustom_op_names,param);
10378 PL_custom_op_descs = hv_dup_inc(proto_perl->Icustom_op_descs,param);
10380 PL_profiledata = NULL;
10381 PL_rsfp = fp_dup(proto_perl->Irsfp, '<', param);
10382 /* PL_rsfp_filters entries have fake IoDIRP() */
10383 PL_rsfp_filters = av_dup_inc(proto_perl->Irsfp_filters, param);
10385 PL_compcv = cv_dup(proto_perl->Icompcv, param);
10387 PAD_CLONE_VARS(proto_perl, param);
10389 #ifdef HAVE_INTERP_INTERN
10390 sys_intern_dup(&proto_perl->Isys_intern, &PL_sys_intern);
10393 /* more statics moved here */
10394 PL_generation = proto_perl->Igeneration;
10395 PL_DBcv = cv_dup(proto_perl->IDBcv, param);
10397 PL_in_clean_objs = proto_perl->Iin_clean_objs;
10398 PL_in_clean_all = proto_perl->Iin_clean_all;
10400 PL_uid = proto_perl->Iuid;
10401 PL_euid = proto_perl->Ieuid;
10402 PL_gid = proto_perl->Igid;
10403 PL_egid = proto_perl->Iegid;
10404 PL_nomemok = proto_perl->Inomemok;
10405 PL_an = proto_perl->Ian;
10406 PL_op_seqmax = proto_perl->Iop_seqmax;
10407 PL_evalseq = proto_perl->Ievalseq;
10408 PL_origenviron = proto_perl->Iorigenviron; /* XXX not quite right */
10409 PL_origalen = proto_perl->Iorigalen;
10410 PL_pidstatus = newHV(); /* XXX flag for cloning? */
10411 PL_osname = SAVEPV(proto_perl->Iosname);
10412 PL_sh_path = proto_perl->Ish_path; /* XXX never deallocated */
10413 PL_sighandlerp = proto_perl->Isighandlerp;
10416 PL_runops = proto_perl->Irunops;
10418 Copy(proto_perl->Itokenbuf, PL_tokenbuf, 256, char);
10421 PL_cshlen = proto_perl->Icshlen;
10422 PL_cshname = proto_perl->Icshname; /* XXX never deallocated */
10425 PL_lex_state = proto_perl->Ilex_state;
10426 PL_lex_defer = proto_perl->Ilex_defer;
10427 PL_lex_expect = proto_perl->Ilex_expect;
10428 PL_lex_formbrack = proto_perl->Ilex_formbrack;
10429 PL_lex_dojoin = proto_perl->Ilex_dojoin;
10430 PL_lex_starts = proto_perl->Ilex_starts;
10431 PL_lex_stuff = sv_dup_inc(proto_perl->Ilex_stuff, param);
10432 PL_lex_repl = sv_dup_inc(proto_perl->Ilex_repl, param);
10433 PL_lex_op = proto_perl->Ilex_op;
10434 PL_lex_inpat = proto_perl->Ilex_inpat;
10435 PL_lex_inwhat = proto_perl->Ilex_inwhat;
10436 PL_lex_brackets = proto_perl->Ilex_brackets;
10437 i = (PL_lex_brackets < 120 ? 120 : PL_lex_brackets);
10438 PL_lex_brackstack = SAVEPVN(proto_perl->Ilex_brackstack,i);
10439 PL_lex_casemods = proto_perl->Ilex_casemods;
10440 i = (PL_lex_casemods < 12 ? 12 : PL_lex_casemods);
10441 PL_lex_casestack = SAVEPVN(proto_perl->Ilex_casestack,i);
10443 Copy(proto_perl->Inextval, PL_nextval, 5, YYSTYPE);
10444 Copy(proto_perl->Inexttype, PL_nexttype, 5, I32);
10445 PL_nexttoke = proto_perl->Inexttoke;
10447 /* XXX This is probably masking the deeper issue of why
10448 * SvANY(proto_perl->Ilinestr) can be NULL at this point. For test case:
10449 * http://archive.develooper.com/perl5-porters%40perl.org/msg83298.html
10450 * (A little debugging with a watchpoint on it may help.)
10452 if (SvANY(proto_perl->Ilinestr)) {
10453 PL_linestr = sv_dup_inc(proto_perl->Ilinestr, param);
10454 i = proto_perl->Ibufptr - SvPVX(proto_perl->Ilinestr);
10455 PL_bufptr = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
10456 i = proto_perl->Ioldbufptr - SvPVX(proto_perl->Ilinestr);
10457 PL_oldbufptr = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
10458 i = proto_perl->Ioldoldbufptr - SvPVX(proto_perl->Ilinestr);
10459 PL_oldoldbufptr = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
10460 i = proto_perl->Ilinestart - SvPVX(proto_perl->Ilinestr);
10461 PL_linestart = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
10464 PL_linestr = NEWSV(65,79);
10465 sv_upgrade(PL_linestr,SVt_PVIV);
10466 sv_setpvn(PL_linestr,"",0);
10467 PL_bufptr = PL_oldbufptr = PL_oldoldbufptr = PL_linestart = SvPVX(PL_linestr);
10469 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
10470 PL_pending_ident = proto_perl->Ipending_ident;
10471 PL_sublex_info = proto_perl->Isublex_info; /* XXX not quite right */
10473 PL_expect = proto_perl->Iexpect;
10475 PL_multi_start = proto_perl->Imulti_start;
10476 PL_multi_end = proto_perl->Imulti_end;
10477 PL_multi_open = proto_perl->Imulti_open;
10478 PL_multi_close = proto_perl->Imulti_close;
10480 PL_error_count = proto_perl->Ierror_count;
10481 PL_subline = proto_perl->Isubline;
10482 PL_subname = sv_dup_inc(proto_perl->Isubname, param);
10484 /* XXX See comment on SvANY(proto_perl->Ilinestr) above */
10485 if (SvANY(proto_perl->Ilinestr)) {
10486 i = proto_perl->Ilast_uni - SvPVX(proto_perl->Ilinestr);
10487 PL_last_uni = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
10488 i = proto_perl->Ilast_lop - SvPVX(proto_perl->Ilinestr);
10489 PL_last_lop = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
10490 PL_last_lop_op = proto_perl->Ilast_lop_op;
10493 PL_last_uni = SvPVX(PL_linestr);
10494 PL_last_lop = SvPVX(PL_linestr);
10495 PL_last_lop_op = 0;
10497 PL_in_my = proto_perl->Iin_my;
10498 PL_in_my_stash = hv_dup(proto_perl->Iin_my_stash, param);
10500 PL_cryptseen = proto_perl->Icryptseen;
10503 PL_hints = proto_perl->Ihints;
10505 PL_amagic_generation = proto_perl->Iamagic_generation;
10507 #ifdef USE_LOCALE_COLLATE
10508 PL_collation_ix = proto_perl->Icollation_ix;
10509 PL_collation_name = SAVEPV(proto_perl->Icollation_name);
10510 PL_collation_standard = proto_perl->Icollation_standard;
10511 PL_collxfrm_base = proto_perl->Icollxfrm_base;
10512 PL_collxfrm_mult = proto_perl->Icollxfrm_mult;
10513 #endif /* USE_LOCALE_COLLATE */
10515 #ifdef USE_LOCALE_NUMERIC
10516 PL_numeric_name = SAVEPV(proto_perl->Inumeric_name);
10517 PL_numeric_standard = proto_perl->Inumeric_standard;
10518 PL_numeric_local = proto_perl->Inumeric_local;
10519 PL_numeric_radix_sv = sv_dup_inc(proto_perl->Inumeric_radix_sv, param);
10520 #endif /* !USE_LOCALE_NUMERIC */
10522 /* utf8 character classes */
10523 PL_utf8_alnum = sv_dup_inc(proto_perl->Iutf8_alnum, param);
10524 PL_utf8_alnumc = sv_dup_inc(proto_perl->Iutf8_alnumc, param);
10525 PL_utf8_ascii = sv_dup_inc(proto_perl->Iutf8_ascii, param);
10526 PL_utf8_alpha = sv_dup_inc(proto_perl->Iutf8_alpha, param);
10527 PL_utf8_space = sv_dup_inc(proto_perl->Iutf8_space, param);
10528 PL_utf8_cntrl = sv_dup_inc(proto_perl->Iutf8_cntrl, param);
10529 PL_utf8_graph = sv_dup_inc(proto_perl->Iutf8_graph, param);
10530 PL_utf8_digit = sv_dup_inc(proto_perl->Iutf8_digit, param);
10531 PL_utf8_upper = sv_dup_inc(proto_perl->Iutf8_upper, param);
10532 PL_utf8_lower = sv_dup_inc(proto_perl->Iutf8_lower, param);
10533 PL_utf8_print = sv_dup_inc(proto_perl->Iutf8_print, param);
10534 PL_utf8_punct = sv_dup_inc(proto_perl->Iutf8_punct, param);
10535 PL_utf8_xdigit = sv_dup_inc(proto_perl->Iutf8_xdigit, param);
10536 PL_utf8_mark = sv_dup_inc(proto_perl->Iutf8_mark, param);
10537 PL_utf8_toupper = sv_dup_inc(proto_perl->Iutf8_toupper, param);
10538 PL_utf8_totitle = sv_dup_inc(proto_perl->Iutf8_totitle, param);
10539 PL_utf8_tolower = sv_dup_inc(proto_perl->Iutf8_tolower, param);
10540 PL_utf8_tofold = sv_dup_inc(proto_perl->Iutf8_tofold, param);
10541 PL_utf8_idstart = sv_dup_inc(proto_perl->Iutf8_idstart, param);
10542 PL_utf8_idcont = sv_dup_inc(proto_perl->Iutf8_idcont, param);
10545 PL_last_swash_hv = Nullhv; /* reinits on demand */
10546 PL_last_swash_klen = 0;
10547 PL_last_swash_key[0]= '\0';
10548 PL_last_swash_tmps = (U8*)NULL;
10549 PL_last_swash_slen = 0;
10551 /* perly.c globals */
10552 PL_yydebug = proto_perl->Iyydebug;
10553 PL_yynerrs = proto_perl->Iyynerrs;
10554 PL_yyerrflag = proto_perl->Iyyerrflag;
10555 PL_yychar = proto_perl->Iyychar;
10556 PL_yyval = proto_perl->Iyyval;
10557 PL_yylval = proto_perl->Iyylval;
10559 PL_glob_index = proto_perl->Iglob_index;
10560 PL_srand_called = proto_perl->Isrand_called;
10561 PL_uudmap['M'] = 0; /* reinits on demand */
10562 PL_bitcount = Nullch; /* reinits on demand */
10564 if (proto_perl->Ipsig_pend) {
10565 Newz(0, PL_psig_pend, SIG_SIZE, int);
10568 PL_psig_pend = (int*)NULL;
10571 if (proto_perl->Ipsig_ptr) {
10572 Newz(0, PL_psig_ptr, SIG_SIZE, SV*);
10573 Newz(0, PL_psig_name, SIG_SIZE, SV*);
10574 for (i = 1; i < SIG_SIZE; i++) {
10575 PL_psig_ptr[i] = sv_dup_inc(proto_perl->Ipsig_ptr[i], param);
10576 PL_psig_name[i] = sv_dup_inc(proto_perl->Ipsig_name[i], param);
10580 PL_psig_ptr = (SV**)NULL;
10581 PL_psig_name = (SV**)NULL;
10584 /* thrdvar.h stuff */
10586 if (flags & CLONEf_COPY_STACKS) {
10587 /* next allocation will be PL_tmps_stack[PL_tmps_ix+1] */
10588 PL_tmps_ix = proto_perl->Ttmps_ix;
10589 PL_tmps_max = proto_perl->Ttmps_max;
10590 PL_tmps_floor = proto_perl->Ttmps_floor;
10591 Newz(50, PL_tmps_stack, PL_tmps_max, SV*);
10593 while (i <= PL_tmps_ix) {
10594 PL_tmps_stack[i] = sv_dup_inc(proto_perl->Ttmps_stack[i], param);
10598 /* next PUSHMARK() sets *(PL_markstack_ptr+1) */
10599 i = proto_perl->Tmarkstack_max - proto_perl->Tmarkstack;
10600 Newz(54, PL_markstack, i, I32);
10601 PL_markstack_max = PL_markstack + (proto_perl->Tmarkstack_max
10602 - proto_perl->Tmarkstack);
10603 PL_markstack_ptr = PL_markstack + (proto_perl->Tmarkstack_ptr
10604 - proto_perl->Tmarkstack);
10605 Copy(proto_perl->Tmarkstack, PL_markstack,
10606 PL_markstack_ptr - PL_markstack + 1, I32);
10608 /* next push_scope()/ENTER sets PL_scopestack[PL_scopestack_ix]
10609 * NOTE: unlike the others! */
10610 PL_scopestack_ix = proto_perl->Tscopestack_ix;
10611 PL_scopestack_max = proto_perl->Tscopestack_max;
10612 Newz(54, PL_scopestack, PL_scopestack_max, I32);
10613 Copy(proto_perl->Tscopestack, PL_scopestack, PL_scopestack_ix, I32);
10615 /* next push_return() sets PL_retstack[PL_retstack_ix]
10616 * NOTE: unlike the others! */
10617 PL_retstack_ix = proto_perl->Tretstack_ix;
10618 PL_retstack_max = proto_perl->Tretstack_max;
10619 Newz(54, PL_retstack, PL_retstack_max, OP*);
10620 Copy(proto_perl->Tretstack, PL_retstack, PL_retstack_ix, OP*);
10622 /* NOTE: si_dup() looks at PL_markstack */
10623 PL_curstackinfo = si_dup(proto_perl->Tcurstackinfo, param);
10625 /* PL_curstack = PL_curstackinfo->si_stack; */
10626 PL_curstack = av_dup(proto_perl->Tcurstack, param);
10627 PL_mainstack = av_dup(proto_perl->Tmainstack, param);
10629 /* next PUSHs() etc. set *(PL_stack_sp+1) */
10630 PL_stack_base = AvARRAY(PL_curstack);
10631 PL_stack_sp = PL_stack_base + (proto_perl->Tstack_sp
10632 - proto_perl->Tstack_base);
10633 PL_stack_max = PL_stack_base + AvMAX(PL_curstack);
10635 /* next SSPUSHFOO() sets PL_savestack[PL_savestack_ix]
10636 * NOTE: unlike the others! */
10637 PL_savestack_ix = proto_perl->Tsavestack_ix;
10638 PL_savestack_max = proto_perl->Tsavestack_max;
10639 /*Newz(54, PL_savestack, PL_savestack_max, ANY);*/
10640 PL_savestack = ss_dup(proto_perl, param);
10644 ENTER; /* perl_destruct() wants to LEAVE; */
10647 PL_start_env = proto_perl->Tstart_env; /* XXXXXX */
10648 PL_top_env = &PL_start_env;
10650 PL_op = proto_perl->Top;
10653 PL_Xpv = (XPV*)NULL;
10654 PL_na = proto_perl->Tna;
10656 PL_statbuf = proto_perl->Tstatbuf;
10657 PL_statcache = proto_perl->Tstatcache;
10658 PL_statgv = gv_dup(proto_perl->Tstatgv, param);
10659 PL_statname = sv_dup_inc(proto_perl->Tstatname, param);
10661 PL_timesbuf = proto_perl->Ttimesbuf;
10664 PL_tainted = proto_perl->Ttainted;
10665 PL_curpm = proto_perl->Tcurpm; /* XXX No PMOP ref count */
10666 PL_rs = sv_dup_inc(proto_perl->Trs, param);
10667 PL_last_in_gv = gv_dup(proto_perl->Tlast_in_gv, param);
10668 PL_ofs_sv = sv_dup_inc(proto_perl->Tofs_sv, param);
10669 PL_defoutgv = gv_dup_inc(proto_perl->Tdefoutgv, param);
10670 PL_chopset = proto_perl->Tchopset; /* XXX never deallocated */
10671 PL_toptarget = sv_dup_inc(proto_perl->Ttoptarget, param);
10672 PL_bodytarget = sv_dup_inc(proto_perl->Tbodytarget, param);
10673 PL_formtarget = sv_dup(proto_perl->Tformtarget, param);
10675 PL_restartop = proto_perl->Trestartop;
10676 PL_in_eval = proto_perl->Tin_eval;
10677 PL_delaymagic = proto_perl->Tdelaymagic;
10678 PL_dirty = proto_perl->Tdirty;
10679 PL_localizing = proto_perl->Tlocalizing;
10681 #ifdef PERL_FLEXIBLE_EXCEPTIONS
10682 PL_protect = proto_perl->Tprotect;
10684 PL_errors = sv_dup_inc(proto_perl->Terrors, param);
10685 PL_av_fetch_sv = Nullsv;
10686 PL_hv_fetch_sv = Nullsv;
10687 Zero(&PL_hv_fetch_ent_mh, 1, HE); /* XXX */
10688 PL_modcount = proto_perl->Tmodcount;
10689 PL_lastgotoprobe = Nullop;
10690 PL_dumpindent = proto_perl->Tdumpindent;
10692 PL_sortcop = (OP*)any_dup(proto_perl->Tsortcop, proto_perl);
10693 PL_sortstash = hv_dup(proto_perl->Tsortstash, param);
10694 PL_firstgv = gv_dup(proto_perl->Tfirstgv, param);
10695 PL_secondgv = gv_dup(proto_perl->Tsecondgv, param);
10696 PL_sortcxix = proto_perl->Tsortcxix;
10697 PL_efloatbuf = Nullch; /* reinits on demand */
10698 PL_efloatsize = 0; /* reinits on demand */
10702 PL_screamfirst = NULL;
10703 PL_screamnext = NULL;
10704 PL_maxscream = -1; /* reinits on demand */
10705 PL_lastscream = Nullsv;
10707 PL_watchaddr = NULL;
10708 PL_watchok = Nullch;
10710 PL_regdummy = proto_perl->Tregdummy;
10711 PL_regcomp_parse = Nullch;
10712 PL_regxend = Nullch;
10713 PL_regcode = (regnode*)NULL;
10716 PL_regprecomp = Nullch;
10721 PL_seen_zerolen = 0;
10723 PL_regcomp_rx = (regexp*)NULL;
10725 PL_colorset = 0; /* reinits PL_colors[] */
10726 /*PL_colors[6] = {0,0,0,0,0,0};*/
10727 PL_reg_whilem_seen = 0;
10728 PL_reginput = Nullch;
10729 PL_regbol = Nullch;
10730 PL_regeol = Nullch;
10731 PL_regstartp = (I32*)NULL;
10732 PL_regendp = (I32*)NULL;
10733 PL_reglastparen = (U32*)NULL;
10734 PL_regtill = Nullch;
10735 PL_reg_start_tmp = (char**)NULL;
10736 PL_reg_start_tmpl = 0;
10737 PL_regdata = (struct reg_data*)NULL;
10740 PL_reg_eval_set = 0;
10742 PL_regprogram = (regnode*)NULL;
10744 PL_regcc = (CURCUR*)NULL;
10745 PL_reg_call_cc = (struct re_cc_state*)NULL;
10746 PL_reg_re = (regexp*)NULL;
10747 PL_reg_ganch = Nullch;
10748 PL_reg_sv = Nullsv;
10749 PL_reg_match_utf8 = FALSE;
10750 PL_reg_magic = (MAGIC*)NULL;
10752 PL_reg_oldcurpm = (PMOP*)NULL;
10753 PL_reg_curpm = (PMOP*)NULL;
10754 PL_reg_oldsaved = Nullch;
10755 PL_reg_oldsavedlen = 0;
10756 PL_reg_maxiter = 0;
10757 PL_reg_leftiter = 0;
10758 PL_reg_poscache = Nullch;
10759 PL_reg_poscache_size= 0;
10761 /* RE engine - function pointers */
10762 PL_regcompp = proto_perl->Tregcompp;
10763 PL_regexecp = proto_perl->Tregexecp;
10764 PL_regint_start = proto_perl->Tregint_start;
10765 PL_regint_string = proto_perl->Tregint_string;
10766 PL_regfree = proto_perl->Tregfree;
10768 PL_reginterp_cnt = 0;
10769 PL_reg_starttry = 0;
10771 /* Pluggable optimizer */
10772 PL_peepp = proto_perl->Tpeepp;
10774 if (!(flags & CLONEf_KEEP_PTR_TABLE)) {
10775 ptr_table_free(PL_ptr_table);
10776 PL_ptr_table = NULL;
10779 /* Call the ->CLONE method, if it exists, for each of the stashes
10780 identified by sv_dup() above.
10782 while(av_len(param->stashes) != -1) {
10783 HV* stash = (HV*) av_shift(param->stashes);
10784 GV* cloner = gv_fetchmethod_autoload(stash, "CLONE", 0);
10785 if (cloner && GvCV(cloner)) {
10790 XPUSHs(sv_2mortal(newSVpv(HvNAME(stash), 0)));
10792 call_sv((SV*)GvCV(cloner), G_DISCARD);
10798 SvREFCNT_dec(param->stashes);
10803 #endif /* USE_ITHREADS */
10806 =head1 Unicode Support
10808 =for apidoc sv_recode_to_utf8
10810 The encoding is assumed to be an Encode object, on entry the PV
10811 of the sv is assumed to be octets in that encoding, and the sv
10812 will be converted into Unicode (and UTF-8).
10814 If the sv already is UTF-8 (or if it is not POK), or if the encoding
10815 is not a reference, nothing is done to the sv. If the encoding is not
10816 an C<Encode::XS> Encoding object, bad things will happen.
10817 (See F<lib/encoding.pm> and L<Encode>).
10819 The PV of the sv is returned.
10824 Perl_sv_recode_to_utf8(pTHX_ SV *sv, SV *encoding)
10826 if (SvPOK(sv) && !DO_UTF8(sv) && SvROK(encoding)) {
10839 Passing sv_yes is wrong - it needs to be or'ed set of constants
10840 for Encode::XS, while UTf-8 decode (currently) assumes a true value means
10841 remove converted chars from source.
10843 Both will default the value - let them.
10845 XPUSHs(&PL_sv_yes);
10848 call_method("decode", G_SCALAR);
10852 s = SvPV(uni, len);
10853 if (s != SvPVX(sv)) {
10854 SvGROW(sv, len + 1);
10855 Move(s, SvPVX(sv), len, char);
10856 SvCUR_set(sv, len);
10857 SvPVX(sv)[len] = 0;