3 * Copyright (c) 1991-2003, 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-
33 /* ============================================================================
35 =head1 Allocation and deallocation of SVs.
37 An SV (or AV, HV, etc.) is allocated in two parts: the head (struct sv,
38 av, hv...) contains type and reference count information, as well as a
39 pointer to the body (struct xrv, xpv, xpviv...), which contains fields
40 specific to each type.
42 Normally, this allocation is done using arenas, which are approximately
43 1K chunks of memory parcelled up into N heads or bodies. The first slot
44 in each arena is reserved, and is used to hold a link to the next arena.
45 In the case of heads, the unused first slot also contains some flags and
46 a note of the number of slots. Snaked through each arena chain is a
47 linked list of free items; when this becomes empty, an extra arena is
48 allocated and divided up into N items which are threaded into the free
51 The following global variables are associated with arenas:
53 PL_sv_arenaroot pointer to list of SV arenas
54 PL_sv_root pointer to list of free SV structures
56 PL_foo_arenaroot pointer to list of foo arenas,
57 PL_foo_root pointer to list of free foo bodies
58 ... for foo in xiv, xnv, xrv, xpv etc.
60 Note that some of the larger and more rarely used body types (eg xpvio)
61 are not allocated using arenas, but are instead just malloc()/free()ed as
62 required. Also, if PURIFY is defined, arenas are abandoned altogether,
63 with all items individually malloc()ed. In addition, a few SV heads are
64 not allocated from an arena, but are instead directly created as static
65 or auto variables, eg PL_sv_undef.
67 The SV arena serves the secondary purpose of allowing still-live SVs
68 to be located and destroyed during final cleanup.
70 At the lowest level, the macros new_SV() and del_SV() grab and free
71 an SV head. (If debugging with -DD, del_SV() calls the function S_del_sv()
72 to return the SV to the free list with error checking.) new_SV() calls
73 more_sv() / sv_add_arena() to add an extra arena if the free list is empty.
74 SVs in the free list have their SvTYPE field set to all ones.
76 Similarly, there are macros new_XIV()/del_XIV(), new_XNV()/del_XNV() etc
77 that allocate and return individual body types. Normally these are mapped
78 to the arena-manipulating functions new_xiv()/del_xiv() etc, but may be
79 instead mapped directly to malloc()/free() if PURIFY is defined. The
80 new/del functions remove from, or add to, the appropriate PL_foo_root
81 list, and call more_xiv() etc to add a new arena if the list is empty.
83 At the time of very final cleanup, sv_free_arenas() is called from
84 perl_destruct() to physically free all the arenas allocated since the
85 start of the interpreter. Note that this also clears PL_he_arenaroot,
86 which is otherwise dealt with in hv.c.
88 Manipulation of any of the PL_*root pointers is protected by enclosing
89 LOCK_SV_MUTEX; ... UNLOCK_SV_MUTEX calls which should Do the Right Thing
90 if threads are enabled.
92 The function visit() scans the SV arenas list, and calls a specified
93 function for each SV it finds which is still live - ie which has an SvTYPE
94 other than all 1's, and a non-zero SvREFCNT. visit() is used by the
95 following functions (specified as [function that calls visit()] / [function
96 called by visit() for each SV]):
98 sv_report_used() / do_report_used()
99 dump all remaining SVs (debugging aid)
101 sv_clean_objs() / do_clean_objs(),do_clean_named_objs()
102 Attempt to free all objects pointed to by RVs,
103 and, unless DISABLE_DESTRUCTOR_KLUDGE is defined,
104 try to do the same for all objects indirectly
105 referenced by typeglobs too. Called once from
106 perl_destruct(), prior to calling sv_clean_all()
109 sv_clean_all() / do_clean_all()
110 SvREFCNT_dec(sv) each remaining SV, possibly
111 triggering an sv_free(). It also sets the
112 SVf_BREAK flag on the SV to indicate that the
113 refcnt has been artificially lowered, and thus
114 stopping sv_free() from giving spurious warnings
115 about SVs which unexpectedly have a refcnt
116 of zero. called repeatedly from perl_destruct()
117 until there are no SVs left.
121 Private API to rest of sv.c
125 new_XIV(), del_XIV(),
126 new_XNV(), del_XNV(),
131 sv_report_used(), sv_clean_objs(), sv_clean_all(), sv_free_arenas()
136 ============================================================================ */
141 * "A time to plant, and a time to uproot what was planted..."
144 #define plant_SV(p) \
146 SvANY(p) = (void *)PL_sv_root; \
147 SvFLAGS(p) = SVTYPEMASK; \
152 /* sv_mutex must be held while calling uproot_SV() */
153 #define uproot_SV(p) \
156 PL_sv_root = (SV*)SvANY(p); \
161 /* new_SV(): return a new, empty SV head */
163 #ifdef DEBUG_LEAKING_SCALARS
164 /* provide a real function for a debugger to play with */
181 # define new_SV(p) (p)=S_new_SV(aTHX)
199 /* del_SV(): return an empty SV head to the free list */
214 S_del_sv(pTHX_ SV *p)
221 for (sva = PL_sv_arenaroot; sva; sva = (SV *) SvANY(sva)) {
223 svend = &sva[SvREFCNT(sva)];
224 if (p >= sv && p < svend)
228 if (ckWARN_d(WARN_INTERNAL))
229 Perl_warner(aTHX_ packWARN(WARN_INTERNAL),
230 "Attempt to free non-arena SV: 0x%"UVxf,
238 #else /* ! DEBUGGING */
240 #define del_SV(p) plant_SV(p)
242 #endif /* DEBUGGING */
246 =head1 SV Manipulation Functions
248 =for apidoc sv_add_arena
250 Given a chunk of memory, link it to the head of the list of arenas,
251 and split it into a list of free SVs.
257 Perl_sv_add_arena(pTHX_ char *ptr, U32 size, U32 flags)
262 Zero(ptr, size, char);
264 /* The first SV in an arena isn't an SV. */
265 SvANY(sva) = (void *) PL_sv_arenaroot; /* ptr to next arena */
266 SvREFCNT(sva) = size / sizeof(SV); /* number of SV slots */
267 SvFLAGS(sva) = flags; /* FAKE if not to be freed */
269 PL_sv_arenaroot = sva;
270 PL_sv_root = sva + 1;
272 svend = &sva[SvREFCNT(sva) - 1];
275 SvANY(sv) = (void *)(SV*)(sv + 1);
276 SvFLAGS(sv) = SVTYPEMASK;
280 SvFLAGS(sv) = SVTYPEMASK;
283 /* make some more SVs by adding another arena */
285 /* sv_mutex must be held while calling more_sv() */
292 sv_add_arena(PL_nice_chunk, PL_nice_chunk_size, 0);
293 PL_nice_chunk = Nullch;
294 PL_nice_chunk_size = 0;
297 char *chunk; /* must use New here to match call to */
298 New(704,chunk,1008,char); /* Safefree() in sv_free_arenas() */
299 sv_add_arena(chunk, 1008, 0);
305 /* visit(): call the named function for each non-free SV in the arenas. */
308 S_visit(pTHX_ SVFUNC_t f)
315 for (sva = PL_sv_arenaroot; sva; sva = (SV*)SvANY(sva)) {
316 svend = &sva[SvREFCNT(sva)];
317 for (sv = sva + 1; sv < svend; ++sv) {
318 if (SvTYPE(sv) != SVTYPEMASK && SvREFCNT(sv)) {
329 /* called by sv_report_used() for each live SV */
332 do_report_used(pTHX_ SV *sv)
334 if (SvTYPE(sv) != SVTYPEMASK) {
335 PerlIO_printf(Perl_debug_log, "****\n");
342 =for apidoc sv_report_used
344 Dump the contents of all SVs not yet freed. (Debugging aid).
350 Perl_sv_report_used(pTHX)
353 visit(do_report_used);
357 /* called by sv_clean_objs() for each live SV */
360 do_clean_objs(pTHX_ SV *sv)
364 if (SvROK(sv) && SvOBJECT(rv = SvRV(sv))) {
365 DEBUG_D((PerlIO_printf(Perl_debug_log, "Cleaning object ref:\n "), sv_dump(sv)));
377 /* XXX Might want to check arrays, etc. */
380 /* called by sv_clean_objs() for each live SV */
382 #ifndef DISABLE_DESTRUCTOR_KLUDGE
384 do_clean_named_objs(pTHX_ SV *sv)
386 if (SvTYPE(sv) == SVt_PVGV && GvGP(sv)) {
387 if ( SvOBJECT(GvSV(sv)) ||
388 (GvAV(sv) && SvOBJECT(GvAV(sv))) ||
389 (GvHV(sv) && SvOBJECT(GvHV(sv))) ||
390 (GvIO(sv) && SvOBJECT(GvIO(sv))) ||
391 (GvCV(sv) && SvOBJECT(GvCV(sv))) )
393 DEBUG_D((PerlIO_printf(Perl_debug_log, "Cleaning named glob object:\n "), sv_dump(sv)));
401 =for apidoc sv_clean_objs
403 Attempt to destroy all objects not yet freed
409 Perl_sv_clean_objs(pTHX)
411 PL_in_clean_objs = TRUE;
412 visit(do_clean_objs);
413 #ifndef DISABLE_DESTRUCTOR_KLUDGE
414 /* some barnacles may yet remain, clinging to typeglobs */
415 visit(do_clean_named_objs);
417 PL_in_clean_objs = FALSE;
420 /* called by sv_clean_all() for each live SV */
423 do_clean_all(pTHX_ SV *sv)
425 DEBUG_D((PerlIO_printf(Perl_debug_log, "Cleaning loops: SV at 0x%"UVxf"\n", PTR2UV(sv)) ));
426 SvFLAGS(sv) |= SVf_BREAK;
431 =for apidoc sv_clean_all
433 Decrement the refcnt of each remaining SV, possibly triggering a
434 cleanup. This function may have to be called multiple times to free
435 SVs which are in complex self-referential hierarchies.
441 Perl_sv_clean_all(pTHX)
444 PL_in_clean_all = TRUE;
445 cleaned = visit(do_clean_all);
446 PL_in_clean_all = FALSE;
451 =for apidoc sv_free_arenas
453 Deallocate the memory used by all arenas. Note that all the individual SV
454 heads and bodies within the arenas must already have been freed.
460 Perl_sv_free_arenas(pTHX)
464 XPV *arena, *arenanext;
466 /* Free arenas here, but be careful about fake ones. (We assume
467 contiguity of the fake ones with the corresponding real ones.) */
469 for (sva = PL_sv_arenaroot; sva; sva = svanext) {
470 svanext = (SV*) SvANY(sva);
471 while (svanext && SvFAKE(svanext))
472 svanext = (SV*) SvANY(svanext);
475 Safefree((void *)sva);
478 for (arena = PL_xiv_arenaroot; arena; arena = arenanext) {
479 arenanext = (XPV*)arena->xpv_pv;
482 PL_xiv_arenaroot = 0;
484 for (arena = PL_xnv_arenaroot; arena; arena = arenanext) {
485 arenanext = (XPV*)arena->xpv_pv;
488 PL_xnv_arenaroot = 0;
490 for (arena = PL_xrv_arenaroot; arena; arena = arenanext) {
491 arenanext = (XPV*)arena->xpv_pv;
494 PL_xrv_arenaroot = 0;
496 for (arena = PL_xpv_arenaroot; arena; arena = arenanext) {
497 arenanext = (XPV*)arena->xpv_pv;
500 PL_xpv_arenaroot = 0;
502 for (arena = (XPV*)PL_xpviv_arenaroot; arena; arena = arenanext) {
503 arenanext = (XPV*)arena->xpv_pv;
506 PL_xpviv_arenaroot = 0;
508 for (arena = (XPV*)PL_xpvnv_arenaroot; arena; arena = arenanext) {
509 arenanext = (XPV*)arena->xpv_pv;
512 PL_xpvnv_arenaroot = 0;
514 for (arena = (XPV*)PL_xpvcv_arenaroot; arena; arena = arenanext) {
515 arenanext = (XPV*)arena->xpv_pv;
518 PL_xpvcv_arenaroot = 0;
520 for (arena = (XPV*)PL_xpvav_arenaroot; arena; arena = arenanext) {
521 arenanext = (XPV*)arena->xpv_pv;
524 PL_xpvav_arenaroot = 0;
526 for (arena = (XPV*)PL_xpvhv_arenaroot; arena; arena = arenanext) {
527 arenanext = (XPV*)arena->xpv_pv;
530 PL_xpvhv_arenaroot = 0;
532 for (arena = (XPV*)PL_xpvmg_arenaroot; arena; arena = arenanext) {
533 arenanext = (XPV*)arena->xpv_pv;
536 PL_xpvmg_arenaroot = 0;
538 for (arena = (XPV*)PL_xpvlv_arenaroot; arena; arena = arenanext) {
539 arenanext = (XPV*)arena->xpv_pv;
542 PL_xpvlv_arenaroot = 0;
544 for (arena = (XPV*)PL_xpvbm_arenaroot; arena; arena = arenanext) {
545 arenanext = (XPV*)arena->xpv_pv;
548 PL_xpvbm_arenaroot = 0;
550 for (arena = (XPV*)PL_he_arenaroot; arena; arena = arenanext) {
551 arenanext = (XPV*)arena->xpv_pv;
557 Safefree(PL_nice_chunk);
558 PL_nice_chunk = Nullch;
559 PL_nice_chunk_size = 0;
565 =for apidoc report_uninit
567 Print appropriate "Use of uninitialized variable" warning
573 Perl_report_uninit(pTHX)
576 Perl_warner(aTHX_ packWARN(WARN_UNINITIALIZED), PL_warn_uninit,
577 " in ", OP_DESC(PL_op));
579 Perl_warner(aTHX_ packWARN(WARN_UNINITIALIZED), PL_warn_uninit, "", "");
582 /* grab a new IV body from the free list, allocating more if necessary */
593 * See comment in more_xiv() -- RAM.
595 PL_xiv_root = *(IV**)xiv;
597 return (XPVIV*)((char*)xiv - STRUCT_OFFSET(XPVIV, xiv_iv));
600 /* return an IV body to the free list */
603 S_del_xiv(pTHX_ XPVIV *p)
605 IV* xiv = (IV*)((char*)(p) + STRUCT_OFFSET(XPVIV, xiv_iv));
607 *(IV**)xiv = PL_xiv_root;
612 /* allocate another arena's worth of IV bodies */
620 New(705, ptr, 1008/sizeof(XPV), XPV);
621 ptr->xpv_pv = (char*)PL_xiv_arenaroot; /* linked list of xiv arenas */
622 PL_xiv_arenaroot = ptr; /* to keep Purify happy */
625 xivend = &xiv[1008 / sizeof(IV) - 1];
626 xiv += (sizeof(XPV) - 1) / sizeof(IV) + 1; /* fudge by size of XPV */
628 while (xiv < xivend) {
629 *(IV**)xiv = (IV *)(xiv + 1);
635 /* grab a new NV body from the free list, allocating more if necessary */
645 PL_xnv_root = *(NV**)xnv;
647 return (XPVNV*)((char*)xnv - STRUCT_OFFSET(XPVNV, xnv_nv));
650 /* return an NV body to the free list */
653 S_del_xnv(pTHX_ XPVNV *p)
655 NV* xnv = (NV*)((char*)(p) + STRUCT_OFFSET(XPVNV, xnv_nv));
657 *(NV**)xnv = PL_xnv_root;
662 /* allocate another arena's worth of NV bodies */
670 New(711, ptr, 1008/sizeof(XPV), XPV);
671 ptr->xpv_pv = (char*)PL_xnv_arenaroot;
672 PL_xnv_arenaroot = ptr;
675 xnvend = &xnv[1008 / sizeof(NV) - 1];
676 xnv += (sizeof(XPVIV) - 1) / sizeof(NV) + 1; /* fudge by sizeof XPVIV */
678 while (xnv < xnvend) {
679 *(NV**)xnv = (NV*)(xnv + 1);
685 /* grab a new struct xrv from the free list, allocating more if necessary */
695 PL_xrv_root = (XRV*)xrv->xrv_rv;
700 /* return a struct xrv to the free list */
703 S_del_xrv(pTHX_ XRV *p)
706 p->xrv_rv = (SV*)PL_xrv_root;
711 /* allocate another arena's worth of struct xrv */
717 register XRV* xrvend;
719 New(712, ptr, 1008/sizeof(XPV), XPV);
720 ptr->xpv_pv = (char*)PL_xrv_arenaroot;
721 PL_xrv_arenaroot = ptr;
724 xrvend = &xrv[1008 / sizeof(XRV) - 1];
725 xrv += (sizeof(XPV) - 1) / sizeof(XRV) + 1;
727 while (xrv < xrvend) {
728 xrv->xrv_rv = (SV*)(xrv + 1);
734 /* grab a new struct xpv from the free list, allocating more if necessary */
744 PL_xpv_root = (XPV*)xpv->xpv_pv;
749 /* return a struct xpv to the free list */
752 S_del_xpv(pTHX_ XPV *p)
755 p->xpv_pv = (char*)PL_xpv_root;
760 /* allocate another arena's worth of struct xpv */
766 register XPV* xpvend;
767 New(713, xpv, 1008/sizeof(XPV), XPV);
768 xpv->xpv_pv = (char*)PL_xpv_arenaroot;
769 PL_xpv_arenaroot = xpv;
771 xpvend = &xpv[1008 / sizeof(XPV) - 1];
773 while (xpv < xpvend) {
774 xpv->xpv_pv = (char*)(xpv + 1);
780 /* grab a new struct xpviv from the free list, allocating more if necessary */
789 xpviv = PL_xpviv_root;
790 PL_xpviv_root = (XPVIV*)xpviv->xpv_pv;
795 /* return a struct xpviv to the free list */
798 S_del_xpviv(pTHX_ XPVIV *p)
801 p->xpv_pv = (char*)PL_xpviv_root;
806 /* allocate another arena's worth of struct xpviv */
811 register XPVIV* xpviv;
812 register XPVIV* xpvivend;
813 New(714, xpviv, 1008/sizeof(XPVIV), XPVIV);
814 xpviv->xpv_pv = (char*)PL_xpviv_arenaroot;
815 PL_xpviv_arenaroot = xpviv;
817 xpvivend = &xpviv[1008 / sizeof(XPVIV) - 1];
818 PL_xpviv_root = ++xpviv;
819 while (xpviv < xpvivend) {
820 xpviv->xpv_pv = (char*)(xpviv + 1);
826 /* grab a new struct xpvnv from the free list, allocating more if necessary */
835 xpvnv = PL_xpvnv_root;
836 PL_xpvnv_root = (XPVNV*)xpvnv->xpv_pv;
841 /* return a struct xpvnv to the free list */
844 S_del_xpvnv(pTHX_ XPVNV *p)
847 p->xpv_pv = (char*)PL_xpvnv_root;
852 /* allocate another arena's worth of struct xpvnv */
857 register XPVNV* xpvnv;
858 register XPVNV* xpvnvend;
859 New(715, xpvnv, 1008/sizeof(XPVNV), XPVNV);
860 xpvnv->xpv_pv = (char*)PL_xpvnv_arenaroot;
861 PL_xpvnv_arenaroot = xpvnv;
863 xpvnvend = &xpvnv[1008 / sizeof(XPVNV) - 1];
864 PL_xpvnv_root = ++xpvnv;
865 while (xpvnv < xpvnvend) {
866 xpvnv->xpv_pv = (char*)(xpvnv + 1);
872 /* grab a new struct xpvcv from the free list, allocating more if necessary */
881 xpvcv = PL_xpvcv_root;
882 PL_xpvcv_root = (XPVCV*)xpvcv->xpv_pv;
887 /* return a struct xpvcv to the free list */
890 S_del_xpvcv(pTHX_ XPVCV *p)
893 p->xpv_pv = (char*)PL_xpvcv_root;
898 /* allocate another arena's worth of struct xpvcv */
903 register XPVCV* xpvcv;
904 register XPVCV* xpvcvend;
905 New(716, xpvcv, 1008/sizeof(XPVCV), XPVCV);
906 xpvcv->xpv_pv = (char*)PL_xpvcv_arenaroot;
907 PL_xpvcv_arenaroot = xpvcv;
909 xpvcvend = &xpvcv[1008 / sizeof(XPVCV) - 1];
910 PL_xpvcv_root = ++xpvcv;
911 while (xpvcv < xpvcvend) {
912 xpvcv->xpv_pv = (char*)(xpvcv + 1);
918 /* grab a new struct xpvav from the free list, allocating more if necessary */
927 xpvav = PL_xpvav_root;
928 PL_xpvav_root = (XPVAV*)xpvav->xav_array;
933 /* return a struct xpvav to the free list */
936 S_del_xpvav(pTHX_ XPVAV *p)
939 p->xav_array = (char*)PL_xpvav_root;
944 /* allocate another arena's worth of struct xpvav */
949 register XPVAV* xpvav;
950 register XPVAV* xpvavend;
951 New(717, xpvav, 1008/sizeof(XPVAV), XPVAV);
952 xpvav->xav_array = (char*)PL_xpvav_arenaroot;
953 PL_xpvav_arenaroot = xpvav;
955 xpvavend = &xpvav[1008 / sizeof(XPVAV) - 1];
956 PL_xpvav_root = ++xpvav;
957 while (xpvav < xpvavend) {
958 xpvav->xav_array = (char*)(xpvav + 1);
961 xpvav->xav_array = 0;
964 /* grab a new struct xpvhv from the free list, allocating more if necessary */
973 xpvhv = PL_xpvhv_root;
974 PL_xpvhv_root = (XPVHV*)xpvhv->xhv_array;
979 /* return a struct xpvhv to the free list */
982 S_del_xpvhv(pTHX_ XPVHV *p)
985 p->xhv_array = (char*)PL_xpvhv_root;
990 /* allocate another arena's worth of struct xpvhv */
995 register XPVHV* xpvhv;
996 register XPVHV* xpvhvend;
997 New(718, xpvhv, 1008/sizeof(XPVHV), XPVHV);
998 xpvhv->xhv_array = (char*)PL_xpvhv_arenaroot;
999 PL_xpvhv_arenaroot = xpvhv;
1001 xpvhvend = &xpvhv[1008 / sizeof(XPVHV) - 1];
1002 PL_xpvhv_root = ++xpvhv;
1003 while (xpvhv < xpvhvend) {
1004 xpvhv->xhv_array = (char*)(xpvhv + 1);
1007 xpvhv->xhv_array = 0;
1010 /* grab a new struct xpvmg from the free list, allocating more if necessary */
1019 xpvmg = PL_xpvmg_root;
1020 PL_xpvmg_root = (XPVMG*)xpvmg->xpv_pv;
1025 /* return a struct xpvmg to the free list */
1028 S_del_xpvmg(pTHX_ XPVMG *p)
1031 p->xpv_pv = (char*)PL_xpvmg_root;
1036 /* allocate another arena's worth of struct xpvmg */
1041 register XPVMG* xpvmg;
1042 register XPVMG* xpvmgend;
1043 New(719, xpvmg, 1008/sizeof(XPVMG), XPVMG);
1044 xpvmg->xpv_pv = (char*)PL_xpvmg_arenaroot;
1045 PL_xpvmg_arenaroot = xpvmg;
1047 xpvmgend = &xpvmg[1008 / sizeof(XPVMG) - 1];
1048 PL_xpvmg_root = ++xpvmg;
1049 while (xpvmg < xpvmgend) {
1050 xpvmg->xpv_pv = (char*)(xpvmg + 1);
1056 /* grab a new struct xpvlv from the free list, allocating more if necessary */
1065 xpvlv = PL_xpvlv_root;
1066 PL_xpvlv_root = (XPVLV*)xpvlv->xpv_pv;
1071 /* return a struct xpvlv to the free list */
1074 S_del_xpvlv(pTHX_ XPVLV *p)
1077 p->xpv_pv = (char*)PL_xpvlv_root;
1082 /* allocate another arena's worth of struct xpvlv */
1087 register XPVLV* xpvlv;
1088 register XPVLV* xpvlvend;
1089 New(720, xpvlv, 1008/sizeof(XPVLV), XPVLV);
1090 xpvlv->xpv_pv = (char*)PL_xpvlv_arenaroot;
1091 PL_xpvlv_arenaroot = xpvlv;
1093 xpvlvend = &xpvlv[1008 / sizeof(XPVLV) - 1];
1094 PL_xpvlv_root = ++xpvlv;
1095 while (xpvlv < xpvlvend) {
1096 xpvlv->xpv_pv = (char*)(xpvlv + 1);
1102 /* grab a new struct xpvbm from the free list, allocating more if necessary */
1111 xpvbm = PL_xpvbm_root;
1112 PL_xpvbm_root = (XPVBM*)xpvbm->xpv_pv;
1117 /* return a struct xpvbm to the free list */
1120 S_del_xpvbm(pTHX_ XPVBM *p)
1123 p->xpv_pv = (char*)PL_xpvbm_root;
1128 /* allocate another arena's worth of struct xpvbm */
1133 register XPVBM* xpvbm;
1134 register XPVBM* xpvbmend;
1135 New(721, xpvbm, 1008/sizeof(XPVBM), XPVBM);
1136 xpvbm->xpv_pv = (char*)PL_xpvbm_arenaroot;
1137 PL_xpvbm_arenaroot = xpvbm;
1139 xpvbmend = &xpvbm[1008 / sizeof(XPVBM) - 1];
1140 PL_xpvbm_root = ++xpvbm;
1141 while (xpvbm < xpvbmend) {
1142 xpvbm->xpv_pv = (char*)(xpvbm + 1);
1148 #define my_safemalloc(s) (void*)safemalloc(s)
1149 #define my_safefree(p) safefree((char*)p)
1153 #define new_XIV() my_safemalloc(sizeof(XPVIV))
1154 #define del_XIV(p) my_safefree(p)
1156 #define new_XNV() my_safemalloc(sizeof(XPVNV))
1157 #define del_XNV(p) my_safefree(p)
1159 #define new_XRV() my_safemalloc(sizeof(XRV))
1160 #define del_XRV(p) my_safefree(p)
1162 #define new_XPV() my_safemalloc(sizeof(XPV))
1163 #define del_XPV(p) my_safefree(p)
1165 #define new_XPVIV() my_safemalloc(sizeof(XPVIV))
1166 #define del_XPVIV(p) my_safefree(p)
1168 #define new_XPVNV() my_safemalloc(sizeof(XPVNV))
1169 #define del_XPVNV(p) my_safefree(p)
1171 #define new_XPVCV() my_safemalloc(sizeof(XPVCV))
1172 #define del_XPVCV(p) my_safefree(p)
1174 #define new_XPVAV() my_safemalloc(sizeof(XPVAV))
1175 #define del_XPVAV(p) my_safefree(p)
1177 #define new_XPVHV() my_safemalloc(sizeof(XPVHV))
1178 #define del_XPVHV(p) my_safefree(p)
1180 #define new_XPVMG() my_safemalloc(sizeof(XPVMG))
1181 #define del_XPVMG(p) my_safefree(p)
1183 #define new_XPVLV() my_safemalloc(sizeof(XPVLV))
1184 #define del_XPVLV(p) my_safefree(p)
1186 #define new_XPVBM() my_safemalloc(sizeof(XPVBM))
1187 #define del_XPVBM(p) my_safefree(p)
1191 #define new_XIV() (void*)new_xiv()
1192 #define del_XIV(p) del_xiv((XPVIV*) p)
1194 #define new_XNV() (void*)new_xnv()
1195 #define del_XNV(p) del_xnv((XPVNV*) p)
1197 #define new_XRV() (void*)new_xrv()
1198 #define del_XRV(p) del_xrv((XRV*) p)
1200 #define new_XPV() (void*)new_xpv()
1201 #define del_XPV(p) del_xpv((XPV *)p)
1203 #define new_XPVIV() (void*)new_xpviv()
1204 #define del_XPVIV(p) del_xpviv((XPVIV *)p)
1206 #define new_XPVNV() (void*)new_xpvnv()
1207 #define del_XPVNV(p) del_xpvnv((XPVNV *)p)
1209 #define new_XPVCV() (void*)new_xpvcv()
1210 #define del_XPVCV(p) del_xpvcv((XPVCV *)p)
1212 #define new_XPVAV() (void*)new_xpvav()
1213 #define del_XPVAV(p) del_xpvav((XPVAV *)p)
1215 #define new_XPVHV() (void*)new_xpvhv()
1216 #define del_XPVHV(p) del_xpvhv((XPVHV *)p)
1218 #define new_XPVMG() (void*)new_xpvmg()
1219 #define del_XPVMG(p) del_xpvmg((XPVMG *)p)
1221 #define new_XPVLV() (void*)new_xpvlv()
1222 #define del_XPVLV(p) del_xpvlv((XPVLV *)p)
1224 #define new_XPVBM() (void*)new_xpvbm()
1225 #define del_XPVBM(p) del_xpvbm((XPVBM *)p)
1229 #define new_XPVGV() my_safemalloc(sizeof(XPVGV))
1230 #define del_XPVGV(p) my_safefree(p)
1232 #define new_XPVFM() my_safemalloc(sizeof(XPVFM))
1233 #define del_XPVFM(p) my_safefree(p)
1235 #define new_XPVIO() my_safemalloc(sizeof(XPVIO))
1236 #define del_XPVIO(p) my_safefree(p)
1239 =for apidoc sv_upgrade
1241 Upgrade an SV to a more complex form. Generally adds a new body type to the
1242 SV, then copies across as much information as possible from the old body.
1243 You generally want to use the C<SvUPGRADE> macro wrapper. See also C<svtype>.
1249 Perl_sv_upgrade(pTHX_ register SV *sv, U32 mt)
1256 MAGIC* magic = NULL;
1259 if (mt != SVt_PV && SvIsCOW(sv)) {
1260 sv_force_normal_flags(sv, 0);
1263 if (SvTYPE(sv) == mt)
1267 (void)SvOOK_off(sv);
1269 switch (SvTYPE(sv)) {
1290 else if (mt < SVt_PVIV)
1307 pv = (char*)SvRV(sv);
1327 else if (mt == SVt_NV)
1338 del_XPVIV(SvANY(sv));
1348 del_XPVNV(SvANY(sv));
1356 magic = SvMAGIC(sv);
1357 stash = SvSTASH(sv);
1358 del_XPVMG(SvANY(sv));
1361 Perl_croak(aTHX_ "Can't upgrade that kind of scalar");
1366 Perl_croak(aTHX_ "Can't upgrade to undef");
1368 SvANY(sv) = new_XIV();
1372 SvANY(sv) = new_XNV();
1376 SvANY(sv) = new_XRV();
1380 SvANY(sv) = new_XPV();
1386 SvANY(sv) = new_XPVIV();
1396 SvANY(sv) = new_XPVNV();
1404 SvANY(sv) = new_XPVMG();
1410 SvMAGIC(sv) = magic;
1411 SvSTASH(sv) = stash;
1414 SvANY(sv) = new_XPVLV();
1420 SvMAGIC(sv) = magic;
1421 SvSTASH(sv) = stash;
1428 SvANY(sv) = new_XPVAV();
1436 SvMAGIC(sv) = magic;
1437 SvSTASH(sv) = stash;
1443 SvANY(sv) = new_XPVHV();
1449 HvTOTALKEYS(sv) = 0;
1450 HvPLACEHOLDERS(sv) = 0;
1451 SvMAGIC(sv) = magic;
1452 SvSTASH(sv) = stash;
1459 SvANY(sv) = new_XPVCV();
1460 Zero(SvANY(sv), 1, XPVCV);
1466 SvMAGIC(sv) = magic;
1467 SvSTASH(sv) = stash;
1470 SvANY(sv) = new_XPVGV();
1476 SvMAGIC(sv) = magic;
1477 SvSTASH(sv) = stash;
1485 SvANY(sv) = new_XPVBM();
1491 SvMAGIC(sv) = magic;
1492 SvSTASH(sv) = stash;
1498 SvANY(sv) = new_XPVFM();
1499 Zero(SvANY(sv), 1, XPVFM);
1505 SvMAGIC(sv) = magic;
1506 SvSTASH(sv) = stash;
1509 SvANY(sv) = new_XPVIO();
1510 Zero(SvANY(sv), 1, XPVIO);
1516 SvMAGIC(sv) = magic;
1517 SvSTASH(sv) = stash;
1518 IoPAGE_LEN(sv) = 60;
1521 SvFLAGS(sv) &= ~SVTYPEMASK;
1527 =for apidoc sv_backoff
1529 Remove any string offset. You should normally use the C<SvOOK_off> macro
1536 Perl_sv_backoff(pTHX_ register SV *sv)
1540 char *s = SvPVX(sv);
1541 SvLEN(sv) += SvIVX(sv);
1542 SvPVX(sv) -= SvIVX(sv);
1544 Move(s, SvPVX(sv), SvCUR(sv)+1, char);
1546 SvFLAGS(sv) &= ~SVf_OOK;
1553 Expands the character buffer in the SV. If necessary, uses C<sv_unref> and
1554 upgrades the SV to C<SVt_PV>. Returns a pointer to the character buffer.
1555 Use the C<SvGROW> wrapper instead.
1561 Perl_sv_grow(pTHX_ register SV *sv, register STRLEN newlen)
1565 #ifdef HAS_64K_LIMIT
1566 if (newlen >= 0x10000) {
1567 PerlIO_printf(Perl_debug_log,
1568 "Allocation too large: %"UVxf"\n", (UV)newlen);
1571 #endif /* HAS_64K_LIMIT */
1574 if (SvTYPE(sv) < SVt_PV) {
1575 sv_upgrade(sv, SVt_PV);
1578 else if (SvOOK(sv)) { /* pv is offset? */
1581 if (newlen > SvLEN(sv))
1582 newlen += 10 * (newlen - SvCUR(sv)); /* avoid copy each time */
1583 #ifdef HAS_64K_LIMIT
1584 if (newlen >= 0x10000)
1591 if (newlen > SvLEN(sv)) { /* need more room? */
1592 if (SvLEN(sv) && s) {
1594 STRLEN l = malloced_size((void*)SvPVX(sv));
1600 Renew(s,newlen,char);
1603 New(703, s, newlen, char);
1604 if (SvPVX(sv) && SvCUR(sv)) {
1605 Move(SvPVX(sv), s, (newlen < SvCUR(sv)) ? newlen : SvCUR(sv), char);
1609 SvLEN_set(sv, newlen);
1615 =for apidoc sv_setiv
1617 Copies an integer into the given SV, upgrading first if necessary.
1618 Does not handle 'set' magic. See also C<sv_setiv_mg>.
1624 Perl_sv_setiv(pTHX_ register SV *sv, IV i)
1626 SV_CHECK_THINKFIRST_COW_DROP(sv);
1627 switch (SvTYPE(sv)) {
1629 sv_upgrade(sv, SVt_IV);
1632 sv_upgrade(sv, SVt_PVNV);
1636 sv_upgrade(sv, SVt_PVIV);
1645 Perl_croak(aTHX_ "Can't coerce %s to integer in %s", sv_reftype(sv,0),
1648 (void)SvIOK_only(sv); /* validate number */
1654 =for apidoc sv_setiv_mg
1656 Like C<sv_setiv>, but also handles 'set' magic.
1662 Perl_sv_setiv_mg(pTHX_ register SV *sv, IV i)
1669 =for apidoc sv_setuv
1671 Copies an unsigned integer into the given SV, upgrading first if necessary.
1672 Does not handle 'set' magic. See also C<sv_setuv_mg>.
1678 Perl_sv_setuv(pTHX_ register SV *sv, UV u)
1680 /* With these two if statements:
1681 u=1.49 s=0.52 cu=72.49 cs=10.64 scripts=270 tests=20865
1684 u=1.35 s=0.47 cu=73.45 cs=11.43 scripts=270 tests=20865
1686 If you wish to remove them, please benchmark to see what the effect is
1688 if (u <= (UV)IV_MAX) {
1689 sv_setiv(sv, (IV)u);
1698 =for apidoc sv_setuv_mg
1700 Like C<sv_setuv>, but also handles 'set' magic.
1706 Perl_sv_setuv_mg(pTHX_ register SV *sv, UV u)
1708 /* With these two if statements:
1709 u=1.49 s=0.52 cu=72.49 cs=10.64 scripts=270 tests=20865
1712 u=1.35 s=0.47 cu=73.45 cs=11.43 scripts=270 tests=20865
1714 If you wish to remove them, please benchmark to see what the effect is
1716 if (u <= (UV)IV_MAX) {
1717 sv_setiv(sv, (IV)u);
1727 =for apidoc sv_setnv
1729 Copies a double into the given SV, upgrading first if necessary.
1730 Does not handle 'set' magic. See also C<sv_setnv_mg>.
1736 Perl_sv_setnv(pTHX_ register SV *sv, NV num)
1738 SV_CHECK_THINKFIRST_COW_DROP(sv);
1739 switch (SvTYPE(sv)) {
1742 sv_upgrade(sv, SVt_NV);
1747 sv_upgrade(sv, SVt_PVNV);
1756 Perl_croak(aTHX_ "Can't coerce %s to number in %s", sv_reftype(sv,0),
1760 (void)SvNOK_only(sv); /* validate number */
1765 =for apidoc sv_setnv_mg
1767 Like C<sv_setnv>, but also handles 'set' magic.
1773 Perl_sv_setnv_mg(pTHX_ register SV *sv, NV num)
1779 /* Print an "isn't numeric" warning, using a cleaned-up,
1780 * printable version of the offending string
1784 S_not_a_number(pTHX_ SV *sv)
1791 dsv = sv_2mortal(newSVpv("", 0));
1792 pv = sv_uni_display(dsv, sv, 10, 0);
1795 char *limit = tmpbuf + sizeof(tmpbuf) - 8;
1796 /* each *s can expand to 4 chars + "...\0",
1797 i.e. need room for 8 chars */
1800 for (s = SvPVX(sv), end = s + SvCUR(sv); s < end && d < limit; s++) {
1802 if (ch & 128 && !isPRINT_LC(ch)) {
1811 else if (ch == '\r') {
1815 else if (ch == '\f') {
1819 else if (ch == '\\') {
1823 else if (ch == '\0') {
1827 else if (isPRINT_LC(ch))
1844 Perl_warner(aTHX_ packWARN(WARN_NUMERIC),
1845 "Argument \"%s\" isn't numeric in %s", pv,
1848 Perl_warner(aTHX_ packWARN(WARN_NUMERIC),
1849 "Argument \"%s\" isn't numeric", pv);
1853 =for apidoc looks_like_number
1855 Test if the content of an SV looks like a number (or is a number).
1856 C<Inf> and C<Infinity> are treated as numbers (so will not issue a
1857 non-numeric warning), even if your atof() doesn't grok them.
1863 Perl_looks_like_number(pTHX_ SV *sv)
1865 register char *sbegin;
1872 else if (SvPOKp(sv))
1873 sbegin = SvPV(sv, len);
1875 return 1; /* Historic. Wrong? */
1876 return grok_number(sbegin, len, NULL);
1879 /* Actually, ISO C leaves conversion of UV to IV undefined, but
1880 until proven guilty, assume that things are not that bad... */
1885 As 64 bit platforms often have an NV that doesn't preserve all bits of
1886 an IV (an assumption perl has been based on to date) it becomes necessary
1887 to remove the assumption that the NV always carries enough precision to
1888 recreate the IV whenever needed, and that the NV is the canonical form.
1889 Instead, IV/UV and NV need to be given equal rights. So as to not lose
1890 precision as a side effect of conversion (which would lead to insanity
1891 and the dragon(s) in t/op/numconvert.t getting very angry) the intent is
1892 1) to distinguish between IV/UV/NV slots that have cached a valid
1893 conversion where precision was lost and IV/UV/NV slots that have a
1894 valid conversion which has lost no precision
1895 2) to ensure that if a numeric conversion to one form is requested that
1896 would lose precision, the precise conversion (or differently
1897 imprecise conversion) is also performed and cached, to prevent
1898 requests for different numeric formats on the same SV causing
1899 lossy conversion chains. (lossless conversion chains are perfectly
1904 SvIOKp is true if the IV slot contains a valid value
1905 SvIOK is true only if the IV value is accurate (UV if SvIOK_UV true)
1906 SvNOKp is true if the NV slot contains a valid value
1907 SvNOK is true only if the NV value is accurate
1910 while converting from PV to NV, check to see if converting that NV to an
1911 IV(or UV) would lose accuracy over a direct conversion from PV to
1912 IV(or UV). If it would, cache both conversions, return NV, but mark
1913 SV as IOK NOKp (ie not NOK).
1915 While converting from PV to IV, check to see if converting that IV to an
1916 NV would lose accuracy over a direct conversion from PV to NV. If it
1917 would, cache both conversions, flag similarly.
1919 Before, the SV value "3.2" could become NV=3.2 IV=3 NOK, IOK quite
1920 correctly because if IV & NV were set NV *always* overruled.
1921 Now, "3.2" will become NV=3.2 IV=3 NOK, IOKp, because the flag's meaning
1922 changes - now IV and NV together means that the two are interchangeable:
1923 SvIVX == (IV) SvNVX && SvNVX == (NV) SvIVX;
1925 The benefit of this is that operations such as pp_add know that if
1926 SvIOK is true for both left and right operands, then integer addition
1927 can be used instead of floating point (for cases where the result won't
1928 overflow). Before, floating point was always used, which could lead to
1929 loss of precision compared with integer addition.
1931 * making IV and NV equal status should make maths accurate on 64 bit
1933 * may speed up maths somewhat if pp_add and friends start to use
1934 integers when possible instead of fp. (Hopefully the overhead in
1935 looking for SvIOK and checking for overflow will not outweigh the
1936 fp to integer speedup)
1937 * will slow down integer operations (callers of SvIV) on "inaccurate"
1938 values, as the change from SvIOK to SvIOKp will cause a call into
1939 sv_2iv each time rather than a macro access direct to the IV slot
1940 * should speed up number->string conversion on integers as IV is
1941 favoured when IV and NV are equally accurate
1943 ####################################################################
1944 You had better be using SvIOK_notUV if you want an IV for arithmetic:
1945 SvIOK is true if (IV or UV), so you might be getting (IV)SvUV.
1946 On the other hand, SvUOK is true iff UV.
1947 ####################################################################
1949 Your mileage will vary depending your CPU's relative fp to integer
1953 #ifndef NV_PRESERVES_UV
1954 # define IS_NUMBER_UNDERFLOW_IV 1
1955 # define IS_NUMBER_UNDERFLOW_UV 2
1956 # define IS_NUMBER_IV_AND_UV 2
1957 # define IS_NUMBER_OVERFLOW_IV 4
1958 # define IS_NUMBER_OVERFLOW_UV 5
1960 /* sv_2iuv_non_preserve(): private routine for use by sv_2iv() and sv_2uv() */
1962 /* For sv_2nv these three cases are "SvNOK and don't bother casting" */
1964 S_sv_2iuv_non_preserve(pTHX_ register SV *sv, I32 numtype)
1966 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));
1967 if (SvNVX(sv) < (NV)IV_MIN) {
1968 (void)SvIOKp_on(sv);
1971 return IS_NUMBER_UNDERFLOW_IV;
1973 if (SvNVX(sv) > (NV)UV_MAX) {
1974 (void)SvIOKp_on(sv);
1978 return IS_NUMBER_OVERFLOW_UV;
1980 (void)SvIOKp_on(sv);
1982 /* Can't use strtol etc to convert this string. (See truth table in
1984 if (SvNVX(sv) <= (UV)IV_MAX) {
1985 SvIVX(sv) = I_V(SvNVX(sv));
1986 if ((NV)(SvIVX(sv)) == SvNVX(sv)) {
1987 SvIOK_on(sv); /* Integer is precise. NOK, IOK */
1989 /* Integer is imprecise. NOK, IOKp */
1991 return SvNVX(sv) < 0 ? IS_NUMBER_UNDERFLOW_UV : IS_NUMBER_IV_AND_UV;
1994 SvUVX(sv) = U_V(SvNVX(sv));
1995 if ((NV)(SvUVX(sv)) == SvNVX(sv)) {
1996 if (SvUVX(sv) == UV_MAX) {
1997 /* As we know that NVs don't preserve UVs, UV_MAX cannot
1998 possibly be preserved by NV. Hence, it must be overflow.
2000 return IS_NUMBER_OVERFLOW_UV;
2002 SvIOK_on(sv); /* Integer is precise. NOK, UOK */
2004 /* Integer is imprecise. NOK, IOKp */
2006 return IS_NUMBER_OVERFLOW_IV;
2008 #endif /* !NV_PRESERVES_UV*/
2013 Return the integer value of an SV, doing any necessary string conversion,
2014 magic etc. Normally used via the C<SvIV(sv)> and C<SvIVx(sv)> macros.
2020 Perl_sv_2iv(pTHX_ register SV *sv)
2024 if (SvGMAGICAL(sv)) {
2029 return I_V(SvNVX(sv));
2031 if (SvPOKp(sv) && SvLEN(sv))
2034 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
2035 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
2041 if (SvTHINKFIRST(sv)) {
2044 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv,numer)) &&
2045 (!SvROK(tmpstr) || (SvRV(tmpstr) != SvRV(sv))))
2046 return SvIV(tmpstr);
2047 return PTR2IV(SvRV(sv));
2050 sv_force_normal_flags(sv, 0);
2052 if (SvREADONLY(sv) && !SvOK(sv)) {
2053 if (ckWARN(WARN_UNINITIALIZED))
2060 return (IV)(SvUVX(sv));
2067 /* erm. not sure. *should* never get NOKp (without NOK) from sv_2nv
2068 * without also getting a cached IV/UV from it at the same time
2069 * (ie PV->NV conversion should detect loss of accuracy and cache
2070 * IV or UV at same time to avoid this. NWC */
2072 if (SvTYPE(sv) == SVt_NV)
2073 sv_upgrade(sv, SVt_PVNV);
2075 (void)SvIOKp_on(sv); /* Must do this first, to clear any SvOOK */
2076 /* < not <= as for NV doesn't preserve UV, ((NV)IV_MAX+1) will almost
2077 certainly cast into the IV range at IV_MAX, whereas the correct
2078 answer is the UV IV_MAX +1. Hence < ensures that dodgy boundary
2080 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2081 SvIVX(sv) = I_V(SvNVX(sv));
2082 if (SvNVX(sv) == (NV) SvIVX(sv)
2083 #ifndef NV_PRESERVES_UV
2084 && (((UV)1 << NV_PRESERVES_UV_BITS) >
2085 (UV)(SvIVX(sv) > 0 ? SvIVX(sv) : -SvIVX(sv)))
2086 /* Don't flag it as "accurately an integer" if the number
2087 came from a (by definition imprecise) NV operation, and
2088 we're outside the range of NV integer precision */
2091 SvIOK_on(sv); /* Can this go wrong with rounding? NWC */
2092 DEBUG_c(PerlIO_printf(Perl_debug_log,
2093 "0x%"UVxf" iv(%"NVgf" => %"IVdf") (precise)\n",
2099 /* IV not precise. No need to convert from PV, as NV
2100 conversion would already have cached IV if it detected
2101 that PV->IV would be better than PV->NV->IV
2102 flags already correct - don't set public IOK. */
2103 DEBUG_c(PerlIO_printf(Perl_debug_log,
2104 "0x%"UVxf" iv(%"NVgf" => %"IVdf") (imprecise)\n",
2109 /* Can the above go wrong if SvIVX == IV_MIN and SvNVX < IV_MIN,
2110 but the cast (NV)IV_MIN rounds to a the value less (more
2111 negative) than IV_MIN which happens to be equal to SvNVX ??
2112 Analogous to 0xFFFFFFFFFFFFFFFF rounding up to NV (2**64) and
2113 NV rounding back to 0xFFFFFFFFFFFFFFFF, so UVX == UV(NVX) and
2114 (NV)UVX == NVX are both true, but the values differ. :-(
2115 Hopefully for 2s complement IV_MIN is something like
2116 0x8000000000000000 which will be exact. NWC */
2119 SvUVX(sv) = U_V(SvNVX(sv));
2121 (SvNVX(sv) == (NV) SvUVX(sv))
2122 #ifndef NV_PRESERVES_UV
2123 /* Make sure it's not 0xFFFFFFFFFFFFFFFF */
2124 /*&& (SvUVX(sv) != UV_MAX) irrelevant with code below */
2125 && (((UV)1 << NV_PRESERVES_UV_BITS) > SvUVX(sv))
2126 /* Don't flag it as "accurately an integer" if the number
2127 came from a (by definition imprecise) NV operation, and
2128 we're outside the range of NV integer precision */
2134 DEBUG_c(PerlIO_printf(Perl_debug_log,
2135 "0x%"UVxf" 2iv(%"UVuf" => %"IVdf") (as unsigned)\n",
2139 return (IV)SvUVX(sv);
2142 else if (SvPOKp(sv) && SvLEN(sv)) {
2144 int numtype = grok_number(SvPVX(sv), SvCUR(sv), &value);
2145 /* We want to avoid a possible problem when we cache an IV which
2146 may be later translated to an NV, and the resulting NV is not
2147 the same as the direct translation of the initial string
2148 (eg 123.456 can shortcut to the IV 123 with atol(), but we must
2149 be careful to ensure that the value with the .456 is around if the
2150 NV value is requested in the future).
2152 This means that if we cache such an IV, we need to cache the
2153 NV as well. Moreover, we trade speed for space, and do not
2154 cache the NV if we are sure it's not needed.
2157 /* SVt_PVNV is one higher than SVt_PVIV, hence this order */
2158 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2159 == IS_NUMBER_IN_UV) {
2160 /* It's definitely an integer, only upgrade to PVIV */
2161 if (SvTYPE(sv) < SVt_PVIV)
2162 sv_upgrade(sv, SVt_PVIV);
2164 } else if (SvTYPE(sv) < SVt_PVNV)
2165 sv_upgrade(sv, SVt_PVNV);
2167 /* If NV preserves UV then we only use the UV value if we know that
2168 we aren't going to call atof() below. If NVs don't preserve UVs
2169 then the value returned may have more precision than atof() will
2170 return, even though value isn't perfectly accurate. */
2171 if ((numtype & (IS_NUMBER_IN_UV
2172 #ifdef NV_PRESERVES_UV
2175 )) == IS_NUMBER_IN_UV) {
2176 /* This won't turn off the public IOK flag if it was set above */
2177 (void)SvIOKp_on(sv);
2179 if (!(numtype & IS_NUMBER_NEG)) {
2181 if (value <= (UV)IV_MAX) {
2182 SvIVX(sv) = (IV)value;
2188 /* 2s complement assumption */
2189 if (value <= (UV)IV_MIN) {
2190 SvIVX(sv) = -(IV)value;
2192 /* Too negative for an IV. This is a double upgrade, but
2193 I'm assuming it will be rare. */
2194 if (SvTYPE(sv) < SVt_PVNV)
2195 sv_upgrade(sv, SVt_PVNV);
2199 SvNVX(sv) = -(NV)value;
2204 /* For !NV_PRESERVES_UV and IS_NUMBER_IN_UV and IS_NUMBER_NOT_INT we
2205 will be in the previous block to set the IV slot, and the next
2206 block to set the NV slot. So no else here. */
2208 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2209 != IS_NUMBER_IN_UV) {
2210 /* It wasn't an (integer that doesn't overflow the UV). */
2211 SvNVX(sv) = Atof(SvPVX(sv));
2213 if (! numtype && ckWARN(WARN_NUMERIC))
2216 #if defined(USE_LONG_DOUBLE)
2217 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2iv(%" PERL_PRIgldbl ")\n",
2218 PTR2UV(sv), SvNVX(sv)));
2220 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2iv(%"NVgf")\n",
2221 PTR2UV(sv), SvNVX(sv)));
2225 #ifdef NV_PRESERVES_UV
2226 (void)SvIOKp_on(sv);
2228 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2229 SvIVX(sv) = I_V(SvNVX(sv));
2230 if ((NV)(SvIVX(sv)) == SvNVX(sv)) {
2233 /* Integer is imprecise. NOK, IOKp */
2235 /* UV will not work better than IV */
2237 if (SvNVX(sv) > (NV)UV_MAX) {
2239 /* Integer is inaccurate. NOK, IOKp, is UV */
2243 SvUVX(sv) = U_V(SvNVX(sv));
2244 /* 0xFFFFFFFFFFFFFFFF not an issue in here */
2245 if ((NV)(SvUVX(sv)) == SvNVX(sv)) {
2249 /* Integer is imprecise. NOK, IOKp, is UV */
2255 #else /* NV_PRESERVES_UV */
2256 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2257 == (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT)) {
2258 /* The IV slot will have been set from value returned by
2259 grok_number above. The NV slot has just been set using
2262 assert (SvIOKp(sv));
2264 if (((UV)1 << NV_PRESERVES_UV_BITS) >
2265 U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))) {
2266 /* Small enough to preserve all bits. */
2267 (void)SvIOKp_on(sv);
2269 SvIVX(sv) = I_V(SvNVX(sv));
2270 if ((NV)(SvIVX(sv)) == SvNVX(sv))
2272 /* Assumption: first non-preserved integer is < IV_MAX,
2273 this NV is in the preserved range, therefore: */
2274 if (!(U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))
2276 Perl_croak(aTHX_ "sv_2iv assumed (U_V(fabs((double)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);
2280 0 0 already failed to read UV.
2281 0 1 already failed to read UV.
2282 1 0 you won't get here in this case. IV/UV
2283 slot set, public IOK, Atof() unneeded.
2284 1 1 already read UV.
2285 so there's no point in sv_2iuv_non_preserve() attempting
2286 to use atol, strtol, strtoul etc. */
2287 if (sv_2iuv_non_preserve (sv, numtype)
2288 >= IS_NUMBER_OVERFLOW_IV)
2292 #endif /* NV_PRESERVES_UV */
2295 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing && !(SvFLAGS(sv) & SVs_PADTMP))
2297 if (SvTYPE(sv) < SVt_IV)
2298 /* Typically the caller expects that sv_any is not NULL now. */
2299 sv_upgrade(sv, SVt_IV);
2302 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2iv(%"IVdf")\n",
2303 PTR2UV(sv),SvIVX(sv)));
2304 return SvIsUV(sv) ? (IV)SvUVX(sv) : SvIVX(sv);
2310 Return the unsigned integer value of an SV, doing any necessary string
2311 conversion, magic etc. Normally used via the C<SvUV(sv)> and C<SvUVx(sv)>
2318 Perl_sv_2uv(pTHX_ register SV *sv)
2322 if (SvGMAGICAL(sv)) {
2327 return U_V(SvNVX(sv));
2328 if (SvPOKp(sv) && SvLEN(sv))
2331 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
2332 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
2338 if (SvTHINKFIRST(sv)) {
2341 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv,numer)) &&
2342 (!SvROK(tmpstr) || (SvRV(tmpstr) != SvRV(sv))))
2343 return SvUV(tmpstr);
2344 return PTR2UV(SvRV(sv));
2347 sv_force_normal_flags(sv, 0);
2349 if (SvREADONLY(sv) && !SvOK(sv)) {
2350 if (ckWARN(WARN_UNINITIALIZED))
2360 return (UV)SvIVX(sv);
2364 /* erm. not sure. *should* never get NOKp (without NOK) from sv_2nv
2365 * without also getting a cached IV/UV from it at the same time
2366 * (ie PV->NV conversion should detect loss of accuracy and cache
2367 * IV or UV at same time to avoid this. */
2368 /* IV-over-UV optimisation - choose to cache IV if possible */
2370 if (SvTYPE(sv) == SVt_NV)
2371 sv_upgrade(sv, SVt_PVNV);
2373 (void)SvIOKp_on(sv); /* Must do this first, to clear any SvOOK */
2374 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2375 SvIVX(sv) = I_V(SvNVX(sv));
2376 if (SvNVX(sv) == (NV) SvIVX(sv)
2377 #ifndef NV_PRESERVES_UV
2378 && (((UV)1 << NV_PRESERVES_UV_BITS) >
2379 (UV)(SvIVX(sv) > 0 ? SvIVX(sv) : -SvIVX(sv)))
2380 /* Don't flag it as "accurately an integer" if the number
2381 came from a (by definition imprecise) NV operation, and
2382 we're outside the range of NV integer precision */
2385 SvIOK_on(sv); /* Can this go wrong with rounding? NWC */
2386 DEBUG_c(PerlIO_printf(Perl_debug_log,
2387 "0x%"UVxf" uv(%"NVgf" => %"IVdf") (precise)\n",
2393 /* IV not precise. No need to convert from PV, as NV
2394 conversion would already have cached IV if it detected
2395 that PV->IV would be better than PV->NV->IV
2396 flags already correct - don't set public IOK. */
2397 DEBUG_c(PerlIO_printf(Perl_debug_log,
2398 "0x%"UVxf" uv(%"NVgf" => %"IVdf") (imprecise)\n",
2403 /* Can the above go wrong if SvIVX == IV_MIN and SvNVX < IV_MIN,
2404 but the cast (NV)IV_MIN rounds to a the value less (more
2405 negative) than IV_MIN which happens to be equal to SvNVX ??
2406 Analogous to 0xFFFFFFFFFFFFFFFF rounding up to NV (2**64) and
2407 NV rounding back to 0xFFFFFFFFFFFFFFFF, so UVX == UV(NVX) and
2408 (NV)UVX == NVX are both true, but the values differ. :-(
2409 Hopefully for 2s complement IV_MIN is something like
2410 0x8000000000000000 which will be exact. NWC */
2413 SvUVX(sv) = U_V(SvNVX(sv));
2415 (SvNVX(sv) == (NV) SvUVX(sv))
2416 #ifndef NV_PRESERVES_UV
2417 /* Make sure it's not 0xFFFFFFFFFFFFFFFF */
2418 /*&& (SvUVX(sv) != UV_MAX) irrelevant with code below */
2419 && (((UV)1 << NV_PRESERVES_UV_BITS) > SvUVX(sv))
2420 /* Don't flag it as "accurately an integer" if the number
2421 came from a (by definition imprecise) NV operation, and
2422 we're outside the range of NV integer precision */
2427 DEBUG_c(PerlIO_printf(Perl_debug_log,
2428 "0x%"UVxf" 2uv(%"UVuf" => %"IVdf") (as unsigned)\n",
2434 else if (SvPOKp(sv) && SvLEN(sv)) {
2436 int numtype = grok_number(SvPVX(sv), SvCUR(sv), &value);
2438 /* We want to avoid a possible problem when we cache a UV which
2439 may be later translated to an NV, and the resulting NV is not
2440 the translation of the initial data.
2442 This means that if we cache such a UV, we need to cache the
2443 NV as well. Moreover, we trade speed for space, and do not
2444 cache the NV if not needed.
2447 /* SVt_PVNV is one higher than SVt_PVIV, hence this order */
2448 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2449 == IS_NUMBER_IN_UV) {
2450 /* It's definitely an integer, only upgrade to PVIV */
2451 if (SvTYPE(sv) < SVt_PVIV)
2452 sv_upgrade(sv, SVt_PVIV);
2454 } else if (SvTYPE(sv) < SVt_PVNV)
2455 sv_upgrade(sv, SVt_PVNV);
2457 /* If NV preserves UV then we only use the UV value if we know that
2458 we aren't going to call atof() below. If NVs don't preserve UVs
2459 then the value returned may have more precision than atof() will
2460 return, even though it isn't accurate. */
2461 if ((numtype & (IS_NUMBER_IN_UV
2462 #ifdef NV_PRESERVES_UV
2465 )) == IS_NUMBER_IN_UV) {
2466 /* This won't turn off the public IOK flag if it was set above */
2467 (void)SvIOKp_on(sv);
2469 if (!(numtype & IS_NUMBER_NEG)) {
2471 if (value <= (UV)IV_MAX) {
2472 SvIVX(sv) = (IV)value;
2474 /* it didn't overflow, and it was positive. */
2479 /* 2s complement assumption */
2480 if (value <= (UV)IV_MIN) {
2481 SvIVX(sv) = -(IV)value;
2483 /* Too negative for an IV. This is a double upgrade, but
2484 I'm assuming it will be rare. */
2485 if (SvTYPE(sv) < SVt_PVNV)
2486 sv_upgrade(sv, SVt_PVNV);
2490 SvNVX(sv) = -(NV)value;
2496 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2497 != IS_NUMBER_IN_UV) {
2498 /* It wasn't an integer, or it overflowed the UV. */
2499 SvNVX(sv) = Atof(SvPVX(sv));
2501 if (! numtype && ckWARN(WARN_NUMERIC))
2504 #if defined(USE_LONG_DOUBLE)
2505 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2uv(%" PERL_PRIgldbl ")\n",
2506 PTR2UV(sv), SvNVX(sv)));
2508 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2uv(%"NVgf")\n",
2509 PTR2UV(sv), SvNVX(sv)));
2512 #ifdef NV_PRESERVES_UV
2513 (void)SvIOKp_on(sv);
2515 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2516 SvIVX(sv) = I_V(SvNVX(sv));
2517 if ((NV)(SvIVX(sv)) == SvNVX(sv)) {
2520 /* Integer is imprecise. NOK, IOKp */
2522 /* UV will not work better than IV */
2524 if (SvNVX(sv) > (NV)UV_MAX) {
2526 /* Integer is inaccurate. NOK, IOKp, is UV */
2530 SvUVX(sv) = U_V(SvNVX(sv));
2531 /* 0xFFFFFFFFFFFFFFFF not an issue in here, NVs
2532 NV preservse UV so can do correct comparison. */
2533 if ((NV)(SvUVX(sv)) == SvNVX(sv)) {
2537 /* Integer is imprecise. NOK, IOKp, is UV */
2542 #else /* NV_PRESERVES_UV */
2543 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2544 == (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT)) {
2545 /* The UV slot will have been set from value returned by
2546 grok_number above. The NV slot has just been set using
2549 assert (SvIOKp(sv));
2551 if (((UV)1 << NV_PRESERVES_UV_BITS) >
2552 U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))) {
2553 /* Small enough to preserve all bits. */
2554 (void)SvIOKp_on(sv);
2556 SvIVX(sv) = I_V(SvNVX(sv));
2557 if ((NV)(SvIVX(sv)) == SvNVX(sv))
2559 /* Assumption: first non-preserved integer is < IV_MAX,
2560 this NV is in the preserved range, therefore: */
2561 if (!(U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))
2563 Perl_croak(aTHX_ "sv_2uv assumed (U_V(fabs((double)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);
2566 sv_2iuv_non_preserve (sv, numtype);
2568 #endif /* NV_PRESERVES_UV */
2572 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
2573 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
2576 if (SvTYPE(sv) < SVt_IV)
2577 /* Typically the caller expects that sv_any is not NULL now. */
2578 sv_upgrade(sv, SVt_IV);
2582 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2uv(%"UVuf")\n",
2583 PTR2UV(sv),SvUVX(sv)));
2584 return SvIsUV(sv) ? SvUVX(sv) : (UV)SvIVX(sv);
2590 Return the num value of an SV, doing any necessary string or integer
2591 conversion, magic etc. Normally used via the C<SvNV(sv)> and C<SvNVx(sv)>
2598 Perl_sv_2nv(pTHX_ register SV *sv)
2602 if (SvGMAGICAL(sv)) {
2606 if (SvPOKp(sv) && SvLEN(sv)) {
2607 if (ckWARN(WARN_NUMERIC) && !SvIOKp(sv) &&
2608 !grok_number(SvPVX(sv), SvCUR(sv), NULL))
2610 return Atof(SvPVX(sv));
2614 return (NV)SvUVX(sv);
2616 return (NV)SvIVX(sv);
2619 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
2620 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
2626 if (SvTHINKFIRST(sv)) {
2629 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv,numer)) &&
2630 (!SvROK(tmpstr) || (SvRV(tmpstr) != SvRV(sv))))
2631 return SvNV(tmpstr);
2632 return PTR2NV(SvRV(sv));
2635 sv_force_normal_flags(sv, 0);
2637 if (SvREADONLY(sv) && !SvOK(sv)) {
2638 if (ckWARN(WARN_UNINITIALIZED))
2643 if (SvTYPE(sv) < SVt_NV) {
2644 if (SvTYPE(sv) == SVt_IV)
2645 sv_upgrade(sv, SVt_PVNV);
2647 sv_upgrade(sv, SVt_NV);
2648 #ifdef USE_LONG_DOUBLE
2650 STORE_NUMERIC_LOCAL_SET_STANDARD();
2651 PerlIO_printf(Perl_debug_log,
2652 "0x%"UVxf" num(%" PERL_PRIgldbl ")\n",
2653 PTR2UV(sv), SvNVX(sv));
2654 RESTORE_NUMERIC_LOCAL();
2658 STORE_NUMERIC_LOCAL_SET_STANDARD();
2659 PerlIO_printf(Perl_debug_log, "0x%"UVxf" num(%"NVgf")\n",
2660 PTR2UV(sv), SvNVX(sv));
2661 RESTORE_NUMERIC_LOCAL();
2665 else if (SvTYPE(sv) < SVt_PVNV)
2666 sv_upgrade(sv, SVt_PVNV);
2671 SvNVX(sv) = SvIsUV(sv) ? (NV)SvUVX(sv) : (NV)SvIVX(sv);
2672 #ifdef NV_PRESERVES_UV
2675 /* Only set the public NV OK flag if this NV preserves the IV */
2676 /* Check it's not 0xFFFFFFFFFFFFFFFF */
2677 if (SvIsUV(sv) ? ((SvUVX(sv) != UV_MAX)&&(SvUVX(sv) == U_V(SvNVX(sv))))
2678 : (SvIVX(sv) == I_V(SvNVX(sv))))
2684 else if (SvPOKp(sv) && SvLEN(sv)) {
2686 int numtype = grok_number(SvPVX(sv), SvCUR(sv), &value);
2687 if (ckWARN(WARN_NUMERIC) && !SvIOKp(sv) && !numtype)
2689 #ifdef NV_PRESERVES_UV
2690 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2691 == IS_NUMBER_IN_UV) {
2692 /* It's definitely an integer */
2693 SvNVX(sv) = (numtype & IS_NUMBER_NEG) ? -(NV)value : (NV)value;
2695 SvNVX(sv) = Atof(SvPVX(sv));
2698 SvNVX(sv) = Atof(SvPVX(sv));
2699 /* Only set the public NV OK flag if this NV preserves the value in
2700 the PV at least as well as an IV/UV would.
2701 Not sure how to do this 100% reliably. */
2702 /* if that shift count is out of range then Configure's test is
2703 wonky. We shouldn't be in here with NV_PRESERVES_UV_BITS ==
2705 if (((UV)1 << NV_PRESERVES_UV_BITS) >
2706 U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))) {
2707 SvNOK_on(sv); /* Definitely small enough to preserve all bits */
2708 } else if (!(numtype & IS_NUMBER_IN_UV)) {
2709 /* Can't use strtol etc to convert this string, so don't try.
2710 sv_2iv and sv_2uv will use the NV to convert, not the PV. */
2713 /* value has been set. It may not be precise. */
2714 if ((numtype & IS_NUMBER_NEG) && (value > (UV)IV_MIN)) {
2715 /* 2s complement assumption for (UV)IV_MIN */
2716 SvNOK_on(sv); /* Integer is too negative. */
2721 if (numtype & IS_NUMBER_NEG) {
2722 SvIVX(sv) = -(IV)value;
2723 } else if (value <= (UV)IV_MAX) {
2724 SvIVX(sv) = (IV)value;
2730 if (numtype & IS_NUMBER_NOT_INT) {
2731 /* I believe that even if the original PV had decimals,
2732 they are lost beyond the limit of the FP precision.
2733 However, neither is canonical, so both only get p
2734 flags. NWC, 2000/11/25 */
2735 /* Both already have p flags, so do nothing */
2738 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2739 if (SvIVX(sv) == I_V(nv)) {
2744 /* It had no "." so it must be integer. */
2747 /* between IV_MAX and NV(UV_MAX).
2748 Could be slightly > UV_MAX */
2750 if (numtype & IS_NUMBER_NOT_INT) {
2751 /* UV and NV both imprecise. */
2753 UV nv_as_uv = U_V(nv);
2755 if (value == nv_as_uv && SvUVX(sv) != UV_MAX) {
2766 #endif /* NV_PRESERVES_UV */
2769 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing && !(SvFLAGS(sv) & SVs_PADTMP))
2771 if (SvTYPE(sv) < SVt_NV)
2772 /* Typically the caller expects that sv_any is not NULL now. */
2773 /* XXX Ilya implies that this is a bug in callers that assume this
2774 and ideally should be fixed. */
2775 sv_upgrade(sv, SVt_NV);
2778 #if defined(USE_LONG_DOUBLE)
2780 STORE_NUMERIC_LOCAL_SET_STANDARD();
2781 PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2nv(%" PERL_PRIgldbl ")\n",
2782 PTR2UV(sv), SvNVX(sv));
2783 RESTORE_NUMERIC_LOCAL();
2787 STORE_NUMERIC_LOCAL_SET_STANDARD();
2788 PerlIO_printf(Perl_debug_log, "0x%"UVxf" 1nv(%"NVgf")\n",
2789 PTR2UV(sv), SvNVX(sv));
2790 RESTORE_NUMERIC_LOCAL();
2796 /* asIV(): extract an integer from the string value of an SV.
2797 * Caller must validate PVX */
2800 S_asIV(pTHX_ SV *sv)
2803 int numtype = grok_number(SvPVX(sv), SvCUR(sv), &value);
2805 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2806 == IS_NUMBER_IN_UV) {
2807 /* It's definitely an integer */
2808 if (numtype & IS_NUMBER_NEG) {
2809 if (value < (UV)IV_MIN)
2812 if (value < (UV)IV_MAX)
2817 if (ckWARN(WARN_NUMERIC))
2820 return I_V(Atof(SvPVX(sv)));
2823 /* asUV(): extract an unsigned integer from the string value of an SV
2824 * Caller must validate PVX */
2827 S_asUV(pTHX_ SV *sv)
2830 int numtype = grok_number(SvPVX(sv), SvCUR(sv), &value);
2832 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2833 == IS_NUMBER_IN_UV) {
2834 /* It's definitely an integer */
2835 if (!(numtype & IS_NUMBER_NEG))
2839 if (ckWARN(WARN_NUMERIC))
2842 return U_V(Atof(SvPVX(sv)));
2846 =for apidoc sv_2pv_nolen
2848 Like C<sv_2pv()>, but doesn't return the length too. You should usually
2849 use the macro wrapper C<SvPV_nolen(sv)> instead.
2854 Perl_sv_2pv_nolen(pTHX_ register SV *sv)
2857 return sv_2pv(sv, &n_a);
2860 /* uiv_2buf(): private routine for use by sv_2pv_flags(): print an IV or
2861 * UV as a string towards the end of buf, and return pointers to start and
2864 * We assume that buf is at least TYPE_CHARS(UV) long.
2868 uiv_2buf(char *buf, IV iv, UV uv, int is_uv, char **peob)
2870 char *ptr = buf + TYPE_CHARS(UV);
2884 *--ptr = '0' + (char)(uv % 10);
2892 /* sv_2pv() is now a macro using Perl_sv_2pv_flags();
2893 * this function provided for binary compatibility only
2897 Perl_sv_2pv(pTHX_ register SV *sv, STRLEN *lp)
2899 return sv_2pv_flags(sv, lp, SV_GMAGIC);
2903 =for apidoc sv_2pv_flags
2905 Returns a pointer to the string value of an SV, and sets *lp to its length.
2906 If flags includes SV_GMAGIC, does an mg_get() first. Coerces sv to a string
2908 Normally invoked via the C<SvPV_flags> macro. C<sv_2pv()> and C<sv_2pv_nomg>
2909 usually end up here too.
2915 Perl_sv_2pv_flags(pTHX_ register SV *sv, STRLEN *lp, I32 flags)
2920 char tbuf[64]; /* Must fit sprintf/Gconvert of longest IV/NV */
2921 char *tmpbuf = tbuf;
2927 if (SvGMAGICAL(sv)) {
2928 if (flags & SV_GMAGIC)
2936 (void)sprintf(tmpbuf,"%"UVuf, (UV)SvUVX(sv));
2938 (void)sprintf(tmpbuf,"%"IVdf, (IV)SvIVX(sv));
2943 Gconvert(SvNVX(sv), NV_DIG, 0, tmpbuf);
2948 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
2949 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
2956 if (SvTHINKFIRST(sv)) {
2959 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv,string)) &&
2960 (!SvROK(tmpstr) || (SvRV(tmpstr) != SvRV(sv)))) {
2961 char *pv = SvPV(tmpstr, *lp);
2975 switch (SvTYPE(sv)) {
2977 if ( ((SvFLAGS(sv) &
2978 (SVs_OBJECT|SVf_OK|SVs_GMG|SVs_SMG|SVs_RMG))
2979 == (SVs_OBJECT|SVs_SMG))
2980 && (mg = mg_find(sv, PERL_MAGIC_qr))) {
2981 regexp *re = (regexp *)mg->mg_obj;
2984 char *fptr = "msix";
2989 char need_newline = 0;
2990 U16 reganch = (U16)((re->reganch & PMf_COMPILETIME) >> 12);
2992 while((ch = *fptr++)) {
2994 reflags[left++] = ch;
2997 reflags[right--] = ch;
3002 reflags[left] = '-';
3006 mg->mg_len = re->prelen + 4 + left;
3008 * If /x was used, we have to worry about a regex
3009 * ending with a comment later being embedded
3010 * within another regex. If so, we don't want this
3011 * regex's "commentization" to leak out to the
3012 * right part of the enclosing regex, we must cap
3013 * it with a newline.
3015 * So, if /x was used, we scan backwards from the
3016 * end of the regex. If we find a '#' before we
3017 * find a newline, we need to add a newline
3018 * ourself. If we find a '\n' first (or if we
3019 * don't find '#' or '\n'), we don't need to add
3020 * anything. -jfriedl
3022 if (PMf_EXTENDED & re->reganch)
3024 char *endptr = re->precomp + re->prelen;
3025 while (endptr >= re->precomp)
3027 char c = *(endptr--);
3029 break; /* don't need another */
3031 /* we end while in a comment, so we
3033 mg->mg_len++; /* save space for it */
3034 need_newline = 1; /* note to add it */
3040 New(616, mg->mg_ptr, mg->mg_len + 1 + left, char);
3041 Copy("(?", mg->mg_ptr, 2, char);
3042 Copy(reflags, mg->mg_ptr+2, left, char);
3043 Copy(":", mg->mg_ptr+left+2, 1, char);
3044 Copy(re->precomp, mg->mg_ptr+3+left, re->prelen, char);
3046 mg->mg_ptr[mg->mg_len - 2] = '\n';
3047 mg->mg_ptr[mg->mg_len - 1] = ')';
3048 mg->mg_ptr[mg->mg_len] = 0;
3050 PL_reginterp_cnt += re->program[0].next_off;
3052 if (re->reganch & ROPT_UTF8)
3067 case SVt_PVBM: if (SvROK(sv))
3070 s = "SCALAR"; break;
3071 case SVt_PVLV: s = "LVALUE"; break;
3072 case SVt_PVAV: s = "ARRAY"; break;
3073 case SVt_PVHV: s = "HASH"; break;
3074 case SVt_PVCV: s = "CODE"; break;
3075 case SVt_PVGV: s = "GLOB"; break;
3076 case SVt_PVFM: s = "FORMAT"; break;
3077 case SVt_PVIO: s = "IO"; break;
3078 default: s = "UNKNOWN"; break;
3082 Perl_sv_setpvf(aTHX_ tsv, "%s=%s", HvNAME(SvSTASH(sv)), s);
3085 Perl_sv_catpvf(aTHX_ tsv, "(0x%"UVxf")", PTR2UV(sv));
3091 if (SvREADONLY(sv) && !SvOK(sv)) {
3092 if (ckWARN(WARN_UNINITIALIZED))
3098 if (SvIOK(sv) || ((SvIOKp(sv) && !SvNOKp(sv)))) {
3099 /* I'm assuming that if both IV and NV are equally valid then
3100 converting the IV is going to be more efficient */
3101 U32 isIOK = SvIOK(sv);
3102 U32 isUIOK = SvIsUV(sv);
3103 char buf[TYPE_CHARS(UV)];
3106 if (SvTYPE(sv) < SVt_PVIV)
3107 sv_upgrade(sv, SVt_PVIV);
3109 ptr = uiv_2buf(buf, 0, SvUVX(sv), 1, &ebuf);
3111 ptr = uiv_2buf(buf, SvIVX(sv), 0, 0, &ebuf);
3112 SvGROW(sv, (STRLEN)(ebuf - ptr + 1)); /* inlined from sv_setpvn */
3113 Move(ptr,SvPVX(sv),ebuf - ptr,char);
3114 SvCUR_set(sv, ebuf - ptr);
3124 else if (SvNOKp(sv)) {
3125 if (SvTYPE(sv) < SVt_PVNV)
3126 sv_upgrade(sv, SVt_PVNV);
3127 /* The +20 is pure guesswork. Configure test needed. --jhi */
3128 SvGROW(sv, NV_DIG + 20);
3130 olderrno = errno; /* some Xenix systems wipe out errno here */
3132 if (SvNVX(sv) == 0.0)
3133 (void)strcpy(s,"0");
3137 Gconvert(SvNVX(sv), NV_DIG, 0, s);
3140 #ifdef FIXNEGATIVEZERO
3141 if (*s == '-' && s[1] == '0' && !s[2])
3151 if (ckWARN(WARN_UNINITIALIZED)
3152 && !PL_localizing && !(SvFLAGS(sv) & SVs_PADTMP))
3155 if (SvTYPE(sv) < SVt_PV)
3156 /* Typically the caller expects that sv_any is not NULL now. */
3157 sv_upgrade(sv, SVt_PV);
3160 *lp = s - SvPVX(sv);
3163 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2pv(%s)\n",
3164 PTR2UV(sv),SvPVX(sv)));
3168 if (SvROK(sv)) { /* XXX Skip this when sv_pvn_force calls */
3169 /* Sneaky stuff here */
3173 tsv = newSVpv(tmpbuf, 0);
3189 len = strlen(tmpbuf);
3191 #ifdef FIXNEGATIVEZERO
3192 if (len == 2 && t[0] == '-' && t[1] == '0') {
3197 (void)SvUPGRADE(sv, SVt_PV);
3199 s = SvGROW(sv, len + 1);
3208 =for apidoc sv_copypv
3210 Copies a stringified representation of the source SV into the
3211 destination SV. Automatically performs any necessary mg_get and
3212 coercion of numeric values into strings. Guaranteed to preserve
3213 UTF-8 flag even from overloaded objects. Similar in nature to
3214 sv_2pv[_flags] but operates directly on an SV instead of just the
3215 string. Mostly uses sv_2pv_flags to do its work, except when that
3216 would lose the UTF-8'ness of the PV.
3222 Perl_sv_copypv(pTHX_ SV *dsv, register SV *ssv)
3227 sv_setpvn(dsv,s,len);
3235 =for apidoc sv_2pvbyte_nolen
3237 Return a pointer to the byte-encoded representation of the SV.
3238 May cause the SV to be downgraded from UTF8 as a side-effect.
3240 Usually accessed via the C<SvPVbyte_nolen> macro.
3246 Perl_sv_2pvbyte_nolen(pTHX_ register SV *sv)
3249 return sv_2pvbyte(sv, &n_a);
3253 =for apidoc sv_2pvbyte
3255 Return a pointer to the byte-encoded representation of the SV, and set *lp
3256 to its length. May cause the SV to be downgraded from UTF8 as a
3259 Usually accessed via the C<SvPVbyte> macro.
3265 Perl_sv_2pvbyte(pTHX_ register SV *sv, STRLEN *lp)
3267 sv_utf8_downgrade(sv,0);
3268 return SvPV(sv,*lp);
3272 =for apidoc sv_2pvutf8_nolen
3274 Return a pointer to the UTF8-encoded representation of the SV.
3275 May cause the SV to be upgraded to UTF8 as a side-effect.
3277 Usually accessed via the C<SvPVutf8_nolen> macro.
3283 Perl_sv_2pvutf8_nolen(pTHX_ register SV *sv)
3286 return sv_2pvutf8(sv, &n_a);
3290 =for apidoc sv_2pvutf8
3292 Return a pointer to the UTF8-encoded representation of the SV, and set *lp
3293 to its length. May cause the SV to be upgraded to UTF8 as a side-effect.
3295 Usually accessed via the C<SvPVutf8> macro.
3301 Perl_sv_2pvutf8(pTHX_ register SV *sv, STRLEN *lp)
3303 sv_utf8_upgrade(sv);
3304 return SvPV(sv,*lp);
3308 =for apidoc sv_2bool
3310 This function is only called on magical items, and is only used by
3311 sv_true() or its macro equivalent.
3317 Perl_sv_2bool(pTHX_ register SV *sv)
3326 if (SvAMAGIC(sv) && (tmpsv=AMG_CALLun(sv,bool_)) &&
3327 (!SvROK(tmpsv) || (SvRV(tmpsv) != SvRV(sv))))
3328 return (bool)SvTRUE(tmpsv);
3329 return SvRV(sv) != 0;
3332 register XPV* Xpvtmp;
3333 if ((Xpvtmp = (XPV*)SvANY(sv)) &&
3334 (*Xpvtmp->xpv_pv > '0' ||
3335 Xpvtmp->xpv_cur > 1 ||
3336 (Xpvtmp->xpv_cur && *Xpvtmp->xpv_pv != '0')))
3343 return SvIVX(sv) != 0;
3346 return SvNVX(sv) != 0.0;
3353 /* sv_utf8_upgrade() is now a macro using sv_utf8_upgrade_flags();
3354 * this function provided for binary compatibility only
3359 Perl_sv_utf8_upgrade(pTHX_ register SV *sv)
3361 return sv_utf8_upgrade_flags(sv, SV_GMAGIC);
3365 =for apidoc sv_utf8_upgrade
3367 Convert the PV of an SV to its UTF8-encoded form.
3368 Forces the SV to string form if it is not already.
3369 Always sets the SvUTF8 flag to avoid future validity checks even
3370 if all the bytes have hibit clear.
3372 This is not as a general purpose byte encoding to Unicode interface:
3373 use the Encode extension for that.
3375 =for apidoc sv_utf8_upgrade_flags
3377 Convert the PV of an SV to its UTF8-encoded form.
3378 Forces the SV to string form if it is not already.
3379 Always sets the SvUTF8 flag to avoid future validity checks even
3380 if all the bytes have hibit clear. If C<flags> has C<SV_GMAGIC> bit set,
3381 will C<mg_get> on C<sv> if appropriate, else not. C<sv_utf8_upgrade> and
3382 C<sv_utf8_upgrade_nomg> are implemented in terms of this function.
3384 This is not as a general purpose byte encoding to Unicode interface:
3385 use the Encode extension for that.
3391 Perl_sv_utf8_upgrade_flags(pTHX_ register SV *sv, I32 flags)
3401 (void) sv_2pv_flags(sv,&len, flags);
3410 sv_force_normal_flags(sv, 0);
3413 if (PL_encoding && !(flags & SV_UTF8_NO_ENCODING))
3414 sv_recode_to_utf8(sv, PL_encoding);
3415 else { /* Assume Latin-1/EBCDIC */
3416 /* This function could be much more efficient if we
3417 * had a FLAG in SVs to signal if there are any hibit
3418 * chars in the PV. Given that there isn't such a flag
3419 * make the loop as fast as possible. */
3420 s = (U8 *) SvPVX(sv);
3421 e = (U8 *) SvEND(sv);
3425 if ((hibit = !NATIVE_IS_INVARIANT(ch)))
3431 len = SvCUR(sv) + 1; /* Plus the \0 */
3432 SvPVX(sv) = (char*)bytes_to_utf8((U8*)s, &len);
3433 SvCUR(sv) = len - 1;
3435 Safefree(s); /* No longer using what was there before. */
3436 SvLEN(sv) = len; /* No longer know the real size. */
3438 /* Mark as UTF-8 even if no hibit - saves scanning loop */
3445 =for apidoc sv_utf8_downgrade
3447 Attempt to convert the PV of an SV from UTF8-encoded to byte encoding.
3448 This may not be possible if the PV contains non-byte encoding characters;
3449 if this is the case, either returns false or, if C<fail_ok> is not
3452 This is not as a general purpose Unicode to byte encoding interface:
3453 use the Encode extension for that.
3459 Perl_sv_utf8_downgrade(pTHX_ register SV* sv, bool fail_ok)
3461 if (SvPOK(sv) && SvUTF8(sv)) {
3467 sv_force_normal_flags(sv, 0);
3469 s = (U8 *) SvPV(sv, len);
3470 if (!utf8_to_bytes(s, &len)) {
3475 Perl_croak(aTHX_ "Wide character in %s",
3478 Perl_croak(aTHX_ "Wide character");
3489 =for apidoc sv_utf8_encode
3491 Convert the PV of an SV to UTF8-encoded, but then turn off the C<SvUTF8>
3492 flag so that it looks like octets again. Used as a building block
3493 for encode_utf8 in Encode.xs
3499 Perl_sv_utf8_encode(pTHX_ register SV *sv)
3501 (void) sv_utf8_upgrade(sv);
3506 =for apidoc sv_utf8_decode
3508 Convert the octets in the PV from UTF-8 to chars. Scan for validity and then
3509 turn off SvUTF8 if needed so that we see characters. Used as a building block
3510 for decode_utf8 in Encode.xs
3516 Perl_sv_utf8_decode(pTHX_ register SV *sv)
3522 /* The octets may have got themselves encoded - get them back as
3525 if (!sv_utf8_downgrade(sv, TRUE))
3528 /* it is actually just a matter of turning the utf8 flag on, but
3529 * we want to make sure everything inside is valid utf8 first.
3531 c = (U8 *) SvPVX(sv);
3532 if (!is_utf8_string(c, SvCUR(sv)+1))
3534 e = (U8 *) SvEND(sv);
3537 if (!UTF8_IS_INVARIANT(ch)) {
3546 /* sv_setsv() is now a macro using Perl_sv_setsv_flags();
3547 * this function provided for binary compatibility only
3551 Perl_sv_setsv(pTHX_ SV *dstr, register SV *sstr)
3553 sv_setsv_flags(dstr, sstr, SV_GMAGIC);
3557 =for apidoc sv_setsv
3559 Copies the contents of the source SV C<ssv> into the destination SV
3560 C<dsv>. The source SV may be destroyed if it is mortal, so don't use this
3561 function if the source SV needs to be reused. Does not handle 'set' magic.
3562 Loosely speaking, it performs a copy-by-value, obliterating any previous
3563 content of the destination.
3565 You probably want to use one of the assortment of wrappers, such as
3566 C<SvSetSV>, C<SvSetSV_nosteal>, C<SvSetMagicSV> and
3567 C<SvSetMagicSV_nosteal>.
3569 =for apidoc sv_setsv_flags
3571 Copies the contents of the source SV C<ssv> into the destination SV
3572 C<dsv>. The source SV may be destroyed if it is mortal, so don't use this
3573 function if the source SV needs to be reused. Does not handle 'set' magic.
3574 Loosely speaking, it performs a copy-by-value, obliterating any previous
3575 content of the destination.
3576 If the C<flags> parameter has the C<SV_GMAGIC> bit set, will C<mg_get> on
3577 C<ssv> if appropriate, else not. C<sv_setsv> and C<sv_setsv_nomg> are
3578 implemented in terms of this function.
3580 You probably want to use one of the assortment of wrappers, such as
3581 C<SvSetSV>, C<SvSetSV_nosteal>, C<SvSetMagicSV> and
3582 C<SvSetMagicSV_nosteal>.
3584 This is the primary function for copying scalars, and most other
3585 copy-ish functions and macros use this underneath.
3591 Perl_sv_setsv_flags(pTHX_ SV *dstr, register SV *sstr, I32 flags)
3593 register U32 sflags;
3599 SV_CHECK_THINKFIRST_COW_DROP(dstr);
3601 sstr = &PL_sv_undef;
3602 stype = SvTYPE(sstr);
3603 dtype = SvTYPE(dstr);
3608 /* need to nuke the magic */
3610 SvRMAGICAL_off(dstr);
3613 /* There's a lot of redundancy below but we're going for speed here */
3618 if (dtype != SVt_PVGV) {
3619 (void)SvOK_off(dstr);
3627 sv_upgrade(dstr, SVt_IV);
3630 sv_upgrade(dstr, SVt_PVNV);
3634 sv_upgrade(dstr, SVt_PVIV);
3637 (void)SvIOK_only(dstr);
3638 SvIVX(dstr) = SvIVX(sstr);
3641 if (SvTAINTED(sstr))
3652 sv_upgrade(dstr, SVt_NV);
3657 sv_upgrade(dstr, SVt_PVNV);
3660 SvNVX(dstr) = SvNVX(sstr);
3661 (void)SvNOK_only(dstr);
3662 if (SvTAINTED(sstr))
3670 sv_upgrade(dstr, SVt_RV);
3671 else if (dtype == SVt_PVGV &&
3672 SvTYPE(SvRV(sstr)) == SVt_PVGV) {
3675 if (GvIMPORTED(dstr) != GVf_IMPORTED
3676 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3678 GvIMPORTED_on(dstr);
3687 #ifdef PERL_COPY_ON_WRITE
3688 if ((SvFLAGS(sstr) & CAN_COW_MASK) == CAN_COW_FLAGS) {
3689 if (dtype < SVt_PVIV)
3690 sv_upgrade(dstr, SVt_PVIV);
3697 sv_upgrade(dstr, SVt_PV);
3700 if (dtype < SVt_PVIV)
3701 sv_upgrade(dstr, SVt_PVIV);
3704 if (dtype < SVt_PVNV)
3705 sv_upgrade(dstr, SVt_PVNV);
3712 Perl_croak(aTHX_ "Bizarre copy of %s in %s", sv_reftype(sstr, 0),
3715 Perl_croak(aTHX_ "Bizarre copy of %s", sv_reftype(sstr, 0));
3719 if (dtype <= SVt_PVGV) {
3721 if (dtype != SVt_PVGV) {
3722 char *name = GvNAME(sstr);
3723 STRLEN len = GvNAMELEN(sstr);
3724 sv_upgrade(dstr, SVt_PVGV);
3725 sv_magic(dstr, dstr, PERL_MAGIC_glob, Nullch, 0);
3726 GvSTASH(dstr) = (HV*)SvREFCNT_inc(GvSTASH(sstr));
3727 GvNAME(dstr) = savepvn(name, len);
3728 GvNAMELEN(dstr) = len;
3729 SvFAKE_on(dstr); /* can coerce to non-glob */
3731 /* ahem, death to those who redefine active sort subs */
3732 else if (PL_curstackinfo->si_type == PERLSI_SORT
3733 && GvCV(dstr) && PL_sortcop == CvSTART(GvCV(dstr)))
3734 Perl_croak(aTHX_ "Can't redefine active sort subroutine %s",
3737 #ifdef GV_UNIQUE_CHECK
3738 if (GvUNIQUE((GV*)dstr)) {
3739 Perl_croak(aTHX_ PL_no_modify);
3743 (void)SvOK_off(dstr);
3744 GvINTRO_off(dstr); /* one-shot flag */
3746 GvGP(dstr) = gp_ref(GvGP(sstr));
3747 if (SvTAINTED(sstr))
3749 if (GvIMPORTED(dstr) != GVf_IMPORTED
3750 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3752 GvIMPORTED_on(dstr);
3760 if (SvGMAGICAL(sstr) && (flags & SV_GMAGIC)) {
3762 if ((int)SvTYPE(sstr) != stype) {
3763 stype = SvTYPE(sstr);
3764 if (stype == SVt_PVGV && dtype <= SVt_PVGV)
3768 if (stype == SVt_PVLV)
3769 (void)SvUPGRADE(dstr, SVt_PVNV);
3771 (void)SvUPGRADE(dstr, (U32)stype);
3774 sflags = SvFLAGS(sstr);
3776 if (sflags & SVf_ROK) {
3777 if (dtype >= SVt_PV) {
3778 if (dtype == SVt_PVGV) {
3779 SV *sref = SvREFCNT_inc(SvRV(sstr));
3781 int intro = GvINTRO(dstr);
3783 #ifdef GV_UNIQUE_CHECK
3784 if (GvUNIQUE((GV*)dstr)) {
3785 Perl_croak(aTHX_ PL_no_modify);
3790 GvINTRO_off(dstr); /* one-shot flag */
3791 GvLINE(dstr) = CopLINE(PL_curcop);
3792 GvEGV(dstr) = (GV*)dstr;
3795 switch (SvTYPE(sref)) {
3798 SAVEGENERICSV(GvAV(dstr));
3800 dref = (SV*)GvAV(dstr);
3801 GvAV(dstr) = (AV*)sref;
3802 if (!GvIMPORTED_AV(dstr)
3803 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3805 GvIMPORTED_AV_on(dstr);
3810 SAVEGENERICSV(GvHV(dstr));
3812 dref = (SV*)GvHV(dstr);
3813 GvHV(dstr) = (HV*)sref;
3814 if (!GvIMPORTED_HV(dstr)
3815 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3817 GvIMPORTED_HV_on(dstr);
3822 if (GvCVGEN(dstr) && GvCV(dstr) != (CV*)sref) {
3823 SvREFCNT_dec(GvCV(dstr));
3824 GvCV(dstr) = Nullcv;
3825 GvCVGEN(dstr) = 0; /* Switch off cacheness. */
3826 PL_sub_generation++;
3828 SAVEGENERICSV(GvCV(dstr));
3831 dref = (SV*)GvCV(dstr);
3832 if (GvCV(dstr) != (CV*)sref) {
3833 CV* cv = GvCV(dstr);
3835 if (!GvCVGEN((GV*)dstr) &&
3836 (CvROOT(cv) || CvXSUB(cv)))
3838 /* ahem, death to those who redefine
3839 * active sort subs */
3840 if (PL_curstackinfo->si_type == PERLSI_SORT &&
3841 PL_sortcop == CvSTART(cv))
3843 "Can't redefine active sort subroutine %s",
3844 GvENAME((GV*)dstr));
3845 /* Redefining a sub - warning is mandatory if
3846 it was a const and its value changed. */
3847 if (ckWARN(WARN_REDEFINE)
3849 && (!CvCONST((CV*)sref)
3850 || sv_cmp(cv_const_sv(cv),
3851 cv_const_sv((CV*)sref)))))
3853 Perl_warner(aTHX_ packWARN(WARN_REDEFINE),
3855 ? "Constant subroutine %s::%s redefined"
3856 : "Subroutine %s::%s redefined",
3857 HvNAME(GvSTASH((GV*)dstr)),
3858 GvENAME((GV*)dstr));
3862 cv_ckproto(cv, (GV*)dstr,
3863 SvPOK(sref) ? SvPVX(sref) : Nullch);
3865 GvCV(dstr) = (CV*)sref;
3866 GvCVGEN(dstr) = 0; /* Switch off cacheness. */
3867 GvASSUMECV_on(dstr);
3868 PL_sub_generation++;
3870 if (!GvIMPORTED_CV(dstr)
3871 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3873 GvIMPORTED_CV_on(dstr);
3878 SAVEGENERICSV(GvIOp(dstr));
3880 dref = (SV*)GvIOp(dstr);
3881 GvIOp(dstr) = (IO*)sref;
3885 SAVEGENERICSV(GvFORM(dstr));
3887 dref = (SV*)GvFORM(dstr);
3888 GvFORM(dstr) = (CV*)sref;
3892 SAVEGENERICSV(GvSV(dstr));
3894 dref = (SV*)GvSV(dstr);
3896 if (!GvIMPORTED_SV(dstr)
3897 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3899 GvIMPORTED_SV_on(dstr);
3905 if (SvTAINTED(sstr))
3910 (void)SvOOK_off(dstr); /* backoff */
3912 Safefree(SvPVX(dstr));
3913 SvLEN(dstr)=SvCUR(dstr)=0;
3916 (void)SvOK_off(dstr);
3917 SvRV(dstr) = SvREFCNT_inc(SvRV(sstr));
3919 if (sflags & SVp_NOK) {
3921 /* Only set the public OK flag if the source has public OK. */
3922 if (sflags & SVf_NOK)
3923 SvFLAGS(dstr) |= SVf_NOK;
3924 SvNVX(dstr) = SvNVX(sstr);
3926 if (sflags & SVp_IOK) {
3927 (void)SvIOKp_on(dstr);
3928 if (sflags & SVf_IOK)
3929 SvFLAGS(dstr) |= SVf_IOK;
3930 if (sflags & SVf_IVisUV)
3932 SvIVX(dstr) = SvIVX(sstr);
3934 if (SvAMAGIC(sstr)) {
3938 else if (sflags & SVp_POK) {
3942 * Check to see if we can just swipe the string. If so, it's a
3943 * possible small lose on short strings, but a big win on long ones.
3944 * It might even be a win on short strings if SvPVX(dstr)
3945 * has to be allocated and SvPVX(sstr) has to be freed.
3949 #ifdef PERL_COPY_ON_WRITE
3950 (sflags & (SVf_FAKE | SVf_READONLY)) != (SVf_FAKE | SVf_READONLY)
3954 (sflags & SVs_TEMP) && /* slated for free anyway? */
3955 !(sflags & SVf_OOK) && /* and not involved in OOK hack? */
3956 SvREFCNT(sstr) == 1 && /* and no other references to it? */
3957 SvLEN(sstr) && /* and really is a string */
3958 /* and won't be needed again, potentially */
3959 !(PL_op && PL_op->op_type == OP_AASSIGN))
3960 #ifdef PERL_COPY_ON_WRITE
3961 && !((sflags & CAN_COW_MASK) == CAN_COW_FLAGS
3962 && SvTYPE(sstr) >= SVt_PVIV)
3965 /* Failed the swipe test, and it's not a shared hash key either.
3966 Have to copy the string. */
3967 STRLEN len = SvCUR(sstr);
3968 SvGROW(dstr, len + 1); /* inlined from sv_setpvn */
3969 Move(SvPVX(sstr),SvPVX(dstr),len,char);
3970 SvCUR_set(dstr, len);
3971 *SvEND(dstr) = '\0';
3972 (void)SvPOK_only(dstr);
3974 /* If PERL_COPY_ON_WRITE is not defined, then isSwipe will always
3976 #ifdef PERL_COPY_ON_WRITE
3977 /* Either it's a shared hash key, or it's suitable for
3978 copy-on-write or we can swipe the string. */
3980 PerlIO_printf(Perl_debug_log, "Copy on write: sstr --> dstr\n");
3985 /* I believe I should acquire a global SV mutex if
3986 it's a COW sv (not a shared hash key) to stop
3987 it going un copy-on-write.
3988 If the source SV has gone un copy on write between up there
3989 and down here, then (assert() that) it is of the correct
3990 form to make it copy on write again */
3991 if ((sflags & (SVf_FAKE | SVf_READONLY))
3992 != (SVf_FAKE | SVf_READONLY)) {
3993 SvREADONLY_on(sstr);
3995 /* Make the source SV into a loop of 1.
3996 (about to become 2) */
3997 SV_COW_NEXT_SV_SET(sstr, sstr);
4001 /* Initial code is common. */
4002 if (SvPVX(dstr)) { /* we know that dtype >= SVt_PV */
4004 SvFLAGS(dstr) &= ~SVf_OOK;
4005 Safefree(SvPVX(dstr) - SvIVX(dstr));
4007 else if (SvLEN(dstr))
4008 Safefree(SvPVX(dstr));
4010 (void)SvPOK_only(dstr);
4012 #ifdef PERL_COPY_ON_WRITE
4014 /* making another shared SV. */
4015 STRLEN cur = SvCUR(sstr);
4016 STRLEN len = SvLEN(sstr);
4017 assert (SvTYPE(dstr) >= SVt_PVIV);
4019 /* SvIsCOW_normal */
4020 /* splice us in between source and next-after-source. */
4021 SV_COW_NEXT_SV_SET(dstr, SV_COW_NEXT_SV(sstr));
4022 SV_COW_NEXT_SV_SET(sstr, dstr);
4023 SvPV_set(dstr, SvPVX(sstr));
4025 /* SvIsCOW_shared_hash */
4026 UV hash = SvUVX(sstr);
4027 DEBUG_C(PerlIO_printf(Perl_debug_log,
4028 "Copy on write: Sharing hash\n"));
4030 sharepvn(SvPVX(sstr),
4031 (sflags & SVf_UTF8?-cur:cur), hash));
4036 SvREADONLY_on(dstr);
4038 /* Relesase a global SV mutex. */
4042 { /* Passes the swipe test. */
4043 SvPV_set(dstr, SvPVX(sstr));
4044 SvLEN_set(dstr, SvLEN(sstr));
4045 SvCUR_set(dstr, SvCUR(sstr));
4048 (void)SvOK_off(sstr); /* NOTE: nukes most SvFLAGS on sstr */
4049 SvPV_set(sstr, Nullch);
4055 if (sflags & SVf_UTF8)
4058 if (sflags & SVp_NOK) {
4060 if (sflags & SVf_NOK)
4061 SvFLAGS(dstr) |= SVf_NOK;
4062 SvNVX(dstr) = SvNVX(sstr);
4064 if (sflags & SVp_IOK) {
4065 (void)SvIOKp_on(dstr);
4066 if (sflags & SVf_IOK)
4067 SvFLAGS(dstr) |= SVf_IOK;
4068 if (sflags & SVf_IVisUV)
4070 SvIVX(dstr) = SvIVX(sstr);
4073 MAGIC *smg = mg_find(sstr,PERL_MAGIC_vstring);
4074 sv_magic(dstr, NULL, PERL_MAGIC_vstring,
4075 smg->mg_ptr, smg->mg_len);
4076 SvRMAGICAL_on(dstr);
4079 else if (sflags & SVp_IOK) {
4080 if (sflags & SVf_IOK)
4081 (void)SvIOK_only(dstr);
4083 (void)SvOK_off(dstr);
4084 (void)SvIOKp_on(dstr);
4086 /* XXXX Do we want to set IsUV for IV(ROK)? Be extra safe... */
4087 if (sflags & SVf_IVisUV)
4089 SvIVX(dstr) = SvIVX(sstr);
4090 if (sflags & SVp_NOK) {
4091 if (sflags & SVf_NOK)
4092 (void)SvNOK_on(dstr);
4094 (void)SvNOKp_on(dstr);
4095 SvNVX(dstr) = SvNVX(sstr);
4098 else if (sflags & SVp_NOK) {
4099 if (sflags & SVf_NOK)
4100 (void)SvNOK_only(dstr);
4102 (void)SvOK_off(dstr);
4105 SvNVX(dstr) = SvNVX(sstr);
4108 if (dtype == SVt_PVGV) {
4109 if (ckWARN(WARN_MISC))
4110 Perl_warner(aTHX_ packWARN(WARN_MISC), "Undefined value assigned to typeglob");
4113 (void)SvOK_off(dstr);
4115 if (SvTAINTED(sstr))
4120 =for apidoc sv_setsv_mg
4122 Like C<sv_setsv>, but also handles 'set' magic.
4128 Perl_sv_setsv_mg(pTHX_ SV *dstr, register SV *sstr)
4130 sv_setsv(dstr,sstr);
4134 #ifdef PERL_COPY_ON_WRITE
4136 Perl_sv_setsv_cow(pTHX_ SV *dstr, SV *sstr)
4138 STRLEN cur = SvCUR(sstr);
4139 STRLEN len = SvLEN(sstr);
4140 register char *new_pv;
4143 PerlIO_printf(Perl_debug_log, "Fast copy on write: %p -> %p\n",
4151 if (SvTHINKFIRST(dstr))
4152 sv_force_normal_flags(dstr, SV_COW_DROP_PV);
4153 else if (SvPVX(dstr))
4154 Safefree(SvPVX(dstr));
4158 SvUPGRADE (dstr, SVt_PVIV);
4160 assert (SvPOK(sstr));
4161 assert (SvPOKp(sstr));
4162 assert (!SvIOK(sstr));
4163 assert (!SvIOKp(sstr));
4164 assert (!SvNOK(sstr));
4165 assert (!SvNOKp(sstr));
4167 if (SvIsCOW(sstr)) {
4169 if (SvLEN(sstr) == 0) {
4170 /* source is a COW shared hash key. */
4171 UV hash = SvUVX(sstr);
4172 DEBUG_C(PerlIO_printf(Perl_debug_log,
4173 "Fast copy on write: Sharing hash\n"));
4175 new_pv = sharepvn(SvPVX(sstr), (SvUTF8(sstr)?-cur:cur), hash);
4178 SV_COW_NEXT_SV_SET(dstr, SV_COW_NEXT_SV(sstr));
4180 assert ((SvFLAGS(sstr) & CAN_COW_MASK) == CAN_COW_FLAGS);
4181 SvUPGRADE (sstr, SVt_PVIV);
4182 SvREADONLY_on(sstr);
4184 DEBUG_C(PerlIO_printf(Perl_debug_log,
4185 "Fast copy on write: Converting sstr to COW\n"));
4186 SV_COW_NEXT_SV_SET(dstr, sstr);
4188 SV_COW_NEXT_SV_SET(sstr, dstr);
4189 new_pv = SvPVX(sstr);
4192 SvPV_set(dstr, new_pv);
4193 SvFLAGS(dstr) = (SVt_PVIV|SVf_POK|SVp_POK|SVf_FAKE|SVf_READONLY);
4206 =for apidoc sv_setpvn
4208 Copies a string into an SV. The C<len> parameter indicates the number of
4209 bytes to be copied. Does not handle 'set' magic. See C<sv_setpvn_mg>.
4215 Perl_sv_setpvn(pTHX_ register SV *sv, register const char *ptr, register STRLEN len)
4217 register char *dptr;
4219 SV_CHECK_THINKFIRST_COW_DROP(sv);
4225 /* len is STRLEN which is unsigned, need to copy to signed */
4228 Perl_croak(aTHX_ "panic: sv_setpvn called with negative strlen");
4230 (void)SvUPGRADE(sv, SVt_PV);
4232 SvGROW(sv, len + 1);
4234 Move(ptr,dptr,len,char);
4237 (void)SvPOK_only_UTF8(sv); /* validate pointer */
4242 =for apidoc sv_setpvn_mg
4244 Like C<sv_setpvn>, but also handles 'set' magic.
4250 Perl_sv_setpvn_mg(pTHX_ register SV *sv, register const char *ptr, register STRLEN len)
4252 sv_setpvn(sv,ptr,len);
4257 =for apidoc sv_setpv
4259 Copies a string into an SV. The string must be null-terminated. Does not
4260 handle 'set' magic. See C<sv_setpv_mg>.
4266 Perl_sv_setpv(pTHX_ register SV *sv, register const char *ptr)
4268 register STRLEN len;
4270 SV_CHECK_THINKFIRST_COW_DROP(sv);
4276 (void)SvUPGRADE(sv, SVt_PV);
4278 SvGROW(sv, len + 1);
4279 Move(ptr,SvPVX(sv),len+1,char);
4281 (void)SvPOK_only_UTF8(sv); /* validate pointer */
4286 =for apidoc sv_setpv_mg
4288 Like C<sv_setpv>, but also handles 'set' magic.
4294 Perl_sv_setpv_mg(pTHX_ register SV *sv, register const char *ptr)
4301 =for apidoc sv_usepvn
4303 Tells an SV to use C<ptr> to find its string value. Normally the string is
4304 stored inside the SV but sv_usepvn allows the SV to use an outside string.
4305 The C<ptr> should point to memory that was allocated by C<malloc>. The
4306 string length, C<len>, must be supplied. This function will realloc the
4307 memory pointed to by C<ptr>, so that pointer should not be freed or used by
4308 the programmer after giving it to sv_usepvn. Does not handle 'set' magic.
4309 See C<sv_usepvn_mg>.
4315 Perl_sv_usepvn(pTHX_ register SV *sv, register char *ptr, register STRLEN len)
4317 SV_CHECK_THINKFIRST_COW_DROP(sv);
4318 (void)SvUPGRADE(sv, SVt_PV);
4323 (void)SvOOK_off(sv);
4324 if (SvPVX(sv) && SvLEN(sv))
4325 Safefree(SvPVX(sv));
4326 Renew(ptr, len+1, char);
4329 SvLEN_set(sv, len+1);
4331 (void)SvPOK_only_UTF8(sv); /* validate pointer */
4336 =for apidoc sv_usepvn_mg
4338 Like C<sv_usepvn>, but also handles 'set' magic.
4344 Perl_sv_usepvn_mg(pTHX_ register SV *sv, register char *ptr, register STRLEN len)
4346 sv_usepvn(sv,ptr,len);
4350 #ifdef PERL_COPY_ON_WRITE
4351 /* Need to do this *after* making the SV normal, as we need the buffer
4352 pointer to remain valid until after we've copied it. If we let go too early,
4353 another thread could invalidate it by unsharing last of the same hash key
4354 (which it can do by means other than releasing copy-on-write Svs)
4355 or by changing the other copy-on-write SVs in the loop. */
4357 S_sv_release_COW(pTHX_ register SV *sv, char *pvx, STRLEN cur, STRLEN len,
4358 U32 hash, SV *after)
4360 if (len) { /* this SV was SvIsCOW_normal(sv) */
4361 /* we need to find the SV pointing to us. */
4362 SV *current = SV_COW_NEXT_SV(after);
4364 if (current == sv) {
4365 /* The SV we point to points back to us (there were only two of us
4367 Hence other SV is no longer copy on write either. */
4369 SvREADONLY_off(after);
4371 /* We need to follow the pointers around the loop. */
4373 while ((next = SV_COW_NEXT_SV(current)) != sv) {
4376 /* don't loop forever if the structure is bust, and we have
4377 a pointer into a closed loop. */
4378 assert (current != after);
4379 assert (SvPVX(current) == pvx);
4381 /* Make the SV before us point to the SV after us. */
4382 SV_COW_NEXT_SV_SET(current, after);
4385 unsharepvn(pvx, SvUTF8(sv) ? -(I32)cur : cur, hash);
4390 Perl_sv_release_IVX(pTHX_ register SV *sv)
4393 sv_force_normal_flags(sv, 0);
4394 return SvOOK_off(sv);
4398 =for apidoc sv_force_normal_flags
4400 Undo various types of fakery on an SV: if the PV is a shared string, make
4401 a private copy; if we're a ref, stop refing; if we're a glob, downgrade to
4402 an xpvmg; if we're a copy-on-write scalar, this is the on-write time when
4403 we do the copy, and is also used locally. If C<SV_COW_DROP_PV> is set
4404 then a copy-on-write scalar drops its PV buffer (if any) and becomes
4405 SvPOK_off rather than making a copy. (Used where this scalar is about to be
4406 set to some other value.) In addition, the C<flags> parameter gets passed to
4407 C<sv_unref_flags()> when unrefing. C<sv_force_normal> calls this function
4408 with flags set to 0.
4414 Perl_sv_force_normal_flags(pTHX_ register SV *sv, U32 flags)
4416 #ifdef PERL_COPY_ON_WRITE
4417 if (SvREADONLY(sv)) {
4418 /* At this point I believe I should acquire a global SV mutex. */
4420 char *pvx = SvPVX(sv);
4421 STRLEN len = SvLEN(sv);
4422 STRLEN cur = SvCUR(sv);
4423 U32 hash = SvUVX(sv);
4424 SV *next = SV_COW_NEXT_SV(sv); /* next COW sv in the loop. */
4426 PerlIO_printf(Perl_debug_log,
4427 "Copy on write: Force normal %ld\n",
4433 /* This SV doesn't own the buffer, so need to New() a new one: */
4436 if (flags & SV_COW_DROP_PV) {
4437 /* OK, so we don't need to copy our buffer. */
4440 SvGROW(sv, cur + 1);
4441 Move(pvx,SvPVX(sv),cur,char);
4445 sv_release_COW(sv, pvx, cur, len, hash, next);
4450 else if (PL_curcop != &PL_compiling)
4451 Perl_croak(aTHX_ PL_no_modify);
4452 /* At this point I believe that I can drop the global SV mutex. */
4455 if (SvREADONLY(sv)) {
4457 char *pvx = SvPVX(sv);
4458 STRLEN len = SvCUR(sv);
4459 U32 hash = SvUVX(sv);
4462 SvGROW(sv, len + 1);
4463 Move(pvx,SvPVX(sv),len,char);
4465 unsharepvn(pvx, SvUTF8(sv) ? -(I32)len : len, hash);
4467 else if (PL_curcop != &PL_compiling)
4468 Perl_croak(aTHX_ PL_no_modify);
4472 sv_unref_flags(sv, flags);
4473 else if (SvFAKE(sv) && SvTYPE(sv) == SVt_PVGV)
4478 =for apidoc sv_force_normal
4480 Undo various types of fakery on an SV: if the PV is a shared string, make
4481 a private copy; if we're a ref, stop refing; if we're a glob, downgrade to
4482 an xpvmg. See also C<sv_force_normal_flags>.
4488 Perl_sv_force_normal(pTHX_ register SV *sv)
4490 sv_force_normal_flags(sv, 0);
4496 Efficient removal of characters from the beginning of the string buffer.
4497 SvPOK(sv) must be true and the C<ptr> must be a pointer to somewhere inside
4498 the string buffer. The C<ptr> becomes the first character of the adjusted
4499 string. Uses the "OOK hack".
4505 Perl_sv_chop(pTHX_ register SV *sv, register char *ptr)
4507 register STRLEN delta;
4509 if (!ptr || !SvPOKp(sv))
4511 SV_CHECK_THINKFIRST(sv);
4512 if (SvTYPE(sv) < SVt_PVIV)
4513 sv_upgrade(sv,SVt_PVIV);
4516 if (!SvLEN(sv)) { /* make copy of shared string */
4517 char *pvx = SvPVX(sv);
4518 STRLEN len = SvCUR(sv);
4519 SvGROW(sv, len + 1);
4520 Move(pvx,SvPVX(sv),len,char);
4524 /* Same SvOOK_on but SvOOK_on does a SvIOK_off
4525 and we do that anyway inside the SvNIOK_off
4527 SvFLAGS(sv) |= SVf_OOK;
4530 delta = ptr - SvPVX(sv);
4537 /* sv_catpvn() is now a macro using Perl_sv_catpvn_flags();
4538 * this function provided for binary compatibility only
4542 Perl_sv_catpvn(pTHX_ SV *dsv, const char* sstr, STRLEN slen)
4544 sv_catpvn_flags(dsv, sstr, slen, SV_GMAGIC);
4548 =for apidoc sv_catpvn
4550 Concatenates the string onto the end of the string which is in the SV. The
4551 C<len> indicates number of bytes to copy. If the SV has the UTF8
4552 status set, then the bytes appended should be valid UTF8.
4553 Handles 'get' magic, but not 'set' magic. See C<sv_catpvn_mg>.
4555 =for apidoc sv_catpvn_flags
4557 Concatenates the string onto the end of the string which is in the SV. The
4558 C<len> indicates number of bytes to copy. If the SV has the UTF8
4559 status set, then the bytes appended should be valid UTF8.
4560 If C<flags> has C<SV_GMAGIC> bit set, will C<mg_get> on C<dsv> if
4561 appropriate, else not. C<sv_catpvn> and C<sv_catpvn_nomg> are implemented
4562 in terms of this function.
4568 Perl_sv_catpvn_flags(pTHX_ register SV *dsv, register const char *sstr, register STRLEN slen, I32 flags)
4573 dstr = SvPV_force_flags(dsv, dlen, flags);
4574 SvGROW(dsv, dlen + slen + 1);
4577 Move(sstr, SvPVX(dsv) + dlen, slen, char);
4580 (void)SvPOK_only_UTF8(dsv); /* validate pointer */
4585 =for apidoc sv_catpvn_mg
4587 Like C<sv_catpvn>, but also handles 'set' magic.
4593 Perl_sv_catpvn_mg(pTHX_ register SV *sv, register const char *ptr, register STRLEN len)
4595 sv_catpvn(sv,ptr,len);
4599 /* sv_catsv() is now a macro using Perl_sv_catsv_flags();
4600 * this function provided for binary compatibility only
4604 Perl_sv_catsv(pTHX_ SV *dstr, register SV *sstr)
4606 sv_catsv_flags(dstr, sstr, SV_GMAGIC);
4610 =for apidoc sv_catsv
4612 Concatenates the string from SV C<ssv> onto the end of the string in
4613 SV C<dsv>. Modifies C<dsv> but not C<ssv>. Handles 'get' magic, but
4614 not 'set' magic. See C<sv_catsv_mg>.
4616 =for apidoc sv_catsv_flags
4618 Concatenates the string from SV C<ssv> onto the end of the string in
4619 SV C<dsv>. Modifies C<dsv> but not C<ssv>. If C<flags> has C<SV_GMAGIC>
4620 bit set, will C<mg_get> on the SVs if appropriate, else not. C<sv_catsv>
4621 and C<sv_catsv_nomg> are implemented in terms of this function.
4626 Perl_sv_catsv_flags(pTHX_ SV *dsv, register SV *ssv, I32 flags)
4632 if ((spv = SvPV(ssv, slen))) {
4633 /* sutf8 and dutf8 were type bool, but under USE_ITHREADS,
4634 gcc version 2.95.2 20000220 (Debian GNU/Linux) for
4635 Linux xxx 2.2.17 on sparc64 with gcc -O2, we erroneously
4636 get dutf8 = 0x20000000, (i.e. SVf_UTF8) even though
4637 dsv->sv_flags doesn't have that bit set.
4638 Andy Dougherty 12 Oct 2001
4640 I32 sutf8 = DO_UTF8(ssv);
4643 if (SvGMAGICAL(dsv) && (flags & SV_GMAGIC))
4645 dutf8 = DO_UTF8(dsv);
4647 if (dutf8 != sutf8) {
4649 /* Not modifying source SV, so taking a temporary copy. */
4650 SV* csv = sv_2mortal(newSVpvn(spv, slen));
4652 sv_utf8_upgrade(csv);
4653 spv = SvPV(csv, slen);
4656 sv_utf8_upgrade_nomg(dsv);
4658 sv_catpvn_nomg(dsv, spv, slen);
4663 =for apidoc sv_catsv_mg
4665 Like C<sv_catsv>, but also handles 'set' magic.
4671 Perl_sv_catsv_mg(pTHX_ SV *dsv, register SV *ssv)
4678 =for apidoc sv_catpv
4680 Concatenates the string onto the end of the string which is in the SV.
4681 If the SV has the UTF8 status set, then the bytes appended should be
4682 valid UTF8. Handles 'get' magic, but not 'set' magic. See C<sv_catpv_mg>.
4687 Perl_sv_catpv(pTHX_ register SV *sv, register const char *ptr)
4689 register STRLEN len;
4695 junk = SvPV_force(sv, tlen);
4697 SvGROW(sv, tlen + len + 1);
4700 Move(ptr,SvPVX(sv)+tlen,len+1,char);
4702 (void)SvPOK_only_UTF8(sv); /* validate pointer */
4707 =for apidoc sv_catpv_mg
4709 Like C<sv_catpv>, but also handles 'set' magic.
4715 Perl_sv_catpv_mg(pTHX_ register SV *sv, register const char *ptr)
4724 Create a new null SV, or if len > 0, create a new empty SVt_PV type SV
4725 with an initial PV allocation of len+1. Normally accessed via the C<NEWSV>
4732 Perl_newSV(pTHX_ STRLEN len)
4738 sv_upgrade(sv, SVt_PV);
4739 SvGROW(sv, len + 1);
4744 =for apidoc sv_magicext
4746 Adds magic to an SV, upgrading it if necessary. Applies the
4747 supplied vtable and returns pointer to the magic added.
4749 Note that sv_magicext will allow things that sv_magic will not.
4750 In particular you can add magic to SvREADONLY SVs and and more than
4751 one instance of the same 'how'
4753 I C<namelen> is greater then zero then a savepvn() I<copy> of C<name> is stored,
4754 if C<namelen> is zero then C<name> is stored as-is and - as another special
4755 case - if C<(name && namelen == HEf_SVKEY)> then C<name> is assumed to contain
4756 an C<SV*> and has its REFCNT incremented
4758 (This is now used as a subroutine by sv_magic.)
4763 Perl_sv_magicext(pTHX_ SV* sv, SV* obj, int how, MGVTBL *vtable,
4764 const char* name, I32 namlen)
4768 if (SvTYPE(sv) < SVt_PVMG) {
4769 (void)SvUPGRADE(sv, SVt_PVMG);
4771 Newz(702,mg, 1, MAGIC);
4772 mg->mg_moremagic = SvMAGIC(sv);
4775 /* Some magic sontains a reference loop, where the sv and object refer to
4776 each other. To prevent a reference loop that would prevent such
4777 objects being freed, we look for such loops and if we find one we
4778 avoid incrementing the object refcount.
4780 Note we cannot do this to avoid self-tie loops as intervening RV must
4781 have its REFCNT incremented to keep it in existence.
4784 if (!obj || obj == sv ||
4785 how == PERL_MAGIC_arylen ||
4786 how == PERL_MAGIC_qr ||
4787 (SvTYPE(obj) == SVt_PVGV &&
4788 (GvSV(obj) == sv || GvHV(obj) == (HV*)sv || GvAV(obj) == (AV*)sv ||
4789 GvCV(obj) == (CV*)sv || GvIOp(obj) == (IO*)sv ||
4790 GvFORM(obj) == (CV*)sv)))
4795 mg->mg_obj = SvREFCNT_inc(obj);
4796 mg->mg_flags |= MGf_REFCOUNTED;
4799 /* Normal self-ties simply pass a null object, and instead of
4800 using mg_obj directly, use the SvTIED_obj macro to produce a
4801 new RV as needed. For glob "self-ties", we are tieing the PVIO
4802 with an RV obj pointing to the glob containing the PVIO. In
4803 this case, to avoid a reference loop, we need to weaken the
4807 if (how == PERL_MAGIC_tiedscalar && SvTYPE(sv) == SVt_PVIO &&
4808 obj && SvROK(obj) && GvIO(SvRV(obj)) == (IO*)sv)
4814 mg->mg_len = namlen;
4817 mg->mg_ptr = savepvn(name, namlen);
4818 else if (namlen == HEf_SVKEY)
4819 mg->mg_ptr = (char*)SvREFCNT_inc((SV*)name);
4821 mg->mg_ptr = (char *) name;
4823 mg->mg_virtual = vtable;
4827 SvFLAGS(sv) &= ~(SVf_IOK|SVf_NOK|SVf_POK);
4832 =for apidoc sv_magic
4834 Adds magic to an SV. First upgrades C<sv> to type C<SVt_PVMG> if necessary,
4835 then adds a new magic item of type C<how> to the head of the magic list.
4841 Perl_sv_magic(pTHX_ register SV *sv, SV *obj, int how, const char *name, I32 namlen)
4846 #ifdef PERL_COPY_ON_WRITE
4848 sv_force_normal_flags(sv, 0);
4850 if (SvREADONLY(sv)) {
4851 if (PL_curcop != &PL_compiling
4852 && how != PERL_MAGIC_regex_global
4853 && how != PERL_MAGIC_bm
4854 && how != PERL_MAGIC_fm
4855 && how != PERL_MAGIC_sv
4858 Perl_croak(aTHX_ PL_no_modify);
4861 if (SvMAGICAL(sv) || (how == PERL_MAGIC_taint && SvTYPE(sv) >= SVt_PVMG)) {
4862 if (SvMAGIC(sv) && (mg = mg_find(sv, how))) {
4863 /* sv_magic() refuses to add a magic of the same 'how' as an
4866 if (how == PERL_MAGIC_taint)
4874 vtable = &PL_vtbl_sv;
4876 case PERL_MAGIC_overload:
4877 vtable = &PL_vtbl_amagic;
4879 case PERL_MAGIC_overload_elem:
4880 vtable = &PL_vtbl_amagicelem;
4882 case PERL_MAGIC_overload_table:
4883 vtable = &PL_vtbl_ovrld;
4886 vtable = &PL_vtbl_bm;
4888 case PERL_MAGIC_regdata:
4889 vtable = &PL_vtbl_regdata;
4891 case PERL_MAGIC_regdatum:
4892 vtable = &PL_vtbl_regdatum;
4894 case PERL_MAGIC_env:
4895 vtable = &PL_vtbl_env;
4898 vtable = &PL_vtbl_fm;
4900 case PERL_MAGIC_envelem:
4901 vtable = &PL_vtbl_envelem;
4903 case PERL_MAGIC_regex_global:
4904 vtable = &PL_vtbl_mglob;
4906 case PERL_MAGIC_isa:
4907 vtable = &PL_vtbl_isa;
4909 case PERL_MAGIC_isaelem:
4910 vtable = &PL_vtbl_isaelem;
4912 case PERL_MAGIC_nkeys:
4913 vtable = &PL_vtbl_nkeys;
4915 case PERL_MAGIC_dbfile:
4918 case PERL_MAGIC_dbline:
4919 vtable = &PL_vtbl_dbline;
4921 #ifdef USE_LOCALE_COLLATE
4922 case PERL_MAGIC_collxfrm:
4923 vtable = &PL_vtbl_collxfrm;
4925 #endif /* USE_LOCALE_COLLATE */
4926 case PERL_MAGIC_tied:
4927 vtable = &PL_vtbl_pack;
4929 case PERL_MAGIC_tiedelem:
4930 case PERL_MAGIC_tiedscalar:
4931 vtable = &PL_vtbl_packelem;
4934 vtable = &PL_vtbl_regexp;
4936 case PERL_MAGIC_sig:
4937 vtable = &PL_vtbl_sig;
4939 case PERL_MAGIC_sigelem:
4940 vtable = &PL_vtbl_sigelem;
4942 case PERL_MAGIC_taint:
4943 vtable = &PL_vtbl_taint;
4945 case PERL_MAGIC_uvar:
4946 vtable = &PL_vtbl_uvar;
4948 case PERL_MAGIC_vec:
4949 vtable = &PL_vtbl_vec;
4951 case PERL_MAGIC_vstring:
4954 case PERL_MAGIC_utf8:
4955 vtable = &PL_vtbl_utf8;
4957 case PERL_MAGIC_substr:
4958 vtable = &PL_vtbl_substr;
4960 case PERL_MAGIC_defelem:
4961 vtable = &PL_vtbl_defelem;
4963 case PERL_MAGIC_glob:
4964 vtable = &PL_vtbl_glob;
4966 case PERL_MAGIC_arylen:
4967 vtable = &PL_vtbl_arylen;
4969 case PERL_MAGIC_pos:
4970 vtable = &PL_vtbl_pos;
4972 case PERL_MAGIC_backref:
4973 vtable = &PL_vtbl_backref;
4975 case PERL_MAGIC_ext:
4976 /* Reserved for use by extensions not perl internals. */
4977 /* Useful for attaching extension internal data to perl vars. */
4978 /* Note that multiple extensions may clash if magical scalars */
4979 /* etc holding private data from one are passed to another. */
4982 Perl_croak(aTHX_ "Don't know how to handle magic of type \\%o", how);
4985 /* Rest of work is done else where */
4986 mg = sv_magicext(sv,obj,how,vtable,name,namlen);
4989 case PERL_MAGIC_taint:
4992 case PERL_MAGIC_ext:
4993 case PERL_MAGIC_dbfile:
5000 =for apidoc sv_unmagic
5002 Removes all magic of type C<type> from an SV.
5008 Perl_sv_unmagic(pTHX_ SV *sv, int type)
5012 if (SvTYPE(sv) < SVt_PVMG || !SvMAGIC(sv))
5015 for (mg = *mgp; mg; mg = *mgp) {
5016 if (mg->mg_type == type) {
5017 MGVTBL* vtbl = mg->mg_virtual;
5018 *mgp = mg->mg_moremagic;
5019 if (vtbl && vtbl->svt_free)
5020 CALL_FPTR(vtbl->svt_free)(aTHX_ sv, mg);
5021 if (mg->mg_ptr && mg->mg_type != PERL_MAGIC_regex_global) {
5023 Safefree(mg->mg_ptr);
5024 else if (mg->mg_len == HEf_SVKEY)
5025 SvREFCNT_dec((SV*)mg->mg_ptr);
5026 else if (mg->mg_type == PERL_MAGIC_utf8 && mg->mg_ptr)
5027 Safefree(mg->mg_ptr);
5029 if (mg->mg_flags & MGf_REFCOUNTED)
5030 SvREFCNT_dec(mg->mg_obj);
5034 mgp = &mg->mg_moremagic;
5038 SvFLAGS(sv) |= (SvFLAGS(sv) & (SVp_NOK|SVp_POK)) >> PRIVSHIFT;
5045 =for apidoc sv_rvweaken
5047 Weaken a reference: set the C<SvWEAKREF> flag on this RV; give the
5048 referred-to SV C<PERL_MAGIC_backref> magic if it hasn't already; and
5049 push a back-reference to this RV onto the array of backreferences
5050 associated with that magic.
5056 Perl_sv_rvweaken(pTHX_ SV *sv)
5059 if (!SvOK(sv)) /* let undefs pass */
5062 Perl_croak(aTHX_ "Can't weaken a nonreference");
5063 else if (SvWEAKREF(sv)) {
5064 if (ckWARN(WARN_MISC))
5065 Perl_warner(aTHX_ packWARN(WARN_MISC), "Reference is already weak");
5069 sv_add_backref(tsv, sv);
5075 /* Give tsv backref magic if it hasn't already got it, then push a
5076 * back-reference to sv onto the array associated with the backref magic.
5080 S_sv_add_backref(pTHX_ SV *tsv, SV *sv)
5084 if (SvMAGICAL(tsv) && (mg = mg_find(tsv, PERL_MAGIC_backref)))
5085 av = (AV*)mg->mg_obj;
5088 sv_magic(tsv, (SV*)av, PERL_MAGIC_backref, NULL, 0);
5089 SvREFCNT_dec(av); /* for sv_magic */
5091 if (AvFILLp(av) >= AvMAX(av)) {
5092 SV **svp = AvARRAY(av);
5093 I32 i = AvFILLp(av);
5095 if (svp[i] == &PL_sv_undef) {
5096 svp[i] = sv; /* reuse the slot */
5101 av_extend(av, AvFILLp(av)+1);
5103 AvARRAY(av)[++AvFILLp(av)] = sv; /* av_push() */
5106 /* delete a back-reference to ourselves from the backref magic associated
5107 * with the SV we point to.
5111 S_sv_del_backref(pTHX_ SV *sv)
5118 if (!SvMAGICAL(tsv) || !(mg = mg_find(tsv, PERL_MAGIC_backref)))
5119 Perl_croak(aTHX_ "panic: del_backref");
5120 av = (AV *)mg->mg_obj;
5125 svp[i] = &PL_sv_undef; /* XXX */
5132 =for apidoc sv_insert
5134 Inserts a string at the specified offset/length within the SV. Similar to
5135 the Perl substr() function.
5141 Perl_sv_insert(pTHX_ SV *bigstr, STRLEN offset, STRLEN len, char *little, STRLEN littlelen)
5145 register char *midend;
5146 register char *bigend;
5152 Perl_croak(aTHX_ "Can't modify non-existent substring");
5153 SvPV_force(bigstr, curlen);
5154 (void)SvPOK_only_UTF8(bigstr);
5155 if (offset + len > curlen) {
5156 SvGROW(bigstr, offset+len+1);
5157 Zero(SvPVX(bigstr)+curlen, offset+len-curlen, char);
5158 SvCUR_set(bigstr, offset+len);
5162 i = littlelen - len;
5163 if (i > 0) { /* string might grow */
5164 big = SvGROW(bigstr, SvCUR(bigstr) + i + 1);
5165 mid = big + offset + len;
5166 midend = bigend = big + SvCUR(bigstr);
5169 while (midend > mid) /* shove everything down */
5170 *--bigend = *--midend;
5171 Move(little,big+offset,littlelen,char);
5177 Move(little,SvPVX(bigstr)+offset,len,char);
5182 big = SvPVX(bigstr);
5185 bigend = big + SvCUR(bigstr);
5187 if (midend > bigend)
5188 Perl_croak(aTHX_ "panic: sv_insert");
5190 if (mid - big > bigend - midend) { /* faster to shorten from end */
5192 Move(little, mid, littlelen,char);
5195 i = bigend - midend;
5197 Move(midend, mid, i,char);
5201 SvCUR_set(bigstr, mid - big);
5204 else if ((i = mid - big)) { /* faster from front */
5205 midend -= littlelen;
5207 sv_chop(bigstr,midend-i);
5212 Move(little, mid, littlelen,char);
5214 else if (littlelen) {
5215 midend -= littlelen;
5216 sv_chop(bigstr,midend);
5217 Move(little,midend,littlelen,char);
5220 sv_chop(bigstr,midend);
5226 =for apidoc sv_replace
5228 Make the first argument a copy of the second, then delete the original.
5229 The target SV physically takes over ownership of the body of the source SV
5230 and inherits its flags; however, the target keeps any magic it owns,
5231 and any magic in the source is discarded.
5232 Note that this is a rather specialist SV copying operation; most of the
5233 time you'll want to use C<sv_setsv> or one of its many macro front-ends.
5239 Perl_sv_replace(pTHX_ register SV *sv, register SV *nsv)
5241 U32 refcnt = SvREFCNT(sv);
5242 SV_CHECK_THINKFIRST_COW_DROP(sv);
5243 if (SvREFCNT(nsv) != 1 && ckWARN_d(WARN_INTERNAL))
5244 Perl_warner(aTHX_ packWARN(WARN_INTERNAL), "Reference miscount in sv_replace()");
5245 if (SvMAGICAL(sv)) {
5249 sv_upgrade(nsv, SVt_PVMG);
5250 SvMAGIC(nsv) = SvMAGIC(sv);
5251 SvFLAGS(nsv) |= SvMAGICAL(sv);
5257 assert(!SvREFCNT(sv));
5258 StructCopy(nsv,sv,SV);
5259 #ifdef PERL_COPY_ON_WRITE
5260 if (SvIsCOW_normal(nsv)) {
5261 /* We need to follow the pointers around the loop to make the
5262 previous SV point to sv, rather than nsv. */
5265 while ((next = SV_COW_NEXT_SV(current)) != nsv) {
5268 assert(SvPVX(current) == SvPVX(nsv));
5270 /* Make the SV before us point to the SV after us. */
5272 PerlIO_printf(Perl_debug_log, "previous is\n");
5274 PerlIO_printf(Perl_debug_log,
5275 "move it from 0x%"UVxf" to 0x%"UVxf"\n",
5276 (UV) SV_COW_NEXT_SV(current), (UV) sv);
5278 SV_COW_NEXT_SV_SET(current, sv);
5281 SvREFCNT(sv) = refcnt;
5282 SvFLAGS(nsv) |= SVTYPEMASK; /* Mark as freed */
5287 =for apidoc sv_clear
5289 Clear an SV: call any destructors, free up any memory used by the body,
5290 and free the body itself. The SV's head is I<not> freed, although
5291 its type is set to all 1's so that it won't inadvertently be assumed
5292 to be live during global destruction etc.
5293 This function should only be called when REFCNT is zero. Most of the time
5294 you'll want to call C<sv_free()> (or its macro wrapper C<SvREFCNT_dec>)
5301 Perl_sv_clear(pTHX_ register SV *sv)
5305 assert(SvREFCNT(sv) == 0);
5308 if (PL_defstash) { /* Still have a symbol table? */
5313 Zero(&tmpref, 1, SV);
5314 sv_upgrade(&tmpref, SVt_RV);
5316 SvREADONLY_on(&tmpref); /* DESTROY() could be naughty */
5317 SvREFCNT(&tmpref) = 1;
5320 stash = SvSTASH(sv);
5321 destructor = StashHANDLER(stash,DESTROY);
5324 PUSHSTACKi(PERLSI_DESTROY);
5325 SvRV(&tmpref) = SvREFCNT_inc(sv);
5330 call_sv((SV*)destructor, G_DISCARD|G_EVAL|G_KEEPERR|G_VOID);
5336 } while (SvOBJECT(sv) && SvSTASH(sv) != stash);
5338 del_XRV(SvANY(&tmpref));
5341 if (PL_in_clean_objs)
5342 Perl_croak(aTHX_ "DESTROY created new reference to dead object '%s'",
5344 /* DESTROY gave object new lease on life */
5350 SvREFCNT_dec(SvSTASH(sv)); /* possibly of changed persuasion */
5351 SvOBJECT_off(sv); /* Curse the object. */
5352 if (SvTYPE(sv) != SVt_PVIO)
5353 --PL_sv_objcount; /* XXX Might want something more general */
5356 if (SvTYPE(sv) >= SVt_PVMG) {
5359 if (SvFLAGS(sv) & SVpad_TYPED)
5360 SvREFCNT_dec(SvSTASH(sv));
5363 switch (SvTYPE(sv)) {
5366 IoIFP(sv) != PerlIO_stdin() &&
5367 IoIFP(sv) != PerlIO_stdout() &&
5368 IoIFP(sv) != PerlIO_stderr())
5370 io_close((IO*)sv, FALSE);
5372 if (IoDIRP(sv) && !(IoFLAGS(sv) & IOf_FAKE_DIRP))
5373 PerlDir_close(IoDIRP(sv));
5374 IoDIRP(sv) = (DIR*)NULL;
5375 Safefree(IoTOP_NAME(sv));
5376 Safefree(IoFMT_NAME(sv));
5377 Safefree(IoBOTTOM_NAME(sv));
5392 SvREFCNT_dec(LvTARG(sv));
5396 Safefree(GvNAME(sv));
5397 /* cannot decrease stash refcount yet, as we might recursively delete
5398 ourselves when the refcnt drops to zero. Delay SvREFCNT_dec
5399 of stash until current sv is completely gone.
5400 -- JohnPC, 27 Mar 1998 */
5401 stash = GvSTASH(sv);
5407 (void)SvOOK_off(sv);
5415 SvREFCNT_dec(SvRV(sv));
5417 #ifdef PERL_COPY_ON_WRITE
5418 else if (SvPVX(sv)) {
5420 /* I believe I need to grab the global SV mutex here and
5421 then recheck the COW status. */
5423 PerlIO_printf(Perl_debug_log, "Copy on write: clear\n");
5426 sv_release_COW(sv, SvPVX(sv), SvCUR(sv), SvLEN(sv),
5427 SvUVX(sv), SV_COW_NEXT_SV(sv));
5428 /* And drop it here. */
5430 } else if (SvLEN(sv)) {
5431 Safefree(SvPVX(sv));
5435 else if (SvPVX(sv) && SvLEN(sv))
5436 Safefree(SvPVX(sv));
5437 else if (SvPVX(sv) && SvREADONLY(sv) && SvFAKE(sv)) {
5438 unsharepvn(SvPVX(sv),
5439 SvUTF8(sv) ? -(I32)SvCUR(sv) : SvCUR(sv),
5453 switch (SvTYPE(sv)) {
5469 del_XPVIV(SvANY(sv));
5472 del_XPVNV(SvANY(sv));
5475 del_XPVMG(SvANY(sv));
5478 del_XPVLV(SvANY(sv));
5481 del_XPVAV(SvANY(sv));
5484 del_XPVHV(SvANY(sv));
5487 del_XPVCV(SvANY(sv));
5490 del_XPVGV(SvANY(sv));
5491 /* code duplication for increased performance. */
5492 SvFLAGS(sv) &= SVf_BREAK;
5493 SvFLAGS(sv) |= SVTYPEMASK;
5494 /* decrease refcount of the stash that owns this GV, if any */
5496 SvREFCNT_dec(stash);
5497 return; /* not break, SvFLAGS reset already happened */
5499 del_XPVBM(SvANY(sv));
5502 del_XPVFM(SvANY(sv));
5505 del_XPVIO(SvANY(sv));
5508 SvFLAGS(sv) &= SVf_BREAK;
5509 SvFLAGS(sv) |= SVTYPEMASK;
5513 =for apidoc sv_newref
5515 Increment an SV's reference count. Use the C<SvREFCNT_inc()> wrapper
5522 Perl_sv_newref(pTHX_ SV *sv)
5532 Decrement an SV's reference count, and if it drops to zero, call
5533 C<sv_clear> to invoke destructors and free up any memory used by
5534 the body; finally, deallocate the SV's head itself.
5535 Normally called via a wrapper macro C<SvREFCNT_dec>.
5541 Perl_sv_free(pTHX_ SV *sv)
5545 if (SvREFCNT(sv) == 0) {
5546 if (SvFLAGS(sv) & SVf_BREAK)
5547 /* this SV's refcnt has been artificially decremented to
5548 * trigger cleanup */
5550 if (PL_in_clean_all) /* All is fair */
5552 if (SvREADONLY(sv) && SvIMMORTAL(sv)) {
5553 /* make sure SvREFCNT(sv)==0 happens very seldom */
5554 SvREFCNT(sv) = (~(U32)0)/2;
5557 if (ckWARN_d(WARN_INTERNAL))
5558 Perl_warner(aTHX_ packWARN(WARN_INTERNAL), "Attempt to free unreferenced scalar");
5561 if (--(SvREFCNT(sv)) > 0)
5563 Perl_sv_free2(aTHX_ sv);
5567 Perl_sv_free2(pTHX_ SV *sv)
5571 if (ckWARN_d(WARN_DEBUGGING))
5572 Perl_warner(aTHX_ packWARN(WARN_DEBUGGING),
5573 "Attempt to free temp prematurely: SV 0x%"UVxf,
5578 if (SvREADONLY(sv) && SvIMMORTAL(sv)) {
5579 /* make sure SvREFCNT(sv)==0 happens very seldom */
5580 SvREFCNT(sv) = (~(U32)0)/2;
5591 Returns the length of the string in the SV. Handles magic and type
5592 coercion. See also C<SvCUR>, which gives raw access to the xpv_cur slot.
5598 Perl_sv_len(pTHX_ register SV *sv)
5606 len = mg_length(sv);
5608 (void)SvPV(sv, len);
5613 =for apidoc sv_len_utf8
5615 Returns the number of characters in the string in an SV, counting wide
5616 UTF8 bytes as a single character. Handles magic and type coercion.
5622 * The length is cached in PERL_UTF8_magic, in the mg_len field. Also the
5623 * mg_ptr is used, by sv_pos_u2b(), see the comments of S_utf8_mg_pos_init().
5624 * (Note that the mg_len is not the length of the mg_ptr field.)
5629 Perl_sv_len_utf8(pTHX_ register SV *sv)
5635 return mg_length(sv);
5639 U8 *s = (U8*)SvPV(sv, len);
5640 MAGIC *mg = SvMAGICAL(sv) ? mg_find(sv, PERL_MAGIC_utf8) : 0;
5642 if (mg && mg->mg_len != -1 && (mg->mg_len > 0 || len == 0))
5645 ulen = Perl_utf8_length(aTHX_ s, s + len);
5646 if (!mg && !SvREADONLY(sv)) {
5647 sv_magic(sv, 0, PERL_MAGIC_utf8, 0, 0);
5648 mg = mg_find(sv, PERL_MAGIC_utf8);
5658 /* S_utf8_mg_pos_init() is used to initialize the mg_ptr field of
5659 * a PERL_UTF8_magic. The mg_ptr is used to store the mapping
5660 * between UTF-8 and byte offsets. There are two (substr offset and substr
5661 * length, the i offset, PERL_MAGIC_UTF8_CACHESIZE) times two (UTF-8 offset
5662 * and byte offset) cache positions.
5664 * The mg_len field is used by sv_len_utf8(), see its comments.
5665 * Note that the mg_len is not the length of the mg_ptr field.
5669 S_utf8_mg_pos_init(pTHX_ SV *sv, MAGIC **mgp, STRLEN **cachep, I32 i, I32 *offsetp, U8 *s, U8 *start)
5673 if (SvMAGICAL(sv) && !SvREADONLY(sv)) {
5675 sv_magic(sv, 0, PERL_MAGIC_utf8, 0, 0);
5676 *mgp = mg_find(sv, PERL_MAGIC_utf8);
5681 *cachep = (STRLEN *) (*mgp)->mg_ptr;
5683 Newz(0, *cachep, PERL_MAGIC_UTF8_CACHESIZE * 2, STRLEN);
5684 (*mgp)->mg_ptr = (char *) *cachep;
5688 (*cachep)[i] = *offsetp;
5689 (*cachep)[i+1] = s - start;
5697 * S_utf8_mg_pos() is used to query and update mg_ptr field of
5698 * a PERL_UTF8_magic. The mg_ptr is used to store the mapping
5699 * between UTF-8 and byte offsets. See also the comments of
5700 * S_utf8_mg_pos_init().
5704 S_utf8_mg_pos(pTHX_ SV *sv, MAGIC **mgp, STRLEN **cachep, I32 i, I32 *offsetp, I32 uoff, U8 **sp, U8 *start, U8 *send)
5708 if (SvMAGICAL(sv) && !SvREADONLY(sv)) {
5710 *mgp = mg_find(sv, PERL_MAGIC_utf8);
5711 if (*mgp && (*mgp)->mg_ptr) {
5712 *cachep = (STRLEN *) (*mgp)->mg_ptr;
5713 if ((*cachep)[i] == (STRLEN)uoff) /* An exact match. */
5715 else { /* We will skip to the right spot. */
5720 /* The assumption is that going backward is half
5721 * the speed of going forward (that's where the
5722 * 2 * backw in the below comes from). (The real
5723 * figure of course depends on the UTF-8 data.) */
5725 if ((*cachep)[i] > (STRLEN)uoff) {
5727 backw = (*cachep)[i] - (STRLEN)uoff;
5729 if (forw < 2 * backw)
5732 p = start + (*cachep)[i+1];
5734 /* Try this only for the substr offset (i == 0),
5735 * not for the substr length (i == 2). */
5736 else if (i == 0) { /* (*cachep)[i] < uoff */
5737 STRLEN ulen = sv_len_utf8(sv);
5739 if ((STRLEN)uoff < ulen) {
5740 forw = (STRLEN)uoff - (*cachep)[i];
5741 backw = ulen - (STRLEN)uoff;
5743 if (forw < 2 * backw)
5744 p = start + (*cachep)[i+1];
5749 /* If the string is not long enough for uoff,
5750 * we could extend it, but not at this low a level. */
5754 if (forw < 2 * backw) {
5761 while (UTF8_IS_CONTINUATION(*p))
5766 /* Update the cache. */
5767 (*cachep)[i] = (STRLEN)uoff;
5768 (*cachep)[i+1] = p - start;
5773 if (found) { /* Setup the return values. */
5774 *offsetp = (*cachep)[i+1];
5775 *sp = start + *offsetp;
5778 *offsetp = send - start;
5780 else if (*sp < start) {
5791 =for apidoc sv_pos_u2b
5793 Converts the value pointed to by offsetp from a count of UTF8 chars from
5794 the start of the string, to a count of the equivalent number of bytes; if
5795 lenp is non-zero, it does the same to lenp, but this time starting from
5796 the offset, rather than from the start of the string. Handles magic and
5803 * sv_pos_u2b() uses, like sv_pos_b2u(), the mg_ptr of the potential
5804 * PERL_UTF8_magic of the sv to store the mapping between UTF-8 and
5805 * byte offsets. See also the comments of S_utf8_mg_pos().
5810 Perl_sv_pos_u2b(pTHX_ register SV *sv, I32* offsetp, I32* lenp)
5821 start = s = (U8*)SvPV(sv, len);
5823 I32 uoffset = *offsetp;
5828 if (utf8_mg_pos(sv, &mg, &cache, 0, offsetp, *offsetp, &s, start, send))
5830 if (!found && uoffset > 0) {
5831 while (s < send && uoffset--)
5835 if (utf8_mg_pos_init(sv, &mg, &cache, 0, offsetp, s, start))
5837 *offsetp = s - start;
5842 if (utf8_mg_pos(sv, &mg, &cache, 2, lenp, *lenp + *offsetp, &s, start, send)) {
5846 if (!found && *lenp > 0) {
5849 while (s < send && ulen--)
5853 if (utf8_mg_pos_init(sv, &mg, &cache, 2, lenp, s, start))
5854 cache[2] += *offsetp;
5868 =for apidoc sv_pos_b2u
5870 Converts the value pointed to by offsetp from a count of bytes from the
5871 start of the string, to a count of the equivalent number of UTF8 chars.
5872 Handles magic and type coercion.
5878 * sv_pos_b2u() uses, like sv_pos_u2b(), the mg_ptr of the potential
5879 * PERL_UTF8_magic of the sv to store the mapping between UTF-8 and
5880 * byte offsets. See also the comments of S_utf8_mg_pos().
5885 Perl_sv_pos_b2u(pTHX_ register SV* sv, I32* offsetp)
5893 s = (U8*)SvPV(sv, len);
5894 if ((I32)len < *offsetp)
5895 Perl_croak(aTHX_ "panic: sv_pos_b2u: bad byte offset");
5897 U8* send = s + *offsetp;
5899 STRLEN *cache = NULL;
5903 if (SvMAGICAL(sv) && !SvREADONLY(sv)) {
5904 mg = mg_find(sv, PERL_MAGIC_utf8);
5905 if (mg && mg->mg_ptr) {
5906 cache = (STRLEN *) mg->mg_ptr;
5907 if (cache[1] == *offsetp) {
5908 /* An exact match. */
5909 *offsetp = cache[0];
5913 else if (cache[1] < *offsetp) {
5914 /* We already know part of the way. */
5917 /* Let the below loop do the rest. */
5919 else { /* cache[1] > *offsetp */
5920 /* We already know all of the way, now we may
5921 * be able to walk back. The same assumption
5922 * is made as in S_utf8_mg_pos(), namely that
5923 * walking backward is twice slower than
5924 * walking forward. */
5925 STRLEN forw = *offsetp;
5926 STRLEN backw = cache[1] - *offsetp;
5928 if (!(forw < 2 * backw)) {
5929 U8 *p = s + cache[1];
5936 while (UTF8_IS_CONTINUATION(*p))
5952 /* Call utf8n_to_uvchr() to validate the sequence
5953 * (unless a simple non-UTF character) */
5954 if (!UTF8_IS_INVARIANT(*s))
5955 utf8n_to_uvchr(s, UTF8SKIP(s), &n, 0);
5964 if (!SvREADONLY(sv)) {
5966 sv_magic(sv, 0, PERL_MAGIC_utf8, 0, 0);
5967 mg = mg_find(sv, PERL_MAGIC_utf8);
5972 Newz(0, cache, PERL_MAGIC_UTF8_CACHESIZE * 2, STRLEN);
5973 mg->mg_ptr = (char *) cache;
5978 cache[1] = *offsetp;
5989 Returns a boolean indicating whether the strings in the two SVs are
5990 identical. Is UTF-8 and 'use bytes' aware, handles get magic, and will
5991 coerce its args to strings if necessary.
5997 Perl_sv_eq(pTHX_ register SV *sv1, register SV *sv2)
6005 SV* svrecode = Nullsv;
6012 pv1 = SvPV(sv1, cur1);
6019 pv2 = SvPV(sv2, cur2);
6021 if (cur1 && cur2 && SvUTF8(sv1) != SvUTF8(sv2) && !IN_BYTES) {
6022 /* Differing utf8ness.
6023 * Do not UTF8size the comparands as a side-effect. */
6026 svrecode = newSVpvn(pv2, cur2);
6027 sv_recode_to_utf8(svrecode, PL_encoding);
6028 pv2 = SvPV(svrecode, cur2);
6031 svrecode = newSVpvn(pv1, cur1);
6032 sv_recode_to_utf8(svrecode, PL_encoding);
6033 pv1 = SvPV(svrecode, cur1);
6035 /* Now both are in UTF-8. */
6040 bool is_utf8 = TRUE;
6043 /* sv1 is the UTF-8 one,
6044 * if is equal it must be downgrade-able */
6045 char *pv = (char*)bytes_from_utf8((U8*)pv1,
6051 /* sv2 is the UTF-8 one,
6052 * if is equal it must be downgrade-able */
6053 char *pv = (char *)bytes_from_utf8((U8*)pv2,
6059 /* Downgrade not possible - cannot be eq */
6066 eq = (pv1 == pv2) || memEQ(pv1, pv2, cur1);
6069 SvREFCNT_dec(svrecode);
6080 Compares the strings in two SVs. Returns -1, 0, or 1 indicating whether the
6081 string in C<sv1> is less than, equal to, or greater than the string in
6082 C<sv2>. Is UTF-8 and 'use bytes' aware, handles get magic, and will
6083 coerce its args to strings if necessary. See also C<sv_cmp_locale>.
6089 Perl_sv_cmp(pTHX_ register SV *sv1, register SV *sv2)
6092 char *pv1, *pv2, *tpv = Nullch;
6094 SV *svrecode = Nullsv;
6101 pv1 = SvPV(sv1, cur1);
6108 pv2 = SvPV(sv2, cur2);
6110 if (cur1 && cur2 && SvUTF8(sv1) != SvUTF8(sv2) && !IN_BYTES) {
6111 /* Differing utf8ness.
6112 * Do not UTF8size the comparands as a side-effect. */
6115 svrecode = newSVpvn(pv2, cur2);
6116 sv_recode_to_utf8(svrecode, PL_encoding);
6117 pv2 = SvPV(svrecode, cur2);
6120 pv2 = tpv = (char*)bytes_to_utf8((U8*)pv2, &cur2);
6125 svrecode = newSVpvn(pv1, cur1);
6126 sv_recode_to_utf8(svrecode, PL_encoding);
6127 pv1 = SvPV(svrecode, cur1);
6130 pv1 = tpv = (char*)bytes_to_utf8((U8*)pv1, &cur1);
6136 cmp = cur2 ? -1 : 0;
6140 I32 retval = memcmp((void*)pv1, (void*)pv2, cur1 < cur2 ? cur1 : cur2);
6143 cmp = retval < 0 ? -1 : 1;
6144 } else if (cur1 == cur2) {
6147 cmp = cur1 < cur2 ? -1 : 1;
6152 SvREFCNT_dec(svrecode);
6161 =for apidoc sv_cmp_locale
6163 Compares the strings in two SVs in a locale-aware manner. Is UTF-8 and
6164 'use bytes' aware, handles get magic, and will coerce its args to strings
6165 if necessary. See also C<sv_cmp_locale>. See also C<sv_cmp>.
6171 Perl_sv_cmp_locale(pTHX_ register SV *sv1, register SV *sv2)
6173 #ifdef USE_LOCALE_COLLATE
6179 if (PL_collation_standard)
6183 pv1 = sv1 ? sv_collxfrm(sv1, &len1) : (char *) NULL;
6185 pv2 = sv2 ? sv_collxfrm(sv2, &len2) : (char *) NULL;
6187 if (!pv1 || !len1) {
6198 retval = memcmp((void*)pv1, (void*)pv2, len1 < len2 ? len1 : len2);
6201 return retval < 0 ? -1 : 1;
6204 * When the result of collation is equality, that doesn't mean
6205 * that there are no differences -- some locales exclude some
6206 * characters from consideration. So to avoid false equalities,
6207 * we use the raw string as a tiebreaker.
6213 #endif /* USE_LOCALE_COLLATE */
6215 return sv_cmp(sv1, sv2);
6219 #ifdef USE_LOCALE_COLLATE
6222 =for apidoc sv_collxfrm
6224 Add Collate Transform magic to an SV if it doesn't already have it.
6226 Any scalar variable may carry PERL_MAGIC_collxfrm magic that contains the
6227 scalar data of the variable, but transformed to such a format that a normal
6228 memory comparison can be used to compare the data according to the locale
6235 Perl_sv_collxfrm(pTHX_ SV *sv, STRLEN *nxp)
6239 mg = SvMAGICAL(sv) ? mg_find(sv, PERL_MAGIC_collxfrm) : (MAGIC *) NULL;
6240 if (!mg || !mg->mg_ptr || *(U32*)mg->mg_ptr != PL_collation_ix) {
6245 Safefree(mg->mg_ptr);
6247 if ((xf = mem_collxfrm(s, len, &xlen))) {
6248 if (SvREADONLY(sv)) {
6251 return xf + sizeof(PL_collation_ix);
6254 sv_magic(sv, 0, PERL_MAGIC_collxfrm, 0, 0);
6255 mg = mg_find(sv, PERL_MAGIC_collxfrm);
6268 if (mg && mg->mg_ptr) {
6270 return mg->mg_ptr + sizeof(PL_collation_ix);
6278 #endif /* USE_LOCALE_COLLATE */
6283 Get a line from the filehandle and store it into the SV, optionally
6284 appending to the currently-stored string.
6290 Perl_sv_gets(pTHX_ register SV *sv, register PerlIO *fp, I32 append)
6294 register STDCHAR rslast;
6295 register STDCHAR *bp;
6301 if (SvTHINKFIRST(sv))
6302 sv_force_normal_flags(sv, append ? 0 : SV_COW_DROP_PV);
6303 /* XXX. If you make this PVIV, then copy on write can copy scalars read
6305 However, perlbench says it's slower, because the existing swipe code
6306 is faster than copy on write.
6307 Swings and roundabouts. */
6308 (void)SvUPGRADE(sv, SVt_PV);
6313 if (PerlIO_isutf8(fp)) {
6315 sv_utf8_upgrade_nomg(sv);
6316 sv_pos_u2b(sv,&append,0);
6318 } else if (SvUTF8(sv)) {
6319 SV *tsv = NEWSV(0,0);
6320 sv_gets(tsv, fp, 0);
6321 sv_utf8_upgrade_nomg(tsv);
6322 SvCUR_set(sv,append);
6325 goto return_string_or_null;
6330 if (PerlIO_isutf8(fp))
6333 if (PL_curcop == &PL_compiling) {
6334 /* we always read code in line mode */
6338 else if (RsSNARF(PL_rs)) {
6339 /* If it is a regular disk file use size from stat() as estimate
6340 of amount we are going to read - may result in malloc-ing
6341 more memory than we realy need if layers bellow reduce
6342 size we read (e.g. CRLF or a gzip layer)
6345 if (!PerlLIO_fstat(PerlIO_fileno(fp), &st) && S_ISREG(st.st_mode)) {
6346 Off_t offset = PerlIO_tell(fp);
6347 if (offset != (Off_t) -1) {
6348 (void) SvGROW(sv, (STRLEN)((st.st_size - offset) + append + 1));
6354 else if (RsRECORD(PL_rs)) {
6358 /* Grab the size of the record we're getting */
6359 recsize = SvIV(SvRV(PL_rs));
6360 buffer = SvGROW(sv, (STRLEN)(recsize + append + 1)) + append;
6363 /* VMS wants read instead of fread, because fread doesn't respect */
6364 /* RMS record boundaries. This is not necessarily a good thing to be */
6365 /* doing, but we've got no other real choice - except avoid stdio
6366 as implementation - perhaps write a :vms layer ?
6368 bytesread = PerlLIO_read(PerlIO_fileno(fp), buffer, recsize);
6370 bytesread = PerlIO_read(fp, buffer, recsize);
6372 SvCUR_set(sv, bytesread += append);
6373 buffer[bytesread] = '\0';
6374 goto return_string_or_null;
6376 else if (RsPARA(PL_rs)) {
6382 /* Get $/ i.e. PL_rs into same encoding as stream wants */
6383 if (PerlIO_isutf8(fp)) {
6384 rsptr = SvPVutf8(PL_rs, rslen);
6387 if (SvUTF8(PL_rs)) {
6388 if (!sv_utf8_downgrade(PL_rs, TRUE)) {
6389 Perl_croak(aTHX_ "Wide character in $/");
6392 rsptr = SvPV(PL_rs, rslen);
6396 rslast = rslen ? rsptr[rslen - 1] : '\0';
6398 if (rspara) { /* have to do this both before and after */
6399 do { /* to make sure file boundaries work right */
6402 i = PerlIO_getc(fp);
6406 PerlIO_ungetc(fp,i);
6412 /* See if we know enough about I/O mechanism to cheat it ! */
6414 /* This used to be #ifdef test - it is made run-time test for ease
6415 of abstracting out stdio interface. One call should be cheap
6416 enough here - and may even be a macro allowing compile
6420 if (PerlIO_fast_gets(fp)) {
6423 * We're going to steal some values from the stdio struct
6424 * and put EVERYTHING in the innermost loop into registers.
6426 register STDCHAR *ptr;
6430 #if defined(VMS) && defined(PERLIO_IS_STDIO)
6431 /* An ungetc()d char is handled separately from the regular
6432 * buffer, so we getc() it back out and stuff it in the buffer.
6434 i = PerlIO_getc(fp);
6435 if (i == EOF) return 0;
6436 *(--((*fp)->_ptr)) = (unsigned char) i;
6440 /* Here is some breathtakingly efficient cheating */
6442 cnt = PerlIO_get_cnt(fp); /* get count into register */
6443 /* make sure we have the room */
6444 if ((I32)(SvLEN(sv) - append) <= cnt + 1) {
6445 /* Not room for all of it
6446 if we are looking for a separator and room for some
6448 if (rslen && cnt > 80 && (I32)SvLEN(sv) > append) {
6449 /* just process what we have room for */
6450 shortbuffered = cnt - SvLEN(sv) + append + 1;
6451 cnt -= shortbuffered;
6455 /* remember that cnt can be negative */
6456 SvGROW(sv, (STRLEN)(append + (cnt <= 0 ? 2 : (cnt + 1))));
6461 bp = (STDCHAR*)SvPVX(sv) + append; /* move these two too to registers */
6462 ptr = (STDCHAR*)PerlIO_get_ptr(fp);
6463 DEBUG_P(PerlIO_printf(Perl_debug_log,
6464 "Screamer: entering, ptr=%"UVuf", cnt=%ld\n",PTR2UV(ptr),(long)cnt));
6465 DEBUG_P(PerlIO_printf(Perl_debug_log,
6466 "Screamer: entering: PerlIO * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
6467 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
6468 PTR2UV(PerlIO_has_base(fp) ? PerlIO_get_base(fp) : 0)));
6473 while (cnt > 0) { /* this | eat */
6475 if ((*bp++ = *ptr++) == rslast) /* really | dust */
6476 goto thats_all_folks; /* screams | sed :-) */
6480 Copy(ptr, bp, cnt, char); /* this | eat */
6481 bp += cnt; /* screams | dust */
6482 ptr += cnt; /* louder | sed :-) */
6487 if (shortbuffered) { /* oh well, must extend */
6488 cnt = shortbuffered;
6490 bpx = bp - (STDCHAR*)SvPVX(sv); /* box up before relocation */
6492 SvGROW(sv, SvLEN(sv) + append + cnt + 2);
6493 bp = (STDCHAR*)SvPVX(sv) + bpx; /* unbox after relocation */
6497 DEBUG_P(PerlIO_printf(Perl_debug_log,
6498 "Screamer: going to getc, ptr=%"UVuf", cnt=%ld\n",
6499 PTR2UV(ptr),(long)cnt));
6500 PerlIO_set_ptrcnt(fp, (STDCHAR*)ptr, cnt); /* deregisterize cnt and ptr */
6502 DEBUG_P(PerlIO_printf(Perl_debug_log,
6503 "Screamer: pre: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
6504 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
6505 PTR2UV(PerlIO_has_base (fp) ? PerlIO_get_base(fp) : 0)));
6507 /* This used to call 'filbuf' in stdio form, but as that behaves like
6508 getc when cnt <= 0 we use PerlIO_getc here to avoid introducing
6509 another abstraction. */
6510 i = PerlIO_getc(fp); /* get more characters */
6512 DEBUG_P(PerlIO_printf(Perl_debug_log,
6513 "Screamer: post: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
6514 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
6515 PTR2UV(PerlIO_has_base (fp) ? PerlIO_get_base(fp) : 0)));
6517 cnt = PerlIO_get_cnt(fp);
6518 ptr = (STDCHAR*)PerlIO_get_ptr(fp); /* reregisterize cnt and ptr */
6519 DEBUG_P(PerlIO_printf(Perl_debug_log,
6520 "Screamer: after getc, ptr=%"UVuf", cnt=%ld\n",PTR2UV(ptr),(long)cnt));
6522 if (i == EOF) /* all done for ever? */
6523 goto thats_really_all_folks;
6525 bpx = bp - (STDCHAR*)SvPVX(sv); /* box up before relocation */
6527 SvGROW(sv, bpx + cnt + 2);
6528 bp = (STDCHAR*)SvPVX(sv) + bpx; /* unbox after relocation */
6530 *bp++ = (STDCHAR)i; /* store character from PerlIO_getc */
6532 if (rslen && (STDCHAR)i == rslast) /* all done for now? */
6533 goto thats_all_folks;
6537 if ((rslen > 1 && (STRLEN)(bp - (STDCHAR*)SvPVX(sv)) < rslen) ||
6538 memNE((char*)bp - rslen, rsptr, rslen))
6539 goto screamer; /* go back to the fray */
6540 thats_really_all_folks:
6542 cnt += shortbuffered;
6543 DEBUG_P(PerlIO_printf(Perl_debug_log,
6544 "Screamer: quitting, ptr=%"UVuf", cnt=%ld\n",PTR2UV(ptr),(long)cnt));
6545 PerlIO_set_ptrcnt(fp, (STDCHAR*)ptr, cnt); /* put these back or we're in trouble */
6546 DEBUG_P(PerlIO_printf(Perl_debug_log,
6547 "Screamer: end: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
6548 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
6549 PTR2UV(PerlIO_has_base (fp) ? PerlIO_get_base(fp) : 0)));
6551 SvCUR_set(sv, bp - (STDCHAR*)SvPVX(sv)); /* set length */
6552 DEBUG_P(PerlIO_printf(Perl_debug_log,
6553 "Screamer: done, len=%ld, string=|%.*s|\n",
6554 (long)SvCUR(sv),(int)SvCUR(sv),SvPVX(sv)));
6559 /*The big, slow, and stupid way */
6562 /* Need to work around EPOC SDK features */
6563 /* On WINS: MS VC5 generates calls to _chkstk, */
6564 /* if a `large' stack frame is allocated */
6565 /* gcc on MARM does not generate calls like these */
6571 register STDCHAR *bpe = buf + sizeof(buf);
6573 while ((i = PerlIO_getc(fp)) != EOF && (*bp++ = (STDCHAR)i) != rslast && bp < bpe)
6574 ; /* keep reading */
6578 cnt = PerlIO_read(fp,(char*)buf, sizeof(buf));
6579 /* Accomodate broken VAXC compiler, which applies U8 cast to
6580 * both args of ?: operator, causing EOF to change into 255
6583 i = (U8)buf[cnt - 1];
6589 cnt = 0; /* we do need to re-set the sv even when cnt <= 0 */
6591 sv_catpvn(sv, (char *) buf, cnt);
6593 sv_setpvn(sv, (char *) buf, cnt);
6595 if (i != EOF && /* joy */
6597 SvCUR(sv) < rslen ||
6598 memNE(SvPVX(sv) + SvCUR(sv) - rslen, rsptr, rslen)))
6602 * If we're reading from a TTY and we get a short read,
6603 * indicating that the user hit his EOF character, we need
6604 * to notice it now, because if we try to read from the TTY
6605 * again, the EOF condition will disappear.
6607 * The comparison of cnt to sizeof(buf) is an optimization
6608 * that prevents unnecessary calls to feof().
6612 if (!(cnt < sizeof(buf) && PerlIO_eof(fp)))
6617 if (rspara) { /* have to do this both before and after */
6618 while (i != EOF) { /* to make sure file boundaries work right */
6619 i = PerlIO_getc(fp);
6621 PerlIO_ungetc(fp,i);
6627 return_string_or_null:
6628 return (SvCUR(sv) - append) ? SvPVX(sv) : Nullch;
6634 Auto-increment of the value in the SV, doing string to numeric conversion
6635 if necessary. Handles 'get' magic.
6641 Perl_sv_inc(pTHX_ register SV *sv)
6650 if (SvTHINKFIRST(sv)) {
6652 sv_force_normal_flags(sv, 0);
6653 if (SvREADONLY(sv)) {
6654 if (PL_curcop != &PL_compiling)
6655 Perl_croak(aTHX_ PL_no_modify);
6659 if (SvAMAGIC(sv) && AMG_CALLun(sv,inc))
6661 i = PTR2IV(SvRV(sv));
6666 flags = SvFLAGS(sv);
6667 if ((flags & (SVp_NOK|SVp_IOK)) == SVp_NOK) {
6668 /* It's (privately or publicly) a float, but not tested as an
6669 integer, so test it to see. */
6671 flags = SvFLAGS(sv);
6673 if ((flags & SVf_IOK) || ((flags & (SVp_IOK | SVp_NOK)) == SVp_IOK)) {
6674 /* It's publicly an integer, or privately an integer-not-float */
6675 #ifdef PERL_PRESERVE_IVUV
6679 if (SvUVX(sv) == UV_MAX)
6680 sv_setnv(sv, UV_MAX_P1);
6682 (void)SvIOK_only_UV(sv);
6685 if (SvIVX(sv) == IV_MAX)
6686 sv_setuv(sv, (UV)IV_MAX + 1);
6688 (void)SvIOK_only(sv);
6694 if (flags & SVp_NOK) {
6695 (void)SvNOK_only(sv);
6700 if (!(flags & SVp_POK) || !*SvPVX(sv)) {
6701 if ((flags & SVTYPEMASK) < SVt_PVIV)
6702 sv_upgrade(sv, SVt_IV);
6703 (void)SvIOK_only(sv);
6708 while (isALPHA(*d)) d++;
6709 while (isDIGIT(*d)) d++;
6711 #ifdef PERL_PRESERVE_IVUV
6712 /* Got to punt this as an integer if needs be, but we don't issue
6713 warnings. Probably ought to make the sv_iv_please() that does
6714 the conversion if possible, and silently. */
6715 int numtype = grok_number(SvPVX(sv), SvCUR(sv), NULL);
6716 if (numtype && !(numtype & IS_NUMBER_INFINITY)) {
6717 /* Need to try really hard to see if it's an integer.
6718 9.22337203685478e+18 is an integer.
6719 but "9.22337203685478e+18" + 0 is UV=9223372036854779904
6720 so $a="9.22337203685478e+18"; $a+0; $a++
6721 needs to be the same as $a="9.22337203685478e+18"; $a++
6728 /* sv_2iv *should* have made this an NV */
6729 if (flags & SVp_NOK) {
6730 (void)SvNOK_only(sv);
6734 /* I don't think we can get here. Maybe I should assert this
6735 And if we do get here I suspect that sv_setnv will croak. NWC
6737 #if defined(USE_LONG_DOUBLE)
6738 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",
6739 SvPVX(sv), SvIVX(sv), SvNVX(sv)));
6741 DEBUG_c(PerlIO_printf(Perl_debug_log,"sv_inc punt failed to convert '%s' to IOK or NOKp, UV=0x%"UVxf" NV=%"NVgf"\n",
6742 SvPVX(sv), SvIVX(sv), SvNVX(sv)));
6745 #endif /* PERL_PRESERVE_IVUV */
6746 sv_setnv(sv,Atof(SvPVX(sv)) + 1.0);
6750 while (d >= SvPVX(sv)) {
6758 /* MKS: The original code here died if letters weren't consecutive.
6759 * at least it didn't have to worry about non-C locales. The
6760 * new code assumes that ('z'-'a')==('Z'-'A'), letters are
6761 * arranged in order (although not consecutively) and that only
6762 * [A-Za-z] are accepted by isALPHA in the C locale.
6764 if (*d != 'z' && *d != 'Z') {
6765 do { ++*d; } while (!isALPHA(*d));
6768 *(d--) -= 'z' - 'a';
6773 *(d--) -= 'z' - 'a' + 1;
6777 /* oh,oh, the number grew */
6778 SvGROW(sv, SvCUR(sv) + 2);
6780 for (d = SvPVX(sv) + SvCUR(sv); d > SvPVX(sv); d--)
6791 Auto-decrement of the value in the SV, doing string to numeric conversion
6792 if necessary. Handles 'get' magic.
6798 Perl_sv_dec(pTHX_ register SV *sv)
6806 if (SvTHINKFIRST(sv)) {
6808 sv_force_normal_flags(sv, 0);
6809 if (SvREADONLY(sv)) {
6810 if (PL_curcop != &PL_compiling)
6811 Perl_croak(aTHX_ PL_no_modify);
6815 if (SvAMAGIC(sv) && AMG_CALLun(sv,dec))
6817 i = PTR2IV(SvRV(sv));
6822 /* Unlike sv_inc we don't have to worry about string-never-numbers
6823 and keeping them magic. But we mustn't warn on punting */
6824 flags = SvFLAGS(sv);
6825 if ((flags & SVf_IOK) || ((flags & (SVp_IOK | SVp_NOK)) == SVp_IOK)) {
6826 /* It's publicly an integer, or privately an integer-not-float */
6827 #ifdef PERL_PRESERVE_IVUV
6831 if (SvUVX(sv) == 0) {
6832 (void)SvIOK_only(sv);
6836 (void)SvIOK_only_UV(sv);
6840 if (SvIVX(sv) == IV_MIN)
6841 sv_setnv(sv, (NV)IV_MIN - 1.0);
6843 (void)SvIOK_only(sv);
6849 if (flags & SVp_NOK) {
6851 (void)SvNOK_only(sv);
6854 if (!(flags & SVp_POK)) {
6855 if ((flags & SVTYPEMASK) < SVt_PVNV)
6856 sv_upgrade(sv, SVt_NV);
6858 (void)SvNOK_only(sv);
6861 #ifdef PERL_PRESERVE_IVUV
6863 int numtype = grok_number(SvPVX(sv), SvCUR(sv), NULL);
6864 if (numtype && !(numtype & IS_NUMBER_INFINITY)) {
6865 /* Need to try really hard to see if it's an integer.
6866 9.22337203685478e+18 is an integer.
6867 but "9.22337203685478e+18" + 0 is UV=9223372036854779904
6868 so $a="9.22337203685478e+18"; $a+0; $a--
6869 needs to be the same as $a="9.22337203685478e+18"; $a--
6876 /* sv_2iv *should* have made this an NV */
6877 if (flags & SVp_NOK) {
6878 (void)SvNOK_only(sv);
6882 /* I don't think we can get here. Maybe I should assert this
6883 And if we do get here I suspect that sv_setnv will croak. NWC
6885 #if defined(USE_LONG_DOUBLE)
6886 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",
6887 SvPVX(sv), SvIVX(sv), SvNVX(sv)));
6889 DEBUG_c(PerlIO_printf(Perl_debug_log,"sv_dec punt failed to convert '%s' to IOK or NOKp, UV=0x%"UVxf" NV=%"NVgf"\n",
6890 SvPVX(sv), SvIVX(sv), SvNVX(sv)));
6894 #endif /* PERL_PRESERVE_IVUV */
6895 sv_setnv(sv,Atof(SvPVX(sv)) - 1.0); /* punt */
6899 =for apidoc sv_mortalcopy
6901 Creates a new SV which is a copy of the original SV (using C<sv_setsv>).
6902 The new SV is marked as mortal. It will be destroyed "soon", either by an
6903 explicit call to FREETMPS, or by an implicit call at places such as
6904 statement boundaries. See also C<sv_newmortal> and C<sv_2mortal>.
6909 /* Make a string that will exist for the duration of the expression
6910 * evaluation. Actually, it may have to last longer than that, but
6911 * hopefully we won't free it until it has been assigned to a
6912 * permanent location. */
6915 Perl_sv_mortalcopy(pTHX_ SV *oldstr)
6920 sv_setsv(sv,oldstr);
6922 PL_tmps_stack[++PL_tmps_ix] = sv;
6928 =for apidoc sv_newmortal
6930 Creates a new null SV which is mortal. The reference count of the SV is
6931 set to 1. It will be destroyed "soon", either by an explicit call to
6932 FREETMPS, or by an implicit call at places such as statement boundaries.
6933 See also C<sv_mortalcopy> and C<sv_2mortal>.
6939 Perl_sv_newmortal(pTHX)
6944 SvFLAGS(sv) = SVs_TEMP;
6946 PL_tmps_stack[++PL_tmps_ix] = sv;
6951 =for apidoc sv_2mortal
6953 Marks an existing SV as mortal. The SV will be destroyed "soon", either
6954 by an explicit call to FREETMPS, or by an implicit call at places such as
6955 statement boundaries. See also C<sv_newmortal> and C<sv_mortalcopy>.
6961 Perl_sv_2mortal(pTHX_ register SV *sv)
6965 if (SvREADONLY(sv) && SvIMMORTAL(sv))
6968 PL_tmps_stack[++PL_tmps_ix] = sv;
6976 Creates a new SV and copies a string into it. The reference count for the
6977 SV is set to 1. If C<len> is zero, Perl will compute the length using
6978 strlen(). For efficiency, consider using C<newSVpvn> instead.
6984 Perl_newSVpv(pTHX_ const char *s, STRLEN len)
6991 sv_setpvn(sv,s,len);
6996 =for apidoc newSVpvn
6998 Creates a new SV and copies a string into it. The reference count for the
6999 SV is set to 1. Note that if C<len> is zero, Perl will create a zero length
7000 string. You are responsible for ensuring that the source string is at least
7007 Perl_newSVpvn(pTHX_ const char *s, STRLEN len)
7012 sv_setpvn(sv,s,len);
7017 =for apidoc newSVpvn_share
7019 Creates a new SV with its SvPVX pointing to a shared string in the string
7020 table. If the string does not already exist in the table, it is created
7021 first. Turns on READONLY and FAKE. The string's hash is stored in the UV
7022 slot of the SV; if the C<hash> parameter is non-zero, that value is used;
7023 otherwise the hash is computed. The idea here is that as the string table
7024 is used for shared hash keys these strings will have SvPVX == HeKEY and
7025 hash lookup will avoid string compare.
7031 Perl_newSVpvn_share(pTHX_ const char *src, I32 len, U32 hash)
7034 bool is_utf8 = FALSE;
7036 STRLEN tmplen = -len;
7038 /* See the note in hv.c:hv_fetch() --jhi */
7039 src = (char*)bytes_from_utf8((U8*)src, &tmplen, &is_utf8);
7043 PERL_HASH(hash, src, len);
7045 sv_upgrade(sv, SVt_PVIV);
7046 SvPVX(sv) = sharepvn(src, is_utf8?-len:len, hash);
7059 #if defined(PERL_IMPLICIT_CONTEXT)
7061 /* pTHX_ magic can't cope with varargs, so this is a no-context
7062 * version of the main function, (which may itself be aliased to us).
7063 * Don't access this version directly.
7067 Perl_newSVpvf_nocontext(const char* pat, ...)
7072 va_start(args, pat);
7073 sv = vnewSVpvf(pat, &args);
7080 =for apidoc newSVpvf
7082 Creates a new SV and initializes it with the string formatted like
7089 Perl_newSVpvf(pTHX_ const char* pat, ...)
7093 va_start(args, pat);
7094 sv = vnewSVpvf(pat, &args);
7099 /* backend for newSVpvf() and newSVpvf_nocontext() */
7102 Perl_vnewSVpvf(pTHX_ const char* pat, va_list* args)
7106 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
7113 Creates a new SV and copies a floating point value into it.
7114 The reference count for the SV is set to 1.
7120 Perl_newSVnv(pTHX_ NV n)
7132 Creates a new SV and copies an integer into it. The reference count for the
7139 Perl_newSViv(pTHX_ IV i)
7151 Creates a new SV and copies an unsigned integer into it.
7152 The reference count for the SV is set to 1.
7158 Perl_newSVuv(pTHX_ UV u)
7168 =for apidoc newRV_noinc
7170 Creates an RV wrapper for an SV. The reference count for the original
7171 SV is B<not> incremented.
7177 Perl_newRV_noinc(pTHX_ SV *tmpRef)
7182 sv_upgrade(sv, SVt_RV);
7189 /* newRV_inc is the official function name to use now.
7190 * newRV_inc is in fact #defined to newRV in sv.h
7194 Perl_newRV(pTHX_ SV *tmpRef)
7196 return newRV_noinc(SvREFCNT_inc(tmpRef));
7202 Creates a new SV which is an exact duplicate of the original SV.
7209 Perl_newSVsv(pTHX_ register SV *old)
7215 if (SvTYPE(old) == SVTYPEMASK) {
7216 if (ckWARN_d(WARN_INTERNAL))
7217 Perl_warner(aTHX_ packWARN(WARN_INTERNAL), "semi-panic: attempt to dup freed string");
7232 =for apidoc sv_reset
7234 Underlying implementation for the C<reset> Perl function.
7235 Note that the perl-level function is vaguely deprecated.
7241 Perl_sv_reset(pTHX_ register char *s, HV *stash)
7249 char todo[PERL_UCHAR_MAX+1];
7254 if (!*s) { /* reset ?? searches */
7255 for (pm = HvPMROOT(stash); pm; pm = pm->op_pmnext) {
7256 pm->op_pmdynflags &= ~PMdf_USED;
7261 /* reset variables */
7263 if (!HvARRAY(stash))
7266 Zero(todo, 256, char);
7268 i = (unsigned char)*s;
7272 max = (unsigned char)*s++;
7273 for ( ; i <= max; i++) {
7276 for (i = 0; i <= (I32) HvMAX(stash); i++) {
7277 for (entry = HvARRAY(stash)[i];
7279 entry = HeNEXT(entry))
7281 if (!todo[(U8)*HeKEY(entry)])
7283 gv = (GV*)HeVAL(entry);
7285 if (SvTHINKFIRST(sv)) {
7286 if (!SvREADONLY(sv) && SvROK(sv))
7291 if (SvTYPE(sv) >= SVt_PV) {
7293 if (SvPVX(sv) != Nullch)
7300 if (GvHV(gv) && !HvNAME(GvHV(gv))) {
7302 #ifdef USE_ENVIRON_ARRAY
7304 # ifdef USE_ITHREADS
7305 && PL_curinterp == aTHX
7309 environ[0] = Nullch;
7321 Using various gambits, try to get an IO from an SV: the IO slot if its a
7322 GV; or the recursive result if we're an RV; or the IO slot of the symbol
7323 named after the PV if we're a string.
7329 Perl_sv_2io(pTHX_ SV *sv)
7335 switch (SvTYPE(sv)) {
7343 Perl_croak(aTHX_ "Bad filehandle: %s", GvNAME(gv));
7347 Perl_croak(aTHX_ PL_no_usym, "filehandle");
7349 return sv_2io(SvRV(sv));
7350 gv = gv_fetchpv(SvPV(sv,n_a), FALSE, SVt_PVIO);
7356 Perl_croak(aTHX_ "Bad filehandle: %"SVf, sv);
7365 Using various gambits, try to get a CV from an SV; in addition, try if
7366 possible to set C<*st> and C<*gvp> to the stash and GV associated with it.
7372 Perl_sv_2cv(pTHX_ SV *sv, HV **st, GV **gvp, I32 lref)
7379 return *gvp = Nullgv, Nullcv;
7380 switch (SvTYPE(sv)) {
7399 SV **sp = &sv; /* Used in tryAMAGICunDEREF macro. */
7400 tryAMAGICunDEREF(to_cv);
7403 if (SvTYPE(sv) == SVt_PVCV) {
7412 Perl_croak(aTHX_ "Not a subroutine reference");
7417 gv = gv_fetchpv(SvPV(sv, n_a), lref, SVt_PVCV);
7423 if (lref && !GvCVu(gv)) {
7426 tmpsv = NEWSV(704,0);
7427 gv_efullname3(tmpsv, gv, Nullch);
7428 /* XXX this is probably not what they think they're getting.
7429 * It has the same effect as "sub name;", i.e. just a forward
7431 newSUB(start_subparse(FALSE, 0),
7432 newSVOP(OP_CONST, 0, tmpsv),
7437 Perl_croak(aTHX_ "Unable to create sub named \"%"SVf"\"",
7447 Returns true if the SV has a true value by Perl's rules.
7448 Use the C<SvTRUE> macro instead, which may call C<sv_true()> or may
7449 instead use an in-line version.
7455 Perl_sv_true(pTHX_ register SV *sv)
7461 if ((tXpv = (XPV*)SvANY(sv)) &&
7462 (tXpv->xpv_cur > 1 ||
7463 (tXpv->xpv_cur && *tXpv->xpv_pv != '0')))
7470 return SvIVX(sv) != 0;
7473 return SvNVX(sv) != 0.0;
7475 return sv_2bool(sv);
7483 A private implementation of the C<SvIVx> macro for compilers which can't
7484 cope with complex macro expressions. Always use the macro instead.
7490 Perl_sv_iv(pTHX_ register SV *sv)
7494 return (IV)SvUVX(sv);
7503 A private implementation of the C<SvUVx> macro for compilers which can't
7504 cope with complex macro expressions. Always use the macro instead.
7510 Perl_sv_uv(pTHX_ register SV *sv)
7515 return (UV)SvIVX(sv);
7523 A private implementation of the C<SvNVx> macro for compilers which can't
7524 cope with complex macro expressions. Always use the macro instead.
7530 Perl_sv_nv(pTHX_ register SV *sv)
7537 /* sv_pv() is now a macro using SvPV_nolen();
7538 * this function provided for binary compatibility only
7542 Perl_sv_pv(pTHX_ SV *sv)
7549 return sv_2pv(sv, &n_a);
7555 Use the C<SvPV_nolen> macro instead
7559 A private implementation of the C<SvPV> macro for compilers which can't
7560 cope with complex macro expressions. Always use the macro instead.
7566 Perl_sv_pvn(pTHX_ SV *sv, STRLEN *lp)
7572 return sv_2pv(sv, lp);
7577 Perl_sv_pvn_nomg(pTHX_ register SV *sv, STRLEN *lp)
7583 return sv_2pv_flags(sv, lp, 0);
7586 /* sv_pvn_force() is now a macro using Perl_sv_pvn_force_flags();
7587 * this function provided for binary compatibility only
7591 Perl_sv_pvn_force(pTHX_ SV *sv, STRLEN *lp)
7593 return sv_pvn_force_flags(sv, lp, SV_GMAGIC);
7597 =for apidoc sv_pvn_force
7599 Get a sensible string out of the SV somehow.
7600 A private implementation of the C<SvPV_force> macro for compilers which
7601 can't cope with complex macro expressions. Always use the macro instead.
7603 =for apidoc sv_pvn_force_flags
7605 Get a sensible string out of the SV somehow.
7606 If C<flags> has C<SV_GMAGIC> bit set, will C<mg_get> on C<sv> if
7607 appropriate, else not. C<sv_pvn_force> and C<sv_pvn_force_nomg> are
7608 implemented in terms of this function.
7609 You normally want to use the various wrapper macros instead: see
7610 C<SvPV_force> and C<SvPV_force_nomg>
7616 Perl_sv_pvn_force_flags(pTHX_ SV *sv, STRLEN *lp, I32 flags)
7620 if (SvTHINKFIRST(sv) && !SvROK(sv))
7621 sv_force_normal_flags(sv, 0);
7627 if (SvTYPE(sv) > SVt_PVLV && SvTYPE(sv) != SVt_PVFM) {
7628 Perl_croak(aTHX_ "Can't coerce %s to string in %s", sv_reftype(sv,0),
7632 s = sv_2pv_flags(sv, lp, flags);
7633 if (s != SvPVX(sv)) { /* Almost, but not quite, sv_setpvn() */
7638 (void)SvUPGRADE(sv, SVt_PV); /* Never FALSE */
7639 SvGROW(sv, len + 1);
7640 Move(s,SvPVX(sv),len,char);
7645 SvPOK_on(sv); /* validate pointer */
7647 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2pv(%s)\n",
7648 PTR2UV(sv),SvPVX(sv)));
7654 /* sv_pvbyte () is now a macro using Perl_sv_2pv_flags();
7655 * this function provided for binary compatibility only
7659 Perl_sv_pvbyte(pTHX_ SV *sv)
7661 sv_utf8_downgrade(sv,0);
7666 =for apidoc sv_pvbyte
7668 Use C<SvPVbyte_nolen> instead.
7670 =for apidoc sv_pvbyten
7672 A private implementation of the C<SvPVbyte> macro for compilers
7673 which can't cope with complex macro expressions. Always use the macro
7680 Perl_sv_pvbyten(pTHX_ SV *sv, STRLEN *lp)
7682 sv_utf8_downgrade(sv,0);
7683 return sv_pvn(sv,lp);
7687 =for apidoc sv_pvbyten_force
7689 A private implementation of the C<SvPVbytex_force> macro for compilers
7690 which can't cope with complex macro expressions. Always use the macro
7697 Perl_sv_pvbyten_force(pTHX_ SV *sv, STRLEN *lp)
7699 sv_utf8_downgrade(sv,0);
7700 return sv_pvn_force(sv,lp);
7703 /* sv_pvutf8 () is now a macro using Perl_sv_2pv_flags();
7704 * this function provided for binary compatibility only
7708 Perl_sv_pvutf8(pTHX_ SV *sv)
7710 sv_utf8_upgrade(sv);
7715 =for apidoc sv_pvutf8
7717 Use the C<SvPVutf8_nolen> macro instead
7719 =for apidoc sv_pvutf8n
7721 A private implementation of the C<SvPVutf8> macro for compilers
7722 which can't cope with complex macro expressions. Always use the macro
7729 Perl_sv_pvutf8n(pTHX_ SV *sv, STRLEN *lp)
7731 sv_utf8_upgrade(sv);
7732 return sv_pvn(sv,lp);
7736 =for apidoc sv_pvutf8n_force
7738 A private implementation of the C<SvPVutf8_force> macro for compilers
7739 which can't cope with complex macro expressions. Always use the macro
7746 Perl_sv_pvutf8n_force(pTHX_ SV *sv, STRLEN *lp)
7748 sv_utf8_upgrade(sv);
7749 return sv_pvn_force(sv,lp);
7753 =for apidoc sv_reftype
7755 Returns a string describing what the SV is a reference to.
7761 Perl_sv_reftype(pTHX_ SV *sv, int ob)
7763 if (ob && SvOBJECT(sv)) {
7764 return HvNAME(SvSTASH(sv));
7767 switch (SvTYPE(sv)) {
7783 case SVt_PVLV: return "LVALUE";
7784 case SVt_PVAV: return "ARRAY";
7785 case SVt_PVHV: return "HASH";
7786 case SVt_PVCV: return "CODE";
7787 case SVt_PVGV: return "GLOB";
7788 case SVt_PVFM: return "FORMAT";
7789 case SVt_PVIO: return "IO";
7790 default: return "UNKNOWN";
7796 =for apidoc sv_isobject
7798 Returns a boolean indicating whether the SV is an RV pointing to a blessed
7799 object. If the SV is not an RV, or if the object is not blessed, then this
7806 Perl_sv_isobject(pTHX_ SV *sv)
7823 Returns a boolean indicating whether the SV is blessed into the specified
7824 class. This does not check for subtypes; use C<sv_derived_from> to verify
7825 an inheritance relationship.
7831 Perl_sv_isa(pTHX_ SV *sv, const char *name)
7843 return strEQ(HvNAME(SvSTASH(sv)), name);
7849 Creates a new SV for the RV, C<rv>, to point to. If C<rv> is not an RV then
7850 it will be upgraded to one. If C<classname> is non-null then the new SV will
7851 be blessed in the specified package. The new SV is returned and its
7852 reference count is 1.
7858 Perl_newSVrv(pTHX_ SV *rv, const char *classname)
7864 SV_CHECK_THINKFIRST_COW_DROP(rv);
7867 if (SvTYPE(rv) >= SVt_PVMG) {
7868 U32 refcnt = SvREFCNT(rv);
7872 SvREFCNT(rv) = refcnt;
7875 if (SvTYPE(rv) < SVt_RV)
7876 sv_upgrade(rv, SVt_RV);
7877 else if (SvTYPE(rv) > SVt_RV) {
7878 (void)SvOOK_off(rv);
7879 if (SvPVX(rv) && SvLEN(rv))
7880 Safefree(SvPVX(rv));
7890 HV* stash = gv_stashpv(classname, TRUE);
7891 (void)sv_bless(rv, stash);
7897 =for apidoc sv_setref_pv
7899 Copies a pointer into a new SV, optionally blessing the SV. The C<rv>
7900 argument will be upgraded to an RV. That RV will be modified to point to
7901 the new SV. If the C<pv> argument is NULL then C<PL_sv_undef> will be placed
7902 into the SV. The C<classname> argument indicates the package for the
7903 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
7904 will be returned and will have a reference count of 1.
7906 Do not use with other Perl types such as HV, AV, SV, CV, because those
7907 objects will become corrupted by the pointer copy process.
7909 Note that C<sv_setref_pvn> copies the string while this copies the pointer.
7915 Perl_sv_setref_pv(pTHX_ SV *rv, const char *classname, void *pv)
7918 sv_setsv(rv, &PL_sv_undef);
7922 sv_setiv(newSVrv(rv,classname), PTR2IV(pv));
7927 =for apidoc sv_setref_iv
7929 Copies an integer into a new SV, optionally blessing the SV. The C<rv>
7930 argument will be upgraded to an RV. That RV will be modified to point to
7931 the new SV. The C<classname> argument indicates the package for the
7932 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
7933 will be returned and will have a reference count of 1.
7939 Perl_sv_setref_iv(pTHX_ SV *rv, const char *classname, IV iv)
7941 sv_setiv(newSVrv(rv,classname), iv);
7946 =for apidoc sv_setref_uv
7948 Copies an unsigned integer into a new SV, optionally blessing the SV. The C<rv>
7949 argument will be upgraded to an RV. That RV will be modified to point to
7950 the new SV. The C<classname> argument indicates the package for the
7951 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
7952 will be returned and will have a reference count of 1.
7958 Perl_sv_setref_uv(pTHX_ SV *rv, const char *classname, UV uv)
7960 sv_setuv(newSVrv(rv,classname), uv);
7965 =for apidoc sv_setref_nv
7967 Copies a double into a new SV, optionally blessing the SV. The C<rv>
7968 argument will be upgraded to an RV. That RV will be modified to point to
7969 the new SV. The C<classname> argument indicates the package for the
7970 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
7971 will be returned and will have a reference count of 1.
7977 Perl_sv_setref_nv(pTHX_ SV *rv, const char *classname, NV nv)
7979 sv_setnv(newSVrv(rv,classname), nv);
7984 =for apidoc sv_setref_pvn
7986 Copies a string into a new SV, optionally blessing the SV. The length of the
7987 string must be specified with C<n>. The C<rv> argument will be upgraded to
7988 an RV. That RV will be modified to point to the new SV. The C<classname>
7989 argument indicates the package for the blessing. Set C<classname> to
7990 C<Nullch> to avoid the blessing. The new SV will be returned and will have
7991 a reference count of 1.
7993 Note that C<sv_setref_pv> copies the pointer while this copies the string.
7999 Perl_sv_setref_pvn(pTHX_ SV *rv, const char *classname, char *pv, STRLEN n)
8001 sv_setpvn(newSVrv(rv,classname), pv, n);
8006 =for apidoc sv_bless
8008 Blesses an SV into a specified package. The SV must be an RV. The package
8009 must be designated by its stash (see C<gv_stashpv()>). The reference count
8010 of the SV is unaffected.
8016 Perl_sv_bless(pTHX_ SV *sv, HV *stash)
8020 Perl_croak(aTHX_ "Can't bless non-reference value");
8022 if (SvFLAGS(tmpRef) & (SVs_OBJECT|SVf_READONLY)) {
8023 if (SvREADONLY(tmpRef))
8024 Perl_croak(aTHX_ PL_no_modify);
8025 if (SvOBJECT(tmpRef)) {
8026 if (SvTYPE(tmpRef) != SVt_PVIO)
8028 SvREFCNT_dec(SvSTASH(tmpRef));
8031 SvOBJECT_on(tmpRef);
8032 if (SvTYPE(tmpRef) != SVt_PVIO)
8034 (void)SvUPGRADE(tmpRef, SVt_PVMG);
8035 SvSTASH(tmpRef) = (HV*)SvREFCNT_inc(stash);
8042 if(SvSMAGICAL(tmpRef))
8043 if(mg_find(tmpRef, PERL_MAGIC_ext) || mg_find(tmpRef, PERL_MAGIC_uvar))
8051 /* Downgrades a PVGV to a PVMG.
8055 S_sv_unglob(pTHX_ SV *sv)
8059 assert(SvTYPE(sv) == SVt_PVGV);
8064 SvREFCNT_dec(GvSTASH(sv));
8065 GvSTASH(sv) = Nullhv;
8067 sv_unmagic(sv, PERL_MAGIC_glob);
8068 Safefree(GvNAME(sv));
8071 /* need to keep SvANY(sv) in the right arena */
8072 xpvmg = new_XPVMG();
8073 StructCopy(SvANY(sv), xpvmg, XPVMG);
8074 del_XPVGV(SvANY(sv));
8077 SvFLAGS(sv) &= ~SVTYPEMASK;
8078 SvFLAGS(sv) |= SVt_PVMG;
8082 =for apidoc sv_unref_flags
8084 Unsets the RV status of the SV, and decrements the reference count of
8085 whatever was being referenced by the RV. This can almost be thought of
8086 as a reversal of C<newSVrv>. The C<cflags> argument can contain
8087 C<SV_IMMEDIATE_UNREF> to force the reference count to be decremented
8088 (otherwise the decrementing is conditional on the reference count being
8089 different from one or the reference being a readonly SV).
8096 Perl_sv_unref_flags(pTHX_ SV *sv, U32 flags)
8100 if (SvWEAKREF(sv)) {
8108 /* You can't have a || SvREADONLY(rv) here, as $a = $$a, where $a was
8109 assigned to as BEGIN {$a = \"Foo"} will fail. */
8110 if (SvREFCNT(rv) != 1 || (flags & SV_IMMEDIATE_UNREF))
8112 else /* XXX Hack, but hard to make $a=$a->[1] work otherwise */
8113 sv_2mortal(rv); /* Schedule for freeing later */
8117 =for apidoc sv_unref
8119 Unsets the RV status of the SV, and decrements the reference count of
8120 whatever was being referenced by the RV. This can almost be thought of
8121 as a reversal of C<newSVrv>. This is C<sv_unref_flags> with the C<flag>
8122 being zero. See C<SvROK_off>.
8128 Perl_sv_unref(pTHX_ SV *sv)
8130 sv_unref_flags(sv, 0);
8134 =for apidoc sv_taint
8136 Taint an SV. Use C<SvTAINTED_on> instead.
8141 Perl_sv_taint(pTHX_ SV *sv)
8143 sv_magic((sv), Nullsv, PERL_MAGIC_taint, Nullch, 0);
8147 =for apidoc sv_untaint
8149 Untaint an SV. Use C<SvTAINTED_off> instead.
8154 Perl_sv_untaint(pTHX_ SV *sv)
8156 if (SvTYPE(sv) >= SVt_PVMG && SvMAGIC(sv)) {
8157 MAGIC *mg = mg_find(sv, PERL_MAGIC_taint);
8164 =for apidoc sv_tainted
8166 Test an SV for taintedness. Use C<SvTAINTED> instead.
8171 Perl_sv_tainted(pTHX_ SV *sv)
8173 if (SvTYPE(sv) >= SVt_PVMG && SvMAGIC(sv)) {
8174 MAGIC *mg = mg_find(sv, PERL_MAGIC_taint);
8175 if (mg && ((mg->mg_len & 1) || ((mg->mg_len & 2) && mg->mg_obj == sv)))
8182 =for apidoc sv_setpviv
8184 Copies an integer into the given SV, also updating its string value.
8185 Does not handle 'set' magic. See C<sv_setpviv_mg>.
8191 Perl_sv_setpviv(pTHX_ SV *sv, IV iv)
8193 char buf[TYPE_CHARS(UV)];
8195 char *ptr = uiv_2buf(buf, iv, 0, 0, &ebuf);
8197 sv_setpvn(sv, ptr, ebuf - ptr);
8201 =for apidoc sv_setpviv_mg
8203 Like C<sv_setpviv>, but also handles 'set' magic.
8209 Perl_sv_setpviv_mg(pTHX_ SV *sv, IV iv)
8211 char buf[TYPE_CHARS(UV)];
8213 char *ptr = uiv_2buf(buf, iv, 0, 0, &ebuf);
8215 sv_setpvn(sv, ptr, ebuf - ptr);
8219 #if defined(PERL_IMPLICIT_CONTEXT)
8221 /* pTHX_ magic can't cope with varargs, so this is a no-context
8222 * version of the main function, (which may itself be aliased to us).
8223 * Don't access this version directly.
8227 Perl_sv_setpvf_nocontext(SV *sv, const char* pat, ...)
8231 va_start(args, pat);
8232 sv_vsetpvf(sv, pat, &args);
8236 /* pTHX_ magic can't cope with varargs, so this is a no-context
8237 * version of the main function, (which may itself be aliased to us).
8238 * Don't access this version directly.
8242 Perl_sv_setpvf_mg_nocontext(SV *sv, const char* pat, ...)
8246 va_start(args, pat);
8247 sv_vsetpvf_mg(sv, pat, &args);
8253 =for apidoc sv_setpvf
8255 Processes its arguments like C<sprintf> and sets an SV to the formatted
8256 output. Does not handle 'set' magic. See C<sv_setpvf_mg>.
8262 Perl_sv_setpvf(pTHX_ SV *sv, const char* pat, ...)
8265 va_start(args, pat);
8266 sv_vsetpvf(sv, pat, &args);
8270 /* backend for C<sv_setpvf> and C<sv_setpvf_nocontext> */
8273 Perl_sv_vsetpvf(pTHX_ SV *sv, const char* pat, va_list* args)
8275 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
8279 =for apidoc sv_setpvf_mg
8281 Like C<sv_setpvf>, but also handles 'set' magic.
8287 Perl_sv_setpvf_mg(pTHX_ SV *sv, const char* pat, ...)
8290 va_start(args, pat);
8291 sv_vsetpvf_mg(sv, pat, &args);
8295 /* backend for C<sv_setpvf_mg> C<setpvf_mg_nocontext> */
8298 Perl_sv_vsetpvf_mg(pTHX_ SV *sv, const char* pat, va_list* args)
8300 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
8304 #if defined(PERL_IMPLICIT_CONTEXT)
8306 /* pTHX_ magic can't cope with varargs, so this is a no-context
8307 * version of the main function, (which may itself be aliased to us).
8308 * Don't access this version directly.
8312 Perl_sv_catpvf_nocontext(SV *sv, const char* pat, ...)
8316 va_start(args, pat);
8317 sv_vcatpvf(sv, pat, &args);
8321 /* pTHX_ magic can't cope with varargs, so this is a no-context
8322 * version of the main function, (which may itself be aliased to us).
8323 * Don't access this version directly.
8327 Perl_sv_catpvf_mg_nocontext(SV *sv, const char* pat, ...)
8331 va_start(args, pat);
8332 sv_vcatpvf_mg(sv, pat, &args);
8338 =for apidoc sv_catpvf
8340 Processes its arguments like C<sprintf> and appends the formatted
8341 output to an SV. If the appended data contains "wide" characters
8342 (including, but not limited to, SVs with a UTF-8 PV formatted with %s,
8343 and characters >255 formatted with %c), the original SV might get
8344 upgraded to UTF-8. Handles 'get' magic, but not 'set' magic.
8345 C<SvSETMAGIC()> must typically be called after calling this function
8346 to handle 'set' magic.
8351 Perl_sv_catpvf(pTHX_ SV *sv, const char* pat, ...)
8354 va_start(args, pat);
8355 sv_vcatpvf(sv, pat, &args);
8359 /* backend for C<sv_catpvf> and C<catpvf_mg_nocontext> */
8362 Perl_sv_vcatpvf(pTHX_ SV *sv, const char* pat, va_list* args)
8364 sv_vcatpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
8368 =for apidoc sv_catpvf_mg
8370 Like C<sv_catpvf>, but also handles 'set' magic.
8376 Perl_sv_catpvf_mg(pTHX_ SV *sv, const char* pat, ...)
8379 va_start(args, pat);
8380 sv_vcatpvf_mg(sv, pat, &args);
8384 /* backend for C<catpvf_mg> and C<catpvf_mg_nocontext> */
8387 Perl_sv_vcatpvf_mg(pTHX_ SV *sv, const char* pat, va_list* args)
8389 sv_vcatpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
8394 =for apidoc sv_vsetpvfn
8396 Works like C<vcatpvfn> but copies the text into the SV instead of
8399 Usually used via one of its frontends C<sv_setpvf> and C<sv_setpvf_mg>.
8405 Perl_sv_vsetpvfn(pTHX_ SV *sv, const char *pat, STRLEN patlen, va_list *args, SV **svargs, I32 svmax, bool *maybe_tainted)
8407 sv_setpvn(sv, "", 0);
8408 sv_vcatpvfn(sv, pat, patlen, args, svargs, svmax, maybe_tainted);
8411 /* private function for use in sv_vcatpvfn via the EXPECT_NUMBER macro */
8414 S_expect_number(pTHX_ char** pattern)
8417 switch (**pattern) {
8418 case '1': case '2': case '3':
8419 case '4': case '5': case '6':
8420 case '7': case '8': case '9':
8421 while (isDIGIT(**pattern))
8422 var = var * 10 + (*(*pattern)++ - '0');
8426 #define EXPECT_NUMBER(pattern, var) (var = S_expect_number(aTHX_ &pattern))
8429 =for apidoc sv_vcatpvfn
8431 Processes its arguments like C<vsprintf> and appends the formatted output
8432 to an SV. Uses an array of SVs if the C style variable argument list is
8433 missing (NULL). When running with taint checks enabled, indicates via
8434 C<maybe_tainted> if results are untrustworthy (often due to the use of
8437 Usually used via one of its frontends C<sv_catpvf> and C<sv_catpvf_mg>.
8443 Perl_sv_vcatpvfn(pTHX_ SV *sv, const char *pat, STRLEN patlen, va_list *args, SV **svargs, I32 svmax, bool *maybe_tainted)
8450 static char nullstr[] = "(null)";
8452 bool has_utf8; /* has the result utf8? */
8453 bool pat_utf8; /* the pattern is in utf8? */
8456 has_utf8 = pat_utf8 = DO_UTF8(sv);
8458 /* no matter what, this is a string now */
8459 (void)SvPV_force(sv, origlen);
8461 /* special-case "", "%s", and "%_" */
8464 if (patlen == 2 && pat[0] == '%') {
8468 char *s = va_arg(*args, char*);
8469 sv_catpv(sv, s ? s : nullstr);
8471 else if (svix < svmax) {
8472 sv_catsv(sv, *svargs);
8473 if (DO_UTF8(*svargs))
8479 argsv = va_arg(*args, SV*);
8480 sv_catsv(sv, argsv);
8485 /* See comment on '_' below */
8490 if (!args && svix < svmax && DO_UTF8(*svargs))
8493 patend = (char*)pat + patlen;
8494 for (p = (char*)pat; p < patend; p = q) {
8497 bool vectorize = FALSE;
8498 bool vectorarg = FALSE;
8499 bool vec_utf8 = FALSE;
8505 bool has_precis = FALSE;
8508 bool is_utf8 = FALSE; /* is this item utf8? */
8509 #ifdef HAS_LDBL_SPRINTF_BUG
8510 /* This is to try to fix a bug with irix/nonstop-ux/powerux and
8511 with sfio - Allen <allens@cpan.org> */
8512 bool fix_ldbl_sprintf_bug = FALSE;
8516 U8 utf8buf[UTF8_MAXLEN+1];
8517 STRLEN esignlen = 0;
8519 char *eptr = Nullch;
8521 /* Times 4: a decimal digit takes more than 3 binary digits.
8522 * NV_DIG: mantissa takes than many decimal digits.
8523 * Plus 32: Playing safe. */
8524 char ebuf[IV_DIG * 4 + NV_DIG + 32];
8525 /* large enough for "%#.#f" --chip */
8526 /* what about long double NVs? --jhi */
8529 U8 *vecstr = Null(U8*);
8536 /* we need a long double target in case HAS_LONG_DOUBLE but
8539 #if defined(HAS_LONG_DOUBLE) && LONG_DOUBLESIZE > DOUBLESIZE
8548 STRLEN dotstrlen = 1;
8549 I32 efix = 0; /* explicit format parameter index */
8550 I32 ewix = 0; /* explicit width index */
8551 I32 epix = 0; /* explicit precision index */
8552 I32 evix = 0; /* explicit vector index */
8553 bool asterisk = FALSE;
8555 /* echo everything up to the next format specification */
8556 for (q = p; q < patend && *q != '%'; ++q) ;
8558 if (has_utf8 && !pat_utf8)
8559 sv_catpvn_utf8_upgrade(sv, p, q - p, nsv);
8561 sv_catpvn(sv, p, q - p);
8568 We allow format specification elements in this order:
8569 \d+\$ explicit format parameter index
8571 v|\*(\d+\$)?v vector with optional (optionally specified) arg
8572 0 flag (as above): repeated to allow "v02"
8573 \d+|\*(\d+\$)? width using optional (optionally specified) arg
8574 \.(\d*|\*(\d+\$)?) precision using optional (optionally specified) arg
8576 [%bcdefginopsux_DFOUX] format (mandatory)
8578 if (EXPECT_NUMBER(q, width)) {
8619 if (EXPECT_NUMBER(q, ewix))
8628 if ((vectorarg = asterisk)) {
8640 EXPECT_NUMBER(q, width);
8645 vecsv = va_arg(*args, SV*);
8647 vecsv = (evix ? evix <= svmax : svix < svmax) ?
8648 svargs[ewix ? ewix-1 : svix++] : &PL_sv_undef;
8649 dotstr = SvPVx(vecsv, dotstrlen);
8654 vecsv = va_arg(*args, SV*);
8655 vecstr = (U8*)SvPVx(vecsv,veclen);
8656 vec_utf8 = DO_UTF8(vecsv);
8658 else if (efix ? efix <= svmax : svix < svmax) {
8659 vecsv = svargs[efix ? efix-1 : svix++];
8660 vecstr = (U8*)SvPVx(vecsv,veclen);
8661 vec_utf8 = DO_UTF8(vecsv);
8671 i = va_arg(*args, int);
8673 i = (ewix ? ewix <= svmax : svix < svmax) ?
8674 SvIVx(svargs[ewix ? ewix-1 : svix++]) : 0;
8676 width = (i < 0) ? -i : i;
8686 if (EXPECT_NUMBER(q, epix) && *q++ != '$')
8688 /* XXX: todo, support specified precision parameter */
8692 i = va_arg(*args, int);
8694 i = (ewix ? ewix <= svmax : svix < svmax)
8695 ? SvIVx(svargs[ewix ? ewix-1 : svix++]) : 0;
8696 precis = (i < 0) ? 0 : i;
8701 precis = precis * 10 + (*q++ - '0');
8710 case 'I': /* Ix, I32x, and I64x */
8712 if (q[1] == '6' && q[2] == '4') {
8718 if (q[1] == '3' && q[2] == '2') {
8728 #if defined(HAS_QUAD) || defined(HAS_LONG_DOUBLE)
8739 #if defined(HAS_QUAD) || defined(HAS_LONG_DOUBLE)
8740 if (*(q + 1) == 'l') { /* lld, llf */
8765 argsv = (efix ? efix <= svmax : svix < svmax) ?
8766 svargs[efix ? efix-1 : svix++] : &PL_sv_undef;
8773 uv = (args && !vectorize) ? va_arg(*args, int) : SvIVx(argsv);
8775 (!UNI_IS_INVARIANT(uv) && SvUTF8(sv)))
8777 eptr = (char*)utf8buf;
8778 elen = uvchr_to_utf8((U8*)eptr, uv) - utf8buf;
8789 if (args && !vectorize) {
8790 eptr = va_arg(*args, char*);
8792 #ifdef MACOS_TRADITIONAL
8793 /* On MacOS, %#s format is used for Pascal strings */
8798 elen = strlen(eptr);
8801 elen = sizeof nullstr - 1;
8805 eptr = SvPVx(argsv, elen);
8806 if (DO_UTF8(argsv)) {
8807 if (has_precis && precis < elen) {
8809 sv_pos_u2b(argsv, &p, 0); /* sticks at end */
8812 if (width) { /* fudge width (can't fudge elen) */
8813 width += elen - sv_len_utf8(argsv);
8822 * The "%_" hack might have to be changed someday,
8823 * if ISO or ANSI decide to use '_' for something.
8824 * So we keep it hidden from users' code.
8826 if (!args || vectorize)
8828 argsv = va_arg(*args, SV*);
8829 eptr = SvPVx(argsv, elen);
8835 if (has_precis && elen > precis)
8842 if (alt || vectorize)
8844 uv = PTR2UV(args ? va_arg(*args, void*) : argsv);
8862 uv = utf8n_to_uvchr(vecstr, veclen, &ulen,
8871 esignbuf[esignlen++] = plus;
8875 case 'h': iv = (short)va_arg(*args, int); break;
8876 default: iv = va_arg(*args, int); break;
8877 case 'l': iv = va_arg(*args, long); break;
8878 case 'V': iv = va_arg(*args, IV); break;
8880 case 'q': iv = va_arg(*args, Quad_t); break;
8887 case 'h': iv = (short)iv; break;
8889 case 'l': iv = (long)iv; break;
8892 case 'q': iv = (Quad_t)iv; break;
8896 if ( !vectorize ) /* we already set uv above */
8901 esignbuf[esignlen++] = plus;
8905 esignbuf[esignlen++] = '-';
8948 uv = utf8n_to_uvchr(vecstr, veclen, &ulen,
8959 case 'h': uv = (unsigned short)va_arg(*args, unsigned); break;
8960 default: uv = va_arg(*args, unsigned); break;
8961 case 'l': uv = va_arg(*args, unsigned long); break;
8962 case 'V': uv = va_arg(*args, UV); break;
8964 case 'q': uv = va_arg(*args, Quad_t); break;
8971 case 'h': uv = (unsigned short)uv; break;
8973 case 'l': uv = (unsigned long)uv; break;
8976 case 'q': uv = (Quad_t)uv; break;
8982 eptr = ebuf + sizeof ebuf;
8988 p = (char*)((c == 'X')
8989 ? "0123456789ABCDEF" : "0123456789abcdef");
8995 esignbuf[esignlen++] = '0';
8996 esignbuf[esignlen++] = c; /* 'x' or 'X' */
9002 *--eptr = '0' + dig;
9004 if (alt && *eptr != '0')
9010 *--eptr = '0' + dig;
9013 esignbuf[esignlen++] = '0';
9014 esignbuf[esignlen++] = 'b';
9017 default: /* it had better be ten or less */
9018 #if defined(PERL_Y2KWARN)
9019 if (ckWARN(WARN_Y2K)) {
9021 char *s = SvPV(sv,n);
9022 if (n >= 2 && s[n-2] == '1' && s[n-1] == '9'
9023 && (n == 2 || !isDIGIT(s[n-3])))
9025 Perl_warner(aTHX_ packWARN(WARN_Y2K),
9026 "Possible Y2K bug: %%%c %s",
9027 c, "format string following '19'");
9033 *--eptr = '0' + dig;
9034 } while (uv /= base);
9037 elen = (ebuf + sizeof ebuf) - eptr;
9040 zeros = precis - elen;
9041 else if (precis == 0 && elen == 1 && *eptr == '0')
9046 /* FLOATING POINT */
9049 c = 'f'; /* maybe %F isn't supported here */
9055 /* This is evil, but floating point is even more evil */
9057 /* for SV-style calling, we can only get NV
9058 for C-style calling, we assume %f is double;
9059 for simplicity we allow any of %Lf, %llf, %qf for long double
9063 #if defined(USE_LONG_DOUBLE)
9067 /* [perl #20339] - we should accept and ignore %lf rather than die */
9071 #if defined(USE_LONG_DOUBLE)
9072 intsize = args ? 0 : 'q';
9076 #if defined(HAS_LONG_DOUBLE)
9085 /* now we need (long double) if intsize == 'q', else (double) */
9086 nv = (args && !vectorize) ?
9087 #if LONG_DOUBLESIZE > DOUBLESIZE
9089 va_arg(*args, long double) :
9090 va_arg(*args, double)
9092 va_arg(*args, double)
9098 if (c != 'e' && c != 'E') {
9100 /* FIXME: if HAS_LONG_DOUBLE but not USE_LONG_DOUBLE this
9101 will cast our (long double) to (double) */
9102 (void)Perl_frexp(nv, &i);
9103 if (i == PERL_INT_MIN)
9104 Perl_die(aTHX_ "panic: frexp");
9106 need = BIT_DIGITS(i);
9108 need += has_precis ? precis : 6; /* known default */
9113 #ifdef HAS_LDBL_SPRINTF_BUG
9114 /* This is to try to fix a bug with irix/nonstop-ux/powerux and
9115 with sfio - Allen <allens@cpan.org> */
9118 # define MY_DBL_MAX DBL_MAX
9119 # else /* XXX guessing! HUGE_VAL may be defined as infinity, so not using */
9120 # if DOUBLESIZE >= 8
9121 # define MY_DBL_MAX 1.7976931348623157E+308L
9123 # define MY_DBL_MAX 3.40282347E+38L
9127 # ifdef HAS_LDBL_SPRINTF_BUG_LESS1 /* only between -1L & 1L - Allen */
9128 # define MY_DBL_MAX_BUG 1L
9130 # define MY_DBL_MAX_BUG MY_DBL_MAX
9134 # define MY_DBL_MIN DBL_MIN
9135 # else /* XXX guessing! -Allen */
9136 # if DOUBLESIZE >= 8
9137 # define MY_DBL_MIN 2.2250738585072014E-308L
9139 # define MY_DBL_MIN 1.17549435E-38L
9143 if ((intsize == 'q') && (c == 'f') &&
9144 ((nv < MY_DBL_MAX_BUG) && (nv > -MY_DBL_MAX_BUG)) &&
9146 /* it's going to be short enough that
9147 * long double precision is not needed */
9149 if ((nv <= 0L) && (nv >= -0L))
9150 fix_ldbl_sprintf_bug = TRUE; /* 0 is 0 - easiest */
9152 /* would use Perl_fp_class as a double-check but not
9153 * functional on IRIX - see perl.h comments */
9155 if ((nv >= MY_DBL_MIN) || (nv <= -MY_DBL_MIN)) {
9156 /* It's within the range that a double can represent */
9157 #if defined(DBL_MAX) && !defined(DBL_MIN)
9158 if ((nv >= ((long double)1/DBL_MAX)) ||
9159 (nv <= (-(long double)1/DBL_MAX)))
9161 fix_ldbl_sprintf_bug = TRUE;
9164 if (fix_ldbl_sprintf_bug == TRUE) {
9174 # undef MY_DBL_MAX_BUG
9177 #endif /* HAS_LDBL_SPRINTF_BUG */
9179 need += 20; /* fudge factor */
9180 if (PL_efloatsize < need) {
9181 Safefree(PL_efloatbuf);
9182 PL_efloatsize = need + 20; /* more fudge */
9183 New(906, PL_efloatbuf, PL_efloatsize, char);
9184 PL_efloatbuf[0] = '\0';
9187 eptr = ebuf + sizeof ebuf;
9190 /* FIXME: what to do if HAS_LONG_DOUBLE but not PERL_PRIfldbl? */
9191 #if defined(HAS_LONG_DOUBLE) && defined(PERL_PRIfldbl)
9192 if (intsize == 'q') {
9193 /* Copy the one or more characters in a long double
9194 * format before the 'base' ([efgEFG]) character to
9195 * the format string. */
9196 static char const prifldbl[] = PERL_PRIfldbl;
9197 char const *p = prifldbl + sizeof(prifldbl) - 3;
9198 while (p >= prifldbl) { *--eptr = *p--; }
9203 do { *--eptr = '0' + (base % 10); } while (base /= 10);
9208 do { *--eptr = '0' + (base % 10); } while (base /= 10);
9220 /* No taint. Otherwise we are in the strange situation
9221 * where printf() taints but print($float) doesn't.
9223 #if defined(HAS_LONG_DOUBLE)
9225 (void)sprintf(PL_efloatbuf, eptr, nv);
9227 (void)sprintf(PL_efloatbuf, eptr, (double)nv);
9229 (void)sprintf(PL_efloatbuf, eptr, nv);
9231 eptr = PL_efloatbuf;
9232 elen = strlen(PL_efloatbuf);
9238 i = SvCUR(sv) - origlen;
9239 if (args && !vectorize) {
9241 case 'h': *(va_arg(*args, short*)) = i; break;
9242 default: *(va_arg(*args, int*)) = i; break;
9243 case 'l': *(va_arg(*args, long*)) = i; break;
9244 case 'V': *(va_arg(*args, IV*)) = i; break;
9246 case 'q': *(va_arg(*args, Quad_t*)) = i; break;
9251 sv_setuv_mg(argsv, (UV)i);
9253 continue; /* not "break" */
9259 if (!args && ckWARN(WARN_PRINTF) &&
9260 (PL_op->op_type == OP_PRTF || PL_op->op_type == OP_SPRINTF)) {
9261 SV *msg = sv_newmortal();
9262 Perl_sv_setpvf(aTHX_ msg, "Invalid conversion in %sprintf: ",
9263 (PL_op->op_type == OP_PRTF) ? "" : "s");
9266 Perl_sv_catpvf(aTHX_ msg,
9267 "\"%%%c\"", c & 0xFF);
9269 Perl_sv_catpvf(aTHX_ msg,
9270 "\"%%\\%03"UVof"\"",
9273 sv_catpv(msg, "end of string");
9274 Perl_warner(aTHX_ packWARN(WARN_PRINTF), "%"SVf, msg); /* yes, this is reentrant */
9277 /* output mangled stuff ... */
9283 /* ... right here, because formatting flags should not apply */
9284 SvGROW(sv, SvCUR(sv) + elen + 1);
9286 Copy(eptr, p, elen, char);
9289 SvCUR(sv) = p - SvPVX(sv);
9291 continue; /* not "break" */
9294 if (is_utf8 != has_utf8) {
9297 sv_utf8_upgrade(sv);
9300 SV *nsv = sv_2mortal(newSVpvn(eptr, elen));
9301 sv_utf8_upgrade(nsv);
9305 SvGROW(sv, SvCUR(sv) + elen + 1);
9310 have = esignlen + zeros + elen;
9311 need = (have > width ? have : width);
9314 SvGROW(sv, SvCUR(sv) + need + dotstrlen + 1);
9316 if (esignlen && fill == '0') {
9317 for (i = 0; i < (int)esignlen; i++)
9321 memset(p, fill, gap);
9324 if (esignlen && fill != '0') {
9325 for (i = 0; i < (int)esignlen; i++)
9329 for (i = zeros; i; i--)
9333 Copy(eptr, p, elen, char);
9337 memset(p, ' ', gap);
9342 Copy(dotstr, p, dotstrlen, char);
9346 vectorize = FALSE; /* done iterating over vecstr */
9353 SvCUR(sv) = p - SvPVX(sv);
9361 /* =========================================================================
9363 =head1 Cloning an interpreter
9365 All the macros and functions in this section are for the private use of
9366 the main function, perl_clone().
9368 The foo_dup() functions make an exact copy of an existing foo thinngy.
9369 During the course of a cloning, a hash table is used to map old addresses
9370 to new addresses. The table is created and manipulated with the
9371 ptr_table_* functions.
9375 ============================================================================*/
9378 #if defined(USE_ITHREADS)
9380 #ifndef GpREFCNT_inc
9381 # define GpREFCNT_inc(gp) ((gp) ? (++(gp)->gp_refcnt, (gp)) : (GP*)NULL)
9385 #define sv_dup_inc(s,t) SvREFCNT_inc(sv_dup(s,t))
9386 #define av_dup(s,t) (AV*)sv_dup((SV*)s,t)
9387 #define av_dup_inc(s,t) (AV*)SvREFCNT_inc(sv_dup((SV*)s,t))
9388 #define hv_dup(s,t) (HV*)sv_dup((SV*)s,t)
9389 #define hv_dup_inc(s,t) (HV*)SvREFCNT_inc(sv_dup((SV*)s,t))
9390 #define cv_dup(s,t) (CV*)sv_dup((SV*)s,t)
9391 #define cv_dup_inc(s,t) (CV*)SvREFCNT_inc(sv_dup((SV*)s,t))
9392 #define io_dup(s,t) (IO*)sv_dup((SV*)s,t)
9393 #define io_dup_inc(s,t) (IO*)SvREFCNT_inc(sv_dup((SV*)s,t))
9394 #define gv_dup(s,t) (GV*)sv_dup((SV*)s,t)
9395 #define gv_dup_inc(s,t) (GV*)SvREFCNT_inc(sv_dup((SV*)s,t))
9396 #define SAVEPV(p) (p ? savepv(p) : Nullch)
9397 #define SAVEPVN(p,n) (p ? savepvn(p,n) : Nullch)
9400 /* Duplicate a regexp. Required reading: pregcomp() and pregfree() in
9401 regcomp.c. AMS 20010712 */
9404 Perl_re_dup(pTHX_ REGEXP *r, CLONE_PARAMS *param)
9408 struct reg_substr_datum *s;
9411 return (REGEXP *)NULL;
9413 if ((ret = (REGEXP *)ptr_table_fetch(PL_ptr_table, r)))
9416 len = r->offsets[0];
9417 npar = r->nparens+1;
9419 Newc(0, ret, sizeof(regexp) + (len+1)*sizeof(regnode), char, regexp);
9420 Copy(r->program, ret->program, len+1, regnode);
9422 New(0, ret->startp, npar, I32);
9423 Copy(r->startp, ret->startp, npar, I32);
9424 New(0, ret->endp, npar, I32);
9425 Copy(r->startp, ret->startp, npar, I32);
9427 New(0, ret->substrs, 1, struct reg_substr_data);
9428 for (s = ret->substrs->data, i = 0; i < 3; i++, s++) {
9429 s->min_offset = r->substrs->data[i].min_offset;
9430 s->max_offset = r->substrs->data[i].max_offset;
9431 s->substr = sv_dup_inc(r->substrs->data[i].substr, param);
9432 s->utf8_substr = sv_dup_inc(r->substrs->data[i].utf8_substr, param);
9435 ret->regstclass = NULL;
9438 int count = r->data->count;
9440 Newc(0, d, sizeof(struct reg_data) + count*sizeof(void *),
9441 char, struct reg_data);
9442 New(0, d->what, count, U8);
9445 for (i = 0; i < count; i++) {
9446 d->what[i] = r->data->what[i];
9447 switch (d->what[i]) {
9449 d->data[i] = sv_dup_inc((SV *)r->data->data[i], param);
9452 d->data[i] = av_dup_inc((AV *)r->data->data[i], param);
9455 /* This is cheating. */
9456 New(0, d->data[i], 1, struct regnode_charclass_class);
9457 StructCopy(r->data->data[i], d->data[i],
9458 struct regnode_charclass_class);
9459 ret->regstclass = (regnode*)d->data[i];
9462 /* Compiled op trees are readonly, and can thus be
9463 shared without duplication. */
9464 d->data[i] = (void*)OpREFCNT_inc((OP*)r->data->data[i]);
9467 d->data[i] = r->data->data[i];
9477 New(0, ret->offsets, 2*len+1, U32);
9478 Copy(r->offsets, ret->offsets, 2*len+1, U32);
9480 ret->precomp = SAVEPV(r->precomp);
9481 ret->refcnt = r->refcnt;
9482 ret->minlen = r->minlen;
9483 ret->prelen = r->prelen;
9484 ret->nparens = r->nparens;
9485 ret->lastparen = r->lastparen;
9486 ret->lastcloseparen = r->lastcloseparen;
9487 ret->reganch = r->reganch;
9489 ret->sublen = r->sublen;
9491 if (RX_MATCH_COPIED(ret))
9492 ret->subbeg = SAVEPV(r->subbeg);
9494 ret->subbeg = Nullch;
9495 #ifdef PERL_COPY_ON_WRITE
9496 ret->saved_copy = Nullsv;
9499 ptr_table_store(PL_ptr_table, r, ret);
9503 /* duplicate a file handle */
9506 Perl_fp_dup(pTHX_ PerlIO *fp, char type, CLONE_PARAMS *param)
9510 return (PerlIO*)NULL;
9512 /* look for it in the table first */
9513 ret = (PerlIO*)ptr_table_fetch(PL_ptr_table, fp);
9517 /* create anew and remember what it is */
9518 ret = PerlIO_fdupopen(aTHX_ fp, param, PERLIO_DUP_CLONE);
9519 ptr_table_store(PL_ptr_table, fp, ret);
9523 /* duplicate a directory handle */
9526 Perl_dirp_dup(pTHX_ DIR *dp)
9534 /* duplicate a typeglob */
9537 Perl_gp_dup(pTHX_ GP *gp, CLONE_PARAMS* param)
9542 /* look for it in the table first */
9543 ret = (GP*)ptr_table_fetch(PL_ptr_table, gp);
9547 /* create anew and remember what it is */
9548 Newz(0, ret, 1, GP);
9549 ptr_table_store(PL_ptr_table, gp, ret);
9552 ret->gp_refcnt = 0; /* must be before any other dups! */
9553 ret->gp_sv = sv_dup_inc(gp->gp_sv, param);
9554 ret->gp_io = io_dup_inc(gp->gp_io, param);
9555 ret->gp_form = cv_dup_inc(gp->gp_form, param);
9556 ret->gp_av = av_dup_inc(gp->gp_av, param);
9557 ret->gp_hv = hv_dup_inc(gp->gp_hv, param);
9558 ret->gp_egv = gv_dup(gp->gp_egv, param);/* GvEGV is not refcounted */
9559 ret->gp_cv = cv_dup_inc(gp->gp_cv, param);
9560 ret->gp_cvgen = gp->gp_cvgen;
9561 ret->gp_flags = gp->gp_flags;
9562 ret->gp_line = gp->gp_line;
9563 ret->gp_file = gp->gp_file; /* points to COP.cop_file */
9567 /* duplicate a chain of magic */
9570 Perl_mg_dup(pTHX_ MAGIC *mg, CLONE_PARAMS* param)
9572 MAGIC *mgprev = (MAGIC*)NULL;
9575 return (MAGIC*)NULL;
9576 /* look for it in the table first */
9577 mgret = (MAGIC*)ptr_table_fetch(PL_ptr_table, mg);
9581 for (; mg; mg = mg->mg_moremagic) {
9583 Newz(0, nmg, 1, MAGIC);
9585 mgprev->mg_moremagic = nmg;
9588 nmg->mg_virtual = mg->mg_virtual; /* XXX copy dynamic vtable? */
9589 nmg->mg_private = mg->mg_private;
9590 nmg->mg_type = mg->mg_type;
9591 nmg->mg_flags = mg->mg_flags;
9592 if (mg->mg_type == PERL_MAGIC_qr) {
9593 nmg->mg_obj = (SV*)re_dup((REGEXP*)mg->mg_obj, param);
9595 else if(mg->mg_type == PERL_MAGIC_backref) {
9596 AV *av = (AV*) mg->mg_obj;
9599 nmg->mg_obj = (SV*)newAV();
9603 av_push((AV*)nmg->mg_obj,sv_dup(svp[i],param));
9608 nmg->mg_obj = (mg->mg_flags & MGf_REFCOUNTED)
9609 ? sv_dup_inc(mg->mg_obj, param)
9610 : sv_dup(mg->mg_obj, param);
9612 nmg->mg_len = mg->mg_len;
9613 nmg->mg_ptr = mg->mg_ptr; /* XXX random ptr? */
9614 if (mg->mg_ptr && mg->mg_type != PERL_MAGIC_regex_global) {
9615 if (mg->mg_len > 0) {
9616 nmg->mg_ptr = SAVEPVN(mg->mg_ptr, mg->mg_len);
9617 if (mg->mg_type == PERL_MAGIC_overload_table &&
9618 AMT_AMAGIC((AMT*)mg->mg_ptr))
9620 AMT *amtp = (AMT*)mg->mg_ptr;
9621 AMT *namtp = (AMT*)nmg->mg_ptr;
9623 for (i = 1; i < NofAMmeth; i++) {
9624 namtp->table[i] = cv_dup_inc(amtp->table[i], param);
9628 else if (mg->mg_len == HEf_SVKEY)
9629 nmg->mg_ptr = (char*)sv_dup_inc((SV*)mg->mg_ptr, param);
9631 if ((mg->mg_flags & MGf_DUP) && mg->mg_virtual && mg->mg_virtual->svt_dup) {
9632 CALL_FPTR(nmg->mg_virtual->svt_dup)(aTHX_ nmg, param);
9639 /* create a new pointer-mapping table */
9642 Perl_ptr_table_new(pTHX)
9645 Newz(0, tbl, 1, PTR_TBL_t);
9648 Newz(0, tbl->tbl_ary, tbl->tbl_max + 1, PTR_TBL_ENT_t*);
9652 /* map an existing pointer using a table */
9655 Perl_ptr_table_fetch(pTHX_ PTR_TBL_t *tbl, void *sv)
9657 PTR_TBL_ENT_t *tblent;
9658 UV hash = PTR2UV(sv);
9660 tblent = tbl->tbl_ary[hash & tbl->tbl_max];
9661 for (; tblent; tblent = tblent->next) {
9662 if (tblent->oldval == sv)
9663 return tblent->newval;
9668 /* add a new entry to a pointer-mapping table */
9671 Perl_ptr_table_store(pTHX_ PTR_TBL_t *tbl, void *oldv, void *newv)
9673 PTR_TBL_ENT_t *tblent, **otblent;
9674 /* XXX this may be pessimal on platforms where pointers aren't good
9675 * hash values e.g. if they grow faster in the most significant
9677 UV hash = PTR2UV(oldv);
9681 otblent = &tbl->tbl_ary[hash & tbl->tbl_max];
9682 for (tblent = *otblent; tblent; i=0, tblent = tblent->next) {
9683 if (tblent->oldval == oldv) {
9684 tblent->newval = newv;
9688 Newz(0, tblent, 1, PTR_TBL_ENT_t);
9689 tblent->oldval = oldv;
9690 tblent->newval = newv;
9691 tblent->next = *otblent;
9694 if (i && tbl->tbl_items > tbl->tbl_max)
9695 ptr_table_split(tbl);
9698 /* double the hash bucket size of an existing ptr table */
9701 Perl_ptr_table_split(pTHX_ PTR_TBL_t *tbl)
9703 PTR_TBL_ENT_t **ary = tbl->tbl_ary;
9704 UV oldsize = tbl->tbl_max + 1;
9705 UV newsize = oldsize * 2;
9708 Renew(ary, newsize, PTR_TBL_ENT_t*);
9709 Zero(&ary[oldsize], newsize-oldsize, PTR_TBL_ENT_t*);
9710 tbl->tbl_max = --newsize;
9712 for (i=0; i < oldsize; i++, ary++) {
9713 PTR_TBL_ENT_t **curentp, **entp, *ent;
9716 curentp = ary + oldsize;
9717 for (entp = ary, ent = *ary; ent; ent = *entp) {
9718 if ((newsize & PTR2UV(ent->oldval)) != i) {
9720 ent->next = *curentp;
9730 /* remove all the entries from a ptr table */
9733 Perl_ptr_table_clear(pTHX_ PTR_TBL_t *tbl)
9735 register PTR_TBL_ENT_t **array;
9736 register PTR_TBL_ENT_t *entry;
9737 register PTR_TBL_ENT_t *oentry = Null(PTR_TBL_ENT_t*);
9741 if (!tbl || !tbl->tbl_items) {
9745 array = tbl->tbl_ary;
9752 entry = entry->next;
9756 if (++riter > max) {
9759 entry = array[riter];
9766 /* clear and free a ptr table */
9769 Perl_ptr_table_free(pTHX_ PTR_TBL_t *tbl)
9774 ptr_table_clear(tbl);
9775 Safefree(tbl->tbl_ary);
9783 /* attempt to make everything in the typeglob readonly */
9786 S_gv_share(pTHX_ SV *sstr, CLONE_PARAMS *param)
9789 SV *sv = ¶m->proto_perl->Isv_no; /* just need SvREADONLY-ness */
9791 if (GvIO(gv) || GvFORM(gv)) {
9792 GvUNIQUE_off(gv); /* GvIOs cannot be shared. nor can GvFORMs */
9794 else if (!GvCV(gv)) {
9798 /* CvPADLISTs cannot be shared */
9799 if (!SvREADONLY(GvCV(gv)) && !CvXSUB(GvCV(gv))) {
9804 if (!GvUNIQUE(gv)) {
9806 PerlIO_printf(Perl_debug_log, "gv_share: unable to share %s::%s\n",
9807 HvNAME(GvSTASH(gv)), GvNAME(gv));
9813 * write attempts will die with
9814 * "Modification of a read-only value attempted"
9820 SvREADONLY_on(GvSV(gv));
9827 SvREADONLY_on(GvAV(gv));
9834 SvREADONLY_on(GvAV(gv));
9837 return sstr; /* he_dup() will SvREFCNT_inc() */
9840 /* duplicate an SV of any type (including AV, HV etc) */
9843 Perl_rvpv_dup(pTHX_ SV *dstr, SV *sstr, CLONE_PARAMS* param)
9846 SvRV(dstr) = SvWEAKREF(sstr)
9847 ? sv_dup(SvRV(sstr), param)
9848 : sv_dup_inc(SvRV(sstr), param);
9850 else if (SvPVX(sstr)) {
9851 /* Has something there */
9853 /* Normal PV - clone whole allocated space */
9854 SvPVX(dstr) = SAVEPVN(SvPVX(sstr), SvLEN(sstr)-1);
9855 if (SvREADONLY(sstr) && SvFAKE(sstr)) {
9856 /* Not that normal - actually sstr is copy on write.
9857 But we are a true, independant SV, so: */
9858 SvREADONLY_off(dstr);
9863 /* Special case - not normally malloced for some reason */
9864 if (SvREADONLY(sstr) && SvFAKE(sstr)) {
9865 /* A "shared" PV - clone it as unshared string */
9867 SvREADONLY_off(dstr);
9868 SvPVX(dstr) = SAVEPVN(SvPVX(sstr), SvCUR(sstr));
9871 /* Some other special case - random pointer */
9872 SvPVX(dstr) = SvPVX(sstr);
9878 SvPVX(dstr) = SvPVX(sstr);
9883 Perl_sv_dup(pTHX_ SV *sstr, CLONE_PARAMS* param)
9887 if (!sstr || SvTYPE(sstr) == SVTYPEMASK)
9889 /* look for it in the table first */
9890 dstr = (SV*)ptr_table_fetch(PL_ptr_table, sstr);
9894 if(param->flags & CLONEf_JOIN_IN) {
9895 /** We are joining here so we don't want do clone
9896 something that is bad **/
9898 if(SvTYPE(sstr) == SVt_PVHV &&
9900 /** don't clone stashes if they already exist **/
9901 HV* old_stash = gv_stashpv(HvNAME(sstr),0);
9902 return (SV*) old_stash;
9906 /* create anew and remember what it is */
9908 ptr_table_store(PL_ptr_table, sstr, dstr);
9911 SvFLAGS(dstr) = SvFLAGS(sstr);
9912 SvFLAGS(dstr) &= ~SVf_OOK; /* don't propagate OOK hack */
9913 SvREFCNT(dstr) = 0; /* must be before any other dups! */
9916 if (SvANY(sstr) && PL_watch_pvx && SvPVX(sstr) == PL_watch_pvx)
9917 PerlIO_printf(Perl_debug_log, "watch at %p hit, found string \"%s\"\n",
9918 PL_watch_pvx, SvPVX(sstr));
9921 switch (SvTYPE(sstr)) {
9926 SvANY(dstr) = new_XIV();
9927 SvIVX(dstr) = SvIVX(sstr);
9930 SvANY(dstr) = new_XNV();
9931 SvNVX(dstr) = SvNVX(sstr);
9934 SvANY(dstr) = new_XRV();
9935 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
9938 SvANY(dstr) = new_XPV();
9939 SvCUR(dstr) = SvCUR(sstr);
9940 SvLEN(dstr) = SvLEN(sstr);
9941 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
9944 SvANY(dstr) = new_XPVIV();
9945 SvCUR(dstr) = SvCUR(sstr);
9946 SvLEN(dstr) = SvLEN(sstr);
9947 SvIVX(dstr) = SvIVX(sstr);
9948 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
9951 SvANY(dstr) = new_XPVNV();
9952 SvCUR(dstr) = SvCUR(sstr);
9953 SvLEN(dstr) = SvLEN(sstr);
9954 SvIVX(dstr) = SvIVX(sstr);
9955 SvNVX(dstr) = SvNVX(sstr);
9956 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
9959 SvANY(dstr) = new_XPVMG();
9960 SvCUR(dstr) = SvCUR(sstr);
9961 SvLEN(dstr) = SvLEN(sstr);
9962 SvIVX(dstr) = SvIVX(sstr);
9963 SvNVX(dstr) = SvNVX(sstr);
9964 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr), param);
9965 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr), param);
9966 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
9969 SvANY(dstr) = new_XPVBM();
9970 SvCUR(dstr) = SvCUR(sstr);
9971 SvLEN(dstr) = SvLEN(sstr);
9972 SvIVX(dstr) = SvIVX(sstr);
9973 SvNVX(dstr) = SvNVX(sstr);
9974 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr), param);
9975 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr), param);
9976 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
9977 BmRARE(dstr) = BmRARE(sstr);
9978 BmUSEFUL(dstr) = BmUSEFUL(sstr);
9979 BmPREVIOUS(dstr)= BmPREVIOUS(sstr);
9982 SvANY(dstr) = new_XPVLV();
9983 SvCUR(dstr) = SvCUR(sstr);
9984 SvLEN(dstr) = SvLEN(sstr);
9985 SvIVX(dstr) = SvIVX(sstr);
9986 SvNVX(dstr) = SvNVX(sstr);
9987 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr), param);
9988 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr), param);
9989 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
9990 LvTARGOFF(dstr) = LvTARGOFF(sstr); /* XXX sometimes holds PMOP* when DEBUGGING */
9991 LvTARGLEN(dstr) = LvTARGLEN(sstr);
9992 LvTARG(dstr) = sv_dup_inc(LvTARG(sstr), param);
9993 LvTYPE(dstr) = LvTYPE(sstr);
9996 if (GvUNIQUE((GV*)sstr)) {
9998 if ((share = gv_share(sstr, param))) {
10001 ptr_table_store(PL_ptr_table, sstr, dstr);
10003 PerlIO_printf(Perl_debug_log, "sv_dup: sharing %s::%s\n",
10004 HvNAME(GvSTASH(share)), GvNAME(share));
10009 SvANY(dstr) = new_XPVGV();
10010 SvCUR(dstr) = SvCUR(sstr);
10011 SvLEN(dstr) = SvLEN(sstr);
10012 SvIVX(dstr) = SvIVX(sstr);
10013 SvNVX(dstr) = SvNVX(sstr);
10014 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr), param);
10015 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr), param);
10016 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10017 GvNAMELEN(dstr) = GvNAMELEN(sstr);
10018 GvNAME(dstr) = SAVEPVN(GvNAME(sstr), GvNAMELEN(sstr));
10019 GvSTASH(dstr) = hv_dup_inc(GvSTASH(sstr), param);
10020 GvFLAGS(dstr) = GvFLAGS(sstr);
10021 GvGP(dstr) = gp_dup(GvGP(sstr), param);
10022 (void)GpREFCNT_inc(GvGP(dstr));
10025 SvANY(dstr) = new_XPVIO();
10026 SvCUR(dstr) = SvCUR(sstr);
10027 SvLEN(dstr) = SvLEN(sstr);
10028 SvIVX(dstr) = SvIVX(sstr);
10029 SvNVX(dstr) = SvNVX(sstr);
10030 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr), param);
10031 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr), param);
10032 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10033 IoIFP(dstr) = fp_dup(IoIFP(sstr), IoTYPE(sstr), param);
10034 if (IoOFP(sstr) == IoIFP(sstr))
10035 IoOFP(dstr) = IoIFP(dstr);
10037 IoOFP(dstr) = fp_dup(IoOFP(sstr), IoTYPE(sstr), param);
10038 /* PL_rsfp_filters entries have fake IoDIRP() */
10039 if (IoDIRP(sstr) && !(IoFLAGS(sstr) & IOf_FAKE_DIRP))
10040 IoDIRP(dstr) = dirp_dup(IoDIRP(sstr));
10042 IoDIRP(dstr) = IoDIRP(sstr);
10043 IoLINES(dstr) = IoLINES(sstr);
10044 IoPAGE(dstr) = IoPAGE(sstr);
10045 IoPAGE_LEN(dstr) = IoPAGE_LEN(sstr);
10046 IoLINES_LEFT(dstr) = IoLINES_LEFT(sstr);
10047 IoTOP_NAME(dstr) = SAVEPV(IoTOP_NAME(sstr));
10048 IoTOP_GV(dstr) = gv_dup(IoTOP_GV(sstr), param);
10049 IoFMT_NAME(dstr) = SAVEPV(IoFMT_NAME(sstr));
10050 IoFMT_GV(dstr) = gv_dup(IoFMT_GV(sstr), param);
10051 IoBOTTOM_NAME(dstr) = SAVEPV(IoBOTTOM_NAME(sstr));
10052 IoBOTTOM_GV(dstr) = gv_dup(IoBOTTOM_GV(sstr), param);
10053 IoSUBPROCESS(dstr) = IoSUBPROCESS(sstr);
10054 IoTYPE(dstr) = IoTYPE(sstr);
10055 IoFLAGS(dstr) = IoFLAGS(sstr);
10058 SvANY(dstr) = new_XPVAV();
10059 SvCUR(dstr) = SvCUR(sstr);
10060 SvLEN(dstr) = SvLEN(sstr);
10061 SvIVX(dstr) = SvIVX(sstr);
10062 SvNVX(dstr) = SvNVX(sstr);
10063 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr), param);
10064 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr), param);
10065 AvARYLEN((AV*)dstr) = sv_dup_inc(AvARYLEN((AV*)sstr), param);
10066 AvFLAGS((AV*)dstr) = AvFLAGS((AV*)sstr);
10067 if (AvARRAY((AV*)sstr)) {
10068 SV **dst_ary, **src_ary;
10069 SSize_t items = AvFILLp((AV*)sstr) + 1;
10071 src_ary = AvARRAY((AV*)sstr);
10072 Newz(0, dst_ary, AvMAX((AV*)sstr)+1, SV*);
10073 ptr_table_store(PL_ptr_table, src_ary, dst_ary);
10074 SvPVX(dstr) = (char*)dst_ary;
10075 AvALLOC((AV*)dstr) = dst_ary;
10076 if (AvREAL((AV*)sstr)) {
10077 while (items-- > 0)
10078 *dst_ary++ = sv_dup_inc(*src_ary++, param);
10081 while (items-- > 0)
10082 *dst_ary++ = sv_dup(*src_ary++, param);
10084 items = AvMAX((AV*)sstr) - AvFILLp((AV*)sstr);
10085 while (items-- > 0) {
10086 *dst_ary++ = &PL_sv_undef;
10090 SvPVX(dstr) = Nullch;
10091 AvALLOC((AV*)dstr) = (SV**)NULL;
10095 SvANY(dstr) = new_XPVHV();
10096 SvCUR(dstr) = SvCUR(sstr);
10097 SvLEN(dstr) = SvLEN(sstr);
10098 SvIVX(dstr) = SvIVX(sstr);
10099 SvNVX(dstr) = SvNVX(sstr);
10100 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr), param);
10101 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr), param);
10102 HvRITER((HV*)dstr) = HvRITER((HV*)sstr);
10103 if (HvARRAY((HV*)sstr)) {
10105 XPVHV *dxhv = (XPVHV*)SvANY(dstr);
10106 XPVHV *sxhv = (XPVHV*)SvANY(sstr);
10107 Newz(0, dxhv->xhv_array,
10108 PERL_HV_ARRAY_ALLOC_BYTES(dxhv->xhv_max+1), char);
10109 while (i <= sxhv->xhv_max) {
10110 ((HE**)dxhv->xhv_array)[i] = he_dup(((HE**)sxhv->xhv_array)[i],
10111 (bool)!!HvSHAREKEYS(sstr),
10115 dxhv->xhv_eiter = he_dup(sxhv->xhv_eiter,
10116 (bool)!!HvSHAREKEYS(sstr), param);
10119 SvPVX(dstr) = Nullch;
10120 HvEITER((HV*)dstr) = (HE*)NULL;
10122 HvPMROOT((HV*)dstr) = HvPMROOT((HV*)sstr); /* XXX */
10123 HvNAME((HV*)dstr) = SAVEPV(HvNAME((HV*)sstr));
10124 /* Record stashes for possible cloning in Perl_clone(). */
10125 if(HvNAME((HV*)dstr))
10126 av_push(param->stashes, dstr);
10129 SvANY(dstr) = new_XPVFM();
10130 FmLINES(dstr) = FmLINES(sstr);
10134 SvANY(dstr) = new_XPVCV();
10136 SvCUR(dstr) = SvCUR(sstr);
10137 SvLEN(dstr) = SvLEN(sstr);
10138 SvIVX(dstr) = SvIVX(sstr);
10139 SvNVX(dstr) = SvNVX(sstr);
10140 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr), param);
10141 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr), param);
10142 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10143 CvSTASH(dstr) = hv_dup(CvSTASH(sstr), param); /* NOTE: not refcounted */
10144 CvSTART(dstr) = CvSTART(sstr);
10145 CvROOT(dstr) = OpREFCNT_inc(CvROOT(sstr));
10146 CvXSUB(dstr) = CvXSUB(sstr);
10147 CvXSUBANY(dstr) = CvXSUBANY(sstr);
10148 if (CvCONST(sstr)) {
10149 CvXSUBANY(dstr).any_ptr = GvUNIQUE(CvGV(sstr)) ?
10150 SvREFCNT_inc(CvXSUBANY(sstr).any_ptr) :
10151 sv_dup_inc(CvXSUBANY(sstr).any_ptr, param);
10153 CvGV(dstr) = gv_dup(CvGV(sstr), param);
10154 if (param->flags & CLONEf_COPY_STACKS) {
10155 CvDEPTH(dstr) = CvDEPTH(sstr);
10159 PAD_DUP(CvPADLIST(dstr), CvPADLIST(sstr), param);
10160 CvOUTSIDE_SEQ(dstr) = CvOUTSIDE_SEQ(sstr);
10162 CvWEAKOUTSIDE(sstr)
10163 ? cv_dup( CvOUTSIDE(sstr), param)
10164 : cv_dup_inc(CvOUTSIDE(sstr), param);
10165 CvFLAGS(dstr) = CvFLAGS(sstr);
10166 CvFILE(dstr) = CvXSUB(sstr) ? CvFILE(sstr) : SAVEPV(CvFILE(sstr));
10169 Perl_croak(aTHX_ "Bizarre SvTYPE [%" IVdf "]", (IV)SvTYPE(sstr));
10173 if (SvOBJECT(dstr) && SvTYPE(dstr) != SVt_PVIO)
10179 /* duplicate a context */
10182 Perl_cx_dup(pTHX_ PERL_CONTEXT *cxs, I32 ix, I32 max, CLONE_PARAMS* param)
10184 PERL_CONTEXT *ncxs;
10187 return (PERL_CONTEXT*)NULL;
10189 /* look for it in the table first */
10190 ncxs = (PERL_CONTEXT*)ptr_table_fetch(PL_ptr_table, cxs);
10194 /* create anew and remember what it is */
10195 Newz(56, ncxs, max + 1, PERL_CONTEXT);
10196 ptr_table_store(PL_ptr_table, cxs, ncxs);
10199 PERL_CONTEXT *cx = &cxs[ix];
10200 PERL_CONTEXT *ncx = &ncxs[ix];
10201 ncx->cx_type = cx->cx_type;
10202 if (CxTYPE(cx) == CXt_SUBST) {
10203 Perl_croak(aTHX_ "Cloning substitution context is unimplemented");
10206 ncx->blk_oldsp = cx->blk_oldsp;
10207 ncx->blk_oldcop = cx->blk_oldcop;
10208 ncx->blk_oldretsp = cx->blk_oldretsp;
10209 ncx->blk_oldmarksp = cx->blk_oldmarksp;
10210 ncx->blk_oldscopesp = cx->blk_oldscopesp;
10211 ncx->blk_oldpm = cx->blk_oldpm;
10212 ncx->blk_gimme = cx->blk_gimme;
10213 switch (CxTYPE(cx)) {
10215 ncx->blk_sub.cv = (cx->blk_sub.olddepth == 0
10216 ? cv_dup_inc(cx->blk_sub.cv, param)
10217 : cv_dup(cx->blk_sub.cv,param));
10218 ncx->blk_sub.argarray = (cx->blk_sub.hasargs
10219 ? av_dup_inc(cx->blk_sub.argarray, param)
10221 ncx->blk_sub.savearray = av_dup_inc(cx->blk_sub.savearray, param);
10222 ncx->blk_sub.olddepth = cx->blk_sub.olddepth;
10223 ncx->blk_sub.hasargs = cx->blk_sub.hasargs;
10224 ncx->blk_sub.lval = cx->blk_sub.lval;
10227 ncx->blk_eval.old_in_eval = cx->blk_eval.old_in_eval;
10228 ncx->blk_eval.old_op_type = cx->blk_eval.old_op_type;
10229 ncx->blk_eval.old_namesv = sv_dup_inc(cx->blk_eval.old_namesv, param);
10230 ncx->blk_eval.old_eval_root = cx->blk_eval.old_eval_root;
10231 ncx->blk_eval.cur_text = sv_dup(cx->blk_eval.cur_text, param);
10234 ncx->blk_loop.label = cx->blk_loop.label;
10235 ncx->blk_loop.resetsp = cx->blk_loop.resetsp;
10236 ncx->blk_loop.redo_op = cx->blk_loop.redo_op;
10237 ncx->blk_loop.next_op = cx->blk_loop.next_op;
10238 ncx->blk_loop.last_op = cx->blk_loop.last_op;
10239 ncx->blk_loop.iterdata = (CxPADLOOP(cx)
10240 ? cx->blk_loop.iterdata
10241 : gv_dup((GV*)cx->blk_loop.iterdata, param));
10242 ncx->blk_loop.oldcomppad
10243 = (PAD*)ptr_table_fetch(PL_ptr_table,
10244 cx->blk_loop.oldcomppad);
10245 ncx->blk_loop.itersave = sv_dup_inc(cx->blk_loop.itersave, param);
10246 ncx->blk_loop.iterlval = sv_dup_inc(cx->blk_loop.iterlval, param);
10247 ncx->blk_loop.iterary = av_dup_inc(cx->blk_loop.iterary, param);
10248 ncx->blk_loop.iterix = cx->blk_loop.iterix;
10249 ncx->blk_loop.itermax = cx->blk_loop.itermax;
10252 ncx->blk_sub.cv = cv_dup(cx->blk_sub.cv, param);
10253 ncx->blk_sub.gv = gv_dup(cx->blk_sub.gv, param);
10254 ncx->blk_sub.dfoutgv = gv_dup_inc(cx->blk_sub.dfoutgv, param);
10255 ncx->blk_sub.hasargs = cx->blk_sub.hasargs;
10267 /* duplicate a stack info structure */
10270 Perl_si_dup(pTHX_ PERL_SI *si, CLONE_PARAMS* param)
10275 return (PERL_SI*)NULL;
10277 /* look for it in the table first */
10278 nsi = (PERL_SI*)ptr_table_fetch(PL_ptr_table, si);
10282 /* create anew and remember what it is */
10283 Newz(56, nsi, 1, PERL_SI);
10284 ptr_table_store(PL_ptr_table, si, nsi);
10286 nsi->si_stack = av_dup_inc(si->si_stack, param);
10287 nsi->si_cxix = si->si_cxix;
10288 nsi->si_cxmax = si->si_cxmax;
10289 nsi->si_cxstack = cx_dup(si->si_cxstack, si->si_cxix, si->si_cxmax, param);
10290 nsi->si_type = si->si_type;
10291 nsi->si_prev = si_dup(si->si_prev, param);
10292 nsi->si_next = si_dup(si->si_next, param);
10293 nsi->si_markoff = si->si_markoff;
10298 #define POPINT(ss,ix) ((ss)[--(ix)].any_i32)
10299 #define TOPINT(ss,ix) ((ss)[ix].any_i32)
10300 #define POPLONG(ss,ix) ((ss)[--(ix)].any_long)
10301 #define TOPLONG(ss,ix) ((ss)[ix].any_long)
10302 #define POPIV(ss,ix) ((ss)[--(ix)].any_iv)
10303 #define TOPIV(ss,ix) ((ss)[ix].any_iv)
10304 #define POPBOOL(ss,ix) ((ss)[--(ix)].any_bool)
10305 #define TOPBOOL(ss,ix) ((ss)[ix].any_bool)
10306 #define POPPTR(ss,ix) ((ss)[--(ix)].any_ptr)
10307 #define TOPPTR(ss,ix) ((ss)[ix].any_ptr)
10308 #define POPDPTR(ss,ix) ((ss)[--(ix)].any_dptr)
10309 #define TOPDPTR(ss,ix) ((ss)[ix].any_dptr)
10310 #define POPDXPTR(ss,ix) ((ss)[--(ix)].any_dxptr)
10311 #define TOPDXPTR(ss,ix) ((ss)[ix].any_dxptr)
10314 #define pv_dup_inc(p) SAVEPV(p)
10315 #define pv_dup(p) SAVEPV(p)
10316 #define svp_dup_inc(p,pp) any_dup(p,pp)
10318 /* map any object to the new equivent - either something in the
10319 * ptr table, or something in the interpreter structure
10323 Perl_any_dup(pTHX_ void *v, PerlInterpreter *proto_perl)
10328 return (void*)NULL;
10330 /* look for it in the table first */
10331 ret = ptr_table_fetch(PL_ptr_table, v);
10335 /* see if it is part of the interpreter structure */
10336 if (v >= (void*)proto_perl && v < (void*)(proto_perl+1))
10337 ret = (void*)(((char*)aTHX) + (((char*)v) - (char*)proto_perl));
10345 /* duplicate the save stack */
10348 Perl_ss_dup(pTHX_ PerlInterpreter *proto_perl, CLONE_PARAMS* param)
10350 ANY *ss = proto_perl->Tsavestack;
10351 I32 ix = proto_perl->Tsavestack_ix;
10352 I32 max = proto_perl->Tsavestack_max;
10365 void (*dptr) (void*);
10366 void (*dxptr) (pTHX_ void*);
10369 Newz(54, nss, max, ANY);
10373 TOPINT(nss,ix) = i;
10375 case SAVEt_ITEM: /* normal string */
10376 sv = (SV*)POPPTR(ss,ix);
10377 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
10378 sv = (SV*)POPPTR(ss,ix);
10379 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
10381 case SAVEt_SV: /* scalar reference */
10382 sv = (SV*)POPPTR(ss,ix);
10383 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
10384 gv = (GV*)POPPTR(ss,ix);
10385 TOPPTR(nss,ix) = gv_dup_inc(gv, param);
10387 case SAVEt_GENERIC_PVREF: /* generic char* */
10388 c = (char*)POPPTR(ss,ix);
10389 TOPPTR(nss,ix) = pv_dup(c);
10390 ptr = POPPTR(ss,ix);
10391 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10393 case SAVEt_SHARED_PVREF: /* char* in shared space */
10394 c = (char*)POPPTR(ss,ix);
10395 TOPPTR(nss,ix) = savesharedpv(c);
10396 ptr = POPPTR(ss,ix);
10397 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10399 case SAVEt_GENERIC_SVREF: /* generic sv */
10400 case SAVEt_SVREF: /* scalar reference */
10401 sv = (SV*)POPPTR(ss,ix);
10402 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
10403 ptr = POPPTR(ss,ix);
10404 TOPPTR(nss,ix) = svp_dup_inc((SV**)ptr, proto_perl);/* XXXXX */
10406 case SAVEt_AV: /* array reference */
10407 av = (AV*)POPPTR(ss,ix);
10408 TOPPTR(nss,ix) = av_dup_inc(av, param);
10409 gv = (GV*)POPPTR(ss,ix);
10410 TOPPTR(nss,ix) = gv_dup(gv, param);
10412 case SAVEt_HV: /* hash reference */
10413 hv = (HV*)POPPTR(ss,ix);
10414 TOPPTR(nss,ix) = hv_dup_inc(hv, param);
10415 gv = (GV*)POPPTR(ss,ix);
10416 TOPPTR(nss,ix) = gv_dup(gv, param);
10418 case SAVEt_INT: /* int reference */
10419 ptr = POPPTR(ss,ix);
10420 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10421 intval = (int)POPINT(ss,ix);
10422 TOPINT(nss,ix) = intval;
10424 case SAVEt_LONG: /* long reference */
10425 ptr = POPPTR(ss,ix);
10426 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10427 longval = (long)POPLONG(ss,ix);
10428 TOPLONG(nss,ix) = longval;
10430 case SAVEt_I32: /* I32 reference */
10431 case SAVEt_I16: /* I16 reference */
10432 case SAVEt_I8: /* I8 reference */
10433 ptr = POPPTR(ss,ix);
10434 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10436 TOPINT(nss,ix) = i;
10438 case SAVEt_IV: /* IV reference */
10439 ptr = POPPTR(ss,ix);
10440 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10442 TOPIV(nss,ix) = iv;
10444 case SAVEt_SPTR: /* SV* reference */
10445 ptr = POPPTR(ss,ix);
10446 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10447 sv = (SV*)POPPTR(ss,ix);
10448 TOPPTR(nss,ix) = sv_dup(sv, param);
10450 case SAVEt_VPTR: /* random* reference */
10451 ptr = POPPTR(ss,ix);
10452 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10453 ptr = POPPTR(ss,ix);
10454 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10456 case SAVEt_PPTR: /* char* reference */
10457 ptr = POPPTR(ss,ix);
10458 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10459 c = (char*)POPPTR(ss,ix);
10460 TOPPTR(nss,ix) = pv_dup(c);
10462 case SAVEt_HPTR: /* HV* reference */
10463 ptr = POPPTR(ss,ix);
10464 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10465 hv = (HV*)POPPTR(ss,ix);
10466 TOPPTR(nss,ix) = hv_dup(hv, param);
10468 case SAVEt_APTR: /* AV* reference */
10469 ptr = POPPTR(ss,ix);
10470 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10471 av = (AV*)POPPTR(ss,ix);
10472 TOPPTR(nss,ix) = av_dup(av, param);
10475 gv = (GV*)POPPTR(ss,ix);
10476 TOPPTR(nss,ix) = gv_dup(gv, param);
10478 case SAVEt_GP: /* scalar reference */
10479 gp = (GP*)POPPTR(ss,ix);
10480 TOPPTR(nss,ix) = gp = gp_dup(gp, param);
10481 (void)GpREFCNT_inc(gp);
10482 gv = (GV*)POPPTR(ss,ix);
10483 TOPPTR(nss,ix) = gv_dup_inc(gv, param);
10484 c = (char*)POPPTR(ss,ix);
10485 TOPPTR(nss,ix) = pv_dup(c);
10487 TOPIV(nss,ix) = iv;
10489 TOPIV(nss,ix) = iv;
10492 case SAVEt_MORTALIZESV:
10493 sv = (SV*)POPPTR(ss,ix);
10494 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
10497 ptr = POPPTR(ss,ix);
10498 if (ptr && (((OP*)ptr)->op_private & OPpREFCOUNTED)) {
10499 /* these are assumed to be refcounted properly */
10500 switch (((OP*)ptr)->op_type) {
10502 case OP_LEAVESUBLV:
10506 case OP_LEAVEWRITE:
10507 TOPPTR(nss,ix) = ptr;
10512 TOPPTR(nss,ix) = Nullop;
10517 TOPPTR(nss,ix) = Nullop;
10520 c = (char*)POPPTR(ss,ix);
10521 TOPPTR(nss,ix) = pv_dup_inc(c);
10523 case SAVEt_CLEARSV:
10524 longval = POPLONG(ss,ix);
10525 TOPLONG(nss,ix) = longval;
10528 hv = (HV*)POPPTR(ss,ix);
10529 TOPPTR(nss,ix) = hv_dup_inc(hv, param);
10530 c = (char*)POPPTR(ss,ix);
10531 TOPPTR(nss,ix) = pv_dup_inc(c);
10533 TOPINT(nss,ix) = i;
10535 case SAVEt_DESTRUCTOR:
10536 ptr = POPPTR(ss,ix);
10537 TOPPTR(nss,ix) = any_dup(ptr, proto_perl); /* XXX quite arbitrary */
10538 dptr = POPDPTR(ss,ix);
10539 TOPDPTR(nss,ix) = (void (*)(void*))any_dup((void *)dptr, proto_perl);
10541 case SAVEt_DESTRUCTOR_X:
10542 ptr = POPPTR(ss,ix);
10543 TOPPTR(nss,ix) = any_dup(ptr, proto_perl); /* XXX quite arbitrary */
10544 dxptr = POPDXPTR(ss,ix);
10545 TOPDXPTR(nss,ix) = (void (*)(pTHX_ void*))any_dup((void *)dxptr, proto_perl);
10547 case SAVEt_REGCONTEXT:
10550 TOPINT(nss,ix) = i;
10553 case SAVEt_STACK_POS: /* Position on Perl stack */
10555 TOPINT(nss,ix) = i;
10557 case SAVEt_AELEM: /* array element */
10558 sv = (SV*)POPPTR(ss,ix);
10559 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
10561 TOPINT(nss,ix) = i;
10562 av = (AV*)POPPTR(ss,ix);
10563 TOPPTR(nss,ix) = av_dup_inc(av, param);
10565 case SAVEt_HELEM: /* hash element */
10566 sv = (SV*)POPPTR(ss,ix);
10567 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
10568 sv = (SV*)POPPTR(ss,ix);
10569 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
10570 hv = (HV*)POPPTR(ss,ix);
10571 TOPPTR(nss,ix) = hv_dup_inc(hv, param);
10574 ptr = POPPTR(ss,ix);
10575 TOPPTR(nss,ix) = ptr;
10579 TOPINT(nss,ix) = i;
10581 case SAVEt_COMPPAD:
10582 av = (AV*)POPPTR(ss,ix);
10583 TOPPTR(nss,ix) = av_dup(av, param);
10586 longval = (long)POPLONG(ss,ix);
10587 TOPLONG(nss,ix) = longval;
10588 ptr = POPPTR(ss,ix);
10589 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10590 sv = (SV*)POPPTR(ss,ix);
10591 TOPPTR(nss,ix) = sv_dup(sv, param);
10594 ptr = POPPTR(ss,ix);
10595 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10596 longval = (long)POPBOOL(ss,ix);
10597 TOPBOOL(nss,ix) = (bool)longval;
10600 Perl_croak(aTHX_ "panic: ss_dup inconsistency");
10608 =for apidoc perl_clone
10610 Create and return a new interpreter by cloning the current one.
10612 perl_clone takes these flags as paramters:
10614 CLONEf_COPY_STACKS - is used to, well, copy the stacks also,
10615 without it we only clone the data and zero the stacks,
10616 with it we copy the stacks and the new perl interpreter is
10617 ready to run at the exact same point as the previous one.
10618 The pseudo-fork code uses COPY_STACKS while the
10619 threads->new doesn't.
10621 CLONEf_KEEP_PTR_TABLE
10622 perl_clone keeps a ptr_table with the pointer of the old
10623 variable as a key and the new variable as a value,
10624 this allows it to check if something has been cloned and not
10625 clone it again but rather just use the value and increase the
10626 refcount. If KEEP_PTR_TABLE is not set then perl_clone will kill
10627 the ptr_table using the function
10628 C<ptr_table_free(PL_ptr_table); PL_ptr_table = NULL;>,
10629 reason to keep it around is if you want to dup some of your own
10630 variable who are outside the graph perl scans, example of this
10631 code is in threads.xs create
10634 This is a win32 thing, it is ignored on unix, it tells perls
10635 win32host code (which is c++) to clone itself, this is needed on
10636 win32 if you want to run two threads at the same time,
10637 if you just want to do some stuff in a separate perl interpreter
10638 and then throw it away and return to the original one,
10639 you don't need to do anything.
10644 /* XXX the above needs expanding by someone who actually understands it ! */
10645 EXTERN_C PerlInterpreter *
10646 perl_clone_host(PerlInterpreter* proto_perl, UV flags);
10649 perl_clone(PerlInterpreter *proto_perl, UV flags)
10651 #ifdef PERL_IMPLICIT_SYS
10653 /* perlhost.h so we need to call into it
10654 to clone the host, CPerlHost should have a c interface, sky */
10656 if (flags & CLONEf_CLONE_HOST) {
10657 return perl_clone_host(proto_perl,flags);
10659 return perl_clone_using(proto_perl, flags,
10661 proto_perl->IMemShared,
10662 proto_perl->IMemParse,
10664 proto_perl->IStdIO,
10668 proto_perl->IProc);
10672 perl_clone_using(PerlInterpreter *proto_perl, UV flags,
10673 struct IPerlMem* ipM, struct IPerlMem* ipMS,
10674 struct IPerlMem* ipMP, struct IPerlEnv* ipE,
10675 struct IPerlStdIO* ipStd, struct IPerlLIO* ipLIO,
10676 struct IPerlDir* ipD, struct IPerlSock* ipS,
10677 struct IPerlProc* ipP)
10679 /* XXX many of the string copies here can be optimized if they're
10680 * constants; they need to be allocated as common memory and just
10681 * their pointers copied. */
10684 CLONE_PARAMS clone_params;
10685 CLONE_PARAMS* param = &clone_params;
10687 PerlInterpreter *my_perl = (PerlInterpreter*)(*ipM->pMalloc)(ipM, sizeof(PerlInterpreter));
10688 PERL_SET_THX(my_perl);
10691 Poison(my_perl, 1, PerlInterpreter);
10696 PL_sig_pending = 0;
10697 Zero(&PL_debug_pad, 1, struct perl_debug_pad);
10698 # else /* !DEBUGGING */
10699 Zero(my_perl, 1, PerlInterpreter);
10700 # endif /* DEBUGGING */
10702 /* host pointers */
10704 PL_MemShared = ipMS;
10705 PL_MemParse = ipMP;
10712 #else /* !PERL_IMPLICIT_SYS */
10714 CLONE_PARAMS clone_params;
10715 CLONE_PARAMS* param = &clone_params;
10716 PerlInterpreter *my_perl = (PerlInterpreter*)PerlMem_malloc(sizeof(PerlInterpreter));
10717 PERL_SET_THX(my_perl);
10722 Poison(my_perl, 1, PerlInterpreter);
10727 PL_sig_pending = 0;
10728 Zero(&PL_debug_pad, 1, struct perl_debug_pad);
10729 # else /* !DEBUGGING */
10730 Zero(my_perl, 1, PerlInterpreter);
10731 # endif /* DEBUGGING */
10732 #endif /* PERL_IMPLICIT_SYS */
10733 param->flags = flags;
10734 param->proto_perl = proto_perl;
10737 PL_xiv_arenaroot = NULL;
10738 PL_xiv_root = NULL;
10739 PL_xnv_arenaroot = NULL;
10740 PL_xnv_root = NULL;
10741 PL_xrv_arenaroot = NULL;
10742 PL_xrv_root = NULL;
10743 PL_xpv_arenaroot = NULL;
10744 PL_xpv_root = NULL;
10745 PL_xpviv_arenaroot = NULL;
10746 PL_xpviv_root = NULL;
10747 PL_xpvnv_arenaroot = NULL;
10748 PL_xpvnv_root = NULL;
10749 PL_xpvcv_arenaroot = NULL;
10750 PL_xpvcv_root = NULL;
10751 PL_xpvav_arenaroot = NULL;
10752 PL_xpvav_root = NULL;
10753 PL_xpvhv_arenaroot = NULL;
10754 PL_xpvhv_root = NULL;
10755 PL_xpvmg_arenaroot = NULL;
10756 PL_xpvmg_root = NULL;
10757 PL_xpvlv_arenaroot = NULL;
10758 PL_xpvlv_root = NULL;
10759 PL_xpvbm_arenaroot = NULL;
10760 PL_xpvbm_root = NULL;
10761 PL_he_arenaroot = NULL;
10763 PL_nice_chunk = NULL;
10764 PL_nice_chunk_size = 0;
10766 PL_sv_objcount = 0;
10767 PL_sv_root = Nullsv;
10768 PL_sv_arenaroot = Nullsv;
10770 PL_debug = proto_perl->Idebug;
10772 #ifdef USE_REENTRANT_API
10773 Perl_reentrant_init(aTHX);
10776 /* create SV map for pointer relocation */
10777 PL_ptr_table = ptr_table_new();
10779 /* initialize these special pointers as early as possible */
10780 SvANY(&PL_sv_undef) = NULL;
10781 SvREFCNT(&PL_sv_undef) = (~(U32)0)/2;
10782 SvFLAGS(&PL_sv_undef) = SVf_READONLY|SVt_NULL;
10783 ptr_table_store(PL_ptr_table, &proto_perl->Isv_undef, &PL_sv_undef);
10785 SvANY(&PL_sv_no) = new_XPVNV();
10786 SvREFCNT(&PL_sv_no) = (~(U32)0)/2;
10787 SvFLAGS(&PL_sv_no) = SVp_NOK|SVf_NOK|SVp_POK|SVf_POK|SVf_READONLY|SVt_PVNV;
10788 SvPVX(&PL_sv_no) = SAVEPVN(PL_No, 0);
10789 SvCUR(&PL_sv_no) = 0;
10790 SvLEN(&PL_sv_no) = 1;
10791 SvNVX(&PL_sv_no) = 0;
10792 ptr_table_store(PL_ptr_table, &proto_perl->Isv_no, &PL_sv_no);
10794 SvANY(&PL_sv_yes) = new_XPVNV();
10795 SvREFCNT(&PL_sv_yes) = (~(U32)0)/2;
10796 SvFLAGS(&PL_sv_yes) = SVp_NOK|SVf_NOK|SVp_POK|SVf_POK|SVf_READONLY|SVt_PVNV;
10797 SvPVX(&PL_sv_yes) = SAVEPVN(PL_Yes, 1);
10798 SvCUR(&PL_sv_yes) = 1;
10799 SvLEN(&PL_sv_yes) = 2;
10800 SvNVX(&PL_sv_yes) = 1;
10801 ptr_table_store(PL_ptr_table, &proto_perl->Isv_yes, &PL_sv_yes);
10803 /* create (a non-shared!) shared string table */
10804 PL_strtab = newHV();
10805 HvSHAREKEYS_off(PL_strtab);
10806 hv_ksplit(PL_strtab, 512);
10807 ptr_table_store(PL_ptr_table, proto_perl->Istrtab, PL_strtab);
10809 PL_compiling = proto_perl->Icompiling;
10811 /* These two PVs will be free'd special way so must set them same way op.c does */
10812 PL_compiling.cop_stashpv = savesharedpv(PL_compiling.cop_stashpv);
10813 ptr_table_store(PL_ptr_table, proto_perl->Icompiling.cop_stashpv, PL_compiling.cop_stashpv);
10815 PL_compiling.cop_file = savesharedpv(PL_compiling.cop_file);
10816 ptr_table_store(PL_ptr_table, proto_perl->Icompiling.cop_file, PL_compiling.cop_file);
10818 ptr_table_store(PL_ptr_table, &proto_perl->Icompiling, &PL_compiling);
10819 if (!specialWARN(PL_compiling.cop_warnings))
10820 PL_compiling.cop_warnings = sv_dup_inc(PL_compiling.cop_warnings, param);
10821 if (!specialCopIO(PL_compiling.cop_io))
10822 PL_compiling.cop_io = sv_dup_inc(PL_compiling.cop_io, param);
10823 PL_curcop = (COP*)any_dup(proto_perl->Tcurcop, proto_perl);
10825 /* pseudo environmental stuff */
10826 PL_origargc = proto_perl->Iorigargc;
10827 PL_origargv = proto_perl->Iorigargv;
10829 param->stashes = newAV(); /* Setup array of objects to call clone on */
10831 #ifdef PERLIO_LAYERS
10832 /* Clone PerlIO tables as soon as we can handle general xx_dup() */
10833 PerlIO_clone(aTHX_ proto_perl, param);
10836 PL_envgv = gv_dup(proto_perl->Ienvgv, param);
10837 PL_incgv = gv_dup(proto_perl->Iincgv, param);
10838 PL_hintgv = gv_dup(proto_perl->Ihintgv, param);
10839 PL_origfilename = SAVEPV(proto_perl->Iorigfilename);
10840 PL_diehook = sv_dup_inc(proto_perl->Idiehook, param);
10841 PL_warnhook = sv_dup_inc(proto_perl->Iwarnhook, param);
10844 PL_minus_c = proto_perl->Iminus_c;
10845 PL_patchlevel = sv_dup_inc(proto_perl->Ipatchlevel, param);
10846 PL_localpatches = proto_perl->Ilocalpatches;
10847 PL_splitstr = proto_perl->Isplitstr;
10848 PL_preprocess = proto_perl->Ipreprocess;
10849 PL_minus_n = proto_perl->Iminus_n;
10850 PL_minus_p = proto_perl->Iminus_p;
10851 PL_minus_l = proto_perl->Iminus_l;
10852 PL_minus_a = proto_perl->Iminus_a;
10853 PL_minus_F = proto_perl->Iminus_F;
10854 PL_doswitches = proto_perl->Idoswitches;
10855 PL_dowarn = proto_perl->Idowarn;
10856 PL_doextract = proto_perl->Idoextract;
10857 PL_sawampersand = proto_perl->Isawampersand;
10858 PL_unsafe = proto_perl->Iunsafe;
10859 PL_inplace = SAVEPV(proto_perl->Iinplace);
10860 PL_e_script = sv_dup_inc(proto_perl->Ie_script, param);
10861 PL_perldb = proto_perl->Iperldb;
10862 PL_perl_destruct_level = proto_perl->Iperl_destruct_level;
10863 PL_exit_flags = proto_perl->Iexit_flags;
10865 /* magical thingies */
10866 /* XXX time(&PL_basetime) when asked for? */
10867 PL_basetime = proto_perl->Ibasetime;
10868 PL_formfeed = sv_dup(proto_perl->Iformfeed, param);
10870 PL_maxsysfd = proto_perl->Imaxsysfd;
10871 PL_multiline = proto_perl->Imultiline;
10872 PL_statusvalue = proto_perl->Istatusvalue;
10874 PL_statusvalue_vms = proto_perl->Istatusvalue_vms;
10876 PL_encoding = sv_dup(proto_perl->Iencoding, param);
10878 sv_setpvn(PERL_DEBUG_PAD(0), "", 0); /* For regex debugging. */
10879 sv_setpvn(PERL_DEBUG_PAD(1), "", 0); /* ext/re needs these */
10880 sv_setpvn(PERL_DEBUG_PAD(2), "", 0); /* even without DEBUGGING. */
10882 /* Clone the regex array */
10883 PL_regex_padav = newAV();
10885 I32 len = av_len((AV*)proto_perl->Iregex_padav);
10886 SV** regexen = AvARRAY((AV*)proto_perl->Iregex_padav);
10887 av_push(PL_regex_padav,
10888 sv_dup_inc(regexen[0],param));
10889 for(i = 1; i <= len; i++) {
10890 if(SvREPADTMP(regexen[i])) {
10891 av_push(PL_regex_padav, sv_dup_inc(regexen[i], param));
10893 av_push(PL_regex_padav,
10895 newSViv(PTR2IV(re_dup(INT2PTR(REGEXP *,
10896 SvIVX(regexen[i])), param)))
10901 PL_regex_pad = AvARRAY(PL_regex_padav);
10903 /* shortcuts to various I/O objects */
10904 PL_stdingv = gv_dup(proto_perl->Istdingv, param);
10905 PL_stderrgv = gv_dup(proto_perl->Istderrgv, param);
10906 PL_defgv = gv_dup(proto_perl->Idefgv, param);
10907 PL_argvgv = gv_dup(proto_perl->Iargvgv, param);
10908 PL_argvoutgv = gv_dup(proto_perl->Iargvoutgv, param);
10909 PL_argvout_stack = av_dup_inc(proto_perl->Iargvout_stack, param);
10911 /* shortcuts to regexp stuff */
10912 PL_replgv = gv_dup(proto_perl->Ireplgv, param);
10914 /* shortcuts to misc objects */
10915 PL_errgv = gv_dup(proto_perl->Ierrgv, param);
10917 /* shortcuts to debugging objects */
10918 PL_DBgv = gv_dup(proto_perl->IDBgv, param);
10919 PL_DBline = gv_dup(proto_perl->IDBline, param);
10920 PL_DBsub = gv_dup(proto_perl->IDBsub, param);
10921 PL_DBsingle = sv_dup(proto_perl->IDBsingle, param);
10922 PL_DBtrace = sv_dup(proto_perl->IDBtrace, param);
10923 PL_DBsignal = sv_dup(proto_perl->IDBsignal, param);
10924 PL_DBassertion = sv_dup(proto_perl->IDBassertion, param);
10925 PL_lineary = av_dup(proto_perl->Ilineary, param);
10926 PL_dbargs = av_dup(proto_perl->Idbargs, param);
10928 /* symbol tables */
10929 PL_defstash = hv_dup_inc(proto_perl->Tdefstash, param);
10930 PL_curstash = hv_dup(proto_perl->Tcurstash, param);
10931 PL_debstash = hv_dup(proto_perl->Idebstash, param);
10932 PL_globalstash = hv_dup(proto_perl->Iglobalstash, param);
10933 PL_curstname = sv_dup_inc(proto_perl->Icurstname, param);
10935 PL_beginav = av_dup_inc(proto_perl->Ibeginav, param);
10936 PL_beginav_save = av_dup_inc(proto_perl->Ibeginav_save, param);
10937 PL_checkav_save = av_dup_inc(proto_perl->Icheckav_save, param);
10938 PL_endav = av_dup_inc(proto_perl->Iendav, param);
10939 PL_checkav = av_dup_inc(proto_perl->Icheckav, param);
10940 PL_initav = av_dup_inc(proto_perl->Iinitav, param);
10942 PL_sub_generation = proto_perl->Isub_generation;
10944 /* funky return mechanisms */
10945 PL_forkprocess = proto_perl->Iforkprocess;
10947 /* subprocess state */
10948 PL_fdpid = av_dup_inc(proto_perl->Ifdpid, param);
10950 /* internal state */
10951 PL_tainting = proto_perl->Itainting;
10952 PL_taint_warn = proto_perl->Itaint_warn;
10953 PL_maxo = proto_perl->Imaxo;
10954 if (proto_perl->Iop_mask)
10955 PL_op_mask = SAVEPVN(proto_perl->Iop_mask, PL_maxo);
10957 PL_op_mask = Nullch;
10958 /* PL_asserting = proto_perl->Iasserting; */
10960 /* current interpreter roots */
10961 PL_main_cv = cv_dup_inc(proto_perl->Imain_cv, param);
10962 PL_main_root = OpREFCNT_inc(proto_perl->Imain_root);
10963 PL_main_start = proto_perl->Imain_start;
10964 PL_eval_root = proto_perl->Ieval_root;
10965 PL_eval_start = proto_perl->Ieval_start;
10967 /* runtime control stuff */
10968 PL_curcopdb = (COP*)any_dup(proto_perl->Icurcopdb, proto_perl);
10969 PL_copline = proto_perl->Icopline;
10971 PL_filemode = proto_perl->Ifilemode;
10972 PL_lastfd = proto_perl->Ilastfd;
10973 PL_oldname = proto_perl->Ioldname; /* XXX not quite right */
10976 PL_gensym = proto_perl->Igensym;
10977 PL_preambled = proto_perl->Ipreambled;
10978 PL_preambleav = av_dup_inc(proto_perl->Ipreambleav, param);
10979 PL_laststatval = proto_perl->Ilaststatval;
10980 PL_laststype = proto_perl->Ilaststype;
10981 PL_mess_sv = Nullsv;
10983 PL_ors_sv = sv_dup_inc(proto_perl->Iors_sv, param);
10984 PL_ofmt = SAVEPV(proto_perl->Iofmt);
10986 /* interpreter atexit processing */
10987 PL_exitlistlen = proto_perl->Iexitlistlen;
10988 if (PL_exitlistlen) {
10989 New(0, PL_exitlist, PL_exitlistlen, PerlExitListEntry);
10990 Copy(proto_perl->Iexitlist, PL_exitlist, PL_exitlistlen, PerlExitListEntry);
10993 PL_exitlist = (PerlExitListEntry*)NULL;
10994 PL_modglobal = hv_dup_inc(proto_perl->Imodglobal, param);
10995 PL_custom_op_names = hv_dup_inc(proto_perl->Icustom_op_names,param);
10996 PL_custom_op_descs = hv_dup_inc(proto_perl->Icustom_op_descs,param);
10998 PL_profiledata = NULL;
10999 PL_rsfp = fp_dup(proto_perl->Irsfp, '<', param);
11000 /* PL_rsfp_filters entries have fake IoDIRP() */
11001 PL_rsfp_filters = av_dup_inc(proto_perl->Irsfp_filters, param);
11003 PL_compcv = cv_dup(proto_perl->Icompcv, param);
11005 PAD_CLONE_VARS(proto_perl, param);
11007 #ifdef HAVE_INTERP_INTERN
11008 sys_intern_dup(&proto_perl->Isys_intern, &PL_sys_intern);
11011 /* more statics moved here */
11012 PL_generation = proto_perl->Igeneration;
11013 PL_DBcv = cv_dup(proto_perl->IDBcv, param);
11015 PL_in_clean_objs = proto_perl->Iin_clean_objs;
11016 PL_in_clean_all = proto_perl->Iin_clean_all;
11018 PL_uid = proto_perl->Iuid;
11019 PL_euid = proto_perl->Ieuid;
11020 PL_gid = proto_perl->Igid;
11021 PL_egid = proto_perl->Iegid;
11022 PL_nomemok = proto_perl->Inomemok;
11023 PL_an = proto_perl->Ian;
11024 PL_op_seqmax = proto_perl->Iop_seqmax;
11025 PL_evalseq = proto_perl->Ievalseq;
11026 PL_origenviron = proto_perl->Iorigenviron; /* XXX not quite right */
11027 PL_origalen = proto_perl->Iorigalen;
11028 PL_pidstatus = newHV(); /* XXX flag for cloning? */
11029 PL_osname = SAVEPV(proto_perl->Iosname);
11030 PL_sh_path_compat = proto_perl->Ish_path_compat; /* XXX never deallocated */
11031 PL_sighandlerp = proto_perl->Isighandlerp;
11034 PL_runops = proto_perl->Irunops;
11036 Copy(proto_perl->Itokenbuf, PL_tokenbuf, 256, char);
11039 PL_cshlen = proto_perl->Icshlen;
11040 PL_cshname = proto_perl->Icshname; /* XXX never deallocated */
11043 PL_lex_state = proto_perl->Ilex_state;
11044 PL_lex_defer = proto_perl->Ilex_defer;
11045 PL_lex_expect = proto_perl->Ilex_expect;
11046 PL_lex_formbrack = proto_perl->Ilex_formbrack;
11047 PL_lex_dojoin = proto_perl->Ilex_dojoin;
11048 PL_lex_starts = proto_perl->Ilex_starts;
11049 PL_lex_stuff = sv_dup_inc(proto_perl->Ilex_stuff, param);
11050 PL_lex_repl = sv_dup_inc(proto_perl->Ilex_repl, param);
11051 PL_lex_op = proto_perl->Ilex_op;
11052 PL_lex_inpat = proto_perl->Ilex_inpat;
11053 PL_lex_inwhat = proto_perl->Ilex_inwhat;
11054 PL_lex_brackets = proto_perl->Ilex_brackets;
11055 i = (PL_lex_brackets < 120 ? 120 : PL_lex_brackets);
11056 PL_lex_brackstack = SAVEPVN(proto_perl->Ilex_brackstack,i);
11057 PL_lex_casemods = proto_perl->Ilex_casemods;
11058 i = (PL_lex_casemods < 12 ? 12 : PL_lex_casemods);
11059 PL_lex_casestack = SAVEPVN(proto_perl->Ilex_casestack,i);
11061 Copy(proto_perl->Inextval, PL_nextval, 5, YYSTYPE);
11062 Copy(proto_perl->Inexttype, PL_nexttype, 5, I32);
11063 PL_nexttoke = proto_perl->Inexttoke;
11065 /* XXX This is probably masking the deeper issue of why
11066 * SvANY(proto_perl->Ilinestr) can be NULL at this point. For test case:
11067 * http://archive.develooper.com/perl5-porters%40perl.org/msg83298.html
11068 * (A little debugging with a watchpoint on it may help.)
11070 if (SvANY(proto_perl->Ilinestr)) {
11071 PL_linestr = sv_dup_inc(proto_perl->Ilinestr, param);
11072 i = proto_perl->Ibufptr - SvPVX(proto_perl->Ilinestr);
11073 PL_bufptr = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
11074 i = proto_perl->Ioldbufptr - SvPVX(proto_perl->Ilinestr);
11075 PL_oldbufptr = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
11076 i = proto_perl->Ioldoldbufptr - SvPVX(proto_perl->Ilinestr);
11077 PL_oldoldbufptr = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
11078 i = proto_perl->Ilinestart - SvPVX(proto_perl->Ilinestr);
11079 PL_linestart = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
11082 PL_linestr = NEWSV(65,79);
11083 sv_upgrade(PL_linestr,SVt_PVIV);
11084 sv_setpvn(PL_linestr,"",0);
11085 PL_bufptr = PL_oldbufptr = PL_oldoldbufptr = PL_linestart = SvPVX(PL_linestr);
11087 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
11088 PL_pending_ident = proto_perl->Ipending_ident;
11089 PL_sublex_info = proto_perl->Isublex_info; /* XXX not quite right */
11091 PL_expect = proto_perl->Iexpect;
11093 PL_multi_start = proto_perl->Imulti_start;
11094 PL_multi_end = proto_perl->Imulti_end;
11095 PL_multi_open = proto_perl->Imulti_open;
11096 PL_multi_close = proto_perl->Imulti_close;
11098 PL_error_count = proto_perl->Ierror_count;
11099 PL_subline = proto_perl->Isubline;
11100 PL_subname = sv_dup_inc(proto_perl->Isubname, param);
11102 /* XXX See comment on SvANY(proto_perl->Ilinestr) above */
11103 if (SvANY(proto_perl->Ilinestr)) {
11104 i = proto_perl->Ilast_uni - SvPVX(proto_perl->Ilinestr);
11105 PL_last_uni = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
11106 i = proto_perl->Ilast_lop - SvPVX(proto_perl->Ilinestr);
11107 PL_last_lop = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
11108 PL_last_lop_op = proto_perl->Ilast_lop_op;
11111 PL_last_uni = SvPVX(PL_linestr);
11112 PL_last_lop = SvPVX(PL_linestr);
11113 PL_last_lop_op = 0;
11115 PL_in_my = proto_perl->Iin_my;
11116 PL_in_my_stash = hv_dup(proto_perl->Iin_my_stash, param);
11118 PL_cryptseen = proto_perl->Icryptseen;
11121 PL_hints = proto_perl->Ihints;
11123 PL_amagic_generation = proto_perl->Iamagic_generation;
11125 #ifdef USE_LOCALE_COLLATE
11126 PL_collation_ix = proto_perl->Icollation_ix;
11127 PL_collation_name = SAVEPV(proto_perl->Icollation_name);
11128 PL_collation_standard = proto_perl->Icollation_standard;
11129 PL_collxfrm_base = proto_perl->Icollxfrm_base;
11130 PL_collxfrm_mult = proto_perl->Icollxfrm_mult;
11131 #endif /* USE_LOCALE_COLLATE */
11133 #ifdef USE_LOCALE_NUMERIC
11134 PL_numeric_name = SAVEPV(proto_perl->Inumeric_name);
11135 PL_numeric_standard = proto_perl->Inumeric_standard;
11136 PL_numeric_local = proto_perl->Inumeric_local;
11137 PL_numeric_radix_sv = sv_dup_inc(proto_perl->Inumeric_radix_sv, param);
11138 #endif /* !USE_LOCALE_NUMERIC */
11140 /* utf8 character classes */
11141 PL_utf8_alnum = sv_dup_inc(proto_perl->Iutf8_alnum, param);
11142 PL_utf8_alnumc = sv_dup_inc(proto_perl->Iutf8_alnumc, param);
11143 PL_utf8_ascii = sv_dup_inc(proto_perl->Iutf8_ascii, param);
11144 PL_utf8_alpha = sv_dup_inc(proto_perl->Iutf8_alpha, param);
11145 PL_utf8_space = sv_dup_inc(proto_perl->Iutf8_space, param);
11146 PL_utf8_cntrl = sv_dup_inc(proto_perl->Iutf8_cntrl, param);
11147 PL_utf8_graph = sv_dup_inc(proto_perl->Iutf8_graph, param);
11148 PL_utf8_digit = sv_dup_inc(proto_perl->Iutf8_digit, param);
11149 PL_utf8_upper = sv_dup_inc(proto_perl->Iutf8_upper, param);
11150 PL_utf8_lower = sv_dup_inc(proto_perl->Iutf8_lower, param);
11151 PL_utf8_print = sv_dup_inc(proto_perl->Iutf8_print, param);
11152 PL_utf8_punct = sv_dup_inc(proto_perl->Iutf8_punct, param);
11153 PL_utf8_xdigit = sv_dup_inc(proto_perl->Iutf8_xdigit, param);
11154 PL_utf8_mark = sv_dup_inc(proto_perl->Iutf8_mark, param);
11155 PL_utf8_toupper = sv_dup_inc(proto_perl->Iutf8_toupper, param);
11156 PL_utf8_totitle = sv_dup_inc(proto_perl->Iutf8_totitle, param);
11157 PL_utf8_tolower = sv_dup_inc(proto_perl->Iutf8_tolower, param);
11158 PL_utf8_tofold = sv_dup_inc(proto_perl->Iutf8_tofold, param);
11159 PL_utf8_idstart = sv_dup_inc(proto_perl->Iutf8_idstart, param);
11160 PL_utf8_idcont = sv_dup_inc(proto_perl->Iutf8_idcont, param);
11162 /* Did the locale setup indicate UTF-8? */
11163 PL_utf8locale = proto_perl->Iutf8locale;
11164 /* Unicode features (see perlrun/-C) */
11165 PL_unicode = proto_perl->Iunicode;
11167 /* Pre-5.8 signals control */
11168 PL_signals = proto_perl->Isignals;
11170 /* times() ticks per second */
11171 PL_clocktick = proto_perl->Iclocktick;
11173 /* Recursion stopper for PerlIO_find_layer */
11174 PL_in_load_module = proto_perl->Iin_load_module;
11176 /* sort() routine */
11177 PL_sort_RealCmp = proto_perl->Isort_RealCmp;
11180 PL_last_swash_hv = Nullhv; /* reinits on demand */
11181 PL_last_swash_klen = 0;
11182 PL_last_swash_key[0]= '\0';
11183 PL_last_swash_tmps = (U8*)NULL;
11184 PL_last_swash_slen = 0;
11186 /* perly.c globals */
11187 PL_yydebug = proto_perl->Iyydebug;
11188 PL_yynerrs = proto_perl->Iyynerrs;
11189 PL_yyerrflag = proto_perl->Iyyerrflag;
11190 PL_yychar = proto_perl->Iyychar;
11191 PL_yyval = proto_perl->Iyyval;
11192 PL_yylval = proto_perl->Iyylval;
11194 PL_glob_index = proto_perl->Iglob_index;
11195 PL_srand_called = proto_perl->Isrand_called;
11196 PL_uudmap['M'] = 0; /* reinits on demand */
11197 PL_bitcount = Nullch; /* reinits on demand */
11199 if (proto_perl->Ipsig_pend) {
11200 Newz(0, PL_psig_pend, SIG_SIZE, int);
11203 PL_psig_pend = (int*)NULL;
11206 if (proto_perl->Ipsig_ptr) {
11207 Newz(0, PL_psig_ptr, SIG_SIZE, SV*);
11208 Newz(0, PL_psig_name, SIG_SIZE, SV*);
11209 for (i = 1; i < SIG_SIZE; i++) {
11210 PL_psig_ptr[i] = sv_dup_inc(proto_perl->Ipsig_ptr[i], param);
11211 PL_psig_name[i] = sv_dup_inc(proto_perl->Ipsig_name[i], param);
11215 PL_psig_ptr = (SV**)NULL;
11216 PL_psig_name = (SV**)NULL;
11219 /* thrdvar.h stuff */
11221 if (flags & CLONEf_COPY_STACKS) {
11222 /* next allocation will be PL_tmps_stack[PL_tmps_ix+1] */
11223 PL_tmps_ix = proto_perl->Ttmps_ix;
11224 PL_tmps_max = proto_perl->Ttmps_max;
11225 PL_tmps_floor = proto_perl->Ttmps_floor;
11226 Newz(50, PL_tmps_stack, PL_tmps_max, SV*);
11228 while (i <= PL_tmps_ix) {
11229 PL_tmps_stack[i] = sv_dup_inc(proto_perl->Ttmps_stack[i], param);
11233 /* next PUSHMARK() sets *(PL_markstack_ptr+1) */
11234 i = proto_perl->Tmarkstack_max - proto_perl->Tmarkstack;
11235 Newz(54, PL_markstack, i, I32);
11236 PL_markstack_max = PL_markstack + (proto_perl->Tmarkstack_max
11237 - proto_perl->Tmarkstack);
11238 PL_markstack_ptr = PL_markstack + (proto_perl->Tmarkstack_ptr
11239 - proto_perl->Tmarkstack);
11240 Copy(proto_perl->Tmarkstack, PL_markstack,
11241 PL_markstack_ptr - PL_markstack + 1, I32);
11243 /* next push_scope()/ENTER sets PL_scopestack[PL_scopestack_ix]
11244 * NOTE: unlike the others! */
11245 PL_scopestack_ix = proto_perl->Tscopestack_ix;
11246 PL_scopestack_max = proto_perl->Tscopestack_max;
11247 Newz(54, PL_scopestack, PL_scopestack_max, I32);
11248 Copy(proto_perl->Tscopestack, PL_scopestack, PL_scopestack_ix, I32);
11250 /* next push_return() sets PL_retstack[PL_retstack_ix]
11251 * NOTE: unlike the others! */
11252 PL_retstack_ix = proto_perl->Tretstack_ix;
11253 PL_retstack_max = proto_perl->Tretstack_max;
11254 Newz(54, PL_retstack, PL_retstack_max, OP*);
11255 Copy(proto_perl->Tretstack, PL_retstack, PL_retstack_ix, OP*);
11257 /* NOTE: si_dup() looks at PL_markstack */
11258 PL_curstackinfo = si_dup(proto_perl->Tcurstackinfo, param);
11260 /* PL_curstack = PL_curstackinfo->si_stack; */
11261 PL_curstack = av_dup(proto_perl->Tcurstack, param);
11262 PL_mainstack = av_dup(proto_perl->Tmainstack, param);
11264 /* next PUSHs() etc. set *(PL_stack_sp+1) */
11265 PL_stack_base = AvARRAY(PL_curstack);
11266 PL_stack_sp = PL_stack_base + (proto_perl->Tstack_sp
11267 - proto_perl->Tstack_base);
11268 PL_stack_max = PL_stack_base + AvMAX(PL_curstack);
11270 /* next SSPUSHFOO() sets PL_savestack[PL_savestack_ix]
11271 * NOTE: unlike the others! */
11272 PL_savestack_ix = proto_perl->Tsavestack_ix;
11273 PL_savestack_max = proto_perl->Tsavestack_max;
11274 /*Newz(54, PL_savestack, PL_savestack_max, ANY);*/
11275 PL_savestack = ss_dup(proto_perl, param);
11279 ENTER; /* perl_destruct() wants to LEAVE; */
11282 PL_start_env = proto_perl->Tstart_env; /* XXXXXX */
11283 PL_top_env = &PL_start_env;
11285 PL_op = proto_perl->Top;
11288 PL_Xpv = (XPV*)NULL;
11289 PL_na = proto_perl->Tna;
11291 PL_statbuf = proto_perl->Tstatbuf;
11292 PL_statcache = proto_perl->Tstatcache;
11293 PL_statgv = gv_dup(proto_perl->Tstatgv, param);
11294 PL_statname = sv_dup_inc(proto_perl->Tstatname, param);
11296 PL_timesbuf = proto_perl->Ttimesbuf;
11299 PL_tainted = proto_perl->Ttainted;
11300 PL_curpm = proto_perl->Tcurpm; /* XXX No PMOP ref count */
11301 PL_rs = sv_dup_inc(proto_perl->Trs, param);
11302 PL_last_in_gv = gv_dup(proto_perl->Tlast_in_gv, param);
11303 PL_ofs_sv = sv_dup_inc(proto_perl->Tofs_sv, param);
11304 PL_defoutgv = gv_dup_inc(proto_perl->Tdefoutgv, param);
11305 PL_chopset = proto_perl->Tchopset; /* XXX never deallocated */
11306 PL_toptarget = sv_dup_inc(proto_perl->Ttoptarget, param);
11307 PL_bodytarget = sv_dup_inc(proto_perl->Tbodytarget, param);
11308 PL_formtarget = sv_dup(proto_perl->Tformtarget, param);
11310 PL_restartop = proto_perl->Trestartop;
11311 PL_in_eval = proto_perl->Tin_eval;
11312 PL_delaymagic = proto_perl->Tdelaymagic;
11313 PL_dirty = proto_perl->Tdirty;
11314 PL_localizing = proto_perl->Tlocalizing;
11316 #ifdef PERL_FLEXIBLE_EXCEPTIONS
11317 PL_protect = proto_perl->Tprotect;
11319 PL_errors = sv_dup_inc(proto_perl->Terrors, param);
11320 PL_av_fetch_sv = Nullsv;
11321 PL_hv_fetch_sv = Nullsv;
11322 Zero(&PL_hv_fetch_ent_mh, 1, HE); /* XXX */
11323 PL_modcount = proto_perl->Tmodcount;
11324 PL_lastgotoprobe = Nullop;
11325 PL_dumpindent = proto_perl->Tdumpindent;
11327 PL_sortcop = (OP*)any_dup(proto_perl->Tsortcop, proto_perl);
11328 PL_sortstash = hv_dup(proto_perl->Tsortstash, param);
11329 PL_firstgv = gv_dup(proto_perl->Tfirstgv, param);
11330 PL_secondgv = gv_dup(proto_perl->Tsecondgv, param);
11331 PL_sortcxix = proto_perl->Tsortcxix;
11332 PL_efloatbuf = Nullch; /* reinits on demand */
11333 PL_efloatsize = 0; /* reinits on demand */
11337 PL_screamfirst = NULL;
11338 PL_screamnext = NULL;
11339 PL_maxscream = -1; /* reinits on demand */
11340 PL_lastscream = Nullsv;
11342 PL_watchaddr = NULL;
11343 PL_watchok = Nullch;
11345 PL_regdummy = proto_perl->Tregdummy;
11346 PL_regprecomp = Nullch;
11349 PL_colorset = 0; /* reinits PL_colors[] */
11350 /*PL_colors[6] = {0,0,0,0,0,0};*/
11351 PL_reginput = Nullch;
11352 PL_regbol = Nullch;
11353 PL_regeol = Nullch;
11354 PL_regstartp = (I32*)NULL;
11355 PL_regendp = (I32*)NULL;
11356 PL_reglastparen = (U32*)NULL;
11357 PL_regtill = Nullch;
11358 PL_reg_start_tmp = (char**)NULL;
11359 PL_reg_start_tmpl = 0;
11360 PL_regdata = (struct reg_data*)NULL;
11363 PL_reg_eval_set = 0;
11365 PL_regprogram = (regnode*)NULL;
11367 PL_regcc = (CURCUR*)NULL;
11368 PL_reg_call_cc = (struct re_cc_state*)NULL;
11369 PL_reg_re = (regexp*)NULL;
11370 PL_reg_ganch = Nullch;
11371 PL_reg_sv = Nullsv;
11372 PL_reg_match_utf8 = FALSE;
11373 PL_reg_magic = (MAGIC*)NULL;
11375 PL_reg_oldcurpm = (PMOP*)NULL;
11376 PL_reg_curpm = (PMOP*)NULL;
11377 PL_reg_oldsaved = Nullch;
11378 PL_reg_oldsavedlen = 0;
11379 #ifdef PERL_COPY_ON_WRITE
11382 PL_reg_maxiter = 0;
11383 PL_reg_leftiter = 0;
11384 PL_reg_poscache = Nullch;
11385 PL_reg_poscache_size= 0;
11387 /* RE engine - function pointers */
11388 PL_regcompp = proto_perl->Tregcompp;
11389 PL_regexecp = proto_perl->Tregexecp;
11390 PL_regint_start = proto_perl->Tregint_start;
11391 PL_regint_string = proto_perl->Tregint_string;
11392 PL_regfree = proto_perl->Tregfree;
11394 PL_reginterp_cnt = 0;
11395 PL_reg_starttry = 0;
11397 /* Pluggable optimizer */
11398 PL_peepp = proto_perl->Tpeepp;
11400 PL_stashcache = newHV();
11402 if (!(flags & CLONEf_KEEP_PTR_TABLE)) {
11403 ptr_table_free(PL_ptr_table);
11404 PL_ptr_table = NULL;
11407 /* Call the ->CLONE method, if it exists, for each of the stashes
11408 identified by sv_dup() above.
11410 while(av_len(param->stashes) != -1) {
11411 HV* stash = (HV*) av_shift(param->stashes);
11412 GV* cloner = gv_fetchmethod_autoload(stash, "CLONE", 0);
11413 if (cloner && GvCV(cloner)) {
11418 XPUSHs(sv_2mortal(newSVpv(HvNAME(stash), 0)));
11420 call_sv((SV*)GvCV(cloner), G_DISCARD);
11426 SvREFCNT_dec(param->stashes);
11431 #endif /* USE_ITHREADS */
11434 =head1 Unicode Support
11436 =for apidoc sv_recode_to_utf8
11438 The encoding is assumed to be an Encode object, on entry the PV
11439 of the sv is assumed to be octets in that encoding, and the sv
11440 will be converted into Unicode (and UTF-8).
11442 If the sv already is UTF-8 (or if it is not POK), or if the encoding
11443 is not a reference, nothing is done to the sv. If the encoding is not
11444 an C<Encode::XS> Encoding object, bad things will happen.
11445 (See F<lib/encoding.pm> and L<Encode>).
11447 The PV of the sv is returned.
11452 Perl_sv_recode_to_utf8(pTHX_ SV *sv, SV *encoding)
11454 if (SvPOK(sv) && !SvUTF8(sv) && !IN_BYTES && SvROK(encoding)) {
11468 Passing sv_yes is wrong - it needs to be or'ed set of constants
11469 for Encode::XS, while UTf-8 decode (currently) assumes a true value means
11470 remove converted chars from source.
11472 Both will default the value - let them.
11474 XPUSHs(&PL_sv_yes);
11477 call_method("decode", G_SCALAR);
11481 s = SvPV(uni, len);
11482 if (s != SvPVX(sv)) {
11483 SvGROW(sv, len + 1);
11484 Move(s, SvPVX(sv), len, char);
11485 SvCUR_set(sv, len);
11486 SvPVX(sv)[len] = 0;
11496 =for apidoc sv_cat_decode
11498 The encoding is assumed to be an Encode object, the PV of the ssv is
11499 assumed to be octets in that encoding and decoding the input starts
11500 from the position which (PV + *offset) pointed to. The dsv will be
11501 concatenated the decoded UTF-8 string from ssv. Decoding will terminate
11502 when the string tstr appears in decoding output or the input ends on
11503 the PV of the ssv. The value which the offset points will be modified
11504 to the last input position on the ssv.
11506 Returns TRUE if the terminator was found, else returns FALSE.
11511 Perl_sv_cat_decode(pTHX_ SV *dsv, SV *encoding,
11512 SV *ssv, int *offset, char *tstr, int tlen)
11515 if (SvPOK(ssv) && SvPOK(dsv) && SvROK(encoding) && offset) {
11526 XPUSHs(offsv = sv_2mortal(newSViv(*offset)));
11527 XPUSHs(sv_2mortal(newSVpvn(tstr, tlen)));
11529 call_method("cat_decode", G_SCALAR);
11531 ret = SvTRUE(TOPs);
11532 *offset = SvIV(offsv);
11538 Perl_croak(aTHX_ "Invalid argument to sv_cat_decode");