3 * Copyright (C) 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999,
4 * 2000, 2001, 2002, 2003, 2004, 2005, by Larry Wall and others
6 * You may distribute under the terms of either the GNU General Public
7 * License or the Artistic License, as specified in the README file.
9 * "I wonder what the Entish is for 'yes' and 'no'," he thought.
12 * This file contains the code that creates, manipulates and destroys
13 * scalar values (SVs). The other types (AV, HV, GV, etc.) reuse the
14 * structure of an SV, so their creation and destruction is handled
15 * here; higher-level functions are in av.c, hv.c, and so on. Opcode
16 * level functions (eg. substr, split, join) for each of the types are
28 /* Missing proto on LynxOS */
29 char *gconvert(double, int, int, char *);
32 #ifdef PERL_UTF8_CACHE_ASSERT
33 /* The cache element 0 is the Unicode offset;
34 * the cache element 1 is the byte offset of the element 0;
35 * the cache element 2 is the Unicode length of the substring;
36 * the cache element 3 is the byte length of the substring;
37 * The checking of the substring side would be good
38 * but substr() has enough code paths to make my head spin;
39 * if adding more checks watch out for the following tests:
40 * t/op/index.t t/op/length.t t/op/pat.t t/op/substr.t
41 * lib/utf8.t lib/Unicode/Collate/t/index.t
44 #define ASSERT_UTF8_CACHE(cache) \
45 STMT_START { if (cache) { assert((cache)[0] <= (cache)[1]); } } STMT_END
47 #define ASSERT_UTF8_CACHE(cache) NOOP
50 #ifdef PERL_OLD_COPY_ON_WRITE
51 #define SV_COW_NEXT_SV(sv) INT2PTR(SV *,SvUVX(sv))
52 #define SV_COW_NEXT_SV_SET(current,next) SvUV_set(current, PTR2UV(next))
53 /* This is a pessimistic view. Scalar must be purely a read-write PV to copy-
57 /* ============================================================================
59 =head1 Allocation and deallocation of SVs.
61 An SV (or AV, HV, etc.) is allocated in two parts: the head (struct sv,
62 av, hv...) contains type and reference count information, as well as a
63 pointer to the body (struct xrv, xpv, xpviv...), which contains fields
64 specific to each type.
66 In all but the most memory-paranoid configuations (ex: PURIFY), this
67 allocation is done using arenas, which by default are approximately 4K
68 chunks of memory parcelled up into N heads or bodies (of same size).
69 Sv-bodies are allocated by their sv-type, guaranteeing size
70 consistency needed to allocate safely from arrays.
72 The first slot in each arena is reserved, and is used to hold a link
73 to the next arena. In the case of heads, the unused first slot also
74 contains some flags and a note of the number of slots. Snaked through
75 each arena chain is a linked list of free items; when this becomes
76 empty, an extra arena is allocated and divided up into N items which
77 are threaded into the free list.
79 The following global variables are associated with arenas:
81 PL_sv_arenaroot pointer to list of SV arenas
82 PL_sv_root pointer to list of free SV structures
84 PL_body_arenaroots[] array of pointers to list of arenas, 1 per svtype
85 PL_body_roots[] array of pointers to list of free bodies of svtype
86 arrays are indexed by the svtype needed
88 Note that some of the larger and more rarely used body types (eg
89 xpvio) are not allocated using arenas, but are instead just
90 malloc()/free()ed as required.
92 In addition, a few SV heads are not allocated from an arena, but are
93 instead directly created as static or auto variables, eg PL_sv_undef.
94 The size of arenas can be changed from the default by setting
95 PERL_ARENA_SIZE appropriately at compile time.
97 The SV arena serves the secondary purpose of allowing still-live SVs
98 to be located and destroyed during final cleanup.
100 At the lowest level, the macros new_SV() and del_SV() grab and free
101 an SV head. (If debugging with -DD, del_SV() calls the function S_del_sv()
102 to return the SV to the free list with error checking.) new_SV() calls
103 more_sv() / sv_add_arena() to add an extra arena if the free list is empty.
104 SVs in the free list have their SvTYPE field set to all ones.
106 Similarly, there are macros new_XIV()/del_XIV(), new_XNV()/del_XNV() etc
107 that allocate and return individual body types. Normally these are mapped
108 to the arena-manipulating functions new_xiv()/del_xiv() etc, but may be
109 instead mapped directly to malloc()/free() if PURIFY is defined. The
110 new/del functions remove from, or add to, the appropriate PL_foo_root
111 list, and call more_xiv() etc to add a new arena if the list is empty.
113 At the time of very final cleanup, sv_free_arenas() is called from
114 perl_destruct() to physically free all the arenas allocated since the
115 start of the interpreter.
117 Manipulation of any of the PL_*root pointers is protected by enclosing
118 LOCK_SV_MUTEX; ... UNLOCK_SV_MUTEX calls which should Do the Right Thing
119 if threads are enabled.
121 The function visit() scans the SV arenas list, and calls a specified
122 function for each SV it finds which is still live - ie which has an SvTYPE
123 other than all 1's, and a non-zero SvREFCNT. visit() is used by the
124 following functions (specified as [function that calls visit()] / [function
125 called by visit() for each SV]):
127 sv_report_used() / do_report_used()
128 dump all remaining SVs (debugging aid)
130 sv_clean_objs() / do_clean_objs(),do_clean_named_objs()
131 Attempt to free all objects pointed to by RVs,
132 and, unless DISABLE_DESTRUCTOR_KLUDGE is defined,
133 try to do the same for all objects indirectly
134 referenced by typeglobs too. Called once from
135 perl_destruct(), prior to calling sv_clean_all()
138 sv_clean_all() / do_clean_all()
139 SvREFCNT_dec(sv) each remaining SV, possibly
140 triggering an sv_free(). It also sets the
141 SVf_BREAK flag on the SV to indicate that the
142 refcnt has been artificially lowered, and thus
143 stopping sv_free() from giving spurious warnings
144 about SVs which unexpectedly have a refcnt
145 of zero. called repeatedly from perl_destruct()
146 until there are no SVs left.
148 =head2 Arena allocator API Summary
150 Private API to rest of sv.c
154 new_XIV(), del_XIV(),
155 new_XNV(), del_XNV(),
160 sv_report_used(), sv_clean_objs(), sv_clean_all(), sv_free_arenas()
165 ============================================================================ */
170 * "A time to plant, and a time to uproot what was planted..."
174 * nice_chunk and nice_chunk size need to be set
175 * and queried under the protection of sv_mutex
178 Perl_offer_nice_chunk(pTHX_ void *chunk, U32 chunk_size)
183 new_chunk = (void *)(chunk);
184 new_chunk_size = (chunk_size);
185 if (new_chunk_size > PL_nice_chunk_size) {
186 Safefree(PL_nice_chunk);
187 PL_nice_chunk = (char *) new_chunk;
188 PL_nice_chunk_size = new_chunk_size;
195 #ifdef DEBUG_LEAKING_SCALARS
196 # define FREE_SV_DEBUG_FILE(sv) Safefree((sv)->sv_debug_file)
198 # define FREE_SV_DEBUG_FILE(sv)
202 # define SvARENA_CHAIN(sv) ((sv)->sv_u.svu_rv)
203 /* Whilst I'd love to do this, it seems that things like to check on
205 # define POSION_SV_HEAD(sv) Poison(sv, 1, struct STRUCT_SV)
207 # define POSION_SV_HEAD(sv) Poison(&SvANY(sv), 1, void *), \
208 Poison(&SvREFCNT(sv), 1, U32)
210 # define SvARENA_CHAIN(sv) SvANY(sv)
211 # define POSION_SV_HEAD(sv)
214 #define plant_SV(p) \
216 FREE_SV_DEBUG_FILE(p); \
218 SvARENA_CHAIN(p) = (void *)PL_sv_root; \
219 SvFLAGS(p) = SVTYPEMASK; \
224 /* sv_mutex must be held while calling uproot_SV() */
225 #define uproot_SV(p) \
228 PL_sv_root = (SV*)SvARENA_CHAIN(p); \
233 /* make some more SVs by adding another arena */
235 /* sv_mutex must be held while calling more_sv() */
242 sv_add_arena(PL_nice_chunk, PL_nice_chunk_size, 0);
243 PL_nice_chunk = Nullch;
244 PL_nice_chunk_size = 0;
247 char *chunk; /* must use New here to match call to */
248 Newx(chunk,PERL_ARENA_SIZE,char); /* Safefree() in sv_free_arenas() */
249 sv_add_arena(chunk, PERL_ARENA_SIZE, 0);
255 /* new_SV(): return a new, empty SV head */
257 #ifdef DEBUG_LEAKING_SCALARS
258 /* provide a real function for a debugger to play with */
268 sv = S_more_sv(aTHX);
273 sv->sv_debug_optype = PL_op ? PL_op->op_type : 0;
274 sv->sv_debug_line = (U16) ((PL_copline == NOLINE) ?
275 (PL_curcop ? CopLINE(PL_curcop) : 0) : PL_copline);
276 sv->sv_debug_inpad = 0;
277 sv->sv_debug_cloned = 0;
278 sv->sv_debug_file = PL_curcop ? savepv(CopFILE(PL_curcop)): NULL;
282 # define new_SV(p) (p)=S_new_SV(aTHX)
291 (p) = S_more_sv(aTHX); \
300 /* del_SV(): return an empty SV head to the free list */
315 S_del_sv(pTHX_ SV *p)
320 for (sva = PL_sv_arenaroot; sva; sva = (SV *) SvANY(sva)) {
321 const SV * const sv = sva + 1;
322 const SV * const svend = &sva[SvREFCNT(sva)];
323 if (p >= sv && p < svend) {
329 if (ckWARN_d(WARN_INTERNAL))
330 Perl_warner(aTHX_ packWARN(WARN_INTERNAL),
331 "Attempt to free non-arena SV: 0x%"UVxf
332 pTHX__FORMAT, PTR2UV(p) pTHX__VALUE);
339 #else /* ! DEBUGGING */
341 #define del_SV(p) plant_SV(p)
343 #endif /* DEBUGGING */
347 =head1 SV Manipulation Functions
349 =for apidoc sv_add_arena
351 Given a chunk of memory, link it to the head of the list of arenas,
352 and split it into a list of free SVs.
358 Perl_sv_add_arena(pTHX_ char *ptr, U32 size, U32 flags)
360 SV* const sva = (SV*)ptr;
364 /* The first SV in an arena isn't an SV. */
365 SvANY(sva) = (void *) PL_sv_arenaroot; /* ptr to next arena */
366 SvREFCNT(sva) = size / sizeof(SV); /* number of SV slots */
367 SvFLAGS(sva) = flags; /* FAKE if not to be freed */
369 PL_sv_arenaroot = sva;
370 PL_sv_root = sva + 1;
372 svend = &sva[SvREFCNT(sva) - 1];
375 SvARENA_CHAIN(sv) = (void *)(SV*)(sv + 1);
379 /* Must always set typemask because it's awlays checked in on cleanup
380 when the arenas are walked looking for objects. */
381 SvFLAGS(sv) = SVTYPEMASK;
384 SvARENA_CHAIN(sv) = 0;
388 SvFLAGS(sv) = SVTYPEMASK;
391 /* visit(): call the named function for each non-free SV in the arenas
392 * whose flags field matches the flags/mask args. */
395 S_visit(pTHX_ SVFUNC_t f, U32 flags, U32 mask)
400 for (sva = PL_sv_arenaroot; sva; sva = (SV*)SvANY(sva)) {
401 register const SV * const svend = &sva[SvREFCNT(sva)];
403 for (sv = sva + 1; sv < svend; ++sv) {
404 if (SvTYPE(sv) != SVTYPEMASK
405 && (sv->sv_flags & mask) == flags
418 /* called by sv_report_used() for each live SV */
421 do_report_used(pTHX_ SV *sv)
423 if (SvTYPE(sv) != SVTYPEMASK) {
424 PerlIO_printf(Perl_debug_log, "****\n");
431 =for apidoc sv_report_used
433 Dump the contents of all SVs not yet freed. (Debugging aid).
439 Perl_sv_report_used(pTHX)
442 visit(do_report_used, 0, 0);
446 /* called by sv_clean_objs() for each live SV */
449 do_clean_objs(pTHX_ SV *ref)
452 SV * const target = SvRV(ref);
453 if (SvOBJECT(target)) {
454 DEBUG_D((PerlIO_printf(Perl_debug_log, "Cleaning object ref:\n "), sv_dump(ref)));
455 if (SvWEAKREF(ref)) {
456 sv_del_backref(target, ref);
462 SvREFCNT_dec(target);
467 /* XXX Might want to check arrays, etc. */
470 /* called by sv_clean_objs() for each live SV */
472 #ifndef DISABLE_DESTRUCTOR_KLUDGE
474 do_clean_named_objs(pTHX_ SV *sv)
476 if (SvTYPE(sv) == SVt_PVGV && GvGP(sv)) {
478 #ifdef PERL_DONT_CREATE_GVSV
481 SvOBJECT(GvSV(sv))) ||
482 (GvAV(sv) && SvOBJECT(GvAV(sv))) ||
483 (GvHV(sv) && SvOBJECT(GvHV(sv))) ||
484 (GvIO(sv) && SvOBJECT(GvIO(sv))) ||
485 (GvCV(sv) && SvOBJECT(GvCV(sv))) )
487 DEBUG_D((PerlIO_printf(Perl_debug_log, "Cleaning named glob object:\n "), sv_dump(sv)));
488 SvFLAGS(sv) |= SVf_BREAK;
496 =for apidoc sv_clean_objs
498 Attempt to destroy all objects not yet freed
504 Perl_sv_clean_objs(pTHX)
506 PL_in_clean_objs = TRUE;
507 visit(do_clean_objs, SVf_ROK, SVf_ROK);
508 #ifndef DISABLE_DESTRUCTOR_KLUDGE
509 /* some barnacles may yet remain, clinging to typeglobs */
510 visit(do_clean_named_objs, SVt_PVGV, SVTYPEMASK);
512 PL_in_clean_objs = FALSE;
515 /* called by sv_clean_all() for each live SV */
518 do_clean_all(pTHX_ SV *sv)
520 DEBUG_D((PerlIO_printf(Perl_debug_log, "Cleaning loops: SV at 0x%"UVxf"\n", PTR2UV(sv)) ));
521 SvFLAGS(sv) |= SVf_BREAK;
522 if (PL_comppad == (AV*)sv) {
524 PL_curpad = Null(SV**);
530 =for apidoc sv_clean_all
532 Decrement the refcnt of each remaining SV, possibly triggering a
533 cleanup. This function may have to be called multiple times to free
534 SVs which are in complex self-referential hierarchies.
540 Perl_sv_clean_all(pTHX)
543 PL_in_clean_all = TRUE;
544 cleaned = visit(do_clean_all, 0,0);
545 PL_in_clean_all = FALSE;
550 S_free_arena(pTHX_ void **root) {
552 void ** const next = *(void **)root;
559 =for apidoc sv_free_arenas
561 Deallocate the memory used by all arenas. Note that all the individual SV
562 heads and bodies within the arenas must already have been freed.
566 #define free_arena(name) \
568 S_free_arena(aTHX_ (void**) PL_ ## name ## _arenaroot); \
569 PL_ ## name ## _arenaroot = 0; \
570 PL_ ## name ## _root = 0; \
574 Perl_sv_free_arenas(pTHX)
580 /* Free arenas here, but be careful about fake ones. (We assume
581 contiguity of the fake ones with the corresponding real ones.) */
583 for (sva = PL_sv_arenaroot; sva; sva = svanext) {
584 svanext = (SV*) SvANY(sva);
585 while (svanext && SvFAKE(svanext))
586 svanext = (SV*) SvANY(svanext);
592 for (i=0; i<SVt_LAST; i++) {
593 S_free_arena(aTHX_ (void**) PL_body_arenaroots[i]);
594 PL_body_arenaroots[i] = 0;
595 PL_body_roots[i] = 0;
598 Safefree(PL_nice_chunk);
599 PL_nice_chunk = Nullch;
600 PL_nice_chunk_size = 0;
606 Here are mid-level routines that manage the allocation of bodies out
607 of the various arenas. There are 5 kinds of arenas:
609 1. SV-head arenas, which are discussed and handled above
610 2. regular body arenas
611 3. arenas for reduced-size bodies
613 5. pte arenas (thread related)
615 Arena types 2 & 3 are chained by body-type off an array of
616 arena-root pointers, which is indexed by svtype. Some of the
617 larger/less used body types are malloced singly, since a large
618 unused block of them is wasteful. Also, several svtypes dont have
619 bodies; the data fits into the sv-head itself. The arena-root
620 pointer thus has a few unused root-pointers (which may be hijacked
621 later for arena types 4,5)
623 3 differs from 2 as an optimization; some body types have several
624 unused fields in the front of the structure (which are kept in-place
625 for consistency). These bodies can be allocated in smaller chunks,
626 because the leading fields arent accessed. Pointers to such bodies
627 are decremented to point at the unused 'ghost' memory, knowing that
628 the pointers are used with offsets to the real memory.
630 HE, HEK arenas are managed separately, with separate code, but may
631 be merge-able later..
633 PTE arenas are not sv-bodies, but they share these mid-level
634 mechanics, so are considered here. The new mid-level mechanics rely
635 on the sv_type of the body being allocated, so we just reserve one
636 of the unused body-slots for PTEs, then use it in those (2) PTE
637 contexts below (line ~10k)
641 S_more_bodies (pTHX_ size_t size, svtype sv_type)
643 void ** const arena_root = &PL_body_arenaroots[sv_type];
644 void ** const root = &PL_body_roots[sv_type];
647 const size_t count = PERL_ARENA_SIZE / size;
649 Newx(start, count*size, char);
650 *((void **) start) = *arena_root;
651 *arena_root = (void *)start;
653 end = start + (count-1) * size;
655 /* The initial slot is used to link the arenas together, so it isn't to be
656 linked into the list of ready-to-use bodies. */
660 *root = (void *)start;
662 while (start < end) {
663 char * const next = start + size;
664 *(void**) start = (void *)next;
672 /* grab a new thing from the free list, allocating more if necessary */
674 /* 1st, the inline version */
676 #define new_body_inline(xpv, size, sv_type) \
678 void ** const r3wt = &PL_body_roots[sv_type]; \
680 xpv = *((void **)(r3wt)) \
681 ? *((void **)(r3wt)) : S_more_bodies(aTHX_ size, sv_type); \
682 *(r3wt) = *(void**)(xpv); \
686 /* now use the inline version in the proper function */
690 /* This isn't being used with -DPURIFY, so don't declare it. Otherwise
691 compilers issue warnings. */
694 S_new_body(pTHX_ size_t size, svtype sv_type)
697 new_body_inline(xpv, size, sv_type);
703 /* return a thing to the free list */
705 #define del_body(thing, root) \
707 void ** const thing_copy = (void **)thing;\
709 *thing_copy = *root; \
710 *root = (void*)thing_copy; \
715 Revisiting type 3 arenas, there are 4 body-types which have some
716 members that are never accessed. They are XPV, XPVIV, XPVAV,
717 XPVHV, which have corresponding types: xpv_allocated,
718 xpviv_allocated, xpvav_allocated, xpvhv_allocated,
720 For these types, the arenas are carved up into *_allocated size
721 chunks, we thus avoid wasted memory for those unaccessed members.
722 When bodies are allocated, we adjust the pointer back in memory by
723 the size of the bit not allocated, so it's as if we allocated the
724 full structure. (But things will all go boom if you write to the
725 part that is "not there", because you'll be overwriting the last
726 members of the preceding structure in memory.)
728 We calculate the correction using the STRUCT_OFFSET macro. For example, if
729 xpv_allocated is the same structure as XPV then the two OFFSETs sum to zero,
730 and the pointer is unchanged. If the allocated structure is smaller (no
731 initial NV actually allocated) then the net effect is to subtract the size
732 of the NV from the pointer, to return a new pointer as if an initial NV were
735 This is the same trick as was used for NV and IV bodies. Ironically it
736 doesn't need to be used for NV bodies any more, because NV is now at the
737 start of the structure. IV bodies don't need it either, because they are
738 no longer allocated. */
740 /* The following 2 arrays hide the above details in a pair of
741 lookup-tables, allowing us to be body-type agnostic.
743 size maps svtype to its body's allocated size.
744 offset maps svtype to the body-pointer adjustment needed
746 NB: elements in latter are 0 or <0, and are added during
747 allocation, and subtracted during deallocation. It may be clearer
748 to invert the values, and call it shrinkage_by_svtype.
751 struct body_details {
752 size_t size; /* Size to allocate */
753 size_t copy; /* Size of structure to copy (may be shorter) */
755 bool cant_upgrade; /* Can upgrade this type */
756 bool zero_nv; /* zero the NV when upgrading from this */
757 bool arena; /* Allocated from an arena */
764 /* With -DPURFIY we allocate everything directly, and don't use arenas.
765 This seems a rather elegant way to simplify some of the code below. */
766 #define HASARENA FALSE
768 #define HASARENA TRUE
770 #define NOARENA FALSE
772 /* A macro to work out the offset needed to subtract from a pointer to (say)
779 to make its members accessible via a pointer to (say)
789 #define relative_STRUCT_OFFSET(longer, shorter, member) \
790 (STRUCT_OFFSET(shorter, member) - STRUCT_OFFSET(longer, member))
792 /* Calculate the length to copy. Specifically work out the length less any
793 final padding the compiler needed to add. See the comment in sv_upgrade
794 for why copying the padding proved to be a bug. */
796 #define copy_length(type, last_member) \
797 STRUCT_OFFSET(type, last_member) \
798 + sizeof (((type*)SvANY((SV*)0))->last_member)
800 static const struct body_details bodies_by_type[] = {
801 {0, 0, 0, FALSE, NONV, NOARENA},
802 /* IVs are in the head, so the allocation size is 0 */
803 {0, sizeof(IV), STRUCT_OFFSET(XPVIV, xiv_iv), FALSE, NONV, NOARENA},
804 /* 8 bytes on most ILP32 with IEEE doubles */
805 {sizeof(NV), sizeof(NV), 0, FALSE, HADNV, HASARENA},
806 /* RVs are in the head now */
807 /* However, this slot is overloaded and used by the pte */
808 {0, 0, 0, FALSE, NONV, NOARENA},
809 /* 8 bytes on most ILP32 with IEEE doubles */
810 {sizeof(xpv_allocated),
811 copy_length(XPV, xpv_len)
812 + relative_STRUCT_OFFSET(XPV, xpv_allocated, xpv_cur),
813 - relative_STRUCT_OFFSET(XPV, xpv_allocated, xpv_cur),
814 FALSE, NONV, HASARENA},
816 {sizeof(xpviv_allocated),
817 copy_length(XPVIV, xiv_u)
818 + relative_STRUCT_OFFSET(XPVIV, xpviv_allocated, xpv_cur),
819 - relative_STRUCT_OFFSET(XPVIV, xpviv_allocated, xpv_cur),
820 FALSE, NONV, HASARENA},
822 {sizeof(XPVNV), copy_length(XPVNV, xiv_u), 0, FALSE, HADNV, HASARENA},
824 {sizeof(XPVMG), copy_length(XPVMG, xmg_stash), 0, FALSE, HADNV, HASARENA},
826 {sizeof(XPVBM), sizeof(XPVBM), 0, TRUE, HADNV, HASARENA},
828 {sizeof(XPVGV), sizeof(XPVGV), 0, TRUE, HADNV, HASARENA},
830 {sizeof(XPVLV), sizeof(XPVLV), 0, TRUE, HADNV, HASARENA},
832 {sizeof(xpvav_allocated),
833 copy_length(XPVAV, xmg_stash)
834 + relative_STRUCT_OFFSET(XPVAV, xpvav_allocated, xav_fill),
835 - relative_STRUCT_OFFSET(XPVAV, xpvav_allocated, xav_fill),
836 TRUE, HADNV, HASARENA},
838 {sizeof(xpvhv_allocated),
839 copy_length(XPVHV, xmg_stash)
840 + relative_STRUCT_OFFSET(XPVHV, xpvhv_allocated, xhv_fill),
841 - relative_STRUCT_OFFSET(XPVHV, xpvhv_allocated, xhv_fill),
842 TRUE, HADNV, HASARENA},
844 {sizeof(XPVCV), sizeof(XPVCV), 0, TRUE, HADNV, HASARENA},
846 {sizeof(XPVFM), sizeof(XPVFM), 0, TRUE, HADNV, NOARENA},
848 {sizeof(XPVIO), sizeof(XPVIO), 0, TRUE, HADNV, NOARENA}
851 #define new_body_type(sv_type) \
852 (void *)((char *)S_new_body(aTHX_ bodies_by_type[sv_type].size, sv_type)\
853 - bodies_by_type[sv_type].offset)
855 #define del_body_type(p, sv_type) \
856 del_body(p, &PL_body_roots[sv_type])
859 #define new_body_allocated(sv_type) \
860 (void *)((char *)S_new_body(aTHX_ bodies_by_type[sv_type].size, sv_type)\
861 - bodies_by_type[sv_type].offset)
863 #define del_body_allocated(p, sv_type) \
864 del_body(p + bodies_by_type[sv_type].offset, &PL_body_roots[sv_type])
867 #define my_safemalloc(s) (void*)safemalloc(s)
868 #define my_safecalloc(s) (void*)safecalloc(s, 1)
869 #define my_safefree(p) safefree((char*)p)
873 #define new_XNV() my_safemalloc(sizeof(XPVNV))
874 #define del_XNV(p) my_safefree(p)
876 #define new_XPVNV() my_safemalloc(sizeof(XPVNV))
877 #define del_XPVNV(p) my_safefree(p)
879 #define new_XPVAV() my_safemalloc(sizeof(XPVAV))
880 #define del_XPVAV(p) my_safefree(p)
882 #define new_XPVHV() my_safemalloc(sizeof(XPVHV))
883 #define del_XPVHV(p) my_safefree(p)
885 #define new_XPVMG() my_safemalloc(sizeof(XPVMG))
886 #define del_XPVMG(p) my_safefree(p)
888 #define new_XPVGV() my_safemalloc(sizeof(XPVGV))
889 #define del_XPVGV(p) my_safefree(p)
893 #define new_XNV() new_body_type(SVt_NV)
894 #define del_XNV(p) del_body_type(p, SVt_NV)
896 #define new_XPVNV() new_body_type(SVt_PVNV)
897 #define del_XPVNV(p) del_body_type(p, SVt_PVNV)
899 #define new_XPVAV() new_body_allocated(SVt_PVAV)
900 #define del_XPVAV(p) del_body_allocated(p, SVt_PVAV)
902 #define new_XPVHV() new_body_allocated(SVt_PVHV)
903 #define del_XPVHV(p) del_body_allocated(p, SVt_PVHV)
905 #define new_XPVMG() new_body_type(SVt_PVMG)
906 #define del_XPVMG(p) del_body_type(p, SVt_PVMG)
908 #define new_XPVGV() new_body_type(SVt_PVGV)
909 #define del_XPVGV(p) del_body_type(p, SVt_PVGV)
913 /* no arena for you! */
915 #define new_NOARENA(details) \
916 my_safemalloc((details)->size + (details)->offset)
917 #define new_NOARENAZ(details) \
918 my_safecalloc((details)->size + (details)->offset)
921 =for apidoc sv_upgrade
923 Upgrade an SV to a more complex form. Generally adds a new body type to the
924 SV, then copies across as much information as possible from the old body.
925 You generally want to use the C<SvUPGRADE> macro wrapper. See also C<svtype>.
931 Perl_sv_upgrade(pTHX_ register SV *sv, U32 new_type)
935 const U32 old_type = SvTYPE(sv);
936 const struct body_details *const old_type_details
937 = bodies_by_type + old_type;
938 const struct body_details *new_type_details = bodies_by_type + new_type;
940 if (new_type != SVt_PV && SvIsCOW(sv)) {
941 sv_force_normal_flags(sv, 0);
944 if (old_type == new_type)
947 if (old_type > new_type)
948 Perl_croak(aTHX_ "sv_upgrade from type %d down to type %d",
949 (int)old_type, (int)new_type);
952 old_body = SvANY(sv);
954 /* Copying structures onto other structures that have been neatly zeroed
955 has a subtle gotcha. Consider XPVMG
957 +------+------+------+------+------+-------+-------+
958 | NV | CUR | LEN | IV | MAGIC | STASH |
959 +------+------+------+------+------+-------+-------+
962 where NVs are aligned to 8 bytes, so that sizeof that structure is
963 actually 32 bytes long, with 4 bytes of padding at the end:
965 +------+------+------+------+------+-------+-------+------+
966 | NV | CUR | LEN | IV | MAGIC | STASH | ??? |
967 +------+------+------+------+------+-------+-------+------+
968 0 4 8 12 16 20 24 28 32
970 so what happens if you allocate memory for this structure:
972 +------+------+------+------+------+-------+-------+------+------+...
973 | NV | CUR | LEN | IV | MAGIC | STASH | GP | NAME |
974 +------+------+------+------+------+-------+-------+------+------+...
975 0 4 8 12 16 20 24 28 32 36
977 zero it, then copy sizeof(XPVMG) bytes on top of it? Not quite what you
978 expect, because you copy the area marked ??? onto GP. Now, ??? may have
979 started out as zero once, but it's quite possible that it isn't. So now,
980 rather than a nicely zeroed GP, you have it pointing somewhere random.
983 (In fact, GP ends up pointing at a previous GP structure, because the
984 principle cause of the padding in XPVMG getting garbage is a copy of
985 sizeof(XPVMG) bytes from a XPVGV structure in sv_unglob)
987 So we are careful and work out the size of used parts of all the
994 if (new_type < SVt_PVIV) {
995 new_type = (new_type == SVt_NV)
996 ? SVt_PVNV : SVt_PVIV;
997 new_type_details = bodies_by_type + new_type;
1001 if (new_type < SVt_PVNV) {
1002 new_type = SVt_PVNV;
1003 new_type_details = bodies_by_type + new_type;
1009 assert(new_type > SVt_PV);
1010 assert(SVt_IV < SVt_PV);
1011 assert(SVt_NV < SVt_PV);
1018 /* Because the XPVMG of PL_mess_sv isn't allocated from the arena,
1019 there's no way that it can be safely upgraded, because perl.c
1020 expects to Safefree(SvANY(PL_mess_sv)) */
1021 assert(sv != PL_mess_sv);
1022 /* This flag bit is used to mean other things in other scalar types.
1023 Given that it only has meaning inside the pad, it shouldn't be set
1024 on anything that can get upgraded. */
1025 assert((SvFLAGS(sv) & SVpad_TYPED) == 0);
1028 if (old_type_details->cant_upgrade)
1029 Perl_croak(aTHX_ "Can't upgrade that kind of scalar");
1032 SvFLAGS(sv) &= ~SVTYPEMASK;
1033 SvFLAGS(sv) |= new_type;
1037 Perl_croak(aTHX_ "Can't upgrade to undef");
1039 assert(old_type == SVt_NULL);
1040 SvANY(sv) = (XPVIV*)((char*)&(sv->sv_u.svu_iv) - STRUCT_OFFSET(XPVIV, xiv_iv));
1044 assert(old_type == SVt_NULL);
1045 SvANY(sv) = new_XNV();
1049 assert(old_type == SVt_NULL);
1050 SvANY(sv) = &sv->sv_u.svu_rv;
1054 SvANY(sv) = new_XPVHV();
1057 HvTOTALKEYS(sv) = 0;
1062 SvANY(sv) = new_XPVAV();
1069 /* SVt_NULL isn't the only thing upgraded to AV or HV.
1070 The target created by newSVrv also is, and it can have magic.
1071 However, it never has SvPVX set.
1073 if (old_type >= SVt_RV) {
1074 assert(SvPVX_const(sv) == 0);
1077 /* Could put this in the else clause below, as PVMG must have SvPVX
1078 0 already (the assertion above) */
1079 SvPV_set(sv, (char*)0);
1081 if (old_type >= SVt_PVMG) {
1082 SvMAGIC_set(sv, ((XPVMG*)old_body)->xmg_magic);
1083 SvSTASH_set(sv, ((XPVMG*)old_body)->xmg_stash);
1092 /* XXX Is this still needed? Was it ever needed? Surely as there is
1093 no route from NV to PVIV, NOK can never be true */
1094 assert(!SvNOKp(sv));
1106 assert(new_type_details->size);
1107 /* We always allocated the full length item with PURIFY. To do this
1108 we fake things so that arena is false for all 16 types.. */
1109 if(new_type_details->arena) {
1110 /* This points to the start of the allocated area. */
1111 new_body_inline(new_body, new_type_details->size, new_type);
1112 Zero(new_body, new_type_details->size, char);
1113 new_body = ((char *)new_body) - new_type_details->offset;
1115 new_body = new_NOARENAZ(new_type_details);
1117 SvANY(sv) = new_body;
1119 if (old_type_details->copy) {
1120 Copy((char *)old_body + old_type_details->offset,
1121 (char *)new_body + old_type_details->offset,
1122 old_type_details->copy, char);
1125 #ifndef NV_ZERO_IS_ALLBITS_ZERO
1126 /* If NV 0.0 is store as all bits 0 then Zero() already creates a correct
1128 if (old_type_details->zero_nv)
1132 if (new_type == SVt_PVIO)
1133 IoPAGE_LEN(sv) = 60;
1134 if (old_type < SVt_RV)
1138 Perl_croak(aTHX_ "panic: sv_upgrade to unknown type %lu", new_type);
1141 if (old_type_details->size) {
1142 /* If the old body had an allocated size, then we need to free it. */
1144 my_safefree(old_body);
1146 del_body((void*)((char*)old_body + old_type_details->offset),
1147 &PL_body_roots[old_type]);
1153 =for apidoc sv_backoff
1155 Remove any string offset. You should normally use the C<SvOOK_off> macro
1162 Perl_sv_backoff(pTHX_ register SV *sv)
1165 assert(SvTYPE(sv) != SVt_PVHV);
1166 assert(SvTYPE(sv) != SVt_PVAV);
1168 const char * const s = SvPVX_const(sv);
1169 SvLEN_set(sv, SvLEN(sv) + SvIVX(sv));
1170 SvPV_set(sv, SvPVX(sv) - SvIVX(sv));
1172 Move(s, SvPVX(sv), SvCUR(sv)+1, char);
1174 SvFLAGS(sv) &= ~SVf_OOK;
1181 Expands the character buffer in the SV. If necessary, uses C<sv_unref> and
1182 upgrades the SV to C<SVt_PV>. Returns a pointer to the character buffer.
1183 Use the C<SvGROW> wrapper instead.
1189 Perl_sv_grow(pTHX_ register SV *sv, register STRLEN newlen)
1193 #ifdef HAS_64K_LIMIT
1194 if (newlen >= 0x10000) {
1195 PerlIO_printf(Perl_debug_log,
1196 "Allocation too large: %"UVxf"\n", (UV)newlen);
1199 #endif /* HAS_64K_LIMIT */
1202 if (SvTYPE(sv) < SVt_PV) {
1203 sv_upgrade(sv, SVt_PV);
1204 s = SvPVX_mutable(sv);
1206 else if (SvOOK(sv)) { /* pv is offset? */
1208 s = SvPVX_mutable(sv);
1209 if (newlen > SvLEN(sv))
1210 newlen += 10 * (newlen - SvCUR(sv)); /* avoid copy each time */
1211 #ifdef HAS_64K_LIMIT
1212 if (newlen >= 0x10000)
1217 s = SvPVX_mutable(sv);
1219 if (newlen > SvLEN(sv)) { /* need more room? */
1220 newlen = PERL_STRLEN_ROUNDUP(newlen);
1221 if (SvLEN(sv) && s) {
1223 const STRLEN l = malloced_size((void*)SvPVX_const(sv));
1229 s = saferealloc(s, newlen);
1232 s = safemalloc(newlen);
1233 if (SvPVX_const(sv) && SvCUR(sv)) {
1234 Move(SvPVX_const(sv), s, (newlen < SvCUR(sv)) ? newlen : SvCUR(sv), char);
1238 SvLEN_set(sv, newlen);
1244 =for apidoc sv_setiv
1246 Copies an integer into the given SV, upgrading first if necessary.
1247 Does not handle 'set' magic. See also C<sv_setiv_mg>.
1253 Perl_sv_setiv(pTHX_ register SV *sv, IV i)
1255 SV_CHECK_THINKFIRST_COW_DROP(sv);
1256 switch (SvTYPE(sv)) {
1258 sv_upgrade(sv, SVt_IV);
1261 sv_upgrade(sv, SVt_PVNV);
1265 sv_upgrade(sv, SVt_PVIV);
1274 Perl_croak(aTHX_ "Can't coerce %s to integer in %s", sv_reftype(sv,0),
1277 (void)SvIOK_only(sv); /* validate number */
1283 =for apidoc sv_setiv_mg
1285 Like C<sv_setiv>, but also handles 'set' magic.
1291 Perl_sv_setiv_mg(pTHX_ register SV *sv, IV i)
1298 =for apidoc sv_setuv
1300 Copies an unsigned integer into the given SV, upgrading first if necessary.
1301 Does not handle 'set' magic. See also C<sv_setuv_mg>.
1307 Perl_sv_setuv(pTHX_ register SV *sv, UV u)
1309 /* With these two if statements:
1310 u=1.49 s=0.52 cu=72.49 cs=10.64 scripts=270 tests=20865
1313 u=1.35 s=0.47 cu=73.45 cs=11.43 scripts=270 tests=20865
1315 If you wish to remove them, please benchmark to see what the effect is
1317 if (u <= (UV)IV_MAX) {
1318 sv_setiv(sv, (IV)u);
1327 =for apidoc sv_setuv_mg
1329 Like C<sv_setuv>, but also handles 'set' magic.
1335 Perl_sv_setuv_mg(pTHX_ register SV *sv, UV u)
1344 =for apidoc sv_setnv
1346 Copies a double into the given SV, upgrading first if necessary.
1347 Does not handle 'set' magic. See also C<sv_setnv_mg>.
1353 Perl_sv_setnv(pTHX_ register SV *sv, NV num)
1355 SV_CHECK_THINKFIRST_COW_DROP(sv);
1356 switch (SvTYPE(sv)) {
1359 sv_upgrade(sv, SVt_NV);
1364 sv_upgrade(sv, SVt_PVNV);
1373 Perl_croak(aTHX_ "Can't coerce %s to number in %s", sv_reftype(sv,0),
1377 (void)SvNOK_only(sv); /* validate number */
1382 =for apidoc sv_setnv_mg
1384 Like C<sv_setnv>, but also handles 'set' magic.
1390 Perl_sv_setnv_mg(pTHX_ register SV *sv, NV num)
1396 /* Print an "isn't numeric" warning, using a cleaned-up,
1397 * printable version of the offending string
1401 S_not_a_number(pTHX_ SV *sv)
1408 dsv = sv_2mortal(newSVpvn("", 0));
1409 pv = sv_uni_display(dsv, sv, 10, 0);
1412 const char * const limit = tmpbuf + sizeof(tmpbuf) - 8;
1413 /* each *s can expand to 4 chars + "...\0",
1414 i.e. need room for 8 chars */
1416 const char *s = SvPVX_const(sv);
1417 const char * const end = s + SvCUR(sv);
1418 for ( ; s < end && d < limit; s++ ) {
1420 if (ch & 128 && !isPRINT_LC(ch)) {
1429 else if (ch == '\r') {
1433 else if (ch == '\f') {
1437 else if (ch == '\\') {
1441 else if (ch == '\0') {
1445 else if (isPRINT_LC(ch))
1462 Perl_warner(aTHX_ packWARN(WARN_NUMERIC),
1463 "Argument \"%s\" isn't numeric in %s", pv,
1466 Perl_warner(aTHX_ packWARN(WARN_NUMERIC),
1467 "Argument \"%s\" isn't numeric", pv);
1471 =for apidoc looks_like_number
1473 Test if the content of an SV looks like a number (or is a number).
1474 C<Inf> and C<Infinity> are treated as numbers (so will not issue a
1475 non-numeric warning), even if your atof() doesn't grok them.
1481 Perl_looks_like_number(pTHX_ SV *sv)
1483 register const char *sbegin;
1487 sbegin = SvPVX_const(sv);
1490 else if (SvPOKp(sv))
1491 sbegin = SvPV_const(sv, len);
1493 return SvFLAGS(sv) & (SVf_NOK|SVp_NOK|SVf_IOK|SVp_IOK);
1494 return grok_number(sbegin, len, NULL);
1497 /* Actually, ISO C leaves conversion of UV to IV undefined, but
1498 until proven guilty, assume that things are not that bad... */
1503 As 64 bit platforms often have an NV that doesn't preserve all bits of
1504 an IV (an assumption perl has been based on to date) it becomes necessary
1505 to remove the assumption that the NV always carries enough precision to
1506 recreate the IV whenever needed, and that the NV is the canonical form.
1507 Instead, IV/UV and NV need to be given equal rights. So as to not lose
1508 precision as a side effect of conversion (which would lead to insanity
1509 and the dragon(s) in t/op/numconvert.t getting very angry) the intent is
1510 1) to distinguish between IV/UV/NV slots that have cached a valid
1511 conversion where precision was lost and IV/UV/NV slots that have a
1512 valid conversion which has lost no precision
1513 2) to ensure that if a numeric conversion to one form is requested that
1514 would lose precision, the precise conversion (or differently
1515 imprecise conversion) is also performed and cached, to prevent
1516 requests for different numeric formats on the same SV causing
1517 lossy conversion chains. (lossless conversion chains are perfectly
1522 SvIOKp is true if the IV slot contains a valid value
1523 SvIOK is true only if the IV value is accurate (UV if SvIOK_UV true)
1524 SvNOKp is true if the NV slot contains a valid value
1525 SvNOK is true only if the NV value is accurate
1528 while converting from PV to NV, check to see if converting that NV to an
1529 IV(or UV) would lose accuracy over a direct conversion from PV to
1530 IV(or UV). If it would, cache both conversions, return NV, but mark
1531 SV as IOK NOKp (ie not NOK).
1533 While converting from PV to IV, check to see if converting that IV to an
1534 NV would lose accuracy over a direct conversion from PV to NV. If it
1535 would, cache both conversions, flag similarly.
1537 Before, the SV value "3.2" could become NV=3.2 IV=3 NOK, IOK quite
1538 correctly because if IV & NV were set NV *always* overruled.
1539 Now, "3.2" will become NV=3.2 IV=3 NOK, IOKp, because the flag's meaning
1540 changes - now IV and NV together means that the two are interchangeable:
1541 SvIVX == (IV) SvNVX && SvNVX == (NV) SvIVX;
1543 The benefit of this is that operations such as pp_add know that if
1544 SvIOK is true for both left and right operands, then integer addition
1545 can be used instead of floating point (for cases where the result won't
1546 overflow). Before, floating point was always used, which could lead to
1547 loss of precision compared with integer addition.
1549 * making IV and NV equal status should make maths accurate on 64 bit
1551 * may speed up maths somewhat if pp_add and friends start to use
1552 integers when possible instead of fp. (Hopefully the overhead in
1553 looking for SvIOK and checking for overflow will not outweigh the
1554 fp to integer speedup)
1555 * will slow down integer operations (callers of SvIV) on "inaccurate"
1556 values, as the change from SvIOK to SvIOKp will cause a call into
1557 sv_2iv each time rather than a macro access direct to the IV slot
1558 * should speed up number->string conversion on integers as IV is
1559 favoured when IV and NV are equally accurate
1561 ####################################################################
1562 You had better be using SvIOK_notUV if you want an IV for arithmetic:
1563 SvIOK is true if (IV or UV), so you might be getting (IV)SvUV.
1564 On the other hand, SvUOK is true iff UV.
1565 ####################################################################
1567 Your mileage will vary depending your CPU's relative fp to integer
1571 #ifndef NV_PRESERVES_UV
1572 # define IS_NUMBER_UNDERFLOW_IV 1
1573 # define IS_NUMBER_UNDERFLOW_UV 2
1574 # define IS_NUMBER_IV_AND_UV 2
1575 # define IS_NUMBER_OVERFLOW_IV 4
1576 # define IS_NUMBER_OVERFLOW_UV 5
1578 /* sv_2iuv_non_preserve(): private routine for use by sv_2iv() and sv_2uv() */
1580 /* For sv_2nv these three cases are "SvNOK and don't bother casting" */
1582 S_sv_2iuv_non_preserve(pTHX_ register SV *sv, I32 numtype)
1584 DEBUG_c(PerlIO_printf(Perl_debug_log,"sv_2iuv_non '%s', IV=0x%"UVxf" NV=%"NVgf" inttype=%"UVXf"\n", SvPVX_const(sv), SvIVX(sv), SvNVX(sv), (UV)numtype));
1585 if (SvNVX(sv) < (NV)IV_MIN) {
1586 (void)SvIOKp_on(sv);
1588 SvIV_set(sv, IV_MIN);
1589 return IS_NUMBER_UNDERFLOW_IV;
1591 if (SvNVX(sv) > (NV)UV_MAX) {
1592 (void)SvIOKp_on(sv);
1595 SvUV_set(sv, UV_MAX);
1596 return IS_NUMBER_OVERFLOW_UV;
1598 (void)SvIOKp_on(sv);
1600 /* Can't use strtol etc to convert this string. (See truth table in
1602 if (SvNVX(sv) <= (UV)IV_MAX) {
1603 SvIV_set(sv, I_V(SvNVX(sv)));
1604 if ((NV)(SvIVX(sv)) == SvNVX(sv)) {
1605 SvIOK_on(sv); /* Integer is precise. NOK, IOK */
1607 /* Integer is imprecise. NOK, IOKp */
1609 return SvNVX(sv) < 0 ? IS_NUMBER_UNDERFLOW_UV : IS_NUMBER_IV_AND_UV;
1612 SvUV_set(sv, U_V(SvNVX(sv)));
1613 if ((NV)(SvUVX(sv)) == SvNVX(sv)) {
1614 if (SvUVX(sv) == UV_MAX) {
1615 /* As we know that NVs don't preserve UVs, UV_MAX cannot
1616 possibly be preserved by NV. Hence, it must be overflow.
1618 return IS_NUMBER_OVERFLOW_UV;
1620 SvIOK_on(sv); /* Integer is precise. NOK, UOK */
1622 /* Integer is imprecise. NOK, IOKp */
1624 return IS_NUMBER_OVERFLOW_IV;
1626 #endif /* !NV_PRESERVES_UV*/
1629 S_sv_2iuv_common(pTHX_ SV *sv) {
1631 /* erm. not sure. *should* never get NOKp (without NOK) from sv_2nv
1632 * without also getting a cached IV/UV from it at the same time
1633 * (ie PV->NV conversion should detect loss of accuracy and cache
1634 * IV or UV at same time to avoid this. */
1635 /* IV-over-UV optimisation - choose to cache IV if possible */
1637 if (SvTYPE(sv) == SVt_NV)
1638 sv_upgrade(sv, SVt_PVNV);
1640 (void)SvIOKp_on(sv); /* Must do this first, to clear any SvOOK */
1641 /* < not <= as for NV doesn't preserve UV, ((NV)IV_MAX+1) will almost
1642 certainly cast into the IV range at IV_MAX, whereas the correct
1643 answer is the UV IV_MAX +1. Hence < ensures that dodgy boundary
1645 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
1646 SvIV_set(sv, I_V(SvNVX(sv)));
1647 if (SvNVX(sv) == (NV) SvIVX(sv)
1648 #ifndef NV_PRESERVES_UV
1649 && (((UV)1 << NV_PRESERVES_UV_BITS) >
1650 (UV)(SvIVX(sv) > 0 ? SvIVX(sv) : -SvIVX(sv)))
1651 /* Don't flag it as "accurately an integer" if the number
1652 came from a (by definition imprecise) NV operation, and
1653 we're outside the range of NV integer precision */
1656 SvIOK_on(sv); /* Can this go wrong with rounding? NWC */
1657 DEBUG_c(PerlIO_printf(Perl_debug_log,
1658 "0x%"UVxf" iv(%"NVgf" => %"IVdf") (precise)\n",
1664 /* IV not precise. No need to convert from PV, as NV
1665 conversion would already have cached IV if it detected
1666 that PV->IV would be better than PV->NV->IV
1667 flags already correct - don't set public IOK. */
1668 DEBUG_c(PerlIO_printf(Perl_debug_log,
1669 "0x%"UVxf" iv(%"NVgf" => %"IVdf") (imprecise)\n",
1674 /* Can the above go wrong if SvIVX == IV_MIN and SvNVX < IV_MIN,
1675 but the cast (NV)IV_MIN rounds to a the value less (more
1676 negative) than IV_MIN which happens to be equal to SvNVX ??
1677 Analogous to 0xFFFFFFFFFFFFFFFF rounding up to NV (2**64) and
1678 NV rounding back to 0xFFFFFFFFFFFFFFFF, so UVX == UV(NVX) and
1679 (NV)UVX == NVX are both true, but the values differ. :-(
1680 Hopefully for 2s complement IV_MIN is something like
1681 0x8000000000000000 which will be exact. NWC */
1684 SvUV_set(sv, U_V(SvNVX(sv)));
1686 (SvNVX(sv) == (NV) SvUVX(sv))
1687 #ifndef NV_PRESERVES_UV
1688 /* Make sure it's not 0xFFFFFFFFFFFFFFFF */
1689 /*&& (SvUVX(sv) != UV_MAX) irrelevant with code below */
1690 && (((UV)1 << NV_PRESERVES_UV_BITS) > SvUVX(sv))
1691 /* Don't flag it as "accurately an integer" if the number
1692 came from a (by definition imprecise) NV operation, and
1693 we're outside the range of NV integer precision */
1698 DEBUG_c(PerlIO_printf(Perl_debug_log,
1699 "0x%"UVxf" 2iv(%"UVuf" => %"IVdf") (as unsigned)\n",
1705 else if (SvPOKp(sv) && SvLEN(sv)) {
1707 const int numtype = grok_number(SvPVX_const(sv), SvCUR(sv), &value);
1708 /* We want to avoid a possible problem when we cache an IV/ a UV which
1709 may be later translated to an NV, and the resulting NV is not
1710 the same as the direct translation of the initial string
1711 (eg 123.456 can shortcut to the IV 123 with atol(), but we must
1712 be careful to ensure that the value with the .456 is around if the
1713 NV value is requested in the future).
1715 This means that if we cache such an IV/a UV, we need to cache the
1716 NV as well. Moreover, we trade speed for space, and do not
1717 cache the NV if we are sure it's not needed.
1720 /* SVt_PVNV is one higher than SVt_PVIV, hence this order */
1721 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
1722 == IS_NUMBER_IN_UV) {
1723 /* It's definitely an integer, only upgrade to PVIV */
1724 if (SvTYPE(sv) < SVt_PVIV)
1725 sv_upgrade(sv, SVt_PVIV);
1727 } else if (SvTYPE(sv) < SVt_PVNV)
1728 sv_upgrade(sv, SVt_PVNV);
1730 /* If NV preserves UV then we only use the UV value if we know that
1731 we aren't going to call atof() below. If NVs don't preserve UVs
1732 then the value returned may have more precision than atof() will
1733 return, even though value isn't perfectly accurate. */
1734 if ((numtype & (IS_NUMBER_IN_UV
1735 #ifdef NV_PRESERVES_UV
1738 )) == IS_NUMBER_IN_UV) {
1739 /* This won't turn off the public IOK flag if it was set above */
1740 (void)SvIOKp_on(sv);
1742 if (!(numtype & IS_NUMBER_NEG)) {
1744 if (value <= (UV)IV_MAX) {
1745 SvIV_set(sv, (IV)value);
1747 /* it didn't overflow, and it was positive. */
1748 SvUV_set(sv, value);
1752 /* 2s complement assumption */
1753 if (value <= (UV)IV_MIN) {
1754 SvIV_set(sv, -(IV)value);
1756 /* Too negative for an IV. This is a double upgrade, but
1757 I'm assuming it will be rare. */
1758 if (SvTYPE(sv) < SVt_PVNV)
1759 sv_upgrade(sv, SVt_PVNV);
1763 SvNV_set(sv, -(NV)value);
1764 SvIV_set(sv, IV_MIN);
1768 /* For !NV_PRESERVES_UV and IS_NUMBER_IN_UV and IS_NUMBER_NOT_INT we
1769 will be in the previous block to set the IV slot, and the next
1770 block to set the NV slot. So no else here. */
1772 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
1773 != IS_NUMBER_IN_UV) {
1774 /* It wasn't an (integer that doesn't overflow the UV). */
1775 SvNV_set(sv, Atof(SvPVX_const(sv)));
1777 if (! numtype && ckWARN(WARN_NUMERIC))
1780 #if defined(USE_LONG_DOUBLE)
1781 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2iv(%" PERL_PRIgldbl ")\n",
1782 PTR2UV(sv), SvNVX(sv)));
1784 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2iv(%"NVgf")\n",
1785 PTR2UV(sv), SvNVX(sv)));
1788 #ifdef NV_PRESERVES_UV
1789 (void)SvIOKp_on(sv);
1791 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
1792 SvIV_set(sv, I_V(SvNVX(sv)));
1793 if ((NV)(SvIVX(sv)) == SvNVX(sv)) {
1796 /* Integer is imprecise. NOK, IOKp */
1798 /* UV will not work better than IV */
1800 if (SvNVX(sv) > (NV)UV_MAX) {
1802 /* Integer is inaccurate. NOK, IOKp, is UV */
1803 SvUV_set(sv, UV_MAX);
1805 SvUV_set(sv, U_V(SvNVX(sv)));
1806 /* 0xFFFFFFFFFFFFFFFF not an issue in here, NVs
1807 NV preservse UV so can do correct comparison. */
1808 if ((NV)(SvUVX(sv)) == SvNVX(sv)) {
1811 /* Integer is imprecise. NOK, IOKp, is UV */
1816 #else /* NV_PRESERVES_UV */
1817 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
1818 == (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT)) {
1819 /* The IV/UV slot will have been set from value returned by
1820 grok_number above. The NV slot has just been set using
1823 assert (SvIOKp(sv));
1825 if (((UV)1 << NV_PRESERVES_UV_BITS) >
1826 U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))) {
1827 /* Small enough to preserve all bits. */
1828 (void)SvIOKp_on(sv);
1830 SvIV_set(sv, I_V(SvNVX(sv)));
1831 if ((NV)(SvIVX(sv)) == SvNVX(sv))
1833 /* Assumption: first non-preserved integer is < IV_MAX,
1834 this NV is in the preserved range, therefore: */
1835 if (!(U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))
1837 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);
1841 0 0 already failed to read UV.
1842 0 1 already failed to read UV.
1843 1 0 you won't get here in this case. IV/UV
1844 slot set, public IOK, Atof() unneeded.
1845 1 1 already read UV.
1846 so there's no point in sv_2iuv_non_preserve() attempting
1847 to use atol, strtol, strtoul etc. */
1848 sv_2iuv_non_preserve (sv, numtype);
1851 #endif /* NV_PRESERVES_UV */
1855 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
1856 if (!PL_localizing && ckWARN(WARN_UNINITIALIZED))
1859 if (SvTYPE(sv) < SVt_IV)
1860 /* Typically the caller expects that sv_any is not NULL now. */
1861 sv_upgrade(sv, SVt_IV);
1862 /* Return 0 from the caller. */
1869 =for apidoc sv_2iv_flags
1871 Return the integer value of an SV, doing any necessary string
1872 conversion. If flags includes SV_GMAGIC, does an mg_get() first.
1873 Normally used via the C<SvIV(sv)> and C<SvIVx(sv)> macros.
1879 Perl_sv_2iv_flags(pTHX_ register SV *sv, I32 flags)
1883 if (SvGMAGICAL(sv)) {
1884 if (flags & SV_GMAGIC)
1889 return I_V(SvNVX(sv));
1891 if (SvPOKp(sv) && SvLEN(sv)) {
1894 = grok_number(SvPVX_const(sv), SvCUR(sv), &value);
1896 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
1897 == IS_NUMBER_IN_UV) {
1898 /* It's definitely an integer */
1899 if (numtype & IS_NUMBER_NEG) {
1900 if (value < (UV)IV_MIN)
1903 if (value < (UV)IV_MAX)
1908 if (ckWARN(WARN_NUMERIC))
1911 return I_V(Atof(SvPVX_const(sv)));
1914 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
1915 if (!PL_localizing && ckWARN(WARN_UNINITIALIZED))
1920 /* Else this will drop through into the SvROK case just below, which
1921 will return within the {} for all code paths. */
1923 if (SvTHINKFIRST(sv)) {
1926 SV * const tmpstr=AMG_CALLun(sv,numer);
1927 if (tmpstr && (!SvROK(tmpstr) || (SvRV(tmpstr) != SvRV(sv)))) {
1928 return SvIV(tmpstr);
1931 return PTR2IV(SvRV(sv));
1934 sv_force_normal_flags(sv, 0);
1936 if (SvREADONLY(sv) && !SvOK(sv)) {
1937 if (ckWARN(WARN_UNINITIALIZED))
1943 if (S_sv_2iuv_common(aTHX_ sv))
1946 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2iv(%"IVdf")\n",
1947 PTR2UV(sv),SvIVX(sv)));
1948 return SvIsUV(sv) ? (IV)SvUVX(sv) : SvIVX(sv);
1952 =for apidoc sv_2uv_flags
1954 Return the unsigned integer value of an SV, doing any necessary string
1955 conversion. If flags includes SV_GMAGIC, does an mg_get() first.
1956 Normally used via the C<SvUV(sv)> and C<SvUVx(sv)> macros.
1962 Perl_sv_2uv_flags(pTHX_ register SV *sv, I32 flags)
1966 if (SvGMAGICAL(sv)) {
1967 if (flags & SV_GMAGIC)
1972 return U_V(SvNVX(sv));
1973 if (SvPOKp(sv) && SvLEN(sv)) {
1976 = grok_number(SvPVX_const(sv), SvCUR(sv), &value);
1978 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
1979 == IS_NUMBER_IN_UV) {
1980 /* It's definitely an integer */
1981 if (!(numtype & IS_NUMBER_NEG))
1985 if (ckWARN(WARN_NUMERIC))
1988 return U_V(Atof(SvPVX_const(sv)));
1991 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
1992 if (!PL_localizing && ckWARN(WARN_UNINITIALIZED))
1997 /* Else this will drop through into the SvROK case just below, which
1998 will return within the {} for all code paths. */
2000 if (SvTHINKFIRST(sv)) {
2003 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv,numer)) &&
2004 (!SvROK(tmpstr) || (SvRV(tmpstr) != SvRV(sv))))
2005 return SvUV(tmpstr);
2006 return PTR2UV(SvRV(sv));
2009 sv_force_normal_flags(sv, 0);
2011 if (SvREADONLY(sv) && !SvOK(sv)) {
2012 if (ckWARN(WARN_UNINITIALIZED))
2018 if (S_sv_2iuv_common(aTHX_ sv))
2022 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2uv(%"UVuf")\n",
2023 PTR2UV(sv),SvUVX(sv)));
2024 return SvIsUV(sv) ? SvUVX(sv) : (UV)SvIVX(sv);
2030 Return the num value of an SV, doing any necessary string or integer
2031 conversion, magic etc. Normally used via the C<SvNV(sv)> and C<SvNVx(sv)>
2038 Perl_sv_2nv(pTHX_ register SV *sv)
2042 if (SvGMAGICAL(sv)) {
2046 if (SvPOKp(sv) && SvLEN(sv)) {
2047 if (!SvIOKp(sv) && ckWARN(WARN_NUMERIC) &&
2048 !grok_number(SvPVX_const(sv), SvCUR(sv), NULL))
2050 return Atof(SvPVX_const(sv));
2054 return (NV)SvUVX(sv);
2056 return (NV)SvIVX(sv);
2059 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
2060 if (!PL_localizing && ckWARN(WARN_UNINITIALIZED))
2065 /* Else this will drop through into the SvROK case just below, which
2066 will return within the {} for all code paths. */
2068 if (SvTHINKFIRST(sv)) {
2071 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv,numer)) &&
2072 (!SvROK(tmpstr) || (SvRV(tmpstr) != SvRV(sv))))
2073 return SvNV(tmpstr);
2074 return PTR2NV(SvRV(sv));
2077 sv_force_normal_flags(sv, 0);
2079 if (SvREADONLY(sv) && !SvOK(sv)) {
2080 if (ckWARN(WARN_UNINITIALIZED))
2085 if (SvTYPE(sv) < SVt_NV) {
2086 if (SvTYPE(sv) == SVt_IV)
2087 sv_upgrade(sv, SVt_PVNV);
2089 sv_upgrade(sv, SVt_NV);
2090 #ifdef USE_LONG_DOUBLE
2092 STORE_NUMERIC_LOCAL_SET_STANDARD();
2093 PerlIO_printf(Perl_debug_log,
2094 "0x%"UVxf" num(%" PERL_PRIgldbl ")\n",
2095 PTR2UV(sv), SvNVX(sv));
2096 RESTORE_NUMERIC_LOCAL();
2100 STORE_NUMERIC_LOCAL_SET_STANDARD();
2101 PerlIO_printf(Perl_debug_log, "0x%"UVxf" num(%"NVgf")\n",
2102 PTR2UV(sv), SvNVX(sv));
2103 RESTORE_NUMERIC_LOCAL();
2107 else if (SvTYPE(sv) < SVt_PVNV)
2108 sv_upgrade(sv, SVt_PVNV);
2113 SvNV_set(sv, SvIsUV(sv) ? (NV)SvUVX(sv) : (NV)SvIVX(sv));
2114 #ifdef NV_PRESERVES_UV
2117 /* Only set the public NV OK flag if this NV preserves the IV */
2118 /* Check it's not 0xFFFFFFFFFFFFFFFF */
2119 if (SvIsUV(sv) ? ((SvUVX(sv) != UV_MAX)&&(SvUVX(sv) == U_V(SvNVX(sv))))
2120 : (SvIVX(sv) == I_V(SvNVX(sv))))
2126 else if (SvPOKp(sv) && SvLEN(sv)) {
2128 const int numtype = grok_number(SvPVX_const(sv), SvCUR(sv), &value);
2129 if (!SvIOKp(sv) && !numtype && ckWARN(WARN_NUMERIC))
2131 #ifdef NV_PRESERVES_UV
2132 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2133 == IS_NUMBER_IN_UV) {
2134 /* It's definitely an integer */
2135 SvNV_set(sv, (numtype & IS_NUMBER_NEG) ? -(NV)value : (NV)value);
2137 SvNV_set(sv, Atof(SvPVX_const(sv)));
2140 SvNV_set(sv, Atof(SvPVX_const(sv)));
2141 /* Only set the public NV OK flag if this NV preserves the value in
2142 the PV at least as well as an IV/UV would.
2143 Not sure how to do this 100% reliably. */
2144 /* if that shift count is out of range then Configure's test is
2145 wonky. We shouldn't be in here with NV_PRESERVES_UV_BITS ==
2147 if (((UV)1 << NV_PRESERVES_UV_BITS) >
2148 U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))) {
2149 SvNOK_on(sv); /* Definitely small enough to preserve all bits */
2150 } else if (!(numtype & IS_NUMBER_IN_UV)) {
2151 /* Can't use strtol etc to convert this string, so don't try.
2152 sv_2iv and sv_2uv will use the NV to convert, not the PV. */
2155 /* value has been set. It may not be precise. */
2156 if ((numtype & IS_NUMBER_NEG) && (value > (UV)IV_MIN)) {
2157 /* 2s complement assumption for (UV)IV_MIN */
2158 SvNOK_on(sv); /* Integer is too negative. */
2163 if (numtype & IS_NUMBER_NEG) {
2164 SvIV_set(sv, -(IV)value);
2165 } else if (value <= (UV)IV_MAX) {
2166 SvIV_set(sv, (IV)value);
2168 SvUV_set(sv, value);
2172 if (numtype & IS_NUMBER_NOT_INT) {
2173 /* I believe that even if the original PV had decimals,
2174 they are lost beyond the limit of the FP precision.
2175 However, neither is canonical, so both only get p
2176 flags. NWC, 2000/11/25 */
2177 /* Both already have p flags, so do nothing */
2179 const NV nv = SvNVX(sv);
2180 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2181 if (SvIVX(sv) == I_V(nv)) {
2184 /* It had no "." so it must be integer. */
2188 /* between IV_MAX and NV(UV_MAX).
2189 Could be slightly > UV_MAX */
2191 if (numtype & IS_NUMBER_NOT_INT) {
2192 /* UV and NV both imprecise. */
2194 const UV nv_as_uv = U_V(nv);
2196 if (value == nv_as_uv && SvUVX(sv) != UV_MAX) {
2205 #endif /* NV_PRESERVES_UV */
2208 if (!PL_localizing && !(SvFLAGS(sv) & SVs_PADTMP) && ckWARN(WARN_UNINITIALIZED))
2210 if (SvTYPE(sv) < SVt_NV)
2211 /* Typically the caller expects that sv_any is not NULL now. */
2212 /* XXX Ilya implies that this is a bug in callers that assume this
2213 and ideally should be fixed. */
2214 sv_upgrade(sv, SVt_NV);
2217 #if defined(USE_LONG_DOUBLE)
2219 STORE_NUMERIC_LOCAL_SET_STANDARD();
2220 PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2nv(%" PERL_PRIgldbl ")\n",
2221 PTR2UV(sv), SvNVX(sv));
2222 RESTORE_NUMERIC_LOCAL();
2226 STORE_NUMERIC_LOCAL_SET_STANDARD();
2227 PerlIO_printf(Perl_debug_log, "0x%"UVxf" 1nv(%"NVgf")\n",
2228 PTR2UV(sv), SvNVX(sv));
2229 RESTORE_NUMERIC_LOCAL();
2235 /* uiv_2buf(): private routine for use by sv_2pv_flags(): print an IV or
2236 * UV as a string towards the end of buf, and return pointers to start and
2239 * We assume that buf is at least TYPE_CHARS(UV) long.
2243 S_uiv_2buf(char *buf, IV iv, UV uv, int is_uv, char **peob)
2245 char *ptr = buf + TYPE_CHARS(UV);
2246 char * const ebuf = ptr;
2259 *--ptr = '0' + (char)(uv % 10);
2267 /* stringify_regexp(): private routine for use by sv_2pv_flags(): converts
2268 * a regexp to its stringified form.
2272 S_stringify_regexp(pTHX_ SV *sv, MAGIC *mg, STRLEN *lp) {
2273 const regexp * const re = (regexp *)mg->mg_obj;
2276 const char *fptr = "msix";
2281 bool need_newline = 0;
2282 U16 reganch = (U16)((re->reganch & PMf_COMPILETIME) >> 12);
2284 while((ch = *fptr++)) {
2286 reflags[left++] = ch;
2289 reflags[right--] = ch;
2294 reflags[left] = '-';
2298 mg->mg_len = re->prelen + 4 + left;
2300 * If /x was used, we have to worry about a regex ending with a
2301 * comment later being embedded within another regex. If so, we don't
2302 * want this regex's "commentization" to leak out to the right part of
2303 * the enclosing regex, we must cap it with a newline.
2305 * So, if /x was used, we scan backwards from the end of the regex. If
2306 * we find a '#' before we find a newline, we need to add a newline
2307 * ourself. If we find a '\n' first (or if we don't find '#' or '\n'),
2308 * we don't need to add anything. -jfriedl
2310 if (PMf_EXTENDED & re->reganch) {
2311 const char *endptr = re->precomp + re->prelen;
2312 while (endptr >= re->precomp) {
2313 const char c = *(endptr--);
2315 break; /* don't need another */
2317 /* we end while in a comment, so we need a newline */
2318 mg->mg_len++; /* save space for it */
2319 need_newline = 1; /* note to add it */
2325 Newx(mg->mg_ptr, mg->mg_len + 1 + left, char);
2326 mg->mg_ptr[0] = '(';
2327 mg->mg_ptr[1] = '?';
2328 Copy(reflags, mg->mg_ptr+2, left, char);
2329 *(mg->mg_ptr+left+2) = ':';
2330 Copy(re->precomp, mg->mg_ptr+3+left, re->prelen, char);
2332 mg->mg_ptr[mg->mg_len - 2] = '\n';
2333 mg->mg_ptr[mg->mg_len - 1] = ')';
2334 mg->mg_ptr[mg->mg_len] = 0;
2336 PL_reginterp_cnt += re->program[0].next_off;
2338 if (re->reganch & ROPT_UTF8)
2348 =for apidoc sv_2pv_flags
2350 Returns a pointer to the string value of an SV, and sets *lp to its length.
2351 If flags includes SV_GMAGIC, does an mg_get() first. Coerces sv to a string
2353 Normally invoked via the C<SvPV_flags> macro. C<sv_2pv()> and C<sv_2pv_nomg>
2354 usually end up here too.
2360 Perl_sv_2pv_flags(pTHX_ register SV *sv, STRLEN *lp, I32 flags)
2370 if (SvGMAGICAL(sv)) {
2371 if (flags & SV_GMAGIC)
2376 if (flags & SV_MUTABLE_RETURN)
2377 return SvPVX_mutable(sv);
2378 if (flags & SV_CONST_RETURN)
2379 return (char *)SvPVX_const(sv);
2382 if (SvIOKp(sv) || SvNOKp(sv)) {
2383 char tbuf[64]; /* Must fit sprintf/Gconvert of longest IV/NV */
2387 len = SvIsUV(sv) ? my_sprintf(tbuf,"%"UVuf, (UV)SvUVX(sv))
2388 : my_sprintf(tbuf,"%"IVdf, (IV)SvIVX(sv));
2390 Gconvert(SvNVX(sv), NV_DIG, 0, tbuf);
2393 if (SvROK(sv)) { /* XXX Skip this when sv_pvn_force calls */
2394 /* Sneaky stuff here */
2395 SV * const tsv = newSVpvn(tbuf, len);
2405 #ifdef FIXNEGATIVEZERO
2406 if (len == 2 && tbuf[0] == '-' && tbuf[1] == '0') {
2412 SvUPGRADE(sv, SVt_PV);
2415 s = SvGROW_mutable(sv, len + 1);
2418 return memcpy(s, tbuf, len + 1);
2422 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
2423 if (!PL_localizing && ckWARN(WARN_UNINITIALIZED))
2430 /* Else this will drop through into the SvROK case just below, which
2431 will return within the {} for all code paths. */
2433 if (SvTHINKFIRST(sv)) {
2437 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv,string)) &&
2438 (!SvROK(tmpstr) || (SvRV(tmpstr) != SvRV(sv)))) {
2440 /* char *pv = lp ? SvPV(tmpstr, *lp) : SvPV_nolen(tmpstr); */
2443 if ((SvFLAGS(tmpstr) & (SVf_POK)) == SVf_POK) {
2444 if (flags & SV_CONST_RETURN) {
2445 pv = (char *) SvPVX_const(tmpstr);
2447 pv = (flags & SV_MUTABLE_RETURN)
2448 ? SvPVX_mutable(tmpstr) : SvPVX(tmpstr);
2451 *lp = SvCUR(tmpstr);
2453 pv = sv_2pv_flags(tmpstr, lp, flags);
2463 const SV *const referent = (SV*)SvRV(sv);
2466 tsv = sv_2mortal(newSVpvn("NULLREF", 7));
2467 } else if (SvTYPE(referent) == SVt_PVMG
2468 && ((SvFLAGS(referent) &
2469 (SVs_OBJECT|SVf_OK|SVs_GMG|SVs_SMG|SVs_RMG))
2470 == (SVs_OBJECT|SVs_SMG))
2471 && (mg = mg_find(referent, PERL_MAGIC_qr))) {
2472 return S_stringify_regexp(aTHX_ sv, mg, lp);
2474 const char *const typestr = sv_reftype(referent, 0);
2476 tsv = sv_newmortal();
2477 if (SvOBJECT(referent)) {
2478 const char *const name = HvNAME_get(SvSTASH(referent));
2479 Perl_sv_setpvf(aTHX_ tsv, "%s=%s(0x%"UVxf")",
2480 name ? name : "__ANON__" , typestr,
2484 Perl_sv_setpvf(aTHX_ tsv, "%s(0x%"UVxf")", typestr,
2492 if (SvREADONLY(sv) && !SvOK(sv)) {
2493 if (ckWARN(WARN_UNINITIALIZED))
2500 if (SvIOK(sv) || ((SvIOKp(sv) && !SvNOKp(sv)))) {
2501 /* I'm assuming that if both IV and NV are equally valid then
2502 converting the IV is going to be more efficient */
2503 const U32 isIOK = SvIOK(sv);
2504 const U32 isUIOK = SvIsUV(sv);
2505 char buf[TYPE_CHARS(UV)];
2508 if (SvTYPE(sv) < SVt_PVIV)
2509 sv_upgrade(sv, SVt_PVIV);
2511 ptr = uiv_2buf(buf, 0, SvUVX(sv), 1, &ebuf);
2513 ptr = uiv_2buf(buf, SvIVX(sv), 0, 0, &ebuf);
2514 /* inlined from sv_setpvn */
2515 SvGROW_mutable(sv, (STRLEN)(ebuf - ptr + 1));
2516 Move(ptr,SvPVX_mutable(sv),ebuf - ptr,char);
2517 SvCUR_set(sv, ebuf - ptr);
2527 else if (SvNOKp(sv)) {
2528 if (SvTYPE(sv) < SVt_PVNV)
2529 sv_upgrade(sv, SVt_PVNV);
2530 /* The +20 is pure guesswork. Configure test needed. --jhi */
2531 s = SvGROW_mutable(sv, NV_DIG + 20);
2532 olderrno = errno; /* some Xenix systems wipe out errno here */
2534 if (SvNVX(sv) == 0.0)
2535 (void)strcpy(s,"0");
2539 Gconvert(SvNVX(sv), NV_DIG, 0, s);
2542 #ifdef FIXNEGATIVEZERO
2543 if (*s == '-' && s[1] == '0' && !s[2])
2553 if (!PL_localizing && !(SvFLAGS(sv) & SVs_PADTMP) && ckWARN(WARN_UNINITIALIZED))
2557 if (SvTYPE(sv) < SVt_PV)
2558 /* Typically the caller expects that sv_any is not NULL now. */
2559 sv_upgrade(sv, SVt_PV);
2563 const STRLEN len = s - SvPVX_const(sv);
2569 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2pv(%s)\n",
2570 PTR2UV(sv),SvPVX_const(sv)));
2571 if (flags & SV_CONST_RETURN)
2572 return (char *)SvPVX_const(sv);
2573 if (flags & SV_MUTABLE_RETURN)
2574 return SvPVX_mutable(sv);
2579 =for apidoc sv_copypv
2581 Copies a stringified representation of the source SV into the
2582 destination SV. Automatically performs any necessary mg_get and
2583 coercion of numeric values into strings. Guaranteed to preserve
2584 UTF-8 flag even from overloaded objects. Similar in nature to
2585 sv_2pv[_flags] but operates directly on an SV instead of just the
2586 string. Mostly uses sv_2pv_flags to do its work, except when that
2587 would lose the UTF-8'ness of the PV.
2593 Perl_sv_copypv(pTHX_ SV *dsv, register SV *ssv)
2596 const char * const s = SvPV_const(ssv,len);
2597 sv_setpvn(dsv,s,len);
2605 =for apidoc sv_2pvbyte
2607 Return a pointer to the byte-encoded representation of the SV, and set *lp
2608 to its length. May cause the SV to be downgraded from UTF-8 as a
2611 Usually accessed via the C<SvPVbyte> macro.
2617 Perl_sv_2pvbyte(pTHX_ register SV *sv, STRLEN *lp)
2619 sv_utf8_downgrade(sv,0);
2620 return lp ? SvPV(sv,*lp) : SvPV_nolen(sv);
2624 =for apidoc sv_2pvutf8
2626 Return a pointer to the UTF-8-encoded representation of the SV, and set *lp
2627 to its length. May cause the SV to be upgraded to UTF-8 as a side-effect.
2629 Usually accessed via the C<SvPVutf8> macro.
2635 Perl_sv_2pvutf8(pTHX_ register SV *sv, STRLEN *lp)
2637 sv_utf8_upgrade(sv);
2638 return lp ? SvPV(sv,*lp) : SvPV_nolen(sv);
2643 =for apidoc sv_2bool
2645 This function is only called on magical items, and is only used by
2646 sv_true() or its macro equivalent.
2652 Perl_sv_2bool(pTHX_ register SV *sv)
2660 if (SvAMAGIC(sv) && (tmpsv=AMG_CALLun(sv,bool_)) &&
2661 (!SvROK(tmpsv) || (SvRV(tmpsv) != SvRV(sv))))
2662 return (bool)SvTRUE(tmpsv);
2663 return SvRV(sv) != 0;
2666 register XPV* const Xpvtmp = (XPV*)SvANY(sv);
2668 (*sv->sv_u.svu_pv > '0' ||
2669 Xpvtmp->xpv_cur > 1 ||
2670 (Xpvtmp->xpv_cur && *sv->sv_u.svu_pv != '0')))
2677 return SvIVX(sv) != 0;
2680 return SvNVX(sv) != 0.0;
2688 =for apidoc sv_utf8_upgrade
2690 Converts the PV of an SV to its UTF-8-encoded form.
2691 Forces the SV to string form if it is not already.
2692 Always sets the SvUTF8 flag to avoid future validity checks even
2693 if all the bytes have hibit clear.
2695 This is not as a general purpose byte encoding to Unicode interface:
2696 use the Encode extension for that.
2698 =for apidoc sv_utf8_upgrade_flags
2700 Converts the PV of an SV to its UTF-8-encoded form.
2701 Forces the SV to string form if it is not already.
2702 Always sets the SvUTF8 flag to avoid future validity checks even
2703 if all the bytes have hibit clear. If C<flags> has C<SV_GMAGIC> bit set,
2704 will C<mg_get> on C<sv> if appropriate, else not. C<sv_utf8_upgrade> and
2705 C<sv_utf8_upgrade_nomg> are implemented in terms of this function.
2707 This is not as a general purpose byte encoding to Unicode interface:
2708 use the Encode extension for that.
2714 Perl_sv_utf8_upgrade_flags(pTHX_ register SV *sv, I32 flags)
2716 if (sv == &PL_sv_undef)
2720 if (SvREADONLY(sv) && (SvPOKp(sv) || SvIOKp(sv) || SvNOKp(sv))) {
2721 (void) sv_2pv_flags(sv,&len, flags);
2725 (void) SvPV_force(sv,len);
2734 sv_force_normal_flags(sv, 0);
2737 if (PL_encoding && !(flags & SV_UTF8_NO_ENCODING))
2738 sv_recode_to_utf8(sv, PL_encoding);
2739 else { /* Assume Latin-1/EBCDIC */
2740 /* This function could be much more efficient if we
2741 * had a FLAG in SVs to signal if there are any hibit
2742 * chars in the PV. Given that there isn't such a flag
2743 * make the loop as fast as possible. */
2744 const U8 * const s = (U8 *) SvPVX_const(sv);
2745 const U8 * const e = (U8 *) SvEND(sv);
2750 /* Check for hi bit */
2751 if (!NATIVE_IS_INVARIANT(ch)) {
2752 STRLEN len = SvCUR(sv) + 1; /* Plus the \0 */
2753 U8 * const recoded = bytes_to_utf8((U8*)s, &len);
2755 SvPV_free(sv); /* No longer using what was there before. */
2756 SvPV_set(sv, (char*)recoded);
2757 SvCUR_set(sv, len - 1);
2758 SvLEN_set(sv, len); /* No longer know the real size. */
2762 /* Mark as UTF-8 even if no hibit - saves scanning loop */
2769 =for apidoc sv_utf8_downgrade
2771 Attempts to convert the PV of an SV from characters to bytes.
2772 If the PV contains a character beyond byte, this conversion will fail;
2773 in this case, either returns false or, if C<fail_ok> is not
2776 This is not as a general purpose Unicode to byte encoding interface:
2777 use the Encode extension for that.
2783 Perl_sv_utf8_downgrade(pTHX_ register SV* sv, bool fail_ok)
2785 if (SvPOKp(sv) && SvUTF8(sv)) {
2791 sv_force_normal_flags(sv, 0);
2793 s = (U8 *) SvPV(sv, len);
2794 if (!utf8_to_bytes(s, &len)) {
2799 Perl_croak(aTHX_ "Wide character in %s",
2802 Perl_croak(aTHX_ "Wide character");
2813 =for apidoc sv_utf8_encode
2815 Converts the PV of an SV to UTF-8, but then turns the C<SvUTF8>
2816 flag off so that it looks like octets again.
2822 Perl_sv_utf8_encode(pTHX_ register SV *sv)
2824 (void) sv_utf8_upgrade(sv);
2826 sv_force_normal_flags(sv, 0);
2828 if (SvREADONLY(sv)) {
2829 Perl_croak(aTHX_ PL_no_modify);
2835 =for apidoc sv_utf8_decode
2837 If the PV of the SV is an octet sequence in UTF-8
2838 and contains a multiple-byte character, the C<SvUTF8> flag is turned on
2839 so that it looks like a character. If the PV contains only single-byte
2840 characters, the C<SvUTF8> flag stays being off.
2841 Scans PV for validity and returns false if the PV is invalid UTF-8.
2847 Perl_sv_utf8_decode(pTHX_ register SV *sv)
2853 /* The octets may have got themselves encoded - get them back as
2856 if (!sv_utf8_downgrade(sv, TRUE))
2859 /* it is actually just a matter of turning the utf8 flag on, but
2860 * we want to make sure everything inside is valid utf8 first.
2862 c = (const U8 *) SvPVX_const(sv);
2863 if (!is_utf8_string(c, SvCUR(sv)+1))
2865 e = (const U8 *) SvEND(sv);
2868 if (!UTF8_IS_INVARIANT(ch)) {
2878 =for apidoc sv_setsv
2880 Copies the contents of the source SV C<ssv> into the destination SV
2881 C<dsv>. The source SV may be destroyed if it is mortal, so don't use this
2882 function if the source SV needs to be reused. Does not handle 'set' magic.
2883 Loosely speaking, it performs a copy-by-value, obliterating any previous
2884 content of the destination.
2886 You probably want to use one of the assortment of wrappers, such as
2887 C<SvSetSV>, C<SvSetSV_nosteal>, C<SvSetMagicSV> and
2888 C<SvSetMagicSV_nosteal>.
2890 =for apidoc sv_setsv_flags
2892 Copies the contents of the source SV C<ssv> into the destination SV
2893 C<dsv>. The source SV may be destroyed if it is mortal, so don't use this
2894 function if the source SV needs to be reused. Does not handle 'set' magic.
2895 Loosely speaking, it performs a copy-by-value, obliterating any previous
2896 content of the destination.
2897 If the C<flags> parameter has the C<SV_GMAGIC> bit set, will C<mg_get> on
2898 C<ssv> if appropriate, else not. If the C<flags> parameter has the
2899 C<NOSTEAL> bit set then the buffers of temps will not be stolen. <sv_setsv>
2900 and C<sv_setsv_nomg> are implemented in terms of this function.
2902 You probably want to use one of the assortment of wrappers, such as
2903 C<SvSetSV>, C<SvSetSV_nosteal>, C<SvSetMagicSV> and
2904 C<SvSetMagicSV_nosteal>.
2906 This is the primary function for copying scalars, and most other
2907 copy-ish functions and macros use this underneath.
2913 Perl_sv_setsv_flags(pTHX_ SV *dstr, register SV *sstr, I32 flags)
2915 register U32 sflags;
2921 SV_CHECK_THINKFIRST_COW_DROP(dstr);
2923 sstr = &PL_sv_undef;
2924 stype = SvTYPE(sstr);
2925 dtype = SvTYPE(dstr);
2930 /* need to nuke the magic */
2932 SvRMAGICAL_off(dstr);
2935 /* There's a lot of redundancy below but we're going for speed here */
2940 if (dtype != SVt_PVGV) {
2941 (void)SvOK_off(dstr);
2949 sv_upgrade(dstr, SVt_IV);
2952 sv_upgrade(dstr, SVt_PVNV);
2956 sv_upgrade(dstr, SVt_PVIV);
2959 (void)SvIOK_only(dstr);
2960 SvIV_set(dstr, SvIVX(sstr));
2963 if (SvTAINTED(sstr))
2974 sv_upgrade(dstr, SVt_NV);
2979 sv_upgrade(dstr, SVt_PVNV);
2982 SvNV_set(dstr, SvNVX(sstr));
2983 (void)SvNOK_only(dstr);
2984 if (SvTAINTED(sstr))
2992 sv_upgrade(dstr, SVt_RV);
2993 else if (dtype == SVt_PVGV &&
2994 SvROK(sstr) && SvTYPE(SvRV(sstr)) == SVt_PVGV) {
2997 if (GvIMPORTED(dstr) != GVf_IMPORTED
2998 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3000 GvIMPORTED_on(dstr);
3009 #ifdef PERL_OLD_COPY_ON_WRITE
3010 if ((SvFLAGS(sstr) & CAN_COW_MASK) == CAN_COW_FLAGS) {
3011 if (dtype < SVt_PVIV)
3012 sv_upgrade(dstr, SVt_PVIV);
3019 sv_upgrade(dstr, SVt_PV);
3022 if (dtype < SVt_PVIV)
3023 sv_upgrade(dstr, SVt_PVIV);
3026 if (dtype < SVt_PVNV)
3027 sv_upgrade(dstr, SVt_PVNV);
3034 const char * const type = sv_reftype(sstr,0);
3036 Perl_croak(aTHX_ "Bizarre copy of %s in %s", type, OP_NAME(PL_op));
3038 Perl_croak(aTHX_ "Bizarre copy of %s", type);
3043 if (dtype <= SVt_PVGV) {
3045 if (dtype != SVt_PVGV) {
3046 const char * const name = GvNAME(sstr);
3047 const STRLEN len = GvNAMELEN(sstr);
3048 /* don't upgrade SVt_PVLV: it can hold a glob */
3049 if (dtype != SVt_PVLV)
3050 sv_upgrade(dstr, SVt_PVGV);
3051 sv_magic(dstr, dstr, PERL_MAGIC_glob, Nullch, 0);
3052 GvSTASH(dstr) = GvSTASH(sstr);
3054 Perl_sv_add_backref(aTHX_ (SV*)GvSTASH(dstr), dstr);
3055 GvNAME(dstr) = savepvn(name, len);
3056 GvNAMELEN(dstr) = len;
3057 SvFAKE_on(dstr); /* can coerce to non-glob */
3060 #ifdef GV_UNIQUE_CHECK
3061 if (GvUNIQUE((GV*)dstr)) {
3062 Perl_croak(aTHX_ PL_no_modify);
3066 (void)SvOK_off(dstr);
3067 GvINTRO_off(dstr); /* one-shot flag */
3069 GvGP(dstr) = gp_ref(GvGP(sstr));
3070 if (SvTAINTED(sstr))
3072 if (GvIMPORTED(dstr) != GVf_IMPORTED
3073 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3075 GvIMPORTED_on(dstr);
3083 if (SvGMAGICAL(sstr) && (flags & SV_GMAGIC)) {
3085 if ((int)SvTYPE(sstr) != stype) {
3086 stype = SvTYPE(sstr);
3087 if (stype == SVt_PVGV && dtype <= SVt_PVGV)
3091 if (stype == SVt_PVLV)
3092 SvUPGRADE(dstr, SVt_PVNV);
3094 SvUPGRADE(dstr, (U32)stype);
3097 sflags = SvFLAGS(sstr);
3099 if (sflags & SVf_ROK) {
3100 if (dtype >= SVt_PV) {
3101 if (dtype == SVt_PVGV) {
3102 SV * const sref = SvREFCNT_inc(SvRV(sstr));
3104 const int intro = GvINTRO(dstr);
3106 #ifdef GV_UNIQUE_CHECK
3107 if (GvUNIQUE((GV*)dstr)) {
3108 Perl_croak(aTHX_ PL_no_modify);
3113 GvINTRO_off(dstr); /* one-shot flag */
3114 GvLINE(dstr) = CopLINE(PL_curcop);
3115 GvEGV(dstr) = (GV*)dstr;
3118 switch (SvTYPE(sref)) {
3121 SAVEGENERICSV(GvAV(dstr));
3123 dref = (SV*)GvAV(dstr);
3124 GvAV(dstr) = (AV*)sref;
3125 if (!GvIMPORTED_AV(dstr)
3126 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3128 GvIMPORTED_AV_on(dstr);
3133 SAVEGENERICSV(GvHV(dstr));
3135 dref = (SV*)GvHV(dstr);
3136 GvHV(dstr) = (HV*)sref;
3137 if (!GvIMPORTED_HV(dstr)
3138 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3140 GvIMPORTED_HV_on(dstr);
3145 if (GvCVGEN(dstr) && GvCV(dstr) != (CV*)sref) {
3146 SvREFCNT_dec(GvCV(dstr));
3147 GvCV(dstr) = Nullcv;
3148 GvCVGEN(dstr) = 0; /* Switch off cacheness. */
3149 PL_sub_generation++;
3151 SAVEGENERICSV(GvCV(dstr));
3154 dref = (SV*)GvCV(dstr);
3155 if (GvCV(dstr) != (CV*)sref) {
3156 CV* const cv = GvCV(dstr);
3158 if (!GvCVGEN((GV*)dstr) &&
3159 (CvROOT(cv) || CvXSUB(cv)))
3161 /* Redefining a sub - warning is mandatory if
3162 it was a const and its value changed. */
3163 if (ckWARN(WARN_REDEFINE)
3165 && (!CvCONST((CV*)sref)
3166 || sv_cmp(cv_const_sv(cv),
3167 cv_const_sv((CV*)sref)))))
3169 Perl_warner(aTHX_ packWARN(WARN_REDEFINE),
3171 ? "Constant subroutine %s::%s redefined"
3172 : "Subroutine %s::%s redefined",
3173 HvNAME_get(GvSTASH((GV*)dstr)),
3174 GvENAME((GV*)dstr));
3178 cv_ckproto(cv, (GV*)dstr,
3180 ? SvPVX_const(sref) : Nullch);
3182 GvCV(dstr) = (CV*)sref;
3183 GvCVGEN(dstr) = 0; /* Switch off cacheness. */
3184 GvASSUMECV_on(dstr);
3185 PL_sub_generation++;
3187 if (!GvIMPORTED_CV(dstr)
3188 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3190 GvIMPORTED_CV_on(dstr);
3195 SAVEGENERICSV(GvIOp(dstr));
3197 dref = (SV*)GvIOp(dstr);
3198 GvIOp(dstr) = (IO*)sref;
3202 SAVEGENERICSV(GvFORM(dstr));
3204 dref = (SV*)GvFORM(dstr);
3205 GvFORM(dstr) = (CV*)sref;
3209 SAVEGENERICSV(GvSV(dstr));
3211 dref = (SV*)GvSV(dstr);
3213 if (!GvIMPORTED_SV(dstr)
3214 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3216 GvIMPORTED_SV_on(dstr);
3222 if (SvTAINTED(sstr))
3226 if (SvPVX_const(dstr)) {
3232 (void)SvOK_off(dstr);
3233 SvRV_set(dstr, SvREFCNT_inc(SvRV(sstr)));
3235 if (sflags & SVp_NOK) {
3237 /* Only set the public OK flag if the source has public OK. */
3238 if (sflags & SVf_NOK)
3239 SvFLAGS(dstr) |= SVf_NOK;
3240 SvNV_set(dstr, SvNVX(sstr));
3242 if (sflags & SVp_IOK) {
3243 (void)SvIOKp_on(dstr);
3244 if (sflags & SVf_IOK)
3245 SvFLAGS(dstr) |= SVf_IOK;
3246 if (sflags & SVf_IVisUV)
3248 SvIV_set(dstr, SvIVX(sstr));
3250 if (SvAMAGIC(sstr)) {
3254 else if (sflags & SVp_POK) {
3258 * Check to see if we can just swipe the string. If so, it's a
3259 * possible small lose on short strings, but a big win on long ones.
3260 * It might even be a win on short strings if SvPVX_const(dstr)
3261 * has to be allocated and SvPVX_const(sstr) has to be freed.
3264 /* Whichever path we take through the next code, we want this true,
3265 and doing it now facilitates the COW check. */
3266 (void)SvPOK_only(dstr);
3269 /* We're not already COW */
3270 ((sflags & (SVf_FAKE | SVf_READONLY)) != (SVf_FAKE | SVf_READONLY)
3271 #ifndef PERL_OLD_COPY_ON_WRITE
3272 /* or we are, but dstr isn't a suitable target. */
3273 || (SvFLAGS(dstr) & CAN_COW_MASK) != CAN_COW_FLAGS
3278 (sflags & SVs_TEMP) && /* slated for free anyway? */
3279 !(sflags & SVf_OOK) && /* and not involved in OOK hack? */
3280 (!(flags & SV_NOSTEAL)) &&
3281 /* and we're allowed to steal temps */
3282 SvREFCNT(sstr) == 1 && /* and no other references to it? */
3283 SvLEN(sstr) && /* and really is a string */
3284 /* and won't be needed again, potentially */
3285 !(PL_op && PL_op->op_type == OP_AASSIGN))
3286 #ifdef PERL_OLD_COPY_ON_WRITE
3287 && !((sflags & CAN_COW_MASK) == CAN_COW_FLAGS
3288 && (SvFLAGS(dstr) & CAN_COW_MASK) == CAN_COW_FLAGS
3289 && SvTYPE(sstr) >= SVt_PVIV)
3292 /* Failed the swipe test, and it's not a shared hash key either.
3293 Have to copy the string. */
3294 STRLEN len = SvCUR(sstr);
3295 SvGROW(dstr, len + 1); /* inlined from sv_setpvn */
3296 Move(SvPVX_const(sstr),SvPVX(dstr),len,char);
3297 SvCUR_set(dstr, len);
3298 *SvEND(dstr) = '\0';
3300 /* If PERL_OLD_COPY_ON_WRITE is not defined, then isSwipe will always
3302 /* Either it's a shared hash key, or it's suitable for
3303 copy-on-write or we can swipe the string. */
3305 PerlIO_printf(Perl_debug_log, "Copy on write: sstr --> dstr\n");
3309 #ifdef PERL_OLD_COPY_ON_WRITE
3311 /* I believe I should acquire a global SV mutex if
3312 it's a COW sv (not a shared hash key) to stop
3313 it going un copy-on-write.
3314 If the source SV has gone un copy on write between up there
3315 and down here, then (assert() that) it is of the correct
3316 form to make it copy on write again */
3317 if ((sflags & (SVf_FAKE | SVf_READONLY))
3318 != (SVf_FAKE | SVf_READONLY)) {
3319 SvREADONLY_on(sstr);
3321 /* Make the source SV into a loop of 1.
3322 (about to become 2) */
3323 SV_COW_NEXT_SV_SET(sstr, sstr);
3327 /* Initial code is common. */
3328 if (SvPVX_const(dstr)) { /* we know that dtype >= SVt_PV */
3333 /* making another shared SV. */
3334 STRLEN cur = SvCUR(sstr);
3335 STRLEN len = SvLEN(sstr);
3336 #ifdef PERL_OLD_COPY_ON_WRITE
3338 assert (SvTYPE(dstr) >= SVt_PVIV);
3339 /* SvIsCOW_normal */
3340 /* splice us in between source and next-after-source. */
3341 SV_COW_NEXT_SV_SET(dstr, SV_COW_NEXT_SV(sstr));
3342 SV_COW_NEXT_SV_SET(sstr, dstr);
3343 SvPV_set(dstr, SvPVX_mutable(sstr));
3347 /* SvIsCOW_shared_hash */
3348 DEBUG_C(PerlIO_printf(Perl_debug_log,
3349 "Copy on write: Sharing hash\n"));
3351 assert (SvTYPE(dstr) >= SVt_PV);
3353 HEK_KEY(share_hek_hek(SvSHARED_HEK_FROM_PV(SvPVX_const(sstr)))));
3355 SvLEN_set(dstr, len);
3356 SvCUR_set(dstr, cur);
3357 SvREADONLY_on(dstr);
3359 /* Relesase a global SV mutex. */
3362 { /* Passes the swipe test. */
3363 SvPV_set(dstr, SvPVX_mutable(sstr));
3364 SvLEN_set(dstr, SvLEN(sstr));
3365 SvCUR_set(dstr, SvCUR(sstr));
3368 (void)SvOK_off(sstr); /* NOTE: nukes most SvFLAGS on sstr */
3369 SvPV_set(sstr, Nullch);
3375 if (sflags & SVf_UTF8)
3377 if (sflags & SVp_NOK) {
3379 if (sflags & SVf_NOK)
3380 SvFLAGS(dstr) |= SVf_NOK;
3381 SvNV_set(dstr, SvNVX(sstr));
3383 if (sflags & SVp_IOK) {
3384 (void)SvIOKp_on(dstr);
3385 if (sflags & SVf_IOK)
3386 SvFLAGS(dstr) |= SVf_IOK;
3387 if (sflags & SVf_IVisUV)
3389 SvIV_set(dstr, SvIVX(sstr));
3392 const MAGIC * const smg = mg_find(sstr,PERL_MAGIC_vstring);
3393 sv_magic(dstr, NULL, PERL_MAGIC_vstring,
3394 smg->mg_ptr, smg->mg_len);
3395 SvRMAGICAL_on(dstr);
3398 else if (sflags & SVp_IOK) {
3399 if (sflags & SVf_IOK)
3400 (void)SvIOK_only(dstr);
3402 (void)SvOK_off(dstr);
3403 (void)SvIOKp_on(dstr);
3405 /* XXXX Do we want to set IsUV for IV(ROK)? Be extra safe... */
3406 if (sflags & SVf_IVisUV)
3408 SvIV_set(dstr, SvIVX(sstr));
3409 if (sflags & SVp_NOK) {
3410 if (sflags & SVf_NOK)
3411 (void)SvNOK_on(dstr);
3413 (void)SvNOKp_on(dstr);
3414 SvNV_set(dstr, SvNVX(sstr));
3417 else if (sflags & SVp_NOK) {
3418 if (sflags & SVf_NOK)
3419 (void)SvNOK_only(dstr);
3421 (void)SvOK_off(dstr);
3424 SvNV_set(dstr, SvNVX(sstr));
3427 if (dtype == SVt_PVGV) {
3428 if (ckWARN(WARN_MISC))
3429 Perl_warner(aTHX_ packWARN(WARN_MISC), "Undefined value assigned to typeglob");
3432 (void)SvOK_off(dstr);
3434 if (SvTAINTED(sstr))
3439 =for apidoc sv_setsv_mg
3441 Like C<sv_setsv>, but also handles 'set' magic.
3447 Perl_sv_setsv_mg(pTHX_ SV *dstr, register SV *sstr)
3449 sv_setsv(dstr,sstr);
3453 #ifdef PERL_OLD_COPY_ON_WRITE
3455 Perl_sv_setsv_cow(pTHX_ SV *dstr, SV *sstr)
3457 STRLEN cur = SvCUR(sstr);
3458 STRLEN len = SvLEN(sstr);
3459 register char *new_pv;
3462 PerlIO_printf(Perl_debug_log, "Fast copy on write: %p -> %p\n",
3470 if (SvTHINKFIRST(dstr))
3471 sv_force_normal_flags(dstr, SV_COW_DROP_PV);
3472 else if (SvPVX_const(dstr))
3473 Safefree(SvPVX_const(dstr));
3477 SvUPGRADE(dstr, SVt_PVIV);
3479 assert (SvPOK(sstr));
3480 assert (SvPOKp(sstr));
3481 assert (!SvIOK(sstr));
3482 assert (!SvIOKp(sstr));
3483 assert (!SvNOK(sstr));
3484 assert (!SvNOKp(sstr));
3486 if (SvIsCOW(sstr)) {
3488 if (SvLEN(sstr) == 0) {
3489 /* source is a COW shared hash key. */
3490 DEBUG_C(PerlIO_printf(Perl_debug_log,
3491 "Fast copy on write: Sharing hash\n"));
3492 new_pv = HEK_KEY(share_hek_hek(SvSHARED_HEK_FROM_PV(SvPVX_const(sstr))));
3495 SV_COW_NEXT_SV_SET(dstr, SV_COW_NEXT_SV(sstr));
3497 assert ((SvFLAGS(sstr) & CAN_COW_MASK) == CAN_COW_FLAGS);
3498 SvUPGRADE(sstr, SVt_PVIV);
3499 SvREADONLY_on(sstr);
3501 DEBUG_C(PerlIO_printf(Perl_debug_log,
3502 "Fast copy on write: Converting sstr to COW\n"));
3503 SV_COW_NEXT_SV_SET(dstr, sstr);
3505 SV_COW_NEXT_SV_SET(sstr, dstr);
3506 new_pv = SvPVX_mutable(sstr);
3509 SvPV_set(dstr, new_pv);
3510 SvFLAGS(dstr) = (SVt_PVIV|SVf_POK|SVp_POK|SVf_FAKE|SVf_READONLY);
3513 SvLEN_set(dstr, len);
3514 SvCUR_set(dstr, cur);
3523 =for apidoc sv_setpvn
3525 Copies a string into an SV. The C<len> parameter indicates the number of
3526 bytes to be copied. If the C<ptr> argument is NULL the SV will become
3527 undefined. Does not handle 'set' magic. See C<sv_setpvn_mg>.
3533 Perl_sv_setpvn(pTHX_ register SV *sv, register const char *ptr, register STRLEN len)
3535 register char *dptr;
3537 SV_CHECK_THINKFIRST_COW_DROP(sv);
3543 /* len is STRLEN which is unsigned, need to copy to signed */
3546 Perl_croak(aTHX_ "panic: sv_setpvn called with negative strlen");
3548 SvUPGRADE(sv, SVt_PV);
3550 dptr = SvGROW(sv, len + 1);
3551 Move(ptr,dptr,len,char);
3554 (void)SvPOK_only_UTF8(sv); /* validate pointer */
3559 =for apidoc sv_setpvn_mg
3561 Like C<sv_setpvn>, but also handles 'set' magic.
3567 Perl_sv_setpvn_mg(pTHX_ register SV *sv, register const char *ptr, register STRLEN len)
3569 sv_setpvn(sv,ptr,len);
3574 =for apidoc sv_setpv
3576 Copies a string into an SV. The string must be null-terminated. Does not
3577 handle 'set' magic. See C<sv_setpv_mg>.
3583 Perl_sv_setpv(pTHX_ register SV *sv, register const char *ptr)
3585 register STRLEN len;
3587 SV_CHECK_THINKFIRST_COW_DROP(sv);
3593 SvUPGRADE(sv, SVt_PV);
3595 SvGROW(sv, len + 1);
3596 Move(ptr,SvPVX(sv),len+1,char);
3598 (void)SvPOK_only_UTF8(sv); /* validate pointer */
3603 =for apidoc sv_setpv_mg
3605 Like C<sv_setpv>, but also handles 'set' magic.
3611 Perl_sv_setpv_mg(pTHX_ register SV *sv, register const char *ptr)
3618 =for apidoc sv_usepvn
3620 Tells an SV to use C<ptr> to find its string value. Normally the string is
3621 stored inside the SV but sv_usepvn allows the SV to use an outside string.
3622 The C<ptr> should point to memory that was allocated by C<malloc>. The
3623 string length, C<len>, must be supplied. This function will realloc the
3624 memory pointed to by C<ptr>, so that pointer should not be freed or used by
3625 the programmer after giving it to sv_usepvn. Does not handle 'set' magic.
3626 See C<sv_usepvn_mg>.
3632 Perl_sv_usepvn(pTHX_ register SV *sv, register char *ptr, register STRLEN len)
3635 SV_CHECK_THINKFIRST_COW_DROP(sv);
3636 SvUPGRADE(sv, SVt_PV);
3641 if (SvPVX_const(sv))
3644 allocate = PERL_STRLEN_ROUNDUP(len + 1);
3645 ptr = saferealloc (ptr, allocate);
3648 SvLEN_set(sv, allocate);
3650 (void)SvPOK_only_UTF8(sv); /* validate pointer */
3655 =for apidoc sv_usepvn_mg
3657 Like C<sv_usepvn>, but also handles 'set' magic.
3663 Perl_sv_usepvn_mg(pTHX_ register SV *sv, register char *ptr, register STRLEN len)
3665 sv_usepvn(sv,ptr,len);
3669 #ifdef PERL_OLD_COPY_ON_WRITE
3670 /* Need to do this *after* making the SV normal, as we need the buffer
3671 pointer to remain valid until after we've copied it. If we let go too early,
3672 another thread could invalidate it by unsharing last of the same hash key
3673 (which it can do by means other than releasing copy-on-write Svs)
3674 or by changing the other copy-on-write SVs in the loop. */
3676 S_sv_release_COW(pTHX_ register SV *sv, const char *pvx, STRLEN len, SV *after)
3678 if (len) { /* this SV was SvIsCOW_normal(sv) */
3679 /* we need to find the SV pointing to us. */
3680 SV * const current = SV_COW_NEXT_SV(after);
3682 if (current == sv) {
3683 /* The SV we point to points back to us (there were only two of us
3685 Hence other SV is no longer copy on write either. */
3687 SvREADONLY_off(after);
3689 /* We need to follow the pointers around the loop. */
3691 while ((next = SV_COW_NEXT_SV(current)) != sv) {
3694 /* don't loop forever if the structure is bust, and we have
3695 a pointer into a closed loop. */
3696 assert (current != after);
3697 assert (SvPVX_const(current) == pvx);
3699 /* Make the SV before us point to the SV after us. */
3700 SV_COW_NEXT_SV_SET(current, after);
3703 unshare_hek(SvSHARED_HEK_FROM_PV(pvx));
3708 Perl_sv_release_IVX(pTHX_ register SV *sv)
3711 sv_force_normal_flags(sv, 0);
3717 =for apidoc sv_force_normal_flags
3719 Undo various types of fakery on an SV: if the PV is a shared string, make
3720 a private copy; if we're a ref, stop refing; if we're a glob, downgrade to
3721 an xpvmg; if we're a copy-on-write scalar, this is the on-write time when
3722 we do the copy, and is also used locally. If C<SV_COW_DROP_PV> is set
3723 then a copy-on-write scalar drops its PV buffer (if any) and becomes
3724 SvPOK_off rather than making a copy. (Used where this scalar is about to be
3725 set to some other value.) In addition, the C<flags> parameter gets passed to
3726 C<sv_unref_flags()> when unrefing. C<sv_force_normal> calls this function
3727 with flags set to 0.
3733 Perl_sv_force_normal_flags(pTHX_ register SV *sv, U32 flags)
3735 #ifdef PERL_OLD_COPY_ON_WRITE
3736 if (SvREADONLY(sv)) {
3737 /* At this point I believe I should acquire a global SV mutex. */
3739 const char * const pvx = SvPVX_const(sv);
3740 const STRLEN len = SvLEN(sv);
3741 const STRLEN cur = SvCUR(sv);
3742 SV * const next = SV_COW_NEXT_SV(sv); /* next COW sv in the loop. */
3744 PerlIO_printf(Perl_debug_log,
3745 "Copy on write: Force normal %ld\n",
3751 /* This SV doesn't own the buffer, so need to Newx() a new one: */
3752 SvPV_set(sv, (char*)0);
3754 if (flags & SV_COW_DROP_PV) {
3755 /* OK, so we don't need to copy our buffer. */
3758 SvGROW(sv, cur + 1);
3759 Move(pvx,SvPVX(sv),cur,char);
3763 sv_release_COW(sv, pvx, len, next);
3768 else if (IN_PERL_RUNTIME)
3769 Perl_croak(aTHX_ PL_no_modify);
3770 /* At this point I believe that I can drop the global SV mutex. */
3773 if (SvREADONLY(sv)) {
3775 const char * const pvx = SvPVX_const(sv);
3776 const STRLEN len = SvCUR(sv);
3779 SvPV_set(sv, Nullch);
3781 SvGROW(sv, len + 1);
3782 Move(pvx,SvPVX(sv),len,char);
3784 unshare_hek(SvSHARED_HEK_FROM_PV(pvx));
3786 else if (IN_PERL_RUNTIME)
3787 Perl_croak(aTHX_ PL_no_modify);
3791 sv_unref_flags(sv, flags);
3792 else if (SvFAKE(sv) && SvTYPE(sv) == SVt_PVGV)
3799 Efficient removal of characters from the beginning of the string buffer.
3800 SvPOK(sv) must be true and the C<ptr> must be a pointer to somewhere inside
3801 the string buffer. The C<ptr> becomes the first character of the adjusted
3802 string. Uses the "OOK hack".
3803 Beware: after this function returns, C<ptr> and SvPVX_const(sv) may no longer
3804 refer to the same chunk of data.
3810 Perl_sv_chop(pTHX_ register SV *sv, register const char *ptr)
3812 register STRLEN delta;
3813 if (!ptr || !SvPOKp(sv))
3815 delta = ptr - SvPVX_const(sv);
3816 SV_CHECK_THINKFIRST(sv);
3817 if (SvTYPE(sv) < SVt_PVIV)
3818 sv_upgrade(sv,SVt_PVIV);
3821 if (!SvLEN(sv)) { /* make copy of shared string */
3822 const char *pvx = SvPVX_const(sv);
3823 const STRLEN len = SvCUR(sv);
3824 SvGROW(sv, len + 1);
3825 Move(pvx,SvPVX(sv),len,char);
3829 /* Same SvOOK_on but SvOOK_on does a SvIOK_off
3830 and we do that anyway inside the SvNIOK_off
3832 SvFLAGS(sv) |= SVf_OOK;
3835 SvLEN_set(sv, SvLEN(sv) - delta);
3836 SvCUR_set(sv, SvCUR(sv) - delta);
3837 SvPV_set(sv, SvPVX(sv) + delta);
3838 SvIV_set(sv, SvIVX(sv) + delta);
3842 =for apidoc sv_catpvn
3844 Concatenates the string onto the end of the string which is in the SV. The
3845 C<len> indicates number of bytes to copy. If the SV has the UTF-8
3846 status set, then the bytes appended should be valid UTF-8.
3847 Handles 'get' magic, but not 'set' magic. See C<sv_catpvn_mg>.
3849 =for apidoc sv_catpvn_flags
3851 Concatenates the string onto the end of the string which is in the SV. The
3852 C<len> indicates number of bytes to copy. If the SV has the UTF-8
3853 status set, then the bytes appended should be valid UTF-8.
3854 If C<flags> has C<SV_GMAGIC> bit set, will C<mg_get> on C<dsv> if
3855 appropriate, else not. C<sv_catpvn> and C<sv_catpvn_nomg> are implemented
3856 in terms of this function.
3862 Perl_sv_catpvn_flags(pTHX_ register SV *dsv, register const char *sstr, register STRLEN slen, I32 flags)
3865 const char *dstr = SvPV_force_flags(dsv, dlen, flags);
3867 SvGROW(dsv, dlen + slen + 1);
3869 sstr = SvPVX_const(dsv);
3870 Move(sstr, SvPVX(dsv) + dlen, slen, char);
3871 SvCUR_set(dsv, SvCUR(dsv) + slen);
3873 (void)SvPOK_only_UTF8(dsv); /* validate pointer */
3875 if (flags & SV_SMAGIC)
3880 =for apidoc sv_catsv
3882 Concatenates the string from SV C<ssv> onto the end of the string in
3883 SV C<dsv>. Modifies C<dsv> but not C<ssv>. Handles 'get' magic, but
3884 not 'set' magic. See C<sv_catsv_mg>.
3886 =for apidoc sv_catsv_flags
3888 Concatenates the string from SV C<ssv> onto the end of the string in
3889 SV C<dsv>. Modifies C<dsv> but not C<ssv>. If C<flags> has C<SV_GMAGIC>
3890 bit set, will C<mg_get> on the SVs if appropriate, else not. C<sv_catsv>
3891 and C<sv_catsv_nomg> are implemented in terms of this function.
3896 Perl_sv_catsv_flags(pTHX_ SV *dsv, register SV *ssv, I32 flags)
3900 const char *spv = SvPV_const(ssv, slen);
3902 /* sutf8 and dutf8 were type bool, but under USE_ITHREADS,
3903 gcc version 2.95.2 20000220 (Debian GNU/Linux) for
3904 Linux xxx 2.2.17 on sparc64 with gcc -O2, we erroneously
3905 get dutf8 = 0x20000000, (i.e. SVf_UTF8) even though
3906 dsv->sv_flags doesn't have that bit set.
3907 Andy Dougherty 12 Oct 2001
3909 const I32 sutf8 = DO_UTF8(ssv);
3912 if (SvGMAGICAL(dsv) && (flags & SV_GMAGIC))
3914 dutf8 = DO_UTF8(dsv);
3916 if (dutf8 != sutf8) {
3918 /* Not modifying source SV, so taking a temporary copy. */
3919 SV* const csv = sv_2mortal(newSVpvn(spv, slen));
3921 sv_utf8_upgrade(csv);
3922 spv = SvPV_const(csv, slen);
3925 sv_utf8_upgrade_nomg(dsv);
3927 sv_catpvn_nomg(dsv, spv, slen);
3930 if (flags & SV_SMAGIC)
3935 =for apidoc sv_catpv
3937 Concatenates the string onto the end of the string which is in the SV.
3938 If the SV has the UTF-8 status set, then the bytes appended should be
3939 valid UTF-8. Handles 'get' magic, but not 'set' magic. See C<sv_catpv_mg>.
3944 Perl_sv_catpv(pTHX_ register SV *sv, register const char *ptr)
3946 register STRLEN len;
3952 junk = SvPV_force(sv, tlen);
3954 SvGROW(sv, tlen + len + 1);
3956 ptr = SvPVX_const(sv);
3957 Move(ptr,SvPVX(sv)+tlen,len+1,char);
3958 SvCUR_set(sv, SvCUR(sv) + len);
3959 (void)SvPOK_only_UTF8(sv); /* validate pointer */
3964 =for apidoc sv_catpv_mg
3966 Like C<sv_catpv>, but also handles 'set' magic.
3972 Perl_sv_catpv_mg(pTHX_ register SV *sv, register const char *ptr)
3981 Create a new null SV, or if len > 0, create a new empty SVt_PV type SV
3982 with an initial PV allocation of len+1. Normally accessed via the C<NEWSV>
3989 Perl_newSV(pTHX_ STRLEN len)
3995 sv_upgrade(sv, SVt_PV);
3996 SvGROW(sv, len + 1);
4001 =for apidoc sv_magicext
4003 Adds magic to an SV, upgrading it if necessary. Applies the
4004 supplied vtable and returns a pointer to the magic added.
4006 Note that C<sv_magicext> will allow things that C<sv_magic> will not.
4007 In particular, you can add magic to SvREADONLY SVs, and add more than
4008 one instance of the same 'how'.
4010 If C<namlen> is greater than zero then a C<savepvn> I<copy> of C<name> is
4011 stored, if C<namlen> is zero then C<name> is stored as-is and - as another
4012 special case - if C<(name && namlen == HEf_SVKEY)> then C<name> is assumed
4013 to contain an C<SV*> and is stored as-is with its REFCNT incremented.
4015 (This is now used as a subroutine by C<sv_magic>.)
4020 Perl_sv_magicext(pTHX_ SV* sv, SV* obj, int how, const MGVTBL *vtable,
4021 const char* name, I32 namlen)
4025 if (SvTYPE(sv) < SVt_PVMG) {
4026 SvUPGRADE(sv, SVt_PVMG);
4028 Newxz(mg, 1, MAGIC);
4029 mg->mg_moremagic = SvMAGIC(sv);
4030 SvMAGIC_set(sv, mg);
4032 /* Sometimes a magic contains a reference loop, where the sv and
4033 object refer to each other. To prevent a reference loop that
4034 would prevent such objects being freed, we look for such loops
4035 and if we find one we avoid incrementing the object refcount.
4037 Note we cannot do this to avoid self-tie loops as intervening RV must
4038 have its REFCNT incremented to keep it in existence.
4041 if (!obj || obj == sv ||
4042 how == PERL_MAGIC_arylen ||
4043 how == PERL_MAGIC_qr ||
4044 how == PERL_MAGIC_symtab ||
4045 (SvTYPE(obj) == SVt_PVGV &&
4046 (GvSV(obj) == sv || GvHV(obj) == (HV*)sv || GvAV(obj) == (AV*)sv ||
4047 GvCV(obj) == (CV*)sv || GvIOp(obj) == (IO*)sv ||
4048 GvFORM(obj) == (CV*)sv)))
4053 mg->mg_obj = SvREFCNT_inc(obj);
4054 mg->mg_flags |= MGf_REFCOUNTED;
4057 /* Normal self-ties simply pass a null object, and instead of
4058 using mg_obj directly, use the SvTIED_obj macro to produce a
4059 new RV as needed. For glob "self-ties", we are tieing the PVIO
4060 with an RV obj pointing to the glob containing the PVIO. In
4061 this case, to avoid a reference loop, we need to weaken the
4065 if (how == PERL_MAGIC_tiedscalar && SvTYPE(sv) == SVt_PVIO &&
4066 obj && SvROK(obj) && GvIO(SvRV(obj)) == (IO*)sv)
4072 mg->mg_len = namlen;
4075 mg->mg_ptr = savepvn(name, namlen);
4076 else if (namlen == HEf_SVKEY)
4077 mg->mg_ptr = (char*)SvREFCNT_inc((SV*)name);
4079 mg->mg_ptr = (char *) name;
4081 mg->mg_virtual = vtable;
4085 SvFLAGS(sv) &= ~(SVf_IOK|SVf_NOK|SVf_POK);
4090 =for apidoc sv_magic
4092 Adds magic to an SV. First upgrades C<sv> to type C<SVt_PVMG> if necessary,
4093 then adds a new magic item of type C<how> to the head of the magic list.
4095 See C<sv_magicext> (which C<sv_magic> now calls) for a description of the
4096 handling of the C<name> and C<namlen> arguments.
4098 You need to use C<sv_magicext> to add magic to SvREADONLY SVs and also
4099 to add more than one instance of the same 'how'.
4105 Perl_sv_magic(pTHX_ register SV *sv, SV *obj, int how, const char *name, I32 namlen)
4107 const MGVTBL *vtable;
4110 #ifdef PERL_OLD_COPY_ON_WRITE
4112 sv_force_normal_flags(sv, 0);
4114 if (SvREADONLY(sv)) {
4116 /* its okay to attach magic to shared strings; the subsequent
4117 * upgrade to PVMG will unshare the string */
4118 !(SvFAKE(sv) && SvTYPE(sv) < SVt_PVMG)
4121 && how != PERL_MAGIC_regex_global
4122 && how != PERL_MAGIC_bm
4123 && how != PERL_MAGIC_fm
4124 && how != PERL_MAGIC_sv
4125 && how != PERL_MAGIC_backref
4128 Perl_croak(aTHX_ PL_no_modify);
4131 if (SvMAGICAL(sv) || (how == PERL_MAGIC_taint && SvTYPE(sv) >= SVt_PVMG)) {
4132 if (SvMAGIC(sv) && (mg = mg_find(sv, how))) {
4133 /* sv_magic() refuses to add a magic of the same 'how' as an
4136 if (how == PERL_MAGIC_taint)
4144 vtable = &PL_vtbl_sv;
4146 case PERL_MAGIC_overload:
4147 vtable = &PL_vtbl_amagic;
4149 case PERL_MAGIC_overload_elem:
4150 vtable = &PL_vtbl_amagicelem;
4152 case PERL_MAGIC_overload_table:
4153 vtable = &PL_vtbl_ovrld;
4156 vtable = &PL_vtbl_bm;
4158 case PERL_MAGIC_regdata:
4159 vtable = &PL_vtbl_regdata;
4161 case PERL_MAGIC_regdatum:
4162 vtable = &PL_vtbl_regdatum;
4164 case PERL_MAGIC_env:
4165 vtable = &PL_vtbl_env;
4168 vtable = &PL_vtbl_fm;
4170 case PERL_MAGIC_envelem:
4171 vtable = &PL_vtbl_envelem;
4173 case PERL_MAGIC_regex_global:
4174 vtable = &PL_vtbl_mglob;
4176 case PERL_MAGIC_isa:
4177 vtable = &PL_vtbl_isa;
4179 case PERL_MAGIC_isaelem:
4180 vtable = &PL_vtbl_isaelem;
4182 case PERL_MAGIC_nkeys:
4183 vtable = &PL_vtbl_nkeys;
4185 case PERL_MAGIC_dbfile:
4188 case PERL_MAGIC_dbline:
4189 vtable = &PL_vtbl_dbline;
4191 #ifdef USE_LOCALE_COLLATE
4192 case PERL_MAGIC_collxfrm:
4193 vtable = &PL_vtbl_collxfrm;
4195 #endif /* USE_LOCALE_COLLATE */
4196 case PERL_MAGIC_tied:
4197 vtable = &PL_vtbl_pack;
4199 case PERL_MAGIC_tiedelem:
4200 case PERL_MAGIC_tiedscalar:
4201 vtable = &PL_vtbl_packelem;
4204 vtable = &PL_vtbl_regexp;
4206 case PERL_MAGIC_sig:
4207 vtable = &PL_vtbl_sig;
4209 case PERL_MAGIC_sigelem:
4210 vtable = &PL_vtbl_sigelem;
4212 case PERL_MAGIC_taint:
4213 vtable = &PL_vtbl_taint;
4215 case PERL_MAGIC_uvar:
4216 vtable = &PL_vtbl_uvar;
4218 case PERL_MAGIC_vec:
4219 vtable = &PL_vtbl_vec;
4221 case PERL_MAGIC_arylen_p:
4222 case PERL_MAGIC_rhash:
4223 case PERL_MAGIC_symtab:
4224 case PERL_MAGIC_vstring:
4227 case PERL_MAGIC_utf8:
4228 vtable = &PL_vtbl_utf8;
4230 case PERL_MAGIC_substr:
4231 vtable = &PL_vtbl_substr;
4233 case PERL_MAGIC_defelem:
4234 vtable = &PL_vtbl_defelem;
4236 case PERL_MAGIC_glob:
4237 vtable = &PL_vtbl_glob;
4239 case PERL_MAGIC_arylen:
4240 vtable = &PL_vtbl_arylen;
4242 case PERL_MAGIC_pos:
4243 vtable = &PL_vtbl_pos;
4245 case PERL_MAGIC_backref:
4246 vtable = &PL_vtbl_backref;
4248 case PERL_MAGIC_ext:
4249 /* Reserved for use by extensions not perl internals. */
4250 /* Useful for attaching extension internal data to perl vars. */
4251 /* Note that multiple extensions may clash if magical scalars */
4252 /* etc holding private data from one are passed to another. */
4256 Perl_croak(aTHX_ "Don't know how to handle magic of type \\%o", how);
4259 /* Rest of work is done else where */
4260 mg = sv_magicext(sv,obj,how,vtable,name,namlen);
4263 case PERL_MAGIC_taint:
4266 case PERL_MAGIC_ext:
4267 case PERL_MAGIC_dbfile:
4274 =for apidoc sv_unmagic
4276 Removes all magic of type C<type> from an SV.
4282 Perl_sv_unmagic(pTHX_ SV *sv, int type)
4286 if (SvTYPE(sv) < SVt_PVMG || !SvMAGIC(sv))
4289 for (mg = *mgp; mg; mg = *mgp) {
4290 if (mg->mg_type == type) {
4291 const MGVTBL* const vtbl = mg->mg_virtual;
4292 *mgp = mg->mg_moremagic;
4293 if (vtbl && vtbl->svt_free)
4294 CALL_FPTR(vtbl->svt_free)(aTHX_ sv, mg);
4295 if (mg->mg_ptr && mg->mg_type != PERL_MAGIC_regex_global) {
4297 Safefree(mg->mg_ptr);
4298 else if (mg->mg_len == HEf_SVKEY)
4299 SvREFCNT_dec((SV*)mg->mg_ptr);
4300 else if (mg->mg_type == PERL_MAGIC_utf8 && mg->mg_ptr)
4301 Safefree(mg->mg_ptr);
4303 if (mg->mg_flags & MGf_REFCOUNTED)
4304 SvREFCNT_dec(mg->mg_obj);
4308 mgp = &mg->mg_moremagic;
4312 SvFLAGS(sv) |= (SvFLAGS(sv) & (SVp_NOK|SVp_POK)) >> PRIVSHIFT;
4319 =for apidoc sv_rvweaken
4321 Weaken a reference: set the C<SvWEAKREF> flag on this RV; give the
4322 referred-to SV C<PERL_MAGIC_backref> magic if it hasn't already; and
4323 push a back-reference to this RV onto the array of backreferences
4324 associated with that magic.
4330 Perl_sv_rvweaken(pTHX_ SV *sv)
4333 if (!SvOK(sv)) /* let undefs pass */
4336 Perl_croak(aTHX_ "Can't weaken a nonreference");
4337 else if (SvWEAKREF(sv)) {
4338 if (ckWARN(WARN_MISC))
4339 Perl_warner(aTHX_ packWARN(WARN_MISC), "Reference is already weak");
4343 Perl_sv_add_backref(aTHX_ tsv, sv);
4349 /* Give tsv backref magic if it hasn't already got it, then push a
4350 * back-reference to sv onto the array associated with the backref magic.
4354 Perl_sv_add_backref(pTHX_ SV *tsv, SV *sv)
4358 if (SvMAGICAL(tsv) && (mg = mg_find(tsv, PERL_MAGIC_backref)))
4359 av = (AV*)mg->mg_obj;
4362 sv_magic(tsv, (SV*)av, PERL_MAGIC_backref, NULL, 0);
4363 /* av now has a refcnt of 2, which avoids it getting freed
4364 * before us during global cleanup. The extra ref is removed
4365 * by magic_killbackrefs() when tsv is being freed */
4367 if (AvFILLp(av) >= AvMAX(av)) {
4368 av_extend(av, AvFILLp(av)+1);
4370 AvARRAY(av)[++AvFILLp(av)] = sv; /* av_push() */
4373 /* delete a back-reference to ourselves from the backref magic associated
4374 * with the SV we point to.
4378 S_sv_del_backref(pTHX_ SV *tsv, SV *sv)
4384 if (!SvMAGICAL(tsv) || !(mg = mg_find(tsv, PERL_MAGIC_backref))) {
4385 if (PL_in_clean_all)
4388 if (!SvMAGICAL(tsv) || !(mg = mg_find(tsv, PERL_MAGIC_backref)))
4389 Perl_croak(aTHX_ "panic: del_backref");
4390 av = (AV *)mg->mg_obj;
4392 /* We shouldn't be in here more than once, but for paranoia reasons lets
4394 for (i = AvFILLp(av); i >= 0; i--) {
4396 const SSize_t fill = AvFILLp(av);
4398 /* We weren't the last entry.
4399 An unordered list has this property that you can take the
4400 last element off the end to fill the hole, and it's still
4401 an unordered list :-)
4406 AvFILLp(av) = fill - 1;
4412 =for apidoc sv_insert
4414 Inserts a string at the specified offset/length within the SV. Similar to
4415 the Perl substr() function.
4421 Perl_sv_insert(pTHX_ SV *bigstr, STRLEN offset, STRLEN len, const char *little, STRLEN littlelen)
4425 register char *midend;
4426 register char *bigend;
4432 Perl_croak(aTHX_ "Can't modify non-existent substring");
4433 SvPV_force(bigstr, curlen);
4434 (void)SvPOK_only_UTF8(bigstr);
4435 if (offset + len > curlen) {
4436 SvGROW(bigstr, offset+len+1);
4437 Zero(SvPVX(bigstr)+curlen, offset+len-curlen, char);
4438 SvCUR_set(bigstr, offset+len);
4442 i = littlelen - len;
4443 if (i > 0) { /* string might grow */
4444 big = SvGROW(bigstr, SvCUR(bigstr) + i + 1);
4445 mid = big + offset + len;
4446 midend = bigend = big + SvCUR(bigstr);
4449 while (midend > mid) /* shove everything down */
4450 *--bigend = *--midend;
4451 Move(little,big+offset,littlelen,char);
4452 SvCUR_set(bigstr, SvCUR(bigstr) + i);
4457 Move(little,SvPVX(bigstr)+offset,len,char);
4462 big = SvPVX(bigstr);
4465 bigend = big + SvCUR(bigstr);
4467 if (midend > bigend)
4468 Perl_croak(aTHX_ "panic: sv_insert");
4470 if (mid - big > bigend - midend) { /* faster to shorten from end */
4472 Move(little, mid, littlelen,char);
4475 i = bigend - midend;
4477 Move(midend, mid, i,char);
4481 SvCUR_set(bigstr, mid - big);
4483 else if ((i = mid - big)) { /* faster from front */
4484 midend -= littlelen;
4486 sv_chop(bigstr,midend-i);
4491 Move(little, mid, littlelen,char);
4493 else if (littlelen) {
4494 midend -= littlelen;
4495 sv_chop(bigstr,midend);
4496 Move(little,midend,littlelen,char);
4499 sv_chop(bigstr,midend);
4505 =for apidoc sv_replace
4507 Make the first argument a copy of the second, then delete the original.
4508 The target SV physically takes over ownership of the body of the source SV
4509 and inherits its flags; however, the target keeps any magic it owns,
4510 and any magic in the source is discarded.
4511 Note that this is a rather specialist SV copying operation; most of the
4512 time you'll want to use C<sv_setsv> or one of its many macro front-ends.
4518 Perl_sv_replace(pTHX_ register SV *sv, register SV *nsv)
4520 const U32 refcnt = SvREFCNT(sv);
4521 SV_CHECK_THINKFIRST_COW_DROP(sv);
4522 if (SvREFCNT(nsv) != 1) {
4523 Perl_croak(aTHX_ "panic: reference miscount on nsv in sv_replace() (%"
4524 UVuf " != 1)", (UV) SvREFCNT(nsv));
4526 if (SvMAGICAL(sv)) {
4530 sv_upgrade(nsv, SVt_PVMG);
4531 SvMAGIC_set(nsv, SvMAGIC(sv));
4532 SvFLAGS(nsv) |= SvMAGICAL(sv);
4534 SvMAGIC_set(sv, NULL);
4538 assert(!SvREFCNT(sv));
4539 #ifdef DEBUG_LEAKING_SCALARS
4540 sv->sv_flags = nsv->sv_flags;
4541 sv->sv_any = nsv->sv_any;
4542 sv->sv_refcnt = nsv->sv_refcnt;
4543 sv->sv_u = nsv->sv_u;
4545 StructCopy(nsv,sv,SV);
4547 /* Currently could join these into one piece of pointer arithmetic, but
4548 it would be unclear. */
4549 if(SvTYPE(sv) == SVt_IV)
4551 = (XPVIV*)((char*)&(sv->sv_u.svu_iv) - STRUCT_OFFSET(XPVIV, xiv_iv));
4552 else if (SvTYPE(sv) == SVt_RV) {
4553 SvANY(sv) = &sv->sv_u.svu_rv;
4557 #ifdef PERL_OLD_COPY_ON_WRITE
4558 if (SvIsCOW_normal(nsv)) {
4559 /* We need to follow the pointers around the loop to make the
4560 previous SV point to sv, rather than nsv. */
4563 while ((next = SV_COW_NEXT_SV(current)) != nsv) {
4566 assert(SvPVX_const(current) == SvPVX_const(nsv));
4568 /* Make the SV before us point to the SV after us. */
4570 PerlIO_printf(Perl_debug_log, "previous is\n");
4572 PerlIO_printf(Perl_debug_log,
4573 "move it from 0x%"UVxf" to 0x%"UVxf"\n",
4574 (UV) SV_COW_NEXT_SV(current), (UV) sv);
4576 SV_COW_NEXT_SV_SET(current, sv);
4579 SvREFCNT(sv) = refcnt;
4580 SvFLAGS(nsv) |= SVTYPEMASK; /* Mark as freed */
4586 =for apidoc sv_clear
4588 Clear an SV: call any destructors, free up any memory used by the body,
4589 and free the body itself. The SV's head is I<not> freed, although
4590 its type is set to all 1's so that it won't inadvertently be assumed
4591 to be live during global destruction etc.
4592 This function should only be called when REFCNT is zero. Most of the time
4593 you'll want to call C<sv_free()> (or its macro wrapper C<SvREFCNT_dec>)
4600 Perl_sv_clear(pTHX_ register SV *sv)
4603 const U32 type = SvTYPE(sv);
4604 const struct body_details *const sv_type_details
4605 = bodies_by_type + type;
4608 assert(SvREFCNT(sv) == 0);
4614 if (PL_defstash) { /* Still have a symbol table? */
4619 stash = SvSTASH(sv);
4620 destructor = StashHANDLER(stash,DESTROY);
4622 SV* const tmpref = newRV(sv);
4623 SvREADONLY_on(tmpref); /* DESTROY() could be naughty */
4625 PUSHSTACKi(PERLSI_DESTROY);
4630 call_sv((SV*)destructor, G_DISCARD|G_EVAL|G_KEEPERR|G_VOID);
4636 if(SvREFCNT(tmpref) < 2) {
4637 /* tmpref is not kept alive! */
4639 SvRV_set(tmpref, NULL);
4642 SvREFCNT_dec(tmpref);
4644 } while (SvOBJECT(sv) && SvSTASH(sv) != stash);
4648 if (PL_in_clean_objs)
4649 Perl_croak(aTHX_ "DESTROY created new reference to dead object '%s'",
4651 /* DESTROY gave object new lease on life */
4657 SvREFCNT_dec(SvSTASH(sv)); /* possibly of changed persuasion */
4658 SvOBJECT_off(sv); /* Curse the object. */
4659 if (type != SVt_PVIO)
4660 --PL_sv_objcount; /* XXX Might want something more general */
4663 if (type >= SVt_PVMG) {
4666 if (type == SVt_PVMG && SvFLAGS(sv) & SVpad_TYPED)
4667 SvREFCNT_dec(SvSTASH(sv));
4672 IoIFP(sv) != PerlIO_stdin() &&
4673 IoIFP(sv) != PerlIO_stdout() &&
4674 IoIFP(sv) != PerlIO_stderr())
4676 io_close((IO*)sv, FALSE);
4678 if (IoDIRP(sv) && !(IoFLAGS(sv) & IOf_FAKE_DIRP))
4679 PerlDir_close(IoDIRP(sv));
4680 IoDIRP(sv) = (DIR*)NULL;
4681 Safefree(IoTOP_NAME(sv));
4682 Safefree(IoFMT_NAME(sv));
4683 Safefree(IoBOTTOM_NAME(sv));
4698 if (LvTYPE(sv) == 'T') { /* for tie: return HE to pool */
4699 SvREFCNT_dec(HeKEY_sv((HE*)LvTARG(sv)));
4700 HeNEXT((HE*)LvTARG(sv)) = PL_hv_fetch_ent_mh;
4701 PL_hv_fetch_ent_mh = (HE*)LvTARG(sv);
4703 else if (LvTYPE(sv) != 't') /* unless tie: unrefcnted fake SV** */
4704 SvREFCNT_dec(LvTARG(sv));
4708 Safefree(GvNAME(sv));
4709 /* If we're in a stash, we don't own a reference to it. However it does
4710 have a back reference to us, which needs to be cleared. */
4712 sv_del_backref((SV*)GvSTASH(sv), sv);
4717 /* Don't bother with SvOOK_off(sv); as we're only going to free it. */
4719 SvPV_set(sv, SvPVX_mutable(sv) - SvIVX(sv));
4720 /* Don't even bother with turning off the OOK flag. */
4725 SV *target = SvRV(sv);
4727 sv_del_backref(target, sv);
4729 SvREFCNT_dec(target);
4731 #ifdef PERL_OLD_COPY_ON_WRITE
4732 else if (SvPVX_const(sv)) {
4734 /* I believe I need to grab the global SV mutex here and
4735 then recheck the COW status. */
4737 PerlIO_printf(Perl_debug_log, "Copy on write: clear\n");
4740 sv_release_COW(sv, SvPVX_const(sv), SvLEN(sv),
4741 SV_COW_NEXT_SV(sv));
4742 /* And drop it here. */
4744 } else if (SvLEN(sv)) {
4745 Safefree(SvPVX_const(sv));
4749 else if (SvPVX_const(sv) && SvLEN(sv))
4750 Safefree(SvPVX_mutable(sv));
4751 else if (SvPVX_const(sv) && SvREADONLY(sv) && SvFAKE(sv)) {
4752 unshare_hek(SvSHARED_HEK_FROM_PV(SvPVX_const(sv)));
4761 SvFLAGS(sv) &= SVf_BREAK;
4762 SvFLAGS(sv) |= SVTYPEMASK;
4764 if (sv_type_details->arena) {
4765 del_body(((char *)SvANY(sv) + sv_type_details->offset),
4766 &PL_body_roots[type]);
4768 else if (sv_type_details->size) {
4769 my_safefree(SvANY(sv));
4774 =for apidoc sv_newref
4776 Increment an SV's reference count. Use the C<SvREFCNT_inc()> wrapper
4783 Perl_sv_newref(pTHX_ SV *sv)
4793 Decrement an SV's reference count, and if it drops to zero, call
4794 C<sv_clear> to invoke destructors and free up any memory used by
4795 the body; finally, deallocate the SV's head itself.
4796 Normally called via a wrapper macro C<SvREFCNT_dec>.
4802 Perl_sv_free(pTHX_ SV *sv)
4807 if (SvREFCNT(sv) == 0) {
4808 if (SvFLAGS(sv) & SVf_BREAK)
4809 /* this SV's refcnt has been artificially decremented to
4810 * trigger cleanup */
4812 if (PL_in_clean_all) /* All is fair */
4814 if (SvREADONLY(sv) && SvIMMORTAL(sv)) {
4815 /* make sure SvREFCNT(sv)==0 happens very seldom */
4816 SvREFCNT(sv) = (~(U32)0)/2;
4819 if (ckWARN_d(WARN_INTERNAL)) {
4820 Perl_warner(aTHX_ packWARN(WARN_INTERNAL),
4821 "Attempt to free unreferenced scalar: SV 0x%"UVxf
4822 pTHX__FORMAT, PTR2UV(sv) pTHX__VALUE);
4823 #ifdef DEBUG_LEAKING_SCALARS_FORK_DUMP
4824 Perl_dump_sv_child(aTHX_ sv);
4829 if (--(SvREFCNT(sv)) > 0)
4831 Perl_sv_free2(aTHX_ sv);
4835 Perl_sv_free2(pTHX_ SV *sv)
4840 if (ckWARN_d(WARN_DEBUGGING))
4841 Perl_warner(aTHX_ packWARN(WARN_DEBUGGING),
4842 "Attempt to free temp prematurely: SV 0x%"UVxf
4843 pTHX__FORMAT, PTR2UV(sv) pTHX__VALUE);
4847 if (SvREADONLY(sv) && SvIMMORTAL(sv)) {
4848 /* make sure SvREFCNT(sv)==0 happens very seldom */
4849 SvREFCNT(sv) = (~(U32)0)/2;
4860 Returns the length of the string in the SV. Handles magic and type
4861 coercion. See also C<SvCUR>, which gives raw access to the xpv_cur slot.
4867 Perl_sv_len(pTHX_ register SV *sv)
4875 len = mg_length(sv);
4877 (void)SvPV_const(sv, len);
4882 =for apidoc sv_len_utf8
4884 Returns the number of characters in the string in an SV, counting wide
4885 UTF-8 bytes as a single character. Handles magic and type coercion.
4891 * The length is cached in PERL_UTF8_magic, in the mg_len field. Also the
4892 * mg_ptr is used, by sv_pos_u2b(), see the comments of S_utf8_mg_pos_init().
4893 * (Note that the mg_len is not the length of the mg_ptr field.)
4898 Perl_sv_len_utf8(pTHX_ register SV *sv)
4904 return mg_length(sv);
4908 const U8 *s = (U8*)SvPV_const(sv, len);
4909 MAGIC *mg = SvMAGICAL(sv) ? mg_find(sv, PERL_MAGIC_utf8) : 0;
4911 if (mg && mg->mg_len != -1 && (mg->mg_len > 0 || len == 0)) {
4913 #ifdef PERL_UTF8_CACHE_ASSERT
4914 assert(ulen == Perl_utf8_length(aTHX_ s, s + len));
4918 ulen = Perl_utf8_length(aTHX_ s, s + len);
4919 if (!mg && !SvREADONLY(sv)) {
4920 sv_magic(sv, 0, PERL_MAGIC_utf8, 0, 0);
4921 mg = mg_find(sv, PERL_MAGIC_utf8);
4931 /* S_utf8_mg_pos_init() is used to initialize the mg_ptr field of
4932 * a PERL_UTF8_magic. The mg_ptr is used to store the mapping
4933 * between UTF-8 and byte offsets. There are two (substr offset and substr
4934 * length, the i offset, PERL_MAGIC_UTF8_CACHESIZE) times two (UTF-8 offset
4935 * and byte offset) cache positions.
4937 * The mg_len field is used by sv_len_utf8(), see its comments.
4938 * Note that the mg_len is not the length of the mg_ptr field.
4942 S_utf8_mg_pos_init(pTHX_ SV *sv, MAGIC **mgp, STRLEN **cachep, I32 i,
4943 I32 offsetp, const U8 *s, const U8 *start)
4947 if (SvMAGICAL(sv) && !SvREADONLY(sv)) {
4949 *mgp = sv_magicext(sv, 0, PERL_MAGIC_utf8, (MGVTBL*)&PL_vtbl_utf8, 0, 0);
4953 *cachep = (STRLEN *) (*mgp)->mg_ptr;
4955 Newxz(*cachep, PERL_MAGIC_UTF8_CACHESIZE * 2, STRLEN);
4956 (*mgp)->mg_ptr = (char *) *cachep;
4960 (*cachep)[i] = offsetp;
4961 (*cachep)[i+1] = s - start;
4969 * S_utf8_mg_pos() is used to query and update mg_ptr field of
4970 * a PERL_UTF8_magic. The mg_ptr is used to store the mapping
4971 * between UTF-8 and byte offsets. See also the comments of
4972 * S_utf8_mg_pos_init().
4976 S_utf8_mg_pos(pTHX_ SV *sv, MAGIC **mgp, STRLEN **cachep, I32 i, I32 *offsetp, I32 uoff, const U8 **sp, const U8 *start, const U8 *send)
4980 if (SvMAGICAL(sv) && !SvREADONLY(sv)) {
4982 *mgp = mg_find(sv, PERL_MAGIC_utf8);
4983 if (*mgp && (*mgp)->mg_ptr) {
4984 *cachep = (STRLEN *) (*mgp)->mg_ptr;
4985 ASSERT_UTF8_CACHE(*cachep);
4986 if ((*cachep)[i] == (STRLEN)uoff) /* An exact match. */
4988 else { /* We will skip to the right spot. */
4993 /* The assumption is that going backward is half
4994 * the speed of going forward (that's where the
4995 * 2 * backw in the below comes from). (The real
4996 * figure of course depends on the UTF-8 data.) */
4998 if ((*cachep)[i] > (STRLEN)uoff) {
5000 backw = (*cachep)[i] - (STRLEN)uoff;
5002 if (forw < 2 * backw)
5005 p = start + (*cachep)[i+1];
5007 /* Try this only for the substr offset (i == 0),
5008 * not for the substr length (i == 2). */
5009 else if (i == 0) { /* (*cachep)[i] < uoff */
5010 const STRLEN ulen = sv_len_utf8(sv);
5012 if ((STRLEN)uoff < ulen) {
5013 forw = (STRLEN)uoff - (*cachep)[i];
5014 backw = ulen - (STRLEN)uoff;
5016 if (forw < 2 * backw)
5017 p = start + (*cachep)[i+1];
5022 /* If the string is not long enough for uoff,
5023 * we could extend it, but not at this low a level. */
5027 if (forw < 2 * backw) {
5034 while (UTF8_IS_CONTINUATION(*p))
5039 /* Update the cache. */
5040 (*cachep)[i] = (STRLEN)uoff;
5041 (*cachep)[i+1] = p - start;
5043 /* Drop the stale "length" cache */
5052 if (found) { /* Setup the return values. */
5053 *offsetp = (*cachep)[i+1];
5054 *sp = start + *offsetp;
5057 *offsetp = send - start;
5059 else if (*sp < start) {
5065 #ifdef PERL_UTF8_CACHE_ASSERT
5070 while (n-- && s < send)
5074 assert(*offsetp == s - start);
5075 assert((*cachep)[0] == (STRLEN)uoff);
5076 assert((*cachep)[1] == *offsetp);
5078 ASSERT_UTF8_CACHE(*cachep);
5087 =for apidoc sv_pos_u2b
5089 Converts the value pointed to by offsetp from a count of UTF-8 chars from
5090 the start of the string, to a count of the equivalent number of bytes; if
5091 lenp is non-zero, it does the same to lenp, but this time starting from
5092 the offset, rather than from the start of the string. Handles magic and
5099 * sv_pos_u2b() uses, like sv_pos_b2u(), the mg_ptr of the potential
5100 * PERL_UTF8_magic of the sv to store the mapping between UTF-8 and
5101 * byte offsets. See also the comments of S_utf8_mg_pos().
5106 Perl_sv_pos_u2b(pTHX_ register SV *sv, I32* offsetp, I32* lenp)
5114 start = (U8*)SvPV_const(sv, len);
5118 const U8 *s = start;
5119 I32 uoffset = *offsetp;
5120 const U8 * const send = s + len;
5124 if (utf8_mg_pos(sv, &mg, &cache, 0, offsetp, *offsetp, &s, start, send))
5126 if (!found && uoffset > 0) {
5127 while (s < send && uoffset--)
5131 if (utf8_mg_pos_init(sv, &mg, &cache, 0, *offsetp, s, start))
5133 *offsetp = s - start;
5138 if (utf8_mg_pos(sv, &mg, &cache, 2, lenp, *lenp, &s, start, send)) {
5142 if (!found && *lenp > 0) {
5145 while (s < send && ulen--)
5149 utf8_mg_pos_init(sv, &mg, &cache, 2, *lenp, s, start);
5153 ASSERT_UTF8_CACHE(cache);
5165 =for apidoc sv_pos_b2u
5167 Converts the value pointed to by offsetp from a count of bytes from the
5168 start of the string, to a count of the equivalent number of UTF-8 chars.
5169 Handles magic and type coercion.
5175 * sv_pos_b2u() uses, like sv_pos_u2b(), the mg_ptr of the potential
5176 * PERL_UTF8_magic of the sv to store the mapping between UTF-8 and
5177 * byte offsets. See also the comments of S_utf8_mg_pos().
5182 Perl_sv_pos_b2u(pTHX_ register SV* sv, I32* offsetp)
5190 s = (const U8*)SvPV_const(sv, len);
5191 if ((I32)len < *offsetp)
5192 Perl_croak(aTHX_ "panic: sv_pos_b2u: bad byte offset");
5194 const U8* send = s + *offsetp;
5196 STRLEN *cache = NULL;
5200 if (SvMAGICAL(sv) && !SvREADONLY(sv)) {
5201 mg = mg_find(sv, PERL_MAGIC_utf8);
5202 if (mg && mg->mg_ptr) {
5203 cache = (STRLEN *) mg->mg_ptr;
5204 if (cache[1] == (STRLEN)*offsetp) {
5205 /* An exact match. */
5206 *offsetp = cache[0];
5210 else if (cache[1] < (STRLEN)*offsetp) {
5211 /* We already know part of the way. */
5214 /* Let the below loop do the rest. */
5216 else { /* cache[1] > *offsetp */
5217 /* We already know all of the way, now we may
5218 * be able to walk back. The same assumption
5219 * is made as in S_utf8_mg_pos(), namely that
5220 * walking backward is twice slower than
5221 * walking forward. */
5222 const STRLEN forw = *offsetp;
5223 STRLEN backw = cache[1] - *offsetp;
5225 if (!(forw < 2 * backw)) {
5226 const U8 *p = s + cache[1];
5233 while (UTF8_IS_CONTINUATION(*p)) {
5241 *offsetp = cache[0];
5243 /* Drop the stale "length" cache */
5251 ASSERT_UTF8_CACHE(cache);
5257 /* Call utf8n_to_uvchr() to validate the sequence
5258 * (unless a simple non-UTF character) */
5259 if (!UTF8_IS_INVARIANT(*s))
5260 utf8n_to_uvchr(s, UTF8SKIP(s), &n, 0);
5269 if (!SvREADONLY(sv)) {
5271 sv_magic(sv, 0, PERL_MAGIC_utf8, 0, 0);
5272 mg = mg_find(sv, PERL_MAGIC_utf8);
5277 Newxz(cache, PERL_MAGIC_UTF8_CACHESIZE * 2, STRLEN);
5278 mg->mg_ptr = (char *) cache;
5283 cache[1] = *offsetp;
5284 /* Drop the stale "length" cache */
5297 Returns a boolean indicating whether the strings in the two SVs are
5298 identical. Is UTF-8 and 'use bytes' aware, handles get magic, and will
5299 coerce its args to strings if necessary.
5305 Perl_sv_eq(pTHX_ register SV *sv1, register SV *sv2)
5313 SV* svrecode = Nullsv;
5320 pv1 = SvPV_const(sv1, cur1);
5327 pv2 = SvPV_const(sv2, cur2);
5329 if (cur1 && cur2 && SvUTF8(sv1) != SvUTF8(sv2) && !IN_BYTES) {
5330 /* Differing utf8ness.
5331 * Do not UTF8size the comparands as a side-effect. */
5334 svrecode = newSVpvn(pv2, cur2);
5335 sv_recode_to_utf8(svrecode, PL_encoding);
5336 pv2 = SvPV_const(svrecode, cur2);
5339 svrecode = newSVpvn(pv1, cur1);
5340 sv_recode_to_utf8(svrecode, PL_encoding);
5341 pv1 = SvPV_const(svrecode, cur1);
5343 /* Now both are in UTF-8. */
5345 SvREFCNT_dec(svrecode);
5350 bool is_utf8 = TRUE;
5353 /* sv1 is the UTF-8 one,
5354 * if is equal it must be downgrade-able */
5355 char * const pv = (char*)bytes_from_utf8((const U8*)pv1,
5361 /* sv2 is the UTF-8 one,
5362 * if is equal it must be downgrade-able */
5363 char * const pv = (char *)bytes_from_utf8((const U8*)pv2,
5369 /* Downgrade not possible - cannot be eq */
5377 eq = (pv1 == pv2) || memEQ(pv1, pv2, cur1);
5380 SvREFCNT_dec(svrecode);
5391 Compares the strings in two SVs. Returns -1, 0, or 1 indicating whether the
5392 string in C<sv1> is less than, equal to, or greater than the string in
5393 C<sv2>. Is UTF-8 and 'use bytes' aware, handles get magic, and will
5394 coerce its args to strings if necessary. See also C<sv_cmp_locale>.
5400 Perl_sv_cmp(pTHX_ register SV *sv1, register SV *sv2)
5403 const char *pv1, *pv2;
5406 SV *svrecode = Nullsv;
5413 pv1 = SvPV_const(sv1, cur1);
5420 pv2 = SvPV_const(sv2, cur2);
5422 if (cur1 && cur2 && SvUTF8(sv1) != SvUTF8(sv2) && !IN_BYTES) {
5423 /* Differing utf8ness.
5424 * Do not UTF8size the comparands as a side-effect. */
5427 svrecode = newSVpvn(pv2, cur2);
5428 sv_recode_to_utf8(svrecode, PL_encoding);
5429 pv2 = SvPV_const(svrecode, cur2);
5432 pv2 = tpv = (char*)bytes_to_utf8((const U8*)pv2, &cur2);
5437 svrecode = newSVpvn(pv1, cur1);
5438 sv_recode_to_utf8(svrecode, PL_encoding);
5439 pv1 = SvPV_const(svrecode, cur1);
5442 pv1 = tpv = (char*)bytes_to_utf8((const U8*)pv1, &cur1);
5448 cmp = cur2 ? -1 : 0;
5452 const I32 retval = memcmp((const void*)pv1, (const void*)pv2, cur1 < cur2 ? cur1 : cur2);
5455 cmp = retval < 0 ? -1 : 1;
5456 } else if (cur1 == cur2) {
5459 cmp = cur1 < cur2 ? -1 : 1;
5464 SvREFCNT_dec(svrecode);
5473 =for apidoc sv_cmp_locale
5475 Compares the strings in two SVs in a locale-aware manner. Is UTF-8 and
5476 'use bytes' aware, handles get magic, and will coerce its args to strings
5477 if necessary. See also C<sv_cmp_locale>. See also C<sv_cmp>.
5483 Perl_sv_cmp_locale(pTHX_ register SV *sv1, register SV *sv2)
5485 #ifdef USE_LOCALE_COLLATE
5491 if (PL_collation_standard)
5495 pv1 = sv1 ? sv_collxfrm(sv1, &len1) : (char *) NULL;
5497 pv2 = sv2 ? sv_collxfrm(sv2, &len2) : (char *) NULL;
5499 if (!pv1 || !len1) {
5510 retval = memcmp((void*)pv1, (void*)pv2, len1 < len2 ? len1 : len2);
5513 return retval < 0 ? -1 : 1;
5516 * When the result of collation is equality, that doesn't mean
5517 * that there are no differences -- some locales exclude some
5518 * characters from consideration. So to avoid false equalities,
5519 * we use the raw string as a tiebreaker.
5525 #endif /* USE_LOCALE_COLLATE */
5527 return sv_cmp(sv1, sv2);
5531 #ifdef USE_LOCALE_COLLATE
5534 =for apidoc sv_collxfrm
5536 Add Collate Transform magic to an SV if it doesn't already have it.
5538 Any scalar variable may carry PERL_MAGIC_collxfrm magic that contains the
5539 scalar data of the variable, but transformed to such a format that a normal
5540 memory comparison can be used to compare the data according to the locale
5547 Perl_sv_collxfrm(pTHX_ SV *sv, STRLEN *nxp)
5551 mg = SvMAGICAL(sv) ? mg_find(sv, PERL_MAGIC_collxfrm) : (MAGIC *) NULL;
5552 if (!mg || !mg->mg_ptr || *(U32*)mg->mg_ptr != PL_collation_ix) {
5558 Safefree(mg->mg_ptr);
5559 s = SvPV_const(sv, len);
5560 if ((xf = mem_collxfrm(s, len, &xlen))) {
5561 if (SvREADONLY(sv)) {
5564 return xf + sizeof(PL_collation_ix);
5567 sv_magic(sv, 0, PERL_MAGIC_collxfrm, 0, 0);
5568 mg = mg_find(sv, PERL_MAGIC_collxfrm);
5581 if (mg && mg->mg_ptr) {
5583 return mg->mg_ptr + sizeof(PL_collation_ix);
5591 #endif /* USE_LOCALE_COLLATE */
5596 Get a line from the filehandle and store it into the SV, optionally
5597 appending to the currently-stored string.
5603 Perl_sv_gets(pTHX_ register SV *sv, register PerlIO *fp, I32 append)
5607 register STDCHAR rslast;
5608 register STDCHAR *bp;
5614 if (SvTHINKFIRST(sv))
5615 sv_force_normal_flags(sv, append ? 0 : SV_COW_DROP_PV);
5616 /* XXX. If you make this PVIV, then copy on write can copy scalars read
5618 However, perlbench says it's slower, because the existing swipe code
5619 is faster than copy on write.
5620 Swings and roundabouts. */
5621 SvUPGRADE(sv, SVt_PV);
5626 if (PerlIO_isutf8(fp)) {
5628 sv_utf8_upgrade_nomg(sv);
5629 sv_pos_u2b(sv,&append,0);
5631 } else if (SvUTF8(sv)) {
5632 SV * const tsv = NEWSV(0,0);
5633 sv_gets(tsv, fp, 0);
5634 sv_utf8_upgrade_nomg(tsv);
5635 SvCUR_set(sv,append);
5638 goto return_string_or_null;
5643 if (PerlIO_isutf8(fp))
5646 if (IN_PERL_COMPILETIME) {
5647 /* we always read code in line mode */
5651 else if (RsSNARF(PL_rs)) {
5652 /* If it is a regular disk file use size from stat() as estimate
5653 of amount we are going to read - may result in malloc-ing
5654 more memory than we realy need if layers bellow reduce
5655 size we read (e.g. CRLF or a gzip layer)
5658 if (!PerlLIO_fstat(PerlIO_fileno(fp), &st) && S_ISREG(st.st_mode)) {
5659 const Off_t offset = PerlIO_tell(fp);
5660 if (offset != (Off_t) -1 && st.st_size + append > offset) {
5661 (void) SvGROW(sv, (STRLEN)((st.st_size - offset) + append + 1));
5667 else if (RsRECORD(PL_rs)) {
5671 /* Grab the size of the record we're getting */
5672 recsize = SvIV(SvRV(PL_rs));
5673 buffer = SvGROW(sv, (STRLEN)(recsize + append + 1)) + append;
5676 /* VMS wants read instead of fread, because fread doesn't respect */
5677 /* RMS record boundaries. This is not necessarily a good thing to be */
5678 /* doing, but we've got no other real choice - except avoid stdio
5679 as implementation - perhaps write a :vms layer ?
5681 bytesread = PerlLIO_read(PerlIO_fileno(fp), buffer, recsize);
5683 bytesread = PerlIO_read(fp, buffer, recsize);
5687 SvCUR_set(sv, bytesread += append);
5688 buffer[bytesread] = '\0';
5689 goto return_string_or_null;
5691 else if (RsPARA(PL_rs)) {
5697 /* Get $/ i.e. PL_rs into same encoding as stream wants */
5698 if (PerlIO_isutf8(fp)) {
5699 rsptr = SvPVutf8(PL_rs, rslen);
5702 if (SvUTF8(PL_rs)) {
5703 if (!sv_utf8_downgrade(PL_rs, TRUE)) {
5704 Perl_croak(aTHX_ "Wide character in $/");
5707 rsptr = SvPV_const(PL_rs, rslen);
5711 rslast = rslen ? rsptr[rslen - 1] : '\0';
5713 if (rspara) { /* have to do this both before and after */
5714 do { /* to make sure file boundaries work right */
5717 i = PerlIO_getc(fp);
5721 PerlIO_ungetc(fp,i);
5727 /* See if we know enough about I/O mechanism to cheat it ! */
5729 /* This used to be #ifdef test - it is made run-time test for ease
5730 of abstracting out stdio interface. One call should be cheap
5731 enough here - and may even be a macro allowing compile
5735 if (PerlIO_fast_gets(fp)) {
5738 * We're going to steal some values from the stdio struct
5739 * and put EVERYTHING in the innermost loop into registers.
5741 register STDCHAR *ptr;
5745 #if defined(VMS) && defined(PERLIO_IS_STDIO)
5746 /* An ungetc()d char is handled separately from the regular
5747 * buffer, so we getc() it back out and stuff it in the buffer.
5749 i = PerlIO_getc(fp);
5750 if (i == EOF) return 0;
5751 *(--((*fp)->_ptr)) = (unsigned char) i;
5755 /* Here is some breathtakingly efficient cheating */
5757 cnt = PerlIO_get_cnt(fp); /* get count into register */
5758 /* make sure we have the room */
5759 if ((I32)(SvLEN(sv) - append) <= cnt + 1) {
5760 /* Not room for all of it
5761 if we are looking for a separator and room for some
5763 if (rslen && cnt > 80 && (I32)SvLEN(sv) > append) {
5764 /* just process what we have room for */
5765 shortbuffered = cnt - SvLEN(sv) + append + 1;
5766 cnt -= shortbuffered;
5770 /* remember that cnt can be negative */
5771 SvGROW(sv, (STRLEN)(append + (cnt <= 0 ? 2 : (cnt + 1))));
5776 bp = (STDCHAR*)SvPVX_const(sv) + append; /* move these two too to registers */
5777 ptr = (STDCHAR*)PerlIO_get_ptr(fp);
5778 DEBUG_P(PerlIO_printf(Perl_debug_log,
5779 "Screamer: entering, ptr=%"UVuf", cnt=%ld\n",PTR2UV(ptr),(long)cnt));
5780 DEBUG_P(PerlIO_printf(Perl_debug_log,
5781 "Screamer: entering: PerlIO * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
5782 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
5783 PTR2UV(PerlIO_has_base(fp) ? PerlIO_get_base(fp) : 0)));
5788 while (cnt > 0) { /* this | eat */
5790 if ((*bp++ = *ptr++) == rslast) /* really | dust */
5791 goto thats_all_folks; /* screams | sed :-) */
5795 Copy(ptr, bp, cnt, char); /* this | eat */
5796 bp += cnt; /* screams | dust */
5797 ptr += cnt; /* louder | sed :-) */
5802 if (shortbuffered) { /* oh well, must extend */
5803 cnt = shortbuffered;
5805 bpx = bp - (STDCHAR*)SvPVX_const(sv); /* box up before relocation */
5807 SvGROW(sv, SvLEN(sv) + append + cnt + 2);
5808 bp = (STDCHAR*)SvPVX_const(sv) + bpx; /* unbox after relocation */
5812 DEBUG_P(PerlIO_printf(Perl_debug_log,
5813 "Screamer: going to getc, ptr=%"UVuf", cnt=%ld\n",
5814 PTR2UV(ptr),(long)cnt));
5815 PerlIO_set_ptrcnt(fp, (STDCHAR*)ptr, cnt); /* deregisterize cnt and ptr */
5817 DEBUG_P(PerlIO_printf(Perl_debug_log,
5818 "Screamer: pre: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
5819 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
5820 PTR2UV(PerlIO_has_base (fp) ? PerlIO_get_base(fp) : 0)));
5822 /* This used to call 'filbuf' in stdio form, but as that behaves like
5823 getc when cnt <= 0 we use PerlIO_getc here to avoid introducing
5824 another abstraction. */
5825 i = PerlIO_getc(fp); /* get more characters */
5827 DEBUG_P(PerlIO_printf(Perl_debug_log,
5828 "Screamer: post: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
5829 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
5830 PTR2UV(PerlIO_has_base (fp) ? PerlIO_get_base(fp) : 0)));
5832 cnt = PerlIO_get_cnt(fp);
5833 ptr = (STDCHAR*)PerlIO_get_ptr(fp); /* reregisterize cnt and ptr */
5834 DEBUG_P(PerlIO_printf(Perl_debug_log,
5835 "Screamer: after getc, ptr=%"UVuf", cnt=%ld\n",PTR2UV(ptr),(long)cnt));
5837 if (i == EOF) /* all done for ever? */
5838 goto thats_really_all_folks;
5840 bpx = bp - (STDCHAR*)SvPVX_const(sv); /* box up before relocation */
5842 SvGROW(sv, bpx + cnt + 2);
5843 bp = (STDCHAR*)SvPVX_const(sv) + bpx; /* unbox after relocation */
5845 *bp++ = (STDCHAR)i; /* store character from PerlIO_getc */
5847 if (rslen && (STDCHAR)i == rslast) /* all done for now? */
5848 goto thats_all_folks;
5852 if ((rslen > 1 && (STRLEN)(bp - (STDCHAR*)SvPVX_const(sv)) < rslen) ||
5853 memNE((char*)bp - rslen, rsptr, rslen))
5854 goto screamer; /* go back to the fray */
5855 thats_really_all_folks:
5857 cnt += shortbuffered;
5858 DEBUG_P(PerlIO_printf(Perl_debug_log,
5859 "Screamer: quitting, ptr=%"UVuf", cnt=%ld\n",PTR2UV(ptr),(long)cnt));
5860 PerlIO_set_ptrcnt(fp, (STDCHAR*)ptr, cnt); /* put these back or we're in trouble */
5861 DEBUG_P(PerlIO_printf(Perl_debug_log,
5862 "Screamer: end: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
5863 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
5864 PTR2UV(PerlIO_has_base (fp) ? PerlIO_get_base(fp) : 0)));
5866 SvCUR_set(sv, bp - (STDCHAR*)SvPVX_const(sv)); /* set length */
5867 DEBUG_P(PerlIO_printf(Perl_debug_log,
5868 "Screamer: done, len=%ld, string=|%.*s|\n",
5869 (long)SvCUR(sv),(int)SvCUR(sv),SvPVX_const(sv)));
5873 /*The big, slow, and stupid way. */
5874 #ifdef USE_HEAP_INSTEAD_OF_STACK /* Even slower way. */
5876 Newx(buf, 8192, STDCHAR);
5884 register const STDCHAR * const bpe = buf + sizeof(buf);
5886 while ((i = PerlIO_getc(fp)) != EOF && (*bp++ = (STDCHAR)i) != rslast && bp < bpe)
5887 ; /* keep reading */
5891 cnt = PerlIO_read(fp,(char*)buf, sizeof(buf));
5892 /* Accomodate broken VAXC compiler, which applies U8 cast to
5893 * both args of ?: operator, causing EOF to change into 255
5896 i = (U8)buf[cnt - 1];
5902 cnt = 0; /* we do need to re-set the sv even when cnt <= 0 */
5904 sv_catpvn(sv, (char *) buf, cnt);
5906 sv_setpvn(sv, (char *) buf, cnt);
5908 if (i != EOF && /* joy */
5910 SvCUR(sv) < rslen ||
5911 memNE(SvPVX_const(sv) + SvCUR(sv) - rslen, rsptr, rslen)))
5915 * If we're reading from a TTY and we get a short read,
5916 * indicating that the user hit his EOF character, we need
5917 * to notice it now, because if we try to read from the TTY
5918 * again, the EOF condition will disappear.
5920 * The comparison of cnt to sizeof(buf) is an optimization
5921 * that prevents unnecessary calls to feof().
5925 if (!(cnt < sizeof(buf) && PerlIO_eof(fp)))
5929 #ifdef USE_HEAP_INSTEAD_OF_STACK
5934 if (rspara) { /* have to do this both before and after */
5935 while (i != EOF) { /* to make sure file boundaries work right */
5936 i = PerlIO_getc(fp);
5938 PerlIO_ungetc(fp,i);
5944 return_string_or_null:
5945 return (SvCUR(sv) - append) ? SvPVX(sv) : Nullch;
5951 Auto-increment of the value in the SV, doing string to numeric conversion
5952 if necessary. Handles 'get' magic.
5958 Perl_sv_inc(pTHX_ register SV *sv)
5966 if (SvTHINKFIRST(sv)) {
5968 sv_force_normal_flags(sv, 0);
5969 if (SvREADONLY(sv)) {
5970 if (IN_PERL_RUNTIME)
5971 Perl_croak(aTHX_ PL_no_modify);
5975 if (SvAMAGIC(sv) && AMG_CALLun(sv,inc))
5977 i = PTR2IV(SvRV(sv));
5982 flags = SvFLAGS(sv);
5983 if ((flags & (SVp_NOK|SVp_IOK)) == SVp_NOK) {
5984 /* It's (privately or publicly) a float, but not tested as an
5985 integer, so test it to see. */
5987 flags = SvFLAGS(sv);
5989 if ((flags & SVf_IOK) || ((flags & (SVp_IOK | SVp_NOK)) == SVp_IOK)) {
5990 /* It's publicly an integer, or privately an integer-not-float */
5991 #ifdef PERL_PRESERVE_IVUV
5995 if (SvUVX(sv) == UV_MAX)
5996 sv_setnv(sv, UV_MAX_P1);
5998 (void)SvIOK_only_UV(sv);
5999 SvUV_set(sv, SvUVX(sv) + 1);
6001 if (SvIVX(sv) == IV_MAX)
6002 sv_setuv(sv, (UV)IV_MAX + 1);
6004 (void)SvIOK_only(sv);
6005 SvIV_set(sv, SvIVX(sv) + 1);
6010 if (flags & SVp_NOK) {
6011 (void)SvNOK_only(sv);
6012 SvNV_set(sv, SvNVX(sv) + 1.0);
6016 if (!(flags & SVp_POK) || !*SvPVX_const(sv)) {
6017 if ((flags & SVTYPEMASK) < SVt_PVIV)
6018 sv_upgrade(sv, ((flags & SVTYPEMASK) > SVt_IV ? SVt_PVIV : SVt_IV));
6019 (void)SvIOK_only(sv);
6024 while (isALPHA(*d)) d++;
6025 while (isDIGIT(*d)) d++;
6027 #ifdef PERL_PRESERVE_IVUV
6028 /* Got to punt this as an integer if needs be, but we don't issue
6029 warnings. Probably ought to make the sv_iv_please() that does
6030 the conversion if possible, and silently. */
6031 const int numtype = grok_number(SvPVX_const(sv), SvCUR(sv), NULL);
6032 if (numtype && !(numtype & IS_NUMBER_INFINITY)) {
6033 /* Need to try really hard to see if it's an integer.
6034 9.22337203685478e+18 is an integer.
6035 but "9.22337203685478e+18" + 0 is UV=9223372036854779904
6036 so $a="9.22337203685478e+18"; $a+0; $a++
6037 needs to be the same as $a="9.22337203685478e+18"; $a++
6044 /* sv_2iv *should* have made this an NV */
6045 if (flags & SVp_NOK) {
6046 (void)SvNOK_only(sv);
6047 SvNV_set(sv, SvNVX(sv) + 1.0);
6050 /* I don't think we can get here. Maybe I should assert this
6051 And if we do get here I suspect that sv_setnv will croak. NWC
6053 #if defined(USE_LONG_DOUBLE)
6054 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",
6055 SvPVX_const(sv), SvIVX(sv), SvNVX(sv)));
6057 DEBUG_c(PerlIO_printf(Perl_debug_log,"sv_inc punt failed to convert '%s' to IOK or NOKp, UV=0x%"UVxf" NV=%"NVgf"\n",
6058 SvPVX_const(sv), SvIVX(sv), SvNVX(sv)));
6061 #endif /* PERL_PRESERVE_IVUV */
6062 sv_setnv(sv,Atof(SvPVX_const(sv)) + 1.0);
6066 while (d >= SvPVX_const(sv)) {
6074 /* MKS: The original code here died if letters weren't consecutive.
6075 * at least it didn't have to worry about non-C locales. The
6076 * new code assumes that ('z'-'a')==('Z'-'A'), letters are
6077 * arranged in order (although not consecutively) and that only
6078 * [A-Za-z] are accepted by isALPHA in the C locale.
6080 if (*d != 'z' && *d != 'Z') {
6081 do { ++*d; } while (!isALPHA(*d));
6084 *(d--) -= 'z' - 'a';
6089 *(d--) -= 'z' - 'a' + 1;
6093 /* oh,oh, the number grew */
6094 SvGROW(sv, SvCUR(sv) + 2);
6095 SvCUR_set(sv, SvCUR(sv) + 1);
6096 for (d = SvPVX(sv) + SvCUR(sv); d > SvPVX_const(sv); d--)
6107 Auto-decrement of the value in the SV, doing string to numeric conversion
6108 if necessary. Handles 'get' magic.
6114 Perl_sv_dec(pTHX_ register SV *sv)
6121 if (SvTHINKFIRST(sv)) {
6123 sv_force_normal_flags(sv, 0);
6124 if (SvREADONLY(sv)) {
6125 if (IN_PERL_RUNTIME)
6126 Perl_croak(aTHX_ PL_no_modify);
6130 if (SvAMAGIC(sv) && AMG_CALLun(sv,dec))
6132 i = PTR2IV(SvRV(sv));
6137 /* Unlike sv_inc we don't have to worry about string-never-numbers
6138 and keeping them magic. But we mustn't warn on punting */
6139 flags = SvFLAGS(sv);
6140 if ((flags & SVf_IOK) || ((flags & (SVp_IOK | SVp_NOK)) == SVp_IOK)) {
6141 /* It's publicly an integer, or privately an integer-not-float */
6142 #ifdef PERL_PRESERVE_IVUV
6146 if (SvUVX(sv) == 0) {
6147 (void)SvIOK_only(sv);
6151 (void)SvIOK_only_UV(sv);
6152 SvUV_set(sv, SvUVX(sv) - 1);
6155 if (SvIVX(sv) == IV_MIN)
6156 sv_setnv(sv, (NV)IV_MIN - 1.0);
6158 (void)SvIOK_only(sv);
6159 SvIV_set(sv, SvIVX(sv) - 1);
6164 if (flags & SVp_NOK) {
6165 SvNV_set(sv, SvNVX(sv) - 1.0);
6166 (void)SvNOK_only(sv);
6169 if (!(flags & SVp_POK)) {
6170 if ((flags & SVTYPEMASK) < SVt_PVIV)
6171 sv_upgrade(sv, ((flags & SVTYPEMASK) > SVt_IV) ? SVt_PVIV : SVt_IV);
6173 (void)SvIOK_only(sv);
6176 #ifdef PERL_PRESERVE_IVUV
6178 const int numtype = grok_number(SvPVX_const(sv), SvCUR(sv), NULL);
6179 if (numtype && !(numtype & IS_NUMBER_INFINITY)) {
6180 /* Need to try really hard to see if it's an integer.
6181 9.22337203685478e+18 is an integer.
6182 but "9.22337203685478e+18" + 0 is UV=9223372036854779904
6183 so $a="9.22337203685478e+18"; $a+0; $a--
6184 needs to be the same as $a="9.22337203685478e+18"; $a--
6191 /* sv_2iv *should* have made this an NV */
6192 if (flags & SVp_NOK) {
6193 (void)SvNOK_only(sv);
6194 SvNV_set(sv, SvNVX(sv) - 1.0);
6197 /* I don't think we can get here. Maybe I should assert this
6198 And if we do get here I suspect that sv_setnv will croak. NWC
6200 #if defined(USE_LONG_DOUBLE)
6201 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",
6202 SvPVX_const(sv), SvIVX(sv), SvNVX(sv)));
6204 DEBUG_c(PerlIO_printf(Perl_debug_log,"sv_dec punt failed to convert '%s' to IOK or NOKp, UV=0x%"UVxf" NV=%"NVgf"\n",
6205 SvPVX_const(sv), SvIVX(sv), SvNVX(sv)));
6209 #endif /* PERL_PRESERVE_IVUV */
6210 sv_setnv(sv,Atof(SvPVX_const(sv)) - 1.0); /* punt */
6214 =for apidoc sv_mortalcopy
6216 Creates a new SV which is a copy of the original SV (using C<sv_setsv>).
6217 The new SV is marked as mortal. It will be destroyed "soon", either by an
6218 explicit call to FREETMPS, or by an implicit call at places such as
6219 statement boundaries. See also C<sv_newmortal> and C<sv_2mortal>.
6224 /* Make a string that will exist for the duration of the expression
6225 * evaluation. Actually, it may have to last longer than that, but
6226 * hopefully we won't free it until it has been assigned to a
6227 * permanent location. */
6230 Perl_sv_mortalcopy(pTHX_ SV *oldstr)
6235 sv_setsv(sv,oldstr);
6237 PL_tmps_stack[++PL_tmps_ix] = sv;
6243 =for apidoc sv_newmortal
6245 Creates a new null SV which is mortal. The reference count of the SV is
6246 set to 1. It will be destroyed "soon", either by an explicit call to
6247 FREETMPS, or by an implicit call at places such as statement boundaries.
6248 See also C<sv_mortalcopy> and C<sv_2mortal>.
6254 Perl_sv_newmortal(pTHX)
6259 SvFLAGS(sv) = SVs_TEMP;
6261 PL_tmps_stack[++PL_tmps_ix] = sv;
6266 =for apidoc sv_2mortal
6268 Marks an existing SV as mortal. The SV will be destroyed "soon", either
6269 by an explicit call to FREETMPS, or by an implicit call at places such as
6270 statement boundaries. SvTEMP() is turned on which means that the SV's
6271 string buffer can be "stolen" if this SV is copied. See also C<sv_newmortal>
6272 and C<sv_mortalcopy>.
6278 Perl_sv_2mortal(pTHX_ register SV *sv)
6283 if (SvREADONLY(sv) && SvIMMORTAL(sv))
6286 PL_tmps_stack[++PL_tmps_ix] = sv;
6294 Creates a new SV and copies a string into it. The reference count for the
6295 SV is set to 1. If C<len> is zero, Perl will compute the length using
6296 strlen(). For efficiency, consider using C<newSVpvn> instead.
6302 Perl_newSVpv(pTHX_ const char *s, STRLEN len)
6307 sv_setpvn(sv,s,len ? len : strlen(s));
6312 =for apidoc newSVpvn
6314 Creates a new SV and copies a string into it. The reference count for the
6315 SV is set to 1. Note that if C<len> is zero, Perl will create a zero length
6316 string. You are responsible for ensuring that the source string is at least
6317 C<len> bytes long. If the C<s> argument is NULL the new SV will be undefined.
6323 Perl_newSVpvn(pTHX_ const char *s, STRLEN len)
6328 sv_setpvn(sv,s,len);
6334 =for apidoc newSVhek
6336 Creates a new SV from the hash key structure. It will generate scalars that
6337 point to the shared string table where possible. Returns a new (undefined)
6338 SV if the hek is NULL.
6344 Perl_newSVhek(pTHX_ const HEK *hek)
6353 if (HEK_LEN(hek) == HEf_SVKEY) {
6354 return newSVsv(*(SV**)HEK_KEY(hek));
6356 const int flags = HEK_FLAGS(hek);
6357 if (flags & HVhek_WASUTF8) {
6359 Andreas would like keys he put in as utf8 to come back as utf8
6361 STRLEN utf8_len = HEK_LEN(hek);
6362 const U8 *as_utf8 = bytes_to_utf8 ((U8*)HEK_KEY(hek), &utf8_len);
6363 SV * const sv = newSVpvn ((const char*)as_utf8, utf8_len);
6366 Safefree (as_utf8); /* bytes_to_utf8() allocates a new string */
6368 } else if (flags & HVhek_REHASH) {
6369 /* We don't have a pointer to the hv, so we have to replicate the
6370 flag into every HEK. This hv is using custom a hasing
6371 algorithm. Hence we can't return a shared string scalar, as
6372 that would contain the (wrong) hash value, and might get passed
6373 into an hv routine with a regular hash */
6375 SV * const sv = newSVpvn (HEK_KEY(hek), HEK_LEN(hek));
6380 /* This will be overwhelminly the most common case. */
6381 return newSVpvn_share(HEK_KEY(hek),
6382 (HEK_UTF8(hek) ? -HEK_LEN(hek) : HEK_LEN(hek)),
6388 =for apidoc newSVpvn_share
6390 Creates a new SV with its SvPVX_const pointing to a shared string in the string
6391 table. If the string does not already exist in the table, it is created
6392 first. Turns on READONLY and FAKE. The string's hash is stored in the UV
6393 slot of the SV; if the C<hash> parameter is non-zero, that value is used;
6394 otherwise the hash is computed. The idea here is that as the string table
6395 is used for shared hash keys these strings will have SvPVX_const == HeKEY and
6396 hash lookup will avoid string compare.
6402 Perl_newSVpvn_share(pTHX_ const char *src, I32 len, U32 hash)
6405 bool is_utf8 = FALSE;
6407 STRLEN tmplen = -len;
6409 /* See the note in hv.c:hv_fetch() --jhi */
6410 src = (char*)bytes_from_utf8((const U8*)src, &tmplen, &is_utf8);
6414 PERL_HASH(hash, src, len);
6416 sv_upgrade(sv, SVt_PV);
6417 SvPV_set(sv, sharepvn(src, is_utf8?-len:len, hash));
6429 #if defined(PERL_IMPLICIT_CONTEXT)
6431 /* pTHX_ magic can't cope with varargs, so this is a no-context
6432 * version of the main function, (which may itself be aliased to us).
6433 * Don't access this version directly.
6437 Perl_newSVpvf_nocontext(const char* pat, ...)
6442 va_start(args, pat);
6443 sv = vnewSVpvf(pat, &args);
6450 =for apidoc newSVpvf
6452 Creates a new SV and initializes it with the string formatted like
6459 Perl_newSVpvf(pTHX_ const char* pat, ...)
6463 va_start(args, pat);
6464 sv = vnewSVpvf(pat, &args);
6469 /* backend for newSVpvf() and newSVpvf_nocontext() */
6472 Perl_vnewSVpvf(pTHX_ const char* pat, va_list* args)
6476 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
6483 Creates a new SV and copies a floating point value into it.
6484 The reference count for the SV is set to 1.
6490 Perl_newSVnv(pTHX_ NV n)
6502 Creates a new SV and copies an integer into it. The reference count for the
6509 Perl_newSViv(pTHX_ IV i)
6521 Creates a new SV and copies an unsigned integer into it.
6522 The reference count for the SV is set to 1.
6528 Perl_newSVuv(pTHX_ UV u)
6538 =for apidoc newRV_noinc
6540 Creates an RV wrapper for an SV. The reference count for the original
6541 SV is B<not> incremented.
6547 Perl_newRV_noinc(pTHX_ SV *tmpRef)
6552 sv_upgrade(sv, SVt_RV);
6554 SvRV_set(sv, tmpRef);
6559 /* newRV_inc is the official function name to use now.
6560 * newRV_inc is in fact #defined to newRV in sv.h
6564 Perl_newRV(pTHX_ SV *tmpRef)
6566 return newRV_noinc(SvREFCNT_inc(tmpRef));
6572 Creates a new SV which is an exact duplicate of the original SV.
6579 Perl_newSVsv(pTHX_ register SV *old)
6585 if (SvTYPE(old) == SVTYPEMASK) {
6586 if (ckWARN_d(WARN_INTERNAL))
6587 Perl_warner(aTHX_ packWARN(WARN_INTERNAL), "semi-panic: attempt to dup freed string");
6591 /* SV_GMAGIC is the default for sv_setv()
6592 SV_NOSTEAL prevents TEMP buffers being, well, stolen, and saves games
6593 with SvTEMP_off and SvTEMP_on round a call to sv_setsv. */
6594 sv_setsv_flags(sv, old, SV_GMAGIC | SV_NOSTEAL);
6599 =for apidoc sv_reset
6601 Underlying implementation for the C<reset> Perl function.
6602 Note that the perl-level function is vaguely deprecated.
6608 Perl_sv_reset(pTHX_ register const char *s, HV *stash)
6611 char todo[PERL_UCHAR_MAX+1];
6616 if (!*s) { /* reset ?? searches */
6617 MAGIC * const mg = mg_find((SV *)stash, PERL_MAGIC_symtab);
6619 PMOP *pm = (PMOP *) mg->mg_obj;
6621 pm->op_pmdynflags &= ~PMdf_USED;
6628 /* reset variables */
6630 if (!HvARRAY(stash))
6633 Zero(todo, 256, char);
6636 I32 i = (unsigned char)*s;
6640 max = (unsigned char)*s++;
6641 for ( ; i <= max; i++) {
6644 for (i = 0; i <= (I32) HvMAX(stash); i++) {
6646 for (entry = HvARRAY(stash)[i];
6648 entry = HeNEXT(entry))
6653 if (!todo[(U8)*HeKEY(entry)])
6655 gv = (GV*)HeVAL(entry);
6658 if (SvTHINKFIRST(sv)) {
6659 if (!SvREADONLY(sv) && SvROK(sv))
6661 /* XXX Is this continue a bug? Why should THINKFIRST
6662 exempt us from resetting arrays and hashes? */
6666 if (SvTYPE(sv) >= SVt_PV) {
6668 if (SvPVX_const(sv) != Nullch)
6676 if (GvHV(gv) && !HvNAME_get(GvHV(gv))) {
6678 Perl_die(aTHX_ "Can't reset %%ENV on this system");
6681 # if defined(USE_ENVIRON_ARRAY)
6684 # endif /* USE_ENVIRON_ARRAY */
6695 Using various gambits, try to get an IO from an SV: the IO slot if its a
6696 GV; or the recursive result if we're an RV; or the IO slot of the symbol
6697 named after the PV if we're a string.
6703 Perl_sv_2io(pTHX_ SV *sv)
6708 switch (SvTYPE(sv)) {
6716 Perl_croak(aTHX_ "Bad filehandle: %s", GvNAME(gv));
6720 Perl_croak(aTHX_ PL_no_usym, "filehandle");
6722 return sv_2io(SvRV(sv));
6723 gv = gv_fetchsv(sv, FALSE, SVt_PVIO);
6729 Perl_croak(aTHX_ "Bad filehandle: %"SVf, sv);
6738 Using various gambits, try to get a CV from an SV; in addition, try if
6739 possible to set C<*st> and C<*gvp> to the stash and GV associated with it.
6745 Perl_sv_2cv(pTHX_ SV *sv, HV **st, GV **gvp, I32 lref)
6752 return *gvp = Nullgv, Nullcv;
6753 switch (SvTYPE(sv)) {
6771 SV * const *sp = &sv; /* Used in tryAMAGICunDEREF macro. */
6772 tryAMAGICunDEREF(to_cv);
6775 if (SvTYPE(sv) == SVt_PVCV) {
6784 Perl_croak(aTHX_ "Not a subroutine reference");
6789 gv = gv_fetchsv(sv, lref, SVt_PVCV);
6795 if (lref && !GvCVu(gv)) {
6798 tmpsv = NEWSV(704,0);
6799 gv_efullname3(tmpsv, gv, Nullch);
6800 /* XXX this is probably not what they think they're getting.
6801 * It has the same effect as "sub name;", i.e. just a forward
6803 newSUB(start_subparse(FALSE, 0),
6804 newSVOP(OP_CONST, 0, tmpsv),
6809 Perl_croak(aTHX_ "Unable to create sub named \"%"SVf"\"",
6819 Returns true if the SV has a true value by Perl's rules.
6820 Use the C<SvTRUE> macro instead, which may call C<sv_true()> or may
6821 instead use an in-line version.
6827 Perl_sv_true(pTHX_ register SV *sv)
6832 register const XPV* const tXpv = (XPV*)SvANY(sv);
6834 (tXpv->xpv_cur > 1 ||
6835 (tXpv->xpv_cur && *sv->sv_u.svu_pv != '0')))
6842 return SvIVX(sv) != 0;
6845 return SvNVX(sv) != 0.0;
6847 return sv_2bool(sv);
6853 =for apidoc sv_pvn_force
6855 Get a sensible string out of the SV somehow.
6856 A private implementation of the C<SvPV_force> macro for compilers which
6857 can't cope with complex macro expressions. Always use the macro instead.
6859 =for apidoc sv_pvn_force_flags
6861 Get a sensible string out of the SV somehow.
6862 If C<flags> has C<SV_GMAGIC> bit set, will C<mg_get> on C<sv> if
6863 appropriate, else not. C<sv_pvn_force> and C<sv_pvn_force_nomg> are
6864 implemented in terms of this function.
6865 You normally want to use the various wrapper macros instead: see
6866 C<SvPV_force> and C<SvPV_force_nomg>
6872 Perl_sv_pvn_force_flags(pTHX_ SV *sv, STRLEN *lp, I32 flags)
6875 if (SvTHINKFIRST(sv) && !SvROK(sv))
6876 sv_force_normal_flags(sv, 0);
6886 if (SvREADONLY(sv) && !(flags & SV_MUTABLE_RETURN)) {
6887 const char * const ref = sv_reftype(sv,0);
6889 Perl_croak(aTHX_ "Can't coerce readonly %s to string in %s",
6890 ref, OP_NAME(PL_op));
6892 Perl_croak(aTHX_ "Can't coerce readonly %s to string", ref);
6894 if (SvTYPE(sv) > SVt_PVLV && SvTYPE(sv) != SVt_PVFM)
6895 Perl_croak(aTHX_ "Can't coerce %s to string in %s", sv_reftype(sv,0),
6897 s = sv_2pv_flags(sv, &len, flags);
6901 if (s != SvPVX_const(sv)) { /* Almost, but not quite, sv_setpvn() */
6904 SvUPGRADE(sv, SVt_PV); /* Never FALSE */
6905 SvGROW(sv, len + 1);
6906 Move(s,SvPVX(sv),len,char);
6911 SvPOK_on(sv); /* validate pointer */
6913 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2pv(%s)\n",
6914 PTR2UV(sv),SvPVX_const(sv)));
6917 return SvPVX_mutable(sv);
6921 =for apidoc sv_pvbyten_force
6923 The backend for the C<SvPVbytex_force> macro. Always use the macro instead.
6929 Perl_sv_pvbyten_force(pTHX_ SV *sv, STRLEN *lp)
6931 sv_pvn_force(sv,lp);
6932 sv_utf8_downgrade(sv,0);
6938 =for apidoc sv_pvutf8n_force
6940 The backend for the C<SvPVutf8x_force> macro. Always use the macro instead.
6946 Perl_sv_pvutf8n_force(pTHX_ SV *sv, STRLEN *lp)
6948 sv_pvn_force(sv,lp);
6949 sv_utf8_upgrade(sv);
6955 =for apidoc sv_reftype
6957 Returns a string describing what the SV is a reference to.
6963 Perl_sv_reftype(pTHX_ const SV *sv, int ob)
6965 /* The fact that I don't need to downcast to char * everywhere, only in ?:
6966 inside return suggests a const propagation bug in g++. */
6967 if (ob && SvOBJECT(sv)) {
6968 char * const name = HvNAME_get(SvSTASH(sv));
6969 return name ? name : (char *) "__ANON__";
6972 switch (SvTYPE(sv)) {
6989 case SVt_PVLV: return (char *) (SvROK(sv) ? "REF"
6990 /* tied lvalues should appear to be
6991 * scalars for backwards compatitbility */
6992 : (LvTYPE(sv) == 't' || LvTYPE(sv) == 'T')
6993 ? "SCALAR" : "LVALUE");
6994 case SVt_PVAV: return "ARRAY";
6995 case SVt_PVHV: return "HASH";
6996 case SVt_PVCV: return "CODE";
6997 case SVt_PVGV: return "GLOB";
6998 case SVt_PVFM: return "FORMAT";
6999 case SVt_PVIO: return "IO";
7000 default: return "UNKNOWN";
7006 =for apidoc sv_isobject
7008 Returns a boolean indicating whether the SV is an RV pointing to a blessed
7009 object. If the SV is not an RV, or if the object is not blessed, then this
7016 Perl_sv_isobject(pTHX_ SV *sv)
7032 Returns a boolean indicating whether the SV is blessed into the specified
7033 class. This does not check for subtypes; use C<sv_derived_from> to verify
7034 an inheritance relationship.
7040 Perl_sv_isa(pTHX_ SV *sv, const char *name)
7051 hvname = HvNAME_get(SvSTASH(sv));
7055 return strEQ(hvname, name);
7061 Creates a new SV for the RV, C<rv>, to point to. If C<rv> is not an RV then
7062 it will be upgraded to one. If C<classname> is non-null then the new SV will
7063 be blessed in the specified package. The new SV is returned and its
7064 reference count is 1.
7070 Perl_newSVrv(pTHX_ SV *rv, const char *classname)
7076 SV_CHECK_THINKFIRST_COW_DROP(rv);
7079 if (SvTYPE(rv) >= SVt_PVMG) {
7080 const U32 refcnt = SvREFCNT(rv);
7084 SvREFCNT(rv) = refcnt;
7087 if (SvTYPE(rv) < SVt_RV)
7088 sv_upgrade(rv, SVt_RV);
7089 else if (SvTYPE(rv) > SVt_RV) {
7100 HV* const stash = gv_stashpv(classname, TRUE);
7101 (void)sv_bless(rv, stash);
7107 =for apidoc sv_setref_pv
7109 Copies a pointer into a new SV, optionally blessing the SV. The C<rv>
7110 argument will be upgraded to an RV. That RV will be modified to point to
7111 the new SV. If the C<pv> argument is NULL then C<PL_sv_undef> will be placed
7112 into the SV. The C<classname> argument indicates the package for the
7113 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
7114 will have a reference count of 1, and the RV will be returned.
7116 Do not use with other Perl types such as HV, AV, SV, CV, because those
7117 objects will become corrupted by the pointer copy process.
7119 Note that C<sv_setref_pvn> copies the string while this copies the pointer.
7125 Perl_sv_setref_pv(pTHX_ SV *rv, const char *classname, void *pv)
7128 sv_setsv(rv, &PL_sv_undef);
7132 sv_setiv(newSVrv(rv,classname), PTR2IV(pv));
7137 =for apidoc sv_setref_iv
7139 Copies an integer into a new SV, optionally blessing the SV. The C<rv>
7140 argument will be upgraded to an RV. That RV will be modified to point to
7141 the new SV. The C<classname> argument indicates the package for the
7142 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
7143 will have a reference count of 1, and the RV will be returned.
7149 Perl_sv_setref_iv(pTHX_ SV *rv, const char *classname, IV iv)
7151 sv_setiv(newSVrv(rv,classname), iv);
7156 =for apidoc sv_setref_uv
7158 Copies an unsigned integer into a new SV, optionally blessing the SV. The C<rv>
7159 argument will be upgraded to an RV. That RV will be modified to point to
7160 the new SV. The C<classname> argument indicates the package for the
7161 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
7162 will have a reference count of 1, and the RV will be returned.
7168 Perl_sv_setref_uv(pTHX_ SV *rv, const char *classname, UV uv)
7170 sv_setuv(newSVrv(rv,classname), uv);
7175 =for apidoc sv_setref_nv
7177 Copies a double into a new SV, optionally blessing the SV. The C<rv>
7178 argument will be upgraded to an RV. That RV will be modified to point to
7179 the new SV. The C<classname> argument indicates the package for the
7180 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
7181 will have a reference count of 1, and the RV will be returned.
7187 Perl_sv_setref_nv(pTHX_ SV *rv, const char *classname, NV nv)
7189 sv_setnv(newSVrv(rv,classname), nv);
7194 =for apidoc sv_setref_pvn
7196 Copies a string into a new SV, optionally blessing the SV. The length of the
7197 string must be specified with C<n>. The C<rv> argument will be upgraded to
7198 an RV. That RV will be modified to point to the new SV. The C<classname>
7199 argument indicates the package for the blessing. Set C<classname> to
7200 C<Nullch> to avoid the blessing. The new SV will have a reference count
7201 of 1, and the RV will be returned.
7203 Note that C<sv_setref_pv> copies the pointer while this copies the string.
7209 Perl_sv_setref_pvn(pTHX_ SV *rv, const char *classname, const char *pv, STRLEN n)
7211 sv_setpvn(newSVrv(rv,classname), pv, n);
7216 =for apidoc sv_bless
7218 Blesses an SV into a specified package. The SV must be an RV. The package
7219 must be designated by its stash (see C<gv_stashpv()>). The reference count
7220 of the SV is unaffected.
7226 Perl_sv_bless(pTHX_ SV *sv, HV *stash)
7230 Perl_croak(aTHX_ "Can't bless non-reference value");
7232 if (SvFLAGS(tmpRef) & (SVs_OBJECT|SVf_READONLY)) {
7233 if (SvREADONLY(tmpRef))
7234 Perl_croak(aTHX_ PL_no_modify);
7235 if (SvOBJECT(tmpRef)) {
7236 if (SvTYPE(tmpRef) != SVt_PVIO)
7238 SvREFCNT_dec(SvSTASH(tmpRef));
7241 SvOBJECT_on(tmpRef);
7242 if (SvTYPE(tmpRef) != SVt_PVIO)
7244 SvUPGRADE(tmpRef, SVt_PVMG);
7245 SvSTASH_set(tmpRef, (HV*)SvREFCNT_inc(stash));
7252 if(SvSMAGICAL(tmpRef))
7253 if(mg_find(tmpRef, PERL_MAGIC_ext) || mg_find(tmpRef, PERL_MAGIC_uvar))
7261 /* Downgrades a PVGV to a PVMG.
7265 S_sv_unglob(pTHX_ SV *sv)
7269 assert(SvTYPE(sv) == SVt_PVGV);
7274 sv_del_backref((SV*)GvSTASH(sv), sv);
7275 GvSTASH(sv) = Nullhv;
7277 sv_unmagic(sv, PERL_MAGIC_glob);
7278 Safefree(GvNAME(sv));
7281 /* need to keep SvANY(sv) in the right arena */
7282 xpvmg = new_XPVMG();
7283 StructCopy(SvANY(sv), xpvmg, XPVMG);
7284 del_XPVGV(SvANY(sv));
7287 SvFLAGS(sv) &= ~SVTYPEMASK;
7288 SvFLAGS(sv) |= SVt_PVMG;
7292 =for apidoc sv_unref_flags
7294 Unsets the RV status of the SV, and decrements the reference count of
7295 whatever was being referenced by the RV. This can almost be thought of
7296 as a reversal of C<newSVrv>. The C<cflags> argument can contain
7297 C<SV_IMMEDIATE_UNREF> to force the reference count to be decremented
7298 (otherwise the decrementing is conditional on the reference count being
7299 different from one or the reference being a readonly SV).
7306 Perl_sv_unref_flags(pTHX_ SV *ref, U32 flags)
7308 SV* const target = SvRV(ref);
7310 if (SvWEAKREF(ref)) {
7311 sv_del_backref(target, ref);
7313 SvRV_set(ref, NULL);
7316 SvRV_set(ref, NULL);
7318 /* You can't have a || SvREADONLY(target) here, as $a = $$a, where $a was
7319 assigned to as BEGIN {$a = \"Foo"} will fail. */
7320 if (SvREFCNT(target) != 1 || (flags & SV_IMMEDIATE_UNREF))
7321 SvREFCNT_dec(target);
7322 else /* XXX Hack, but hard to make $a=$a->[1] work otherwise */
7323 sv_2mortal(target); /* Schedule for freeing later */
7327 =for apidoc sv_untaint
7329 Untaint an SV. Use C<SvTAINTED_off> instead.
7334 Perl_sv_untaint(pTHX_ SV *sv)
7336 if (SvTYPE(sv) >= SVt_PVMG && SvMAGIC(sv)) {
7337 MAGIC * const mg = mg_find(sv, PERL_MAGIC_taint);
7344 =for apidoc sv_tainted
7346 Test an SV for taintedness. Use C<SvTAINTED> instead.
7351 Perl_sv_tainted(pTHX_ SV *sv)
7353 if (SvTYPE(sv) >= SVt_PVMG && SvMAGIC(sv)) {
7354 const MAGIC * const mg = mg_find(sv, PERL_MAGIC_taint);
7355 if (mg && (mg->mg_len & 1) )
7362 =for apidoc sv_setpviv
7364 Copies an integer into the given SV, also updating its string value.
7365 Does not handle 'set' magic. See C<sv_setpviv_mg>.
7371 Perl_sv_setpviv(pTHX_ SV *sv, IV iv)
7373 char buf[TYPE_CHARS(UV)];
7375 char * const ptr = uiv_2buf(buf, iv, 0, 0, &ebuf);
7377 sv_setpvn(sv, ptr, ebuf - ptr);
7381 =for apidoc sv_setpviv_mg
7383 Like C<sv_setpviv>, but also handles 'set' magic.
7389 Perl_sv_setpviv_mg(pTHX_ SV *sv, IV iv)
7395 #if defined(PERL_IMPLICIT_CONTEXT)
7397 /* pTHX_ magic can't cope with varargs, so this is a no-context
7398 * version of the main function, (which may itself be aliased to us).
7399 * Don't access this version directly.
7403 Perl_sv_setpvf_nocontext(SV *sv, const char* pat, ...)
7407 va_start(args, pat);
7408 sv_vsetpvf(sv, pat, &args);
7412 /* pTHX_ magic can't cope with varargs, so this is a no-context
7413 * version of the main function, (which may itself be aliased to us).
7414 * Don't access this version directly.
7418 Perl_sv_setpvf_mg_nocontext(SV *sv, const char* pat, ...)
7422 va_start(args, pat);
7423 sv_vsetpvf_mg(sv, pat, &args);
7429 =for apidoc sv_setpvf
7431 Works like C<sv_catpvf> but copies the text into the SV instead of
7432 appending it. Does not handle 'set' magic. See C<sv_setpvf_mg>.
7438 Perl_sv_setpvf(pTHX_ SV *sv, const char* pat, ...)
7441 va_start(args, pat);
7442 sv_vsetpvf(sv, pat, &args);
7447 =for apidoc sv_vsetpvf
7449 Works like C<sv_vcatpvf> but copies the text into the SV instead of
7450 appending it. Does not handle 'set' magic. See C<sv_vsetpvf_mg>.
7452 Usually used via its frontend C<sv_setpvf>.
7458 Perl_sv_vsetpvf(pTHX_ SV *sv, const char* pat, va_list* args)
7460 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
7464 =for apidoc sv_setpvf_mg
7466 Like C<sv_setpvf>, but also handles 'set' magic.
7472 Perl_sv_setpvf_mg(pTHX_ SV *sv, const char* pat, ...)
7475 va_start(args, pat);
7476 sv_vsetpvf_mg(sv, pat, &args);
7481 =for apidoc sv_vsetpvf_mg
7483 Like C<sv_vsetpvf>, but also handles 'set' magic.
7485 Usually used via its frontend C<sv_setpvf_mg>.
7491 Perl_sv_vsetpvf_mg(pTHX_ SV *sv, const char* pat, va_list* args)
7493 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
7497 #if defined(PERL_IMPLICIT_CONTEXT)
7499 /* pTHX_ magic can't cope with varargs, so this is a no-context
7500 * version of the main function, (which may itself be aliased to us).
7501 * Don't access this version directly.
7505 Perl_sv_catpvf_nocontext(SV *sv, const char* pat, ...)
7509 va_start(args, pat);
7510 sv_vcatpvf(sv, pat, &args);
7514 /* pTHX_ magic can't cope with varargs, so this is a no-context
7515 * version of the main function, (which may itself be aliased to us).
7516 * Don't access this version directly.
7520 Perl_sv_catpvf_mg_nocontext(SV *sv, const char* pat, ...)
7524 va_start(args, pat);
7525 sv_vcatpvf_mg(sv, pat, &args);
7531 =for apidoc sv_catpvf
7533 Processes its arguments like C<sprintf> and appends the formatted
7534 output to an SV. If the appended data contains "wide" characters
7535 (including, but not limited to, SVs with a UTF-8 PV formatted with %s,
7536 and characters >255 formatted with %c), the original SV might get
7537 upgraded to UTF-8. Handles 'get' magic, but not 'set' magic. See
7538 C<sv_catpvf_mg>. If the original SV was UTF-8, the pattern should be
7539 valid UTF-8; if the original SV was bytes, the pattern should be too.
7544 Perl_sv_catpvf(pTHX_ SV *sv, const char* pat, ...)
7547 va_start(args, pat);
7548 sv_vcatpvf(sv, pat, &args);
7553 =for apidoc sv_vcatpvf
7555 Processes its arguments like C<vsprintf> and appends the formatted output
7556 to an SV. Does not handle 'set' magic. See C<sv_vcatpvf_mg>.
7558 Usually used via its frontend C<sv_catpvf>.
7564 Perl_sv_vcatpvf(pTHX_ SV *sv, const char* pat, va_list* args)
7566 sv_vcatpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
7570 =for apidoc sv_catpvf_mg
7572 Like C<sv_catpvf>, but also handles 'set' magic.
7578 Perl_sv_catpvf_mg(pTHX_ SV *sv, const char* pat, ...)
7581 va_start(args, pat);
7582 sv_vcatpvf_mg(sv, pat, &args);
7587 =for apidoc sv_vcatpvf_mg
7589 Like C<sv_vcatpvf>, but also handles 'set' magic.
7591 Usually used via its frontend C<sv_catpvf_mg>.
7597 Perl_sv_vcatpvf_mg(pTHX_ SV *sv, const char* pat, va_list* args)
7599 sv_vcatpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
7604 =for apidoc sv_vsetpvfn
7606 Works like C<sv_vcatpvfn> but copies the text into the SV instead of
7609 Usually used via one of its frontends C<sv_vsetpvf> and C<sv_vsetpvf_mg>.
7615 Perl_sv_vsetpvfn(pTHX_ SV *sv, const char *pat, STRLEN patlen, va_list *args, SV **svargs, I32 svmax, bool *maybe_tainted)
7617 sv_setpvn(sv, "", 0);
7618 sv_vcatpvfn(sv, pat, patlen, args, svargs, svmax, maybe_tainted);
7621 /* private function for use in sv_vcatpvfn via the EXPECT_NUMBER macro */
7624 S_expect_number(pTHX_ char** pattern)
7627 switch (**pattern) {
7628 case '1': case '2': case '3':
7629 case '4': case '5': case '6':
7630 case '7': case '8': case '9':
7631 var = *(*pattern)++ - '0';
7632 while (isDIGIT(**pattern)) {
7633 I32 tmp = var * 10 + (*(*pattern)++ - '0');
7635 Perl_croak(aTHX_ "Integer overflow in format string for %s", (PL_op ? OP_NAME(PL_op) : "sv_vcatpvfn"));
7641 #define EXPECT_NUMBER(pattern, var) (var = S_expect_number(aTHX_ &pattern))
7644 F0convert(NV nv, char *endbuf, STRLEN *len)
7646 const int neg = nv < 0;
7655 if (uv & 1 && uv == nv)
7656 uv--; /* Round to even */
7658 const unsigned dig = uv % 10;
7671 =for apidoc sv_vcatpvfn
7673 Processes its arguments like C<vsprintf> and appends the formatted output
7674 to an SV. Uses an array of SVs if the C style variable argument list is
7675 missing (NULL). When running with taint checks enabled, indicates via
7676 C<maybe_tainted> if results are untrustworthy (often due to the use of
7679 Usually used via one of its frontends C<sv_vcatpvf> and C<sv_vcatpvf_mg>.
7685 #define VECTORIZE_ARGS vecsv = va_arg(*args, SV*);\
7686 vecstr = (U8*)SvPV_const(vecsv,veclen);\
7687 vec_utf8 = DO_UTF8(vecsv);
7689 /* XXX maybe_tainted is never assigned to, so the doc above is lying. */
7692 Perl_sv_vcatpvfn(pTHX_ SV *sv, const char *pat, STRLEN patlen, va_list *args, SV **svargs, I32 svmax, bool *maybe_tainted)
7699 static const char nullstr[] = "(null)";
7701 bool has_utf8 = DO_UTF8(sv); /* has the result utf8? */
7702 const bool pat_utf8 = has_utf8; /* the pattern is in utf8? */
7704 /* Times 4: a decimal digit takes more than 3 binary digits.
7705 * NV_DIG: mantissa takes than many decimal digits.
7706 * Plus 32: Playing safe. */
7707 char ebuf[IV_DIG * 4 + NV_DIG + 32];
7708 /* large enough for "%#.#f" --chip */
7709 /* what about long double NVs? --jhi */
7711 PERL_UNUSED_ARG(maybe_tainted);
7713 /* no matter what, this is a string now */
7714 (void)SvPV_force(sv, origlen);
7716 /* special-case "", "%s", and "%-p" (SVf - see below) */
7719 if (patlen == 2 && pat[0] == '%' && pat[1] == 's') {
7721 const char * const s = va_arg(*args, char*);
7722 sv_catpv(sv, s ? s : nullstr);
7724 else if (svix < svmax) {
7725 sv_catsv(sv, *svargs);
7729 if (args && patlen == 3 && pat[0] == '%' &&
7730 pat[1] == '-' && pat[2] == 'p') {
7731 argsv = va_arg(*args, SV*);
7732 sv_catsv(sv, argsv);
7736 #ifndef USE_LONG_DOUBLE
7737 /* special-case "%.<number>[gf]" */
7738 if ( !args && patlen <= 5 && pat[0] == '%' && pat[1] == '.'
7739 && (pat[patlen-1] == 'g' || pat[patlen-1] == 'f') ) {
7740 unsigned digits = 0;
7744 while (*pp >= '0' && *pp <= '9')
7745 digits = 10 * digits + (*pp++ - '0');
7746 if (pp - pat == (int)patlen - 1) {
7754 /* Add check for digits != 0 because it seems that some
7755 gconverts are buggy in this case, and we don't yet have
7756 a Configure test for this. */
7757 if (digits && digits < sizeof(ebuf) - NV_DIG - 10) {
7758 /* 0, point, slack */
7759 Gconvert(nv, (int)digits, 0, ebuf);
7761 if (*ebuf) /* May return an empty string for digits==0 */
7764 } else if (!digits) {
7767 if ((p = F0convert(nv, ebuf + sizeof ebuf, &l))) {
7768 sv_catpvn(sv, p, l);
7774 #endif /* !USE_LONG_DOUBLE */
7776 if (!args && svix < svmax && DO_UTF8(*svargs))
7779 patend = (char*)pat + patlen;
7780 for (p = (char*)pat; p < patend; p = q) {
7783 bool vectorize = FALSE;
7784 bool vectorarg = FALSE;
7785 bool vec_utf8 = FALSE;
7791 bool has_precis = FALSE;
7794 bool is_utf8 = FALSE; /* is this item utf8? */
7795 #ifdef HAS_LDBL_SPRINTF_BUG
7796 /* This is to try to fix a bug with irix/nonstop-ux/powerux and
7797 with sfio - Allen <allens@cpan.org> */
7798 bool fix_ldbl_sprintf_bug = FALSE;
7802 U8 utf8buf[UTF8_MAXBYTES+1];
7803 STRLEN esignlen = 0;
7805 const char *eptr = Nullch;
7808 const U8 *vecstr = Null(U8*);
7815 /* we need a long double target in case HAS_LONG_DOUBLE but
7818 #if defined(HAS_LONG_DOUBLE) && LONG_DOUBLESIZE > DOUBLESIZE
7826 const char *dotstr = ".";
7827 STRLEN dotstrlen = 1;
7828 I32 efix = 0; /* explicit format parameter index */
7829 I32 ewix = 0; /* explicit width index */
7830 I32 epix = 0; /* explicit precision index */
7831 I32 evix = 0; /* explicit vector index */
7832 bool asterisk = FALSE;
7834 /* echo everything up to the next format specification */
7835 for (q = p; q < patend && *q != '%'; ++q) ;
7837 if (has_utf8 && !pat_utf8)
7838 sv_catpvn_utf8_upgrade(sv, p, q - p, nsv);
7840 sv_catpvn(sv, p, q - p);
7847 We allow format specification elements in this order:
7848 \d+\$ explicit format parameter index
7850 v|\*(\d+\$)?v vector with optional (optionally specified) arg
7851 0 flag (as above): repeated to allow "v02"
7852 \d+|\*(\d+\$)? width using optional (optionally specified) arg
7853 \.(\d*|\*(\d+\$)?) precision using optional (optionally specified) arg
7855 [%bcdefginopsuxDFOUX] format (mandatory)
7860 As of perl5.9.3, printf format checking is on by default.
7861 Internally, perl uses %p formats to provide an escape to
7862 some extended formatting. This block deals with those
7863 extensions: if it does not match, (char*)q is reset and
7864 the normal format processing code is used.
7866 Currently defined extensions are:
7867 %p include pointer address (standard)
7868 %-p (SVf) include an SV (previously %_)
7869 %-<num>p include an SV with precision <num>
7870 %1p (VDf) include a v-string (as %vd)
7871 %<num>p reserved for future extensions
7873 Robin Barker 2005-07-14
7880 EXPECT_NUMBER(q, n);
7887 argsv = va_arg(*args, SV*);
7888 eptr = SvPVx_const(argsv, elen);
7894 else if (n == vdNUMBER) { /* VDf */
7901 if (ckWARN_d(WARN_INTERNAL))
7902 Perl_warner(aTHX_ packWARN(WARN_INTERNAL),
7903 "internal %%<num>p might conflict with future printf extensions");
7909 if (EXPECT_NUMBER(q, width)) {
7950 if (EXPECT_NUMBER(q, ewix))
7959 if ((vectorarg = asterisk)) {
7972 EXPECT_NUMBER(q, width);
7978 vecsv = va_arg(*args, SV*);
7980 vecsv = (evix > 0 && evix <= svmax)
7981 ? svargs[evix-1] : &PL_sv_undef;
7983 vecsv = svix < svmax ? svargs[svix++] : &PL_sv_undef;
7985 dotstr = SvPV_const(vecsv, dotstrlen);
7986 /* Keep the DO_UTF8 test *after* the SvPV call, else things go
7987 bad with tied or overloaded values that return UTF8. */
7990 else if (has_utf8) {
7991 vecsv = sv_mortalcopy(vecsv);
7992 sv_utf8_upgrade(vecsv);
7993 dotstr = SvPV_const(vecsv, dotstrlen);
8000 else if (efix ? (efix > 0 && efix <= svmax) : svix < svmax) {
8001 vecsv = svargs[efix ? efix-1 : svix++];
8002 vecstr = (U8*)SvPV_const(vecsv,veclen);
8003 vec_utf8 = DO_UTF8(vecsv);
8004 /* if this is a version object, we need to return the
8005 * stringified representation (which the SvPVX_const has
8006 * already done for us), but not vectorize the args
8008 if ( *q == 'd' && sv_derived_from(vecsv,"version") )
8010 q++; /* skip past the rest of the %vd format */
8011 eptr = (const char *) vecstr;
8013 if (elen && *eptr == 'v') {
8029 i = va_arg(*args, int);
8031 i = (ewix ? ewix <= svmax : svix < svmax) ?
8032 SvIVx(svargs[ewix ? ewix-1 : svix++]) : 0;
8034 width = (i < 0) ? -i : i;
8044 if (EXPECT_NUMBER(q, epix) && *q++ != '$')
8046 /* XXX: todo, support specified precision parameter */
8050 i = va_arg(*args, int);
8052 i = (ewix ? ewix <= svmax : svix < svmax)
8053 ? SvIVx(svargs[ewix ? ewix-1 : svix++]) : 0;
8054 precis = (i < 0) ? 0 : i;
8059 precis = precis * 10 + (*q++ - '0');
8068 case 'I': /* Ix, I32x, and I64x */
8070 if (q[1] == '6' && q[2] == '4') {
8076 if (q[1] == '3' && q[2] == '2') {
8086 #if defined(HAS_QUAD) || defined(HAS_LONG_DOUBLE)
8097 #if defined(HAS_QUAD) || defined(HAS_LONG_DOUBLE)
8098 if (*(q + 1) == 'l') { /* lld, llf */
8124 if (!vectorize && !args) {
8126 const I32 i = efix-1;
8127 argsv = (i >= 0 && i < svmax) ? svargs[i] : &PL_sv_undef;
8129 argsv = (svix >= 0 && svix < svmax)
8130 ? svargs[svix++] : &PL_sv_undef;
8141 uv = (args) ? va_arg(*args, int) : SvIVx(argsv);
8143 (!UNI_IS_INVARIANT(uv) && SvUTF8(sv)))
8145 eptr = (char*)utf8buf;
8146 elen = uvchr_to_utf8((U8*)eptr, uv) - utf8buf;
8160 eptr = va_arg(*args, char*);
8162 #ifdef MACOS_TRADITIONAL
8163 /* On MacOS, %#s format is used for Pascal strings */
8168 elen = strlen(eptr);
8170 eptr = (char *)nullstr;
8171 elen = sizeof nullstr - 1;
8175 eptr = SvPVx_const(argsv, elen);
8176 if (DO_UTF8(argsv)) {
8177 if (has_precis && precis < elen) {
8179 sv_pos_u2b(argsv, &p, 0); /* sticks at end */
8182 if (width) { /* fudge width (can't fudge elen) */
8183 width += elen - sv_len_utf8(argsv);
8190 if (has_precis && elen > precis)
8197 if (alt || vectorize)
8199 uv = PTR2UV(args ? va_arg(*args, void*) : argsv);
8220 uv = utf8n_to_uvchr(vecstr, veclen, &ulen,
8229 esignbuf[esignlen++] = plus;
8233 case 'h': iv = (short)va_arg(*args, int); break;
8234 case 'l': iv = va_arg(*args, long); break;
8235 case 'V': iv = va_arg(*args, IV); break;
8236 default: iv = va_arg(*args, int); break;
8238 case 'q': iv = va_arg(*args, Quad_t); break;
8243 IV tiv = SvIVx(argsv); /* work around GCC bug #13488 */
8245 case 'h': iv = (short)tiv; break;
8246 case 'l': iv = (long)tiv; break;
8248 default: iv = tiv; break;
8250 case 'q': iv = (Quad_t)tiv; break;
8254 if ( !vectorize ) /* we already set uv above */
8259 esignbuf[esignlen++] = plus;
8263 esignbuf[esignlen++] = '-';
8306 uv = utf8n_to_uvchr(vecstr, veclen, &ulen,
8317 case 'h': uv = (unsigned short)va_arg(*args, unsigned); break;
8318 case 'l': uv = va_arg(*args, unsigned long); break;
8319 case 'V': uv = va_arg(*args, UV); break;
8320 default: uv = va_arg(*args, unsigned); break;
8322 case 'q': uv = va_arg(*args, Uquad_t); break;
8327 UV tuv = SvUVx(argsv); /* work around GCC bug #13488 */
8329 case 'h': uv = (unsigned short)tuv; break;
8330 case 'l': uv = (unsigned long)tuv; break;
8332 default: uv = tuv; break;
8334 case 'q': uv = (Uquad_t)tuv; break;
8341 char *ptr = ebuf + sizeof ebuf;
8347 p = (char*)((c == 'X')
8348 ? "0123456789ABCDEF" : "0123456789abcdef");
8354 esignbuf[esignlen++] = '0';
8355 esignbuf[esignlen++] = c; /* 'x' or 'X' */
8363 if (alt && *ptr != '0')
8374 esignbuf[esignlen++] = '0';
8375 esignbuf[esignlen++] = 'b';
8378 default: /* it had better be ten or less */
8382 } while (uv /= base);
8385 elen = (ebuf + sizeof ebuf) - ptr;
8389 zeros = precis - elen;
8390 else if (precis == 0 && elen == 1 && *eptr == '0')
8396 /* FLOATING POINT */
8399 c = 'f'; /* maybe %F isn't supported here */
8407 /* This is evil, but floating point is even more evil */
8409 /* for SV-style calling, we can only get NV
8410 for C-style calling, we assume %f is double;
8411 for simplicity we allow any of %Lf, %llf, %qf for long double
8415 #if defined(USE_LONG_DOUBLE)
8419 /* [perl #20339] - we should accept and ignore %lf rather than die */
8423 #if defined(USE_LONG_DOUBLE)
8424 intsize = args ? 0 : 'q';
8428 #if defined(HAS_LONG_DOUBLE)
8437 /* now we need (long double) if intsize == 'q', else (double) */
8439 #if LONG_DOUBLESIZE > DOUBLESIZE
8441 va_arg(*args, long double) :
8442 va_arg(*args, double)
8444 va_arg(*args, double)
8449 if (c != 'e' && c != 'E') {
8451 /* FIXME: if HAS_LONG_DOUBLE but not USE_LONG_DOUBLE this
8452 will cast our (long double) to (double) */
8453 (void)Perl_frexp(nv, &i);
8454 if (i == PERL_INT_MIN)
8455 Perl_die(aTHX_ "panic: frexp");
8457 need = BIT_DIGITS(i);
8459 need += has_precis ? precis : 6; /* known default */
8464 #ifdef HAS_LDBL_SPRINTF_BUG
8465 /* This is to try to fix a bug with irix/nonstop-ux/powerux and
8466 with sfio - Allen <allens@cpan.org> */
8469 # define MY_DBL_MAX DBL_MAX
8470 # else /* XXX guessing! HUGE_VAL may be defined as infinity, so not using */
8471 # if DOUBLESIZE >= 8
8472 # define MY_DBL_MAX 1.7976931348623157E+308L
8474 # define MY_DBL_MAX 3.40282347E+38L
8478 # ifdef HAS_LDBL_SPRINTF_BUG_LESS1 /* only between -1L & 1L - Allen */
8479 # define MY_DBL_MAX_BUG 1L
8481 # define MY_DBL_MAX_BUG MY_DBL_MAX
8485 # define MY_DBL_MIN DBL_MIN
8486 # else /* XXX guessing! -Allen */
8487 # if DOUBLESIZE >= 8
8488 # define MY_DBL_MIN 2.2250738585072014E-308L
8490 # define MY_DBL_MIN 1.17549435E-38L
8494 if ((intsize == 'q') && (c == 'f') &&
8495 ((nv < MY_DBL_MAX_BUG) && (nv > -MY_DBL_MAX_BUG)) &&
8497 /* it's going to be short enough that
8498 * long double precision is not needed */
8500 if ((nv <= 0L) && (nv >= -0L))
8501 fix_ldbl_sprintf_bug = TRUE; /* 0 is 0 - easiest */
8503 /* would use Perl_fp_class as a double-check but not
8504 * functional on IRIX - see perl.h comments */
8506 if ((nv >= MY_DBL_MIN) || (nv <= -MY_DBL_MIN)) {
8507 /* It's within the range that a double can represent */
8508 #if defined(DBL_MAX) && !defined(DBL_MIN)
8509 if ((nv >= ((long double)1/DBL_MAX)) ||
8510 (nv <= (-(long double)1/DBL_MAX)))
8512 fix_ldbl_sprintf_bug = TRUE;
8515 if (fix_ldbl_sprintf_bug == TRUE) {
8525 # undef MY_DBL_MAX_BUG
8528 #endif /* HAS_LDBL_SPRINTF_BUG */
8530 need += 20; /* fudge factor */
8531 if (PL_efloatsize < need) {
8532 Safefree(PL_efloatbuf);
8533 PL_efloatsize = need + 20; /* more fudge */
8534 Newx(PL_efloatbuf, PL_efloatsize, char);
8535 PL_efloatbuf[0] = '\0';
8538 if ( !(width || left || plus || alt) && fill != '0'
8539 && has_precis && intsize != 'q' ) { /* Shortcuts */
8540 /* See earlier comment about buggy Gconvert when digits,
8542 if ( c == 'g' && precis) {
8543 Gconvert((NV)nv, (int)precis, 0, PL_efloatbuf);
8544 /* May return an empty string for digits==0 */
8545 if (*PL_efloatbuf) {
8546 elen = strlen(PL_efloatbuf);
8547 goto float_converted;
8549 } else if ( c == 'f' && !precis) {
8550 if ((eptr = F0convert(nv, ebuf + sizeof ebuf, &elen)))
8555 char *ptr = ebuf + sizeof ebuf;
8558 /* FIXME: what to do if HAS_LONG_DOUBLE but not PERL_PRIfldbl? */
8559 #if defined(HAS_LONG_DOUBLE) && defined(PERL_PRIfldbl)
8560 if (intsize == 'q') {
8561 /* Copy the one or more characters in a long double
8562 * format before the 'base' ([efgEFG]) character to
8563 * the format string. */
8564 static char const prifldbl[] = PERL_PRIfldbl;
8565 char const *p = prifldbl + sizeof(prifldbl) - 3;
8566 while (p >= prifldbl) { *--ptr = *p--; }
8571 do { *--ptr = '0' + (base % 10); } while (base /= 10);
8576 do { *--ptr = '0' + (base % 10); } while (base /= 10);
8588 /* No taint. Otherwise we are in the strange situation
8589 * where printf() taints but print($float) doesn't.
8591 #if defined(HAS_LONG_DOUBLE)
8592 elen = ((intsize == 'q')
8593 ? my_sprintf(PL_efloatbuf, ptr, nv)
8594 : my_sprintf(PL_efloatbuf, ptr, (double)nv));
8596 elen = my_sprintf(PL_efloatbuf, ptr, nv);
8600 eptr = PL_efloatbuf;
8608 i = SvCUR(sv) - origlen;
8611 case 'h': *(va_arg(*args, short*)) = i; break;
8612 default: *(va_arg(*args, int*)) = i; break;
8613 case 'l': *(va_arg(*args, long*)) = i; break;
8614 case 'V': *(va_arg(*args, IV*)) = i; break;
8616 case 'q': *(va_arg(*args, Quad_t*)) = i; break;
8621 sv_setuv_mg(argsv, (UV)i);
8622 continue; /* not "break" */
8629 && (PL_op->op_type == OP_PRTF || PL_op->op_type == OP_SPRINTF)
8630 && ckWARN(WARN_PRINTF))
8632 SV * const msg = sv_newmortal();
8633 Perl_sv_setpvf(aTHX_ msg, "Invalid conversion in %sprintf: ",
8634 (PL_op->op_type == OP_PRTF) ? "" : "s");
8637 Perl_sv_catpvf(aTHX_ msg,
8638 "\"%%%c\"", c & 0xFF);
8640 Perl_sv_catpvf(aTHX_ msg,
8641 "\"%%\\%03"UVof"\"",
8644 sv_catpv(msg, "end of string");
8645 Perl_warner(aTHX_ packWARN(WARN_PRINTF), "%"SVf, msg); /* yes, this is reentrant */
8648 /* output mangled stuff ... */
8654 /* ... right here, because formatting flags should not apply */
8655 SvGROW(sv, SvCUR(sv) + elen + 1);
8657 Copy(eptr, p, elen, char);
8660 SvCUR_set(sv, p - SvPVX_const(sv));
8662 continue; /* not "break" */
8665 /* calculate width before utf8_upgrade changes it */
8666 have = esignlen + zeros + elen;
8668 Perl_croak_nocontext(PL_memory_wrap);
8670 if (is_utf8 != has_utf8) {
8673 sv_utf8_upgrade(sv);
8676 SV * const nsv = sv_2mortal(newSVpvn(eptr, elen));
8677 sv_utf8_upgrade(nsv);
8678 eptr = SvPVX_const(nsv);
8681 SvGROW(sv, SvCUR(sv) + elen + 1);
8686 need = (have > width ? have : width);
8689 if (need >= (((STRLEN)~0) - SvCUR(sv) - dotstrlen - 1))
8690 Perl_croak_nocontext(PL_memory_wrap);
8691 SvGROW(sv, SvCUR(sv) + need + dotstrlen + 1);
8693 if (esignlen && fill == '0') {
8695 for (i = 0; i < (int)esignlen; i++)
8699 memset(p, fill, gap);
8702 if (esignlen && fill != '0') {
8704 for (i = 0; i < (int)esignlen; i++)
8709 for (i = zeros; i; i--)
8713 Copy(eptr, p, elen, char);
8717 memset(p, ' ', gap);
8722 Copy(dotstr, p, dotstrlen, char);
8726 vectorize = FALSE; /* done iterating over vecstr */
8733 SvCUR_set(sv, p - SvPVX_const(sv));
8741 /* =========================================================================
8743 =head1 Cloning an interpreter
8745 All the macros and functions in this section are for the private use of
8746 the main function, perl_clone().
8748 The foo_dup() functions make an exact copy of an existing foo thinngy.
8749 During the course of a cloning, a hash table is used to map old addresses
8750 to new addresses. The table is created and manipulated with the
8751 ptr_table_* functions.
8755 ============================================================================*/
8758 #if defined(USE_ITHREADS)
8760 #ifndef GpREFCNT_inc
8761 # define GpREFCNT_inc(gp) ((gp) ? (++(gp)->gp_refcnt, (gp)) : (GP*)NULL)
8765 #define sv_dup_inc(s,t) SvREFCNT_inc(sv_dup(s,t))
8766 #define av_dup(s,t) (AV*)sv_dup((SV*)s,t)
8767 #define av_dup_inc(s,t) (AV*)SvREFCNT_inc(sv_dup((SV*)s,t))
8768 #define hv_dup(s,t) (HV*)sv_dup((SV*)s,t)
8769 #define hv_dup_inc(s,t) (HV*)SvREFCNT_inc(sv_dup((SV*)s,t))
8770 #define cv_dup(s,t) (CV*)sv_dup((SV*)s,t)
8771 #define cv_dup_inc(s,t) (CV*)SvREFCNT_inc(sv_dup((SV*)s,t))
8772 #define io_dup(s,t) (IO*)sv_dup((SV*)s,t)
8773 #define io_dup_inc(s,t) (IO*)SvREFCNT_inc(sv_dup((SV*)s,t))
8774 #define gv_dup(s,t) (GV*)sv_dup((SV*)s,t)
8775 #define gv_dup_inc(s,t) (GV*)SvREFCNT_inc(sv_dup((SV*)s,t))
8776 #define SAVEPV(p) (p ? savepv(p) : Nullch)
8777 #define SAVEPVN(p,n) (p ? savepvn(p,n) : Nullch)
8780 /* Duplicate a regexp. Required reading: pregcomp() and pregfree() in
8781 regcomp.c. AMS 20010712 */
8784 Perl_re_dup(pTHX_ const REGEXP *r, CLONE_PARAMS *param)
8789 struct reg_substr_datum *s;
8792 return (REGEXP *)NULL;
8794 if ((ret = (REGEXP *)ptr_table_fetch(PL_ptr_table, r)))
8797 len = r->offsets[0];
8798 npar = r->nparens+1;
8800 Newxc(ret, sizeof(regexp) + (len+1)*sizeof(regnode), char, regexp);
8801 Copy(r->program, ret->program, len+1, regnode);
8803 Newx(ret->startp, npar, I32);
8804 Copy(r->startp, ret->startp, npar, I32);
8805 Newx(ret->endp, npar, I32);
8806 Copy(r->startp, ret->startp, npar, I32);
8808 Newx(ret->substrs, 1, struct reg_substr_data);
8809 for (s = ret->substrs->data, i = 0; i < 3; i++, s++) {
8810 s->min_offset = r->substrs->data[i].min_offset;
8811 s->max_offset = r->substrs->data[i].max_offset;
8812 s->substr = sv_dup_inc(r->substrs->data[i].substr, param);
8813 s->utf8_substr = sv_dup_inc(r->substrs->data[i].utf8_substr, param);
8816 ret->regstclass = NULL;
8819 const int count = r->data->count;
8822 Newxc(d, sizeof(struct reg_data) + count*sizeof(void *),
8823 char, struct reg_data);
8824 Newx(d->what, count, U8);
8827 for (i = 0; i < count; i++) {
8828 d->what[i] = r->data->what[i];
8829 switch (d->what[i]) {
8830 /* legal options are one of: sfpont
8831 see also regcomp.h and pregfree() */
8833 d->data[i] = sv_dup_inc((SV *)r->data->data[i], param);
8836 d->data[i] = av_dup_inc((AV *)r->data->data[i], param);
8839 /* This is cheating. */
8840 Newx(d->data[i], 1, struct regnode_charclass_class);
8841 StructCopy(r->data->data[i], d->data[i],
8842 struct regnode_charclass_class);
8843 ret->regstclass = (regnode*)d->data[i];
8846 /* Compiled op trees are readonly, and can thus be
8847 shared without duplication. */
8849 d->data[i] = (void*)OpREFCNT_inc((OP*)r->data->data[i]);
8853 d->data[i] = r->data->data[i];
8856 d->data[i] = r->data->data[i];
8858 ((reg_trie_data*)d->data[i])->refcount++;
8862 Perl_croak(aTHX_ "panic: re_dup unknown data code '%c'", r->data->what[i]);
8871 Newx(ret->offsets, 2*len+1, U32);
8872 Copy(r->offsets, ret->offsets, 2*len+1, U32);
8874 ret->precomp = SAVEPVN(r->precomp, r->prelen);
8875 ret->refcnt = r->refcnt;
8876 ret->minlen = r->minlen;
8877 ret->prelen = r->prelen;
8878 ret->nparens = r->nparens;
8879 ret->lastparen = r->lastparen;
8880 ret->lastcloseparen = r->lastcloseparen;
8881 ret->reganch = r->reganch;
8883 ret->sublen = r->sublen;
8885 if (RX_MATCH_COPIED(ret))
8886 ret->subbeg = SAVEPVN(r->subbeg, r->sublen);
8888 ret->subbeg = Nullch;
8889 #ifdef PERL_OLD_COPY_ON_WRITE
8890 ret->saved_copy = Nullsv;
8893 ptr_table_store(PL_ptr_table, r, ret);
8897 /* duplicate a file handle */
8900 Perl_fp_dup(pTHX_ PerlIO *fp, char type, CLONE_PARAMS *param)
8904 PERL_UNUSED_ARG(type);
8907 return (PerlIO*)NULL;
8909 /* look for it in the table first */
8910 ret = (PerlIO*)ptr_table_fetch(PL_ptr_table, fp);
8914 /* create anew and remember what it is */
8915 ret = PerlIO_fdupopen(aTHX_ fp, param, PERLIO_DUP_CLONE);
8916 ptr_table_store(PL_ptr_table, fp, ret);
8920 /* duplicate a directory handle */
8923 Perl_dirp_dup(pTHX_ DIR *dp)
8931 /* duplicate a typeglob */
8934 Perl_gp_dup(pTHX_ GP *gp, CLONE_PARAMS* param)
8939 /* look for it in the table first */
8940 ret = (GP*)ptr_table_fetch(PL_ptr_table, gp);
8944 /* create anew and remember what it is */
8946 ptr_table_store(PL_ptr_table, gp, ret);
8949 ret->gp_refcnt = 0; /* must be before any other dups! */
8950 ret->gp_sv = sv_dup_inc(gp->gp_sv, param);
8951 ret->gp_io = io_dup_inc(gp->gp_io, param);
8952 ret->gp_form = cv_dup_inc(gp->gp_form, param);
8953 ret->gp_av = av_dup_inc(gp->gp_av, param);
8954 ret->gp_hv = hv_dup_inc(gp->gp_hv, param);
8955 ret->gp_egv = gv_dup(gp->gp_egv, param);/* GvEGV is not refcounted */
8956 ret->gp_cv = cv_dup_inc(gp->gp_cv, param);
8957 ret->gp_cvgen = gp->gp_cvgen;
8958 ret->gp_line = gp->gp_line;
8959 ret->gp_file = gp->gp_file; /* points to COP.cop_file */
8963 /* duplicate a chain of magic */
8966 Perl_mg_dup(pTHX_ MAGIC *mg, CLONE_PARAMS* param)
8968 MAGIC *mgprev = (MAGIC*)NULL;
8971 return (MAGIC*)NULL;
8972 /* look for it in the table first */
8973 mgret = (MAGIC*)ptr_table_fetch(PL_ptr_table, mg);
8977 for (; mg; mg = mg->mg_moremagic) {
8979 Newxz(nmg, 1, MAGIC);
8981 mgprev->mg_moremagic = nmg;
8984 nmg->mg_virtual = mg->mg_virtual; /* XXX copy dynamic vtable? */
8985 nmg->mg_private = mg->mg_private;
8986 nmg->mg_type = mg->mg_type;
8987 nmg->mg_flags = mg->mg_flags;
8988 if (mg->mg_type == PERL_MAGIC_qr) {
8989 nmg->mg_obj = (SV*)re_dup((REGEXP*)mg->mg_obj, param);
8991 else if(mg->mg_type == PERL_MAGIC_backref) {
8992 const AV * const av = (AV*) mg->mg_obj;
8995 (void)SvREFCNT_inc(nmg->mg_obj = (SV*)newAV());
8997 for (i = AvFILLp(av); i >= 0; i--) {
8998 if (!svp[i]) continue;
8999 av_push((AV*)nmg->mg_obj,sv_dup(svp[i],param));
9002 else if (mg->mg_type == PERL_MAGIC_symtab) {
9003 nmg->mg_obj = mg->mg_obj;
9006 nmg->mg_obj = (mg->mg_flags & MGf_REFCOUNTED)
9007 ? sv_dup_inc(mg->mg_obj, param)
9008 : sv_dup(mg->mg_obj, param);
9010 nmg->mg_len = mg->mg_len;
9011 nmg->mg_ptr = mg->mg_ptr; /* XXX random ptr? */
9012 if (mg->mg_ptr && mg->mg_type != PERL_MAGIC_regex_global) {
9013 if (mg->mg_len > 0) {
9014 nmg->mg_ptr = SAVEPVN(mg->mg_ptr, mg->mg_len);
9015 if (mg->mg_type == PERL_MAGIC_overload_table &&
9016 AMT_AMAGIC((AMT*)mg->mg_ptr))
9018 AMT * const amtp = (AMT*)mg->mg_ptr;
9019 AMT * const namtp = (AMT*)nmg->mg_ptr;
9021 for (i = 1; i < NofAMmeth; i++) {
9022 namtp->table[i] = cv_dup_inc(amtp->table[i], param);
9026 else if (mg->mg_len == HEf_SVKEY)
9027 nmg->mg_ptr = (char*)sv_dup_inc((SV*)mg->mg_ptr, param);
9029 if ((mg->mg_flags & MGf_DUP) && mg->mg_virtual && mg->mg_virtual->svt_dup) {
9030 CALL_FPTR(nmg->mg_virtual->svt_dup)(aTHX_ nmg, param);
9037 /* create a new pointer-mapping table */
9040 Perl_ptr_table_new(pTHX)
9043 Newxz(tbl, 1, PTR_TBL_t);
9046 Newxz(tbl->tbl_ary, tbl->tbl_max + 1, PTR_TBL_ENT_t*);
9050 #define PTR_TABLE_HASH(ptr) \
9051 ((PTR2UV(ptr) >> 3) ^ (PTR2UV(ptr) >> (3 + 7)) ^ (PTR2UV(ptr) >> (3 + 17)))
9054 we use the PTE_SVSLOT 'reservation' made above, both here (in the
9055 following define) and at call to new_body_inline made below in
9056 Perl_ptr_table_store()
9059 #define del_pte(p) del_body_type(p, PTE_SVSLOT)
9061 /* map an existing pointer using a table */
9063 STATIC PTR_TBL_ENT_t *
9064 S_ptr_table_find(pTHX_ PTR_TBL_t *tbl, const void *sv) {
9065 PTR_TBL_ENT_t *tblent;
9066 const UV hash = PTR_TABLE_HASH(sv);
9068 tblent = tbl->tbl_ary[hash & tbl->tbl_max];
9069 for (; tblent; tblent = tblent->next) {
9070 if (tblent->oldval == sv)
9077 Perl_ptr_table_fetch(pTHX_ PTR_TBL_t *tbl, const void *sv)
9079 PTR_TBL_ENT_t const *const tblent = S_ptr_table_find(aTHX_ tbl, sv);
9080 return tblent ? tblent->newval : (void *) 0;
9083 /* add a new entry to a pointer-mapping table */
9086 Perl_ptr_table_store(pTHX_ PTR_TBL_t *tbl, const void *oldsv, void *newsv)
9088 PTR_TBL_ENT_t *tblent = S_ptr_table_find(aTHX_ tbl, oldsv);
9091 tblent->newval = newsv;
9093 const UV entry = PTR_TABLE_HASH(oldsv) & tbl->tbl_max;
9095 new_body_inline(tblent, sizeof(struct ptr_tbl_ent), PTE_SVSLOT);
9096 tblent->oldval = oldsv;
9097 tblent->newval = newsv;
9098 tblent->next = tbl->tbl_ary[entry];
9099 tbl->tbl_ary[entry] = tblent;
9101 if (tblent->next && tbl->tbl_items > tbl->tbl_max)
9102 ptr_table_split(tbl);
9106 /* double the hash bucket size of an existing ptr table */
9109 Perl_ptr_table_split(pTHX_ PTR_TBL_t *tbl)
9111 PTR_TBL_ENT_t **ary = tbl->tbl_ary;
9112 const UV oldsize = tbl->tbl_max + 1;
9113 UV newsize = oldsize * 2;
9116 Renew(ary, newsize, PTR_TBL_ENT_t*);
9117 Zero(&ary[oldsize], newsize-oldsize, PTR_TBL_ENT_t*);
9118 tbl->tbl_max = --newsize;
9120 for (i=0; i < oldsize; i++, ary++) {
9121 PTR_TBL_ENT_t **curentp, **entp, *ent;
9124 curentp = ary + oldsize;
9125 for (entp = ary, ent = *ary; ent; ent = *entp) {
9126 if ((newsize & PTR_TABLE_HASH(ent->oldval)) != i) {
9128 ent->next = *curentp;
9138 /* remove all the entries from a ptr table */
9141 Perl_ptr_table_clear(pTHX_ PTR_TBL_t *tbl)
9143 if (tbl && tbl->tbl_items) {
9144 register PTR_TBL_ENT_t **array = tbl->tbl_ary;
9145 UV riter = tbl->tbl_max;
9148 PTR_TBL_ENT_t *entry = array[riter];
9151 PTR_TBL_ENT_t * const oentry = entry;
9152 entry = entry->next;
9161 /* clear and free a ptr table */
9164 Perl_ptr_table_free(pTHX_ PTR_TBL_t *tbl)
9169 ptr_table_clear(tbl);
9170 Safefree(tbl->tbl_ary);
9176 Perl_rvpv_dup(pTHX_ SV *dstr, SV *sstr, CLONE_PARAMS* param)
9179 SvRV_set(dstr, SvWEAKREF(sstr)
9180 ? sv_dup(SvRV(sstr), param)
9181 : sv_dup_inc(SvRV(sstr), param));
9184 else if (SvPVX_const(sstr)) {
9185 /* Has something there */
9187 /* Normal PV - clone whole allocated space */
9188 SvPV_set(dstr, SAVEPVN(SvPVX_const(sstr), SvLEN(sstr)-1));
9189 if (SvREADONLY(sstr) && SvFAKE(sstr)) {
9190 /* Not that normal - actually sstr is copy on write.
9191 But we are a true, independant SV, so: */
9192 SvREADONLY_off(dstr);
9197 /* Special case - not normally malloced for some reason */
9198 if ((SvREADONLY(sstr) && SvFAKE(sstr))) {
9199 /* A "shared" PV - clone it as "shared" PV */
9201 HEK_KEY(hek_dup(SvSHARED_HEK_FROM_PV(SvPVX_const(sstr)),
9205 /* Some other special case - random pointer */
9206 SvPV_set(dstr, SvPVX(sstr));
9212 if (SvTYPE(dstr) == SVt_RV)
9213 SvRV_set(dstr, NULL);
9219 /* duplicate an SV of any type (including AV, HV etc) */
9222 Perl_sv_dup(pTHX_ SV *sstr, CLONE_PARAMS* param)
9227 if (!sstr || SvTYPE(sstr) == SVTYPEMASK)
9229 /* look for it in the table first */
9230 dstr = (SV*)ptr_table_fetch(PL_ptr_table, sstr);
9234 if(param->flags & CLONEf_JOIN_IN) {
9235 /** We are joining here so we don't want do clone
9236 something that is bad **/
9239 if(SvTYPE(sstr) == SVt_PVHV &&
9240 (hvname = HvNAME_get(sstr))) {
9241 /** don't clone stashes if they already exist **/
9242 return (SV*)gv_stashpv(hvname,0);
9246 /* create anew and remember what it is */
9249 #ifdef DEBUG_LEAKING_SCALARS
9250 dstr->sv_debug_optype = sstr->sv_debug_optype;
9251 dstr->sv_debug_line = sstr->sv_debug_line;
9252 dstr->sv_debug_inpad = sstr->sv_debug_inpad;
9253 dstr->sv_debug_cloned = 1;
9255 dstr->sv_debug_file = savepv(sstr->sv_debug_file);
9257 dstr->sv_debug_file = savesharedpv(sstr->sv_debug_file);
9261 ptr_table_store(PL_ptr_table, sstr, dstr);
9264 SvFLAGS(dstr) = SvFLAGS(sstr);
9265 SvFLAGS(dstr) &= ~SVf_OOK; /* don't propagate OOK hack */
9266 SvREFCNT(dstr) = 0; /* must be before any other dups! */
9269 if (SvANY(sstr) && PL_watch_pvx && SvPVX_const(sstr) == PL_watch_pvx)
9270 PerlIO_printf(Perl_debug_log, "watch at %p hit, found string \"%s\"\n",
9271 PL_watch_pvx, SvPVX_const(sstr));
9274 /* don't clone objects whose class has asked us not to */
9275 if (SvOBJECT(sstr) && ! (SvFLAGS(SvSTASH(sstr)) & SVphv_CLONEABLE)) {
9276 SvFLAGS(dstr) &= ~SVTYPEMASK;
9281 switch (SvTYPE(sstr)) {
9286 SvANY(dstr) = (XPVIV*)((char*)&(dstr->sv_u.svu_iv) - STRUCT_OFFSET(XPVIV, xiv_iv));
9287 SvIV_set(dstr, SvIVX(sstr));
9290 SvANY(dstr) = new_XNV();
9291 SvNV_set(dstr, SvNVX(sstr));
9294 SvANY(dstr) = &(dstr->sv_u.svu_rv);
9295 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
9299 /* These are all the types that need complex bodies allocating. */
9301 const svtype sv_type = SvTYPE(sstr);
9302 const struct body_details *const sv_type_details
9303 = bodies_by_type + sv_type;
9307 Perl_croak(aTHX_ "Bizarre SvTYPE [%" IVdf "]",
9312 if (GvUNIQUE((GV*)sstr)) {
9313 /* Do sharing here, and fall through */
9326 assert(sv_type_details->copy);
9327 if (sv_type_details->arena) {
9328 new_body_inline(new_body, sv_type_details->copy, sv_type);
9330 = (void*)((char*)new_body - sv_type_details->offset);
9332 new_body = new_NOARENA(sv_type_details);
9336 SvANY(dstr) = new_body;
9339 Copy(((char*)SvANY(sstr)) + sv_type_details->offset,
9340 ((char*)SvANY(dstr)) + sv_type_details->offset,
9341 sv_type_details->copy, char);
9343 Copy(((char*)SvANY(sstr)),
9344 ((char*)SvANY(dstr)),
9345 sv_type_details->size + sv_type_details->offset, char);
9348 if (sv_type != SVt_PVAV && sv_type != SVt_PVHV)
9349 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
9351 /* The Copy above means that all the source (unduplicated) pointers
9352 are now in the destination. We can check the flags and the
9353 pointers in either, but it's possible that there's less cache
9354 missing by always going for the destination.
9355 FIXME - instrument and check that assumption */
9356 if (sv_type >= SVt_PVMG) {
9358 SvMAGIC_set(dstr, mg_dup(SvMAGIC(dstr), param));
9360 SvSTASH_set(dstr, hv_dup_inc(SvSTASH(dstr), param));
9363 /* The cast silences a GCC warning about unhandled types. */
9364 switch ((int)sv_type) {
9376 /* XXX LvTARGOFF sometimes holds PMOP* when DEBUGGING */
9377 if (LvTYPE(dstr) == 't') /* for tie: unrefcnted fake (SV**) */
9378 LvTARG(dstr) = dstr;
9379 else if (LvTYPE(dstr) == 'T') /* for tie: fake HE */
9380 LvTARG(dstr) = (SV*)he_dup((HE*)LvTARG(dstr), 0, param);
9382 LvTARG(dstr) = sv_dup_inc(LvTARG(dstr), param);
9385 GvNAME(dstr) = SAVEPVN(GvNAME(dstr), GvNAMELEN(dstr));
9386 GvSTASH(dstr) = hv_dup(GvSTASH(dstr), param);
9387 /* Don't call sv_add_backref here as it's going to be created
9388 as part of the magic cloning of the symbol table. */
9389 GvGP(dstr) = gp_dup(GvGP(dstr), param);
9390 (void)GpREFCNT_inc(GvGP(dstr));
9393 IoIFP(dstr) = fp_dup(IoIFP(dstr), IoTYPE(dstr), param);
9394 if (IoOFP(dstr) == IoIFP(sstr))
9395 IoOFP(dstr) = IoIFP(dstr);
9397 IoOFP(dstr) = fp_dup(IoOFP(dstr), IoTYPE(dstr), param);
9398 /* PL_rsfp_filters entries have fake IoDIRP() */
9399 if (IoDIRP(dstr) && !(IoFLAGS(dstr) & IOf_FAKE_DIRP))
9400 IoDIRP(dstr) = dirp_dup(IoDIRP(dstr));
9401 if(IoFLAGS(dstr) & IOf_FAKE_DIRP) {
9402 /* I have no idea why fake dirp (rsfps)
9403 should be treated differently but otherwise
9404 we end up with leaks -- sky*/
9405 IoTOP_GV(dstr) = gv_dup_inc(IoTOP_GV(dstr), param);
9406 IoFMT_GV(dstr) = gv_dup_inc(IoFMT_GV(dstr), param);
9407 IoBOTTOM_GV(dstr) = gv_dup_inc(IoBOTTOM_GV(dstr), param);
9409 IoTOP_GV(dstr) = gv_dup(IoTOP_GV(dstr), param);
9410 IoFMT_GV(dstr) = gv_dup(IoFMT_GV(dstr), param);
9411 IoBOTTOM_GV(dstr) = gv_dup(IoBOTTOM_GV(dstr), param);
9413 IoTOP_NAME(dstr) = SAVEPV(IoTOP_NAME(dstr));
9414 IoFMT_NAME(dstr) = SAVEPV(IoFMT_NAME(dstr));
9415 IoBOTTOM_NAME(dstr) = SAVEPV(IoBOTTOM_NAME(dstr));
9418 if (AvARRAY((AV*)sstr)) {
9419 SV **dst_ary, **src_ary;
9420 SSize_t items = AvFILLp((AV*)sstr) + 1;
9422 src_ary = AvARRAY((AV*)sstr);
9423 Newxz(dst_ary, AvMAX((AV*)sstr)+1, SV*);
9424 ptr_table_store(PL_ptr_table, src_ary, dst_ary);
9425 SvPV_set(dstr, (char*)dst_ary);
9426 AvALLOC((AV*)dstr) = dst_ary;
9427 if (AvREAL((AV*)sstr)) {
9429 *dst_ary++ = sv_dup_inc(*src_ary++, param);
9433 *dst_ary++ = sv_dup(*src_ary++, param);
9435 items = AvMAX((AV*)sstr) - AvFILLp((AV*)sstr);
9436 while (items-- > 0) {
9437 *dst_ary++ = &PL_sv_undef;
9441 SvPV_set(dstr, Nullch);
9442 AvALLOC((AV*)dstr) = (SV**)NULL;
9449 if (HvARRAY((HV*)sstr)) {
9451 const bool sharekeys = !!HvSHAREKEYS(sstr);
9452 XPVHV * const dxhv = (XPVHV*)SvANY(dstr);
9453 XPVHV * const sxhv = (XPVHV*)SvANY(sstr);
9455 Newx(darray, PERL_HV_ARRAY_ALLOC_BYTES(dxhv->xhv_max+1)
9456 + (SvOOK(sstr) ? sizeof(struct xpvhv_aux) : 0),
9458 HvARRAY(dstr) = (HE**)darray;
9459 while (i <= sxhv->xhv_max) {
9460 const HE *source = HvARRAY(sstr)[i];
9461 HvARRAY(dstr)[i] = source
9462 ? he_dup(source, sharekeys, param) : 0;
9466 struct xpvhv_aux * const saux = HvAUX(sstr);
9467 struct xpvhv_aux * const daux = HvAUX(dstr);
9468 /* This flag isn't copied. */
9469 /* SvOOK_on(hv) attacks the IV flags. */
9470 SvFLAGS(dstr) |= SVf_OOK;
9472 hvname = saux->xhv_name;
9474 = hvname ? hek_dup(hvname, param) : hvname;
9476 daux->xhv_riter = saux->xhv_riter;
9477 daux->xhv_eiter = saux->xhv_eiter
9478 ? he_dup(saux->xhv_eiter,
9479 (bool)!!HvSHAREKEYS(sstr), param) : 0;
9483 SvPV_set(dstr, Nullch);
9485 /* Record stashes for possible cloning in Perl_clone(). */
9487 av_push(param->stashes, dstr);
9492 /* NOTE: not refcounted */
9493 CvSTASH(dstr) = hv_dup(CvSTASH(dstr), param);
9495 CvROOT(dstr) = OpREFCNT_inc(CvROOT(dstr));
9497 if (CvCONST(dstr)) {
9498 CvXSUBANY(dstr).any_ptr = GvUNIQUE(CvGV(dstr)) ?
9499 SvREFCNT_inc(CvXSUBANY(dstr).any_ptr) :
9500 sv_dup_inc((SV *)CvXSUBANY(dstr).any_ptr, param);
9502 /* don't dup if copying back - CvGV isn't refcounted, so the
9503 * duped GV may never be freed. A bit of a hack! DAPM */
9504 CvGV(dstr) = (param->flags & CLONEf_JOIN_IN) ?
9505 Nullgv : gv_dup(CvGV(dstr), param) ;
9506 if (!(param->flags & CLONEf_COPY_STACKS)) {
9509 PAD_DUP(CvPADLIST(dstr), CvPADLIST(sstr), param);
9512 ? cv_dup( CvOUTSIDE(dstr), param)
9513 : cv_dup_inc(CvOUTSIDE(dstr), param);
9515 CvFILE(dstr) = SAVEPV(CvFILE(dstr));
9521 if (SvOBJECT(dstr) && SvTYPE(dstr) != SVt_PVIO)
9527 /* duplicate a context */
9530 Perl_cx_dup(pTHX_ PERL_CONTEXT *cxs, I32 ix, I32 max, CLONE_PARAMS* param)
9535 return (PERL_CONTEXT*)NULL;
9537 /* look for it in the table first */
9538 ncxs = (PERL_CONTEXT*)ptr_table_fetch(PL_ptr_table, cxs);
9542 /* create anew and remember what it is */
9543 Newxz(ncxs, max + 1, PERL_CONTEXT);
9544 ptr_table_store(PL_ptr_table, cxs, ncxs);
9547 PERL_CONTEXT *cx = &cxs[ix];
9548 PERL_CONTEXT *ncx = &ncxs[ix];
9549 ncx->cx_type = cx->cx_type;
9550 if (CxTYPE(cx) == CXt_SUBST) {
9551 Perl_croak(aTHX_ "Cloning substitution context is unimplemented");
9554 ncx->blk_oldsp = cx->blk_oldsp;
9555 ncx->blk_oldcop = cx->blk_oldcop;
9556 ncx->blk_oldmarksp = cx->blk_oldmarksp;
9557 ncx->blk_oldscopesp = cx->blk_oldscopesp;
9558 ncx->blk_oldpm = cx->blk_oldpm;
9559 ncx->blk_gimme = cx->blk_gimme;
9560 switch (CxTYPE(cx)) {
9562 ncx->blk_sub.cv = (cx->blk_sub.olddepth == 0
9563 ? cv_dup_inc(cx->blk_sub.cv, param)
9564 : cv_dup(cx->blk_sub.cv,param));
9565 ncx->blk_sub.argarray = (cx->blk_sub.hasargs
9566 ? av_dup_inc(cx->blk_sub.argarray, param)
9568 ncx->blk_sub.savearray = av_dup_inc(cx->blk_sub.savearray, param);
9569 ncx->blk_sub.olddepth = cx->blk_sub.olddepth;
9570 ncx->blk_sub.hasargs = cx->blk_sub.hasargs;
9571 ncx->blk_sub.lval = cx->blk_sub.lval;
9572 ncx->blk_sub.retop = cx->blk_sub.retop;
9575 ncx->blk_eval.old_in_eval = cx->blk_eval.old_in_eval;
9576 ncx->blk_eval.old_op_type = cx->blk_eval.old_op_type;
9577 ncx->blk_eval.old_namesv = sv_dup_inc(cx->blk_eval.old_namesv, param);
9578 ncx->blk_eval.old_eval_root = cx->blk_eval.old_eval_root;
9579 ncx->blk_eval.cur_text = sv_dup(cx->blk_eval.cur_text, param);
9580 ncx->blk_eval.retop = cx->blk_eval.retop;
9583 ncx->blk_loop.label = cx->blk_loop.label;
9584 ncx->blk_loop.resetsp = cx->blk_loop.resetsp;
9585 ncx->blk_loop.redo_op = cx->blk_loop.redo_op;
9586 ncx->blk_loop.next_op = cx->blk_loop.next_op;
9587 ncx->blk_loop.last_op = cx->blk_loop.last_op;
9588 ncx->blk_loop.iterdata = (CxPADLOOP(cx)
9589 ? cx->blk_loop.iterdata
9590 : gv_dup((GV*)cx->blk_loop.iterdata, param));
9591 ncx->blk_loop.oldcomppad
9592 = (PAD*)ptr_table_fetch(PL_ptr_table,
9593 cx->blk_loop.oldcomppad);
9594 ncx->blk_loop.itersave = sv_dup_inc(cx->blk_loop.itersave, param);
9595 ncx->blk_loop.iterlval = sv_dup_inc(cx->blk_loop.iterlval, param);
9596 ncx->blk_loop.iterary = av_dup_inc(cx->blk_loop.iterary, param);
9597 ncx->blk_loop.iterix = cx->blk_loop.iterix;
9598 ncx->blk_loop.itermax = cx->blk_loop.itermax;
9601 ncx->blk_sub.cv = cv_dup(cx->blk_sub.cv, param);
9602 ncx->blk_sub.gv = gv_dup(cx->blk_sub.gv, param);
9603 ncx->blk_sub.dfoutgv = gv_dup_inc(cx->blk_sub.dfoutgv, param);
9604 ncx->blk_sub.hasargs = cx->blk_sub.hasargs;
9605 ncx->blk_sub.retop = cx->blk_sub.retop;
9617 /* duplicate a stack info structure */
9620 Perl_si_dup(pTHX_ PERL_SI *si, CLONE_PARAMS* param)
9625 return (PERL_SI*)NULL;
9627 /* look for it in the table first */
9628 nsi = (PERL_SI*)ptr_table_fetch(PL_ptr_table, si);
9632 /* create anew and remember what it is */
9633 Newxz(nsi, 1, PERL_SI);
9634 ptr_table_store(PL_ptr_table, si, nsi);
9636 nsi->si_stack = av_dup_inc(si->si_stack, param);
9637 nsi->si_cxix = si->si_cxix;
9638 nsi->si_cxmax = si->si_cxmax;
9639 nsi->si_cxstack = cx_dup(si->si_cxstack, si->si_cxix, si->si_cxmax, param);
9640 nsi->si_type = si->si_type;
9641 nsi->si_prev = si_dup(si->si_prev, param);
9642 nsi->si_next = si_dup(si->si_next, param);
9643 nsi->si_markoff = si->si_markoff;
9648 #define POPINT(ss,ix) ((ss)[--(ix)].any_i32)
9649 #define TOPINT(ss,ix) ((ss)[ix].any_i32)
9650 #define POPLONG(ss,ix) ((ss)[--(ix)].any_long)
9651 #define TOPLONG(ss,ix) ((ss)[ix].any_long)
9652 #define POPIV(ss,ix) ((ss)[--(ix)].any_iv)
9653 #define TOPIV(ss,ix) ((ss)[ix].any_iv)
9654 #define POPBOOL(ss,ix) ((ss)[--(ix)].any_bool)
9655 #define TOPBOOL(ss,ix) ((ss)[ix].any_bool)
9656 #define POPPTR(ss,ix) ((ss)[--(ix)].any_ptr)
9657 #define TOPPTR(ss,ix) ((ss)[ix].any_ptr)
9658 #define POPDPTR(ss,ix) ((ss)[--(ix)].any_dptr)
9659 #define TOPDPTR(ss,ix) ((ss)[ix].any_dptr)
9660 #define POPDXPTR(ss,ix) ((ss)[--(ix)].any_dxptr)
9661 #define TOPDXPTR(ss,ix) ((ss)[ix].any_dxptr)
9664 #define pv_dup_inc(p) SAVEPV(p)
9665 #define pv_dup(p) SAVEPV(p)
9666 #define svp_dup_inc(p,pp) any_dup(p,pp)
9668 /* map any object to the new equivent - either something in the
9669 * ptr table, or something in the interpreter structure
9673 Perl_any_dup(pTHX_ void *v, const PerlInterpreter *proto_perl)
9680 /* look for it in the table first */
9681 ret = ptr_table_fetch(PL_ptr_table, v);
9685 /* see if it is part of the interpreter structure */
9686 if (v >= (void*)proto_perl && v < (void*)(proto_perl+1))
9687 ret = (void*)(((char*)aTHX) + (((char*)v) - (char*)proto_perl));
9695 /* duplicate the save stack */
9698 Perl_ss_dup(pTHX_ PerlInterpreter *proto_perl, CLONE_PARAMS* param)
9700 ANY * const ss = proto_perl->Tsavestack;
9701 const I32 max = proto_perl->Tsavestack_max;
9702 I32 ix = proto_perl->Tsavestack_ix;
9714 void (*dptr) (void*);
9715 void (*dxptr) (pTHX_ void*);
9717 Newxz(nss, max, ANY);
9720 I32 i = POPINT(ss,ix);
9723 case SAVEt_ITEM: /* normal string */
9724 sv = (SV*)POPPTR(ss,ix);
9725 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
9726 sv = (SV*)POPPTR(ss,ix);
9727 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
9729 case SAVEt_SV: /* scalar reference */
9730 sv = (SV*)POPPTR(ss,ix);
9731 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
9732 gv = (GV*)POPPTR(ss,ix);
9733 TOPPTR(nss,ix) = gv_dup_inc(gv, param);
9735 case SAVEt_GENERIC_PVREF: /* generic char* */
9736 c = (char*)POPPTR(ss,ix);
9737 TOPPTR(nss,ix) = pv_dup(c);
9738 ptr = POPPTR(ss,ix);
9739 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
9741 case SAVEt_SHARED_PVREF: /* char* in shared space */
9742 c = (char*)POPPTR(ss,ix);
9743 TOPPTR(nss,ix) = savesharedpv(c);
9744 ptr = POPPTR(ss,ix);
9745 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
9747 case SAVEt_GENERIC_SVREF: /* generic sv */
9748 case SAVEt_SVREF: /* scalar reference */
9749 sv = (SV*)POPPTR(ss,ix);
9750 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
9751 ptr = POPPTR(ss,ix);
9752 TOPPTR(nss,ix) = svp_dup_inc((SV**)ptr, proto_perl);/* XXXXX */
9754 case SAVEt_AV: /* array reference */
9755 av = (AV*)POPPTR(ss,ix);
9756 TOPPTR(nss,ix) = av_dup_inc(av, param);
9757 gv = (GV*)POPPTR(ss,ix);
9758 TOPPTR(nss,ix) = gv_dup(gv, param);
9760 case SAVEt_HV: /* hash reference */
9761 hv = (HV*)POPPTR(ss,ix);
9762 TOPPTR(nss,ix) = hv_dup_inc(hv, param);
9763 gv = (GV*)POPPTR(ss,ix);
9764 TOPPTR(nss,ix) = gv_dup(gv, param);
9766 case SAVEt_INT: /* int reference */
9767 ptr = POPPTR(ss,ix);
9768 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
9769 intval = (int)POPINT(ss,ix);
9770 TOPINT(nss,ix) = intval;
9772 case SAVEt_LONG: /* long reference */
9773 ptr = POPPTR(ss,ix);
9774 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
9775 longval = (long)POPLONG(ss,ix);
9776 TOPLONG(nss,ix) = longval;
9778 case SAVEt_I32: /* I32 reference */
9779 case SAVEt_I16: /* I16 reference */
9780 case SAVEt_I8: /* I8 reference */
9781 ptr = POPPTR(ss,ix);
9782 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
9786 case SAVEt_IV: /* IV reference */
9787 ptr = POPPTR(ss,ix);
9788 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
9792 case SAVEt_SPTR: /* SV* reference */
9793 ptr = POPPTR(ss,ix);
9794 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
9795 sv = (SV*)POPPTR(ss,ix);
9796 TOPPTR(nss,ix) = sv_dup(sv, param);
9798 case SAVEt_VPTR: /* random* reference */
9799 ptr = POPPTR(ss,ix);
9800 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
9801 ptr = POPPTR(ss,ix);
9802 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
9804 case SAVEt_PPTR: /* char* reference */
9805 ptr = POPPTR(ss,ix);
9806 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
9807 c = (char*)POPPTR(ss,ix);
9808 TOPPTR(nss,ix) = pv_dup(c);
9810 case SAVEt_HPTR: /* HV* reference */
9811 ptr = POPPTR(ss,ix);
9812 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
9813 hv = (HV*)POPPTR(ss,ix);
9814 TOPPTR(nss,ix) = hv_dup(hv, param);
9816 case SAVEt_APTR: /* AV* reference */
9817 ptr = POPPTR(ss,ix);
9818 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
9819 av = (AV*)POPPTR(ss,ix);
9820 TOPPTR(nss,ix) = av_dup(av, param);
9823 gv = (GV*)POPPTR(ss,ix);
9824 TOPPTR(nss,ix) = gv_dup(gv, param);
9826 case SAVEt_GP: /* scalar reference */
9827 gp = (GP*)POPPTR(ss,ix);
9828 TOPPTR(nss,ix) = gp = gp_dup(gp, param);
9829 (void)GpREFCNT_inc(gp);
9830 gv = (GV*)POPPTR(ss,ix);
9831 TOPPTR(nss,ix) = gv_dup_inc(gv, param);
9832 c = (char*)POPPTR(ss,ix);
9833 TOPPTR(nss,ix) = pv_dup(c);
9840 case SAVEt_MORTALIZESV:
9841 sv = (SV*)POPPTR(ss,ix);
9842 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
9845 ptr = POPPTR(ss,ix);
9846 if (ptr && (((OP*)ptr)->op_private & OPpREFCOUNTED)) {
9847 /* these are assumed to be refcounted properly */
9849 switch (((OP*)ptr)->op_type) {
9856 TOPPTR(nss,ix) = ptr;
9861 TOPPTR(nss,ix) = Nullop;
9866 TOPPTR(nss,ix) = Nullop;
9869 c = (char*)POPPTR(ss,ix);
9870 TOPPTR(nss,ix) = pv_dup_inc(c);
9873 longval = POPLONG(ss,ix);
9874 TOPLONG(nss,ix) = longval;
9877 hv = (HV*)POPPTR(ss,ix);
9878 TOPPTR(nss,ix) = hv_dup_inc(hv, param);
9879 c = (char*)POPPTR(ss,ix);
9880 TOPPTR(nss,ix) = pv_dup_inc(c);
9884 case SAVEt_DESTRUCTOR:
9885 ptr = POPPTR(ss,ix);
9886 TOPPTR(nss,ix) = any_dup(ptr, proto_perl); /* XXX quite arbitrary */
9887 dptr = POPDPTR(ss,ix);
9888 TOPDPTR(nss,ix) = DPTR2FPTR(void (*)(void*),
9889 any_dup(FPTR2DPTR(void *, dptr),
9892 case SAVEt_DESTRUCTOR_X:
9893 ptr = POPPTR(ss,ix);
9894 TOPPTR(nss,ix) = any_dup(ptr, proto_perl); /* XXX quite arbitrary */
9895 dxptr = POPDXPTR(ss,ix);
9896 TOPDXPTR(nss,ix) = DPTR2FPTR(void (*)(pTHX_ void*),
9897 any_dup(FPTR2DPTR(void *, dxptr),
9900 case SAVEt_REGCONTEXT:
9906 case SAVEt_STACK_POS: /* Position on Perl stack */
9910 case SAVEt_AELEM: /* array element */
9911 sv = (SV*)POPPTR(ss,ix);
9912 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
9915 av = (AV*)POPPTR(ss,ix);
9916 TOPPTR(nss,ix) = av_dup_inc(av, param);
9918 case SAVEt_HELEM: /* hash element */
9919 sv = (SV*)POPPTR(ss,ix);
9920 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
9921 sv = (SV*)POPPTR(ss,ix);
9922 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
9923 hv = (HV*)POPPTR(ss,ix);
9924 TOPPTR(nss,ix) = hv_dup_inc(hv, param);
9927 ptr = POPPTR(ss,ix);
9928 TOPPTR(nss,ix) = ptr;
9935 av = (AV*)POPPTR(ss,ix);
9936 TOPPTR(nss,ix) = av_dup(av, param);
9939 longval = (long)POPLONG(ss,ix);
9940 TOPLONG(nss,ix) = longval;
9941 ptr = POPPTR(ss,ix);
9942 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
9943 sv = (SV*)POPPTR(ss,ix);
9944 TOPPTR(nss,ix) = sv_dup(sv, param);
9947 ptr = POPPTR(ss,ix);
9948 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
9949 longval = (long)POPBOOL(ss,ix);
9950 TOPBOOL(nss,ix) = (bool)longval;
9952 case SAVEt_SET_SVFLAGS:
9957 sv = (SV*)POPPTR(ss,ix);
9958 TOPPTR(nss,ix) = sv_dup(sv, param);
9961 Perl_croak(aTHX_ "panic: ss_dup inconsistency");
9969 /* if sv is a stash, call $class->CLONE_SKIP(), and set the SVphv_CLONEABLE
9970 * flag to the result. This is done for each stash before cloning starts,
9971 * so we know which stashes want their objects cloned */
9974 do_mark_cloneable_stash(pTHX_ SV *sv)
9976 const HEK * const hvname = HvNAME_HEK((HV*)sv);
9978 GV* const cloner = gv_fetchmethod_autoload((HV*)sv, "CLONE_SKIP", 0);
9979 SvFLAGS(sv) |= SVphv_CLONEABLE; /* clone objects by default */
9980 if (cloner && GvCV(cloner)) {
9987 XPUSHs(sv_2mortal(newSVhek(hvname)));
9989 call_sv((SV*)GvCV(cloner), G_SCALAR);
9996 SvFLAGS(sv) &= ~SVphv_CLONEABLE;
10004 =for apidoc perl_clone
10006 Create and return a new interpreter by cloning the current one.
10008 perl_clone takes these flags as parameters:
10010 CLONEf_COPY_STACKS - is used to, well, copy the stacks also,
10011 without it we only clone the data and zero the stacks,
10012 with it we copy the stacks and the new perl interpreter is
10013 ready to run at the exact same point as the previous one.
10014 The pseudo-fork code uses COPY_STACKS while the
10015 threads->new doesn't.
10017 CLONEf_KEEP_PTR_TABLE
10018 perl_clone keeps a ptr_table with the pointer of the old
10019 variable as a key and the new variable as a value,
10020 this allows it to check if something has been cloned and not
10021 clone it again but rather just use the value and increase the
10022 refcount. If KEEP_PTR_TABLE is not set then perl_clone will kill
10023 the ptr_table using the function
10024 C<ptr_table_free(PL_ptr_table); PL_ptr_table = NULL;>,
10025 reason to keep it around is if you want to dup some of your own
10026 variable who are outside the graph perl scans, example of this
10027 code is in threads.xs create
10030 This is a win32 thing, it is ignored on unix, it tells perls
10031 win32host code (which is c++) to clone itself, this is needed on
10032 win32 if you want to run two threads at the same time,
10033 if you just want to do some stuff in a separate perl interpreter
10034 and then throw it away and return to the original one,
10035 you don't need to do anything.
10040 /* XXX the above needs expanding by someone who actually understands it ! */
10041 EXTERN_C PerlInterpreter *
10042 perl_clone_host(PerlInterpreter* proto_perl, UV flags);
10045 perl_clone(PerlInterpreter *proto_perl, UV flags)
10048 #ifdef PERL_IMPLICIT_SYS
10050 /* perlhost.h so we need to call into it
10051 to clone the host, CPerlHost should have a c interface, sky */
10053 if (flags & CLONEf_CLONE_HOST) {
10054 return perl_clone_host(proto_perl,flags);
10056 return perl_clone_using(proto_perl, flags,
10058 proto_perl->IMemShared,
10059 proto_perl->IMemParse,
10061 proto_perl->IStdIO,
10065 proto_perl->IProc);
10069 perl_clone_using(PerlInterpreter *proto_perl, UV flags,
10070 struct IPerlMem* ipM, struct IPerlMem* ipMS,
10071 struct IPerlMem* ipMP, struct IPerlEnv* ipE,
10072 struct IPerlStdIO* ipStd, struct IPerlLIO* ipLIO,
10073 struct IPerlDir* ipD, struct IPerlSock* ipS,
10074 struct IPerlProc* ipP)
10076 /* XXX many of the string copies here can be optimized if they're
10077 * constants; they need to be allocated as common memory and just
10078 * their pointers copied. */
10081 CLONE_PARAMS clone_params;
10082 CLONE_PARAMS* param = &clone_params;
10084 PerlInterpreter *my_perl = (PerlInterpreter*)(*ipM->pMalloc)(ipM, sizeof(PerlInterpreter));
10085 /* for each stash, determine whether its objects should be cloned */
10086 S_visit(proto_perl, do_mark_cloneable_stash, SVt_PVHV, SVTYPEMASK);
10087 PERL_SET_THX(my_perl);
10090 Poison(my_perl, 1, PerlInterpreter);
10092 PL_curcop = (COP *)Nullop;
10096 PL_savestack_ix = 0;
10097 PL_savestack_max = -1;
10098 PL_sig_pending = 0;
10099 Zero(&PL_debug_pad, 1, struct perl_debug_pad);
10100 # else /* !DEBUGGING */
10101 Zero(my_perl, 1, PerlInterpreter);
10102 # endif /* DEBUGGING */
10104 /* host pointers */
10106 PL_MemShared = ipMS;
10107 PL_MemParse = ipMP;
10114 #else /* !PERL_IMPLICIT_SYS */
10116 CLONE_PARAMS clone_params;
10117 CLONE_PARAMS* param = &clone_params;
10118 PerlInterpreter *my_perl = (PerlInterpreter*)PerlMem_malloc(sizeof(PerlInterpreter));
10119 /* for each stash, determine whether its objects should be cloned */
10120 S_visit(proto_perl, do_mark_cloneable_stash, SVt_PVHV, SVTYPEMASK);
10121 PERL_SET_THX(my_perl);
10124 Poison(my_perl, 1, PerlInterpreter);
10126 PL_curcop = (COP *)Nullop;
10130 PL_savestack_ix = 0;
10131 PL_savestack_max = -1;
10132 PL_sig_pending = 0;
10133 Zero(&PL_debug_pad, 1, struct perl_debug_pad);
10134 # else /* !DEBUGGING */
10135 Zero(my_perl, 1, PerlInterpreter);
10136 # endif /* DEBUGGING */
10137 #endif /* PERL_IMPLICIT_SYS */
10138 param->flags = flags;
10139 param->proto_perl = proto_perl;
10141 Zero(&PL_body_arenaroots, 1, PL_body_arenaroots);
10142 Zero(&PL_body_roots, 1, PL_body_roots);
10144 PL_nice_chunk = NULL;
10145 PL_nice_chunk_size = 0;
10147 PL_sv_objcount = 0;
10148 PL_sv_root = Nullsv;
10149 PL_sv_arenaroot = Nullsv;
10151 PL_debug = proto_perl->Idebug;
10153 PL_hash_seed = proto_perl->Ihash_seed;
10154 PL_rehash_seed = proto_perl->Irehash_seed;
10156 #ifdef USE_REENTRANT_API
10157 /* XXX: things like -Dm will segfault here in perlio, but doing
10158 * PERL_SET_CONTEXT(proto_perl);
10159 * breaks too many other things
10161 Perl_reentrant_init(aTHX);
10164 /* create SV map for pointer relocation */
10165 PL_ptr_table = ptr_table_new();
10167 /* initialize these special pointers as early as possible */
10168 SvANY(&PL_sv_undef) = NULL;
10169 SvREFCNT(&PL_sv_undef) = (~(U32)0)/2;
10170 SvFLAGS(&PL_sv_undef) = SVf_READONLY|SVt_NULL;
10171 ptr_table_store(PL_ptr_table, &proto_perl->Isv_undef, &PL_sv_undef);
10173 SvANY(&PL_sv_no) = new_XPVNV();
10174 SvREFCNT(&PL_sv_no) = (~(U32)0)/2;
10175 SvFLAGS(&PL_sv_no) = SVp_IOK|SVf_IOK|SVp_NOK|SVf_NOK
10176 |SVp_POK|SVf_POK|SVf_READONLY|SVt_PVNV;
10177 SvPV_set(&PL_sv_no, SAVEPVN(PL_No, 0));
10178 SvCUR_set(&PL_sv_no, 0);
10179 SvLEN_set(&PL_sv_no, 1);
10180 SvIV_set(&PL_sv_no, 0);
10181 SvNV_set(&PL_sv_no, 0);
10182 ptr_table_store(PL_ptr_table, &proto_perl->Isv_no, &PL_sv_no);
10184 SvANY(&PL_sv_yes) = new_XPVNV();
10185 SvREFCNT(&PL_sv_yes) = (~(U32)0)/2;
10186 SvFLAGS(&PL_sv_yes) = SVp_IOK|SVf_IOK|SVp_NOK|SVf_NOK
10187 |SVp_POK|SVf_POK|SVf_READONLY|SVt_PVNV;
10188 SvPV_set(&PL_sv_yes, SAVEPVN(PL_Yes, 1));
10189 SvCUR_set(&PL_sv_yes, 1);
10190 SvLEN_set(&PL_sv_yes, 2);
10191 SvIV_set(&PL_sv_yes, 1);
10192 SvNV_set(&PL_sv_yes, 1);
10193 ptr_table_store(PL_ptr_table, &proto_perl->Isv_yes, &PL_sv_yes);
10195 /* create (a non-shared!) shared string table */
10196 PL_strtab = newHV();
10197 HvSHAREKEYS_off(PL_strtab);
10198 hv_ksplit(PL_strtab, HvTOTALKEYS(proto_perl->Istrtab));
10199 ptr_table_store(PL_ptr_table, proto_perl->Istrtab, PL_strtab);
10201 PL_compiling = proto_perl->Icompiling;
10203 /* These two PVs will be free'd special way so must set them same way op.c does */
10204 PL_compiling.cop_stashpv = savesharedpv(PL_compiling.cop_stashpv);
10205 ptr_table_store(PL_ptr_table, proto_perl->Icompiling.cop_stashpv, PL_compiling.cop_stashpv);
10207 PL_compiling.cop_file = savesharedpv(PL_compiling.cop_file);
10208 ptr_table_store(PL_ptr_table, proto_perl->Icompiling.cop_file, PL_compiling.cop_file);
10210 ptr_table_store(PL_ptr_table, &proto_perl->Icompiling, &PL_compiling);
10211 if (!specialWARN(PL_compiling.cop_warnings))
10212 PL_compiling.cop_warnings = sv_dup_inc(PL_compiling.cop_warnings, param);
10213 if (!specialCopIO(PL_compiling.cop_io))
10214 PL_compiling.cop_io = sv_dup_inc(PL_compiling.cop_io, param);
10215 PL_curcop = (COP*)any_dup(proto_perl->Tcurcop, proto_perl);
10217 /* pseudo environmental stuff */
10218 PL_origargc = proto_perl->Iorigargc;
10219 PL_origargv = proto_perl->Iorigargv;
10221 param->stashes = newAV(); /* Setup array of objects to call clone on */
10223 /* Set tainting stuff before PerlIO_debug can possibly get called */
10224 PL_tainting = proto_perl->Itainting;
10225 PL_taint_warn = proto_perl->Itaint_warn;
10227 #ifdef PERLIO_LAYERS
10228 /* Clone PerlIO tables as soon as we can handle general xx_dup() */
10229 PerlIO_clone(aTHX_ proto_perl, param);
10232 PL_envgv = gv_dup(proto_perl->Ienvgv, param);
10233 PL_incgv = gv_dup(proto_perl->Iincgv, param);
10234 PL_hintgv = gv_dup(proto_perl->Ihintgv, param);
10235 PL_origfilename = SAVEPV(proto_perl->Iorigfilename);
10236 PL_diehook = sv_dup_inc(proto_perl->Idiehook, param);
10237 PL_warnhook = sv_dup_inc(proto_perl->Iwarnhook, param);
10240 PL_minus_c = proto_perl->Iminus_c;
10241 PL_patchlevel = sv_dup_inc(proto_perl->Ipatchlevel, param);
10242 PL_localpatches = proto_perl->Ilocalpatches;
10243 PL_splitstr = proto_perl->Isplitstr;
10244 PL_preprocess = proto_perl->Ipreprocess;
10245 PL_minus_n = proto_perl->Iminus_n;
10246 PL_minus_p = proto_perl->Iminus_p;
10247 PL_minus_l = proto_perl->Iminus_l;
10248 PL_minus_a = proto_perl->Iminus_a;
10249 PL_minus_F = proto_perl->Iminus_F;
10250 PL_doswitches = proto_perl->Idoswitches;
10251 PL_dowarn = proto_perl->Idowarn;
10252 PL_doextract = proto_perl->Idoextract;
10253 PL_sawampersand = proto_perl->Isawampersand;
10254 PL_unsafe = proto_perl->Iunsafe;
10255 PL_inplace = SAVEPV(proto_perl->Iinplace);
10256 PL_e_script = sv_dup_inc(proto_perl->Ie_script, param);
10257 PL_perldb = proto_perl->Iperldb;
10258 PL_perl_destruct_level = proto_perl->Iperl_destruct_level;
10259 PL_exit_flags = proto_perl->Iexit_flags;
10261 /* magical thingies */
10262 /* XXX time(&PL_basetime) when asked for? */
10263 PL_basetime = proto_perl->Ibasetime;
10264 PL_formfeed = sv_dup(proto_perl->Iformfeed, param);
10266 PL_maxsysfd = proto_perl->Imaxsysfd;
10267 PL_multiline = proto_perl->Imultiline;
10268 PL_statusvalue = proto_perl->Istatusvalue;
10270 PL_statusvalue_vms = proto_perl->Istatusvalue_vms;
10272 PL_statusvalue_posix = proto_perl->Istatusvalue_posix;
10274 PL_encoding = sv_dup(proto_perl->Iencoding, param);
10276 sv_setpvn(PERL_DEBUG_PAD(0), "", 0); /* For regex debugging. */
10277 sv_setpvn(PERL_DEBUG_PAD(1), "", 0); /* ext/re needs these */
10278 sv_setpvn(PERL_DEBUG_PAD(2), "", 0); /* even without DEBUGGING. */
10280 /* Clone the regex array */
10281 PL_regex_padav = newAV();
10283 const I32 len = av_len((AV*)proto_perl->Iregex_padav);
10284 SV** const regexen = AvARRAY((AV*)proto_perl->Iregex_padav);
10286 av_push(PL_regex_padav,
10287 sv_dup_inc(regexen[0],param));
10288 for(i = 1; i <= len; i++) {
10289 if(SvREPADTMP(regexen[i])) {
10290 av_push(PL_regex_padav, sv_dup_inc(regexen[i], param));
10292 av_push(PL_regex_padav,
10294 newSViv(PTR2IV(re_dup(INT2PTR(REGEXP *,
10295 SvIVX(regexen[i])), param)))
10300 PL_regex_pad = AvARRAY(PL_regex_padav);
10302 /* shortcuts to various I/O objects */
10303 PL_stdingv = gv_dup(proto_perl->Istdingv, param);
10304 PL_stderrgv = gv_dup(proto_perl->Istderrgv, param);
10305 PL_defgv = gv_dup(proto_perl->Idefgv, param);
10306 PL_argvgv = gv_dup(proto_perl->Iargvgv, param);
10307 PL_argvoutgv = gv_dup(proto_perl->Iargvoutgv, param);
10308 PL_argvout_stack = av_dup_inc(proto_perl->Iargvout_stack, param);
10310 /* shortcuts to regexp stuff */
10311 PL_replgv = gv_dup(proto_perl->Ireplgv, param);
10313 /* shortcuts to misc objects */
10314 PL_errgv = gv_dup(proto_perl->Ierrgv, param);
10316 /* shortcuts to debugging objects */
10317 PL_DBgv = gv_dup(proto_perl->IDBgv, param);
10318 PL_DBline = gv_dup(proto_perl->IDBline, param);
10319 PL_DBsub = gv_dup(proto_perl->IDBsub, param);
10320 PL_DBsingle = sv_dup(proto_perl->IDBsingle, param);
10321 PL_DBtrace = sv_dup(proto_perl->IDBtrace, param);
10322 PL_DBsignal = sv_dup(proto_perl->IDBsignal, param);
10323 PL_DBassertion = sv_dup(proto_perl->IDBassertion, param);
10324 PL_lineary = av_dup(proto_perl->Ilineary, param);
10325 PL_dbargs = av_dup(proto_perl->Idbargs, param);
10327 /* symbol tables */
10328 PL_defstash = hv_dup_inc(proto_perl->Tdefstash, param);
10329 PL_curstash = hv_dup(proto_perl->Tcurstash, param);
10330 PL_debstash = hv_dup(proto_perl->Idebstash, param);
10331 PL_globalstash = hv_dup(proto_perl->Iglobalstash, param);
10332 PL_curstname = sv_dup_inc(proto_perl->Icurstname, param);
10334 PL_beginav = av_dup_inc(proto_perl->Ibeginav, param);
10335 PL_beginav_save = av_dup_inc(proto_perl->Ibeginav_save, param);
10336 PL_checkav_save = av_dup_inc(proto_perl->Icheckav_save, param);
10337 PL_endav = av_dup_inc(proto_perl->Iendav, param);
10338 PL_checkav = av_dup_inc(proto_perl->Icheckav, param);
10339 PL_initav = av_dup_inc(proto_perl->Iinitav, param);
10341 PL_sub_generation = proto_perl->Isub_generation;
10343 /* funky return mechanisms */
10344 PL_forkprocess = proto_perl->Iforkprocess;
10346 /* subprocess state */
10347 PL_fdpid = av_dup_inc(proto_perl->Ifdpid, param);
10349 /* internal state */
10350 PL_maxo = proto_perl->Imaxo;
10351 if (proto_perl->Iop_mask)
10352 PL_op_mask = SAVEPVN(proto_perl->Iop_mask, PL_maxo);
10354 PL_op_mask = Nullch;
10355 /* PL_asserting = proto_perl->Iasserting; */
10357 /* current interpreter roots */
10358 PL_main_cv = cv_dup_inc(proto_perl->Imain_cv, param);
10359 PL_main_root = OpREFCNT_inc(proto_perl->Imain_root);
10360 PL_main_start = proto_perl->Imain_start;
10361 PL_eval_root = proto_perl->Ieval_root;
10362 PL_eval_start = proto_perl->Ieval_start;
10364 /* runtime control stuff */
10365 PL_curcopdb = (COP*)any_dup(proto_perl->Icurcopdb, proto_perl);
10366 PL_copline = proto_perl->Icopline;
10368 PL_filemode = proto_perl->Ifilemode;
10369 PL_lastfd = proto_perl->Ilastfd;
10370 PL_oldname = proto_perl->Ioldname; /* XXX not quite right */
10373 PL_gensym = proto_perl->Igensym;
10374 PL_preambled = proto_perl->Ipreambled;
10375 PL_preambleav = av_dup_inc(proto_perl->Ipreambleav, param);
10376 PL_laststatval = proto_perl->Ilaststatval;
10377 PL_laststype = proto_perl->Ilaststype;
10378 PL_mess_sv = Nullsv;
10380 PL_ors_sv = sv_dup_inc(proto_perl->Iors_sv, param);
10382 /* interpreter atexit processing */
10383 PL_exitlistlen = proto_perl->Iexitlistlen;
10384 if (PL_exitlistlen) {
10385 Newx(PL_exitlist, PL_exitlistlen, PerlExitListEntry);
10386 Copy(proto_perl->Iexitlist, PL_exitlist, PL_exitlistlen, PerlExitListEntry);
10389 PL_exitlist = (PerlExitListEntry*)NULL;
10390 PL_modglobal = hv_dup_inc(proto_perl->Imodglobal, param);
10391 PL_custom_op_names = hv_dup_inc(proto_perl->Icustom_op_names,param);
10392 PL_custom_op_descs = hv_dup_inc(proto_perl->Icustom_op_descs,param);
10394 PL_profiledata = NULL;
10395 PL_rsfp = fp_dup(proto_perl->Irsfp, '<', param);
10396 /* PL_rsfp_filters entries have fake IoDIRP() */
10397 PL_rsfp_filters = av_dup_inc(proto_perl->Irsfp_filters, param);
10399 PL_compcv = cv_dup(proto_perl->Icompcv, param);
10401 PAD_CLONE_VARS(proto_perl, param);
10403 #ifdef HAVE_INTERP_INTERN
10404 sys_intern_dup(&proto_perl->Isys_intern, &PL_sys_intern);
10407 /* more statics moved here */
10408 PL_generation = proto_perl->Igeneration;
10409 PL_DBcv = cv_dup(proto_perl->IDBcv, param);
10411 PL_in_clean_objs = proto_perl->Iin_clean_objs;
10412 PL_in_clean_all = proto_perl->Iin_clean_all;
10414 PL_uid = proto_perl->Iuid;
10415 PL_euid = proto_perl->Ieuid;
10416 PL_gid = proto_perl->Igid;
10417 PL_egid = proto_perl->Iegid;
10418 PL_nomemok = proto_perl->Inomemok;
10419 PL_an = proto_perl->Ian;
10420 PL_evalseq = proto_perl->Ievalseq;
10421 PL_origenviron = proto_perl->Iorigenviron; /* XXX not quite right */
10422 PL_origalen = proto_perl->Iorigalen;
10423 #ifdef PERL_USES_PL_PIDSTATUS
10424 PL_pidstatus = newHV(); /* XXX flag for cloning? */
10426 PL_osname = SAVEPV(proto_perl->Iosname);
10427 PL_sighandlerp = proto_perl->Isighandlerp;
10429 PL_runops = proto_perl->Irunops;
10431 Copy(proto_perl->Itokenbuf, PL_tokenbuf, 256, char);
10434 PL_cshlen = proto_perl->Icshlen;
10435 PL_cshname = proto_perl->Icshname; /* XXX never deallocated */
10438 PL_lex_state = proto_perl->Ilex_state;
10439 PL_lex_defer = proto_perl->Ilex_defer;
10440 PL_lex_expect = proto_perl->Ilex_expect;
10441 PL_lex_formbrack = proto_perl->Ilex_formbrack;
10442 PL_lex_dojoin = proto_perl->Ilex_dojoin;
10443 PL_lex_starts = proto_perl->Ilex_starts;
10444 PL_lex_stuff = sv_dup_inc(proto_perl->Ilex_stuff, param);
10445 PL_lex_repl = sv_dup_inc(proto_perl->Ilex_repl, param);
10446 PL_lex_op = proto_perl->Ilex_op;
10447 PL_lex_inpat = proto_perl->Ilex_inpat;
10448 PL_lex_inwhat = proto_perl->Ilex_inwhat;
10449 PL_lex_brackets = proto_perl->Ilex_brackets;
10450 i = (PL_lex_brackets < 120 ? 120 : PL_lex_brackets);
10451 PL_lex_brackstack = SAVEPVN(proto_perl->Ilex_brackstack,i);
10452 PL_lex_casemods = proto_perl->Ilex_casemods;
10453 i = (PL_lex_casemods < 12 ? 12 : PL_lex_casemods);
10454 PL_lex_casestack = SAVEPVN(proto_perl->Ilex_casestack,i);
10456 Copy(proto_perl->Inextval, PL_nextval, 5, YYSTYPE);
10457 Copy(proto_perl->Inexttype, PL_nexttype, 5, I32);
10458 PL_nexttoke = proto_perl->Inexttoke;
10460 /* XXX This is probably masking the deeper issue of why
10461 * SvANY(proto_perl->Ilinestr) can be NULL at this point. For test case:
10462 * http://archive.develooper.com/perl5-porters%40perl.org/msg83298.html
10463 * (A little debugging with a watchpoint on it may help.)
10465 if (SvANY(proto_perl->Ilinestr)) {
10466 PL_linestr = sv_dup_inc(proto_perl->Ilinestr, param);
10467 i = proto_perl->Ibufptr - SvPVX_const(proto_perl->Ilinestr);
10468 PL_bufptr = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
10469 i = proto_perl->Ioldbufptr - SvPVX_const(proto_perl->Ilinestr);
10470 PL_oldbufptr = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
10471 i = proto_perl->Ioldoldbufptr - SvPVX_const(proto_perl->Ilinestr);
10472 PL_oldoldbufptr = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
10473 i = proto_perl->Ilinestart - SvPVX_const(proto_perl->Ilinestr);
10474 PL_linestart = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
10477 PL_linestr = NEWSV(65,79);
10478 sv_upgrade(PL_linestr,SVt_PVIV);
10479 sv_setpvn(PL_linestr,"",0);
10480 PL_bufptr = PL_oldbufptr = PL_oldoldbufptr = PL_linestart = SvPVX(PL_linestr);
10482 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
10483 PL_pending_ident = proto_perl->Ipending_ident;
10484 PL_sublex_info = proto_perl->Isublex_info; /* XXX not quite right */
10486 PL_expect = proto_perl->Iexpect;
10488 PL_multi_start = proto_perl->Imulti_start;
10489 PL_multi_end = proto_perl->Imulti_end;
10490 PL_multi_open = proto_perl->Imulti_open;
10491 PL_multi_close = proto_perl->Imulti_close;
10493 PL_error_count = proto_perl->Ierror_count;
10494 PL_subline = proto_perl->Isubline;
10495 PL_subname = sv_dup_inc(proto_perl->Isubname, param);
10497 /* XXX See comment on SvANY(proto_perl->Ilinestr) above */
10498 if (SvANY(proto_perl->Ilinestr)) {
10499 i = proto_perl->Ilast_uni - SvPVX_const(proto_perl->Ilinestr);
10500 PL_last_uni = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
10501 i = proto_perl->Ilast_lop - SvPVX_const(proto_perl->Ilinestr);
10502 PL_last_lop = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
10503 PL_last_lop_op = proto_perl->Ilast_lop_op;
10506 PL_last_uni = SvPVX(PL_linestr);
10507 PL_last_lop = SvPVX(PL_linestr);
10508 PL_last_lop_op = 0;
10510 PL_in_my = proto_perl->Iin_my;
10511 PL_in_my_stash = hv_dup(proto_perl->Iin_my_stash, param);
10513 PL_cryptseen = proto_perl->Icryptseen;
10516 PL_hints = proto_perl->Ihints;
10518 PL_amagic_generation = proto_perl->Iamagic_generation;
10520 #ifdef USE_LOCALE_COLLATE
10521 PL_collation_ix = proto_perl->Icollation_ix;
10522 PL_collation_name = SAVEPV(proto_perl->Icollation_name);
10523 PL_collation_standard = proto_perl->Icollation_standard;
10524 PL_collxfrm_base = proto_perl->Icollxfrm_base;
10525 PL_collxfrm_mult = proto_perl->Icollxfrm_mult;
10526 #endif /* USE_LOCALE_COLLATE */
10528 #ifdef USE_LOCALE_NUMERIC
10529 PL_numeric_name = SAVEPV(proto_perl->Inumeric_name);
10530 PL_numeric_standard = proto_perl->Inumeric_standard;
10531 PL_numeric_local = proto_perl->Inumeric_local;
10532 PL_numeric_radix_sv = sv_dup_inc(proto_perl->Inumeric_radix_sv, param);
10533 #endif /* !USE_LOCALE_NUMERIC */
10535 /* utf8 character classes */
10536 PL_utf8_alnum = sv_dup_inc(proto_perl->Iutf8_alnum, param);
10537 PL_utf8_alnumc = sv_dup_inc(proto_perl->Iutf8_alnumc, param);
10538 PL_utf8_ascii = sv_dup_inc(proto_perl->Iutf8_ascii, param);
10539 PL_utf8_alpha = sv_dup_inc(proto_perl->Iutf8_alpha, param);
10540 PL_utf8_space = sv_dup_inc(proto_perl->Iutf8_space, param);
10541 PL_utf8_cntrl = sv_dup_inc(proto_perl->Iutf8_cntrl, param);
10542 PL_utf8_graph = sv_dup_inc(proto_perl->Iutf8_graph, param);
10543 PL_utf8_digit = sv_dup_inc(proto_perl->Iutf8_digit, param);
10544 PL_utf8_upper = sv_dup_inc(proto_perl->Iutf8_upper, param);
10545 PL_utf8_lower = sv_dup_inc(proto_perl->Iutf8_lower, param);
10546 PL_utf8_print = sv_dup_inc(proto_perl->Iutf8_print, param);
10547 PL_utf8_punct = sv_dup_inc(proto_perl->Iutf8_punct, param);
10548 PL_utf8_xdigit = sv_dup_inc(proto_perl->Iutf8_xdigit, param);
10549 PL_utf8_mark = sv_dup_inc(proto_perl->Iutf8_mark, param);
10550 PL_utf8_toupper = sv_dup_inc(proto_perl->Iutf8_toupper, param);
10551 PL_utf8_totitle = sv_dup_inc(proto_perl->Iutf8_totitle, param);
10552 PL_utf8_tolower = sv_dup_inc(proto_perl->Iutf8_tolower, param);
10553 PL_utf8_tofold = sv_dup_inc(proto_perl->Iutf8_tofold, param);
10554 PL_utf8_idstart = sv_dup_inc(proto_perl->Iutf8_idstart, param);
10555 PL_utf8_idcont = sv_dup_inc(proto_perl->Iutf8_idcont, param);
10557 /* Did the locale setup indicate UTF-8? */
10558 PL_utf8locale = proto_perl->Iutf8locale;
10559 /* Unicode features (see perlrun/-C) */
10560 PL_unicode = proto_perl->Iunicode;
10562 /* Pre-5.8 signals control */
10563 PL_signals = proto_perl->Isignals;
10565 /* times() ticks per second */
10566 PL_clocktick = proto_perl->Iclocktick;
10568 /* Recursion stopper for PerlIO_find_layer */
10569 PL_in_load_module = proto_perl->Iin_load_module;
10571 /* sort() routine */
10572 PL_sort_RealCmp = proto_perl->Isort_RealCmp;
10574 /* Not really needed/useful since the reenrant_retint is "volatile",
10575 * but do it for consistency's sake. */
10576 PL_reentrant_retint = proto_perl->Ireentrant_retint;
10578 /* Hooks to shared SVs and locks. */
10579 PL_sharehook = proto_perl->Isharehook;
10580 PL_lockhook = proto_perl->Ilockhook;
10581 PL_unlockhook = proto_perl->Iunlockhook;
10582 PL_threadhook = proto_perl->Ithreadhook;
10584 PL_runops_std = proto_perl->Irunops_std;
10585 PL_runops_dbg = proto_perl->Irunops_dbg;
10587 #ifdef THREADS_HAVE_PIDS
10588 PL_ppid = proto_perl->Ippid;
10592 PL_last_swash_hv = Nullhv; /* reinits on demand */
10593 PL_last_swash_klen = 0;
10594 PL_last_swash_key[0]= '\0';
10595 PL_last_swash_tmps = (U8*)NULL;
10596 PL_last_swash_slen = 0;
10598 PL_glob_index = proto_perl->Iglob_index;
10599 PL_srand_called = proto_perl->Isrand_called;
10600 PL_uudmap['M'] = 0; /* reinits on demand */
10601 PL_bitcount = Nullch; /* reinits on demand */
10603 if (proto_perl->Ipsig_pend) {
10604 Newxz(PL_psig_pend, SIG_SIZE, int);
10607 PL_psig_pend = (int*)NULL;
10610 if (proto_perl->Ipsig_ptr) {
10611 Newxz(PL_psig_ptr, SIG_SIZE, SV*);
10612 Newxz(PL_psig_name, SIG_SIZE, SV*);
10613 for (i = 1; i < SIG_SIZE; i++) {
10614 PL_psig_ptr[i] = sv_dup_inc(proto_perl->Ipsig_ptr[i], param);
10615 PL_psig_name[i] = sv_dup_inc(proto_perl->Ipsig_name[i], param);
10619 PL_psig_ptr = (SV**)NULL;
10620 PL_psig_name = (SV**)NULL;
10623 /* thrdvar.h stuff */
10625 if (flags & CLONEf_COPY_STACKS) {
10626 /* next allocation will be PL_tmps_stack[PL_tmps_ix+1] */
10627 PL_tmps_ix = proto_perl->Ttmps_ix;
10628 PL_tmps_max = proto_perl->Ttmps_max;
10629 PL_tmps_floor = proto_perl->Ttmps_floor;
10630 Newxz(PL_tmps_stack, PL_tmps_max, SV*);
10632 while (i <= PL_tmps_ix) {
10633 PL_tmps_stack[i] = sv_dup_inc(proto_perl->Ttmps_stack[i], param);
10637 /* next PUSHMARK() sets *(PL_markstack_ptr+1) */
10638 i = proto_perl->Tmarkstack_max - proto_perl->Tmarkstack;
10639 Newxz(PL_markstack, i, I32);
10640 PL_markstack_max = PL_markstack + (proto_perl->Tmarkstack_max
10641 - proto_perl->Tmarkstack);
10642 PL_markstack_ptr = PL_markstack + (proto_perl->Tmarkstack_ptr
10643 - proto_perl->Tmarkstack);
10644 Copy(proto_perl->Tmarkstack, PL_markstack,
10645 PL_markstack_ptr - PL_markstack + 1, I32);
10647 /* next push_scope()/ENTER sets PL_scopestack[PL_scopestack_ix]
10648 * NOTE: unlike the others! */
10649 PL_scopestack_ix = proto_perl->Tscopestack_ix;
10650 PL_scopestack_max = proto_perl->Tscopestack_max;
10651 Newxz(PL_scopestack, PL_scopestack_max, I32);
10652 Copy(proto_perl->Tscopestack, PL_scopestack, PL_scopestack_ix, I32);
10654 /* NOTE: si_dup() looks at PL_markstack */
10655 PL_curstackinfo = si_dup(proto_perl->Tcurstackinfo, param);
10657 /* PL_curstack = PL_curstackinfo->si_stack; */
10658 PL_curstack = av_dup(proto_perl->Tcurstack, param);
10659 PL_mainstack = av_dup(proto_perl->Tmainstack, param);
10661 /* next PUSHs() etc. set *(PL_stack_sp+1) */
10662 PL_stack_base = AvARRAY(PL_curstack);
10663 PL_stack_sp = PL_stack_base + (proto_perl->Tstack_sp
10664 - proto_perl->Tstack_base);
10665 PL_stack_max = PL_stack_base + AvMAX(PL_curstack);
10667 /* next SSPUSHFOO() sets PL_savestack[PL_savestack_ix]
10668 * NOTE: unlike the others! */
10669 PL_savestack_ix = proto_perl->Tsavestack_ix;
10670 PL_savestack_max = proto_perl->Tsavestack_max;
10671 /*Newxz(PL_savestack, PL_savestack_max, ANY);*/
10672 PL_savestack = ss_dup(proto_perl, param);
10676 ENTER; /* perl_destruct() wants to LEAVE; */
10679 PL_start_env = proto_perl->Tstart_env; /* XXXXXX */
10680 PL_top_env = &PL_start_env;
10682 PL_op = proto_perl->Top;
10685 PL_Xpv = (XPV*)NULL;
10686 PL_na = proto_perl->Tna;
10688 PL_statbuf = proto_perl->Tstatbuf;
10689 PL_statcache = proto_perl->Tstatcache;
10690 PL_statgv = gv_dup(proto_perl->Tstatgv, param);
10691 PL_statname = sv_dup_inc(proto_perl->Tstatname, param);
10693 PL_timesbuf = proto_perl->Ttimesbuf;
10696 PL_tainted = proto_perl->Ttainted;
10697 PL_curpm = proto_perl->Tcurpm; /* XXX No PMOP ref count */
10698 PL_rs = sv_dup_inc(proto_perl->Trs, param);
10699 PL_last_in_gv = gv_dup(proto_perl->Tlast_in_gv, param);
10700 PL_ofs_sv = sv_dup_inc(proto_perl->Tofs_sv, param);
10701 PL_defoutgv = gv_dup_inc(proto_perl->Tdefoutgv, param);
10702 PL_chopset = proto_perl->Tchopset; /* XXX never deallocated */
10703 PL_toptarget = sv_dup_inc(proto_perl->Ttoptarget, param);
10704 PL_bodytarget = sv_dup_inc(proto_perl->Tbodytarget, param);
10705 PL_formtarget = sv_dup(proto_perl->Tformtarget, param);
10707 PL_restartop = proto_perl->Trestartop;
10708 PL_in_eval = proto_perl->Tin_eval;
10709 PL_delaymagic = proto_perl->Tdelaymagic;
10710 PL_dirty = proto_perl->Tdirty;
10711 PL_localizing = proto_perl->Tlocalizing;
10713 PL_errors = sv_dup_inc(proto_perl->Terrors, param);
10714 PL_hv_fetch_ent_mh = Nullhe;
10715 PL_modcount = proto_perl->Tmodcount;
10716 PL_lastgotoprobe = Nullop;
10717 PL_dumpindent = proto_perl->Tdumpindent;
10719 PL_sortcop = (OP*)any_dup(proto_perl->Tsortcop, proto_perl);
10720 PL_sortstash = hv_dup(proto_perl->Tsortstash, param);
10721 PL_firstgv = gv_dup(proto_perl->Tfirstgv, param);
10722 PL_secondgv = gv_dup(proto_perl->Tsecondgv, param);
10723 PL_efloatbuf = Nullch; /* reinits on demand */
10724 PL_efloatsize = 0; /* reinits on demand */
10728 PL_screamfirst = NULL;
10729 PL_screamnext = NULL;
10730 PL_maxscream = -1; /* reinits on demand */
10731 PL_lastscream = Nullsv;
10733 PL_watchaddr = NULL;
10734 PL_watchok = Nullch;
10736 PL_regdummy = proto_perl->Tregdummy;
10737 PL_regprecomp = Nullch;
10740 PL_colorset = 0; /* reinits PL_colors[] */
10741 /*PL_colors[6] = {0,0,0,0,0,0};*/
10742 PL_reginput = Nullch;
10743 PL_regbol = Nullch;
10744 PL_regeol = Nullch;
10745 PL_regstartp = (I32*)NULL;
10746 PL_regendp = (I32*)NULL;
10747 PL_reglastparen = (U32*)NULL;
10748 PL_reglastcloseparen = (U32*)NULL;
10749 PL_regtill = Nullch;
10750 PL_reg_start_tmp = (char**)NULL;
10751 PL_reg_start_tmpl = 0;
10752 PL_regdata = (struct reg_data*)NULL;
10755 PL_reg_eval_set = 0;
10757 PL_regprogram = (regnode*)NULL;
10759 PL_regcc = (CURCUR*)NULL;
10760 PL_reg_call_cc = (struct re_cc_state*)NULL;
10761 PL_reg_re = (regexp*)NULL;
10762 PL_reg_ganch = Nullch;
10763 PL_reg_sv = Nullsv;
10764 PL_reg_match_utf8 = FALSE;
10765 PL_reg_magic = (MAGIC*)NULL;
10767 PL_reg_oldcurpm = (PMOP*)NULL;
10768 PL_reg_curpm = (PMOP*)NULL;
10769 PL_reg_oldsaved = Nullch;
10770 PL_reg_oldsavedlen = 0;
10771 #ifdef PERL_OLD_COPY_ON_WRITE
10774 PL_reg_maxiter = 0;
10775 PL_reg_leftiter = 0;
10776 PL_reg_poscache = Nullch;
10777 PL_reg_poscache_size= 0;
10779 /* RE engine - function pointers */
10780 PL_regcompp = proto_perl->Tregcompp;
10781 PL_regexecp = proto_perl->Tregexecp;
10782 PL_regint_start = proto_perl->Tregint_start;
10783 PL_regint_string = proto_perl->Tregint_string;
10784 PL_regfree = proto_perl->Tregfree;
10786 PL_reginterp_cnt = 0;
10787 PL_reg_starttry = 0;
10789 /* Pluggable optimizer */
10790 PL_peepp = proto_perl->Tpeepp;
10792 PL_stashcache = newHV();
10794 if (!(flags & CLONEf_KEEP_PTR_TABLE)) {
10795 ptr_table_free(PL_ptr_table);
10796 PL_ptr_table = NULL;
10799 /* Call the ->CLONE method, if it exists, for each of the stashes
10800 identified by sv_dup() above.
10802 while(av_len(param->stashes) != -1) {
10803 HV* const stash = (HV*) av_shift(param->stashes);
10804 GV* const cloner = gv_fetchmethod_autoload(stash, "CLONE", 0);
10805 if (cloner && GvCV(cloner)) {
10810 XPUSHs(sv_2mortal(newSVhek(HvNAME_HEK(stash))));
10812 call_sv((SV*)GvCV(cloner), G_DISCARD);
10818 SvREFCNT_dec(param->stashes);
10820 /* orphaned? eg threads->new inside BEGIN or use */
10821 if (PL_compcv && ! SvREFCNT(PL_compcv)) {
10822 (void)SvREFCNT_inc(PL_compcv);
10823 SAVEFREESV(PL_compcv);
10829 #endif /* USE_ITHREADS */
10832 =head1 Unicode Support
10834 =for apidoc sv_recode_to_utf8
10836 The encoding is assumed to be an Encode object, on entry the PV
10837 of the sv is assumed to be octets in that encoding, and the sv
10838 will be converted into Unicode (and UTF-8).
10840 If the sv already is UTF-8 (or if it is not POK), or if the encoding
10841 is not a reference, nothing is done to the sv. If the encoding is not
10842 an C<Encode::XS> Encoding object, bad things will happen.
10843 (See F<lib/encoding.pm> and L<Encode>).
10845 The PV of the sv is returned.
10850 Perl_sv_recode_to_utf8(pTHX_ SV *sv, SV *encoding)
10853 if (SvPOK(sv) && !SvUTF8(sv) && !IN_BYTES && SvROK(encoding)) {
10867 Passing sv_yes is wrong - it needs to be or'ed set of constants
10868 for Encode::XS, while UTf-8 decode (currently) assumes a true value means
10869 remove converted chars from source.
10871 Both will default the value - let them.
10873 XPUSHs(&PL_sv_yes);
10876 call_method("decode", G_SCALAR);
10880 s = SvPV_const(uni, len);
10881 if (s != SvPVX_const(sv)) {
10882 SvGROW(sv, len + 1);
10883 Move(s, SvPVX(sv), len + 1, char);
10884 SvCUR_set(sv, len);
10891 return SvPOKp(sv) ? SvPVX(sv) : NULL;
10895 =for apidoc sv_cat_decode
10897 The encoding is assumed to be an Encode object, the PV of the ssv is
10898 assumed to be octets in that encoding and decoding the input starts
10899 from the position which (PV + *offset) pointed to. The dsv will be
10900 concatenated the decoded UTF-8 string from ssv. Decoding will terminate
10901 when the string tstr appears in decoding output or the input ends on
10902 the PV of the ssv. The value which the offset points will be modified
10903 to the last input position on the ssv.
10905 Returns TRUE if the terminator was found, else returns FALSE.
10910 Perl_sv_cat_decode(pTHX_ SV *dsv, SV *encoding,
10911 SV *ssv, int *offset, char *tstr, int tlen)
10915 if (SvPOK(ssv) && SvPOK(dsv) && SvROK(encoding) && offset) {
10926 XPUSHs(offsv = sv_2mortal(newSViv(*offset)));
10927 XPUSHs(sv_2mortal(newSVpvn(tstr, tlen)));
10929 call_method("cat_decode", G_SCALAR);
10931 ret = SvTRUE(TOPs);
10932 *offset = SvIV(offsv);
10938 Perl_croak(aTHX_ "Invalid argument to sv_cat_decode");
10943 /* ---------------------------------------------------------------------
10945 * support functions for report_uninit()
10948 /* the maxiumum size of array or hash where we will scan looking
10949 * for the undefined element that triggered the warning */
10951 #define FUV_MAX_SEARCH_SIZE 1000
10953 /* Look for an entry in the hash whose value has the same SV as val;
10954 * If so, return a mortal copy of the key. */
10957 S_find_hash_subscript(pTHX_ HV *hv, SV* val)
10960 register HE **array;
10963 if (!hv || SvMAGICAL(hv) || !HvARRAY(hv) ||
10964 (HvTOTALKEYS(hv) > FUV_MAX_SEARCH_SIZE))
10967 array = HvARRAY(hv);
10969 for (i=HvMAX(hv); i>0; i--) {
10970 register HE *entry;
10971 for (entry = array[i]; entry; entry = HeNEXT(entry)) {
10972 if (HeVAL(entry) != val)
10974 if ( HeVAL(entry) == &PL_sv_undef ||
10975 HeVAL(entry) == &PL_sv_placeholder)
10979 if (HeKLEN(entry) == HEf_SVKEY)
10980 return sv_mortalcopy(HeKEY_sv(entry));
10981 return sv_2mortal(newSVpvn(HeKEY(entry), HeKLEN(entry)));
10987 /* Look for an entry in the array whose value has the same SV as val;
10988 * If so, return the index, otherwise return -1. */
10991 S_find_array_subscript(pTHX_ AV *av, SV* val)
10995 if (!av || SvMAGICAL(av) || !AvARRAY(av) ||
10996 (AvFILLp(av) > FUV_MAX_SEARCH_SIZE))
11000 for (i=AvFILLp(av); i>=0; i--) {
11001 if (svp[i] == val && svp[i] != &PL_sv_undef)
11007 /* S_varname(): return the name of a variable, optionally with a subscript.
11008 * If gv is non-zero, use the name of that global, along with gvtype (one
11009 * of "$", "@", "%"); otherwise use the name of the lexical at pad offset
11010 * targ. Depending on the value of the subscript_type flag, return:
11013 #define FUV_SUBSCRIPT_NONE 1 /* "@foo" */
11014 #define FUV_SUBSCRIPT_ARRAY 2 /* "$foo[aindex]" */
11015 #define FUV_SUBSCRIPT_HASH 3 /* "$foo{keyname}" */
11016 #define FUV_SUBSCRIPT_WITHIN 4 /* "within @foo" */
11019 S_varname(pTHX_ GV *gv, const char gvtype, PADOFFSET targ,
11020 SV* keyname, I32 aindex, int subscript_type)
11023 SV * const name = sv_newmortal();
11026 buffer[0] = gvtype;
11029 /* as gv_fullname4(), but add literal '^' for $^FOO names */
11031 gv_fullname4(name, gv, buffer, 0);
11033 if ((unsigned int)SvPVX(name)[1] <= 26) {
11035 buffer[1] = SvPVX(name)[1] + 'A' - 1;
11037 /* Swap the 1 unprintable control character for the 2 byte pretty
11038 version - ie substr($name, 1, 1) = $buffer; */
11039 sv_insert(name, 1, 1, buffer, 2);
11044 CV * const cv = find_runcv(&unused);
11048 if (!cv || !CvPADLIST(cv))
11050 av = (AV*)(*av_fetch(CvPADLIST(cv), 0, FALSE));
11051 sv = *av_fetch(av, targ, FALSE);
11052 /* SvLEN in a pad name is not to be trusted */
11053 sv_setpv(name, SvPV_nolen_const(sv));
11056 if (subscript_type == FUV_SUBSCRIPT_HASH) {
11057 SV * const sv = NEWSV(0,0);
11058 *SvPVX(name) = '$';
11059 Perl_sv_catpvf(aTHX_ name, "{%s}",
11060 pv_display(sv,SvPVX_const(keyname), SvCUR(keyname), 0, 32));
11063 else if (subscript_type == FUV_SUBSCRIPT_ARRAY) {
11064 *SvPVX(name) = '$';
11065 Perl_sv_catpvf(aTHX_ name, "[%"IVdf"]", (IV)aindex);
11067 else if (subscript_type == FUV_SUBSCRIPT_WITHIN)
11068 sv_insert(name, 0, 0, "within ", 7);
11075 =for apidoc find_uninit_var
11077 Find the name of the undefined variable (if any) that caused the operator o
11078 to issue a "Use of uninitialized value" warning.
11079 If match is true, only return a name if it's value matches uninit_sv.
11080 So roughly speaking, if a unary operator (such as OP_COS) generates a
11081 warning, then following the direct child of the op may yield an
11082 OP_PADSV or OP_GV that gives the name of the undefined variable. On the
11083 other hand, with OP_ADD there are two branches to follow, so we only print
11084 the variable name if we get an exact match.
11086 The name is returned as a mortal SV.
11088 Assumes that PL_op is the op that originally triggered the error, and that
11089 PL_comppad/PL_curpad points to the currently executing pad.
11095 S_find_uninit_var(pTHX_ OP* obase, SV* uninit_sv, bool match)
11103 if (!obase || (match && (!uninit_sv || uninit_sv == &PL_sv_undef ||
11104 uninit_sv == &PL_sv_placeholder)))
11107 switch (obase->op_type) {
11114 const bool pad = (obase->op_type == OP_PADAV || obase->op_type == OP_PADHV);
11115 const bool hash = (obase->op_type == OP_PADHV || obase->op_type == OP_RV2HV);
11117 SV *keysv = Nullsv;
11118 int subscript_type = FUV_SUBSCRIPT_WITHIN;
11120 if (pad) { /* @lex, %lex */
11121 sv = PAD_SVl(obase->op_targ);
11125 if (cUNOPx(obase)->op_first->op_type == OP_GV) {
11126 /* @global, %global */
11127 gv = cGVOPx_gv(cUNOPx(obase)->op_first);
11130 sv = hash ? (SV*)GvHV(gv): (SV*)GvAV(gv);
11132 else /* @{expr}, %{expr} */
11133 return find_uninit_var(cUNOPx(obase)->op_first,
11137 /* attempt to find a match within the aggregate */
11139 keysv = S_find_hash_subscript(aTHX_ (HV*)sv, uninit_sv);
11141 subscript_type = FUV_SUBSCRIPT_HASH;
11144 index = S_find_array_subscript(aTHX_ (AV*)sv, uninit_sv);
11146 subscript_type = FUV_SUBSCRIPT_ARRAY;
11149 if (match && subscript_type == FUV_SUBSCRIPT_WITHIN)
11152 return varname(gv, hash ? '%' : '@', obase->op_targ,
11153 keysv, index, subscript_type);
11157 if (match && PAD_SVl(obase->op_targ) != uninit_sv)
11159 return varname(Nullgv, '$', obase->op_targ,
11160 Nullsv, 0, FUV_SUBSCRIPT_NONE);
11163 gv = cGVOPx_gv(obase);
11164 if (!gv || (match && GvSV(gv) != uninit_sv))
11166 return varname(gv, '$', 0, Nullsv, 0, FUV_SUBSCRIPT_NONE);
11169 if (obase->op_flags & OPf_SPECIAL) { /* lexical array */
11172 av = (AV*)PAD_SV(obase->op_targ);
11173 if (!av || SvRMAGICAL(av))
11175 svp = av_fetch(av, (I32)obase->op_private, FALSE);
11176 if (!svp || *svp != uninit_sv)
11179 return varname(Nullgv, '$', obase->op_targ,
11180 Nullsv, (I32)obase->op_private, FUV_SUBSCRIPT_ARRAY);
11183 gv = cGVOPx_gv(obase);
11189 if (!av || SvRMAGICAL(av))
11191 svp = av_fetch(av, (I32)obase->op_private, FALSE);
11192 if (!svp || *svp != uninit_sv)
11195 return varname(gv, '$', 0,
11196 Nullsv, (I32)obase->op_private, FUV_SUBSCRIPT_ARRAY);
11201 o = cUNOPx(obase)->op_first;
11202 if (!o || o->op_type != OP_NULL ||
11203 ! (o->op_targ == OP_AELEM || o->op_targ == OP_HELEM))
11205 return find_uninit_var(cBINOPo->op_last, uninit_sv, match);
11209 if (PL_op == obase)
11210 /* $a[uninit_expr] or $h{uninit_expr} */
11211 return find_uninit_var(cBINOPx(obase)->op_last, uninit_sv, match);
11214 o = cBINOPx(obase)->op_first;
11215 kid = cBINOPx(obase)->op_last;
11217 /* get the av or hv, and optionally the gv */
11219 if (o->op_type == OP_PADAV || o->op_type == OP_PADHV) {
11220 sv = PAD_SV(o->op_targ);
11222 else if ((o->op_type == OP_RV2AV || o->op_type == OP_RV2HV)
11223 && cUNOPo->op_first->op_type == OP_GV)
11225 gv = cGVOPx_gv(cUNOPo->op_first);
11228 sv = o->op_type == OP_RV2HV ? (SV*)GvHV(gv) : (SV*)GvAV(gv);
11233 if (kid && kid->op_type == OP_CONST && SvOK(cSVOPx_sv(kid))) {
11234 /* index is constant */
11238 if (obase->op_type == OP_HELEM) {
11239 HE* he = hv_fetch_ent((HV*)sv, cSVOPx_sv(kid), 0, 0);
11240 if (!he || HeVAL(he) != uninit_sv)
11244 SV * const * const svp = av_fetch((AV*)sv, SvIV(cSVOPx_sv(kid)), FALSE);
11245 if (!svp || *svp != uninit_sv)
11249 if (obase->op_type == OP_HELEM)
11250 return varname(gv, '%', o->op_targ,
11251 cSVOPx_sv(kid), 0, FUV_SUBSCRIPT_HASH);
11253 return varname(gv, '@', o->op_targ, Nullsv,
11254 SvIV(cSVOPx_sv(kid)), FUV_SUBSCRIPT_ARRAY);
11257 /* index is an expression;
11258 * attempt to find a match within the aggregate */
11259 if (obase->op_type == OP_HELEM) {
11260 SV * const keysv = S_find_hash_subscript(aTHX_ (HV*)sv, uninit_sv);
11262 return varname(gv, '%', o->op_targ,
11263 keysv, 0, FUV_SUBSCRIPT_HASH);
11266 const I32 index = S_find_array_subscript(aTHX_ (AV*)sv, uninit_sv);
11268 return varname(gv, '@', o->op_targ,
11269 Nullsv, index, FUV_SUBSCRIPT_ARRAY);
11274 (o->op_type == OP_PADAV || o->op_type == OP_RV2AV)
11276 o->op_targ, Nullsv, 0, FUV_SUBSCRIPT_WITHIN);
11282 /* only examine RHS */
11283 return find_uninit_var(cBINOPx(obase)->op_first, uninit_sv, match);
11286 o = cUNOPx(obase)->op_first;
11287 if (o->op_type == OP_PUSHMARK)
11290 if (!o->op_sibling) {
11291 /* one-arg version of open is highly magical */
11293 if (o->op_type == OP_GV) { /* open FOO; */
11295 if (match && GvSV(gv) != uninit_sv)
11297 return varname(gv, '$', 0,
11298 Nullsv, 0, FUV_SUBSCRIPT_NONE);
11300 /* other possibilities not handled are:
11301 * open $x; or open my $x; should return '${*$x}'
11302 * open expr; should return '$'.expr ideally
11308 /* ops where $_ may be an implicit arg */
11312 if ( !(obase->op_flags & OPf_STACKED)) {
11313 if (uninit_sv == ((obase->op_private & OPpTARGET_MY)
11314 ? PAD_SVl(obase->op_targ)
11317 sv = sv_newmortal();
11318 sv_setpvn(sv, "$_", 2);
11326 /* skip filehandle as it can't produce 'undef' warning */
11327 o = cUNOPx(obase)->op_first;
11328 if ((obase->op_flags & OPf_STACKED) && o->op_type == OP_PUSHMARK)
11329 o = o->op_sibling->op_sibling;
11336 match = 1; /* XS or custom code could trigger random warnings */
11341 if (SvROK(PL_rs) && uninit_sv == SvRV(PL_rs))
11342 return sv_2mortal(newSVpvn("${$/}", 5));
11347 if (!(obase->op_flags & OPf_KIDS))
11349 o = cUNOPx(obase)->op_first;
11355 /* if all except one arg are constant, or have no side-effects,
11356 * or are optimized away, then it's unambiguous */
11358 for (kid=o; kid; kid = kid->op_sibling) {
11360 ( (kid->op_type == OP_CONST && SvOK(cSVOPx_sv(kid)))
11361 || (kid->op_type == OP_NULL && ! (kid->op_flags & OPf_KIDS))
11362 || (kid->op_type == OP_PUSHMARK)
11366 if (o2) { /* more than one found */
11373 return find_uninit_var(o2, uninit_sv, match);
11375 /* scan all args */
11377 sv = find_uninit_var(o, uninit_sv, 1);
11389 =for apidoc report_uninit
11391 Print appropriate "Use of uninitialized variable" warning
11397 Perl_report_uninit(pTHX_ SV* uninit_sv)
11400 SV* varname = Nullsv;
11402 varname = find_uninit_var(PL_op, uninit_sv,0);
11404 sv_insert(varname, 0, 0, " ", 1);
11406 Perl_warner(aTHX_ packWARN(WARN_UNINITIALIZED), PL_warn_uninit,
11407 varname ? SvPV_nolen_const(varname) : "",
11408 " in ", OP_DESC(PL_op));
11411 Perl_warner(aTHX_ packWARN(WARN_UNINITIALIZED), PL_warn_uninit,
11417 * c-indentation-style: bsd
11418 * c-basic-offset: 4
11419 * indent-tabs-mode: t
11422 * ex: set ts=8 sts=4 sw=4 noet: