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 pessimistic 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 */
167 #ifdef DEBUG_LEAKING_SCALARS
168 /* provide a real function for a debugger to play with */
185 # define new_SV(p) (p)=S_new_SV(aTHX)
203 /* del_SV(): return an empty SV head to the free list */
218 S_del_sv(pTHX_ SV *p)
225 for (sva = PL_sv_arenaroot; sva; sva = (SV *) SvANY(sva)) {
227 svend = &sva[SvREFCNT(sva)];
228 if (p >= sv && p < svend)
232 if (ckWARN_d(WARN_INTERNAL))
233 Perl_warner(aTHX_ packWARN(WARN_INTERNAL),
234 "Attempt to free non-arena SV: 0x%"UVxf,
242 #else /* ! DEBUGGING */
244 #define del_SV(p) plant_SV(p)
246 #endif /* DEBUGGING */
250 =head1 SV Manipulation Functions
252 =for apidoc sv_add_arena
254 Given a chunk of memory, link it to the head of the list of arenas,
255 and split it into a list of free SVs.
261 Perl_sv_add_arena(pTHX_ char *ptr, U32 size, U32 flags)
266 Zero(ptr, size, char);
268 /* The first SV in an arena isn't an SV. */
269 SvANY(sva) = (void *) PL_sv_arenaroot; /* ptr to next arena */
270 SvREFCNT(sva) = size / sizeof(SV); /* number of SV slots */
271 SvFLAGS(sva) = flags; /* FAKE if not to be freed */
273 PL_sv_arenaroot = sva;
274 PL_sv_root = sva + 1;
276 svend = &sva[SvREFCNT(sva) - 1];
279 SvANY(sv) = (void *)(SV*)(sv + 1);
280 SvFLAGS(sv) = SVTYPEMASK;
284 SvFLAGS(sv) = SVTYPEMASK;
287 /* make some more SVs by adding another arena */
289 /* sv_mutex must be held while calling more_sv() */
296 sv_add_arena(PL_nice_chunk, PL_nice_chunk_size, 0);
297 PL_nice_chunk = Nullch;
298 PL_nice_chunk_size = 0;
301 char *chunk; /* must use New here to match call to */
302 New(704,chunk,1008,char); /* Safefree() in sv_free_arenas() */
303 sv_add_arena(chunk, 1008, 0);
309 /* visit(): call the named function for each non-free SV in the arenas. */
312 S_visit(pTHX_ SVFUNC_t f)
319 for (sva = PL_sv_arenaroot; sva; sva = (SV*)SvANY(sva)) {
320 svend = &sva[SvREFCNT(sva)];
321 for (sv = sva + 1; sv < svend; ++sv) {
322 if (SvTYPE(sv) != SVTYPEMASK && SvREFCNT(sv)) {
333 /* called by sv_report_used() for each live SV */
336 do_report_used(pTHX_ SV *sv)
338 if (SvTYPE(sv) != SVTYPEMASK) {
339 PerlIO_printf(Perl_debug_log, "****\n");
346 =for apidoc sv_report_used
348 Dump the contents of all SVs not yet freed. (Debugging aid).
354 Perl_sv_report_used(pTHX)
357 visit(do_report_used);
361 /* called by sv_clean_objs() for each live SV */
364 do_clean_objs(pTHX_ SV *sv)
368 if (SvROK(sv) && SvOBJECT(rv = SvRV(sv))) {
369 DEBUG_D((PerlIO_printf(Perl_debug_log, "Cleaning object ref:\n "), sv_dump(sv)));
381 /* XXX Might want to check arrays, etc. */
384 /* called by sv_clean_objs() for each live SV */
386 #ifndef DISABLE_DESTRUCTOR_KLUDGE
388 do_clean_named_objs(pTHX_ SV *sv)
390 if (SvTYPE(sv) == SVt_PVGV && GvGP(sv)) {
391 if ( SvOBJECT(GvSV(sv)) ||
392 (GvAV(sv) && SvOBJECT(GvAV(sv))) ||
393 (GvHV(sv) && SvOBJECT(GvHV(sv))) ||
394 (GvIO(sv) && SvOBJECT(GvIO(sv))) ||
395 (GvCV(sv) && SvOBJECT(GvCV(sv))) )
397 DEBUG_D((PerlIO_printf(Perl_debug_log, "Cleaning named glob object:\n "), sv_dump(sv)));
405 =for apidoc sv_clean_objs
407 Attempt to destroy all objects not yet freed
413 Perl_sv_clean_objs(pTHX)
415 PL_in_clean_objs = TRUE;
416 visit(do_clean_objs);
417 #ifndef DISABLE_DESTRUCTOR_KLUDGE
418 /* some barnacles may yet remain, clinging to typeglobs */
419 visit(do_clean_named_objs);
421 PL_in_clean_objs = FALSE;
424 /* called by sv_clean_all() for each live SV */
427 do_clean_all(pTHX_ SV *sv)
429 DEBUG_D((PerlIO_printf(Perl_debug_log, "Cleaning loops: SV at 0x%"UVxf"\n", PTR2UV(sv)) ));
430 SvFLAGS(sv) |= SVf_BREAK;
435 =for apidoc sv_clean_all
437 Decrement the refcnt of each remaining SV, possibly triggering a
438 cleanup. This function may have to be called multiple times to free
439 SVs which are in complex self-referential hierarchies.
445 Perl_sv_clean_all(pTHX)
448 PL_in_clean_all = TRUE;
449 cleaned = visit(do_clean_all);
450 PL_in_clean_all = FALSE;
455 =for apidoc sv_free_arenas
457 Deallocate the memory used by all arenas. Note that all the individual SV
458 heads and bodies within the arenas must already have been freed.
464 Perl_sv_free_arenas(pTHX)
468 XPV *arena, *arenanext;
470 /* Free arenas here, but be careful about fake ones. (We assume
471 contiguity of the fake ones with the corresponding real ones.) */
473 for (sva = PL_sv_arenaroot; sva; sva = svanext) {
474 svanext = (SV*) SvANY(sva);
475 while (svanext && SvFAKE(svanext))
476 svanext = (SV*) SvANY(svanext);
479 Safefree((void *)sva);
482 for (arena = PL_xiv_arenaroot; arena; arena = arenanext) {
483 arenanext = (XPV*)arena->xpv_pv;
486 PL_xiv_arenaroot = 0;
488 for (arena = PL_xnv_arenaroot; arena; arena = arenanext) {
489 arenanext = (XPV*)arena->xpv_pv;
492 PL_xnv_arenaroot = 0;
494 for (arena = PL_xrv_arenaroot; arena; arena = arenanext) {
495 arenanext = (XPV*)arena->xpv_pv;
498 PL_xrv_arenaroot = 0;
500 for (arena = PL_xpv_arenaroot; arena; arena = arenanext) {
501 arenanext = (XPV*)arena->xpv_pv;
504 PL_xpv_arenaroot = 0;
506 for (arena = (XPV*)PL_xpviv_arenaroot; arena; arena = arenanext) {
507 arenanext = (XPV*)arena->xpv_pv;
510 PL_xpviv_arenaroot = 0;
512 for (arena = (XPV*)PL_xpvnv_arenaroot; arena; arena = arenanext) {
513 arenanext = (XPV*)arena->xpv_pv;
516 PL_xpvnv_arenaroot = 0;
518 for (arena = (XPV*)PL_xpvcv_arenaroot; arena; arena = arenanext) {
519 arenanext = (XPV*)arena->xpv_pv;
522 PL_xpvcv_arenaroot = 0;
524 for (arena = (XPV*)PL_xpvav_arenaroot; arena; arena = arenanext) {
525 arenanext = (XPV*)arena->xpv_pv;
528 PL_xpvav_arenaroot = 0;
530 for (arena = (XPV*)PL_xpvhv_arenaroot; arena; arena = arenanext) {
531 arenanext = (XPV*)arena->xpv_pv;
534 PL_xpvhv_arenaroot = 0;
536 for (arena = (XPV*)PL_xpvmg_arenaroot; arena; arena = arenanext) {
537 arenanext = (XPV*)arena->xpv_pv;
540 PL_xpvmg_arenaroot = 0;
542 for (arena = (XPV*)PL_xpvlv_arenaroot; arena; arena = arenanext) {
543 arenanext = (XPV*)arena->xpv_pv;
546 PL_xpvlv_arenaroot = 0;
548 for (arena = (XPV*)PL_xpvbm_arenaroot; arena; arena = arenanext) {
549 arenanext = (XPV*)arena->xpv_pv;
552 PL_xpvbm_arenaroot = 0;
554 for (arena = (XPV*)PL_he_arenaroot; arena; arena = arenanext) {
555 arenanext = (XPV*)arena->xpv_pv;
561 Safefree(PL_nice_chunk);
562 PL_nice_chunk = Nullch;
563 PL_nice_chunk_size = 0;
569 =for apidoc report_uninit
571 Print appropriate "Use of uninitialized variable" warning
577 Perl_report_uninit(pTHX)
580 Perl_warner(aTHX_ packWARN(WARN_UNINITIALIZED), PL_warn_uninit,
581 " in ", OP_DESC(PL_op));
583 Perl_warner(aTHX_ packWARN(WARN_UNINITIALIZED), PL_warn_uninit, "", "");
586 /* grab a new IV body from the free list, allocating more if necessary */
597 * See comment in more_xiv() -- RAM.
599 PL_xiv_root = *(IV**)xiv;
601 return (XPVIV*)((char*)xiv - STRUCT_OFFSET(XPVIV, xiv_iv));
604 /* return an IV body to the free list */
607 S_del_xiv(pTHX_ XPVIV *p)
609 IV* xiv = (IV*)((char*)(p) + STRUCT_OFFSET(XPVIV, xiv_iv));
611 *(IV**)xiv = PL_xiv_root;
616 /* allocate another arena's worth of IV bodies */
624 New(705, ptr, 1008/sizeof(XPV), XPV);
625 ptr->xpv_pv = (char*)PL_xiv_arenaroot; /* linked list of xiv arenas */
626 PL_xiv_arenaroot = ptr; /* to keep Purify happy */
629 xivend = &xiv[1008 / sizeof(IV) - 1];
630 xiv += (sizeof(XPV) - 1) / sizeof(IV) + 1; /* fudge by size of XPV */
632 while (xiv < xivend) {
633 *(IV**)xiv = (IV *)(xiv + 1);
639 /* grab a new NV body from the free list, allocating more if necessary */
649 PL_xnv_root = *(NV**)xnv;
651 return (XPVNV*)((char*)xnv - STRUCT_OFFSET(XPVNV, xnv_nv));
654 /* return an NV body to the free list */
657 S_del_xnv(pTHX_ XPVNV *p)
659 NV* xnv = (NV*)((char*)(p) + STRUCT_OFFSET(XPVNV, xnv_nv));
661 *(NV**)xnv = PL_xnv_root;
666 /* allocate another arena's worth of NV bodies */
674 New(711, ptr, 1008/sizeof(XPV), XPV);
675 ptr->xpv_pv = (char*)PL_xnv_arenaroot;
676 PL_xnv_arenaroot = ptr;
679 xnvend = &xnv[1008 / sizeof(NV) - 1];
680 xnv += (sizeof(XPVIV) - 1) / sizeof(NV) + 1; /* fudge by sizeof XPVIV */
682 while (xnv < xnvend) {
683 *(NV**)xnv = (NV*)(xnv + 1);
689 /* grab a new struct xrv from the free list, allocating more if necessary */
699 PL_xrv_root = (XRV*)xrv->xrv_rv;
704 /* return a struct xrv to the free list */
707 S_del_xrv(pTHX_ XRV *p)
710 p->xrv_rv = (SV*)PL_xrv_root;
715 /* allocate another arena's worth of struct xrv */
721 register XRV* xrvend;
723 New(712, ptr, 1008/sizeof(XPV), XPV);
724 ptr->xpv_pv = (char*)PL_xrv_arenaroot;
725 PL_xrv_arenaroot = ptr;
728 xrvend = &xrv[1008 / sizeof(XRV) - 1];
729 xrv += (sizeof(XPV) - 1) / sizeof(XRV) + 1;
731 while (xrv < xrvend) {
732 xrv->xrv_rv = (SV*)(xrv + 1);
738 /* grab a new struct xpv from the free list, allocating more if necessary */
748 PL_xpv_root = (XPV*)xpv->xpv_pv;
753 /* return a struct xpv to the free list */
756 S_del_xpv(pTHX_ XPV *p)
759 p->xpv_pv = (char*)PL_xpv_root;
764 /* allocate another arena's worth of struct xpv */
770 register XPV* xpvend;
771 New(713, xpv, 1008/sizeof(XPV), XPV);
772 xpv->xpv_pv = (char*)PL_xpv_arenaroot;
773 PL_xpv_arenaroot = xpv;
775 xpvend = &xpv[1008 / sizeof(XPV) - 1];
777 while (xpv < xpvend) {
778 xpv->xpv_pv = (char*)(xpv + 1);
784 /* grab a new struct xpviv from the free list, allocating more if necessary */
793 xpviv = PL_xpviv_root;
794 PL_xpviv_root = (XPVIV*)xpviv->xpv_pv;
799 /* return a struct xpviv to the free list */
802 S_del_xpviv(pTHX_ XPVIV *p)
805 p->xpv_pv = (char*)PL_xpviv_root;
810 /* allocate another arena's worth of struct xpviv */
815 register XPVIV* xpviv;
816 register XPVIV* xpvivend;
817 New(714, xpviv, 1008/sizeof(XPVIV), XPVIV);
818 xpviv->xpv_pv = (char*)PL_xpviv_arenaroot;
819 PL_xpviv_arenaroot = xpviv;
821 xpvivend = &xpviv[1008 / sizeof(XPVIV) - 1];
822 PL_xpviv_root = ++xpviv;
823 while (xpviv < xpvivend) {
824 xpviv->xpv_pv = (char*)(xpviv + 1);
830 /* grab a new struct xpvnv from the free list, allocating more if necessary */
839 xpvnv = PL_xpvnv_root;
840 PL_xpvnv_root = (XPVNV*)xpvnv->xpv_pv;
845 /* return a struct xpvnv to the free list */
848 S_del_xpvnv(pTHX_ XPVNV *p)
851 p->xpv_pv = (char*)PL_xpvnv_root;
856 /* allocate another arena's worth of struct xpvnv */
861 register XPVNV* xpvnv;
862 register XPVNV* xpvnvend;
863 New(715, xpvnv, 1008/sizeof(XPVNV), XPVNV);
864 xpvnv->xpv_pv = (char*)PL_xpvnv_arenaroot;
865 PL_xpvnv_arenaroot = xpvnv;
867 xpvnvend = &xpvnv[1008 / sizeof(XPVNV) - 1];
868 PL_xpvnv_root = ++xpvnv;
869 while (xpvnv < xpvnvend) {
870 xpvnv->xpv_pv = (char*)(xpvnv + 1);
876 /* grab a new struct xpvcv from the free list, allocating more if necessary */
885 xpvcv = PL_xpvcv_root;
886 PL_xpvcv_root = (XPVCV*)xpvcv->xpv_pv;
891 /* return a struct xpvcv to the free list */
894 S_del_xpvcv(pTHX_ XPVCV *p)
897 p->xpv_pv = (char*)PL_xpvcv_root;
902 /* allocate another arena's worth of struct xpvcv */
907 register XPVCV* xpvcv;
908 register XPVCV* xpvcvend;
909 New(716, xpvcv, 1008/sizeof(XPVCV), XPVCV);
910 xpvcv->xpv_pv = (char*)PL_xpvcv_arenaroot;
911 PL_xpvcv_arenaroot = xpvcv;
913 xpvcvend = &xpvcv[1008 / sizeof(XPVCV) - 1];
914 PL_xpvcv_root = ++xpvcv;
915 while (xpvcv < xpvcvend) {
916 xpvcv->xpv_pv = (char*)(xpvcv + 1);
922 /* grab a new struct xpvav from the free list, allocating more if necessary */
931 xpvav = PL_xpvav_root;
932 PL_xpvav_root = (XPVAV*)xpvav->xav_array;
937 /* return a struct xpvav to the free list */
940 S_del_xpvav(pTHX_ XPVAV *p)
943 p->xav_array = (char*)PL_xpvav_root;
948 /* allocate another arena's worth of struct xpvav */
953 register XPVAV* xpvav;
954 register XPVAV* xpvavend;
955 New(717, xpvav, 1008/sizeof(XPVAV), XPVAV);
956 xpvav->xav_array = (char*)PL_xpvav_arenaroot;
957 PL_xpvav_arenaroot = xpvav;
959 xpvavend = &xpvav[1008 / sizeof(XPVAV) - 1];
960 PL_xpvav_root = ++xpvav;
961 while (xpvav < xpvavend) {
962 xpvav->xav_array = (char*)(xpvav + 1);
965 xpvav->xav_array = 0;
968 /* grab a new struct xpvhv from the free list, allocating more if necessary */
977 xpvhv = PL_xpvhv_root;
978 PL_xpvhv_root = (XPVHV*)xpvhv->xhv_array;
983 /* return a struct xpvhv to the free list */
986 S_del_xpvhv(pTHX_ XPVHV *p)
989 p->xhv_array = (char*)PL_xpvhv_root;
994 /* allocate another arena's worth of struct xpvhv */
999 register XPVHV* xpvhv;
1000 register XPVHV* xpvhvend;
1001 New(718, xpvhv, 1008/sizeof(XPVHV), XPVHV);
1002 xpvhv->xhv_array = (char*)PL_xpvhv_arenaroot;
1003 PL_xpvhv_arenaroot = xpvhv;
1005 xpvhvend = &xpvhv[1008 / sizeof(XPVHV) - 1];
1006 PL_xpvhv_root = ++xpvhv;
1007 while (xpvhv < xpvhvend) {
1008 xpvhv->xhv_array = (char*)(xpvhv + 1);
1011 xpvhv->xhv_array = 0;
1014 /* grab a new struct xpvmg from the free list, allocating more if necessary */
1023 xpvmg = PL_xpvmg_root;
1024 PL_xpvmg_root = (XPVMG*)xpvmg->xpv_pv;
1029 /* return a struct xpvmg to the free list */
1032 S_del_xpvmg(pTHX_ XPVMG *p)
1035 p->xpv_pv = (char*)PL_xpvmg_root;
1040 /* allocate another arena's worth of struct xpvmg */
1045 register XPVMG* xpvmg;
1046 register XPVMG* xpvmgend;
1047 New(719, xpvmg, 1008/sizeof(XPVMG), XPVMG);
1048 xpvmg->xpv_pv = (char*)PL_xpvmg_arenaroot;
1049 PL_xpvmg_arenaroot = xpvmg;
1051 xpvmgend = &xpvmg[1008 / sizeof(XPVMG) - 1];
1052 PL_xpvmg_root = ++xpvmg;
1053 while (xpvmg < xpvmgend) {
1054 xpvmg->xpv_pv = (char*)(xpvmg + 1);
1060 /* grab a new struct xpvlv from the free list, allocating more if necessary */
1069 xpvlv = PL_xpvlv_root;
1070 PL_xpvlv_root = (XPVLV*)xpvlv->xpv_pv;
1075 /* return a struct xpvlv to the free list */
1078 S_del_xpvlv(pTHX_ XPVLV *p)
1081 p->xpv_pv = (char*)PL_xpvlv_root;
1086 /* allocate another arena's worth of struct xpvlv */
1091 register XPVLV* xpvlv;
1092 register XPVLV* xpvlvend;
1093 New(720, xpvlv, 1008/sizeof(XPVLV), XPVLV);
1094 xpvlv->xpv_pv = (char*)PL_xpvlv_arenaroot;
1095 PL_xpvlv_arenaroot = xpvlv;
1097 xpvlvend = &xpvlv[1008 / sizeof(XPVLV) - 1];
1098 PL_xpvlv_root = ++xpvlv;
1099 while (xpvlv < xpvlvend) {
1100 xpvlv->xpv_pv = (char*)(xpvlv + 1);
1106 /* grab a new struct xpvbm from the free list, allocating more if necessary */
1115 xpvbm = PL_xpvbm_root;
1116 PL_xpvbm_root = (XPVBM*)xpvbm->xpv_pv;
1121 /* return a struct xpvbm to the free list */
1124 S_del_xpvbm(pTHX_ XPVBM *p)
1127 p->xpv_pv = (char*)PL_xpvbm_root;
1132 /* allocate another arena's worth of struct xpvbm */
1137 register XPVBM* xpvbm;
1138 register XPVBM* xpvbmend;
1139 New(721, xpvbm, 1008/sizeof(XPVBM), XPVBM);
1140 xpvbm->xpv_pv = (char*)PL_xpvbm_arenaroot;
1141 PL_xpvbm_arenaroot = xpvbm;
1143 xpvbmend = &xpvbm[1008 / sizeof(XPVBM) - 1];
1144 PL_xpvbm_root = ++xpvbm;
1145 while (xpvbm < xpvbmend) {
1146 xpvbm->xpv_pv = (char*)(xpvbm + 1);
1152 #define my_safemalloc(s) (void*)safemalloc(s)
1153 #define my_safefree(p) safefree((char*)p)
1157 #define new_XIV() my_safemalloc(sizeof(XPVIV))
1158 #define del_XIV(p) my_safefree(p)
1160 #define new_XNV() my_safemalloc(sizeof(XPVNV))
1161 #define del_XNV(p) my_safefree(p)
1163 #define new_XRV() my_safemalloc(sizeof(XRV))
1164 #define del_XRV(p) my_safefree(p)
1166 #define new_XPV() my_safemalloc(sizeof(XPV))
1167 #define del_XPV(p) my_safefree(p)
1169 #define new_XPVIV() my_safemalloc(sizeof(XPVIV))
1170 #define del_XPVIV(p) my_safefree(p)
1172 #define new_XPVNV() my_safemalloc(sizeof(XPVNV))
1173 #define del_XPVNV(p) my_safefree(p)
1175 #define new_XPVCV() my_safemalloc(sizeof(XPVCV))
1176 #define del_XPVCV(p) my_safefree(p)
1178 #define new_XPVAV() my_safemalloc(sizeof(XPVAV))
1179 #define del_XPVAV(p) my_safefree(p)
1181 #define new_XPVHV() my_safemalloc(sizeof(XPVHV))
1182 #define del_XPVHV(p) my_safefree(p)
1184 #define new_XPVMG() my_safemalloc(sizeof(XPVMG))
1185 #define del_XPVMG(p) my_safefree(p)
1187 #define new_XPVLV() my_safemalloc(sizeof(XPVLV))
1188 #define del_XPVLV(p) my_safefree(p)
1190 #define new_XPVBM() my_safemalloc(sizeof(XPVBM))
1191 #define del_XPVBM(p) my_safefree(p)
1195 #define new_XIV() (void*)new_xiv()
1196 #define del_XIV(p) del_xiv((XPVIV*) p)
1198 #define new_XNV() (void*)new_xnv()
1199 #define del_XNV(p) del_xnv((XPVNV*) p)
1201 #define new_XRV() (void*)new_xrv()
1202 #define del_XRV(p) del_xrv((XRV*) p)
1204 #define new_XPV() (void*)new_xpv()
1205 #define del_XPV(p) del_xpv((XPV *)p)
1207 #define new_XPVIV() (void*)new_xpviv()
1208 #define del_XPVIV(p) del_xpviv((XPVIV *)p)
1210 #define new_XPVNV() (void*)new_xpvnv()
1211 #define del_XPVNV(p) del_xpvnv((XPVNV *)p)
1213 #define new_XPVCV() (void*)new_xpvcv()
1214 #define del_XPVCV(p) del_xpvcv((XPVCV *)p)
1216 #define new_XPVAV() (void*)new_xpvav()
1217 #define del_XPVAV(p) del_xpvav((XPVAV *)p)
1219 #define new_XPVHV() (void*)new_xpvhv()
1220 #define del_XPVHV(p) del_xpvhv((XPVHV *)p)
1222 #define new_XPVMG() (void*)new_xpvmg()
1223 #define del_XPVMG(p) del_xpvmg((XPVMG *)p)
1225 #define new_XPVLV() (void*)new_xpvlv()
1226 #define del_XPVLV(p) del_xpvlv((XPVLV *)p)
1228 #define new_XPVBM() (void*)new_xpvbm()
1229 #define del_XPVBM(p) del_xpvbm((XPVBM *)p)
1233 #define new_XPVGV() my_safemalloc(sizeof(XPVGV))
1234 #define del_XPVGV(p) my_safefree(p)
1236 #define new_XPVFM() my_safemalloc(sizeof(XPVFM))
1237 #define del_XPVFM(p) my_safefree(p)
1239 #define new_XPVIO() my_safemalloc(sizeof(XPVIO))
1240 #define del_XPVIO(p) my_safefree(p)
1243 =for apidoc sv_upgrade
1245 Upgrade an SV to a more complex form. Generally adds a new body type to the
1246 SV, then copies across as much information as possible from the old body.
1247 You generally want to use the C<SvUPGRADE> macro wrapper. See also C<svtype>.
1253 Perl_sv_upgrade(pTHX_ register SV *sv, U32 mt)
1260 MAGIC* magic = NULL;
1263 if (mt != SVt_PV && SvIsCOW(sv)) {
1264 sv_force_normal_flags(sv, 0);
1267 if (SvTYPE(sv) == mt)
1271 (void)SvOOK_off(sv);
1273 switch (SvTYPE(sv)) {
1294 else if (mt < SVt_PVIV)
1311 pv = (char*)SvRV(sv);
1331 else if (mt == SVt_NV)
1342 del_XPVIV(SvANY(sv));
1352 del_XPVNV(SvANY(sv));
1360 magic = SvMAGIC(sv);
1361 stash = SvSTASH(sv);
1362 del_XPVMG(SvANY(sv));
1365 Perl_croak(aTHX_ "Can't upgrade that kind of scalar");
1370 Perl_croak(aTHX_ "Can't upgrade to undef");
1372 SvANY(sv) = new_XIV();
1376 SvANY(sv) = new_XNV();
1380 SvANY(sv) = new_XRV();
1384 SvANY(sv) = new_XPV();
1390 SvANY(sv) = new_XPVIV();
1400 SvANY(sv) = new_XPVNV();
1408 SvANY(sv) = new_XPVMG();
1414 SvMAGIC(sv) = magic;
1415 SvSTASH(sv) = stash;
1418 SvANY(sv) = new_XPVLV();
1424 SvMAGIC(sv) = magic;
1425 SvSTASH(sv) = stash;
1432 SvANY(sv) = new_XPVAV();
1440 SvMAGIC(sv) = magic;
1441 SvSTASH(sv) = stash;
1447 SvANY(sv) = new_XPVHV();
1453 HvTOTALKEYS(sv) = 0;
1454 HvPLACEHOLDERS(sv) = 0;
1455 SvMAGIC(sv) = magic;
1456 SvSTASH(sv) = stash;
1463 SvANY(sv) = new_XPVCV();
1464 Zero(SvANY(sv), 1, XPVCV);
1470 SvMAGIC(sv) = magic;
1471 SvSTASH(sv) = stash;
1474 SvANY(sv) = new_XPVGV();
1480 SvMAGIC(sv) = magic;
1481 SvSTASH(sv) = stash;
1489 SvANY(sv) = new_XPVBM();
1495 SvMAGIC(sv) = magic;
1496 SvSTASH(sv) = stash;
1502 SvANY(sv) = new_XPVFM();
1503 Zero(SvANY(sv), 1, XPVFM);
1509 SvMAGIC(sv) = magic;
1510 SvSTASH(sv) = stash;
1513 SvANY(sv) = new_XPVIO();
1514 Zero(SvANY(sv), 1, XPVIO);
1520 SvMAGIC(sv) = magic;
1521 SvSTASH(sv) = stash;
1522 IoPAGE_LEN(sv) = 60;
1525 SvFLAGS(sv) &= ~SVTYPEMASK;
1531 =for apidoc sv_backoff
1533 Remove any string offset. You should normally use the C<SvOOK_off> macro
1540 Perl_sv_backoff(pTHX_ register SV *sv)
1544 char *s = SvPVX(sv);
1545 SvLEN(sv) += SvIVX(sv);
1546 SvPVX(sv) -= SvIVX(sv);
1548 Move(s, SvPVX(sv), SvCUR(sv)+1, char);
1550 SvFLAGS(sv) &= ~SVf_OOK;
1557 Expands the character buffer in the SV. If necessary, uses C<sv_unref> and
1558 upgrades the SV to C<SVt_PV>. Returns a pointer to the character buffer.
1559 Use the C<SvGROW> wrapper instead.
1565 Perl_sv_grow(pTHX_ register SV *sv, register STRLEN newlen)
1571 #ifdef HAS_64K_LIMIT
1572 if (newlen >= 0x10000) {
1573 PerlIO_printf(Perl_debug_log,
1574 "Allocation too large: %"UVxf"\n", (UV)newlen);
1577 #endif /* HAS_64K_LIMIT */
1580 if (SvTYPE(sv) < SVt_PV) {
1581 sv_upgrade(sv, SVt_PV);
1584 else if (SvOOK(sv)) { /* pv is offset? */
1587 if (newlen > SvLEN(sv))
1588 newlen += 10 * (newlen - SvCUR(sv)); /* avoid copy each time */
1589 #ifdef HAS_64K_LIMIT
1590 if (newlen >= 0x10000)
1597 if (newlen > SvLEN(sv)) { /* need more room? */
1598 if (SvLEN(sv) && s) {
1600 STRLEN l = malloced_size((void*)SvPVX(sv));
1606 Renew(s,newlen,char);
1609 New(703, s, newlen, char);
1610 if (SvPVX(sv) && SvCUR(sv)) {
1611 Move(SvPVX(sv), s, (newlen < SvCUR(sv)) ? newlen : SvCUR(sv), char);
1615 SvLEN_set(sv, newlen);
1621 =for apidoc sv_setiv
1623 Copies an integer into the given SV, upgrading first if necessary.
1624 Does not handle 'set' magic. See also C<sv_setiv_mg>.
1630 Perl_sv_setiv(pTHX_ register SV *sv, IV i)
1632 SV_CHECK_THINKFIRST_COW_DROP(sv);
1633 switch (SvTYPE(sv)) {
1635 sv_upgrade(sv, SVt_IV);
1638 sv_upgrade(sv, SVt_PVNV);
1642 sv_upgrade(sv, SVt_PVIV);
1651 Perl_croak(aTHX_ "Can't coerce %s to integer in %s", sv_reftype(sv,0),
1654 (void)SvIOK_only(sv); /* validate number */
1660 =for apidoc sv_setiv_mg
1662 Like C<sv_setiv>, but also handles 'set' magic.
1668 Perl_sv_setiv_mg(pTHX_ register SV *sv, IV i)
1675 =for apidoc sv_setuv
1677 Copies an unsigned integer into the given SV, upgrading first if necessary.
1678 Does not handle 'set' magic. See also C<sv_setuv_mg>.
1684 Perl_sv_setuv(pTHX_ register SV *sv, UV u)
1686 /* With these two if statements:
1687 u=1.49 s=0.52 cu=72.49 cs=10.64 scripts=270 tests=20865
1690 u=1.35 s=0.47 cu=73.45 cs=11.43 scripts=270 tests=20865
1692 If you wish to remove them, please benchmark to see what the effect is
1694 if (u <= (UV)IV_MAX) {
1695 sv_setiv(sv, (IV)u);
1704 =for apidoc sv_setuv_mg
1706 Like C<sv_setuv>, but also handles 'set' magic.
1712 Perl_sv_setuv_mg(pTHX_ register SV *sv, UV u)
1714 /* With these two if statements:
1715 u=1.49 s=0.52 cu=72.49 cs=10.64 scripts=270 tests=20865
1718 u=1.35 s=0.47 cu=73.45 cs=11.43 scripts=270 tests=20865
1720 If you wish to remove them, please benchmark to see what the effect is
1722 if (u <= (UV)IV_MAX) {
1723 sv_setiv(sv, (IV)u);
1733 =for apidoc sv_setnv
1735 Copies a double into the given SV, upgrading first if necessary.
1736 Does not handle 'set' magic. See also C<sv_setnv_mg>.
1742 Perl_sv_setnv(pTHX_ register SV *sv, NV num)
1744 SV_CHECK_THINKFIRST_COW_DROP(sv);
1745 switch (SvTYPE(sv)) {
1748 sv_upgrade(sv, SVt_NV);
1753 sv_upgrade(sv, SVt_PVNV);
1762 Perl_croak(aTHX_ "Can't coerce %s to number in %s", sv_reftype(sv,0),
1766 (void)SvNOK_only(sv); /* validate number */
1771 =for apidoc sv_setnv_mg
1773 Like C<sv_setnv>, but also handles 'set' magic.
1779 Perl_sv_setnv_mg(pTHX_ register SV *sv, NV num)
1785 /* Print an "isn't numeric" warning, using a cleaned-up,
1786 * printable version of the offending string
1790 S_not_a_number(pTHX_ SV *sv)
1797 dsv = sv_2mortal(newSVpv("", 0));
1798 pv = sv_uni_display(dsv, sv, 10, 0);
1801 char *limit = tmpbuf + sizeof(tmpbuf) - 8;
1802 /* each *s can expand to 4 chars + "...\0",
1803 i.e. need room for 8 chars */
1806 for (s = SvPVX(sv), end = s + SvCUR(sv); s < end && d < limit; s++) {
1808 if (ch & 128 && !isPRINT_LC(ch)) {
1817 else if (ch == '\r') {
1821 else if (ch == '\f') {
1825 else if (ch == '\\') {
1829 else if (ch == '\0') {
1833 else if (isPRINT_LC(ch))
1850 Perl_warner(aTHX_ packWARN(WARN_NUMERIC),
1851 "Argument \"%s\" isn't numeric in %s", pv,
1854 Perl_warner(aTHX_ packWARN(WARN_NUMERIC),
1855 "Argument \"%s\" isn't numeric", pv);
1859 =for apidoc looks_like_number
1861 Test if the content of an SV looks like a number (or is a number).
1862 C<Inf> and C<Infinity> are treated as numbers (so will not issue a
1863 non-numeric warning), even if your atof() doesn't grok them.
1869 Perl_looks_like_number(pTHX_ SV *sv)
1871 register char *sbegin;
1878 else if (SvPOKp(sv))
1879 sbegin = SvPV(sv, len);
1881 return 1; /* Historic. Wrong? */
1882 return grok_number(sbegin, len, NULL);
1885 /* Actually, ISO C leaves conversion of UV to IV undefined, but
1886 until proven guilty, assume that things are not that bad... */
1891 As 64 bit platforms often have an NV that doesn't preserve all bits of
1892 an IV (an assumption perl has been based on to date) it becomes necessary
1893 to remove the assumption that the NV always carries enough precision to
1894 recreate the IV whenever needed, and that the NV is the canonical form.
1895 Instead, IV/UV and NV need to be given equal rights. So as to not lose
1896 precision as a side effect of conversion (which would lead to insanity
1897 and the dragon(s) in t/op/numconvert.t getting very angry) the intent is
1898 1) to distinguish between IV/UV/NV slots that have cached a valid
1899 conversion where precision was lost and IV/UV/NV slots that have a
1900 valid conversion which has lost no precision
1901 2) to ensure that if a numeric conversion to one form is requested that
1902 would lose precision, the precise conversion (or differently
1903 imprecise conversion) is also performed and cached, to prevent
1904 requests for different numeric formats on the same SV causing
1905 lossy conversion chains. (lossless conversion chains are perfectly
1910 SvIOKp is true if the IV slot contains a valid value
1911 SvIOK is true only if the IV value is accurate (UV if SvIOK_UV true)
1912 SvNOKp is true if the NV slot contains a valid value
1913 SvNOK is true only if the NV value is accurate
1916 while converting from PV to NV, check to see if converting that NV to an
1917 IV(or UV) would lose accuracy over a direct conversion from PV to
1918 IV(or UV). If it would, cache both conversions, return NV, but mark
1919 SV as IOK NOKp (ie not NOK).
1921 While converting from PV to IV, check to see if converting that IV to an
1922 NV would lose accuracy over a direct conversion from PV to NV. If it
1923 would, cache both conversions, flag similarly.
1925 Before, the SV value "3.2" could become NV=3.2 IV=3 NOK, IOK quite
1926 correctly because if IV & NV were set NV *always* overruled.
1927 Now, "3.2" will become NV=3.2 IV=3 NOK, IOKp, because the flag's meaning
1928 changes - now IV and NV together means that the two are interchangeable:
1929 SvIVX == (IV) SvNVX && SvNVX == (NV) SvIVX;
1931 The benefit of this is that operations such as pp_add know that if
1932 SvIOK is true for both left and right operands, then integer addition
1933 can be used instead of floating point (for cases where the result won't
1934 overflow). Before, floating point was always used, which could lead to
1935 loss of precision compared with integer addition.
1937 * making IV and NV equal status should make maths accurate on 64 bit
1939 * may speed up maths somewhat if pp_add and friends start to use
1940 integers when possible instead of fp. (Hopefully the overhead in
1941 looking for SvIOK and checking for overflow will not outweigh the
1942 fp to integer speedup)
1943 * will slow down integer operations (callers of SvIV) on "inaccurate"
1944 values, as the change from SvIOK to SvIOKp will cause a call into
1945 sv_2iv each time rather than a macro access direct to the IV slot
1946 * should speed up number->string conversion on integers as IV is
1947 favoured when IV and NV are equally accurate
1949 ####################################################################
1950 You had better be using SvIOK_notUV if you want an IV for arithmetic:
1951 SvIOK is true if (IV or UV), so you might be getting (IV)SvUV.
1952 On the other hand, SvUOK is true iff UV.
1953 ####################################################################
1955 Your mileage will vary depending your CPU's relative fp to integer
1959 #ifndef NV_PRESERVES_UV
1960 # define IS_NUMBER_UNDERFLOW_IV 1
1961 # define IS_NUMBER_UNDERFLOW_UV 2
1962 # define IS_NUMBER_IV_AND_UV 2
1963 # define IS_NUMBER_OVERFLOW_IV 4
1964 # define IS_NUMBER_OVERFLOW_UV 5
1966 /* sv_2iuv_non_preserve(): private routine for use by sv_2iv() and sv_2uv() */
1968 /* For sv_2nv these three cases are "SvNOK and don't bother casting" */
1970 S_sv_2iuv_non_preserve(pTHX_ register SV *sv, I32 numtype)
1972 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));
1973 if (SvNVX(sv) < (NV)IV_MIN) {
1974 (void)SvIOKp_on(sv);
1977 return IS_NUMBER_UNDERFLOW_IV;
1979 if (SvNVX(sv) > (NV)UV_MAX) {
1980 (void)SvIOKp_on(sv);
1984 return IS_NUMBER_OVERFLOW_UV;
1986 (void)SvIOKp_on(sv);
1988 /* Can't use strtol etc to convert this string. (See truth table in
1990 if (SvNVX(sv) <= (UV)IV_MAX) {
1991 SvIVX(sv) = I_V(SvNVX(sv));
1992 if ((NV)(SvIVX(sv)) == SvNVX(sv)) {
1993 SvIOK_on(sv); /* Integer is precise. NOK, IOK */
1995 /* Integer is imprecise. NOK, IOKp */
1997 return SvNVX(sv) < 0 ? IS_NUMBER_UNDERFLOW_UV : IS_NUMBER_IV_AND_UV;
2000 SvUVX(sv) = U_V(SvNVX(sv));
2001 if ((NV)(SvUVX(sv)) == SvNVX(sv)) {
2002 if (SvUVX(sv) == UV_MAX) {
2003 /* As we know that NVs don't preserve UVs, UV_MAX cannot
2004 possibly be preserved by NV. Hence, it must be overflow.
2006 return IS_NUMBER_OVERFLOW_UV;
2008 SvIOK_on(sv); /* Integer is precise. NOK, UOK */
2010 /* Integer is imprecise. NOK, IOKp */
2012 return IS_NUMBER_OVERFLOW_IV;
2014 #endif /* !NV_PRESERVES_UV*/
2019 Return the integer value of an SV, doing any necessary string conversion,
2020 magic etc. Normally used via the C<SvIV(sv)> and C<SvIVx(sv)> macros.
2026 Perl_sv_2iv(pTHX_ register SV *sv)
2030 if (SvGMAGICAL(sv)) {
2035 return I_V(SvNVX(sv));
2037 if (SvPOKp(sv) && SvLEN(sv))
2040 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
2041 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
2047 if (SvTHINKFIRST(sv)) {
2050 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv,numer)) &&
2051 (!SvROK(tmpstr) || (SvRV(tmpstr) != SvRV(sv))))
2052 return SvIV(tmpstr);
2053 return PTR2IV(SvRV(sv));
2056 sv_force_normal_flags(sv, 0);
2058 if (SvREADONLY(sv) && !SvOK(sv)) {
2059 if (ckWARN(WARN_UNINITIALIZED))
2066 return (IV)(SvUVX(sv));
2073 /* erm. not sure. *should* never get NOKp (without NOK) from sv_2nv
2074 * without also getting a cached IV/UV from it at the same time
2075 * (ie PV->NV conversion should detect loss of accuracy and cache
2076 * IV or UV at same time to avoid this. NWC */
2078 if (SvTYPE(sv) == SVt_NV)
2079 sv_upgrade(sv, SVt_PVNV);
2081 (void)SvIOKp_on(sv); /* Must do this first, to clear any SvOOK */
2082 /* < not <= as for NV doesn't preserve UV, ((NV)IV_MAX+1) will almost
2083 certainly cast into the IV range at IV_MAX, whereas the correct
2084 answer is the UV IV_MAX +1. Hence < ensures that dodgy boundary
2086 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2087 SvIVX(sv) = I_V(SvNVX(sv));
2088 if (SvNVX(sv) == (NV) SvIVX(sv)
2089 #ifndef NV_PRESERVES_UV
2090 && (((UV)1 << NV_PRESERVES_UV_BITS) >
2091 (UV)(SvIVX(sv) > 0 ? SvIVX(sv) : -SvIVX(sv)))
2092 /* Don't flag it as "accurately an integer" if the number
2093 came from a (by definition imprecise) NV operation, and
2094 we're outside the range of NV integer precision */
2097 SvIOK_on(sv); /* Can this go wrong with rounding? NWC */
2098 DEBUG_c(PerlIO_printf(Perl_debug_log,
2099 "0x%"UVxf" iv(%"NVgf" => %"IVdf") (precise)\n",
2105 /* IV not precise. No need to convert from PV, as NV
2106 conversion would already have cached IV if it detected
2107 that PV->IV would be better than PV->NV->IV
2108 flags already correct - don't set public IOK. */
2109 DEBUG_c(PerlIO_printf(Perl_debug_log,
2110 "0x%"UVxf" iv(%"NVgf" => %"IVdf") (imprecise)\n",
2115 /* Can the above go wrong if SvIVX == IV_MIN and SvNVX < IV_MIN,
2116 but the cast (NV)IV_MIN rounds to a the value less (more
2117 negative) than IV_MIN which happens to be equal to SvNVX ??
2118 Analogous to 0xFFFFFFFFFFFFFFFF rounding up to NV (2**64) and
2119 NV rounding back to 0xFFFFFFFFFFFFFFFF, so UVX == UV(NVX) and
2120 (NV)UVX == NVX are both true, but the values differ. :-(
2121 Hopefully for 2s complement IV_MIN is something like
2122 0x8000000000000000 which will be exact. NWC */
2125 SvUVX(sv) = U_V(SvNVX(sv));
2127 (SvNVX(sv) == (NV) SvUVX(sv))
2128 #ifndef NV_PRESERVES_UV
2129 /* Make sure it's not 0xFFFFFFFFFFFFFFFF */
2130 /*&& (SvUVX(sv) != UV_MAX) irrelevant with code below */
2131 && (((UV)1 << NV_PRESERVES_UV_BITS) > SvUVX(sv))
2132 /* Don't flag it as "accurately an integer" if the number
2133 came from a (by definition imprecise) NV operation, and
2134 we're outside the range of NV integer precision */
2140 DEBUG_c(PerlIO_printf(Perl_debug_log,
2141 "0x%"UVxf" 2iv(%"UVuf" => %"IVdf") (as unsigned)\n",
2145 return (IV)SvUVX(sv);
2148 else if (SvPOKp(sv) && SvLEN(sv)) {
2150 int numtype = grok_number(SvPVX(sv), SvCUR(sv), &value);
2151 /* We want to avoid a possible problem when we cache an IV which
2152 may be later translated to an NV, and the resulting NV is not
2153 the same as the direct translation of the initial string
2154 (eg 123.456 can shortcut to the IV 123 with atol(), but we must
2155 be careful to ensure that the value with the .456 is around if the
2156 NV value is requested in the future).
2158 This means that if we cache such an IV, we need to cache the
2159 NV as well. Moreover, we trade speed for space, and do not
2160 cache the NV if we are sure it's not needed.
2163 /* SVt_PVNV is one higher than SVt_PVIV, hence this order */
2164 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2165 == IS_NUMBER_IN_UV) {
2166 /* It's definitely an integer, only upgrade to PVIV */
2167 if (SvTYPE(sv) < SVt_PVIV)
2168 sv_upgrade(sv, SVt_PVIV);
2170 } else if (SvTYPE(sv) < SVt_PVNV)
2171 sv_upgrade(sv, SVt_PVNV);
2173 /* If NV preserves UV then we only use the UV value if we know that
2174 we aren't going to call atof() below. If NVs don't preserve UVs
2175 then the value returned may have more precision than atof() will
2176 return, even though value isn't perfectly accurate. */
2177 if ((numtype & (IS_NUMBER_IN_UV
2178 #ifdef NV_PRESERVES_UV
2181 )) == IS_NUMBER_IN_UV) {
2182 /* This won't turn off the public IOK flag if it was set above */
2183 (void)SvIOKp_on(sv);
2185 if (!(numtype & IS_NUMBER_NEG)) {
2187 if (value <= (UV)IV_MAX) {
2188 SvIVX(sv) = (IV)value;
2194 /* 2s complement assumption */
2195 if (value <= (UV)IV_MIN) {
2196 SvIVX(sv) = -(IV)value;
2198 /* Too negative for an IV. This is a double upgrade, but
2199 I'm assuming it will be rare. */
2200 if (SvTYPE(sv) < SVt_PVNV)
2201 sv_upgrade(sv, SVt_PVNV);
2205 SvNVX(sv) = -(NV)value;
2210 /* For !NV_PRESERVES_UV and IS_NUMBER_IN_UV and IS_NUMBER_NOT_INT we
2211 will be in the previous block to set the IV slot, and the next
2212 block to set the NV slot. So no else here. */
2214 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2215 != IS_NUMBER_IN_UV) {
2216 /* It wasn't an (integer that doesn't overflow the UV). */
2217 SvNVX(sv) = Atof(SvPVX(sv));
2219 if (! numtype && ckWARN(WARN_NUMERIC))
2222 #if defined(USE_LONG_DOUBLE)
2223 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2iv(%" PERL_PRIgldbl ")\n",
2224 PTR2UV(sv), SvNVX(sv)));
2226 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2iv(%"NVgf")\n",
2227 PTR2UV(sv), SvNVX(sv)));
2231 #ifdef NV_PRESERVES_UV
2232 (void)SvIOKp_on(sv);
2234 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2235 SvIVX(sv) = I_V(SvNVX(sv));
2236 if ((NV)(SvIVX(sv)) == SvNVX(sv)) {
2239 /* Integer is imprecise. NOK, IOKp */
2241 /* UV will not work better than IV */
2243 if (SvNVX(sv) > (NV)UV_MAX) {
2245 /* Integer is inaccurate. NOK, IOKp, is UV */
2249 SvUVX(sv) = U_V(SvNVX(sv));
2250 /* 0xFFFFFFFFFFFFFFFF not an issue in here */
2251 if ((NV)(SvUVX(sv)) == SvNVX(sv)) {
2255 /* Integer is imprecise. NOK, IOKp, is UV */
2261 #else /* NV_PRESERVES_UV */
2262 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2263 == (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT)) {
2264 /* The IV slot will have been set from value returned by
2265 grok_number above. The NV slot has just been set using
2268 assert (SvIOKp(sv));
2270 if (((UV)1 << NV_PRESERVES_UV_BITS) >
2271 U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))) {
2272 /* Small enough to preserve all bits. */
2273 (void)SvIOKp_on(sv);
2275 SvIVX(sv) = I_V(SvNVX(sv));
2276 if ((NV)(SvIVX(sv)) == SvNVX(sv))
2278 /* Assumption: first non-preserved integer is < IV_MAX,
2279 this NV is in the preserved range, therefore: */
2280 if (!(U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))
2282 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);
2286 0 0 already failed to read UV.
2287 0 1 already failed to read UV.
2288 1 0 you won't get here in this case. IV/UV
2289 slot set, public IOK, Atof() unneeded.
2290 1 1 already read UV.
2291 so there's no point in sv_2iuv_non_preserve() attempting
2292 to use atol, strtol, strtoul etc. */
2293 if (sv_2iuv_non_preserve (sv, numtype)
2294 >= IS_NUMBER_OVERFLOW_IV)
2298 #endif /* NV_PRESERVES_UV */
2301 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing && !(SvFLAGS(sv) & SVs_PADTMP))
2303 if (SvTYPE(sv) < SVt_IV)
2304 /* Typically the caller expects that sv_any is not NULL now. */
2305 sv_upgrade(sv, SVt_IV);
2308 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2iv(%"IVdf")\n",
2309 PTR2UV(sv),SvIVX(sv)));
2310 return SvIsUV(sv) ? (IV)SvUVX(sv) : SvIVX(sv);
2316 Return the unsigned integer value of an SV, doing any necessary string
2317 conversion, magic etc. Normally used via the C<SvUV(sv)> and C<SvUVx(sv)>
2324 Perl_sv_2uv(pTHX_ register SV *sv)
2328 if (SvGMAGICAL(sv)) {
2333 return U_V(SvNVX(sv));
2334 if (SvPOKp(sv) && SvLEN(sv))
2337 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
2338 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
2344 if (SvTHINKFIRST(sv)) {
2347 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv,numer)) &&
2348 (!SvROK(tmpstr) || (SvRV(tmpstr) != SvRV(sv))))
2349 return SvUV(tmpstr);
2350 return PTR2UV(SvRV(sv));
2353 sv_force_normal_flags(sv, 0);
2355 if (SvREADONLY(sv) && !SvOK(sv)) {
2356 if (ckWARN(WARN_UNINITIALIZED))
2366 return (UV)SvIVX(sv);
2370 /* erm. not sure. *should* never get NOKp (without NOK) from sv_2nv
2371 * without also getting a cached IV/UV from it at the same time
2372 * (ie PV->NV conversion should detect loss of accuracy and cache
2373 * IV or UV at same time to avoid this. */
2374 /* IV-over-UV optimisation - choose to cache IV if possible */
2376 if (SvTYPE(sv) == SVt_NV)
2377 sv_upgrade(sv, SVt_PVNV);
2379 (void)SvIOKp_on(sv); /* Must do this first, to clear any SvOOK */
2380 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2381 SvIVX(sv) = I_V(SvNVX(sv));
2382 if (SvNVX(sv) == (NV) SvIVX(sv)
2383 #ifndef NV_PRESERVES_UV
2384 && (((UV)1 << NV_PRESERVES_UV_BITS) >
2385 (UV)(SvIVX(sv) > 0 ? SvIVX(sv) : -SvIVX(sv)))
2386 /* Don't flag it as "accurately an integer" if the number
2387 came from a (by definition imprecise) NV operation, and
2388 we're outside the range of NV integer precision */
2391 SvIOK_on(sv); /* Can this go wrong with rounding? NWC */
2392 DEBUG_c(PerlIO_printf(Perl_debug_log,
2393 "0x%"UVxf" uv(%"NVgf" => %"IVdf") (precise)\n",
2399 /* IV not precise. No need to convert from PV, as NV
2400 conversion would already have cached IV if it detected
2401 that PV->IV would be better than PV->NV->IV
2402 flags already correct - don't set public IOK. */
2403 DEBUG_c(PerlIO_printf(Perl_debug_log,
2404 "0x%"UVxf" uv(%"NVgf" => %"IVdf") (imprecise)\n",
2409 /* Can the above go wrong if SvIVX == IV_MIN and SvNVX < IV_MIN,
2410 but the cast (NV)IV_MIN rounds to a the value less (more
2411 negative) than IV_MIN which happens to be equal to SvNVX ??
2412 Analogous to 0xFFFFFFFFFFFFFFFF rounding up to NV (2**64) and
2413 NV rounding back to 0xFFFFFFFFFFFFFFFF, so UVX == UV(NVX) and
2414 (NV)UVX == NVX are both true, but the values differ. :-(
2415 Hopefully for 2s complement IV_MIN is something like
2416 0x8000000000000000 which will be exact. NWC */
2419 SvUVX(sv) = U_V(SvNVX(sv));
2421 (SvNVX(sv) == (NV) SvUVX(sv))
2422 #ifndef NV_PRESERVES_UV
2423 /* Make sure it's not 0xFFFFFFFFFFFFFFFF */
2424 /*&& (SvUVX(sv) != UV_MAX) irrelevant with code below */
2425 && (((UV)1 << NV_PRESERVES_UV_BITS) > SvUVX(sv))
2426 /* Don't flag it as "accurately an integer" if the number
2427 came from a (by definition imprecise) NV operation, and
2428 we're outside the range of NV integer precision */
2433 DEBUG_c(PerlIO_printf(Perl_debug_log,
2434 "0x%"UVxf" 2uv(%"UVuf" => %"IVdf") (as unsigned)\n",
2440 else if (SvPOKp(sv) && SvLEN(sv)) {
2442 int numtype = grok_number(SvPVX(sv), SvCUR(sv), &value);
2444 /* We want to avoid a possible problem when we cache a UV which
2445 may be later translated to an NV, and the resulting NV is not
2446 the translation of the initial data.
2448 This means that if we cache such a UV, we need to cache the
2449 NV as well. Moreover, we trade speed for space, and do not
2450 cache the NV if not needed.
2453 /* SVt_PVNV is one higher than SVt_PVIV, hence this order */
2454 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2455 == IS_NUMBER_IN_UV) {
2456 /* It's definitely an integer, only upgrade to PVIV */
2457 if (SvTYPE(sv) < SVt_PVIV)
2458 sv_upgrade(sv, SVt_PVIV);
2460 } else if (SvTYPE(sv) < SVt_PVNV)
2461 sv_upgrade(sv, SVt_PVNV);
2463 /* If NV preserves UV then we only use the UV value if we know that
2464 we aren't going to call atof() below. If NVs don't preserve UVs
2465 then the value returned may have more precision than atof() will
2466 return, even though it isn't accurate. */
2467 if ((numtype & (IS_NUMBER_IN_UV
2468 #ifdef NV_PRESERVES_UV
2471 )) == IS_NUMBER_IN_UV) {
2472 /* This won't turn off the public IOK flag if it was set above */
2473 (void)SvIOKp_on(sv);
2475 if (!(numtype & IS_NUMBER_NEG)) {
2477 if (value <= (UV)IV_MAX) {
2478 SvIVX(sv) = (IV)value;
2480 /* it didn't overflow, and it was positive. */
2485 /* 2s complement assumption */
2486 if (value <= (UV)IV_MIN) {
2487 SvIVX(sv) = -(IV)value;
2489 /* Too negative for an IV. This is a double upgrade, but
2490 I'm assuming it will be rare. */
2491 if (SvTYPE(sv) < SVt_PVNV)
2492 sv_upgrade(sv, SVt_PVNV);
2496 SvNVX(sv) = -(NV)value;
2502 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2503 != IS_NUMBER_IN_UV) {
2504 /* It wasn't an integer, or it overflowed the UV. */
2505 SvNVX(sv) = Atof(SvPVX(sv));
2507 if (! numtype && ckWARN(WARN_NUMERIC))
2510 #if defined(USE_LONG_DOUBLE)
2511 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2uv(%" PERL_PRIgldbl ")\n",
2512 PTR2UV(sv), SvNVX(sv)));
2514 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2uv(%"NVgf")\n",
2515 PTR2UV(sv), SvNVX(sv)));
2518 #ifdef NV_PRESERVES_UV
2519 (void)SvIOKp_on(sv);
2521 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2522 SvIVX(sv) = I_V(SvNVX(sv));
2523 if ((NV)(SvIVX(sv)) == SvNVX(sv)) {
2526 /* Integer is imprecise. NOK, IOKp */
2528 /* UV will not work better than IV */
2530 if (SvNVX(sv) > (NV)UV_MAX) {
2532 /* Integer is inaccurate. NOK, IOKp, is UV */
2536 SvUVX(sv) = U_V(SvNVX(sv));
2537 /* 0xFFFFFFFFFFFFFFFF not an issue in here, NVs
2538 NV preservse UV so can do correct comparison. */
2539 if ((NV)(SvUVX(sv)) == SvNVX(sv)) {
2543 /* Integer is imprecise. NOK, IOKp, is UV */
2548 #else /* NV_PRESERVES_UV */
2549 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2550 == (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT)) {
2551 /* The UV slot will have been set from value returned by
2552 grok_number above. The NV slot has just been set using
2555 assert (SvIOKp(sv));
2557 if (((UV)1 << NV_PRESERVES_UV_BITS) >
2558 U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))) {
2559 /* Small enough to preserve all bits. */
2560 (void)SvIOKp_on(sv);
2562 SvIVX(sv) = I_V(SvNVX(sv));
2563 if ((NV)(SvIVX(sv)) == SvNVX(sv))
2565 /* Assumption: first non-preserved integer is < IV_MAX,
2566 this NV is in the preserved range, therefore: */
2567 if (!(U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))
2569 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);
2572 sv_2iuv_non_preserve (sv, numtype);
2574 #endif /* NV_PRESERVES_UV */
2578 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
2579 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
2582 if (SvTYPE(sv) < SVt_IV)
2583 /* Typically the caller expects that sv_any is not NULL now. */
2584 sv_upgrade(sv, SVt_IV);
2588 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2uv(%"UVuf")\n",
2589 PTR2UV(sv),SvUVX(sv)));
2590 return SvIsUV(sv) ? SvUVX(sv) : (UV)SvIVX(sv);
2596 Return the num value of an SV, doing any necessary string or integer
2597 conversion, magic etc. Normally used via the C<SvNV(sv)> and C<SvNVx(sv)>
2604 Perl_sv_2nv(pTHX_ register SV *sv)
2608 if (SvGMAGICAL(sv)) {
2612 if (SvPOKp(sv) && SvLEN(sv)) {
2613 if (ckWARN(WARN_NUMERIC) && !SvIOKp(sv) &&
2614 !grok_number(SvPVX(sv), SvCUR(sv), NULL))
2616 return Atof(SvPVX(sv));
2620 return (NV)SvUVX(sv);
2622 return (NV)SvIVX(sv);
2625 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
2626 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
2632 if (SvTHINKFIRST(sv)) {
2635 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv,numer)) &&
2636 (!SvROK(tmpstr) || (SvRV(tmpstr) != SvRV(sv))))
2637 return SvNV(tmpstr);
2638 return PTR2NV(SvRV(sv));
2641 sv_force_normal_flags(sv, 0);
2643 if (SvREADONLY(sv) && !SvOK(sv)) {
2644 if (ckWARN(WARN_UNINITIALIZED))
2649 if (SvTYPE(sv) < SVt_NV) {
2650 if (SvTYPE(sv) == SVt_IV)
2651 sv_upgrade(sv, SVt_PVNV);
2653 sv_upgrade(sv, SVt_NV);
2654 #ifdef USE_LONG_DOUBLE
2656 STORE_NUMERIC_LOCAL_SET_STANDARD();
2657 PerlIO_printf(Perl_debug_log,
2658 "0x%"UVxf" num(%" PERL_PRIgldbl ")\n",
2659 PTR2UV(sv), SvNVX(sv));
2660 RESTORE_NUMERIC_LOCAL();
2664 STORE_NUMERIC_LOCAL_SET_STANDARD();
2665 PerlIO_printf(Perl_debug_log, "0x%"UVxf" num(%"NVgf")\n",
2666 PTR2UV(sv), SvNVX(sv));
2667 RESTORE_NUMERIC_LOCAL();
2671 else if (SvTYPE(sv) < SVt_PVNV)
2672 sv_upgrade(sv, SVt_PVNV);
2677 SvNVX(sv) = SvIsUV(sv) ? (NV)SvUVX(sv) : (NV)SvIVX(sv);
2678 #ifdef NV_PRESERVES_UV
2681 /* Only set the public NV OK flag if this NV preserves the IV */
2682 /* Check it's not 0xFFFFFFFFFFFFFFFF */
2683 if (SvIsUV(sv) ? ((SvUVX(sv) != UV_MAX)&&(SvUVX(sv) == U_V(SvNVX(sv))))
2684 : (SvIVX(sv) == I_V(SvNVX(sv))))
2690 else if (SvPOKp(sv) && SvLEN(sv)) {
2692 int numtype = grok_number(SvPVX(sv), SvCUR(sv), &value);
2693 if (ckWARN(WARN_NUMERIC) && !SvIOKp(sv) && !numtype)
2695 #ifdef NV_PRESERVES_UV
2696 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2697 == IS_NUMBER_IN_UV) {
2698 /* It's definitely an integer */
2699 SvNVX(sv) = (numtype & IS_NUMBER_NEG) ? -(NV)value : (NV)value;
2701 SvNVX(sv) = Atof(SvPVX(sv));
2704 SvNVX(sv) = Atof(SvPVX(sv));
2705 /* Only set the public NV OK flag if this NV preserves the value in
2706 the PV at least as well as an IV/UV would.
2707 Not sure how to do this 100% reliably. */
2708 /* if that shift count is out of range then Configure's test is
2709 wonky. We shouldn't be in here with NV_PRESERVES_UV_BITS ==
2711 if (((UV)1 << NV_PRESERVES_UV_BITS) >
2712 U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))) {
2713 SvNOK_on(sv); /* Definitely small enough to preserve all bits */
2714 } else if (!(numtype & IS_NUMBER_IN_UV)) {
2715 /* Can't use strtol etc to convert this string, so don't try.
2716 sv_2iv and sv_2uv will use the NV to convert, not the PV. */
2719 /* value has been set. It may not be precise. */
2720 if ((numtype & IS_NUMBER_NEG) && (value > (UV)IV_MIN)) {
2721 /* 2s complement assumption for (UV)IV_MIN */
2722 SvNOK_on(sv); /* Integer is too negative. */
2727 if (numtype & IS_NUMBER_NEG) {
2728 SvIVX(sv) = -(IV)value;
2729 } else if (value <= (UV)IV_MAX) {
2730 SvIVX(sv) = (IV)value;
2736 if (numtype & IS_NUMBER_NOT_INT) {
2737 /* I believe that even if the original PV had decimals,
2738 they are lost beyond the limit of the FP precision.
2739 However, neither is canonical, so both only get p
2740 flags. NWC, 2000/11/25 */
2741 /* Both already have p flags, so do nothing */
2744 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2745 if (SvIVX(sv) == I_V(nv)) {
2750 /* It had no "." so it must be integer. */
2753 /* between IV_MAX and NV(UV_MAX).
2754 Could be slightly > UV_MAX */
2756 if (numtype & IS_NUMBER_NOT_INT) {
2757 /* UV and NV both imprecise. */
2759 UV nv_as_uv = U_V(nv);
2761 if (value == nv_as_uv && SvUVX(sv) != UV_MAX) {
2772 #endif /* NV_PRESERVES_UV */
2775 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing && !(SvFLAGS(sv) & SVs_PADTMP))
2777 if (SvTYPE(sv) < SVt_NV)
2778 /* Typically the caller expects that sv_any is not NULL now. */
2779 /* XXX Ilya implies that this is a bug in callers that assume this
2780 and ideally should be fixed. */
2781 sv_upgrade(sv, SVt_NV);
2784 #if defined(USE_LONG_DOUBLE)
2786 STORE_NUMERIC_LOCAL_SET_STANDARD();
2787 PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2nv(%" PERL_PRIgldbl ")\n",
2788 PTR2UV(sv), SvNVX(sv));
2789 RESTORE_NUMERIC_LOCAL();
2793 STORE_NUMERIC_LOCAL_SET_STANDARD();
2794 PerlIO_printf(Perl_debug_log, "0x%"UVxf" 1nv(%"NVgf")\n",
2795 PTR2UV(sv), SvNVX(sv));
2796 RESTORE_NUMERIC_LOCAL();
2802 /* asIV(): extract an integer from the string value of an SV.
2803 * Caller must validate PVX */
2806 S_asIV(pTHX_ SV *sv)
2809 int numtype = grok_number(SvPVX(sv), SvCUR(sv), &value);
2811 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2812 == IS_NUMBER_IN_UV) {
2813 /* It's definitely an integer */
2814 if (numtype & IS_NUMBER_NEG) {
2815 if (value < (UV)IV_MIN)
2818 if (value < (UV)IV_MAX)
2823 if (ckWARN(WARN_NUMERIC))
2826 return I_V(Atof(SvPVX(sv)));
2829 /* asUV(): extract an unsigned integer from the string value of an SV
2830 * Caller must validate PVX */
2833 S_asUV(pTHX_ SV *sv)
2836 int numtype = grok_number(SvPVX(sv), SvCUR(sv), &value);
2838 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2839 == IS_NUMBER_IN_UV) {
2840 /* It's definitely an integer */
2841 if (!(numtype & IS_NUMBER_NEG))
2845 if (ckWARN(WARN_NUMERIC))
2848 return U_V(Atof(SvPVX(sv)));
2852 =for apidoc sv_2pv_nolen
2854 Like C<sv_2pv()>, but doesn't return the length too. You should usually
2855 use the macro wrapper C<SvPV_nolen(sv)> instead.
2860 Perl_sv_2pv_nolen(pTHX_ register SV *sv)
2863 return sv_2pv(sv, &n_a);
2866 /* uiv_2buf(): private routine for use by sv_2pv_flags(): print an IV or
2867 * UV as a string towards the end of buf, and return pointers to start and
2870 * We assume that buf is at least TYPE_CHARS(UV) long.
2874 uiv_2buf(char *buf, IV iv, UV uv, int is_uv, char **peob)
2876 char *ptr = buf + TYPE_CHARS(UV);
2890 *--ptr = '0' + (char)(uv % 10);
2899 =for apidoc sv_2pv_flags
2901 Returns a pointer to the string value of an SV, and sets *lp to its length.
2902 If flags includes SV_GMAGIC, does an mg_get() first. Coerces sv to a string
2904 Normally invoked via the C<SvPV_flags> macro. C<sv_2pv()> and C<sv_2pv_nomg>
2905 usually end up here too.
2911 Perl_sv_2pv_flags(pTHX_ register SV *sv, STRLEN *lp, I32 flags)
2916 char tbuf[64]; /* Must fit sprintf/Gconvert of longest IV/NV */
2917 char *tmpbuf = tbuf;
2923 if (SvGMAGICAL(sv)) {
2924 if (flags & SV_GMAGIC)
2932 (void)sprintf(tmpbuf,"%"UVuf, (UV)SvUVX(sv));
2934 (void)sprintf(tmpbuf,"%"IVdf, (IV)SvIVX(sv));
2939 Gconvert(SvNVX(sv), NV_DIG, 0, tmpbuf);
2944 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
2945 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
2952 if (SvTHINKFIRST(sv)) {
2955 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv,string)) &&
2956 (!SvROK(tmpstr) || (SvRV(tmpstr) != SvRV(sv)))) {
2957 char *pv = SvPV(tmpstr, *lp);
2971 switch (SvTYPE(sv)) {
2973 if ( ((SvFLAGS(sv) &
2974 (SVs_OBJECT|SVf_OK|SVs_GMG|SVs_SMG|SVs_RMG))
2975 == (SVs_OBJECT|SVs_RMG))
2976 && (mg = mg_find(sv, PERL_MAGIC_qr))) {
2977 regexp *re = (regexp *)mg->mg_obj;
2980 char *fptr = "msix";
2985 char need_newline = 0;
2986 U16 reganch = (U16)((re->reganch & PMf_COMPILETIME) >> 12);
2988 while((ch = *fptr++)) {
2990 reflags[left++] = ch;
2993 reflags[right--] = ch;
2998 reflags[left] = '-';
3002 mg->mg_len = re->prelen + 4 + left;
3004 * If /x was used, we have to worry about a regex
3005 * ending with a comment later being embedded
3006 * within another regex. If so, we don't want this
3007 * regex's "commentization" to leak out to the
3008 * right part of the enclosing regex, we must cap
3009 * it with a newline.
3011 * So, if /x was used, we scan backwards from the
3012 * end of the regex. If we find a '#' before we
3013 * find a newline, we need to add a newline
3014 * ourself. If we find a '\n' first (or if we
3015 * don't find '#' or '\n'), we don't need to add
3016 * anything. -jfriedl
3018 if (PMf_EXTENDED & re->reganch)
3020 char *endptr = re->precomp + re->prelen;
3021 while (endptr >= re->precomp)
3023 char c = *(endptr--);
3025 break; /* don't need another */
3027 /* we end while in a comment, so we
3029 mg->mg_len++; /* save space for it */
3030 need_newline = 1; /* note to add it */
3036 New(616, mg->mg_ptr, mg->mg_len + 1 + left, char);
3037 Copy("(?", mg->mg_ptr, 2, char);
3038 Copy(reflags, mg->mg_ptr+2, left, char);
3039 Copy(":", mg->mg_ptr+left+2, 1, char);
3040 Copy(re->precomp, mg->mg_ptr+3+left, re->prelen, char);
3042 mg->mg_ptr[mg->mg_len - 2] = '\n';
3043 mg->mg_ptr[mg->mg_len - 1] = ')';
3044 mg->mg_ptr[mg->mg_len] = 0;
3046 PL_reginterp_cnt += re->program[0].next_off;
3048 if (re->reganch & ROPT_UTF8)
3063 case SVt_PVBM: if (SvROK(sv))
3066 s = "SCALAR"; break;
3067 case SVt_PVLV: s = "LVALUE"; break;
3068 case SVt_PVAV: s = "ARRAY"; break;
3069 case SVt_PVHV: s = "HASH"; break;
3070 case SVt_PVCV: s = "CODE"; break;
3071 case SVt_PVGV: s = "GLOB"; break;
3072 case SVt_PVFM: s = "FORMAT"; break;
3073 case SVt_PVIO: s = "IO"; break;
3074 default: s = "UNKNOWN"; break;
3078 Perl_sv_setpvf(aTHX_ tsv, "%s=%s", HvNAME(SvSTASH(sv)), s);
3081 Perl_sv_catpvf(aTHX_ tsv, "(0x%"UVxf")", PTR2UV(sv));
3087 if (SvREADONLY(sv) && !SvOK(sv)) {
3088 if (ckWARN(WARN_UNINITIALIZED))
3094 if (SvIOK(sv) || ((SvIOKp(sv) && !SvNOKp(sv)))) {
3095 /* I'm assuming that if both IV and NV are equally valid then
3096 converting the IV is going to be more efficient */
3097 U32 isIOK = SvIOK(sv);
3098 U32 isUIOK = SvIsUV(sv);
3099 char buf[TYPE_CHARS(UV)];
3102 if (SvTYPE(sv) < SVt_PVIV)
3103 sv_upgrade(sv, SVt_PVIV);
3105 ptr = uiv_2buf(buf, 0, SvUVX(sv), 1, &ebuf);
3107 ptr = uiv_2buf(buf, SvIVX(sv), 0, 0, &ebuf);
3108 SvGROW(sv, (STRLEN)(ebuf - ptr + 1)); /* inlined from sv_setpvn */
3109 Move(ptr,SvPVX(sv),ebuf - ptr,char);
3110 SvCUR_set(sv, ebuf - ptr);
3120 else if (SvNOKp(sv)) {
3121 if (SvTYPE(sv) < SVt_PVNV)
3122 sv_upgrade(sv, SVt_PVNV);
3123 /* The +20 is pure guesswork. Configure test needed. --jhi */
3124 SvGROW(sv, NV_DIG + 20);
3126 olderrno = errno; /* some Xenix systems wipe out errno here */
3128 if (SvNVX(sv) == 0.0)
3129 (void)strcpy(s,"0");
3133 Gconvert(SvNVX(sv), NV_DIG, 0, s);
3136 #ifdef FIXNEGATIVEZERO
3137 if (*s == '-' && s[1] == '0' && !s[2])
3147 if (ckWARN(WARN_UNINITIALIZED)
3148 && !PL_localizing && !(SvFLAGS(sv) & SVs_PADTMP))
3151 if (SvTYPE(sv) < SVt_PV)
3152 /* Typically the caller expects that sv_any is not NULL now. */
3153 sv_upgrade(sv, SVt_PV);
3156 *lp = s - SvPVX(sv);
3159 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2pv(%s)\n",
3160 PTR2UV(sv),SvPVX(sv)));
3164 if (SvROK(sv)) { /* XXX Skip this when sv_pvn_force calls */
3165 /* Sneaky stuff here */
3169 tsv = newSVpv(tmpbuf, 0);
3185 len = strlen(tmpbuf);
3187 #ifdef FIXNEGATIVEZERO
3188 if (len == 2 && t[0] == '-' && t[1] == '0') {
3193 (void)SvUPGRADE(sv, SVt_PV);
3195 s = SvGROW(sv, len + 1);
3204 =for apidoc sv_copypv
3206 Copies a stringified representation of the source SV into the
3207 destination SV. Automatically performs any necessary mg_get and
3208 coercion of numeric values into strings. Guaranteed to preserve
3209 UTF-8 flag even from overloaded objects. Similar in nature to
3210 sv_2pv[_flags] but operates directly on an SV instead of just the
3211 string. Mostly uses sv_2pv_flags to do its work, except when that
3212 would lose the UTF-8'ness of the PV.
3218 Perl_sv_copypv(pTHX_ SV *dsv, register SV *ssv)
3223 sv_setpvn(dsv,s,len);
3231 =for apidoc sv_2pvbyte_nolen
3233 Return a pointer to the byte-encoded representation of the SV.
3234 May cause the SV to be downgraded from UTF8 as a side-effect.
3236 Usually accessed via the C<SvPVbyte_nolen> macro.
3242 Perl_sv_2pvbyte_nolen(pTHX_ register SV *sv)
3245 return sv_2pvbyte(sv, &n_a);
3249 =for apidoc sv_2pvbyte
3251 Return a pointer to the byte-encoded representation of the SV, and set *lp
3252 to its length. May cause the SV to be downgraded from UTF8 as a
3255 Usually accessed via the C<SvPVbyte> macro.
3261 Perl_sv_2pvbyte(pTHX_ register SV *sv, STRLEN *lp)
3263 sv_utf8_downgrade(sv,0);
3264 return SvPV(sv,*lp);
3268 =for apidoc sv_2pvutf8_nolen
3270 Return a pointer to the UTF8-encoded representation of the SV.
3271 May cause the SV to be upgraded to UTF8 as a side-effect.
3273 Usually accessed via the C<SvPVutf8_nolen> macro.
3279 Perl_sv_2pvutf8_nolen(pTHX_ register SV *sv)
3282 return sv_2pvutf8(sv, &n_a);
3286 =for apidoc sv_2pvutf8
3288 Return a pointer to the UTF8-encoded representation of the SV, and set *lp
3289 to its length. May cause the SV to be upgraded to UTF8 as a side-effect.
3291 Usually accessed via the C<SvPVutf8> macro.
3297 Perl_sv_2pvutf8(pTHX_ register SV *sv, STRLEN *lp)
3299 sv_utf8_upgrade(sv);
3300 return SvPV(sv,*lp);
3304 =for apidoc sv_2bool
3306 This function is only called on magical items, and is only used by
3307 sv_true() or its macro equivalent.
3313 Perl_sv_2bool(pTHX_ register SV *sv)
3322 if (SvAMAGIC(sv) && (tmpsv=AMG_CALLun(sv,bool_)) &&
3323 (!SvROK(tmpsv) || (SvRV(tmpsv) != SvRV(sv))))
3324 return (bool)SvTRUE(tmpsv);
3325 return SvRV(sv) != 0;
3328 register XPV* Xpvtmp;
3329 if ((Xpvtmp = (XPV*)SvANY(sv)) &&
3330 (*Xpvtmp->xpv_pv > '0' ||
3331 Xpvtmp->xpv_cur > 1 ||
3332 (Xpvtmp->xpv_cur && *Xpvtmp->xpv_pv != '0')))
3339 return SvIVX(sv) != 0;
3342 return SvNVX(sv) != 0.0;
3350 =for apidoc sv_utf8_upgrade
3352 Convert the PV of an SV to its UTF8-encoded form.
3353 Forces the SV to string form if it is not already.
3354 Always sets the SvUTF8 flag to avoid future validity checks even
3355 if all the bytes have hibit clear.
3357 This is not as a general purpose byte encoding to Unicode interface:
3358 use the Encode extension for that.
3360 =for apidoc sv_utf8_upgrade_flags
3362 Convert the PV of an SV to its UTF8-encoded form.
3363 Forces the SV to string form if it is not already.
3364 Always sets the SvUTF8 flag to avoid future validity checks even
3365 if all the bytes have hibit clear. If C<flags> has C<SV_GMAGIC> bit set,
3366 will C<mg_get> on C<sv> if appropriate, else not. C<sv_utf8_upgrade> and
3367 C<sv_utf8_upgrade_nomg> are implemented in terms of this function.
3369 This is not as a general purpose byte encoding to Unicode interface:
3370 use the Encode extension for that.
3376 Perl_sv_utf8_upgrade_flags(pTHX_ register SV *sv, I32 flags)
3386 (void) sv_2pv_flags(sv,&len, flags);
3395 sv_force_normal_flags(sv, 0);
3399 sv_recode_to_utf8(sv, PL_encoding);
3400 else { /* Assume Latin-1/EBCDIC */
3401 /* This function could be much more efficient if we
3402 * had a FLAG in SVs to signal if there are any hibit
3403 * chars in the PV. Given that there isn't such a flag
3404 * make the loop as fast as possible. */
3405 s = (U8 *) SvPVX(sv);
3406 e = (U8 *) SvEND(sv);
3410 if ((hibit = !NATIVE_IS_INVARIANT(ch)))
3416 len = SvCUR(sv) + 1; /* Plus the \0 */
3417 SvPVX(sv) = (char*)bytes_to_utf8((U8*)s, &len);
3418 SvCUR(sv) = len - 1;
3420 Safefree(s); /* No longer using what was there before. */
3421 SvLEN(sv) = len; /* No longer know the real size. */
3423 /* Mark as UTF-8 even if no hibit - saves scanning loop */
3430 =for apidoc sv_utf8_downgrade
3432 Attempt to convert the PV of an SV from UTF8-encoded to byte encoding.
3433 This may not be possible if the PV contains non-byte encoding characters;
3434 if this is the case, either returns false or, if C<fail_ok> is not
3437 This is not as a general purpose Unicode to byte encoding interface:
3438 use the Encode extension for that.
3444 Perl_sv_utf8_downgrade(pTHX_ register SV* sv, bool fail_ok)
3446 if (SvPOK(sv) && SvUTF8(sv)) {
3452 sv_force_normal_flags(sv, 0);
3454 s = (U8 *) SvPV(sv, len);
3455 if (!utf8_to_bytes(s, &len)) {
3460 Perl_croak(aTHX_ "Wide character in %s",
3463 Perl_croak(aTHX_ "Wide character");
3474 =for apidoc sv_utf8_encode
3476 Convert the PV of an SV to UTF8-encoded, but then turn off the C<SvUTF8>
3477 flag so that it looks like octets again. Used as a building block
3478 for encode_utf8 in Encode.xs
3484 Perl_sv_utf8_encode(pTHX_ register SV *sv)
3486 (void) sv_utf8_upgrade(sv);
3491 =for apidoc sv_utf8_decode
3493 Convert the octets in the PV from UTF-8 to chars. Scan for validity and then
3494 turn off SvUTF8 if needed so that we see characters. Used as a building block
3495 for decode_utf8 in Encode.xs
3501 Perl_sv_utf8_decode(pTHX_ register SV *sv)
3507 /* The octets may have got themselves encoded - get them back as
3510 if (!sv_utf8_downgrade(sv, TRUE))
3513 /* it is actually just a matter of turning the utf8 flag on, but
3514 * we want to make sure everything inside is valid utf8 first.
3516 c = (U8 *) SvPVX(sv);
3517 if (!is_utf8_string(c, SvCUR(sv)+1))
3519 e = (U8 *) SvEND(sv);
3522 if (!UTF8_IS_INVARIANT(ch)) {
3532 =for apidoc sv_setsv
3534 Copies the contents of the source SV C<ssv> into the destination SV
3535 C<dsv>. The source SV may be destroyed if it is mortal, so don't use this
3536 function if the source SV needs to be reused. Does not handle 'set' magic.
3537 Loosely speaking, it performs a copy-by-value, obliterating any previous
3538 content of the destination.
3540 You probably want to use one of the assortment of wrappers, such as
3541 C<SvSetSV>, C<SvSetSV_nosteal>, C<SvSetMagicSV> and
3542 C<SvSetMagicSV_nosteal>.
3544 =for apidoc sv_setsv_flags
3546 Copies the contents of the source SV C<ssv> into the destination SV
3547 C<dsv>. The source SV may be destroyed if it is mortal, so don't use this
3548 function if the source SV needs to be reused. Does not handle 'set' magic.
3549 Loosely speaking, it performs a copy-by-value, obliterating any previous
3550 content of the destination.
3551 If the C<flags> parameter has the C<SV_GMAGIC> bit set, will C<mg_get> on
3552 C<ssv> if appropriate, else not. C<sv_setsv> and C<sv_setsv_nomg> are
3553 implemented in terms of this function.
3555 You probably want to use one of the assortment of wrappers, such as
3556 C<SvSetSV>, C<SvSetSV_nosteal>, C<SvSetMagicSV> and
3557 C<SvSetMagicSV_nosteal>.
3559 This is the primary function for copying scalars, and most other
3560 copy-ish functions and macros use this underneath.
3566 Perl_sv_setsv_flags(pTHX_ SV *dstr, register SV *sstr, I32 flags)
3568 register U32 sflags;
3574 SV_CHECK_THINKFIRST_COW_DROP(dstr);
3576 sstr = &PL_sv_undef;
3577 stype = SvTYPE(sstr);
3578 dtype = SvTYPE(dstr);
3583 /* need to nuke the magic */
3585 SvRMAGICAL_off(dstr);
3588 /* There's a lot of redundancy below but we're going for speed here */
3593 if (dtype != SVt_PVGV) {
3594 (void)SvOK_off(dstr);
3602 sv_upgrade(dstr, SVt_IV);
3605 sv_upgrade(dstr, SVt_PVNV);
3609 sv_upgrade(dstr, SVt_PVIV);
3612 (void)SvIOK_only(dstr);
3613 SvIVX(dstr) = SvIVX(sstr);
3616 if (SvTAINTED(sstr))
3627 sv_upgrade(dstr, SVt_NV);
3632 sv_upgrade(dstr, SVt_PVNV);
3635 SvNVX(dstr) = SvNVX(sstr);
3636 (void)SvNOK_only(dstr);
3637 if (SvTAINTED(sstr))
3645 sv_upgrade(dstr, SVt_RV);
3646 else if (dtype == SVt_PVGV &&
3647 SvTYPE(SvRV(sstr)) == SVt_PVGV) {
3650 if (GvIMPORTED(dstr) != GVf_IMPORTED
3651 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3653 GvIMPORTED_on(dstr);
3664 sv_upgrade(dstr, SVt_PV);
3667 if (dtype < SVt_PVIV)
3668 sv_upgrade(dstr, SVt_PVIV);
3671 if (dtype < SVt_PVNV)
3672 sv_upgrade(dstr, SVt_PVNV);
3679 Perl_croak(aTHX_ "Bizarre copy of %s in %s", sv_reftype(sstr, 0),
3682 Perl_croak(aTHX_ "Bizarre copy of %s", sv_reftype(sstr, 0));
3686 if (dtype <= SVt_PVGV) {
3688 if (dtype != SVt_PVGV) {
3689 char *name = GvNAME(sstr);
3690 STRLEN len = GvNAMELEN(sstr);
3691 sv_upgrade(dstr, SVt_PVGV);
3692 sv_magic(dstr, dstr, PERL_MAGIC_glob, Nullch, 0);
3693 GvSTASH(dstr) = (HV*)SvREFCNT_inc(GvSTASH(sstr));
3694 GvNAME(dstr) = savepvn(name, len);
3695 GvNAMELEN(dstr) = len;
3696 SvFAKE_on(dstr); /* can coerce to non-glob */
3698 /* ahem, death to those who redefine active sort subs */
3699 else if (PL_curstackinfo->si_type == PERLSI_SORT
3700 && GvCV(dstr) && PL_sortcop == CvSTART(GvCV(dstr)))
3701 Perl_croak(aTHX_ "Can't redefine active sort subroutine %s",
3704 #ifdef GV_UNIQUE_CHECK
3705 if (GvUNIQUE((GV*)dstr)) {
3706 Perl_croak(aTHX_ PL_no_modify);
3710 (void)SvOK_off(dstr);
3711 GvINTRO_off(dstr); /* one-shot flag */
3713 GvGP(dstr) = gp_ref(GvGP(sstr));
3714 if (SvTAINTED(sstr))
3716 if (GvIMPORTED(dstr) != GVf_IMPORTED
3717 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3719 GvIMPORTED_on(dstr);
3727 if (SvGMAGICAL(sstr) && (flags & SV_GMAGIC)) {
3729 if ((int)SvTYPE(sstr) != stype) {
3730 stype = SvTYPE(sstr);
3731 if (stype == SVt_PVGV && dtype <= SVt_PVGV)
3735 if (stype == SVt_PVLV)
3736 (void)SvUPGRADE(dstr, SVt_PVNV);
3738 (void)SvUPGRADE(dstr, (U32)stype);
3741 sflags = SvFLAGS(sstr);
3743 if (sflags & SVf_ROK) {
3744 if (dtype >= SVt_PV) {
3745 if (dtype == SVt_PVGV) {
3746 SV *sref = SvREFCNT_inc(SvRV(sstr));
3748 int intro = GvINTRO(dstr);
3750 #ifdef GV_UNIQUE_CHECK
3751 if (GvUNIQUE((GV*)dstr)) {
3752 Perl_croak(aTHX_ PL_no_modify);
3757 GvINTRO_off(dstr); /* one-shot flag */
3758 GvLINE(dstr) = CopLINE(PL_curcop);
3759 GvEGV(dstr) = (GV*)dstr;
3762 switch (SvTYPE(sref)) {
3765 SAVESPTR(GvAV(dstr));
3767 dref = (SV*)GvAV(dstr);
3768 GvAV(dstr) = (AV*)sref;
3769 if (!GvIMPORTED_AV(dstr)
3770 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3772 GvIMPORTED_AV_on(dstr);
3777 SAVESPTR(GvHV(dstr));
3779 dref = (SV*)GvHV(dstr);
3780 GvHV(dstr) = (HV*)sref;
3781 if (!GvIMPORTED_HV(dstr)
3782 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3784 GvIMPORTED_HV_on(dstr);
3789 if (GvCVGEN(dstr) && GvCV(dstr) != (CV*)sref) {
3790 SvREFCNT_dec(GvCV(dstr));
3791 GvCV(dstr) = Nullcv;
3792 GvCVGEN(dstr) = 0; /* Switch off cacheness. */
3793 PL_sub_generation++;
3795 SAVESPTR(GvCV(dstr));
3798 dref = (SV*)GvCV(dstr);
3799 if (GvCV(dstr) != (CV*)sref) {
3800 CV* cv = GvCV(dstr);
3802 if (!GvCVGEN((GV*)dstr) &&
3803 (CvROOT(cv) || CvXSUB(cv)))
3805 /* ahem, death to those who redefine
3806 * active sort subs */
3807 if (PL_curstackinfo->si_type == PERLSI_SORT &&
3808 PL_sortcop == CvSTART(cv))
3810 "Can't redefine active sort subroutine %s",
3811 GvENAME((GV*)dstr));
3812 /* Redefining a sub - warning is mandatory if
3813 it was a const and its value changed. */
3814 if (ckWARN(WARN_REDEFINE)
3816 && (!CvCONST((CV*)sref)
3817 || sv_cmp(cv_const_sv(cv),
3818 cv_const_sv((CV*)sref)))))
3820 Perl_warner(aTHX_ packWARN(WARN_REDEFINE),
3822 ? "Constant subroutine %s::%s redefined"
3823 : "Subroutine %s::%s redefined",
3824 HvNAME(GvSTASH((GV*)dstr)),
3825 GvENAME((GV*)dstr));
3829 cv_ckproto(cv, (GV*)dstr,
3830 SvPOK(sref) ? SvPVX(sref) : Nullch);
3832 GvCV(dstr) = (CV*)sref;
3833 GvCVGEN(dstr) = 0; /* Switch off cacheness. */
3834 GvASSUMECV_on(dstr);
3835 PL_sub_generation++;
3837 if (!GvIMPORTED_CV(dstr)
3838 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3840 GvIMPORTED_CV_on(dstr);
3845 SAVESPTR(GvIOp(dstr));
3847 dref = (SV*)GvIOp(dstr);
3848 GvIOp(dstr) = (IO*)sref;
3852 SAVESPTR(GvFORM(dstr));
3854 dref = (SV*)GvFORM(dstr);
3855 GvFORM(dstr) = (CV*)sref;
3859 SAVESPTR(GvSV(dstr));
3861 dref = (SV*)GvSV(dstr);
3863 if (!GvIMPORTED_SV(dstr)
3864 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3866 GvIMPORTED_SV_on(dstr);
3874 if (SvTAINTED(sstr))
3879 (void)SvOOK_off(dstr); /* backoff */
3881 Safefree(SvPVX(dstr));
3882 SvLEN(dstr)=SvCUR(dstr)=0;
3885 (void)SvOK_off(dstr);
3886 SvRV(dstr) = SvREFCNT_inc(SvRV(sstr));
3888 if (sflags & SVp_NOK) {
3890 /* Only set the public OK flag if the source has public OK. */
3891 if (sflags & SVf_NOK)
3892 SvFLAGS(dstr) |= SVf_NOK;
3893 SvNVX(dstr) = SvNVX(sstr);
3895 if (sflags & SVp_IOK) {
3896 (void)SvIOKp_on(dstr);
3897 if (sflags & SVf_IOK)
3898 SvFLAGS(dstr) |= SVf_IOK;
3899 if (sflags & SVf_IVisUV)
3901 SvIVX(dstr) = SvIVX(sstr);
3903 if (SvAMAGIC(sstr)) {
3907 else if (sflags & SVp_POK) {
3911 * Check to see if we can just swipe the string. If so, it's a
3912 * possible small lose on short strings, but a big win on long ones.
3913 * It might even be a win on short strings if SvPVX(dstr)
3914 * has to be allocated and SvPVX(sstr) has to be freed.
3918 #ifdef PERL_COPY_ON_WRITE
3919 (sflags & (SVf_FAKE | SVf_READONLY)) != (SVf_FAKE | SVf_READONLY)
3923 (sflags & SVs_TEMP) && /* slated for free anyway? */
3924 !(sflags & SVf_OOK) && /* and not involved in OOK hack? */
3925 SvREFCNT(sstr) == 1 && /* and no other references to it? */
3926 SvLEN(sstr) && /* and really is a string */
3927 /* and won't be needed again, potentially */
3928 !(PL_op && PL_op->op_type == OP_AASSIGN))
3929 #ifdef PERL_COPY_ON_WRITE
3930 && !((sflags & CAN_COW_MASK) == CAN_COW_FLAGS
3931 && SvTYPE(sstr) >= SVt_PVIV)
3934 /* Failed the swipe test, and it's not a shared hash key either.
3935 Have to copy the string. */
3936 STRLEN len = SvCUR(sstr);
3937 SvGROW(dstr, len + 1); /* inlined from sv_setpvn */
3938 Move(SvPVX(sstr),SvPVX(dstr),len,char);
3939 SvCUR_set(dstr, len);
3940 *SvEND(dstr) = '\0';
3941 (void)SvPOK_only(dstr);
3943 /* If PERL_COPY_ON_WRITE is not defined, then isSwipe will always
3945 #ifdef PERL_COPY_ON_WRITE
3946 /* Either it's a shared hash key, or it's suitable for
3947 copy-on-write or we can swipe the string. */
3949 PerlIO_printf(Perl_debug_log,
3950 "Copy on write: sstr --> dstr\n");
3955 /* I believe I should acquire a global SV mutex if
3956 it's a COW sv (not a shared hash key) to stop
3957 it going un copy-on-write.
3958 If the source SV has gone un copy on write between up there
3959 and down here, then (assert() that) it is of the correct
3960 form to make it copy on write again */
3961 if ((sflags & (SVf_FAKE | SVf_READONLY))
3962 != (SVf_FAKE | SVf_READONLY)) {
3963 SvREADONLY_on(sstr);
3965 /* Make the source SV into a loop of 1.
3966 (about to become 2) */
3967 SV_COW_NEXT_SV_SET(sstr, sstr);
3971 /* Initial code is common. */
3972 if (SvPVX(dstr)) { /* we know that dtype >= SVt_PV */
3974 SvFLAGS(dstr) &= ~SVf_OOK;
3975 Safefree(SvPVX(dstr) - SvIVX(dstr));
3977 else if (SvLEN(dstr))
3978 Safefree(SvPVX(dstr));
3980 (void)SvPOK_only(dstr);
3982 #ifdef PERL_COPY_ON_WRITE
3984 /* making another shared SV. */
3985 STRLEN cur = SvCUR(sstr);
3986 STRLEN len = SvLEN(sstr);
3988 /* SvIsCOW_normal */
3989 /* splice us in between source and next-after-source. */
3990 SV_COW_NEXT_SV_SET(dstr, SV_COW_NEXT_SV(sstr));
3991 SV_COW_NEXT_SV_SET(sstr, dstr);
3992 SvPV_set(dstr, SvPVX(sstr));
3994 /* SvIsCOW_shared_hash */
3995 UV hash = SvUVX(sstr);
3996 DEBUG_C(PerlIO_printf(Perl_debug_log,
3997 "Copy on write: Sharing hash\n"));
3999 sharepvn(SvPVX(sstr),
4000 (sflags & SVf_UTF8?-cur:cur), hash));
4005 SvREADONLY_on(dstr);
4007 /* Relesase a global SV mutex. */
4011 { /* Passes the swipe test. */
4012 SvPV_set(dstr, SvPVX(sstr));
4013 SvLEN_set(dstr, SvLEN(sstr));
4014 SvCUR_set(dstr, SvCUR(sstr));
4017 (void)SvOK_off(sstr); /* NOTE: nukes most SvFLAGS on sstr */
4018 SvPV_set(sstr, Nullch);
4024 if (sflags & SVf_UTF8)
4027 if (sflags & SVp_NOK) {
4029 if (sflags & SVf_NOK)
4030 SvFLAGS(dstr) |= SVf_NOK;
4031 SvNVX(dstr) = SvNVX(sstr);
4033 if (sflags & SVp_IOK) {
4034 (void)SvIOKp_on(dstr);
4035 if (sflags & SVf_IOK)
4036 SvFLAGS(dstr) |= SVf_IOK;
4037 if (sflags & SVf_IVisUV)
4039 SvIVX(dstr) = SvIVX(sstr);
4042 MAGIC *smg = mg_find(sstr,PERL_MAGIC_vstring);
4043 sv_magic(dstr, NULL, PERL_MAGIC_vstring,
4044 smg->mg_ptr, smg->mg_len);
4045 SvRMAGICAL_on(dstr);
4048 else if (sflags & SVp_IOK) {
4049 if (sflags & SVf_IOK)
4050 (void)SvIOK_only(dstr);
4052 (void)SvOK_off(dstr);
4053 (void)SvIOKp_on(dstr);
4055 /* XXXX Do we want to set IsUV for IV(ROK)? Be extra safe... */
4056 if (sflags & SVf_IVisUV)
4058 SvIVX(dstr) = SvIVX(sstr);
4059 if (sflags & SVp_NOK) {
4060 if (sflags & SVf_NOK)
4061 (void)SvNOK_on(dstr);
4063 (void)SvNOKp_on(dstr);
4064 SvNVX(dstr) = SvNVX(sstr);
4067 else if (sflags & SVp_NOK) {
4068 if (sflags & SVf_NOK)
4069 (void)SvNOK_only(dstr);
4071 (void)SvOK_off(dstr);
4074 SvNVX(dstr) = SvNVX(sstr);
4077 if (dtype == SVt_PVGV) {
4078 if (ckWARN(WARN_MISC))
4079 Perl_warner(aTHX_ packWARN(WARN_MISC), "Undefined value assigned to typeglob");
4082 (void)SvOK_off(dstr);
4084 if (SvTAINTED(sstr))
4089 =for apidoc sv_setsv_mg
4091 Like C<sv_setsv>, but also handles 'set' magic.
4097 Perl_sv_setsv_mg(pTHX_ SV *dstr, register SV *sstr)
4099 sv_setsv(dstr,sstr);
4104 =for apidoc sv_setpvn
4106 Copies a string into an SV. The C<len> parameter indicates the number of
4107 bytes to be copied. Does not handle 'set' magic. See C<sv_setpvn_mg>.
4113 Perl_sv_setpvn(pTHX_ register SV *sv, register const char *ptr, register STRLEN len)
4115 register char *dptr;
4117 SV_CHECK_THINKFIRST_COW_DROP(sv);
4123 /* len is STRLEN which is unsigned, need to copy to signed */
4126 Perl_croak(aTHX_ "panic: sv_setpvn called with negative strlen");
4128 (void)SvUPGRADE(sv, SVt_PV);
4130 SvGROW(sv, len + 1);
4132 Move(ptr,dptr,len,char);
4135 (void)SvPOK_only_UTF8(sv); /* validate pointer */
4140 =for apidoc sv_setpvn_mg
4142 Like C<sv_setpvn>, but also handles 'set' magic.
4148 Perl_sv_setpvn_mg(pTHX_ register SV *sv, register const char *ptr, register STRLEN len)
4150 sv_setpvn(sv,ptr,len);
4155 =for apidoc sv_setpv
4157 Copies a string into an SV. The string must be null-terminated. Does not
4158 handle 'set' magic. See C<sv_setpv_mg>.
4164 Perl_sv_setpv(pTHX_ register SV *sv, register const char *ptr)
4166 register STRLEN len;
4168 SV_CHECK_THINKFIRST_COW_DROP(sv);
4174 (void)SvUPGRADE(sv, SVt_PV);
4176 SvGROW(sv, len + 1);
4177 Move(ptr,SvPVX(sv),len+1,char);
4179 (void)SvPOK_only_UTF8(sv); /* validate pointer */
4184 =for apidoc sv_setpv_mg
4186 Like C<sv_setpv>, but also handles 'set' magic.
4192 Perl_sv_setpv_mg(pTHX_ register SV *sv, register const char *ptr)
4199 =for apidoc sv_usepvn
4201 Tells an SV to use C<ptr> to find its string value. Normally the string is
4202 stored inside the SV but sv_usepvn allows the SV to use an outside string.
4203 The C<ptr> should point to memory that was allocated by C<malloc>. The
4204 string length, C<len>, must be supplied. This function will realloc the
4205 memory pointed to by C<ptr>, so that pointer should not be freed or used by
4206 the programmer after giving it to sv_usepvn. Does not handle 'set' magic.
4207 See C<sv_usepvn_mg>.
4213 Perl_sv_usepvn(pTHX_ register SV *sv, register char *ptr, register STRLEN len)
4215 SV_CHECK_THINKFIRST_COW_DROP(sv);
4216 (void)SvUPGRADE(sv, SVt_PV);
4221 (void)SvOOK_off(sv);
4222 if (SvPVX(sv) && SvLEN(sv))
4223 Safefree(SvPVX(sv));
4224 Renew(ptr, len+1, char);
4227 SvLEN_set(sv, len+1);
4229 (void)SvPOK_only_UTF8(sv); /* validate pointer */
4234 =for apidoc sv_usepvn_mg
4236 Like C<sv_usepvn>, but also handles 'set' magic.
4242 Perl_sv_usepvn_mg(pTHX_ register SV *sv, register char *ptr, register STRLEN len)
4244 sv_usepvn(sv,ptr,len);
4248 #ifdef PERL_COPY_ON_WRITE
4249 /* Need to do this *after* making the SV normal, as we need the buffer
4250 pointer to remain valid until after we've copied it. If we let go too early,
4251 another thread could invalidate it by unsharing last of the same hash key
4252 (which it can do by means other than releasing copy-on-write Svs)
4253 or by changing the other copy-on-write SVs in the loop. */
4255 S_sv_release_COW(pTHX_ register SV *sv, char *pvx, STRLEN cur, STRLEN len,
4256 U32 hash, SV *after)
4258 if (len) { /* this SV was SvIsCOW_normal(sv) */
4259 /* we need to find the SV pointing to us. */
4260 SV *current = SV_COW_NEXT_SV(after);
4262 if (current == sv) {
4263 /* The SV we point to points back to us (there were only two of us
4265 Hence other SV is no longer copy on write either. */
4267 SvREADONLY_off(after);
4269 /* We need to follow the pointers around the loop. */
4271 while ((next = SV_COW_NEXT_SV(current)) != sv) {
4274 /* don't loop forever if the structure is bust, and we have
4275 a pointer into a closed loop. */
4276 assert (current != after);
4277 assert (SvPVX(current) == pvx);
4279 /* Make the SV before us point to the SV after us. */
4280 SV_COW_NEXT_SV_SET(current, after);
4283 unsharepvn(pvx, SvUTF8(sv) ? -(I32)cur : cur, hash);
4288 Perl_sv_release_IVX(pTHX_ register SV *sv)
4291 sv_force_normal_flags(sv, 0);
4292 return SvOOK_off(sv);
4296 =for apidoc sv_force_normal_flags
4298 Undo various types of fakery on an SV: if the PV is a shared string, make
4299 a private copy; if we're a ref, stop refing; if we're a glob, downgrade to
4300 an xpvmg; if we're a copy-on-write scalar, this is the on-write time when
4301 we do the copy, and is also used locally. If C<SV_COW_DROP_PV> is set
4302 then a copy-on-write scalar drops its PV buffer (if any) and becomes
4303 SvPOK_off rather than making a copy. (Used where this scalar is about to be
4304 set to some other value. In addtion, the C<flags> parameter gets passed to
4305 C<sv_unref_flags()> when unrefing. C<sv_force_normal> calls this function
4306 with flags set to 0.
4312 Perl_sv_force_normal_flags(pTHX_ register SV *sv, U32 flags)
4314 #ifdef PERL_COPY_ON_WRITE
4315 if (SvREADONLY(sv)) {
4316 /* At this point I believe I should acquire a global SV mutex. */
4318 char *pvx = SvPVX(sv);
4319 STRLEN len = SvLEN(sv);
4320 STRLEN cur = SvCUR(sv);
4321 U32 hash = SvUVX(sv);
4322 SV *next = SV_COW_NEXT_SV(sv); /* next COW sv in the loop. */
4324 PerlIO_printf(Perl_debug_log,
4325 "Copy on write: Force normal %ld\n",
4331 /* This SV doesn't own the buffer, so need to New() a new one: */
4334 if (flags & SV_COW_DROP_PV) {
4335 /* OK, so we don't need to copy our buffer. */
4338 SvGROW(sv, cur + 1);
4339 Move(pvx,SvPVX(sv),cur,char);
4343 sv_release_COW(sv, pvx, cur, len, hash, next);
4348 else if (PL_curcop != &PL_compiling)
4349 Perl_croak(aTHX_ PL_no_modify);
4350 /* At this point I believe that I can drop the global SV mutex. */
4353 if (SvREADONLY(sv)) {
4355 char *pvx = SvPVX(sv);
4356 STRLEN len = SvCUR(sv);
4357 U32 hash = SvUVX(sv);
4358 SvGROW(sv, len + 1);
4359 Move(pvx,SvPVX(sv),len,char);
4363 unsharepvn(pvx, SvUTF8(sv) ? -(I32)len : len, hash);
4365 else if (PL_curcop != &PL_compiling)
4366 Perl_croak(aTHX_ PL_no_modify);
4370 sv_unref_flags(sv, flags);
4371 else if (SvFAKE(sv) && SvTYPE(sv) == SVt_PVGV)
4376 =for apidoc sv_force_normal
4378 Undo various types of fakery on an SV: if the PV is a shared string, make
4379 a private copy; if we're a ref, stop refing; if we're a glob, downgrade to
4380 an xpvmg. See also C<sv_force_normal_flags>.
4386 Perl_sv_force_normal(pTHX_ register SV *sv)
4388 sv_force_normal_flags(sv, 0);
4394 Efficient removal of characters from the beginning of the string buffer.
4395 SvPOK(sv) must be true and the C<ptr> must be a pointer to somewhere inside
4396 the string buffer. The C<ptr> becomes the first character of the adjusted
4397 string. Uses the "OOK hack".
4403 Perl_sv_chop(pTHX_ register SV *sv, register char *ptr)
4405 register STRLEN delta;
4407 if (!ptr || !SvPOKp(sv))
4409 SV_CHECK_THINKFIRST(sv);
4410 if (SvTYPE(sv) < SVt_PVIV)
4411 sv_upgrade(sv,SVt_PVIV);
4414 if (!SvLEN(sv)) { /* make copy of shared string */
4415 char *pvx = SvPVX(sv);
4416 STRLEN len = SvCUR(sv);
4417 SvGROW(sv, len + 1);
4418 Move(pvx,SvPVX(sv),len,char);
4422 SvFLAGS(sv) |= SVf_OOK;
4424 SvFLAGS(sv) &= ~(SVf_IOK|SVf_NOK|SVp_IOK|SVp_NOK|SVf_IVisUV);
4425 delta = ptr - SvPVX(sv);
4433 =for apidoc sv_catpvn
4435 Concatenates the string onto the end of the string which is in the SV. The
4436 C<len> indicates number of bytes to copy. If the SV has the UTF8
4437 status set, then the bytes appended should be valid UTF8.
4438 Handles 'get' magic, but not 'set' magic. See C<sv_catpvn_mg>.
4440 =for apidoc sv_catpvn_flags
4442 Concatenates the string onto the end of the string which is in the SV. The
4443 C<len> indicates number of bytes to copy. If the SV has the UTF8
4444 status set, then the bytes appended should be valid UTF8.
4445 If C<flags> has C<SV_GMAGIC> bit set, will C<mg_get> on C<dsv> if
4446 appropriate, else not. C<sv_catpvn> and C<sv_catpvn_nomg> are implemented
4447 in terms of this function.
4453 Perl_sv_catpvn_flags(pTHX_ register SV *dsv, register const char *sstr, register STRLEN slen, I32 flags)
4458 dstr = SvPV_force_flags(dsv, dlen, flags);
4459 SvGROW(dsv, dlen + slen + 1);
4462 Move(sstr, SvPVX(dsv) + dlen, slen, char);
4465 (void)SvPOK_only_UTF8(dsv); /* validate pointer */
4470 =for apidoc sv_catpvn_mg
4472 Like C<sv_catpvn>, but also handles 'set' magic.
4478 Perl_sv_catpvn_mg(pTHX_ register SV *sv, register const char *ptr, register STRLEN len)
4480 sv_catpvn(sv,ptr,len);
4485 =for apidoc sv_catsv
4487 Concatenates the string from SV C<ssv> onto the end of the string in
4488 SV C<dsv>. Modifies C<dsv> but not C<ssv>. Handles 'get' magic, but
4489 not 'set' magic. See C<sv_catsv_mg>.
4491 =for apidoc sv_catsv_flags
4493 Concatenates the string from SV C<ssv> onto the end of the string in
4494 SV C<dsv>. Modifies C<dsv> but not C<ssv>. If C<flags> has C<SV_GMAGIC>
4495 bit set, will C<mg_get> on the SVs if appropriate, else not. C<sv_catsv>
4496 and C<sv_catsv_nomg> are implemented in terms of this function.
4501 Perl_sv_catsv_flags(pTHX_ SV *dsv, register SV *ssv, I32 flags)
4507 if ((spv = SvPV(ssv, slen))) {
4508 /* sutf8 and dutf8 were type bool, but under USE_ITHREADS,
4509 gcc version 2.95.2 20000220 (Debian GNU/Linux) for
4510 Linux xxx 2.2.17 on sparc64 with gcc -O2, we erroneously
4511 get dutf8 = 0x20000000, (i.e. SVf_UTF8) even though
4512 dsv->sv_flags doesn't have that bit set.
4513 Andy Dougherty 12 Oct 2001
4515 I32 sutf8 = DO_UTF8(ssv);
4518 if (SvGMAGICAL(dsv) && (flags & SV_GMAGIC))
4520 dutf8 = DO_UTF8(dsv);
4522 if (dutf8 != sutf8) {
4524 /* Not modifying source SV, so taking a temporary copy. */
4525 SV* csv = sv_2mortal(newSVpvn(spv, slen));
4527 sv_utf8_upgrade(csv);
4528 spv = SvPV(csv, slen);
4531 sv_utf8_upgrade_nomg(dsv);
4533 sv_catpvn_nomg(dsv, spv, slen);
4538 =for apidoc sv_catsv_mg
4540 Like C<sv_catsv>, but also handles 'set' magic.
4546 Perl_sv_catsv_mg(pTHX_ SV *dsv, register SV *ssv)
4553 =for apidoc sv_catpv
4555 Concatenates the string onto the end of the string which is in the SV.
4556 If the SV has the UTF8 status set, then the bytes appended should be
4557 valid UTF8. Handles 'get' magic, but not 'set' magic. See C<sv_catpv_mg>.
4562 Perl_sv_catpv(pTHX_ register SV *sv, register const char *ptr)
4564 register STRLEN len;
4570 junk = SvPV_force(sv, tlen);
4572 SvGROW(sv, tlen + len + 1);
4575 Move(ptr,SvPVX(sv)+tlen,len+1,char);
4577 (void)SvPOK_only_UTF8(sv); /* validate pointer */
4582 =for apidoc sv_catpv_mg
4584 Like C<sv_catpv>, but also handles 'set' magic.
4590 Perl_sv_catpv_mg(pTHX_ register SV *sv, register const char *ptr)
4599 Create a new null SV, or if len > 0, create a new empty SVt_PV type SV
4600 with an initial PV allocation of len+1. Normally accessed via the C<NEWSV>
4607 Perl_newSV(pTHX_ STRLEN len)
4613 sv_upgrade(sv, SVt_PV);
4614 SvGROW(sv, len + 1);
4619 =for apidoc sv_magicext
4621 Adds magic to an SV, upgrading it if necessary. Applies the
4622 supplied vtable and returns pointer to the magic added.
4624 Note that sv_magicext will allow things that sv_magic will not.
4625 In particular you can add magic to SvREADONLY SVs and and more than
4626 one instance of the same 'how'
4628 I C<namelen> is greater then zero then a savepvn() I<copy> of C<name> is stored,
4629 if C<namelen> is zero then C<name> is stored as-is and - as another special
4630 case - if C<(name && namelen == HEf_SVKEY)> then C<name> is assumed to contain
4631 an C<SV*> and has its REFCNT incremented
4633 (This is now used as a subroutine by sv_magic.)
4638 Perl_sv_magicext(pTHX_ SV* sv, SV* obj, int how, MGVTBL *vtable,
4639 const char* name, I32 namlen)
4643 if (SvTYPE(sv) < SVt_PVMG) {
4644 (void)SvUPGRADE(sv, SVt_PVMG);
4646 Newz(702,mg, 1, MAGIC);
4647 mg->mg_moremagic = SvMAGIC(sv);
4650 /* Some magic sontains a reference loop, where the sv and object refer to
4651 each other. To prevent a reference loop that would prevent such
4652 objects being freed, we look for such loops and if we find one we
4653 avoid incrementing the object refcount.
4655 Note we cannot do this to avoid self-tie loops as intervening RV must
4656 have its REFCNT incremented to keep it in existence.
4659 if (!obj || obj == sv ||
4660 how == PERL_MAGIC_arylen ||
4661 how == PERL_MAGIC_qr ||
4662 (SvTYPE(obj) == SVt_PVGV &&
4663 (GvSV(obj) == sv || GvHV(obj) == (HV*)sv || GvAV(obj) == (AV*)sv ||
4664 GvCV(obj) == (CV*)sv || GvIOp(obj) == (IO*)sv ||
4665 GvFORM(obj) == (CV*)sv)))
4670 mg->mg_obj = SvREFCNT_inc(obj);
4671 mg->mg_flags |= MGf_REFCOUNTED;
4674 /* Normal self-ties simply pass a null object, and instead of
4675 using mg_obj directly, use the SvTIED_obj macro to produce a
4676 new RV as needed. For glob "self-ties", we are tieing the PVIO
4677 with an RV obj pointing to the glob containing the PVIO. In
4678 this case, to avoid a reference loop, we need to weaken the
4682 if (how == PERL_MAGIC_tiedscalar && SvTYPE(sv) == SVt_PVIO &&
4683 obj && SvROK(obj) && GvIO(SvRV(obj)) == (IO*)sv)
4689 mg->mg_len = namlen;
4692 mg->mg_ptr = savepvn(name, namlen);
4693 else if (namlen == HEf_SVKEY)
4694 mg->mg_ptr = (char*)SvREFCNT_inc((SV*)name);
4696 mg->mg_ptr = (char *) name;
4698 mg->mg_virtual = vtable;
4702 SvFLAGS(sv) &= ~(SVf_IOK|SVf_NOK|SVf_POK);
4707 =for apidoc sv_magic
4709 Adds magic to an SV. First upgrades C<sv> to type C<SVt_PVMG> if necessary,
4710 then adds a new magic item of type C<how> to the head of the magic list.
4716 Perl_sv_magic(pTHX_ register SV *sv, SV *obj, int how, const char *name, I32 namlen)
4721 #ifdef PERL_COPY_ON_WRITE
4723 sv_force_normal_flags(sv, 0);
4725 if (SvREADONLY(sv)) {
4726 if (PL_curcop != &PL_compiling
4727 && how != PERL_MAGIC_regex_global
4728 && how != PERL_MAGIC_bm
4729 && how != PERL_MAGIC_fm
4730 && how != PERL_MAGIC_sv
4733 Perl_croak(aTHX_ PL_no_modify);
4736 if (SvMAGICAL(sv) || (how == PERL_MAGIC_taint && SvTYPE(sv) >= SVt_PVMG)) {
4737 if (SvMAGIC(sv) && (mg = mg_find(sv, how))) {
4738 /* sv_magic() refuses to add a magic of the same 'how' as an
4741 if (how == PERL_MAGIC_taint)
4749 vtable = &PL_vtbl_sv;
4751 case PERL_MAGIC_overload:
4752 vtable = &PL_vtbl_amagic;
4754 case PERL_MAGIC_overload_elem:
4755 vtable = &PL_vtbl_amagicelem;
4757 case PERL_MAGIC_overload_table:
4758 vtable = &PL_vtbl_ovrld;
4761 vtable = &PL_vtbl_bm;
4763 case PERL_MAGIC_regdata:
4764 vtable = &PL_vtbl_regdata;
4766 case PERL_MAGIC_regdatum:
4767 vtable = &PL_vtbl_regdatum;
4769 case PERL_MAGIC_env:
4770 vtable = &PL_vtbl_env;
4773 vtable = &PL_vtbl_fm;
4775 case PERL_MAGIC_envelem:
4776 vtable = &PL_vtbl_envelem;
4778 case PERL_MAGIC_regex_global:
4779 vtable = &PL_vtbl_mglob;
4781 case PERL_MAGIC_isa:
4782 vtable = &PL_vtbl_isa;
4784 case PERL_MAGIC_isaelem:
4785 vtable = &PL_vtbl_isaelem;
4787 case PERL_MAGIC_nkeys:
4788 vtable = &PL_vtbl_nkeys;
4790 case PERL_MAGIC_dbfile:
4793 case PERL_MAGIC_dbline:
4794 vtable = &PL_vtbl_dbline;
4796 #ifdef USE_LOCALE_COLLATE
4797 case PERL_MAGIC_collxfrm:
4798 vtable = &PL_vtbl_collxfrm;
4800 #endif /* USE_LOCALE_COLLATE */
4801 case PERL_MAGIC_tied:
4802 vtable = &PL_vtbl_pack;
4804 case PERL_MAGIC_tiedelem:
4805 case PERL_MAGIC_tiedscalar:
4806 vtable = &PL_vtbl_packelem;
4809 vtable = &PL_vtbl_regexp;
4811 case PERL_MAGIC_sig:
4812 vtable = &PL_vtbl_sig;
4814 case PERL_MAGIC_sigelem:
4815 vtable = &PL_vtbl_sigelem;
4817 case PERL_MAGIC_taint:
4818 vtable = &PL_vtbl_taint;
4820 case PERL_MAGIC_uvar:
4821 vtable = &PL_vtbl_uvar;
4823 case PERL_MAGIC_vec:
4824 vtable = &PL_vtbl_vec;
4826 case PERL_MAGIC_vstring:
4829 case PERL_MAGIC_substr:
4830 vtable = &PL_vtbl_substr;
4832 case PERL_MAGIC_defelem:
4833 vtable = &PL_vtbl_defelem;
4835 case PERL_MAGIC_glob:
4836 vtable = &PL_vtbl_glob;
4838 case PERL_MAGIC_arylen:
4839 vtable = &PL_vtbl_arylen;
4841 case PERL_MAGIC_pos:
4842 vtable = &PL_vtbl_pos;
4844 case PERL_MAGIC_backref:
4845 vtable = &PL_vtbl_backref;
4847 case PERL_MAGIC_ext:
4848 /* Reserved for use by extensions not perl internals. */
4849 /* Useful for attaching extension internal data to perl vars. */
4850 /* Note that multiple extensions may clash if magical scalars */
4851 /* etc holding private data from one are passed to another. */
4854 Perl_croak(aTHX_ "Don't know how to handle magic of type \\%o", how);
4857 /* Rest of work is done else where */
4858 mg = sv_magicext(sv,obj,how,vtable,name,namlen);
4861 case PERL_MAGIC_taint:
4864 case PERL_MAGIC_ext:
4865 case PERL_MAGIC_dbfile:
4872 =for apidoc sv_unmagic
4874 Removes all magic of type C<type> from an SV.
4880 Perl_sv_unmagic(pTHX_ SV *sv, int type)
4884 if (SvTYPE(sv) < SVt_PVMG || !SvMAGIC(sv))
4887 for (mg = *mgp; mg; mg = *mgp) {
4888 if (mg->mg_type == type) {
4889 MGVTBL* vtbl = mg->mg_virtual;
4890 *mgp = mg->mg_moremagic;
4891 if (vtbl && vtbl->svt_free)
4892 CALL_FPTR(vtbl->svt_free)(aTHX_ sv, mg);
4893 if (mg->mg_ptr && mg->mg_type != PERL_MAGIC_regex_global) {
4895 Safefree(mg->mg_ptr);
4896 else if (mg->mg_len == HEf_SVKEY)
4897 SvREFCNT_dec((SV*)mg->mg_ptr);
4899 if (mg->mg_flags & MGf_REFCOUNTED)
4900 SvREFCNT_dec(mg->mg_obj);
4904 mgp = &mg->mg_moremagic;
4908 SvFLAGS(sv) |= (SvFLAGS(sv) & (SVp_NOK|SVp_POK)) >> PRIVSHIFT;
4915 =for apidoc sv_rvweaken
4917 Weaken a reference: set the C<SvWEAKREF> flag on this RV; give the
4918 referred-to SV C<PERL_MAGIC_backref> magic if it hasn't already; and
4919 push a back-reference to this RV onto the array of backreferences
4920 associated with that magic.
4926 Perl_sv_rvweaken(pTHX_ SV *sv)
4929 if (!SvOK(sv)) /* let undefs pass */
4932 Perl_croak(aTHX_ "Can't weaken a nonreference");
4933 else if (SvWEAKREF(sv)) {
4934 if (ckWARN(WARN_MISC))
4935 Perl_warner(aTHX_ packWARN(WARN_MISC), "Reference is already weak");
4939 sv_add_backref(tsv, sv);
4945 /* Give tsv backref magic if it hasn't already got it, then push a
4946 * back-reference to sv onto the array associated with the backref magic.
4950 S_sv_add_backref(pTHX_ SV *tsv, SV *sv)
4954 if (SvMAGICAL(tsv) && (mg = mg_find(tsv, PERL_MAGIC_backref)))
4955 av = (AV*)mg->mg_obj;
4958 sv_magic(tsv, (SV*)av, PERL_MAGIC_backref, NULL, 0);
4959 SvREFCNT_dec(av); /* for sv_magic */
4964 /* delete a back-reference to ourselves from the backref magic associated
4965 * with the SV we point to.
4969 S_sv_del_backref(pTHX_ SV *sv)
4976 if (!SvMAGICAL(tsv) || !(mg = mg_find(tsv, PERL_MAGIC_backref)))
4977 Perl_croak(aTHX_ "panic: del_backref");
4978 av = (AV *)mg->mg_obj;
4983 svp[i] = &PL_sv_undef; /* XXX */
4990 =for apidoc sv_insert
4992 Inserts a string at the specified offset/length within the SV. Similar to
4993 the Perl substr() function.
4999 Perl_sv_insert(pTHX_ SV *bigstr, STRLEN offset, STRLEN len, char *little, STRLEN littlelen)
5003 register char *midend;
5004 register char *bigend;
5010 Perl_croak(aTHX_ "Can't modify non-existent substring");
5011 SvPV_force(bigstr, curlen);
5012 (void)SvPOK_only_UTF8(bigstr);
5013 if (offset + len > curlen) {
5014 SvGROW(bigstr, offset+len+1);
5015 Zero(SvPVX(bigstr)+curlen, offset+len-curlen, char);
5016 SvCUR_set(bigstr, offset+len);
5020 i = littlelen - len;
5021 if (i > 0) { /* string might grow */
5022 big = SvGROW(bigstr, SvCUR(bigstr) + i + 1);
5023 mid = big + offset + len;
5024 midend = bigend = big + SvCUR(bigstr);
5027 while (midend > mid) /* shove everything down */
5028 *--bigend = *--midend;
5029 Move(little,big+offset,littlelen,char);
5035 Move(little,SvPVX(bigstr)+offset,len,char);
5040 big = SvPVX(bigstr);
5043 bigend = big + SvCUR(bigstr);
5045 if (midend > bigend)
5046 Perl_croak(aTHX_ "panic: sv_insert");
5048 if (mid - big > bigend - midend) { /* faster to shorten from end */
5050 Move(little, mid, littlelen,char);
5053 i = bigend - midend;
5055 Move(midend, mid, i,char);
5059 SvCUR_set(bigstr, mid - big);
5062 else if ((i = mid - big)) { /* faster from front */
5063 midend -= littlelen;
5065 sv_chop(bigstr,midend-i);
5070 Move(little, mid, littlelen,char);
5072 else if (littlelen) {
5073 midend -= littlelen;
5074 sv_chop(bigstr,midend);
5075 Move(little,midend,littlelen,char);
5078 sv_chop(bigstr,midend);
5084 =for apidoc sv_replace
5086 Make the first argument a copy of the second, then delete the original.
5087 The target SV physically takes over ownership of the body of the source SV
5088 and inherits its flags; however, the target keeps any magic it owns,
5089 and any magic in the source is discarded.
5090 Note that this is a rather specialist SV copying operation; most of the
5091 time you'll want to use C<sv_setsv> or one of its many macro front-ends.
5097 Perl_sv_replace(pTHX_ register SV *sv, register SV *nsv)
5099 U32 refcnt = SvREFCNT(sv);
5100 SV_CHECK_THINKFIRST_COW_DROP(sv);
5101 if (SvREFCNT(nsv) != 1 && ckWARN_d(WARN_INTERNAL))
5102 Perl_warner(aTHX_ packWARN(WARN_INTERNAL), "Reference miscount in sv_replace()");
5103 if (SvMAGICAL(sv)) {
5107 sv_upgrade(nsv, SVt_PVMG);
5108 SvMAGIC(nsv) = SvMAGIC(sv);
5109 SvFLAGS(nsv) |= SvMAGICAL(sv);
5115 assert(!SvREFCNT(sv));
5116 StructCopy(nsv,sv,SV);
5117 #ifdef PERL_COPY_ON_WRITE
5118 if (SvIsCOW_normal(nsv)) {
5119 /* We need to follow the pointers around the loop to make the
5120 previous SV point to sv, rather than nsv. */
5123 while ((next = SV_COW_NEXT_SV(current)) != nsv) {
5126 assert(SvPVX(current) == SvPVX(nsv));
5128 /* Make the SV before us point to the SV after us. */
5130 PerlIO_printf(Perl_debug_log, "previous is\n");
5132 PerlIO_printf(Perl_debug_log,
5133 "move it from 0x%"UVxf" to 0x%"UVxf"\n",
5134 (UV) SV_COW_NEXT_SV(current), (UV) sv);
5136 SV_COW_NEXT_SV_SET(current, sv);
5139 SvREFCNT(sv) = refcnt;
5140 SvFLAGS(nsv) |= SVTYPEMASK; /* Mark as freed */
5145 =for apidoc sv_clear
5147 Clear an SV: call any destructors, free up any memory used by the body,
5148 and free the body itself. The SV's head is I<not> freed, although
5149 its type is set to all 1's so that it won't inadvertently be assumed
5150 to be live during global destruction etc.
5151 This function should only be called when REFCNT is zero. Most of the time
5152 you'll want to call C<sv_free()> (or its macro wrapper C<SvREFCNT_dec>)
5159 Perl_sv_clear(pTHX_ register SV *sv)
5163 assert(SvREFCNT(sv) == 0);
5166 if (PL_defstash) { /* Still have a symbol table? */
5171 Zero(&tmpref, 1, SV);
5172 sv_upgrade(&tmpref, SVt_RV);
5174 SvREADONLY_on(&tmpref); /* DESTROY() could be naughty */
5175 SvREFCNT(&tmpref) = 1;
5178 stash = SvSTASH(sv);
5179 destructor = StashHANDLER(stash,DESTROY);
5182 PUSHSTACKi(PERLSI_DESTROY);
5183 SvRV(&tmpref) = SvREFCNT_inc(sv);
5188 call_sv((SV*)destructor, G_DISCARD|G_EVAL|G_KEEPERR|G_VOID);
5194 } while (SvOBJECT(sv) && SvSTASH(sv) != stash);
5196 del_XRV(SvANY(&tmpref));
5199 if (PL_in_clean_objs)
5200 Perl_croak(aTHX_ "DESTROY created new reference to dead object '%s'",
5202 /* DESTROY gave object new lease on life */
5208 SvREFCNT_dec(SvSTASH(sv)); /* possibly of changed persuasion */
5209 SvOBJECT_off(sv); /* Curse the object. */
5210 if (SvTYPE(sv) != SVt_PVIO)
5211 --PL_sv_objcount; /* XXX Might want something more general */
5214 if (SvTYPE(sv) >= SVt_PVMG) {
5217 if (SvFLAGS(sv) & SVpad_TYPED)
5218 SvREFCNT_dec(SvSTASH(sv));
5221 switch (SvTYPE(sv)) {
5224 IoIFP(sv) != PerlIO_stdin() &&
5225 IoIFP(sv) != PerlIO_stdout() &&
5226 IoIFP(sv) != PerlIO_stderr())
5228 io_close((IO*)sv, FALSE);
5230 if (IoDIRP(sv) && !(IoFLAGS(sv) & IOf_FAKE_DIRP))
5231 PerlDir_close(IoDIRP(sv));
5232 IoDIRP(sv) = (DIR*)NULL;
5233 Safefree(IoTOP_NAME(sv));
5234 Safefree(IoFMT_NAME(sv));
5235 Safefree(IoBOTTOM_NAME(sv));
5250 SvREFCNT_dec(LvTARG(sv));
5254 Safefree(GvNAME(sv));
5255 /* cannot decrease stash refcount yet, as we might recursively delete
5256 ourselves when the refcnt drops to zero. Delay SvREFCNT_dec
5257 of stash until current sv is completely gone.
5258 -- JohnPC, 27 Mar 1998 */
5259 stash = GvSTASH(sv);
5265 (void)SvOOK_off(sv);
5273 SvREFCNT_dec(SvRV(sv));
5275 #ifdef PERL_COPY_ON_WRITE
5276 else if (SvPVX(sv)) {
5278 /* I believe I need to grab the global SV mutex here and
5279 then recheck the COW status. */
5281 PerlIO_printf(Perl_debug_log, "Copy on write: clear\n");
5284 sv_release_COW(sv, SvPVX(sv), SvCUR(sv), SvLEN(sv),
5285 SvUVX(sv), SV_COW_NEXT_SV(sv));
5286 /* And drop it here. */
5288 } else if (SvLEN(sv)) {
5289 Safefree(SvPVX(sv));
5293 else if (SvPVX(sv) && SvLEN(sv))
5294 Safefree(SvPVX(sv));
5295 else if (SvPVX(sv) && SvREADONLY(sv) && SvFAKE(sv)) {
5296 unsharepvn(SvPVX(sv),
5297 SvUTF8(sv) ? -(I32)SvCUR(sv) : SvCUR(sv),
5311 switch (SvTYPE(sv)) {
5327 del_XPVIV(SvANY(sv));
5330 del_XPVNV(SvANY(sv));
5333 del_XPVMG(SvANY(sv));
5336 del_XPVLV(SvANY(sv));
5339 del_XPVAV(SvANY(sv));
5342 del_XPVHV(SvANY(sv));
5345 del_XPVCV(SvANY(sv));
5348 del_XPVGV(SvANY(sv));
5349 /* code duplication for increased performance. */
5350 SvFLAGS(sv) &= SVf_BREAK;
5351 SvFLAGS(sv) |= SVTYPEMASK;
5352 /* decrease refcount of the stash that owns this GV, if any */
5354 SvREFCNT_dec(stash);
5355 return; /* not break, SvFLAGS reset already happened */
5357 del_XPVBM(SvANY(sv));
5360 del_XPVFM(SvANY(sv));
5363 del_XPVIO(SvANY(sv));
5366 SvFLAGS(sv) &= SVf_BREAK;
5367 SvFLAGS(sv) |= SVTYPEMASK;
5371 =for apidoc sv_newref
5373 Increment an SV's reference count. Use the C<SvREFCNT_inc()> wrapper
5380 Perl_sv_newref(pTHX_ SV *sv)
5383 ATOMIC_INC(SvREFCNT(sv));
5390 Decrement an SV's reference count, and if it drops to zero, call
5391 C<sv_clear> to invoke destructors and free up any memory used by
5392 the body; finally, deallocate the SV's head itself.
5393 Normally called via a wrapper macro C<SvREFCNT_dec>.
5399 Perl_sv_free(pTHX_ SV *sv)
5401 int refcount_is_zero;
5405 if (SvREFCNT(sv) == 0) {
5406 if (SvFLAGS(sv) & SVf_BREAK)
5407 /* this SV's refcnt has been artificially decremented to
5408 * trigger cleanup */
5410 if (PL_in_clean_all) /* All is fair */
5412 if (SvREADONLY(sv) && SvIMMORTAL(sv)) {
5413 /* make sure SvREFCNT(sv)==0 happens very seldom */
5414 SvREFCNT(sv) = (~(U32)0)/2;
5417 if (ckWARN_d(WARN_INTERNAL))
5418 Perl_warner(aTHX_ packWARN(WARN_INTERNAL), "Attempt to free unreferenced scalar");
5421 ATOMIC_DEC_AND_TEST(refcount_is_zero, SvREFCNT(sv));
5422 if (!refcount_is_zero)
5426 if (ckWARN_d(WARN_DEBUGGING))
5427 Perl_warner(aTHX_ packWARN(WARN_DEBUGGING),
5428 "Attempt to free temp prematurely: SV 0x%"UVxf,
5433 if (SvREADONLY(sv) && SvIMMORTAL(sv)) {
5434 /* make sure SvREFCNT(sv)==0 happens very seldom */
5435 SvREFCNT(sv) = (~(U32)0)/2;
5446 Returns the length of the string in the SV. Handles magic and type
5447 coercion. See also C<SvCUR>, which gives raw access to the xpv_cur slot.
5453 Perl_sv_len(pTHX_ register SV *sv)
5461 len = mg_length(sv);
5463 (void)SvPV(sv, len);
5468 =for apidoc sv_len_utf8
5470 Returns the number of characters in the string in an SV, counting wide
5471 UTF8 bytes as a single character. Handles magic and type coercion.
5477 Perl_sv_len_utf8(pTHX_ register SV *sv)
5483 return mg_length(sv);
5487 U8 *s = (U8*)SvPV(sv, len);
5489 return Perl_utf8_length(aTHX_ s, s + len);
5494 =for apidoc sv_pos_u2b
5496 Converts the value pointed to by offsetp from a count of UTF8 chars from
5497 the start of the string, to a count of the equivalent number of bytes; if
5498 lenp is non-zero, it does the same to lenp, but this time starting from
5499 the offset, rather than from the start of the string. Handles magic and
5506 Perl_sv_pos_u2b(pTHX_ register SV *sv, I32* offsetp, I32* lenp)
5511 I32 uoffset = *offsetp;
5517 start = s = (U8*)SvPV(sv, len);
5519 while (s < send && uoffset--)
5523 *offsetp = s - start;
5527 while (s < send && ulen--)
5537 =for apidoc sv_pos_b2u
5539 Converts the value pointed to by offsetp from a count of bytes from the
5540 start of the string, to a count of the equivalent number of UTF8 chars.
5541 Handles magic and type coercion.
5547 Perl_sv_pos_b2u(pTHX_ register SV *sv, I32* offsetp)
5556 s = (U8*)SvPV(sv, len);
5557 if ((I32)len < *offsetp)
5558 Perl_croak(aTHX_ "panic: sv_pos_b2u: bad byte offset");
5559 send = s + *offsetp;
5563 /* Call utf8n_to_uvchr() to validate the sequence
5564 * (unless a simple non-UTF character) */
5565 if (!UTF8_IS_INVARIANT(*s))
5566 utf8n_to_uvchr(s, UTF8SKIP(s), &n, 0);
5581 Returns a boolean indicating whether the strings in the two SVs are
5582 identical. Is UTF-8 and 'use bytes' aware, handles get magic, and will
5583 coerce its args to strings if necessary.
5589 Perl_sv_eq(pTHX_ register SV *sv1, register SV *sv2)
5597 SV* svrecode = Nullsv;
5604 pv1 = SvPV(sv1, cur1);
5611 pv2 = SvPV(sv2, cur2);
5613 if (cur1 && cur2 && SvUTF8(sv1) != SvUTF8(sv2) && !IN_BYTES) {
5614 /* Differing utf8ness.
5615 * Do not UTF8size the comparands as a side-effect. */
5618 svrecode = newSVpvn(pv2, cur2);
5619 sv_recode_to_utf8(svrecode, PL_encoding);
5620 pv2 = SvPV(svrecode, cur2);
5623 svrecode = newSVpvn(pv1, cur1);
5624 sv_recode_to_utf8(svrecode, PL_encoding);
5625 pv1 = SvPV(svrecode, cur1);
5627 /* Now both are in UTF-8. */
5632 bool is_utf8 = TRUE;
5635 /* sv1 is the UTF-8 one,
5636 * if is equal it must be downgrade-able */
5637 char *pv = (char*)bytes_from_utf8((U8*)pv1,
5643 /* sv2 is the UTF-8 one,
5644 * if is equal it must be downgrade-able */
5645 char *pv = (char *)bytes_from_utf8((U8*)pv2,
5651 /* Downgrade not possible - cannot be eq */
5658 eq = (pv1 == pv2) || memEQ(pv1, pv2, cur1);
5661 SvREFCNT_dec(svrecode);
5672 Compares the strings in two SVs. Returns -1, 0, or 1 indicating whether the
5673 string in C<sv1> is less than, equal to, or greater than the string in
5674 C<sv2>. Is UTF-8 and 'use bytes' aware, handles get magic, and will
5675 coerce its args to strings if necessary. See also C<sv_cmp_locale>.
5681 Perl_sv_cmp(pTHX_ register SV *sv1, register SV *sv2)
5684 char *pv1, *pv2, *tpv = Nullch;
5686 SV *svrecode = Nullsv;
5693 pv1 = SvPV(sv1, cur1);
5700 pv2 = SvPV(sv2, cur2);
5702 if (cur1 && cur2 && SvUTF8(sv1) != SvUTF8(sv2) && !IN_BYTES) {
5703 /* Differing utf8ness.
5704 * Do not UTF8size the comparands as a side-effect. */
5707 svrecode = newSVpvn(pv2, cur2);
5708 sv_recode_to_utf8(svrecode, PL_encoding);
5709 pv2 = SvPV(svrecode, cur2);
5712 pv2 = tpv = (char*)bytes_to_utf8((U8*)pv2, &cur2);
5717 svrecode = newSVpvn(pv1, cur1);
5718 sv_recode_to_utf8(svrecode, PL_encoding);
5719 pv1 = SvPV(svrecode, cur1);
5722 pv1 = tpv = (char*)bytes_to_utf8((U8*)pv1, &cur1);
5728 cmp = cur2 ? -1 : 0;
5732 I32 retval = memcmp((void*)pv1, (void*)pv2, cur1 < cur2 ? cur1 : cur2);
5735 cmp = retval < 0 ? -1 : 1;
5736 } else if (cur1 == cur2) {
5739 cmp = cur1 < cur2 ? -1 : 1;
5744 SvREFCNT_dec(svrecode);
5753 =for apidoc sv_cmp_locale
5755 Compares the strings in two SVs in a locale-aware manner. Is UTF-8 and
5756 'use bytes' aware, handles get magic, and will coerce its args to strings
5757 if necessary. See also C<sv_cmp_locale>. See also C<sv_cmp>.
5763 Perl_sv_cmp_locale(pTHX_ register SV *sv1, register SV *sv2)
5765 #ifdef USE_LOCALE_COLLATE
5771 if (PL_collation_standard)
5775 pv1 = sv1 ? sv_collxfrm(sv1, &len1) : (char *) NULL;
5777 pv2 = sv2 ? sv_collxfrm(sv2, &len2) : (char *) NULL;
5779 if (!pv1 || !len1) {
5790 retval = memcmp((void*)pv1, (void*)pv2, len1 < len2 ? len1 : len2);
5793 return retval < 0 ? -1 : 1;
5796 * When the result of collation is equality, that doesn't mean
5797 * that there are no differences -- some locales exclude some
5798 * characters from consideration. So to avoid false equalities,
5799 * we use the raw string as a tiebreaker.
5805 #endif /* USE_LOCALE_COLLATE */
5807 return sv_cmp(sv1, sv2);
5811 #ifdef USE_LOCALE_COLLATE
5814 =for apidoc sv_collxfrm
5816 Add Collate Transform magic to an SV if it doesn't already have it.
5818 Any scalar variable may carry PERL_MAGIC_collxfrm magic that contains the
5819 scalar data of the variable, but transformed to such a format that a normal
5820 memory comparison can be used to compare the data according to the locale
5827 Perl_sv_collxfrm(pTHX_ SV *sv, STRLEN *nxp)
5831 mg = SvMAGICAL(sv) ? mg_find(sv, PERL_MAGIC_collxfrm) : (MAGIC *) NULL;
5832 if (!mg || !mg->mg_ptr || *(U32*)mg->mg_ptr != PL_collation_ix) {
5837 Safefree(mg->mg_ptr);
5839 if ((xf = mem_collxfrm(s, len, &xlen))) {
5840 if (SvREADONLY(sv)) {
5843 return xf + sizeof(PL_collation_ix);
5846 sv_magic(sv, 0, PERL_MAGIC_collxfrm, 0, 0);
5847 mg = mg_find(sv, PERL_MAGIC_collxfrm);
5860 if (mg && mg->mg_ptr) {
5862 return mg->mg_ptr + sizeof(PL_collation_ix);
5870 #endif /* USE_LOCALE_COLLATE */
5875 Get a line from the filehandle and store it into the SV, optionally
5876 appending to the currently-stored string.
5882 Perl_sv_gets(pTHX_ register SV *sv, register PerlIO *fp, I32 append)
5886 register STDCHAR rslast;
5887 register STDCHAR *bp;
5892 SV_CHECK_THINKFIRST_COW_DROP(sv);
5893 /* XXX. If you make this PVIV, then copy on write can copy scalars read
5895 However, perlbench says it's slower, because the existing swipe code
5896 is faster than copy on write.
5897 Swings and roundabouts. */
5898 (void)SvUPGRADE(sv, SVt_PV);
5902 if (PL_curcop == &PL_compiling) {
5903 /* we always read code in line mode */
5907 else if (RsSNARF(PL_rs)) {
5911 else if (RsRECORD(PL_rs)) {
5912 I32 recsize, bytesread;
5915 /* Grab the size of the record we're getting */
5916 recsize = SvIV(SvRV(PL_rs));
5917 (void)SvPOK_only(sv); /* Validate pointer */
5918 buffer = SvGROW(sv, (STRLEN)(recsize + 1));
5921 /* VMS wants read instead of fread, because fread doesn't respect */
5922 /* RMS record boundaries. This is not necessarily a good thing to be */
5923 /* doing, but we've got no other real choice */
5924 bytesread = PerlLIO_read(PerlIO_fileno(fp), buffer, recsize);
5926 bytesread = PerlIO_read(fp, buffer, recsize);
5928 SvCUR_set(sv, bytesread);
5929 buffer[bytesread] = '\0';
5930 if (PerlIO_isutf8(fp))
5934 return(SvCUR(sv) ? SvPVX(sv) : Nullch);
5936 else if (RsPARA(PL_rs)) {
5942 /* Get $/ i.e. PL_rs into same encoding as stream wants */
5943 if (PerlIO_isutf8(fp)) {
5944 rsptr = SvPVutf8(PL_rs, rslen);
5947 if (SvUTF8(PL_rs)) {
5948 if (!sv_utf8_downgrade(PL_rs, TRUE)) {
5949 Perl_croak(aTHX_ "Wide character in $/");
5952 rsptr = SvPV(PL_rs, rslen);
5956 rslast = rslen ? rsptr[rslen - 1] : '\0';
5958 if (rspara) { /* have to do this both before and after */
5959 do { /* to make sure file boundaries work right */
5962 i = PerlIO_getc(fp);
5966 PerlIO_ungetc(fp,i);
5972 /* See if we know enough about I/O mechanism to cheat it ! */
5974 /* This used to be #ifdef test - it is made run-time test for ease
5975 of abstracting out stdio interface. One call should be cheap
5976 enough here - and may even be a macro allowing compile
5980 if (PerlIO_fast_gets(fp)) {
5983 * We're going to steal some values from the stdio struct
5984 * and put EVERYTHING in the innermost loop into registers.
5986 register STDCHAR *ptr;
5990 #if defined(VMS) && defined(PERLIO_IS_STDIO)
5991 /* An ungetc()d char is handled separately from the regular
5992 * buffer, so we getc() it back out and stuff it in the buffer.
5994 i = PerlIO_getc(fp);
5995 if (i == EOF) return 0;
5996 *(--((*fp)->_ptr)) = (unsigned char) i;
6000 /* Here is some breathtakingly efficient cheating */
6002 cnt = PerlIO_get_cnt(fp); /* get count into register */
6003 (void)SvPOK_only(sv); /* validate pointer */
6004 if ((I32)(SvLEN(sv) - append) <= cnt + 1) { /* make sure we have the room */
6005 if (cnt > 80 && (I32)SvLEN(sv) > append) {
6006 shortbuffered = cnt - SvLEN(sv) + append + 1;
6007 cnt -= shortbuffered;
6011 /* remember that cnt can be negative */
6012 SvGROW(sv, (STRLEN)(append + (cnt <= 0 ? 2 : (cnt + 1))));
6017 bp = (STDCHAR*)SvPVX(sv) + append; /* move these two too to registers */
6018 ptr = (STDCHAR*)PerlIO_get_ptr(fp);
6019 DEBUG_P(PerlIO_printf(Perl_debug_log,
6020 "Screamer: entering, ptr=%"UVuf", cnt=%ld\n",PTR2UV(ptr),(long)cnt));
6021 DEBUG_P(PerlIO_printf(Perl_debug_log,
6022 "Screamer: entering: PerlIO * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
6023 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
6024 PTR2UV(PerlIO_has_base(fp) ? PerlIO_get_base(fp) : 0)));
6029 while (cnt > 0) { /* this | eat */
6031 if ((*bp++ = *ptr++) == rslast) /* really | dust */
6032 goto thats_all_folks; /* screams | sed :-) */
6036 Copy(ptr, bp, cnt, char); /* this | eat */
6037 bp += cnt; /* screams | dust */
6038 ptr += cnt; /* louder | sed :-) */
6043 if (shortbuffered) { /* oh well, must extend */
6044 cnt = shortbuffered;
6046 bpx = bp - (STDCHAR*)SvPVX(sv); /* box up before relocation */
6048 SvGROW(sv, SvLEN(sv) + append + cnt + 2);
6049 bp = (STDCHAR*)SvPVX(sv) + bpx; /* unbox after relocation */
6053 DEBUG_P(PerlIO_printf(Perl_debug_log,
6054 "Screamer: going to getc, ptr=%"UVuf", cnt=%ld\n",
6055 PTR2UV(ptr),(long)cnt));
6056 PerlIO_set_ptrcnt(fp, (STDCHAR*)ptr, cnt); /* deregisterize cnt and ptr */
6058 DEBUG_P(PerlIO_printf(Perl_debug_log,
6059 "Screamer: pre: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
6060 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
6061 PTR2UV(PerlIO_has_base (fp) ? PerlIO_get_base(fp) : 0)));
6063 /* This used to call 'filbuf' in stdio form, but as that behaves like
6064 getc when cnt <= 0 we use PerlIO_getc here to avoid introducing
6065 another abstraction. */
6066 i = PerlIO_getc(fp); /* get more characters */
6068 DEBUG_P(PerlIO_printf(Perl_debug_log,
6069 "Screamer: post: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
6070 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
6071 PTR2UV(PerlIO_has_base (fp) ? PerlIO_get_base(fp) : 0)));
6073 cnt = PerlIO_get_cnt(fp);
6074 ptr = (STDCHAR*)PerlIO_get_ptr(fp); /* reregisterize cnt and ptr */
6075 DEBUG_P(PerlIO_printf(Perl_debug_log,
6076 "Screamer: after getc, ptr=%"UVuf", cnt=%ld\n",PTR2UV(ptr),(long)cnt));
6078 if (i == EOF) /* all done for ever? */
6079 goto thats_really_all_folks;
6081 bpx = bp - (STDCHAR*)SvPVX(sv); /* box up before relocation */
6083 SvGROW(sv, bpx + cnt + 2);
6084 bp = (STDCHAR*)SvPVX(sv) + bpx; /* unbox after relocation */
6086 *bp++ = (STDCHAR)i; /* store character from PerlIO_getc */
6088 if (rslen && (STDCHAR)i == rslast) /* all done for now? */
6089 goto thats_all_folks;
6093 if ((rslen > 1 && (STRLEN)(bp - (STDCHAR*)SvPVX(sv)) < rslen) ||
6094 memNE((char*)bp - rslen, rsptr, rslen))
6095 goto screamer; /* go back to the fray */
6096 thats_really_all_folks:
6098 cnt += shortbuffered;
6099 DEBUG_P(PerlIO_printf(Perl_debug_log,
6100 "Screamer: quitting, ptr=%"UVuf", cnt=%ld\n",PTR2UV(ptr),(long)cnt));
6101 PerlIO_set_ptrcnt(fp, (STDCHAR*)ptr, cnt); /* put these back or we're in trouble */
6102 DEBUG_P(PerlIO_printf(Perl_debug_log,
6103 "Screamer: end: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
6104 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
6105 PTR2UV(PerlIO_has_base (fp) ? PerlIO_get_base(fp) : 0)));
6107 SvCUR_set(sv, bp - (STDCHAR*)SvPVX(sv)); /* set length */
6108 DEBUG_P(PerlIO_printf(Perl_debug_log,
6109 "Screamer: done, len=%ld, string=|%.*s|\n",
6110 (long)SvCUR(sv),(int)SvCUR(sv),SvPVX(sv)));
6115 /*The big, slow, and stupid way */
6118 /* Need to work around EPOC SDK features */
6119 /* On WINS: MS VC5 generates calls to _chkstk, */
6120 /* if a `large' stack frame is allocated */
6121 /* gcc on MARM does not generate calls like these */
6127 register STDCHAR *bpe = buf + sizeof(buf);
6129 while ((i = PerlIO_getc(fp)) != EOF && (*bp++ = (STDCHAR)i) != rslast && bp < bpe)
6130 ; /* keep reading */
6134 cnt = PerlIO_read(fp,(char*)buf, sizeof(buf));
6135 /* Accomodate broken VAXC compiler, which applies U8 cast to
6136 * both args of ?: operator, causing EOF to change into 255
6139 i = (U8)buf[cnt - 1];
6145 cnt = 0; /* we do need to re-set the sv even when cnt <= 0 */
6147 sv_catpvn(sv, (char *) buf, cnt);
6149 sv_setpvn(sv, (char *) buf, cnt);
6151 if (i != EOF && /* joy */
6153 SvCUR(sv) < rslen ||
6154 memNE(SvPVX(sv) + SvCUR(sv) - rslen, rsptr, rslen)))
6158 * If we're reading from a TTY and we get a short read,
6159 * indicating that the user hit his EOF character, we need
6160 * to notice it now, because if we try to read from the TTY
6161 * again, the EOF condition will disappear.
6163 * The comparison of cnt to sizeof(buf) is an optimization
6164 * that prevents unnecessary calls to feof().
6168 if (!(cnt < sizeof(buf) && PerlIO_eof(fp)))
6173 if (rspara) { /* have to do this both before and after */
6174 while (i != EOF) { /* to make sure file boundaries work right */
6175 i = PerlIO_getc(fp);
6177 PerlIO_ungetc(fp,i);
6183 if (PerlIO_isutf8(fp))
6188 return (SvCUR(sv) - append) ? SvPVX(sv) : Nullch;
6194 Auto-increment of the value in the SV, doing string to numeric conversion
6195 if necessary. Handles 'get' magic.
6201 Perl_sv_inc(pTHX_ register SV *sv)
6210 if (SvTHINKFIRST(sv)) {
6212 sv_force_normal_flags(sv, 0);
6213 if (SvREADONLY(sv)) {
6214 if (PL_curcop != &PL_compiling)
6215 Perl_croak(aTHX_ PL_no_modify);
6219 if (SvAMAGIC(sv) && AMG_CALLun(sv,inc))
6221 i = PTR2IV(SvRV(sv));
6226 flags = SvFLAGS(sv);
6227 if ((flags & (SVp_NOK|SVp_IOK)) == SVp_NOK) {
6228 /* It's (privately or publicly) a float, but not tested as an
6229 integer, so test it to see. */
6231 flags = SvFLAGS(sv);
6233 if ((flags & SVf_IOK) || ((flags & (SVp_IOK | SVp_NOK)) == SVp_IOK)) {
6234 /* It's publicly an integer, or privately an integer-not-float */
6235 #ifdef PERL_PRESERVE_IVUV
6239 if (SvUVX(sv) == UV_MAX)
6240 sv_setnv(sv, UV_MAX_P1);
6242 (void)SvIOK_only_UV(sv);
6245 if (SvIVX(sv) == IV_MAX)
6246 sv_setuv(sv, (UV)IV_MAX + 1);
6248 (void)SvIOK_only(sv);
6254 if (flags & SVp_NOK) {
6255 (void)SvNOK_only(sv);
6260 if (!(flags & SVp_POK) || !*SvPVX(sv)) {
6261 if ((flags & SVTYPEMASK) < SVt_PVIV)
6262 sv_upgrade(sv, SVt_IV);
6263 (void)SvIOK_only(sv);
6268 while (isALPHA(*d)) d++;
6269 while (isDIGIT(*d)) d++;
6271 #ifdef PERL_PRESERVE_IVUV
6272 /* Got to punt this as an integer if needs be, but we don't issue
6273 warnings. Probably ought to make the sv_iv_please() that does
6274 the conversion if possible, and silently. */
6275 int numtype = grok_number(SvPVX(sv), SvCUR(sv), NULL);
6276 if (numtype && !(numtype & IS_NUMBER_INFINITY)) {
6277 /* Need to try really hard to see if it's an integer.
6278 9.22337203685478e+18 is an integer.
6279 but "9.22337203685478e+18" + 0 is UV=9223372036854779904
6280 so $a="9.22337203685478e+18"; $a+0; $a++
6281 needs to be the same as $a="9.22337203685478e+18"; $a++
6288 /* sv_2iv *should* have made this an NV */
6289 if (flags & SVp_NOK) {
6290 (void)SvNOK_only(sv);
6294 /* I don't think we can get here. Maybe I should assert this
6295 And if we do get here I suspect that sv_setnv will croak. NWC
6297 #if defined(USE_LONG_DOUBLE)
6298 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",
6299 SvPVX(sv), SvIVX(sv), SvNVX(sv)));
6301 DEBUG_c(PerlIO_printf(Perl_debug_log,"sv_inc punt failed to convert '%s' to IOK or NOKp, UV=0x%"UVxf" NV=%"NVgf"\n",
6302 SvPVX(sv), SvIVX(sv), SvNVX(sv)));
6305 #endif /* PERL_PRESERVE_IVUV */
6306 sv_setnv(sv,Atof(SvPVX(sv)) + 1.0);
6310 while (d >= SvPVX(sv)) {
6318 /* MKS: The original code here died if letters weren't consecutive.
6319 * at least it didn't have to worry about non-C locales. The
6320 * new code assumes that ('z'-'a')==('Z'-'A'), letters are
6321 * arranged in order (although not consecutively) and that only
6322 * [A-Za-z] are accepted by isALPHA in the C locale.
6324 if (*d != 'z' && *d != 'Z') {
6325 do { ++*d; } while (!isALPHA(*d));
6328 *(d--) -= 'z' - 'a';
6333 *(d--) -= 'z' - 'a' + 1;
6337 /* oh,oh, the number grew */
6338 SvGROW(sv, SvCUR(sv) + 2);
6340 for (d = SvPVX(sv) + SvCUR(sv); d > SvPVX(sv); d--)
6351 Auto-decrement of the value in the SV, doing string to numeric conversion
6352 if necessary. Handles 'get' magic.
6358 Perl_sv_dec(pTHX_ register SV *sv)
6366 if (SvTHINKFIRST(sv)) {
6368 sv_force_normal_flags(sv, 0);
6369 if (SvREADONLY(sv)) {
6370 if (PL_curcop != &PL_compiling)
6371 Perl_croak(aTHX_ PL_no_modify);
6375 if (SvAMAGIC(sv) && AMG_CALLun(sv,dec))
6377 i = PTR2IV(SvRV(sv));
6382 /* Unlike sv_inc we don't have to worry about string-never-numbers
6383 and keeping them magic. But we mustn't warn on punting */
6384 flags = SvFLAGS(sv);
6385 if ((flags & SVf_IOK) || ((flags & (SVp_IOK | SVp_NOK)) == SVp_IOK)) {
6386 /* It's publicly an integer, or privately an integer-not-float */
6387 #ifdef PERL_PRESERVE_IVUV
6391 if (SvUVX(sv) == 0) {
6392 (void)SvIOK_only(sv);
6396 (void)SvIOK_only_UV(sv);
6400 if (SvIVX(sv) == IV_MIN)
6401 sv_setnv(sv, (NV)IV_MIN - 1.0);
6403 (void)SvIOK_only(sv);
6409 if (flags & SVp_NOK) {
6411 (void)SvNOK_only(sv);
6414 if (!(flags & SVp_POK)) {
6415 if ((flags & SVTYPEMASK) < SVt_PVNV)
6416 sv_upgrade(sv, SVt_NV);
6418 (void)SvNOK_only(sv);
6421 #ifdef PERL_PRESERVE_IVUV
6423 int numtype = grok_number(SvPVX(sv), SvCUR(sv), NULL);
6424 if (numtype && !(numtype & IS_NUMBER_INFINITY)) {
6425 /* Need to try really hard to see if it's an integer.
6426 9.22337203685478e+18 is an integer.
6427 but "9.22337203685478e+18" + 0 is UV=9223372036854779904
6428 so $a="9.22337203685478e+18"; $a+0; $a--
6429 needs to be the same as $a="9.22337203685478e+18"; $a--
6436 /* sv_2iv *should* have made this an NV */
6437 if (flags & SVp_NOK) {
6438 (void)SvNOK_only(sv);
6442 /* I don't think we can get here. Maybe I should assert this
6443 And if we do get here I suspect that sv_setnv will croak. NWC
6445 #if defined(USE_LONG_DOUBLE)
6446 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",
6447 SvPVX(sv), SvIVX(sv), SvNVX(sv)));
6449 DEBUG_c(PerlIO_printf(Perl_debug_log,"sv_dec punt failed to convert '%s' to IOK or NOKp, UV=0x%"UVxf" NV=%"NVgf"\n",
6450 SvPVX(sv), SvIVX(sv), SvNVX(sv)));
6454 #endif /* PERL_PRESERVE_IVUV */
6455 sv_setnv(sv,Atof(SvPVX(sv)) - 1.0); /* punt */
6459 =for apidoc sv_mortalcopy
6461 Creates a new SV which is a copy of the original SV (using C<sv_setsv>).
6462 The new SV is marked as mortal. It will be destroyed "soon", either by an
6463 explicit call to FREETMPS, or by an implicit call at places such as
6464 statement boundaries. See also C<sv_newmortal> and C<sv_2mortal>.
6469 /* Make a string that will exist for the duration of the expression
6470 * evaluation. Actually, it may have to last longer than that, but
6471 * hopefully we won't free it until it has been assigned to a
6472 * permanent location. */
6475 Perl_sv_mortalcopy(pTHX_ SV *oldstr)
6480 sv_setsv(sv,oldstr);
6482 PL_tmps_stack[++PL_tmps_ix] = sv;
6488 =for apidoc sv_newmortal
6490 Creates a new null SV which is mortal. The reference count of the SV is
6491 set to 1. It will be destroyed "soon", either by an explicit call to
6492 FREETMPS, or by an implicit call at places such as statement boundaries.
6493 See also C<sv_mortalcopy> and C<sv_2mortal>.
6499 Perl_sv_newmortal(pTHX)
6504 SvFLAGS(sv) = SVs_TEMP;
6506 PL_tmps_stack[++PL_tmps_ix] = sv;
6511 =for apidoc sv_2mortal
6513 Marks an existing SV as mortal. The SV will be destroyed "soon", either
6514 by an explicit call to FREETMPS, or by an implicit call at places such as
6515 statement boundaries. See also C<sv_newmortal> and C<sv_mortalcopy>.
6521 Perl_sv_2mortal(pTHX_ register SV *sv)
6525 if (SvREADONLY(sv) && SvIMMORTAL(sv))
6528 PL_tmps_stack[++PL_tmps_ix] = sv;
6536 Creates a new SV and copies a string into it. The reference count for the
6537 SV is set to 1. If C<len> is zero, Perl will compute the length using
6538 strlen(). For efficiency, consider using C<newSVpvn> instead.
6544 Perl_newSVpv(pTHX_ const char *s, STRLEN len)
6551 sv_setpvn(sv,s,len);
6556 =for apidoc newSVpvn
6558 Creates a new SV and copies a string into it. The reference count for the
6559 SV is set to 1. Note that if C<len> is zero, Perl will create a zero length
6560 string. You are responsible for ensuring that the source string is at least
6567 Perl_newSVpvn(pTHX_ const char *s, STRLEN len)
6572 sv_setpvn(sv,s,len);
6577 =for apidoc newSVpvn_share
6579 Creates a new SV with its SvPVX pointing to a shared string in the string
6580 table. If the string does not already exist in the table, it is created
6581 first. Turns on READONLY and FAKE. The string's hash is stored in the UV
6582 slot of the SV; if the C<hash> parameter is non-zero, that value is used;
6583 otherwise the hash is computed. The idea here is that as the string table
6584 is used for shared hash keys these strings will have SvPVX == HeKEY and
6585 hash lookup will avoid string compare.
6591 Perl_newSVpvn_share(pTHX_ const char *src, I32 len, U32 hash)
6594 bool is_utf8 = FALSE;
6596 STRLEN tmplen = -len;
6598 /* See the note in hv.c:hv_fetch() --jhi */
6599 src = (char*)bytes_from_utf8((U8*)src, &tmplen, &is_utf8);
6603 PERL_HASH(hash, src, len);
6605 sv_upgrade(sv, SVt_PVIV);
6606 SvPVX(sv) = sharepvn(src, is_utf8?-len:len, hash);
6619 #if defined(PERL_IMPLICIT_CONTEXT)
6621 /* pTHX_ magic can't cope with varargs, so this is a no-context
6622 * version of the main function, (which may itself be aliased to us).
6623 * Don't access this version directly.
6627 Perl_newSVpvf_nocontext(const char* pat, ...)
6632 va_start(args, pat);
6633 sv = vnewSVpvf(pat, &args);
6640 =for apidoc newSVpvf
6642 Creates a new SV and initializes it with the string formatted like
6649 Perl_newSVpvf(pTHX_ const char* pat, ...)
6653 va_start(args, pat);
6654 sv = vnewSVpvf(pat, &args);
6659 /* backend for newSVpvf() and newSVpvf_nocontext() */
6662 Perl_vnewSVpvf(pTHX_ const char* pat, va_list* args)
6666 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
6673 Creates a new SV and copies a floating point value into it.
6674 The reference count for the SV is set to 1.
6680 Perl_newSVnv(pTHX_ NV n)
6692 Creates a new SV and copies an integer into it. The reference count for the
6699 Perl_newSViv(pTHX_ IV i)
6711 Creates a new SV and copies an unsigned integer into it.
6712 The reference count for the SV is set to 1.
6718 Perl_newSVuv(pTHX_ UV u)
6728 =for apidoc newRV_noinc
6730 Creates an RV wrapper for an SV. The reference count for the original
6731 SV is B<not> incremented.
6737 Perl_newRV_noinc(pTHX_ SV *tmpRef)
6742 sv_upgrade(sv, SVt_RV);
6749 /* newRV_inc is the official function name to use now.
6750 * newRV_inc is in fact #defined to newRV in sv.h
6754 Perl_newRV(pTHX_ SV *tmpRef)
6756 return newRV_noinc(SvREFCNT_inc(tmpRef));
6762 Creates a new SV which is an exact duplicate of the original SV.
6769 Perl_newSVsv(pTHX_ register SV *old)
6775 if (SvTYPE(old) == SVTYPEMASK) {
6776 if (ckWARN_d(WARN_INTERNAL))
6777 Perl_warner(aTHX_ packWARN(WARN_INTERNAL), "semi-panic: attempt to dup freed string");
6792 =for apidoc sv_reset
6794 Underlying implementation for the C<reset> Perl function.
6795 Note that the perl-level function is vaguely deprecated.
6801 Perl_sv_reset(pTHX_ register char *s, HV *stash)
6809 char todo[PERL_UCHAR_MAX+1];
6814 if (!*s) { /* reset ?? searches */
6815 for (pm = HvPMROOT(stash); pm; pm = pm->op_pmnext) {
6816 pm->op_pmdynflags &= ~PMdf_USED;
6821 /* reset variables */
6823 if (!HvARRAY(stash))
6826 Zero(todo, 256, char);
6828 i = (unsigned char)*s;
6832 max = (unsigned char)*s++;
6833 for ( ; i <= max; i++) {
6836 for (i = 0; i <= (I32) HvMAX(stash); i++) {
6837 for (entry = HvARRAY(stash)[i];
6839 entry = HeNEXT(entry))
6841 if (!todo[(U8)*HeKEY(entry)])
6843 gv = (GV*)HeVAL(entry);
6845 if (SvTHINKFIRST(sv)) {
6846 if (!SvREADONLY(sv) && SvROK(sv))
6851 if (SvTYPE(sv) >= SVt_PV) {
6853 if (SvPVX(sv) != Nullch)
6860 if (GvHV(gv) && !HvNAME(GvHV(gv))) {
6862 #ifdef USE_ENVIRON_ARRAY
6864 # ifdef USE_ITHREADS
6865 && PL_curinterp == aTHX
6869 environ[0] = Nullch;
6881 Using various gambits, try to get an IO from an SV: the IO slot if its a
6882 GV; or the recursive result if we're an RV; or the IO slot of the symbol
6883 named after the PV if we're a string.
6889 Perl_sv_2io(pTHX_ SV *sv)
6895 switch (SvTYPE(sv)) {
6903 Perl_croak(aTHX_ "Bad filehandle: %s", GvNAME(gv));
6907 Perl_croak(aTHX_ PL_no_usym, "filehandle");
6909 return sv_2io(SvRV(sv));
6910 gv = gv_fetchpv(SvPV(sv,n_a), FALSE, SVt_PVIO);
6916 Perl_croak(aTHX_ "Bad filehandle: %s", SvPV(sv,n_a));
6925 Using various gambits, try to get a CV from an SV; in addition, try if
6926 possible to set C<*st> and C<*gvp> to the stash and GV associated with it.
6932 Perl_sv_2cv(pTHX_ SV *sv, HV **st, GV **gvp, I32 lref)
6939 return *gvp = Nullgv, Nullcv;
6940 switch (SvTYPE(sv)) {
6959 SV **sp = &sv; /* Used in tryAMAGICunDEREF macro. */
6960 tryAMAGICunDEREF(to_cv);
6963 if (SvTYPE(sv) == SVt_PVCV) {
6972 Perl_croak(aTHX_ "Not a subroutine reference");
6977 gv = gv_fetchpv(SvPV(sv, n_a), lref, SVt_PVCV);
6983 if (lref && !GvCVu(gv)) {
6986 tmpsv = NEWSV(704,0);
6987 gv_efullname3(tmpsv, gv, Nullch);
6988 /* XXX this is probably not what they think they're getting.
6989 * It has the same effect as "sub name;", i.e. just a forward
6991 newSUB(start_subparse(FALSE, 0),
6992 newSVOP(OP_CONST, 0, tmpsv),
6997 Perl_croak(aTHX_ "Unable to create sub named \"%s\"", SvPV(sv,n_a));
7006 Returns true if the SV has a true value by Perl's rules.
7007 Use the C<SvTRUE> macro instead, which may call C<sv_true()> or may
7008 instead use an in-line version.
7014 Perl_sv_true(pTHX_ register SV *sv)
7020 if ((tXpv = (XPV*)SvANY(sv)) &&
7021 (tXpv->xpv_cur > 1 ||
7022 (tXpv->xpv_cur && *tXpv->xpv_pv != '0')))
7029 return SvIVX(sv) != 0;
7032 return SvNVX(sv) != 0.0;
7034 return sv_2bool(sv);
7042 A private implementation of the C<SvIVx> macro for compilers which can't
7043 cope with complex macro expressions. Always use the macro instead.
7049 Perl_sv_iv(pTHX_ register SV *sv)
7053 return (IV)SvUVX(sv);
7062 A private implementation of the C<SvUVx> macro for compilers which can't
7063 cope with complex macro expressions. Always use the macro instead.
7069 Perl_sv_uv(pTHX_ register SV *sv)
7074 return (UV)SvIVX(sv);
7082 A private implementation of the C<SvNVx> macro for compilers which can't
7083 cope with complex macro expressions. Always use the macro instead.
7089 Perl_sv_nv(pTHX_ register SV *sv)
7099 Use the C<SvPV_nolen> macro instead
7103 A private implementation of the C<SvPV> macro for compilers which can't
7104 cope with complex macro expressions. Always use the macro instead.
7110 Perl_sv_pvn(pTHX_ SV *sv, STRLEN *lp)
7116 return sv_2pv(sv, lp);
7121 Perl_sv_pvn_nomg(pTHX_ register SV *sv, STRLEN *lp)
7127 return sv_2pv_flags(sv, lp, 0);
7131 =for apidoc sv_pvn_force
7133 Get a sensible string out of the SV somehow.
7134 A private implementation of the C<SvPV_force> macro for compilers which
7135 can't cope with complex macro expressions. Always use the macro instead.
7137 =for apidoc sv_pvn_force_flags
7139 Get a sensible string out of the SV somehow.
7140 If C<flags> has C<SV_GMAGIC> bit set, will C<mg_get> on C<sv> if
7141 appropriate, else not. C<sv_pvn_force> and C<sv_pvn_force_nomg> are
7142 implemented in terms of this function.
7143 You normally want to use the various wrapper macros instead: see
7144 C<SvPV_force> and C<SvPV_force_nomg>
7150 Perl_sv_pvn_force_flags(pTHX_ SV *sv, STRLEN *lp, I32 flags)
7154 if (SvTHINKFIRST(sv) && !SvROK(sv))
7155 sv_force_normal_flags(sv, 0);
7161 if (SvTYPE(sv) > SVt_PVLV && SvTYPE(sv) != SVt_PVFM) {
7162 Perl_croak(aTHX_ "Can't coerce %s to string in %s", sv_reftype(sv,0),
7166 s = sv_2pv_flags(sv, lp, flags);
7167 if (s != SvPVX(sv)) { /* Almost, but not quite, sv_setpvn() */
7172 (void)SvUPGRADE(sv, SVt_PV); /* Never FALSE */
7173 SvGROW(sv, len + 1);
7174 Move(s,SvPVX(sv),len,char);
7179 SvPOK_on(sv); /* validate pointer */
7181 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2pv(%s)\n",
7182 PTR2UV(sv),SvPVX(sv)));
7189 =for apidoc sv_pvbyte
7191 Use C<SvPVbyte_nolen> instead.
7193 =for apidoc sv_pvbyten
7195 A private implementation of the C<SvPVbyte> macro for compilers
7196 which can't cope with complex macro expressions. Always use the macro
7203 Perl_sv_pvbyten(pTHX_ SV *sv, STRLEN *lp)
7205 sv_utf8_downgrade(sv,0);
7206 return sv_pvn(sv,lp);
7210 =for apidoc sv_pvbyten_force
7212 A private implementation of the C<SvPVbytex_force> macro for compilers
7213 which can't cope with complex macro expressions. Always use the macro
7220 Perl_sv_pvbyten_force(pTHX_ SV *sv, STRLEN *lp)
7222 sv_utf8_downgrade(sv,0);
7223 return sv_pvn_force(sv,lp);
7227 =for apidoc sv_pvutf8
7229 Use the C<SvPVutf8_nolen> macro instead
7231 =for apidoc sv_pvutf8n
7233 A private implementation of the C<SvPVutf8> macro for compilers
7234 which can't cope with complex macro expressions. Always use the macro
7241 Perl_sv_pvutf8n(pTHX_ SV *sv, STRLEN *lp)
7243 sv_utf8_upgrade(sv);
7244 return sv_pvn(sv,lp);
7248 =for apidoc sv_pvutf8n_force
7250 A private implementation of the C<SvPVutf8_force> macro for compilers
7251 which can't cope with complex macro expressions. Always use the macro
7258 Perl_sv_pvutf8n_force(pTHX_ SV *sv, STRLEN *lp)
7260 sv_utf8_upgrade(sv);
7261 return sv_pvn_force(sv,lp);
7265 =for apidoc sv_reftype
7267 Returns a string describing what the SV is a reference to.
7273 Perl_sv_reftype(pTHX_ SV *sv, int ob)
7275 if (ob && SvOBJECT(sv)) {
7276 return HvNAME(SvSTASH(sv));
7279 switch (SvTYPE(sv)) {
7295 case SVt_PVLV: return "LVALUE";
7296 case SVt_PVAV: return "ARRAY";
7297 case SVt_PVHV: return "HASH";
7298 case SVt_PVCV: return "CODE";
7299 case SVt_PVGV: return "GLOB";
7300 case SVt_PVFM: return "FORMAT";
7301 case SVt_PVIO: return "IO";
7302 default: return "UNKNOWN";
7308 =for apidoc sv_isobject
7310 Returns a boolean indicating whether the SV is an RV pointing to a blessed
7311 object. If the SV is not an RV, or if the object is not blessed, then this
7318 Perl_sv_isobject(pTHX_ SV *sv)
7335 Returns a boolean indicating whether the SV is blessed into the specified
7336 class. This does not check for subtypes; use C<sv_derived_from> to verify
7337 an inheritance relationship.
7343 Perl_sv_isa(pTHX_ SV *sv, const char *name)
7355 return strEQ(HvNAME(SvSTASH(sv)), name);
7361 Creates a new SV for the RV, C<rv>, to point to. If C<rv> is not an RV then
7362 it will be upgraded to one. If C<classname> is non-null then the new SV will
7363 be blessed in the specified package. The new SV is returned and its
7364 reference count is 1.
7370 Perl_newSVrv(pTHX_ SV *rv, const char *classname)
7376 SV_CHECK_THINKFIRST_COW_DROP(rv);
7379 if (SvTYPE(rv) >= SVt_PVMG) {
7380 U32 refcnt = SvREFCNT(rv);
7384 SvREFCNT(rv) = refcnt;
7387 if (SvTYPE(rv) < SVt_RV)
7388 sv_upgrade(rv, SVt_RV);
7389 else if (SvTYPE(rv) > SVt_RV) {
7390 (void)SvOOK_off(rv);
7391 if (SvPVX(rv) && SvLEN(rv))
7392 Safefree(SvPVX(rv));
7402 HV* stash = gv_stashpv(classname, TRUE);
7403 (void)sv_bless(rv, stash);
7409 =for apidoc sv_setref_pv
7411 Copies a pointer into a new SV, optionally blessing the SV. The C<rv>
7412 argument will be upgraded to an RV. That RV will be modified to point to
7413 the new SV. If the C<pv> argument is NULL then C<PL_sv_undef> will be placed
7414 into the SV. The C<classname> argument indicates the package for the
7415 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
7416 will be returned and will have a reference count of 1.
7418 Do not use with other Perl types such as HV, AV, SV, CV, because those
7419 objects will become corrupted by the pointer copy process.
7421 Note that C<sv_setref_pvn> copies the string while this copies the pointer.
7427 Perl_sv_setref_pv(pTHX_ SV *rv, const char *classname, void *pv)
7430 sv_setsv(rv, &PL_sv_undef);
7434 sv_setiv(newSVrv(rv,classname), PTR2IV(pv));
7439 =for apidoc sv_setref_iv
7441 Copies an integer into a new SV, optionally blessing the SV. The C<rv>
7442 argument will be upgraded to an RV. That RV will be modified to point to
7443 the new SV. The C<classname> argument indicates the package for the
7444 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
7445 will be returned and will have a reference count of 1.
7451 Perl_sv_setref_iv(pTHX_ SV *rv, const char *classname, IV iv)
7453 sv_setiv(newSVrv(rv,classname), iv);
7458 =for apidoc sv_setref_uv
7460 Copies an unsigned integer into a new SV, optionally blessing the SV. The C<rv>
7461 argument will be upgraded to an RV. That RV will be modified to point to
7462 the new SV. The C<classname> argument indicates the package for the
7463 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
7464 will be returned and will have a reference count of 1.
7470 Perl_sv_setref_uv(pTHX_ SV *rv, const char *classname, UV uv)
7472 sv_setuv(newSVrv(rv,classname), uv);
7477 =for apidoc sv_setref_nv
7479 Copies a double into a new SV, optionally blessing the SV. The C<rv>
7480 argument will be upgraded to an RV. That RV will be modified to point to
7481 the new SV. The C<classname> argument indicates the package for the
7482 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
7483 will be returned and will have a reference count of 1.
7489 Perl_sv_setref_nv(pTHX_ SV *rv, const char *classname, NV nv)
7491 sv_setnv(newSVrv(rv,classname), nv);
7496 =for apidoc sv_setref_pvn
7498 Copies a string into a new SV, optionally blessing the SV. The length of the
7499 string must be specified with C<n>. The C<rv> argument will be upgraded to
7500 an RV. That RV will be modified to point to the new SV. The C<classname>
7501 argument indicates the package for the blessing. Set C<classname> to
7502 C<Nullch> to avoid the blessing. The new SV will be returned and will have
7503 a reference count of 1.
7505 Note that C<sv_setref_pv> copies the pointer while this copies the string.
7511 Perl_sv_setref_pvn(pTHX_ SV *rv, const char *classname, char *pv, STRLEN n)
7513 sv_setpvn(newSVrv(rv,classname), pv, n);
7518 =for apidoc sv_bless
7520 Blesses an SV into a specified package. The SV must be an RV. The package
7521 must be designated by its stash (see C<gv_stashpv()>). The reference count
7522 of the SV is unaffected.
7528 Perl_sv_bless(pTHX_ SV *sv, HV *stash)
7532 Perl_croak(aTHX_ "Can't bless non-reference value");
7534 if (SvFLAGS(tmpRef) & (SVs_OBJECT|SVf_READONLY)) {
7535 if (SvREADONLY(tmpRef))
7536 Perl_croak(aTHX_ PL_no_modify);
7537 if (SvOBJECT(tmpRef)) {
7538 if (SvTYPE(tmpRef) != SVt_PVIO)
7540 SvREFCNT_dec(SvSTASH(tmpRef));
7543 SvOBJECT_on(tmpRef);
7544 if (SvTYPE(tmpRef) != SVt_PVIO)
7546 (void)SvUPGRADE(tmpRef, SVt_PVMG);
7547 SvSTASH(tmpRef) = (HV*)SvREFCNT_inc(stash);
7554 if(SvSMAGICAL(tmpRef))
7555 if(mg_find(tmpRef, PERL_MAGIC_ext) || mg_find(tmpRef, PERL_MAGIC_uvar))
7563 /* Downgrades a PVGV to a PVMG.
7567 S_sv_unglob(pTHX_ SV *sv)
7571 assert(SvTYPE(sv) == SVt_PVGV);
7576 SvREFCNT_dec(GvSTASH(sv));
7577 GvSTASH(sv) = Nullhv;
7579 sv_unmagic(sv, PERL_MAGIC_glob);
7580 Safefree(GvNAME(sv));
7583 /* need to keep SvANY(sv) in the right arena */
7584 xpvmg = new_XPVMG();
7585 StructCopy(SvANY(sv), xpvmg, XPVMG);
7586 del_XPVGV(SvANY(sv));
7589 SvFLAGS(sv) &= ~SVTYPEMASK;
7590 SvFLAGS(sv) |= SVt_PVMG;
7594 =for apidoc sv_unref_flags
7596 Unsets the RV status of the SV, and decrements the reference count of
7597 whatever was being referenced by the RV. This can almost be thought of
7598 as a reversal of C<newSVrv>. The C<cflags> argument can contain
7599 C<SV_IMMEDIATE_UNREF> to force the reference count to be decremented
7600 (otherwise the decrementing is conditional on the reference count being
7601 different from one or the reference being a readonly SV).
7608 Perl_sv_unref_flags(pTHX_ SV *sv, U32 flags)
7612 if (SvWEAKREF(sv)) {
7620 if (SvREFCNT(rv) != 1 || SvREADONLY(rv) || (flags & SV_IMMEDIATE_UNREF))
7622 else /* XXX Hack, but hard to make $a=$a->[1] work otherwise */
7623 sv_2mortal(rv); /* Schedule for freeing later */
7627 =for apidoc sv_unref
7629 Unsets the RV status of the SV, and decrements the reference count of
7630 whatever was being referenced by the RV. This can almost be thought of
7631 as a reversal of C<newSVrv>. This is C<sv_unref_flags> with the C<flag>
7632 being zero. See C<SvROK_off>.
7638 Perl_sv_unref(pTHX_ SV *sv)
7640 sv_unref_flags(sv, 0);
7644 =for apidoc sv_taint
7646 Taint an SV. Use C<SvTAINTED_on> instead.
7651 Perl_sv_taint(pTHX_ SV *sv)
7653 sv_magic((sv), Nullsv, PERL_MAGIC_taint, Nullch, 0);
7657 =for apidoc sv_untaint
7659 Untaint an SV. Use C<SvTAINTED_off> instead.
7664 Perl_sv_untaint(pTHX_ SV *sv)
7666 if (SvTYPE(sv) >= SVt_PVMG && SvMAGIC(sv)) {
7667 MAGIC *mg = mg_find(sv, PERL_MAGIC_taint);
7674 =for apidoc sv_tainted
7676 Test an SV for taintedness. Use C<SvTAINTED> instead.
7681 Perl_sv_tainted(pTHX_ SV *sv)
7683 if (SvTYPE(sv) >= SVt_PVMG && SvMAGIC(sv)) {
7684 MAGIC *mg = mg_find(sv, PERL_MAGIC_taint);
7685 if (mg && ((mg->mg_len & 1) || ((mg->mg_len & 2) && mg->mg_obj == sv)))
7691 #if defined(PERL_IMPLICIT_CONTEXT)
7693 /* pTHX_ magic can't cope with varargs, so this is a no-context
7694 * version of the main function, (which may itself be aliased to us).
7695 * Don't access this version directly.
7699 Perl_sv_setpvf_nocontext(SV *sv, const char* pat, ...)
7703 va_start(args, pat);
7704 sv_vsetpvf(sv, pat, &args);
7708 /* pTHX_ magic can't cope with varargs, so this is a no-context
7709 * version of the main function, (which may itself be aliased to us).
7710 * Don't access this version directly.
7714 Perl_sv_setpvf_mg_nocontext(SV *sv, const char* pat, ...)
7718 va_start(args, pat);
7719 sv_vsetpvf_mg(sv, pat, &args);
7725 =for apidoc sv_setpvf
7727 Processes its arguments like C<sprintf> and sets an SV to the formatted
7728 output. Does not handle 'set' magic. See C<sv_setpvf_mg>.
7734 Perl_sv_setpvf(pTHX_ SV *sv, const char* pat, ...)
7737 va_start(args, pat);
7738 sv_vsetpvf(sv, pat, &args);
7742 /* backend for C<sv_setpvf> and C<sv_setpvf_nocontext> */
7745 Perl_sv_vsetpvf(pTHX_ SV *sv, const char* pat, va_list* args)
7747 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
7751 =for apidoc sv_setpvf_mg
7753 Like C<sv_setpvf>, but also handles 'set' magic.
7759 Perl_sv_setpvf_mg(pTHX_ SV *sv, const char* pat, ...)
7762 va_start(args, pat);
7763 sv_vsetpvf_mg(sv, pat, &args);
7767 /* backend for C<sv_setpvf_mg> C<setpvf_mg_nocontext> */
7770 Perl_sv_vsetpvf_mg(pTHX_ SV *sv, const char* pat, va_list* args)
7772 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
7776 #if defined(PERL_IMPLICIT_CONTEXT)
7778 /* pTHX_ magic can't cope with varargs, so this is a no-context
7779 * version of the main function, (which may itself be aliased to us).
7780 * Don't access this version directly.
7784 Perl_sv_catpvf_nocontext(SV *sv, const char* pat, ...)
7788 va_start(args, pat);
7789 sv_vcatpvf(sv, pat, &args);
7793 /* pTHX_ magic can't cope with varargs, so this is a no-context
7794 * version of the main function, (which may itself be aliased to us).
7795 * Don't access this version directly.
7799 Perl_sv_catpvf_mg_nocontext(SV *sv, const char* pat, ...)
7803 va_start(args, pat);
7804 sv_vcatpvf_mg(sv, pat, &args);
7810 =for apidoc sv_catpvf
7812 Processes its arguments like C<sprintf> and appends the formatted
7813 output to an SV. If the appended data contains "wide" characters
7814 (including, but not limited to, SVs with a UTF-8 PV formatted with %s,
7815 and characters >255 formatted with %c), the original SV might get
7816 upgraded to UTF-8. Handles 'get' magic, but not 'set' magic.
7817 C<SvSETMAGIC()> must typically be called after calling this function
7818 to handle 'set' magic.
7823 Perl_sv_catpvf(pTHX_ SV *sv, const char* pat, ...)
7826 va_start(args, pat);
7827 sv_vcatpvf(sv, pat, &args);
7831 /* backend for C<sv_catpvf> and C<catpvf_mg_nocontext> */
7834 Perl_sv_vcatpvf(pTHX_ SV *sv, const char* pat, va_list* args)
7836 sv_vcatpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
7840 =for apidoc sv_catpvf_mg
7842 Like C<sv_catpvf>, but also handles 'set' magic.
7848 Perl_sv_catpvf_mg(pTHX_ SV *sv, const char* pat, ...)
7851 va_start(args, pat);
7852 sv_vcatpvf_mg(sv, pat, &args);
7856 /* backend for C<catpvf_mg> and C<catpvf_mg_nocontext> */
7859 Perl_sv_vcatpvf_mg(pTHX_ SV *sv, const char* pat, va_list* args)
7861 sv_vcatpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
7866 =for apidoc sv_vsetpvfn
7868 Works like C<vcatpvfn> but copies the text into the SV instead of
7871 Usually used via one of its frontends C<sv_setpvf> and C<sv_setpvf_mg>.
7877 Perl_sv_vsetpvfn(pTHX_ SV *sv, const char *pat, STRLEN patlen, va_list *args, SV **svargs, I32 svmax, bool *maybe_tainted)
7879 sv_setpvn(sv, "", 0);
7880 sv_vcatpvfn(sv, pat, patlen, args, svargs, svmax, maybe_tainted);
7883 /* private function for use in sv_vcatpvfn via the EXPECT_NUMBER macro */
7886 S_expect_number(pTHX_ char** pattern)
7889 switch (**pattern) {
7890 case '1': case '2': case '3':
7891 case '4': case '5': case '6':
7892 case '7': case '8': case '9':
7893 while (isDIGIT(**pattern))
7894 var = var * 10 + (*(*pattern)++ - '0');
7898 #define EXPECT_NUMBER(pattern, var) (var = S_expect_number(aTHX_ &pattern))
7901 =for apidoc sv_vcatpvfn
7903 Processes its arguments like C<vsprintf> and appends the formatted output
7904 to an SV. Uses an array of SVs if the C style variable argument list is
7905 missing (NULL). When running with taint checks enabled, indicates via
7906 C<maybe_tainted> if results are untrustworthy (often due to the use of
7909 Usually used via one of its frontends C<sv_catpvf> and C<sv_catpvf_mg>.
7915 Perl_sv_vcatpvfn(pTHX_ SV *sv, const char *pat, STRLEN patlen, va_list *args, SV **svargs, I32 svmax, bool *maybe_tainted)
7922 static char nullstr[] = "(null)";
7924 bool has_utf8 = FALSE; /* has the result utf8? */
7926 /* no matter what, this is a string now */
7927 (void)SvPV_force(sv, origlen);
7929 /* special-case "", "%s", and "%_" */
7932 if (patlen == 2 && pat[0] == '%') {
7936 char *s = va_arg(*args, char*);
7937 sv_catpv(sv, s ? s : nullstr);
7939 else if (svix < svmax) {
7940 sv_catsv(sv, *svargs);
7941 if (DO_UTF8(*svargs))
7947 argsv = va_arg(*args, SV*);
7948 sv_catsv(sv, argsv);
7953 /* See comment on '_' below */
7958 if (!args && svix < svmax && DO_UTF8(*svargs))
7961 patend = (char*)pat + patlen;
7962 for (p = (char*)pat; p < patend; p = q) {
7965 bool vectorize = FALSE;
7966 bool vectorarg = FALSE;
7967 bool vec_utf8 = FALSE;
7973 bool has_precis = FALSE;
7975 bool is_utf8 = FALSE; /* is this item utf8? */
7976 #ifdef HAS_LDBL_SPRINTF_BUG
7977 /* This is to try to fix a bug with irix/nonstop-ux/powerux and
7978 with sfio - Allen <allens@cpan.org> */
7979 bool fix_ldbl_sprintf_bug = FALSE;
7983 U8 utf8buf[UTF8_MAXLEN+1];
7984 STRLEN esignlen = 0;
7986 char *eptr = Nullch;
7988 /* Times 4: a decimal digit takes more than 3 binary digits.
7989 * NV_DIG: mantissa takes than many decimal digits.
7990 * Plus 32: Playing safe. */
7991 char ebuf[IV_DIG * 4 + NV_DIG + 32];
7992 /* large enough for "%#.#f" --chip */
7993 /* what about long double NVs? --jhi */
7996 U8 *vecstr = Null(U8*);
8003 /* we need a long double target in case HAS_LONG_DOUBLE but
8006 #if defined(HAS_LONG_DOUBLE) && LONG_DOUBLESIZE > DOUBLESIZE
8015 STRLEN dotstrlen = 1;
8016 I32 efix = 0; /* explicit format parameter index */
8017 I32 ewix = 0; /* explicit width index */
8018 I32 epix = 0; /* explicit precision index */
8019 I32 evix = 0; /* explicit vector index */
8020 bool asterisk = FALSE;
8022 /* echo everything up to the next format specification */
8023 for (q = p; q < patend && *q != '%'; ++q) ;
8025 sv_catpvn(sv, p, q - p);
8032 We allow format specification elements in this order:
8033 \d+\$ explicit format parameter index
8035 v|\*(\d+\$)?v vector with optional (optionally specified) arg
8036 \d+|\*(\d+\$)? width using optional (optionally specified) arg
8037 \.(\d*|\*(\d+\$)?) precision using optional (optionally specified) arg
8039 [%bcdefginopsux_DFOUX] format (mandatory)
8041 if (EXPECT_NUMBER(q, width)) {
8082 if (EXPECT_NUMBER(q, ewix))
8091 if ((vectorarg = asterisk)) {
8101 EXPECT_NUMBER(q, width);
8106 vecsv = va_arg(*args, SV*);
8108 vecsv = (evix ? evix <= svmax : svix < svmax) ?
8109 svargs[ewix ? ewix-1 : svix++] : &PL_sv_undef;
8110 dotstr = SvPVx(vecsv, dotstrlen);
8115 vecsv = va_arg(*args, SV*);
8116 vecstr = (U8*)SvPVx(vecsv,veclen);
8117 vec_utf8 = DO_UTF8(vecsv);
8119 else if (efix ? efix <= svmax : svix < svmax) {
8120 vecsv = svargs[efix ? efix-1 : svix++];
8121 vecstr = (U8*)SvPVx(vecsv,veclen);
8122 vec_utf8 = DO_UTF8(vecsv);
8132 i = va_arg(*args, int);
8134 i = (ewix ? ewix <= svmax : svix < svmax) ?
8135 SvIVx(svargs[ewix ? ewix-1 : svix++]) : 0;
8137 width = (i < 0) ? -i : i;
8147 if (EXPECT_NUMBER(q, epix) && *q++ != '$')
8149 /* XXX: todo, support specified precision parameter */
8153 i = va_arg(*args, int);
8155 i = (ewix ? ewix <= svmax : svix < svmax)
8156 ? SvIVx(svargs[ewix ? ewix-1 : svix++]) : 0;
8157 precis = (i < 0) ? 0 : i;
8162 precis = precis * 10 + (*q++ - '0');
8171 case 'I': /* Ix, I32x, and I64x */
8173 if (q[1] == '6' && q[2] == '4') {
8179 if (q[1] == '3' && q[2] == '2') {
8189 #if defined(HAS_QUAD) || defined(HAS_LONG_DOUBLE)
8200 #if defined(HAS_QUAD) || defined(HAS_LONG_DOUBLE)
8201 if (*(q + 1) == 'l') { /* lld, llf */
8226 argsv = (efix ? efix <= svmax : svix < svmax) ?
8227 svargs[efix ? efix-1 : svix++] : &PL_sv_undef;
8234 uv = (args && !vectorize) ? va_arg(*args, int) : SvIVx(argsv);
8236 (!UNI_IS_INVARIANT(uv) && SvUTF8(sv)))
8238 eptr = (char*)utf8buf;
8239 elen = uvchr_to_utf8((U8*)eptr, uv) - utf8buf;
8250 if (args && !vectorize) {
8251 eptr = va_arg(*args, char*);
8253 #ifdef MACOS_TRADITIONAL
8254 /* On MacOS, %#s format is used for Pascal strings */
8259 elen = strlen(eptr);
8262 elen = sizeof nullstr - 1;
8266 eptr = SvPVx(argsv, elen);
8267 if (DO_UTF8(argsv)) {
8268 if (has_precis && precis < elen) {
8270 sv_pos_u2b(argsv, &p, 0); /* sticks at end */
8273 if (width) { /* fudge width (can't fudge elen) */
8274 width += elen - sv_len_utf8(argsv);
8283 * The "%_" hack might have to be changed someday,
8284 * if ISO or ANSI decide to use '_' for something.
8285 * So we keep it hidden from users' code.
8287 if (!args || vectorize)
8289 argsv = va_arg(*args, SV*);
8290 eptr = SvPVx(argsv, elen);
8296 if (has_precis && elen > precis)
8303 if (alt || vectorize)
8305 uv = PTR2UV(args ? va_arg(*args, void*) : argsv);
8323 uv = utf8n_to_uvchr(vecstr, veclen, &ulen,
8332 esignbuf[esignlen++] = plus;
8336 case 'h': iv = (short)va_arg(*args, int); break;
8337 default: iv = va_arg(*args, int); break;
8338 case 'l': iv = va_arg(*args, long); break;
8339 case 'V': iv = va_arg(*args, IV); break;
8341 case 'q': iv = va_arg(*args, Quad_t); break;
8348 case 'h': iv = (short)iv; break;
8350 case 'l': iv = (long)iv; break;
8353 case 'q': iv = (Quad_t)iv; break;
8357 if ( !vectorize ) /* we already set uv above */
8362 esignbuf[esignlen++] = plus;
8366 esignbuf[esignlen++] = '-';
8409 uv = utf8n_to_uvchr(vecstr, veclen, &ulen,
8420 case 'h': uv = (unsigned short)va_arg(*args, unsigned); break;
8421 default: uv = va_arg(*args, unsigned); break;
8422 case 'l': uv = va_arg(*args, unsigned long); break;
8423 case 'V': uv = va_arg(*args, UV); break;
8425 case 'q': uv = va_arg(*args, Quad_t); break;
8432 case 'h': uv = (unsigned short)uv; break;
8434 case 'l': uv = (unsigned long)uv; break;
8437 case 'q': uv = (Quad_t)uv; break;
8443 eptr = ebuf + sizeof ebuf;
8449 p = (char*)((c == 'X')
8450 ? "0123456789ABCDEF" : "0123456789abcdef");
8456 esignbuf[esignlen++] = '0';
8457 esignbuf[esignlen++] = c; /* 'x' or 'X' */
8463 *--eptr = '0' + dig;
8465 if (alt && *eptr != '0')
8471 *--eptr = '0' + dig;
8474 esignbuf[esignlen++] = '0';
8475 esignbuf[esignlen++] = 'b';
8478 default: /* it had better be ten or less */
8479 #if defined(PERL_Y2KWARN)
8480 if (ckWARN(WARN_Y2K)) {
8482 char *s = SvPV(sv,n);
8483 if (n >= 2 && s[n-2] == '1' && s[n-1] == '9'
8484 && (n == 2 || !isDIGIT(s[n-3])))
8486 Perl_warner(aTHX_ packWARN(WARN_Y2K),
8487 "Possible Y2K bug: %%%c %s",
8488 c, "format string following '19'");
8494 *--eptr = '0' + dig;
8495 } while (uv /= base);
8498 elen = (ebuf + sizeof ebuf) - eptr;
8501 zeros = precis - elen;
8502 else if (precis == 0 && elen == 1 && *eptr == '0')
8507 /* FLOATING POINT */
8510 c = 'f'; /* maybe %F isn't supported here */
8516 /* This is evil, but floating point is even more evil */
8518 /* for SV-style calling, we can only get NV
8519 for C-style calling, we assume %f is double;
8520 for simplicity we allow any of %Lf, %llf, %qf for long double
8524 #if defined(USE_LONG_DOUBLE)
8529 #if defined(USE_LONG_DOUBLE)
8530 intsize = args ? 0 : 'q';
8534 #if defined(HAS_LONG_DOUBLE)
8545 /* now we need (long double) if intsize == 'q', else (double) */
8546 nv = (args && !vectorize) ?
8547 #if LONG_DOUBLESIZE > DOUBLESIZE
8549 va_arg(*args, long double) :
8550 va_arg(*args, double)
8552 va_arg(*args, double)
8558 if (c != 'e' && c != 'E') {
8560 /* FIXME: if HAS_LONG_DOUBLE but not USE_LONG_DOUBLE this
8561 will cast our (long double) to (double) */
8562 (void)Perl_frexp(nv, &i);
8563 if (i == PERL_INT_MIN)
8564 Perl_die(aTHX_ "panic: frexp");
8566 need = BIT_DIGITS(i);
8568 need += has_precis ? precis : 6; /* known default */
8573 #ifdef HAS_LDBL_SPRINTF_BUG
8574 /* This is to try to fix a bug with irix/nonstop-ux/powerux and
8575 with sfio - Allen <allens@cpan.org> */
8578 # define MY_DBL_MAX DBL_MAX
8579 # else /* XXX guessing! HUGE_VAL may be defined as infinity, so not using */
8580 # if DOUBLESIZE >= 8
8581 # define MY_DBL_MAX 1.7976931348623157E+308L
8583 # define MY_DBL_MAX 3.40282347E+38L
8587 # ifdef HAS_LDBL_SPRINTF_BUG_LESS1 /* only between -1L & 1L - Allen */
8588 # define MY_DBL_MAX_BUG 1L
8590 # define MY_DBL_MAX_BUG MY_DBL_MAX
8594 # define MY_DBL_MIN DBL_MIN
8595 # else /* XXX guessing! -Allen */
8596 # if DOUBLESIZE >= 8
8597 # define MY_DBL_MIN 2.2250738585072014E-308L
8599 # define MY_DBL_MIN 1.17549435E-38L
8603 if ((intsize == 'q') && (c == 'f') &&
8604 ((nv < MY_DBL_MAX_BUG) && (nv > -MY_DBL_MAX_BUG)) &&
8606 /* it's going to be short enough that
8607 * long double precision is not needed */
8609 if ((nv <= 0L) && (nv >= -0L))
8610 fix_ldbl_sprintf_bug = TRUE; /* 0 is 0 - easiest */
8612 /* would use Perl_fp_class as a double-check but not
8613 * functional on IRIX - see perl.h comments */
8615 if ((nv >= MY_DBL_MIN) || (nv <= -MY_DBL_MIN)) {
8616 /* It's within the range that a double can represent */
8617 #if defined(DBL_MAX) && !defined(DBL_MIN)
8618 if ((nv >= ((long double)1/DBL_MAX)) ||
8619 (nv <= (-(long double)1/DBL_MAX)))
8621 fix_ldbl_sprintf_bug = TRUE;
8624 if (fix_ldbl_sprintf_bug == TRUE) {
8634 # undef MY_DBL_MAX_BUG
8637 #endif /* HAS_LDBL_SPRINTF_BUG */
8639 need += 20; /* fudge factor */
8640 if (PL_efloatsize < need) {
8641 Safefree(PL_efloatbuf);
8642 PL_efloatsize = need + 20; /* more fudge */
8643 New(906, PL_efloatbuf, PL_efloatsize, char);
8644 PL_efloatbuf[0] = '\0';
8647 eptr = ebuf + sizeof ebuf;
8650 /* FIXME: what to do if HAS_LONG_DOUBLE but not PERL_PRIfldbl? */
8651 #if defined(HAS_LONG_DOUBLE) && defined(PERL_PRIfldbl)
8652 if (intsize == 'q') {
8653 /* Copy the one or more characters in a long double
8654 * format before the 'base' ([efgEFG]) character to
8655 * the format string. */
8656 static char const prifldbl[] = PERL_PRIfldbl;
8657 char const *p = prifldbl + sizeof(prifldbl) - 3;
8658 while (p >= prifldbl) { *--eptr = *p--; }
8663 do { *--eptr = '0' + (base % 10); } while (base /= 10);
8668 do { *--eptr = '0' + (base % 10); } while (base /= 10);
8680 /* No taint. Otherwise we are in the strange situation
8681 * where printf() taints but print($float) doesn't.
8683 #if defined(HAS_LONG_DOUBLE)
8685 (void)sprintf(PL_efloatbuf, eptr, nv);
8687 (void)sprintf(PL_efloatbuf, eptr, (double)nv);
8689 (void)sprintf(PL_efloatbuf, eptr, nv);
8691 eptr = PL_efloatbuf;
8692 elen = strlen(PL_efloatbuf);
8698 i = SvCUR(sv) - origlen;
8699 if (args && !vectorize) {
8701 case 'h': *(va_arg(*args, short*)) = i; break;
8702 default: *(va_arg(*args, int*)) = i; break;
8703 case 'l': *(va_arg(*args, long*)) = i; break;
8704 case 'V': *(va_arg(*args, IV*)) = i; break;
8706 case 'q': *(va_arg(*args, Quad_t*)) = i; break;
8711 sv_setuv_mg(argsv, (UV)i);
8713 continue; /* not "break" */
8720 if (!args && ckWARN(WARN_PRINTF) &&
8721 (PL_op->op_type == OP_PRTF || PL_op->op_type == OP_SPRINTF)) {
8722 SV *msg = sv_newmortal();
8723 Perl_sv_setpvf(aTHX_ msg, "Invalid conversion in %s: ",
8724 (PL_op->op_type == OP_PRTF) ? "printf" : "sprintf");
8727 Perl_sv_catpvf(aTHX_ msg,
8728 "\"%%%c\"", c & 0xFF);
8730 Perl_sv_catpvf(aTHX_ msg,
8731 "\"%%\\%03"UVof"\"",
8734 sv_catpv(msg, "end of string");
8735 Perl_warner(aTHX_ packWARN(WARN_PRINTF), "%"SVf, msg); /* yes, this is reentrant */
8738 /* output mangled stuff ... */
8744 /* ... right here, because formatting flags should not apply */
8745 SvGROW(sv, SvCUR(sv) + elen + 1);
8747 Copy(eptr, p, elen, char);
8750 SvCUR(sv) = p - SvPVX(sv);
8751 continue; /* not "break" */
8754 if (is_utf8 != has_utf8) {
8757 sv_utf8_upgrade(sv);
8760 SV *nsv = sv_2mortal(newSVpvn(eptr, elen));
8761 sv_utf8_upgrade(nsv);
8765 SvGROW(sv, SvCUR(sv) + elen + 1);
8770 have = esignlen + zeros + elen;
8771 need = (have > width ? have : width);
8774 SvGROW(sv, SvCUR(sv) + need + dotstrlen + 1);
8776 if (esignlen && fill == '0') {
8777 for (i = 0; i < (int)esignlen; i++)
8781 memset(p, fill, gap);
8784 if (esignlen && fill != '0') {
8785 for (i = 0; i < (int)esignlen; i++)
8789 for (i = zeros; i; i--)
8793 Copy(eptr, p, elen, char);
8797 memset(p, ' ', gap);
8802 Copy(dotstr, p, dotstrlen, char);
8806 vectorize = FALSE; /* done iterating over vecstr */
8813 SvCUR(sv) = p - SvPVX(sv);
8821 /* =========================================================================
8823 =head1 Cloning an interpreter
8825 All the macros and functions in this section are for the private use of
8826 the main function, perl_clone().
8828 The foo_dup() functions make an exact copy of an existing foo thinngy.
8829 During the course of a cloning, a hash table is used to map old addresses
8830 to new addresses. The table is created and manipulated with the
8831 ptr_table_* functions.
8835 ============================================================================*/
8838 #if defined(USE_ITHREADS)
8840 #ifndef GpREFCNT_inc
8841 # define GpREFCNT_inc(gp) ((gp) ? (++(gp)->gp_refcnt, (gp)) : (GP*)NULL)
8845 #define sv_dup_inc(s,t) SvREFCNT_inc(sv_dup(s,t))
8846 #define av_dup(s,t) (AV*)sv_dup((SV*)s,t)
8847 #define av_dup_inc(s,t) (AV*)SvREFCNT_inc(sv_dup((SV*)s,t))
8848 #define hv_dup(s,t) (HV*)sv_dup((SV*)s,t)
8849 #define hv_dup_inc(s,t) (HV*)SvREFCNT_inc(sv_dup((SV*)s,t))
8850 #define cv_dup(s,t) (CV*)sv_dup((SV*)s,t)
8851 #define cv_dup_inc(s,t) (CV*)SvREFCNT_inc(sv_dup((SV*)s,t))
8852 #define io_dup(s,t) (IO*)sv_dup((SV*)s,t)
8853 #define io_dup_inc(s,t) (IO*)SvREFCNT_inc(sv_dup((SV*)s,t))
8854 #define gv_dup(s,t) (GV*)sv_dup((SV*)s,t)
8855 #define gv_dup_inc(s,t) (GV*)SvREFCNT_inc(sv_dup((SV*)s,t))
8856 #define SAVEPV(p) (p ? savepv(p) : Nullch)
8857 #define SAVEPVN(p,n) (p ? savepvn(p,n) : Nullch)
8860 /* Duplicate a regexp. Required reading: pregcomp() and pregfree() in
8861 regcomp.c. AMS 20010712 */
8864 Perl_re_dup(pTHX_ REGEXP *r, CLONE_PARAMS *param)
8868 struct reg_substr_datum *s;
8871 return (REGEXP *)NULL;
8873 if ((ret = (REGEXP *)ptr_table_fetch(PL_ptr_table, r)))
8876 len = r->offsets[0];
8877 npar = r->nparens+1;
8879 Newc(0, ret, sizeof(regexp) + (len+1)*sizeof(regnode), char, regexp);
8880 Copy(r->program, ret->program, len+1, regnode);
8882 New(0, ret->startp, npar, I32);
8883 Copy(r->startp, ret->startp, npar, I32);
8884 New(0, ret->endp, npar, I32);
8885 Copy(r->startp, ret->startp, npar, I32);
8887 New(0, ret->substrs, 1, struct reg_substr_data);
8888 for (s = ret->substrs->data, i = 0; i < 3; i++, s++) {
8889 s->min_offset = r->substrs->data[i].min_offset;
8890 s->max_offset = r->substrs->data[i].max_offset;
8891 s->substr = sv_dup_inc(r->substrs->data[i].substr, param);
8892 s->utf8_substr = sv_dup_inc(r->substrs->data[i].utf8_substr, param);
8895 ret->regstclass = NULL;
8898 int count = r->data->count;
8900 Newc(0, d, sizeof(struct reg_data) + count*sizeof(void *),
8901 char, struct reg_data);
8902 New(0, d->what, count, U8);
8905 for (i = 0; i < count; i++) {
8906 d->what[i] = r->data->what[i];
8907 switch (d->what[i]) {
8909 d->data[i] = sv_dup_inc((SV *)r->data->data[i], param);
8912 d->data[i] = av_dup_inc((AV *)r->data->data[i], param);
8915 /* This is cheating. */
8916 New(0, d->data[i], 1, struct regnode_charclass_class);
8917 StructCopy(r->data->data[i], d->data[i],
8918 struct regnode_charclass_class);
8919 ret->regstclass = (regnode*)d->data[i];
8922 /* Compiled op trees are readonly, and can thus be
8923 shared without duplication. */
8924 d->data[i] = (void*)OpREFCNT_inc((OP*)r->data->data[i]);
8927 d->data[i] = r->data->data[i];
8937 New(0, ret->offsets, 2*len+1, U32);
8938 Copy(r->offsets, ret->offsets, 2*len+1, U32);
8940 ret->precomp = SAVEPV(r->precomp);
8941 ret->refcnt = r->refcnt;
8942 ret->minlen = r->minlen;
8943 ret->prelen = r->prelen;
8944 ret->nparens = r->nparens;
8945 ret->lastparen = r->lastparen;
8946 ret->lastcloseparen = r->lastcloseparen;
8947 ret->reganch = r->reganch;
8949 ret->sublen = r->sublen;
8951 if (RX_MATCH_COPIED(ret))
8952 ret->subbeg = SAVEPV(r->subbeg);
8954 ret->subbeg = Nullch;
8956 ptr_table_store(PL_ptr_table, r, ret);
8960 /* duplicate a file handle */
8963 Perl_fp_dup(pTHX_ PerlIO *fp, char type, CLONE_PARAMS *param)
8967 return (PerlIO*)NULL;
8969 /* look for it in the table first */
8970 ret = (PerlIO*)ptr_table_fetch(PL_ptr_table, fp);
8974 /* create anew and remember what it is */
8975 ret = PerlIO_fdupopen(aTHX_ fp, param, PERLIO_DUP_CLONE);
8976 ptr_table_store(PL_ptr_table, fp, ret);
8980 /* duplicate a directory handle */
8983 Perl_dirp_dup(pTHX_ DIR *dp)
8991 /* duplicate a typeglob */
8994 Perl_gp_dup(pTHX_ GP *gp, CLONE_PARAMS* param)
8999 /* look for it in the table first */
9000 ret = (GP*)ptr_table_fetch(PL_ptr_table, gp);
9004 /* create anew and remember what it is */
9005 Newz(0, ret, 1, GP);
9006 ptr_table_store(PL_ptr_table, gp, ret);
9009 ret->gp_refcnt = 0; /* must be before any other dups! */
9010 ret->gp_sv = sv_dup_inc(gp->gp_sv, param);
9011 ret->gp_io = io_dup_inc(gp->gp_io, param);
9012 ret->gp_form = cv_dup_inc(gp->gp_form, param);
9013 ret->gp_av = av_dup_inc(gp->gp_av, param);
9014 ret->gp_hv = hv_dup_inc(gp->gp_hv, param);
9015 ret->gp_egv = gv_dup(gp->gp_egv, param);/* GvEGV is not refcounted */
9016 ret->gp_cv = cv_dup_inc(gp->gp_cv, param);
9017 ret->gp_cvgen = gp->gp_cvgen;
9018 ret->gp_flags = gp->gp_flags;
9019 ret->gp_line = gp->gp_line;
9020 ret->gp_file = gp->gp_file; /* points to COP.cop_file */
9024 /* duplicate a chain of magic */
9027 Perl_mg_dup(pTHX_ MAGIC *mg, CLONE_PARAMS* param)
9029 MAGIC *mgprev = (MAGIC*)NULL;
9032 return (MAGIC*)NULL;
9033 /* look for it in the table first */
9034 mgret = (MAGIC*)ptr_table_fetch(PL_ptr_table, mg);
9038 for (; mg; mg = mg->mg_moremagic) {
9040 Newz(0, nmg, 1, MAGIC);
9042 mgprev->mg_moremagic = nmg;
9045 nmg->mg_virtual = mg->mg_virtual; /* XXX copy dynamic vtable? */
9046 nmg->mg_private = mg->mg_private;
9047 nmg->mg_type = mg->mg_type;
9048 nmg->mg_flags = mg->mg_flags;
9049 if (mg->mg_type == PERL_MAGIC_qr) {
9050 nmg->mg_obj = (SV*)re_dup((REGEXP*)mg->mg_obj, param);
9052 else if(mg->mg_type == PERL_MAGIC_backref) {
9053 AV *av = (AV*) mg->mg_obj;
9056 nmg->mg_obj = (SV*)newAV();
9060 av_push((AV*)nmg->mg_obj,sv_dup(svp[i],param));
9065 nmg->mg_obj = (mg->mg_flags & MGf_REFCOUNTED)
9066 ? sv_dup_inc(mg->mg_obj, param)
9067 : sv_dup(mg->mg_obj, param);
9069 nmg->mg_len = mg->mg_len;
9070 nmg->mg_ptr = mg->mg_ptr; /* XXX random ptr? */
9071 if (mg->mg_ptr && mg->mg_type != PERL_MAGIC_regex_global) {
9072 if (mg->mg_len > 0) {
9073 nmg->mg_ptr = SAVEPVN(mg->mg_ptr, mg->mg_len);
9074 if (mg->mg_type == PERL_MAGIC_overload_table &&
9075 AMT_AMAGIC((AMT*)mg->mg_ptr))
9077 AMT *amtp = (AMT*)mg->mg_ptr;
9078 AMT *namtp = (AMT*)nmg->mg_ptr;
9080 for (i = 1; i < NofAMmeth; i++) {
9081 namtp->table[i] = cv_dup_inc(amtp->table[i], param);
9085 else if (mg->mg_len == HEf_SVKEY)
9086 nmg->mg_ptr = (char*)sv_dup_inc((SV*)mg->mg_ptr, param);
9088 if ((mg->mg_flags & MGf_DUP) && mg->mg_virtual && mg->mg_virtual->svt_dup) {
9089 CALL_FPTR(nmg->mg_virtual->svt_dup)(aTHX_ nmg, param);
9096 /* create a new pointer-mapping table */
9099 Perl_ptr_table_new(pTHX)
9102 Newz(0, tbl, 1, PTR_TBL_t);
9105 Newz(0, tbl->tbl_ary, tbl->tbl_max + 1, PTR_TBL_ENT_t*);
9109 /* map an existing pointer using a table */
9112 Perl_ptr_table_fetch(pTHX_ PTR_TBL_t *tbl, void *sv)
9114 PTR_TBL_ENT_t *tblent;
9115 UV hash = PTR2UV(sv);
9117 tblent = tbl->tbl_ary[hash & tbl->tbl_max];
9118 for (; tblent; tblent = tblent->next) {
9119 if (tblent->oldval == sv)
9120 return tblent->newval;
9125 /* add a new entry to a pointer-mapping table */
9128 Perl_ptr_table_store(pTHX_ PTR_TBL_t *tbl, void *oldv, void *newv)
9130 PTR_TBL_ENT_t *tblent, **otblent;
9131 /* XXX this may be pessimal on platforms where pointers aren't good
9132 * hash values e.g. if they grow faster in the most significant
9134 UV hash = PTR2UV(oldv);
9138 otblent = &tbl->tbl_ary[hash & tbl->tbl_max];
9139 for (tblent = *otblent; tblent; i=0, tblent = tblent->next) {
9140 if (tblent->oldval == oldv) {
9141 tblent->newval = newv;
9145 Newz(0, tblent, 1, PTR_TBL_ENT_t);
9146 tblent->oldval = oldv;
9147 tblent->newval = newv;
9148 tblent->next = *otblent;
9151 if (i && tbl->tbl_items > tbl->tbl_max)
9152 ptr_table_split(tbl);
9155 /* double the hash bucket size of an existing ptr table */
9158 Perl_ptr_table_split(pTHX_ PTR_TBL_t *tbl)
9160 PTR_TBL_ENT_t **ary = tbl->tbl_ary;
9161 UV oldsize = tbl->tbl_max + 1;
9162 UV newsize = oldsize * 2;
9165 Renew(ary, newsize, PTR_TBL_ENT_t*);
9166 Zero(&ary[oldsize], newsize-oldsize, PTR_TBL_ENT_t*);
9167 tbl->tbl_max = --newsize;
9169 for (i=0; i < oldsize; i++, ary++) {
9170 PTR_TBL_ENT_t **curentp, **entp, *ent;
9173 curentp = ary + oldsize;
9174 for (entp = ary, ent = *ary; ent; ent = *entp) {
9175 if ((newsize & PTR2UV(ent->oldval)) != i) {
9177 ent->next = *curentp;
9187 /* remove all the entries from a ptr table */
9190 Perl_ptr_table_clear(pTHX_ PTR_TBL_t *tbl)
9192 register PTR_TBL_ENT_t **array;
9193 register PTR_TBL_ENT_t *entry;
9194 register PTR_TBL_ENT_t *oentry = Null(PTR_TBL_ENT_t*);
9198 if (!tbl || !tbl->tbl_items) {
9202 array = tbl->tbl_ary;
9209 entry = entry->next;
9213 if (++riter > max) {
9216 entry = array[riter];
9223 /* clear and free a ptr table */
9226 Perl_ptr_table_free(pTHX_ PTR_TBL_t *tbl)
9231 ptr_table_clear(tbl);
9232 Safefree(tbl->tbl_ary);
9240 /* attempt to make everything in the typeglob readonly */
9243 S_gv_share(pTHX_ SV *sstr, CLONE_PARAMS *param)
9246 SV *sv = ¶m->proto_perl->Isv_no; /* just need SvREADONLY-ness */
9248 if (GvIO(gv) || GvFORM(gv)) {
9249 GvUNIQUE_off(gv); /* GvIOs cannot be shared. nor can GvFORMs */
9251 else if (!GvCV(gv)) {
9255 /* CvPADLISTs cannot be shared */
9256 if (!SvREADONLY(GvCV(gv)) && !CvXSUB(GvCV(gv))) {
9261 if (!GvUNIQUE(gv)) {
9263 PerlIO_printf(Perl_debug_log, "gv_share: unable to share %s::%s\n",
9264 HvNAME(GvSTASH(gv)), GvNAME(gv));
9270 * write attempts will die with
9271 * "Modification of a read-only value attempted"
9277 SvREADONLY_on(GvSV(gv));
9284 SvREADONLY_on(GvAV(gv));
9291 SvREADONLY_on(GvAV(gv));
9294 return sstr; /* he_dup() will SvREFCNT_inc() */
9297 /* duplicate an SV of any type (including AV, HV etc) */
9300 Perl_rvpv_dup(pTHX_ SV *dstr, SV *sstr, CLONE_PARAMS* param)
9303 SvRV(dstr) = SvWEAKREF(sstr)
9304 ? sv_dup(SvRV(sstr), param)
9305 : sv_dup_inc(SvRV(sstr), param);
9307 else if (SvPVX(sstr)) {
9308 /* Has something there */
9310 /* Normal PV - clone whole allocated space */
9311 SvPVX(dstr) = SAVEPVN(SvPVX(sstr), SvLEN(sstr)-1);
9312 if (SvREADONLY(sstr) && SvFAKE(sstr)) {
9313 /* Not that normal - actually sstr is copy on write.
9314 But we are a true, independant SV, so: */
9315 SvREADONLY_off(dstr);
9320 /* Special case - not normally malloced for some reason */
9321 if (SvREADONLY(sstr) && SvFAKE(sstr)) {
9322 /* A "shared" PV - clone it as unshared string */
9324 SvREADONLY_off(dstr);
9325 SvPVX(dstr) = SAVEPVN(SvPVX(sstr), SvCUR(sstr));
9328 /* Some other special case - random pointer */
9329 SvPVX(dstr) = SvPVX(sstr);
9335 SvPVX(dstr) = SvPVX(sstr);
9340 Perl_sv_dup(pTHX_ SV *sstr, CLONE_PARAMS* param)
9344 if (!sstr || SvTYPE(sstr) == SVTYPEMASK)
9346 /* look for it in the table first */
9347 dstr = (SV*)ptr_table_fetch(PL_ptr_table, sstr);
9351 /* create anew and remember what it is */
9353 ptr_table_store(PL_ptr_table, sstr, dstr);
9356 SvFLAGS(dstr) = SvFLAGS(sstr);
9357 SvFLAGS(dstr) &= ~SVf_OOK; /* don't propagate OOK hack */
9358 SvREFCNT(dstr) = 0; /* must be before any other dups! */
9361 if (SvANY(sstr) && PL_watch_pvx && SvPVX(sstr) == PL_watch_pvx)
9362 PerlIO_printf(Perl_debug_log, "watch at %p hit, found string \"%s\"\n",
9363 PL_watch_pvx, SvPVX(sstr));
9366 switch (SvTYPE(sstr)) {
9371 SvANY(dstr) = new_XIV();
9372 SvIVX(dstr) = SvIVX(sstr);
9375 SvANY(dstr) = new_XNV();
9376 SvNVX(dstr) = SvNVX(sstr);
9379 SvANY(dstr) = new_XRV();
9380 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
9383 SvANY(dstr) = new_XPV();
9384 SvCUR(dstr) = SvCUR(sstr);
9385 SvLEN(dstr) = SvLEN(sstr);
9386 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
9389 SvANY(dstr) = new_XPVIV();
9390 SvCUR(dstr) = SvCUR(sstr);
9391 SvLEN(dstr) = SvLEN(sstr);
9392 SvIVX(dstr) = SvIVX(sstr);
9393 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
9396 SvANY(dstr) = new_XPVNV();
9397 SvCUR(dstr) = SvCUR(sstr);
9398 SvLEN(dstr) = SvLEN(sstr);
9399 SvIVX(dstr) = SvIVX(sstr);
9400 SvNVX(dstr) = SvNVX(sstr);
9401 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
9404 SvANY(dstr) = new_XPVMG();
9405 SvCUR(dstr) = SvCUR(sstr);
9406 SvLEN(dstr) = SvLEN(sstr);
9407 SvIVX(dstr) = SvIVX(sstr);
9408 SvNVX(dstr) = SvNVX(sstr);
9409 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr), param);
9410 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr), param);
9411 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
9414 SvANY(dstr) = new_XPVBM();
9415 SvCUR(dstr) = SvCUR(sstr);
9416 SvLEN(dstr) = SvLEN(sstr);
9417 SvIVX(dstr) = SvIVX(sstr);
9418 SvNVX(dstr) = SvNVX(sstr);
9419 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr), param);
9420 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr), param);
9421 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
9422 BmRARE(dstr) = BmRARE(sstr);
9423 BmUSEFUL(dstr) = BmUSEFUL(sstr);
9424 BmPREVIOUS(dstr)= BmPREVIOUS(sstr);
9427 SvANY(dstr) = new_XPVLV();
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 LvTARGOFF(dstr) = LvTARGOFF(sstr); /* XXX sometimes holds PMOP* when DEBUGGING */
9436 LvTARGLEN(dstr) = LvTARGLEN(sstr);
9437 LvTARG(dstr) = sv_dup_inc(LvTARG(sstr), param);
9438 LvTYPE(dstr) = LvTYPE(sstr);
9441 if (GvUNIQUE((GV*)sstr)) {
9443 if ((share = gv_share(sstr, param))) {
9446 ptr_table_store(PL_ptr_table, sstr, dstr);
9448 PerlIO_printf(Perl_debug_log, "sv_dup: sharing %s::%s\n",
9449 HvNAME(GvSTASH(share)), GvNAME(share));
9454 SvANY(dstr) = new_XPVGV();
9455 SvCUR(dstr) = SvCUR(sstr);
9456 SvLEN(dstr) = SvLEN(sstr);
9457 SvIVX(dstr) = SvIVX(sstr);
9458 SvNVX(dstr) = SvNVX(sstr);
9459 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr), param);
9460 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr), param);
9461 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
9462 GvNAMELEN(dstr) = GvNAMELEN(sstr);
9463 GvNAME(dstr) = SAVEPVN(GvNAME(sstr), GvNAMELEN(sstr));
9464 GvSTASH(dstr) = hv_dup_inc(GvSTASH(sstr), param);
9465 GvFLAGS(dstr) = GvFLAGS(sstr);
9466 GvGP(dstr) = gp_dup(GvGP(sstr), param);
9467 (void)GpREFCNT_inc(GvGP(dstr));
9470 SvANY(dstr) = new_XPVIO();
9471 SvCUR(dstr) = SvCUR(sstr);
9472 SvLEN(dstr) = SvLEN(sstr);
9473 SvIVX(dstr) = SvIVX(sstr);
9474 SvNVX(dstr) = SvNVX(sstr);
9475 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr), param);
9476 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr), param);
9477 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
9478 IoIFP(dstr) = fp_dup(IoIFP(sstr), IoTYPE(sstr), param);
9479 if (IoOFP(sstr) == IoIFP(sstr))
9480 IoOFP(dstr) = IoIFP(dstr);
9482 IoOFP(dstr) = fp_dup(IoOFP(sstr), IoTYPE(sstr), param);
9483 /* PL_rsfp_filters entries have fake IoDIRP() */
9484 if (IoDIRP(sstr) && !(IoFLAGS(sstr) & IOf_FAKE_DIRP))
9485 IoDIRP(dstr) = dirp_dup(IoDIRP(sstr));
9487 IoDIRP(dstr) = IoDIRP(sstr);
9488 IoLINES(dstr) = IoLINES(sstr);
9489 IoPAGE(dstr) = IoPAGE(sstr);
9490 IoPAGE_LEN(dstr) = IoPAGE_LEN(sstr);
9491 IoLINES_LEFT(dstr) = IoLINES_LEFT(sstr);
9492 IoTOP_NAME(dstr) = SAVEPV(IoTOP_NAME(sstr));
9493 IoTOP_GV(dstr) = gv_dup(IoTOP_GV(sstr), param);
9494 IoFMT_NAME(dstr) = SAVEPV(IoFMT_NAME(sstr));
9495 IoFMT_GV(dstr) = gv_dup(IoFMT_GV(sstr), param);
9496 IoBOTTOM_NAME(dstr) = SAVEPV(IoBOTTOM_NAME(sstr));
9497 IoBOTTOM_GV(dstr) = gv_dup(IoBOTTOM_GV(sstr), param);
9498 IoSUBPROCESS(dstr) = IoSUBPROCESS(sstr);
9499 IoTYPE(dstr) = IoTYPE(sstr);
9500 IoFLAGS(dstr) = IoFLAGS(sstr);
9503 SvANY(dstr) = new_XPVAV();
9504 SvCUR(dstr) = SvCUR(sstr);
9505 SvLEN(dstr) = SvLEN(sstr);
9506 SvIVX(dstr) = SvIVX(sstr);
9507 SvNVX(dstr) = SvNVX(sstr);
9508 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr), param);
9509 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr), param);
9510 AvARYLEN((AV*)dstr) = sv_dup_inc(AvARYLEN((AV*)sstr), param);
9511 AvFLAGS((AV*)dstr) = AvFLAGS((AV*)sstr);
9512 if (AvARRAY((AV*)sstr)) {
9513 SV **dst_ary, **src_ary;
9514 SSize_t items = AvFILLp((AV*)sstr) + 1;
9516 src_ary = AvARRAY((AV*)sstr);
9517 Newz(0, dst_ary, AvMAX((AV*)sstr)+1, SV*);
9518 ptr_table_store(PL_ptr_table, src_ary, dst_ary);
9519 SvPVX(dstr) = (char*)dst_ary;
9520 AvALLOC((AV*)dstr) = dst_ary;
9521 if (AvREAL((AV*)sstr)) {
9523 *dst_ary++ = sv_dup_inc(*src_ary++, param);
9527 *dst_ary++ = sv_dup(*src_ary++, param);
9529 items = AvMAX((AV*)sstr) - AvFILLp((AV*)sstr);
9530 while (items-- > 0) {
9531 *dst_ary++ = &PL_sv_undef;
9535 SvPVX(dstr) = Nullch;
9536 AvALLOC((AV*)dstr) = (SV**)NULL;
9540 SvANY(dstr) = new_XPVHV();
9541 SvCUR(dstr) = SvCUR(sstr);
9542 SvLEN(dstr) = SvLEN(sstr);
9543 SvIVX(dstr) = SvIVX(sstr);
9544 SvNVX(dstr) = SvNVX(sstr);
9545 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr), param);
9546 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr), param);
9547 HvRITER((HV*)dstr) = HvRITER((HV*)sstr);
9548 if (HvARRAY((HV*)sstr)) {
9550 XPVHV *dxhv = (XPVHV*)SvANY(dstr);
9551 XPVHV *sxhv = (XPVHV*)SvANY(sstr);
9552 Newz(0, dxhv->xhv_array,
9553 PERL_HV_ARRAY_ALLOC_BYTES(dxhv->xhv_max+1), char);
9554 while (i <= sxhv->xhv_max) {
9555 ((HE**)dxhv->xhv_array)[i] = he_dup(((HE**)sxhv->xhv_array)[i],
9556 (bool)!!HvSHAREKEYS(sstr),
9560 dxhv->xhv_eiter = he_dup(sxhv->xhv_eiter,
9561 (bool)!!HvSHAREKEYS(sstr), param);
9564 SvPVX(dstr) = Nullch;
9565 HvEITER((HV*)dstr) = (HE*)NULL;
9567 HvPMROOT((HV*)dstr) = HvPMROOT((HV*)sstr); /* XXX */
9568 HvNAME((HV*)dstr) = SAVEPV(HvNAME((HV*)sstr));
9569 /* Record stashes for possible cloning in Perl_clone(). */
9570 if(HvNAME((HV*)dstr))
9571 av_push(param->stashes, dstr);
9574 SvANY(dstr) = new_XPVFM();
9575 FmLINES(dstr) = FmLINES(sstr);
9579 SvANY(dstr) = new_XPVCV();
9581 SvCUR(dstr) = SvCUR(sstr);
9582 SvLEN(dstr) = SvLEN(sstr);
9583 SvIVX(dstr) = SvIVX(sstr);
9584 SvNVX(dstr) = SvNVX(sstr);
9585 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr), param);
9586 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr), param);
9587 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
9588 CvSTASH(dstr) = hv_dup(CvSTASH(sstr), param); /* NOTE: not refcounted */
9589 CvSTART(dstr) = CvSTART(sstr);
9590 CvROOT(dstr) = OpREFCNT_inc(CvROOT(sstr));
9591 CvXSUB(dstr) = CvXSUB(sstr);
9592 CvXSUBANY(dstr) = CvXSUBANY(sstr);
9593 if (CvCONST(sstr)) {
9594 CvXSUBANY(dstr).any_ptr = GvUNIQUE(CvGV(sstr)) ?
9595 SvREFCNT_inc(CvXSUBANY(sstr).any_ptr) :
9596 sv_dup_inc(CvXSUBANY(sstr).any_ptr, param);
9598 CvGV(dstr) = gv_dup(CvGV(sstr), param);
9599 if (param->flags & CLONEf_COPY_STACKS) {
9600 CvDEPTH(dstr) = CvDEPTH(sstr);
9604 PAD_DUP(CvPADLIST(dstr), CvPADLIST(sstr), param);
9605 CvOUTSIDE_SEQ(dstr) = CvOUTSIDE_SEQ(sstr);
9608 ? cv_dup( CvOUTSIDE(sstr), param)
9609 : cv_dup_inc(CvOUTSIDE(sstr), param);
9610 CvFLAGS(dstr) = CvFLAGS(sstr);
9611 CvFILE(dstr) = CvXSUB(sstr) ? CvFILE(sstr) : SAVEPV(CvFILE(sstr));
9614 Perl_croak(aTHX_ "Bizarre SvTYPE [%" IVdf "]", (IV)SvTYPE(sstr));
9618 if (SvOBJECT(dstr) && SvTYPE(dstr) != SVt_PVIO)
9624 /* duplicate a context */
9627 Perl_cx_dup(pTHX_ PERL_CONTEXT *cxs, I32 ix, I32 max, CLONE_PARAMS* param)
9632 return (PERL_CONTEXT*)NULL;
9634 /* look for it in the table first */
9635 ncxs = (PERL_CONTEXT*)ptr_table_fetch(PL_ptr_table, cxs);
9639 /* create anew and remember what it is */
9640 Newz(56, ncxs, max + 1, PERL_CONTEXT);
9641 ptr_table_store(PL_ptr_table, cxs, ncxs);
9644 PERL_CONTEXT *cx = &cxs[ix];
9645 PERL_CONTEXT *ncx = &ncxs[ix];
9646 ncx->cx_type = cx->cx_type;
9647 if (CxTYPE(cx) == CXt_SUBST) {
9648 Perl_croak(aTHX_ "Cloning substitution context is unimplemented");
9651 ncx->blk_oldsp = cx->blk_oldsp;
9652 ncx->blk_oldcop = cx->blk_oldcop;
9653 ncx->blk_oldretsp = cx->blk_oldretsp;
9654 ncx->blk_oldmarksp = cx->blk_oldmarksp;
9655 ncx->blk_oldscopesp = cx->blk_oldscopesp;
9656 ncx->blk_oldpm = cx->blk_oldpm;
9657 ncx->blk_gimme = cx->blk_gimme;
9658 switch (CxTYPE(cx)) {
9660 ncx->blk_sub.cv = (cx->blk_sub.olddepth == 0
9661 ? cv_dup_inc(cx->blk_sub.cv, param)
9662 : cv_dup(cx->blk_sub.cv,param));
9663 ncx->blk_sub.argarray = (cx->blk_sub.hasargs
9664 ? av_dup_inc(cx->blk_sub.argarray, param)
9666 ncx->blk_sub.savearray = av_dup_inc(cx->blk_sub.savearray, param);
9667 ncx->blk_sub.olddepth = cx->blk_sub.olddepth;
9668 ncx->blk_sub.hasargs = cx->blk_sub.hasargs;
9669 ncx->blk_sub.lval = cx->blk_sub.lval;
9672 ncx->blk_eval.old_in_eval = cx->blk_eval.old_in_eval;
9673 ncx->blk_eval.old_op_type = cx->blk_eval.old_op_type;
9674 ncx->blk_eval.old_namesv = sv_dup_inc(cx->blk_eval.old_namesv, param);
9675 ncx->blk_eval.old_eval_root = cx->blk_eval.old_eval_root;
9676 ncx->blk_eval.cur_text = sv_dup(cx->blk_eval.cur_text, param);
9679 ncx->blk_loop.label = cx->blk_loop.label;
9680 ncx->blk_loop.resetsp = cx->blk_loop.resetsp;
9681 ncx->blk_loop.redo_op = cx->blk_loop.redo_op;
9682 ncx->blk_loop.next_op = cx->blk_loop.next_op;
9683 ncx->blk_loop.last_op = cx->blk_loop.last_op;
9684 ncx->blk_loop.iterdata = (CxPADLOOP(cx)
9685 ? cx->blk_loop.iterdata
9686 : gv_dup((GV*)cx->blk_loop.iterdata, param));
9687 ncx->blk_loop.oldcomppad
9688 = (PAD*)ptr_table_fetch(PL_ptr_table,
9689 cx->blk_loop.oldcomppad);
9690 ncx->blk_loop.itersave = sv_dup_inc(cx->blk_loop.itersave, param);
9691 ncx->blk_loop.iterlval = sv_dup_inc(cx->blk_loop.iterlval, param);
9692 ncx->blk_loop.iterary = av_dup_inc(cx->blk_loop.iterary, param);
9693 ncx->blk_loop.iterix = cx->blk_loop.iterix;
9694 ncx->blk_loop.itermax = cx->blk_loop.itermax;
9697 ncx->blk_sub.cv = cv_dup(cx->blk_sub.cv, param);
9698 ncx->blk_sub.gv = gv_dup(cx->blk_sub.gv, param);
9699 ncx->blk_sub.dfoutgv = gv_dup_inc(cx->blk_sub.dfoutgv, param);
9700 ncx->blk_sub.hasargs = cx->blk_sub.hasargs;
9712 /* duplicate a stack info structure */
9715 Perl_si_dup(pTHX_ PERL_SI *si, CLONE_PARAMS* param)
9720 return (PERL_SI*)NULL;
9722 /* look for it in the table first */
9723 nsi = (PERL_SI*)ptr_table_fetch(PL_ptr_table, si);
9727 /* create anew and remember what it is */
9728 Newz(56, nsi, 1, PERL_SI);
9729 ptr_table_store(PL_ptr_table, si, nsi);
9731 nsi->si_stack = av_dup_inc(si->si_stack, param);
9732 nsi->si_cxix = si->si_cxix;
9733 nsi->si_cxmax = si->si_cxmax;
9734 nsi->si_cxstack = cx_dup(si->si_cxstack, si->si_cxix, si->si_cxmax, param);
9735 nsi->si_type = si->si_type;
9736 nsi->si_prev = si_dup(si->si_prev, param);
9737 nsi->si_next = si_dup(si->si_next, param);
9738 nsi->si_markoff = si->si_markoff;
9743 #define POPINT(ss,ix) ((ss)[--(ix)].any_i32)
9744 #define TOPINT(ss,ix) ((ss)[ix].any_i32)
9745 #define POPLONG(ss,ix) ((ss)[--(ix)].any_long)
9746 #define TOPLONG(ss,ix) ((ss)[ix].any_long)
9747 #define POPIV(ss,ix) ((ss)[--(ix)].any_iv)
9748 #define TOPIV(ss,ix) ((ss)[ix].any_iv)
9749 #define POPPTR(ss,ix) ((ss)[--(ix)].any_ptr)
9750 #define TOPPTR(ss,ix) ((ss)[ix].any_ptr)
9751 #define POPDPTR(ss,ix) ((ss)[--(ix)].any_dptr)
9752 #define TOPDPTR(ss,ix) ((ss)[ix].any_dptr)
9753 #define POPDXPTR(ss,ix) ((ss)[--(ix)].any_dxptr)
9754 #define TOPDXPTR(ss,ix) ((ss)[ix].any_dxptr)
9757 #define pv_dup_inc(p) SAVEPV(p)
9758 #define pv_dup(p) SAVEPV(p)
9759 #define svp_dup_inc(p,pp) any_dup(p,pp)
9761 /* map any object to the new equivent - either something in the
9762 * ptr table, or something in the interpreter structure
9766 Perl_any_dup(pTHX_ void *v, PerlInterpreter *proto_perl)
9773 /* look for it in the table first */
9774 ret = ptr_table_fetch(PL_ptr_table, v);
9778 /* see if it is part of the interpreter structure */
9779 if (v >= (void*)proto_perl && v < (void*)(proto_perl+1))
9780 ret = (void*)(((char*)aTHX) + (((char*)v) - (char*)proto_perl));
9788 /* duplicate the save stack */
9791 Perl_ss_dup(pTHX_ PerlInterpreter *proto_perl, CLONE_PARAMS* param)
9793 ANY *ss = proto_perl->Tsavestack;
9794 I32 ix = proto_perl->Tsavestack_ix;
9795 I32 max = proto_perl->Tsavestack_max;
9808 void (*dptr) (void*);
9809 void (*dxptr) (pTHX_ void*);
9812 Newz(54, nss, max, ANY);
9818 case SAVEt_ITEM: /* normal string */
9819 sv = (SV*)POPPTR(ss,ix);
9820 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
9821 sv = (SV*)POPPTR(ss,ix);
9822 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
9824 case SAVEt_SV: /* scalar reference */
9825 sv = (SV*)POPPTR(ss,ix);
9826 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
9827 gv = (GV*)POPPTR(ss,ix);
9828 TOPPTR(nss,ix) = gv_dup_inc(gv, param);
9830 case SAVEt_GENERIC_PVREF: /* generic char* */
9831 c = (char*)POPPTR(ss,ix);
9832 TOPPTR(nss,ix) = pv_dup(c);
9833 ptr = POPPTR(ss,ix);
9834 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
9836 case SAVEt_SHARED_PVREF: /* char* in shared space */
9837 c = (char*)POPPTR(ss,ix);
9838 TOPPTR(nss,ix) = savesharedpv(c);
9839 ptr = POPPTR(ss,ix);
9840 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
9842 case SAVEt_GENERIC_SVREF: /* generic sv */
9843 case SAVEt_SVREF: /* scalar reference */
9844 sv = (SV*)POPPTR(ss,ix);
9845 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
9846 ptr = POPPTR(ss,ix);
9847 TOPPTR(nss,ix) = svp_dup_inc((SV**)ptr, proto_perl);/* XXXXX */
9849 case SAVEt_AV: /* array reference */
9850 av = (AV*)POPPTR(ss,ix);
9851 TOPPTR(nss,ix) = av_dup_inc(av, param);
9852 gv = (GV*)POPPTR(ss,ix);
9853 TOPPTR(nss,ix) = gv_dup(gv, param);
9855 case SAVEt_HV: /* hash reference */
9856 hv = (HV*)POPPTR(ss,ix);
9857 TOPPTR(nss,ix) = hv_dup_inc(hv, param);
9858 gv = (GV*)POPPTR(ss,ix);
9859 TOPPTR(nss,ix) = gv_dup(gv, param);
9861 case SAVEt_INT: /* int reference */
9862 ptr = POPPTR(ss,ix);
9863 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
9864 intval = (int)POPINT(ss,ix);
9865 TOPINT(nss,ix) = intval;
9867 case SAVEt_LONG: /* long reference */
9868 ptr = POPPTR(ss,ix);
9869 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
9870 longval = (long)POPLONG(ss,ix);
9871 TOPLONG(nss,ix) = longval;
9873 case SAVEt_I32: /* I32 reference */
9874 case SAVEt_I16: /* I16 reference */
9875 case SAVEt_I8: /* I8 reference */
9876 ptr = POPPTR(ss,ix);
9877 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
9881 case SAVEt_IV: /* IV reference */
9882 ptr = POPPTR(ss,ix);
9883 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
9887 case SAVEt_SPTR: /* SV* reference */
9888 ptr = POPPTR(ss,ix);
9889 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
9890 sv = (SV*)POPPTR(ss,ix);
9891 TOPPTR(nss,ix) = sv_dup(sv, param);
9893 case SAVEt_VPTR: /* random* reference */
9894 ptr = POPPTR(ss,ix);
9895 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
9896 ptr = POPPTR(ss,ix);
9897 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
9899 case SAVEt_PPTR: /* char* reference */
9900 ptr = POPPTR(ss,ix);
9901 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
9902 c = (char*)POPPTR(ss,ix);
9903 TOPPTR(nss,ix) = pv_dup(c);
9905 case SAVEt_HPTR: /* HV* reference */
9906 ptr = POPPTR(ss,ix);
9907 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
9908 hv = (HV*)POPPTR(ss,ix);
9909 TOPPTR(nss,ix) = hv_dup(hv, param);
9911 case SAVEt_APTR: /* AV* reference */
9912 ptr = POPPTR(ss,ix);
9913 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
9914 av = (AV*)POPPTR(ss,ix);
9915 TOPPTR(nss,ix) = av_dup(av, param);
9918 gv = (GV*)POPPTR(ss,ix);
9919 TOPPTR(nss,ix) = gv_dup(gv, param);
9921 case SAVEt_GP: /* scalar reference */
9922 gp = (GP*)POPPTR(ss,ix);
9923 TOPPTR(nss,ix) = gp = gp_dup(gp, param);
9924 (void)GpREFCNT_inc(gp);
9925 gv = (GV*)POPPTR(ss,ix);
9926 TOPPTR(nss,ix) = gv_dup_inc(gv, param);
9927 c = (char*)POPPTR(ss,ix);
9928 TOPPTR(nss,ix) = pv_dup(c);
9935 case SAVEt_MORTALIZESV:
9936 sv = (SV*)POPPTR(ss,ix);
9937 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
9940 ptr = POPPTR(ss,ix);
9941 if (ptr && (((OP*)ptr)->op_private & OPpREFCOUNTED)) {
9942 /* these are assumed to be refcounted properly */
9943 switch (((OP*)ptr)->op_type) {
9950 TOPPTR(nss,ix) = ptr;
9955 TOPPTR(nss,ix) = Nullop;
9960 TOPPTR(nss,ix) = Nullop;
9963 c = (char*)POPPTR(ss,ix);
9964 TOPPTR(nss,ix) = pv_dup_inc(c);
9967 longval = POPLONG(ss,ix);
9968 TOPLONG(nss,ix) = longval;
9971 hv = (HV*)POPPTR(ss,ix);
9972 TOPPTR(nss,ix) = hv_dup_inc(hv, param);
9973 c = (char*)POPPTR(ss,ix);
9974 TOPPTR(nss,ix) = pv_dup_inc(c);
9978 case SAVEt_DESTRUCTOR:
9979 ptr = POPPTR(ss,ix);
9980 TOPPTR(nss,ix) = any_dup(ptr, proto_perl); /* XXX quite arbitrary */
9981 dptr = POPDPTR(ss,ix);
9982 TOPDPTR(nss,ix) = (void (*)(void*))any_dup((void *)dptr, proto_perl);
9984 case SAVEt_DESTRUCTOR_X:
9985 ptr = POPPTR(ss,ix);
9986 TOPPTR(nss,ix) = any_dup(ptr, proto_perl); /* XXX quite arbitrary */
9987 dxptr = POPDXPTR(ss,ix);
9988 TOPDXPTR(nss,ix) = (void (*)(pTHX_ void*))any_dup((void *)dxptr, proto_perl);
9990 case SAVEt_REGCONTEXT:
9996 case SAVEt_STACK_POS: /* Position on Perl stack */
10000 case SAVEt_AELEM: /* array element */
10001 sv = (SV*)POPPTR(ss,ix);
10002 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
10004 TOPINT(nss,ix) = i;
10005 av = (AV*)POPPTR(ss,ix);
10006 TOPPTR(nss,ix) = av_dup_inc(av, param);
10008 case SAVEt_HELEM: /* hash element */
10009 sv = (SV*)POPPTR(ss,ix);
10010 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
10011 sv = (SV*)POPPTR(ss,ix);
10012 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
10013 hv = (HV*)POPPTR(ss,ix);
10014 TOPPTR(nss,ix) = hv_dup_inc(hv, param);
10017 ptr = POPPTR(ss,ix);
10018 TOPPTR(nss,ix) = ptr;
10022 TOPINT(nss,ix) = i;
10024 case SAVEt_COMPPAD:
10025 av = (AV*)POPPTR(ss,ix);
10026 TOPPTR(nss,ix) = av_dup(av, param);
10029 longval = (long)POPLONG(ss,ix);
10030 TOPLONG(nss,ix) = longval;
10031 ptr = POPPTR(ss,ix);
10032 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10033 sv = (SV*)POPPTR(ss,ix);
10034 TOPPTR(nss,ix) = sv_dup(sv, param);
10038 *(bool*)ptr = (bool)POPBOOL;
10041 Perl_croak(aTHX_ "panic: ss_dup inconsistency");
10049 =for apidoc perl_clone
10051 Create and return a new interpreter by cloning the current one.
10053 perl_clone takes these flags as paramters:
10055 CLONEf_COPY_STACKS - is used to, well, copy the stacks also,
10056 without it we only clone the data and zero the stacks,
10057 with it we copy the stacks and the new perl interpreter is
10058 ready to run at the exact same point as the previous one.
10059 The pseudo-fork code uses COPY_STACKS while the
10060 threads->new doesn't.
10062 CLONEf_KEEP_PTR_TABLE
10063 perl_clone keeps a ptr_table with the pointer of the old
10064 variable as a key and the new variable as a value,
10065 this allows it to check if something has been cloned and not
10066 clone it again but rather just use the value and increase the
10067 refcount. If KEEP_PTR_TABLE is not set then perl_clone will kill
10068 the ptr_table using the function
10069 C<ptr_table_free(PL_ptr_table); PL_ptr_table = NULL;>,
10070 reason to keep it around is if you want to dup some of your own
10071 variable who are outside the graph perl scans, example of this
10072 code is in threads.xs create
10075 This is a win32 thing, it is ignored on unix, it tells perls
10076 win32host code (which is c++) to clone itself, this is needed on
10077 win32 if you want to run two threads at the same time,
10078 if you just want to do some stuff in a separate perl interpreter
10079 and then throw it away and return to the original one,
10080 you don't need to do anything.
10085 /* XXX the above needs expanding by someone who actually understands it ! */
10086 EXTERN_C PerlInterpreter *
10087 perl_clone_host(PerlInterpreter* proto_perl, UV flags);
10090 perl_clone(PerlInterpreter *proto_perl, UV flags)
10092 #ifdef PERL_IMPLICIT_SYS
10094 /* perlhost.h so we need to call into it
10095 to clone the host, CPerlHost should have a c interface, sky */
10097 if (flags & CLONEf_CLONE_HOST) {
10098 return perl_clone_host(proto_perl,flags);
10100 return perl_clone_using(proto_perl, flags,
10102 proto_perl->IMemShared,
10103 proto_perl->IMemParse,
10105 proto_perl->IStdIO,
10109 proto_perl->IProc);
10113 perl_clone_using(PerlInterpreter *proto_perl, UV flags,
10114 struct IPerlMem* ipM, struct IPerlMem* ipMS,
10115 struct IPerlMem* ipMP, struct IPerlEnv* ipE,
10116 struct IPerlStdIO* ipStd, struct IPerlLIO* ipLIO,
10117 struct IPerlDir* ipD, struct IPerlSock* ipS,
10118 struct IPerlProc* ipP)
10120 /* XXX many of the string copies here can be optimized if they're
10121 * constants; they need to be allocated as common memory and just
10122 * their pointers copied. */
10125 CLONE_PARAMS clone_params;
10126 CLONE_PARAMS* param = &clone_params;
10128 PerlInterpreter *my_perl = (PerlInterpreter*)(*ipM->pMalloc)(ipM, sizeof(PerlInterpreter));
10129 PERL_SET_THX(my_perl);
10132 Poison(my_perl, 1, PerlInterpreter);
10137 PL_sig_pending = 0;
10138 Zero(&PL_debug_pad, 1, struct perl_debug_pad);
10139 # else /* !DEBUGGING */
10140 Zero(my_perl, 1, PerlInterpreter);
10141 # endif /* DEBUGGING */
10143 /* host pointers */
10145 PL_MemShared = ipMS;
10146 PL_MemParse = ipMP;
10153 #else /* !PERL_IMPLICIT_SYS */
10155 CLONE_PARAMS clone_params;
10156 CLONE_PARAMS* param = &clone_params;
10157 PerlInterpreter *my_perl = (PerlInterpreter*)PerlMem_malloc(sizeof(PerlInterpreter));
10158 PERL_SET_THX(my_perl);
10163 Poison(my_perl, 1, PerlInterpreter);
10168 PL_sig_pending = 0;
10169 Zero(&PL_debug_pad, 1, struct perl_debug_pad);
10170 # else /* !DEBUGGING */
10171 Zero(my_perl, 1, PerlInterpreter);
10172 # endif /* DEBUGGING */
10173 #endif /* PERL_IMPLICIT_SYS */
10174 param->flags = flags;
10175 param->proto_perl = proto_perl;
10178 PL_xiv_arenaroot = NULL;
10179 PL_xiv_root = NULL;
10180 PL_xnv_arenaroot = NULL;
10181 PL_xnv_root = NULL;
10182 PL_xrv_arenaroot = NULL;
10183 PL_xrv_root = NULL;
10184 PL_xpv_arenaroot = NULL;
10185 PL_xpv_root = NULL;
10186 PL_xpviv_arenaroot = NULL;
10187 PL_xpviv_root = NULL;
10188 PL_xpvnv_arenaroot = NULL;
10189 PL_xpvnv_root = NULL;
10190 PL_xpvcv_arenaroot = NULL;
10191 PL_xpvcv_root = NULL;
10192 PL_xpvav_arenaroot = NULL;
10193 PL_xpvav_root = NULL;
10194 PL_xpvhv_arenaroot = NULL;
10195 PL_xpvhv_root = NULL;
10196 PL_xpvmg_arenaroot = NULL;
10197 PL_xpvmg_root = NULL;
10198 PL_xpvlv_arenaroot = NULL;
10199 PL_xpvlv_root = NULL;
10200 PL_xpvbm_arenaroot = NULL;
10201 PL_xpvbm_root = NULL;
10202 PL_he_arenaroot = NULL;
10204 PL_nice_chunk = NULL;
10205 PL_nice_chunk_size = 0;
10207 PL_sv_objcount = 0;
10208 PL_sv_root = Nullsv;
10209 PL_sv_arenaroot = Nullsv;
10211 PL_debug = proto_perl->Idebug;
10213 #ifdef USE_REENTRANT_API
10214 Perl_reentrant_init(aTHX);
10217 /* create SV map for pointer relocation */
10218 PL_ptr_table = ptr_table_new();
10220 /* initialize these special pointers as early as possible */
10221 SvANY(&PL_sv_undef) = NULL;
10222 SvREFCNT(&PL_sv_undef) = (~(U32)0)/2;
10223 SvFLAGS(&PL_sv_undef) = SVf_READONLY|SVt_NULL;
10224 ptr_table_store(PL_ptr_table, &proto_perl->Isv_undef, &PL_sv_undef);
10226 SvANY(&PL_sv_no) = new_XPVNV();
10227 SvREFCNT(&PL_sv_no) = (~(U32)0)/2;
10228 SvFLAGS(&PL_sv_no) = SVp_NOK|SVf_NOK|SVp_POK|SVf_POK|SVf_READONLY|SVt_PVNV;
10229 SvPVX(&PL_sv_no) = SAVEPVN(PL_No, 0);
10230 SvCUR(&PL_sv_no) = 0;
10231 SvLEN(&PL_sv_no) = 1;
10232 SvNVX(&PL_sv_no) = 0;
10233 ptr_table_store(PL_ptr_table, &proto_perl->Isv_no, &PL_sv_no);
10235 SvANY(&PL_sv_yes) = new_XPVNV();
10236 SvREFCNT(&PL_sv_yes) = (~(U32)0)/2;
10237 SvFLAGS(&PL_sv_yes) = SVp_NOK|SVf_NOK|SVp_POK|SVf_POK|SVf_READONLY|SVt_PVNV;
10238 SvPVX(&PL_sv_yes) = SAVEPVN(PL_Yes, 1);
10239 SvCUR(&PL_sv_yes) = 1;
10240 SvLEN(&PL_sv_yes) = 2;
10241 SvNVX(&PL_sv_yes) = 1;
10242 ptr_table_store(PL_ptr_table, &proto_perl->Isv_yes, &PL_sv_yes);
10244 /* create (a non-shared!) shared string table */
10245 PL_strtab = newHV();
10246 HvSHAREKEYS_off(PL_strtab);
10247 hv_ksplit(PL_strtab, 512);
10248 ptr_table_store(PL_ptr_table, proto_perl->Istrtab, PL_strtab);
10250 PL_compiling = proto_perl->Icompiling;
10252 /* These two PVs will be free'd special way so must set them same way op.c does */
10253 PL_compiling.cop_stashpv = savesharedpv(PL_compiling.cop_stashpv);
10254 ptr_table_store(PL_ptr_table, proto_perl->Icompiling.cop_stashpv, PL_compiling.cop_stashpv);
10256 PL_compiling.cop_file = savesharedpv(PL_compiling.cop_file);
10257 ptr_table_store(PL_ptr_table, proto_perl->Icompiling.cop_file, PL_compiling.cop_file);
10259 ptr_table_store(PL_ptr_table, &proto_perl->Icompiling, &PL_compiling);
10260 if (!specialWARN(PL_compiling.cop_warnings))
10261 PL_compiling.cop_warnings = sv_dup_inc(PL_compiling.cop_warnings, param);
10262 if (!specialCopIO(PL_compiling.cop_io))
10263 PL_compiling.cop_io = sv_dup_inc(PL_compiling.cop_io, param);
10264 PL_curcop = (COP*)any_dup(proto_perl->Tcurcop, proto_perl);
10266 /* pseudo environmental stuff */
10267 PL_origargc = proto_perl->Iorigargc;
10268 PL_origargv = proto_perl->Iorigargv;
10270 param->stashes = newAV(); /* Setup array of objects to call clone on */
10272 #ifdef PERLIO_LAYERS
10273 /* Clone PerlIO tables as soon as we can handle general xx_dup() */
10274 PerlIO_clone(aTHX_ proto_perl, param);
10277 PL_envgv = gv_dup(proto_perl->Ienvgv, param);
10278 PL_incgv = gv_dup(proto_perl->Iincgv, param);
10279 PL_hintgv = gv_dup(proto_perl->Ihintgv, param);
10280 PL_origfilename = SAVEPV(proto_perl->Iorigfilename);
10281 PL_diehook = sv_dup_inc(proto_perl->Idiehook, param);
10282 PL_warnhook = sv_dup_inc(proto_perl->Iwarnhook, param);
10285 PL_minus_c = proto_perl->Iminus_c;
10286 PL_patchlevel = sv_dup_inc(proto_perl->Ipatchlevel, param);
10287 PL_localpatches = proto_perl->Ilocalpatches;
10288 PL_splitstr = proto_perl->Isplitstr;
10289 PL_preprocess = proto_perl->Ipreprocess;
10290 PL_minus_n = proto_perl->Iminus_n;
10291 PL_minus_p = proto_perl->Iminus_p;
10292 PL_minus_l = proto_perl->Iminus_l;
10293 PL_minus_a = proto_perl->Iminus_a;
10294 PL_minus_F = proto_perl->Iminus_F;
10295 PL_doswitches = proto_perl->Idoswitches;
10296 PL_dowarn = proto_perl->Idowarn;
10297 PL_doextract = proto_perl->Idoextract;
10298 PL_sawampersand = proto_perl->Isawampersand;
10299 PL_unsafe = proto_perl->Iunsafe;
10300 PL_inplace = SAVEPV(proto_perl->Iinplace);
10301 PL_e_script = sv_dup_inc(proto_perl->Ie_script, param);
10302 PL_perldb = proto_perl->Iperldb;
10303 PL_perl_destruct_level = proto_perl->Iperl_destruct_level;
10304 PL_exit_flags = proto_perl->Iexit_flags;
10306 /* magical thingies */
10307 /* XXX time(&PL_basetime) when asked for? */
10308 PL_basetime = proto_perl->Ibasetime;
10309 PL_formfeed = sv_dup(proto_perl->Iformfeed, param);
10311 PL_maxsysfd = proto_perl->Imaxsysfd;
10312 PL_multiline = proto_perl->Imultiline;
10313 PL_statusvalue = proto_perl->Istatusvalue;
10315 PL_statusvalue_vms = proto_perl->Istatusvalue_vms;
10317 PL_encoding = sv_dup(proto_perl->Iencoding, param);
10319 sv_setpvn(PERL_DEBUG_PAD(0), "", 0); /* For regex debugging. */
10320 sv_setpvn(PERL_DEBUG_PAD(1), "", 0); /* ext/re needs these */
10321 sv_setpvn(PERL_DEBUG_PAD(2), "", 0); /* even without DEBUGGING. */
10323 /* Clone the regex array */
10324 PL_regex_padav = newAV();
10326 I32 len = av_len((AV*)proto_perl->Iregex_padav);
10327 SV** regexen = AvARRAY((AV*)proto_perl->Iregex_padav);
10328 av_push(PL_regex_padav,
10329 sv_dup_inc(regexen[0],param));
10330 for(i = 1; i <= len; i++) {
10331 if(SvREPADTMP(regexen[i])) {
10332 av_push(PL_regex_padav, sv_dup_inc(regexen[i], param));
10334 av_push(PL_regex_padav,
10336 newSViv(PTR2IV(re_dup(INT2PTR(REGEXP *,
10337 SvIVX(regexen[i])), param)))
10342 PL_regex_pad = AvARRAY(PL_regex_padav);
10344 /* shortcuts to various I/O objects */
10345 PL_stdingv = gv_dup(proto_perl->Istdingv, param);
10346 PL_stderrgv = gv_dup(proto_perl->Istderrgv, param);
10347 PL_defgv = gv_dup(proto_perl->Idefgv, param);
10348 PL_argvgv = gv_dup(proto_perl->Iargvgv, param);
10349 PL_argvoutgv = gv_dup(proto_perl->Iargvoutgv, param);
10350 PL_argvout_stack = av_dup_inc(proto_perl->Iargvout_stack, param);
10352 /* shortcuts to regexp stuff */
10353 PL_replgv = gv_dup(proto_perl->Ireplgv, param);
10355 /* shortcuts to misc objects */
10356 PL_errgv = gv_dup(proto_perl->Ierrgv, param);
10358 /* shortcuts to debugging objects */
10359 PL_DBgv = gv_dup(proto_perl->IDBgv, param);
10360 PL_DBline = gv_dup(proto_perl->IDBline, param);
10361 PL_DBsub = gv_dup(proto_perl->IDBsub, param);
10362 PL_DBsingle = sv_dup(proto_perl->IDBsingle, param);
10363 PL_DBtrace = sv_dup(proto_perl->IDBtrace, param);
10364 PL_DBsignal = sv_dup(proto_perl->IDBsignal, param);
10365 PL_lineary = av_dup(proto_perl->Ilineary, param);
10366 PL_dbargs = av_dup(proto_perl->Idbargs, param);
10368 /* symbol tables */
10369 PL_defstash = hv_dup_inc(proto_perl->Tdefstash, param);
10370 PL_curstash = hv_dup(proto_perl->Tcurstash, param);
10371 PL_debstash = hv_dup(proto_perl->Idebstash, param);
10372 PL_globalstash = hv_dup(proto_perl->Iglobalstash, param);
10373 PL_curstname = sv_dup_inc(proto_perl->Icurstname, param);
10375 PL_beginav = av_dup_inc(proto_perl->Ibeginav, param);
10376 PL_beginav_save = av_dup_inc(proto_perl->Ibeginav_save, param);
10377 PL_checkav_save = av_dup_inc(proto_perl->Icheckav_save, param);
10378 PL_endav = av_dup_inc(proto_perl->Iendav, param);
10379 PL_checkav = av_dup_inc(proto_perl->Icheckav, param);
10380 PL_initav = av_dup_inc(proto_perl->Iinitav, param);
10382 PL_sub_generation = proto_perl->Isub_generation;
10384 /* funky return mechanisms */
10385 PL_forkprocess = proto_perl->Iforkprocess;
10387 /* subprocess state */
10388 PL_fdpid = av_dup_inc(proto_perl->Ifdpid, param);
10390 /* internal state */
10391 PL_tainting = proto_perl->Itainting;
10392 PL_maxo = proto_perl->Imaxo;
10393 if (proto_perl->Iop_mask)
10394 PL_op_mask = SAVEPVN(proto_perl->Iop_mask, PL_maxo);
10396 PL_op_mask = Nullch;
10398 /* current interpreter roots */
10399 PL_main_cv = cv_dup_inc(proto_perl->Imain_cv, param);
10400 PL_main_root = OpREFCNT_inc(proto_perl->Imain_root);
10401 PL_main_start = proto_perl->Imain_start;
10402 PL_eval_root = proto_perl->Ieval_root;
10403 PL_eval_start = proto_perl->Ieval_start;
10405 /* runtime control stuff */
10406 PL_curcopdb = (COP*)any_dup(proto_perl->Icurcopdb, proto_perl);
10407 PL_copline = proto_perl->Icopline;
10409 PL_filemode = proto_perl->Ifilemode;
10410 PL_lastfd = proto_perl->Ilastfd;
10411 PL_oldname = proto_perl->Ioldname; /* XXX not quite right */
10414 PL_gensym = proto_perl->Igensym;
10415 PL_preambled = proto_perl->Ipreambled;
10416 PL_preambleav = av_dup_inc(proto_perl->Ipreambleav, param);
10417 PL_laststatval = proto_perl->Ilaststatval;
10418 PL_laststype = proto_perl->Ilaststype;
10419 PL_mess_sv = Nullsv;
10421 PL_ors_sv = sv_dup_inc(proto_perl->Iors_sv, param);
10422 PL_ofmt = SAVEPV(proto_perl->Iofmt);
10424 /* interpreter atexit processing */
10425 PL_exitlistlen = proto_perl->Iexitlistlen;
10426 if (PL_exitlistlen) {
10427 New(0, PL_exitlist, PL_exitlistlen, PerlExitListEntry);
10428 Copy(proto_perl->Iexitlist, PL_exitlist, PL_exitlistlen, PerlExitListEntry);
10431 PL_exitlist = (PerlExitListEntry*)NULL;
10432 PL_modglobal = hv_dup_inc(proto_perl->Imodglobal, param);
10433 PL_custom_op_names = hv_dup_inc(proto_perl->Icustom_op_names,param);
10434 PL_custom_op_descs = hv_dup_inc(proto_perl->Icustom_op_descs,param);
10436 PL_profiledata = NULL;
10437 PL_rsfp = fp_dup(proto_perl->Irsfp, '<', param);
10438 /* PL_rsfp_filters entries have fake IoDIRP() */
10439 PL_rsfp_filters = av_dup_inc(proto_perl->Irsfp_filters, param);
10441 PL_compcv = cv_dup(proto_perl->Icompcv, param);
10443 PAD_CLONE_VARS(proto_perl, param);
10445 #ifdef HAVE_INTERP_INTERN
10446 sys_intern_dup(&proto_perl->Isys_intern, &PL_sys_intern);
10449 /* more statics moved here */
10450 PL_generation = proto_perl->Igeneration;
10451 PL_DBcv = cv_dup(proto_perl->IDBcv, param);
10453 PL_in_clean_objs = proto_perl->Iin_clean_objs;
10454 PL_in_clean_all = proto_perl->Iin_clean_all;
10456 PL_uid = proto_perl->Iuid;
10457 PL_euid = proto_perl->Ieuid;
10458 PL_gid = proto_perl->Igid;
10459 PL_egid = proto_perl->Iegid;
10460 PL_nomemok = proto_perl->Inomemok;
10461 PL_an = proto_perl->Ian;
10462 PL_op_seqmax = proto_perl->Iop_seqmax;
10463 PL_evalseq = proto_perl->Ievalseq;
10464 PL_origenviron = proto_perl->Iorigenviron; /* XXX not quite right */
10465 PL_origalen = proto_perl->Iorigalen;
10466 PL_pidstatus = newHV(); /* XXX flag for cloning? */
10467 PL_osname = SAVEPV(proto_perl->Iosname);
10468 PL_sh_path = proto_perl->Ish_path; /* XXX never deallocated */
10469 PL_sighandlerp = proto_perl->Isighandlerp;
10472 PL_runops = proto_perl->Irunops;
10474 Copy(proto_perl->Itokenbuf, PL_tokenbuf, 256, char);
10477 PL_cshlen = proto_perl->Icshlen;
10478 PL_cshname = proto_perl->Icshname; /* XXX never deallocated */
10481 PL_lex_state = proto_perl->Ilex_state;
10482 PL_lex_defer = proto_perl->Ilex_defer;
10483 PL_lex_expect = proto_perl->Ilex_expect;
10484 PL_lex_formbrack = proto_perl->Ilex_formbrack;
10485 PL_lex_dojoin = proto_perl->Ilex_dojoin;
10486 PL_lex_starts = proto_perl->Ilex_starts;
10487 PL_lex_stuff = sv_dup_inc(proto_perl->Ilex_stuff, param);
10488 PL_lex_repl = sv_dup_inc(proto_perl->Ilex_repl, param);
10489 PL_lex_op = proto_perl->Ilex_op;
10490 PL_lex_inpat = proto_perl->Ilex_inpat;
10491 PL_lex_inwhat = proto_perl->Ilex_inwhat;
10492 PL_lex_brackets = proto_perl->Ilex_brackets;
10493 i = (PL_lex_brackets < 120 ? 120 : PL_lex_brackets);
10494 PL_lex_brackstack = SAVEPVN(proto_perl->Ilex_brackstack,i);
10495 PL_lex_casemods = proto_perl->Ilex_casemods;
10496 i = (PL_lex_casemods < 12 ? 12 : PL_lex_casemods);
10497 PL_lex_casestack = SAVEPVN(proto_perl->Ilex_casestack,i);
10499 Copy(proto_perl->Inextval, PL_nextval, 5, YYSTYPE);
10500 Copy(proto_perl->Inexttype, PL_nexttype, 5, I32);
10501 PL_nexttoke = proto_perl->Inexttoke;
10503 /* XXX This is probably masking the deeper issue of why
10504 * SvANY(proto_perl->Ilinestr) can be NULL at this point. For test case:
10505 * http://archive.develooper.com/perl5-porters%40perl.org/msg83298.html
10506 * (A little debugging with a watchpoint on it may help.)
10508 if (SvANY(proto_perl->Ilinestr)) {
10509 PL_linestr = sv_dup_inc(proto_perl->Ilinestr, param);
10510 i = proto_perl->Ibufptr - SvPVX(proto_perl->Ilinestr);
10511 PL_bufptr = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
10512 i = proto_perl->Ioldbufptr - SvPVX(proto_perl->Ilinestr);
10513 PL_oldbufptr = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
10514 i = proto_perl->Ioldoldbufptr - SvPVX(proto_perl->Ilinestr);
10515 PL_oldoldbufptr = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
10516 i = proto_perl->Ilinestart - SvPVX(proto_perl->Ilinestr);
10517 PL_linestart = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
10520 PL_linestr = NEWSV(65,79);
10521 sv_upgrade(PL_linestr,SVt_PVIV);
10522 sv_setpvn(PL_linestr,"",0);
10523 PL_bufptr = PL_oldbufptr = PL_oldoldbufptr = PL_linestart = SvPVX(PL_linestr);
10525 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
10526 PL_pending_ident = proto_perl->Ipending_ident;
10527 PL_sublex_info = proto_perl->Isublex_info; /* XXX not quite right */
10529 PL_expect = proto_perl->Iexpect;
10531 PL_multi_start = proto_perl->Imulti_start;
10532 PL_multi_end = proto_perl->Imulti_end;
10533 PL_multi_open = proto_perl->Imulti_open;
10534 PL_multi_close = proto_perl->Imulti_close;
10536 PL_error_count = proto_perl->Ierror_count;
10537 PL_subline = proto_perl->Isubline;
10538 PL_subname = sv_dup_inc(proto_perl->Isubname, param);
10540 /* XXX See comment on SvANY(proto_perl->Ilinestr) above */
10541 if (SvANY(proto_perl->Ilinestr)) {
10542 i = proto_perl->Ilast_uni - SvPVX(proto_perl->Ilinestr);
10543 PL_last_uni = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
10544 i = proto_perl->Ilast_lop - SvPVX(proto_perl->Ilinestr);
10545 PL_last_lop = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
10546 PL_last_lop_op = proto_perl->Ilast_lop_op;
10549 PL_last_uni = SvPVX(PL_linestr);
10550 PL_last_lop = SvPVX(PL_linestr);
10551 PL_last_lop_op = 0;
10553 PL_in_my = proto_perl->Iin_my;
10554 PL_in_my_stash = hv_dup(proto_perl->Iin_my_stash, param);
10556 PL_cryptseen = proto_perl->Icryptseen;
10559 PL_hints = proto_perl->Ihints;
10561 PL_amagic_generation = proto_perl->Iamagic_generation;
10563 #ifdef USE_LOCALE_COLLATE
10564 PL_collation_ix = proto_perl->Icollation_ix;
10565 PL_collation_name = SAVEPV(proto_perl->Icollation_name);
10566 PL_collation_standard = proto_perl->Icollation_standard;
10567 PL_collxfrm_base = proto_perl->Icollxfrm_base;
10568 PL_collxfrm_mult = proto_perl->Icollxfrm_mult;
10569 #endif /* USE_LOCALE_COLLATE */
10571 #ifdef USE_LOCALE_NUMERIC
10572 PL_numeric_name = SAVEPV(proto_perl->Inumeric_name);
10573 PL_numeric_standard = proto_perl->Inumeric_standard;
10574 PL_numeric_local = proto_perl->Inumeric_local;
10575 PL_numeric_radix_sv = sv_dup_inc(proto_perl->Inumeric_radix_sv, param);
10576 #endif /* !USE_LOCALE_NUMERIC */
10578 /* utf8 character classes */
10579 PL_utf8_alnum = sv_dup_inc(proto_perl->Iutf8_alnum, param);
10580 PL_utf8_alnumc = sv_dup_inc(proto_perl->Iutf8_alnumc, param);
10581 PL_utf8_ascii = sv_dup_inc(proto_perl->Iutf8_ascii, param);
10582 PL_utf8_alpha = sv_dup_inc(proto_perl->Iutf8_alpha, param);
10583 PL_utf8_space = sv_dup_inc(proto_perl->Iutf8_space, param);
10584 PL_utf8_cntrl = sv_dup_inc(proto_perl->Iutf8_cntrl, param);
10585 PL_utf8_graph = sv_dup_inc(proto_perl->Iutf8_graph, param);
10586 PL_utf8_digit = sv_dup_inc(proto_perl->Iutf8_digit, param);
10587 PL_utf8_upper = sv_dup_inc(proto_perl->Iutf8_upper, param);
10588 PL_utf8_lower = sv_dup_inc(proto_perl->Iutf8_lower, param);
10589 PL_utf8_print = sv_dup_inc(proto_perl->Iutf8_print, param);
10590 PL_utf8_punct = sv_dup_inc(proto_perl->Iutf8_punct, param);
10591 PL_utf8_xdigit = sv_dup_inc(proto_perl->Iutf8_xdigit, param);
10592 PL_utf8_mark = sv_dup_inc(proto_perl->Iutf8_mark, param);
10593 PL_utf8_toupper = sv_dup_inc(proto_perl->Iutf8_toupper, param);
10594 PL_utf8_totitle = sv_dup_inc(proto_perl->Iutf8_totitle, param);
10595 PL_utf8_tolower = sv_dup_inc(proto_perl->Iutf8_tolower, param);
10596 PL_utf8_tofold = sv_dup_inc(proto_perl->Iutf8_tofold, param);
10597 PL_utf8_idstart = sv_dup_inc(proto_perl->Iutf8_idstart, param);
10598 PL_utf8_idcont = sv_dup_inc(proto_perl->Iutf8_idcont, param);
10601 PL_last_swash_hv = Nullhv; /* reinits on demand */
10602 PL_last_swash_klen = 0;
10603 PL_last_swash_key[0]= '\0';
10604 PL_last_swash_tmps = (U8*)NULL;
10605 PL_last_swash_slen = 0;
10607 /* perly.c globals */
10608 PL_yydebug = proto_perl->Iyydebug;
10609 PL_yynerrs = proto_perl->Iyynerrs;
10610 PL_yyerrflag = proto_perl->Iyyerrflag;
10611 PL_yychar = proto_perl->Iyychar;
10612 PL_yyval = proto_perl->Iyyval;
10613 PL_yylval = proto_perl->Iyylval;
10615 PL_glob_index = proto_perl->Iglob_index;
10616 PL_srand_called = proto_perl->Isrand_called;
10617 PL_uudmap['M'] = 0; /* reinits on demand */
10618 PL_bitcount = Nullch; /* reinits on demand */
10620 if (proto_perl->Ipsig_pend) {
10621 Newz(0, PL_psig_pend, SIG_SIZE, int);
10624 PL_psig_pend = (int*)NULL;
10627 if (proto_perl->Ipsig_ptr) {
10628 Newz(0, PL_psig_ptr, SIG_SIZE, SV*);
10629 Newz(0, PL_psig_name, SIG_SIZE, SV*);
10630 for (i = 1; i < SIG_SIZE; i++) {
10631 PL_psig_ptr[i] = sv_dup_inc(proto_perl->Ipsig_ptr[i], param);
10632 PL_psig_name[i] = sv_dup_inc(proto_perl->Ipsig_name[i], param);
10636 PL_psig_ptr = (SV**)NULL;
10637 PL_psig_name = (SV**)NULL;
10640 /* thrdvar.h stuff */
10642 if (flags & CLONEf_COPY_STACKS) {
10643 /* next allocation will be PL_tmps_stack[PL_tmps_ix+1] */
10644 PL_tmps_ix = proto_perl->Ttmps_ix;
10645 PL_tmps_max = proto_perl->Ttmps_max;
10646 PL_tmps_floor = proto_perl->Ttmps_floor;
10647 Newz(50, PL_tmps_stack, PL_tmps_max, SV*);
10649 while (i <= PL_tmps_ix) {
10650 PL_tmps_stack[i] = sv_dup_inc(proto_perl->Ttmps_stack[i], param);
10654 /* next PUSHMARK() sets *(PL_markstack_ptr+1) */
10655 i = proto_perl->Tmarkstack_max - proto_perl->Tmarkstack;
10656 Newz(54, PL_markstack, i, I32);
10657 PL_markstack_max = PL_markstack + (proto_perl->Tmarkstack_max
10658 - proto_perl->Tmarkstack);
10659 PL_markstack_ptr = PL_markstack + (proto_perl->Tmarkstack_ptr
10660 - proto_perl->Tmarkstack);
10661 Copy(proto_perl->Tmarkstack, PL_markstack,
10662 PL_markstack_ptr - PL_markstack + 1, I32);
10664 /* next push_scope()/ENTER sets PL_scopestack[PL_scopestack_ix]
10665 * NOTE: unlike the others! */
10666 PL_scopestack_ix = proto_perl->Tscopestack_ix;
10667 PL_scopestack_max = proto_perl->Tscopestack_max;
10668 Newz(54, PL_scopestack, PL_scopestack_max, I32);
10669 Copy(proto_perl->Tscopestack, PL_scopestack, PL_scopestack_ix, I32);
10671 /* next push_return() sets PL_retstack[PL_retstack_ix]
10672 * NOTE: unlike the others! */
10673 PL_retstack_ix = proto_perl->Tretstack_ix;
10674 PL_retstack_max = proto_perl->Tretstack_max;
10675 Newz(54, PL_retstack, PL_retstack_max, OP*);
10676 Copy(proto_perl->Tretstack, PL_retstack, PL_retstack_ix, OP*);
10678 /* NOTE: si_dup() looks at PL_markstack */
10679 PL_curstackinfo = si_dup(proto_perl->Tcurstackinfo, param);
10681 /* PL_curstack = PL_curstackinfo->si_stack; */
10682 PL_curstack = av_dup(proto_perl->Tcurstack, param);
10683 PL_mainstack = av_dup(proto_perl->Tmainstack, param);
10685 /* next PUSHs() etc. set *(PL_stack_sp+1) */
10686 PL_stack_base = AvARRAY(PL_curstack);
10687 PL_stack_sp = PL_stack_base + (proto_perl->Tstack_sp
10688 - proto_perl->Tstack_base);
10689 PL_stack_max = PL_stack_base + AvMAX(PL_curstack);
10691 /* next SSPUSHFOO() sets PL_savestack[PL_savestack_ix]
10692 * NOTE: unlike the others! */
10693 PL_savestack_ix = proto_perl->Tsavestack_ix;
10694 PL_savestack_max = proto_perl->Tsavestack_max;
10695 /*Newz(54, PL_savestack, PL_savestack_max, ANY);*/
10696 PL_savestack = ss_dup(proto_perl, param);
10700 ENTER; /* perl_destruct() wants to LEAVE; */
10703 PL_start_env = proto_perl->Tstart_env; /* XXXXXX */
10704 PL_top_env = &PL_start_env;
10706 PL_op = proto_perl->Top;
10709 PL_Xpv = (XPV*)NULL;
10710 PL_na = proto_perl->Tna;
10712 PL_statbuf = proto_perl->Tstatbuf;
10713 PL_statcache = proto_perl->Tstatcache;
10714 PL_statgv = gv_dup(proto_perl->Tstatgv, param);
10715 PL_statname = sv_dup_inc(proto_perl->Tstatname, param);
10717 PL_timesbuf = proto_perl->Ttimesbuf;
10720 PL_tainted = proto_perl->Ttainted;
10721 PL_curpm = proto_perl->Tcurpm; /* XXX No PMOP ref count */
10722 PL_rs = sv_dup_inc(proto_perl->Trs, param);
10723 PL_last_in_gv = gv_dup(proto_perl->Tlast_in_gv, param);
10724 PL_ofs_sv = sv_dup_inc(proto_perl->Tofs_sv, param);
10725 PL_defoutgv = gv_dup_inc(proto_perl->Tdefoutgv, param);
10726 PL_chopset = proto_perl->Tchopset; /* XXX never deallocated */
10727 PL_toptarget = sv_dup_inc(proto_perl->Ttoptarget, param);
10728 PL_bodytarget = sv_dup_inc(proto_perl->Tbodytarget, param);
10729 PL_formtarget = sv_dup(proto_perl->Tformtarget, param);
10731 PL_restartop = proto_perl->Trestartop;
10732 PL_in_eval = proto_perl->Tin_eval;
10733 PL_delaymagic = proto_perl->Tdelaymagic;
10734 PL_dirty = proto_perl->Tdirty;
10735 PL_localizing = proto_perl->Tlocalizing;
10737 #ifdef PERL_FLEXIBLE_EXCEPTIONS
10738 PL_protect = proto_perl->Tprotect;
10740 PL_errors = sv_dup_inc(proto_perl->Terrors, param);
10741 PL_av_fetch_sv = Nullsv;
10742 PL_hv_fetch_sv = Nullsv;
10743 Zero(&PL_hv_fetch_ent_mh, 1, HE); /* XXX */
10744 PL_modcount = proto_perl->Tmodcount;
10745 PL_lastgotoprobe = Nullop;
10746 PL_dumpindent = proto_perl->Tdumpindent;
10748 PL_sortcop = (OP*)any_dup(proto_perl->Tsortcop, proto_perl);
10749 PL_sortstash = hv_dup(proto_perl->Tsortstash, param);
10750 PL_firstgv = gv_dup(proto_perl->Tfirstgv, param);
10751 PL_secondgv = gv_dup(proto_perl->Tsecondgv, param);
10752 PL_sortcxix = proto_perl->Tsortcxix;
10753 PL_efloatbuf = Nullch; /* reinits on demand */
10754 PL_efloatsize = 0; /* reinits on demand */
10758 PL_screamfirst = NULL;
10759 PL_screamnext = NULL;
10760 PL_maxscream = -1; /* reinits on demand */
10761 PL_lastscream = Nullsv;
10763 PL_watchaddr = NULL;
10764 PL_watchok = Nullch;
10766 PL_regdummy = proto_perl->Tregdummy;
10767 PL_regcomp_parse = Nullch;
10768 PL_regxend = Nullch;
10769 PL_regcode = (regnode*)NULL;
10772 PL_regprecomp = Nullch;
10777 PL_seen_zerolen = 0;
10779 PL_regcomp_rx = (regexp*)NULL;
10781 PL_colorset = 0; /* reinits PL_colors[] */
10782 /*PL_colors[6] = {0,0,0,0,0,0};*/
10783 PL_reg_whilem_seen = 0;
10784 PL_reginput = Nullch;
10785 PL_regbol = Nullch;
10786 PL_regeol = Nullch;
10787 PL_regstartp = (I32*)NULL;
10788 PL_regendp = (I32*)NULL;
10789 PL_reglastparen = (U32*)NULL;
10790 PL_regtill = Nullch;
10791 PL_reg_start_tmp = (char**)NULL;
10792 PL_reg_start_tmpl = 0;
10793 PL_regdata = (struct reg_data*)NULL;
10796 PL_reg_eval_set = 0;
10798 PL_regprogram = (regnode*)NULL;
10800 PL_regcc = (CURCUR*)NULL;
10801 PL_reg_call_cc = (struct re_cc_state*)NULL;
10802 PL_reg_re = (regexp*)NULL;
10803 PL_reg_ganch = Nullch;
10804 PL_reg_sv = Nullsv;
10805 PL_reg_match_utf8 = FALSE;
10806 PL_reg_magic = (MAGIC*)NULL;
10808 PL_reg_oldcurpm = (PMOP*)NULL;
10809 PL_reg_curpm = (PMOP*)NULL;
10810 PL_reg_oldsaved = Nullch;
10811 PL_reg_oldsavedlen = 0;
10812 PL_reg_maxiter = 0;
10813 PL_reg_leftiter = 0;
10814 PL_reg_poscache = Nullch;
10815 PL_reg_poscache_size= 0;
10817 /* RE engine - function pointers */
10818 PL_regcompp = proto_perl->Tregcompp;
10819 PL_regexecp = proto_perl->Tregexecp;
10820 PL_regint_start = proto_perl->Tregint_start;
10821 PL_regint_string = proto_perl->Tregint_string;
10822 PL_regfree = proto_perl->Tregfree;
10824 PL_reginterp_cnt = 0;
10825 PL_reg_starttry = 0;
10827 /* Pluggable optimizer */
10828 PL_peepp = proto_perl->Tpeepp;
10830 if (!(flags & CLONEf_KEEP_PTR_TABLE)) {
10831 ptr_table_free(PL_ptr_table);
10832 PL_ptr_table = NULL;
10835 /* Call the ->CLONE method, if it exists, for each of the stashes
10836 identified by sv_dup() above.
10838 while(av_len(param->stashes) != -1) {
10839 HV* stash = (HV*) av_shift(param->stashes);
10840 GV* cloner = gv_fetchmethod_autoload(stash, "CLONE", 0);
10841 if (cloner && GvCV(cloner)) {
10846 XPUSHs(sv_2mortal(newSVpv(HvNAME(stash), 0)));
10848 call_sv((SV*)GvCV(cloner), G_DISCARD);
10854 SvREFCNT_dec(param->stashes);
10859 #endif /* USE_ITHREADS */
10862 =head1 Unicode Support
10864 =for apidoc sv_recode_to_utf8
10866 The encoding is assumed to be an Encode object, on entry the PV
10867 of the sv is assumed to be octets in that encoding, and the sv
10868 will be converted into Unicode (and UTF-8).
10870 If the sv already is UTF-8 (or if it is not POK), or if the encoding
10871 is not a reference, nothing is done to the sv. If the encoding is not
10872 an C<Encode::XS> Encoding object, bad things will happen.
10873 (See F<lib/encoding.pm> and L<Encode>).
10875 The PV of the sv is returned.
10880 Perl_sv_recode_to_utf8(pTHX_ SV *sv, SV *encoding)
10882 if (SvPOK(sv) && !DO_UTF8(sv) && SvROK(encoding)) {
10896 Passing sv_yes is wrong - it needs to be or'ed set of constants
10897 for Encode::XS, while UTf-8 decode (currently) assumes a true value means
10898 remove converted chars from source.
10900 Both will default the value - let them.
10902 XPUSHs(&PL_sv_yes);
10905 call_method("decode", G_SCALAR);
10909 s = SvPV(uni, len);
10911 U8 *t = (U8 *)s, *e = (U8 *)s + len;
10913 if ((vary = !UTF8_IS_INVARIANT(*t++)))
10917 if (s != SvPVX(sv)) {
10918 SvGROW(sv, len + 1);
10919 Move(s, SvPVX(sv), len, char);
10920 SvCUR_set(sv, len);
10921 SvPVX(sv)[len] = 0;