3 * Copyright (C) 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999,
4 * 2000, 2001, 2002, 2003, 2004, 2005, 2006, 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
62 sv, av, hv...) contains type and reference count information, and for
63 many types, a pointer to the body (struct xrv, xpv, xpviv...), which
64 contains fields specific to each type. Some types store all they need
65 in the head, so don't have a body.
67 In all but the most memory-paranoid configuations (ex: PURIFY), heads
68 and bodies are allocated out of arenas, which by default are
69 approximately 4K chunks of memory parcelled up into N heads or bodies.
70 Sv-bodies are allocated by their sv-type, guaranteeing size
71 consistency needed to allocate safely from arrays.
73 For SV-heads, the first slot in each arena is reserved, and holds a
74 link to the next arena, some flags, and a note of the number of slots.
75 Snaked through each arena chain is a linked list of free items; when
76 this becomes empty, an extra arena is allocated and divided up into N
77 items which are threaded into the free list.
79 SV-bodies are similar, but they use arena-sets by default, which
80 separate the link and info from the arena itself, and reclaim the 1st
81 slot in the arena. SV-bodies are further described later.
83 The following global variables are associated with arenas:
85 PL_sv_arenaroot pointer to list of SV arenas
86 PL_sv_root pointer to list of free SV structures
88 PL_body_arenas head of linked-list of body arenas
89 PL_body_roots[] array of pointers to list of free bodies of svtype
90 arrays are indexed by the svtype needed
92 A few special SV heads are not allocated from an arena, but are
93 instead directly created in the interpreter structure, 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 At the time of very final cleanup, sv_free_arenas() is called from
107 perl_destruct() to physically free all the arenas allocated since the
108 start of the interpreter.
110 Manipulation of any of the PL_*root pointers is protected by enclosing
111 LOCK_SV_MUTEX; ... UNLOCK_SV_MUTEX calls which should Do the Right Thing
112 if threads are enabled.
114 The function visit() scans the SV arenas list, and calls a specified
115 function for each SV it finds which is still live - ie which has an SvTYPE
116 other than all 1's, and a non-zero SvREFCNT. visit() is used by the
117 following functions (specified as [function that calls visit()] / [function
118 called by visit() for each SV]):
120 sv_report_used() / do_report_used()
121 dump all remaining SVs (debugging aid)
123 sv_clean_objs() / do_clean_objs(),do_clean_named_objs()
124 Attempt to free all objects pointed to by RVs,
125 and, unless DISABLE_DESTRUCTOR_KLUDGE is defined,
126 try to do the same for all objects indirectly
127 referenced by typeglobs too. Called once from
128 perl_destruct(), prior to calling sv_clean_all()
131 sv_clean_all() / do_clean_all()
132 SvREFCNT_dec(sv) each remaining SV, possibly
133 triggering an sv_free(). It also sets the
134 SVf_BREAK flag on the SV to indicate that the
135 refcnt has been artificially lowered, and thus
136 stopping sv_free() from giving spurious warnings
137 about SVs which unexpectedly have a refcnt
138 of zero. called repeatedly from perl_destruct()
139 until there are no SVs left.
141 =head2 Arena allocator API Summary
143 Private API to rest of sv.c
147 new_XIV(), del_XIV(),
148 new_XNV(), del_XNV(),
153 sv_report_used(), sv_clean_objs(), sv_clean_all(), sv_free_arenas()
157 ============================================================================ */
160 * "A time to plant, and a time to uproot what was planted..."
164 * nice_chunk and nice_chunk size need to be set
165 * and queried under the protection of sv_mutex
168 Perl_offer_nice_chunk(pTHX_ void *chunk, U32 chunk_size)
174 new_chunk = (void *)(chunk);
175 new_chunk_size = (chunk_size);
176 if (new_chunk_size > PL_nice_chunk_size) {
177 Safefree(PL_nice_chunk);
178 PL_nice_chunk = (char *) new_chunk;
179 PL_nice_chunk_size = new_chunk_size;
186 #ifdef DEBUG_LEAKING_SCALARS
187 # define FREE_SV_DEBUG_FILE(sv) Safefree((sv)->sv_debug_file)
189 # define FREE_SV_DEBUG_FILE(sv)
193 # define SvARENA_CHAIN(sv) ((sv)->sv_u.svu_rv)
194 /* Whilst I'd love to do this, it seems that things like to check on
196 # define POSION_SV_HEAD(sv) Poison(sv, 1, struct STRUCT_SV)
198 # define POSION_SV_HEAD(sv) Poison(&SvANY(sv), 1, void *), \
199 Poison(&SvREFCNT(sv), 1, U32)
201 # define SvARENA_CHAIN(sv) SvANY(sv)
202 # define POSION_SV_HEAD(sv)
205 #define plant_SV(p) \
207 FREE_SV_DEBUG_FILE(p); \
209 SvARENA_CHAIN(p) = (void *)PL_sv_root; \
210 SvFLAGS(p) = SVTYPEMASK; \
215 /* sv_mutex must be held while calling uproot_SV() */
216 #define uproot_SV(p) \
219 PL_sv_root = (SV*)SvARENA_CHAIN(p); \
224 /* make some more SVs by adding another arena */
226 /* sv_mutex must be held while calling more_sv() */
234 sv_add_arena(PL_nice_chunk, PL_nice_chunk_size, 0);
235 PL_nice_chunk = NULL;
236 PL_nice_chunk_size = 0;
239 char *chunk; /* must use New here to match call to */
240 Newx(chunk,PERL_ARENA_SIZE,char); /* Safefree() in sv_free_arenas() */
241 sv_add_arena(chunk, PERL_ARENA_SIZE, 0);
247 /* new_SV(): return a new, empty SV head */
249 #ifdef DEBUG_LEAKING_SCALARS
250 /* provide a real function for a debugger to play with */
260 sv = S_more_sv(aTHX);
265 sv->sv_debug_optype = PL_op ? PL_op->op_type : 0;
266 sv->sv_debug_line = (U16) ((PL_copline == NOLINE) ?
267 (PL_curcop ? CopLINE(PL_curcop) : 0) : PL_copline);
268 sv->sv_debug_inpad = 0;
269 sv->sv_debug_cloned = 0;
270 sv->sv_debug_file = PL_curcop ? savepv(CopFILE(PL_curcop)): NULL;
274 # define new_SV(p) (p)=S_new_SV(aTHX)
283 (p) = S_more_sv(aTHX); \
292 /* del_SV(): return an empty SV head to the free list */
307 S_del_sv(pTHX_ SV *p)
313 for (sva = PL_sv_arenaroot; sva; sva = (SV *) SvANY(sva)) {
314 const SV * const sv = sva + 1;
315 const SV * const svend = &sva[SvREFCNT(sva)];
316 if (p >= sv && p < svend) {
322 if (ckWARN_d(WARN_INTERNAL))
323 Perl_warner(aTHX_ packWARN(WARN_INTERNAL),
324 "Attempt to free non-arena SV: 0x%"UVxf
325 pTHX__FORMAT, PTR2UV(p) pTHX__VALUE);
332 #else /* ! DEBUGGING */
334 #define del_SV(p) plant_SV(p)
336 #endif /* DEBUGGING */
340 =head1 SV Manipulation Functions
342 =for apidoc sv_add_arena
344 Given a chunk of memory, link it to the head of the list of arenas,
345 and split it into a list of free SVs.
351 Perl_sv_add_arena(pTHX_ char *ptr, U32 size, U32 flags)
354 SV* const sva = (SV*)ptr;
358 /* The first SV in an arena isn't an SV. */
359 SvANY(sva) = (void *) PL_sv_arenaroot; /* ptr to next arena */
360 SvREFCNT(sva) = size / sizeof(SV); /* number of SV slots */
361 SvFLAGS(sva) = flags; /* FAKE if not to be freed */
363 PL_sv_arenaroot = sva;
364 PL_sv_root = sva + 1;
366 svend = &sva[SvREFCNT(sva) - 1];
369 SvARENA_CHAIN(sv) = (void *)(SV*)(sv + 1);
373 /* Must always set typemask because it's awlays checked in on cleanup
374 when the arenas are walked looking for objects. */
375 SvFLAGS(sv) = SVTYPEMASK;
378 SvARENA_CHAIN(sv) = 0;
382 SvFLAGS(sv) = SVTYPEMASK;
385 /* visit(): call the named function for each non-free SV in the arenas
386 * whose flags field matches the flags/mask args. */
389 S_visit(pTHX_ SVFUNC_t f, U32 flags, U32 mask)
395 for (sva = PL_sv_arenaroot; sva; sva = (SV*)SvANY(sva)) {
396 register const SV * const svend = &sva[SvREFCNT(sva)];
398 for (sv = sva + 1; sv < svend; ++sv) {
399 if (SvTYPE(sv) != SVTYPEMASK
400 && (sv->sv_flags & mask) == flags
413 /* called by sv_report_used() for each live SV */
416 do_report_used(pTHX_ SV *sv)
418 if (SvTYPE(sv) != SVTYPEMASK) {
419 PerlIO_printf(Perl_debug_log, "****\n");
426 =for apidoc sv_report_used
428 Dump the contents of all SVs not yet freed. (Debugging aid).
434 Perl_sv_report_used(pTHX)
437 visit(do_report_used, 0, 0);
441 /* called by sv_clean_objs() for each live SV */
444 do_clean_objs(pTHX_ SV *ref)
448 SV * const target = SvRV(ref);
449 if (SvOBJECT(target)) {
450 DEBUG_D((PerlIO_printf(Perl_debug_log, "Cleaning object ref:\n "), sv_dump(ref)));
451 if (SvWEAKREF(ref)) {
452 sv_del_backref(target, ref);
458 SvREFCNT_dec(target);
463 /* XXX Might want to check arrays, etc. */
466 /* called by sv_clean_objs() for each live SV */
468 #ifndef DISABLE_DESTRUCTOR_KLUDGE
470 do_clean_named_objs(pTHX_ SV *sv)
473 if (SvTYPE(sv) == SVt_PVGV && GvGP(sv)) {
475 #ifdef PERL_DONT_CREATE_GVSV
478 SvOBJECT(GvSV(sv))) ||
479 (GvAV(sv) && SvOBJECT(GvAV(sv))) ||
480 (GvHV(sv) && SvOBJECT(GvHV(sv))) ||
481 (GvIO(sv) && SvOBJECT(GvIO(sv))) ||
482 (GvCV(sv) && SvOBJECT(GvCV(sv))) )
484 DEBUG_D((PerlIO_printf(Perl_debug_log, "Cleaning named glob object:\n "), sv_dump(sv)));
485 SvFLAGS(sv) |= SVf_BREAK;
493 =for apidoc sv_clean_objs
495 Attempt to destroy all objects not yet freed
501 Perl_sv_clean_objs(pTHX)
504 PL_in_clean_objs = TRUE;
505 visit(do_clean_objs, SVf_ROK, SVf_ROK);
506 #ifndef DISABLE_DESTRUCTOR_KLUDGE
507 /* some barnacles may yet remain, clinging to typeglobs */
508 visit(do_clean_named_objs, SVt_PVGV, SVTYPEMASK);
510 PL_in_clean_objs = FALSE;
513 /* called by sv_clean_all() for each live SV */
516 do_clean_all(pTHX_ SV *sv)
519 DEBUG_D((PerlIO_printf(Perl_debug_log, "Cleaning loops: SV at 0x%"UVxf"\n", PTR2UV(sv)) ));
520 SvFLAGS(sv) |= SVf_BREAK;
521 if (PL_comppad == (AV*)sv) {
529 =for apidoc sv_clean_all
531 Decrement the refcnt of each remaining SV, possibly triggering a
532 cleanup. This function may have to be called multiple times to free
533 SVs which are in complex self-referential hierarchies.
539 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 ARENASETS: a meta-arena implementation which separates arena-info
551 into struct arena_set, which contains an array of struct
552 arena_descs, each holding info for a single arena. By separating
553 the meta-info from the arena, we recover the 1st slot, formerly
554 borrowed for list management. The arena_set is about the size of an
555 arena, avoiding the needless malloc overhead of a naive linked-list
557 The cost is 1 arena-set malloc per ~320 arena-mallocs, + the unused
558 memory in the last arena-set (1/2 on average). In trade, we get
559 back the 1st slot in each arena (ie 1.7% of a CV-arena, less for
560 smaller types). The recovery of the wasted space allows use of
561 small arenas for large, rare body types,
564 char *arena; /* the raw storage, allocated aligned */
565 size_t size; /* its size ~4k typ */
566 int unit_type; /* useful for arena audits */
567 /* info for sv-heads (eventually)
574 /* Get the maximum number of elements in set[] such that struct arena_set
575 will fit within PERL_ARENA_SIZE, which is probabably just under 4K, and
576 therefore likely to be 1 aligned memory page. */
578 #define ARENAS_PER_SET ((PERL_ARENA_SIZE - sizeof(struct arena_set*) \
579 - 2 * sizeof(int)) / sizeof (struct arena_desc))
582 struct arena_set* next;
583 int set_size; /* ie ARENAS_PER_SET */
584 int curr; /* index of next available arena-desc */
585 struct arena_desc set[ARENAS_PER_SET];
591 S_free_arena(pTHX_ void **root) {
593 void ** const next = *(void **)root;
601 =for apidoc sv_free_arenas
603 Deallocate the memory used by all arenas. Note that all the individual SV
604 heads and bodies within the arenas must already have been freed.
609 Perl_sv_free_arenas(pTHX)
616 /* Free arenas here, but be careful about fake ones. (We assume
617 contiguity of the fake ones with the corresponding real ones.) */
619 for (sva = PL_sv_arenaroot; sva; sva = svanext) {
620 svanext = (SV*) SvANY(sva);
621 while (svanext && SvFAKE(svanext))
622 svanext = (SV*) SvANY(svanext);
630 struct arena_set *next, *aroot = (struct arena_set*) PL_body_arenas;
632 for (; aroot; aroot = next) {
633 int max = aroot->curr;
634 for (i=0; i<max; i++) {
635 assert(aroot->set[i].arena);
636 Safefree(aroot->set[i].arena);
643 S_free_arena(aTHX_ (void**) PL_body_arenas);
647 for (i=0; i<PERL_ARENA_ROOTS_SIZE; i++)
648 PL_body_roots[i] = 0;
650 Safefree(PL_nice_chunk);
651 PL_nice_chunk = NULL;
652 PL_nice_chunk_size = 0;
658 Here are mid-level routines that manage the allocation of bodies out
659 of the various arenas. There are 5 kinds of arenas:
661 1. SV-head arenas, which are discussed and handled above
662 2. regular body arenas
663 3. arenas for reduced-size bodies
665 5. pte arenas (thread related)
667 Arena types 2 & 3 are chained by body-type off an array of
668 arena-root pointers, which is indexed by svtype. Some of the
669 larger/less used body types are malloced singly, since a large
670 unused block of them is wasteful. Also, several svtypes dont have
671 bodies; the data fits into the sv-head itself. The arena-root
672 pointer thus has a few unused root-pointers (which may be hijacked
673 later for arena types 4,5)
675 3 differs from 2 as an optimization; some body types have several
676 unused fields in the front of the structure (which are kept in-place
677 for consistency). These bodies can be allocated in smaller chunks,
678 because the leading fields arent accessed. Pointers to such bodies
679 are decremented to point at the unused 'ghost' memory, knowing that
680 the pointers are used with offsets to the real memory.
682 HE, HEK arenas are managed separately, with separate code, but may
683 be merge-able later..
685 PTE arenas are not sv-bodies, but they share these mid-level
686 mechanics, so are considered here. The new mid-level mechanics rely
687 on the sv_type of the body being allocated, so we just reserve one
688 of the unused body-slots for PTEs, then use it in those (2) PTE
689 contexts below (line ~10k)
692 /* get_arena(size): when ARENASETS is enabled, this creates
693 custom-sized arenas, otherwize it uses PERL_ARENA_SIZE, as
695 TBD: export properly for hv.c: S_more_he().
698 Perl_get_arena(pTHX_ int arena_size)
703 /* allocate and attach arena */
704 Newx(arp, arena_size, char);
705 arp->next = PL_body_arenas;
706 PL_body_arenas = arp;
710 struct arena_desc* adesc;
711 struct arena_set *newroot, **aroot = (struct arena_set**) &PL_body_arenas;
714 /* shouldnt need this
715 if (!arena_size) arena_size = PERL_ARENA_SIZE;
718 /* may need new arena-set to hold new arena */
719 if (!*aroot || (*aroot)->curr >= (*aroot)->set_size) {
720 Newxz(newroot, 1, struct arena_set);
721 newroot->set_size = ARENAS_PER_SET;
722 newroot->next = *aroot;
724 DEBUG_m(PerlIO_printf(Perl_debug_log, "new arenaset %p\n", *aroot));
727 /* ok, now have arena-set with at least 1 empty/available arena-desc */
728 curr = (*aroot)->curr++;
729 adesc = &((*aroot)->set[curr]);
730 assert(!adesc->arena);
732 Newxz(adesc->arena, arena_size, char);
733 adesc->size = arena_size;
734 DEBUG_m(PerlIO_printf(Perl_debug_log, "arena %d added: %p size %d\n",
735 curr, adesc->arena, arena_size));
742 /* return a thing to the free list */
744 #define del_body(thing, root) \
746 void ** const thing_copy = (void **)thing;\
748 *thing_copy = *root; \
749 *root = (void*)thing_copy; \
755 =head1 SV-Body Allocation
757 Allocation of SV-bodies is similar to SV-heads, differing as follows;
758 the allocation mechanism is used for many body types, so is somewhat
759 more complicated, it uses arena-sets, and has no need for still-live
762 At the outermost level, (new|del)_X*V macros return bodies of the
763 appropriate type. These macros call either (new|del)_body_type or
764 (new|del)_body_allocated macro pairs, depending on specifics of the
765 type. Most body types use the former pair, the latter pair is used to
766 allocate body types with "ghost fields".
768 "ghost fields" are fields that are unused in certain types, and
769 consequently dont need to actually exist. They are declared because
770 they're part of a "base type", which allows use of functions as
771 methods. The simplest examples are AVs and HVs, 2 aggregate types
772 which don't use the fields which support SCALAR semantics.
774 For these types, the arenas are carved up into *_allocated size
775 chunks, we thus avoid wasted memory for those unaccessed members.
776 When bodies are allocated, we adjust the pointer back in memory by the
777 size of the bit not allocated, so it's as if we allocated the full
778 structure. (But things will all go boom if you write to the part that
779 is "not there", because you'll be overwriting the last members of the
780 preceding structure in memory.)
782 We calculate the correction using the STRUCT_OFFSET macro. For
783 example, if xpv_allocated is the same structure as XPV then the two
784 OFFSETs sum to zero, and the pointer is unchanged. If the allocated
785 structure is smaller (no initial NV actually allocated) then the net
786 effect is to subtract the size of the NV from the pointer, to return a
787 new pointer as if an initial NV were actually allocated.
789 This is the same trick as was used for NV and IV bodies. Ironically it
790 doesn't need to be used for NV bodies any more, because NV is now at
791 the start of the structure. IV bodies don't need it either, because
792 they are no longer allocated.
794 In turn, the new_body_* allocators call S_new_body(), which invokes
795 new_body_inline macro, which takes a lock, and takes a body off the
796 linked list at PL_body_roots[sv_type], calling S_more_bodies() if
797 necessary to refresh an empty list. Then the lock is released, and
798 the body is returned.
800 S_more_bodies calls get_arena(), and carves it up into an array of N
801 bodies, which it strings into a linked list. It looks up arena-size
802 and body-size from the body_details table described below, thus
803 supporting the multiple body-types.
805 If PURIFY is defined, or PERL_ARENA_SIZE=0, arenas are not used, and
806 the (new|del)_X*V macros are mapped directly to malloc/free.
812 For each sv-type, struct body_details bodies_by_type[] carries
813 parameters which control these aspects of SV handling:
815 Arena_size determines whether arenas are used for this body type, and if
816 so, how big they are. PURIFY or PERL_ARENA_SIZE=0 set this field to
817 zero, forcing individual mallocs and frees.
819 Body_size determines how big a body is, and therefore how many fit into
820 each arena. Offset carries the body-pointer adjustment needed for
821 *_allocated body types, and is used in *_allocated macros.
823 But its main purpose is to parameterize info needed in
824 Perl_sv_upgrade(). The info here dramatically simplifies the function
825 vs the implementation in 5.8.7, making it table-driven. All fields
826 are used for this, except for arena_size.
828 For the sv-types that have no bodies, arenas are not used, so those
829 PL_body_roots[sv_type] are unused, and can be overloaded. In
830 something of a special case, SVt_NULL is borrowed for HE arenas;
831 PL_body_roots[SVt_NULL] is filled by S_more_he, but the
832 bodies_by_type[SVt_NULL] slot is not used, as the table is not
835 PTEs also use arenas, but are never seen in Perl_sv_upgrade.
836 Nonetheless, they get their own slot in bodies_by_type[SVt_NULL], so
837 they can just use the same allocation semantics. At first, PTEs were
838 also overloaded to a non-body sv-type, but this yielded hard-to-find
839 malloc bugs, so was simplified by claiming a new slot. This choice
840 has no consequence at this time.
844 struct body_details {
845 U8 body_size; /* Size to allocate */
846 U8 copy; /* Size of structure to copy (may be shorter) */
848 unsigned int type : 4; /* We have space for a sanity check. */
849 unsigned int cant_upgrade : 1; /* Cannot upgrade this type */
850 unsigned int zero_nv : 1; /* zero the NV when upgrading from this */
851 unsigned int arena : 1; /* Allocated from an arena */
852 size_t arena_size; /* Size of arena to allocate */
860 /* With -DPURFIY we allocate everything directly, and don't use arenas.
861 This seems a rather elegant way to simplify some of the code below. */
862 #define HASARENA FALSE
864 #define HASARENA TRUE
866 #define NOARENA FALSE
868 /* Size the arenas to exactly fit a given number of bodies. A count
869 of 0 fits the max number bodies into a PERL_ARENA_SIZE.block,
870 simplifying the default. If count > 0, the arena is sized to fit
871 only that many bodies, allowing arenas to be used for large, rare
872 bodies (XPVFM, XPVIO) without undue waste. The arena size is
873 limited by PERL_ARENA_SIZE, so we can safely oversize the
876 #define FIT_ARENA(count, body_size) \
877 (!count || count * body_size > PERL_ARENA_SIZE) \
878 ? (int)(PERL_ARENA_SIZE / body_size) * body_size : count * body_size
880 /* A macro to work out the offset needed to subtract from a pointer to (say)
887 to make its members accessible via a pointer to (say)
897 #define relative_STRUCT_OFFSET(longer, shorter, member) \
898 (STRUCT_OFFSET(shorter, member) - STRUCT_OFFSET(longer, member))
900 /* Calculate the length to copy. Specifically work out the length less any
901 final padding the compiler needed to add. See the comment in sv_upgrade
902 for why copying the padding proved to be a bug. */
904 #define copy_length(type, last_member) \
905 STRUCT_OFFSET(type, last_member) \
906 + sizeof (((type*)SvANY((SV*)0))->last_member)
908 static const struct body_details bodies_by_type[] = {
909 { sizeof(HE), 0, 0, SVt_NULL,
910 FALSE, NONV, NOARENA, FIT_ARENA(0, sizeof(HE)) },
912 /* IVs are in the head, so the allocation size is 0.
913 However, the slot is overloaded for PTEs. */
914 { sizeof(struct ptr_tbl_ent), /* This is used for PTEs. */
915 sizeof(IV), /* This is used to copy out the IV body. */
916 STRUCT_OFFSET(XPVIV, xiv_iv), SVt_IV, FALSE, NONV,
917 NOARENA /* IVS don't need an arena */,
918 /* But PTEs need to know the size of their arena */
919 FIT_ARENA(0, sizeof(struct ptr_tbl_ent))
922 /* 8 bytes on most ILP32 with IEEE doubles */
923 { sizeof(NV), sizeof(NV), 0, SVt_NV, FALSE, HADNV, HASARENA,
924 FIT_ARENA(0, sizeof(NV)) },
926 /* RVs are in the head now. */
927 { 0, 0, 0, SVt_RV, FALSE, NONV, NOARENA, 0 },
929 /* 8 bytes on most ILP32 with IEEE doubles */
930 { sizeof(xpv_allocated),
931 copy_length(XPV, xpv_len)
932 - relative_STRUCT_OFFSET(xpv_allocated, XPV, xpv_cur),
933 + relative_STRUCT_OFFSET(xpv_allocated, XPV, xpv_cur),
934 SVt_PV, FALSE, NONV, HASARENA, FIT_ARENA(0, sizeof(xpv_allocated)) },
937 { sizeof(xpviv_allocated),
938 copy_length(XPVIV, xiv_u)
939 - relative_STRUCT_OFFSET(xpviv_allocated, XPVIV, xpv_cur),
940 + relative_STRUCT_OFFSET(xpviv_allocated, XPVIV, xpv_cur),
941 SVt_PVIV, FALSE, NONV, HASARENA, FIT_ARENA(0, sizeof(xpviv_allocated)) },
944 { sizeof(XPVNV), copy_length(XPVNV, xiv_u), 0, SVt_PVNV, FALSE, HADNV,
945 HASARENA, FIT_ARENA(0, sizeof(XPVNV)) },
948 { sizeof(XPVMG), copy_length(XPVMG, xmg_stash), 0, SVt_PVMG, FALSE, HADNV,
949 HASARENA, FIT_ARENA(0, sizeof(XPVMG)) },
952 { sizeof(XPVBM), sizeof(XPVBM), 0, SVt_PVBM, TRUE, HADNV,
953 HASARENA, FIT_ARENA(0, sizeof(XPVBM)) },
956 { sizeof(XPVGV), sizeof(XPVGV), 0, SVt_PVGV, TRUE, HADNV,
957 HASARENA, FIT_ARENA(0, sizeof(XPVGV)) },
960 { sizeof(XPVLV), sizeof(XPVLV), 0, SVt_PVLV, TRUE, HADNV,
961 HASARENA, FIT_ARENA(0, sizeof(XPVLV)) },
963 { sizeof(xpvav_allocated),
964 copy_length(XPVAV, xmg_stash)
965 - relative_STRUCT_OFFSET(xpvav_allocated, XPVAV, xav_fill),
966 + relative_STRUCT_OFFSET(xpvav_allocated, XPVAV, xav_fill),
967 SVt_PVAV, TRUE, HADNV, HASARENA, FIT_ARENA(0, sizeof(xpvav_allocated)) },
969 { sizeof(xpvhv_allocated),
970 copy_length(XPVHV, xmg_stash)
971 - relative_STRUCT_OFFSET(xpvhv_allocated, XPVHV, xhv_fill),
972 + relative_STRUCT_OFFSET(xpvhv_allocated, XPVHV, xhv_fill),
973 SVt_PVHV, TRUE, HADNV, HASARENA, FIT_ARENA(0, sizeof(xpvhv_allocated)) },
976 { sizeof(xpvcv_allocated), sizeof(xpvcv_allocated),
977 + relative_STRUCT_OFFSET(xpvcv_allocated, XPVCV, xpv_cur),
978 SVt_PVCV, TRUE, NONV, HASARENA, FIT_ARENA(0, sizeof(xpvcv_allocated)) },
980 { sizeof(xpvfm_allocated), sizeof(xpvfm_allocated),
981 + relative_STRUCT_OFFSET(xpvfm_allocated, XPVFM, xpv_cur),
982 SVt_PVFM, TRUE, NONV, NOARENA, FIT_ARENA(20, sizeof(xpvfm_allocated)) },
984 /* XPVIO is 84 bytes, fits 48x */
985 { sizeof(XPVIO), sizeof(XPVIO), 0, SVt_PVIO, TRUE, HADNV,
986 HASARENA, FIT_ARENA(24, sizeof(XPVIO)) },
989 #define new_body_type(sv_type) \
990 (void *)((char *)S_new_body(aTHX_ sv_type))
992 #define del_body_type(p, sv_type) \
993 del_body(p, &PL_body_roots[sv_type])
996 #define new_body_allocated(sv_type) \
997 (void *)((char *)S_new_body(aTHX_ sv_type) \
998 - bodies_by_type[sv_type].offset)
1000 #define del_body_allocated(p, sv_type) \
1001 del_body(p + bodies_by_type[sv_type].offset, &PL_body_roots[sv_type])
1004 #define my_safemalloc(s) (void*)safemalloc(s)
1005 #define my_safecalloc(s) (void*)safecalloc(s, 1)
1006 #define my_safefree(p) safefree((char*)p)
1010 #define new_XNV() my_safemalloc(sizeof(XPVNV))
1011 #define del_XNV(p) my_safefree(p)
1013 #define new_XPVNV() my_safemalloc(sizeof(XPVNV))
1014 #define del_XPVNV(p) my_safefree(p)
1016 #define new_XPVAV() my_safemalloc(sizeof(XPVAV))
1017 #define del_XPVAV(p) my_safefree(p)
1019 #define new_XPVHV() my_safemalloc(sizeof(XPVHV))
1020 #define del_XPVHV(p) my_safefree(p)
1022 #define new_XPVMG() my_safemalloc(sizeof(XPVMG))
1023 #define del_XPVMG(p) my_safefree(p)
1025 #define new_XPVGV() my_safemalloc(sizeof(XPVGV))
1026 #define del_XPVGV(p) my_safefree(p)
1030 #define new_XNV() new_body_type(SVt_NV)
1031 #define del_XNV(p) del_body_type(p, SVt_NV)
1033 #define new_XPVNV() new_body_type(SVt_PVNV)
1034 #define del_XPVNV(p) del_body_type(p, SVt_PVNV)
1036 #define new_XPVAV() new_body_allocated(SVt_PVAV)
1037 #define del_XPVAV(p) del_body_allocated(p, SVt_PVAV)
1039 #define new_XPVHV() new_body_allocated(SVt_PVHV)
1040 #define del_XPVHV(p) del_body_allocated(p, SVt_PVHV)
1042 #define new_XPVMG() new_body_type(SVt_PVMG)
1043 #define del_XPVMG(p) del_body_type(p, SVt_PVMG)
1045 #define new_XPVGV() new_body_type(SVt_PVGV)
1046 #define del_XPVGV(p) del_body_type(p, SVt_PVGV)
1050 /* no arena for you! */
1052 #define new_NOARENA(details) \
1053 my_safemalloc((details)->body_size + (details)->offset)
1054 #define new_NOARENAZ(details) \
1055 my_safecalloc((details)->body_size + (details)->offset)
1058 static bool done_sanity_check;
1062 S_more_bodies (pTHX_ svtype sv_type)
1065 void ** const root = &PL_body_roots[sv_type];
1066 const struct body_details *bdp = &bodies_by_type[sv_type];
1067 const size_t body_size = bdp->body_size;
1071 assert(bdp->arena_size);
1074 if (!done_sanity_check) {
1077 done_sanity_check = TRUE;
1080 assert (bodies_by_type[i].type == i);
1084 start = (char*) Perl_get_arena(aTHX_ bdp->arena_size);
1086 end = start + bdp->arena_size - body_size;
1089 /* The initial slot is used to link the arenas together, so it isn't to be
1090 linked into the list of ready-to-use bodies. */
1093 /* computed count doesnt reflect the 1st slot reservation */
1094 DEBUG_m(PerlIO_printf(Perl_debug_log,
1095 "arena %p end %p arena-size %d type %d size %d ct %d\n",
1096 start, end, bdp->arena_size, sv_type, body_size,
1097 bdp->arena_size / body_size));
1100 *root = (void *)start;
1102 while (start < end) {
1103 char * const next = start + body_size;
1104 *(void**) start = (void *)next;
1107 *(void **)start = 0;
1112 /* grab a new thing from the free list, allocating more if necessary.
1113 The inline version is used for speed in hot routines, and the
1114 function using it serves the rest (unless PURIFY).
1116 #define new_body_inline(xpv, sv_type) \
1118 void ** const r3wt = &PL_body_roots[sv_type]; \
1120 xpv = *((void **)(r3wt)) \
1121 ? *((void **)(r3wt)) : S_more_bodies(aTHX_ sv_type); \
1122 *(r3wt) = *(void**)(xpv); \
1129 S_new_body(pTHX_ svtype sv_type)
1133 new_body_inline(xpv, sv_type);
1140 =for apidoc sv_upgrade
1142 Upgrade an SV to a more complex form. Generally adds a new body type to the
1143 SV, then copies across as much information as possible from the old body.
1144 You generally want to use the C<SvUPGRADE> macro wrapper. See also C<svtype>.
1150 Perl_sv_upgrade(pTHX_ register SV *sv, U32 new_type)
1155 const U32 old_type = SvTYPE(sv);
1156 const struct body_details *new_type_details;
1157 const struct body_details *const old_type_details
1158 = bodies_by_type + old_type;
1160 if (new_type != SVt_PV && SvIsCOW(sv)) {
1161 sv_force_normal_flags(sv, 0);
1164 if (old_type == new_type)
1167 if (old_type > new_type)
1168 Perl_croak(aTHX_ "sv_upgrade from type %d down to type %d",
1169 (int)old_type, (int)new_type);
1172 old_body = SvANY(sv);
1174 /* Copying structures onto other structures that have been neatly zeroed
1175 has a subtle gotcha. Consider XPVMG
1177 +------+------+------+------+------+-------+-------+
1178 | NV | CUR | LEN | IV | MAGIC | STASH |
1179 +------+------+------+------+------+-------+-------+
1180 0 4 8 12 16 20 24 28
1182 where NVs are aligned to 8 bytes, so that sizeof that structure is
1183 actually 32 bytes long, with 4 bytes of padding at the end:
1185 +------+------+------+------+------+-------+-------+------+
1186 | NV | CUR | LEN | IV | MAGIC | STASH | ??? |
1187 +------+------+------+------+------+-------+-------+------+
1188 0 4 8 12 16 20 24 28 32
1190 so what happens if you allocate memory for this structure:
1192 +------+------+------+------+------+-------+-------+------+------+...
1193 | NV | CUR | LEN | IV | MAGIC | STASH | GP | NAME |
1194 +------+------+------+------+------+-------+-------+------+------+...
1195 0 4 8 12 16 20 24 28 32 36
1197 zero it, then copy sizeof(XPVMG) bytes on top of it? Not quite what you
1198 expect, because you copy the area marked ??? onto GP. Now, ??? may have
1199 started out as zero once, but it's quite possible that it isn't. So now,
1200 rather than a nicely zeroed GP, you have it pointing somewhere random.
1203 (In fact, GP ends up pointing at a previous GP structure, because the
1204 principle cause of the padding in XPVMG getting garbage is a copy of
1205 sizeof(XPVMG) bytes from a XPVGV structure in sv_unglob)
1207 So we are careful and work out the size of used parts of all the
1214 if (new_type < SVt_PVIV) {
1215 new_type = (new_type == SVt_NV)
1216 ? SVt_PVNV : SVt_PVIV;
1220 if (new_type < SVt_PVNV) {
1221 new_type = SVt_PVNV;
1227 assert(new_type > SVt_PV);
1228 assert(SVt_IV < SVt_PV);
1229 assert(SVt_NV < SVt_PV);
1236 /* Because the XPVMG of PL_mess_sv isn't allocated from the arena,
1237 there's no way that it can be safely upgraded, because perl.c
1238 expects to Safefree(SvANY(PL_mess_sv)) */
1239 assert(sv != PL_mess_sv);
1240 /* This flag bit is used to mean other things in other scalar types.
1241 Given that it only has meaning inside the pad, it shouldn't be set
1242 on anything that can get upgraded. */
1243 assert((SvFLAGS(sv) & SVpad_TYPED) == 0);
1246 if (old_type_details->cant_upgrade)
1247 Perl_croak(aTHX_ "Can't upgrade %s (%" UVuf ") to %" UVuf,
1248 sv_reftype(sv, 0), (UV) old_type, (UV) new_type);
1250 new_type_details = bodies_by_type + new_type;
1252 SvFLAGS(sv) &= ~SVTYPEMASK;
1253 SvFLAGS(sv) |= new_type;
1255 /* This can't happen, as SVt_NULL is <= all values of new_type, so one of
1256 the return statements above will have triggered. */
1257 assert (new_type != SVt_NULL);
1260 assert(old_type == SVt_NULL);
1261 SvANY(sv) = (XPVIV*)((char*)&(sv->sv_u.svu_iv) - STRUCT_OFFSET(XPVIV, xiv_iv));
1265 assert(old_type == SVt_NULL);
1266 SvANY(sv) = new_XNV();
1270 assert(old_type == SVt_NULL);
1271 SvANY(sv) = &sv->sv_u.svu_rv;
1276 assert(new_type_details->body_size);
1279 assert(new_type_details->arena);
1280 assert(new_type_details->arena_size);
1281 /* This points to the start of the allocated area. */
1282 new_body_inline(new_body, new_type);
1283 Zero(new_body, new_type_details->body_size, char);
1284 new_body = ((char *)new_body) - new_type_details->offset;
1286 /* We always allocated the full length item with PURIFY. To do this
1287 we fake things so that arena is false for all 16 types.. */
1288 new_body = new_NOARENAZ(new_type_details);
1290 SvANY(sv) = new_body;
1291 if (new_type == SVt_PVAV) {
1297 /* SVt_NULL isn't the only thing upgraded to AV or HV.
1298 The target created by newSVrv also is, and it can have magic.
1299 However, it never has SvPVX set.
1301 if (old_type >= SVt_RV) {
1302 assert(SvPVX_const(sv) == 0);
1305 /* Could put this in the else clause below, as PVMG must have SvPVX
1306 0 already (the assertion above) */
1309 if (old_type >= SVt_PVMG) {
1310 SvMAGIC_set(sv, ((XPVMG*)old_body)->xmg_magic);
1311 SvSTASH_set(sv, ((XPVMG*)old_body)->xmg_stash);
1317 /* XXX Is this still needed? Was it ever needed? Surely as there is
1318 no route from NV to PVIV, NOK can never be true */
1319 assert(!SvNOKp(sv));
1331 assert(new_type_details->body_size);
1332 /* We always allocated the full length item with PURIFY. To do this
1333 we fake things so that arena is false for all 16 types.. */
1334 if(new_type_details->arena) {
1335 /* This points to the start of the allocated area. */
1336 new_body_inline(new_body, new_type);
1337 Zero(new_body, new_type_details->body_size, char);
1338 new_body = ((char *)new_body) - new_type_details->offset;
1340 new_body = new_NOARENAZ(new_type_details);
1342 SvANY(sv) = new_body;
1344 if (old_type_details->copy) {
1345 Copy((char *)old_body + old_type_details->offset,
1346 (char *)new_body + old_type_details->offset,
1347 old_type_details->copy, char);
1350 #ifndef NV_ZERO_IS_ALLBITS_ZERO
1351 /* If NV 0.0 is stores as all bits 0 then Zero() already creates a
1352 * correct 0.0 for us. Otherwise, if the old body didn't have an
1353 * NV slot, but the new one does, then we need to initialise the
1354 * freshly created NV slot with whatever the correct bit pattern is
1356 if (old_type_details->zero_nv && !new_type_details->zero_nv)
1360 if (new_type == SVt_PVIO)
1361 IoPAGE_LEN(sv) = 60;
1362 if (old_type < SVt_RV)
1366 Perl_croak(aTHX_ "panic: sv_upgrade to unknown type %lu",
1367 (unsigned long)new_type);
1370 if (old_type_details->arena) {
1371 /* If there was an old body, then we need to free it.
1372 Note that there is an assumption that all bodies of types that
1373 can be upgraded came from arenas. Only the more complex non-
1374 upgradable types are allowed to be directly malloc()ed. */
1376 my_safefree(old_body);
1378 del_body((void*)((char*)old_body + old_type_details->offset),
1379 &PL_body_roots[old_type]);
1385 =for apidoc sv_backoff
1387 Remove any string offset. You should normally use the C<SvOOK_off> macro
1394 Perl_sv_backoff(pTHX_ register SV *sv)
1397 assert(SvTYPE(sv) != SVt_PVHV);
1398 assert(SvTYPE(sv) != SVt_PVAV);
1400 const char * const s = SvPVX_const(sv);
1401 SvLEN_set(sv, SvLEN(sv) + SvIVX(sv));
1402 SvPV_set(sv, SvPVX(sv) - SvIVX(sv));
1404 Move(s, SvPVX(sv), SvCUR(sv)+1, char);
1406 SvFLAGS(sv) &= ~SVf_OOK;
1413 Expands the character buffer in the SV. If necessary, uses C<sv_unref> and
1414 upgrades the SV to C<SVt_PV>. Returns a pointer to the character buffer.
1415 Use the C<SvGROW> wrapper instead.
1421 Perl_sv_grow(pTHX_ register SV *sv, register STRLEN newlen)
1425 #ifdef HAS_64K_LIMIT
1426 if (newlen >= 0x10000) {
1427 PerlIO_printf(Perl_debug_log,
1428 "Allocation too large: %"UVxf"\n", (UV)newlen);
1431 #endif /* HAS_64K_LIMIT */
1434 if (SvTYPE(sv) < SVt_PV) {
1435 sv_upgrade(sv, SVt_PV);
1436 s = SvPVX_mutable(sv);
1438 else if (SvOOK(sv)) { /* pv is offset? */
1440 s = SvPVX_mutable(sv);
1441 if (newlen > SvLEN(sv))
1442 newlen += 10 * (newlen - SvCUR(sv)); /* avoid copy each time */
1443 #ifdef HAS_64K_LIMIT
1444 if (newlen >= 0x10000)
1449 s = SvPVX_mutable(sv);
1451 if (newlen > SvLEN(sv)) { /* need more room? */
1452 newlen = PERL_STRLEN_ROUNDUP(newlen);
1453 if (SvLEN(sv) && s) {
1455 const STRLEN l = malloced_size((void*)SvPVX_const(sv));
1461 s = saferealloc(s, newlen);
1464 s = safemalloc(newlen);
1465 if (SvPVX_const(sv) && SvCUR(sv)) {
1466 Move(SvPVX_const(sv), s, (newlen < SvCUR(sv)) ? newlen : SvCUR(sv), char);
1470 SvLEN_set(sv, newlen);
1476 =for apidoc sv_setiv
1478 Copies an integer into the given SV, upgrading first if necessary.
1479 Does not handle 'set' magic. See also C<sv_setiv_mg>.
1485 Perl_sv_setiv(pTHX_ register SV *sv, IV i)
1488 SV_CHECK_THINKFIRST_COW_DROP(sv);
1489 switch (SvTYPE(sv)) {
1491 sv_upgrade(sv, SVt_IV);
1494 sv_upgrade(sv, SVt_PVNV);
1498 sv_upgrade(sv, SVt_PVIV);
1507 Perl_croak(aTHX_ "Can't coerce %s to integer in %s", sv_reftype(sv,0),
1510 (void)SvIOK_only(sv); /* validate number */
1516 =for apidoc sv_setiv_mg
1518 Like C<sv_setiv>, but also handles 'set' magic.
1524 Perl_sv_setiv_mg(pTHX_ register SV *sv, IV i)
1531 =for apidoc sv_setuv
1533 Copies an unsigned integer into the given SV, upgrading first if necessary.
1534 Does not handle 'set' magic. See also C<sv_setuv_mg>.
1540 Perl_sv_setuv(pTHX_ register SV *sv, UV u)
1542 /* With these two if statements:
1543 u=1.49 s=0.52 cu=72.49 cs=10.64 scripts=270 tests=20865
1546 u=1.35 s=0.47 cu=73.45 cs=11.43 scripts=270 tests=20865
1548 If you wish to remove them, please benchmark to see what the effect is
1550 if (u <= (UV)IV_MAX) {
1551 sv_setiv(sv, (IV)u);
1560 =for apidoc sv_setuv_mg
1562 Like C<sv_setuv>, but also handles 'set' magic.
1568 Perl_sv_setuv_mg(pTHX_ register SV *sv, UV u)
1577 =for apidoc sv_setnv
1579 Copies a double into the given SV, upgrading first if necessary.
1580 Does not handle 'set' magic. See also C<sv_setnv_mg>.
1586 Perl_sv_setnv(pTHX_ register SV *sv, NV num)
1589 SV_CHECK_THINKFIRST_COW_DROP(sv);
1590 switch (SvTYPE(sv)) {
1593 sv_upgrade(sv, SVt_NV);
1598 sv_upgrade(sv, SVt_PVNV);
1607 Perl_croak(aTHX_ "Can't coerce %s to number in %s", sv_reftype(sv,0),
1611 (void)SvNOK_only(sv); /* validate number */
1616 =for apidoc sv_setnv_mg
1618 Like C<sv_setnv>, but also handles 'set' magic.
1624 Perl_sv_setnv_mg(pTHX_ register SV *sv, NV num)
1630 /* Print an "isn't numeric" warning, using a cleaned-up,
1631 * printable version of the offending string
1635 S_not_a_number(pTHX_ SV *sv)
1643 dsv = sv_2mortal(newSVpvs(""));
1644 pv = sv_uni_display(dsv, sv, 10, 0);
1647 const char * const limit = tmpbuf + sizeof(tmpbuf) - 8;
1648 /* each *s can expand to 4 chars + "...\0",
1649 i.e. need room for 8 chars */
1651 const char *s = SvPVX_const(sv);
1652 const char * const end = s + SvCUR(sv);
1653 for ( ; s < end && d < limit; s++ ) {
1655 if (ch & 128 && !isPRINT_LC(ch)) {
1664 else if (ch == '\r') {
1668 else if (ch == '\f') {
1672 else if (ch == '\\') {
1676 else if (ch == '\0') {
1680 else if (isPRINT_LC(ch))
1697 Perl_warner(aTHX_ packWARN(WARN_NUMERIC),
1698 "Argument \"%s\" isn't numeric in %s", pv,
1701 Perl_warner(aTHX_ packWARN(WARN_NUMERIC),
1702 "Argument \"%s\" isn't numeric", pv);
1706 =for apidoc looks_like_number
1708 Test if the content of an SV looks like a number (or is a number).
1709 C<Inf> and C<Infinity> are treated as numbers (so will not issue a
1710 non-numeric warning), even if your atof() doesn't grok them.
1716 Perl_looks_like_number(pTHX_ SV *sv)
1718 register const char *sbegin;
1722 sbegin = SvPVX_const(sv);
1725 else if (SvPOKp(sv))
1726 sbegin = SvPV_const(sv, len);
1728 return SvFLAGS(sv) & (SVf_NOK|SVp_NOK|SVf_IOK|SVp_IOK);
1729 return grok_number(sbegin, len, NULL);
1733 S_glob_2inpuv(pTHX_ GV *gv, STRLEN *len, bool want_number)
1735 const U32 wasfake = SvFLAGS(gv) & SVf_FAKE;
1736 SV *const buffer = sv_newmortal();
1738 /* FAKE globs can get coerced, so need to turn this off temporarily if it
1741 gv_efullname3(buffer, gv, "*");
1742 SvFLAGS(gv) |= wasfake;
1745 /* We know that all GVs stringify to something that is not-a-number,
1746 so no need to test that. */
1747 if (ckWARN(WARN_NUMERIC))
1748 not_a_number(buffer);
1749 /* We just want something true to return, so that S_sv_2iuv_common
1750 can tail call us and return true. */
1753 return SvPV(buffer, *len);
1757 /* Actually, ISO C leaves conversion of UV to IV undefined, but
1758 until proven guilty, assume that things are not that bad... */
1763 As 64 bit platforms often have an NV that doesn't preserve all bits of
1764 an IV (an assumption perl has been based on to date) it becomes necessary
1765 to remove the assumption that the NV always carries enough precision to
1766 recreate the IV whenever needed, and that the NV is the canonical form.
1767 Instead, IV/UV and NV need to be given equal rights. So as to not lose
1768 precision as a side effect of conversion (which would lead to insanity
1769 and the dragon(s) in t/op/numconvert.t getting very angry) the intent is
1770 1) to distinguish between IV/UV/NV slots that have cached a valid
1771 conversion where precision was lost and IV/UV/NV slots that have a
1772 valid conversion which has lost no precision
1773 2) to ensure that if a numeric conversion to one form is requested that
1774 would lose precision, the precise conversion (or differently
1775 imprecise conversion) is also performed and cached, to prevent
1776 requests for different numeric formats on the same SV causing
1777 lossy conversion chains. (lossless conversion chains are perfectly
1782 SvIOKp is true if the IV slot contains a valid value
1783 SvIOK is true only if the IV value is accurate (UV if SvIOK_UV true)
1784 SvNOKp is true if the NV slot contains a valid value
1785 SvNOK is true only if the NV value is accurate
1788 while converting from PV to NV, check to see if converting that NV to an
1789 IV(or UV) would lose accuracy over a direct conversion from PV to
1790 IV(or UV). If it would, cache both conversions, return NV, but mark
1791 SV as IOK NOKp (ie not NOK).
1793 While converting from PV to IV, check to see if converting that IV to an
1794 NV would lose accuracy over a direct conversion from PV to NV. If it
1795 would, cache both conversions, flag similarly.
1797 Before, the SV value "3.2" could become NV=3.2 IV=3 NOK, IOK quite
1798 correctly because if IV & NV were set NV *always* overruled.
1799 Now, "3.2" will become NV=3.2 IV=3 NOK, IOKp, because the flag's meaning
1800 changes - now IV and NV together means that the two are interchangeable:
1801 SvIVX == (IV) SvNVX && SvNVX == (NV) SvIVX;
1803 The benefit of this is that operations such as pp_add know that if
1804 SvIOK is true for both left and right operands, then integer addition
1805 can be used instead of floating point (for cases where the result won't
1806 overflow). Before, floating point was always used, which could lead to
1807 loss of precision compared with integer addition.
1809 * making IV and NV equal status should make maths accurate on 64 bit
1811 * may speed up maths somewhat if pp_add and friends start to use
1812 integers when possible instead of fp. (Hopefully the overhead in
1813 looking for SvIOK and checking for overflow will not outweigh the
1814 fp to integer speedup)
1815 * will slow down integer operations (callers of SvIV) on "inaccurate"
1816 values, as the change from SvIOK to SvIOKp will cause a call into
1817 sv_2iv each time rather than a macro access direct to the IV slot
1818 * should speed up number->string conversion on integers as IV is
1819 favoured when IV and NV are equally accurate
1821 ####################################################################
1822 You had better be using SvIOK_notUV if you want an IV for arithmetic:
1823 SvIOK is true if (IV or UV), so you might be getting (IV)SvUV.
1824 On the other hand, SvUOK is true iff UV.
1825 ####################################################################
1827 Your mileage will vary depending your CPU's relative fp to integer
1831 #ifndef NV_PRESERVES_UV
1832 # define IS_NUMBER_UNDERFLOW_IV 1
1833 # define IS_NUMBER_UNDERFLOW_UV 2
1834 # define IS_NUMBER_IV_AND_UV 2
1835 # define IS_NUMBER_OVERFLOW_IV 4
1836 # define IS_NUMBER_OVERFLOW_UV 5
1838 /* sv_2iuv_non_preserve(): private routine for use by sv_2iv() and sv_2uv() */
1840 /* For sv_2nv these three cases are "SvNOK and don't bother casting" */
1842 S_sv_2iuv_non_preserve(pTHX_ register SV *sv, I32 numtype)
1845 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));
1846 if (SvNVX(sv) < (NV)IV_MIN) {
1847 (void)SvIOKp_on(sv);
1849 SvIV_set(sv, IV_MIN);
1850 return IS_NUMBER_UNDERFLOW_IV;
1852 if (SvNVX(sv) > (NV)UV_MAX) {
1853 (void)SvIOKp_on(sv);
1856 SvUV_set(sv, UV_MAX);
1857 return IS_NUMBER_OVERFLOW_UV;
1859 (void)SvIOKp_on(sv);
1861 /* Can't use strtol etc to convert this string. (See truth table in
1863 if (SvNVX(sv) <= (UV)IV_MAX) {
1864 SvIV_set(sv, I_V(SvNVX(sv)));
1865 if ((NV)(SvIVX(sv)) == SvNVX(sv)) {
1866 SvIOK_on(sv); /* Integer is precise. NOK, IOK */
1868 /* Integer is imprecise. NOK, IOKp */
1870 return SvNVX(sv) < 0 ? IS_NUMBER_UNDERFLOW_UV : IS_NUMBER_IV_AND_UV;
1873 SvUV_set(sv, U_V(SvNVX(sv)));
1874 if ((NV)(SvUVX(sv)) == SvNVX(sv)) {
1875 if (SvUVX(sv) == UV_MAX) {
1876 /* As we know that NVs don't preserve UVs, UV_MAX cannot
1877 possibly be preserved by NV. Hence, it must be overflow.
1879 return IS_NUMBER_OVERFLOW_UV;
1881 SvIOK_on(sv); /* Integer is precise. NOK, UOK */
1883 /* Integer is imprecise. NOK, IOKp */
1885 return IS_NUMBER_OVERFLOW_IV;
1887 #endif /* !NV_PRESERVES_UV*/
1890 S_sv_2iuv_common(pTHX_ SV *sv) {
1893 /* erm. not sure. *should* never get NOKp (without NOK) from sv_2nv
1894 * without also getting a cached IV/UV from it at the same time
1895 * (ie PV->NV conversion should detect loss of accuracy and cache
1896 * IV or UV at same time to avoid this. */
1897 /* IV-over-UV optimisation - choose to cache IV if possible */
1899 if (SvTYPE(sv) == SVt_NV)
1900 sv_upgrade(sv, SVt_PVNV);
1902 (void)SvIOKp_on(sv); /* Must do this first, to clear any SvOOK */
1903 /* < not <= as for NV doesn't preserve UV, ((NV)IV_MAX+1) will almost
1904 certainly cast into the IV range at IV_MAX, whereas the correct
1905 answer is the UV IV_MAX +1. Hence < ensures that dodgy boundary
1907 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
1908 SvIV_set(sv, I_V(SvNVX(sv)));
1909 if (SvNVX(sv) == (NV) SvIVX(sv)
1910 #ifndef NV_PRESERVES_UV
1911 && (((UV)1 << NV_PRESERVES_UV_BITS) >
1912 (UV)(SvIVX(sv) > 0 ? SvIVX(sv) : -SvIVX(sv)))
1913 /* Don't flag it as "accurately an integer" if the number
1914 came from a (by definition imprecise) NV operation, and
1915 we're outside the range of NV integer precision */
1918 SvIOK_on(sv); /* Can this go wrong with rounding? NWC */
1919 DEBUG_c(PerlIO_printf(Perl_debug_log,
1920 "0x%"UVxf" iv(%"NVgf" => %"IVdf") (precise)\n",
1926 /* IV not precise. No need to convert from PV, as NV
1927 conversion would already have cached IV if it detected
1928 that PV->IV would be better than PV->NV->IV
1929 flags already correct - don't set public IOK. */
1930 DEBUG_c(PerlIO_printf(Perl_debug_log,
1931 "0x%"UVxf" iv(%"NVgf" => %"IVdf") (imprecise)\n",
1936 /* Can the above go wrong if SvIVX == IV_MIN and SvNVX < IV_MIN,
1937 but the cast (NV)IV_MIN rounds to a the value less (more
1938 negative) than IV_MIN which happens to be equal to SvNVX ??
1939 Analogous to 0xFFFFFFFFFFFFFFFF rounding up to NV (2**64) and
1940 NV rounding back to 0xFFFFFFFFFFFFFFFF, so UVX == UV(NVX) and
1941 (NV)UVX == NVX are both true, but the values differ. :-(
1942 Hopefully for 2s complement IV_MIN is something like
1943 0x8000000000000000 which will be exact. NWC */
1946 SvUV_set(sv, U_V(SvNVX(sv)));
1948 (SvNVX(sv) == (NV) SvUVX(sv))
1949 #ifndef NV_PRESERVES_UV
1950 /* Make sure it's not 0xFFFFFFFFFFFFFFFF */
1951 /*&& (SvUVX(sv) != UV_MAX) irrelevant with code below */
1952 && (((UV)1 << NV_PRESERVES_UV_BITS) > SvUVX(sv))
1953 /* Don't flag it as "accurately an integer" if the number
1954 came from a (by definition imprecise) NV operation, and
1955 we're outside the range of NV integer precision */
1960 DEBUG_c(PerlIO_printf(Perl_debug_log,
1961 "0x%"UVxf" 2iv(%"UVuf" => %"IVdf") (as unsigned)\n",
1967 else if (SvPOKp(sv) && SvLEN(sv)) {
1969 const int numtype = grok_number(SvPVX_const(sv), SvCUR(sv), &value);
1970 /* We want to avoid a possible problem when we cache an IV/ a UV which
1971 may be later translated to an NV, and the resulting NV is not
1972 the same as the direct translation of the initial string
1973 (eg 123.456 can shortcut to the IV 123 with atol(), but we must
1974 be careful to ensure that the value with the .456 is around if the
1975 NV value is requested in the future).
1977 This means that if we cache such an IV/a UV, we need to cache the
1978 NV as well. Moreover, we trade speed for space, and do not
1979 cache the NV if we are sure it's not needed.
1982 /* SVt_PVNV is one higher than SVt_PVIV, hence this order */
1983 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
1984 == IS_NUMBER_IN_UV) {
1985 /* It's definitely an integer, only upgrade to PVIV */
1986 if (SvTYPE(sv) < SVt_PVIV)
1987 sv_upgrade(sv, SVt_PVIV);
1989 } else if (SvTYPE(sv) < SVt_PVNV)
1990 sv_upgrade(sv, SVt_PVNV);
1992 /* If NVs preserve UVs then we only use the UV value if we know that
1993 we aren't going to call atof() below. If NVs don't preserve UVs
1994 then the value returned may have more precision than atof() will
1995 return, even though value isn't perfectly accurate. */
1996 if ((numtype & (IS_NUMBER_IN_UV
1997 #ifdef NV_PRESERVES_UV
2000 )) == IS_NUMBER_IN_UV) {
2001 /* This won't turn off the public IOK flag if it was set above */
2002 (void)SvIOKp_on(sv);
2004 if (!(numtype & IS_NUMBER_NEG)) {
2006 if (value <= (UV)IV_MAX) {
2007 SvIV_set(sv, (IV)value);
2009 /* it didn't overflow, and it was positive. */
2010 SvUV_set(sv, value);
2014 /* 2s complement assumption */
2015 if (value <= (UV)IV_MIN) {
2016 SvIV_set(sv, -(IV)value);
2018 /* Too negative for an IV. This is a double upgrade, but
2019 I'm assuming it will be rare. */
2020 if (SvTYPE(sv) < SVt_PVNV)
2021 sv_upgrade(sv, SVt_PVNV);
2025 SvNV_set(sv, -(NV)value);
2026 SvIV_set(sv, IV_MIN);
2030 /* For !NV_PRESERVES_UV and IS_NUMBER_IN_UV and IS_NUMBER_NOT_INT we
2031 will be in the previous block to set the IV slot, and the next
2032 block to set the NV slot. So no else here. */
2034 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2035 != IS_NUMBER_IN_UV) {
2036 /* It wasn't an (integer that doesn't overflow the UV). */
2037 SvNV_set(sv, Atof(SvPVX_const(sv)));
2039 if (! numtype && ckWARN(WARN_NUMERIC))
2042 #if defined(USE_LONG_DOUBLE)
2043 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2iv(%" PERL_PRIgldbl ")\n",
2044 PTR2UV(sv), SvNVX(sv)));
2046 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2iv(%"NVgf")\n",
2047 PTR2UV(sv), SvNVX(sv)));
2050 #ifdef NV_PRESERVES_UV
2051 (void)SvIOKp_on(sv);
2053 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2054 SvIV_set(sv, I_V(SvNVX(sv)));
2055 if ((NV)(SvIVX(sv)) == SvNVX(sv)) {
2058 /*EMPTY*/; /* Integer is imprecise. NOK, IOKp */
2060 /* UV will not work better than IV */
2062 if (SvNVX(sv) > (NV)UV_MAX) {
2064 /* Integer is inaccurate. NOK, IOKp, is UV */
2065 SvUV_set(sv, UV_MAX);
2067 SvUV_set(sv, U_V(SvNVX(sv)));
2068 /* 0xFFFFFFFFFFFFFFFF not an issue in here, NVs
2069 NV preservse UV so can do correct comparison. */
2070 if ((NV)(SvUVX(sv)) == SvNVX(sv)) {
2073 /*EMPTY*/; /* Integer is imprecise. NOK, IOKp, is UV */
2078 #else /* NV_PRESERVES_UV */
2079 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2080 == (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT)) {
2081 /* The IV/UV slot will have been set from value returned by
2082 grok_number above. The NV slot has just been set using
2085 assert (SvIOKp(sv));
2087 if (((UV)1 << NV_PRESERVES_UV_BITS) >
2088 U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))) {
2089 /* Small enough to preserve all bits. */
2090 (void)SvIOKp_on(sv);
2092 SvIV_set(sv, I_V(SvNVX(sv)));
2093 if ((NV)(SvIVX(sv)) == SvNVX(sv))
2095 /* Assumption: first non-preserved integer is < IV_MAX,
2096 this NV is in the preserved range, therefore: */
2097 if (!(U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))
2099 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);
2103 0 0 already failed to read UV.
2104 0 1 already failed to read UV.
2105 1 0 you won't get here in this case. IV/UV
2106 slot set, public IOK, Atof() unneeded.
2107 1 1 already read UV.
2108 so there's no point in sv_2iuv_non_preserve() attempting
2109 to use atol, strtol, strtoul etc. */
2110 sv_2iuv_non_preserve (sv, numtype);
2113 #endif /* NV_PRESERVES_UV */
2117 if (((SvFLAGS(sv) & (SVp_POK|SVp_SCREAM)) == SVp_SCREAM)
2118 && (SvTYPE(sv) == SVt_PVGV || SvTYPE(sv) == SVt_PVLV)) {
2119 return PTR2IV(glob_2inpuv((GV *)sv, NULL, TRUE));
2121 if (SvTYPE(sv) == SVt_PVGV)
2124 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
2125 if (!PL_localizing && ckWARN(WARN_UNINITIALIZED))
2128 if (SvTYPE(sv) < SVt_IV)
2129 /* Typically the caller expects that sv_any is not NULL now. */
2130 sv_upgrade(sv, SVt_IV);
2131 /* Return 0 from the caller. */
2138 =for apidoc sv_2iv_flags
2140 Return the integer value of an SV, doing any necessary string
2141 conversion. If flags includes SV_GMAGIC, does an mg_get() first.
2142 Normally used via the C<SvIV(sv)> and C<SvIVx(sv)> macros.
2148 Perl_sv_2iv_flags(pTHX_ register SV *sv, I32 flags)
2153 if (SvGMAGICAL(sv)) {
2154 if (flags & SV_GMAGIC)
2159 return I_V(SvNVX(sv));
2161 if (SvPOKp(sv) && SvLEN(sv)) {
2164 = grok_number(SvPVX_const(sv), SvCUR(sv), &value);
2166 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2167 == IS_NUMBER_IN_UV) {
2168 /* It's definitely an integer */
2169 if (numtype & IS_NUMBER_NEG) {
2170 if (value < (UV)IV_MIN)
2173 if (value < (UV)IV_MAX)
2178 if (ckWARN(WARN_NUMERIC))
2181 return I_V(Atof(SvPVX_const(sv)));
2186 assert(SvTYPE(sv) >= SVt_PVMG);
2187 /* This falls through to the report_uninit inside S_sv_2iuv_common. */
2188 } else if (SvTHINKFIRST(sv)) {
2192 SV * const tmpstr=AMG_CALLun(sv,numer);
2193 if (tmpstr && (!SvROK(tmpstr) || (SvRV(tmpstr) != SvRV(sv)))) {
2194 return SvIV(tmpstr);
2197 return PTR2IV(SvRV(sv));
2200 sv_force_normal_flags(sv, 0);
2202 if (SvREADONLY(sv) && !SvOK(sv)) {
2203 if (ckWARN(WARN_UNINITIALIZED))
2209 if (S_sv_2iuv_common(aTHX_ sv))
2212 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2iv(%"IVdf")\n",
2213 PTR2UV(sv),SvIVX(sv)));
2214 return SvIsUV(sv) ? (IV)SvUVX(sv) : SvIVX(sv);
2218 =for apidoc sv_2uv_flags
2220 Return the unsigned integer value of an SV, doing any necessary string
2221 conversion. If flags includes SV_GMAGIC, does an mg_get() first.
2222 Normally used via the C<SvUV(sv)> and C<SvUVx(sv)> macros.
2228 Perl_sv_2uv_flags(pTHX_ register SV *sv, I32 flags)
2233 if (SvGMAGICAL(sv)) {
2234 if (flags & SV_GMAGIC)
2239 return U_V(SvNVX(sv));
2240 if (SvPOKp(sv) && SvLEN(sv)) {
2243 = grok_number(SvPVX_const(sv), SvCUR(sv), &value);
2245 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2246 == IS_NUMBER_IN_UV) {
2247 /* It's definitely an integer */
2248 if (!(numtype & IS_NUMBER_NEG))
2252 if (ckWARN(WARN_NUMERIC))
2255 return U_V(Atof(SvPVX_const(sv)));
2260 assert(SvTYPE(sv) >= SVt_PVMG);
2261 /* This falls through to the report_uninit inside S_sv_2iuv_common. */
2262 } else if (SvTHINKFIRST(sv)) {
2266 SV *const tmpstr = AMG_CALLun(sv,numer);
2267 if (tmpstr && (!SvROK(tmpstr) || (SvRV(tmpstr) != SvRV(sv)))) {
2268 return SvUV(tmpstr);
2271 return PTR2UV(SvRV(sv));
2274 sv_force_normal_flags(sv, 0);
2276 if (SvREADONLY(sv) && !SvOK(sv)) {
2277 if (ckWARN(WARN_UNINITIALIZED))
2283 if (S_sv_2iuv_common(aTHX_ sv))
2287 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2uv(%"UVuf")\n",
2288 PTR2UV(sv),SvUVX(sv)));
2289 return SvIsUV(sv) ? SvUVX(sv) : (UV)SvIVX(sv);
2295 Return the num value of an SV, doing any necessary string or integer
2296 conversion, magic etc. Normally used via the C<SvNV(sv)> and C<SvNVx(sv)>
2303 Perl_sv_2nv(pTHX_ register SV *sv)
2308 if (SvGMAGICAL(sv)) {
2312 if ((SvPOKp(sv) && SvLEN(sv)) && !SvIOKp(sv)) {
2313 if (!SvIOKp(sv) && ckWARN(WARN_NUMERIC) &&
2314 !grok_number(SvPVX_const(sv), SvCUR(sv), NULL))
2316 return Atof(SvPVX_const(sv));
2320 return (NV)SvUVX(sv);
2322 return (NV)SvIVX(sv);
2327 assert(SvTYPE(sv) >= SVt_PVMG);
2328 /* This falls through to the report_uninit near the end of the
2330 } else if (SvTHINKFIRST(sv)) {
2334 SV *const tmpstr = AMG_CALLun(sv,numer);
2335 if (tmpstr && (!SvROK(tmpstr) || (SvRV(tmpstr) != SvRV(sv)))) {
2336 return SvNV(tmpstr);
2339 return PTR2NV(SvRV(sv));
2342 sv_force_normal_flags(sv, 0);
2344 if (SvREADONLY(sv) && !SvOK(sv)) {
2345 if (ckWARN(WARN_UNINITIALIZED))
2350 if (SvTYPE(sv) < SVt_NV) {
2351 /* The logic to use SVt_PVNV if necessary is in sv_upgrade. */
2352 sv_upgrade(sv, SVt_NV);
2353 #ifdef USE_LONG_DOUBLE
2355 STORE_NUMERIC_LOCAL_SET_STANDARD();
2356 PerlIO_printf(Perl_debug_log,
2357 "0x%"UVxf" num(%" PERL_PRIgldbl ")\n",
2358 PTR2UV(sv), SvNVX(sv));
2359 RESTORE_NUMERIC_LOCAL();
2363 STORE_NUMERIC_LOCAL_SET_STANDARD();
2364 PerlIO_printf(Perl_debug_log, "0x%"UVxf" num(%"NVgf")\n",
2365 PTR2UV(sv), SvNVX(sv));
2366 RESTORE_NUMERIC_LOCAL();
2370 else if (SvTYPE(sv) < SVt_PVNV)
2371 sv_upgrade(sv, SVt_PVNV);
2376 SvNV_set(sv, SvIsUV(sv) ? (NV)SvUVX(sv) : (NV)SvIVX(sv));
2377 #ifdef NV_PRESERVES_UV
2380 /* Only set the public NV OK flag if this NV preserves the IV */
2381 /* Check it's not 0xFFFFFFFFFFFFFFFF */
2382 if (SvIsUV(sv) ? ((SvUVX(sv) != UV_MAX)&&(SvUVX(sv) == U_V(SvNVX(sv))))
2383 : (SvIVX(sv) == I_V(SvNVX(sv))))
2389 else if (SvPOKp(sv) && SvLEN(sv)) {
2391 const int numtype = grok_number(SvPVX_const(sv), SvCUR(sv), &value);
2392 if (!SvIOKp(sv) && !numtype && ckWARN(WARN_NUMERIC))
2394 #ifdef NV_PRESERVES_UV
2395 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2396 == IS_NUMBER_IN_UV) {
2397 /* It's definitely an integer */
2398 SvNV_set(sv, (numtype & IS_NUMBER_NEG) ? -(NV)value : (NV)value);
2400 SvNV_set(sv, Atof(SvPVX_const(sv)));
2403 SvNV_set(sv, Atof(SvPVX_const(sv)));
2404 /* Only set the public NV OK flag if this NV preserves the value in
2405 the PV at least as well as an IV/UV would.
2406 Not sure how to do this 100% reliably. */
2407 /* if that shift count is out of range then Configure's test is
2408 wonky. We shouldn't be in here with NV_PRESERVES_UV_BITS ==
2410 if (((UV)1 << NV_PRESERVES_UV_BITS) >
2411 U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))) {
2412 SvNOK_on(sv); /* Definitely small enough to preserve all bits */
2413 } else if (!(numtype & IS_NUMBER_IN_UV)) {
2414 /* Can't use strtol etc to convert this string, so don't try.
2415 sv_2iv and sv_2uv will use the NV to convert, not the PV. */
2418 /* value has been set. It may not be precise. */
2419 if ((numtype & IS_NUMBER_NEG) && (value > (UV)IV_MIN)) {
2420 /* 2s complement assumption for (UV)IV_MIN */
2421 SvNOK_on(sv); /* Integer is too negative. */
2426 if (numtype & IS_NUMBER_NEG) {
2427 SvIV_set(sv, -(IV)value);
2428 } else if (value <= (UV)IV_MAX) {
2429 SvIV_set(sv, (IV)value);
2431 SvUV_set(sv, value);
2435 if (numtype & IS_NUMBER_NOT_INT) {
2436 /* I believe that even if the original PV had decimals,
2437 they are lost beyond the limit of the FP precision.
2438 However, neither is canonical, so both only get p
2439 flags. NWC, 2000/11/25 */
2440 /* Both already have p flags, so do nothing */
2442 const NV nv = SvNVX(sv);
2443 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2444 if (SvIVX(sv) == I_V(nv)) {
2447 /* It had no "." so it must be integer. */
2451 /* between IV_MAX and NV(UV_MAX).
2452 Could be slightly > UV_MAX */
2454 if (numtype & IS_NUMBER_NOT_INT) {
2455 /* UV and NV both imprecise. */
2457 const UV nv_as_uv = U_V(nv);
2459 if (value == nv_as_uv && SvUVX(sv) != UV_MAX) {
2468 #endif /* NV_PRESERVES_UV */
2471 if (((SvFLAGS(sv) & (SVp_POK|SVp_SCREAM)) == SVp_SCREAM)
2472 && (SvTYPE(sv) == SVt_PVGV || SvTYPE(sv) == SVt_PVLV)) {
2473 glob_2inpuv((GV *)sv, NULL, TRUE);
2477 if (!PL_localizing && !(SvFLAGS(sv) & SVs_PADTMP) && ckWARN(WARN_UNINITIALIZED))
2479 assert (SvTYPE(sv) >= SVt_NV);
2480 /* Typically the caller expects that sv_any is not NULL now. */
2481 /* XXX Ilya implies that this is a bug in callers that assume this
2482 and ideally should be fixed. */
2485 #if defined(USE_LONG_DOUBLE)
2487 STORE_NUMERIC_LOCAL_SET_STANDARD();
2488 PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2nv(%" PERL_PRIgldbl ")\n",
2489 PTR2UV(sv), SvNVX(sv));
2490 RESTORE_NUMERIC_LOCAL();
2494 STORE_NUMERIC_LOCAL_SET_STANDARD();
2495 PerlIO_printf(Perl_debug_log, "0x%"UVxf" 1nv(%"NVgf")\n",
2496 PTR2UV(sv), SvNVX(sv));
2497 RESTORE_NUMERIC_LOCAL();
2503 /* uiv_2buf(): private routine for use by sv_2pv_flags(): print an IV or
2504 * UV as a string towards the end of buf, and return pointers to start and
2507 * We assume that buf is at least TYPE_CHARS(UV) long.
2511 S_uiv_2buf(char *buf, IV iv, UV uv, int is_uv, char **peob)
2513 char *ptr = buf + TYPE_CHARS(UV);
2514 char * const ebuf = ptr;
2527 *--ptr = '0' + (char)(uv % 10);
2535 /* stringify_regexp(): private routine for use by sv_2pv_flags(): converts
2536 * a regexp to its stringified form.
2540 S_stringify_regexp(pTHX_ SV *sv, MAGIC *mg, STRLEN *lp) {
2542 const regexp * const re = (regexp *)mg->mg_obj;
2545 const char *fptr = "msix";
2550 bool need_newline = 0;
2551 U16 reganch = (U16)((re->reganch & PMf_COMPILETIME) >> 12);
2553 while((ch = *fptr++)) {
2555 reflags[left++] = ch;
2558 reflags[right--] = ch;
2563 reflags[left] = '-';
2567 mg->mg_len = re->prelen + 4 + left;
2569 * If /x was used, we have to worry about a regex ending with a
2570 * comment later being embedded within another regex. If so, we don't
2571 * want this regex's "commentization" to leak out to the right part of
2572 * the enclosing regex, we must cap it with a newline.
2574 * So, if /x was used, we scan backwards from the end of the regex. If
2575 * we find a '#' before we find a newline, we need to add a newline
2576 * ourself. If we find a '\n' first (or if we don't find '#' or '\n'),
2577 * we don't need to add anything. -jfriedl
2579 if (PMf_EXTENDED & re->reganch) {
2580 const char *endptr = re->precomp + re->prelen;
2581 while (endptr >= re->precomp) {
2582 const char c = *(endptr--);
2584 break; /* don't need another */
2586 /* we end while in a comment, so we need a newline */
2587 mg->mg_len++; /* save space for it */
2588 need_newline = 1; /* note to add it */
2594 Newx(mg->mg_ptr, mg->mg_len + 1 + left, char);
2595 mg->mg_ptr[0] = '(';
2596 mg->mg_ptr[1] = '?';
2597 Copy(reflags, mg->mg_ptr+2, left, char);
2598 *(mg->mg_ptr+left+2) = ':';
2599 Copy(re->precomp, mg->mg_ptr+3+left, re->prelen, char);
2601 mg->mg_ptr[mg->mg_len - 2] = '\n';
2602 mg->mg_ptr[mg->mg_len - 1] = ')';
2603 mg->mg_ptr[mg->mg_len] = 0;
2605 PL_reginterp_cnt += re->program[0].next_off;
2607 if (re->reganch & ROPT_UTF8)
2617 =for apidoc sv_2pv_flags
2619 Returns a pointer to the string value of an SV, and sets *lp to its length.
2620 If flags includes SV_GMAGIC, does an mg_get() first. Coerces sv to a string
2622 Normally invoked via the C<SvPV_flags> macro. C<sv_2pv()> and C<sv_2pv_nomg>
2623 usually end up here too.
2629 Perl_sv_2pv_flags(pTHX_ register SV *sv, STRLEN *lp, I32 flags)
2639 if (SvGMAGICAL(sv)) {
2640 if (flags & SV_GMAGIC)
2645 if (flags & SV_MUTABLE_RETURN)
2646 return SvPVX_mutable(sv);
2647 if (flags & SV_CONST_RETURN)
2648 return (char *)SvPVX_const(sv);
2651 if (SvIOKp(sv) || SvNOKp(sv)) {
2652 char tbuf[64]; /* Must fit sprintf/Gconvert of longest IV/NV */
2656 len = SvIsUV(sv) ? my_sprintf(tbuf,"%"UVuf, (UV)SvUVX(sv))
2657 : my_sprintf(tbuf,"%"IVdf, (IV)SvIVX(sv));
2659 Gconvert(SvNVX(sv), NV_DIG, 0, tbuf);
2666 #ifdef FIXNEGATIVEZERO
2667 if (len == 2 && tbuf[0] == '-' && tbuf[1] == '0') {
2673 SvUPGRADE(sv, SVt_PV);
2676 s = SvGROW_mutable(sv, len + 1);
2679 return memcpy(s, tbuf, len + 1);
2685 assert(SvTYPE(sv) >= SVt_PVMG);
2686 /* This falls through to the report_uninit near the end of the
2688 } else if (SvTHINKFIRST(sv)) {
2692 SV *const tmpstr = AMG_CALLun(sv,string);
2693 if (tmpstr && (!SvROK(tmpstr) || (SvRV(tmpstr) != SvRV(sv)))) {
2695 /* char *pv = lp ? SvPV(tmpstr, *lp) : SvPV_nolen(tmpstr);
2699 if ((SvFLAGS(tmpstr) & (SVf_POK)) == SVf_POK) {
2700 if (flags & SV_CONST_RETURN) {
2701 pv = (char *) SvPVX_const(tmpstr);
2703 pv = (flags & SV_MUTABLE_RETURN)
2704 ? SvPVX_mutable(tmpstr) : SvPVX(tmpstr);
2707 *lp = SvCUR(tmpstr);
2709 pv = sv_2pv_flags(tmpstr, lp, flags);
2721 const SV *const referent = (SV*)SvRV(sv);
2724 tsv = sv_2mortal(newSVpvs("NULLREF"));
2725 } else if (SvTYPE(referent) == SVt_PVMG
2726 && ((SvFLAGS(referent) &
2727 (SVs_OBJECT|SVf_OK|SVs_GMG|SVs_SMG|SVs_RMG))
2728 == (SVs_OBJECT|SVs_SMG))
2729 && (mg = mg_find(referent, PERL_MAGIC_qr))) {
2730 return stringify_regexp(sv, mg, lp);
2732 const char *const typestr = sv_reftype(referent, 0);
2734 tsv = sv_newmortal();
2735 if (SvOBJECT(referent)) {
2736 const char *const name = HvNAME_get(SvSTASH(referent));
2737 Perl_sv_setpvf(aTHX_ tsv, "%s=%s(0x%"UVxf")",
2738 name ? name : "__ANON__" , typestr,
2742 Perl_sv_setpvf(aTHX_ tsv, "%s(0x%"UVxf")", typestr,
2750 if (SvREADONLY(sv) && !SvOK(sv)) {
2751 if (ckWARN(WARN_UNINITIALIZED))
2758 if (SvIOK(sv) || ((SvIOKp(sv) && !SvNOKp(sv)))) {
2759 /* I'm assuming that if both IV and NV are equally valid then
2760 converting the IV is going to be more efficient */
2761 const U32 isIOK = SvIOK(sv);
2762 const U32 isUIOK = SvIsUV(sv);
2763 char buf[TYPE_CHARS(UV)];
2766 if (SvTYPE(sv) < SVt_PVIV)
2767 sv_upgrade(sv, SVt_PVIV);
2768 ptr = uiv_2buf(buf, SvIVX(sv), SvUVX(sv), isUIOK, &ebuf);
2769 /* inlined from sv_setpvn */
2770 SvGROW_mutable(sv, (STRLEN)(ebuf - ptr + 1));
2771 Move(ptr,SvPVX_mutable(sv),ebuf - ptr,char);
2772 SvCUR_set(sv, ebuf - ptr);
2782 else if (SvNOKp(sv)) {
2783 const int olderrno = errno;
2784 if (SvTYPE(sv) < SVt_PVNV)
2785 sv_upgrade(sv, SVt_PVNV);
2786 /* The +20 is pure guesswork. Configure test needed. --jhi */
2787 s = SvGROW_mutable(sv, NV_DIG + 20);
2788 /* some Xenix systems wipe out errno here */
2790 if (SvNVX(sv) == 0.0)
2791 (void)strcpy(s,"0");
2795 Gconvert(SvNVX(sv), NV_DIG, 0, s);
2798 #ifdef FIXNEGATIVEZERO
2799 if (*s == '-' && s[1] == '0' && !s[2])
2809 if (((SvFLAGS(sv) & (SVp_POK|SVp_SCREAM)) == SVp_SCREAM)
2810 && (SvTYPE(sv) == SVt_PVGV || SvTYPE(sv) == SVt_PVLV)) {
2811 return glob_2inpuv((GV *)sv, lp, FALSE);
2814 if (!PL_localizing && !(SvFLAGS(sv) & SVs_PADTMP) && ckWARN(WARN_UNINITIALIZED))
2818 if (SvTYPE(sv) < SVt_PV)
2819 /* Typically the caller expects that sv_any is not NULL now. */
2820 sv_upgrade(sv, SVt_PV);
2824 const STRLEN len = s - SvPVX_const(sv);
2830 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2pv(%s)\n",
2831 PTR2UV(sv),SvPVX_const(sv)));
2832 if (flags & SV_CONST_RETURN)
2833 return (char *)SvPVX_const(sv);
2834 if (flags & SV_MUTABLE_RETURN)
2835 return SvPVX_mutable(sv);
2840 =for apidoc sv_copypv
2842 Copies a stringified representation of the source SV into the
2843 destination SV. Automatically performs any necessary mg_get and
2844 coercion of numeric values into strings. Guaranteed to preserve
2845 UTF-8 flag even from overloaded objects. Similar in nature to
2846 sv_2pv[_flags] but operates directly on an SV instead of just the
2847 string. Mostly uses sv_2pv_flags to do its work, except when that
2848 would lose the UTF-8'ness of the PV.
2854 Perl_sv_copypv(pTHX_ SV *dsv, register SV *ssv)
2857 const char * const s = SvPV_const(ssv,len);
2858 sv_setpvn(dsv,s,len);
2866 =for apidoc sv_2pvbyte
2868 Return a pointer to the byte-encoded representation of the SV, and set *lp
2869 to its length. May cause the SV to be downgraded from UTF-8 as a
2872 Usually accessed via the C<SvPVbyte> macro.
2878 Perl_sv_2pvbyte(pTHX_ register SV *sv, STRLEN *lp)
2880 sv_utf8_downgrade(sv,0);
2881 return lp ? SvPV(sv,*lp) : SvPV_nolen(sv);
2885 =for apidoc sv_2pvutf8
2887 Return a pointer to the UTF-8-encoded representation of the SV, and set *lp
2888 to its length. May cause the SV to be upgraded to UTF-8 as a side-effect.
2890 Usually accessed via the C<SvPVutf8> macro.
2896 Perl_sv_2pvutf8(pTHX_ register SV *sv, STRLEN *lp)
2898 sv_utf8_upgrade(sv);
2899 return lp ? SvPV(sv,*lp) : SvPV_nolen(sv);
2904 =for apidoc sv_2bool
2906 This function is only called on magical items, and is only used by
2907 sv_true() or its macro equivalent.
2913 Perl_sv_2bool(pTHX_ register SV *sv)
2922 SV * const tmpsv = AMG_CALLun(sv,bool_);
2923 if (tmpsv && (!SvROK(tmpsv) || (SvRV(tmpsv) != SvRV(sv))))
2924 return (bool)SvTRUE(tmpsv);
2926 return SvRV(sv) != 0;
2929 register XPV* const Xpvtmp = (XPV*)SvANY(sv);
2931 (*sv->sv_u.svu_pv > '0' ||
2932 Xpvtmp->xpv_cur > 1 ||
2933 (Xpvtmp->xpv_cur && *sv->sv_u.svu_pv != '0')))
2940 return SvIVX(sv) != 0;
2943 return SvNVX(sv) != 0.0;
2945 if ((SvFLAGS(sv) & SVp_SCREAM)
2946 && (SvTYPE(sv) == (SVt_PVGV) || SvTYPE(sv) == (SVt_PVLV)))
2956 =for apidoc sv_utf8_upgrade
2958 Converts the PV of an SV to its UTF-8-encoded form.
2959 Forces the SV to string form if it is not already.
2960 Always sets the SvUTF8 flag to avoid future validity checks even
2961 if all the bytes have hibit clear.
2963 This is not as a general purpose byte encoding to Unicode interface:
2964 use the Encode extension for that.
2966 =for apidoc sv_utf8_upgrade_flags
2968 Converts the PV of an SV to its UTF-8-encoded form.
2969 Forces the SV to string form if it is not already.
2970 Always sets the SvUTF8 flag to avoid future validity checks even
2971 if all the bytes have hibit clear. If C<flags> has C<SV_GMAGIC> bit set,
2972 will C<mg_get> on C<sv> if appropriate, else not. C<sv_utf8_upgrade> and
2973 C<sv_utf8_upgrade_nomg> are implemented in terms of this function.
2975 This is not as a general purpose byte encoding to Unicode interface:
2976 use the Encode extension for that.
2982 Perl_sv_utf8_upgrade_flags(pTHX_ register SV *sv, I32 flags)
2985 if (sv == &PL_sv_undef)
2989 if (SvREADONLY(sv) && (SvPOKp(sv) || SvIOKp(sv) || SvNOKp(sv))) {
2990 (void) sv_2pv_flags(sv,&len, flags);
2994 (void) SvPV_force(sv,len);
3003 sv_force_normal_flags(sv, 0);
3006 if (PL_encoding && !(flags & SV_UTF8_NO_ENCODING))
3007 sv_recode_to_utf8(sv, PL_encoding);
3008 else { /* Assume Latin-1/EBCDIC */
3009 /* This function could be much more efficient if we
3010 * had a FLAG in SVs to signal if there are any hibit
3011 * chars in the PV. Given that there isn't such a flag
3012 * make the loop as fast as possible. */
3013 const U8 * const s = (U8 *) SvPVX_const(sv);
3014 const U8 * const e = (U8 *) SvEND(sv);
3019 /* Check for hi bit */
3020 if (!NATIVE_IS_INVARIANT(ch)) {
3021 STRLEN len = SvCUR(sv) + 1; /* Plus the \0 */
3022 U8 * const recoded = bytes_to_utf8((U8*)s, &len);
3024 SvPV_free(sv); /* No longer using what was there before. */
3025 SvPV_set(sv, (char*)recoded);
3026 SvCUR_set(sv, len - 1);
3027 SvLEN_set(sv, len); /* No longer know the real size. */
3031 /* Mark as UTF-8 even if no hibit - saves scanning loop */
3038 =for apidoc sv_utf8_downgrade
3040 Attempts to convert the PV of an SV from characters to bytes.
3041 If the PV contains a character beyond byte, this conversion will fail;
3042 in this case, either returns false or, if C<fail_ok> is not
3045 This is not as a general purpose Unicode to byte encoding interface:
3046 use the Encode extension for that.
3052 Perl_sv_utf8_downgrade(pTHX_ register SV* sv, bool fail_ok)
3055 if (SvPOKp(sv) && SvUTF8(sv)) {
3061 sv_force_normal_flags(sv, 0);
3063 s = (U8 *) SvPV(sv, len);
3064 if (!utf8_to_bytes(s, &len)) {
3069 Perl_croak(aTHX_ "Wide character in %s",
3072 Perl_croak(aTHX_ "Wide character");
3083 =for apidoc sv_utf8_encode
3085 Converts the PV of an SV to UTF-8, but then turns the C<SvUTF8>
3086 flag off so that it looks like octets again.
3092 Perl_sv_utf8_encode(pTHX_ register SV *sv)
3094 (void) sv_utf8_upgrade(sv);
3096 sv_force_normal_flags(sv, 0);
3098 if (SvREADONLY(sv)) {
3099 Perl_croak(aTHX_ PL_no_modify);
3105 =for apidoc sv_utf8_decode
3107 If the PV of the SV is an octet sequence in UTF-8
3108 and contains a multiple-byte character, the C<SvUTF8> flag is turned on
3109 so that it looks like a character. If the PV contains only single-byte
3110 characters, the C<SvUTF8> flag stays being off.
3111 Scans PV for validity and returns false if the PV is invalid UTF-8.
3117 Perl_sv_utf8_decode(pTHX_ register SV *sv)
3123 /* The octets may have got themselves encoded - get them back as
3126 if (!sv_utf8_downgrade(sv, TRUE))
3129 /* it is actually just a matter of turning the utf8 flag on, but
3130 * we want to make sure everything inside is valid utf8 first.
3132 c = (const U8 *) SvPVX_const(sv);
3133 if (!is_utf8_string(c, SvCUR(sv)+1))
3135 e = (const U8 *) SvEND(sv);
3138 if (!UTF8_IS_INVARIANT(ch)) {
3148 =for apidoc sv_setsv
3150 Copies the contents of the source SV C<ssv> into the destination SV
3151 C<dsv>. The source SV may be destroyed if it is mortal, so don't use this
3152 function if the source SV needs to be reused. Does not handle 'set' magic.
3153 Loosely speaking, it performs a copy-by-value, obliterating any previous
3154 content of the destination.
3156 You probably want to use one of the assortment of wrappers, such as
3157 C<SvSetSV>, C<SvSetSV_nosteal>, C<SvSetMagicSV> and
3158 C<SvSetMagicSV_nosteal>.
3160 =for apidoc sv_setsv_flags
3162 Copies the contents of the source SV C<ssv> into the destination SV
3163 C<dsv>. The source SV may be destroyed if it is mortal, so don't use this
3164 function if the source SV needs to be reused. Does not handle 'set' magic.
3165 Loosely speaking, it performs a copy-by-value, obliterating any previous
3166 content of the destination.
3167 If the C<flags> parameter has the C<SV_GMAGIC> bit set, will C<mg_get> on
3168 C<ssv> if appropriate, else not. If the C<flags> parameter has the
3169 C<NOSTEAL> bit set then the buffers of temps will not be stolen. <sv_setsv>
3170 and C<sv_setsv_nomg> are implemented in terms of this function.
3172 You probably want to use one of the assortment of wrappers, such as
3173 C<SvSetSV>, C<SvSetSV_nosteal>, C<SvSetMagicSV> and
3174 C<SvSetMagicSV_nosteal>.
3176 This is the primary function for copying scalars, and most other
3177 copy-ish functions and macros use this underneath.
3183 S_glob_assign_glob(pTHX_ SV *dstr, SV *sstr, const int dtype)
3185 if (dtype != SVt_PVGV) {
3186 const char * const name = GvNAME(sstr);
3187 const STRLEN len = GvNAMELEN(sstr);
3188 /* don't upgrade SVt_PVLV: it can hold a glob */
3189 if (dtype != SVt_PVLV)
3190 sv_upgrade(dstr, SVt_PVGV);
3191 GvSTASH(dstr) = GvSTASH(sstr);
3193 Perl_sv_add_backref(aTHX_ (SV*)GvSTASH(dstr), dstr);
3194 GvNAME(dstr) = savepvn(name, len);
3195 GvNAMELEN(dstr) = len;
3196 SvFAKE_on(dstr); /* can coerce to non-glob */
3199 #ifdef GV_UNIQUE_CHECK
3200 if (GvUNIQUE((GV*)dstr)) {
3201 Perl_croak(aTHX_ PL_no_modify);
3205 (void)SvOK_off(dstr);
3207 GvINTRO_off(dstr); /* one-shot flag */
3209 GvGP(dstr) = gp_ref(GvGP(sstr));
3210 if (SvTAINTED(sstr))
3212 if (GvIMPORTED(dstr) != GVf_IMPORTED
3213 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3215 GvIMPORTED_on(dstr);
3222 S_glob_assign_ref(pTHX_ SV *dstr, SV *sstr) {
3223 SV * const sref = SvREFCNT_inc(SvRV(sstr));
3225 const int intro = GvINTRO(dstr);
3228 const U32 stype = SvTYPE(sref);
3231 #ifdef GV_UNIQUE_CHECK
3232 if (GvUNIQUE((GV*)dstr)) {
3233 Perl_croak(aTHX_ PL_no_modify);
3238 GvINTRO_off(dstr); /* one-shot flag */
3239 GvLINE(dstr) = CopLINE(PL_curcop);
3240 GvEGV(dstr) = (GV*)dstr;
3245 location = (SV **) &GvCV(dstr);
3246 import_flag = GVf_IMPORTED_CV;
3249 location = (SV **) &GvHV(dstr);
3250 import_flag = GVf_IMPORTED_HV;
3253 location = (SV **) &GvAV(dstr);
3254 import_flag = GVf_IMPORTED_AV;
3257 location = (SV **) &GvIOp(dstr);
3260 location = (SV **) &GvFORM(dstr);
3262 location = &GvSV(dstr);
3263 import_flag = GVf_IMPORTED_SV;
3266 if (stype == SVt_PVCV) {
3267 if (GvCVGEN(dstr) && GvCV(dstr) != (CV*)sref) {
3268 SvREFCNT_dec(GvCV(dstr));
3270 GvCVGEN(dstr) = 0; /* Switch off cacheness. */
3271 PL_sub_generation++;
3274 SAVEGENERICSV(*location);
3278 if (stype == SVt_PVCV && *location != sref) {
3279 CV* const cv = (CV*)*location;
3281 if (!GvCVGEN((GV*)dstr) &&
3282 (CvROOT(cv) || CvXSUB(cv)))
3284 /* Redefining a sub - warning is mandatory if
3285 it was a const and its value changed. */
3286 if (CvCONST(cv) && CvCONST((CV*)sref)
3287 && cv_const_sv(cv) == cv_const_sv((CV*)sref)) {
3289 /* They are 2 constant subroutines generated from
3290 the same constant. This probably means that
3291 they are really the "same" proxy subroutine
3292 instantiated in 2 places. Most likely this is
3293 when a constant is exported twice. Don't warn.
3296 else if (ckWARN(WARN_REDEFINE)
3298 && (!CvCONST((CV*)sref)
3299 || sv_cmp(cv_const_sv(cv),
3300 cv_const_sv((CV*)sref))))) {
3301 Perl_warner(aTHX_ packWARN(WARN_REDEFINE),
3303 ? "Constant subroutine %s::%s redefined"
3304 : "Subroutine %s::%s redefined",
3305 HvNAME_get(GvSTASH((GV*)dstr)),
3306 GvENAME((GV*)dstr));
3310 cv_ckproto(cv, (GV*)dstr,
3311 SvPOK(sref) ? SvPVX_const(sref) : NULL);
3313 GvCVGEN(dstr) = 0; /* Switch off cacheness. */
3314 GvASSUMECV_on(dstr);
3315 PL_sub_generation++;
3318 if (import_flag && !(GvFLAGS(dstr) & import_flag)
3319 && CopSTASH_ne(PL_curcop, GvSTASH(dstr))) {
3320 GvFLAGS(dstr) |= import_flag;
3326 if (SvTAINTED(sstr))
3332 Perl_sv_setsv_flags(pTHX_ SV *dstr, register SV *sstr, I32 flags)
3335 register U32 sflags;
3341 SV_CHECK_THINKFIRST_COW_DROP(dstr);
3343 sstr = &PL_sv_undef;
3344 stype = SvTYPE(sstr);
3345 dtype = SvTYPE(dstr);
3350 /* need to nuke the magic */
3352 SvRMAGICAL_off(dstr);
3355 /* There's a lot of redundancy below but we're going for speed here */
3360 if (dtype != SVt_PVGV) {
3361 (void)SvOK_off(dstr);
3369 sv_upgrade(dstr, SVt_IV);
3374 sv_upgrade(dstr, SVt_PVIV);
3377 (void)SvIOK_only(dstr);
3378 SvIV_set(dstr, SvIVX(sstr));
3381 /* SvTAINTED can only be true if the SV has taint magic, which in
3382 turn means that the SV type is PVMG (or greater). This is the
3383 case statement for SVt_IV, so this cannot be true (whatever gcov
3385 assert(!SvTAINTED(sstr));
3395 sv_upgrade(dstr, SVt_NV);
3400 sv_upgrade(dstr, SVt_PVNV);
3403 SvNV_set(dstr, SvNVX(sstr));
3404 (void)SvNOK_only(dstr);
3405 /* SvTAINTED can only be true if the SV has taint magic, which in
3406 turn means that the SV type is PVMG (or greater). This is the
3407 case statement for SVt_NV, so this cannot be true (whatever gcov
3409 assert(!SvTAINTED(sstr));
3416 sv_upgrade(dstr, SVt_RV);
3419 #ifdef PERL_OLD_COPY_ON_WRITE
3420 if ((SvFLAGS(sstr) & CAN_COW_MASK) == CAN_COW_FLAGS) {
3421 if (dtype < SVt_PVIV)
3422 sv_upgrade(dstr, SVt_PVIV);
3429 sv_upgrade(dstr, SVt_PV);
3432 if (dtype < SVt_PVIV)
3433 sv_upgrade(dstr, SVt_PVIV);
3436 if (dtype < SVt_PVNV)
3437 sv_upgrade(dstr, SVt_PVNV);
3444 const char * const type = sv_reftype(sstr,0);
3446 Perl_croak(aTHX_ "Bizarre copy of %s in %s", type, OP_NAME(PL_op));
3448 Perl_croak(aTHX_ "Bizarre copy of %s", type);
3453 if (dtype <= SVt_PVGV) {
3454 S_glob_assign_glob(aTHX_ dstr, sstr, dtype);
3460 if (SvGMAGICAL(sstr) && (flags & SV_GMAGIC)) {
3462 if ((int)SvTYPE(sstr) != stype) {
3463 stype = SvTYPE(sstr);
3464 if (stype == SVt_PVGV && dtype <= SVt_PVGV) {
3465 S_glob_assign_glob(aTHX_ dstr, sstr, dtype);
3470 if (stype == SVt_PVLV)
3471 SvUPGRADE(dstr, SVt_PVNV);
3473 SvUPGRADE(dstr, (U32)stype);
3476 /* dstr may have been upgraded. */
3477 dtype = SvTYPE(dstr);
3478 sflags = SvFLAGS(sstr);
3480 if (sflags & SVf_ROK) {
3481 if (dtype == SVt_PVGV &&
3482 SvROK(sstr) && SvTYPE(SvRV(sstr)) == SVt_PVGV) {
3485 if (GvIMPORTED(dstr) != GVf_IMPORTED
3486 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3488 GvIMPORTED_on(dstr);
3493 S_glob_assign_glob(aTHX_ dstr, sstr, dtype);
3497 if (dtype >= SVt_PV) {
3498 if (dtype == SVt_PVGV) {
3499 S_glob_assign_ref(aTHX_ dstr, sstr);
3502 if (SvPVX_const(dstr)) {
3508 (void)SvOK_off(dstr);
3509 SvRV_set(dstr, SvREFCNT_inc(SvRV(sstr)));
3510 SvFLAGS(dstr) |= sflags & (SVf_ROK|SVf_AMAGIC);
3511 assert(!(sflags & SVp_NOK));
3512 assert(!(sflags & SVp_IOK));
3513 assert(!(sflags & SVf_NOK));
3514 assert(!(sflags & SVf_IOK));
3516 else if (dtype == SVt_PVGV) {
3517 if (!(sflags & SVf_OK)) {
3518 if (ckWARN(WARN_MISC))
3519 Perl_warner(aTHX_ packWARN(WARN_MISC),
3520 "Undefined value assigned to typeglob");
3523 GV *gv = gv_fetchsv(sstr, GV_ADD, SVt_PVGV);
3524 if (dstr != (SV*)gv) {
3527 GvGP(dstr) = gp_ref(GvGP(gv));
3531 else if (sflags & SVp_POK) {
3535 * Check to see if we can just swipe the string. If so, it's a
3536 * possible small lose on short strings, but a big win on long ones.
3537 * It might even be a win on short strings if SvPVX_const(dstr)
3538 * has to be allocated and SvPVX_const(sstr) has to be freed.
3541 /* Whichever path we take through the next code, we want this true,
3542 and doing it now facilitates the COW check. */
3543 (void)SvPOK_only(dstr);
3546 /* We're not already COW */
3547 ((sflags & (SVf_FAKE | SVf_READONLY)) != (SVf_FAKE | SVf_READONLY)
3548 #ifndef PERL_OLD_COPY_ON_WRITE
3549 /* or we are, but dstr isn't a suitable target. */
3550 || (SvFLAGS(dstr) & CAN_COW_MASK) != CAN_COW_FLAGS
3555 (sflags & SVs_TEMP) && /* slated for free anyway? */
3556 !(sflags & SVf_OOK) && /* and not involved in OOK hack? */
3557 (!(flags & SV_NOSTEAL)) &&
3558 /* and we're allowed to steal temps */
3559 SvREFCNT(sstr) == 1 && /* and no other references to it? */
3560 SvLEN(sstr) && /* and really is a string */
3561 /* and won't be needed again, potentially */
3562 !(PL_op && PL_op->op_type == OP_AASSIGN))
3563 #ifdef PERL_OLD_COPY_ON_WRITE
3564 && !((sflags & CAN_COW_MASK) == CAN_COW_FLAGS
3565 && (SvFLAGS(dstr) & CAN_COW_MASK) == CAN_COW_FLAGS
3566 && SvTYPE(sstr) >= SVt_PVIV)
3569 /* Failed the swipe test, and it's not a shared hash key either.
3570 Have to copy the string. */
3571 STRLEN len = SvCUR(sstr);
3572 SvGROW(dstr, len + 1); /* inlined from sv_setpvn */
3573 Move(SvPVX_const(sstr),SvPVX(dstr),len,char);
3574 SvCUR_set(dstr, len);
3575 *SvEND(dstr) = '\0';
3577 /* If PERL_OLD_COPY_ON_WRITE is not defined, then isSwipe will always
3579 /* Either it's a shared hash key, or it's suitable for
3580 copy-on-write or we can swipe the string. */
3582 PerlIO_printf(Perl_debug_log, "Copy on write: sstr --> dstr\n");
3586 #ifdef PERL_OLD_COPY_ON_WRITE
3588 /* I believe I should acquire a global SV mutex if
3589 it's a COW sv (not a shared hash key) to stop
3590 it going un copy-on-write.
3591 If the source SV has gone un copy on write between up there
3592 and down here, then (assert() that) it is of the correct
3593 form to make it copy on write again */
3594 if ((sflags & (SVf_FAKE | SVf_READONLY))
3595 != (SVf_FAKE | SVf_READONLY)) {
3596 SvREADONLY_on(sstr);
3598 /* Make the source SV into a loop of 1.
3599 (about to become 2) */
3600 SV_COW_NEXT_SV_SET(sstr, sstr);
3604 /* Initial code is common. */
3605 if (SvPVX_const(dstr)) { /* we know that dtype >= SVt_PV */
3610 /* making another shared SV. */
3611 STRLEN cur = SvCUR(sstr);
3612 STRLEN len = SvLEN(sstr);
3613 #ifdef PERL_OLD_COPY_ON_WRITE
3615 assert (SvTYPE(dstr) >= SVt_PVIV);
3616 /* SvIsCOW_normal */
3617 /* splice us in between source and next-after-source. */
3618 SV_COW_NEXT_SV_SET(dstr, SV_COW_NEXT_SV(sstr));
3619 SV_COW_NEXT_SV_SET(sstr, dstr);
3620 SvPV_set(dstr, SvPVX_mutable(sstr));
3624 /* SvIsCOW_shared_hash */
3625 DEBUG_C(PerlIO_printf(Perl_debug_log,
3626 "Copy on write: Sharing hash\n"));
3628 assert (SvTYPE(dstr) >= SVt_PV);
3630 HEK_KEY(share_hek_hek(SvSHARED_HEK_FROM_PV(SvPVX_const(sstr)))));
3632 SvLEN_set(dstr, len);
3633 SvCUR_set(dstr, cur);
3634 SvREADONLY_on(dstr);
3636 /* Relesase a global SV mutex. */
3639 { /* Passes the swipe test. */
3640 SvPV_set(dstr, SvPVX_mutable(sstr));
3641 SvLEN_set(dstr, SvLEN(sstr));
3642 SvCUR_set(dstr, SvCUR(sstr));
3645 (void)SvOK_off(sstr); /* NOTE: nukes most SvFLAGS on sstr */
3646 SvPV_set(sstr, NULL);
3652 if (sflags & SVp_NOK) {
3653 SvNV_set(dstr, SvNVX(sstr));
3655 if (sflags & SVp_IOK) {
3656 SvRELEASE_IVX(dstr);
3657 SvIV_set(dstr, SvIVX(sstr));
3658 /* Must do this otherwise some other overloaded use of 0x80000000
3659 gets confused. I guess SVpbm_VALID */
3660 if (sflags & SVf_IVisUV)
3663 SvFLAGS(dstr) |= sflags & (SVf_IOK|SVp_IOK|SVf_NOK|SVp_NOK|SVf_UTF8);
3665 const MAGIC * const smg = SvVOK(sstr);
3667 sv_magic(dstr, NULL, PERL_MAGIC_vstring,
3668 smg->mg_ptr, smg->mg_len);
3669 SvRMAGICAL_on(dstr);
3673 else if (sflags & (SVp_IOK|SVp_NOK)) {
3674 (void)SvOK_off(dstr);
3675 SvFLAGS(dstr) |= sflags & (SVf_IOK|SVp_IOK|SVf_IVisUV|SVf_NOK|SVp_NOK);
3676 if (sflags & SVp_IOK) {
3677 /* XXXX Do we want to set IsUV for IV(ROK)? Be extra safe... */
3678 SvIV_set(dstr, SvIVX(sstr));
3680 if (sflags & SVp_NOK) {
3681 SvNV_set(dstr, SvNVX(sstr));
3685 if ((stype == SVt_PVGV || stype == SVt_PVLV)
3686 && (sflags & SVp_SCREAM)) {
3687 /* This stringification rule for globs is spread in 3 places.
3688 This feels bad. FIXME. */
3689 const U32 wasfake = sflags & SVf_FAKE;
3691 /* FAKE globs can get coerced, so need to turn this off
3692 temporarily if it is on. */
3694 gv_efullname3(dstr, (GV *)sstr, "*");
3695 SvFLAGS(sstr) |= wasfake;
3698 (void)SvOK_off(dstr);
3700 if (SvTAINTED(sstr))
3705 =for apidoc sv_setsv_mg
3707 Like C<sv_setsv>, but also handles 'set' magic.
3713 Perl_sv_setsv_mg(pTHX_ SV *dstr, register SV *sstr)
3715 sv_setsv(dstr,sstr);
3719 #ifdef PERL_OLD_COPY_ON_WRITE
3721 Perl_sv_setsv_cow(pTHX_ SV *dstr, SV *sstr)
3723 STRLEN cur = SvCUR(sstr);
3724 STRLEN len = SvLEN(sstr);
3725 register char *new_pv;
3728 PerlIO_printf(Perl_debug_log, "Fast copy on write: %p -> %p\n",
3736 if (SvTHINKFIRST(dstr))
3737 sv_force_normal_flags(dstr, SV_COW_DROP_PV);
3738 else if (SvPVX_const(dstr))
3739 Safefree(SvPVX_const(dstr));
3743 SvUPGRADE(dstr, SVt_PVIV);
3745 assert (SvPOK(sstr));
3746 assert (SvPOKp(sstr));
3747 assert (!SvIOK(sstr));
3748 assert (!SvIOKp(sstr));
3749 assert (!SvNOK(sstr));
3750 assert (!SvNOKp(sstr));
3752 if (SvIsCOW(sstr)) {
3754 if (SvLEN(sstr) == 0) {
3755 /* source is a COW shared hash key. */
3756 DEBUG_C(PerlIO_printf(Perl_debug_log,
3757 "Fast copy on write: Sharing hash\n"));
3758 new_pv = HEK_KEY(share_hek_hek(SvSHARED_HEK_FROM_PV(SvPVX_const(sstr))));
3761 SV_COW_NEXT_SV_SET(dstr, SV_COW_NEXT_SV(sstr));
3763 assert ((SvFLAGS(sstr) & CAN_COW_MASK) == CAN_COW_FLAGS);
3764 SvUPGRADE(sstr, SVt_PVIV);
3765 SvREADONLY_on(sstr);
3767 DEBUG_C(PerlIO_printf(Perl_debug_log,
3768 "Fast copy on write: Converting sstr to COW\n"));
3769 SV_COW_NEXT_SV_SET(dstr, sstr);
3771 SV_COW_NEXT_SV_SET(sstr, dstr);
3772 new_pv = SvPVX_mutable(sstr);
3775 SvPV_set(dstr, new_pv);
3776 SvFLAGS(dstr) = (SVt_PVIV|SVf_POK|SVp_POK|SVf_FAKE|SVf_READONLY);
3779 SvLEN_set(dstr, len);
3780 SvCUR_set(dstr, cur);
3789 =for apidoc sv_setpvn
3791 Copies a string into an SV. The C<len> parameter indicates the number of
3792 bytes to be copied. If the C<ptr> argument is NULL the SV will become
3793 undefined. Does not handle 'set' magic. See C<sv_setpvn_mg>.
3799 Perl_sv_setpvn(pTHX_ register SV *sv, register const char *ptr, register STRLEN len)
3802 register char *dptr;
3804 SV_CHECK_THINKFIRST_COW_DROP(sv);
3810 /* len is STRLEN which is unsigned, need to copy to signed */
3813 Perl_croak(aTHX_ "panic: sv_setpvn called with negative strlen");
3815 SvUPGRADE(sv, SVt_PV);
3817 dptr = SvGROW(sv, len + 1);
3818 Move(ptr,dptr,len,char);
3821 (void)SvPOK_only_UTF8(sv); /* validate pointer */
3826 =for apidoc sv_setpvn_mg
3828 Like C<sv_setpvn>, but also handles 'set' magic.
3834 Perl_sv_setpvn_mg(pTHX_ register SV *sv, register const char *ptr, register STRLEN len)
3836 sv_setpvn(sv,ptr,len);
3841 =for apidoc sv_setpv
3843 Copies a string into an SV. The string must be null-terminated. Does not
3844 handle 'set' magic. See C<sv_setpv_mg>.
3850 Perl_sv_setpv(pTHX_ register SV *sv, register const char *ptr)
3853 register STRLEN len;
3855 SV_CHECK_THINKFIRST_COW_DROP(sv);
3861 SvUPGRADE(sv, SVt_PV);
3863 SvGROW(sv, len + 1);
3864 Move(ptr,SvPVX(sv),len+1,char);
3866 (void)SvPOK_only_UTF8(sv); /* validate pointer */
3871 =for apidoc sv_setpv_mg
3873 Like C<sv_setpv>, but also handles 'set' magic.
3879 Perl_sv_setpv_mg(pTHX_ register SV *sv, register const char *ptr)
3886 =for apidoc sv_usepvn
3888 Tells an SV to use C<ptr> to find its string value. Normally the string is
3889 stored inside the SV but sv_usepvn allows the SV to use an outside string.
3890 The C<ptr> should point to memory that was allocated by C<malloc>. The
3891 string length, C<len>, must be supplied. This function will realloc the
3892 memory pointed to by C<ptr>, so that pointer should not be freed or used by
3893 the programmer after giving it to sv_usepvn. Does not handle 'set' magic.
3894 See C<sv_usepvn_mg>.
3900 Perl_sv_usepvn(pTHX_ register SV *sv, register char *ptr, register STRLEN len)
3904 SV_CHECK_THINKFIRST_COW_DROP(sv);
3905 SvUPGRADE(sv, SVt_PV);
3910 if (SvPVX_const(sv))
3913 allocate = PERL_STRLEN_ROUNDUP(len + 1);
3914 ptr = saferealloc (ptr, allocate);
3917 SvLEN_set(sv, allocate);
3919 (void)SvPOK_only_UTF8(sv); /* validate pointer */
3924 =for apidoc sv_usepvn_mg
3926 Like C<sv_usepvn>, but also handles 'set' magic.
3932 Perl_sv_usepvn_mg(pTHX_ register SV *sv, register char *ptr, register STRLEN len)
3934 sv_usepvn(sv,ptr,len);
3938 #ifdef PERL_OLD_COPY_ON_WRITE
3939 /* Need to do this *after* making the SV normal, as we need the buffer
3940 pointer to remain valid until after we've copied it. If we let go too early,
3941 another thread could invalidate it by unsharing last of the same hash key
3942 (which it can do by means other than releasing copy-on-write Svs)
3943 or by changing the other copy-on-write SVs in the loop. */
3945 S_sv_release_COW(pTHX_ register SV *sv, const char *pvx, STRLEN len, SV *after)
3947 if (len) { /* this SV was SvIsCOW_normal(sv) */
3948 /* we need to find the SV pointing to us. */
3949 SV *current = SV_COW_NEXT_SV(after);
3951 if (current == sv) {
3952 /* The SV we point to points back to us (there were only two of us
3954 Hence other SV is no longer copy on write either. */
3956 SvREADONLY_off(after);
3958 /* We need to follow the pointers around the loop. */
3960 while ((next = SV_COW_NEXT_SV(current)) != sv) {
3963 /* don't loop forever if the structure is bust, and we have
3964 a pointer into a closed loop. */
3965 assert (current != after);
3966 assert (SvPVX_const(current) == pvx);
3968 /* Make the SV before us point to the SV after us. */
3969 SV_COW_NEXT_SV_SET(current, after);
3972 unshare_hek(SvSHARED_HEK_FROM_PV(pvx));
3977 Perl_sv_release_IVX(pTHX_ register SV *sv)
3980 sv_force_normal_flags(sv, 0);
3986 =for apidoc sv_force_normal_flags
3988 Undo various types of fakery on an SV: if the PV is a shared string, make
3989 a private copy; if we're a ref, stop refing; if we're a glob, downgrade to
3990 an xpvmg; if we're a copy-on-write scalar, this is the on-write time when
3991 we do the copy, and is also used locally. If C<SV_COW_DROP_PV> is set
3992 then a copy-on-write scalar drops its PV buffer (if any) and becomes
3993 SvPOK_off rather than making a copy. (Used where this scalar is about to be
3994 set to some other value.) In addition, the C<flags> parameter gets passed to
3995 C<sv_unref_flags()> when unrefing. C<sv_force_normal> calls this function
3996 with flags set to 0.
4002 Perl_sv_force_normal_flags(pTHX_ register SV *sv, U32 flags)
4005 #ifdef PERL_OLD_COPY_ON_WRITE
4006 if (SvREADONLY(sv)) {
4007 /* At this point I believe I should acquire a global SV mutex. */
4009 const char * const pvx = SvPVX_const(sv);
4010 const STRLEN len = SvLEN(sv);
4011 const STRLEN cur = SvCUR(sv);
4012 SV * const next = SV_COW_NEXT_SV(sv); /* next COW sv in the loop. */
4014 PerlIO_printf(Perl_debug_log,
4015 "Copy on write: Force normal %ld\n",
4021 /* This SV doesn't own the buffer, so need to Newx() a new one: */
4024 if (flags & SV_COW_DROP_PV) {
4025 /* OK, so we don't need to copy our buffer. */
4028 SvGROW(sv, cur + 1);
4029 Move(pvx,SvPVX(sv),cur,char);
4033 sv_release_COW(sv, pvx, len, next);
4038 else if (IN_PERL_RUNTIME)
4039 Perl_croak(aTHX_ PL_no_modify);
4040 /* At this point I believe that I can drop the global SV mutex. */
4043 if (SvREADONLY(sv)) {
4045 const char * const pvx = SvPVX_const(sv);
4046 const STRLEN len = SvCUR(sv);
4051 SvGROW(sv, len + 1);
4052 Move(pvx,SvPVX(sv),len,char);
4054 unshare_hek(SvSHARED_HEK_FROM_PV(pvx));
4056 else if (IN_PERL_RUNTIME)
4057 Perl_croak(aTHX_ PL_no_modify);
4061 sv_unref_flags(sv, flags);
4062 else if (SvFAKE(sv) && SvTYPE(sv) == SVt_PVGV)
4069 Efficient removal of characters from the beginning of the string buffer.
4070 SvPOK(sv) must be true and the C<ptr> must be a pointer to somewhere inside
4071 the string buffer. The C<ptr> becomes the first character of the adjusted
4072 string. Uses the "OOK hack".
4073 Beware: after this function returns, C<ptr> and SvPVX_const(sv) may no longer
4074 refer to the same chunk of data.
4080 Perl_sv_chop(pTHX_ register SV *sv, register const char *ptr)
4082 register STRLEN delta;
4083 if (!ptr || !SvPOKp(sv))
4085 delta = ptr - SvPVX_const(sv);
4086 SV_CHECK_THINKFIRST(sv);
4087 if (SvTYPE(sv) < SVt_PVIV)
4088 sv_upgrade(sv,SVt_PVIV);
4091 if (!SvLEN(sv)) { /* make copy of shared string */
4092 const char *pvx = SvPVX_const(sv);
4093 const STRLEN len = SvCUR(sv);
4094 SvGROW(sv, len + 1);
4095 Move(pvx,SvPVX(sv),len,char);
4099 /* Same SvOOK_on but SvOOK_on does a SvIOK_off
4100 and we do that anyway inside the SvNIOK_off
4102 SvFLAGS(sv) |= SVf_OOK;
4105 SvLEN_set(sv, SvLEN(sv) - delta);
4106 SvCUR_set(sv, SvCUR(sv) - delta);
4107 SvPV_set(sv, SvPVX(sv) + delta);
4108 SvIV_set(sv, SvIVX(sv) + delta);
4112 =for apidoc sv_catpvn
4114 Concatenates the string onto the end of the string which is in the SV. The
4115 C<len> indicates number of bytes to copy. If the SV has the UTF-8
4116 status set, then the bytes appended should be valid UTF-8.
4117 Handles 'get' magic, but not 'set' magic. See C<sv_catpvn_mg>.
4119 =for apidoc sv_catpvn_flags
4121 Concatenates the string onto the end of the string which is in the SV. The
4122 C<len> indicates number of bytes to copy. If the SV has the UTF-8
4123 status set, then the bytes appended should be valid UTF-8.
4124 If C<flags> has C<SV_GMAGIC> bit set, will C<mg_get> on C<dsv> if
4125 appropriate, else not. C<sv_catpvn> and C<sv_catpvn_nomg> are implemented
4126 in terms of this function.
4132 Perl_sv_catpvn_flags(pTHX_ register SV *dsv, register const char *sstr, register STRLEN slen, I32 flags)
4136 const char * const dstr = SvPV_force_flags(dsv, dlen, flags);
4138 SvGROW(dsv, dlen + slen + 1);
4140 sstr = SvPVX_const(dsv);
4141 Move(sstr, SvPVX(dsv) + dlen, slen, char);
4142 SvCUR_set(dsv, SvCUR(dsv) + slen);
4144 (void)SvPOK_only_UTF8(dsv); /* validate pointer */
4146 if (flags & SV_SMAGIC)
4151 =for apidoc sv_catsv
4153 Concatenates the string from SV C<ssv> onto the end of the string in
4154 SV C<dsv>. Modifies C<dsv> but not C<ssv>. Handles 'get' magic, but
4155 not 'set' magic. See C<sv_catsv_mg>.
4157 =for apidoc sv_catsv_flags
4159 Concatenates the string from SV C<ssv> onto the end of the string in
4160 SV C<dsv>. Modifies C<dsv> but not C<ssv>. If C<flags> has C<SV_GMAGIC>
4161 bit set, will C<mg_get> on the SVs if appropriate, else not. C<sv_catsv>
4162 and C<sv_catsv_nomg> are implemented in terms of this function.
4167 Perl_sv_catsv_flags(pTHX_ SV *dsv, register SV *ssv, I32 flags)
4172 const char *spv = SvPV_const(ssv, slen);
4174 /* sutf8 and dutf8 were type bool, but under USE_ITHREADS,
4175 gcc version 2.95.2 20000220 (Debian GNU/Linux) for
4176 Linux xxx 2.2.17 on sparc64 with gcc -O2, we erroneously
4177 get dutf8 = 0x20000000, (i.e. SVf_UTF8) even though
4178 dsv->sv_flags doesn't have that bit set.
4179 Andy Dougherty 12 Oct 2001
4181 const I32 sutf8 = DO_UTF8(ssv);
4184 if (SvGMAGICAL(dsv) && (flags & SV_GMAGIC))
4186 dutf8 = DO_UTF8(dsv);
4188 if (dutf8 != sutf8) {
4190 /* Not modifying source SV, so taking a temporary copy. */
4191 SV* const csv = sv_2mortal(newSVpvn(spv, slen));
4193 sv_utf8_upgrade(csv);
4194 spv = SvPV_const(csv, slen);
4197 sv_utf8_upgrade_nomg(dsv);
4199 sv_catpvn_nomg(dsv, spv, slen);
4202 if (flags & SV_SMAGIC)
4207 =for apidoc sv_catpv
4209 Concatenates the string onto the end of the string which is in the SV.
4210 If the SV has the UTF-8 status set, then the bytes appended should be
4211 valid UTF-8. Handles 'get' magic, but not 'set' magic. See C<sv_catpv_mg>.
4216 Perl_sv_catpv(pTHX_ register SV *sv, register const char *ptr)
4219 register STRLEN len;
4225 junk = SvPV_force(sv, tlen);
4227 SvGROW(sv, tlen + len + 1);
4229 ptr = SvPVX_const(sv);
4230 Move(ptr,SvPVX(sv)+tlen,len+1,char);
4231 SvCUR_set(sv, SvCUR(sv) + len);
4232 (void)SvPOK_only_UTF8(sv); /* validate pointer */
4237 =for apidoc sv_catpv_mg
4239 Like C<sv_catpv>, but also handles 'set' magic.
4245 Perl_sv_catpv_mg(pTHX_ register SV *sv, register const char *ptr)
4254 Creates a new SV. A non-zero C<len> parameter indicates the number of
4255 bytes of preallocated string space the SV should have. An extra byte for a
4256 trailing NUL is also reserved. (SvPOK is not set for the SV even if string
4257 space is allocated.) The reference count for the new SV is set to 1.
4259 In 5.9.3, newSV() replaces the older NEWSV() API, and drops the first
4260 parameter, I<x>, a debug aid which allowed callers to identify themselves.
4261 This aid has been superseded by a new build option, PERL_MEM_LOG (see
4262 L<perlhack/PERL_MEM_LOG>). The older API is still there for use in XS
4263 modules supporting older perls.
4269 Perl_newSV(pTHX_ STRLEN len)
4276 sv_upgrade(sv, SVt_PV);
4277 SvGROW(sv, len + 1);
4282 =for apidoc sv_magicext
4284 Adds magic to an SV, upgrading it if necessary. Applies the
4285 supplied vtable and returns a pointer to the magic added.
4287 Note that C<sv_magicext> will allow things that C<sv_magic> will not.
4288 In particular, you can add magic to SvREADONLY SVs, and add more than
4289 one instance of the same 'how'.
4291 If C<namlen> is greater than zero then a C<savepvn> I<copy> of C<name> is
4292 stored, if C<namlen> is zero then C<name> is stored as-is and - as another
4293 special case - if C<(name && namlen == HEf_SVKEY)> then C<name> is assumed
4294 to contain an C<SV*> and is stored as-is with its REFCNT incremented.
4296 (This is now used as a subroutine by C<sv_magic>.)
4301 Perl_sv_magicext(pTHX_ SV* sv, SV* obj, int how, MGVTBL *vtable,
4302 const char* name, I32 namlen)
4307 if (SvTYPE(sv) < SVt_PVMG) {
4308 SvUPGRADE(sv, SVt_PVMG);
4310 Newxz(mg, 1, MAGIC);
4311 mg->mg_moremagic = SvMAGIC(sv);
4312 SvMAGIC_set(sv, mg);
4314 /* Sometimes a magic contains a reference loop, where the sv and
4315 object refer to each other. To prevent a reference loop that
4316 would prevent such objects being freed, we look for such loops
4317 and if we find one we avoid incrementing the object refcount.
4319 Note we cannot do this to avoid self-tie loops as intervening RV must
4320 have its REFCNT incremented to keep it in existence.
4323 if (!obj || obj == sv ||
4324 how == PERL_MAGIC_arylen ||
4325 how == PERL_MAGIC_qr ||
4326 how == PERL_MAGIC_symtab ||
4327 (SvTYPE(obj) == SVt_PVGV &&
4328 (GvSV(obj) == sv || GvHV(obj) == (HV*)sv || GvAV(obj) == (AV*)sv ||
4329 GvCV(obj) == (CV*)sv || GvIOp(obj) == (IO*)sv ||
4330 GvFORM(obj) == (CV*)sv)))
4335 mg->mg_obj = SvREFCNT_inc(obj);
4336 mg->mg_flags |= MGf_REFCOUNTED;
4339 /* Normal self-ties simply pass a null object, and instead of
4340 using mg_obj directly, use the SvTIED_obj macro to produce a
4341 new RV as needed. For glob "self-ties", we are tieing the PVIO
4342 with an RV obj pointing to the glob containing the PVIO. In
4343 this case, to avoid a reference loop, we need to weaken the
4347 if (how == PERL_MAGIC_tiedscalar && SvTYPE(sv) == SVt_PVIO &&
4348 obj && SvROK(obj) && GvIO(SvRV(obj)) == (IO*)sv)
4354 mg->mg_len = namlen;
4357 mg->mg_ptr = savepvn(name, namlen);
4358 else if (namlen == HEf_SVKEY)
4359 mg->mg_ptr = (char*)SvREFCNT_inc((SV*)name);
4361 mg->mg_ptr = (char *) name;
4363 mg->mg_virtual = vtable;
4367 SvFLAGS(sv) &= ~(SVf_IOK|SVf_NOK|SVf_POK);
4372 =for apidoc sv_magic
4374 Adds magic to an SV. First upgrades C<sv> to type C<SVt_PVMG> if necessary,
4375 then adds a new magic item of type C<how> to the head of the magic list.
4377 See C<sv_magicext> (which C<sv_magic> now calls) for a description of the
4378 handling of the C<name> and C<namlen> arguments.
4380 You need to use C<sv_magicext> to add magic to SvREADONLY SVs and also
4381 to add more than one instance of the same 'how'.
4387 Perl_sv_magic(pTHX_ register SV *sv, SV *obj, int how, const char *name, I32 namlen)
4393 #ifdef PERL_OLD_COPY_ON_WRITE
4395 sv_force_normal_flags(sv, 0);
4397 if (SvREADONLY(sv)) {
4399 /* its okay to attach magic to shared strings; the subsequent
4400 * upgrade to PVMG will unshare the string */
4401 !(SvFAKE(sv) && SvTYPE(sv) < SVt_PVMG)
4404 && how != PERL_MAGIC_regex_global
4405 && how != PERL_MAGIC_bm
4406 && how != PERL_MAGIC_fm
4407 && how != PERL_MAGIC_sv
4408 && how != PERL_MAGIC_backref
4411 Perl_croak(aTHX_ PL_no_modify);
4414 if (SvMAGICAL(sv) || (how == PERL_MAGIC_taint && SvTYPE(sv) >= SVt_PVMG)) {
4415 if (SvMAGIC(sv) && (mg = mg_find(sv, how))) {
4416 /* sv_magic() refuses to add a magic of the same 'how' as an
4419 if (how == PERL_MAGIC_taint) {
4421 /* Any scalar which already had taint magic on which someone
4422 (erroneously?) did SvIOK_on() or similar will now be
4423 incorrectly sporting public "OK" flags. */
4424 SvFLAGS(sv) &= ~(SVf_IOK|SVf_NOK|SVf_POK);
4432 vtable = &PL_vtbl_sv;
4434 case PERL_MAGIC_overload:
4435 vtable = &PL_vtbl_amagic;
4437 case PERL_MAGIC_overload_elem:
4438 vtable = &PL_vtbl_amagicelem;
4440 case PERL_MAGIC_overload_table:
4441 vtable = &PL_vtbl_ovrld;
4444 vtable = &PL_vtbl_bm;
4446 case PERL_MAGIC_regdata:
4447 vtable = &PL_vtbl_regdata;
4449 case PERL_MAGIC_regdatum:
4450 vtable = &PL_vtbl_regdatum;
4452 case PERL_MAGIC_env:
4453 vtable = &PL_vtbl_env;
4456 vtable = &PL_vtbl_fm;
4458 case PERL_MAGIC_envelem:
4459 vtable = &PL_vtbl_envelem;
4461 case PERL_MAGIC_regex_global:
4462 vtable = &PL_vtbl_mglob;
4464 case PERL_MAGIC_isa:
4465 vtable = &PL_vtbl_isa;
4467 case PERL_MAGIC_isaelem:
4468 vtable = &PL_vtbl_isaelem;
4470 case PERL_MAGIC_nkeys:
4471 vtable = &PL_vtbl_nkeys;
4473 case PERL_MAGIC_dbfile:
4476 case PERL_MAGIC_dbline:
4477 vtable = &PL_vtbl_dbline;
4479 #ifdef USE_LOCALE_COLLATE
4480 case PERL_MAGIC_collxfrm:
4481 vtable = &PL_vtbl_collxfrm;
4483 #endif /* USE_LOCALE_COLLATE */
4484 case PERL_MAGIC_tied:
4485 vtable = &PL_vtbl_pack;
4487 case PERL_MAGIC_tiedelem:
4488 case PERL_MAGIC_tiedscalar:
4489 vtable = &PL_vtbl_packelem;
4492 vtable = &PL_vtbl_regexp;
4494 case PERL_MAGIC_sig:
4495 vtable = &PL_vtbl_sig;
4497 case PERL_MAGIC_sigelem:
4498 vtable = &PL_vtbl_sigelem;
4500 case PERL_MAGIC_taint:
4501 vtable = &PL_vtbl_taint;
4503 case PERL_MAGIC_uvar:
4504 vtable = &PL_vtbl_uvar;
4506 case PERL_MAGIC_vec:
4507 vtable = &PL_vtbl_vec;
4509 case PERL_MAGIC_arylen_p:
4510 case PERL_MAGIC_rhash:
4511 case PERL_MAGIC_symtab:
4512 case PERL_MAGIC_vstring:
4515 case PERL_MAGIC_utf8:
4516 vtable = &PL_vtbl_utf8;
4518 case PERL_MAGIC_substr:
4519 vtable = &PL_vtbl_substr;
4521 case PERL_MAGIC_defelem:
4522 vtable = &PL_vtbl_defelem;
4524 case PERL_MAGIC_arylen:
4525 vtable = &PL_vtbl_arylen;
4527 case PERL_MAGIC_pos:
4528 vtable = &PL_vtbl_pos;
4530 case PERL_MAGIC_backref:
4531 vtable = &PL_vtbl_backref;
4533 case PERL_MAGIC_ext:
4534 /* Reserved for use by extensions not perl internals. */
4535 /* Useful for attaching extension internal data to perl vars. */
4536 /* Note that multiple extensions may clash if magical scalars */
4537 /* etc holding private data from one are passed to another. */
4541 Perl_croak(aTHX_ "Don't know how to handle magic of type \\%o", how);
4544 /* Rest of work is done else where */
4545 mg = sv_magicext(sv,obj,how,vtable,name,namlen);
4548 case PERL_MAGIC_taint:
4551 case PERL_MAGIC_ext:
4552 case PERL_MAGIC_dbfile:
4559 =for apidoc sv_unmagic
4561 Removes all magic of type C<type> from an SV.
4567 Perl_sv_unmagic(pTHX_ SV *sv, int type)
4571 if (SvTYPE(sv) < SVt_PVMG || !SvMAGIC(sv))
4574 for (mg = *mgp; mg; mg = *mgp) {
4575 if (mg->mg_type == type) {
4576 const MGVTBL* const vtbl = mg->mg_virtual;
4577 *mgp = mg->mg_moremagic;
4578 if (vtbl && vtbl->svt_free)
4579 CALL_FPTR(vtbl->svt_free)(aTHX_ sv, mg);
4580 if (mg->mg_ptr && mg->mg_type != PERL_MAGIC_regex_global) {
4582 Safefree(mg->mg_ptr);
4583 else if (mg->mg_len == HEf_SVKEY)
4584 SvREFCNT_dec((SV*)mg->mg_ptr);
4585 else if (mg->mg_type == PERL_MAGIC_utf8 && mg->mg_ptr)
4586 Safefree(mg->mg_ptr);
4588 if (mg->mg_flags & MGf_REFCOUNTED)
4589 SvREFCNT_dec(mg->mg_obj);
4593 mgp = &mg->mg_moremagic;
4597 SvFLAGS(sv) |= (SvFLAGS(sv) & (SVp_IOK|SVp_NOK|SVp_POK)) >> PRIVSHIFT;
4598 SvMAGIC_set(sv, NULL);
4605 =for apidoc sv_rvweaken
4607 Weaken a reference: set the C<SvWEAKREF> flag on this RV; give the
4608 referred-to SV C<PERL_MAGIC_backref> magic if it hasn't already; and
4609 push a back-reference to this RV onto the array of backreferences
4610 associated with that magic.
4616 Perl_sv_rvweaken(pTHX_ SV *sv)
4619 if (!SvOK(sv)) /* let undefs pass */
4622 Perl_croak(aTHX_ "Can't weaken a nonreference");
4623 else if (SvWEAKREF(sv)) {
4624 if (ckWARN(WARN_MISC))
4625 Perl_warner(aTHX_ packWARN(WARN_MISC), "Reference is already weak");
4629 Perl_sv_add_backref(aTHX_ tsv, sv);
4635 /* Give tsv backref magic if it hasn't already got it, then push a
4636 * back-reference to sv onto the array associated with the backref magic.
4640 Perl_sv_add_backref(pTHX_ SV *tsv, SV *sv)
4645 if (SvTYPE(tsv) == SVt_PVHV) {
4646 AV **const avp = Perl_hv_backreferences_p(aTHX_ (HV*)tsv);
4650 /* There is no AV in the offical place - try a fixup. */
4651 MAGIC *const mg = mg_find(tsv, PERL_MAGIC_backref);
4654 /* Aha. They've got it stowed in magic. Bring it back. */
4655 av = (AV*)mg->mg_obj;
4656 /* Stop mg_free decreasing the refernce count. */
4658 /* Stop mg_free even calling the destructor, given that
4659 there's no AV to free up. */
4661 sv_unmagic(tsv, PERL_MAGIC_backref);
4670 const MAGIC *const mg
4671 = SvMAGICAL(tsv) ? mg_find(tsv, PERL_MAGIC_backref) : NULL;
4673 av = (AV*)mg->mg_obj;
4677 sv_magic(tsv, (SV*)av, PERL_MAGIC_backref, NULL, 0);
4678 /* av now has a refcnt of 2, which avoids it getting freed
4679 * before us during global cleanup. The extra ref is removed
4680 * by magic_killbackrefs() when tsv is being freed */
4683 if (AvFILLp(av) >= AvMAX(av)) {
4684 av_extend(av, AvFILLp(av)+1);
4686 AvARRAY(av)[++AvFILLp(av)] = sv; /* av_push() */
4689 /* delete a back-reference to ourselves from the backref magic associated
4690 * with the SV we point to.
4694 S_sv_del_backref(pTHX_ SV *tsv, SV *sv)
4701 if (SvTYPE(tsv) == SVt_PVHV && SvOOK(tsv)) {
4702 av = *Perl_hv_backreferences_p(aTHX_ (HV*)tsv);
4703 /* We mustn't attempt to "fix up" the hash here by moving the
4704 backreference array back to the hv_aux structure, as that is stored
4705 in the main HvARRAY(), and hfreentries assumes that no-one
4706 reallocates HvARRAY() while it is running. */
4709 const MAGIC *const mg
4710 = SvMAGICAL(tsv) ? mg_find(tsv, PERL_MAGIC_backref) : NULL;
4712 av = (AV *)mg->mg_obj;
4715 if (PL_in_clean_all)
4717 Perl_croak(aTHX_ "panic: del_backref");
4724 /* We shouldn't be in here more than once, but for paranoia reasons lets
4726 for (i = AvFILLp(av); i >= 0; i--) {
4728 const SSize_t fill = AvFILLp(av);
4730 /* We weren't the last entry.
4731 An unordered list has this property that you can take the
4732 last element off the end to fill the hole, and it's still
4733 an unordered list :-)
4738 AvFILLp(av) = fill - 1;
4744 Perl_sv_kill_backrefs(pTHX_ SV *sv, AV *av)
4746 SV **svp = AvARRAY(av);
4748 PERL_UNUSED_ARG(sv);
4750 /* Not sure why the av can get freed ahead of its sv, but somehow it does
4751 in ext/B/t/bytecode.t test 15 (involving print <DATA>) */
4752 if (svp && !SvIS_FREED(av)) {
4753 SV *const *const last = svp + AvFILLp(av);
4755 while (svp <= last) {
4757 SV *const referrer = *svp;
4758 if (SvWEAKREF(referrer)) {
4759 /* XXX Should we check that it hasn't changed? */
4760 SvRV_set(referrer, 0);
4762 SvWEAKREF_off(referrer);
4763 } else if (SvTYPE(referrer) == SVt_PVGV ||
4764 SvTYPE(referrer) == SVt_PVLV) {
4765 /* You lookin' at me? */
4766 assert(GvSTASH(referrer));
4767 assert(GvSTASH(referrer) == (HV*)sv);
4768 GvSTASH(referrer) = 0;
4771 "panic: magic_killbackrefs (flags=%"UVxf")",
4772 (UV)SvFLAGS(referrer));
4780 SvREFCNT_dec(av); /* remove extra count added by sv_add_backref() */
4785 =for apidoc sv_insert
4787 Inserts a string at the specified offset/length within the SV. Similar to
4788 the Perl substr() function.
4794 Perl_sv_insert(pTHX_ SV *bigstr, STRLEN offset, STRLEN len, const char *little, STRLEN littlelen)
4799 register char *midend;
4800 register char *bigend;
4806 Perl_croak(aTHX_ "Can't modify non-existent substring");
4807 SvPV_force(bigstr, curlen);
4808 (void)SvPOK_only_UTF8(bigstr);
4809 if (offset + len > curlen) {
4810 SvGROW(bigstr, offset+len+1);
4811 Zero(SvPVX(bigstr)+curlen, offset+len-curlen, char);
4812 SvCUR_set(bigstr, offset+len);
4816 i = littlelen - len;
4817 if (i > 0) { /* string might grow */
4818 big = SvGROW(bigstr, SvCUR(bigstr) + i + 1);
4819 mid = big + offset + len;
4820 midend = bigend = big + SvCUR(bigstr);
4823 while (midend > mid) /* shove everything down */
4824 *--bigend = *--midend;
4825 Move(little,big+offset,littlelen,char);
4826 SvCUR_set(bigstr, SvCUR(bigstr) + i);
4831 Move(little,SvPVX(bigstr)+offset,len,char);
4836 big = SvPVX(bigstr);
4839 bigend = big + SvCUR(bigstr);
4841 if (midend > bigend)
4842 Perl_croak(aTHX_ "panic: sv_insert");
4844 if (mid - big > bigend - midend) { /* faster to shorten from end */
4846 Move(little, mid, littlelen,char);
4849 i = bigend - midend;
4851 Move(midend, mid, i,char);
4855 SvCUR_set(bigstr, mid - big);
4857 else if ((i = mid - big)) { /* faster from front */
4858 midend -= littlelen;
4860 sv_chop(bigstr,midend-i);
4865 Move(little, mid, littlelen,char);
4867 else if (littlelen) {
4868 midend -= littlelen;
4869 sv_chop(bigstr,midend);
4870 Move(little,midend,littlelen,char);
4873 sv_chop(bigstr,midend);
4879 =for apidoc sv_replace
4881 Make the first argument a copy of the second, then delete the original.
4882 The target SV physically takes over ownership of the body of the source SV
4883 and inherits its flags; however, the target keeps any magic it owns,
4884 and any magic in the source is discarded.
4885 Note that this is a rather specialist SV copying operation; most of the
4886 time you'll want to use C<sv_setsv> or one of its many macro front-ends.
4892 Perl_sv_replace(pTHX_ register SV *sv, register SV *nsv)
4895 const U32 refcnt = SvREFCNT(sv);
4896 SV_CHECK_THINKFIRST_COW_DROP(sv);
4897 if (SvREFCNT(nsv) != 1) {
4898 Perl_croak(aTHX_ "panic: reference miscount on nsv in sv_replace() (%"
4899 UVuf " != 1)", (UV) SvREFCNT(nsv));
4901 if (SvMAGICAL(sv)) {
4905 sv_upgrade(nsv, SVt_PVMG);
4906 SvMAGIC_set(nsv, SvMAGIC(sv));
4907 SvFLAGS(nsv) |= SvMAGICAL(sv);
4909 SvMAGIC_set(sv, NULL);
4913 assert(!SvREFCNT(sv));
4914 #ifdef DEBUG_LEAKING_SCALARS
4915 sv->sv_flags = nsv->sv_flags;
4916 sv->sv_any = nsv->sv_any;
4917 sv->sv_refcnt = nsv->sv_refcnt;
4918 sv->sv_u = nsv->sv_u;
4920 StructCopy(nsv,sv,SV);
4922 /* Currently could join these into one piece of pointer arithmetic, but
4923 it would be unclear. */
4924 if(SvTYPE(sv) == SVt_IV)
4926 = (XPVIV*)((char*)&(sv->sv_u.svu_iv) - STRUCT_OFFSET(XPVIV, xiv_iv));
4927 else if (SvTYPE(sv) == SVt_RV) {
4928 SvANY(sv) = &sv->sv_u.svu_rv;
4932 #ifdef PERL_OLD_COPY_ON_WRITE
4933 if (SvIsCOW_normal(nsv)) {
4934 /* We need to follow the pointers around the loop to make the
4935 previous SV point to sv, rather than nsv. */
4938 while ((next = SV_COW_NEXT_SV(current)) != nsv) {
4941 assert(SvPVX_const(current) == SvPVX_const(nsv));
4943 /* Make the SV before us point to the SV after us. */
4945 PerlIO_printf(Perl_debug_log, "previous is\n");
4947 PerlIO_printf(Perl_debug_log,
4948 "move it from 0x%"UVxf" to 0x%"UVxf"\n",
4949 (UV) SV_COW_NEXT_SV(current), (UV) sv);
4951 SV_COW_NEXT_SV_SET(current, sv);
4954 SvREFCNT(sv) = refcnt;
4955 SvFLAGS(nsv) |= SVTYPEMASK; /* Mark as freed */
4961 =for apidoc sv_clear
4963 Clear an SV: call any destructors, free up any memory used by the body,
4964 and free the body itself. The SV's head is I<not> freed, although
4965 its type is set to all 1's so that it won't inadvertently be assumed
4966 to be live during global destruction etc.
4967 This function should only be called when REFCNT is zero. Most of the time
4968 you'll want to call C<sv_free()> (or its macro wrapper C<SvREFCNT_dec>)
4975 Perl_sv_clear(pTHX_ register SV *sv)
4978 const U32 type = SvTYPE(sv);
4979 const struct body_details *const sv_type_details
4980 = bodies_by_type + type;
4983 assert(SvREFCNT(sv) == 0);
4985 if (type <= SVt_IV) {
4986 /* See the comment in sv.h about the collusion between this early
4987 return and the overloading of the NULL and IV slots in the size
4993 if (PL_defstash) { /* Still have a symbol table? */
4998 stash = SvSTASH(sv);
4999 destructor = StashHANDLER(stash,DESTROY);
5001 SV* const tmpref = newRV(sv);
5002 SvREADONLY_on(tmpref); /* DESTROY() could be naughty */
5004 PUSHSTACKi(PERLSI_DESTROY);
5009 call_sv((SV*)destructor, G_DISCARD|G_EVAL|G_KEEPERR|G_VOID);
5015 if(SvREFCNT(tmpref) < 2) {
5016 /* tmpref is not kept alive! */
5018 SvRV_set(tmpref, NULL);
5021 SvREFCNT_dec(tmpref);
5023 } while (SvOBJECT(sv) && SvSTASH(sv) != stash);
5027 if (PL_in_clean_objs)
5028 Perl_croak(aTHX_ "DESTROY created new reference to dead object '%s'",
5030 /* DESTROY gave object new lease on life */
5036 SvREFCNT_dec(SvSTASH(sv)); /* possibly of changed persuasion */
5037 SvOBJECT_off(sv); /* Curse the object. */
5038 if (type != SVt_PVIO)
5039 --PL_sv_objcount; /* XXX Might want something more general */
5042 if (type >= SVt_PVMG) {
5045 if (type == SVt_PVMG && SvFLAGS(sv) & SVpad_TYPED)
5046 SvREFCNT_dec(SvSTASH(sv));
5051 IoIFP(sv) != PerlIO_stdin() &&
5052 IoIFP(sv) != PerlIO_stdout() &&
5053 IoIFP(sv) != PerlIO_stderr())
5055 io_close((IO*)sv, FALSE);
5057 if (IoDIRP(sv) && !(IoFLAGS(sv) & IOf_FAKE_DIRP))
5058 PerlDir_close(IoDIRP(sv));
5059 IoDIRP(sv) = (DIR*)NULL;
5060 Safefree(IoTOP_NAME(sv));
5061 Safefree(IoFMT_NAME(sv));
5062 Safefree(IoBOTTOM_NAME(sv));
5071 Perl_hv_kill_backrefs(aTHX_ (HV*)sv);
5078 if (LvTYPE(sv) == 'T') { /* for tie: return HE to pool */
5079 SvREFCNT_dec(HeKEY_sv((HE*)LvTARG(sv)));
5080 HeNEXT((HE*)LvTARG(sv)) = PL_hv_fetch_ent_mh;
5081 PL_hv_fetch_ent_mh = (HE*)LvTARG(sv);
5083 else if (LvTYPE(sv) != 't') /* unless tie: unrefcnted fake SV** */
5084 SvREFCNT_dec(LvTARG(sv));
5088 Safefree(GvNAME(sv));
5089 /* If we're in a stash, we don't own a reference to it. However it does
5090 have a back reference to us, which needs to be cleared. */
5092 sv_del_backref((SV*)GvSTASH(sv), sv);
5097 /* Don't bother with SvOOK_off(sv); as we're only going to free it. */
5099 SvPV_set(sv, SvPVX_mutable(sv) - SvIVX(sv));
5100 /* Don't even bother with turning off the OOK flag. */
5105 SV *target = SvRV(sv);
5107 sv_del_backref(target, sv);
5109 SvREFCNT_dec(target);
5111 #ifdef PERL_OLD_COPY_ON_WRITE
5112 else if (SvPVX_const(sv)) {
5114 /* I believe I need to grab the global SV mutex here and
5115 then recheck the COW status. */
5117 PerlIO_printf(Perl_debug_log, "Copy on write: clear\n");
5120 sv_release_COW(sv, SvPVX_const(sv), SvLEN(sv),
5121 SV_COW_NEXT_SV(sv));
5122 /* And drop it here. */
5124 } else if (SvLEN(sv)) {
5125 Safefree(SvPVX_const(sv));
5129 else if (SvPVX_const(sv) && SvLEN(sv))
5130 Safefree(SvPVX_mutable(sv));
5131 else if (SvPVX_const(sv) && SvREADONLY(sv) && SvFAKE(sv)) {
5132 unshare_hek(SvSHARED_HEK_FROM_PV(SvPVX_const(sv)));
5141 SvFLAGS(sv) &= SVf_BREAK;
5142 SvFLAGS(sv) |= SVTYPEMASK;
5144 if (sv_type_details->arena) {
5145 del_body(((char *)SvANY(sv) + sv_type_details->offset),
5146 &PL_body_roots[type]);
5148 else if (sv_type_details->body_size) {
5149 my_safefree(SvANY(sv));
5154 =for apidoc sv_newref
5156 Increment an SV's reference count. Use the C<SvREFCNT_inc()> wrapper
5163 Perl_sv_newref(pTHX_ SV *sv)
5173 Decrement an SV's reference count, and if it drops to zero, call
5174 C<sv_clear> to invoke destructors and free up any memory used by
5175 the body; finally, deallocate the SV's head itself.
5176 Normally called via a wrapper macro C<SvREFCNT_dec>.
5182 Perl_sv_free(pTHX_ SV *sv)
5187 if (SvREFCNT(sv) == 0) {
5188 if (SvFLAGS(sv) & SVf_BREAK)
5189 /* this SV's refcnt has been artificially decremented to
5190 * trigger cleanup */
5192 if (PL_in_clean_all) /* All is fair */
5194 if (SvREADONLY(sv) && SvIMMORTAL(sv)) {
5195 /* make sure SvREFCNT(sv)==0 happens very seldom */
5196 SvREFCNT(sv) = (~(U32)0)/2;
5199 if (ckWARN_d(WARN_INTERNAL)) {
5200 Perl_warner(aTHX_ packWARN(WARN_INTERNAL),
5201 "Attempt to free unreferenced scalar: SV 0x%"UVxf
5202 pTHX__FORMAT, PTR2UV(sv) pTHX__VALUE);
5203 #ifdef DEBUG_LEAKING_SCALARS_FORK_DUMP
5204 Perl_dump_sv_child(aTHX_ sv);
5209 if (--(SvREFCNT(sv)) > 0)
5211 Perl_sv_free2(aTHX_ sv);
5215 Perl_sv_free2(pTHX_ SV *sv)
5220 if (ckWARN_d(WARN_DEBUGGING))
5221 Perl_warner(aTHX_ packWARN(WARN_DEBUGGING),
5222 "Attempt to free temp prematurely: SV 0x%"UVxf
5223 pTHX__FORMAT, PTR2UV(sv) pTHX__VALUE);
5227 if (SvREADONLY(sv) && SvIMMORTAL(sv)) {
5228 /* make sure SvREFCNT(sv)==0 happens very seldom */
5229 SvREFCNT(sv) = (~(U32)0)/2;
5240 Returns the length of the string in the SV. Handles magic and type
5241 coercion. See also C<SvCUR>, which gives raw access to the xpv_cur slot.
5247 Perl_sv_len(pTHX_ register SV *sv)
5255 len = mg_length(sv);
5257 (void)SvPV_const(sv, len);
5262 =for apidoc sv_len_utf8
5264 Returns the number of characters in the string in an SV, counting wide
5265 UTF-8 bytes as a single character. Handles magic and type coercion.
5271 * The length is cached in PERL_UTF8_magic, in the mg_len field. Also the
5272 * mg_ptr is used, by sv_pos_u2b(), see the comments of S_utf8_mg_pos_init().
5273 * (Note that the mg_len is not the length of the mg_ptr field.)
5278 Perl_sv_len_utf8(pTHX_ register SV *sv)
5284 return mg_length(sv);
5288 const U8 *s = (U8*)SvPV_const(sv, len);
5289 MAGIC *mg = SvMAGICAL(sv) ? mg_find(sv, PERL_MAGIC_utf8) : 0;
5291 if (mg && mg->mg_len != -1 && (mg->mg_len > 0 || len == 0)) {
5293 #ifdef PERL_UTF8_CACHE_ASSERT
5294 assert(ulen == Perl_utf8_length(aTHX_ s, s + len));
5298 ulen = Perl_utf8_length(aTHX_ s, s + len);
5299 if (!mg && !SvREADONLY(sv)) {
5300 sv_magic(sv, 0, PERL_MAGIC_utf8, 0, 0);
5301 mg = mg_find(sv, PERL_MAGIC_utf8);
5311 /* S_utf8_mg_pos_init() is used to initialize the mg_ptr field of
5312 * a PERL_UTF8_magic. The mg_ptr is used to store the mapping
5313 * between UTF-8 and byte offsets. There are two (substr offset and substr
5314 * length, the i offset, PERL_MAGIC_UTF8_CACHESIZE) times two (UTF-8 offset
5315 * and byte offset) cache positions.
5317 * The mg_len field is used by sv_len_utf8(), see its comments.
5318 * Note that the mg_len is not the length of the mg_ptr field.
5322 S_utf8_mg_pos_init(pTHX_ SV *sv, MAGIC **mgp, STRLEN **cachep, I32 i,
5323 I32 offsetp, const U8 *s, const U8 *start)
5327 if (SvMAGICAL(sv) && !SvREADONLY(sv)) {
5329 *mgp = sv_magicext(sv, 0, PERL_MAGIC_utf8, (MGVTBL*)&PL_vtbl_utf8, 0, 0);
5333 *cachep = (STRLEN *) (*mgp)->mg_ptr;
5335 Newxz(*cachep, PERL_MAGIC_UTF8_CACHESIZE * 2, STRLEN);
5336 (*mgp)->mg_ptr = (char *) *cachep;
5340 (*cachep)[i] = offsetp;
5341 (*cachep)[i+1] = s - start;
5349 * S_utf8_mg_pos() is used to query and update mg_ptr field of
5350 * a PERL_UTF8_magic. The mg_ptr is used to store the mapping
5351 * between UTF-8 and byte offsets. See also the comments of
5352 * S_utf8_mg_pos_init().
5356 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)
5360 if (SvMAGICAL(sv) && !SvREADONLY(sv)) {
5362 *mgp = mg_find(sv, PERL_MAGIC_utf8);
5363 if (*mgp && (*mgp)->mg_ptr) {
5364 *cachep = (STRLEN *) (*mgp)->mg_ptr;
5365 ASSERT_UTF8_CACHE(*cachep);
5366 if ((*cachep)[i] == (STRLEN)uoff) /* An exact match. */
5368 else { /* We will skip to the right spot. */
5373 /* The assumption is that going backward is half
5374 * the speed of going forward (that's where the
5375 * 2 * backw in the below comes from). (The real
5376 * figure of course depends on the UTF-8 data.) */
5378 if ((*cachep)[i] > (STRLEN)uoff) {
5380 backw = (*cachep)[i] - (STRLEN)uoff;
5382 if (forw < 2 * backw)
5385 p = start + (*cachep)[i+1];
5387 /* Try this only for the substr offset (i == 0),
5388 * not for the substr length (i == 2). */
5389 else if (i == 0) { /* (*cachep)[i] < uoff */
5390 const STRLEN ulen = sv_len_utf8(sv);
5392 if ((STRLEN)uoff < ulen) {
5393 forw = (STRLEN)uoff - (*cachep)[i];
5394 backw = ulen - (STRLEN)uoff;
5396 if (forw < 2 * backw)
5397 p = start + (*cachep)[i+1];
5402 /* If the string is not long enough for uoff,
5403 * we could extend it, but not at this low a level. */
5407 if (forw < 2 * backw) {
5414 while (UTF8_IS_CONTINUATION(*p))
5419 /* Update the cache. */
5420 (*cachep)[i] = (STRLEN)uoff;
5421 (*cachep)[i+1] = p - start;
5423 /* Drop the stale "length" cache */
5432 if (found) { /* Setup the return values. */
5433 *offsetp = (*cachep)[i+1];
5434 *sp = start + *offsetp;
5437 *offsetp = send - start;
5439 else if (*sp < start) {
5445 #ifdef PERL_UTF8_CACHE_ASSERT
5450 while (n-- && s < send)
5454 assert(*offsetp == s - start);
5455 assert((*cachep)[0] == (STRLEN)uoff);
5456 assert((*cachep)[1] == *offsetp);
5458 ASSERT_UTF8_CACHE(*cachep);
5467 =for apidoc sv_pos_u2b
5469 Converts the value pointed to by offsetp from a count of UTF-8 chars from
5470 the start of the string, to a count of the equivalent number of bytes; if
5471 lenp is non-zero, it does the same to lenp, but this time starting from
5472 the offset, rather than from the start of the string. Handles magic and
5479 * sv_pos_u2b() uses, like sv_pos_b2u(), the mg_ptr of the potential
5480 * PERL_UTF8_magic of the sv to store the mapping between UTF-8 and
5481 * byte offsets. See also the comments of S_utf8_mg_pos().
5486 Perl_sv_pos_u2b(pTHX_ register SV *sv, I32* offsetp, I32* lenp)
5494 start = (U8*)SvPV_const(sv, len);
5497 STRLEN *cache = NULL;
5498 const U8 *s = start;
5499 I32 uoffset = *offsetp;
5500 const U8 * const send = s + len;
5502 bool found = utf8_mg_pos(sv, &mg, &cache, 0, offsetp, *offsetp, &s, start, send);
5504 if (!found && uoffset > 0) {
5505 while (s < send && uoffset--)
5509 if (utf8_mg_pos_init(sv, &mg, &cache, 0, *offsetp, s, start))
5511 *offsetp = s - start;
5516 if (utf8_mg_pos(sv, &mg, &cache, 2, lenp, *lenp, &s, start, send)) {
5520 if (!found && *lenp > 0) {
5523 while (s < send && ulen--)
5527 utf8_mg_pos_init(sv, &mg, &cache, 2, *lenp, s, start);
5531 ASSERT_UTF8_CACHE(cache);
5543 =for apidoc sv_pos_b2u
5545 Converts the value pointed to by offsetp from a count of bytes from the
5546 start of the string, to a count of the equivalent number of UTF-8 chars.
5547 Handles magic and type coercion.
5553 * sv_pos_b2u() uses, like sv_pos_u2b(), the mg_ptr of the potential
5554 * PERL_UTF8_magic of the sv to store the mapping between UTF-8 and
5555 * byte offsets. See also the comments of S_utf8_mg_pos().
5560 Perl_sv_pos_b2u(pTHX_ register SV* sv, I32* offsetp)
5568 s = (const U8*)SvPV_const(sv, len);
5569 if ((I32)len < *offsetp)
5570 Perl_croak(aTHX_ "panic: sv_pos_b2u: bad byte offset");
5572 const U8* send = s + *offsetp;
5574 STRLEN *cache = NULL;
5578 if (SvMAGICAL(sv) && !SvREADONLY(sv)) {
5579 mg = mg_find(sv, PERL_MAGIC_utf8);
5580 if (mg && mg->mg_ptr) {
5581 cache = (STRLEN *) mg->mg_ptr;
5582 if (cache[1] == (STRLEN)*offsetp) {
5583 /* An exact match. */
5584 *offsetp = cache[0];
5588 else if (cache[1] < (STRLEN)*offsetp) {
5589 /* We already know part of the way. */
5592 /* Let the below loop do the rest. */
5594 else { /* cache[1] > *offsetp */
5595 /* We already know all of the way, now we may
5596 * be able to walk back. The same assumption
5597 * is made as in S_utf8_mg_pos(), namely that
5598 * walking backward is twice slower than
5599 * walking forward. */
5600 const STRLEN forw = *offsetp;
5601 STRLEN backw = cache[1] - *offsetp;
5603 if (!(forw < 2 * backw)) {
5604 const U8 *p = s + cache[1];
5611 while (UTF8_IS_CONTINUATION(*p)) {
5619 *offsetp = cache[0];
5621 /* Drop the stale "length" cache */
5629 ASSERT_UTF8_CACHE(cache);
5635 /* Call utf8n_to_uvchr() to validate the sequence
5636 * (unless a simple non-UTF character) */
5637 if (!UTF8_IS_INVARIANT(*s))
5638 utf8n_to_uvchr(s, UTF8SKIP(s), &n, 0);
5647 if (!SvREADONLY(sv)) {
5649 sv_magic(sv, 0, PERL_MAGIC_utf8, 0, 0);
5650 mg = mg_find(sv, PERL_MAGIC_utf8);
5655 Newxz(cache, PERL_MAGIC_UTF8_CACHESIZE * 2, STRLEN);
5656 mg->mg_ptr = (char *) cache;
5661 cache[1] = *offsetp;
5662 /* Drop the stale "length" cache */
5675 Returns a boolean indicating whether the strings in the two SVs are
5676 identical. Is UTF-8 and 'use bytes' aware, handles get magic, and will
5677 coerce its args to strings if necessary.
5683 Perl_sv_eq(pTHX_ register SV *sv1, register SV *sv2)
5692 SV* svrecode = NULL;
5699 pv1 = SvPV_const(sv1, cur1);
5706 pv2 = SvPV_const(sv2, cur2);
5708 if (cur1 && cur2 && SvUTF8(sv1) != SvUTF8(sv2) && !IN_BYTES) {
5709 /* Differing utf8ness.
5710 * Do not UTF8size the comparands as a side-effect. */
5713 svrecode = newSVpvn(pv2, cur2);
5714 sv_recode_to_utf8(svrecode, PL_encoding);
5715 pv2 = SvPV_const(svrecode, cur2);
5718 svrecode = newSVpvn(pv1, cur1);
5719 sv_recode_to_utf8(svrecode, PL_encoding);
5720 pv1 = SvPV_const(svrecode, cur1);
5722 /* Now both are in UTF-8. */
5724 SvREFCNT_dec(svrecode);
5729 bool is_utf8 = TRUE;
5732 /* sv1 is the UTF-8 one,
5733 * if is equal it must be downgrade-able */
5734 char * const pv = (char*)bytes_from_utf8((const U8*)pv1,
5740 /* sv2 is the UTF-8 one,
5741 * if is equal it must be downgrade-able */
5742 char * const pv = (char *)bytes_from_utf8((const U8*)pv2,
5748 /* Downgrade not possible - cannot be eq */
5756 eq = (pv1 == pv2) || memEQ(pv1, pv2, cur1);
5759 SvREFCNT_dec(svrecode);
5770 Compares the strings in two SVs. Returns -1, 0, or 1 indicating whether the
5771 string in C<sv1> is less than, equal to, or greater than the string in
5772 C<sv2>. Is UTF-8 and 'use bytes' aware, handles get magic, and will
5773 coerce its args to strings if necessary. See also C<sv_cmp_locale>.
5779 Perl_sv_cmp(pTHX_ register SV *sv1, register SV *sv2)
5783 const char *pv1, *pv2;
5786 SV *svrecode = NULL;
5793 pv1 = SvPV_const(sv1, cur1);
5800 pv2 = SvPV_const(sv2, cur2);
5802 if (cur1 && cur2 && SvUTF8(sv1) != SvUTF8(sv2) && !IN_BYTES) {
5803 /* Differing utf8ness.
5804 * Do not UTF8size the comparands as a side-effect. */
5807 svrecode = newSVpvn(pv2, cur2);
5808 sv_recode_to_utf8(svrecode, PL_encoding);
5809 pv2 = SvPV_const(svrecode, cur2);
5812 pv2 = tpv = (char*)bytes_to_utf8((const U8*)pv2, &cur2);
5817 svrecode = newSVpvn(pv1, cur1);
5818 sv_recode_to_utf8(svrecode, PL_encoding);
5819 pv1 = SvPV_const(svrecode, cur1);
5822 pv1 = tpv = (char*)bytes_to_utf8((const U8*)pv1, &cur1);
5828 cmp = cur2 ? -1 : 0;
5832 const I32 retval = memcmp((const void*)pv1, (const void*)pv2, cur1 < cur2 ? cur1 : cur2);
5835 cmp = retval < 0 ? -1 : 1;
5836 } else if (cur1 == cur2) {
5839 cmp = cur1 < cur2 ? -1 : 1;
5844 SvREFCNT_dec(svrecode);
5853 =for apidoc sv_cmp_locale
5855 Compares the strings in two SVs in a locale-aware manner. Is UTF-8 and
5856 'use bytes' aware, handles get magic, and will coerce its args to strings
5857 if necessary. See also C<sv_cmp_locale>. See also C<sv_cmp>.
5863 Perl_sv_cmp_locale(pTHX_ register SV *sv1, register SV *sv2)
5866 #ifdef USE_LOCALE_COLLATE
5872 if (PL_collation_standard)
5876 pv1 = sv1 ? sv_collxfrm(sv1, &len1) : (char *) NULL;
5878 pv2 = sv2 ? sv_collxfrm(sv2, &len2) : (char *) NULL;
5880 if (!pv1 || !len1) {
5891 retval = memcmp((void*)pv1, (void*)pv2, len1 < len2 ? len1 : len2);
5894 return retval < 0 ? -1 : 1;
5897 * When the result of collation is equality, that doesn't mean
5898 * that there are no differences -- some locales exclude some
5899 * characters from consideration. So to avoid false equalities,
5900 * we use the raw string as a tiebreaker.
5906 #endif /* USE_LOCALE_COLLATE */
5908 return sv_cmp(sv1, sv2);
5912 #ifdef USE_LOCALE_COLLATE
5915 =for apidoc sv_collxfrm
5917 Add Collate Transform magic to an SV if it doesn't already have it.
5919 Any scalar variable may carry PERL_MAGIC_collxfrm magic that contains the
5920 scalar data of the variable, but transformed to such a format that a normal
5921 memory comparison can be used to compare the data according to the locale
5928 Perl_sv_collxfrm(pTHX_ SV *sv, STRLEN *nxp)
5933 mg = SvMAGICAL(sv) ? mg_find(sv, PERL_MAGIC_collxfrm) : (MAGIC *) NULL;
5934 if (!mg || !mg->mg_ptr || *(U32*)mg->mg_ptr != PL_collation_ix) {
5940 Safefree(mg->mg_ptr);
5941 s = SvPV_const(sv, len);
5942 if ((xf = mem_collxfrm(s, len, &xlen))) {
5943 if (SvREADONLY(sv)) {
5946 return xf + sizeof(PL_collation_ix);
5949 sv_magic(sv, 0, PERL_MAGIC_collxfrm, 0, 0);
5950 mg = mg_find(sv, PERL_MAGIC_collxfrm);
5963 if (mg && mg->mg_ptr) {
5965 return mg->mg_ptr + sizeof(PL_collation_ix);
5973 #endif /* USE_LOCALE_COLLATE */
5978 Get a line from the filehandle and store it into the SV, optionally
5979 appending to the currently-stored string.
5985 Perl_sv_gets(pTHX_ register SV *sv, register PerlIO *fp, I32 append)
5990 register STDCHAR rslast;
5991 register STDCHAR *bp;
5997 if (SvTHINKFIRST(sv))
5998 sv_force_normal_flags(sv, append ? 0 : SV_COW_DROP_PV);
5999 /* XXX. If you make this PVIV, then copy on write can copy scalars read
6001 However, perlbench says it's slower, because the existing swipe code
6002 is faster than copy on write.
6003 Swings and roundabouts. */
6004 SvUPGRADE(sv, SVt_PV);
6009 if (PerlIO_isutf8(fp)) {
6011 sv_utf8_upgrade_nomg(sv);
6012 sv_pos_u2b(sv,&append,0);
6014 } else if (SvUTF8(sv)) {
6015 SV * const tsv = newSV(0);
6016 sv_gets(tsv, fp, 0);
6017 sv_utf8_upgrade_nomg(tsv);
6018 SvCUR_set(sv,append);
6021 goto return_string_or_null;
6026 if (PerlIO_isutf8(fp))
6029 if (IN_PERL_COMPILETIME) {
6030 /* we always read code in line mode */
6034 else if (RsSNARF(PL_rs)) {
6035 /* If it is a regular disk file use size from stat() as estimate
6036 of amount we are going to read - may result in malloc-ing
6037 more memory than we realy need if layers bellow reduce
6038 size we read (e.g. CRLF or a gzip layer)
6041 if (!PerlLIO_fstat(PerlIO_fileno(fp), &st) && S_ISREG(st.st_mode)) {
6042 const Off_t offset = PerlIO_tell(fp);
6043 if (offset != (Off_t) -1 && st.st_size + append > offset) {
6044 (void) SvGROW(sv, (STRLEN)((st.st_size - offset) + append + 1));
6050 else if (RsRECORD(PL_rs)) {
6054 /* Grab the size of the record we're getting */
6055 recsize = SvIV(SvRV(PL_rs));
6056 buffer = SvGROW(sv, (STRLEN)(recsize + append + 1)) + append;
6059 /* VMS wants read instead of fread, because fread doesn't respect */
6060 /* RMS record boundaries. This is not necessarily a good thing to be */
6061 /* doing, but we've got no other real choice - except avoid stdio
6062 as implementation - perhaps write a :vms layer ?
6064 bytesread = PerlLIO_read(PerlIO_fileno(fp), buffer, recsize);
6066 bytesread = PerlIO_read(fp, buffer, recsize);
6070 SvCUR_set(sv, bytesread += append);
6071 buffer[bytesread] = '\0';
6072 goto return_string_or_null;
6074 else if (RsPARA(PL_rs)) {
6080 /* Get $/ i.e. PL_rs into same encoding as stream wants */
6081 if (PerlIO_isutf8(fp)) {
6082 rsptr = SvPVutf8(PL_rs, rslen);
6085 if (SvUTF8(PL_rs)) {
6086 if (!sv_utf8_downgrade(PL_rs, TRUE)) {
6087 Perl_croak(aTHX_ "Wide character in $/");
6090 rsptr = SvPV_const(PL_rs, rslen);
6094 rslast = rslen ? rsptr[rslen - 1] : '\0';
6096 if (rspara) { /* have to do this both before and after */
6097 do { /* to make sure file boundaries work right */
6100 i = PerlIO_getc(fp);
6104 PerlIO_ungetc(fp,i);
6110 /* See if we know enough about I/O mechanism to cheat it ! */
6112 /* This used to be #ifdef test - it is made run-time test for ease
6113 of abstracting out stdio interface. One call should be cheap
6114 enough here - and may even be a macro allowing compile
6118 if (PerlIO_fast_gets(fp)) {
6121 * We're going to steal some values from the stdio struct
6122 * and put EVERYTHING in the innermost loop into registers.
6124 register STDCHAR *ptr;
6128 #if defined(VMS) && defined(PERLIO_IS_STDIO)
6129 /* An ungetc()d char is handled separately from the regular
6130 * buffer, so we getc() it back out and stuff it in the buffer.
6132 i = PerlIO_getc(fp);
6133 if (i == EOF) return 0;
6134 *(--((*fp)->_ptr)) = (unsigned char) i;
6138 /* Here is some breathtakingly efficient cheating */
6140 cnt = PerlIO_get_cnt(fp); /* get count into register */
6141 /* make sure we have the room */
6142 if ((I32)(SvLEN(sv) - append) <= cnt + 1) {
6143 /* Not room for all of it
6144 if we are looking for a separator and room for some
6146 if (rslen && cnt > 80 && (I32)SvLEN(sv) > append) {
6147 /* just process what we have room for */
6148 shortbuffered = cnt - SvLEN(sv) + append + 1;
6149 cnt -= shortbuffered;
6153 /* remember that cnt can be negative */
6154 SvGROW(sv, (STRLEN)(append + (cnt <= 0 ? 2 : (cnt + 1))));
6159 bp = (STDCHAR*)SvPVX_const(sv) + append; /* move these two too to registers */
6160 ptr = (STDCHAR*)PerlIO_get_ptr(fp);
6161 DEBUG_P(PerlIO_printf(Perl_debug_log,
6162 "Screamer: entering, ptr=%"UVuf", cnt=%ld\n",PTR2UV(ptr),(long)cnt));
6163 DEBUG_P(PerlIO_printf(Perl_debug_log,
6164 "Screamer: entering: PerlIO * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
6165 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
6166 PTR2UV(PerlIO_has_base(fp) ? PerlIO_get_base(fp) : 0)));
6171 while (cnt > 0) { /* this | eat */
6173 if ((*bp++ = *ptr++) == rslast) /* really | dust */
6174 goto thats_all_folks; /* screams | sed :-) */
6178 Copy(ptr, bp, cnt, char); /* this | eat */
6179 bp += cnt; /* screams | dust */
6180 ptr += cnt; /* louder | sed :-) */
6185 if (shortbuffered) { /* oh well, must extend */
6186 cnt = shortbuffered;
6188 bpx = bp - (STDCHAR*)SvPVX_const(sv); /* box up before relocation */
6190 SvGROW(sv, SvLEN(sv) + append + cnt + 2);
6191 bp = (STDCHAR*)SvPVX_const(sv) + bpx; /* unbox after relocation */
6195 DEBUG_P(PerlIO_printf(Perl_debug_log,
6196 "Screamer: going to getc, ptr=%"UVuf", cnt=%ld\n",
6197 PTR2UV(ptr),(long)cnt));
6198 PerlIO_set_ptrcnt(fp, (STDCHAR*)ptr, cnt); /* deregisterize cnt and ptr */
6200 DEBUG_P(PerlIO_printf(Perl_debug_log,
6201 "Screamer: pre: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
6202 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
6203 PTR2UV(PerlIO_has_base (fp) ? PerlIO_get_base(fp) : 0)));
6205 /* This used to call 'filbuf' in stdio form, but as that behaves like
6206 getc when cnt <= 0 we use PerlIO_getc here to avoid introducing
6207 another abstraction. */
6208 i = PerlIO_getc(fp); /* get more characters */
6210 DEBUG_P(PerlIO_printf(Perl_debug_log,
6211 "Screamer: post: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
6212 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
6213 PTR2UV(PerlIO_has_base (fp) ? PerlIO_get_base(fp) : 0)));
6215 cnt = PerlIO_get_cnt(fp);
6216 ptr = (STDCHAR*)PerlIO_get_ptr(fp); /* reregisterize cnt and ptr */
6217 DEBUG_P(PerlIO_printf(Perl_debug_log,
6218 "Screamer: after getc, ptr=%"UVuf", cnt=%ld\n",PTR2UV(ptr),(long)cnt));
6220 if (i == EOF) /* all done for ever? */
6221 goto thats_really_all_folks;
6223 bpx = bp - (STDCHAR*)SvPVX_const(sv); /* box up before relocation */
6225 SvGROW(sv, bpx + cnt + 2);
6226 bp = (STDCHAR*)SvPVX_const(sv) + bpx; /* unbox after relocation */
6228 *bp++ = (STDCHAR)i; /* store character from PerlIO_getc */
6230 if (rslen && (STDCHAR)i == rslast) /* all done for now? */
6231 goto thats_all_folks;
6235 if ((rslen > 1 && (STRLEN)(bp - (STDCHAR*)SvPVX_const(sv)) < rslen) ||
6236 memNE((char*)bp - rslen, rsptr, rslen))
6237 goto screamer; /* go back to the fray */
6238 thats_really_all_folks:
6240 cnt += shortbuffered;
6241 DEBUG_P(PerlIO_printf(Perl_debug_log,
6242 "Screamer: quitting, ptr=%"UVuf", cnt=%ld\n",PTR2UV(ptr),(long)cnt));
6243 PerlIO_set_ptrcnt(fp, (STDCHAR*)ptr, cnt); /* put these back or we're in trouble */
6244 DEBUG_P(PerlIO_printf(Perl_debug_log,
6245 "Screamer: end: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
6246 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
6247 PTR2UV(PerlIO_has_base (fp) ? PerlIO_get_base(fp) : 0)));
6249 SvCUR_set(sv, bp - (STDCHAR*)SvPVX_const(sv)); /* set length */
6250 DEBUG_P(PerlIO_printf(Perl_debug_log,
6251 "Screamer: done, len=%ld, string=|%.*s|\n",
6252 (long)SvCUR(sv),(int)SvCUR(sv),SvPVX_const(sv)));
6256 /*The big, slow, and stupid way. */
6257 #ifdef USE_HEAP_INSTEAD_OF_STACK /* Even slower way. */
6258 STDCHAR *buf = NULL;
6259 Newx(buf, 8192, STDCHAR);
6267 register const STDCHAR * const bpe = buf + sizeof(buf);
6269 while ((i = PerlIO_getc(fp)) != EOF && (*bp++ = (STDCHAR)i) != rslast && bp < bpe)
6270 ; /* keep reading */
6274 cnt = PerlIO_read(fp,(char*)buf, sizeof(buf));
6275 /* Accomodate broken VAXC compiler, which applies U8 cast to
6276 * both args of ?: operator, causing EOF to change into 255
6279 i = (U8)buf[cnt - 1];
6285 cnt = 0; /* we do need to re-set the sv even when cnt <= 0 */
6287 sv_catpvn(sv, (char *) buf, cnt);
6289 sv_setpvn(sv, (char *) buf, cnt);
6291 if (i != EOF && /* joy */
6293 SvCUR(sv) < rslen ||
6294 memNE(SvPVX_const(sv) + SvCUR(sv) - rslen, rsptr, rslen)))
6298 * If we're reading from a TTY and we get a short read,
6299 * indicating that the user hit his EOF character, we need
6300 * to notice it now, because if we try to read from the TTY
6301 * again, the EOF condition will disappear.
6303 * The comparison of cnt to sizeof(buf) is an optimization
6304 * that prevents unnecessary calls to feof().
6308 if (!(cnt < sizeof(buf) && PerlIO_eof(fp)))
6312 #ifdef USE_HEAP_INSTEAD_OF_STACK
6317 if (rspara) { /* have to do this both before and after */
6318 while (i != EOF) { /* to make sure file boundaries work right */
6319 i = PerlIO_getc(fp);
6321 PerlIO_ungetc(fp,i);
6327 return_string_or_null:
6328 return (SvCUR(sv) - append) ? SvPVX(sv) : NULL;
6334 Auto-increment of the value in the SV, doing string to numeric conversion
6335 if necessary. Handles 'get' magic.
6341 Perl_sv_inc(pTHX_ register SV *sv)
6350 if (SvTHINKFIRST(sv)) {
6352 sv_force_normal_flags(sv, 0);
6353 if (SvREADONLY(sv)) {
6354 if (IN_PERL_RUNTIME)
6355 Perl_croak(aTHX_ PL_no_modify);
6359 if (SvAMAGIC(sv) && AMG_CALLun(sv,inc))
6361 i = PTR2IV(SvRV(sv));
6366 flags = SvFLAGS(sv);
6367 if ((flags & (SVp_NOK|SVp_IOK)) == SVp_NOK) {
6368 /* It's (privately or publicly) a float, but not tested as an
6369 integer, so test it to see. */
6371 flags = SvFLAGS(sv);
6373 if ((flags & SVf_IOK) || ((flags & (SVp_IOK | SVp_NOK)) == SVp_IOK)) {
6374 /* It's publicly an integer, or privately an integer-not-float */
6375 #ifdef PERL_PRESERVE_IVUV
6379 if (SvUVX(sv) == UV_MAX)
6380 sv_setnv(sv, UV_MAX_P1);
6382 (void)SvIOK_only_UV(sv);
6383 SvUV_set(sv, SvUVX(sv) + 1);
6385 if (SvIVX(sv) == IV_MAX)
6386 sv_setuv(sv, (UV)IV_MAX + 1);
6388 (void)SvIOK_only(sv);
6389 SvIV_set(sv, SvIVX(sv) + 1);
6394 if (flags & SVp_NOK) {
6395 (void)SvNOK_only(sv);
6396 SvNV_set(sv, SvNVX(sv) + 1.0);
6400 if (!(flags & SVp_POK) || !*SvPVX_const(sv)) {
6401 if ((flags & SVTYPEMASK) < SVt_PVIV)
6402 sv_upgrade(sv, ((flags & SVTYPEMASK) > SVt_IV ? SVt_PVIV : SVt_IV));
6403 (void)SvIOK_only(sv);
6408 while (isALPHA(*d)) d++;
6409 while (isDIGIT(*d)) d++;
6411 #ifdef PERL_PRESERVE_IVUV
6412 /* Got to punt this as an integer if needs be, but we don't issue
6413 warnings. Probably ought to make the sv_iv_please() that does
6414 the conversion if possible, and silently. */
6415 const int numtype = grok_number(SvPVX_const(sv), SvCUR(sv), NULL);
6416 if (numtype && !(numtype & IS_NUMBER_INFINITY)) {
6417 /* Need to try really hard to see if it's an integer.
6418 9.22337203685478e+18 is an integer.
6419 but "9.22337203685478e+18" + 0 is UV=9223372036854779904
6420 so $a="9.22337203685478e+18"; $a+0; $a++
6421 needs to be the same as $a="9.22337203685478e+18"; $a++
6428 /* sv_2iv *should* have made this an NV */
6429 if (flags & SVp_NOK) {
6430 (void)SvNOK_only(sv);
6431 SvNV_set(sv, SvNVX(sv) + 1.0);
6434 /* I don't think we can get here. Maybe I should assert this
6435 And if we do get here I suspect that sv_setnv will croak. NWC
6437 #if defined(USE_LONG_DOUBLE)
6438 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",
6439 SvPVX_const(sv), SvIVX(sv), SvNVX(sv)));
6441 DEBUG_c(PerlIO_printf(Perl_debug_log,"sv_inc punt failed to convert '%s' to IOK or NOKp, UV=0x%"UVxf" NV=%"NVgf"\n",
6442 SvPVX_const(sv), SvIVX(sv), SvNVX(sv)));
6445 #endif /* PERL_PRESERVE_IVUV */
6446 sv_setnv(sv,Atof(SvPVX_const(sv)) + 1.0);
6450 while (d >= SvPVX_const(sv)) {
6458 /* MKS: The original code here died if letters weren't consecutive.
6459 * at least it didn't have to worry about non-C locales. The
6460 * new code assumes that ('z'-'a')==('Z'-'A'), letters are
6461 * arranged in order (although not consecutively) and that only
6462 * [A-Za-z] are accepted by isALPHA in the C locale.
6464 if (*d != 'z' && *d != 'Z') {
6465 do { ++*d; } while (!isALPHA(*d));
6468 *(d--) -= 'z' - 'a';
6473 *(d--) -= 'z' - 'a' + 1;
6477 /* oh,oh, the number grew */
6478 SvGROW(sv, SvCUR(sv) + 2);
6479 SvCUR_set(sv, SvCUR(sv) + 1);
6480 for (d = SvPVX(sv) + SvCUR(sv); d > SvPVX_const(sv); d--)
6491 Auto-decrement of the value in the SV, doing string to numeric conversion
6492 if necessary. Handles 'get' magic.
6498 Perl_sv_dec(pTHX_ register SV *sv)
6506 if (SvTHINKFIRST(sv)) {
6508 sv_force_normal_flags(sv, 0);
6509 if (SvREADONLY(sv)) {
6510 if (IN_PERL_RUNTIME)
6511 Perl_croak(aTHX_ PL_no_modify);
6515 if (SvAMAGIC(sv) && AMG_CALLun(sv,dec))
6517 i = PTR2IV(SvRV(sv));
6522 /* Unlike sv_inc we don't have to worry about string-never-numbers
6523 and keeping them magic. But we mustn't warn on punting */
6524 flags = SvFLAGS(sv);
6525 if ((flags & SVf_IOK) || ((flags & (SVp_IOK | SVp_NOK)) == SVp_IOK)) {
6526 /* It's publicly an integer, or privately an integer-not-float */
6527 #ifdef PERL_PRESERVE_IVUV
6531 if (SvUVX(sv) == 0) {
6532 (void)SvIOK_only(sv);
6536 (void)SvIOK_only_UV(sv);
6537 SvUV_set(sv, SvUVX(sv) - 1);
6540 if (SvIVX(sv) == IV_MIN)
6541 sv_setnv(sv, (NV)IV_MIN - 1.0);
6543 (void)SvIOK_only(sv);
6544 SvIV_set(sv, SvIVX(sv) - 1);
6549 if (flags & SVp_NOK) {
6550 SvNV_set(sv, SvNVX(sv) - 1.0);
6551 (void)SvNOK_only(sv);
6554 if (!(flags & SVp_POK)) {
6555 if ((flags & SVTYPEMASK) < SVt_PVIV)
6556 sv_upgrade(sv, ((flags & SVTYPEMASK) > SVt_IV) ? SVt_PVIV : SVt_IV);
6558 (void)SvIOK_only(sv);
6561 #ifdef PERL_PRESERVE_IVUV
6563 const int numtype = grok_number(SvPVX_const(sv), SvCUR(sv), NULL);
6564 if (numtype && !(numtype & IS_NUMBER_INFINITY)) {
6565 /* Need to try really hard to see if it's an integer.
6566 9.22337203685478e+18 is an integer.
6567 but "9.22337203685478e+18" + 0 is UV=9223372036854779904
6568 so $a="9.22337203685478e+18"; $a+0; $a--
6569 needs to be the same as $a="9.22337203685478e+18"; $a--
6576 /* sv_2iv *should* have made this an NV */
6577 if (flags & SVp_NOK) {
6578 (void)SvNOK_only(sv);
6579 SvNV_set(sv, SvNVX(sv) - 1.0);
6582 /* I don't think we can get here. Maybe I should assert this
6583 And if we do get here I suspect that sv_setnv will croak. NWC
6585 #if defined(USE_LONG_DOUBLE)
6586 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",
6587 SvPVX_const(sv), SvIVX(sv), SvNVX(sv)));
6589 DEBUG_c(PerlIO_printf(Perl_debug_log,"sv_dec punt failed to convert '%s' to IOK or NOKp, UV=0x%"UVxf" NV=%"NVgf"\n",
6590 SvPVX_const(sv), SvIVX(sv), SvNVX(sv)));
6594 #endif /* PERL_PRESERVE_IVUV */
6595 sv_setnv(sv,Atof(SvPVX_const(sv)) - 1.0); /* punt */
6599 =for apidoc sv_mortalcopy
6601 Creates a new SV which is a copy of the original SV (using C<sv_setsv>).
6602 The new SV is marked as mortal. It will be destroyed "soon", either by an
6603 explicit call to FREETMPS, or by an implicit call at places such as
6604 statement boundaries. See also C<sv_newmortal> and C<sv_2mortal>.
6609 /* Make a string that will exist for the duration of the expression
6610 * evaluation. Actually, it may have to last longer than that, but
6611 * hopefully we won't free it until it has been assigned to a
6612 * permanent location. */
6615 Perl_sv_mortalcopy(pTHX_ SV *oldstr)
6621 sv_setsv(sv,oldstr);
6623 PL_tmps_stack[++PL_tmps_ix] = sv;
6629 =for apidoc sv_newmortal
6631 Creates a new null SV which is mortal. The reference count of the SV is
6632 set to 1. It will be destroyed "soon", either by an explicit call to
6633 FREETMPS, or by an implicit call at places such as statement boundaries.
6634 See also C<sv_mortalcopy> and C<sv_2mortal>.
6640 Perl_sv_newmortal(pTHX)
6646 SvFLAGS(sv) = SVs_TEMP;
6648 PL_tmps_stack[++PL_tmps_ix] = sv;
6653 =for apidoc sv_2mortal
6655 Marks an existing SV as mortal. The SV will be destroyed "soon", either
6656 by an explicit call to FREETMPS, or by an implicit call at places such as
6657 statement boundaries. SvTEMP() is turned on which means that the SV's
6658 string buffer can be "stolen" if this SV is copied. See also C<sv_newmortal>
6659 and C<sv_mortalcopy>.
6665 Perl_sv_2mortal(pTHX_ register SV *sv)
6670 if (SvREADONLY(sv) && SvIMMORTAL(sv))
6673 PL_tmps_stack[++PL_tmps_ix] = sv;
6681 Creates a new SV and copies a string into it. The reference count for the
6682 SV is set to 1. If C<len> is zero, Perl will compute the length using
6683 strlen(). For efficiency, consider using C<newSVpvn> instead.
6689 Perl_newSVpv(pTHX_ const char *s, STRLEN len)
6695 sv_setpvn(sv,s,len ? len : strlen(s));
6700 =for apidoc newSVpvn
6702 Creates a new SV and copies a string into it. The reference count for the
6703 SV is set to 1. Note that if C<len> is zero, Perl will create a zero length
6704 string. You are responsible for ensuring that the source string is at least
6705 C<len> bytes long. If the C<s> argument is NULL the new SV will be undefined.
6711 Perl_newSVpvn(pTHX_ const char *s, STRLEN len)
6717 sv_setpvn(sv,s,len);
6723 =for apidoc newSVhek
6725 Creates a new SV from the hash key structure. It will generate scalars that
6726 point to the shared string table where possible. Returns a new (undefined)
6727 SV if the hek is NULL.
6733 Perl_newSVhek(pTHX_ const HEK *hek)
6743 if (HEK_LEN(hek) == HEf_SVKEY) {
6744 return newSVsv(*(SV**)HEK_KEY(hek));
6746 const int flags = HEK_FLAGS(hek);
6747 if (flags & HVhek_WASUTF8) {
6749 Andreas would like keys he put in as utf8 to come back as utf8
6751 STRLEN utf8_len = HEK_LEN(hek);
6752 const U8 *as_utf8 = bytes_to_utf8 ((U8*)HEK_KEY(hek), &utf8_len);
6753 SV * const sv = newSVpvn ((const char*)as_utf8, utf8_len);
6756 Safefree (as_utf8); /* bytes_to_utf8() allocates a new string */
6758 } else if (flags & HVhek_REHASH) {
6759 /* We don't have a pointer to the hv, so we have to replicate the
6760 flag into every HEK. This hv is using custom a hasing
6761 algorithm. Hence we can't return a shared string scalar, as
6762 that would contain the (wrong) hash value, and might get passed
6763 into an hv routine with a regular hash */
6765 SV * const sv = newSVpvn (HEK_KEY(hek), HEK_LEN(hek));
6770 /* This will be overwhelminly the most common case. */
6771 return newSVpvn_share(HEK_KEY(hek),
6772 (HEK_UTF8(hek) ? -HEK_LEN(hek) : HEK_LEN(hek)),
6778 =for apidoc newSVpvn_share
6780 Creates a new SV with its SvPVX_const pointing to a shared string in the string
6781 table. If the string does not already exist in the table, it is created
6782 first. Turns on READONLY and FAKE. The string's hash is stored in the UV
6783 slot of the SV; if the C<hash> parameter is non-zero, that value is used;
6784 otherwise the hash is computed. The idea here is that as the string table
6785 is used for shared hash keys these strings will have SvPVX_const == HeKEY and
6786 hash lookup will avoid string compare.
6792 Perl_newSVpvn_share(pTHX_ const char *src, I32 len, U32 hash)
6796 bool is_utf8 = FALSE;
6798 STRLEN tmplen = -len;
6800 /* See the note in hv.c:hv_fetch() --jhi */
6801 src = (char*)bytes_from_utf8((const U8*)src, &tmplen, &is_utf8);
6805 PERL_HASH(hash, src, len);
6807 sv_upgrade(sv, SVt_PV);
6808 SvPV_set(sv, sharepvn(src, is_utf8?-len:len, hash));
6820 #if defined(PERL_IMPLICIT_CONTEXT)
6822 /* pTHX_ magic can't cope with varargs, so this is a no-context
6823 * version of the main function, (which may itself be aliased to us).
6824 * Don't access this version directly.
6828 Perl_newSVpvf_nocontext(const char* pat, ...)
6833 va_start(args, pat);
6834 sv = vnewSVpvf(pat, &args);
6841 =for apidoc newSVpvf
6843 Creates a new SV and initializes it with the string formatted like
6850 Perl_newSVpvf(pTHX_ const char* pat, ...)
6854 va_start(args, pat);
6855 sv = vnewSVpvf(pat, &args);
6860 /* backend for newSVpvf() and newSVpvf_nocontext() */
6863 Perl_vnewSVpvf(pTHX_ const char* pat, va_list* args)
6868 sv_vsetpvfn(sv, pat, strlen(pat), args, NULL, 0, NULL);
6875 Creates a new SV and copies a floating point value into it.
6876 The reference count for the SV is set to 1.
6882 Perl_newSVnv(pTHX_ NV n)
6895 Creates a new SV and copies an integer into it. The reference count for the
6902 Perl_newSViv(pTHX_ IV i)
6915 Creates a new SV and copies an unsigned integer into it.
6916 The reference count for the SV is set to 1.
6922 Perl_newSVuv(pTHX_ UV u)
6933 =for apidoc newRV_noinc
6935 Creates an RV wrapper for an SV. The reference count for the original
6936 SV is B<not> incremented.
6942 Perl_newRV_noinc(pTHX_ SV *tmpRef)
6948 sv_upgrade(sv, SVt_RV);
6950 SvRV_set(sv, tmpRef);
6955 /* newRV_inc is the official function name to use now.
6956 * newRV_inc is in fact #defined to newRV in sv.h
6960 Perl_newRV(pTHX_ SV *tmpRef)
6963 return newRV_noinc(SvREFCNT_inc(tmpRef));
6969 Creates a new SV which is an exact duplicate of the original SV.
6976 Perl_newSVsv(pTHX_ register SV *old)
6983 if (SvTYPE(old) == SVTYPEMASK) {
6984 if (ckWARN_d(WARN_INTERNAL))
6985 Perl_warner(aTHX_ packWARN(WARN_INTERNAL), "semi-panic: attempt to dup freed string");
6989 /* SV_GMAGIC is the default for sv_setv()
6990 SV_NOSTEAL prevents TEMP buffers being, well, stolen, and saves games
6991 with SvTEMP_off and SvTEMP_on round a call to sv_setsv. */
6992 sv_setsv_flags(sv, old, SV_GMAGIC | SV_NOSTEAL);
6997 =for apidoc sv_reset
6999 Underlying implementation for the C<reset> Perl function.
7000 Note that the perl-level function is vaguely deprecated.
7006 Perl_sv_reset(pTHX_ register const char *s, HV *stash)
7009 char todo[PERL_UCHAR_MAX+1];
7014 if (!*s) { /* reset ?? searches */
7015 MAGIC * const mg = mg_find((SV *)stash, PERL_MAGIC_symtab);
7017 PMOP *pm = (PMOP *) mg->mg_obj;
7019 pm->op_pmdynflags &= ~PMdf_USED;
7026 /* reset variables */
7028 if (!HvARRAY(stash))
7031 Zero(todo, 256, char);
7034 I32 i = (unsigned char)*s;
7038 max = (unsigned char)*s++;
7039 for ( ; i <= max; i++) {
7042 for (i = 0; i <= (I32) HvMAX(stash); i++) {
7044 for (entry = HvARRAY(stash)[i];
7046 entry = HeNEXT(entry))
7051 if (!todo[(U8)*HeKEY(entry)])
7053 gv = (GV*)HeVAL(entry);
7056 if (SvTHINKFIRST(sv)) {
7057 if (!SvREADONLY(sv) && SvROK(sv))
7059 /* XXX Is this continue a bug? Why should THINKFIRST
7060 exempt us from resetting arrays and hashes? */
7064 if (SvTYPE(sv) >= SVt_PV) {
7066 if (SvPVX_const(sv) != NULL)
7074 if (GvHV(gv) && !HvNAME_get(GvHV(gv))) {
7076 Perl_die(aTHX_ "Can't reset %%ENV on this system");
7079 # if defined(USE_ENVIRON_ARRAY)
7082 # endif /* USE_ENVIRON_ARRAY */
7093 Using various gambits, try to get an IO from an SV: the IO slot if its a
7094 GV; or the recursive result if we're an RV; or the IO slot of the symbol
7095 named after the PV if we're a string.
7101 Perl_sv_2io(pTHX_ SV *sv)
7106 switch (SvTYPE(sv)) {
7114 Perl_croak(aTHX_ "Bad filehandle: %s", GvNAME(gv));
7118 Perl_croak(aTHX_ PL_no_usym, "filehandle");
7120 return sv_2io(SvRV(sv));
7121 gv = gv_fetchsv(sv, 0, SVt_PVIO);
7127 Perl_croak(aTHX_ "Bad filehandle: %"SVf, sv);
7136 Using various gambits, try to get a CV from an SV; in addition, try if
7137 possible to set C<*st> and C<*gvp> to the stash and GV associated with it.
7138 The flags in C<lref> are passed to sv_fetchsv.
7144 Perl_sv_2cv(pTHX_ SV *sv, HV **st, GV **gvp, I32 lref)
7155 switch (SvTYPE(sv)) {
7174 SV * const *sp = &sv; /* Used in tryAMAGICunDEREF macro. */
7175 tryAMAGICunDEREF(to_cv);
7178 if (SvTYPE(sv) == SVt_PVCV) {
7187 Perl_croak(aTHX_ "Not a subroutine reference");
7192 gv = gv_fetchsv(sv, lref, SVt_PVCV);
7198 /* Some flags to gv_fetchsv mean don't really create the GV */
7199 if (SvTYPE(gv) != SVt_PVGV) {
7205 if (lref && !GvCVu(gv)) {
7209 gv_efullname3(tmpsv, gv, NULL);
7210 /* XXX this is probably not what they think they're getting.
7211 * It has the same effect as "sub name;", i.e. just a forward
7213 newSUB(start_subparse(FALSE, 0),
7214 newSVOP(OP_CONST, 0, tmpsv),
7218 Perl_croak(aTHX_ "Unable to create sub named \"%"SVf"\"",
7228 Returns true if the SV has a true value by Perl's rules.
7229 Use the C<SvTRUE> macro instead, which may call C<sv_true()> or may
7230 instead use an in-line version.
7236 Perl_sv_true(pTHX_ register SV *sv)
7241 register const XPV* const tXpv = (XPV*)SvANY(sv);
7243 (tXpv->xpv_cur > 1 ||
7244 (tXpv->xpv_cur && *sv->sv_u.svu_pv != '0')))
7251 return SvIVX(sv) != 0;
7254 return SvNVX(sv) != 0.0;
7256 return sv_2bool(sv);
7262 =for apidoc sv_pvn_force
7264 Get a sensible string out of the SV somehow.
7265 A private implementation of the C<SvPV_force> macro for compilers which
7266 can't cope with complex macro expressions. Always use the macro instead.
7268 =for apidoc sv_pvn_force_flags
7270 Get a sensible string out of the SV somehow.
7271 If C<flags> has C<SV_GMAGIC> bit set, will C<mg_get> on C<sv> if
7272 appropriate, else not. C<sv_pvn_force> and C<sv_pvn_force_nomg> are
7273 implemented in terms of this function.
7274 You normally want to use the various wrapper macros instead: see
7275 C<SvPV_force> and C<SvPV_force_nomg>
7281 Perl_sv_pvn_force_flags(pTHX_ SV *sv, STRLEN *lp, I32 flags)
7284 if (SvTHINKFIRST(sv) && !SvROK(sv))
7285 sv_force_normal_flags(sv, 0);
7295 if (SvREADONLY(sv) && !(flags & SV_MUTABLE_RETURN)) {
7296 const char * const ref = sv_reftype(sv,0);
7298 Perl_croak(aTHX_ "Can't coerce readonly %s to string in %s",
7299 ref, OP_NAME(PL_op));
7301 Perl_croak(aTHX_ "Can't coerce readonly %s to string", ref);
7303 if (SvTYPE(sv) > SVt_PVLV && SvTYPE(sv) != SVt_PVFM)
7304 Perl_croak(aTHX_ "Can't coerce %s to string in %s", sv_reftype(sv,0),
7306 s = sv_2pv_flags(sv, &len, flags);
7310 if (s != SvPVX_const(sv)) { /* Almost, but not quite, sv_setpvn() */
7313 SvUPGRADE(sv, SVt_PV); /* Never FALSE */
7314 SvGROW(sv, len + 1);
7315 Move(s,SvPVX(sv),len,char);
7320 SvPOK_on(sv); /* validate pointer */
7322 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2pv(%s)\n",
7323 PTR2UV(sv),SvPVX_const(sv)));
7326 return SvPVX_mutable(sv);
7330 =for apidoc sv_pvbyten_force
7332 The backend for the C<SvPVbytex_force> macro. Always use the macro instead.
7338 Perl_sv_pvbyten_force(pTHX_ SV *sv, STRLEN *lp)
7340 sv_pvn_force(sv,lp);
7341 sv_utf8_downgrade(sv,0);
7347 =for apidoc sv_pvutf8n_force
7349 The backend for the C<SvPVutf8x_force> macro. Always use the macro instead.
7355 Perl_sv_pvutf8n_force(pTHX_ SV *sv, STRLEN *lp)
7357 sv_pvn_force(sv,lp);
7358 sv_utf8_upgrade(sv);
7364 =for apidoc sv_reftype
7366 Returns a string describing what the SV is a reference to.
7372 Perl_sv_reftype(pTHX_ const SV *sv, int ob)
7374 /* The fact that I don't need to downcast to char * everywhere, only in ?:
7375 inside return suggests a const propagation bug in g++. */
7376 if (ob && SvOBJECT(sv)) {
7377 char * const name = HvNAME_get(SvSTASH(sv));
7378 return name ? name : (char *) "__ANON__";
7381 switch (SvTYPE(sv)) {
7398 case SVt_PVLV: return (char *) (SvROK(sv) ? "REF"
7399 /* tied lvalues should appear to be
7400 * scalars for backwards compatitbility */
7401 : (LvTYPE(sv) == 't' || LvTYPE(sv) == 'T')
7402 ? "SCALAR" : "LVALUE");
7403 case SVt_PVAV: return "ARRAY";
7404 case SVt_PVHV: return "HASH";
7405 case SVt_PVCV: return "CODE";
7406 case SVt_PVGV: return "GLOB";
7407 case SVt_PVFM: return "FORMAT";
7408 case SVt_PVIO: return "IO";
7409 default: return "UNKNOWN";
7415 =for apidoc sv_isobject
7417 Returns a boolean indicating whether the SV is an RV pointing to a blessed
7418 object. If the SV is not an RV, or if the object is not blessed, then this
7425 Perl_sv_isobject(pTHX_ SV *sv)
7441 Returns a boolean indicating whether the SV is blessed into the specified
7442 class. This does not check for subtypes; use C<sv_derived_from> to verify
7443 an inheritance relationship.
7449 Perl_sv_isa(pTHX_ SV *sv, const char *name)
7460 hvname = HvNAME_get(SvSTASH(sv));
7464 return strEQ(hvname, name);
7470 Creates a new SV for the RV, C<rv>, to point to. If C<rv> is not an RV then
7471 it will be upgraded to one. If C<classname> is non-null then the new SV will
7472 be blessed in the specified package. The new SV is returned and its
7473 reference count is 1.
7479 Perl_newSVrv(pTHX_ SV *rv, const char *classname)
7486 SV_CHECK_THINKFIRST_COW_DROP(rv);
7489 if (SvTYPE(rv) >= SVt_PVMG) {
7490 const U32 refcnt = SvREFCNT(rv);
7494 SvREFCNT(rv) = refcnt;
7497 if (SvTYPE(rv) < SVt_RV)
7498 sv_upgrade(rv, SVt_RV);
7499 else if (SvTYPE(rv) > SVt_RV) {
7510 HV* const stash = gv_stashpv(classname, TRUE);
7511 (void)sv_bless(rv, stash);
7517 =for apidoc sv_setref_pv
7519 Copies a pointer into a new SV, optionally blessing the SV. The C<rv>
7520 argument will be upgraded to an RV. That RV will be modified to point to
7521 the new SV. If the C<pv> argument is NULL then C<PL_sv_undef> will be placed
7522 into the SV. The C<classname> argument indicates the package for the
7523 blessing. Set C<classname> to C<NULL> to avoid the blessing. The new SV
7524 will have a reference count of 1, and the RV will be returned.
7526 Do not use with other Perl types such as HV, AV, SV, CV, because those
7527 objects will become corrupted by the pointer copy process.
7529 Note that C<sv_setref_pvn> copies the string while this copies the pointer.
7535 Perl_sv_setref_pv(pTHX_ SV *rv, const char *classname, void *pv)
7539 sv_setsv(rv, &PL_sv_undef);
7543 sv_setiv(newSVrv(rv,classname), PTR2IV(pv));
7548 =for apidoc sv_setref_iv
7550 Copies an integer into a new SV, optionally blessing the SV. The C<rv>
7551 argument will be upgraded to an RV. That RV will be modified to point to
7552 the new SV. The C<classname> argument indicates the package for the
7553 blessing. Set C<classname> to C<NULL> to avoid the blessing. The new SV
7554 will have a reference count of 1, and the RV will be returned.
7560 Perl_sv_setref_iv(pTHX_ SV *rv, const char *classname, IV iv)
7562 sv_setiv(newSVrv(rv,classname), iv);
7567 =for apidoc sv_setref_uv
7569 Copies an unsigned integer into a new SV, optionally blessing the SV. The C<rv>
7570 argument will be upgraded to an RV. That RV will be modified to point to
7571 the new SV. The C<classname> argument indicates the package for the
7572 blessing. Set C<classname> to C<NULL> to avoid the blessing. The new SV
7573 will have a reference count of 1, and the RV will be returned.
7579 Perl_sv_setref_uv(pTHX_ SV *rv, const char *classname, UV uv)
7581 sv_setuv(newSVrv(rv,classname), uv);
7586 =for apidoc sv_setref_nv
7588 Copies a double into a new SV, optionally blessing the SV. The C<rv>
7589 argument will be upgraded to an RV. That RV will be modified to point to
7590 the new SV. The C<classname> argument indicates the package for the
7591 blessing. Set C<classname> to C<NULL> to avoid the blessing. The new SV
7592 will have a reference count of 1, and the RV will be returned.
7598 Perl_sv_setref_nv(pTHX_ SV *rv, const char *classname, NV nv)
7600 sv_setnv(newSVrv(rv,classname), nv);
7605 =for apidoc sv_setref_pvn
7607 Copies a string into a new SV, optionally blessing the SV. The length of the
7608 string must be specified with C<n>. The C<rv> argument will be upgraded to
7609 an RV. That RV will be modified to point to the new SV. The C<classname>
7610 argument indicates the package for the blessing. Set C<classname> to
7611 C<NULL> to avoid the blessing. The new SV will have a reference count
7612 of 1, and the RV will be returned.
7614 Note that C<sv_setref_pv> copies the pointer while this copies the string.
7620 Perl_sv_setref_pvn(pTHX_ SV *rv, const char *classname, const char *pv, STRLEN n)
7622 sv_setpvn(newSVrv(rv,classname), pv, n);
7627 =for apidoc sv_bless
7629 Blesses an SV into a specified package. The SV must be an RV. The package
7630 must be designated by its stash (see C<gv_stashpv()>). The reference count
7631 of the SV is unaffected.
7637 Perl_sv_bless(pTHX_ SV *sv, HV *stash)
7642 Perl_croak(aTHX_ "Can't bless non-reference value");
7644 if (SvFLAGS(tmpRef) & (SVs_OBJECT|SVf_READONLY)) {
7645 if (SvREADONLY(tmpRef))
7646 Perl_croak(aTHX_ PL_no_modify);
7647 if (SvOBJECT(tmpRef)) {
7648 if (SvTYPE(tmpRef) != SVt_PVIO)
7650 SvREFCNT_dec(SvSTASH(tmpRef));
7653 SvOBJECT_on(tmpRef);
7654 if (SvTYPE(tmpRef) != SVt_PVIO)
7656 SvUPGRADE(tmpRef, SVt_PVMG);
7657 SvSTASH_set(tmpRef, (HV*)SvREFCNT_inc(stash));
7664 if(SvSMAGICAL(tmpRef))
7665 if(mg_find(tmpRef, PERL_MAGIC_ext) || mg_find(tmpRef, PERL_MAGIC_uvar))
7673 /* Downgrades a PVGV to a PVMG.
7677 S_sv_unglob(pTHX_ SV *sv)
7681 SV *temp = sv_newmortal();
7683 assert(SvTYPE(sv) == SVt_PVGV);
7685 gv_efullname3(temp, (GV *) sv, "*");
7690 sv_del_backref((SV*)GvSTASH(sv), sv);
7694 Safefree(GvNAME(sv));
7697 /* need to keep SvANY(sv) in the right arena */
7698 xpvmg = new_XPVMG();
7699 StructCopy(SvANY(sv), xpvmg, XPVMG);
7700 del_XPVGV(SvANY(sv));
7703 SvFLAGS(sv) &= ~SVTYPEMASK;
7704 SvFLAGS(sv) |= SVt_PVMG;
7706 /* Intentionally not calling any local SET magic, as this isn't so much a
7707 set operation as merely an internal storage change. */
7708 sv_setsv_flags(sv, temp, 0);
7712 =for apidoc sv_unref_flags
7714 Unsets the RV status of the SV, and decrements the reference count of
7715 whatever was being referenced by the RV. This can almost be thought of
7716 as a reversal of C<newSVrv>. The C<cflags> argument can contain
7717 C<SV_IMMEDIATE_UNREF> to force the reference count to be decremented
7718 (otherwise the decrementing is conditional on the reference count being
7719 different from one or the reference being a readonly SV).
7726 Perl_sv_unref_flags(pTHX_ SV *ref, U32 flags)
7728 SV* const target = SvRV(ref);
7730 if (SvWEAKREF(ref)) {
7731 sv_del_backref(target, ref);
7733 SvRV_set(ref, NULL);
7736 SvRV_set(ref, NULL);
7738 /* You can't have a || SvREADONLY(target) here, as $a = $$a, where $a was
7739 assigned to as BEGIN {$a = \"Foo"} will fail. */
7740 if (SvREFCNT(target) != 1 || (flags & SV_IMMEDIATE_UNREF))
7741 SvREFCNT_dec(target);
7742 else /* XXX Hack, but hard to make $a=$a->[1] work otherwise */
7743 sv_2mortal(target); /* Schedule for freeing later */
7747 =for apidoc sv_untaint
7749 Untaint an SV. Use C<SvTAINTED_off> instead.
7754 Perl_sv_untaint(pTHX_ SV *sv)
7756 if (SvTYPE(sv) >= SVt_PVMG && SvMAGIC(sv)) {
7757 MAGIC * const mg = mg_find(sv, PERL_MAGIC_taint);
7764 =for apidoc sv_tainted
7766 Test an SV for taintedness. Use C<SvTAINTED> instead.
7771 Perl_sv_tainted(pTHX_ SV *sv)
7773 if (SvTYPE(sv) >= SVt_PVMG && SvMAGIC(sv)) {
7774 const MAGIC * const mg = mg_find(sv, PERL_MAGIC_taint);
7775 if (mg && (mg->mg_len & 1) )
7782 =for apidoc sv_setpviv
7784 Copies an integer into the given SV, also updating its string value.
7785 Does not handle 'set' magic. See C<sv_setpviv_mg>.
7791 Perl_sv_setpviv(pTHX_ SV *sv, IV iv)
7793 char buf[TYPE_CHARS(UV)];
7795 char * const ptr = uiv_2buf(buf, iv, 0, 0, &ebuf);
7797 sv_setpvn(sv, ptr, ebuf - ptr);
7801 =for apidoc sv_setpviv_mg
7803 Like C<sv_setpviv>, but also handles 'set' magic.
7809 Perl_sv_setpviv_mg(pTHX_ SV *sv, IV iv)
7815 #if defined(PERL_IMPLICIT_CONTEXT)
7817 /* pTHX_ magic can't cope with varargs, so this is a no-context
7818 * version of the main function, (which may itself be aliased to us).
7819 * Don't access this version directly.
7823 Perl_sv_setpvf_nocontext(SV *sv, const char* pat, ...)
7827 va_start(args, pat);
7828 sv_vsetpvf(sv, pat, &args);
7832 /* pTHX_ magic can't cope with varargs, so this is a no-context
7833 * version of the main function, (which may itself be aliased to us).
7834 * Don't access this version directly.
7838 Perl_sv_setpvf_mg_nocontext(SV *sv, const char* pat, ...)
7842 va_start(args, pat);
7843 sv_vsetpvf_mg(sv, pat, &args);
7849 =for apidoc sv_setpvf
7851 Works like C<sv_catpvf> but copies the text into the SV instead of
7852 appending it. Does not handle 'set' magic. See C<sv_setpvf_mg>.
7858 Perl_sv_setpvf(pTHX_ SV *sv, const char* pat, ...)
7861 va_start(args, pat);
7862 sv_vsetpvf(sv, pat, &args);
7867 =for apidoc sv_vsetpvf
7869 Works like C<sv_vcatpvf> but copies the text into the SV instead of
7870 appending it. Does not handle 'set' magic. See C<sv_vsetpvf_mg>.
7872 Usually used via its frontend C<sv_setpvf>.
7878 Perl_sv_vsetpvf(pTHX_ SV *sv, const char* pat, va_list* args)
7880 sv_vsetpvfn(sv, pat, strlen(pat), args, NULL, 0, NULL);
7884 =for apidoc sv_setpvf_mg
7886 Like C<sv_setpvf>, but also handles 'set' magic.
7892 Perl_sv_setpvf_mg(pTHX_ SV *sv, const char* pat, ...)
7895 va_start(args, pat);
7896 sv_vsetpvf_mg(sv, pat, &args);
7901 =for apidoc sv_vsetpvf_mg
7903 Like C<sv_vsetpvf>, but also handles 'set' magic.
7905 Usually used via its frontend C<sv_setpvf_mg>.
7911 Perl_sv_vsetpvf_mg(pTHX_ SV *sv, const char* pat, va_list* args)
7913 sv_vsetpvfn(sv, pat, strlen(pat), args, NULL, 0, NULL);
7917 #if defined(PERL_IMPLICIT_CONTEXT)
7919 /* pTHX_ magic can't cope with varargs, so this is a no-context
7920 * version of the main function, (which may itself be aliased to us).
7921 * Don't access this version directly.
7925 Perl_sv_catpvf_nocontext(SV *sv, const char* pat, ...)
7929 va_start(args, pat);
7930 sv_vcatpvf(sv, pat, &args);
7934 /* pTHX_ magic can't cope with varargs, so this is a no-context
7935 * version of the main function, (which may itself be aliased to us).
7936 * Don't access this version directly.
7940 Perl_sv_catpvf_mg_nocontext(SV *sv, const char* pat, ...)
7944 va_start(args, pat);
7945 sv_vcatpvf_mg(sv, pat, &args);
7951 =for apidoc sv_catpvf
7953 Processes its arguments like C<sprintf> and appends the formatted
7954 output to an SV. If the appended data contains "wide" characters
7955 (including, but not limited to, SVs with a UTF-8 PV formatted with %s,
7956 and characters >255 formatted with %c), the original SV might get
7957 upgraded to UTF-8. Handles 'get' magic, but not 'set' magic. See
7958 C<sv_catpvf_mg>. If the original SV was UTF-8, the pattern should be
7959 valid UTF-8; if the original SV was bytes, the pattern should be too.
7964 Perl_sv_catpvf(pTHX_ SV *sv, const char* pat, ...)
7967 va_start(args, pat);
7968 sv_vcatpvf(sv, pat, &args);
7973 =for apidoc sv_vcatpvf
7975 Processes its arguments like C<vsprintf> and appends the formatted output
7976 to an SV. Does not handle 'set' magic. See C<sv_vcatpvf_mg>.
7978 Usually used via its frontend C<sv_catpvf>.
7984 Perl_sv_vcatpvf(pTHX_ SV *sv, const char* pat, va_list* args)
7986 sv_vcatpvfn(sv, pat, strlen(pat), args, NULL, 0, NULL);
7990 =for apidoc sv_catpvf_mg
7992 Like C<sv_catpvf>, but also handles 'set' magic.
7998 Perl_sv_catpvf_mg(pTHX_ SV *sv, const char* pat, ...)
8001 va_start(args, pat);
8002 sv_vcatpvf_mg(sv, pat, &args);
8007 =for apidoc sv_vcatpvf_mg
8009 Like C<sv_vcatpvf>, but also handles 'set' magic.
8011 Usually used via its frontend C<sv_catpvf_mg>.
8017 Perl_sv_vcatpvf_mg(pTHX_ SV *sv, const char* pat, va_list* args)
8019 sv_vcatpvfn(sv, pat, strlen(pat), args, NULL, 0, NULL);
8024 =for apidoc sv_vsetpvfn
8026 Works like C<sv_vcatpvfn> but copies the text into the SV instead of
8029 Usually used via one of its frontends C<sv_vsetpvf> and C<sv_vsetpvf_mg>.
8035 Perl_sv_vsetpvfn(pTHX_ SV *sv, const char *pat, STRLEN patlen, va_list *args, SV **svargs, I32 svmax, bool *maybe_tainted)
8037 sv_setpvn(sv, "", 0);
8038 sv_vcatpvfn(sv, pat, patlen, args, svargs, svmax, maybe_tainted);
8042 S_expect_number(pTHX_ char** pattern)
8046 switch (**pattern) {
8047 case '1': case '2': case '3':
8048 case '4': case '5': case '6':
8049 case '7': case '8': case '9':
8050 var = *(*pattern)++ - '0';
8051 while (isDIGIT(**pattern)) {
8052 const I32 tmp = var * 10 + (*(*pattern)++ - '0');
8054 Perl_croak(aTHX_ "Integer overflow in format string for %s", (PL_op ? OP_NAME(PL_op) : "sv_vcatpvfn"));
8062 S_F0convert(NV nv, char *endbuf, STRLEN *len)
8064 const int neg = nv < 0;
8073 if (uv & 1 && uv == nv)
8074 uv--; /* Round to even */
8076 const unsigned dig = uv % 10;
8089 =for apidoc sv_vcatpvfn
8091 Processes its arguments like C<vsprintf> and appends the formatted output
8092 to an SV. Uses an array of SVs if the C style variable argument list is
8093 missing (NULL). When running with taint checks enabled, indicates via
8094 C<maybe_tainted> if results are untrustworthy (often due to the use of
8097 Usually used via one of its frontends C<sv_vcatpvf> and C<sv_vcatpvf_mg>.
8103 #define VECTORIZE_ARGS vecsv = va_arg(*args, SV*);\
8104 vecstr = (U8*)SvPV_const(vecsv,veclen);\
8105 vec_utf8 = DO_UTF8(vecsv);
8107 /* XXX maybe_tainted is never assigned to, so the doc above is lying. */
8110 Perl_sv_vcatpvfn(pTHX_ SV *sv, const char *pat, STRLEN patlen, va_list *args, SV **svargs, I32 svmax, bool *maybe_tainted)
8118 static const char nullstr[] = "(null)";
8120 bool has_utf8 = DO_UTF8(sv); /* has the result utf8? */
8121 const bool pat_utf8 = has_utf8; /* the pattern is in utf8? */
8123 /* Times 4: a decimal digit takes more than 3 binary digits.
8124 * NV_DIG: mantissa takes than many decimal digits.
8125 * Plus 32: Playing safe. */
8126 char ebuf[IV_DIG * 4 + NV_DIG + 32];
8127 /* large enough for "%#.#f" --chip */
8128 /* what about long double NVs? --jhi */
8130 PERL_UNUSED_ARG(maybe_tainted);
8132 /* no matter what, this is a string now */
8133 (void)SvPV_force(sv, origlen);
8135 /* special-case "", "%s", and "%-p" (SVf - see below) */
8138 if (patlen == 2 && pat[0] == '%' && pat[1] == 's') {
8140 const char * const s = va_arg(*args, char*);
8141 sv_catpv(sv, s ? s : nullstr);
8143 else if (svix < svmax) {
8144 sv_catsv(sv, *svargs);
8148 if (args && patlen == 3 && pat[0] == '%' &&
8149 pat[1] == '-' && pat[2] == 'p') {
8150 argsv = va_arg(*args, SV*);
8151 sv_catsv(sv, argsv);
8155 #ifndef USE_LONG_DOUBLE
8156 /* special-case "%.<number>[gf]" */
8157 if ( !args && patlen <= 5 && pat[0] == '%' && pat[1] == '.'
8158 && (pat[patlen-1] == 'g' || pat[patlen-1] == 'f') ) {
8159 unsigned digits = 0;
8163 while (*pp >= '0' && *pp <= '9')
8164 digits = 10 * digits + (*pp++ - '0');
8165 if (pp - pat == (int)patlen - 1) {
8173 /* Add check for digits != 0 because it seems that some
8174 gconverts are buggy in this case, and we don't yet have
8175 a Configure test for this. */
8176 if (digits && digits < sizeof(ebuf) - NV_DIG - 10) {
8177 /* 0, point, slack */
8178 Gconvert(nv, (int)digits, 0, ebuf);
8180 if (*ebuf) /* May return an empty string for digits==0 */
8183 } else if (!digits) {
8186 if ((p = F0convert(nv, ebuf + sizeof ebuf, &l))) {
8187 sv_catpvn(sv, p, l);
8193 #endif /* !USE_LONG_DOUBLE */
8195 if (!args && svix < svmax && DO_UTF8(*svargs))
8198 patend = (char*)pat + patlen;
8199 for (p = (char*)pat; p < patend; p = q) {
8202 bool vectorize = FALSE;
8203 bool vectorarg = FALSE;
8204 bool vec_utf8 = FALSE;
8210 bool has_precis = FALSE;
8212 const I32 osvix = svix;
8213 bool is_utf8 = FALSE; /* is this item utf8? */
8214 #ifdef HAS_LDBL_SPRINTF_BUG
8215 /* This is to try to fix a bug with irix/nonstop-ux/powerux and
8216 with sfio - Allen <allens@cpan.org> */
8217 bool fix_ldbl_sprintf_bug = FALSE;
8221 U8 utf8buf[UTF8_MAXBYTES+1];
8222 STRLEN esignlen = 0;
8224 const char *eptr = NULL;
8227 const U8 *vecstr = NULL;
8234 /* we need a long double target in case HAS_LONG_DOUBLE but
8237 #if defined(HAS_LONG_DOUBLE) && LONG_DOUBLESIZE > DOUBLESIZE
8245 const char *dotstr = ".";
8246 STRLEN dotstrlen = 1;
8247 I32 efix = 0; /* explicit format parameter index */
8248 I32 ewix = 0; /* explicit width index */
8249 I32 epix = 0; /* explicit precision index */
8250 I32 evix = 0; /* explicit vector index */
8251 bool asterisk = FALSE;
8253 /* echo everything up to the next format specification */
8254 for (q = p; q < patend && *q != '%'; ++q) ;
8256 if (has_utf8 && !pat_utf8)
8257 sv_catpvn_utf8_upgrade(sv, p, q - p, nsv);
8259 sv_catpvn(sv, p, q - p);
8266 We allow format specification elements in this order:
8267 \d+\$ explicit format parameter index
8269 v|\*(\d+\$)?v vector with optional (optionally specified) arg
8270 0 flag (as above): repeated to allow "v02"
8271 \d+|\*(\d+\$)? width using optional (optionally specified) arg
8272 \.(\d*|\*(\d+\$)?) precision using optional (optionally specified) arg
8274 [%bcdefginopsuxDFOUX] format (mandatory)
8279 As of perl5.9.3, printf format checking is on by default.
8280 Internally, perl uses %p formats to provide an escape to
8281 some extended formatting. This block deals with those
8282 extensions: if it does not match, (char*)q is reset and
8283 the normal format processing code is used.
8285 Currently defined extensions are:
8286 %p include pointer address (standard)
8287 %-p (SVf) include an SV (previously %_)
8288 %-<num>p include an SV with precision <num>
8289 %1p (VDf) include a v-string (as %vd)
8290 %<num>p reserved for future extensions
8292 Robin Barker 2005-07-14
8299 n = expect_number(&q);
8306 argsv = va_arg(*args, SV*);
8307 eptr = SvPVx_const(argsv, elen);
8313 else if (n == vdNUMBER) { /* VDf */
8320 if (ckWARN_d(WARN_INTERNAL))
8321 Perl_warner(aTHX_ packWARN(WARN_INTERNAL),
8322 "internal %%<num>p might conflict with future printf extensions");
8328 if ( (width = expect_number(&q)) ) {
8369 if ( (ewix = expect_number(&q)) )
8378 if ((vectorarg = asterisk)) {
8391 width = expect_number(&q);
8397 vecsv = va_arg(*args, SV*);
8399 vecsv = (evix > 0 && evix <= svmax)
8400 ? svargs[evix-1] : &PL_sv_undef;
8402 vecsv = svix < svmax ? svargs[svix++] : &PL_sv_undef;
8404 dotstr = SvPV_const(vecsv, dotstrlen);
8405 /* Keep the DO_UTF8 test *after* the SvPV call, else things go
8406 bad with tied or overloaded values that return UTF8. */
8409 else if (has_utf8) {
8410 vecsv = sv_mortalcopy(vecsv);
8411 sv_utf8_upgrade(vecsv);
8412 dotstr = SvPV_const(vecsv, dotstrlen);
8419 else if (efix ? (efix > 0 && efix <= svmax) : svix < svmax) {
8420 vecsv = svargs[efix ? efix-1 : svix++];
8421 vecstr = (U8*)SvPV_const(vecsv,veclen);
8422 vec_utf8 = DO_UTF8(vecsv);
8424 /* if this is a version object, we need to convert
8425 * back into v-string notation and then let the
8426 * vectorize happen normally
8428 if (sv_derived_from(vecsv, "version")) {
8429 char *version = savesvpv(vecsv);
8430 if ( hv_exists((HV*)SvRV(vecsv), "alpha", 5 ) ) {
8431 Perl_warner(aTHX_ packWARN(WARN_INTERNAL),
8432 "vector argument not supported with alpha versions");
8435 vecsv = sv_newmortal();
8436 /* scan_vstring is expected to be called during
8437 * tokenization, so we need to fake up the end
8438 * of the buffer for it
8440 PL_bufend = version + veclen;
8441 scan_vstring(version, vecsv);
8442 vecstr = (U8*)SvPV_const(vecsv, veclen);
8443 vec_utf8 = DO_UTF8(vecsv);
8455 i = va_arg(*args, int);
8457 i = (ewix ? ewix <= svmax : svix < svmax) ?
8458 SvIVx(svargs[ewix ? ewix-1 : svix++]) : 0;
8460 width = (i < 0) ? -i : i;
8470 if ( ((epix = expect_number(&q))) && (*q++ != '$') )
8472 /* XXX: todo, support specified precision parameter */
8476 i = va_arg(*args, int);
8478 i = (ewix ? ewix <= svmax : svix < svmax)
8479 ? SvIVx(svargs[ewix ? ewix-1 : svix++]) : 0;
8480 precis = (i < 0) ? 0 : i;
8485 precis = precis * 10 + (*q++ - '0');
8494 case 'I': /* Ix, I32x, and I64x */
8496 if (q[1] == '6' && q[2] == '4') {
8502 if (q[1] == '3' && q[2] == '2') {
8512 #if defined(HAS_QUAD) || defined(HAS_LONG_DOUBLE)
8523 #if defined(HAS_QUAD) || defined(HAS_LONG_DOUBLE)
8524 if (*(q + 1) == 'l') { /* lld, llf */
8550 if (!vectorize && !args) {
8552 const I32 i = efix-1;
8553 argsv = (i >= 0 && i < svmax) ? svargs[i] : &PL_sv_undef;
8555 argsv = (svix >= 0 && svix < svmax)
8556 ? svargs[svix++] : &PL_sv_undef;
8567 uv = (args) ? va_arg(*args, int) : SvIVx(argsv);
8569 (!UNI_IS_INVARIANT(uv) && SvUTF8(sv)))
8571 eptr = (char*)utf8buf;
8572 elen = uvchr_to_utf8((U8*)eptr, uv) - utf8buf;
8586 eptr = va_arg(*args, char*);
8588 #ifdef MACOS_TRADITIONAL
8589 /* On MacOS, %#s format is used for Pascal strings */
8594 elen = strlen(eptr);
8596 eptr = (char *)nullstr;
8597 elen = sizeof nullstr - 1;
8601 eptr = SvPVx_const(argsv, elen);
8602 if (DO_UTF8(argsv)) {
8603 if (has_precis && precis < elen) {
8605 sv_pos_u2b(argsv, &p, 0); /* sticks at end */
8608 if (width) { /* fudge width (can't fudge elen) */
8609 width += elen - sv_len_utf8(argsv);
8616 if (has_precis && elen > precis)
8623 if (alt || vectorize)
8625 uv = PTR2UV(args ? va_arg(*args, void*) : argsv);
8646 uv = utf8n_to_uvchr(vecstr, veclen, &ulen,
8655 esignbuf[esignlen++] = plus;
8659 case 'h': iv = (short)va_arg(*args, int); break;
8660 case 'l': iv = va_arg(*args, long); break;
8661 case 'V': iv = va_arg(*args, IV); break;
8662 default: iv = va_arg(*args, int); break;
8664 case 'q': iv = va_arg(*args, Quad_t); break;
8669 IV tiv = SvIVx(argsv); /* work around GCC bug #13488 */
8671 case 'h': iv = (short)tiv; break;
8672 case 'l': iv = (long)tiv; break;
8674 default: iv = tiv; break;
8676 case 'q': iv = (Quad_t)tiv; break;
8680 if ( !vectorize ) /* we already set uv above */
8685 esignbuf[esignlen++] = plus;
8689 esignbuf[esignlen++] = '-';
8732 uv = utf8n_to_uvchr(vecstr, veclen, &ulen,
8743 case 'h': uv = (unsigned short)va_arg(*args, unsigned); break;
8744 case 'l': uv = va_arg(*args, unsigned long); break;
8745 case 'V': uv = va_arg(*args, UV); break;
8746 default: uv = va_arg(*args, unsigned); break;
8748 case 'q': uv = va_arg(*args, Uquad_t); break;
8753 UV tuv = SvUVx(argsv); /* work around GCC bug #13488 */
8755 case 'h': uv = (unsigned short)tuv; break;
8756 case 'l': uv = (unsigned long)tuv; break;
8758 default: uv = tuv; break;
8760 case 'q': uv = (Uquad_t)tuv; break;
8767 char *ptr = ebuf + sizeof ebuf;
8773 p = (char*)((c == 'X')
8774 ? "0123456789ABCDEF" : "0123456789abcdef");
8780 esignbuf[esignlen++] = '0';
8781 esignbuf[esignlen++] = c; /* 'x' or 'X' */
8789 if (alt && *ptr != '0')
8800 esignbuf[esignlen++] = '0';
8801 esignbuf[esignlen++] = 'b';
8804 default: /* it had better be ten or less */
8808 } while (uv /= base);
8811 elen = (ebuf + sizeof ebuf) - ptr;
8815 zeros = precis - elen;
8816 else if (precis == 0 && elen == 1 && *eptr == '0')
8822 /* FLOATING POINT */
8825 c = 'f'; /* maybe %F isn't supported here */
8833 /* This is evil, but floating point is even more evil */
8835 /* for SV-style calling, we can only get NV
8836 for C-style calling, we assume %f is double;
8837 for simplicity we allow any of %Lf, %llf, %qf for long double
8841 #if defined(USE_LONG_DOUBLE)
8845 /* [perl #20339] - we should accept and ignore %lf rather than die */
8849 #if defined(USE_LONG_DOUBLE)
8850 intsize = args ? 0 : 'q';
8854 #if defined(HAS_LONG_DOUBLE)
8863 /* now we need (long double) if intsize == 'q', else (double) */
8865 #if LONG_DOUBLESIZE > DOUBLESIZE
8867 va_arg(*args, long double) :
8868 va_arg(*args, double)
8870 va_arg(*args, double)
8875 if (c != 'e' && c != 'E') {
8877 /* FIXME: if HAS_LONG_DOUBLE but not USE_LONG_DOUBLE this
8878 will cast our (long double) to (double) */
8879 (void)Perl_frexp(nv, &i);
8880 if (i == PERL_INT_MIN)
8881 Perl_die(aTHX_ "panic: frexp");
8883 need = BIT_DIGITS(i);
8885 need += has_precis ? precis : 6; /* known default */
8890 #ifdef HAS_LDBL_SPRINTF_BUG
8891 /* This is to try to fix a bug with irix/nonstop-ux/powerux and
8892 with sfio - Allen <allens@cpan.org> */
8895 # define MY_DBL_MAX DBL_MAX
8896 # else /* XXX guessing! HUGE_VAL may be defined as infinity, so not using */
8897 # if DOUBLESIZE >= 8
8898 # define MY_DBL_MAX 1.7976931348623157E+308L
8900 # define MY_DBL_MAX 3.40282347E+38L
8904 # ifdef HAS_LDBL_SPRINTF_BUG_LESS1 /* only between -1L & 1L - Allen */
8905 # define MY_DBL_MAX_BUG 1L
8907 # define MY_DBL_MAX_BUG MY_DBL_MAX
8911 # define MY_DBL_MIN DBL_MIN
8912 # else /* XXX guessing! -Allen */
8913 # if DOUBLESIZE >= 8
8914 # define MY_DBL_MIN 2.2250738585072014E-308L
8916 # define MY_DBL_MIN 1.17549435E-38L
8920 if ((intsize == 'q') && (c == 'f') &&
8921 ((nv < MY_DBL_MAX_BUG) && (nv > -MY_DBL_MAX_BUG)) &&
8923 /* it's going to be short enough that
8924 * long double precision is not needed */
8926 if ((nv <= 0L) && (nv >= -0L))
8927 fix_ldbl_sprintf_bug = TRUE; /* 0 is 0 - easiest */
8929 /* would use Perl_fp_class as a double-check but not
8930 * functional on IRIX - see perl.h comments */
8932 if ((nv >= MY_DBL_MIN) || (nv <= -MY_DBL_MIN)) {
8933 /* It's within the range that a double can represent */
8934 #if defined(DBL_MAX) && !defined(DBL_MIN)
8935 if ((nv >= ((long double)1/DBL_MAX)) ||
8936 (nv <= (-(long double)1/DBL_MAX)))
8938 fix_ldbl_sprintf_bug = TRUE;
8941 if (fix_ldbl_sprintf_bug == TRUE) {
8951 # undef MY_DBL_MAX_BUG
8954 #endif /* HAS_LDBL_SPRINTF_BUG */
8956 need += 20; /* fudge factor */
8957 if (PL_efloatsize < need) {
8958 Safefree(PL_efloatbuf);
8959 PL_efloatsize = need + 20; /* more fudge */
8960 Newx(PL_efloatbuf, PL_efloatsize, char);
8961 PL_efloatbuf[0] = '\0';
8964 if ( !(width || left || plus || alt) && fill != '0'
8965 && has_precis && intsize != 'q' ) { /* Shortcuts */
8966 /* See earlier comment about buggy Gconvert when digits,
8968 if ( c == 'g' && precis) {
8969 Gconvert((NV)nv, (int)precis, 0, PL_efloatbuf);
8970 /* May return an empty string for digits==0 */
8971 if (*PL_efloatbuf) {
8972 elen = strlen(PL_efloatbuf);
8973 goto float_converted;
8975 } else if ( c == 'f' && !precis) {
8976 if ((eptr = F0convert(nv, ebuf + sizeof ebuf, &elen)))
8981 char *ptr = ebuf + sizeof ebuf;
8984 /* FIXME: what to do if HAS_LONG_DOUBLE but not PERL_PRIfldbl? */
8985 #if defined(HAS_LONG_DOUBLE) && defined(PERL_PRIfldbl)
8986 if (intsize == 'q') {
8987 /* Copy the one or more characters in a long double
8988 * format before the 'base' ([efgEFG]) character to
8989 * the format string. */
8990 static char const prifldbl[] = PERL_PRIfldbl;
8991 char const *p = prifldbl + sizeof(prifldbl) - 3;
8992 while (p >= prifldbl) { *--ptr = *p--; }
8997 do { *--ptr = '0' + (base % 10); } while (base /= 10);
9002 do { *--ptr = '0' + (base % 10); } while (base /= 10);
9014 /* No taint. Otherwise we are in the strange situation
9015 * where printf() taints but print($float) doesn't.
9017 #if defined(HAS_LONG_DOUBLE)
9018 elen = ((intsize == 'q')
9019 ? my_sprintf(PL_efloatbuf, ptr, nv)
9020 : my_sprintf(PL_efloatbuf, ptr, (double)nv));
9022 elen = my_sprintf(PL_efloatbuf, ptr, nv);
9026 eptr = PL_efloatbuf;
9034 i = SvCUR(sv) - origlen;
9037 case 'h': *(va_arg(*args, short*)) = i; break;
9038 default: *(va_arg(*args, int*)) = i; break;
9039 case 'l': *(va_arg(*args, long*)) = i; break;
9040 case 'V': *(va_arg(*args, IV*)) = i; break;
9042 case 'q': *(va_arg(*args, Quad_t*)) = i; break;
9047 sv_setuv_mg(argsv, (UV)i);
9048 continue; /* not "break" */
9055 && (PL_op->op_type == OP_PRTF || PL_op->op_type == OP_SPRINTF)
9056 && ckWARN(WARN_PRINTF))
9058 SV * const msg = sv_newmortal();
9059 Perl_sv_setpvf(aTHX_ msg, "Invalid conversion in %sprintf: ",
9060 (PL_op->op_type == OP_PRTF) ? "" : "s");
9063 Perl_sv_catpvf(aTHX_ msg,
9064 "\"%%%c\"", c & 0xFF);
9066 Perl_sv_catpvf(aTHX_ msg,
9067 "\"%%\\%03"UVof"\"",
9070 sv_catpvs(msg, "end of string");
9071 Perl_warner(aTHX_ packWARN(WARN_PRINTF), "%"SVf, msg); /* yes, this is reentrant */
9074 /* output mangled stuff ... */
9080 /* ... right here, because formatting flags should not apply */
9081 SvGROW(sv, SvCUR(sv) + elen + 1);
9083 Copy(eptr, p, elen, char);
9086 SvCUR_set(sv, p - SvPVX_const(sv));
9088 continue; /* not "break" */
9091 /* calculate width before utf8_upgrade changes it */
9092 have = esignlen + zeros + elen;
9094 Perl_croak_nocontext(PL_memory_wrap);
9096 if (is_utf8 != has_utf8) {
9099 sv_utf8_upgrade(sv);
9102 SV * const nsv = sv_2mortal(newSVpvn(eptr, elen));
9103 sv_utf8_upgrade(nsv);
9104 eptr = SvPVX_const(nsv);
9107 SvGROW(sv, SvCUR(sv) + elen + 1);
9112 need = (have > width ? have : width);
9115 if (need >= (((STRLEN)~0) - SvCUR(sv) - dotstrlen - 1))
9116 Perl_croak_nocontext(PL_memory_wrap);
9117 SvGROW(sv, SvCUR(sv) + need + dotstrlen + 1);
9119 if (esignlen && fill == '0') {
9121 for (i = 0; i < (int)esignlen; i++)
9125 memset(p, fill, gap);
9128 if (esignlen && fill != '0') {
9130 for (i = 0; i < (int)esignlen; i++)
9135 for (i = zeros; i; i--)
9139 Copy(eptr, p, elen, char);
9143 memset(p, ' ', gap);
9148 Copy(dotstr, p, dotstrlen, char);
9152 vectorize = FALSE; /* done iterating over vecstr */
9159 SvCUR_set(sv, p - SvPVX_const(sv));
9167 /* =========================================================================
9169 =head1 Cloning an interpreter
9171 All the macros and functions in this section are for the private use of
9172 the main function, perl_clone().
9174 The foo_dup() functions make an exact copy of an existing foo thinngy.
9175 During the course of a cloning, a hash table is used to map old addresses
9176 to new addresses. The table is created and manipulated with the
9177 ptr_table_* functions.
9181 ============================================================================*/
9184 #if defined(USE_ITHREADS)
9186 #ifndef GpREFCNT_inc
9187 # define GpREFCNT_inc(gp) ((gp) ? (++(gp)->gp_refcnt, (gp)) : (GP*)NULL)
9191 #define sv_dup_inc(s,t) SvREFCNT_inc(sv_dup(s,t))
9192 #define av_dup(s,t) (AV*)sv_dup((SV*)s,t)
9193 #define av_dup_inc(s,t) (AV*)SvREFCNT_inc(sv_dup((SV*)s,t))
9194 #define hv_dup(s,t) (HV*)sv_dup((SV*)s,t)
9195 #define hv_dup_inc(s,t) (HV*)SvREFCNT_inc(sv_dup((SV*)s,t))
9196 #define cv_dup(s,t) (CV*)sv_dup((SV*)s,t)
9197 #define cv_dup_inc(s,t) (CV*)SvREFCNT_inc(sv_dup((SV*)s,t))
9198 #define io_dup(s,t) (IO*)sv_dup((SV*)s,t)
9199 #define io_dup_inc(s,t) (IO*)SvREFCNT_inc(sv_dup((SV*)s,t))
9200 #define gv_dup(s,t) (GV*)sv_dup((SV*)s,t)
9201 #define gv_dup_inc(s,t) (GV*)SvREFCNT_inc(sv_dup((SV*)s,t))
9202 #define SAVEPV(p) ((p) ? savepv(p) : NULL)
9203 #define SAVEPVN(p,n) ((p) ? savepvn(p,n) : NULL)
9206 /* Duplicate a regexp. Required reading: pregcomp() and pregfree() in
9207 regcomp.c. AMS 20010712 */
9210 Perl_re_dup(pTHX_ const REGEXP *r, CLONE_PARAMS *param)
9215 struct reg_substr_datum *s;
9218 return (REGEXP *)NULL;
9220 if ((ret = (REGEXP *)ptr_table_fetch(PL_ptr_table, r)))
9223 len = r->offsets[0];
9224 npar = r->nparens+1;
9226 Newxc(ret, sizeof(regexp) + (len+1)*sizeof(regnode), char, regexp);
9227 Copy(r->program, ret->program, len+1, regnode);
9229 Newx(ret->startp, npar, I32);
9230 Copy(r->startp, ret->startp, npar, I32);
9231 Newx(ret->endp, npar, I32);
9232 Copy(r->startp, ret->startp, npar, I32);
9234 Newx(ret->substrs, 1, struct reg_substr_data);
9235 for (s = ret->substrs->data, i = 0; i < 3; i++, s++) {
9236 s->min_offset = r->substrs->data[i].min_offset;
9237 s->max_offset = r->substrs->data[i].max_offset;
9238 s->substr = sv_dup_inc(r->substrs->data[i].substr, param);
9239 s->utf8_substr = sv_dup_inc(r->substrs->data[i].utf8_substr, param);
9242 ret->regstclass = NULL;
9245 const int count = r->data->count;
9248 Newxc(d, sizeof(struct reg_data) + count*sizeof(void *),
9249 char, struct reg_data);
9250 Newx(d->what, count, U8);
9253 for (i = 0; i < count; i++) {
9254 d->what[i] = r->data->what[i];
9255 switch (d->what[i]) {
9256 /* legal options are one of: sfpont
9257 see also regcomp.h and pregfree() */
9259 d->data[i] = sv_dup_inc((SV *)r->data->data[i], param);
9262 d->data[i] = av_dup_inc((AV *)r->data->data[i], param);
9265 /* This is cheating. */
9266 Newx(d->data[i], 1, struct regnode_charclass_class);
9267 StructCopy(r->data->data[i], d->data[i],
9268 struct regnode_charclass_class);
9269 ret->regstclass = (regnode*)d->data[i];
9272 /* Compiled op trees are readonly, and can thus be
9273 shared without duplication. */
9275 d->data[i] = (void*)OpREFCNT_inc((OP*)r->data->data[i]);
9279 d->data[i] = r->data->data[i];
9282 d->data[i] = r->data->data[i];
9284 ((reg_trie_data*)d->data[i])->refcount++;
9288 Perl_croak(aTHX_ "panic: re_dup unknown data code '%c'", r->data->what[i]);
9297 Newx(ret->offsets, 2*len+1, U32);
9298 Copy(r->offsets, ret->offsets, 2*len+1, U32);
9300 ret->precomp = SAVEPVN(r->precomp, r->prelen);
9301 ret->refcnt = r->refcnt;
9302 ret->minlen = r->minlen;
9303 ret->prelen = r->prelen;
9304 ret->nparens = r->nparens;
9305 ret->lastparen = r->lastparen;
9306 ret->lastcloseparen = r->lastcloseparen;
9307 ret->reganch = r->reganch;
9309 ret->sublen = r->sublen;
9311 if (RX_MATCH_COPIED(ret))
9312 ret->subbeg = SAVEPVN(r->subbeg, r->sublen);
9315 #ifdef PERL_OLD_COPY_ON_WRITE
9316 ret->saved_copy = NULL;
9319 ptr_table_store(PL_ptr_table, r, ret);
9323 /* duplicate a file handle */
9326 Perl_fp_dup(pTHX_ PerlIO *fp, char type, CLONE_PARAMS *param)
9330 PERL_UNUSED_ARG(type);
9333 return (PerlIO*)NULL;
9335 /* look for it in the table first */
9336 ret = (PerlIO*)ptr_table_fetch(PL_ptr_table, fp);
9340 /* create anew and remember what it is */
9341 ret = PerlIO_fdupopen(aTHX_ fp, param, PERLIO_DUP_CLONE);
9342 ptr_table_store(PL_ptr_table, fp, ret);
9346 /* duplicate a directory handle */
9349 Perl_dirp_dup(pTHX_ DIR *dp)
9357 /* duplicate a typeglob */
9360 Perl_gp_dup(pTHX_ GP *gp, CLONE_PARAMS* param)
9365 /* look for it in the table first */
9366 ret = (GP*)ptr_table_fetch(PL_ptr_table, gp);
9370 /* create anew and remember what it is */
9372 ptr_table_store(PL_ptr_table, gp, ret);
9375 ret->gp_refcnt = 0; /* must be before any other dups! */
9376 ret->gp_sv = sv_dup_inc(gp->gp_sv, param);
9377 ret->gp_io = io_dup_inc(gp->gp_io, param);
9378 ret->gp_form = cv_dup_inc(gp->gp_form, param);
9379 ret->gp_av = av_dup_inc(gp->gp_av, param);
9380 ret->gp_hv = hv_dup_inc(gp->gp_hv, param);
9381 ret->gp_egv = gv_dup(gp->gp_egv, param);/* GvEGV is not refcounted */
9382 ret->gp_cv = cv_dup_inc(gp->gp_cv, param);
9383 ret->gp_cvgen = gp->gp_cvgen;
9384 ret->gp_line = gp->gp_line;
9385 ret->gp_file = gp->gp_file; /* points to COP.cop_file */
9389 /* duplicate a chain of magic */
9392 Perl_mg_dup(pTHX_ MAGIC *mg, CLONE_PARAMS* param)
9394 MAGIC *mgprev = (MAGIC*)NULL;
9397 return (MAGIC*)NULL;
9398 /* look for it in the table first */
9399 mgret = (MAGIC*)ptr_table_fetch(PL_ptr_table, mg);
9403 for (; mg; mg = mg->mg_moremagic) {
9405 Newxz(nmg, 1, MAGIC);
9407 mgprev->mg_moremagic = nmg;
9410 nmg->mg_virtual = mg->mg_virtual; /* XXX copy dynamic vtable? */
9411 nmg->mg_private = mg->mg_private;
9412 nmg->mg_type = mg->mg_type;
9413 nmg->mg_flags = mg->mg_flags;
9414 if (mg->mg_type == PERL_MAGIC_qr) {
9415 nmg->mg_obj = (SV*)re_dup((REGEXP*)mg->mg_obj, param);
9417 else if(mg->mg_type == PERL_MAGIC_backref) {
9418 /* The backref AV has its reference count deliberately bumped by
9420 nmg->mg_obj = SvREFCNT_inc(av_dup_inc((AV*) mg->mg_obj, param));
9422 else if (mg->mg_type == PERL_MAGIC_symtab) {
9423 nmg->mg_obj = mg->mg_obj;
9426 nmg->mg_obj = (mg->mg_flags & MGf_REFCOUNTED)
9427 ? sv_dup_inc(mg->mg_obj, param)
9428 : sv_dup(mg->mg_obj, param);
9430 nmg->mg_len = mg->mg_len;
9431 nmg->mg_ptr = mg->mg_ptr; /* XXX random ptr? */
9432 if (mg->mg_ptr && mg->mg_type != PERL_MAGIC_regex_global) {
9433 if (mg->mg_len > 0) {
9434 nmg->mg_ptr = SAVEPVN(mg->mg_ptr, mg->mg_len);
9435 if (mg->mg_type == PERL_MAGIC_overload_table &&
9436 AMT_AMAGIC((AMT*)mg->mg_ptr))
9438 const AMT * const amtp = (AMT*)mg->mg_ptr;
9439 AMT * const namtp = (AMT*)nmg->mg_ptr;
9441 for (i = 1; i < NofAMmeth; i++) {
9442 namtp->table[i] = cv_dup_inc(amtp->table[i], param);
9446 else if (mg->mg_len == HEf_SVKEY)
9447 nmg->mg_ptr = (char*)sv_dup_inc((SV*)mg->mg_ptr, param);
9449 if ((mg->mg_flags & MGf_DUP) && mg->mg_virtual && mg->mg_virtual->svt_dup) {
9450 CALL_FPTR(nmg->mg_virtual->svt_dup)(aTHX_ nmg, param);
9457 /* create a new pointer-mapping table */
9460 Perl_ptr_table_new(pTHX)
9463 Newxz(tbl, 1, PTR_TBL_t);
9466 Newxz(tbl->tbl_ary, tbl->tbl_max + 1, PTR_TBL_ENT_t*);
9470 #define PTR_TABLE_HASH(ptr) \
9471 ((PTR2UV(ptr) >> 3) ^ (PTR2UV(ptr) >> (3 + 7)) ^ (PTR2UV(ptr) >> (3 + 17)))
9474 we use the PTE_SVSLOT 'reservation' made above, both here (in the
9475 following define) and at call to new_body_inline made below in
9476 Perl_ptr_table_store()
9479 #define del_pte(p) del_body_type(p, PTE_SVSLOT)
9481 /* map an existing pointer using a table */
9483 STATIC PTR_TBL_ENT_t *
9484 S_ptr_table_find(PTR_TBL_t *tbl, const void *sv) {
9485 PTR_TBL_ENT_t *tblent;
9486 const UV hash = PTR_TABLE_HASH(sv);
9488 tblent = tbl->tbl_ary[hash & tbl->tbl_max];
9489 for (; tblent; tblent = tblent->next) {
9490 if (tblent->oldval == sv)
9497 Perl_ptr_table_fetch(pTHX_ PTR_TBL_t *tbl, const void *sv)
9499 PTR_TBL_ENT_t const *const tblent = ptr_table_find(tbl, sv);
9500 return tblent ? tblent->newval : (void *) 0;
9503 /* add a new entry to a pointer-mapping table */
9506 Perl_ptr_table_store(pTHX_ PTR_TBL_t *tbl, const void *oldsv, void *newsv)
9508 PTR_TBL_ENT_t *tblent = S_ptr_table_find(tbl, oldsv);
9511 tblent->newval = newsv;
9513 const UV entry = PTR_TABLE_HASH(oldsv) & tbl->tbl_max;
9515 new_body_inline(tblent, PTE_SVSLOT);
9517 tblent->oldval = oldsv;
9518 tblent->newval = newsv;
9519 tblent->next = tbl->tbl_ary[entry];
9520 tbl->tbl_ary[entry] = tblent;
9522 if (tblent->next && tbl->tbl_items > tbl->tbl_max)
9523 ptr_table_split(tbl);
9527 /* double the hash bucket size of an existing ptr table */
9530 Perl_ptr_table_split(pTHX_ PTR_TBL_t *tbl)
9532 PTR_TBL_ENT_t **ary = tbl->tbl_ary;
9533 const UV oldsize = tbl->tbl_max + 1;
9534 UV newsize = oldsize * 2;
9537 Renew(ary, newsize, PTR_TBL_ENT_t*);
9538 Zero(&ary[oldsize], newsize-oldsize, PTR_TBL_ENT_t*);
9539 tbl->tbl_max = --newsize;
9541 for (i=0; i < oldsize; i++, ary++) {
9542 PTR_TBL_ENT_t **curentp, **entp, *ent;
9545 curentp = ary + oldsize;
9546 for (entp = ary, ent = *ary; ent; ent = *entp) {
9547 if ((newsize & PTR_TABLE_HASH(ent->oldval)) != i) {
9549 ent->next = *curentp;
9559 /* remove all the entries from a ptr table */
9562 Perl_ptr_table_clear(pTHX_ PTR_TBL_t *tbl)
9564 if (tbl && tbl->tbl_items) {
9565 register PTR_TBL_ENT_t * const * const array = tbl->tbl_ary;
9566 UV riter = tbl->tbl_max;
9569 PTR_TBL_ENT_t *entry = array[riter];
9572 PTR_TBL_ENT_t * const oentry = entry;
9573 entry = entry->next;
9582 /* clear and free a ptr table */
9585 Perl_ptr_table_free(pTHX_ PTR_TBL_t *tbl)
9590 ptr_table_clear(tbl);
9591 Safefree(tbl->tbl_ary);
9597 Perl_rvpv_dup(pTHX_ SV *dstr, const SV *sstr, CLONE_PARAMS* param)
9600 SvRV_set(dstr, SvWEAKREF(sstr)
9601 ? sv_dup(SvRV(sstr), param)
9602 : sv_dup_inc(SvRV(sstr), param));
9605 else if (SvPVX_const(sstr)) {
9606 /* Has something there */
9608 /* Normal PV - clone whole allocated space */
9609 SvPV_set(dstr, SAVEPVN(SvPVX_const(sstr), SvLEN(sstr)-1));
9610 if (SvREADONLY(sstr) && SvFAKE(sstr)) {
9611 /* Not that normal - actually sstr is copy on write.
9612 But we are a true, independant SV, so: */
9613 SvREADONLY_off(dstr);
9618 /* Special case - not normally malloced for some reason */
9619 if ((SvREADONLY(sstr) && SvFAKE(sstr))) {
9620 /* A "shared" PV - clone it as "shared" PV */
9622 HEK_KEY(hek_dup(SvSHARED_HEK_FROM_PV(SvPVX_const(sstr)),
9626 /* Some other special case - random pointer */
9627 SvPV_set(dstr, SvPVX(sstr));
9633 if (SvTYPE(dstr) == SVt_RV)
9634 SvRV_set(dstr, NULL);
9636 SvPV_set(dstr, NULL);
9640 /* duplicate an SV of any type (including AV, HV etc) */
9643 Perl_sv_dup(pTHX_ const SV *sstr, CLONE_PARAMS* param)
9648 if (!sstr || SvTYPE(sstr) == SVTYPEMASK)
9650 /* look for it in the table first */
9651 dstr = (SV*)ptr_table_fetch(PL_ptr_table, sstr);
9655 if(param->flags & CLONEf_JOIN_IN) {
9656 /** We are joining here so we don't want do clone
9657 something that is bad **/
9658 if (SvTYPE(sstr) == SVt_PVHV) {
9659 const char * const hvname = HvNAME_get(sstr);
9661 /** don't clone stashes if they already exist **/
9662 return (SV*)gv_stashpv(hvname,0);
9666 /* create anew and remember what it is */
9669 #ifdef DEBUG_LEAKING_SCALARS
9670 dstr->sv_debug_optype = sstr->sv_debug_optype;
9671 dstr->sv_debug_line = sstr->sv_debug_line;
9672 dstr->sv_debug_inpad = sstr->sv_debug_inpad;
9673 dstr->sv_debug_cloned = 1;
9674 dstr->sv_debug_file = savepv(sstr->sv_debug_file);
9677 ptr_table_store(PL_ptr_table, sstr, dstr);
9680 SvFLAGS(dstr) = SvFLAGS(sstr);
9681 SvFLAGS(dstr) &= ~SVf_OOK; /* don't propagate OOK hack */
9682 SvREFCNT(dstr) = 0; /* must be before any other dups! */
9685 if (SvANY(sstr) && PL_watch_pvx && SvPVX_const(sstr) == PL_watch_pvx)
9686 PerlIO_printf(Perl_debug_log, "watch at %p hit, found string \"%s\"\n",
9687 PL_watch_pvx, SvPVX_const(sstr));
9690 /* don't clone objects whose class has asked us not to */
9691 if (SvOBJECT(sstr) && ! (SvFLAGS(SvSTASH(sstr)) & SVphv_CLONEABLE)) {
9692 SvFLAGS(dstr) &= ~SVTYPEMASK;
9697 switch (SvTYPE(sstr)) {
9702 SvANY(dstr) = (XPVIV*)((char*)&(dstr->sv_u.svu_iv) - STRUCT_OFFSET(XPVIV, xiv_iv));
9703 SvIV_set(dstr, SvIVX(sstr));
9706 SvANY(dstr) = new_XNV();
9707 SvNV_set(dstr, SvNVX(sstr));
9710 SvANY(dstr) = &(dstr->sv_u.svu_rv);
9711 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
9715 /* These are all the types that need complex bodies allocating. */
9717 const svtype sv_type = SvTYPE(sstr);
9718 const struct body_details *const sv_type_details
9719 = bodies_by_type + sv_type;
9723 Perl_croak(aTHX_ "Bizarre SvTYPE [%" IVdf "]", (IV)SvTYPE(sstr));
9727 if (GvUNIQUE((GV*)sstr)) {
9728 /*EMPTY*/; /* Do sharing here, and fall through */
9741 assert(sv_type_details->body_size);
9742 if (sv_type_details->arena) {
9743 new_body_inline(new_body, sv_type);
9745 = (void*)((char*)new_body - sv_type_details->offset);
9747 new_body = new_NOARENA(sv_type_details);
9751 SvANY(dstr) = new_body;
9754 Copy(((char*)SvANY(sstr)) + sv_type_details->offset,
9755 ((char*)SvANY(dstr)) + sv_type_details->offset,
9756 sv_type_details->copy, char);
9758 Copy(((char*)SvANY(sstr)),
9759 ((char*)SvANY(dstr)),
9760 sv_type_details->body_size + sv_type_details->offset, char);
9763 if (sv_type != SVt_PVAV && sv_type != SVt_PVHV)
9764 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
9766 /* The Copy above means that all the source (unduplicated) pointers
9767 are now in the destination. We can check the flags and the
9768 pointers in either, but it's possible that there's less cache
9769 missing by always going for the destination.
9770 FIXME - instrument and check that assumption */
9771 if (sv_type >= SVt_PVMG) {
9773 SvMAGIC_set(dstr, mg_dup(SvMAGIC(dstr), param));
9775 SvSTASH_set(dstr, hv_dup_inc(SvSTASH(dstr), param));
9778 /* The cast silences a GCC warning about unhandled types. */
9779 switch ((int)sv_type) {
9791 /* XXX LvTARGOFF sometimes holds PMOP* when DEBUGGING */
9792 if (LvTYPE(dstr) == 't') /* for tie: unrefcnted fake (SV**) */
9793 LvTARG(dstr) = dstr;
9794 else if (LvTYPE(dstr) == 'T') /* for tie: fake HE */
9795 LvTARG(dstr) = (SV*)he_dup((HE*)LvTARG(dstr), 0, param);
9797 LvTARG(dstr) = sv_dup_inc(LvTARG(dstr), param);
9800 GvNAME(dstr) = SAVEPVN(GvNAME(dstr), GvNAMELEN(dstr));
9801 GvSTASH(dstr) = hv_dup(GvSTASH(dstr), param);
9802 /* Don't call sv_add_backref here as it's going to be created
9803 as part of the magic cloning of the symbol table. */
9804 GvGP(dstr) = gp_dup(GvGP(dstr), param);
9805 (void)GpREFCNT_inc(GvGP(dstr));
9808 IoIFP(dstr) = fp_dup(IoIFP(dstr), IoTYPE(dstr), param);
9809 if (IoOFP(dstr) == IoIFP(sstr))
9810 IoOFP(dstr) = IoIFP(dstr);
9812 IoOFP(dstr) = fp_dup(IoOFP(dstr), IoTYPE(dstr), param);
9813 /* PL_rsfp_filters entries have fake IoDIRP() */
9814 if(IoFLAGS(dstr) & IOf_FAKE_DIRP) {
9815 /* I have no idea why fake dirp (rsfps)
9816 should be treated differently but otherwise
9817 we end up with leaks -- sky*/
9818 IoTOP_GV(dstr) = gv_dup_inc(IoTOP_GV(dstr), param);
9819 IoFMT_GV(dstr) = gv_dup_inc(IoFMT_GV(dstr), param);
9820 IoBOTTOM_GV(dstr) = gv_dup_inc(IoBOTTOM_GV(dstr), param);
9822 IoTOP_GV(dstr) = gv_dup(IoTOP_GV(dstr), param);
9823 IoFMT_GV(dstr) = gv_dup(IoFMT_GV(dstr), param);
9824 IoBOTTOM_GV(dstr) = gv_dup(IoBOTTOM_GV(dstr), param);
9826 IoDIRP(dstr) = dirp_dup(IoDIRP(dstr));
9829 /* IoDIRP(dstr) is already a copy of IoDIRP(sstr) */
9832 IoTOP_NAME(dstr) = SAVEPV(IoTOP_NAME(dstr));
9833 IoFMT_NAME(dstr) = SAVEPV(IoFMT_NAME(dstr));
9834 IoBOTTOM_NAME(dstr) = SAVEPV(IoBOTTOM_NAME(dstr));
9837 if (AvARRAY((AV*)sstr)) {
9838 SV **dst_ary, **src_ary;
9839 SSize_t items = AvFILLp((AV*)sstr) + 1;
9841 src_ary = AvARRAY((AV*)sstr);
9842 Newxz(dst_ary, AvMAX((AV*)sstr)+1, SV*);
9843 ptr_table_store(PL_ptr_table, src_ary, dst_ary);
9844 SvPV_set(dstr, (char*)dst_ary);
9845 AvALLOC((AV*)dstr) = dst_ary;
9846 if (AvREAL((AV*)sstr)) {
9848 *dst_ary++ = sv_dup_inc(*src_ary++, param);
9852 *dst_ary++ = sv_dup(*src_ary++, param);
9854 items = AvMAX((AV*)sstr) - AvFILLp((AV*)sstr);
9855 while (items-- > 0) {
9856 *dst_ary++ = &PL_sv_undef;
9860 SvPV_set(dstr, NULL);
9861 AvALLOC((AV*)dstr) = (SV**)NULL;
9868 if (HvARRAY((HV*)sstr)) {
9870 const bool sharekeys = !!HvSHAREKEYS(sstr);
9871 XPVHV * const dxhv = (XPVHV*)SvANY(dstr);
9872 XPVHV * const sxhv = (XPVHV*)SvANY(sstr);
9874 Newx(darray, PERL_HV_ARRAY_ALLOC_BYTES(dxhv->xhv_max+1)
9875 + (SvOOK(sstr) ? sizeof(struct xpvhv_aux) : 0),
9877 HvARRAY(dstr) = (HE**)darray;
9878 while (i <= sxhv->xhv_max) {
9879 const HE *source = HvARRAY(sstr)[i];
9880 HvARRAY(dstr)[i] = source
9881 ? he_dup(source, sharekeys, param) : 0;
9885 struct xpvhv_aux * const saux = HvAUX(sstr);
9886 struct xpvhv_aux * const daux = HvAUX(dstr);
9887 /* This flag isn't copied. */
9888 /* SvOOK_on(hv) attacks the IV flags. */
9889 SvFLAGS(dstr) |= SVf_OOK;
9891 hvname = saux->xhv_name;
9893 = hvname ? hek_dup(hvname, param) : hvname;
9895 daux->xhv_riter = saux->xhv_riter;
9896 daux->xhv_eiter = saux->xhv_eiter
9897 ? he_dup(saux->xhv_eiter,
9898 (bool)!!HvSHAREKEYS(sstr), param) : 0;
9899 daux->xhv_backreferences = saux->xhv_backreferences
9900 ? (AV*) SvREFCNT_inc(
9908 SvPV_set(dstr, NULL);
9910 /* Record stashes for possible cloning in Perl_clone(). */
9912 av_push(param->stashes, dstr);
9916 if (!(param->flags & CLONEf_COPY_STACKS)) {
9920 /* NOTE: not refcounted */
9921 CvSTASH(dstr) = hv_dup(CvSTASH(dstr), param);
9923 if (!CvISXSUB(dstr))
9924 CvROOT(dstr) = OpREFCNT_inc(CvROOT(dstr));
9926 if (CvCONST(dstr) && CvISXSUB(dstr)) {
9927 CvXSUBANY(dstr).any_ptr = GvUNIQUE(CvGV(dstr)) ?
9928 SvREFCNT_inc(CvXSUBANY(dstr).any_ptr) :
9929 sv_dup_inc((SV *)CvXSUBANY(dstr).any_ptr, param);
9931 /* don't dup if copying back - CvGV isn't refcounted, so the
9932 * duped GV may never be freed. A bit of a hack! DAPM */
9933 CvGV(dstr) = (param->flags & CLONEf_JOIN_IN) ?
9934 NULL : gv_dup(CvGV(dstr), param) ;
9935 PAD_DUP(CvPADLIST(dstr), CvPADLIST(sstr), param);
9938 ? cv_dup( CvOUTSIDE(dstr), param)
9939 : cv_dup_inc(CvOUTSIDE(dstr), param);
9940 if (!CvISXSUB(dstr))
9941 CvFILE(dstr) = SAVEPV(CvFILE(dstr));
9947 if (SvOBJECT(dstr) && SvTYPE(dstr) != SVt_PVIO)
9953 /* duplicate a context */
9956 Perl_cx_dup(pTHX_ PERL_CONTEXT *cxs, I32 ix, I32 max, CLONE_PARAMS* param)
9961 return (PERL_CONTEXT*)NULL;
9963 /* look for it in the table first */
9964 ncxs = (PERL_CONTEXT*)ptr_table_fetch(PL_ptr_table, cxs);
9968 /* create anew and remember what it is */
9969 Newxz(ncxs, max + 1, PERL_CONTEXT);
9970 ptr_table_store(PL_ptr_table, cxs, ncxs);
9973 PERL_CONTEXT * const cx = &cxs[ix];
9974 PERL_CONTEXT * const ncx = &ncxs[ix];
9975 ncx->cx_type = cx->cx_type;
9976 if (CxTYPE(cx) == CXt_SUBST) {
9977 Perl_croak(aTHX_ "Cloning substitution context is unimplemented");
9980 ncx->blk_oldsp = cx->blk_oldsp;
9981 ncx->blk_oldcop = cx->blk_oldcop;
9982 ncx->blk_oldmarksp = cx->blk_oldmarksp;
9983 ncx->blk_oldscopesp = cx->blk_oldscopesp;
9984 ncx->blk_oldpm = cx->blk_oldpm;
9985 ncx->blk_gimme = cx->blk_gimme;
9986 switch (CxTYPE(cx)) {
9988 ncx->blk_sub.cv = (cx->blk_sub.olddepth == 0
9989 ? cv_dup_inc(cx->blk_sub.cv, param)
9990 : cv_dup(cx->blk_sub.cv,param));
9991 ncx->blk_sub.argarray = (cx->blk_sub.hasargs
9992 ? av_dup_inc(cx->blk_sub.argarray, param)
9994 ncx->blk_sub.savearray = av_dup_inc(cx->blk_sub.savearray, param);
9995 ncx->blk_sub.olddepth = cx->blk_sub.olddepth;
9996 ncx->blk_sub.hasargs = cx->blk_sub.hasargs;
9997 ncx->blk_sub.lval = cx->blk_sub.lval;
9998 ncx->blk_sub.retop = cx->blk_sub.retop;
10001 ncx->blk_eval.old_in_eval = cx->blk_eval.old_in_eval;
10002 ncx->blk_eval.old_op_type = cx->blk_eval.old_op_type;
10003 ncx->blk_eval.old_namesv = sv_dup_inc(cx->blk_eval.old_namesv, param);
10004 ncx->blk_eval.old_eval_root = cx->blk_eval.old_eval_root;
10005 ncx->blk_eval.cur_text = sv_dup(cx->blk_eval.cur_text, param);
10006 ncx->blk_eval.retop = cx->blk_eval.retop;
10009 ncx->blk_loop.label = cx->blk_loop.label;
10010 ncx->blk_loop.resetsp = cx->blk_loop.resetsp;
10011 ncx->blk_loop.redo_op = cx->blk_loop.redo_op;
10012 ncx->blk_loop.next_op = cx->blk_loop.next_op;
10013 ncx->blk_loop.last_op = cx->blk_loop.last_op;
10014 ncx->blk_loop.iterdata = (CxPADLOOP(cx)
10015 ? cx->blk_loop.iterdata
10016 : gv_dup((GV*)cx->blk_loop.iterdata, param));
10017 ncx->blk_loop.oldcomppad
10018 = (PAD*)ptr_table_fetch(PL_ptr_table,
10019 cx->blk_loop.oldcomppad);
10020 ncx->blk_loop.itersave = sv_dup_inc(cx->blk_loop.itersave, param);
10021 ncx->blk_loop.iterlval = sv_dup_inc(cx->blk_loop.iterlval, param);
10022 ncx->blk_loop.iterary = av_dup_inc(cx->blk_loop.iterary, param);
10023 ncx->blk_loop.iterix = cx->blk_loop.iterix;
10024 ncx->blk_loop.itermax = cx->blk_loop.itermax;
10027 ncx->blk_sub.cv = cv_dup(cx->blk_sub.cv, param);
10028 ncx->blk_sub.gv = gv_dup(cx->blk_sub.gv, param);
10029 ncx->blk_sub.dfoutgv = gv_dup_inc(cx->blk_sub.dfoutgv, param);
10030 ncx->blk_sub.hasargs = cx->blk_sub.hasargs;
10031 ncx->blk_sub.retop = cx->blk_sub.retop;
10043 /* duplicate a stack info structure */
10046 Perl_si_dup(pTHX_ PERL_SI *si, CLONE_PARAMS* param)
10051 return (PERL_SI*)NULL;
10053 /* look for it in the table first */
10054 nsi = (PERL_SI*)ptr_table_fetch(PL_ptr_table, si);
10058 /* create anew and remember what it is */
10059 Newxz(nsi, 1, PERL_SI);
10060 ptr_table_store(PL_ptr_table, si, nsi);
10062 nsi->si_stack = av_dup_inc(si->si_stack, param);
10063 nsi->si_cxix = si->si_cxix;
10064 nsi->si_cxmax = si->si_cxmax;
10065 nsi->si_cxstack = cx_dup(si->si_cxstack, si->si_cxix, si->si_cxmax, param);
10066 nsi->si_type = si->si_type;
10067 nsi->si_prev = si_dup(si->si_prev, param);
10068 nsi->si_next = si_dup(si->si_next, param);
10069 nsi->si_markoff = si->si_markoff;
10074 #define POPINT(ss,ix) ((ss)[--(ix)].any_i32)
10075 #define TOPINT(ss,ix) ((ss)[ix].any_i32)
10076 #define POPLONG(ss,ix) ((ss)[--(ix)].any_long)
10077 #define TOPLONG(ss,ix) ((ss)[ix].any_long)
10078 #define POPIV(ss,ix) ((ss)[--(ix)].any_iv)
10079 #define TOPIV(ss,ix) ((ss)[ix].any_iv)
10080 #define POPBOOL(ss,ix) ((ss)[--(ix)].any_bool)
10081 #define TOPBOOL(ss,ix) ((ss)[ix].any_bool)
10082 #define POPPTR(ss,ix) ((ss)[--(ix)].any_ptr)
10083 #define TOPPTR(ss,ix) ((ss)[ix].any_ptr)
10084 #define POPDPTR(ss,ix) ((ss)[--(ix)].any_dptr)
10085 #define TOPDPTR(ss,ix) ((ss)[ix].any_dptr)
10086 #define POPDXPTR(ss,ix) ((ss)[--(ix)].any_dxptr)
10087 #define TOPDXPTR(ss,ix) ((ss)[ix].any_dxptr)
10090 #define pv_dup_inc(p) SAVEPV(p)
10091 #define pv_dup(p) SAVEPV(p)
10092 #define svp_dup_inc(p,pp) any_dup(p,pp)
10094 /* map any object to the new equivent - either something in the
10095 * ptr table, or something in the interpreter structure
10099 Perl_any_dup(pTHX_ void *v, const PerlInterpreter *proto_perl)
10104 return (void*)NULL;
10106 /* look for it in the table first */
10107 ret = ptr_table_fetch(PL_ptr_table, v);
10111 /* see if it is part of the interpreter structure */
10112 if (v >= (void*)proto_perl && v < (void*)(proto_perl+1))
10113 ret = (void*)(((char*)aTHX) + (((char*)v) - (char*)proto_perl));
10121 /* duplicate the save stack */
10124 Perl_ss_dup(pTHX_ PerlInterpreter *proto_perl, CLONE_PARAMS* param)
10126 ANY * const ss = proto_perl->Tsavestack;
10127 const I32 max = proto_perl->Tsavestack_max;
10128 I32 ix = proto_perl->Tsavestack_ix;
10140 void (*dptr) (void*);
10141 void (*dxptr) (pTHX_ void*);
10143 Newxz(nss, max, ANY);
10146 I32 i = POPINT(ss,ix);
10147 TOPINT(nss,ix) = i;
10149 case SAVEt_ITEM: /* normal string */
10150 sv = (SV*)POPPTR(ss,ix);
10151 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
10152 sv = (SV*)POPPTR(ss,ix);
10153 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
10155 case SAVEt_SV: /* scalar reference */
10156 sv = (SV*)POPPTR(ss,ix);
10157 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
10158 gv = (GV*)POPPTR(ss,ix);
10159 TOPPTR(nss,ix) = gv_dup_inc(gv, param);
10161 case SAVEt_GENERIC_PVREF: /* generic char* */
10162 c = (char*)POPPTR(ss,ix);
10163 TOPPTR(nss,ix) = pv_dup(c);
10164 ptr = POPPTR(ss,ix);
10165 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10167 case SAVEt_SHARED_PVREF: /* char* in shared space */
10168 c = (char*)POPPTR(ss,ix);
10169 TOPPTR(nss,ix) = savesharedpv(c);
10170 ptr = POPPTR(ss,ix);
10171 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10173 case SAVEt_GENERIC_SVREF: /* generic sv */
10174 case SAVEt_SVREF: /* scalar reference */
10175 sv = (SV*)POPPTR(ss,ix);
10176 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
10177 ptr = POPPTR(ss,ix);
10178 TOPPTR(nss,ix) = svp_dup_inc((SV**)ptr, proto_perl);/* XXXXX */
10180 case SAVEt_AV: /* array reference */
10181 av = (AV*)POPPTR(ss,ix);
10182 TOPPTR(nss,ix) = av_dup_inc(av, param);
10183 gv = (GV*)POPPTR(ss,ix);
10184 TOPPTR(nss,ix) = gv_dup(gv, param);
10186 case SAVEt_HV: /* hash reference */
10187 hv = (HV*)POPPTR(ss,ix);
10188 TOPPTR(nss,ix) = hv_dup_inc(hv, param);
10189 gv = (GV*)POPPTR(ss,ix);
10190 TOPPTR(nss,ix) = gv_dup(gv, param);
10192 case SAVEt_INT: /* int reference */
10193 ptr = POPPTR(ss,ix);
10194 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10195 intval = (int)POPINT(ss,ix);
10196 TOPINT(nss,ix) = intval;
10198 case SAVEt_LONG: /* long reference */
10199 ptr = POPPTR(ss,ix);
10200 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10201 longval = (long)POPLONG(ss,ix);
10202 TOPLONG(nss,ix) = longval;
10204 case SAVEt_I32: /* I32 reference */
10205 case SAVEt_I16: /* I16 reference */
10206 case SAVEt_I8: /* I8 reference */
10207 ptr = POPPTR(ss,ix);
10208 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10210 TOPINT(nss,ix) = i;
10212 case SAVEt_IV: /* IV reference */
10213 ptr = POPPTR(ss,ix);
10214 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10216 TOPIV(nss,ix) = iv;
10218 case SAVEt_SPTR: /* SV* reference */
10219 ptr = POPPTR(ss,ix);
10220 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10221 sv = (SV*)POPPTR(ss,ix);
10222 TOPPTR(nss,ix) = sv_dup(sv, param);
10224 case SAVEt_VPTR: /* random* reference */
10225 ptr = POPPTR(ss,ix);
10226 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10227 ptr = POPPTR(ss,ix);
10228 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10230 case SAVEt_PPTR: /* char* reference */
10231 ptr = POPPTR(ss,ix);
10232 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10233 c = (char*)POPPTR(ss,ix);
10234 TOPPTR(nss,ix) = pv_dup(c);
10236 case SAVEt_HPTR: /* HV* reference */
10237 ptr = POPPTR(ss,ix);
10238 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10239 hv = (HV*)POPPTR(ss,ix);
10240 TOPPTR(nss,ix) = hv_dup(hv, param);
10242 case SAVEt_APTR: /* AV* reference */
10243 ptr = POPPTR(ss,ix);
10244 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10245 av = (AV*)POPPTR(ss,ix);
10246 TOPPTR(nss,ix) = av_dup(av, param);
10249 gv = (GV*)POPPTR(ss,ix);
10250 TOPPTR(nss,ix) = gv_dup(gv, param);
10252 case SAVEt_GP: /* scalar reference */
10253 gp = (GP*)POPPTR(ss,ix);
10254 TOPPTR(nss,ix) = gp = gp_dup(gp, param);
10255 (void)GpREFCNT_inc(gp);
10256 gv = (GV*)POPPTR(ss,ix);
10257 TOPPTR(nss,ix) = gv_dup_inc(gv, param);
10258 c = (char*)POPPTR(ss,ix);
10259 TOPPTR(nss,ix) = pv_dup(c);
10261 TOPIV(nss,ix) = iv;
10263 TOPIV(nss,ix) = iv;
10266 case SAVEt_MORTALIZESV:
10267 sv = (SV*)POPPTR(ss,ix);
10268 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
10271 ptr = POPPTR(ss,ix);
10272 if (ptr && (((OP*)ptr)->op_private & OPpREFCOUNTED)) {
10273 /* these are assumed to be refcounted properly */
10275 switch (((OP*)ptr)->op_type) {
10277 case OP_LEAVESUBLV:
10281 case OP_LEAVEWRITE:
10282 TOPPTR(nss,ix) = ptr;
10287 TOPPTR(nss,ix) = NULL;
10292 TOPPTR(nss,ix) = NULL;
10295 c = (char*)POPPTR(ss,ix);
10296 TOPPTR(nss,ix) = pv_dup_inc(c);
10298 case SAVEt_CLEARSV:
10299 longval = POPLONG(ss,ix);
10300 TOPLONG(nss,ix) = longval;
10303 hv = (HV*)POPPTR(ss,ix);
10304 TOPPTR(nss,ix) = hv_dup_inc(hv, param);
10305 c = (char*)POPPTR(ss,ix);
10306 TOPPTR(nss,ix) = pv_dup_inc(c);
10308 TOPINT(nss,ix) = i;
10310 case SAVEt_DESTRUCTOR:
10311 ptr = POPPTR(ss,ix);
10312 TOPPTR(nss,ix) = any_dup(ptr, proto_perl); /* XXX quite arbitrary */
10313 dptr = POPDPTR(ss,ix);
10314 TOPDPTR(nss,ix) = DPTR2FPTR(void (*)(void*),
10315 any_dup(FPTR2DPTR(void *, dptr),
10318 case SAVEt_DESTRUCTOR_X:
10319 ptr = POPPTR(ss,ix);
10320 TOPPTR(nss,ix) = any_dup(ptr, proto_perl); /* XXX quite arbitrary */
10321 dxptr = POPDXPTR(ss,ix);
10322 TOPDXPTR(nss,ix) = DPTR2FPTR(void (*)(pTHX_ void*),
10323 any_dup(FPTR2DPTR(void *, dxptr),
10326 case SAVEt_REGCONTEXT:
10329 TOPINT(nss,ix) = i;
10332 case SAVEt_STACK_POS: /* Position on Perl stack */
10334 TOPINT(nss,ix) = i;
10336 case SAVEt_AELEM: /* array element */
10337 sv = (SV*)POPPTR(ss,ix);
10338 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
10340 TOPINT(nss,ix) = i;
10341 av = (AV*)POPPTR(ss,ix);
10342 TOPPTR(nss,ix) = av_dup_inc(av, param);
10344 case SAVEt_HELEM: /* hash element */
10345 sv = (SV*)POPPTR(ss,ix);
10346 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
10347 sv = (SV*)POPPTR(ss,ix);
10348 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
10349 hv = (HV*)POPPTR(ss,ix);
10350 TOPPTR(nss,ix) = hv_dup_inc(hv, param);
10353 ptr = POPPTR(ss,ix);
10354 TOPPTR(nss,ix) = ptr;
10358 TOPINT(nss,ix) = i;
10360 case SAVEt_COMPPAD:
10361 av = (AV*)POPPTR(ss,ix);
10362 TOPPTR(nss,ix) = av_dup(av, param);
10365 longval = (long)POPLONG(ss,ix);
10366 TOPLONG(nss,ix) = longval;
10367 ptr = POPPTR(ss,ix);
10368 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10369 sv = (SV*)POPPTR(ss,ix);
10370 TOPPTR(nss,ix) = sv_dup(sv, param);
10373 ptr = POPPTR(ss,ix);
10374 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10375 longval = (long)POPBOOL(ss,ix);
10376 TOPBOOL(nss,ix) = (bool)longval;
10378 case SAVEt_SET_SVFLAGS:
10380 TOPINT(nss,ix) = i;
10382 TOPINT(nss,ix) = i;
10383 sv = (SV*)POPPTR(ss,ix);
10384 TOPPTR(nss,ix) = sv_dup(sv, param);
10387 Perl_croak(aTHX_ "panic: ss_dup inconsistency");
10395 /* if sv is a stash, call $class->CLONE_SKIP(), and set the SVphv_CLONEABLE
10396 * flag to the result. This is done for each stash before cloning starts,
10397 * so we know which stashes want their objects cloned */
10400 do_mark_cloneable_stash(pTHX_ SV *sv)
10402 const HEK * const hvname = HvNAME_HEK((HV*)sv);
10404 GV* const cloner = gv_fetchmethod_autoload((HV*)sv, "CLONE_SKIP", 0);
10405 SvFLAGS(sv) |= SVphv_CLONEABLE; /* clone objects by default */
10406 if (cloner && GvCV(cloner)) {
10413 XPUSHs(sv_2mortal(newSVhek(hvname)));
10415 call_sv((SV*)GvCV(cloner), G_SCALAR);
10422 SvFLAGS(sv) &= ~SVphv_CLONEABLE;
10430 =for apidoc perl_clone
10432 Create and return a new interpreter by cloning the current one.
10434 perl_clone takes these flags as parameters:
10436 CLONEf_COPY_STACKS - is used to, well, copy the stacks also,
10437 without it we only clone the data and zero the stacks,
10438 with it we copy the stacks and the new perl interpreter is
10439 ready to run at the exact same point as the previous one.
10440 The pseudo-fork code uses COPY_STACKS while the
10441 threads->new doesn't.
10443 CLONEf_KEEP_PTR_TABLE
10444 perl_clone keeps a ptr_table with the pointer of the old
10445 variable as a key and the new variable as a value,
10446 this allows it to check if something has been cloned and not
10447 clone it again but rather just use the value and increase the
10448 refcount. If KEEP_PTR_TABLE is not set then perl_clone will kill
10449 the ptr_table using the function
10450 C<ptr_table_free(PL_ptr_table); PL_ptr_table = NULL;>,
10451 reason to keep it around is if you want to dup some of your own
10452 variable who are outside the graph perl scans, example of this
10453 code is in threads.xs create
10456 This is a win32 thing, it is ignored on unix, it tells perls
10457 win32host code (which is c++) to clone itself, this is needed on
10458 win32 if you want to run two threads at the same time,
10459 if you just want to do some stuff in a separate perl interpreter
10460 and then throw it away and return to the original one,
10461 you don't need to do anything.
10466 /* XXX the above needs expanding by someone who actually understands it ! */
10467 EXTERN_C PerlInterpreter *
10468 perl_clone_host(PerlInterpreter* proto_perl, UV flags);
10471 perl_clone(PerlInterpreter *proto_perl, UV flags)
10474 #ifdef PERL_IMPLICIT_SYS
10476 /* perlhost.h so we need to call into it
10477 to clone the host, CPerlHost should have a c interface, sky */
10479 if (flags & CLONEf_CLONE_HOST) {
10480 return perl_clone_host(proto_perl,flags);
10482 return perl_clone_using(proto_perl, flags,
10484 proto_perl->IMemShared,
10485 proto_perl->IMemParse,
10487 proto_perl->IStdIO,
10491 proto_perl->IProc);
10495 perl_clone_using(PerlInterpreter *proto_perl, UV flags,
10496 struct IPerlMem* ipM, struct IPerlMem* ipMS,
10497 struct IPerlMem* ipMP, struct IPerlEnv* ipE,
10498 struct IPerlStdIO* ipStd, struct IPerlLIO* ipLIO,
10499 struct IPerlDir* ipD, struct IPerlSock* ipS,
10500 struct IPerlProc* ipP)
10502 /* XXX many of the string copies here can be optimized if they're
10503 * constants; they need to be allocated as common memory and just
10504 * their pointers copied. */
10507 CLONE_PARAMS clone_params;
10508 CLONE_PARAMS* const param = &clone_params;
10510 PerlInterpreter * const my_perl = (PerlInterpreter*)(*ipM->pMalloc)(ipM, sizeof(PerlInterpreter));
10511 /* for each stash, determine whether its objects should be cloned */
10512 S_visit(proto_perl, do_mark_cloneable_stash, SVt_PVHV, SVTYPEMASK);
10513 PERL_SET_THX(my_perl);
10516 Poison(my_perl, 1, PerlInterpreter);
10522 PL_savestack_ix = 0;
10523 PL_savestack_max = -1;
10524 PL_sig_pending = 0;
10525 Zero(&PL_debug_pad, 1, struct perl_debug_pad);
10526 # else /* !DEBUGGING */
10527 Zero(my_perl, 1, PerlInterpreter);
10528 # endif /* DEBUGGING */
10530 /* host pointers */
10532 PL_MemShared = ipMS;
10533 PL_MemParse = ipMP;
10540 #else /* !PERL_IMPLICIT_SYS */
10542 CLONE_PARAMS clone_params;
10543 CLONE_PARAMS* param = &clone_params;
10544 PerlInterpreter * const my_perl = (PerlInterpreter*)PerlMem_malloc(sizeof(PerlInterpreter));
10545 /* for each stash, determine whether its objects should be cloned */
10546 S_visit(proto_perl, do_mark_cloneable_stash, SVt_PVHV, SVTYPEMASK);
10547 PERL_SET_THX(my_perl);
10550 Poison(my_perl, 1, PerlInterpreter);
10556 PL_savestack_ix = 0;
10557 PL_savestack_max = -1;
10558 PL_sig_pending = 0;
10559 Zero(&PL_debug_pad, 1, struct perl_debug_pad);
10560 # else /* !DEBUGGING */
10561 Zero(my_perl, 1, PerlInterpreter);
10562 # endif /* DEBUGGING */
10563 #endif /* PERL_IMPLICIT_SYS */
10564 param->flags = flags;
10565 param->proto_perl = proto_perl;
10567 INIT_TRACK_MEMPOOL(my_perl->Imemory_debug_header, my_perl);
10569 PL_body_arenas = NULL;
10570 Zero(&PL_body_roots, 1, PL_body_roots);
10572 PL_nice_chunk = NULL;
10573 PL_nice_chunk_size = 0;
10575 PL_sv_objcount = 0;
10577 PL_sv_arenaroot = NULL;
10579 PL_debug = proto_perl->Idebug;
10581 PL_hash_seed = proto_perl->Ihash_seed;
10582 PL_rehash_seed = proto_perl->Irehash_seed;
10584 #ifdef USE_REENTRANT_API
10585 /* XXX: things like -Dm will segfault here in perlio, but doing
10586 * PERL_SET_CONTEXT(proto_perl);
10587 * breaks too many other things
10589 Perl_reentrant_init(aTHX);
10592 /* create SV map for pointer relocation */
10593 PL_ptr_table = ptr_table_new();
10595 /* initialize these special pointers as early as possible */
10596 SvANY(&PL_sv_undef) = NULL;
10597 SvREFCNT(&PL_sv_undef) = (~(U32)0)/2;
10598 SvFLAGS(&PL_sv_undef) = SVf_READONLY|SVt_NULL;
10599 ptr_table_store(PL_ptr_table, &proto_perl->Isv_undef, &PL_sv_undef);
10601 SvANY(&PL_sv_no) = new_XPVNV();
10602 SvREFCNT(&PL_sv_no) = (~(U32)0)/2;
10603 SvFLAGS(&PL_sv_no) = SVp_IOK|SVf_IOK|SVp_NOK|SVf_NOK
10604 |SVp_POK|SVf_POK|SVf_READONLY|SVt_PVNV;
10605 SvPV_set(&PL_sv_no, SAVEPVN(PL_No, 0));
10606 SvCUR_set(&PL_sv_no, 0);
10607 SvLEN_set(&PL_sv_no, 1);
10608 SvIV_set(&PL_sv_no, 0);
10609 SvNV_set(&PL_sv_no, 0);
10610 ptr_table_store(PL_ptr_table, &proto_perl->Isv_no, &PL_sv_no);
10612 SvANY(&PL_sv_yes) = new_XPVNV();
10613 SvREFCNT(&PL_sv_yes) = (~(U32)0)/2;
10614 SvFLAGS(&PL_sv_yes) = SVp_IOK|SVf_IOK|SVp_NOK|SVf_NOK
10615 |SVp_POK|SVf_POK|SVf_READONLY|SVt_PVNV;
10616 SvPV_set(&PL_sv_yes, SAVEPVN(PL_Yes, 1));
10617 SvCUR_set(&PL_sv_yes, 1);
10618 SvLEN_set(&PL_sv_yes, 2);
10619 SvIV_set(&PL_sv_yes, 1);
10620 SvNV_set(&PL_sv_yes, 1);
10621 ptr_table_store(PL_ptr_table, &proto_perl->Isv_yes, &PL_sv_yes);
10623 /* create (a non-shared!) shared string table */
10624 PL_strtab = newHV();
10625 HvSHAREKEYS_off(PL_strtab);
10626 hv_ksplit(PL_strtab, HvTOTALKEYS(proto_perl->Istrtab));
10627 ptr_table_store(PL_ptr_table, proto_perl->Istrtab, PL_strtab);
10629 PL_compiling = proto_perl->Icompiling;
10631 /* These two PVs will be free'd special way so must set them same way op.c does */
10632 PL_compiling.cop_stashpv = savesharedpv(PL_compiling.cop_stashpv);
10633 ptr_table_store(PL_ptr_table, proto_perl->Icompiling.cop_stashpv, PL_compiling.cop_stashpv);
10635 PL_compiling.cop_file = savesharedpv(PL_compiling.cop_file);
10636 ptr_table_store(PL_ptr_table, proto_perl->Icompiling.cop_file, PL_compiling.cop_file);
10638 ptr_table_store(PL_ptr_table, &proto_perl->Icompiling, &PL_compiling);
10639 if (!specialWARN(PL_compiling.cop_warnings))
10640 PL_compiling.cop_warnings = sv_dup_inc(PL_compiling.cop_warnings, param);
10641 if (!specialCopIO(PL_compiling.cop_io))
10642 PL_compiling.cop_io = sv_dup_inc(PL_compiling.cop_io, param);
10643 PL_curcop = (COP*)any_dup(proto_perl->Tcurcop, proto_perl);
10645 /* pseudo environmental stuff */
10646 PL_origargc = proto_perl->Iorigargc;
10647 PL_origargv = proto_perl->Iorigargv;
10649 param->stashes = newAV(); /* Setup array of objects to call clone on */
10651 /* Set tainting stuff before PerlIO_debug can possibly get called */
10652 PL_tainting = proto_perl->Itainting;
10653 PL_taint_warn = proto_perl->Itaint_warn;
10655 #ifdef PERLIO_LAYERS
10656 /* Clone PerlIO tables as soon as we can handle general xx_dup() */
10657 PerlIO_clone(aTHX_ proto_perl, param);
10660 PL_envgv = gv_dup(proto_perl->Ienvgv, param);
10661 PL_incgv = gv_dup(proto_perl->Iincgv, param);
10662 PL_hintgv = gv_dup(proto_perl->Ihintgv, param);
10663 PL_origfilename = SAVEPV(proto_perl->Iorigfilename);
10664 PL_diehook = sv_dup_inc(proto_perl->Idiehook, param);
10665 PL_warnhook = sv_dup_inc(proto_perl->Iwarnhook, param);
10668 PL_minus_c = proto_perl->Iminus_c;
10669 PL_patchlevel = sv_dup_inc(proto_perl->Ipatchlevel, param);
10670 PL_localpatches = proto_perl->Ilocalpatches;
10671 PL_splitstr = proto_perl->Isplitstr;
10672 PL_preprocess = proto_perl->Ipreprocess;
10673 PL_minus_n = proto_perl->Iminus_n;
10674 PL_minus_p = proto_perl->Iminus_p;
10675 PL_minus_l = proto_perl->Iminus_l;
10676 PL_minus_a = proto_perl->Iminus_a;
10677 PL_minus_E = proto_perl->Iminus_E;
10678 PL_minus_F = proto_perl->Iminus_F;
10679 PL_doswitches = proto_perl->Idoswitches;
10680 PL_dowarn = proto_perl->Idowarn;
10681 PL_doextract = proto_perl->Idoextract;
10682 PL_sawampersand = proto_perl->Isawampersand;
10683 PL_unsafe = proto_perl->Iunsafe;
10684 PL_inplace = SAVEPV(proto_perl->Iinplace);
10685 PL_e_script = sv_dup_inc(proto_perl->Ie_script, param);
10686 PL_perldb = proto_perl->Iperldb;
10687 PL_perl_destruct_level = proto_perl->Iperl_destruct_level;
10688 PL_exit_flags = proto_perl->Iexit_flags;
10690 /* magical thingies */
10691 /* XXX time(&PL_basetime) when asked for? */
10692 PL_basetime = proto_perl->Ibasetime;
10693 PL_formfeed = sv_dup(proto_perl->Iformfeed, param);
10695 PL_maxsysfd = proto_perl->Imaxsysfd;
10696 PL_multiline = proto_perl->Imultiline;
10697 PL_statusvalue = proto_perl->Istatusvalue;
10699 PL_statusvalue_vms = proto_perl->Istatusvalue_vms;
10701 PL_statusvalue_posix = proto_perl->Istatusvalue_posix;
10703 PL_encoding = sv_dup(proto_perl->Iencoding, param);
10705 sv_setpvn(PERL_DEBUG_PAD(0), "", 0); /* For regex debugging. */
10706 sv_setpvn(PERL_DEBUG_PAD(1), "", 0); /* ext/re needs these */
10707 sv_setpvn(PERL_DEBUG_PAD(2), "", 0); /* even without DEBUGGING. */
10709 /* Clone the regex array */
10710 PL_regex_padav = newAV();
10712 const I32 len = av_len((AV*)proto_perl->Iregex_padav);
10713 SV* const * const regexen = AvARRAY((AV*)proto_perl->Iregex_padav);
10715 av_push(PL_regex_padav,
10716 sv_dup_inc(regexen[0],param));
10717 for(i = 1; i <= len; i++) {
10718 const SV * const regex = regexen[i];
10721 ? sv_dup_inc(regex, param)
10723 newSViv(PTR2IV(re_dup(
10724 INT2PTR(REGEXP *, SvIVX(regex)), param))))
10726 av_push(PL_regex_padav, sv);
10729 PL_regex_pad = AvARRAY(PL_regex_padav);
10731 /* shortcuts to various I/O objects */
10732 PL_stdingv = gv_dup(proto_perl->Istdingv, param);
10733 PL_stderrgv = gv_dup(proto_perl->Istderrgv, param);
10734 PL_defgv = gv_dup(proto_perl->Idefgv, param);
10735 PL_argvgv = gv_dup(proto_perl->Iargvgv, param);
10736 PL_argvoutgv = gv_dup(proto_perl->Iargvoutgv, param);
10737 PL_argvout_stack = av_dup_inc(proto_perl->Iargvout_stack, param);
10739 /* shortcuts to regexp stuff */
10740 PL_replgv = gv_dup(proto_perl->Ireplgv, param);
10742 /* shortcuts to misc objects */
10743 PL_errgv = gv_dup(proto_perl->Ierrgv, param);
10745 /* shortcuts to debugging objects */
10746 PL_DBgv = gv_dup(proto_perl->IDBgv, param);
10747 PL_DBline = gv_dup(proto_perl->IDBline, param);
10748 PL_DBsub = gv_dup(proto_perl->IDBsub, param);
10749 PL_DBsingle = sv_dup(proto_perl->IDBsingle, param);
10750 PL_DBtrace = sv_dup(proto_perl->IDBtrace, param);
10751 PL_DBsignal = sv_dup(proto_perl->IDBsignal, param);
10752 PL_DBassertion = sv_dup(proto_perl->IDBassertion, param);
10753 PL_lineary = av_dup(proto_perl->Ilineary, param);
10754 PL_dbargs = av_dup(proto_perl->Idbargs, param);
10756 /* symbol tables */
10757 PL_defstash = hv_dup_inc(proto_perl->Tdefstash, param);
10758 PL_curstash = hv_dup(proto_perl->Tcurstash, param);
10759 PL_debstash = hv_dup(proto_perl->Idebstash, param);
10760 PL_globalstash = hv_dup(proto_perl->Iglobalstash, param);
10761 PL_curstname = sv_dup_inc(proto_perl->Icurstname, param);
10763 PL_beginav = av_dup_inc(proto_perl->Ibeginav, param);
10764 PL_beginav_save = av_dup_inc(proto_perl->Ibeginav_save, param);
10765 PL_checkav_save = av_dup_inc(proto_perl->Icheckav_save, param);
10766 PL_endav = av_dup_inc(proto_perl->Iendav, param);
10767 PL_checkav = av_dup_inc(proto_perl->Icheckav, param);
10768 PL_initav = av_dup_inc(proto_perl->Iinitav, param);
10770 PL_sub_generation = proto_perl->Isub_generation;
10772 /* funky return mechanisms */
10773 PL_forkprocess = proto_perl->Iforkprocess;
10775 /* subprocess state */
10776 PL_fdpid = av_dup_inc(proto_perl->Ifdpid, param);
10778 /* internal state */
10779 PL_maxo = proto_perl->Imaxo;
10780 if (proto_perl->Iop_mask)
10781 PL_op_mask = SAVEPVN(proto_perl->Iop_mask, PL_maxo);
10784 /* PL_asserting = proto_perl->Iasserting; */
10786 /* current interpreter roots */
10787 PL_main_cv = cv_dup_inc(proto_perl->Imain_cv, param);
10788 PL_main_root = OpREFCNT_inc(proto_perl->Imain_root);
10789 PL_main_start = proto_perl->Imain_start;
10790 PL_eval_root = proto_perl->Ieval_root;
10791 PL_eval_start = proto_perl->Ieval_start;
10793 /* runtime control stuff */
10794 PL_curcopdb = (COP*)any_dup(proto_perl->Icurcopdb, proto_perl);
10795 PL_copline = proto_perl->Icopline;
10797 PL_filemode = proto_perl->Ifilemode;
10798 PL_lastfd = proto_perl->Ilastfd;
10799 PL_oldname = proto_perl->Ioldname; /* XXX not quite right */
10802 PL_gensym = proto_perl->Igensym;
10803 PL_preambled = proto_perl->Ipreambled;
10804 PL_preambleav = av_dup_inc(proto_perl->Ipreambleav, param);
10805 PL_laststatval = proto_perl->Ilaststatval;
10806 PL_laststype = proto_perl->Ilaststype;
10809 PL_ors_sv = sv_dup_inc(proto_perl->Iors_sv, param);
10811 /* interpreter atexit processing */
10812 PL_exitlistlen = proto_perl->Iexitlistlen;
10813 if (PL_exitlistlen) {
10814 Newx(PL_exitlist, PL_exitlistlen, PerlExitListEntry);
10815 Copy(proto_perl->Iexitlist, PL_exitlist, PL_exitlistlen, PerlExitListEntry);
10818 PL_exitlist = (PerlExitListEntry*)NULL;
10820 PL_my_cxt_size = proto_perl->Imy_cxt_size;
10821 if (PL_my_cxt_size) {
10822 Newx(PL_my_cxt_list, PL_my_cxt_size, void *);
10823 Copy(proto_perl->Imy_cxt_list, PL_my_cxt_list, PL_my_cxt_size, void *);
10826 PL_my_cxt_list = (void**)NULL;
10827 PL_modglobal = hv_dup_inc(proto_perl->Imodglobal, param);
10828 PL_custom_op_names = hv_dup_inc(proto_perl->Icustom_op_names,param);
10829 PL_custom_op_descs = hv_dup_inc(proto_perl->Icustom_op_descs,param);
10831 PL_profiledata = NULL;
10832 PL_rsfp = fp_dup(proto_perl->Irsfp, '<', param);
10833 /* PL_rsfp_filters entries have fake IoDIRP() */
10834 PL_rsfp_filters = av_dup_inc(proto_perl->Irsfp_filters, param);
10836 PL_compcv = cv_dup(proto_perl->Icompcv, param);
10838 PAD_CLONE_VARS(proto_perl, param);
10840 #ifdef HAVE_INTERP_INTERN
10841 sys_intern_dup(&proto_perl->Isys_intern, &PL_sys_intern);
10844 /* more statics moved here */
10845 PL_generation = proto_perl->Igeneration;
10846 PL_DBcv = cv_dup(proto_perl->IDBcv, param);
10848 PL_in_clean_objs = proto_perl->Iin_clean_objs;
10849 PL_in_clean_all = proto_perl->Iin_clean_all;
10851 PL_uid = proto_perl->Iuid;
10852 PL_euid = proto_perl->Ieuid;
10853 PL_gid = proto_perl->Igid;
10854 PL_egid = proto_perl->Iegid;
10855 PL_nomemok = proto_perl->Inomemok;
10856 PL_an = proto_perl->Ian;
10857 PL_evalseq = proto_perl->Ievalseq;
10858 PL_origenviron = proto_perl->Iorigenviron; /* XXX not quite right */
10859 PL_origalen = proto_perl->Iorigalen;
10860 #ifdef PERL_USES_PL_PIDSTATUS
10861 PL_pidstatus = newHV(); /* XXX flag for cloning? */
10863 PL_osname = SAVEPV(proto_perl->Iosname);
10864 PL_sighandlerp = proto_perl->Isighandlerp;
10866 PL_runops = proto_perl->Irunops;
10868 Copy(proto_perl->Itokenbuf, PL_tokenbuf, 256, char);
10871 PL_cshlen = proto_perl->Icshlen;
10872 PL_cshname = proto_perl->Icshname; /* XXX never deallocated */
10875 PL_lex_state = proto_perl->Ilex_state;
10876 PL_lex_defer = proto_perl->Ilex_defer;
10877 PL_lex_expect = proto_perl->Ilex_expect;
10878 PL_lex_formbrack = proto_perl->Ilex_formbrack;
10879 PL_lex_dojoin = proto_perl->Ilex_dojoin;
10880 PL_lex_starts = proto_perl->Ilex_starts;
10881 PL_lex_stuff = sv_dup_inc(proto_perl->Ilex_stuff, param);
10882 PL_lex_repl = sv_dup_inc(proto_perl->Ilex_repl, param);
10883 PL_lex_op = proto_perl->Ilex_op;
10884 PL_lex_inpat = proto_perl->Ilex_inpat;
10885 PL_lex_inwhat = proto_perl->Ilex_inwhat;
10886 PL_lex_brackets = proto_perl->Ilex_brackets;
10887 i = (PL_lex_brackets < 120 ? 120 : PL_lex_brackets);
10888 PL_lex_brackstack = SAVEPVN(proto_perl->Ilex_brackstack,i);
10889 PL_lex_casemods = proto_perl->Ilex_casemods;
10890 i = (PL_lex_casemods < 12 ? 12 : PL_lex_casemods);
10891 PL_lex_casestack = SAVEPVN(proto_perl->Ilex_casestack,i);
10893 Copy(proto_perl->Inextval, PL_nextval, 5, YYSTYPE);
10894 Copy(proto_perl->Inexttype, PL_nexttype, 5, I32);
10895 PL_nexttoke = proto_perl->Inexttoke;
10897 /* XXX This is probably masking the deeper issue of why
10898 * SvANY(proto_perl->Ilinestr) can be NULL at this point. For test case:
10899 * http://archive.develooper.com/perl5-porters%40perl.org/msg83298.html
10900 * (A little debugging with a watchpoint on it may help.)
10902 if (SvANY(proto_perl->Ilinestr)) {
10903 PL_linestr = sv_dup_inc(proto_perl->Ilinestr, param);
10904 i = proto_perl->Ibufptr - SvPVX_const(proto_perl->Ilinestr);
10905 PL_bufptr = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
10906 i = proto_perl->Ioldbufptr - SvPVX_const(proto_perl->Ilinestr);
10907 PL_oldbufptr = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
10908 i = proto_perl->Ioldoldbufptr - SvPVX_const(proto_perl->Ilinestr);
10909 PL_oldoldbufptr = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
10910 i = proto_perl->Ilinestart - SvPVX_const(proto_perl->Ilinestr);
10911 PL_linestart = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
10914 PL_linestr = newSV(79);
10915 sv_upgrade(PL_linestr,SVt_PVIV);
10916 sv_setpvn(PL_linestr,"",0);
10917 PL_bufptr = PL_oldbufptr = PL_oldoldbufptr = PL_linestart = SvPVX(PL_linestr);
10919 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
10920 PL_pending_ident = proto_perl->Ipending_ident;
10921 PL_sublex_info = proto_perl->Isublex_info; /* XXX not quite right */
10923 PL_expect = proto_perl->Iexpect;
10925 PL_multi_start = proto_perl->Imulti_start;
10926 PL_multi_end = proto_perl->Imulti_end;
10927 PL_multi_open = proto_perl->Imulti_open;
10928 PL_multi_close = proto_perl->Imulti_close;
10930 PL_error_count = proto_perl->Ierror_count;
10931 PL_subline = proto_perl->Isubline;
10932 PL_subname = sv_dup_inc(proto_perl->Isubname, param);
10934 /* XXX See comment on SvANY(proto_perl->Ilinestr) above */
10935 if (SvANY(proto_perl->Ilinestr)) {
10936 i = proto_perl->Ilast_uni - SvPVX_const(proto_perl->Ilinestr);
10937 PL_last_uni = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
10938 i = proto_perl->Ilast_lop - SvPVX_const(proto_perl->Ilinestr);
10939 PL_last_lop = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
10940 PL_last_lop_op = proto_perl->Ilast_lop_op;
10943 PL_last_uni = SvPVX(PL_linestr);
10944 PL_last_lop = SvPVX(PL_linestr);
10945 PL_last_lop_op = 0;
10947 PL_in_my = proto_perl->Iin_my;
10948 PL_in_my_stash = hv_dup(proto_perl->Iin_my_stash, param);
10950 PL_cryptseen = proto_perl->Icryptseen;
10953 PL_hints = proto_perl->Ihints;
10955 PL_amagic_generation = proto_perl->Iamagic_generation;
10957 #ifdef USE_LOCALE_COLLATE
10958 PL_collation_ix = proto_perl->Icollation_ix;
10959 PL_collation_name = SAVEPV(proto_perl->Icollation_name);
10960 PL_collation_standard = proto_perl->Icollation_standard;
10961 PL_collxfrm_base = proto_perl->Icollxfrm_base;
10962 PL_collxfrm_mult = proto_perl->Icollxfrm_mult;
10963 #endif /* USE_LOCALE_COLLATE */
10965 #ifdef USE_LOCALE_NUMERIC
10966 PL_numeric_name = SAVEPV(proto_perl->Inumeric_name);
10967 PL_numeric_standard = proto_perl->Inumeric_standard;
10968 PL_numeric_local = proto_perl->Inumeric_local;
10969 PL_numeric_radix_sv = sv_dup_inc(proto_perl->Inumeric_radix_sv, param);
10970 #endif /* !USE_LOCALE_NUMERIC */
10972 /* utf8 character classes */
10973 PL_utf8_alnum = sv_dup_inc(proto_perl->Iutf8_alnum, param);
10974 PL_utf8_alnumc = sv_dup_inc(proto_perl->Iutf8_alnumc, param);
10975 PL_utf8_ascii = sv_dup_inc(proto_perl->Iutf8_ascii, param);
10976 PL_utf8_alpha = sv_dup_inc(proto_perl->Iutf8_alpha, param);
10977 PL_utf8_space = sv_dup_inc(proto_perl->Iutf8_space, param);
10978 PL_utf8_cntrl = sv_dup_inc(proto_perl->Iutf8_cntrl, param);
10979 PL_utf8_graph = sv_dup_inc(proto_perl->Iutf8_graph, param);
10980 PL_utf8_digit = sv_dup_inc(proto_perl->Iutf8_digit, param);
10981 PL_utf8_upper = sv_dup_inc(proto_perl->Iutf8_upper, param);
10982 PL_utf8_lower = sv_dup_inc(proto_perl->Iutf8_lower, param);
10983 PL_utf8_print = sv_dup_inc(proto_perl->Iutf8_print, param);
10984 PL_utf8_punct = sv_dup_inc(proto_perl->Iutf8_punct, param);
10985 PL_utf8_xdigit = sv_dup_inc(proto_perl->Iutf8_xdigit, param);
10986 PL_utf8_mark = sv_dup_inc(proto_perl->Iutf8_mark, param);
10987 PL_utf8_toupper = sv_dup_inc(proto_perl->Iutf8_toupper, param);
10988 PL_utf8_totitle = sv_dup_inc(proto_perl->Iutf8_totitle, param);
10989 PL_utf8_tolower = sv_dup_inc(proto_perl->Iutf8_tolower, param);
10990 PL_utf8_tofold = sv_dup_inc(proto_perl->Iutf8_tofold, param);
10991 PL_utf8_idstart = sv_dup_inc(proto_perl->Iutf8_idstart, param);
10992 PL_utf8_idcont = sv_dup_inc(proto_perl->Iutf8_idcont, param);
10994 /* Did the locale setup indicate UTF-8? */
10995 PL_utf8locale = proto_perl->Iutf8locale;
10996 /* Unicode features (see perlrun/-C) */
10997 PL_unicode = proto_perl->Iunicode;
10999 /* Pre-5.8 signals control */
11000 PL_signals = proto_perl->Isignals;
11002 /* times() ticks per second */
11003 PL_clocktick = proto_perl->Iclocktick;
11005 /* Recursion stopper for PerlIO_find_layer */
11006 PL_in_load_module = proto_perl->Iin_load_module;
11008 /* sort() routine */
11009 PL_sort_RealCmp = proto_perl->Isort_RealCmp;
11011 /* Not really needed/useful since the reenrant_retint is "volatile",
11012 * but do it for consistency's sake. */
11013 PL_reentrant_retint = proto_perl->Ireentrant_retint;
11015 /* Hooks to shared SVs and locks. */
11016 PL_sharehook = proto_perl->Isharehook;
11017 PL_lockhook = proto_perl->Ilockhook;
11018 PL_unlockhook = proto_perl->Iunlockhook;
11019 PL_threadhook = proto_perl->Ithreadhook;
11021 PL_runops_std = proto_perl->Irunops_std;
11022 PL_runops_dbg = proto_perl->Irunops_dbg;
11024 #ifdef THREADS_HAVE_PIDS
11025 PL_ppid = proto_perl->Ippid;
11029 PL_last_swash_hv = NULL; /* reinits on demand */
11030 PL_last_swash_klen = 0;
11031 PL_last_swash_key[0]= '\0';
11032 PL_last_swash_tmps = (U8*)NULL;
11033 PL_last_swash_slen = 0;
11035 PL_glob_index = proto_perl->Iglob_index;
11036 PL_srand_called = proto_perl->Isrand_called;
11037 PL_uudmap['M'] = 0; /* reinits on demand */
11038 PL_bitcount = NULL; /* reinits on demand */
11040 if (proto_perl->Ipsig_pend) {
11041 Newxz(PL_psig_pend, SIG_SIZE, int);
11044 PL_psig_pend = (int*)NULL;
11047 if (proto_perl->Ipsig_ptr) {
11048 Newxz(PL_psig_ptr, SIG_SIZE, SV*);
11049 Newxz(PL_psig_name, SIG_SIZE, SV*);
11050 for (i = 1; i < SIG_SIZE; i++) {
11051 PL_psig_ptr[i] = sv_dup_inc(proto_perl->Ipsig_ptr[i], param);
11052 PL_psig_name[i] = sv_dup_inc(proto_perl->Ipsig_name[i], param);
11056 PL_psig_ptr = (SV**)NULL;
11057 PL_psig_name = (SV**)NULL;
11060 /* thrdvar.h stuff */
11062 if (flags & CLONEf_COPY_STACKS) {
11063 /* next allocation will be PL_tmps_stack[PL_tmps_ix+1] */
11064 PL_tmps_ix = proto_perl->Ttmps_ix;
11065 PL_tmps_max = proto_perl->Ttmps_max;
11066 PL_tmps_floor = proto_perl->Ttmps_floor;
11067 Newxz(PL_tmps_stack, PL_tmps_max, SV*);
11069 while (i <= PL_tmps_ix) {
11070 PL_tmps_stack[i] = sv_dup_inc(proto_perl->Ttmps_stack[i], param);
11074 /* next PUSHMARK() sets *(PL_markstack_ptr+1) */
11075 i = proto_perl->Tmarkstack_max - proto_perl->Tmarkstack;
11076 Newxz(PL_markstack, i, I32);
11077 PL_markstack_max = PL_markstack + (proto_perl->Tmarkstack_max
11078 - proto_perl->Tmarkstack);
11079 PL_markstack_ptr = PL_markstack + (proto_perl->Tmarkstack_ptr
11080 - proto_perl->Tmarkstack);
11081 Copy(proto_perl->Tmarkstack, PL_markstack,
11082 PL_markstack_ptr - PL_markstack + 1, I32);
11084 /* next push_scope()/ENTER sets PL_scopestack[PL_scopestack_ix]
11085 * NOTE: unlike the others! */
11086 PL_scopestack_ix = proto_perl->Tscopestack_ix;
11087 PL_scopestack_max = proto_perl->Tscopestack_max;
11088 Newxz(PL_scopestack, PL_scopestack_max, I32);
11089 Copy(proto_perl->Tscopestack, PL_scopestack, PL_scopestack_ix, I32);
11091 /* NOTE: si_dup() looks at PL_markstack */
11092 PL_curstackinfo = si_dup(proto_perl->Tcurstackinfo, param);
11094 /* PL_curstack = PL_curstackinfo->si_stack; */
11095 PL_curstack = av_dup(proto_perl->Tcurstack, param);
11096 PL_mainstack = av_dup(proto_perl->Tmainstack, param);
11098 /* next PUSHs() etc. set *(PL_stack_sp+1) */
11099 PL_stack_base = AvARRAY(PL_curstack);
11100 PL_stack_sp = PL_stack_base + (proto_perl->Tstack_sp
11101 - proto_perl->Tstack_base);
11102 PL_stack_max = PL_stack_base + AvMAX(PL_curstack);
11104 /* next SSPUSHFOO() sets PL_savestack[PL_savestack_ix]
11105 * NOTE: unlike the others! */
11106 PL_savestack_ix = proto_perl->Tsavestack_ix;
11107 PL_savestack_max = proto_perl->Tsavestack_max;
11108 /*Newxz(PL_savestack, PL_savestack_max, ANY);*/
11109 PL_savestack = ss_dup(proto_perl, param);
11113 ENTER; /* perl_destruct() wants to LEAVE; */
11115 /* although we're not duplicating the tmps stack, we should still
11116 * add entries for any SVs on the tmps stack that got cloned by a
11117 * non-refcount means (eg a temp in @_); otherwise they will be
11120 for (i = 0; i<= proto_perl->Ttmps_ix; i++) {
11121 SV * const nsv = (SV*)ptr_table_fetch(PL_ptr_table,
11122 proto_perl->Ttmps_stack[i]);
11123 if (nsv && !SvREFCNT(nsv)) {
11125 PL_tmps_stack[++PL_tmps_ix] = SvREFCNT_inc(nsv);
11130 PL_start_env = proto_perl->Tstart_env; /* XXXXXX */
11131 PL_top_env = &PL_start_env;
11133 PL_op = proto_perl->Top;
11136 PL_Xpv = (XPV*)NULL;
11137 PL_na = proto_perl->Tna;
11139 PL_statbuf = proto_perl->Tstatbuf;
11140 PL_statcache = proto_perl->Tstatcache;
11141 PL_statgv = gv_dup(proto_perl->Tstatgv, param);
11142 PL_statname = sv_dup_inc(proto_perl->Tstatname, param);
11144 PL_timesbuf = proto_perl->Ttimesbuf;
11147 PL_tainted = proto_perl->Ttainted;
11148 PL_curpm = proto_perl->Tcurpm; /* XXX No PMOP ref count */
11149 PL_rs = sv_dup_inc(proto_perl->Trs, param);
11150 PL_last_in_gv = gv_dup(proto_perl->Tlast_in_gv, param);
11151 PL_ofs_sv = sv_dup_inc(proto_perl->Tofs_sv, param);
11152 PL_defoutgv = gv_dup_inc(proto_perl->Tdefoutgv, param);
11153 PL_chopset = proto_perl->Tchopset; /* XXX never deallocated */
11154 PL_toptarget = sv_dup_inc(proto_perl->Ttoptarget, param);
11155 PL_bodytarget = sv_dup_inc(proto_perl->Tbodytarget, param);
11156 PL_formtarget = sv_dup(proto_perl->Tformtarget, param);
11158 PL_restartop = proto_perl->Trestartop;
11159 PL_in_eval = proto_perl->Tin_eval;
11160 PL_delaymagic = proto_perl->Tdelaymagic;
11161 PL_dirty = proto_perl->Tdirty;
11162 PL_localizing = proto_perl->Tlocalizing;
11164 PL_errors = sv_dup_inc(proto_perl->Terrors, param);
11165 PL_hv_fetch_ent_mh = NULL;
11166 PL_modcount = proto_perl->Tmodcount;
11167 PL_lastgotoprobe = NULL;
11168 PL_dumpindent = proto_perl->Tdumpindent;
11170 PL_sortcop = (OP*)any_dup(proto_perl->Tsortcop, proto_perl);
11171 PL_sortstash = hv_dup(proto_perl->Tsortstash, param);
11172 PL_firstgv = gv_dup(proto_perl->Tfirstgv, param);
11173 PL_secondgv = gv_dup(proto_perl->Tsecondgv, param);
11174 PL_efloatbuf = NULL; /* reinits on demand */
11175 PL_efloatsize = 0; /* reinits on demand */
11179 PL_screamfirst = NULL;
11180 PL_screamnext = NULL;
11181 PL_maxscream = -1; /* reinits on demand */
11182 PL_lastscream = NULL;
11184 PL_watchaddr = NULL;
11187 PL_regdummy = proto_perl->Tregdummy;
11188 PL_regprecomp = NULL;
11191 PL_colorset = 0; /* reinits PL_colors[] */
11192 /*PL_colors[6] = {0,0,0,0,0,0};*/
11193 PL_reginput = NULL;
11196 PL_regstartp = (I32*)NULL;
11197 PL_regendp = (I32*)NULL;
11198 PL_reglastparen = (U32*)NULL;
11199 PL_reglastcloseparen = (U32*)NULL;
11201 PL_reg_start_tmp = (char**)NULL;
11202 PL_reg_start_tmpl = 0;
11203 PL_regdata = (struct reg_data*)NULL;
11206 PL_reg_eval_set = 0;
11208 PL_regprogram = (regnode*)NULL;
11210 PL_regcc = (CURCUR*)NULL;
11211 PL_reg_call_cc = (struct re_cc_state*)NULL;
11212 PL_reg_re = (regexp*)NULL;
11213 PL_reg_ganch = NULL;
11215 PL_reg_match_utf8 = FALSE;
11216 PL_reg_magic = (MAGIC*)NULL;
11218 PL_reg_oldcurpm = (PMOP*)NULL;
11219 PL_reg_curpm = (PMOP*)NULL;
11220 PL_reg_oldsaved = NULL;
11221 PL_reg_oldsavedlen = 0;
11222 #ifdef PERL_OLD_COPY_ON_WRITE
11225 PL_reg_maxiter = 0;
11226 PL_reg_leftiter = 0;
11227 PL_reg_poscache = NULL;
11228 PL_reg_poscache_size= 0;
11230 /* RE engine - function pointers */
11231 PL_regcompp = proto_perl->Tregcompp;
11232 PL_regexecp = proto_perl->Tregexecp;
11233 PL_regint_start = proto_perl->Tregint_start;
11234 PL_regint_string = proto_perl->Tregint_string;
11235 PL_regfree = proto_perl->Tregfree;
11237 PL_reginterp_cnt = 0;
11238 PL_reg_starttry = 0;
11240 /* Pluggable optimizer */
11241 PL_peepp = proto_perl->Tpeepp;
11243 PL_stashcache = newHV();
11245 if (!(flags & CLONEf_KEEP_PTR_TABLE)) {
11246 ptr_table_free(PL_ptr_table);
11247 PL_ptr_table = NULL;
11250 /* Call the ->CLONE method, if it exists, for each of the stashes
11251 identified by sv_dup() above.
11253 while(av_len(param->stashes) != -1) {
11254 HV* const stash = (HV*) av_shift(param->stashes);
11255 GV* const cloner = gv_fetchmethod_autoload(stash, "CLONE", 0);
11256 if (cloner && GvCV(cloner)) {
11261 XPUSHs(sv_2mortal(newSVhek(HvNAME_HEK(stash))));
11263 call_sv((SV*)GvCV(cloner), G_DISCARD);
11269 SvREFCNT_dec(param->stashes);
11271 /* orphaned? eg threads->new inside BEGIN or use */
11272 if (PL_compcv && ! SvREFCNT(PL_compcv)) {
11273 (void)SvREFCNT_inc(PL_compcv);
11274 SAVEFREESV(PL_compcv);
11280 #endif /* USE_ITHREADS */
11283 =head1 Unicode Support
11285 =for apidoc sv_recode_to_utf8
11287 The encoding is assumed to be an Encode object, on entry the PV
11288 of the sv is assumed to be octets in that encoding, and the sv
11289 will be converted into Unicode (and UTF-8).
11291 If the sv already is UTF-8 (or if it is not POK), or if the encoding
11292 is not a reference, nothing is done to the sv. If the encoding is not
11293 an C<Encode::XS> Encoding object, bad things will happen.
11294 (See F<lib/encoding.pm> and L<Encode>).
11296 The PV of the sv is returned.
11301 Perl_sv_recode_to_utf8(pTHX_ SV *sv, SV *encoding)
11304 if (SvPOK(sv) && !SvUTF8(sv) && !IN_BYTES && SvROK(encoding)) {
11318 Passing sv_yes is wrong - it needs to be or'ed set of constants
11319 for Encode::XS, while UTf-8 decode (currently) assumes a true value means
11320 remove converted chars from source.
11322 Both will default the value - let them.
11324 XPUSHs(&PL_sv_yes);
11327 call_method("decode", G_SCALAR);
11331 s = SvPV_const(uni, len);
11332 if (s != SvPVX_const(sv)) {
11333 SvGROW(sv, len + 1);
11334 Move(s, SvPVX(sv), len + 1, char);
11335 SvCUR_set(sv, len);
11342 return SvPOKp(sv) ? SvPVX(sv) : NULL;
11346 =for apidoc sv_cat_decode
11348 The encoding is assumed to be an Encode object, the PV of the ssv is
11349 assumed to be octets in that encoding and decoding the input starts
11350 from the position which (PV + *offset) pointed to. The dsv will be
11351 concatenated the decoded UTF-8 string from ssv. Decoding will terminate
11352 when the string tstr appears in decoding output or the input ends on
11353 the PV of the ssv. The value which the offset points will be modified
11354 to the last input position on the ssv.
11356 Returns TRUE if the terminator was found, else returns FALSE.
11361 Perl_sv_cat_decode(pTHX_ SV *dsv, SV *encoding,
11362 SV *ssv, int *offset, char *tstr, int tlen)
11366 if (SvPOK(ssv) && SvPOK(dsv) && SvROK(encoding) && offset) {
11377 XPUSHs(offsv = sv_2mortal(newSViv(*offset)));
11378 XPUSHs(sv_2mortal(newSVpvn(tstr, tlen)));
11380 call_method("cat_decode", G_SCALAR);
11382 ret = SvTRUE(TOPs);
11383 *offset = SvIV(offsv);
11389 Perl_croak(aTHX_ "Invalid argument to sv_cat_decode");
11394 /* ---------------------------------------------------------------------
11396 * support functions for report_uninit()
11399 /* the maxiumum size of array or hash where we will scan looking
11400 * for the undefined element that triggered the warning */
11402 #define FUV_MAX_SEARCH_SIZE 1000
11404 /* Look for an entry in the hash whose value has the same SV as val;
11405 * If so, return a mortal copy of the key. */
11408 S_find_hash_subscript(pTHX_ HV *hv, SV* val)
11411 register HE **array;
11414 if (!hv || SvMAGICAL(hv) || !HvARRAY(hv) ||
11415 (HvTOTALKEYS(hv) > FUV_MAX_SEARCH_SIZE))
11418 array = HvARRAY(hv);
11420 for (i=HvMAX(hv); i>0; i--) {
11421 register HE *entry;
11422 for (entry = array[i]; entry; entry = HeNEXT(entry)) {
11423 if (HeVAL(entry) != val)
11425 if ( HeVAL(entry) == &PL_sv_undef ||
11426 HeVAL(entry) == &PL_sv_placeholder)
11430 if (HeKLEN(entry) == HEf_SVKEY)
11431 return sv_mortalcopy(HeKEY_sv(entry));
11432 return sv_2mortal(newSVpvn(HeKEY(entry), HeKLEN(entry)));
11438 /* Look for an entry in the array whose value has the same SV as val;
11439 * If so, return the index, otherwise return -1. */
11442 S_find_array_subscript(pTHX_ AV *av, SV* val)
11447 if (!av || SvMAGICAL(av) || !AvARRAY(av) ||
11448 (AvFILLp(av) > FUV_MAX_SEARCH_SIZE))
11452 for (i=AvFILLp(av); i>=0; i--) {
11453 if (svp[i] == val && svp[i] != &PL_sv_undef)
11459 /* S_varname(): return the name of a variable, optionally with a subscript.
11460 * If gv is non-zero, use the name of that global, along with gvtype (one
11461 * of "$", "@", "%"); otherwise use the name of the lexical at pad offset
11462 * targ. Depending on the value of the subscript_type flag, return:
11465 #define FUV_SUBSCRIPT_NONE 1 /* "@foo" */
11466 #define FUV_SUBSCRIPT_ARRAY 2 /* "$foo[aindex]" */
11467 #define FUV_SUBSCRIPT_HASH 3 /* "$foo{keyname}" */
11468 #define FUV_SUBSCRIPT_WITHIN 4 /* "within @foo" */
11471 S_varname(pTHX_ GV *gv, const char gvtype, PADOFFSET targ,
11472 SV* keyname, I32 aindex, int subscript_type)
11475 SV * const name = sv_newmortal();
11478 buffer[0] = gvtype;
11481 /* as gv_fullname4(), but add literal '^' for $^FOO names */
11483 gv_fullname4(name, gv, buffer, 0);
11485 if ((unsigned int)SvPVX(name)[1] <= 26) {
11487 buffer[1] = SvPVX(name)[1] + 'A' - 1;
11489 /* Swap the 1 unprintable control character for the 2 byte pretty
11490 version - ie substr($name, 1, 1) = $buffer; */
11491 sv_insert(name, 1, 1, buffer, 2);
11496 CV * const cv = find_runcv(&unused);
11500 if (!cv || !CvPADLIST(cv))
11502 av = (AV*)(*av_fetch(CvPADLIST(cv), 0, FALSE));
11503 sv = *av_fetch(av, targ, FALSE);
11504 /* SvLEN in a pad name is not to be trusted */
11505 sv_setpv(name, SvPV_nolen_const(sv));
11508 if (subscript_type == FUV_SUBSCRIPT_HASH) {
11509 SV * const sv = newSV(0);
11510 *SvPVX(name) = '$';
11511 Perl_sv_catpvf(aTHX_ name, "{%s}",
11512 pv_display(sv,SvPVX_const(keyname), SvCUR(keyname), 0, 32));
11515 else if (subscript_type == FUV_SUBSCRIPT_ARRAY) {
11516 *SvPVX(name) = '$';
11517 Perl_sv_catpvf(aTHX_ name, "[%"IVdf"]", (IV)aindex);
11519 else if (subscript_type == FUV_SUBSCRIPT_WITHIN)
11520 Perl_sv_insert(aTHX_ name, 0, 0, STR_WITH_LEN("within "));
11527 =for apidoc find_uninit_var
11529 Find the name of the undefined variable (if any) that caused the operator o
11530 to issue a "Use of uninitialized value" warning.
11531 If match is true, only return a name if it's value matches uninit_sv.
11532 So roughly speaking, if a unary operator (such as OP_COS) generates a
11533 warning, then following the direct child of the op may yield an
11534 OP_PADSV or OP_GV that gives the name of the undefined variable. On the
11535 other hand, with OP_ADD there are two branches to follow, so we only print
11536 the variable name if we get an exact match.
11538 The name is returned as a mortal SV.
11540 Assumes that PL_op is the op that originally triggered the error, and that
11541 PL_comppad/PL_curpad points to the currently executing pad.
11547 S_find_uninit_var(pTHX_ OP* obase, SV* uninit_sv, bool match)
11555 if (!obase || (match && (!uninit_sv || uninit_sv == &PL_sv_undef ||
11556 uninit_sv == &PL_sv_placeholder)))
11559 switch (obase->op_type) {
11566 const bool pad = (obase->op_type == OP_PADAV || obase->op_type == OP_PADHV);
11567 const bool hash = (obase->op_type == OP_PADHV || obase->op_type == OP_RV2HV);
11570 int subscript_type = FUV_SUBSCRIPT_WITHIN;
11572 if (pad) { /* @lex, %lex */
11573 sv = PAD_SVl(obase->op_targ);
11577 if (cUNOPx(obase)->op_first->op_type == OP_GV) {
11578 /* @global, %global */
11579 gv = cGVOPx_gv(cUNOPx(obase)->op_first);
11582 sv = hash ? (SV*)GvHV(gv): (SV*)GvAV(gv);
11584 else /* @{expr}, %{expr} */
11585 return find_uninit_var(cUNOPx(obase)->op_first,
11589 /* attempt to find a match within the aggregate */
11591 keysv = S_find_hash_subscript(aTHX_ (HV*)sv, uninit_sv);
11593 subscript_type = FUV_SUBSCRIPT_HASH;
11596 index = S_find_array_subscript(aTHX_ (AV*)sv, uninit_sv);
11598 subscript_type = FUV_SUBSCRIPT_ARRAY;
11601 if (match && subscript_type == FUV_SUBSCRIPT_WITHIN)
11604 return varname(gv, hash ? '%' : '@', obase->op_targ,
11605 keysv, index, subscript_type);
11609 if (match && PAD_SVl(obase->op_targ) != uninit_sv)
11611 return varname(NULL, '$', obase->op_targ,
11612 NULL, 0, FUV_SUBSCRIPT_NONE);
11615 gv = cGVOPx_gv(obase);
11616 if (!gv || (match && GvSV(gv) != uninit_sv))
11618 return varname(gv, '$', 0, NULL, 0, FUV_SUBSCRIPT_NONE);
11621 if (obase->op_flags & OPf_SPECIAL) { /* lexical array */
11624 av = (AV*)PAD_SV(obase->op_targ);
11625 if (!av || SvRMAGICAL(av))
11627 svp = av_fetch(av, (I32)obase->op_private, FALSE);
11628 if (!svp || *svp != uninit_sv)
11631 return varname(NULL, '$', obase->op_targ,
11632 NULL, (I32)obase->op_private, FUV_SUBSCRIPT_ARRAY);
11635 gv = cGVOPx_gv(obase);
11641 if (!av || SvRMAGICAL(av))
11643 svp = av_fetch(av, (I32)obase->op_private, FALSE);
11644 if (!svp || *svp != uninit_sv)
11647 return varname(gv, '$', 0,
11648 NULL, (I32)obase->op_private, FUV_SUBSCRIPT_ARRAY);
11653 o = cUNOPx(obase)->op_first;
11654 if (!o || o->op_type != OP_NULL ||
11655 ! (o->op_targ == OP_AELEM || o->op_targ == OP_HELEM))
11657 return find_uninit_var(cBINOPo->op_last, uninit_sv, match);
11661 if (PL_op == obase)
11662 /* $a[uninit_expr] or $h{uninit_expr} */
11663 return find_uninit_var(cBINOPx(obase)->op_last, uninit_sv, match);
11666 o = cBINOPx(obase)->op_first;
11667 kid = cBINOPx(obase)->op_last;
11669 /* get the av or hv, and optionally the gv */
11671 if (o->op_type == OP_PADAV || o->op_type == OP_PADHV) {
11672 sv = PAD_SV(o->op_targ);
11674 else if ((o->op_type == OP_RV2AV || o->op_type == OP_RV2HV)
11675 && cUNOPo->op_first->op_type == OP_GV)
11677 gv = cGVOPx_gv(cUNOPo->op_first);
11680 sv = o->op_type == OP_RV2HV ? (SV*)GvHV(gv) : (SV*)GvAV(gv);
11685 if (kid && kid->op_type == OP_CONST && SvOK(cSVOPx_sv(kid))) {
11686 /* index is constant */
11690 if (obase->op_type == OP_HELEM) {
11691 HE* he = hv_fetch_ent((HV*)sv, cSVOPx_sv(kid), 0, 0);
11692 if (!he || HeVAL(he) != uninit_sv)
11696 SV * const * const svp = av_fetch((AV*)sv, SvIV(cSVOPx_sv(kid)), FALSE);
11697 if (!svp || *svp != uninit_sv)
11701 if (obase->op_type == OP_HELEM)
11702 return varname(gv, '%', o->op_targ,
11703 cSVOPx_sv(kid), 0, FUV_SUBSCRIPT_HASH);
11705 return varname(gv, '@', o->op_targ, NULL,
11706 SvIV(cSVOPx_sv(kid)), FUV_SUBSCRIPT_ARRAY);
11709 /* index is an expression;
11710 * attempt to find a match within the aggregate */
11711 if (obase->op_type == OP_HELEM) {
11712 SV * const keysv = S_find_hash_subscript(aTHX_ (HV*)sv, uninit_sv);
11714 return varname(gv, '%', o->op_targ,
11715 keysv, 0, FUV_SUBSCRIPT_HASH);
11718 const I32 index = S_find_array_subscript(aTHX_ (AV*)sv, uninit_sv);
11720 return varname(gv, '@', o->op_targ,
11721 NULL, index, FUV_SUBSCRIPT_ARRAY);
11726 (o->op_type == OP_PADAV || o->op_type == OP_RV2AV)
11728 o->op_targ, NULL, 0, FUV_SUBSCRIPT_WITHIN);
11733 /* only examine RHS */
11734 return find_uninit_var(cBINOPx(obase)->op_first, uninit_sv, match);
11737 o = cUNOPx(obase)->op_first;
11738 if (o->op_type == OP_PUSHMARK)
11741 if (!o->op_sibling) {
11742 /* one-arg version of open is highly magical */
11744 if (o->op_type == OP_GV) { /* open FOO; */
11746 if (match && GvSV(gv) != uninit_sv)
11748 return varname(gv, '$', 0,
11749 NULL, 0, FUV_SUBSCRIPT_NONE);
11751 /* other possibilities not handled are:
11752 * open $x; or open my $x; should return '${*$x}'
11753 * open expr; should return '$'.expr ideally
11759 /* ops where $_ may be an implicit arg */
11763 if ( !(obase->op_flags & OPf_STACKED)) {
11764 if (uninit_sv == ((obase->op_private & OPpTARGET_MY)
11765 ? PAD_SVl(obase->op_targ)
11768 sv = sv_newmortal();
11769 sv_setpvn(sv, "$_", 2);
11777 /* skip filehandle as it can't produce 'undef' warning */
11778 o = cUNOPx(obase)->op_first;
11779 if ((obase->op_flags & OPf_STACKED) && o->op_type == OP_PUSHMARK)
11780 o = o->op_sibling->op_sibling;
11787 match = 1; /* XS or custom code could trigger random warnings */
11792 if (SvROK(PL_rs) && uninit_sv == SvRV(PL_rs))
11793 return sv_2mortal(newSVpvs("${$/}"));
11798 if (!(obase->op_flags & OPf_KIDS))
11800 o = cUNOPx(obase)->op_first;
11806 /* if all except one arg are constant, or have no side-effects,
11807 * or are optimized away, then it's unambiguous */
11809 for (kid=o; kid; kid = kid->op_sibling) {
11811 ( (kid->op_type == OP_CONST && SvOK(cSVOPx_sv(kid)))
11812 || (kid->op_type == OP_NULL && ! (kid->op_flags & OPf_KIDS))
11813 || (kid->op_type == OP_PUSHMARK)
11817 if (o2) { /* more than one found */
11824 return find_uninit_var(o2, uninit_sv, match);
11826 /* scan all args */
11828 sv = find_uninit_var(o, uninit_sv, 1);
11840 =for apidoc report_uninit
11842 Print appropriate "Use of uninitialized variable" warning
11848 Perl_report_uninit(pTHX_ SV* uninit_sv)
11852 SV* varname = NULL;
11854 varname = find_uninit_var(PL_op, uninit_sv,0);
11856 sv_insert(varname, 0, 0, " ", 1);
11858 Perl_warner(aTHX_ packWARN(WARN_UNINITIALIZED), PL_warn_uninit,
11859 varname ? SvPV_nolen_const(varname) : "",
11860 " in ", OP_DESC(PL_op));
11863 Perl_warner(aTHX_ packWARN(WARN_UNINITIALIZED), PL_warn_uninit,
11869 * c-indentation-style: bsd
11870 * c-basic-offset: 4
11871 * indent-tabs-mode: t
11874 * ex: set ts=8 sts=4 sw=4 noet: