3 * Copyright (C) 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000,
4 * 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009 by Larry Wall
7 * You may distribute under the terms of either the GNU General Public
8 * License or the Artistic License, as specified in the README file.
13 * 'I wonder what the Entish is for "yes" and "no",' he thought.
16 * [p.480 of _The Lord of the Rings_, III/iv: "Treebeard"]
22 * This file contains the code that creates, manipulates and destroys
23 * scalar values (SVs). The other types (AV, HV, GV, etc.) reuse the
24 * structure of an SV, so their creation and destruction is handled
25 * here; higher-level functions are in av.c, hv.c, and so on. Opcode
26 * level functions (eg. substr, split, join) for each of the types are
39 /* Missing proto on LynxOS */
40 char *gconvert(double, int, int, char *);
44 # define SNPRINTF_G(nv, buffer, size, ndig) \
45 quadmath_snprintf(buffer, size, "%.*Qg", (int)ndig, (NV)(nv))
47 # define SNPRINTF_G(nv, buffer, size, ndig) \
48 PERL_UNUSED_RESULT(Gconvert((NV)(nv), (int)ndig, 0, buffer))
51 #ifndef SV_COW_THRESHOLD
52 # define SV_COW_THRESHOLD 0 /* COW iff len > K */
54 #ifndef SV_COWBUF_THRESHOLD
55 # define SV_COWBUF_THRESHOLD 1250 /* COW iff len > K */
57 #ifndef SV_COW_MAX_WASTE_THRESHOLD
58 # define SV_COW_MAX_WASTE_THRESHOLD 80 /* COW iff (len - cur) < K */
60 #ifndef SV_COWBUF_WASTE_THRESHOLD
61 # define SV_COWBUF_WASTE_THRESHOLD 80 /* COW iff (len - cur) < K */
63 #ifndef SV_COW_MAX_WASTE_FACTOR_THRESHOLD
64 # define SV_COW_MAX_WASTE_FACTOR_THRESHOLD 2 /* COW iff len < (cur * K) */
66 #ifndef SV_COWBUF_WASTE_FACTOR_THRESHOLD
67 # define SV_COWBUF_WASTE_FACTOR_THRESHOLD 2 /* COW iff len < (cur * K) */
69 /* Work around compiler warnings about unsigned >= THRESHOLD when thres-
72 # define GE_COW_THRESHOLD(cur) ((cur) >= SV_COW_THRESHOLD)
74 # define GE_COW_THRESHOLD(cur) 1
76 #if SV_COWBUF_THRESHOLD
77 # define GE_COWBUF_THRESHOLD(cur) ((cur) >= SV_COWBUF_THRESHOLD)
79 # define GE_COWBUF_THRESHOLD(cur) 1
81 #if SV_COW_MAX_WASTE_THRESHOLD
82 # define GE_COW_MAX_WASTE_THRESHOLD(cur,len) (((len)-(cur)) < SV_COW_MAX_WASTE_THRESHOLD)
84 # define GE_COW_MAX_WASTE_THRESHOLD(cur,len) 1
86 #if SV_COWBUF_WASTE_THRESHOLD
87 # define GE_COWBUF_WASTE_THRESHOLD(cur,len) (((len)-(cur)) < SV_COWBUF_WASTE_THRESHOLD)
89 # define GE_COWBUF_WASTE_THRESHOLD(cur,len) 1
91 #if SV_COW_MAX_WASTE_FACTOR_THRESHOLD
92 # define GE_COW_MAX_WASTE_FACTOR_THRESHOLD(cur,len) ((len) < SV_COW_MAX_WASTE_FACTOR_THRESHOLD * (cur))
94 # define GE_COW_MAX_WASTE_FACTOR_THRESHOLD(cur,len) 1
96 #if SV_COWBUF_WASTE_FACTOR_THRESHOLD
97 # define GE_COWBUF_WASTE_FACTOR_THRESHOLD(cur,len) ((len) < SV_COWBUF_WASTE_FACTOR_THRESHOLD * (cur))
99 # define GE_COWBUF_WASTE_FACTOR_THRESHOLD(cur,len) 1
102 #define CHECK_COW_THRESHOLD(cur,len) (\
103 GE_COW_THRESHOLD((cur)) && \
104 GE_COW_MAX_WASTE_THRESHOLD((cur),(len)) && \
105 GE_COW_MAX_WASTE_FACTOR_THRESHOLD((cur),(len)) \
107 #define CHECK_COWBUF_THRESHOLD(cur,len) (\
108 GE_COWBUF_THRESHOLD((cur)) && \
109 GE_COWBUF_WASTE_THRESHOLD((cur),(len)) && \
110 GE_COWBUF_WASTE_FACTOR_THRESHOLD((cur),(len)) \
113 #ifdef PERL_UTF8_CACHE_ASSERT
114 /* if adding more checks watch out for the following tests:
115 * t/op/index.t t/op/length.t t/op/pat.t t/op/substr.t
116 * lib/utf8.t lib/Unicode/Collate/t/index.t
119 # define ASSERT_UTF8_CACHE(cache) \
120 STMT_START { if (cache) { assert((cache)[0] <= (cache)[1]); \
121 assert((cache)[2] <= (cache)[3]); \
122 assert((cache)[3] <= (cache)[1]);} \
125 # define ASSERT_UTF8_CACHE(cache) NOOP
128 static const char S_destroy[] = "DESTROY";
129 #define S_destroy_len (sizeof(S_destroy)-1)
131 /* ============================================================================
133 =head1 Allocation and deallocation of SVs.
134 An SV (or AV, HV, etc.) is allocated in two parts: the head (struct
135 sv, av, hv...) contains type and reference count information, and for
136 many types, a pointer to the body (struct xrv, xpv, xpviv...), which
137 contains fields specific to each type. Some types store all they need
138 in the head, so don't have a body.
140 In all but the most memory-paranoid configurations (ex: PURIFY), heads
141 and bodies are allocated out of arenas, which by default are
142 approximately 4K chunks of memory parcelled up into N heads or bodies.
143 Sv-bodies are allocated by their sv-type, guaranteeing size
144 consistency needed to allocate safely from arrays.
146 For SV-heads, the first slot in each arena is reserved, and holds a
147 link to the next arena, some flags, and a note of the number of slots.
148 Snaked through each arena chain is a linked list of free items; when
149 this becomes empty, an extra arena is allocated and divided up into N
150 items which are threaded into the free list.
152 SV-bodies are similar, but they use arena-sets by default, which
153 separate the link and info from the arena itself, and reclaim the 1st
154 slot in the arena. SV-bodies are further described later.
156 The following global variables are associated with arenas:
158 PL_sv_arenaroot pointer to list of SV arenas
159 PL_sv_root pointer to list of free SV structures
161 PL_body_arenas head of linked-list of body arenas
162 PL_body_roots[] array of pointers to list of free bodies of svtype
163 arrays are indexed by the svtype needed
165 A few special SV heads are not allocated from an arena, but are
166 instead directly created in the interpreter structure, eg PL_sv_undef.
167 The size of arenas can be changed from the default by setting
168 PERL_ARENA_SIZE appropriately at compile time.
170 The SV arena serves the secondary purpose of allowing still-live SVs
171 to be located and destroyed during final cleanup.
173 At the lowest level, the macros new_SV() and del_SV() grab and free
174 an SV head. (If debugging with -DD, del_SV() calls the function S_del_sv()
175 to return the SV to the free list with error checking.) new_SV() calls
176 more_sv() / sv_add_arena() to add an extra arena if the free list is empty.
177 SVs in the free list have their SvTYPE field set to all ones.
179 At the time of very final cleanup, sv_free_arenas() is called from
180 perl_destruct() to physically free all the arenas allocated since the
181 start of the interpreter.
183 The function visit() scans the SV arenas list, and calls a specified
184 function for each SV it finds which is still live - ie which has an SvTYPE
185 other than all 1's, and a non-zero SvREFCNT. visit() is used by the
186 following functions (specified as [function that calls visit()] / [function
187 called by visit() for each SV]):
189 sv_report_used() / do_report_used()
190 dump all remaining SVs (debugging aid)
192 sv_clean_objs() / do_clean_objs(),do_clean_named_objs(),
193 do_clean_named_io_objs(),do_curse()
194 Attempt to free all objects pointed to by RVs,
195 try to do the same for all objects indir-
196 ectly referenced by typeglobs too, and
197 then do a final sweep, cursing any
198 objects that remain. Called once from
199 perl_destruct(), prior to calling sv_clean_all()
202 sv_clean_all() / do_clean_all()
203 SvREFCNT_dec(sv) each remaining SV, possibly
204 triggering an sv_free(). It also sets the
205 SVf_BREAK flag on the SV to indicate that the
206 refcnt has been artificially lowered, and thus
207 stopping sv_free() from giving spurious warnings
208 about SVs which unexpectedly have a refcnt
209 of zero. called repeatedly from perl_destruct()
210 until there are no SVs left.
212 =head2 Arena allocator API Summary
214 Private API to rest of sv.c
218 new_XPVNV(), del_XPVGV(),
223 sv_report_used(), sv_clean_objs(), sv_clean_all(), sv_free_arenas()
227 * ========================================================================= */
230 * "A time to plant, and a time to uproot what was planted..."
234 # define MEM_LOG_NEW_SV(sv, file, line, func) \
235 Perl_mem_log_new_sv(sv, file, line, func)
236 # define MEM_LOG_DEL_SV(sv, file, line, func) \
237 Perl_mem_log_del_sv(sv, file, line, func)
239 # define MEM_LOG_NEW_SV(sv, file, line, func) NOOP
240 # define MEM_LOG_DEL_SV(sv, file, line, func) NOOP
243 #ifdef DEBUG_LEAKING_SCALARS
244 # define FREE_SV_DEBUG_FILE(sv) STMT_START { \
245 if ((sv)->sv_debug_file) PerlMemShared_free((sv)->sv_debug_file); \
247 # define DEBUG_SV_SERIAL(sv) \
248 DEBUG_m(PerlIO_printf(Perl_debug_log, "0x%" UVxf ": (%05ld) del_SV\n", \
249 PTR2UV(sv), (long)(sv)->sv_debug_serial))
251 # define FREE_SV_DEBUG_FILE(sv)
252 # define DEBUG_SV_SERIAL(sv) NOOP
256 # define SvARENA_CHAIN(sv) ((sv)->sv_u.svu_rv)
257 # define SvARENA_CHAIN_SET(sv,val) (sv)->sv_u.svu_rv = MUTABLE_SV((val))
258 /* Whilst I'd love to do this, it seems that things like to check on
260 # define POISON_SV_HEAD(sv) PoisonNew(sv, 1, struct STRUCT_SV)
262 # define POISON_SV_HEAD(sv) PoisonNew(&SvANY(sv), 1, void *), \
263 PoisonNew(&SvREFCNT(sv), 1, U32)
265 # define SvARENA_CHAIN(sv) SvANY(sv)
266 # define SvARENA_CHAIN_SET(sv,val) SvANY(sv) = (void *)(val)
267 # define POISON_SV_HEAD(sv)
270 /* Mark an SV head as unused, and add to free list.
272 * If SVf_BREAK is set, skip adding it to the free list, as this SV had
273 * its refcount artificially decremented during global destruction, so
274 * there may be dangling pointers to it. The last thing we want in that
275 * case is for it to be reused. */
277 #define plant_SV(p) \
279 const U32 old_flags = SvFLAGS(p); \
280 MEM_LOG_DEL_SV(p, __FILE__, __LINE__, FUNCTION__); \
281 DEBUG_SV_SERIAL(p); \
282 FREE_SV_DEBUG_FILE(p); \
284 SvFLAGS(p) = SVTYPEMASK; \
285 if (!(old_flags & SVf_BREAK)) { \
286 SvARENA_CHAIN_SET(p, PL_sv_root); \
292 #define uproot_SV(p) \
295 PL_sv_root = MUTABLE_SV(SvARENA_CHAIN(p)); \
300 /* make some more SVs by adding another arena */
306 char *chunk; /* must use New here to match call to */
307 Newx(chunk,PERL_ARENA_SIZE,char); /* Safefree() in sv_free_arenas() */
308 sv_add_arena(chunk, PERL_ARENA_SIZE, 0);
313 /* new_SV(): return a new, empty SV head */
315 #ifdef DEBUG_LEAKING_SCALARS
316 /* provide a real function for a debugger to play with */
318 S_new_SV(pTHX_ const char *file, int line, const char *func)
325 sv = S_more_sv(aTHX);
329 sv->sv_debug_optype = PL_op ? PL_op->op_type : 0;
330 sv->sv_debug_line = (U16) (PL_parser && PL_parser->copline != NOLINE
336 sv->sv_debug_inpad = 0;
337 sv->sv_debug_parent = NULL;
338 sv->sv_debug_file = PL_curcop ? savesharedpv(CopFILE(PL_curcop)): NULL;
340 sv->sv_debug_serial = PL_sv_serial++;
342 MEM_LOG_NEW_SV(sv, file, line, func);
343 DEBUG_m(PerlIO_printf(Perl_debug_log, "0x%" UVxf ": (%05ld) new_SV (from %s:%d [%s])\n",
344 PTR2UV(sv), (long)sv->sv_debug_serial, file, line, func));
348 # define new_SV(p) (p)=S_new_SV(aTHX_ __FILE__, __LINE__, FUNCTION__)
356 (p) = S_more_sv(aTHX); \
360 MEM_LOG_NEW_SV(p, __FILE__, __LINE__, FUNCTION__); \
365 /* del_SV(): return an empty SV head to the free list */
378 S_del_sv(pTHX_ SV *p)
380 PERL_ARGS_ASSERT_DEL_SV;
385 for (sva = PL_sv_arenaroot; sva; sva = MUTABLE_SV(SvANY(sva))) {
386 const SV * const sv = sva + 1;
387 const SV * const svend = &sva[SvREFCNT(sva)];
388 if (p >= sv && p < svend) {
394 Perl_ck_warner_d(aTHX_ packWARN(WARN_INTERNAL),
395 "Attempt to free non-arena SV: 0x%" UVxf
396 pTHX__FORMAT, PTR2UV(p) pTHX__VALUE);
403 #else /* ! DEBUGGING */
405 #define del_SV(p) plant_SV(p)
407 #endif /* DEBUGGING */
411 =head1 SV Manipulation Functions
413 =for apidoc sv_add_arena
415 Given a chunk of memory, link it to the head of the list of arenas,
416 and split it into a list of free SVs.
422 S_sv_add_arena(pTHX_ char *const ptr, const U32 size, const U32 flags)
424 SV *const sva = MUTABLE_SV(ptr);
428 PERL_ARGS_ASSERT_SV_ADD_ARENA;
430 /* The first SV in an arena isn't an SV. */
431 SvANY(sva) = (void *) PL_sv_arenaroot; /* ptr to next arena */
432 SvREFCNT(sva) = size / sizeof(SV); /* number of SV slots */
433 SvFLAGS(sva) = flags; /* FAKE if not to be freed */
435 PL_sv_arenaroot = sva;
436 PL_sv_root = sva + 1;
438 svend = &sva[SvREFCNT(sva) - 1];
441 SvARENA_CHAIN_SET(sv, (sv + 1));
445 /* Must always set typemask because it's always checked in on cleanup
446 when the arenas are walked looking for objects. */
447 SvFLAGS(sv) = SVTYPEMASK;
450 SvARENA_CHAIN_SET(sv, 0);
454 SvFLAGS(sv) = SVTYPEMASK;
457 /* visit(): call the named function for each non-free SV in the arenas
458 * whose flags field matches the flags/mask args. */
461 S_visit(pTHX_ SVFUNC_t f, const U32 flags, const U32 mask)
466 PERL_ARGS_ASSERT_VISIT;
468 for (sva = PL_sv_arenaroot; sva; sva = MUTABLE_SV(SvANY(sva))) {
469 const SV * const svend = &sva[SvREFCNT(sva)];
471 for (sv = sva + 1; sv < svend; ++sv) {
472 if (SvTYPE(sv) != (svtype)SVTYPEMASK
473 && (sv->sv_flags & mask) == flags
486 /* called by sv_report_used() for each live SV */
489 do_report_used(pTHX_ SV *const sv)
491 if (SvTYPE(sv) != (svtype)SVTYPEMASK) {
492 PerlIO_printf(Perl_debug_log, "****\n");
499 =for apidoc sv_report_used
501 Dump the contents of all SVs not yet freed (debugging aid).
507 Perl_sv_report_used(pTHX)
510 visit(do_report_used, 0, 0);
516 /* called by sv_clean_objs() for each live SV */
519 do_clean_objs(pTHX_ SV *const ref)
523 SV * const target = SvRV(ref);
524 if (SvOBJECT(target)) {
525 DEBUG_D((PerlIO_printf(Perl_debug_log, "Cleaning object ref:\n "), sv_dump(ref)));
526 if (SvWEAKREF(ref)) {
527 sv_del_backref(target, ref);
533 SvREFCNT_dec_NN(target);
540 /* clear any slots in a GV which hold objects - except IO;
541 * called by sv_clean_objs() for each live GV */
544 do_clean_named_objs(pTHX_ SV *const sv)
547 assert(SvTYPE(sv) == SVt_PVGV);
548 assert(isGV_with_GP(sv));
552 /* freeing GP entries may indirectly free the current GV;
553 * hold onto it while we mess with the GP slots */
556 if ( ((obj = GvSV(sv) )) && SvOBJECT(obj)) {
557 DEBUG_D((PerlIO_printf(Perl_debug_log,
558 "Cleaning named glob SV object:\n "), sv_dump(obj)));
560 SvREFCNT_dec_NN(obj);
562 if ( ((obj = MUTABLE_SV(GvAV(sv)) )) && SvOBJECT(obj)) {
563 DEBUG_D((PerlIO_printf(Perl_debug_log,
564 "Cleaning named glob AV object:\n "), sv_dump(obj)));
566 SvREFCNT_dec_NN(obj);
568 if ( ((obj = MUTABLE_SV(GvHV(sv)) )) && SvOBJECT(obj)) {
569 DEBUG_D((PerlIO_printf(Perl_debug_log,
570 "Cleaning named glob HV object:\n "), sv_dump(obj)));
572 SvREFCNT_dec_NN(obj);
574 if ( ((obj = MUTABLE_SV(GvCV(sv)) )) && SvOBJECT(obj)) {
575 DEBUG_D((PerlIO_printf(Perl_debug_log,
576 "Cleaning named glob CV object:\n "), sv_dump(obj)));
578 SvREFCNT_dec_NN(obj);
580 SvREFCNT_dec_NN(sv); /* undo the inc above */
583 /* clear any IO slots in a GV which hold objects (except stderr, defout);
584 * called by sv_clean_objs() for each live GV */
587 do_clean_named_io_objs(pTHX_ SV *const sv)
590 assert(SvTYPE(sv) == SVt_PVGV);
591 assert(isGV_with_GP(sv));
592 if (!GvGP(sv) || sv == (SV*)PL_stderrgv || sv == (SV*)PL_defoutgv)
596 if ( ((obj = MUTABLE_SV(GvIO(sv)) )) && SvOBJECT(obj)) {
597 DEBUG_D((PerlIO_printf(Perl_debug_log,
598 "Cleaning named glob IO object:\n "), sv_dump(obj)));
600 SvREFCNT_dec_NN(obj);
602 SvREFCNT_dec_NN(sv); /* undo the inc above */
605 /* Void wrapper to pass to visit() */
607 do_curse(pTHX_ SV * const sv) {
608 if ((PL_stderrgv && GvGP(PL_stderrgv) && (SV*)GvIO(PL_stderrgv) == sv)
609 || (PL_defoutgv && GvGP(PL_defoutgv) && (SV*)GvIO(PL_defoutgv) == sv))
615 =for apidoc sv_clean_objs
617 Attempt to destroy all objects not yet freed.
623 Perl_sv_clean_objs(pTHX)
626 PL_in_clean_objs = TRUE;
627 visit(do_clean_objs, SVf_ROK, SVf_ROK);
628 /* Some barnacles may yet remain, clinging to typeglobs.
629 * Run the non-IO destructors first: they may want to output
630 * error messages, close files etc */
631 visit(do_clean_named_objs, SVt_PVGV|SVpgv_GP, SVTYPEMASK|SVp_POK|SVpgv_GP);
632 visit(do_clean_named_io_objs, SVt_PVGV|SVpgv_GP, SVTYPEMASK|SVp_POK|SVpgv_GP);
633 /* And if there are some very tenacious barnacles clinging to arrays,
634 closures, or what have you.... */
635 visit(do_curse, SVs_OBJECT, SVs_OBJECT);
636 olddef = PL_defoutgv;
637 PL_defoutgv = NULL; /* disable skip of PL_defoutgv */
638 if (olddef && isGV_with_GP(olddef))
639 do_clean_named_io_objs(aTHX_ MUTABLE_SV(olddef));
640 olderr = PL_stderrgv;
641 PL_stderrgv = NULL; /* disable skip of PL_stderrgv */
642 if (olderr && isGV_with_GP(olderr))
643 do_clean_named_io_objs(aTHX_ MUTABLE_SV(olderr));
644 SvREFCNT_dec(olddef);
645 PL_in_clean_objs = FALSE;
648 /* called by sv_clean_all() for each live SV */
651 do_clean_all(pTHX_ SV *const sv)
653 if (sv == (const SV *) PL_fdpid || sv == (const SV *)PL_strtab) {
654 /* don't clean pid table and strtab */
657 DEBUG_D((PerlIO_printf(Perl_debug_log, "Cleaning loops: SV at 0x%" UVxf "\n", PTR2UV(sv)) ));
658 SvFLAGS(sv) |= SVf_BREAK;
663 =for apidoc sv_clean_all
665 Decrement the refcnt of each remaining SV, possibly triggering a
666 cleanup. This function may have to be called multiple times to free
667 SVs which are in complex self-referential hierarchies.
673 Perl_sv_clean_all(pTHX)
676 PL_in_clean_all = TRUE;
677 cleaned = visit(do_clean_all, 0,0);
682 ARENASETS: a meta-arena implementation which separates arena-info
683 into struct arena_set, which contains an array of struct
684 arena_descs, each holding info for a single arena. By separating
685 the meta-info from the arena, we recover the 1st slot, formerly
686 borrowed for list management. The arena_set is about the size of an
687 arena, avoiding the needless malloc overhead of a naive linked-list.
689 The cost is 1 arena-set malloc per ~320 arena-mallocs, + the unused
690 memory in the last arena-set (1/2 on average). In trade, we get
691 back the 1st slot in each arena (ie 1.7% of a CV-arena, less for
692 smaller types). The recovery of the wasted space allows use of
693 small arenas for large, rare body types, by changing array* fields
694 in body_details_by_type[] below.
697 char *arena; /* the raw storage, allocated aligned */
698 size_t size; /* its size ~4k typ */
699 svtype utype; /* bodytype stored in arena */
704 /* Get the maximum number of elements in set[] such that struct arena_set
705 will fit within PERL_ARENA_SIZE, which is probably just under 4K, and
706 therefore likely to be 1 aligned memory page. */
708 #define ARENAS_PER_SET ((PERL_ARENA_SIZE - sizeof(struct arena_set*) \
709 - 2 * sizeof(int)) / sizeof (struct arena_desc))
712 struct arena_set* next;
713 unsigned int set_size; /* ie ARENAS_PER_SET */
714 unsigned int curr; /* index of next available arena-desc */
715 struct arena_desc set[ARENAS_PER_SET];
719 =for apidoc sv_free_arenas
721 Deallocate the memory used by all arenas. Note that all the individual SV
722 heads and bodies within the arenas must already have been freed.
728 Perl_sv_free_arenas(pTHX)
734 /* Free arenas here, but be careful about fake ones. (We assume
735 contiguity of the fake ones with the corresponding real ones.) */
737 for (sva = PL_sv_arenaroot; sva; sva = svanext) {
738 svanext = MUTABLE_SV(SvANY(sva));
739 while (svanext && SvFAKE(svanext))
740 svanext = MUTABLE_SV(SvANY(svanext));
747 struct arena_set *aroot = (struct arena_set*) PL_body_arenas;
750 struct arena_set *current = aroot;
753 assert(aroot->set[i].arena);
754 Safefree(aroot->set[i].arena);
762 i = PERL_ARENA_ROOTS_SIZE;
764 PL_body_roots[i] = 0;
771 Here are mid-level routines that manage the allocation of bodies out
772 of the various arenas. There are 5 kinds of arenas:
774 1. SV-head arenas, which are discussed and handled above
775 2. regular body arenas
776 3. arenas for reduced-size bodies
779 Arena types 2 & 3 are chained by body-type off an array of
780 arena-root pointers, which is indexed by svtype. Some of the
781 larger/less used body types are malloced singly, since a large
782 unused block of them is wasteful. Also, several svtypes dont have
783 bodies; the data fits into the sv-head itself. The arena-root
784 pointer thus has a few unused root-pointers (which may be hijacked
785 later for arena types 4,5)
787 3 differs from 2 as an optimization; some body types have several
788 unused fields in the front of the structure (which are kept in-place
789 for consistency). These bodies can be allocated in smaller chunks,
790 because the leading fields arent accessed. Pointers to such bodies
791 are decremented to point at the unused 'ghost' memory, knowing that
792 the pointers are used with offsets to the real memory.
795 =head1 SV-Body Allocation
799 Allocation of SV-bodies is similar to SV-heads, differing as follows;
800 the allocation mechanism is used for many body types, so is somewhat
801 more complicated, it uses arena-sets, and has no need for still-live
804 At the outermost level, (new|del)_X*V macros return bodies of the
805 appropriate type. These macros call either (new|del)_body_type or
806 (new|del)_body_allocated macro pairs, depending on specifics of the
807 type. Most body types use the former pair, the latter pair is used to
808 allocate body types with "ghost fields".
810 "ghost fields" are fields that are unused in certain types, and
811 consequently don't need to actually exist. They are declared because
812 they're part of a "base type", which allows use of functions as
813 methods. The simplest examples are AVs and HVs, 2 aggregate types
814 which don't use the fields which support SCALAR semantics.
816 For these types, the arenas are carved up into appropriately sized
817 chunks, we thus avoid wasted memory for those unaccessed members.
818 When bodies are allocated, we adjust the pointer back in memory by the
819 size of the part not allocated, so it's as if we allocated the full
820 structure. (But things will all go boom if you write to the part that
821 is "not there", because you'll be overwriting the last members of the
822 preceding structure in memory.)
824 We calculate the correction using the STRUCT_OFFSET macro on the first
825 member present. If the allocated structure is smaller (no initial NV
826 actually allocated) then the net effect is to subtract the size of the NV
827 from the pointer, to return a new pointer as if an initial NV were actually
828 allocated. (We were using structures named *_allocated for this, but
829 this turned out to be a subtle bug, because a structure without an NV
830 could have a lower alignment constraint, but the compiler is allowed to
831 optimised accesses based on the alignment constraint of the actual pointer
832 to the full structure, for example, using a single 64 bit load instruction
833 because it "knows" that two adjacent 32 bit members will be 8-byte aligned.)
835 This is the same trick as was used for NV and IV bodies. Ironically it
836 doesn't need to be used for NV bodies any more, because NV is now at
837 the start of the structure. IV bodies, and also in some builds NV bodies,
838 don't need it either, because they are no longer allocated.
840 In turn, the new_body_* allocators call S_new_body(), which invokes
841 new_body_inline macro, which takes a lock, and takes a body off the
842 linked list at PL_body_roots[sv_type], calling Perl_more_bodies() if
843 necessary to refresh an empty list. Then the lock is released, and
844 the body is returned.
846 Perl_more_bodies allocates a new arena, and carves it up into an array of N
847 bodies, which it strings into a linked list. It looks up arena-size
848 and body-size from the body_details table described below, thus
849 supporting the multiple body-types.
851 If PURIFY is defined, or PERL_ARENA_SIZE=0, arenas are not used, and
852 the (new|del)_X*V macros are mapped directly to malloc/free.
854 For each sv-type, struct body_details bodies_by_type[] carries
855 parameters which control these aspects of SV handling:
857 Arena_size determines whether arenas are used for this body type, and if
858 so, how big they are. PURIFY or PERL_ARENA_SIZE=0 set this field to
859 zero, forcing individual mallocs and frees.
861 Body_size determines how big a body is, and therefore how many fit into
862 each arena. Offset carries the body-pointer adjustment needed for
863 "ghost fields", and is used in *_allocated macros.
865 But its main purpose is to parameterize info needed in
866 Perl_sv_upgrade(). The info here dramatically simplifies the function
867 vs the implementation in 5.8.8, making it table-driven. All fields
868 are used for this, except for arena_size.
870 For the sv-types that have no bodies, arenas are not used, so those
871 PL_body_roots[sv_type] are unused, and can be overloaded. In
872 something of a special case, SVt_NULL is borrowed for HE arenas;
873 PL_body_roots[HE_SVSLOT=SVt_NULL] is filled by S_more_he, but the
874 bodies_by_type[SVt_NULL] slot is not used, as the table is not
879 struct body_details {
880 U8 body_size; /* Size to allocate */
881 U8 copy; /* Size of structure to copy (may be shorter) */
882 U8 offset; /* Size of unalloced ghost fields to first alloced field*/
883 PERL_BITFIELD8 type : 4; /* We have space for a sanity check. */
884 PERL_BITFIELD8 cant_upgrade : 1;/* Cannot upgrade this type */
885 PERL_BITFIELD8 zero_nv : 1; /* zero the NV when upgrading from this */
886 PERL_BITFIELD8 arena : 1; /* Allocated from an arena */
887 U32 arena_size; /* Size of arena to allocate */
895 /* With -DPURFIY we allocate everything directly, and don't use arenas.
896 This seems a rather elegant way to simplify some of the code below. */
897 #define HASARENA FALSE
899 #define HASARENA TRUE
901 #define NOARENA FALSE
903 /* Size the arenas to exactly fit a given number of bodies. A count
904 of 0 fits the max number bodies into a PERL_ARENA_SIZE.block,
905 simplifying the default. If count > 0, the arena is sized to fit
906 only that many bodies, allowing arenas to be used for large, rare
907 bodies (XPVFM, XPVIO) without undue waste. The arena size is
908 limited by PERL_ARENA_SIZE, so we can safely oversize the
911 #define FIT_ARENA0(body_size) \
912 ((size_t)(PERL_ARENA_SIZE / body_size) * body_size)
913 #define FIT_ARENAn(count,body_size) \
914 ( count * body_size <= PERL_ARENA_SIZE) \
915 ? count * body_size \
916 : FIT_ARENA0 (body_size)
917 #define FIT_ARENA(count,body_size) \
919 ? FIT_ARENAn (count, body_size) \
920 : FIT_ARENA0 (body_size))
922 /* Calculate the length to copy. Specifically work out the length less any
923 final padding the compiler needed to add. See the comment in sv_upgrade
924 for why copying the padding proved to be a bug. */
926 #define copy_length(type, last_member) \
927 STRUCT_OFFSET(type, last_member) \
928 + sizeof (((type*)SvANY((const SV *)0))->last_member)
930 static const struct body_details bodies_by_type[] = {
931 /* HEs use this offset for their arena. */
932 { 0, 0, 0, SVt_NULL, FALSE, NONV, NOARENA, 0 },
934 /* IVs are in the head, so the allocation size is 0. */
936 sizeof(IV), /* This is used to copy out the IV body. */
937 STRUCT_OFFSET(XPVIV, xiv_iv), SVt_IV, FALSE, NONV,
938 NOARENA /* IVS don't need an arena */, 0
943 STRUCT_OFFSET(XPVNV, xnv_u),
944 SVt_NV, FALSE, HADNV, NOARENA, 0 },
946 { sizeof(NV), sizeof(NV),
947 STRUCT_OFFSET(XPVNV, xnv_u),
948 SVt_NV, FALSE, HADNV, HASARENA, FIT_ARENA(0, sizeof(NV)) },
951 { sizeof(XPV) - STRUCT_OFFSET(XPV, xpv_cur),
952 copy_length(XPV, xpv_len) - STRUCT_OFFSET(XPV, xpv_cur),
953 + STRUCT_OFFSET(XPV, xpv_cur),
954 SVt_PV, FALSE, NONV, HASARENA,
955 FIT_ARENA(0, sizeof(XPV) - STRUCT_OFFSET(XPV, xpv_cur)) },
957 { sizeof(XINVLIST) - STRUCT_OFFSET(XPV, xpv_cur),
958 copy_length(XINVLIST, is_offset) - STRUCT_OFFSET(XPV, xpv_cur),
959 + STRUCT_OFFSET(XPV, xpv_cur),
960 SVt_INVLIST, TRUE, NONV, HASARENA,
961 FIT_ARENA(0, sizeof(XINVLIST) - STRUCT_OFFSET(XPV, xpv_cur)) },
963 { sizeof(XPVIV) - STRUCT_OFFSET(XPV, xpv_cur),
964 copy_length(XPVIV, xiv_u) - STRUCT_OFFSET(XPV, xpv_cur),
965 + STRUCT_OFFSET(XPV, xpv_cur),
966 SVt_PVIV, FALSE, NONV, HASARENA,
967 FIT_ARENA(0, sizeof(XPVIV) - STRUCT_OFFSET(XPV, xpv_cur)) },
969 { sizeof(XPVNV) - STRUCT_OFFSET(XPV, xpv_cur),
970 copy_length(XPVNV, xnv_u) - STRUCT_OFFSET(XPV, xpv_cur),
971 + STRUCT_OFFSET(XPV, xpv_cur),
972 SVt_PVNV, FALSE, HADNV, HASARENA,
973 FIT_ARENA(0, sizeof(XPVNV) - STRUCT_OFFSET(XPV, xpv_cur)) },
975 { sizeof(XPVMG), copy_length(XPVMG, xnv_u), 0, SVt_PVMG, FALSE, HADNV,
976 HASARENA, FIT_ARENA(0, sizeof(XPVMG)) },
981 SVt_REGEXP, TRUE, NONV, HASARENA,
982 FIT_ARENA(0, sizeof(regexp))
985 { sizeof(XPVGV), sizeof(XPVGV), 0, SVt_PVGV, TRUE, HADNV,
986 HASARENA, FIT_ARENA(0, sizeof(XPVGV)) },
988 { sizeof(XPVLV), sizeof(XPVLV), 0, SVt_PVLV, TRUE, HADNV,
989 HASARENA, FIT_ARENA(0, sizeof(XPVLV)) },
992 copy_length(XPVAV, xav_alloc),
994 SVt_PVAV, TRUE, NONV, HASARENA,
995 FIT_ARENA(0, sizeof(XPVAV)) },
998 copy_length(XPVHV, xhv_max),
1000 SVt_PVHV, TRUE, NONV, HASARENA,
1001 FIT_ARENA(0, sizeof(XPVHV)) },
1006 SVt_PVCV, TRUE, NONV, HASARENA,
1007 FIT_ARENA(0, sizeof(XPVCV)) },
1012 SVt_PVFM, TRUE, NONV, NOARENA,
1013 FIT_ARENA(20, sizeof(XPVFM)) },
1018 SVt_PVIO, TRUE, NONV, HASARENA,
1019 FIT_ARENA(24, sizeof(XPVIO)) },
1022 #define new_body_allocated(sv_type) \
1023 (void *)((char *)S_new_body(aTHX_ sv_type) \
1024 - bodies_by_type[sv_type].offset)
1026 /* return a thing to the free list */
1028 #define del_body(thing, root) \
1030 void ** const thing_copy = (void **)thing; \
1031 *thing_copy = *root; \
1032 *root = (void*)thing_copy; \
1036 #if !(NVSIZE <= IVSIZE)
1037 # define new_XNV() safemalloc(sizeof(XPVNV))
1039 #define new_XPVNV() safemalloc(sizeof(XPVNV))
1040 #define new_XPVMG() safemalloc(sizeof(XPVMG))
1042 #define del_XPVGV(p) safefree(p)
1046 #if !(NVSIZE <= IVSIZE)
1047 # define new_XNV() new_body_allocated(SVt_NV)
1049 #define new_XPVNV() new_body_allocated(SVt_PVNV)
1050 #define new_XPVMG() new_body_allocated(SVt_PVMG)
1052 #define del_XPVGV(p) del_body(p + bodies_by_type[SVt_PVGV].offset, \
1053 &PL_body_roots[SVt_PVGV])
1057 /* no arena for you! */
1059 #define new_NOARENA(details) \
1060 safemalloc((details)->body_size + (details)->offset)
1061 #define new_NOARENAZ(details) \
1062 safecalloc((details)->body_size + (details)->offset, 1)
1065 Perl_more_bodies (pTHX_ const svtype sv_type, const size_t body_size,
1066 const size_t arena_size)
1068 void ** const root = &PL_body_roots[sv_type];
1069 struct arena_desc *adesc;
1070 struct arena_set *aroot = (struct arena_set *) PL_body_arenas;
1074 const size_t good_arena_size = Perl_malloc_good_size(arena_size);
1075 #if defined(DEBUGGING) && defined(PERL_GLOBAL_STRUCT)
1078 #if defined(DEBUGGING) && !defined(PERL_GLOBAL_STRUCT_PRIVATE)
1079 static bool done_sanity_check;
1081 /* PERL_GLOBAL_STRUCT_PRIVATE cannot coexist with global
1082 * variables like done_sanity_check. */
1083 if (!done_sanity_check) {
1084 unsigned int i = SVt_LAST;
1086 done_sanity_check = TRUE;
1089 assert (bodies_by_type[i].type == i);
1095 /* may need new arena-set to hold new arena */
1096 if (!aroot || aroot->curr >= aroot->set_size) {
1097 struct arena_set *newroot;
1098 Newxz(newroot, 1, struct arena_set);
1099 newroot->set_size = ARENAS_PER_SET;
1100 newroot->next = aroot;
1102 PL_body_arenas = (void *) newroot;
1103 DEBUG_m(PerlIO_printf(Perl_debug_log, "new arenaset %p\n", (void*)aroot));
1106 /* ok, now have arena-set with at least 1 empty/available arena-desc */
1107 curr = aroot->curr++;
1108 adesc = &(aroot->set[curr]);
1109 assert(!adesc->arena);
1111 Newx(adesc->arena, good_arena_size, char);
1112 adesc->size = good_arena_size;
1113 adesc->utype = sv_type;
1114 DEBUG_m(PerlIO_printf(Perl_debug_log, "arena %d added: %p size %" UVuf "\n",
1115 curr, (void*)adesc->arena, (UV)good_arena_size));
1117 start = (char *) adesc->arena;
1119 /* Get the address of the byte after the end of the last body we can fit.
1120 Remember, this is integer division: */
1121 end = start + good_arena_size / body_size * body_size;
1123 /* computed count doesn't reflect the 1st slot reservation */
1124 #if defined(MYMALLOC) || defined(HAS_MALLOC_GOOD_SIZE)
1125 DEBUG_m(PerlIO_printf(Perl_debug_log,
1126 "arena %p end %p arena-size %d (from %d) type %d "
1128 (void*)start, (void*)end, (int)good_arena_size,
1129 (int)arena_size, sv_type, (int)body_size,
1130 (int)good_arena_size / (int)body_size));
1132 DEBUG_m(PerlIO_printf(Perl_debug_log,
1133 "arena %p end %p arena-size %d type %d size %d ct %d\n",
1134 (void*)start, (void*)end,
1135 (int)arena_size, sv_type, (int)body_size,
1136 (int)good_arena_size / (int)body_size));
1138 *root = (void *)start;
1141 /* Where the next body would start: */
1142 char * const next = start + body_size;
1145 /* This is the last body: */
1146 assert(next == end);
1148 *(void **)start = 0;
1152 *(void**) start = (void *)next;
1157 /* grab a new thing from the free list, allocating more if necessary.
1158 The inline version is used for speed in hot routines, and the
1159 function using it serves the rest (unless PURIFY).
1161 #define new_body_inline(xpv, sv_type) \
1163 void ** const r3wt = &PL_body_roots[sv_type]; \
1164 xpv = (PTR_TBL_ENT_t*) (*((void **)(r3wt)) \
1165 ? *((void **)(r3wt)) : Perl_more_bodies(aTHX_ sv_type, \
1166 bodies_by_type[sv_type].body_size,\
1167 bodies_by_type[sv_type].arena_size)); \
1168 *(r3wt) = *(void**)(xpv); \
1174 S_new_body(pTHX_ const svtype sv_type)
1177 new_body_inline(xpv, sv_type);
1183 static const struct body_details fake_rv =
1184 { 0, 0, 0, SVt_IV, FALSE, NONV, NOARENA, 0 };
1187 =for apidoc sv_upgrade
1189 Upgrade an SV to a more complex form. Generally adds a new body type to the
1190 SV, then copies across as much information as possible from the old body.
1191 It croaks if the SV is already in a more complex form than requested. You
1192 generally want to use the C<SvUPGRADE> macro wrapper, which checks the type
1193 before calling C<sv_upgrade>, and hence does not croak. See also
1200 Perl_sv_upgrade(pTHX_ SV *const sv, svtype new_type)
1204 const svtype old_type = SvTYPE(sv);
1205 const struct body_details *new_type_details;
1206 const struct body_details *old_type_details
1207 = bodies_by_type + old_type;
1208 SV *referent = NULL;
1210 PERL_ARGS_ASSERT_SV_UPGRADE;
1212 if (old_type == new_type)
1215 /* This clause was purposefully added ahead of the early return above to
1216 the shared string hackery for (sort {$a <=> $b} keys %hash), with the
1217 inference by Nick I-S that it would fix other troublesome cases. See
1218 changes 7162, 7163 (f130fd4589cf5fbb24149cd4db4137c8326f49c1 and parent)
1220 Given that shared hash key scalars are no longer PVIV, but PV, there is
1221 no longer need to unshare so as to free up the IVX slot for its proper
1222 purpose. So it's safe to move the early return earlier. */
1224 if (new_type > SVt_PVMG && SvIsCOW(sv)) {
1225 sv_force_normal_flags(sv, 0);
1228 old_body = SvANY(sv);
1230 /* Copying structures onto other structures that have been neatly zeroed
1231 has a subtle gotcha. Consider XPVMG
1233 +------+------+------+------+------+-------+-------+
1234 | NV | CUR | LEN | IV | MAGIC | STASH |
1235 +------+------+------+------+------+-------+-------+
1236 0 4 8 12 16 20 24 28
1238 where NVs are aligned to 8 bytes, so that sizeof that structure is
1239 actually 32 bytes long, with 4 bytes of padding at the end:
1241 +------+------+------+------+------+-------+-------+------+
1242 | NV | CUR | LEN | IV | MAGIC | STASH | ??? |
1243 +------+------+------+------+------+-------+-------+------+
1244 0 4 8 12 16 20 24 28 32
1246 so what happens if you allocate memory for this structure:
1248 +------+------+------+------+------+-------+-------+------+------+...
1249 | NV | CUR | LEN | IV | MAGIC | STASH | GP | NAME |
1250 +------+------+------+------+------+-------+-------+------+------+...
1251 0 4 8 12 16 20 24 28 32 36
1253 zero it, then copy sizeof(XPVMG) bytes on top of it? Not quite what you
1254 expect, because you copy the area marked ??? onto GP. Now, ??? may have
1255 started out as zero once, but it's quite possible that it isn't. So now,
1256 rather than a nicely zeroed GP, you have it pointing somewhere random.
1259 (In fact, GP ends up pointing at a previous GP structure, because the
1260 principle cause of the padding in XPVMG getting garbage is a copy of
1261 sizeof(XPVMG) bytes from a XPVGV structure in sv_unglob. Right now
1262 this happens to be moot because XPVGV has been re-ordered, with GP
1263 no longer after STASH)
1265 So we are careful and work out the size of used parts of all the
1273 referent = SvRV(sv);
1274 old_type_details = &fake_rv;
1275 if (new_type == SVt_NV)
1276 new_type = SVt_PVNV;
1278 if (new_type < SVt_PVIV) {
1279 new_type = (new_type == SVt_NV)
1280 ? SVt_PVNV : SVt_PVIV;
1285 if (new_type < SVt_PVNV) {
1286 new_type = SVt_PVNV;
1290 assert(new_type > SVt_PV);
1291 STATIC_ASSERT_STMT(SVt_IV < SVt_PV);
1292 STATIC_ASSERT_STMT(SVt_NV < SVt_PV);
1299 /* Because the XPVMG of PL_mess_sv isn't allocated from the arena,
1300 there's no way that it can be safely upgraded, because perl.c
1301 expects to Safefree(SvANY(PL_mess_sv)) */
1302 assert(sv != PL_mess_sv);
1305 if (UNLIKELY(old_type_details->cant_upgrade))
1306 Perl_croak(aTHX_ "Can't upgrade %s (%" UVuf ") to %" UVuf,
1307 sv_reftype(sv, 0), (UV) old_type, (UV) new_type);
1310 if (UNLIKELY(old_type > new_type))
1311 Perl_croak(aTHX_ "sv_upgrade from type %d down to type %d",
1312 (int)old_type, (int)new_type);
1314 new_type_details = bodies_by_type + new_type;
1316 SvFLAGS(sv) &= ~SVTYPEMASK;
1317 SvFLAGS(sv) |= new_type;
1319 /* This can't happen, as SVt_NULL is <= all values of new_type, so one of
1320 the return statements above will have triggered. */
1321 assert (new_type != SVt_NULL);
1324 assert(old_type == SVt_NULL);
1325 SET_SVANY_FOR_BODYLESS_IV(sv);
1329 assert(old_type == SVt_NULL);
1330 #if NVSIZE <= IVSIZE
1331 SET_SVANY_FOR_BODYLESS_NV(sv);
1333 SvANY(sv) = new_XNV();
1339 assert(new_type_details->body_size);
1342 assert(new_type_details->arena);
1343 assert(new_type_details->arena_size);
1344 /* This points to the start of the allocated area. */
1345 new_body_inline(new_body, new_type);
1346 Zero(new_body, new_type_details->body_size, char);
1347 new_body = ((char *)new_body) - new_type_details->offset;
1349 /* We always allocated the full length item with PURIFY. To do this
1350 we fake things so that arena is false for all 16 types.. */
1351 new_body = new_NOARENAZ(new_type_details);
1353 SvANY(sv) = new_body;
1354 if (new_type == SVt_PVAV) {
1358 if (old_type_details->body_size) {
1361 /* It will have been zeroed when the new body was allocated.
1362 Lets not write to it, in case it confuses a write-back
1368 #ifndef NODEFAULT_SHAREKEYS
1369 HvSHAREKEYS_on(sv); /* key-sharing on by default */
1371 /* start with PERL_HASH_DEFAULT_HvMAX+1 buckets: */
1372 HvMAX(sv) = PERL_HASH_DEFAULT_HvMAX;
1375 /* SVt_NULL isn't the only thing upgraded to AV or HV.
1376 The target created by newSVrv also is, and it can have magic.
1377 However, it never has SvPVX set.
1379 if (old_type == SVt_IV) {
1381 } else if (old_type >= SVt_PV) {
1382 assert(SvPVX_const(sv) == 0);
1385 if (old_type >= SVt_PVMG) {
1386 SvMAGIC_set(sv, ((XPVMG*)old_body)->xmg_u.xmg_magic);
1387 SvSTASH_set(sv, ((XPVMG*)old_body)->xmg_stash);
1389 sv->sv_u.svu_array = NULL; /* or svu_hash */
1394 /* XXX Is this still needed? Was it ever needed? Surely as there is
1395 no route from NV to PVIV, NOK can never be true */
1396 assert(!SvNOKp(sv));
1410 assert(new_type_details->body_size);
1411 /* We always allocated the full length item with PURIFY. To do this
1412 we fake things so that arena is false for all 16 types.. */
1413 if(new_type_details->arena) {
1414 /* This points to the start of the allocated area. */
1415 new_body_inline(new_body, new_type);
1416 Zero(new_body, new_type_details->body_size, char);
1417 new_body = ((char *)new_body) - new_type_details->offset;
1419 new_body = new_NOARENAZ(new_type_details);
1421 SvANY(sv) = new_body;
1423 if (old_type_details->copy) {
1424 /* There is now the potential for an upgrade from something without
1425 an offset (PVNV or PVMG) to something with one (PVCV, PVFM) */
1426 int offset = old_type_details->offset;
1427 int length = old_type_details->copy;
1429 if (new_type_details->offset > old_type_details->offset) {
1430 const int difference
1431 = new_type_details->offset - old_type_details->offset;
1432 offset += difference;
1433 length -= difference;
1435 assert (length >= 0);
1437 Copy((char *)old_body + offset, (char *)new_body + offset, length,
1441 #ifndef NV_ZERO_IS_ALLBITS_ZERO
1442 /* If NV 0.0 is stores as all bits 0 then Zero() already creates a
1443 * correct 0.0 for us. Otherwise, if the old body didn't have an
1444 * NV slot, but the new one does, then we need to initialise the
1445 * freshly created NV slot with whatever the correct bit pattern is
1447 if (old_type_details->zero_nv && !new_type_details->zero_nv
1448 && !isGV_with_GP(sv))
1452 if (UNLIKELY(new_type == SVt_PVIO)) {
1453 IO * const io = MUTABLE_IO(sv);
1454 GV *iogv = gv_fetchpvs("IO::File::", GV_ADD, SVt_PVHV);
1457 /* Clear the stashcache because a new IO could overrule a package
1459 DEBUG_o(Perl_deb(aTHX_ "sv_upgrade clearing PL_stashcache\n"));
1460 hv_clear(PL_stashcache);
1462 SvSTASH_set(io, MUTABLE_HV(SvREFCNT_inc(GvHV(iogv))));
1463 IoPAGE_LEN(sv) = 60;
1465 if (UNLIKELY(new_type == SVt_REGEXP))
1466 sv->sv_u.svu_rx = (regexp *)new_body;
1467 else if (old_type < SVt_PV) {
1468 /* referent will be NULL unless the old type was SVt_IV emulating
1470 sv->sv_u.svu_rv = referent;
1474 Perl_croak(aTHX_ "panic: sv_upgrade to unknown type %lu",
1475 (unsigned long)new_type);
1478 /* if this is zero, this is a body-less SVt_NULL, SVt_IV/SVt_RV,
1479 and sometimes SVt_NV */
1480 if (old_type_details->body_size) {
1484 /* Note that there is an assumption that all bodies of types that
1485 can be upgraded came from arenas. Only the more complex non-
1486 upgradable types are allowed to be directly malloc()ed. */
1487 assert(old_type_details->arena);
1488 del_body((void*)((char*)old_body + old_type_details->offset),
1489 &PL_body_roots[old_type]);
1495 =for apidoc sv_backoff
1497 Remove any string offset. You should normally use the C<SvOOK_off> macro
1503 /* prior to 5.000 stable, this function returned the new OOK-less SvFLAGS
1504 prior to 5.23.4 this function always returned 0
1508 Perl_sv_backoff(SV *const sv)
1511 const char * const s = SvPVX_const(sv);
1513 PERL_ARGS_ASSERT_SV_BACKOFF;
1516 assert(SvTYPE(sv) != SVt_PVHV);
1517 assert(SvTYPE(sv) != SVt_PVAV);
1519 SvOOK_offset(sv, delta);
1521 SvLEN_set(sv, SvLEN(sv) + delta);
1522 SvPV_set(sv, SvPVX(sv) - delta);
1523 SvFLAGS(sv) &= ~SVf_OOK;
1524 Move(s, SvPVX(sv), SvCUR(sv)+1, char);
1529 /* forward declaration */
1530 static void S_sv_uncow(pTHX_ SV * const sv, const U32 flags);
1536 Expands the character buffer in the SV. If necessary, uses C<sv_unref> and
1537 upgrades the SV to C<SVt_PV>. Returns a pointer to the character buffer.
1538 Use the C<SvGROW> wrapper instead.
1545 Perl_sv_grow(pTHX_ SV *const sv, STRLEN newlen)
1549 PERL_ARGS_ASSERT_SV_GROW;
1553 if (SvTYPE(sv) < SVt_PV) {
1554 sv_upgrade(sv, SVt_PV);
1555 s = SvPVX_mutable(sv);
1557 else if (SvOOK(sv)) { /* pv is offset? */
1559 s = SvPVX_mutable(sv);
1560 if (newlen > SvLEN(sv))
1561 newlen += 10 * (newlen - SvCUR(sv)); /* avoid copy each time */
1565 if (SvIsCOW(sv)) S_sv_uncow(aTHX_ sv, 0);
1566 s = SvPVX_mutable(sv);
1569 #ifdef PERL_COPY_ON_WRITE
1570 /* the new COW scheme uses SvPVX(sv)[SvLEN(sv)-1] (if spare)
1571 * to store the COW count. So in general, allocate one more byte than
1572 * asked for, to make it likely this byte is always spare: and thus
1573 * make more strings COW-able.
1575 * Only increment if the allocation isn't MEM_SIZE_MAX,
1576 * otherwise it will wrap to 0.
1578 if ( newlen != MEM_SIZE_MAX )
1582 #if defined(PERL_USE_MALLOC_SIZE) && defined(Perl_safesysmalloc_size)
1583 #define PERL_UNWARANTED_CHUMMINESS_WITH_MALLOC
1586 if (newlen > SvLEN(sv)) { /* need more room? */
1587 STRLEN minlen = SvCUR(sv);
1588 minlen += (minlen >> PERL_STRLEN_EXPAND_SHIFT) + 10;
1589 if (newlen < minlen)
1591 #ifndef PERL_UNWARANTED_CHUMMINESS_WITH_MALLOC
1593 /* Don't round up on the first allocation, as odds are pretty good that
1594 * the initial request is accurate as to what is really needed */
1596 STRLEN rounded = PERL_STRLEN_ROUNDUP(newlen);
1597 if (rounded > newlen)
1601 if (SvLEN(sv) && s) {
1602 s = (char*)saferealloc(s, newlen);
1605 s = (char*)safemalloc(newlen);
1606 if (SvPVX_const(sv) && SvCUR(sv)) {
1607 Move(SvPVX_const(sv), s, SvCUR(sv), char);
1611 #ifdef PERL_UNWARANTED_CHUMMINESS_WITH_MALLOC
1612 /* Do this here, do it once, do it right, and then we will never get
1613 called back into sv_grow() unless there really is some growing
1615 SvLEN_set(sv, Perl_safesysmalloc_size(s));
1617 SvLEN_set(sv, newlen);
1624 =for apidoc sv_setiv
1626 Copies an integer into the given SV, upgrading first if necessary.
1627 Does not handle 'set' magic. See also C<L</sv_setiv_mg>>.
1633 Perl_sv_setiv(pTHX_ SV *const sv, const IV i)
1635 PERL_ARGS_ASSERT_SV_SETIV;
1637 SV_CHECK_THINKFIRST_COW_DROP(sv);
1638 switch (SvTYPE(sv)) {
1641 sv_upgrade(sv, SVt_IV);
1644 sv_upgrade(sv, SVt_PVIV);
1648 if (!isGV_with_GP(sv))
1655 /* diag_listed_as: Can't coerce %s to %s in %s */
1656 Perl_croak(aTHX_ "Can't coerce %s to integer in %s", sv_reftype(sv,0),
1658 NOT_REACHED; /* NOTREACHED */
1662 (void)SvIOK_only(sv); /* validate number */
1668 =for apidoc sv_setiv_mg
1670 Like C<sv_setiv>, but also handles 'set' magic.
1676 Perl_sv_setiv_mg(pTHX_ SV *const sv, const IV i)
1678 PERL_ARGS_ASSERT_SV_SETIV_MG;
1685 =for apidoc sv_setuv
1687 Copies an unsigned integer into the given SV, upgrading first if necessary.
1688 Does not handle 'set' magic. See also C<L</sv_setuv_mg>>.
1694 Perl_sv_setuv(pTHX_ SV *const sv, const UV u)
1696 PERL_ARGS_ASSERT_SV_SETUV;
1698 /* With the if statement to ensure that integers are stored as IVs whenever
1700 u=1.49 s=0.52 cu=72.49 cs=10.64 scripts=270 tests=20865
1703 u=1.35 s=0.47 cu=73.45 cs=11.43 scripts=270 tests=20865
1705 If you wish to remove the following if statement, so that this routine
1706 (and its callers) always return UVs, please benchmark to see what the
1707 effect is. Modern CPUs may be different. Or may not :-)
1709 if (u <= (UV)IV_MAX) {
1710 sv_setiv(sv, (IV)u);
1719 =for apidoc sv_setuv_mg
1721 Like C<sv_setuv>, but also handles 'set' magic.
1727 Perl_sv_setuv_mg(pTHX_ SV *const sv, const UV u)
1729 PERL_ARGS_ASSERT_SV_SETUV_MG;
1736 =for apidoc sv_setnv
1738 Copies a double into the given SV, upgrading first if necessary.
1739 Does not handle 'set' magic. See also C<L</sv_setnv_mg>>.
1745 Perl_sv_setnv(pTHX_ SV *const sv, const NV num)
1747 PERL_ARGS_ASSERT_SV_SETNV;
1749 SV_CHECK_THINKFIRST_COW_DROP(sv);
1750 switch (SvTYPE(sv)) {
1753 sv_upgrade(sv, SVt_NV);
1757 sv_upgrade(sv, SVt_PVNV);
1761 if (!isGV_with_GP(sv))
1768 /* diag_listed_as: Can't coerce %s to %s in %s */
1769 Perl_croak(aTHX_ "Can't coerce %s to number in %s", sv_reftype(sv,0),
1771 NOT_REACHED; /* NOTREACHED */
1776 (void)SvNOK_only(sv); /* validate number */
1781 =for apidoc sv_setnv_mg
1783 Like C<sv_setnv>, but also handles 'set' magic.
1789 Perl_sv_setnv_mg(pTHX_ SV *const sv, const NV num)
1791 PERL_ARGS_ASSERT_SV_SETNV_MG;
1797 /* Return a cleaned-up, printable version of sv, for non-numeric, or
1798 * not incrementable warning display.
1799 * Originally part of S_not_a_number().
1800 * The return value may be != tmpbuf.
1804 S_sv_display(pTHX_ SV *const sv, char *tmpbuf, STRLEN tmpbuf_size) {
1807 PERL_ARGS_ASSERT_SV_DISPLAY;
1810 SV *dsv = newSVpvs_flags("", SVs_TEMP);
1811 pv = sv_uni_display(dsv, sv, 32, UNI_DISPLAY_ISPRINT);
1814 const char * const limit = tmpbuf + tmpbuf_size - 8;
1815 /* each *s can expand to 4 chars + "...\0",
1816 i.e. need room for 8 chars */
1818 const char *s = SvPVX_const(sv);
1819 const char * const end = s + SvCUR(sv);
1820 for ( ; s < end && d < limit; s++ ) {
1822 if (! isASCII(ch) && !isPRINT_LC(ch)) {
1826 /* Map to ASCII "equivalent" of Latin1 */
1827 ch = LATIN1_TO_NATIVE(NATIVE_TO_LATIN1(ch) & 127);
1833 else if (ch == '\r') {
1837 else if (ch == '\f') {
1841 else if (ch == '\\') {
1845 else if (ch == '\0') {
1849 else if (isPRINT_LC(ch))
1868 /* Print an "isn't numeric" warning, using a cleaned-up,
1869 * printable version of the offending string
1873 S_not_a_number(pTHX_ SV *const sv)
1878 PERL_ARGS_ASSERT_NOT_A_NUMBER;
1880 pv = sv_display(sv, tmpbuf, sizeof(tmpbuf));
1883 Perl_warner(aTHX_ packWARN(WARN_NUMERIC),
1884 /* diag_listed_as: Argument "%s" isn't numeric%s */
1885 "Argument \"%s\" isn't numeric in %s", pv,
1888 Perl_warner(aTHX_ packWARN(WARN_NUMERIC),
1889 /* diag_listed_as: Argument "%s" isn't numeric%s */
1890 "Argument \"%s\" isn't numeric", pv);
1894 S_not_incrementable(pTHX_ SV *const sv) {
1898 PERL_ARGS_ASSERT_NOT_INCREMENTABLE;
1900 pv = sv_display(sv, tmpbuf, sizeof(tmpbuf));
1902 Perl_warner(aTHX_ packWARN(WARN_NUMERIC),
1903 "Argument \"%s\" treated as 0 in increment (++)", pv);
1907 =for apidoc looks_like_number
1909 Test if the content of an SV looks like a number (or is a number).
1910 C<Inf> and C<Infinity> are treated as numbers (so will not issue a
1911 non-numeric warning), even if your C<atof()> doesn't grok them. Get-magic is
1918 Perl_looks_like_number(pTHX_ SV *const sv)
1924 PERL_ARGS_ASSERT_LOOKS_LIKE_NUMBER;
1926 if (SvPOK(sv) || SvPOKp(sv)) {
1927 sbegin = SvPV_nomg_const(sv, len);
1930 return SvFLAGS(sv) & (SVf_NOK|SVp_NOK|SVf_IOK|SVp_IOK);
1931 numtype = grok_number(sbegin, len, NULL);
1932 return ((numtype & IS_NUMBER_TRAILING)) ? 0 : numtype;
1936 S_glob_2number(pTHX_ GV * const gv)
1938 PERL_ARGS_ASSERT_GLOB_2NUMBER;
1940 /* We know that all GVs stringify to something that is not-a-number,
1941 so no need to test that. */
1942 if (ckWARN(WARN_NUMERIC))
1944 SV *const buffer = sv_newmortal();
1945 gv_efullname3(buffer, gv, "*");
1946 not_a_number(buffer);
1948 /* We just want something true to return, so that S_sv_2iuv_common
1949 can tail call us and return true. */
1953 /* Actually, ISO C leaves conversion of UV to IV undefined, but
1954 until proven guilty, assume that things are not that bad... */
1959 As 64 bit platforms often have an NV that doesn't preserve all bits of
1960 an IV (an assumption perl has been based on to date) it becomes necessary
1961 to remove the assumption that the NV always carries enough precision to
1962 recreate the IV whenever needed, and that the NV is the canonical form.
1963 Instead, IV/UV and NV need to be given equal rights. So as to not lose
1964 precision as a side effect of conversion (which would lead to insanity
1965 and the dragon(s) in t/op/numconvert.t getting very angry) the intent is
1966 1) to distinguish between IV/UV/NV slots that have a valid conversion cached
1967 where precision was lost, and IV/UV/NV slots that have a valid conversion
1968 which has lost no precision
1969 2) to ensure that if a numeric conversion to one form is requested that
1970 would lose precision, the precise conversion (or differently
1971 imprecise conversion) is also performed and cached, to prevent
1972 requests for different numeric formats on the same SV causing
1973 lossy conversion chains. (lossless conversion chains are perfectly
1978 SvIOKp is true if the IV slot contains a valid value
1979 SvIOK is true only if the IV value is accurate (UV if SvIOK_UV true)
1980 SvNOKp is true if the NV slot contains a valid value
1981 SvNOK is true only if the NV value is accurate
1984 while converting from PV to NV, check to see if converting that NV to an
1985 IV(or UV) would lose accuracy over a direct conversion from PV to
1986 IV(or UV). If it would, cache both conversions, return NV, but mark
1987 SV as IOK NOKp (ie not NOK).
1989 While converting from PV to IV, check to see if converting that IV to an
1990 NV would lose accuracy over a direct conversion from PV to NV. If it
1991 would, cache both conversions, flag similarly.
1993 Before, the SV value "3.2" could become NV=3.2 IV=3 NOK, IOK quite
1994 correctly because if IV & NV were set NV *always* overruled.
1995 Now, "3.2" will become NV=3.2 IV=3 NOK, IOKp, because the flag's meaning
1996 changes - now IV and NV together means that the two are interchangeable:
1997 SvIVX == (IV) SvNVX && SvNVX == (NV) SvIVX;
1999 The benefit of this is that operations such as pp_add know that if
2000 SvIOK is true for both left and right operands, then integer addition
2001 can be used instead of floating point (for cases where the result won't
2002 overflow). Before, floating point was always used, which could lead to
2003 loss of precision compared with integer addition.
2005 * making IV and NV equal status should make maths accurate on 64 bit
2007 * may speed up maths somewhat if pp_add and friends start to use
2008 integers when possible instead of fp. (Hopefully the overhead in
2009 looking for SvIOK and checking for overflow will not outweigh the
2010 fp to integer speedup)
2011 * will slow down integer operations (callers of SvIV) on "inaccurate"
2012 values, as the change from SvIOK to SvIOKp will cause a call into
2013 sv_2iv each time rather than a macro access direct to the IV slot
2014 * should speed up number->string conversion on integers as IV is
2015 favoured when IV and NV are equally accurate
2017 ####################################################################
2018 You had better be using SvIOK_notUV if you want an IV for arithmetic:
2019 SvIOK is true if (IV or UV), so you might be getting (IV)SvUV.
2020 On the other hand, SvUOK is true iff UV.
2021 ####################################################################
2023 Your mileage will vary depending your CPU's relative fp to integer
2027 #ifndef NV_PRESERVES_UV
2028 # define IS_NUMBER_UNDERFLOW_IV 1
2029 # define IS_NUMBER_UNDERFLOW_UV 2
2030 # define IS_NUMBER_IV_AND_UV 2
2031 # define IS_NUMBER_OVERFLOW_IV 4
2032 # define IS_NUMBER_OVERFLOW_UV 5
2034 /* sv_2iuv_non_preserve(): private routine for use by sv_2iv() and sv_2uv() */
2036 /* For sv_2nv these three cases are "SvNOK and don't bother casting" */
2038 S_sv_2iuv_non_preserve(pTHX_ SV *const sv
2044 PERL_ARGS_ASSERT_SV_2IUV_NON_PRESERVE;
2045 PERL_UNUSED_CONTEXT;
2047 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));
2048 if (SvNVX(sv) < (NV)IV_MIN) {
2049 (void)SvIOKp_on(sv);
2051 SvIV_set(sv, IV_MIN);
2052 return IS_NUMBER_UNDERFLOW_IV;
2054 if (SvNVX(sv) > (NV)UV_MAX) {
2055 (void)SvIOKp_on(sv);
2058 SvUV_set(sv, UV_MAX);
2059 return IS_NUMBER_OVERFLOW_UV;
2061 (void)SvIOKp_on(sv);
2063 /* Can't use strtol etc to convert this string. (See truth table in
2065 if (SvNVX(sv) <= (UV)IV_MAX) {
2066 SvIV_set(sv, I_V(SvNVX(sv)));
2067 if ((NV)(SvIVX(sv)) == SvNVX(sv)) {
2068 SvIOK_on(sv); /* Integer is precise. NOK, IOK */
2070 /* Integer is imprecise. NOK, IOKp */
2072 return SvNVX(sv) < 0 ? IS_NUMBER_UNDERFLOW_UV : IS_NUMBER_IV_AND_UV;
2075 SvUV_set(sv, U_V(SvNVX(sv)));
2076 if ((NV)(SvUVX(sv)) == SvNVX(sv)) {
2077 if (SvUVX(sv) == UV_MAX) {
2078 /* As we know that NVs don't preserve UVs, UV_MAX cannot
2079 possibly be preserved by NV. Hence, it must be overflow.
2081 return IS_NUMBER_OVERFLOW_UV;
2083 SvIOK_on(sv); /* Integer is precise. NOK, UOK */
2085 /* Integer is imprecise. NOK, IOKp */
2087 return IS_NUMBER_OVERFLOW_IV;
2089 #endif /* !NV_PRESERVES_UV*/
2091 /* If numtype is infnan, set the NV of the sv accordingly.
2092 * If numtype is anything else, try setting the NV using Atof(PV). */
2094 # pragma warning(push)
2095 # pragma warning(disable:4756;disable:4056)
2098 S_sv_setnv(pTHX_ SV* sv, int numtype)
2100 bool pok = cBOOL(SvPOK(sv));
2103 if ((numtype & IS_NUMBER_INFINITY)) {
2104 SvNV_set(sv, (numtype & IS_NUMBER_NEG) ? -NV_INF : NV_INF);
2109 if ((numtype & IS_NUMBER_NAN)) {
2110 SvNV_set(sv, NV_NAN);
2115 SvNV_set(sv, Atof(SvPVX_const(sv)));
2116 /* Purposefully no true nok here, since we don't want to blow
2117 * away the possible IOK/UV of an existing sv. */
2120 SvNOK_only(sv); /* No IV or UV please, this is pure infnan. */
2122 SvPOK_on(sv); /* PV is okay, though. */
2126 # pragma warning(pop)
2130 S_sv_2iuv_common(pTHX_ SV *const sv)
2132 PERL_ARGS_ASSERT_SV_2IUV_COMMON;
2135 /* erm. not sure. *should* never get NOKp (without NOK) from sv_2nv
2136 * without also getting a cached IV/UV from it at the same time
2137 * (ie PV->NV conversion should detect loss of accuracy and cache
2138 * IV or UV at same time to avoid this. */
2139 /* IV-over-UV optimisation - choose to cache IV if possible */
2141 if (SvTYPE(sv) == SVt_NV)
2142 sv_upgrade(sv, SVt_PVNV);
2144 (void)SvIOKp_on(sv); /* Must do this first, to clear any SvOOK */
2145 /* < not <= as for NV doesn't preserve UV, ((NV)IV_MAX+1) will almost
2146 certainly cast into the IV range at IV_MAX, whereas the correct
2147 answer is the UV IV_MAX +1. Hence < ensures that dodgy boundary
2149 #if defined(NAN_COMPARE_BROKEN) && defined(Perl_isnan)
2150 if (Perl_isnan(SvNVX(sv))) {
2156 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2157 SvIV_set(sv, I_V(SvNVX(sv)));
2158 if (SvNVX(sv) == (NV) SvIVX(sv)
2159 #ifndef NV_PRESERVES_UV
2160 && SvIVX(sv) != IV_MIN /* avoid negating IV_MIN below */
2161 && (((UV)1 << NV_PRESERVES_UV_BITS) >
2162 (UV)(SvIVX(sv) > 0 ? SvIVX(sv) : -SvIVX(sv)))
2163 /* Don't flag it as "accurately an integer" if the number
2164 came from a (by definition imprecise) NV operation, and
2165 we're outside the range of NV integer precision */
2169 SvIOK_on(sv); /* Can this go wrong with rounding? NWC */
2171 /* scalar has trailing garbage, eg "42a" */
2173 DEBUG_c(PerlIO_printf(Perl_debug_log,
2174 "0x%" UVxf " iv(%" NVgf " => %" IVdf ") (precise)\n",
2180 /* IV not precise. No need to convert from PV, as NV
2181 conversion would already have cached IV if it detected
2182 that PV->IV would be better than PV->NV->IV
2183 flags already correct - don't set public IOK. */
2184 DEBUG_c(PerlIO_printf(Perl_debug_log,
2185 "0x%" UVxf " iv(%" NVgf " => %" IVdf ") (imprecise)\n",
2190 /* Can the above go wrong if SvIVX == IV_MIN and SvNVX < IV_MIN,
2191 but the cast (NV)IV_MIN rounds to a the value less (more
2192 negative) than IV_MIN which happens to be equal to SvNVX ??
2193 Analogous to 0xFFFFFFFFFFFFFFFF rounding up to NV (2**64) and
2194 NV rounding back to 0xFFFFFFFFFFFFFFFF, so UVX == UV(NVX) and
2195 (NV)UVX == NVX are both true, but the values differ. :-(
2196 Hopefully for 2s complement IV_MIN is something like
2197 0x8000000000000000 which will be exact. NWC */
2200 SvUV_set(sv, U_V(SvNVX(sv)));
2202 (SvNVX(sv) == (NV) SvUVX(sv))
2203 #ifndef NV_PRESERVES_UV
2204 /* Make sure it's not 0xFFFFFFFFFFFFFFFF */
2205 /*&& (SvUVX(sv) != UV_MAX) irrelevant with code below */
2206 && (((UV)1 << NV_PRESERVES_UV_BITS) > SvUVX(sv))
2207 /* Don't flag it as "accurately an integer" if the number
2208 came from a (by definition imprecise) NV operation, and
2209 we're outside the range of NV integer precision */
2215 DEBUG_c(PerlIO_printf(Perl_debug_log,
2216 "0x%" UVxf " 2iv(%" UVuf " => %" IVdf ") (as unsigned)\n",
2222 else if (SvPOKp(sv)) {
2225 const char *s = SvPVX_const(sv);
2226 const STRLEN cur = SvCUR(sv);
2228 /* short-cut for a single digit string like "1" */
2233 if (SvTYPE(sv) < SVt_PVIV)
2234 sv_upgrade(sv, SVt_PVIV);
2236 SvIV_set(sv, (IV)(c - '0'));
2241 numtype = grok_number(s, cur, &value);
2242 /* We want to avoid a possible problem when we cache an IV/ a UV which
2243 may be later translated to an NV, and the resulting NV is not
2244 the same as the direct translation of the initial string
2245 (eg 123.456 can shortcut to the IV 123 with atol(), but we must
2246 be careful to ensure that the value with the .456 is around if the
2247 NV value is requested in the future).
2249 This means that if we cache such an IV/a UV, we need to cache the
2250 NV as well. Moreover, we trade speed for space, and do not
2251 cache the NV if we are sure it's not needed.
2254 /* SVt_PVNV is one higher than SVt_PVIV, hence this order */
2255 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2256 == IS_NUMBER_IN_UV) {
2257 /* It's definitely an integer, only upgrade to PVIV */
2258 if (SvTYPE(sv) < SVt_PVIV)
2259 sv_upgrade(sv, SVt_PVIV);
2261 } else if (SvTYPE(sv) < SVt_PVNV)
2262 sv_upgrade(sv, SVt_PVNV);
2264 if ((numtype & (IS_NUMBER_INFINITY | IS_NUMBER_NAN))) {
2265 if (ckWARN(WARN_NUMERIC) && ((numtype & IS_NUMBER_TRAILING)))
2267 S_sv_setnv(aTHX_ sv, numtype);
2271 /* If NVs preserve UVs then we only use the UV value if we know that
2272 we aren't going to call atof() below. If NVs don't preserve UVs
2273 then the value returned may have more precision than atof() will
2274 return, even though value isn't perfectly accurate. */
2275 if ((numtype & (IS_NUMBER_IN_UV
2276 #ifdef NV_PRESERVES_UV
2279 )) == IS_NUMBER_IN_UV) {
2280 /* This won't turn off the public IOK flag if it was set above */
2281 (void)SvIOKp_on(sv);
2283 if (!(numtype & IS_NUMBER_NEG)) {
2285 if (value <= (UV)IV_MAX) {
2286 SvIV_set(sv, (IV)value);
2288 /* it didn't overflow, and it was positive. */
2289 SvUV_set(sv, value);
2293 /* 2s complement assumption */
2294 if (value <= (UV)IV_MIN) {
2295 SvIV_set(sv, value == (UV)IV_MIN
2296 ? IV_MIN : -(IV)value);
2298 /* Too negative for an IV. This is a double upgrade, but
2299 I'm assuming it will be rare. */
2300 if (SvTYPE(sv) < SVt_PVNV)
2301 sv_upgrade(sv, SVt_PVNV);
2305 SvNV_set(sv, -(NV)value);
2306 SvIV_set(sv, IV_MIN);
2310 /* For !NV_PRESERVES_UV and IS_NUMBER_IN_UV and IS_NUMBER_NOT_INT we
2311 will be in the previous block to set the IV slot, and the next
2312 block to set the NV slot. So no else here. */
2314 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2315 != IS_NUMBER_IN_UV) {
2316 /* It wasn't an (integer that doesn't overflow the UV). */
2317 S_sv_setnv(aTHX_ sv, numtype);
2319 if (! numtype && ckWARN(WARN_NUMERIC))
2322 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%" UVxf " 2iv(%" NVgf ")\n",
2323 PTR2UV(sv), SvNVX(sv)));
2325 #ifdef NV_PRESERVES_UV
2326 (void)SvIOKp_on(sv);
2328 #if defined(NAN_COMPARE_BROKEN) && defined(Perl_isnan)
2329 if (Perl_isnan(SvNVX(sv))) {
2335 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2336 SvIV_set(sv, I_V(SvNVX(sv)));
2337 if ((NV)(SvIVX(sv)) == SvNVX(sv)) {
2340 NOOP; /* Integer is imprecise. NOK, IOKp */
2342 /* UV will not work better than IV */
2344 if (SvNVX(sv) > (NV)UV_MAX) {
2346 /* Integer is inaccurate. NOK, IOKp, is UV */
2347 SvUV_set(sv, UV_MAX);
2349 SvUV_set(sv, U_V(SvNVX(sv)));
2350 /* 0xFFFFFFFFFFFFFFFF not an issue in here, NVs
2351 NV preservse UV so can do correct comparison. */
2352 if ((NV)(SvUVX(sv)) == SvNVX(sv)) {
2355 NOOP; /* Integer is imprecise. NOK, IOKp, is UV */
2360 #else /* NV_PRESERVES_UV */
2361 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2362 == (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT)) {
2363 /* The IV/UV slot will have been set from value returned by
2364 grok_number above. The NV slot has just been set using
2367 assert (SvIOKp(sv));
2369 if (((UV)1 << NV_PRESERVES_UV_BITS) >
2370 U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))) {
2371 /* Small enough to preserve all bits. */
2372 (void)SvIOKp_on(sv);
2374 SvIV_set(sv, I_V(SvNVX(sv)));
2375 if ((NV)(SvIVX(sv)) == SvNVX(sv))
2377 /* Assumption: first non-preserved integer is < IV_MAX,
2378 this NV is in the preserved range, therefore: */
2379 if (!(U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))
2381 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);
2385 0 0 already failed to read UV.
2386 0 1 already failed to read UV.
2387 1 0 you won't get here in this case. IV/UV
2388 slot set, public IOK, Atof() unneeded.
2389 1 1 already read UV.
2390 so there's no point in sv_2iuv_non_preserve() attempting
2391 to use atol, strtol, strtoul etc. */
2393 sv_2iuv_non_preserve (sv, numtype);
2395 sv_2iuv_non_preserve (sv);
2399 #endif /* NV_PRESERVES_UV */
2400 /* It might be more code efficient to go through the entire logic above
2401 and conditionally set with SvIOKp_on() rather than SvIOK(), but it
2402 gets complex and potentially buggy, so more programmer efficient
2403 to do it this way, by turning off the public flags: */
2405 SvFLAGS(sv) &= ~(SVf_IOK|SVf_NOK);
2409 if (isGV_with_GP(sv))
2410 return glob_2number(MUTABLE_GV(sv));
2412 if (!PL_localizing && ckWARN(WARN_UNINITIALIZED))
2414 if (SvTYPE(sv) < SVt_IV)
2415 /* Typically the caller expects that sv_any is not NULL now. */
2416 sv_upgrade(sv, SVt_IV);
2417 /* Return 0 from the caller. */
2424 =for apidoc sv_2iv_flags
2426 Return the integer value of an SV, doing any necessary string
2427 conversion. If C<flags> has the C<SV_GMAGIC> bit set, does an C<mg_get()> first.
2428 Normally used via the C<SvIV(sv)> and C<SvIVx(sv)> macros.
2434 Perl_sv_2iv_flags(pTHX_ SV *const sv, const I32 flags)
2436 PERL_ARGS_ASSERT_SV_2IV_FLAGS;
2438 assert (SvTYPE(sv) != SVt_PVAV && SvTYPE(sv) != SVt_PVHV
2439 && SvTYPE(sv) != SVt_PVFM);
2441 if (SvGMAGICAL(sv) && (flags & SV_GMAGIC))
2447 if (flags & SV_SKIP_OVERLOAD)
2449 tmpstr = AMG_CALLunary(sv, numer_amg);
2450 if (tmpstr && (!SvROK(tmpstr) || (SvRV(tmpstr) != SvRV(sv)))) {
2451 return SvIV(tmpstr);
2454 return PTR2IV(SvRV(sv));
2457 if (SvVALID(sv) || isREGEXP(sv)) {
2458 /* FBMs use the space for SvIVX and SvNVX for other purposes, so
2459 must not let them cache IVs.
2460 In practice they are extremely unlikely to actually get anywhere
2461 accessible by user Perl code - the only way that I'm aware of is when
2462 a constant subroutine which is used as the second argument to index.
2464 Regexps have no SvIVX and SvNVX fields.
2466 assert(isREGEXP(sv) || SvPOKp(sv));
2469 const char * const ptr =
2470 isREGEXP(sv) ? RX_WRAPPED((REGEXP*)sv) : SvPVX_const(sv);
2472 = grok_number(ptr, SvCUR(sv), &value);
2474 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2475 == IS_NUMBER_IN_UV) {
2476 /* It's definitely an integer */
2477 if (numtype & IS_NUMBER_NEG) {
2478 if (value < (UV)IV_MIN)
2481 if (value < (UV)IV_MAX)
2486 /* Quite wrong but no good choices. */
2487 if ((numtype & IS_NUMBER_INFINITY)) {
2488 return (numtype & IS_NUMBER_NEG) ? IV_MIN : IV_MAX;
2489 } else if ((numtype & IS_NUMBER_NAN)) {
2490 return 0; /* So wrong. */
2494 if (ckWARN(WARN_NUMERIC))
2497 return I_V(Atof(ptr));
2501 if (SvTHINKFIRST(sv)) {
2502 if (SvREADONLY(sv) && !SvOK(sv)) {
2503 if (ckWARN(WARN_UNINITIALIZED))
2510 if (S_sv_2iuv_common(aTHX_ sv))
2514 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%" UVxf " 2iv(%" IVdf ")\n",
2515 PTR2UV(sv),SvIVX(sv)));
2516 return SvIsUV(sv) ? (IV)SvUVX(sv) : SvIVX(sv);
2520 =for apidoc sv_2uv_flags
2522 Return the unsigned integer value of an SV, doing any necessary string
2523 conversion. If C<flags> has the C<SV_GMAGIC> bit set, does an C<mg_get()> first.
2524 Normally used via the C<SvUV(sv)> and C<SvUVx(sv)> macros.
2530 Perl_sv_2uv_flags(pTHX_ SV *const sv, const I32 flags)
2532 PERL_ARGS_ASSERT_SV_2UV_FLAGS;
2534 if (SvGMAGICAL(sv) && (flags & SV_GMAGIC))
2540 if (flags & SV_SKIP_OVERLOAD)
2542 tmpstr = AMG_CALLunary(sv, numer_amg);
2543 if (tmpstr && (!SvROK(tmpstr) || (SvRV(tmpstr) != SvRV(sv)))) {
2544 return SvUV(tmpstr);
2547 return PTR2UV(SvRV(sv));
2550 if (SvVALID(sv) || isREGEXP(sv)) {
2551 /* FBMs use the space for SvIVX and SvNVX for other purposes, and use
2552 the same flag bit as SVf_IVisUV, so must not let them cache IVs.
2553 Regexps have no SvIVX and SvNVX fields. */
2554 assert(isREGEXP(sv) || SvPOKp(sv));
2557 const char * const ptr =
2558 isREGEXP(sv) ? RX_WRAPPED((REGEXP*)sv) : SvPVX_const(sv);
2560 = grok_number(ptr, SvCUR(sv), &value);
2562 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2563 == IS_NUMBER_IN_UV) {
2564 /* It's definitely an integer */
2565 if (!(numtype & IS_NUMBER_NEG))
2569 /* Quite wrong but no good choices. */
2570 if ((numtype & IS_NUMBER_INFINITY)) {
2571 return UV_MAX; /* So wrong. */
2572 } else if ((numtype & IS_NUMBER_NAN)) {
2573 return 0; /* So wrong. */
2577 if (ckWARN(WARN_NUMERIC))
2580 return U_V(Atof(ptr));
2584 if (SvTHINKFIRST(sv)) {
2585 if (SvREADONLY(sv) && !SvOK(sv)) {
2586 if (ckWARN(WARN_UNINITIALIZED))
2593 if (S_sv_2iuv_common(aTHX_ sv))
2597 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%" UVxf " 2uv(%" UVuf ")\n",
2598 PTR2UV(sv),SvUVX(sv)));
2599 return SvIsUV(sv) ? SvUVX(sv) : (UV)SvIVX(sv);
2603 =for apidoc sv_2nv_flags
2605 Return the num value of an SV, doing any necessary string or integer
2606 conversion. If C<flags> has the C<SV_GMAGIC> bit set, does an C<mg_get()> first.
2607 Normally used via the C<SvNV(sv)> and C<SvNVx(sv)> macros.
2613 Perl_sv_2nv_flags(pTHX_ SV *const sv, const I32 flags)
2615 PERL_ARGS_ASSERT_SV_2NV_FLAGS;
2617 assert (SvTYPE(sv) != SVt_PVAV && SvTYPE(sv) != SVt_PVHV
2618 && SvTYPE(sv) != SVt_PVFM);
2619 if (SvGMAGICAL(sv) || SvVALID(sv) || isREGEXP(sv)) {
2620 /* FBMs use the space for SvIVX and SvNVX for other purposes, and use
2621 the same flag bit as SVf_IVisUV, so must not let them cache NVs.
2622 Regexps have no SvIVX and SvNVX fields. */
2624 if (flags & SV_GMAGIC)
2628 if (SvPOKp(sv) && !SvIOKp(sv)) {
2629 ptr = SvPVX_const(sv);
2631 if (!SvIOKp(sv) && ckWARN(WARN_NUMERIC) &&
2632 !grok_number(ptr, SvCUR(sv), NULL))
2638 return (NV)SvUVX(sv);
2640 return (NV)SvIVX(sv);
2646 ptr = RX_WRAPPED((REGEXP *)sv);
2649 assert(SvTYPE(sv) >= SVt_PVMG);
2650 /* This falls through to the report_uninit near the end of the
2652 } else if (SvTHINKFIRST(sv)) {
2657 if (flags & SV_SKIP_OVERLOAD)
2659 tmpstr = AMG_CALLunary(sv, numer_amg);
2660 if (tmpstr && (!SvROK(tmpstr) || (SvRV(tmpstr) != SvRV(sv)))) {
2661 return SvNV(tmpstr);
2664 return PTR2NV(SvRV(sv));
2666 if (SvREADONLY(sv) && !SvOK(sv)) {
2667 if (ckWARN(WARN_UNINITIALIZED))
2672 if (SvTYPE(sv) < SVt_NV) {
2673 /* The logic to use SVt_PVNV if necessary is in sv_upgrade. */
2674 sv_upgrade(sv, SVt_NV);
2676 STORE_NUMERIC_LOCAL_SET_STANDARD();
2677 PerlIO_printf(Perl_debug_log,
2678 "0x%" UVxf " num(%" NVgf ")\n",
2679 PTR2UV(sv), SvNVX(sv));
2680 RESTORE_NUMERIC_LOCAL();
2683 else if (SvTYPE(sv) < SVt_PVNV)
2684 sv_upgrade(sv, SVt_PVNV);
2689 SvNV_set(sv, SvIsUV(sv) ? (NV)SvUVX(sv) : (NV)SvIVX(sv));
2690 #ifdef NV_PRESERVES_UV
2696 /* Only set the public NV OK flag if this NV preserves the IV */
2697 /* Check it's not 0xFFFFFFFFFFFFFFFF */
2699 SvIsUV(sv) ? ((SvUVX(sv) != UV_MAX)&&(SvUVX(sv) == U_V(SvNVX(sv))))
2700 : (SvIVX(sv) == I_V(SvNVX(sv))))
2706 else if (SvPOKp(sv)) {
2708 const int numtype = grok_number(SvPVX_const(sv), SvCUR(sv), &value);
2709 if (!SvIOKp(sv) && !numtype && ckWARN(WARN_NUMERIC))
2711 #ifdef NV_PRESERVES_UV
2712 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2713 == IS_NUMBER_IN_UV) {
2714 /* It's definitely an integer */
2715 SvNV_set(sv, (numtype & IS_NUMBER_NEG) ? -(NV)value : (NV)value);
2717 S_sv_setnv(aTHX_ sv, numtype);
2724 SvNV_set(sv, Atof(SvPVX_const(sv)));
2725 /* Only set the public NV OK flag if this NV preserves the value in
2726 the PV at least as well as an IV/UV would.
2727 Not sure how to do this 100% reliably. */
2728 /* if that shift count is out of range then Configure's test is
2729 wonky. We shouldn't be in here with NV_PRESERVES_UV_BITS ==
2731 if (((UV)1 << NV_PRESERVES_UV_BITS) >
2732 U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))) {
2733 SvNOK_on(sv); /* Definitely small enough to preserve all bits */
2734 } else if (!(numtype & IS_NUMBER_IN_UV)) {
2735 /* Can't use strtol etc to convert this string, so don't try.
2736 sv_2iv and sv_2uv will use the NV to convert, not the PV. */
2739 /* value has been set. It may not be precise. */
2740 if ((numtype & IS_NUMBER_NEG) && (value >= (UV)IV_MIN)) {
2741 /* 2s complement assumption for (UV)IV_MIN */
2742 SvNOK_on(sv); /* Integer is too negative. */
2747 if (numtype & IS_NUMBER_NEG) {
2748 /* -IV_MIN is undefined, but we should never reach
2749 * this point with both IS_NUMBER_NEG and value ==
2751 assert(value != (UV)IV_MIN);
2752 SvIV_set(sv, -(IV)value);
2753 } else if (value <= (UV)IV_MAX) {
2754 SvIV_set(sv, (IV)value);
2756 SvUV_set(sv, value);
2760 if (numtype & IS_NUMBER_NOT_INT) {
2761 /* I believe that even if the original PV had decimals,
2762 they are lost beyond the limit of the FP precision.
2763 However, neither is canonical, so both only get p
2764 flags. NWC, 2000/11/25 */
2765 /* Both already have p flags, so do nothing */
2767 const NV nv = SvNVX(sv);
2768 /* XXX should this spot have NAN_COMPARE_BROKEN, too? */
2769 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2770 if (SvIVX(sv) == I_V(nv)) {
2773 /* It had no "." so it must be integer. */
2777 /* between IV_MAX and NV(UV_MAX).
2778 Could be slightly > UV_MAX */
2780 if (numtype & IS_NUMBER_NOT_INT) {
2781 /* UV and NV both imprecise. */
2783 const UV nv_as_uv = U_V(nv);
2785 if (value == nv_as_uv && SvUVX(sv) != UV_MAX) {
2794 /* It might be more code efficient to go through the entire logic above
2795 and conditionally set with SvNOKp_on() rather than SvNOK(), but it
2796 gets complex and potentially buggy, so more programmer efficient
2797 to do it this way, by turning off the public flags: */
2799 SvFLAGS(sv) &= ~(SVf_IOK|SVf_NOK);
2800 #endif /* NV_PRESERVES_UV */
2803 if (isGV_with_GP(sv)) {
2804 glob_2number(MUTABLE_GV(sv));
2808 if (!PL_localizing && ckWARN(WARN_UNINITIALIZED))
2810 assert (SvTYPE(sv) >= SVt_NV);
2811 /* Typically the caller expects that sv_any is not NULL now. */
2812 /* XXX Ilya implies that this is a bug in callers that assume this
2813 and ideally should be fixed. */
2817 STORE_NUMERIC_LOCAL_SET_STANDARD();
2818 PerlIO_printf(Perl_debug_log, "0x%" UVxf " 2nv(%" NVgf ")\n",
2819 PTR2UV(sv), SvNVX(sv));
2820 RESTORE_NUMERIC_LOCAL();
2828 Return an SV with the numeric value of the source SV, doing any necessary
2829 reference or overload conversion. The caller is expected to have handled
2836 Perl_sv_2num(pTHX_ SV *const sv)
2838 PERL_ARGS_ASSERT_SV_2NUM;
2843 SV * const tmpsv = AMG_CALLunary(sv, numer_amg);
2844 TAINT_IF(tmpsv && SvTAINTED(tmpsv));
2845 if (tmpsv && (!SvROK(tmpsv) || (SvRV(tmpsv) != SvRV(sv))))
2846 return sv_2num(tmpsv);
2848 return sv_2mortal(newSVuv(PTR2UV(SvRV(sv))));
2851 /* uiv_2buf(): private routine for use by sv_2pv_flags(): print an IV or
2852 * UV as a string towards the end of buf, and return pointers to start and
2855 * We assume that buf is at least TYPE_CHARS(UV) long.
2859 S_uiv_2buf(char *const buf, const IV iv, UV uv, const int is_uv, char **const peob)
2861 char *ptr = buf + TYPE_CHARS(UV);
2862 char * const ebuf = ptr;
2865 PERL_ARGS_ASSERT_UIV_2BUF;
2873 uv = (iv == IV_MIN) ? (UV)iv : (UV)(-iv);
2877 *--ptr = '0' + (char)(uv % 10);
2885 /* Helper for sv_2pv_flags and sv_vcatpvfn_flags. If the NV is an
2886 * infinity or a not-a-number, writes the appropriate strings to the
2887 * buffer, including a zero byte. On success returns the written length,
2888 * excluding the zero byte, on failure (not an infinity, not a nan)
2889 * returns zero, assert-fails on maxlen being too short.
2891 * XXX for "Inf", "-Inf", and "NaN", we could have three read-only
2892 * shared string constants we point to, instead of generating a new
2893 * string for each instance. */
2895 S_infnan_2pv(NV nv, char* buffer, size_t maxlen, char plus) {
2897 assert(maxlen >= 4);
2898 if (Perl_isinf(nv)) {
2900 if (maxlen < 5) /* "-Inf\0" */
2910 else if (Perl_isnan(nv)) {
2914 /* XXX optionally output the payload mantissa bits as
2915 * "(unsigned)" (to match the nan("...") C99 function,
2916 * or maybe as "(0xhhh...)" would make more sense...
2917 * provide a format string so that the user can decide?
2918 * NOTE: would affect the maxlen and assert() logic.*/
2923 assert((s == buffer + 3) || (s == buffer + 4));
2929 =for apidoc sv_2pv_flags
2931 Returns a pointer to the string value of an SV, and sets C<*lp> to its length.
2932 If flags has the C<SV_GMAGIC> bit set, does an C<mg_get()> first. Coerces C<sv> to a
2933 string if necessary. Normally invoked via the C<SvPV_flags> macro.
2934 C<sv_2pv()> and C<sv_2pv_nomg> usually end up here too.
2940 Perl_sv_2pv_flags(pTHX_ SV *const sv, STRLEN *const lp, const I32 flags)
2944 PERL_ARGS_ASSERT_SV_2PV_FLAGS;
2946 assert (SvTYPE(sv) != SVt_PVAV && SvTYPE(sv) != SVt_PVHV
2947 && SvTYPE(sv) != SVt_PVFM);
2948 if (SvGMAGICAL(sv) && (flags & SV_GMAGIC))
2953 if (flags & SV_SKIP_OVERLOAD)
2955 tmpstr = AMG_CALLunary(sv, string_amg);
2956 TAINT_IF(tmpstr && SvTAINTED(tmpstr));
2957 if (tmpstr && (!SvROK(tmpstr) || (SvRV(tmpstr) != SvRV(sv)))) {
2959 /* char *pv = lp ? SvPV(tmpstr, *lp) : SvPV_nolen(tmpstr);
2963 if ((SvFLAGS(tmpstr) & (SVf_POK)) == SVf_POK) {
2964 if (flags & SV_CONST_RETURN) {
2965 pv = (char *) SvPVX_const(tmpstr);
2967 pv = (flags & SV_MUTABLE_RETURN)
2968 ? SvPVX_mutable(tmpstr) : SvPVX(tmpstr);
2971 *lp = SvCUR(tmpstr);
2973 pv = sv_2pv_flags(tmpstr, lp, flags);
2986 SV *const referent = SvRV(sv);
2990 retval = buffer = savepvn("NULLREF", len);
2991 } else if (SvTYPE(referent) == SVt_REGEXP &&
2992 (!(PL_curcop->cop_hints & HINT_NO_AMAGIC) ||
2993 amagic_is_enabled(string_amg))) {
2994 REGEXP * const re = (REGEXP *)MUTABLE_PTR(referent);
2998 /* If the regex is UTF-8 we want the containing scalar to
2999 have an UTF-8 flag too */
3006 *lp = RX_WRAPLEN(re);
3008 return RX_WRAPPED(re);
3010 const char *const typestr = sv_reftype(referent, 0);
3011 const STRLEN typelen = strlen(typestr);
3012 UV addr = PTR2UV(referent);
3013 const char *stashname = NULL;
3014 STRLEN stashnamelen = 0; /* hush, gcc */
3015 const char *buffer_end;
3017 if (SvOBJECT(referent)) {
3018 const HEK *const name = HvNAME_HEK(SvSTASH(referent));
3021 stashname = HEK_KEY(name);
3022 stashnamelen = HEK_LEN(name);
3024 if (HEK_UTF8(name)) {
3030 stashname = "__ANON__";
3033 len = stashnamelen + 1 /* = */ + typelen + 3 /* (0x */
3034 + 2 * sizeof(UV) + 2 /* )\0 */;
3036 len = typelen + 3 /* (0x */
3037 + 2 * sizeof(UV) + 2 /* )\0 */;
3040 Newx(buffer, len, char);
3041 buffer_end = retval = buffer + len;
3043 /* Working backwards */
3047 *--retval = PL_hexdigit[addr & 15];
3048 } while (addr >>= 4);
3054 memcpy(retval, typestr, typelen);
3058 retval -= stashnamelen;
3059 memcpy(retval, stashname, stashnamelen);
3061 /* retval may not necessarily have reached the start of the
3063 assert (retval >= buffer);
3065 len = buffer_end - retval - 1; /* -1 for that \0 */
3077 if (flags & SV_MUTABLE_RETURN)
3078 return SvPVX_mutable(sv);
3079 if (flags & SV_CONST_RETURN)
3080 return (char *)SvPVX_const(sv);
3085 /* I'm assuming that if both IV and NV are equally valid then
3086 converting the IV is going to be more efficient */
3087 const U32 isUIOK = SvIsUV(sv);
3088 char buf[TYPE_CHARS(UV)];
3092 if (SvTYPE(sv) < SVt_PVIV)
3093 sv_upgrade(sv, SVt_PVIV);
3094 ptr = uiv_2buf(buf, SvIVX(sv), SvUVX(sv), isUIOK, &ebuf);
3096 /* inlined from sv_setpvn */
3097 s = SvGROW_mutable(sv, len + 1);
3098 Move(ptr, s, len, char);
3103 else if (SvNOK(sv)) {
3104 if (SvTYPE(sv) < SVt_PVNV)
3105 sv_upgrade(sv, SVt_PVNV);
3106 if (SvNVX(sv) == 0.0
3107 #if defined(NAN_COMPARE_BROKEN) && defined(Perl_isnan)
3108 && !Perl_isnan(SvNVX(sv))
3111 s = SvGROW_mutable(sv, 2);
3116 STRLEN size = 5; /* "-Inf\0" */
3118 s = SvGROW_mutable(sv, size);
3119 len = S_infnan_2pv(SvNVX(sv), s, size, 0);
3125 /* some Xenix systems wipe out errno here */
3134 5 + /* exponent digits */
3138 s = SvGROW_mutable(sv, size);
3139 #ifndef USE_LOCALE_NUMERIC
3140 SNPRINTF_G(SvNVX(sv), s, SvLEN(sv), NV_DIG);
3146 DECLARATION_FOR_LC_NUMERIC_MANIPULATION;
3147 STORE_LC_NUMERIC_SET_TO_NEEDED();
3149 local_radix = PL_numeric_local && PL_numeric_radix_sv;
3150 if (local_radix && SvLEN(PL_numeric_radix_sv) > 1) {
3151 size += SvLEN(PL_numeric_radix_sv) - 1;
3152 s = SvGROW_mutable(sv, size);
3155 SNPRINTF_G(SvNVX(sv), s, SvLEN(sv), NV_DIG);
3157 /* If the radix character is UTF-8, and actually is in the
3158 * output, turn on the UTF-8 flag for the scalar */
3160 && SvUTF8(PL_numeric_radix_sv)
3161 && instr(s, SvPVX_const(PL_numeric_radix_sv)))
3166 RESTORE_LC_NUMERIC();
3169 /* We don't call SvPOK_on(), because it may come to
3170 * pass that the locale changes so that the
3171 * stringification we just did is no longer correct. We
3172 * will have to re-stringify every time it is needed */
3179 else if (isGV_with_GP(sv)) {
3180 GV *const gv = MUTABLE_GV(sv);
3181 SV *const buffer = sv_newmortal();
3183 gv_efullname3(buffer, gv, "*");
3185 assert(SvPOK(buffer));
3189 *lp = SvCUR(buffer);
3190 return SvPVX(buffer);
3192 else if (isREGEXP(sv)) {
3193 if (lp) *lp = RX_WRAPLEN((REGEXP *)sv);
3194 return RX_WRAPPED((REGEXP *)sv);
3199 if (flags & SV_UNDEF_RETURNS_NULL)
3201 if (!PL_localizing && ckWARN(WARN_UNINITIALIZED))
3203 /* Typically the caller expects that sv_any is not NULL now. */
3204 if (!SvREADONLY(sv) && SvTYPE(sv) < SVt_PV)
3205 sv_upgrade(sv, SVt_PV);
3210 const STRLEN len = s - SvPVX_const(sv);
3215 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%" UVxf " 2pv(%s)\n",
3216 PTR2UV(sv),SvPVX_const(sv)));
3217 if (flags & SV_CONST_RETURN)
3218 return (char *)SvPVX_const(sv);
3219 if (flags & SV_MUTABLE_RETURN)
3220 return SvPVX_mutable(sv);
3225 =for apidoc sv_copypv
3227 Copies a stringified representation of the source SV into the
3228 destination SV. Automatically performs any necessary C<mg_get> and
3229 coercion of numeric values into strings. Guaranteed to preserve
3230 C<UTF8> flag even from overloaded objects. Similar in nature to
3231 C<sv_2pv[_flags]> but operates directly on an SV instead of just the
3232 string. Mostly uses C<sv_2pv_flags> to do its work, except when that
3233 would lose the UTF-8'ness of the PV.
3235 =for apidoc sv_copypv_nomg
3237 Like C<sv_copypv>, but doesn't invoke get magic first.
3239 =for apidoc sv_copypv_flags
3241 Implementation of C<sv_copypv> and C<sv_copypv_nomg>. Calls get magic iff flags
3242 has the C<SV_GMAGIC> bit set.
3248 Perl_sv_copypv_flags(pTHX_ SV *const dsv, SV *const ssv, const I32 flags)
3253 PERL_ARGS_ASSERT_SV_COPYPV_FLAGS;
3255 s = SvPV_flags_const(ssv,len,(flags & SV_GMAGIC));
3256 sv_setpvn(dsv,s,len);
3264 =for apidoc sv_2pvbyte
3266 Return a pointer to the byte-encoded representation of the SV, and set C<*lp>
3267 to its length. May cause the SV to be downgraded from UTF-8 as a
3270 Usually accessed via the C<SvPVbyte> macro.
3276 Perl_sv_2pvbyte(pTHX_ SV *sv, STRLEN *const lp)
3278 PERL_ARGS_ASSERT_SV_2PVBYTE;
3281 if (((SvREADONLY(sv) || SvFAKE(sv)) && !SvIsCOW(sv))
3282 || isGV_with_GP(sv) || SvROK(sv)) {
3283 SV *sv2 = sv_newmortal();
3284 sv_copypv_nomg(sv2,sv);
3287 sv_utf8_downgrade(sv,0);
3288 return lp ? SvPV_nomg(sv,*lp) : SvPV_nomg_nolen(sv);
3292 =for apidoc sv_2pvutf8
3294 Return a pointer to the UTF-8-encoded representation of the SV, and set C<*lp>
3295 to its length. May cause the SV to be upgraded to UTF-8 as a side-effect.
3297 Usually accessed via the C<SvPVutf8> macro.
3303 Perl_sv_2pvutf8(pTHX_ SV *sv, STRLEN *const lp)
3305 PERL_ARGS_ASSERT_SV_2PVUTF8;
3307 if (((SvREADONLY(sv) || SvFAKE(sv)) && !SvIsCOW(sv))
3308 || isGV_with_GP(sv) || SvROK(sv))
3309 sv = sv_mortalcopy(sv);
3312 sv_utf8_upgrade_nomg(sv);
3313 return lp ? SvPV_nomg(sv,*lp) : SvPV_nomg_nolen(sv);
3318 =for apidoc sv_2bool
3320 This macro is only used by C<sv_true()> or its macro equivalent, and only if
3321 the latter's argument is neither C<SvPOK>, C<SvIOK> nor C<SvNOK>.
3322 It calls C<sv_2bool_flags> with the C<SV_GMAGIC> flag.
3324 =for apidoc sv_2bool_flags
3326 This function is only used by C<sv_true()> and friends, and only if
3327 the latter's argument is neither C<SvPOK>, C<SvIOK> nor C<SvNOK>. If the flags
3328 contain C<SV_GMAGIC>, then it does an C<mg_get()> first.
3335 Perl_sv_2bool_flags(pTHX_ SV *sv, I32 flags)
3337 PERL_ARGS_ASSERT_SV_2BOOL_FLAGS;
3340 if(flags & SV_GMAGIC) SvGETMAGIC(sv);
3346 SV * const tmpsv = AMG_CALLunary(sv, bool__amg);
3347 if (tmpsv && (!SvROK(tmpsv) || (SvRV(tmpsv) != SvRV(sv)))) {
3350 if(SvGMAGICAL(sv)) {
3352 goto restart; /* call sv_2bool */
3354 /* expanded SvTRUE_common(sv, (flags = 0, goto restart)) */
3355 else if(!SvOK(sv)) {
3358 else if(SvPOK(sv)) {
3359 svb = SvPVXtrue(sv);
3361 else if((SvFLAGS(sv) & (SVf_IOK|SVf_NOK))) {
3362 svb = (SvIOK(sv) && SvIVX(sv) != 0)
3363 || (SvNOK(sv) && SvNVX(sv) != 0.0);
3367 goto restart; /* call sv_2bool_nomg */
3372 return SvRV(sv) != 0;
3376 RX_WRAPLEN(sv) > 1 || (RX_WRAPLEN(sv) && *RX_WRAPPED(sv) != '0');
3377 return SvTRUE_common(sv, isGV_with_GP(sv) ? 1 : 0);
3381 =for apidoc sv_utf8_upgrade
3383 Converts the PV of an SV to its UTF-8-encoded form.
3384 Forces the SV to string form if it is not already.
3385 Will C<mg_get> on C<sv> if appropriate.
3386 Always sets the C<SvUTF8> flag to avoid future validity checks even
3387 if the whole string is the same in UTF-8 as not.
3388 Returns the number of bytes in the converted string
3390 This is not a general purpose byte encoding to Unicode interface:
3391 use the Encode extension for that.
3393 =for apidoc sv_utf8_upgrade_nomg
3395 Like C<sv_utf8_upgrade>, but doesn't do magic on C<sv>.
3397 =for apidoc sv_utf8_upgrade_flags
3399 Converts the PV of an SV to its UTF-8-encoded form.
3400 Forces the SV to string form if it is not already.
3401 Always sets the SvUTF8 flag to avoid future validity checks even
3402 if all the bytes are invariant in UTF-8.
3403 If C<flags> has C<SV_GMAGIC> bit set,
3404 will C<mg_get> on C<sv> if appropriate, else not.
3406 If C<flags> has C<SV_FORCE_UTF8_UPGRADE> set, this function assumes that the PV
3407 will expand when converted to UTF-8, and skips the extra work of checking for
3408 that. Typically this flag is used by a routine that has already parsed the
3409 string and found such characters, and passes this information on so that the
3410 work doesn't have to be repeated.
3412 Returns the number of bytes in the converted string.
3414 This is not a general purpose byte encoding to Unicode interface:
3415 use the Encode extension for that.
3417 =for apidoc sv_utf8_upgrade_flags_grow
3419 Like C<sv_utf8_upgrade_flags>, but has an additional parameter C<extra>, which is
3420 the number of unused bytes the string of C<sv> is guaranteed to have free after
3421 it upon return. This allows the caller to reserve extra space that it intends
3422 to fill, to avoid extra grows.
3424 C<sv_utf8_upgrade>, C<sv_utf8_upgrade_nomg>, and C<sv_utf8_upgrade_flags>
3425 are implemented in terms of this function.
3427 Returns the number of bytes in the converted string (not including the spares).
3431 (One might think that the calling routine could pass in the position of the
3432 first variant character when it has set SV_FORCE_UTF8_UPGRADE, so it wouldn't
3433 have to be found again. But that is not the case, because typically when the
3434 caller is likely to use this flag, it won't be calling this routine unless it
3435 finds something that won't fit into a byte. Otherwise it tries to not upgrade
3436 and just use bytes. But some things that do fit into a byte are variants in
3437 utf8, and the caller may not have been keeping track of these.)
3439 If the routine itself changes the string, it adds a trailing C<NUL>. Such a
3440 C<NUL> isn't guaranteed due to having other routines do the work in some input
3441 cases, or if the input is already flagged as being in utf8.
3443 The speed of this could perhaps be improved for many cases if someone wanted to
3444 write a fast function that counts the number of variant characters in a string,
3445 especially if it could return the position of the first one.
3450 Perl_sv_utf8_upgrade_flags_grow(pTHX_ SV *const sv, const I32 flags, STRLEN extra)
3452 PERL_ARGS_ASSERT_SV_UTF8_UPGRADE_FLAGS_GROW;
3454 if (sv == &PL_sv_undef)
3456 if (!SvPOK_nog(sv)) {
3458 if (SvREADONLY(sv) && (SvPOKp(sv) || SvIOKp(sv) || SvNOKp(sv))) {
3459 (void) sv_2pv_flags(sv,&len, flags);
3461 if (extra) SvGROW(sv, SvCUR(sv) + extra);
3465 (void) SvPV_force_flags(sv,len,flags & SV_GMAGIC);
3470 if (extra) SvGROW(sv, SvCUR(sv) + extra);
3475 S_sv_uncow(aTHX_ sv, 0);
3478 if (SvCUR(sv) == 0) {
3479 if (extra) SvGROW(sv, extra);
3480 } else { /* Assume Latin-1/EBCDIC */
3481 /* This function could be much more efficient if we
3482 * had a FLAG in SVs to signal if there are any variant
3483 * chars in the PV. Given that there isn't such a flag
3484 * make the loop as fast as possible (although there are certainly ways
3485 * to speed this up, eg. through vectorization) */
3486 U8 * s = (U8 *) SvPVX_const(sv);
3487 U8 * e = (U8 *) SvEND(sv);
3489 STRLEN two_byte_count = 0;
3491 if (flags & SV_FORCE_UTF8_UPGRADE) goto must_be_utf8;
3493 /* See if really will need to convert to utf8. We mustn't rely on our
3494 * incoming SV being well formed and having a trailing '\0', as certain
3495 * code in pp_formline can send us partially built SVs. */
3499 if (NATIVE_BYTE_IS_INVARIANT(ch)) continue;
3501 t--; /* t already incremented; re-point to first variant */
3506 /* utf8 conversion not needed because all are invariants. Mark as
3507 * UTF-8 even if no variant - saves scanning loop */
3509 if (extra) SvGROW(sv, SvCUR(sv) + extra);
3514 /* Here, the string should be converted to utf8, either because of an
3515 * input flag (two_byte_count = 0), or because a character that
3516 * requires 2 bytes was found (two_byte_count = 1). t points either to
3517 * the beginning of the string (if we didn't examine anything), or to
3518 * the first variant. In either case, everything from s to t - 1 will
3519 * occupy only 1 byte each on output.
3521 * There are two main ways to convert. One is to create a new string
3522 * and go through the input starting from the beginning, appending each
3523 * converted value onto the new string as we go along. It's probably
3524 * best to allocate enough space in the string for the worst possible
3525 * case rather than possibly running out of space and having to
3526 * reallocate and then copy what we've done so far. Since everything
3527 * from s to t - 1 is invariant, the destination can be initialized
3528 * with these using a fast memory copy
3530 * The other way is to figure out exactly how big the string should be
3531 * by parsing the entire input. Then you don't have to make it big
3532 * enough to handle the worst possible case, and more importantly, if
3533 * the string you already have is large enough, you don't have to
3534 * allocate a new string, you can copy the last character in the input
3535 * string to the final position(s) that will be occupied by the
3536 * converted string and go backwards, stopping at t, since everything
3537 * before that is invariant.
3539 * There are advantages and disadvantages to each method.
3541 * In the first method, we can allocate a new string, do the memory
3542 * copy from the s to t - 1, and then proceed through the rest of the
3543 * string byte-by-byte.
3545 * In the second method, we proceed through the rest of the input
3546 * string just calculating how big the converted string will be. Then
3547 * there are two cases:
3548 * 1) if the string has enough extra space to handle the converted
3549 * value. We go backwards through the string, converting until we
3550 * get to the position we are at now, and then stop. If this
3551 * position is far enough along in the string, this method is
3552 * faster than the other method. If the memory copy were the same
3553 * speed as the byte-by-byte loop, that position would be about
3554 * half-way, as at the half-way mark, parsing to the end and back
3555 * is one complete string's parse, the same amount as starting
3556 * over and going all the way through. Actually, it would be
3557 * somewhat less than half-way, as it's faster to just count bytes
3558 * than to also copy, and we don't have the overhead of allocating
3559 * a new string, changing the scalar to use it, and freeing the
3560 * existing one. But if the memory copy is fast, the break-even
3561 * point is somewhere after half way. The counting loop could be
3562 * sped up by vectorization, etc, to move the break-even point
3563 * further towards the beginning.
3564 * 2) if the string doesn't have enough space to handle the converted
3565 * value. A new string will have to be allocated, and one might
3566 * as well, given that, start from the beginning doing the first
3567 * method. We've spent extra time parsing the string and in
3568 * exchange all we've gotten is that we know precisely how big to
3569 * make the new one. Perl is more optimized for time than space,
3570 * so this case is a loser.
3571 * So what I've decided to do is not use the 2nd method unless it is
3572 * guaranteed that a new string won't have to be allocated, assuming
3573 * the worst case. I also decided not to put any more conditions on it
3574 * than this, for now. It seems likely that, since the worst case is
3575 * twice as big as the unknown portion of the string (plus 1), we won't
3576 * be guaranteed enough space, causing us to go to the first method,
3577 * unless the string is short, or the first variant character is near
3578 * the end of it. In either of these cases, it seems best to use the
3579 * 2nd method. The only circumstance I can think of where this would
3580 * be really slower is if the string had once had much more data in it
3581 * than it does now, but there is still a substantial amount in it */
3584 STRLEN invariant_head = t - s;
3585 STRLEN size = invariant_head + (e - t) * 2 + 1 + extra;
3586 if (SvLEN(sv) < size) {
3588 /* Here, have decided to allocate a new string */
3593 Newx(dst, size, U8);
3595 /* If no known invariants at the beginning of the input string,
3596 * set so starts from there. Otherwise, can use memory copy to
3597 * get up to where we are now, and then start from here */
3599 if (invariant_head == 0) {
3602 Copy(s, dst, invariant_head, char);
3603 d = dst + invariant_head;
3607 append_utf8_from_native_byte(*t, &d);
3611 SvPV_free(sv); /* No longer using pre-existing string */
3612 SvPV_set(sv, (char*)dst);
3613 SvCUR_set(sv, d - dst);
3614 SvLEN_set(sv, size);
3617 /* Here, have decided to get the exact size of the string.
3618 * Currently this happens only when we know that there is
3619 * guaranteed enough space to fit the converted string, so
3620 * don't have to worry about growing. If two_byte_count is 0,
3621 * then t points to the first byte of the string which hasn't
3622 * been examined yet. Otherwise two_byte_count is 1, and t
3623 * points to the first byte in the string that will expand to
3624 * two. Depending on this, start examining at t or 1 after t.
3627 U8 *d = t + two_byte_count;
3630 /* Count up the remaining bytes that expand to two */
3633 const U8 chr = *d++;
3634 if (! NATIVE_BYTE_IS_INVARIANT(chr)) two_byte_count++;
3637 /* The string will expand by just the number of bytes that
3638 * occupy two positions. But we are one afterwards because of
3639 * the increment just above. This is the place to put the
3640 * trailing NUL, and to set the length before we decrement */
3642 d += two_byte_count;
3643 SvCUR_set(sv, d - s);
3647 /* Having decremented d, it points to the position to put the
3648 * very last byte of the expanded string. Go backwards through
3649 * the string, copying and expanding as we go, stopping when we
3650 * get to the part that is invariant the rest of the way down */
3654 if (NATIVE_BYTE_IS_INVARIANT(*e)) {
3657 *d-- = UTF8_EIGHT_BIT_LO(*e);
3658 *d-- = UTF8_EIGHT_BIT_HI(*e);
3664 if (SvTYPE(sv) >= SVt_PVMG && SvMAGIC(sv)) {
3665 /* Update pos. We do it at the end rather than during
3666 * the upgrade, to avoid slowing down the common case
3667 * (upgrade without pos).
3668 * pos can be stored as either bytes or characters. Since
3669 * this was previously a byte string we can just turn off
3670 * the bytes flag. */
3671 MAGIC * mg = mg_find(sv, PERL_MAGIC_regex_global);
3673 mg->mg_flags &= ~MGf_BYTES;
3675 if ((mg = mg_find(sv, PERL_MAGIC_utf8)))
3676 magic_setutf8(sv,mg); /* clear UTF8 cache */
3681 /* Mark as UTF-8 even if no variant - saves scanning loop */
3687 =for apidoc sv_utf8_downgrade
3689 Attempts to convert the PV of an SV from characters to bytes.
3690 If the PV contains a character that cannot fit
3691 in a byte, this conversion will fail;
3692 in this case, either returns false or, if C<fail_ok> is not
3695 This is not a general purpose Unicode to byte encoding interface:
3696 use the C<Encode> extension for that.
3702 Perl_sv_utf8_downgrade(pTHX_ SV *const sv, const bool fail_ok)
3704 PERL_ARGS_ASSERT_SV_UTF8_DOWNGRADE;
3706 if (SvPOKp(sv) && SvUTF8(sv)) {
3710 int mg_flags = SV_GMAGIC;
3713 S_sv_uncow(aTHX_ sv, 0);
3715 if (SvTYPE(sv) >= SVt_PVMG && SvMAGIC(sv)) {
3717 MAGIC * mg = mg_find(sv, PERL_MAGIC_regex_global);
3718 if (mg && mg->mg_len > 0 && mg->mg_flags & MGf_BYTES) {
3719 mg->mg_len = sv_pos_b2u_flags(sv, mg->mg_len,
3720 SV_GMAGIC|SV_CONST_RETURN);
3721 mg_flags = 0; /* sv_pos_b2u does get magic */
3723 if ((mg = mg_find(sv, PERL_MAGIC_utf8)))
3724 magic_setutf8(sv,mg); /* clear UTF8 cache */
3727 s = (U8 *) SvPV_flags(sv, len, mg_flags);
3729 if (!utf8_to_bytes(s, &len)) {
3734 Perl_croak(aTHX_ "Wide character in %s",
3737 Perl_croak(aTHX_ "Wide character");
3748 =for apidoc sv_utf8_encode
3750 Converts the PV of an SV to UTF-8, but then turns the C<SvUTF8>
3751 flag off so that it looks like octets again.
3757 Perl_sv_utf8_encode(pTHX_ SV *const sv)
3759 PERL_ARGS_ASSERT_SV_UTF8_ENCODE;
3761 if (SvREADONLY(sv)) {
3762 sv_force_normal_flags(sv, 0);
3764 (void) sv_utf8_upgrade(sv);
3769 =for apidoc sv_utf8_decode
3771 If the PV of the SV is an octet sequence in Perl's extended UTF-8
3772 and contains a multiple-byte character, the C<SvUTF8> flag is turned on
3773 so that it looks like a character. If the PV contains only single-byte
3774 characters, the C<SvUTF8> flag stays off.
3775 Scans PV for validity and returns FALSE if the PV is invalid UTF-8.
3781 Perl_sv_utf8_decode(pTHX_ SV *const sv)
3783 PERL_ARGS_ASSERT_SV_UTF8_DECODE;
3786 const U8 *start, *c;
3788 /* The octets may have got themselves encoded - get them back as
3791 if (!sv_utf8_downgrade(sv, TRUE))
3794 /* it is actually just a matter of turning the utf8 flag on, but
3795 * we want to make sure everything inside is valid utf8 first.
3797 c = start = (const U8 *) SvPVX_const(sv);
3798 if (!is_utf8_string(c, SvCUR(sv)))
3800 if (! is_utf8_invariant_string(c, SvCUR(sv))) {
3803 if (SvTYPE(sv) >= SVt_PVMG && SvMAGIC(sv)) {
3804 /* XXX Is this dead code? XS_utf8_decode calls SvSETMAGIC
3805 after this, clearing pos. Does anything on CPAN
3807 /* adjust pos to the start of a UTF8 char sequence */
3808 MAGIC * mg = mg_find(sv, PERL_MAGIC_regex_global);
3810 I32 pos = mg->mg_len;
3812 for (c = start + pos; c > start; c--) {
3813 if (UTF8_IS_START(*c))
3816 mg->mg_len = c - start;
3819 if ((mg = mg_find(sv, PERL_MAGIC_utf8)))
3820 magic_setutf8(sv,mg); /* clear UTF8 cache */
3827 =for apidoc sv_setsv
3829 Copies the contents of the source SV C<ssv> into the destination SV
3830 C<dsv>. The source SV may be destroyed if it is mortal, so don't use this
3831 function if the source SV needs to be reused. Does not handle 'set' magic on
3832 destination SV. Calls 'get' magic on source SV. Loosely speaking, it
3833 performs a copy-by-value, obliterating any previous content of the
3836 You probably want to use one of the assortment of wrappers, such as
3837 C<SvSetSV>, C<SvSetSV_nosteal>, C<SvSetMagicSV> and
3838 C<SvSetMagicSV_nosteal>.
3840 =for apidoc sv_setsv_flags
3842 Copies the contents of the source SV C<ssv> into the destination SV
3843 C<dsv>. The source SV may be destroyed if it is mortal, so don't use this
3844 function if the source SV needs to be reused. Does not handle 'set' magic.
3845 Loosely speaking, it performs a copy-by-value, obliterating any previous
3846 content of the destination.
3847 If the C<flags> parameter has the C<SV_GMAGIC> bit set, will C<mg_get> on
3848 C<ssv> if appropriate, else not. If the C<flags>
3849 parameter has the C<SV_NOSTEAL> bit set then the
3850 buffers of temps will not be stolen. C<sv_setsv>
3851 and C<sv_setsv_nomg> are implemented in terms of this function.
3853 You probably want to use one of the assortment of wrappers, such as
3854 C<SvSetSV>, C<SvSetSV_nosteal>, C<SvSetMagicSV> and
3855 C<SvSetMagicSV_nosteal>.
3857 This is the primary function for copying scalars, and most other
3858 copy-ish functions and macros use this underneath.
3864 S_glob_assign_glob(pTHX_ SV *const dstr, SV *const sstr, const int dtype)
3866 I32 mro_changes = 0; /* 1 = method, 2 = isa, 3 = recursive isa */
3867 HV *old_stash = NULL;
3869 PERL_ARGS_ASSERT_GLOB_ASSIGN_GLOB;
3871 if (dtype != SVt_PVGV && !isGV_with_GP(dstr)) {
3872 const char * const name = GvNAME(sstr);
3873 const STRLEN len = GvNAMELEN(sstr);
3875 if (dtype >= SVt_PV) {
3881 SvUPGRADE(dstr, SVt_PVGV);
3882 (void)SvOK_off(dstr);
3883 isGV_with_GP_on(dstr);
3885 GvSTASH(dstr) = GvSTASH(sstr);
3887 Perl_sv_add_backref(aTHX_ MUTABLE_SV(GvSTASH(dstr)), dstr);
3888 gv_name_set(MUTABLE_GV(dstr), name, len,
3889 GV_ADD | (GvNAMEUTF8(sstr) ? SVf_UTF8 : 0 ));
3890 SvFAKE_on(dstr); /* can coerce to non-glob */
3893 if(GvGP(MUTABLE_GV(sstr))) {
3894 /* If source has method cache entry, clear it */
3896 SvREFCNT_dec(GvCV(sstr));
3897 GvCV_set(sstr, NULL);
3900 /* If source has a real method, then a method is
3903 GvCV((const GV *)sstr) && GvSTASH(dstr) && HvENAME(GvSTASH(dstr))
3909 /* If dest already had a real method, that's a change as well */
3911 !mro_changes && GvGP(MUTABLE_GV(dstr)) && GvCVu((const GV *)dstr)
3912 && GvSTASH(dstr) && HvENAME(GvSTASH(dstr))
3917 /* We don't need to check the name of the destination if it was not a
3918 glob to begin with. */
3919 if(dtype == SVt_PVGV) {
3920 const char * const name = GvNAME((const GV *)dstr);
3923 /* The stash may have been detached from the symbol table, so
3925 && GvSTASH(dstr) && HvENAME(GvSTASH(dstr))
3929 const STRLEN len = GvNAMELEN(dstr);
3930 if ((len > 1 && name[len-2] == ':' && name[len-1] == ':')
3931 || (len == 1 && name[0] == ':')) {
3934 /* Set aside the old stash, so we can reset isa caches on
3936 if((old_stash = GvHV(dstr)))
3937 /* Make sure we do not lose it early. */
3938 SvREFCNT_inc_simple_void_NN(
3939 sv_2mortal((SV *)old_stash)
3944 SvREFCNT_inc_simple_void_NN(sv_2mortal(dstr));
3947 /* freeing dstr's GP might free sstr (e.g. *x = $x),
3948 * so temporarily protect it */
3950 SAVEFREESV(SvREFCNT_inc_simple_NN(sstr));
3951 gp_free(MUTABLE_GV(dstr));
3952 GvINTRO_off(dstr); /* one-shot flag */
3953 GvGP_set(dstr, gp_ref(GvGP(sstr)));
3956 if (SvTAINTED(sstr))
3958 if (GvIMPORTED(dstr) != GVf_IMPORTED
3959 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3961 GvIMPORTED_on(dstr);
3964 if(mro_changes == 2) {
3965 if (GvAV((const GV *)sstr)) {
3967 SV * const sref = (SV *)GvAV((const GV *)dstr);
3968 if (SvSMAGICAL(sref) && (mg = mg_find(sref, PERL_MAGIC_isa))) {
3969 if (SvTYPE(mg->mg_obj) != SVt_PVAV) {
3970 AV * const ary = newAV();
3971 av_push(ary, mg->mg_obj); /* takes the refcount */
3972 mg->mg_obj = (SV *)ary;
3974 av_push((AV *)mg->mg_obj, SvREFCNT_inc_simple_NN(dstr));
3976 else sv_magic(sref, dstr, PERL_MAGIC_isa, NULL, 0);
3978 mro_isa_changed_in(GvSTASH(dstr));
3980 else if(mro_changes == 3) {
3981 HV * const stash = GvHV(dstr);
3982 if(old_stash ? (HV *)HvENAME_get(old_stash) : stash)
3988 else if(mro_changes) mro_method_changed_in(GvSTASH(dstr));
3989 if (GvIO(dstr) && dtype == SVt_PVGV) {
3990 DEBUG_o(Perl_deb(aTHX_
3991 "glob_assign_glob clearing PL_stashcache\n"));
3992 /* It's a cache. It will rebuild itself quite happily.
3993 It's a lot of effort to work out exactly which key (or keys)
3994 might be invalidated by the creation of the this file handle.
3996 hv_clear(PL_stashcache);
4002 Perl_gv_setref(pTHX_ SV *const dstr, SV *const sstr)
4004 SV * const sref = SvRV(sstr);
4006 const int intro = GvINTRO(dstr);
4009 const U32 stype = SvTYPE(sref);
4011 PERL_ARGS_ASSERT_GV_SETREF;
4014 GvINTRO_off(dstr); /* one-shot flag */
4015 GvLINE(dstr) = CopLINE(PL_curcop);
4016 GvEGV(dstr) = MUTABLE_GV(dstr);
4021 location = (SV **) &(GvGP(dstr)->gp_cv); /* XXX bypassing GvCV_set */
4022 import_flag = GVf_IMPORTED_CV;
4025 location = (SV **) &GvHV(dstr);
4026 import_flag = GVf_IMPORTED_HV;
4029 location = (SV **) &GvAV(dstr);
4030 import_flag = GVf_IMPORTED_AV;
4033 location = (SV **) &GvIOp(dstr);
4036 location = (SV **) &GvFORM(dstr);
4039 location = &GvSV(dstr);
4040 import_flag = GVf_IMPORTED_SV;
4043 if (stype == SVt_PVCV) {
4044 /*if (GvCVGEN(dstr) && (GvCV(dstr) != (const CV *)sref || GvCVGEN(dstr))) {*/
4045 if (GvCVGEN(dstr)) {
4046 SvREFCNT_dec(GvCV(dstr));
4047 GvCV_set(dstr, NULL);
4048 GvCVGEN(dstr) = 0; /* Switch off cacheness. */
4051 /* SAVEt_GVSLOT takes more room on the savestack and has more
4052 overhead in leave_scope than SAVEt_GENERIC_SV. But for CVs
4053 leave_scope needs access to the GV so it can reset method
4054 caches. We must use SAVEt_GVSLOT whenever the type is
4055 SVt_PVCV, even if the stash is anonymous, as the stash may
4056 gain a name somehow before leave_scope. */
4057 if (stype == SVt_PVCV) {
4058 /* There is no save_pushptrptrptr. Creating it for this
4059 one call site would be overkill. So inline the ss add
4063 SS_ADD_PTR(location);
4064 SS_ADD_PTR(SvREFCNT_inc(*location));
4065 SS_ADD_UV(SAVEt_GVSLOT);
4068 else SAVEGENERICSV(*location);
4071 if (stype == SVt_PVCV && (*location != sref || GvCVGEN(dstr))) {
4072 CV* const cv = MUTABLE_CV(*location);
4074 if (!GvCVGEN((const GV *)dstr) &&
4075 (CvROOT(cv) || CvXSUB(cv)) &&
4076 /* redundant check that avoids creating the extra SV
4077 most of the time: */
4078 (CvCONST(cv) || ckWARN(WARN_REDEFINE)))
4080 SV * const new_const_sv =
4081 CvCONST((const CV *)sref)
4082 ? cv_const_sv((const CV *)sref)
4084 HV * const stash = GvSTASH((const GV *)dstr);
4085 report_redefined_cv(
4088 ? Perl_newSVpvf(aTHX_
4089 "%" HEKf "::%" HEKf,
4090 HEKfARG(HvNAME_HEK(stash)),
4091 HEKfARG(GvENAME_HEK(MUTABLE_GV(dstr))))
4092 : Perl_newSVpvf(aTHX_
4094 HEKfARG(GvENAME_HEK(MUTABLE_GV(dstr))))
4097 CvCONST((const CV *)sref) ? &new_const_sv : NULL
4101 cv_ckproto_len_flags(cv, (const GV *)dstr,
4102 SvPOK(sref) ? CvPROTO(sref) : NULL,
4103 SvPOK(sref) ? CvPROTOLEN(sref) : 0,
4104 SvPOK(sref) ? SvUTF8(sref) : 0);
4106 GvCVGEN(dstr) = 0; /* Switch off cacheness. */
4107 GvASSUMECV_on(dstr);
4108 if(GvSTASH(dstr)) { /* sub foo { 1 } sub bar { 2 } *bar = \&foo */
4109 if (intro && GvREFCNT(dstr) > 1) {
4110 /* temporary remove extra savestack's ref */
4112 gv_method_changed(dstr);
4115 else gv_method_changed(dstr);
4118 *location = SvREFCNT_inc_simple_NN(sref);
4119 if (import_flag && !(GvFLAGS(dstr) & import_flag)
4120 && CopSTASH_ne(PL_curcop, GvSTASH(dstr))) {
4121 GvFLAGS(dstr) |= import_flag;
4124 if (stype == SVt_PVHV) {
4125 const char * const name = GvNAME((GV*)dstr);
4126 const STRLEN len = GvNAMELEN(dstr);
4129 (len > 1 && name[len-2] == ':' && name[len-1] == ':')
4130 || (len == 1 && name[0] == ':')
4132 && (!dref || HvENAME_get(dref))
4135 (HV *)sref, (HV *)dref,
4141 stype == SVt_PVAV && sref != dref
4142 && strEQ(GvNAME((GV*)dstr), "ISA")
4143 /* The stash may have been detached from the symbol table, so
4144 check its name before doing anything. */
4145 && GvSTASH(dstr) && HvENAME(GvSTASH(dstr))
4148 MAGIC * const omg = dref && SvSMAGICAL(dref)
4149 ? mg_find(dref, PERL_MAGIC_isa)
4151 if (SvSMAGICAL(sref) && (mg = mg_find(sref, PERL_MAGIC_isa))) {
4152 if (SvTYPE(mg->mg_obj) != SVt_PVAV) {
4153 AV * const ary = newAV();
4154 av_push(ary, mg->mg_obj); /* takes the refcount */
4155 mg->mg_obj = (SV *)ary;
4158 if (SvTYPE(omg->mg_obj) == SVt_PVAV) {
4159 SV **svp = AvARRAY((AV *)omg->mg_obj);
4160 I32 items = AvFILLp((AV *)omg->mg_obj) + 1;
4164 SvREFCNT_inc_simple_NN(*svp++)
4170 SvREFCNT_inc_simple_NN(omg->mg_obj)
4174 av_push((AV *)mg->mg_obj,SvREFCNT_inc_simple_NN(dstr));
4180 sref, omg ? omg->mg_obj : dstr, PERL_MAGIC_isa, NULL, 0
4182 for (i = 0; i <= AvFILL(sref); ++i) {
4183 SV **elem = av_fetch ((AV*)sref, i, 0);
4186 *elem, sref, PERL_MAGIC_isaelem, NULL, i
4190 mg = mg_find(sref, PERL_MAGIC_isa);
4192 /* Since the *ISA assignment could have affected more than
4193 one stash, don't call mro_isa_changed_in directly, but let
4194 magic_clearisa do it for us, as it already has the logic for
4195 dealing with globs vs arrays of globs. */
4197 Perl_magic_clearisa(aTHX_ NULL, mg);
4199 else if (stype == SVt_PVIO) {
4200 DEBUG_o(Perl_deb(aTHX_ "gv_setref clearing PL_stashcache\n"));
4201 /* It's a cache. It will rebuild itself quite happily.
4202 It's a lot of effort to work out exactly which key (or keys)
4203 might be invalidated by the creation of the this file handle.
4205 hv_clear(PL_stashcache);
4209 if (!intro) SvREFCNT_dec(dref);
4210 if (SvTAINTED(sstr))
4218 #ifdef PERL_DEBUG_READONLY_COW
4219 # include <sys/mman.h>
4221 # ifndef PERL_MEMORY_DEBUG_HEADER_SIZE
4222 # define PERL_MEMORY_DEBUG_HEADER_SIZE 0
4226 Perl_sv_buf_to_ro(pTHX_ SV *sv)
4228 struct perl_memory_debug_header * const header =
4229 (struct perl_memory_debug_header *)(SvPVX(sv)-PERL_MEMORY_DEBUG_HEADER_SIZE);
4230 const MEM_SIZE len = header->size;
4231 PERL_ARGS_ASSERT_SV_BUF_TO_RO;
4232 # ifdef PERL_TRACK_MEMPOOL
4233 if (!header->readonly) header->readonly = 1;
4235 if (mprotect(header, len, PROT_READ))
4236 Perl_warn(aTHX_ "mprotect RW for COW string %p %lu failed with %d",
4237 header, len, errno);
4241 S_sv_buf_to_rw(pTHX_ SV *sv)
4243 struct perl_memory_debug_header * const header =
4244 (struct perl_memory_debug_header *)(SvPVX(sv)-PERL_MEMORY_DEBUG_HEADER_SIZE);
4245 const MEM_SIZE len = header->size;
4246 PERL_ARGS_ASSERT_SV_BUF_TO_RW;
4247 if (mprotect(header, len, PROT_READ|PROT_WRITE))
4248 Perl_warn(aTHX_ "mprotect for COW string %p %lu failed with %d",
4249 header, len, errno);
4250 # ifdef PERL_TRACK_MEMPOOL
4251 header->readonly = 0;
4256 # define sv_buf_to_ro(sv) NOOP
4257 # define sv_buf_to_rw(sv) NOOP
4261 Perl_sv_setsv_flags(pTHX_ SV *dstr, SV* sstr, const I32 flags)
4266 unsigned int both_type;
4268 PERL_ARGS_ASSERT_SV_SETSV_FLAGS;
4270 if (UNLIKELY( sstr == dstr ))
4273 if (UNLIKELY( !sstr ))
4274 sstr = &PL_sv_undef;
4276 stype = SvTYPE(sstr);
4277 dtype = SvTYPE(dstr);
4278 both_type = (stype | dtype);
4280 /* with these values, we can check that both SVs are NULL/IV (and not
4281 * freed) just by testing the or'ed types */
4282 STATIC_ASSERT_STMT(SVt_NULL == 0);
4283 STATIC_ASSERT_STMT(SVt_IV == 1);
4284 if (both_type <= 1) {
4285 /* both src and dst are UNDEF/IV/RV, so we can do a lot of
4291 /* minimal subset of SV_CHECK_THINKFIRST_COW_DROP(dstr) */
4292 if (SvREADONLY(dstr))
4293 Perl_croak_no_modify();
4295 if (SvWEAKREF(dstr))
4296 sv_unref_flags(dstr, 0);
4298 old_rv = SvRV(dstr);
4301 assert(!SvGMAGICAL(sstr));
4302 assert(!SvGMAGICAL(dstr));
4304 sflags = SvFLAGS(sstr);
4305 if (sflags & (SVf_IOK|SVf_ROK)) {
4306 SET_SVANY_FOR_BODYLESS_IV(dstr);
4307 new_dflags = SVt_IV;
4309 if (sflags & SVf_ROK) {
4310 dstr->sv_u.svu_rv = SvREFCNT_inc(SvRV(sstr));
4311 new_dflags |= SVf_ROK;
4314 /* both src and dst are <= SVt_IV, so sv_any points to the
4315 * head; so access the head directly
4317 assert( &(sstr->sv_u.svu_iv)
4318 == &(((XPVIV*) SvANY(sstr))->xiv_iv));
4319 assert( &(dstr->sv_u.svu_iv)
4320 == &(((XPVIV*) SvANY(dstr))->xiv_iv));
4321 dstr->sv_u.svu_iv = sstr->sv_u.svu_iv;
4322 new_dflags |= (SVf_IOK|SVp_IOK|(sflags & SVf_IVisUV));
4326 new_dflags = dtype; /* turn off everything except the type */
4328 SvFLAGS(dstr) = new_dflags;
4329 SvREFCNT_dec(old_rv);
4334 if (UNLIKELY(both_type == SVTYPEMASK)) {
4335 if (SvIS_FREED(dstr)) {
4336 Perl_croak(aTHX_ "panic: attempt to copy value %" SVf
4337 " to a freed scalar %p", SVfARG(sstr), (void *)dstr);
4339 if (SvIS_FREED(sstr)) {
4340 Perl_croak(aTHX_ "panic: attempt to copy freed scalar %p to %p",
4341 (void*)sstr, (void*)dstr);
4347 SV_CHECK_THINKFIRST_COW_DROP(dstr);
4348 dtype = SvTYPE(dstr); /* THINKFIRST may have changed type */
4350 /* There's a lot of redundancy below but we're going for speed here */
4355 if (LIKELY( dtype != SVt_PVGV && dtype != SVt_PVLV )) {
4356 (void)SvOK_off(dstr);
4364 /* For performance, we inline promoting to type SVt_IV. */
4365 /* We're starting from SVt_NULL, so provided that define is
4366 * actual 0, we don't have to unset any SV type flags
4367 * to promote to SVt_IV. */
4368 STATIC_ASSERT_STMT(SVt_NULL == 0);
4369 SET_SVANY_FOR_BODYLESS_IV(dstr);
4370 SvFLAGS(dstr) |= SVt_IV;
4374 sv_upgrade(dstr, SVt_PVIV);
4378 goto end_of_first_switch;
4380 (void)SvIOK_only(dstr);
4381 SvIV_set(dstr, SvIVX(sstr));
4384 /* SvTAINTED can only be true if the SV has taint magic, which in
4385 turn means that the SV type is PVMG (or greater). This is the
4386 case statement for SVt_IV, so this cannot be true (whatever gcov
4388 assert(!SvTAINTED(sstr));
4393 if (dtype < SVt_PV && dtype != SVt_IV)
4394 sv_upgrade(dstr, SVt_IV);
4398 if (LIKELY( SvNOK(sstr) )) {
4402 sv_upgrade(dstr, SVt_NV);
4406 sv_upgrade(dstr, SVt_PVNV);
4410 goto end_of_first_switch;
4412 SvNV_set(dstr, SvNVX(sstr));
4413 (void)SvNOK_only(dstr);
4414 /* SvTAINTED can only be true if the SV has taint magic, which in
4415 turn means that the SV type is PVMG (or greater). This is the
4416 case statement for SVt_NV, so this cannot be true (whatever gcov
4418 assert(!SvTAINTED(sstr));
4425 sv_upgrade(dstr, SVt_PV);
4428 if (dtype < SVt_PVIV)
4429 sv_upgrade(dstr, SVt_PVIV);
4432 if (dtype < SVt_PVNV)
4433 sv_upgrade(dstr, SVt_PVNV);
4437 const char * const type = sv_reftype(sstr,0);
4439 /* diag_listed_as: Bizarre copy of %s */
4440 Perl_croak(aTHX_ "Bizarre copy of %s in %s", type, OP_DESC(PL_op));
4442 Perl_croak(aTHX_ "Bizarre copy of %s", type);
4444 NOT_REACHED; /* NOTREACHED */
4448 if (dtype < SVt_REGEXP)
4450 if (dtype >= SVt_PV) {
4456 sv_upgrade(dstr, SVt_REGEXP);
4464 if (SvGMAGICAL(sstr) && (flags & SV_GMAGIC)) {
4466 if (SvTYPE(sstr) != stype)
4467 stype = SvTYPE(sstr);
4469 if (isGV_with_GP(sstr) && dtype <= SVt_PVLV) {
4470 glob_assign_glob(dstr, sstr, dtype);
4473 if (stype == SVt_PVLV)
4475 if (isREGEXP(sstr)) goto upgregexp;
4476 SvUPGRADE(dstr, SVt_PVNV);
4479 SvUPGRADE(dstr, (svtype)stype);
4481 end_of_first_switch:
4483 /* dstr may have been upgraded. */
4484 dtype = SvTYPE(dstr);
4485 sflags = SvFLAGS(sstr);
4487 if (UNLIKELY( dtype == SVt_PVCV )) {
4488 /* Assigning to a subroutine sets the prototype. */
4491 const char *const ptr = SvPV_const(sstr, len);
4493 SvGROW(dstr, len + 1);
4494 Copy(ptr, SvPVX(dstr), len + 1, char);
4495 SvCUR_set(dstr, len);
4497 SvFLAGS(dstr) |= sflags & SVf_UTF8;
4498 CvAUTOLOAD_off(dstr);
4503 else if (UNLIKELY(dtype == SVt_PVAV || dtype == SVt_PVHV
4504 || dtype == SVt_PVFM))
4506 const char * const type = sv_reftype(dstr,0);
4508 /* diag_listed_as: Cannot copy to %s */
4509 Perl_croak(aTHX_ "Cannot copy to %s in %s", type, OP_DESC(PL_op));
4511 Perl_croak(aTHX_ "Cannot copy to %s", type);
4512 } else if (sflags & SVf_ROK) {
4513 if (isGV_with_GP(dstr)
4514 && SvTYPE(SvRV(sstr)) == SVt_PVGV && isGV_with_GP(SvRV(sstr))) {
4517 if (GvIMPORTED(dstr) != GVf_IMPORTED
4518 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
4520 GvIMPORTED_on(dstr);
4525 glob_assign_glob(dstr, sstr, dtype);
4529 if (dtype >= SVt_PV) {
4530 if (isGV_with_GP(dstr)) {
4531 gv_setref(dstr, sstr);
4534 if (SvPVX_const(dstr)) {
4540 (void)SvOK_off(dstr);
4541 SvRV_set(dstr, SvREFCNT_inc(SvRV(sstr)));
4542 SvFLAGS(dstr) |= sflags & SVf_ROK;
4543 assert(!(sflags & SVp_NOK));
4544 assert(!(sflags & SVp_IOK));
4545 assert(!(sflags & SVf_NOK));
4546 assert(!(sflags & SVf_IOK));
4548 else if (isGV_with_GP(dstr)) {
4549 if (!(sflags & SVf_OK)) {
4550 Perl_ck_warner(aTHX_ packWARN(WARN_MISC),
4551 "Undefined value assigned to typeglob");
4554 GV *gv = gv_fetchsv_nomg(sstr, GV_ADD, SVt_PVGV);
4555 if (dstr != (const SV *)gv) {
4556 const char * const name = GvNAME((const GV *)dstr);
4557 const STRLEN len = GvNAMELEN(dstr);
4558 HV *old_stash = NULL;
4559 bool reset_isa = FALSE;
4560 if ((len > 1 && name[len-2] == ':' && name[len-1] == ':')
4561 || (len == 1 && name[0] == ':')) {
4562 /* Set aside the old stash, so we can reset isa caches
4563 on its subclasses. */
4564 if((old_stash = GvHV(dstr))) {
4565 /* Make sure we do not lose it early. */
4566 SvREFCNT_inc_simple_void_NN(
4567 sv_2mortal((SV *)old_stash)
4574 SvREFCNT_inc_simple_void_NN(sv_2mortal(dstr));
4575 gp_free(MUTABLE_GV(dstr));
4577 GvGP_set(dstr, gp_ref(GvGP(gv)));
4580 HV * const stash = GvHV(dstr);
4582 old_stash ? (HV *)HvENAME_get(old_stash) : stash
4592 else if ((dtype == SVt_REGEXP || dtype == SVt_PVLV)
4593 && (stype == SVt_REGEXP || isREGEXP(sstr))) {
4594 reg_temp_copy((REGEXP*)dstr, (REGEXP*)sstr);
4596 else if (sflags & SVp_POK) {
4597 const STRLEN cur = SvCUR(sstr);
4598 const STRLEN len = SvLEN(sstr);
4601 * We have three basic ways to copy the string:
4607 * Which we choose is based on various factors. The following
4608 * things are listed in order of speed, fastest to slowest:
4610 * - Copying a short string
4611 * - Copy-on-write bookkeeping
4613 * - Copying a long string
4615 * We swipe the string (steal the string buffer) if the SV on the
4616 * rhs is about to be freed anyway (TEMP and refcnt==1). This is a
4617 * big win on long strings. It should be a win on short strings if
4618 * SvPVX_const(dstr) has to be allocated. If not, it should not
4619 * slow things down, as SvPVX_const(sstr) would have been freed
4622 * We also steal the buffer from a PADTMP (operator target) if it
4623 * is ‘long enough’. For short strings, a swipe does not help
4624 * here, as it causes more malloc calls the next time the target
4625 * is used. Benchmarks show that even if SvPVX_const(dstr) has to
4626 * be allocated it is still not worth swiping PADTMPs for short
4627 * strings, as the savings here are small.
4629 * If swiping is not an option, then we see whether it is
4630 * worth using copy-on-write. If the lhs already has a buf-
4631 * fer big enough and the string is short, we skip it and fall back
4632 * to method 3, since memcpy is faster for short strings than the
4633 * later bookkeeping overhead that copy-on-write entails.
4635 * If the rhs is not a copy-on-write string yet, then we also
4636 * consider whether the buffer is too large relative to the string
4637 * it holds. Some operations such as readline allocate a large
4638 * buffer in the expectation of reusing it. But turning such into
4639 * a COW buffer is counter-productive because it increases memory
4640 * usage by making readline allocate a new large buffer the sec-
4641 * ond time round. So, if the buffer is too large, again, we use
4644 * Finally, if there is no buffer on the left, or the buffer is too
4645 * small, then we use copy-on-write and make both SVs share the
4650 /* Whichever path we take through the next code, we want this true,
4651 and doing it now facilitates the COW check. */
4652 (void)SvPOK_only(dstr);
4656 /* slated for free anyway (and not COW)? */
4657 (sflags & (SVs_TEMP|SVf_IsCOW)) == SVs_TEMP
4658 /* or a swipable TARG */
4660 (SVs_PADTMP|SVf_READONLY|SVf_PROTECT|SVf_IsCOW))
4662 /* whose buffer is worth stealing */
4663 && CHECK_COWBUF_THRESHOLD(cur,len)
4666 !(sflags & SVf_OOK) && /* and not involved in OOK hack? */
4667 (!(flags & SV_NOSTEAL)) &&
4668 /* and we're allowed to steal temps */
4669 SvREFCNT(sstr) == 1 && /* and no other references to it? */
4670 len) /* and really is a string */
4671 { /* Passes the swipe test. */
4672 if (SvPVX_const(dstr)) /* we know that dtype >= SVt_PV */
4674 SvPV_set(dstr, SvPVX_mutable(sstr));
4675 SvLEN_set(dstr, SvLEN(sstr));
4676 SvCUR_set(dstr, SvCUR(sstr));
4679 (void)SvOK_off(sstr); /* NOTE: nukes most SvFLAGS on sstr */
4680 SvPV_set(sstr, NULL);
4685 else if (flags & SV_COW_SHARED_HASH_KEYS
4687 #ifdef PERL_COPY_ON_WRITE
4690 ( (CHECK_COWBUF_THRESHOLD(cur,len) || SvLEN(dstr) < cur+1)
4691 /* If this is a regular (non-hek) COW, only so
4692 many COW "copies" are possible. */
4693 && CowREFCNT(sstr) != SV_COW_REFCNT_MAX ))
4694 : ( (sflags & CAN_COW_MASK) == CAN_COW_FLAGS
4695 && !(SvFLAGS(dstr) & SVf_BREAK)
4696 && CHECK_COW_THRESHOLD(cur,len) && cur+1 < len
4697 && (CHECK_COWBUF_THRESHOLD(cur,len) || SvLEN(dstr) < cur+1)
4701 && !(SvFLAGS(dstr) & SVf_BREAK)
4704 /* Either it's a shared hash key, or it's suitable for
4707 PerlIO_printf(Perl_debug_log, "Copy on write: sstr --> dstr\n");
4712 if (!(sflags & SVf_IsCOW)) {
4714 CowREFCNT(sstr) = 0;
4717 if (SvPVX_const(dstr)) { /* we know that dtype >= SVt_PV */
4723 if (sflags & SVf_IsCOW) {
4727 SvPV_set(dstr, SvPVX_mutable(sstr));
4732 /* SvIsCOW_shared_hash */
4733 DEBUG_C(PerlIO_printf(Perl_debug_log,
4734 "Copy on write: Sharing hash\n"));
4736 assert (SvTYPE(dstr) >= SVt_PV);
4738 HEK_KEY(share_hek_hek(SvSHARED_HEK_FROM_PV(SvPVX_const(sstr)))));
4740 SvLEN_set(dstr, len);
4741 SvCUR_set(dstr, cur);
4744 /* Failed the swipe test, and we cannot do copy-on-write either.
4745 Have to copy the string. */
4746 SvGROW(dstr, cur + 1); /* inlined from sv_setpvn */
4747 Move(SvPVX_const(sstr),SvPVX(dstr),cur,char);
4748 SvCUR_set(dstr, cur);
4749 *SvEND(dstr) = '\0';
4751 if (sflags & SVp_NOK) {
4752 SvNV_set(dstr, SvNVX(sstr));
4754 if (sflags & SVp_IOK) {
4755 SvIV_set(dstr, SvIVX(sstr));
4756 if (sflags & SVf_IVisUV)
4759 SvFLAGS(dstr) |= sflags & (SVf_IOK|SVp_IOK|SVf_NOK|SVp_NOK|SVf_UTF8);
4761 const MAGIC * const smg = SvVSTRING_mg(sstr);
4763 sv_magic(dstr, NULL, PERL_MAGIC_vstring,
4764 smg->mg_ptr, smg->mg_len);
4765 SvRMAGICAL_on(dstr);
4769 else if (sflags & (SVp_IOK|SVp_NOK)) {
4770 (void)SvOK_off(dstr);
4771 SvFLAGS(dstr) |= sflags & (SVf_IOK|SVp_IOK|SVf_IVisUV|SVf_NOK|SVp_NOK);
4772 if (sflags & SVp_IOK) {
4773 /* XXXX Do we want to set IsUV for IV(ROK)? Be extra safe... */
4774 SvIV_set(dstr, SvIVX(sstr));
4776 if (sflags & SVp_NOK) {
4777 SvNV_set(dstr, SvNVX(sstr));
4781 if (isGV_with_GP(sstr)) {
4782 gv_efullname3(dstr, MUTABLE_GV(sstr), "*");
4785 (void)SvOK_off(dstr);
4787 if (SvTAINTED(sstr))
4793 =for apidoc sv_set_undef
4795 Equivalent to C<sv_setsv(sv, &PL_sv_undef)>, but more efficient.
4796 Doesn't handle set magic.
4798 The perl equivalent is C<$sv = undef;>. Note that it doesn't free any string
4799 buffer, unlike C<undef $sv>.
4801 Introduced in perl 5.25.12.
4807 Perl_sv_set_undef(pTHX_ SV *sv)
4809 U32 type = SvTYPE(sv);
4811 PERL_ARGS_ASSERT_SV_SET_UNDEF;
4813 /* shortcut, NULL, IV, RV */
4815 if (type <= SVt_IV) {
4816 assert(!SvGMAGICAL(sv));
4817 if (SvREADONLY(sv)) {
4818 /* does undeffing PL_sv_undef count as modifying a read-only
4819 * variable? Some XS code does this */
4820 if (sv == &PL_sv_undef)
4822 Perl_croak_no_modify();
4827 sv_unref_flags(sv, 0);
4830 SvFLAGS(sv) = type; /* quickly turn off all flags */
4831 SvREFCNT_dec_NN(rv);
4835 SvFLAGS(sv) = type; /* quickly turn off all flags */
4840 Perl_croak(aTHX_ "panic: attempt to undefine a freed scalar %p",
4843 SV_CHECK_THINKFIRST_COW_DROP(sv);
4845 if (isGV_with_GP(sv))
4846 Perl_ck_warner(aTHX_ packWARN(WARN_MISC),
4847 "Undefined value assigned to typeglob");
4855 =for apidoc sv_setsv_mg
4857 Like C<sv_setsv>, but also handles 'set' magic.
4863 Perl_sv_setsv_mg(pTHX_ SV *const dstr, SV *const sstr)
4865 PERL_ARGS_ASSERT_SV_SETSV_MG;
4867 sv_setsv(dstr,sstr);
4872 # define SVt_COW SVt_PV
4874 Perl_sv_setsv_cow(pTHX_ SV *dstr, SV *sstr)
4876 STRLEN cur = SvCUR(sstr);
4877 STRLEN len = SvLEN(sstr);
4879 #if defined(PERL_DEBUG_READONLY_COW) && defined(PERL_COPY_ON_WRITE)
4880 const bool already = cBOOL(SvIsCOW(sstr));
4883 PERL_ARGS_ASSERT_SV_SETSV_COW;
4886 PerlIO_printf(Perl_debug_log, "Fast copy on write: %p -> %p\n",
4887 (void*)sstr, (void*)dstr);
4894 if (SvTHINKFIRST(dstr))
4895 sv_force_normal_flags(dstr, SV_COW_DROP_PV);
4896 else if (SvPVX_const(dstr))
4897 Safefree(SvPVX_mutable(dstr));
4901 SvUPGRADE(dstr, SVt_COW);
4903 assert (SvPOK(sstr));
4904 assert (SvPOKp(sstr));
4906 if (SvIsCOW(sstr)) {
4908 if (SvLEN(sstr) == 0) {
4909 /* source is a COW shared hash key. */
4910 DEBUG_C(PerlIO_printf(Perl_debug_log,
4911 "Fast copy on write: Sharing hash\n"));
4912 new_pv = HEK_KEY(share_hek_hek(SvSHARED_HEK_FROM_PV(SvPVX_const(sstr))));
4915 assert(SvCUR(sstr)+1 < SvLEN(sstr));
4916 assert(CowREFCNT(sstr) < SV_COW_REFCNT_MAX);
4918 assert ((SvFLAGS(sstr) & CAN_COW_MASK) == CAN_COW_FLAGS);
4919 SvUPGRADE(sstr, SVt_COW);
4921 DEBUG_C(PerlIO_printf(Perl_debug_log,
4922 "Fast copy on write: Converting sstr to COW\n"));
4923 CowREFCNT(sstr) = 0;
4925 # ifdef PERL_DEBUG_READONLY_COW
4926 if (already) sv_buf_to_rw(sstr);
4929 new_pv = SvPVX_mutable(sstr);
4933 SvPV_set(dstr, new_pv);
4934 SvFLAGS(dstr) = (SVt_COW|SVf_POK|SVp_POK|SVf_IsCOW);
4937 SvLEN_set(dstr, len);
4938 SvCUR_set(dstr, cur);
4947 =for apidoc sv_setpv_bufsize
4949 Sets the SV to be a string of cur bytes length, with at least
4950 len bytes available. Ensures that there is a null byte at SvEND.
4951 Returns a char * pointer to the SvPV buffer.
4957 Perl_sv_setpv_bufsize(pTHX_ SV *const sv, const STRLEN cur, const STRLEN len)
4961 PERL_ARGS_ASSERT_SV_SETPV_BUFSIZE;
4963 SV_CHECK_THINKFIRST_COW_DROP(sv);
4964 SvUPGRADE(sv, SVt_PV);
4965 pv = SvGROW(sv, len + 1);
4968 (void)SvPOK_only_UTF8(sv); /* validate pointer */
4971 if (SvTYPE(sv) == SVt_PVCV) CvAUTOLOAD_off(sv);
4976 =for apidoc sv_setpvn
4978 Copies a string (possibly containing embedded C<NUL> characters) into an SV.
4979 The C<len> parameter indicates the number of
4980 bytes to be copied. If the C<ptr> argument is NULL the SV will become
4981 undefined. Does not handle 'set' magic. See C<L</sv_setpvn_mg>>.
4987 Perl_sv_setpvn(pTHX_ SV *const sv, const char *const ptr, const STRLEN len)
4991 PERL_ARGS_ASSERT_SV_SETPVN;
4993 SV_CHECK_THINKFIRST_COW_DROP(sv);
4994 if (isGV_with_GP(sv))
4995 Perl_croak_no_modify();
5001 /* len is STRLEN which is unsigned, need to copy to signed */
5004 Perl_croak(aTHX_ "panic: sv_setpvn called with negative strlen %"
5007 SvUPGRADE(sv, SVt_PV);
5009 dptr = SvGROW(sv, len + 1);
5010 Move(ptr,dptr,len,char);
5013 (void)SvPOK_only_UTF8(sv); /* validate pointer */
5015 if (SvTYPE(sv) == SVt_PVCV) CvAUTOLOAD_off(sv);
5019 =for apidoc sv_setpvn_mg
5021 Like C<sv_setpvn>, but also handles 'set' magic.
5027 Perl_sv_setpvn_mg(pTHX_ SV *const sv, const char *const ptr, const STRLEN len)
5029 PERL_ARGS_ASSERT_SV_SETPVN_MG;
5031 sv_setpvn(sv,ptr,len);
5036 =for apidoc sv_setpv
5038 Copies a string into an SV. The string must be terminated with a C<NUL>
5039 character, and not contain embeded C<NUL>'s.
5040 Does not handle 'set' magic. See C<L</sv_setpv_mg>>.
5046 Perl_sv_setpv(pTHX_ SV *const sv, const char *const ptr)
5050 PERL_ARGS_ASSERT_SV_SETPV;
5052 SV_CHECK_THINKFIRST_COW_DROP(sv);
5058 SvUPGRADE(sv, SVt_PV);
5060 SvGROW(sv, len + 1);
5061 Move(ptr,SvPVX(sv),len+1,char);
5063 (void)SvPOK_only_UTF8(sv); /* validate pointer */
5065 if (SvTYPE(sv) == SVt_PVCV) CvAUTOLOAD_off(sv);
5069 =for apidoc sv_setpv_mg
5071 Like C<sv_setpv>, but also handles 'set' magic.
5077 Perl_sv_setpv_mg(pTHX_ SV *const sv, const char *const ptr)
5079 PERL_ARGS_ASSERT_SV_SETPV_MG;
5086 Perl_sv_sethek(pTHX_ SV *const sv, const HEK *const hek)
5088 PERL_ARGS_ASSERT_SV_SETHEK;
5094 if (HEK_LEN(hek) == HEf_SVKEY) {
5095 sv_setsv(sv, *(SV**)HEK_KEY(hek));
5098 const int flags = HEK_FLAGS(hek);
5099 if (flags & HVhek_WASUTF8) {
5100 STRLEN utf8_len = HEK_LEN(hek);
5101 char *as_utf8 = (char *)bytes_to_utf8((U8*)HEK_KEY(hek), &utf8_len);
5102 sv_usepvn_flags(sv, as_utf8, utf8_len, SV_HAS_TRAILING_NUL);
5105 } else if (flags & HVhek_UNSHARED) {
5106 sv_setpvn(sv, HEK_KEY(hek), HEK_LEN(hek));
5109 else SvUTF8_off(sv);
5113 SV_CHECK_THINKFIRST_COW_DROP(sv);
5114 SvUPGRADE(sv, SVt_PV);
5116 SvPV_set(sv,(char *)HEK_KEY(share_hek_hek(hek)));
5117 SvCUR_set(sv, HEK_LEN(hek));
5123 else SvUTF8_off(sv);
5131 =for apidoc sv_usepvn_flags
5133 Tells an SV to use C<ptr> to find its string value. Normally the
5134 string is stored inside the SV, but sv_usepvn allows the SV to use an
5135 outside string. C<ptr> should point to memory that was allocated
5136 by L<C<Newx>|perlclib/Memory Management and String Handling>. It must be
5137 the start of a C<Newx>-ed block of memory, and not a pointer to the
5138 middle of it (beware of L<C<OOK>|perlguts/Offsets> and copy-on-write),
5139 and not be from a non-C<Newx> memory allocator like C<malloc>. The
5140 string length, C<len>, must be supplied. By default this function
5141 will C<Renew> (i.e. realloc, move) the memory pointed to by C<ptr>,
5142 so that pointer should not be freed or used by the programmer after
5143 giving it to C<sv_usepvn>, and neither should any pointers from "behind"
5144 that pointer (e.g. ptr + 1) be used.
5146 If S<C<flags & SV_SMAGIC>> is true, will call C<SvSETMAGIC>. If
5147 S<C<flags> & SV_HAS_TRAILING_NUL>> is true, then C<ptr[len]> must be C<NUL>,
5149 will be skipped (i.e. the buffer is actually at least 1 byte longer than
5150 C<len>, and already meets the requirements for storing in C<SvPVX>).
5156 Perl_sv_usepvn_flags(pTHX_ SV *const sv, char *ptr, const STRLEN len, const U32 flags)
5160 PERL_ARGS_ASSERT_SV_USEPVN_FLAGS;
5162 SV_CHECK_THINKFIRST_COW_DROP(sv);
5163 SvUPGRADE(sv, SVt_PV);
5166 if (flags & SV_SMAGIC)
5170 if (SvPVX_const(sv))
5174 if (flags & SV_HAS_TRAILING_NUL)
5175 assert(ptr[len] == '\0');
5178 allocate = (flags & SV_HAS_TRAILING_NUL)
5180 #ifdef Perl_safesysmalloc_size
5183 PERL_STRLEN_ROUNDUP(len + 1);
5185 if (flags & SV_HAS_TRAILING_NUL) {
5186 /* It's long enough - do nothing.
5187 Specifically Perl_newCONSTSUB is relying on this. */
5190 /* Force a move to shake out bugs in callers. */
5191 char *new_ptr = (char*)safemalloc(allocate);
5192 Copy(ptr, new_ptr, len, char);
5193 PoisonFree(ptr,len,char);
5197 ptr = (char*) saferealloc (ptr, allocate);
5200 #ifdef Perl_safesysmalloc_size
5201 SvLEN_set(sv, Perl_safesysmalloc_size(ptr));
5203 SvLEN_set(sv, allocate);
5207 if (!(flags & SV_HAS_TRAILING_NUL)) {
5210 (void)SvPOK_only_UTF8(sv); /* validate pointer */
5212 if (flags & SV_SMAGIC)
5218 S_sv_uncow(pTHX_ SV * const sv, const U32 flags)
5220 assert(SvIsCOW(sv));
5223 const char * const pvx = SvPVX_const(sv);
5224 const STRLEN len = SvLEN(sv);
5225 const STRLEN cur = SvCUR(sv);
5228 PerlIO_printf(Perl_debug_log,
5229 "Copy on write: Force normal %ld\n",
5234 # ifdef PERL_COPY_ON_WRITE
5236 /* Must do this first, since the CowREFCNT uses SvPVX and
5237 we need to write to CowREFCNT, or de-RO the whole buffer if we are
5238 the only owner left of the buffer. */
5239 sv_buf_to_rw(sv); /* NOOP if RO-ing not supported */
5241 U8 cowrefcnt = CowREFCNT(sv);
5242 if(cowrefcnt != 0) {
5244 CowREFCNT(sv) = cowrefcnt;
5249 /* Else we are the only owner of the buffer. */
5254 /* This SV doesn't own the buffer, so need to Newx() a new one: */
5259 if (flags & SV_COW_DROP_PV) {
5260 /* OK, so we don't need to copy our buffer. */
5263 SvGROW(sv, cur + 1);
5264 Move(pvx,SvPVX(sv),cur,char);
5270 unshare_hek(SvSHARED_HEK_FROM_PV(pvx));
5277 const char * const pvx = SvPVX_const(sv);
5278 const STRLEN len = SvCUR(sv);
5282 if (flags & SV_COW_DROP_PV) {
5283 /* OK, so we don't need to copy our buffer. */
5286 SvGROW(sv, len + 1);
5287 Move(pvx,SvPVX(sv),len,char);
5290 unshare_hek(SvSHARED_HEK_FROM_PV(pvx));
5297 =for apidoc sv_force_normal_flags
5299 Undo various types of fakery on an SV, where fakery means
5300 "more than" a string: if the PV is a shared string, make
5301 a private copy; if we're a ref, stop refing; if we're a glob, downgrade to
5302 an C<xpvmg>; if we're a copy-on-write scalar, this is the on-write time when
5303 we do the copy, and is also used locally; if this is a
5304 vstring, drop the vstring magic. If C<SV_COW_DROP_PV> is set
5305 then a copy-on-write scalar drops its PV buffer (if any) and becomes
5306 C<SvPOK_off> rather than making a copy. (Used where this
5307 scalar is about to be set to some other value.) In addition,
5308 the C<flags> parameter gets passed to C<sv_unref_flags()>
5309 when unreffing. C<sv_force_normal> calls this function
5310 with flags set to 0.
5312 This function is expected to be used to signal to perl that this SV is
5313 about to be written to, and any extra book-keeping needs to be taken care
5314 of. Hence, it croaks on read-only values.
5320 Perl_sv_force_normal_flags(pTHX_ SV *const sv, const U32 flags)
5322 PERL_ARGS_ASSERT_SV_FORCE_NORMAL_FLAGS;
5325 Perl_croak_no_modify();
5326 else if (SvIsCOW(sv) && LIKELY(SvTYPE(sv) != SVt_PVHV))
5327 S_sv_uncow(aTHX_ sv, flags);
5329 sv_unref_flags(sv, flags);
5330 else if (SvFAKE(sv) && isGV_with_GP(sv))
5331 sv_unglob(sv, flags);
5332 else if (SvFAKE(sv) && isREGEXP(sv)) {
5333 /* Need to downgrade the REGEXP to a simple(r) scalar. This is analogous
5334 to sv_unglob. We only need it here, so inline it. */
5335 const bool islv = SvTYPE(sv) == SVt_PVLV;
5336 const svtype new_type =
5337 islv ? SVt_NULL : SvMAGIC(sv) || SvSTASH(sv) ? SVt_PVMG : SVt_PV;
5338 SV *const temp = newSV_type(new_type);
5339 regexp *const temp_p = ReANY((REGEXP *)sv);
5341 if (new_type == SVt_PVMG) {
5342 SvMAGIC_set(temp, SvMAGIC(sv));
5343 SvMAGIC_set(sv, NULL);
5344 SvSTASH_set(temp, SvSTASH(sv));
5345 SvSTASH_set(sv, NULL);
5347 if (!islv) SvCUR_set(temp, SvCUR(sv));
5348 /* Remember that SvPVX is in the head, not the body. But
5349 RX_WRAPPED is in the body. */
5350 assert(ReANY((REGEXP *)sv)->mother_re);
5351 /* Their buffer is already owned by someone else. */
5352 if (flags & SV_COW_DROP_PV) {
5353 /* SvLEN is already 0. For SVt_REGEXP, we have a brand new
5354 zeroed body. For SVt_PVLV, it should have been set to 0
5355 before turning into a regexp. */
5356 assert(!SvLEN(islv ? sv : temp));
5357 sv->sv_u.svu_pv = 0;
5360 sv->sv_u.svu_pv = savepvn(RX_WRAPPED((REGEXP *)sv), SvCUR(sv));
5361 SvLEN_set(islv ? sv : temp, SvCUR(sv)+1);
5365 /* Now swap the rest of the bodies. */
5369 SvFLAGS(sv) &= ~SVTYPEMASK;
5370 SvFLAGS(sv) |= new_type;
5371 SvANY(sv) = SvANY(temp);
5374 SvFLAGS(temp) &= ~(SVTYPEMASK);
5375 SvFLAGS(temp) |= SVt_REGEXP|SVf_FAKE;
5376 SvANY(temp) = temp_p;
5377 temp->sv_u.svu_rx = (regexp *)temp_p;
5379 SvREFCNT_dec_NN(temp);
5381 else if (SvVOK(sv)) sv_unmagic(sv, PERL_MAGIC_vstring);
5387 Efficient removal of characters from the beginning of the string buffer.
5388 C<SvPOK(sv)>, or at least C<SvPOKp(sv)>, must be true and C<ptr> must be a
5389 pointer to somewhere inside the string buffer. C<ptr> becomes the first
5390 character of the adjusted string. Uses the C<OOK> hack. On return, only
5391 C<SvPOK(sv)> and C<SvPOKp(sv)> among the C<OK> flags will be true.
5393 Beware: after this function returns, C<ptr> and SvPVX_const(sv) may no longer
5394 refer to the same chunk of data.
5396 The unfortunate similarity of this function's name to that of Perl's C<chop>
5397 operator is strictly coincidental. This function works from the left;
5398 C<chop> works from the right.
5404 Perl_sv_chop(pTHX_ SV *const sv, const char *const ptr)
5415 PERL_ARGS_ASSERT_SV_CHOP;
5417 if (!ptr || !SvPOKp(sv))
5419 delta = ptr - SvPVX_const(sv);
5421 /* Nothing to do. */
5424 max_delta = SvLEN(sv) ? SvLEN(sv) : SvCUR(sv);
5425 if (delta > max_delta)
5426 Perl_croak(aTHX_ "panic: sv_chop ptr=%p, start=%p, end=%p",
5427 ptr, SvPVX_const(sv), SvPVX_const(sv) + max_delta);
5428 /* SvPVX(sv) may move in SV_CHECK_THINKFIRST(sv), so don't use ptr any more */
5429 SV_CHECK_THINKFIRST(sv);
5430 SvPOK_only_UTF8(sv);
5433 if (!SvLEN(sv)) { /* make copy of shared string */
5434 const char *pvx = SvPVX_const(sv);
5435 const STRLEN len = SvCUR(sv);
5436 SvGROW(sv, len + 1);
5437 Move(pvx,SvPVX(sv),len,char);
5443 SvOOK_offset(sv, old_delta);
5445 SvLEN_set(sv, SvLEN(sv) - delta);
5446 SvCUR_set(sv, SvCUR(sv) - delta);
5447 SvPV_set(sv, SvPVX(sv) + delta);
5449 p = (U8 *)SvPVX_const(sv);
5452 /* how many bytes were evacuated? we will fill them with sentinel
5453 bytes, except for the part holding the new offset of course. */
5456 evacn += (old_delta < 0x100 ? 1 : 1 + sizeof(STRLEN));
5458 assert(evacn <= delta + old_delta);
5462 /* This sets 'delta' to the accumulated value of all deltas so far */
5466 /* If 'delta' fits in a byte, store it just prior to the new beginning of
5467 * the string; otherwise store a 0 byte there and store 'delta' just prior
5468 * to that, using as many bytes as a STRLEN occupies. Thus it overwrites a
5469 * portion of the chopped part of the string */
5470 if (delta < 0x100) {
5474 p -= sizeof(STRLEN);
5475 Copy((U8*)&delta, p, sizeof(STRLEN), U8);
5479 /* Fill the preceding buffer with sentinals to verify that no-one is
5489 =for apidoc sv_catpvn
5491 Concatenates the string onto the end of the string which is in the SV.
5492 C<len> indicates number of bytes to copy. If the SV has the UTF-8
5493 status set, then the bytes appended should be valid UTF-8.
5494 Handles 'get' magic, but not 'set' magic. See C<L</sv_catpvn_mg>>.
5496 =for apidoc sv_catpvn_flags
5498 Concatenates the string onto the end of the string which is in the SV. The
5499 C<len> indicates number of bytes to copy.
5501 By default, the string appended is assumed to be valid UTF-8 if the SV has
5502 the UTF-8 status set, and a string of bytes otherwise. One can force the
5503 appended string to be interpreted as UTF-8 by supplying the C<SV_CATUTF8>
5504 flag, and as bytes by supplying the C<SV_CATBYTES> flag; the SV or the
5505 string appended will be upgraded to UTF-8 if necessary.
5507 If C<flags> has the C<SV_SMAGIC> bit set, will
5508 C<mg_set> on C<dsv> afterwards if appropriate.
5509 C<sv_catpvn> and C<sv_catpvn_nomg> are implemented
5510 in terms of this function.
5516 Perl_sv_catpvn_flags(pTHX_ SV *const dsv, const char *sstr, const STRLEN slen, const I32 flags)
5519 const char * const dstr = SvPV_force_flags(dsv, dlen, flags);
5521 PERL_ARGS_ASSERT_SV_CATPVN_FLAGS;
5522 assert((flags & (SV_CATBYTES|SV_CATUTF8)) != (SV_CATBYTES|SV_CATUTF8));
5524 if (!(flags & SV_CATBYTES) || !SvUTF8(dsv)) {
5525 if (flags & SV_CATUTF8 && !SvUTF8(dsv)) {
5526 sv_utf8_upgrade_flags_grow(dsv, 0, slen + 1);
5529 else SvGROW(dsv, dlen + slen + 3);
5531 sstr = SvPVX_const(dsv);
5532 Move(sstr, SvPVX(dsv) + dlen, slen, char);
5533 SvCUR_set(dsv, SvCUR(dsv) + slen);
5536 /* We inline bytes_to_utf8, to avoid an extra malloc. */
5537 const char * const send = sstr + slen;
5540 /* Something this code does not account for, which I think is
5541 impossible; it would require the same pv to be treated as
5542 bytes *and* utf8, which would indicate a bug elsewhere. */
5543 assert(sstr != dstr);
5545 SvGROW(dsv, dlen + slen * 2 + 3);
5546 d = (U8 *)SvPVX(dsv) + dlen;
5548 while (sstr < send) {
5549 append_utf8_from_native_byte(*sstr, &d);
5552 SvCUR_set(dsv, d-(const U8 *)SvPVX(dsv));
5555 (void)SvPOK_only_UTF8(dsv); /* validate pointer */
5557 if (flags & SV_SMAGIC)
5562 =for apidoc sv_catsv
5564 Concatenates the string from SV C<ssv> onto the end of the string in SV
5565 C<dsv>. If C<ssv> is null, does nothing; otherwise modifies only C<dsv>.
5566 Handles 'get' magic on both SVs, but no 'set' magic. See C<L</sv_catsv_mg>>
5567 and C<L</sv_catsv_nomg>>.
5569 =for apidoc sv_catsv_flags
5571 Concatenates the string from SV C<ssv> onto the end of the string in SV
5572 C<dsv>. If C<ssv> is null, does nothing; otherwise modifies only C<dsv>.
5573 If C<flags> has the C<SV_GMAGIC> bit set, will call C<mg_get> on both SVs if
5574 appropriate. If C<flags> has the C<SV_SMAGIC> bit set, C<mg_set> will be called on
5575 the modified SV afterward, if appropriate. C<sv_catsv>, C<sv_catsv_nomg>,
5576 and C<sv_catsv_mg> are implemented in terms of this function.
5581 Perl_sv_catsv_flags(pTHX_ SV *const dsv, SV *const ssv, const I32 flags)
5583 PERL_ARGS_ASSERT_SV_CATSV_FLAGS;
5587 const char *spv = SvPV_flags_const(ssv, slen, flags);
5588 if (flags & SV_GMAGIC)
5590 sv_catpvn_flags(dsv, spv, slen,
5591 DO_UTF8(ssv) ? SV_CATUTF8 : SV_CATBYTES);
5592 if (flags & SV_SMAGIC)
5598 =for apidoc sv_catpv
5600 Concatenates the C<NUL>-terminated string onto the end of the string which is
5602 If the SV has the UTF-8 status set, then the bytes appended should be
5603 valid UTF-8. Handles 'get' magic, but not 'set' magic. See
5609 Perl_sv_catpv(pTHX_ SV *const sv, const char *ptr)
5615 PERL_ARGS_ASSERT_SV_CATPV;
5619 junk = SvPV_force(sv, tlen);
5621 SvGROW(sv, tlen + len + 1);
5623 ptr = SvPVX_const(sv);
5624 Move(ptr,SvPVX(sv)+tlen,len+1,char);
5625 SvCUR_set(sv, SvCUR(sv) + len);
5626 (void)SvPOK_only_UTF8(sv); /* validate pointer */
5631 =for apidoc sv_catpv_flags
5633 Concatenates the C<NUL>-terminated string onto the end of the string which is
5635 If the SV has the UTF-8 status set, then the bytes appended should
5636 be valid UTF-8. If C<flags> has the C<SV_SMAGIC> bit set, will C<mg_set>
5637 on the modified SV if appropriate.
5643 Perl_sv_catpv_flags(pTHX_ SV *dstr, const char *sstr, const I32 flags)
5645 PERL_ARGS_ASSERT_SV_CATPV_FLAGS;
5646 sv_catpvn_flags(dstr, sstr, strlen(sstr), flags);
5650 =for apidoc sv_catpv_mg
5652 Like C<sv_catpv>, but also handles 'set' magic.
5658 Perl_sv_catpv_mg(pTHX_ SV *const sv, const char *const ptr)
5660 PERL_ARGS_ASSERT_SV_CATPV_MG;
5669 Creates a new SV. A non-zero C<len> parameter indicates the number of
5670 bytes of preallocated string space the SV should have. An extra byte for a
5671 trailing C<NUL> is also reserved. (C<SvPOK> is not set for the SV even if string
5672 space is allocated.) The reference count for the new SV is set to 1.
5674 In 5.9.3, C<newSV()> replaces the older C<NEWSV()> API, and drops the first
5675 parameter, I<x>, a debug aid which allowed callers to identify themselves.
5676 This aid has been superseded by a new build option, C<PERL_MEM_LOG> (see
5677 L<perlhacktips/PERL_MEM_LOG>). The older API is still there for use in XS
5678 modules supporting older perls.
5684 Perl_newSV(pTHX_ const STRLEN len)
5690 sv_grow(sv, len + 1);
5695 =for apidoc sv_magicext
5697 Adds magic to an SV, upgrading it if necessary. Applies the
5698 supplied C<vtable> and returns a pointer to the magic added.
5700 Note that C<sv_magicext> will allow things that C<sv_magic> will not.
5701 In particular, you can add magic to C<SvREADONLY> SVs, and add more than
5702 one instance of the same C<how>.
5704 If C<namlen> is greater than zero then a C<savepvn> I<copy> of C<name> is
5705 stored, if C<namlen> is zero then C<name> is stored as-is and - as another
5706 special case - if C<(name && namlen == HEf_SVKEY)> then C<name> is assumed
5707 to contain an SV* and is stored as-is with its C<REFCNT> incremented.
5709 (This is now used as a subroutine by C<sv_magic>.)
5714 Perl_sv_magicext(pTHX_ SV *const sv, SV *const obj, const int how,
5715 const MGVTBL *const vtable, const char *const name, const I32 namlen)
5719 PERL_ARGS_ASSERT_SV_MAGICEXT;
5721 SvUPGRADE(sv, SVt_PVMG);
5722 Newxz(mg, 1, MAGIC);
5723 mg->mg_moremagic = SvMAGIC(sv);
5724 SvMAGIC_set(sv, mg);
5726 /* Sometimes a magic contains a reference loop, where the sv and
5727 object refer to each other. To prevent a reference loop that
5728 would prevent such objects being freed, we look for such loops
5729 and if we find one we avoid incrementing the object refcount.
5731 Note we cannot do this to avoid self-tie loops as intervening RV must
5732 have its REFCNT incremented to keep it in existence.
5735 if (!obj || obj == sv ||
5736 how == PERL_MAGIC_arylen ||
5737 how == PERL_MAGIC_regdata ||
5738 how == PERL_MAGIC_regdatum ||
5739 how == PERL_MAGIC_symtab ||
5740 (SvTYPE(obj) == SVt_PVGV &&
5741 (GvSV(obj) == sv || GvHV(obj) == (const HV *)sv
5742 || GvAV(obj) == (const AV *)sv || GvCV(obj) == (const CV *)sv
5743 || GvIOp(obj) == (const IO *)sv || GvFORM(obj) == (const CV *)sv)))
5748 mg->mg_obj = SvREFCNT_inc_simple(obj);
5749 mg->mg_flags |= MGf_REFCOUNTED;
5752 /* Normal self-ties simply pass a null object, and instead of
5753 using mg_obj directly, use the SvTIED_obj macro to produce a
5754 new RV as needed. For glob "self-ties", we are tieing the PVIO
5755 with an RV obj pointing to the glob containing the PVIO. In
5756 this case, to avoid a reference loop, we need to weaken the
5760 if (how == PERL_MAGIC_tiedscalar && SvTYPE(sv) == SVt_PVIO &&
5761 obj && SvROK(obj) && GvIO(SvRV(obj)) == (const IO *)sv)
5767 mg->mg_len = namlen;
5770 mg->mg_ptr = savepvn(name, namlen);
5771 else if (namlen == HEf_SVKEY) {
5772 /* Yes, this is casting away const. This is only for the case of
5773 HEf_SVKEY. I think we need to document this aberation of the
5774 constness of the API, rather than making name non-const, as
5775 that change propagating outwards a long way. */
5776 mg->mg_ptr = (char*)SvREFCNT_inc_simple_NN((SV *)name);
5778 mg->mg_ptr = (char *) name;
5780 mg->mg_virtual = (MGVTBL *) vtable;
5787 Perl_sv_magicext_mglob(pTHX_ SV *sv)
5789 PERL_ARGS_ASSERT_SV_MAGICEXT_MGLOB;
5790 if (SvTYPE(sv) == SVt_PVLV && LvTYPE(sv) == 'y') {
5791 /* This sv is only a delegate. //g magic must be attached to
5796 return sv_magicext(sv, NULL, PERL_MAGIC_regex_global,
5797 &PL_vtbl_mglob, 0, 0);
5801 =for apidoc sv_magic
5803 Adds magic to an SV. First upgrades C<sv> to type C<SVt_PVMG> if
5804 necessary, then adds a new magic item of type C<how> to the head of the
5807 See C<L</sv_magicext>> (which C<sv_magic> now calls) for a description of the
5808 handling of the C<name> and C<namlen> arguments.
5810 You need to use C<sv_magicext> to add magic to C<SvREADONLY> SVs and also
5811 to add more than one instance of the same C<how>.
5817 Perl_sv_magic(pTHX_ SV *const sv, SV *const obj, const int how,
5818 const char *const name, const I32 namlen)
5820 const MGVTBL *vtable;
5823 unsigned int vtable_index;
5825 PERL_ARGS_ASSERT_SV_MAGIC;
5827 if (how < 0 || (unsigned)how >= C_ARRAY_LENGTH(PL_magic_data)
5828 || ((flags = PL_magic_data[how]),
5829 (vtable_index = flags & PERL_MAGIC_VTABLE_MASK)
5830 > magic_vtable_max))
5831 Perl_croak(aTHX_ "Don't know how to handle magic of type \\%o", how);
5833 /* PERL_MAGIC_ext is reserved for use by extensions not perl internals.
5834 Useful for attaching extension internal data to perl vars.
5835 Note that multiple extensions may clash if magical scalars
5836 etc holding private data from one are passed to another. */
5838 vtable = (vtable_index == magic_vtable_max)
5839 ? NULL : PL_magic_vtables + vtable_index;
5841 if (SvREADONLY(sv)) {
5843 !PERL_MAGIC_TYPE_READONLY_ACCEPTABLE(how)
5846 Perl_croak_no_modify();
5849 if (SvMAGICAL(sv) || (how == PERL_MAGIC_taint && SvTYPE(sv) >= SVt_PVMG)) {
5850 if (SvMAGIC(sv) && (mg = mg_find(sv, how))) {
5851 /* sv_magic() refuses to add a magic of the same 'how' as an
5854 if (how == PERL_MAGIC_taint)
5860 /* Force pos to be stored as characters, not bytes. */
5861 if (SvMAGICAL(sv) && DO_UTF8(sv)
5862 && (mg = mg_find(sv, PERL_MAGIC_regex_global))
5864 && mg->mg_flags & MGf_BYTES) {
5865 mg->mg_len = (SSize_t)sv_pos_b2u_flags(sv, (STRLEN)mg->mg_len,
5867 mg->mg_flags &= ~MGf_BYTES;
5870 /* Rest of work is done else where */
5871 mg = sv_magicext(sv,obj,how,vtable,name,namlen);
5874 case PERL_MAGIC_taint:
5877 case PERL_MAGIC_ext:
5878 case PERL_MAGIC_dbfile:
5885 S_sv_unmagicext_flags(pTHX_ SV *const sv, const int type, MGVTBL *vtbl, const U32 flags)
5892 if (SvTYPE(sv) < SVt_PVMG || !SvMAGIC(sv))
5894 mgp = &(((XPVMG*) SvANY(sv))->xmg_u.xmg_magic);
5895 for (mg = *mgp; mg; mg = *mgp) {
5896 const MGVTBL* const virt = mg->mg_virtual;
5897 if (mg->mg_type == type && (!flags || virt == vtbl)) {
5898 *mgp = mg->mg_moremagic;
5899 if (virt && virt->svt_free)
5900 virt->svt_free(aTHX_ sv, mg);
5901 if (mg->mg_ptr && mg->mg_type != PERL_MAGIC_regex_global) {
5903 Safefree(mg->mg_ptr);
5904 else if (mg->mg_len == HEf_SVKEY)
5905 SvREFCNT_dec(MUTABLE_SV(mg->mg_ptr));
5906 else if (mg->mg_type == PERL_MAGIC_utf8)
5907 Safefree(mg->mg_ptr);
5909 if (mg->mg_flags & MGf_REFCOUNTED)
5910 SvREFCNT_dec(mg->mg_obj);
5914 mgp = &mg->mg_moremagic;
5917 if (SvMAGICAL(sv)) /* if we're under save_magic, wait for restore_magic; */
5918 mg_magical(sv); /* else fix the flags now */
5927 =for apidoc sv_unmagic
5929 Removes all magic of type C<type> from an SV.
5935 Perl_sv_unmagic(pTHX_ SV *const sv, const int type)
5937 PERL_ARGS_ASSERT_SV_UNMAGIC;
5938 return S_sv_unmagicext_flags(aTHX_ sv, type, NULL, 0);
5942 =for apidoc sv_unmagicext
5944 Removes all magic of type C<type> with the specified C<vtbl> from an SV.
5950 Perl_sv_unmagicext(pTHX_ SV *const sv, const int type, MGVTBL *vtbl)
5952 PERL_ARGS_ASSERT_SV_UNMAGICEXT;
5953 return S_sv_unmagicext_flags(aTHX_ sv, type, vtbl, 1);
5957 =for apidoc sv_rvweaken
5959 Weaken a reference: set the C<SvWEAKREF> flag on this RV; give the
5960 referred-to SV C<PERL_MAGIC_backref> magic if it hasn't already; and
5961 push a back-reference to this RV onto the array of backreferences
5962 associated with that magic. If the RV is magical, set magic will be
5963 called after the RV is cleared.
5969 Perl_sv_rvweaken(pTHX_ SV *const sv)
5973 PERL_ARGS_ASSERT_SV_RVWEAKEN;
5975 if (!SvOK(sv)) /* let undefs pass */
5978 Perl_croak(aTHX_ "Can't weaken a nonreference");
5979 else if (SvWEAKREF(sv)) {
5980 Perl_ck_warner(aTHX_ packWARN(WARN_MISC), "Reference is already weak");
5983 else if (SvREADONLY(sv)) croak_no_modify();
5985 Perl_sv_add_backref(aTHX_ tsv, sv);
5987 SvREFCNT_dec_NN(tsv);
5992 =for apidoc sv_get_backrefs
5994 If C<sv> is the target of a weak reference then it returns the back
5995 references structure associated with the sv; otherwise return C<NULL>.
5997 When returning a non-null result the type of the return is relevant. If it
5998 is an AV then the elements of the AV are the weak reference RVs which
5999 point at this item. If it is any other type then the item itself is the
6002 See also C<Perl_sv_add_backref()>, C<Perl_sv_del_backref()>,
6003 C<Perl_sv_kill_backrefs()>
6009 Perl_sv_get_backrefs(SV *const sv)
6013 PERL_ARGS_ASSERT_SV_GET_BACKREFS;
6015 /* find slot to store array or singleton backref */
6017 if (SvTYPE(sv) == SVt_PVHV) {
6019 struct xpvhv_aux * const iter = HvAUX((HV *)sv);
6020 backrefs = (SV *)iter->xhv_backreferences;
6022 } else if (SvMAGICAL(sv)) {
6023 MAGIC *mg = mg_find(sv, PERL_MAGIC_backref);
6025 backrefs = mg->mg_obj;
6030 /* Give tsv backref magic if it hasn't already got it, then push a
6031 * back-reference to sv onto the array associated with the backref magic.
6033 * As an optimisation, if there's only one backref and it's not an AV,
6034 * store it directly in the HvAUX or mg_obj slot, avoiding the need to
6035 * allocate an AV. (Whether the slot holds an AV tells us whether this is
6039 /* A discussion about the backreferences array and its refcount:
6041 * The AV holding the backreferences is pointed to either as the mg_obj of
6042 * PERL_MAGIC_backref, or in the specific case of a HV, from the
6043 * xhv_backreferences field. The array is created with a refcount
6044 * of 2. This means that if during global destruction the array gets
6045 * picked on before its parent to have its refcount decremented by the
6046 * random zapper, it won't actually be freed, meaning it's still there for
6047 * when its parent gets freed.
6049 * When the parent SV is freed, the extra ref is killed by
6050 * Perl_sv_kill_backrefs. The other ref is killed, in the case of magic,
6051 * by mg_free() / MGf_REFCOUNTED, or for a hash, by Perl_hv_kill_backrefs.
6053 * When a single backref SV is stored directly, it is not reference
6058 Perl_sv_add_backref(pTHX_ SV *const tsv, SV *const sv)
6064 PERL_ARGS_ASSERT_SV_ADD_BACKREF;
6066 /* find slot to store array or singleton backref */
6068 if (SvTYPE(tsv) == SVt_PVHV) {
6069 svp = (SV**)Perl_hv_backreferences_p(aTHX_ MUTABLE_HV(tsv));
6072 mg = mg_find(tsv, PERL_MAGIC_backref);
6074 mg = sv_magicext(tsv, NULL, PERL_MAGIC_backref, &PL_vtbl_backref, NULL, 0);
6075 svp = &(mg->mg_obj);
6078 /* create or retrieve the array */
6080 if ( (!*svp && SvTYPE(sv) == SVt_PVAV)
6081 || (*svp && SvTYPE(*svp) != SVt_PVAV)
6085 mg->mg_flags |= MGf_REFCOUNTED;
6088 SvREFCNT_inc_simple_void_NN(av);
6089 /* av now has a refcnt of 2; see discussion above */
6090 av_extend(av, *svp ? 2 : 1);
6092 /* move single existing backref to the array */
6093 AvARRAY(av)[++AvFILLp(av)] = *svp; /* av_push() */
6098 av = MUTABLE_AV(*svp);
6100 /* optimisation: store single backref directly in HvAUX or mg_obj */
6104 assert(SvTYPE(av) == SVt_PVAV);
6105 if (AvFILLp(av) >= AvMAX(av)) {
6106 av_extend(av, AvFILLp(av)+1);
6109 /* push new backref */
6110 AvARRAY(av)[++AvFILLp(av)] = sv; /* av_push() */
6113 /* delete a back-reference to ourselves from the backref magic associated
6114 * with the SV we point to.
6118 Perl_sv_del_backref(pTHX_ SV *const tsv, SV *const sv)
6122 PERL_ARGS_ASSERT_SV_DEL_BACKREF;
6124 if (SvTYPE(tsv) == SVt_PVHV) {
6126 svp = (SV**)Perl_hv_backreferences_p(aTHX_ MUTABLE_HV(tsv));
6128 else if (SvIS_FREED(tsv) && PL_phase == PERL_PHASE_DESTRUCT) {
6129 /* It's possible for the the last (strong) reference to tsv to have
6130 become freed *before* the last thing holding a weak reference.
6131 If both survive longer than the backreferences array, then when
6132 the referent's reference count drops to 0 and it is freed, it's
6133 not able to chase the backreferences, so they aren't NULLed.
6135 For example, a CV holds a weak reference to its stash. If both the
6136 CV and the stash survive longer than the backreferences array,
6137 and the CV gets picked for the SvBREAK() treatment first,
6138 *and* it turns out that the stash is only being kept alive because
6139 of an our variable in the pad of the CV, then midway during CV
6140 destruction the stash gets freed, but CvSTASH() isn't set to NULL.
6141 It ends up pointing to the freed HV. Hence it's chased in here, and
6142 if this block wasn't here, it would hit the !svp panic just below.
6144 I don't believe that "better" destruction ordering is going to help
6145 here - during global destruction there's always going to be the
6146 chance that something goes out of order. We've tried to make it
6147 foolproof before, and it only resulted in evolutionary pressure on
6148 fools. Which made us look foolish for our hubris. :-(
6154 = SvMAGICAL(tsv) ? mg_find(tsv, PERL_MAGIC_backref) : NULL;
6155 svp = mg ? &(mg->mg_obj) : NULL;
6159 Perl_croak(aTHX_ "panic: del_backref, svp=0");
6161 /* It's possible that sv is being freed recursively part way through the
6162 freeing of tsv. If this happens, the backreferences array of tsv has
6163 already been freed, and so svp will be NULL. If this is the case,
6164 we should not panic. Instead, nothing needs doing, so return. */
6165 if (PL_phase == PERL_PHASE_DESTRUCT && SvREFCNT(tsv) == 0)
6167 Perl_croak(aTHX_ "panic: del_backref, *svp=%p phase=%s refcnt=%" UVuf,
6168 (void*)*svp, PL_phase_names[PL_phase], (UV)SvREFCNT(tsv));
6171 if (SvTYPE(*svp) == SVt_PVAV) {
6175 AV * const av = (AV*)*svp;
6177 assert(!SvIS_FREED(av));
6181 /* for an SV with N weak references to it, if all those
6182 * weak refs are deleted, then sv_del_backref will be called
6183 * N times and O(N^2) compares will be done within the backref
6184 * array. To ameliorate this potential slowness, we:
6185 * 1) make sure this code is as tight as possible;
6186 * 2) when looking for SV, look for it at both the head and tail of the
6187 * array first before searching the rest, since some create/destroy
6188 * patterns will cause the backrefs to be freed in order.
6195 SV **p = &svp[fill];
6196 SV *const topsv = *p;
6203 /* We weren't the last entry.
6204 An unordered list has this property that you
6205 can take the last element off the end to fill
6206 the hole, and it's still an unordered list :-)
6212 break; /* should only be one */
6219 AvFILLp(av) = fill-1;
6221 else if (SvIS_FREED(*svp) && PL_phase == PERL_PHASE_DESTRUCT) {
6222 /* freed AV; skip */
6225 /* optimisation: only a single backref, stored directly */
6227 Perl_croak(aTHX_ "panic: del_backref, *svp=%p, sv=%p",
6228 (void*)*svp, (void*)sv);
6235 Perl_sv_kill_backrefs(pTHX_ SV *const sv, AV *const av)
6241 PERL_ARGS_ASSERT_SV_KILL_BACKREFS;
6246 /* after multiple passes through Perl_sv_clean_all() for a thingy
6247 * that has badly leaked, the backref array may have gotten freed,
6248 * since we only protect it against 1 round of cleanup */
6249 if (SvIS_FREED(av)) {
6250 if (PL_in_clean_all) /* All is fair */
6253 "panic: magic_killbackrefs (freed backref AV/SV)");
6257 is_array = (SvTYPE(av) == SVt_PVAV);
6259 assert(!SvIS_FREED(av));
6262 last = svp + AvFILLp(av);
6265 /* optimisation: only a single backref, stored directly */
6271 while (svp <= last) {
6273 SV *const referrer = *svp;
6274 if (SvWEAKREF(referrer)) {
6275 /* XXX Should we check that it hasn't changed? */
6276 assert(SvROK(referrer));
6277 SvRV_set(referrer, 0);
6279 SvWEAKREF_off(referrer);
6280 SvSETMAGIC(referrer);
6281 } else if (SvTYPE(referrer) == SVt_PVGV ||
6282 SvTYPE(referrer) == SVt_PVLV) {
6283 assert(SvTYPE(sv) == SVt_PVHV); /* stash backref */
6284 /* You lookin' at me? */
6285 assert(GvSTASH(referrer));
6286 assert(GvSTASH(referrer) == (const HV *)sv);
6287 GvSTASH(referrer) = 0;
6288 } else if (SvTYPE(referrer) == SVt_PVCV ||
6289 SvTYPE(referrer) == SVt_PVFM) {
6290 if (SvTYPE(sv) == SVt_PVHV) { /* stash backref */
6291 /* You lookin' at me? */
6292 assert(CvSTASH(referrer));
6293 assert(CvSTASH(referrer) == (const HV *)sv);
6294 SvANY(MUTABLE_CV(referrer))->xcv_stash = 0;
6297 assert(SvTYPE(sv) == SVt_PVGV);
6298 /* You lookin' at me? */
6299 assert(CvGV(referrer));
6300 assert(CvGV(referrer) == (const GV *)sv);
6301 anonymise_cv_maybe(MUTABLE_GV(sv),
6302 MUTABLE_CV(referrer));
6307 "panic: magic_killbackrefs (flags=%" UVxf ")",
6308 (UV)SvFLAGS(referrer));
6319 SvREFCNT_dec_NN(av); /* remove extra count added by sv_add_backref() */
6325 =for apidoc sv_insert
6327 Inserts a string at the specified offset/length within the SV. Similar to
6328 the Perl C<substr()> function. Handles get magic.
6330 =for apidoc sv_insert_flags
6332 Same as C<sv_insert>, but the extra C<flags> are passed to the
6333 C<SvPV_force_flags> that applies to C<bigstr>.
6339 Perl_sv_insert_flags(pTHX_ SV *const bigstr, const STRLEN offset, const STRLEN len, const char *little, const STRLEN littlelen, const U32 flags)
6345 SSize_t i; /* better be sizeof(STRLEN) or bad things happen */
6348 PERL_ARGS_ASSERT_SV_INSERT_FLAGS;
6350 SvPV_force_flags(bigstr, curlen, flags);
6351 (void)SvPOK_only_UTF8(bigstr);
6353 if (little >= SvPVX(bigstr) &&
6354 little < SvPVX(bigstr) + (SvLEN(bigstr) ? SvLEN(bigstr) : SvCUR(bigstr))) {
6355 /* little is a pointer to within bigstr, since we can reallocate bigstr,
6356 or little...little+littlelen might overlap offset...offset+len we make a copy
6358 little = savepvn(little, littlelen);
6362 if (offset + len > curlen) {
6363 SvGROW(bigstr, offset+len+1);
6364 Zero(SvPVX(bigstr)+curlen, offset+len-curlen, char);
6365 SvCUR_set(bigstr, offset+len);
6369 i = littlelen - len;
6370 if (i > 0) { /* string might grow */
6371 big = SvGROW(bigstr, SvCUR(bigstr) + i + 1);
6372 mid = big + offset + len;
6373 midend = bigend = big + SvCUR(bigstr);
6376 while (midend > mid) /* shove everything down */
6377 *--bigend = *--midend;
6378 Move(little,big+offset,littlelen,char);
6379 SvCUR_set(bigstr, SvCUR(bigstr) + i);
6384 Move(little,SvPVX(bigstr)+offset,len,char);
6389 big = SvPVX(bigstr);
6392 bigend = big + SvCUR(bigstr);
6394 if (midend > bigend)
6395 Perl_croak(aTHX_ "panic: sv_insert, midend=%p, bigend=%p",
6398 if (mid - big > bigend - midend) { /* faster to shorten from end */
6400 Move(little, mid, littlelen,char);
6403 i = bigend - midend;
6405 Move(midend, mid, i,char);
6409 SvCUR_set(bigstr, mid - big);
6411 else if ((i = mid - big)) { /* faster from front */
6412 midend -= littlelen;
6414 Move(big, midend - i, i, char);
6415 sv_chop(bigstr,midend-i);
6417 Move(little, mid, littlelen,char);
6419 else if (littlelen) {
6420 midend -= littlelen;
6421 sv_chop(bigstr,midend);
6422 Move(little,midend,littlelen,char);
6425 sv_chop(bigstr,midend);
6431 =for apidoc sv_replace
6433 Make the first argument a copy of the second, then delete the original.
6434 The target SV physically takes over ownership of the body of the source SV
6435 and inherits its flags; however, the target keeps any magic it owns,
6436 and any magic in the source is discarded.
6437 Note that this is a rather specialist SV copying operation; most of the
6438 time you'll want to use C<sv_setsv> or one of its many macro front-ends.
6444 Perl_sv_replace(pTHX_ SV *const sv, SV *const nsv)
6446 const U32 refcnt = SvREFCNT(sv);
6448 PERL_ARGS_ASSERT_SV_REPLACE;
6450 SV_CHECK_THINKFIRST_COW_DROP(sv);
6451 if (SvREFCNT(nsv) != 1) {
6452 Perl_croak(aTHX_ "panic: reference miscount on nsv in sv_replace()"
6453 " (%" UVuf " != 1)", (UV) SvREFCNT(nsv));
6455 if (SvMAGICAL(sv)) {
6459 sv_upgrade(nsv, SVt_PVMG);
6460 SvMAGIC_set(nsv, SvMAGIC(sv));
6461 SvFLAGS(nsv) |= SvMAGICAL(sv);
6463 SvMAGIC_set(sv, NULL);
6467 assert(!SvREFCNT(sv));
6468 #ifdef DEBUG_LEAKING_SCALARS
6469 sv->sv_flags = nsv->sv_flags;
6470 sv->sv_any = nsv->sv_any;
6471 sv->sv_refcnt = nsv->sv_refcnt;
6472 sv->sv_u = nsv->sv_u;
6474 StructCopy(nsv,sv,SV);
6476 if(SvTYPE(sv) == SVt_IV) {
6477 SET_SVANY_FOR_BODYLESS_IV(sv);
6481 SvREFCNT(sv) = refcnt;
6482 SvFLAGS(nsv) |= SVTYPEMASK; /* Mark as freed */
6487 /* We're about to free a GV which has a CV that refers back to us.
6488 * If that CV will outlive us, make it anonymous (i.e. fix up its CvGV
6492 S_anonymise_cv_maybe(pTHX_ GV *gv, CV* cv)
6497 PERL_ARGS_ASSERT_ANONYMISE_CV_MAYBE;
6500 assert(SvREFCNT(gv) == 0);
6501 assert(isGV(gv) && isGV_with_GP(gv));
6503 assert(!CvANON(cv));
6504 assert(CvGV(cv) == gv);
6505 assert(!CvNAMED(cv));
6507 /* will the CV shortly be freed by gp_free() ? */
6508 if (GvCV(gv) == cv && GvGP(gv)->gp_refcnt < 2 && SvREFCNT(cv) < 2) {
6509 SvANY(cv)->xcv_gv_u.xcv_gv = NULL;
6513 /* if not, anonymise: */
6514 gvname = (GvSTASH(gv) && HvNAME(GvSTASH(gv)) && HvENAME(GvSTASH(gv)))
6515 ? newSVhek(HvENAME_HEK(GvSTASH(gv)))
6516 : newSVpvn_flags( "__ANON__", 8, 0 );
6517 sv_catpvs(gvname, "::__ANON__");
6518 anongv = gv_fetchsv(gvname, GV_ADDMULTI, SVt_PVCV);
6519 SvREFCNT_dec_NN(gvname);
6523 SvANY(cv)->xcv_gv_u.xcv_gv = MUTABLE_GV(SvREFCNT_inc(anongv));
6528 =for apidoc sv_clear
6530 Clear an SV: call any destructors, free up any memory used by the body,
6531 and free the body itself. The SV's head is I<not> freed, although
6532 its type is set to all 1's so that it won't inadvertently be assumed
6533 to be live during global destruction etc.
6534 This function should only be called when C<REFCNT> is zero. Most of the time
6535 you'll want to call C<sv_free()> (or its macro wrapper C<SvREFCNT_dec>)
6542 Perl_sv_clear(pTHX_ SV *const orig_sv)
6547 const struct body_details *sv_type_details;
6551 STRLEN hash_index = 0; /* initialise to make Coverity et al happy.
6552 Not strictly necessary */
6554 PERL_ARGS_ASSERT_SV_CLEAR;
6556 /* within this loop, sv is the SV currently being freed, and
6557 * iter_sv is the most recent AV or whatever that's being iterated
6558 * over to provide more SVs */
6564 assert(SvREFCNT(sv) == 0);
6565 assert(SvTYPE(sv) != (svtype)SVTYPEMASK);
6567 if (type <= SVt_IV) {
6568 /* See the comment in sv.h about the collusion between this
6569 * early return and the overloading of the NULL slots in the
6573 SvFLAGS(sv) &= SVf_BREAK;
6574 SvFLAGS(sv) |= SVTYPEMASK;
6578 /* objs are always >= MG, but pad names use the SVs_OBJECT flag
6579 for another purpose */
6580 assert(!SvOBJECT(sv) || type >= SVt_PVMG);
6582 if (type >= SVt_PVMG) {
6584 if (!curse(sv, 1)) goto get_next_sv;
6585 type = SvTYPE(sv); /* destructor may have changed it */
6587 /* Free back-references before magic, in case the magic calls
6588 * Perl code that has weak references to sv. */
6589 if (type == SVt_PVHV) {
6590 Perl_hv_kill_backrefs(aTHX_ MUTABLE_HV(sv));
6594 else if (SvMAGIC(sv)) {
6595 /* Free back-references before other types of magic. */
6596 sv_unmagic(sv, PERL_MAGIC_backref);
6602 /* case SVt_INVLIST: */
6605 IoIFP(sv) != PerlIO_stdin() &&
6606 IoIFP(sv) != PerlIO_stdout() &&
6607 IoIFP(sv) != PerlIO_stderr() &&
6608 !(IoFLAGS(sv) & IOf_FAKE_DIRP))
6610 io_close(MUTABLE_IO(sv), NULL, FALSE,
6611 (IoTYPE(sv) == IoTYPE_WRONLY ||
6612 IoTYPE(sv) == IoTYPE_RDWR ||
6613 IoTYPE(sv) == IoTYPE_APPEND));
6615 if (IoDIRP(sv) && !(IoFLAGS(sv) & IOf_FAKE_DIRP))
6616 PerlDir_close(IoDIRP(sv));
6617 IoDIRP(sv) = (DIR*)NULL;
6618 Safefree(IoTOP_NAME(sv));
6619 Safefree(IoFMT_NAME(sv));
6620 Safefree(IoBOTTOM_NAME(sv));
6621 if ((const GV *)sv == PL_statgv)
6625 /* FIXME for plugins */
6627 pregfree2((REGEXP*) sv);
6631 cv_undef(MUTABLE_CV(sv));
6632 /* If we're in a stash, we don't own a reference to it.
6633 * However it does have a back reference to us, which needs to
6635 if ((stash = CvSTASH(sv)))
6636 sv_del_backref(MUTABLE_SV(stash), sv);
6639 if (PL_last_swash_hv == (const HV *)sv) {
6640 PL_last_swash_hv = NULL;
6642 if (HvTOTALKEYS((HV*)sv) > 0) {
6644 /* this statement should match the one at the beginning of
6645 * hv_undef_flags() */
6646 if ( PL_phase != PERL_PHASE_DESTRUCT
6647 && (hek = HvNAME_HEK((HV*)sv)))
6649 if (PL_stashcache) {
6650 DEBUG_o(Perl_deb(aTHX_
6651 "sv_clear clearing PL_stashcache for '%" HEKf
6654 (void)hv_deletehek(PL_stashcache,
6657 hv_name_set((HV*)sv, NULL, 0, 0);
6660 /* save old iter_sv in unused SvSTASH field */
6661 assert(!SvOBJECT(sv));
6662 SvSTASH(sv) = (HV*)iter_sv;
6665 /* save old hash_index in unused SvMAGIC field */
6666 assert(!SvMAGICAL(sv));
6667 assert(!SvMAGIC(sv));
6668 ((XPVMG*) SvANY(sv))->xmg_u.xmg_hash_index = hash_index;
6671 next_sv = Perl_hfree_next_entry(aTHX_ (HV*)sv, &hash_index);
6672 goto get_next_sv; /* process this new sv */
6674 /* free empty hash */
6675 Perl_hv_undef_flags(aTHX_ MUTABLE_HV(sv), HV_NAME_SETALL);
6676 assert(!HvARRAY((HV*)sv));
6680 AV* av = MUTABLE_AV(sv);
6681 if (PL_comppad == av) {
6685 if (AvREAL(av) && AvFILLp(av) > -1) {
6686 next_sv = AvARRAY(av)[AvFILLp(av)--];
6687 /* save old iter_sv in top-most slot of AV,
6688 * and pray that it doesn't get wiped in the meantime */
6689 AvARRAY(av)[AvMAX(av)] = iter_sv;
6691 goto get_next_sv; /* process this new sv */
6693 Safefree(AvALLOC(av));
6698 if (LvTYPE(sv) == 'T') { /* for tie: return HE to pool */
6699 SvREFCNT_dec(HeKEY_sv((HE*)LvTARG(sv)));
6700 HeNEXT((HE*)LvTARG(sv)) = PL_hv_fetch_ent_mh;
6701 PL_hv_fetch_ent_mh = (HE*)LvTARG(sv);
6703 else if (LvTYPE(sv) != 't') /* unless tie: unrefcnted fake SV** */
6704 SvREFCNT_dec(LvTARG(sv));
6705 if (isREGEXP(sv)) goto freeregexp;
6708 if (isGV_with_GP(sv)) {
6709 if(GvCVu((const GV *)sv) && (stash = GvSTASH(MUTABLE_GV(sv)))
6710 && HvENAME_get(stash))
6711 mro_method_changed_in(stash);
6712 gp_free(MUTABLE_GV(sv));
6714 unshare_hek(GvNAME_HEK(sv));
6715 /* If we're in a stash, we don't own a reference to it.
6716 * However it does have a back reference to us, which
6717 * needs to be cleared. */
6718 if ((stash = GvSTASH(sv)))
6719 sv_del_backref(MUTABLE_SV(stash), sv);
6721 /* FIXME. There are probably more unreferenced pointers to SVs
6722 * in the interpreter struct that we should check and tidy in
6723 * a similar fashion to this: */
6724 /* See also S_sv_unglob, which does the same thing. */
6725 if ((const GV *)sv == PL_last_in_gv)
6726 PL_last_in_gv = NULL;
6727 else if ((const GV *)sv == PL_statgv)
6729 else if ((const GV *)sv == PL_stderrgv)
6738 /* Don't bother with SvOOK_off(sv); as we're only going to
6742 SvOOK_offset(sv, offset);
6743 SvPV_set(sv, SvPVX_mutable(sv) - offset);
6744 /* Don't even bother with turning off the OOK flag. */
6749 SV * const target = SvRV(sv);
6751 sv_del_backref(target, sv);
6757 else if (SvPVX_const(sv)
6758 && !(SvTYPE(sv) == SVt_PVIO
6759 && !(IoFLAGS(sv) & IOf_FAKE_DIRP)))
6763 PerlIO_printf(Perl_debug_log, "Copy on write: clear\n");
6767 if (CowREFCNT(sv)) {
6774 unshare_hek(SvSHARED_HEK_FROM_PV(SvPVX_const(sv)));
6779 Safefree(SvPVX_mutable(sv));
6783 else if (SvPVX_const(sv) && SvLEN(sv)
6784 && !(SvTYPE(sv) == SVt_PVIO
6785 && !(IoFLAGS(sv) & IOf_FAKE_DIRP)))
6786 Safefree(SvPVX_mutable(sv));
6787 else if (SvPVX_const(sv) && SvIsCOW(sv)) {
6788 unshare_hek(SvSHARED_HEK_FROM_PV(SvPVX_const(sv)));
6798 SvFLAGS(sv) &= SVf_BREAK;
6799 SvFLAGS(sv) |= SVTYPEMASK;
6801 sv_type_details = bodies_by_type + type;
6802 if (sv_type_details->arena) {
6803 del_body(((char *)SvANY(sv) + sv_type_details->offset),
6804 &PL_body_roots[type]);
6806 else if (sv_type_details->body_size) {
6807 safefree(SvANY(sv));
6811 /* caller is responsible for freeing the head of the original sv */
6812 if (sv != orig_sv && !SvREFCNT(sv))
6815 /* grab and free next sv, if any */
6823 else if (!iter_sv) {
6825 } else if (SvTYPE(iter_sv) == SVt_PVAV) {
6826 AV *const av = (AV*)iter_sv;
6827 if (AvFILLp(av) > -1) {
6828 sv = AvARRAY(av)[AvFILLp(av)--];
6830 else { /* no more elements of current AV to free */
6833 /* restore previous value, squirrelled away */
6834 iter_sv = AvARRAY(av)[AvMAX(av)];
6835 Safefree(AvALLOC(av));
6838 } else if (SvTYPE(iter_sv) == SVt_PVHV) {
6839 sv = Perl_hfree_next_entry(aTHX_ (HV*)iter_sv, &hash_index);
6840 if (!sv && !HvTOTALKEYS((HV *)iter_sv)) {
6841 /* no more elements of current HV to free */
6844 /* Restore previous values of iter_sv and hash_index,
6845 * squirrelled away */
6846 assert(!SvOBJECT(sv));
6847 iter_sv = (SV*)SvSTASH(sv);
6848 assert(!SvMAGICAL(sv));
6849 hash_index = ((XPVMG*) SvANY(sv))->xmg_u.xmg_hash_index;
6851 /* perl -DA does not like rubbish in SvMAGIC. */
6855 /* free any remaining detritus from the hash struct */
6856 Perl_hv_undef_flags(aTHX_ MUTABLE_HV(sv), HV_NAME_SETALL);
6857 assert(!HvARRAY((HV*)sv));
6862 /* unrolled SvREFCNT_dec and sv_free2 follows: */
6866 if (!SvREFCNT(sv)) {
6870 if (--(SvREFCNT(sv)))
6874 Perl_ck_warner_d(aTHX_ packWARN(WARN_DEBUGGING),
6875 "Attempt to free temp prematurely: SV 0x%" UVxf
6876 pTHX__FORMAT, PTR2UV(sv) pTHX__VALUE);
6880 if (SvIMMORTAL(sv)) {
6881 /* make sure SvREFCNT(sv)==0 happens very seldom */
6882 SvREFCNT(sv) = SvREFCNT_IMMORTAL;
6891 /* This routine curses the sv itself, not the object referenced by sv. So
6892 sv does not have to be ROK. */
6895 S_curse(pTHX_ SV * const sv, const bool check_refcnt) {
6896 PERL_ARGS_ASSERT_CURSE;
6897 assert(SvOBJECT(sv));
6899 if (PL_defstash && /* Still have a symbol table? */
6905 stash = SvSTASH(sv);
6906 assert(SvTYPE(stash) == SVt_PVHV);
6907 if (HvNAME(stash)) {
6908 CV* destructor = NULL;
6909 struct mro_meta *meta;
6911 assert (SvOOK(stash));
6913 DEBUG_o( Perl_deb(aTHX_ "Looking for DESTROY method for %s\n",
6916 /* don't make this an initialization above the assert, since it needs
6918 meta = HvMROMETA(stash);
6919 if (meta->destroy_gen && meta->destroy_gen == PL_sub_generation) {
6920 destructor = meta->destroy;
6921 DEBUG_o( Perl_deb(aTHX_ "Using cached DESTROY method %p for %s\n",
6922 (void *)destructor, HvNAME(stash)) );
6925 bool autoload = FALSE;
6927 gv_fetchmeth_pvn(stash, S_destroy, S_destroy_len, -1, 0);
6929 destructor = GvCV(gv);
6931 gv = gv_autoload_pvn(stash, S_destroy, S_destroy_len,
6932 GV_AUTOLOAD_ISMETHOD);
6934 destructor = GvCV(gv);
6938 /* we don't cache AUTOLOAD for DESTROY, since this code
6939 would then need to set $__PACKAGE__::AUTOLOAD, or the
6940 equivalent for XS AUTOLOADs */
6942 meta->destroy_gen = PL_sub_generation;
6943 meta->destroy = destructor;
6945 DEBUG_o( Perl_deb(aTHX_ "Set cached DESTROY method %p for %s\n",
6946 (void *)destructor, HvNAME(stash)) );
6949 DEBUG_o( Perl_deb(aTHX_ "Not caching AUTOLOAD for DESTROY method for %s\n",
6953 assert(!destructor || SvTYPE(destructor) == SVt_PVCV);
6955 /* A constant subroutine can have no side effects, so
6956 don't bother calling it. */
6957 && !CvCONST(destructor)
6958 /* Don't bother calling an empty destructor or one that
6959 returns immediately. */
6960 && (CvISXSUB(destructor)
6961 || (CvSTART(destructor)
6962 && (CvSTART(destructor)->op_next->op_type
6964 && (CvSTART(destructor)->op_next->op_type
6966 || CvSTART(destructor)->op_next->op_next->op_type
6972 SV* const tmpref = newRV(sv);
6973 SvREADONLY_on(tmpref); /* DESTROY() could be naughty */
6975 PUSHSTACKi(PERLSI_DESTROY);
6980 call_sv(MUTABLE_SV(destructor),
6981 G_DISCARD|G_EVAL|G_KEEPERR|G_VOID);
6985 if(SvREFCNT(tmpref) < 2) {
6986 /* tmpref is not kept alive! */
6988 SvRV_set(tmpref, NULL);
6991 SvREFCNT_dec_NN(tmpref);
6994 } while (SvOBJECT(sv) && SvSTASH(sv) != stash);
6997 if (check_refcnt && SvREFCNT(sv)) {
6998 if (PL_in_clean_objs)
7000 "DESTROY created new reference to dead object '%" HEKf "'",
7001 HEKfARG(HvNAME_HEK(stash)));
7002 /* DESTROY gave object new lease on life */
7008 HV * const stash = SvSTASH(sv);
7009 /* Curse before freeing the stash, as freeing the stash could cause
7010 a recursive call into S_curse. */
7011 SvOBJECT_off(sv); /* Curse the object. */
7012 SvSTASH_set(sv,0); /* SvREFCNT_dec may try to read this */
7013 SvREFCNT_dec(stash); /* possibly of changed persuasion */
7019 =for apidoc sv_newref
7021 Increment an SV's reference count. Use the C<SvREFCNT_inc()> wrapper
7028 Perl_sv_newref(pTHX_ SV *const sv)
7030 PERL_UNUSED_CONTEXT;
7039 Decrement an SV's reference count, and if it drops to zero, call
7040 C<sv_clear> to invoke destructors and free up any memory used by
7041 the body; finally, deallocating the SV's head itself.
7042 Normally called via a wrapper macro C<SvREFCNT_dec>.
7048 Perl_sv_free(pTHX_ SV *const sv)
7054 /* Private helper function for SvREFCNT_dec().
7055 * Called with rc set to original SvREFCNT(sv), where rc == 0 or 1 */
7058 Perl_sv_free2(pTHX_ SV *const sv, const U32 rc)
7062 PERL_ARGS_ASSERT_SV_FREE2;
7064 if (LIKELY( rc == 1 )) {
7070 Perl_ck_warner_d(aTHX_ packWARN(WARN_DEBUGGING),
7071 "Attempt to free temp prematurely: SV 0x%" UVxf
7072 pTHX__FORMAT, PTR2UV(sv) pTHX__VALUE);
7076 if (SvIMMORTAL(sv)) {
7077 /* make sure SvREFCNT(sv)==0 happens very seldom */
7078 SvREFCNT(sv) = SvREFCNT_IMMORTAL;
7082 if (! SvREFCNT(sv)) /* may have have been resurrected */
7087 /* handle exceptional cases */
7091 if (SvFLAGS(sv) & SVf_BREAK)
7092 /* this SV's refcnt has been artificially decremented to
7093 * trigger cleanup */
7095 if (PL_in_clean_all) /* All is fair */
7097 if (SvIMMORTAL(sv)) {
7098 /* make sure SvREFCNT(sv)==0 happens very seldom */
7099 SvREFCNT(sv) = SvREFCNT_IMMORTAL;
7102 if (ckWARN_d(WARN_INTERNAL)) {
7103 #ifdef DEBUG_LEAKING_SCALARS_FORK_DUMP
7104 Perl_dump_sv_child(aTHX_ sv);
7106 #ifdef DEBUG_LEAKING_SCALARS
7109 #ifdef DEBUG_LEAKING_SCALARS_ABORT
7110 if (PL_warnhook == PERL_WARNHOOK_FATAL
7111 || ckDEAD(packWARN(WARN_INTERNAL))) {
7112 /* Don't let Perl_warner cause us to escape our fate: */
7116 /* This may not return: */
7117 Perl_warner(aTHX_ packWARN(WARN_INTERNAL),
7118 "Attempt to free unreferenced scalar: SV 0x%" UVxf
7119 pTHX__FORMAT, PTR2UV(sv) pTHX__VALUE);
7122 #ifdef DEBUG_LEAKING_SCALARS_ABORT
7132 Returns the length of the string in the SV. Handles magic and type
7133 coercion and sets the UTF8 flag appropriately. See also C<L</SvCUR>>, which
7134 gives raw access to the C<xpv_cur> slot.
7140 Perl_sv_len(pTHX_ SV *const sv)
7147 (void)SvPV_const(sv, len);
7152 =for apidoc sv_len_utf8
7154 Returns the number of characters in the string in an SV, counting wide
7155 UTF-8 bytes as a single character. Handles magic and type coercion.
7161 * The length is cached in PERL_MAGIC_utf8, in the mg_len field. Also the
7162 * mg_ptr is used, by sv_pos_u2b() and sv_pos_b2u() - see the comments below.
7163 * (Note that the mg_len is not the length of the mg_ptr field.
7164 * This allows the cache to store the character length of the string without
7165 * needing to malloc() extra storage to attach to the mg_ptr.)
7170 Perl_sv_len_utf8(pTHX_ SV *const sv)
7176 return sv_len_utf8_nomg(sv);
7180 Perl_sv_len_utf8_nomg(pTHX_ SV * const sv)
7183 const U8 *s = (U8*)SvPV_nomg_const(sv, len);
7185 PERL_ARGS_ASSERT_SV_LEN_UTF8_NOMG;
7187 if (PL_utf8cache && SvUTF8(sv)) {
7189 MAGIC *mg = SvMAGICAL(sv) ? mg_find(sv, PERL_MAGIC_utf8) : NULL;
7191 if (mg && (mg->mg_len != -1 || mg->mg_ptr)) {
7192 if (mg->mg_len != -1)
7195 /* We can use the offset cache for a headstart.
7196 The longer value is stored in the first pair. */
7197 STRLEN *cache = (STRLEN *) mg->mg_ptr;
7199 ulen = cache[0] + Perl_utf8_length(aTHX_ s + cache[1],
7203 if (PL_utf8cache < 0) {
7204 const STRLEN real = Perl_utf8_length(aTHX_ s, s + len);
7205 assert_uft8_cache_coherent("sv_len_utf8", ulen, real, sv);
7209 ulen = Perl_utf8_length(aTHX_ s, s + len);
7210 utf8_mg_len_cache_update(sv, &mg, ulen);
7214 return SvUTF8(sv) ? Perl_utf8_length(aTHX_ s, s + len) : len;
7217 /* Walk forwards to find the byte corresponding to the passed in UTF-8
7220 S_sv_pos_u2b_forwards(const U8 *const start, const U8 *const send,
7221 STRLEN *const uoffset_p, bool *const at_end)
7223 const U8 *s = start;
7224 STRLEN uoffset = *uoffset_p;
7226 PERL_ARGS_ASSERT_SV_POS_U2B_FORWARDS;
7228 while (s < send && uoffset) {
7235 else if (s > send) {
7237 /* This is the existing behaviour. Possibly it should be a croak, as
7238 it's actually a bounds error */
7241 *uoffset_p -= uoffset;
7245 /* Given the length of the string in both bytes and UTF-8 characters, decide
7246 whether to walk forwards or backwards to find the byte corresponding to
7247 the passed in UTF-8 offset. */
7249 S_sv_pos_u2b_midway(const U8 *const start, const U8 *send,
7250 STRLEN uoffset, const STRLEN uend)
7252 STRLEN backw = uend - uoffset;
7254 PERL_ARGS_ASSERT_SV_POS_U2B_MIDWAY;
7256 if (uoffset < 2 * backw) {
7257 /* The assumption is that going forwards is twice the speed of going
7258 forward (that's where the 2 * backw comes from).
7259 (The real figure of course depends on the UTF-8 data.) */
7260 const U8 *s = start;
7262 while (s < send && uoffset--)
7272 while (UTF8_IS_CONTINUATION(*send))
7275 return send - start;
7278 /* For the string representation of the given scalar, find the byte
7279 corresponding to the passed in UTF-8 offset. uoffset0 and boffset0
7280 give another position in the string, *before* the sought offset, which
7281 (which is always true, as 0, 0 is a valid pair of positions), which should
7282 help reduce the amount of linear searching.
7283 If *mgp is non-NULL, it should point to the UTF-8 cache magic, which
7284 will be used to reduce the amount of linear searching. The cache will be
7285 created if necessary, and the found value offered to it for update. */
7287 S_sv_pos_u2b_cached(pTHX_ SV *const sv, MAGIC **const mgp, const U8 *const start,
7288 const U8 *const send, STRLEN uoffset,
7289 STRLEN uoffset0, STRLEN boffset0)
7291 STRLEN boffset = 0; /* Actually always set, but let's keep gcc happy. */
7293 bool at_end = FALSE;
7295 PERL_ARGS_ASSERT_SV_POS_U2B_CACHED;
7297 assert (uoffset >= uoffset0);
7302 if (!SvREADONLY(sv) && !SvGMAGICAL(sv) && SvPOK(sv)
7304 && (*mgp || (SvTYPE(sv) >= SVt_PVMG &&
7305 (*mgp = mg_find(sv, PERL_MAGIC_utf8))))) {
7306 if ((*mgp)->mg_ptr) {
7307 STRLEN *cache = (STRLEN *) (*mgp)->mg_ptr;
7308 if (cache[0] == uoffset) {
7309 /* An exact match. */
7312 if (cache[2] == uoffset) {
7313 /* An exact match. */
7317 if (cache[0] < uoffset) {
7318 /* The cache already knows part of the way. */
7319 if (cache[0] > uoffset0) {
7320 /* The cache knows more than the passed in pair */
7321 uoffset0 = cache[0];
7322 boffset0 = cache[1];
7324 if ((*mgp)->mg_len != -1) {
7325 /* And we know the end too. */
7327 + sv_pos_u2b_midway(start + boffset0, send,
7329 (*mgp)->mg_len - uoffset0);
7331 uoffset -= uoffset0;
7333 + sv_pos_u2b_forwards(start + boffset0,
7334 send, &uoffset, &at_end);
7335 uoffset += uoffset0;
7338 else if (cache[2] < uoffset) {
7339 /* We're between the two cache entries. */
7340 if (cache[2] > uoffset0) {
7341 /* and the cache knows more than the passed in pair */
7342 uoffset0 = cache[2];
7343 boffset0 = cache[3];
7347 + sv_pos_u2b_midway(start + boffset0,
7350 cache[0] - uoffset0);
7353 + sv_pos_u2b_midway(start + boffset0,
7356 cache[2] - uoffset0);
7360 else if ((*mgp)->mg_len != -1) {
7361 /* If we can take advantage of a passed in offset, do so. */
7362 /* In fact, offset0 is either 0, or less than offset, so don't
7363 need to worry about the other possibility. */
7365 + sv_pos_u2b_midway(start + boffset0, send,
7367 (*mgp)->mg_len - uoffset0);
7372 if (!found || PL_utf8cache < 0) {
7373 STRLEN real_boffset;
7374 uoffset -= uoffset0;
7375 real_boffset = boffset0 + sv_pos_u2b_forwards(start + boffset0,
7376 send, &uoffset, &at_end);
7377 uoffset += uoffset0;
7379 if (found && PL_utf8cache < 0)
7380 assert_uft8_cache_coherent("sv_pos_u2b_cache", boffset,
7382 boffset = real_boffset;
7385 if (PL_utf8cache && !SvGMAGICAL(sv) && SvPOK(sv)) {
7387 utf8_mg_len_cache_update(sv, mgp, uoffset);
7389 utf8_mg_pos_cache_update(sv, mgp, boffset, uoffset, send - start);
7396 =for apidoc sv_pos_u2b_flags
7398 Converts the offset from a count of UTF-8 chars from
7399 the start of the string, to a count of the equivalent number of bytes; if
7400 C<lenp> is non-zero, it does the same to C<lenp>, but this time starting from
7401 C<offset>, rather than from the start
7402 of the string. Handles type coercion.
7403 C<flags> is passed to C<SvPV_flags>, and usually should be
7404 C<SV_GMAGIC|SV_CONST_RETURN> to handle magic.
7410 * sv_pos_u2b_flags() uses, like sv_pos_b2u(), the mg_ptr of the potential
7411 * PERL_MAGIC_utf8 of the sv to store the mapping between UTF-8 and
7412 * byte offsets. See also the comments of S_utf8_mg_pos_cache_update().
7417 Perl_sv_pos_u2b_flags(pTHX_ SV *const sv, STRLEN uoffset, STRLEN *const lenp,
7424 PERL_ARGS_ASSERT_SV_POS_U2B_FLAGS;
7426 start = (U8*)SvPV_flags(sv, len, flags);
7428 const U8 * const send = start + len;
7430 boffset = sv_pos_u2b_cached(sv, &mg, start, send, uoffset, 0, 0);
7433 && *lenp /* don't bother doing work for 0, as its bytes equivalent
7434 is 0, and *lenp is already set to that. */) {
7435 /* Convert the relative offset to absolute. */
7436 const STRLEN uoffset2 = uoffset + *lenp;
7437 const STRLEN boffset2
7438 = sv_pos_u2b_cached(sv, &mg, start, send, uoffset2,
7439 uoffset, boffset) - boffset;
7453 =for apidoc sv_pos_u2b
7455 Converts the value pointed to by C<offsetp> from a count of UTF-8 chars from
7456 the start of the string, to a count of the equivalent number of bytes; if
7457 C<lenp> is non-zero, it does the same to C<lenp>, but this time starting from
7458 the offset, rather than from the start of the string. Handles magic and
7461 Use C<sv_pos_u2b_flags> in preference, which correctly handles strings longer
7468 * sv_pos_u2b() uses, like sv_pos_b2u(), the mg_ptr of the potential
7469 * PERL_MAGIC_utf8 of the sv to store the mapping between UTF-8 and
7470 * byte offsets. See also the comments of S_utf8_mg_pos_cache_update().
7474 /* This function is subject to size and sign problems */
7477 Perl_sv_pos_u2b(pTHX_ SV *const sv, I32 *const offsetp, I32 *const lenp)
7479 PERL_ARGS_ASSERT_SV_POS_U2B;
7482 STRLEN ulen = (STRLEN)*lenp;
7483 *offsetp = (I32)sv_pos_u2b_flags(sv, (STRLEN)*offsetp, &ulen,
7484 SV_GMAGIC|SV_CONST_RETURN);
7487 *offsetp = (I32)sv_pos_u2b_flags(sv, (STRLEN)*offsetp, NULL,
7488 SV_GMAGIC|SV_CONST_RETURN);
7493 S_utf8_mg_len_cache_update(pTHX_ SV *const sv, MAGIC **const mgp,
7496 PERL_ARGS_ASSERT_UTF8_MG_LEN_CACHE_UPDATE;
7497 if (SvREADONLY(sv) || SvGMAGICAL(sv) || !SvPOK(sv))
7500 if (!*mgp && (SvTYPE(sv) < SVt_PVMG ||
7501 !(*mgp = mg_find(sv, PERL_MAGIC_utf8)))) {
7502 *mgp = sv_magicext(sv, 0, PERL_MAGIC_utf8, &PL_vtbl_utf8, 0, 0);
7506 (*mgp)->mg_len = ulen;
7509 /* Create and update the UTF8 magic offset cache, with the proffered utf8/
7510 byte length pairing. The (byte) length of the total SV is passed in too,
7511 as blen, because for some (more esoteric) SVs, the call to SvPV_const()
7512 may not have updated SvCUR, so we can't rely on reading it directly.
7514 The proffered utf8/byte length pairing isn't used if the cache already has
7515 two pairs, and swapping either for the proffered pair would increase the
7516 RMS of the intervals between known byte offsets.
7518 The cache itself consists of 4 STRLEN values
7519 0: larger UTF-8 offset
7520 1: corresponding byte offset
7521 2: smaller UTF-8 offset
7522 3: corresponding byte offset
7524 Unused cache pairs have the value 0, 0.
7525 Keeping the cache "backwards" means that the invariant of
7526 cache[0] >= cache[2] is maintained even with empty slots, which means that
7527 the code that uses it doesn't need to worry if only 1 entry has actually
7528 been set to non-zero. It also makes the "position beyond the end of the
7529 cache" logic much simpler, as the first slot is always the one to start
7533 S_utf8_mg_pos_cache_update(pTHX_ SV *const sv, MAGIC **const mgp, const STRLEN byte,
7534 const STRLEN utf8, const STRLEN blen)
7538 PERL_ARGS_ASSERT_UTF8_MG_POS_CACHE_UPDATE;
7543 if (!*mgp && (SvTYPE(sv) < SVt_PVMG ||
7544 !(*mgp = mg_find(sv, PERL_MAGIC_utf8)))) {
7545 *mgp = sv_magicext(sv, 0, PERL_MAGIC_utf8, (MGVTBL*)&PL_vtbl_utf8, 0,
7547 (*mgp)->mg_len = -1;
7551 if (!(cache = (STRLEN *)(*mgp)->mg_ptr)) {
7552 Newxz(cache, PERL_MAGIC_UTF8_CACHESIZE * 2, STRLEN);
7553 (*mgp)->mg_ptr = (char *) cache;
7557 if (PL_utf8cache < 0 && SvPOKp(sv)) {
7558 /* SvPOKp() because, if sv is a reference, then SvPVX() is actually
7559 a pointer. Note that we no longer cache utf8 offsets on refer-
7560 ences, but this check is still a good idea, for robustness. */
7561 const U8 *start = (const U8 *) SvPVX_const(sv);
7562 const STRLEN realutf8 = utf8_length(start, start + byte);
7564 assert_uft8_cache_coherent("utf8_mg_pos_cache_update", utf8, realutf8,
7568 /* Cache is held with the later position first, to simplify the code
7569 that deals with unbounded ends. */
7571 ASSERT_UTF8_CACHE(cache);
7572 if (cache[1] == 0) {
7573 /* Cache is totally empty */
7576 } else if (cache[3] == 0) {
7577 if (byte > cache[1]) {
7578 /* New one is larger, so goes first. */
7579 cache[2] = cache[0];
7580 cache[3] = cache[1];
7588 /* float casts necessary? XXX */
7589 #define THREEWAY_SQUARE(a,b,c,d) \
7590 ((float)((d) - (c))) * ((float)((d) - (c))) \
7591 + ((float)((c) - (b))) * ((float)((c) - (b))) \
7592 + ((float)((b) - (a))) * ((float)((b) - (a)))
7594 /* Cache has 2 slots in use, and we know three potential pairs.
7595 Keep the two that give the lowest RMS distance. Do the
7596 calculation in bytes simply because we always know the byte
7597 length. squareroot has the same ordering as the positive value,
7598 so don't bother with the actual square root. */
7599 if (byte > cache[1]) {
7600 /* New position is after the existing pair of pairs. */
7601 const float keep_earlier
7602 = THREEWAY_SQUARE(0, cache[3], byte, blen);
7603 const float keep_later
7604 = THREEWAY_SQUARE(0, cache[1], byte, blen);
7606 if (keep_later < keep_earlier) {
7607 cache[2] = cache[0];
7608 cache[3] = cache[1];
7614 const float keep_later = THREEWAY_SQUARE(0, byte, cache[1], blen);
7615 float b, c, keep_earlier;
7616 if (byte > cache[3]) {
7617 /* New position is between the existing pair of pairs. */
7618 b = (float)cache[3];
7621 /* New position is before the existing pair of pairs. */
7623 c = (float)cache[3];
7625 keep_earlier = THREEWAY_SQUARE(0, b, c, blen);
7626 if (byte > cache[3]) {
7627 if (keep_later < keep_earlier) {
7637 if (! (keep_later < keep_earlier)) {
7638 cache[0] = cache[2];
7639 cache[1] = cache[3];
7646 ASSERT_UTF8_CACHE(cache);
7649 /* We already know all of the way, now we may be able to walk back. The same
7650 assumption is made as in S_sv_pos_u2b_midway(), namely that walking
7651 backward is half the speed of walking forward. */
7653 S_sv_pos_b2u_midway(pTHX_ const U8 *const s, const U8 *const target,
7654 const U8 *end, STRLEN endu)
7656 const STRLEN forw = target - s;
7657 STRLEN backw = end - target;
7659 PERL_ARGS_ASSERT_SV_POS_B2U_MIDWAY;
7661 if (forw < 2 * backw) {
7662 return utf8_length(s, target);
7665 while (end > target) {
7667 while (UTF8_IS_CONTINUATION(*end)) {
7676 =for apidoc sv_pos_b2u_flags
7678 Converts C<offset> from a count of bytes from the start of the string, to
7679 a count of the equivalent number of UTF-8 chars. Handles type coercion.
7680 C<flags> is passed to C<SvPV_flags>, and usually should be
7681 C<SV_GMAGIC|SV_CONST_RETURN> to handle magic.
7687 * sv_pos_b2u_flags() uses, like sv_pos_u2b_flags(), the mg_ptr of the
7688 * potential PERL_MAGIC_utf8 of the sv to store the mapping between UTF-8
7693 Perl_sv_pos_b2u_flags(pTHX_ SV *const sv, STRLEN const offset, U32 flags)
7696 STRLEN len = 0; /* Actually always set, but let's keep gcc happy. */
7702 PERL_ARGS_ASSERT_SV_POS_B2U_FLAGS;
7704 s = (const U8*)SvPV_flags(sv, blen, flags);
7707 Perl_croak(aTHX_ "panic: sv_pos_b2u: bad byte offset, blen=%" UVuf
7708 ", byte=%" UVuf, (UV)blen, (UV)offset);
7714 && SvTYPE(sv) >= SVt_PVMG
7715 && (mg = mg_find(sv, PERL_MAGIC_utf8)))
7718 STRLEN * const cache = (STRLEN *) mg->mg_ptr;
7719 if (cache[1] == offset) {
7720 /* An exact match. */
7723 if (cache[3] == offset) {
7724 /* An exact match. */
7728 if (cache[1] < offset) {
7729 /* We already know part of the way. */
7730 if (mg->mg_len != -1) {
7731 /* Actually, we know the end too. */
7733 + S_sv_pos_b2u_midway(aTHX_ s + cache[1], send,
7734 s + blen, mg->mg_len - cache[0]);
7736 len = cache[0] + utf8_length(s + cache[1], send);
7739 else if (cache[3] < offset) {
7740 /* We're between the two cached pairs, so we do the calculation
7741 offset by the byte/utf-8 positions for the earlier pair,
7742 then add the utf-8 characters from the string start to
7744 len = S_sv_pos_b2u_midway(aTHX_ s + cache[3], send,
7745 s + cache[1], cache[0] - cache[2])
7749 else { /* cache[3] > offset */
7750 len = S_sv_pos_b2u_midway(aTHX_ s, send, s + cache[3],
7754 ASSERT_UTF8_CACHE(cache);
7756 } else if (mg->mg_len != -1) {
7757 len = S_sv_pos_b2u_midway(aTHX_ s, send, s + blen, mg->mg_len);
7761 if (!found || PL_utf8cache < 0) {
7762 const STRLEN real_len = utf8_length(s, send);
7764 if (found && PL_utf8cache < 0)
7765 assert_uft8_cache_coherent("sv_pos_b2u", len, real_len, sv);
7771 utf8_mg_len_cache_update(sv, &mg, len);
7773 utf8_mg_pos_cache_update(sv, &mg, offset, len, blen);
7780 =for apidoc sv_pos_b2u
7782 Converts the value pointed to by C<offsetp> from a count of bytes from the
7783 start of the string, to a count of the equivalent number of UTF-8 chars.
7784 Handles magic and type coercion.
7786 Use C<sv_pos_b2u_flags> in preference, which correctly handles strings
7793 * sv_pos_b2u() uses, like sv_pos_u2b(), the mg_ptr of the potential
7794 * PERL_MAGIC_utf8 of the sv to store the mapping between UTF-8 and
7799 Perl_sv_pos_b2u(pTHX_ SV *const sv, I32 *const offsetp)
7801 PERL_ARGS_ASSERT_SV_POS_B2U;
7806 *offsetp = (I32)sv_pos_b2u_flags(sv, (STRLEN)*offsetp,
7807 SV_GMAGIC|SV_CONST_RETURN);
7811 S_assert_uft8_cache_coherent(pTHX_ const char *const func, STRLEN from_cache,
7812 STRLEN real, SV *const sv)
7814 PERL_ARGS_ASSERT_ASSERT_UFT8_CACHE_COHERENT;
7816 /* As this is debugging only code, save space by keeping this test here,
7817 rather than inlining it in all the callers. */
7818 if (from_cache == real)
7821 /* Need to turn the assertions off otherwise we may recurse infinitely
7822 while printing error messages. */
7823 SAVEI8(PL_utf8cache);
7825 Perl_croak(aTHX_ "panic: %s cache %" UVuf " real %" UVuf " for %" SVf,
7826 func, (UV) from_cache, (UV) real, SVfARG(sv));
7832 Returns a boolean indicating whether the strings in the two SVs are
7833 identical. Is UTF-8 and S<C<'use bytes'>> aware, handles get magic, and will
7834 coerce its args to strings if necessary.
7836 =for apidoc sv_eq_flags
7838 Returns a boolean indicating whether the strings in the two SVs are
7839 identical. Is UTF-8 and S<C<'use bytes'>> aware and coerces its args to strings
7840 if necessary. If the flags has the C<SV_GMAGIC> bit set, it handles get-magic, too.
7846 Perl_sv_eq_flags(pTHX_ SV *sv1, SV *sv2, const U32 flags)
7853 SV* svrecode = NULL;
7860 /* if pv1 and pv2 are the same, second SvPV_const call may
7861 * invalidate pv1 (if we are handling magic), so we may need to
7863 if (sv1 == sv2 && flags & SV_GMAGIC
7864 && (SvTHINKFIRST(sv1) || SvGMAGICAL(sv1))) {
7865 pv1 = SvPV_const(sv1, cur1);
7866 sv1 = newSVpvn_flags(pv1, cur1, SVs_TEMP | SvUTF8(sv2));
7868 pv1 = SvPV_flags_const(sv1, cur1, flags);
7876 pv2 = SvPV_flags_const(sv2, cur2, flags);
7878 if (cur1 && cur2 && SvUTF8(sv1) != SvUTF8(sv2) && !IN_BYTES) {
7879 /* Differing utf8ness. */
7881 /* sv1 is the UTF-8 one */
7882 return bytes_cmp_utf8((const U8*)pv2, cur2,
7883 (const U8*)pv1, cur1) == 0;
7886 /* sv2 is the UTF-8 one */
7887 return bytes_cmp_utf8((const U8*)pv1, cur1,
7888 (const U8*)pv2, cur2) == 0;
7893 eq = (pv1 == pv2) || memEQ(pv1, pv2, cur1);
7895 SvREFCNT_dec(svrecode);
7903 Compares the strings in two SVs. Returns -1, 0, or 1 indicating whether the
7904 string in C<sv1> is less than, equal to, or greater than the string in
7905 C<sv2>. Is UTF-8 and S<C<'use bytes'>> aware, handles get magic, and will
7906 coerce its args to strings if necessary. See also C<L</sv_cmp_locale>>.
7908 =for apidoc sv_cmp_flags
7910 Compares the strings in two SVs. Returns -1, 0, or 1 indicating whether the
7911 string in C<sv1> is less than, equal to, or greater than the string in
7912 C<sv2>. Is UTF-8 and S<C<'use bytes'>> aware and will coerce its args to strings
7913 if necessary. If the flags has the C<SV_GMAGIC> bit set, it handles get magic. See
7914 also C<L</sv_cmp_locale_flags>>.
7920 Perl_sv_cmp(pTHX_ SV *const sv1, SV *const sv2)
7922 return sv_cmp_flags(sv1, sv2, SV_GMAGIC);
7926 Perl_sv_cmp_flags(pTHX_ SV *const sv1, SV *const sv2,
7930 const char *pv1, *pv2;
7932 SV *svrecode = NULL;
7939 pv1 = SvPV_flags_const(sv1, cur1, flags);
7946 pv2 = SvPV_flags_const(sv2, cur2, flags);
7948 if (cur1 && cur2 && SvUTF8(sv1) != SvUTF8(sv2) && !IN_BYTES) {
7949 /* Differing utf8ness. */
7951 const int retval = -bytes_cmp_utf8((const U8*)pv2, cur2,
7952 (const U8*)pv1, cur1);
7953 return retval ? retval < 0 ? -1 : +1 : 0;
7956 const int retval = bytes_cmp_utf8((const U8*)pv1, cur1,
7957 (const U8*)pv2, cur2);
7958 return retval ? retval < 0 ? -1 : +1 : 0;
7962 /* Here, if both are non-NULL, then they have the same UTF8ness. */
7965 cmp = cur2 ? -1 : 0;
7969 STRLEN shortest_len = cur1 < cur2 ? cur1 : cur2;
7972 if (! DO_UTF8(sv1)) {
7974 const I32 retval = memcmp((const void*)pv1,
7978 cmp = retval < 0 ? -1 : 1;
7979 } else if (cur1 == cur2) {
7982 cmp = cur1 < cur2 ? -1 : 1;
7986 else { /* Both are to be treated as UTF-EBCDIC */
7988 /* EBCDIC UTF-8 is complicated by the fact that it is based on I8
7989 * which remaps code points 0-255. We therefore generally have to
7990 * unmap back to the original values to get an accurate comparison.
7991 * But we don't have to do that for UTF-8 invariants, as by
7992 * definition, they aren't remapped, nor do we have to do it for
7993 * above-latin1 code points, as they also aren't remapped. (This
7994 * code also works on ASCII platforms, but the memcmp() above is
7997 const char *e = pv1 + shortest_len;
7999 /* Find the first bytes that differ between the two strings */
8000 while (pv1 < e && *pv1 == *pv2) {
8006 if (pv1 == e) { /* Are the same all the way to the end */
8010 cmp = cur1 < cur2 ? -1 : 1;
8013 else /* Here *pv1 and *pv2 are not equal, but all bytes earlier
8014 * in the strings were. The current bytes may or may not be
8015 * at the beginning of a character. But neither or both are
8016 * (or else earlier bytes would have been different). And
8017 * if we are in the middle of a character, the two
8018 * characters are comprised of the same number of bytes
8019 * (because in this case the start bytes are the same, and
8020 * the start bytes encode the character's length). */
8021 if (UTF8_IS_INVARIANT(*pv1))
8023 /* If both are invariants; can just compare directly */
8024 if (UTF8_IS_INVARIANT(*pv2)) {
8025 cmp = ((U8) *pv1 < (U8) *pv2) ? -1 : 1;
8027 else /* Since *pv1 is invariant, it is the whole character,
8028 which means it is at the beginning of a character.
8029 That means pv2 is also at the beginning of a
8030 character (see earlier comment). Since it isn't
8031 invariant, it must be a start byte. If it starts a
8032 character whose code point is above 255, that
8033 character is greater than any single-byte char, which
8035 if (UTF8_IS_ABOVE_LATIN1_START(*pv2))
8040 /* Here, pv2 points to a character composed of 2 bytes
8041 * whose code point is < 256. Get its code point and
8042 * compare with *pv1 */
8043 cmp = ((U8) *pv1 < EIGHT_BIT_UTF8_TO_NATIVE(*pv2, *(pv2 + 1)))
8048 else /* The code point starting at pv1 isn't a single byte */
8049 if (UTF8_IS_INVARIANT(*pv2))
8051 /* But here, the code point starting at *pv2 is a single byte,
8052 * and so *pv1 must begin a character, hence is a start byte.
8053 * If that character is above 255, it is larger than any
8054 * single-byte char, which *pv2 is */
8055 if (UTF8_IS_ABOVE_LATIN1_START(*pv1)) {
8059 /* Here, pv1 points to a character composed of 2 bytes
8060 * whose code point is < 256. Get its code point and
8061 * compare with the single byte character *pv2 */
8062 cmp = (EIGHT_BIT_UTF8_TO_NATIVE(*pv1, *(pv1 + 1)) < (U8) *pv2)
8067 else /* Here, we've ruled out either *pv1 and *pv2 being
8068 invariant. That means both are part of variants, but not
8069 necessarily at the start of a character */
8070 if ( UTF8_IS_ABOVE_LATIN1_START(*pv1)
8071 || UTF8_IS_ABOVE_LATIN1_START(*pv2))
8073 /* Here, at least one is the start of a character, which means
8074 * the other is also a start byte. And the code point of at
8075 * least one of the characters is above 255. It is a
8076 * characteristic of UTF-EBCDIC that all start bytes for
8077 * above-latin1 code points are well behaved as far as code
8078 * point comparisons go, and all are larger than all other
8079 * start bytes, so the comparison with those is also well
8081 cmp = ((U8) *pv1 < (U8) *pv2) ? -1 : 1;
8084 /* Here both *pv1 and *pv2 are part of variant characters.
8085 * They could be both continuations, or both start characters.
8086 * (One or both could even be an illegal start character (for
8087 * an overlong) which for the purposes of sorting we treat as
8089 if (UTF8_IS_CONTINUATION(*pv1)) {
8091 /* If they are continuations for code points above 255,
8092 * then comparing the current byte is sufficient, as there
8093 * is no remapping of these and so the comparison is
8094 * well-behaved. We determine if they are such
8095 * continuations by looking at the preceding byte. It
8096 * could be a start byte, from which we can tell if it is
8097 * for an above 255 code point. Or it could be a
8098 * continuation, which means the character occupies at
8099 * least 3 bytes, so must be above 255. */
8100 if ( UTF8_IS_CONTINUATION(*(pv2 - 1))
8101 || UTF8_IS_ABOVE_LATIN1_START(*(pv2 -1)))
8103 cmp = ((U8) *pv1 < (U8) *pv2) ? -1 : 1;
8107 /* Here, the continuations are for code points below 256;
8108 * back up one to get to the start byte */
8113 /* We need to get the actual native code point of each of these
8114 * variants in order to compare them */
8115 cmp = ( EIGHT_BIT_UTF8_TO_NATIVE(*pv1, *(pv1 + 1))
8116 < EIGHT_BIT_UTF8_TO_NATIVE(*pv2, *(pv2 + 1)))
8125 SvREFCNT_dec(svrecode);
8131 =for apidoc sv_cmp_locale
8133 Compares the strings in two SVs in a locale-aware manner. Is UTF-8 and
8134 S<C<'use bytes'>> aware, handles get magic, and will coerce its args to strings
8135 if necessary. See also C<L</sv_cmp>>.
8137 =for apidoc sv_cmp_locale_flags
8139 Compares the strings in two SVs in a locale-aware manner. Is UTF-8 and
8140 S<C<'use bytes'>> aware and will coerce its args to strings if necessary. If
8141 the flags contain C<SV_GMAGIC>, it handles get magic. See also
8142 C<L</sv_cmp_flags>>.
8148 Perl_sv_cmp_locale(pTHX_ SV *const sv1, SV *const sv2)
8150 return sv_cmp_locale_flags(sv1, sv2, SV_GMAGIC);
8154 Perl_sv_cmp_locale_flags(pTHX_ SV *const sv1, SV *const sv2,
8157 #ifdef USE_LOCALE_COLLATE
8163 if (PL_collation_standard)
8168 /* Revert to using raw compare if both operands exist, but either one
8169 * doesn't transform properly for collation */
8171 pv1 = sv_collxfrm_flags(sv1, &len1, flags);
8175 pv2 = sv_collxfrm_flags(sv2, &len2, flags);
8181 pv1 = sv1 ? sv_collxfrm_flags(sv1, &len1, flags) : (char *) NULL;
8182 pv2 = sv2 ? sv_collxfrm_flags(sv2, &len2, flags) : (char *) NULL;
8185 if (!pv1 || !len1) {
8196 retval = memcmp((void*)pv1, (void*)pv2, len1 < len2 ? len1 : len2);
8199 return retval < 0 ? -1 : 1;
8202 * When the result of collation is equality, that doesn't mean
8203 * that there are no differences -- some locales exclude some
8204 * characters from consideration. So to avoid false equalities,
8205 * we use the raw string as a tiebreaker.
8212 PERL_UNUSED_ARG(flags);
8213 #endif /* USE_LOCALE_COLLATE */
8215 return sv_cmp(sv1, sv2);
8219 #ifdef USE_LOCALE_COLLATE
8222 =for apidoc sv_collxfrm
8224 This calls C<sv_collxfrm_flags> with the SV_GMAGIC flag. See
8225 C<L</sv_collxfrm_flags>>.
8227 =for apidoc sv_collxfrm_flags
8229 Add Collate Transform magic to an SV if it doesn't already have it. If the
8230 flags contain C<SV_GMAGIC>, it handles get-magic.
8232 Any scalar variable may carry C<PERL_MAGIC_collxfrm> magic that contains the
8233 scalar data of the variable, but transformed to such a format that a normal
8234 memory comparison can be used to compare the data according to the locale
8241 Perl_sv_collxfrm_flags(pTHX_ SV *const sv, STRLEN *const nxp, const I32 flags)
8245 PERL_ARGS_ASSERT_SV_COLLXFRM_FLAGS;
8247 mg = SvMAGICAL(sv) ? mg_find(sv, PERL_MAGIC_collxfrm) : (MAGIC *) NULL;
8249 /* If we don't have collation magic on 'sv', or the locale has changed
8250 * since the last time we calculated it, get it and save it now */
8251 if (!mg || !mg->mg_ptr || *(U32*)mg->mg_ptr != PL_collation_ix) {
8256 /* Free the old space */
8258 Safefree(mg->mg_ptr);
8260 s = SvPV_flags_const(sv, len, flags);
8261 if ((xf = _mem_collxfrm(s, len, &xlen, cBOOL(SvUTF8(sv))))) {
8263 mg = sv_magicext(sv, 0, PERL_MAGIC_collxfrm, &PL_vtbl_collxfrm,
8278 if (mg && mg->mg_ptr) {
8280 return mg->mg_ptr + sizeof(PL_collation_ix);
8288 #endif /* USE_LOCALE_COLLATE */
8291 S_sv_gets_append_to_utf8(pTHX_ SV *const sv, PerlIO *const fp, I32 append)
8293 SV * const tsv = newSV(0);
8296 sv_gets(tsv, fp, 0);
8297 sv_utf8_upgrade_nomg(tsv);
8298 SvCUR_set(sv,append);
8301 return (SvCUR(sv) - append) ? SvPVX(sv) : NULL;
8305 S_sv_gets_read_record(pTHX_ SV *const sv, PerlIO *const fp, I32 append)
8308 const STRLEN recsize = SvUV(SvRV(PL_rs)); /* RsRECORD() guarantees > 0. */
8309 /* Grab the size of the record we're getting */
8310 char *buffer = SvGROW(sv, (STRLEN)(recsize + append + 1)) + append;
8317 /* With a true, record-oriented file on VMS, we need to use read directly
8318 * to ensure that we respect RMS record boundaries. The user is responsible
8319 * for providing a PL_rs value that corresponds to the FAB$W_MRS (maximum
8320 * record size) field. N.B. This is likely to produce invalid results on
8321 * varying-width character data when a record ends mid-character.
8323 fd = PerlIO_fileno(fp);
8325 && PerlLIO_fstat(fd, &st) == 0
8326 && (st.st_fab_rfm == FAB$C_VAR
8327 || st.st_fab_rfm == FAB$C_VFC
8328 || st.st_fab_rfm == FAB$C_FIX)) {
8330 bytesread = PerlLIO_read(fd, buffer, recsize);
8332 else /* in-memory file from PerlIO::Scalar
8333 * or not a record-oriented file
8337 bytesread = PerlIO_read(fp, buffer, recsize);
8339 /* At this point, the logic in sv_get() means that sv will
8340 be treated as utf-8 if the handle is utf8.
8342 if (PerlIO_isutf8(fp) && bytesread > 0) {
8343 char *bend = buffer + bytesread;
8344 char *bufp = buffer;
8345 size_t charcount = 0;
8346 bool charstart = TRUE;
8349 while (charcount < recsize) {
8350 /* count accumulated characters */
8351 while (bufp < bend) {
8353 skip = UTF8SKIP(bufp);
8355 if (bufp + skip > bend) {
8356 /* partial at the end */
8367 if (charcount < recsize) {
8369 STRLEN bufp_offset = bufp - buffer;
8370 SSize_t morebytesread;
8372 /* originally I read enough to fill any incomplete
8373 character and the first byte of the next
8374 character if needed, but if there's many
8375 multi-byte encoded characters we're going to be
8376 making a read call for every character beyond
8377 the original read size.
8379 So instead, read the rest of the character if
8380 any, and enough bytes to match at least the
8381 start bytes for each character we're going to
8385 readsize = recsize - charcount;
8387 readsize = skip - (bend - bufp) + recsize - charcount - 1;
8388 buffer = SvGROW(sv, append + bytesread + readsize + 1) + append;
8389 bend = buffer + bytesread;
8390 morebytesread = PerlIO_read(fp, bend, readsize);
8391 if (morebytesread <= 0) {
8392 /* we're done, if we still have incomplete
8393 characters the check code in sv_gets() will
8396 I'd originally considered doing
8397 PerlIO_ungetc() on all but the lead
8398 character of the incomplete character, but
8399 read() doesn't do that, so I don't.
8404 /* prepare to scan some more */
8405 bytesread += morebytesread;
8406 bend = buffer + bytesread;
8407 bufp = buffer + bufp_offset;
8415 SvCUR_set(sv, bytesread + append);
8416 buffer[bytesread] = '\0';
8417 return (SvCUR(sv) - append) ? SvPVX(sv) : NULL;
8423 Get a line from the filehandle and store it into the SV, optionally
8424 appending to the currently-stored string. If C<append> is not 0, the
8425 line is appended to the SV instead of overwriting it. C<append> should
8426 be set to the byte offset that the appended string should start at
8427 in the SV (typically, C<SvCUR(sv)> is a suitable choice).
8433 Perl_sv_gets(pTHX_ SV *const sv, PerlIO *const fp, I32 append)
8443 PERL_ARGS_ASSERT_SV_GETS;
8445 if (SvTHINKFIRST(sv))
8446 sv_force_normal_flags(sv, append ? 0 : SV_COW_DROP_PV);
8447 /* XXX. If you make this PVIV, then copy on write can copy scalars read
8449 However, perlbench says it's slower, because the existing swipe code
8450 is faster than copy on write.
8451 Swings and roundabouts. */
8452 SvUPGRADE(sv, SVt_PV);
8455 /* line is going to be appended to the existing buffer in the sv */
8456 if (PerlIO_isutf8(fp)) {
8458 sv_utf8_upgrade_nomg(sv);
8459 sv_pos_u2b(sv,&append,0);
8461 } else if (SvUTF8(sv)) {
8462 return S_sv_gets_append_to_utf8(aTHX_ sv, fp, append);
8468 /* not appending - "clear" the string by setting SvCUR to 0,
8469 * the pv is still avaiable. */
8472 if (PerlIO_isutf8(fp))
8475 if (IN_PERL_COMPILETIME) {
8476 /* we always read code in line mode */
8480 else if (RsSNARF(PL_rs)) {
8481 /* If it is a regular disk file use size from stat() as estimate
8482 of amount we are going to read -- may result in mallocing
8483 more memory than we really need if the layers below reduce
8484 the size we read (e.g. CRLF or a gzip layer).
8487 int fd = PerlIO_fileno(fp);
8488 if (fd >= 0 && (PerlLIO_fstat(fd, &st) == 0) && S_ISREG(st.st_mode)) {
8489 const Off_t offset = PerlIO_tell(fp);
8490 if (offset != (Off_t) -1 && st.st_size + append > offset) {
8491 #ifdef PERL_COPY_ON_WRITE
8492 /* Add an extra byte for the sake of copy-on-write's
8493 * buffer reference count. */
8494 (void) SvGROW(sv, (STRLEN)((st.st_size - offset) + append + 2));
8496 (void) SvGROW(sv, (STRLEN)((st.st_size - offset) + append + 1));
8503 else if (RsRECORD(PL_rs)) {
8504 return S_sv_gets_read_record(aTHX_ sv, fp, append);
8506 else if (RsPARA(PL_rs)) {
8512 /* Get $/ i.e. PL_rs into same encoding as stream wants */
8513 if (PerlIO_isutf8(fp)) {
8514 rsptr = SvPVutf8(PL_rs, rslen);
8517 if (SvUTF8(PL_rs)) {
8518 if (!sv_utf8_downgrade(PL_rs, TRUE)) {
8519 Perl_croak(aTHX_ "Wide character in $/");
8522 /* extract the raw pointer to the record separator */
8523 rsptr = SvPV_const(PL_rs, rslen);
8527 /* rslast is the last character in the record separator
8528 * note we don't use rslast except when rslen is true, so the
8529 * null assign is a placeholder. */
8530 rslast = rslen ? rsptr[rslen - 1] : '\0';
8532 if (rspara) { /* have to do this both before and after */
8533 do { /* to make sure file boundaries work right */
8536 i = PerlIO_getc(fp);
8540 PerlIO_ungetc(fp,i);
8546 /* See if we know enough about I/O mechanism to cheat it ! */
8548 /* This used to be #ifdef test - it is made run-time test for ease
8549 of abstracting out stdio interface. One call should be cheap
8550 enough here - and may even be a macro allowing compile
8554 if (PerlIO_fast_gets(fp)) {
8556 * We can do buffer based IO operations on this filehandle.
8558 * This means we can bypass a lot of subcalls and process
8559 * the buffer directly, it also means we know the upper bound
8560 * on the amount of data we might read of the current buffer
8561 * into our sv. Knowing this allows us to preallocate the pv
8562 * to be able to hold that maximum, which allows us to simplify
8563 * a lot of logic. */
8566 * We're going to steal some values from the stdio struct
8567 * and put EVERYTHING in the innermost loop into registers.
8569 STDCHAR *ptr; /* pointer into fp's read-ahead buffer */
8570 STRLEN bpx; /* length of the data in the target sv
8571 used to fix pointers after a SvGROW */
8572 I32 shortbuffered; /* If the pv buffer is shorter than the amount
8573 of data left in the read-ahead buffer.
8574 If 0 then the pv buffer can hold the full
8575 amount left, otherwise this is the amount it
8578 /* Here is some breathtakingly efficient cheating */
8580 /* When you read the following logic resist the urge to think
8581 * of record separators that are 1 byte long. They are an
8582 * uninteresting special (simple) case.
8584 * Instead think of record separators which are at least 2 bytes
8585 * long, and keep in mind that we need to deal with such
8586 * separators when they cross a read-ahead buffer boundary.
8588 * Also consider that we need to gracefully deal with separators
8589 * that may be longer than a single read ahead buffer.
8591 * Lastly do not forget we want to copy the delimiter as well. We
8592 * are copying all data in the file _up_to_and_including_ the separator
8595 * Now that you have all that in mind here is what is happening below:
8597 * 1. When we first enter the loop we do some memory book keeping to see
8598 * how much free space there is in the target SV. (This sub assumes that
8599 * it is operating on the same SV most of the time via $_ and that it is
8600 * going to be able to reuse the same pv buffer each call.) If there is
8601 * "enough" room then we set "shortbuffered" to how much space there is
8602 * and start reading forward.
8604 * 2. When we scan forward we copy from the read-ahead buffer to the target
8605 * SV's pv buffer. While we go we watch for the end of the read-ahead buffer,
8606 * and the end of the of pv, as well as for the "rslast", which is the last
8607 * char of the separator.
8609 * 3. When scanning forward if we see rslast then we jump backwards in *pv*
8610 * (which has a "complete" record up to the point we saw rslast) and check
8611 * it to see if it matches the separator. If it does we are done. If it doesn't
8612 * we continue on with the scan/copy.
8614 * 4. If we run out of read-ahead buffer (cnt goes to 0) then we have to get
8615 * the IO system to read the next buffer. We do this by doing a getc(), which
8616 * returns a single char read (or EOF), and prefills the buffer, and also
8617 * allows us to find out how full the buffer is. We use this information to
8618 * SvGROW() the sv to the size remaining in the buffer, after which we copy
8619 * the returned single char into the target sv, and then go back into scan
8622 * 5. If we run out of write-buffer then we SvGROW() it by the size of the
8623 * remaining space in the read-buffer.
8625 * Note that this code despite its twisty-turny nature is pretty darn slick.
8626 * It manages single byte separators, multi-byte cross boundary separators,
8627 * and cross-read-buffer separators cleanly and efficiently at the cost
8628 * of potentially greatly overallocating the target SV.
8634 /* get the number of bytes remaining in the read-ahead buffer
8635 * on first call on a given fp this will return 0.*/
8636 cnt = PerlIO_get_cnt(fp);
8638 /* make sure we have the room */
8639 if ((I32)(SvLEN(sv) - append) <= cnt + 1) {
8640 /* Not room for all of it
8641 if we are looking for a separator and room for some
8643 if (rslen && cnt > 80 && (I32)SvLEN(sv) > append) {
8644 /* just process what we have room for */
8645 shortbuffered = cnt - SvLEN(sv) + append + 1;
8646 cnt -= shortbuffered;
8649 /* ensure that the target sv has enough room to hold
8650 * the rest of the read-ahead buffer */
8652 /* remember that cnt can be negative */
8653 SvGROW(sv, (STRLEN)(append + (cnt <= 0 ? 2 : (cnt + 1))));
8657 /* we have enough room to hold the full buffer, lets scream */
8661 /* extract the pointer to sv's string buffer, offset by append as necessary */
8662 bp = (STDCHAR*)SvPVX_const(sv) + append; /* move these two too to registers */
8663 /* extract the point to the read-ahead buffer */
8664 ptr = (STDCHAR*)PerlIO_get_ptr(fp);
8666 /* some trace debug output */
8667 DEBUG_P(PerlIO_printf(Perl_debug_log,
8668 "Screamer: entering, ptr=%" UVuf ", cnt=%ld\n",PTR2UV(ptr),(long)cnt));
8669 DEBUG_P(PerlIO_printf(Perl_debug_log,
8670 "Screamer: entering: PerlIO * thinks ptr=%" UVuf ", cnt=%" IVdf ", base=%"
8672 PTR2UV(PerlIO_get_ptr(fp)), (IV)PerlIO_get_cnt(fp),
8673 PTR2UV(PerlIO_has_base(fp) ? PerlIO_get_base(fp) : 0)));
8677 /* if there is stuff left in the read-ahead buffer */
8679 /* if there is a separator */
8681 /* find next rslast */
8684 /* shortcut common case of blank line */
8686 if ((*bp++ = *ptr++) == rslast)
8687 goto thats_all_folks;
8689 p = (STDCHAR *)memchr(ptr, rslast, cnt);
8691 SSize_t got = p - ptr + 1;
8692 Copy(ptr, bp, got, STDCHAR);
8696 goto thats_all_folks;
8698 Copy(ptr, bp, cnt, STDCHAR);
8704 /* no separator, slurp the full buffer */
8705 Copy(ptr, bp, cnt, char); /* this | eat */
8706 bp += cnt; /* screams | dust */
8707 ptr += cnt; /* louder | sed :-) */
8709 assert (!shortbuffered);
8710 goto cannot_be_shortbuffered;
8714 if (shortbuffered) { /* oh well, must extend */
8715 /* we didnt have enough room to fit the line into the target buffer
8716 * so we must extend the target buffer and keep going */
8717 cnt = shortbuffered;
8719 bpx = bp - (STDCHAR*)SvPVX_const(sv); /* box up before relocation */
8721 /* extned the target sv's buffer so it can hold the full read-ahead buffer */
8722 SvGROW(sv, SvLEN(sv) + append + cnt + 2);
8723 bp = (STDCHAR*)SvPVX_const(sv) + bpx; /* unbox after relocation */
8727 cannot_be_shortbuffered:
8728 /* we need to refill the read-ahead buffer if possible */
8730 DEBUG_P(PerlIO_printf(Perl_debug_log,
8731 "Screamer: going to getc, ptr=%" UVuf ", cnt=%" IVdf "\n",
8732 PTR2UV(ptr),(IV)cnt));
8733 PerlIO_set_ptrcnt(fp, (STDCHAR*)ptr, cnt); /* deregisterize cnt and ptr */
8735 DEBUG_Pv(PerlIO_printf(Perl_debug_log,
8736 "Screamer: pre: FILE * thinks ptr=%" UVuf ", cnt=%" IVdf ", base=%" UVuf "\n",
8737 PTR2UV(PerlIO_get_ptr(fp)), (IV)PerlIO_get_cnt(fp),
8738 PTR2UV(PerlIO_has_base (fp) ? PerlIO_get_base(fp) : 0)));
8741 call PerlIO_getc() to let it prefill the lookahead buffer
8743 This used to call 'filbuf' in stdio form, but as that behaves like
8744 getc when cnt <= 0 we use PerlIO_getc here to avoid introducing
8745 another abstraction.
8747 Note we have to deal with the char in 'i' if we are not at EOF
8749 i = PerlIO_getc(fp); /* get more characters */
8751 DEBUG_Pv(PerlIO_printf(Perl_debug_log,
8752 "Screamer: post: FILE * thinks ptr=%" UVuf ", cnt=%" IVdf ", base=%" UVuf "\n",
8753 PTR2UV(PerlIO_get_ptr(fp)), (IV)PerlIO_get_cnt(fp),
8754 PTR2UV(PerlIO_has_base (fp) ? PerlIO_get_base(fp) : 0)));
8756 /* find out how much is left in the read-ahead buffer, and rextract its pointer */
8757 cnt = PerlIO_get_cnt(fp);
8758 ptr = (STDCHAR*)PerlIO_get_ptr(fp); /* reregisterize cnt and ptr */
8759 DEBUG_P(PerlIO_printf(Perl_debug_log,
8760 "Screamer: after getc, ptr=%" UVuf ", cnt=%" IVdf "\n",
8761 PTR2UV(ptr),(IV)cnt));
8763 if (i == EOF) /* all done for ever? */
8764 goto thats_really_all_folks;
8766 /* make sure we have enough space in the target sv */
8767 bpx = bp - (STDCHAR*)SvPVX_const(sv); /* box up before relocation */
8769 SvGROW(sv, bpx + cnt + 2);
8770 bp = (STDCHAR*)SvPVX_const(sv) + bpx; /* unbox after relocation */
8772 /* copy of the char we got from getc() */
8773 *bp++ = (STDCHAR)i; /* store character from PerlIO_getc */
8775 /* make sure we deal with the i being the last character of a separator */
8776 if (rslen && (STDCHAR)i == rslast) /* all done for now? */
8777 goto thats_all_folks;
8781 /* check if we have actually found the separator - only really applies
8783 if ((rslen > 1 && (STRLEN)(bp - (STDCHAR*)SvPVX_const(sv)) < rslen) ||
8784 memNE((char*)bp - rslen, rsptr, rslen))
8785 goto screamer; /* go back to the fray */
8786 thats_really_all_folks:
8788 cnt += shortbuffered;
8789 DEBUG_P(PerlIO_printf(Perl_debug_log,
8790 "Screamer: quitting, ptr=%" UVuf ", cnt=%" IVdf "\n",PTR2UV(ptr),(IV)cnt));
8791 PerlIO_set_ptrcnt(fp, (STDCHAR*)ptr, cnt); /* put these back or we're in trouble */
8792 DEBUG_P(PerlIO_printf(Perl_debug_log,
8793 "Screamer: end: FILE * thinks ptr=%" UVuf ", cnt=%" IVdf ", base=%" UVuf
8795 PTR2UV(PerlIO_get_ptr(fp)), (IV)PerlIO_get_cnt(fp),
8796 PTR2UV(PerlIO_has_base (fp) ? PerlIO_get_base(fp) : 0)));
8798 SvCUR_set(sv, bp - (STDCHAR*)SvPVX_const(sv)); /* set length */
8799 DEBUG_P(PerlIO_printf(Perl_debug_log,
8800 "Screamer: done, len=%ld, string=|%.*s|\n",
8801 (long)SvCUR(sv),(int)SvCUR(sv),SvPVX_const(sv)));
8805 /*The big, slow, and stupid way. */
8806 #ifdef USE_HEAP_INSTEAD_OF_STACK /* Even slower way. */
8807 STDCHAR *buf = NULL;
8808 Newx(buf, 8192, STDCHAR);
8816 const STDCHAR * const bpe = buf + sizeof(buf);
8818 while ((i = PerlIO_getc(fp)) != EOF && (*bp++ = (STDCHAR)i) != rslast && bp < bpe)
8819 ; /* keep reading */
8823 cnt = PerlIO_read(fp,(char*)buf, sizeof(buf));
8824 /* Accommodate broken VAXC compiler, which applies U8 cast to
8825 * both args of ?: operator, causing EOF to change into 255
8828 i = (U8)buf[cnt - 1];
8834 cnt = 0; /* we do need to re-set the sv even when cnt <= 0 */
8836 sv_catpvn_nomg(sv, (char *) buf, cnt);
8838 sv_setpvn(sv, (char *) buf, cnt); /* "nomg" is implied */
8840 if (i != EOF && /* joy */
8842 SvCUR(sv) < rslen ||
8843 memNE(SvPVX_const(sv) + SvCUR(sv) - rslen, rsptr, rslen)))
8847 * If we're reading from a TTY and we get a short read,
8848 * indicating that the user hit his EOF character, we need
8849 * to notice it now, because if we try to read from the TTY
8850 * again, the EOF condition will disappear.
8852 * The comparison of cnt to sizeof(buf) is an optimization
8853 * that prevents unnecessary calls to feof().
8857 if (!(cnt < (I32)sizeof(buf) && PerlIO_eof(fp)))
8861 #ifdef USE_HEAP_INSTEAD_OF_STACK
8866 if (rspara) { /* have to do this both before and after */
8867 while (i != EOF) { /* to make sure file boundaries work right */
8868 i = PerlIO_getc(fp);
8870 PerlIO_ungetc(fp,i);
8876 return (SvCUR(sv) - append) ? SvPVX(sv) : NULL;
8882 Auto-increment of the value in the SV, doing string to numeric conversion
8883 if necessary. Handles 'get' magic and operator overloading.
8889 Perl_sv_inc(pTHX_ SV *const sv)
8898 =for apidoc sv_inc_nomg
8900 Auto-increment of the value in the SV, doing string to numeric conversion
8901 if necessary. Handles operator overloading. Skips handling 'get' magic.
8907 Perl_sv_inc_nomg(pTHX_ SV *const sv)
8914 if (SvTHINKFIRST(sv)) {
8915 if (SvREADONLY(sv)) {
8916 Perl_croak_no_modify();
8920 if (SvAMAGIC(sv) && AMG_CALLunary(sv, inc_amg))
8922 i = PTR2IV(SvRV(sv));
8926 else sv_force_normal_flags(sv, 0);
8928 flags = SvFLAGS(sv);
8929 if ((flags & (SVp_NOK|SVp_IOK)) == SVp_NOK) {
8930 /* It's (privately or publicly) a float, but not tested as an
8931 integer, so test it to see. */
8933 flags = SvFLAGS(sv);
8935 if ((flags & SVf_IOK) || ((flags & (SVp_IOK | SVp_NOK)) == SVp_IOK)) {
8936 /* It's publicly an integer, or privately an integer-not-float */
8937 #ifdef PERL_PRESERVE_IVUV
8941 if (SvUVX(sv) == UV_MAX)
8942 sv_setnv(sv, UV_MAX_P1);
8944 (void)SvIOK_only_UV(sv);
8945 SvUV_set(sv, SvUVX(sv) + 1);
8947 if (SvIVX(sv) == IV_MAX)
8948 sv_setuv(sv, (UV)IV_MAX + 1);
8950 (void)SvIOK_only(sv);
8951 SvIV_set(sv, SvIVX(sv) + 1);
8956 if (flags & SVp_NOK) {
8957 const NV was = SvNVX(sv);
8958 if (LIKELY(!Perl_isinfnan(was)) &&
8959 NV_OVERFLOWS_INTEGERS_AT &&
8960 was >= NV_OVERFLOWS_INTEGERS_AT) {
8961 /* diag_listed_as: Lost precision when %s %f by 1 */
8962 Perl_ck_warner(aTHX_ packWARN(WARN_IMPRECISION),
8963 "Lost precision when incrementing %" NVff " by 1",
8966 (void)SvNOK_only(sv);
8967 SvNV_set(sv, was + 1.0);
8971 /* treat AV/HV/CV/FM/IO and non-fake GVs as immutable */
8972 if (SvTYPE(sv) >= SVt_PVAV || (isGV_with_GP(sv) && !SvFAKE(sv)))
8973 Perl_croak_no_modify();
8975 if (!(flags & SVp_POK) || !*SvPVX_const(sv)) {
8976 if ((flags & SVTYPEMASK) < SVt_PVIV)
8977 sv_upgrade(sv, ((flags & SVTYPEMASK) > SVt_IV ? SVt_PVIV : SVt_IV));
8978 (void)SvIOK_only(sv);
8983 while (isALPHA(*d)) d++;
8984 while (isDIGIT(*d)) d++;
8985 if (d < SvEND(sv)) {
8986 const int numtype = grok_number_flags(SvPVX_const(sv), SvCUR(sv), NULL, PERL_SCAN_TRAILING);
8987 #ifdef PERL_PRESERVE_IVUV
8988 /* Got to punt this as an integer if needs be, but we don't issue
8989 warnings. Probably ought to make the sv_iv_please() that does
8990 the conversion if possible, and silently. */
8991 if (numtype && !(numtype & IS_NUMBER_INFINITY)) {
8992 /* Need to try really hard to see if it's an integer.
8993 9.22337203685478e+18 is an integer.
8994 but "9.22337203685478e+18" + 0 is UV=9223372036854779904
8995 so $a="9.22337203685478e+18"; $a+0; $a++
8996 needs to be the same as $a="9.22337203685478e+18"; $a++
9003 /* sv_2iv *should* have made this an NV */
9004 if (flags & SVp_NOK) {
9005 (void)SvNOK_only(sv);
9006 SvNV_set(sv, SvNVX(sv) + 1.0);
9009 /* I don't think we can get here. Maybe I should assert this
9010 And if we do get here I suspect that sv_setnv will croak. NWC
9012 DEBUG_c(PerlIO_printf(Perl_debug_log,"sv_inc punt failed to convert '%s' to IOK or NOKp, UV=0x%" UVxf " NV=%" NVgf "\n",
9013 SvPVX_const(sv), SvIVX(sv), SvNVX(sv)));
9015 #endif /* PERL_PRESERVE_IVUV */
9016 if (!numtype && ckWARN(WARN_NUMERIC))
9017 not_incrementable(sv);
9018 sv_setnv(sv,Atof(SvPVX_const(sv)) + 1.0);
9022 while (d >= SvPVX_const(sv)) {
9030 /* MKS: The original code here died if letters weren't consecutive.
9031 * at least it didn't have to worry about non-C locales. The
9032 * new code assumes that ('z'-'a')==('Z'-'A'), letters are
9033 * arranged in order (although not consecutively) and that only
9034 * [A-Za-z] are accepted by isALPHA in the C locale.
9036 if (isALPHA_FOLD_NE(*d, 'z')) {
9037 do { ++*d; } while (!isALPHA(*d));
9040 *(d--) -= 'z' - 'a';
9045 *(d--) -= 'z' - 'a' + 1;
9049 /* oh,oh, the number grew */
9050 SvGROW(sv, SvCUR(sv) + 2);
9051 SvCUR_set(sv, SvCUR(sv) + 1);
9052 for (d = SvPVX(sv) + SvCUR(sv); d > SvPVX_const(sv); d--)
9063 Auto-decrement of the value in the SV, doing string to numeric conversion
9064 if necessary. Handles 'get' magic and operator overloading.
9070 Perl_sv_dec(pTHX_ SV *const sv)
9079 =for apidoc sv_dec_nomg
9081 Auto-decrement of the value in the SV, doing string to numeric conversion
9082 if necessary. Handles operator overloading. Skips handling 'get' magic.
9088 Perl_sv_dec_nomg(pTHX_ SV *const sv)
9094 if (SvTHINKFIRST(sv)) {
9095 if (SvREADONLY(sv)) {
9096 Perl_croak_no_modify();
9100 if (SvAMAGIC(sv) && AMG_CALLunary(sv, dec_amg))
9102 i = PTR2IV(SvRV(sv));
9106 else sv_force_normal_flags(sv, 0);
9108 /* Unlike sv_inc we don't have to worry about string-never-numbers
9109 and keeping them magic. But we mustn't warn on punting */
9110 flags = SvFLAGS(sv);
9111 if ((flags & SVf_IOK) || ((flags & (SVp_IOK | SVp_NOK)) == SVp_IOK)) {
9112 /* It's publicly an integer, or privately an integer-not-float */
9113 #ifdef PERL_PRESERVE_IVUV
9117 if (SvUVX(sv) == 0) {
9118 (void)SvIOK_only(sv);
9122 (void)SvIOK_only_UV(sv);
9123 SvUV_set(sv, SvUVX(sv) - 1);
9126 if (SvIVX(sv) == IV_MIN) {
9127 sv_setnv(sv, (NV)IV_MIN);
9131 (void)SvIOK_only(sv);
9132 SvIV_set(sv, SvIVX(sv) - 1);
9137 if (flags & SVp_NOK) {
9140 const NV was = SvNVX(sv);
9141 if (LIKELY(!Perl_isinfnan(was)) &&
9142 NV_OVERFLOWS_INTEGERS_AT &&
9143 was <= -NV_OVERFLOWS_INTEGERS_AT) {
9144 /* diag_listed_as: Lost precision when %s %f by 1 */
9145 Perl_ck_warner(aTHX_ packWARN(WARN_IMPRECISION),
9146 "Lost precision when decrementing %" NVff " by 1",
9149 (void)SvNOK_only(sv);
9150 SvNV_set(sv, was - 1.0);
9155 /* treat AV/HV/CV/FM/IO and non-fake GVs as immutable */
9156 if (SvTYPE(sv) >= SVt_PVAV || (isGV_with_GP(sv) && !SvFAKE(sv)))
9157 Perl_croak_no_modify();
9159 if (!(flags & SVp_POK)) {
9160 if ((flags & SVTYPEMASK) < SVt_PVIV)
9161 sv_upgrade(sv, ((flags & SVTYPEMASK) > SVt_IV) ? SVt_PVIV : SVt_IV);
9163 (void)SvIOK_only(sv);
9166 #ifdef PERL_PRESERVE_IVUV
9168 const int numtype = grok_number(SvPVX_const(sv), SvCUR(sv), NULL);
9169 if (numtype && !(numtype & IS_NUMBER_INFINITY)) {
9170 /* Need to try really hard to see if it's an integer.
9171 9.22337203685478e+18 is an integer.
9172 but "9.22337203685478e+18" + 0 is UV=9223372036854779904
9173 so $a="9.22337203685478e+18"; $a+0; $a--
9174 needs to be the same as $a="9.22337203685478e+18"; $a--
9181 /* sv_2iv *should* have made this an NV */
9182 if (flags & SVp_NOK) {
9183 (void)SvNOK_only(sv);
9184 SvNV_set(sv, SvNVX(sv) - 1.0);
9187 /* I don't think we can get here. Maybe I should assert this
9188 And if we do get here I suspect that sv_setnv will croak. NWC
9190 DEBUG_c(PerlIO_printf(Perl_debug_log,"sv_dec punt failed to convert '%s' to IOK or NOKp, UV=0x%" UVxf " NV=%" NVgf "\n",
9191 SvPVX_const(sv), SvIVX(sv), SvNVX(sv)));
9194 #endif /* PERL_PRESERVE_IVUV */
9195 sv_setnv(sv,Atof(SvPVX_const(sv)) - 1.0); /* punt */
9198 /* this define is used to eliminate a chunk of duplicated but shared logic
9199 * it has the suffix __SV_C to signal that it isnt API, and isnt meant to be
9200 * used anywhere but here - yves
9202 #define PUSH_EXTEND_MORTAL__SV_C(AnSv) \
9204 SSize_t ix = ++PL_tmps_ix; \
9205 if (UNLIKELY(ix >= PL_tmps_max)) \
9206 ix = tmps_grow_p(ix); \
9207 PL_tmps_stack[ix] = (AnSv); \
9211 =for apidoc sv_mortalcopy
9213 Creates a new SV which is a copy of the original SV (using C<sv_setsv>).
9214 The new SV is marked as mortal. It will be destroyed "soon", either by an
9215 explicit call to C<FREETMPS>, or by an implicit call at places such as
9216 statement boundaries. See also C<L</sv_newmortal>> and C<L</sv_2mortal>>.
9221 /* Make a string that will exist for the duration of the expression
9222 * evaluation. Actually, it may have to last longer than that, but
9223 * hopefully we won't free it until it has been assigned to a
9224 * permanent location. */
9227 Perl_sv_mortalcopy_flags(pTHX_ SV *const oldstr, U32 flags)
9231 if (flags & SV_GMAGIC)
9232 SvGETMAGIC(oldstr); /* before new_SV, in case it dies */
9234 sv_setsv_flags(sv,oldstr,flags & ~SV_GMAGIC);
9235 PUSH_EXTEND_MORTAL__SV_C(sv);
9241 =for apidoc sv_newmortal
9243 Creates a new null SV which is mortal. The reference count of the SV is
9244 set to 1. It will be destroyed "soon", either by an explicit call to
9245 C<FREETMPS>, or by an implicit call at places such as statement boundaries.
9246 See also C<L</sv_mortalcopy>> and C<L</sv_2mortal>>.
9252 Perl_sv_newmortal(pTHX)
9257 SvFLAGS(sv) = SVs_TEMP;
9258 PUSH_EXTEND_MORTAL__SV_C(sv);
9264 =for apidoc newSVpvn_flags
9266 Creates a new SV and copies a string (which may contain C<NUL> (C<\0>)
9267 characters) into it. The reference count for the
9268 SV is set to 1. Note that if C<len> is zero, Perl will create a zero length
9269 string. You are responsible for ensuring that the source string is at least
9270 C<len> bytes long. If the C<s> argument is NULL the new SV will be undefined.
9271 Currently the only flag bits accepted are C<SVf_UTF8> and C<SVs_TEMP>.
9272 If C<SVs_TEMP> is set, then C<sv_2mortal()> is called on the result before
9273 returning. If C<SVf_UTF8> is set, C<s>
9274 is considered to be in UTF-8 and the
9275 C<SVf_UTF8> flag will be set on the new SV.
9276 C<newSVpvn_utf8()> is a convenience wrapper for this function, defined as
9278 #define newSVpvn_utf8(s, len, u) \
9279 newSVpvn_flags((s), (len), (u) ? SVf_UTF8 : 0)
9285 Perl_newSVpvn_flags(pTHX_ const char *const s, const STRLEN len, const U32 flags)
9289 /* All the flags we don't support must be zero.
9290 And we're new code so I'm going to assert this from the start. */
9291 assert(!(flags & ~(SVf_UTF8|SVs_TEMP)));
9293 sv_setpvn(sv,s,len);
9295 /* This code used to do a sv_2mortal(), however we now unroll the call to
9296 * sv_2mortal() and do what it does ourselves here. Since we have asserted
9297 * that flags can only have the SVf_UTF8 and/or SVs_TEMP flags set above we
9298 * can use it to enable the sv flags directly (bypassing SvTEMP_on), which
9299 * in turn means we dont need to mask out the SVf_UTF8 flag below, which
9300 * means that we eliminate quite a few steps than it looks - Yves
9301 * (explaining patch by gfx) */
9303 SvFLAGS(sv) |= flags;
9305 if(flags & SVs_TEMP){
9306 PUSH_EXTEND_MORTAL__SV_C(sv);
9313 =for apidoc sv_2mortal
9315 Marks an existing SV as mortal. The SV will be destroyed "soon", either
9316 by an explicit call to C<FREETMPS>, or by an implicit call at places such as
9317 statement boundaries. C<SvTEMP()> is turned on which means that the SV's
9318 string buffer can be "stolen" if this SV is copied. See also
9319 C<L</sv_newmortal>> and C<L</sv_mortalcopy>>.
9325 Perl_sv_2mortal(pTHX_ SV *const sv)
9332 PUSH_EXTEND_MORTAL__SV_C(sv);
9340 Creates a new SV and copies a string (which may contain C<NUL> (C<\0>)
9341 characters) into it. The reference count for the
9342 SV is set to 1. If C<len> is zero, Perl will compute the length using
9343 C<strlen()>, (which means if you use this option, that C<s> can't have embedded
9344 C<NUL> characters and has to have a terminating C<NUL> byte).
9346 This function can cause reliability issues if you are likely to pass in
9347 empty strings that are not null terminated, because it will run
9348 strlen on the string and potentially run past valid memory.
9350 Using L</newSVpvn> is a safer alternative for non C<NUL> terminated strings.
9351 For string literals use L</newSVpvs> instead. This function will work fine for
9352 C<NUL> terminated strings, but if you want to avoid the if statement on whether
9353 to call C<strlen> use C<newSVpvn> instead (calling C<strlen> yourself).
9359 Perl_newSVpv(pTHX_ const char *const s, const STRLEN len)
9364 sv_setpvn(sv, s, len || s == NULL ? len : strlen(s));
9369 =for apidoc newSVpvn
9371 Creates a new SV and copies a string into it, which may contain C<NUL> characters
9372 (C<\0>) and other binary data. The reference count for the SV is set to 1.
9373 Note that if C<len> is zero, Perl will create a zero length (Perl) string. You
9374 are responsible for ensuring that the source buffer is at least
9375 C<len> bytes long. If the C<buffer> argument is NULL the new SV will be
9382 Perl_newSVpvn(pTHX_ const char *const buffer, const STRLEN len)
9386 sv_setpvn(sv,buffer,len);
9391 =for apidoc newSVhek
9393 Creates a new SV from the hash key structure. It will generate scalars that
9394 point to the shared string table where possible. Returns a new (undefined)
9395 SV if C<hek> is NULL.
9401 Perl_newSVhek(pTHX_ const HEK *const hek)
9410 if (HEK_LEN(hek) == HEf_SVKEY) {
9411 return newSVsv(*(SV**)HEK_KEY(hek));
9413 const int flags = HEK_FLAGS(hek);
9414 if (flags & HVhek_WASUTF8) {
9416 Andreas would like keys he put in as utf8 to come back as utf8
9418 STRLEN utf8_len = HEK_LEN(hek);
9419 SV * const sv = newSV_type(SVt_PV);
9420 char *as_utf8 = (char *)bytes_to_utf8 ((U8*)HEK_KEY(hek), &utf8_len);
9421 /* bytes_to_utf8() allocates a new string, which we can repurpose: */
9422 sv_usepvn_flags(sv, as_utf8, utf8_len, SV_HAS_TRAILING_NUL);
9425 } else if (flags & HVhek_UNSHARED) {
9426 /* A hash that isn't using shared hash keys has to have
9427 the flag in every key so that we know not to try to call
9428 share_hek_hek on it. */
9430 SV * const sv = newSVpvn (HEK_KEY(hek), HEK_LEN(hek));
9435 /* This will be overwhelminly the most common case. */
9437 /* Inline most of newSVpvn_share(), because share_hek_hek() is far
9438 more efficient than sharepvn(). */
9442 sv_upgrade(sv, SVt_PV);
9443 SvPV_set(sv, (char *)HEK_KEY(share_hek_hek(hek)));
9444 SvCUR_set(sv, HEK_LEN(hek));
9456 =for apidoc newSVpvn_share
9458 Creates a new SV with its C<SvPVX_const> pointing to a shared string in the string
9459 table. If the string does not already exist in the table, it is
9460 created first. Turns on the C<SvIsCOW> flag (or C<READONLY>
9461 and C<FAKE> in 5.16 and earlier). If the C<hash> parameter
9462 is non-zero, that value is used; otherwise the hash is computed.
9463 The string's hash can later be retrieved from the SV
9464 with the C<SvSHARED_HASH()> macro. The idea here is
9465 that as the string table is used for shared hash keys these strings will have
9466 C<SvPVX_const == HeKEY> and hash lookup will avoid string compare.
9472 Perl_newSVpvn_share(pTHX_ const char *src, I32 len, U32 hash)
9476 bool is_utf8 = FALSE;
9477 const char *const orig_src = src;
9480 STRLEN tmplen = -len;
9482 /* See the note in hv.c:hv_fetch() --jhi */
9483 src = (char*)bytes_from_utf8((const U8*)src, &tmplen, &is_utf8);
9487 PERL_HASH(hash, src, len);
9489 /* The logic for this is inlined in S_mro_get_linear_isa_dfs(), so if it
9490 changes here, update it there too. */
9491 sv_upgrade(sv, SVt_PV);
9492 SvPV_set(sv, sharepvn(src, is_utf8?-len:len, hash));
9499 if (src != orig_src)
9505 =for apidoc newSVpv_share
9507 Like C<newSVpvn_share>, but takes a C<NUL>-terminated string instead of a
9514 Perl_newSVpv_share(pTHX_ const char *src, U32 hash)
9516 return newSVpvn_share(src, strlen(src), hash);
9519 #if defined(PERL_IMPLICIT_CONTEXT)
9521 /* pTHX_ magic can't cope with varargs, so this is a no-context
9522 * version of the main function, (which may itself be aliased to us).
9523 * Don't access this version directly.
9527 Perl_newSVpvf_nocontext(const char *const pat, ...)
9533 PERL_ARGS_ASSERT_NEWSVPVF_NOCONTEXT;
9535 va_start(args, pat);
9536 sv = vnewSVpvf(pat, &args);
9543 =for apidoc newSVpvf
9545 Creates a new SV and initializes it with the string formatted like
9552 Perl_newSVpvf(pTHX_ const char *const pat, ...)
9557 PERL_ARGS_ASSERT_NEWSVPVF;
9559 va_start(args, pat);
9560 sv = vnewSVpvf(pat, &args);
9565 /* backend for newSVpvf() and newSVpvf_nocontext() */
9568 Perl_vnewSVpvf(pTHX_ const char *const pat, va_list *const args)
9572 PERL_ARGS_ASSERT_VNEWSVPVF;
9575 sv_vsetpvfn(sv, pat, strlen(pat), args, NULL, 0, NULL);
9582 Creates a new SV and copies a floating point value into it.
9583 The reference count for the SV is set to 1.
9589 Perl_newSVnv(pTHX_ const NV n)
9601 Creates a new SV and copies an integer into it. The reference count for the
9608 Perl_newSViv(pTHX_ const IV i)
9614 /* Inlining ONLY the small relevant subset of sv_setiv here
9615 * for performance. Makes a significant difference. */
9617 /* We're starting from SVt_FIRST, so provided that's
9618 * actual 0, we don't have to unset any SV type flags
9619 * to promote to SVt_IV. */
9620 STATIC_ASSERT_STMT(SVt_FIRST == 0);
9622 SET_SVANY_FOR_BODYLESS_IV(sv);
9623 SvFLAGS(sv) |= SVt_IV;
9635 Creates a new SV and copies an unsigned integer into it.
9636 The reference count for the SV is set to 1.
9642 Perl_newSVuv(pTHX_ const UV u)
9646 /* Inlining ONLY the small relevant subset of sv_setuv here
9647 * for performance. Makes a significant difference. */
9649 /* Using ivs is more efficient than using uvs - see sv_setuv */
9650 if (u <= (UV)IV_MAX) {
9651 return newSViv((IV)u);
9656 /* We're starting from SVt_FIRST, so provided that's
9657 * actual 0, we don't have to unset any SV type flags
9658 * to promote to SVt_IV. */
9659 STATIC_ASSERT_STMT(SVt_FIRST == 0);
9661 SET_SVANY_FOR_BODYLESS_IV(sv);
9662 SvFLAGS(sv) |= SVt_IV;
9664 (void)SvIsUV_on(sv);
9673 =for apidoc newSV_type
9675 Creates a new SV, of the type specified. The reference count for the new SV
9682 Perl_newSV_type(pTHX_ const svtype type)
9687 ASSUME(SvTYPE(sv) == SVt_FIRST);
9688 if(type != SVt_FIRST)
9689 sv_upgrade(sv, type);
9694 =for apidoc newRV_noinc
9696 Creates an RV wrapper for an SV. The reference count for the original
9697 SV is B<not> incremented.
9703 Perl_newRV_noinc(pTHX_ SV *const tmpRef)
9707 PERL_ARGS_ASSERT_NEWRV_NOINC;
9711 /* We're starting from SVt_FIRST, so provided that's
9712 * actual 0, we don't have to unset any SV type flags
9713 * to promote to SVt_IV. */
9714 STATIC_ASSERT_STMT(SVt_FIRST == 0);
9716 SET_SVANY_FOR_BODYLESS_IV(sv);
9717 SvFLAGS(sv) |= SVt_IV;
9722 SvRV_set(sv, tmpRef);
9727 /* newRV_inc is the official function name to use now.
9728 * newRV_inc is in fact #defined to newRV in sv.h
9732 Perl_newRV(pTHX_ SV *const sv)
9734 PERL_ARGS_ASSERT_NEWRV;
9736 return newRV_noinc(SvREFCNT_inc_simple_NN(sv));
9742 Creates a new SV which is an exact duplicate of the original SV.
9749 Perl_newSVsv(pTHX_ SV *const old)
9755 if (SvTYPE(old) == (svtype)SVTYPEMASK) {
9756 Perl_ck_warner_d(aTHX_ packWARN(WARN_INTERNAL), "semi-panic: attempt to dup freed string");
9759 /* Do this here, otherwise we leak the new SV if this croaks. */
9762 /* SV_NOSTEAL prevents TEMP buffers being, well, stolen, and saves games
9763 with SvTEMP_off and SvTEMP_on round a call to sv_setsv. */
9764 sv_setsv_flags(sv, old, SV_NOSTEAL);
9769 =for apidoc sv_reset
9771 Underlying implementation for the C<reset> Perl function.
9772 Note that the perl-level function is vaguely deprecated.
9778 Perl_sv_reset(pTHX_ const char *s, HV *const stash)
9780 PERL_ARGS_ASSERT_SV_RESET;
9782 sv_resetpvn(*s ? s : NULL, strlen(s), stash);
9786 Perl_sv_resetpvn(pTHX_ const char *s, STRLEN len, HV * const stash)
9788 char todo[PERL_UCHAR_MAX+1];
9791 if (!stash || SvTYPE(stash) != SVt_PVHV)
9794 if (!s) { /* reset ?? searches */
9795 MAGIC * const mg = mg_find((const SV *)stash, PERL_MAGIC_symtab);
9797 const U32 count = mg->mg_len / sizeof(PMOP**);
9798 PMOP **pmp = (PMOP**) mg->mg_ptr;
9799 PMOP *const *const end = pmp + count;
9803 SvREADONLY_off(PL_regex_pad[(*pmp)->op_pmoffset]);
9805 (*pmp)->op_pmflags &= ~PMf_USED;
9813 /* reset variables */
9815 if (!HvARRAY(stash))
9818 Zero(todo, 256, char);
9822 I32 i = (unsigned char)*s;
9826 max = (unsigned char)*s++;
9827 for ( ; i <= max; i++) {
9830 for (i = 0; i <= (I32) HvMAX(stash); i++) {
9832 for (entry = HvARRAY(stash)[i];
9834 entry = HeNEXT(entry))
9839 if (!todo[(U8)*HeKEY(entry)])
9841 gv = MUTABLE_GV(HeVAL(entry));
9845 if (sv && !SvREADONLY(sv)) {
9846 SV_CHECK_THINKFIRST_COW_DROP(sv);
9847 if (!isGV(sv)) SvOK_off(sv);
9852 if (GvHV(gv) && !HvNAME_get(GvHV(gv))) {
9863 Using various gambits, try to get an IO from an SV: the IO slot if its a
9864 GV; or the recursive result if we're an RV; or the IO slot of the symbol
9865 named after the PV if we're a string.
9867 'Get' magic is ignored on the C<sv> passed in, but will be called on
9868 C<SvRV(sv)> if C<sv> is an RV.
9874 Perl_sv_2io(pTHX_ SV *const sv)
9879 PERL_ARGS_ASSERT_SV_2IO;
9881 switch (SvTYPE(sv)) {
9883 io = MUTABLE_IO(sv);
9887 if (isGV_with_GP(sv)) {
9888 gv = MUTABLE_GV(sv);
9891 Perl_croak(aTHX_ "Bad filehandle: %" HEKf,
9892 HEKfARG(GvNAME_HEK(gv)));
9898 Perl_croak(aTHX_ PL_no_usym, "filehandle");
9900 SvGETMAGIC(SvRV(sv));
9901 return sv_2io(SvRV(sv));
9903 gv = gv_fetchsv_nomg(sv, 0, SVt_PVIO);
9910 if (SvGMAGICAL(sv)) {
9911 newsv = sv_newmortal();
9912 sv_setsv_nomg(newsv, sv);
9914 Perl_croak(aTHX_ "Bad filehandle: %" SVf, SVfARG(newsv));
9924 Using various gambits, try to get a CV from an SV; in addition, try if
9925 possible to set C<*st> and C<*gvp> to the stash and GV associated with it.
9926 The flags in C<lref> are passed to C<gv_fetchsv>.
9932 Perl_sv_2cv(pTHX_ SV *sv, HV **const st, GV **const gvp, const I32 lref)
9937 PERL_ARGS_ASSERT_SV_2CV;
9944 switch (SvTYPE(sv)) {
9948 return MUTABLE_CV(sv);
9958 sv = amagic_deref_call(sv, to_cv_amg);
9961 if (SvTYPE(sv) == SVt_PVCV) {
9962 cv = MUTABLE_CV(sv);
9967 else if(SvGETMAGIC(sv), isGV_with_GP(sv))
9968 gv = MUTABLE_GV(sv);
9970 Perl_croak(aTHX_ "Not a subroutine reference");
9972 else if (isGV_with_GP(sv)) {
9973 gv = MUTABLE_GV(sv);
9976 gv = gv_fetchsv_nomg(sv, lref, SVt_PVCV);
9983 /* Some flags to gv_fetchsv mean don't really create the GV */
9984 if (!isGV_with_GP(gv)) {
9989 if (lref & ~GV_ADDMG && !GvCVu(gv)) {
9990 /* XXX this is probably not what they think they're getting.
9991 * It has the same effect as "sub name;", i.e. just a forward
10000 =for apidoc sv_true
10002 Returns true if the SV has a true value by Perl's rules.
10003 Use the C<SvTRUE> macro instead, which may call C<sv_true()> or may
10004 instead use an in-line version.
10010 Perl_sv_true(pTHX_ SV *const sv)
10015 const XPV* const tXpv = (XPV*)SvANY(sv);
10017 (tXpv->xpv_cur > 1 ||
10018 (tXpv->xpv_cur && *sv->sv_u.svu_pv != '0')))
10025 return SvIVX(sv) != 0;
10028 return SvNVX(sv) != 0.0;
10030 return sv_2bool(sv);
10036 =for apidoc sv_pvn_force
10038 Get a sensible string out of the SV somehow.
10039 A private implementation of the C<SvPV_force> macro for compilers which
10040 can't cope with complex macro expressions. Always use the macro instead.
10042 =for apidoc sv_pvn_force_flags
10044 Get a sensible string out of the SV somehow.
10045 If C<flags> has the C<SV_GMAGIC> bit set, will C<mg_get> on C<sv> if
10046 appropriate, else not. C<sv_pvn_force> and C<sv_pvn_force_nomg> are
10047 implemented in terms of this function.
10048 You normally want to use the various wrapper macros instead: see
10049 C<L</SvPV_force>> and C<L</SvPV_force_nomg>>.
10055 Perl_sv_pvn_force_flags(pTHX_ SV *const sv, STRLEN *const lp, const I32 flags)
10057 PERL_ARGS_ASSERT_SV_PVN_FORCE_FLAGS;
10059 if (flags & SV_GMAGIC) SvGETMAGIC(sv);
10060 if (SvTHINKFIRST(sv) && (!SvROK(sv) || SvREADONLY(sv)))
10061 sv_force_normal_flags(sv, 0);
10071 if (SvTYPE(sv) > SVt_PVLV
10072 || isGV_with_GP(sv))
10073 /* diag_listed_as: Can't coerce %s to %s in %s */
10074 Perl_croak(aTHX_ "Can't coerce %s to string in %s", sv_reftype(sv,0),
10076 s = sv_2pv_flags(sv, &len, flags &~ SV_GMAGIC);
10083 if (SvTYPE(sv) < SVt_PV ||
10084 s != SvPVX_const(sv)) { /* Almost, but not quite, sv_setpvn() */
10087 SvUPGRADE(sv, SVt_PV); /* Never FALSE */
10088 SvGROW(sv, len + 1);
10089 Move(s,SvPVX(sv),len,char);
10090 SvCUR_set(sv, len);
10091 SvPVX(sv)[len] = '\0';
10094 SvPOK_on(sv); /* validate pointer */
10096 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%" UVxf " 2pv(%s)\n",
10097 PTR2UV(sv),SvPVX_const(sv)));
10100 (void)SvPOK_only_UTF8(sv);
10101 return SvPVX_mutable(sv);
10105 =for apidoc sv_pvbyten_force
10107 The backend for the C<SvPVbytex_force> macro. Always use the macro
10114 Perl_sv_pvbyten_force(pTHX_ SV *const sv, STRLEN *const lp)
10116 PERL_ARGS_ASSERT_SV_PVBYTEN_FORCE;
10118 sv_pvn_force(sv,lp);
10119 sv_utf8_downgrade(sv,0);
10125 =for apidoc sv_pvutf8n_force
10127 The backend for the C<SvPVutf8x_force> macro. Always use the macro
10134 Perl_sv_pvutf8n_force(pTHX_ SV *const sv, STRLEN *const lp)
10136 PERL_ARGS_ASSERT_SV_PVUTF8N_FORCE;
10138 sv_pvn_force(sv,0);
10139 sv_utf8_upgrade_nomg(sv);
10145 =for apidoc sv_reftype
10147 Returns a string describing what the SV is a reference to.
10149 If ob is true and the SV is blessed, the string is the class name,
10150 otherwise it is the type of the SV, "SCALAR", "ARRAY" etc.
10156 Perl_sv_reftype(pTHX_ const SV *const sv, const int ob)
10158 PERL_ARGS_ASSERT_SV_REFTYPE;
10159 if (ob && SvOBJECT(sv)) {
10160 return SvPV_nolen_const(sv_ref(NULL, sv, ob));
10163 /* WARNING - There is code, for instance in mg.c, that assumes that
10164 * the only reason that sv_reftype(sv,0) would return a string starting
10165 * with 'L' or 'S' is that it is a LVALUE or a SCALAR.
10166 * Yes this a dodgy way to do type checking, but it saves practically reimplementing
10167 * this routine inside other subs, and it saves time.
10168 * Do not change this assumption without searching for "dodgy type check" in
10171 switch (SvTYPE(sv)) {
10186 case SVt_PVLV: return (char *) (SvROK(sv) ? "REF"
10187 /* tied lvalues should appear to be
10188 * scalars for backwards compatibility */
10189 : (isALPHA_FOLD_EQ(LvTYPE(sv), 't'))
10190 ? "SCALAR" : "LVALUE");
10191 case SVt_PVAV: return "ARRAY";
10192 case SVt_PVHV: return "HASH";
10193 case SVt_PVCV: return "CODE";
10194 case SVt_PVGV: return (char *) (isGV_with_GP(sv)
10195 ? "GLOB" : "SCALAR");
10196 case SVt_PVFM: return "FORMAT";
10197 case SVt_PVIO: return "IO";
10198 case SVt_INVLIST: return "INVLIST";
10199 case SVt_REGEXP: return "REGEXP";
10200 default: return "UNKNOWN";
10208 Returns a SV describing what the SV passed in is a reference to.
10210 dst can be a SV to be set to the description or NULL, in which case a
10211 mortal SV is returned.
10213 If ob is true and the SV is blessed, the description is the class
10214 name, otherwise it is the type of the SV, "SCALAR", "ARRAY" etc.
10220 Perl_sv_ref(pTHX_ SV *dst, const SV *const sv, const int ob)
10222 PERL_ARGS_ASSERT_SV_REF;
10225 dst = sv_newmortal();
10227 if (ob && SvOBJECT(sv)) {
10228 HvNAME_get(SvSTASH(sv))
10229 ? sv_sethek(dst, HvNAME_HEK(SvSTASH(sv)))
10230 : sv_setpvs(dst, "__ANON__");
10233 const char * reftype = sv_reftype(sv, 0);
10234 sv_setpv(dst, reftype);
10240 =for apidoc sv_isobject
10242 Returns a boolean indicating whether the SV is an RV pointing to a blessed
10243 object. If the SV is not an RV, or if the object is not blessed, then this
10250 Perl_sv_isobject(pTHX_ SV *sv)
10266 Returns a boolean indicating whether the SV is blessed into the specified
10267 class. This does not check for subtypes; use C<sv_derived_from> to verify
10268 an inheritance relationship.
10274 Perl_sv_isa(pTHX_ SV *sv, const char *const name)
10276 const char *hvname;
10278 PERL_ARGS_ASSERT_SV_ISA;
10288 hvname = HvNAME_get(SvSTASH(sv));
10292 return strEQ(hvname, name);
10296 =for apidoc newSVrv
10298 Creates a new SV for the existing RV, C<rv>, to point to. If C<rv> is not an
10299 RV then it will be upgraded to one. If C<classname> is non-null then the new
10300 SV will be blessed in the specified package. The new SV is returned and its
10301 reference count is 1. The reference count 1 is owned by C<rv>.
10307 Perl_newSVrv(pTHX_ SV *const rv, const char *const classname)
10311 PERL_ARGS_ASSERT_NEWSVRV;
10315 SV_CHECK_THINKFIRST_COW_DROP(rv);
10317 if (UNLIKELY( SvTYPE(rv) >= SVt_PVMG )) {
10318 const U32 refcnt = SvREFCNT(rv);
10322 SvREFCNT(rv) = refcnt;
10324 sv_upgrade(rv, SVt_IV);
10325 } else if (SvROK(rv)) {
10326 SvREFCNT_dec(SvRV(rv));
10328 prepare_SV_for_RV(rv);
10336 HV* const stash = gv_stashpv(classname, GV_ADD);
10337 (void)sv_bless(rv, stash);
10343 Perl_newSVavdefelem(pTHX_ AV *av, SSize_t ix, bool extendible)
10345 SV * const lv = newSV_type(SVt_PVLV);
10346 PERL_ARGS_ASSERT_NEWSVAVDEFELEM;
10348 sv_magic(lv, NULL, PERL_MAGIC_defelem, NULL, 0);
10349 LvTARG(lv) = SvREFCNT_inc_simple_NN(av);
10350 LvSTARGOFF(lv) = ix;
10351 LvTARGLEN(lv) = extendible ? 1 : (STRLEN)UV_MAX;
10356 =for apidoc sv_setref_pv
10358 Copies a pointer into a new SV, optionally blessing the SV. The C<rv>
10359 argument will be upgraded to an RV. That RV will be modified to point to
10360 the new SV. If the C<pv> argument is C<NULL>, then C<PL_sv_undef> will be placed
10361 into the SV. The C<classname> argument indicates the package for the
10362 blessing. Set C<classname> to C<NULL> to avoid the blessing. The new SV
10363 will have a reference count of 1, and the RV will be returned.
10365 Do not use with other Perl types such as HV, AV, SV, CV, because those
10366 objects will become corrupted by the pointer copy process.
10368 Note that C<sv_setref_pvn> copies the string while this copies the pointer.
10374 Perl_sv_setref_pv(pTHX_ SV *const rv, const char *const classname, void *const pv)
10376 PERL_ARGS_ASSERT_SV_SETREF_PV;
10383 sv_setiv(newSVrv(rv,classname), PTR2IV(pv));
10388 =for apidoc sv_setref_iv
10390 Copies an integer into a new SV, optionally blessing the SV. The C<rv>
10391 argument will be upgraded to an RV. That RV will be modified to point to
10392 the new SV. The C<classname> argument indicates the package for the
10393 blessing. Set C<classname> to C<NULL> to avoid the blessing. The new SV
10394 will have a reference count of 1, and the RV will be returned.
10400 Perl_sv_setref_iv(pTHX_ SV *const rv, const char *const classname, const IV iv)
10402 PERL_ARGS_ASSERT_SV_SETREF_IV;
10404 sv_setiv(newSVrv(rv,classname), iv);
10409 =for apidoc sv_setref_uv
10411 Copies an unsigned integer into a new SV, optionally blessing the SV. The C<rv>
10412 argument will be upgraded to an RV. That RV will be modified to point to
10413 the new SV. The C<classname> argument indicates the package for the
10414 blessing. Set C<classname> to C<NULL> to avoid the blessing. The new SV
10415 will have a reference count of 1, and the RV will be returned.
10421 Perl_sv_setref_uv(pTHX_ SV *const rv, const char *const classname, const UV uv)
10423 PERL_ARGS_ASSERT_SV_SETREF_UV;
10425 sv_setuv(newSVrv(rv,classname), uv);
10430 =for apidoc sv_setref_nv
10432 Copies a double into a new SV, optionally blessing the SV. The C<rv>
10433 argument will be upgraded to an RV. That RV will be modified to point to
10434 the new SV. The C<classname> argument indicates the package for the
10435 blessing. Set C<classname> to C<NULL> to avoid the blessing. The new SV
10436 will have a reference count of 1, and the RV will be returned.
10442 Perl_sv_setref_nv(pTHX_ SV *const rv, const char *const classname, const NV nv)
10444 PERL_ARGS_ASSERT_SV_SETREF_NV;
10446 sv_setnv(newSVrv(rv,classname), nv);
10451 =for apidoc sv_setref_pvn
10453 Copies a string into a new SV, optionally blessing the SV. The length of the
10454 string must be specified with C<n>. The C<rv> argument will be upgraded to
10455 an RV. That RV will be modified to point to the new SV. The C<classname>
10456 argument indicates the package for the blessing. Set C<classname> to
10457 C<NULL> to avoid the blessing. The new SV will have a reference count
10458 of 1, and the RV will be returned.
10460 Note that C<sv_setref_pv> copies the pointer while this copies the string.
10466 Perl_sv_setref_pvn(pTHX_ SV *const rv, const char *const classname,
10467 const char *const pv, const STRLEN n)
10469 PERL_ARGS_ASSERT_SV_SETREF_PVN;
10471 sv_setpvn(newSVrv(rv,classname), pv, n);
10476 =for apidoc sv_bless
10478 Blesses an SV into a specified package. The SV must be an RV. The package
10479 must be designated by its stash (see C<L</gv_stashpv>>). The reference count
10480 of the SV is unaffected.
10486 Perl_sv_bless(pTHX_ SV *const sv, HV *const stash)
10489 HV *oldstash = NULL;
10491 PERL_ARGS_ASSERT_SV_BLESS;
10495 Perl_croak(aTHX_ "Can't bless non-reference value");
10497 if (SvFLAGS(tmpRef) & (SVs_OBJECT|SVf_READONLY|SVf_PROTECT)) {
10498 if (SvREADONLY(tmpRef))
10499 Perl_croak_no_modify();
10500 if (SvOBJECT(tmpRef)) {
10501 oldstash = SvSTASH(tmpRef);
10504 SvOBJECT_on(tmpRef);
10505 SvUPGRADE(tmpRef, SVt_PVMG);
10506 SvSTASH_set(tmpRef, MUTABLE_HV(SvREFCNT_inc_simple(stash)));
10507 SvREFCNT_dec(oldstash);
10509 if(SvSMAGICAL(tmpRef))
10510 if(mg_find(tmpRef, PERL_MAGIC_ext) || mg_find(tmpRef, PERL_MAGIC_uvar))
10518 /* Downgrades a PVGV to a PVMG. If it's actually a PVLV, we leave the type
10519 * as it is after unglobbing it.
10522 PERL_STATIC_INLINE void
10523 S_sv_unglob(pTHX_ SV *const sv, U32 flags)
10527 SV * const temp = flags & SV_COW_DROP_PV ? NULL : sv_newmortal();
10529 PERL_ARGS_ASSERT_SV_UNGLOB;
10531 assert(SvTYPE(sv) == SVt_PVGV || SvTYPE(sv) == SVt_PVLV);
10533 if (!(flags & SV_COW_DROP_PV))
10534 gv_efullname3(temp, MUTABLE_GV(sv), "*");
10536 SvREFCNT_inc_simple_void_NN(sv_2mortal(sv));
10538 if(GvCVu((const GV *)sv) && (stash = GvSTASH(MUTABLE_GV(sv)))
10539 && HvNAME_get(stash))
10540 mro_method_changed_in(stash);
10541 gp_free(MUTABLE_GV(sv));
10544 sv_del_backref(MUTABLE_SV(GvSTASH(sv)), sv);
10545 GvSTASH(sv) = NULL;
10548 if (GvNAME_HEK(sv)) {
10549 unshare_hek(GvNAME_HEK(sv));
10551 isGV_with_GP_off(sv);
10553 if(SvTYPE(sv) == SVt_PVGV) {
10554 /* need to keep SvANY(sv) in the right arena */
10555 xpvmg = new_XPVMG();
10556 StructCopy(SvANY(sv), xpvmg, XPVMG);
10557 del_XPVGV(SvANY(sv));
10560 SvFLAGS(sv) &= ~SVTYPEMASK;
10561 SvFLAGS(sv) |= SVt_PVMG;
10564 /* Intentionally not calling any local SET magic, as this isn't so much a
10565 set operation as merely an internal storage change. */
10566 if (flags & SV_COW_DROP_PV) SvOK_off(sv);
10567 else sv_setsv_flags(sv, temp, 0);
10569 if ((const GV *)sv == PL_last_in_gv)
10570 PL_last_in_gv = NULL;
10571 else if ((const GV *)sv == PL_statgv)
10576 =for apidoc sv_unref_flags
10578 Unsets the RV status of the SV, and decrements the reference count of
10579 whatever was being referenced by the RV. This can almost be thought of
10580 as a reversal of C<newSVrv>. The C<cflags> argument can contain
10581 C<SV_IMMEDIATE_UNREF> to force the reference count to be decremented
10582 (otherwise the decrementing is conditional on the reference count being
10583 different from one or the reference being a readonly SV).
10584 See C<L</SvROK_off>>.
10590 Perl_sv_unref_flags(pTHX_ SV *const ref, const U32 flags)
10592 SV* const target = SvRV(ref);
10594 PERL_ARGS_ASSERT_SV_UNREF_FLAGS;
10596 if (SvWEAKREF(ref)) {
10597 sv_del_backref(target, ref);
10598 SvWEAKREF_off(ref);
10599 SvRV_set(ref, NULL);
10602 SvRV_set(ref, NULL);
10604 /* You can't have a || SvREADONLY(target) here, as $a = $$a, where $a was
10605 assigned to as BEGIN {$a = \"Foo"} will fail. */
10606 if (SvREFCNT(target) != 1 || (flags & SV_IMMEDIATE_UNREF))
10607 SvREFCNT_dec_NN(target);
10608 else /* XXX Hack, but hard to make $a=$a->[1] work otherwise */
10609 sv_2mortal(target); /* Schedule for freeing later */
10613 =for apidoc sv_untaint
10615 Untaint an SV. Use C<SvTAINTED_off> instead.
10621 Perl_sv_untaint(pTHX_ SV *const sv)
10623 PERL_ARGS_ASSERT_SV_UNTAINT;
10624 PERL_UNUSED_CONTEXT;
10626 if (SvTYPE(sv) >= SVt_PVMG && SvMAGIC(sv)) {
10627 MAGIC * const mg = mg_find(sv, PERL_MAGIC_taint);
10634 =for apidoc sv_tainted
10636 Test an SV for taintedness. Use C<SvTAINTED> instead.
10642 Perl_sv_tainted(pTHX_ SV *const sv)
10644 PERL_ARGS_ASSERT_SV_TAINTED;
10645 PERL_UNUSED_CONTEXT;
10647 if (SvTYPE(sv) >= SVt_PVMG && SvMAGIC(sv)) {
10648 const MAGIC * const mg = mg_find(sv, PERL_MAGIC_taint);
10649 if (mg && (mg->mg_len & 1) )
10655 #ifndef NO_MATHOMS /* Can't move these to mathoms.c because call uiv_2buf(),
10656 private to this file */
10659 =for apidoc sv_setpviv
10661 Copies an integer into the given SV, also updating its string value.
10662 Does not handle 'set' magic. See C<L</sv_setpviv_mg>>.
10668 Perl_sv_setpviv(pTHX_ SV *const sv, const IV iv)
10670 char buf[TYPE_CHARS(UV)];
10672 char * const ptr = uiv_2buf(buf, iv, 0, 0, &ebuf);
10674 PERL_ARGS_ASSERT_SV_SETPVIV;
10676 sv_setpvn(sv, ptr, ebuf - ptr);
10680 =for apidoc sv_setpviv_mg
10682 Like C<sv_setpviv>, but also handles 'set' magic.
10688 Perl_sv_setpviv_mg(pTHX_ SV *const sv, const IV iv)
10690 PERL_ARGS_ASSERT_SV_SETPVIV_MG;
10692 sv_setpviv(sv, iv);
10696 #endif /* NO_MATHOMS */
10698 #if defined(PERL_IMPLICIT_CONTEXT)
10700 /* pTHX_ magic can't cope with varargs, so this is a no-context
10701 * version of the main function, (which may itself be aliased to us).
10702 * Don't access this version directly.
10706 Perl_sv_setpvf_nocontext(SV *const sv, const char *const pat, ...)
10711 PERL_ARGS_ASSERT_SV_SETPVF_NOCONTEXT;
10713 va_start(args, pat);
10714 sv_vsetpvf(sv, pat, &args);
10718 /* pTHX_ magic can't cope with varargs, so this is a no-context
10719 * version of the main function, (which may itself be aliased to us).
10720 * Don't access this version directly.
10724 Perl_sv_setpvf_mg_nocontext(SV *const sv, const char *const pat, ...)
10729 PERL_ARGS_ASSERT_SV_SETPVF_MG_NOCONTEXT;
10731 va_start(args, pat);
10732 sv_vsetpvf_mg(sv, pat, &args);
10738 =for apidoc sv_setpvf
10740 Works like C<sv_catpvf> but copies the text into the SV instead of
10741 appending it. Does not handle 'set' magic. See C<L</sv_setpvf_mg>>.
10747 Perl_sv_setpvf(pTHX_ SV *const sv, const char *const pat, ...)
10751 PERL_ARGS_ASSERT_SV_SETPVF;
10753 va_start(args, pat);
10754 sv_vsetpvf(sv, pat, &args);
10759 =for apidoc sv_vsetpvf
10761 Works like C<sv_vcatpvf> but copies the text into the SV instead of
10762 appending it. Does not handle 'set' magic. See C<L</sv_vsetpvf_mg>>.
10764 Usually used via its frontend C<sv_setpvf>.
10770 Perl_sv_vsetpvf(pTHX_ SV *const sv, const char *const pat, va_list *const args)
10772 PERL_ARGS_ASSERT_SV_VSETPVF;
10774 sv_vsetpvfn(sv, pat, strlen(pat), args, NULL, 0, NULL);
10778 =for apidoc sv_setpvf_mg
10780 Like C<sv_setpvf>, but also handles 'set' magic.
10786 Perl_sv_setpvf_mg(pTHX_ SV *const sv, const char *const pat, ...)
10790 PERL_ARGS_ASSERT_SV_SETPVF_MG;
10792 va_start(args, pat);
10793 sv_vsetpvf_mg(sv, pat, &args);
10798 =for apidoc sv_vsetpvf_mg
10800 Like C<sv_vsetpvf>, but also handles 'set' magic.
10802 Usually used via its frontend C<sv_setpvf_mg>.
10808 Perl_sv_vsetpvf_mg(pTHX_ SV *const sv, const char *const pat, va_list *const args)
10810 PERL_ARGS_ASSERT_SV_VSETPVF_MG;
10812 sv_vsetpvfn(sv, pat, strlen(pat), args, NULL, 0, NULL);
10816 #if defined(PERL_IMPLICIT_CONTEXT)
10818 /* pTHX_ magic can't cope with varargs, so this is a no-context
10819 * version of the main function, (which may itself be aliased to us).
10820 * Don't access this version directly.
10824 Perl_sv_catpvf_nocontext(SV *const sv, const char *const pat, ...)
10829 PERL_ARGS_ASSERT_SV_CATPVF_NOCONTEXT;
10831 va_start(args, pat);
10832 sv_vcatpvfn_flags(sv, pat, strlen(pat), &args, NULL, 0, NULL, SV_GMAGIC|SV_SMAGIC);
10836 /* pTHX_ magic can't cope with varargs, so this is a no-context
10837 * version of the main function, (which may itself be aliased to us).
10838 * Don't access this version directly.
10842 Perl_sv_catpvf_mg_nocontext(SV *const sv, const char *const pat, ...)
10847 PERL_ARGS_ASSERT_SV_CATPVF_MG_NOCONTEXT;
10849 va_start(args, pat);
10850 sv_vcatpvfn_flags(sv, pat, strlen(pat), &args, NULL, 0, NULL, SV_GMAGIC|SV_SMAGIC);
10857 =for apidoc sv_catpvf
10859 Processes its arguments like C<sv_catpvfn>, and appends the formatted
10860 output to an SV. As with C<sv_catpvfn> called with a non-null C-style
10861 variable argument list, argument reordering is not supported.
10862 If the appended data contains "wide" characters
10863 (including, but not limited to, SVs with a UTF-8 PV formatted with C<%s>,
10864 and characters >255 formatted with C<%c>), the original SV might get
10865 upgraded to UTF-8. Handles 'get' magic, but not 'set' magic. See
10866 C<L</sv_catpvf_mg>>. If the original SV was UTF-8, the pattern should be
10867 valid UTF-8; if the original SV was bytes, the pattern should be too.
10872 Perl_sv_catpvf(pTHX_ SV *const sv, const char *const pat, ...)
10876 PERL_ARGS_ASSERT_SV_CATPVF;
10878 va_start(args, pat);
10879 sv_vcatpvfn_flags(sv, pat, strlen(pat), &args, NULL, 0, NULL, SV_GMAGIC|SV_SMAGIC);
10884 =for apidoc sv_vcatpvf
10886 Processes its arguments like C<sv_catpvfn> called with a non-null C-style
10887 variable argument list, and appends the formatted output
10888 to an SV. Does not handle 'set' magic. See C<L</sv_vcatpvf_mg>>.
10890 Usually used via its frontend C<sv_catpvf>.
10896 Perl_sv_vcatpvf(pTHX_ SV *const sv, const char *const pat, va_list *const args)
10898 PERL_ARGS_ASSERT_SV_VCATPVF;
10900 sv_vcatpvfn_flags(sv, pat, strlen(pat), args, NULL, 0, NULL, SV_GMAGIC|SV_SMAGIC);
10904 =for apidoc sv_catpvf_mg
10906 Like C<sv_catpvf>, but also handles 'set' magic.
10912 Perl_sv_catpvf_mg(pTHX_ SV *const sv, const char *const pat, ...)
10916 PERL_ARGS_ASSERT_SV_CATPVF_MG;
10918 va_start(args, pat);
10919 sv_vcatpvfn_flags(sv, pat, strlen(pat), &args, NULL, 0, NULL, SV_GMAGIC|SV_SMAGIC);
10925 =for apidoc sv_vcatpvf_mg
10927 Like C<sv_vcatpvf>, but also handles 'set' magic.
10929 Usually used via its frontend C<sv_catpvf_mg>.
10935 Perl_sv_vcatpvf_mg(pTHX_ SV *const sv, const char *const pat, va_list *const args)
10937 PERL_ARGS_ASSERT_SV_VCATPVF_MG;
10939 sv_vcatpvfn(sv, pat, strlen(pat), args, NULL, 0, NULL);
10944 =for apidoc sv_vsetpvfn
10946 Works like C<sv_vcatpvfn> but copies the text into the SV instead of
10949 Usually used via one of its frontends C<sv_vsetpvf> and C<sv_vsetpvf_mg>.
10955 Perl_sv_vsetpvfn(pTHX_ SV *const sv, const char *const pat, const STRLEN patlen,
10956 va_list *const args, SV **const svargs, const I32 svmax, bool *const maybe_tainted)
10958 PERL_ARGS_ASSERT_SV_VSETPVFN;
10961 sv_vcatpvfn_flags(sv, pat, patlen, args, svargs, svmax, maybe_tainted, 0);
10966 * Warn of missing argument to sprintf. The value used in place of such
10967 * arguments should be &PL_sv_no; an undefined value would yield
10968 * inappropriate "use of uninit" warnings [perl #71000].
10971 S_warn_vcatpvfn_missing_argument(pTHX) {
10972 if (ckWARN(WARN_MISSING)) {
10973 Perl_warner(aTHX_ packWARN(WARN_MISSING), "Missing argument in %s",
10974 PL_op ? OP_DESC(PL_op) : "sv_vcatpvfn()");
10980 S_expect_number(pTHX_ char **const pattern)
10984 PERL_ARGS_ASSERT_EXPECT_NUMBER;
10986 switch (**pattern) {
10987 case '1': case '2': case '3':
10988 case '4': case '5': case '6':
10989 case '7': case '8': case '9':
10990 var = *(*pattern)++ - '0';
10991 while (isDIGIT(**pattern)) {
10992 const I32 tmp = var * 10 + (*(*pattern)++ - '0');
10994 Perl_croak(aTHX_ "Integer overflow in format string for %s", (PL_op ? OP_DESC(PL_op) : "sv_vcatpvfn"));
11002 S_F0convert(NV nv, char *const endbuf, STRLEN *const len)
11004 const int neg = nv < 0;
11007 PERL_ARGS_ASSERT_F0CONVERT;
11009 if (UNLIKELY(Perl_isinfnan(nv))) {
11010 STRLEN n = S_infnan_2pv(nv, endbuf - *len, *len, 0);
11020 if (uv & 1 && uv == nv)
11021 uv--; /* Round to even */
11023 const unsigned dig = uv % 10;
11025 } while (uv /= 10);
11036 =for apidoc sv_vcatpvfn
11038 =for apidoc sv_vcatpvfn_flags
11040 Processes its arguments like C<vsprintf> and appends the formatted output
11041 to an SV. Uses an array of SVs if the C-style variable argument list is
11042 missing (C<NULL>). Argument reordering (using format specifiers like C<%2$d>
11043 or C<%*2$d>) is supported only when using an array of SVs; using a C-style
11044 C<va_list> argument list with a format string that uses argument reordering
11045 will yield an exception.
11047 When running with taint checks enabled, indicates via
11048 C<maybe_tainted> if results are untrustworthy (often due to the use of
11051 If called as C<sv_vcatpvfn> or flags has the C<SV_GMAGIC> bit set, calls get magic.
11053 Usually used via one of its frontends C<sv_vcatpvf> and C<sv_vcatpvf_mg>.
11058 #define VECTORIZE_ARGS vecsv = va_arg(*args, SV*);\
11059 vecstr = (U8*)SvPV_const(vecsv,veclen);\
11060 vec_utf8 = DO_UTF8(vecsv);
11062 /* XXX maybe_tainted is never assigned to, so the doc above is lying. */
11065 Perl_sv_vcatpvfn(pTHX_ SV *const sv, const char *const pat, const STRLEN patlen,
11066 va_list *const args, SV **const svargs, const I32 svmax, bool *const maybe_tainted)
11068 PERL_ARGS_ASSERT_SV_VCATPVFN;
11070 sv_vcatpvfn_flags(sv, pat, patlen, args, svargs, svmax, maybe_tainted, SV_GMAGIC|SV_SMAGIC);
11073 #ifdef LONGDOUBLE_DOUBLEDOUBLE
11074 /* The first double can be as large as 2**1023, or '1' x '0' x 1023.
11075 * The second double can be as small as 2**-1074, or '0' x 1073 . '1'.
11076 * The sum of them can be '1' . '0' x 2096 . '1', with implied radix point
11077 * after the first 1023 zero bits.
11079 * XXX The 2098 is quite large (262.25 bytes) and therefore some sort
11080 * of dynamically growing buffer might be better, start at just 16 bytes
11081 * (for example) and grow only when necessary. Or maybe just by looking
11082 * at the exponents of the two doubles? */
11083 # define DOUBLEDOUBLE_MAXBITS 2098
11086 /* vhex will contain the values (0..15) of the hex digits ("nybbles"
11087 * of 4 bits); 1 for the implicit 1, and the mantissa bits, four bits
11088 * per xdigit. For the double-double case, this can be rather many.
11089 * The non-double-double-long-double overshoots since all bits of NV
11090 * are not mantissa bits, there are also exponent bits. */
11091 #ifdef LONGDOUBLE_DOUBLEDOUBLE
11092 # define VHEX_SIZE (3+DOUBLEDOUBLE_MAXBITS/4)
11094 # define VHEX_SIZE (1+(NVSIZE * 8)/4)
11097 /* If we do not have a known long double format, (including not using
11098 * long doubles, or long doubles being equal to doubles) then we will
11099 * fall back to the ldexp/frexp route, with which we can retrieve at
11100 * most as many bits as our widest unsigned integer type is. We try
11101 * to get a 64-bit unsigned integer even if we are not using a 64-bit UV.
11103 * (If you want to test the case of UVSIZE == 4, NVSIZE == 8,
11104 * set the MANTISSATYPE to int and the MANTISSASIZE to 4.)
11106 #if defined(HAS_QUAD) && defined(Uquad_t)
11107 # define MANTISSATYPE Uquad_t
11108 # define MANTISSASIZE 8
11110 # define MANTISSATYPE UV
11111 # define MANTISSASIZE UVSIZE
11114 #if defined(DOUBLE_LITTLE_ENDIAN) || defined(LONGDOUBLE_LITTLE_ENDIAN)
11115 # define HEXTRACT_LITTLE_ENDIAN
11116 #elif defined(DOUBLE_BIG_ENDIAN) || defined(LONGDOUBLE_BIG_ENDIAN)
11117 # define HEXTRACT_BIG_ENDIAN
11119 # define HEXTRACT_MIX_ENDIAN
11122 /* S_hextract() is a helper for Perl_sv_vcatpvfn_flags, for extracting
11123 * the hexadecimal values (for %a/%A). The nv is the NV where the value
11124 * are being extracted from (either directly from the long double in-memory
11125 * presentation, or from the uquad computed via frexp+ldexp). frexp also
11126 * is used to update the exponent. The subnormal is set to true
11127 * for IEEE 754 subnormals/denormals (including the x86 80-bit format).
11128 * The vhex is the pointer to the beginning of the output buffer of VHEX_SIZE.
11130 * The tricky part is that S_hextract() needs to be called twice:
11131 * the first time with vend as NULL, and the second time with vend as
11132 * the pointer returned by the first call. What happens is that on
11133 * the first round the output size is computed, and the intended
11134 * extraction sanity checked. On the second round the actual output
11135 * (the extraction of the hexadecimal values) takes place.
11136 * Sanity failures cause fatal failures during both rounds. */
11138 S_hextract(pTHX_ const NV nv, int* exponent, bool *subnormal,
11139 U8* vhex, U8* vend)
11143 int ixmin = 0, ixmax = 0;
11145 /* XXX Inf/NaN are not handled here, since it is
11146 * assumed they are to be output as "Inf" and "NaN". */
11148 /* These macros are just to reduce typos, they have multiple
11149 * repetitions below, but usually only one (or sometimes two)
11150 * of them is really being used. */
11151 /* HEXTRACT_OUTPUT() extracts the high nybble first. */
11152 #define HEXTRACT_OUTPUT_HI(ix) (*v++ = nvp[ix] >> 4)
11153 #define HEXTRACT_OUTPUT_LO(ix) (*v++ = nvp[ix] & 0xF)
11154 #define HEXTRACT_OUTPUT(ix) \
11156 HEXTRACT_OUTPUT_HI(ix); HEXTRACT_OUTPUT_LO(ix); \
11158 #define HEXTRACT_COUNT(ix, c) \
11160 v += c; if (ix < ixmin) ixmin = ix; else if (ix > ixmax) ixmax = ix; \
11162 #define HEXTRACT_BYTE(ix) \
11164 if (vend) HEXTRACT_OUTPUT(ix); else HEXTRACT_COUNT(ix, 2); \
11166 #define HEXTRACT_LO_NYBBLE(ix) \
11168 if (vend) HEXTRACT_OUTPUT_LO(ix); else HEXTRACT_COUNT(ix, 1); \
11170 /* HEXTRACT_TOP_NYBBLE is just convenience disguise,
11171 * to make it look less odd when the top bits of a NV
11172 * are extracted using HEXTRACT_LO_NYBBLE: the highest
11173 * order bits can be in the "low nybble" of a byte. */
11174 #define HEXTRACT_TOP_NYBBLE(ix) HEXTRACT_LO_NYBBLE(ix)
11175 #define HEXTRACT_BYTES_LE(a, b) \
11176 for (ix = a; ix >= b; ix--) { HEXTRACT_BYTE(ix); }
11177 #define HEXTRACT_BYTES_BE(a, b) \
11178 for (ix = a; ix <= b; ix++) { HEXTRACT_BYTE(ix); }
11179 #define HEXTRACT_GET_SUBNORMAL(nv) *subnormal = Perl_fp_class_denorm(nv)
11180 #define HEXTRACT_IMPLICIT_BIT(nv) \
11182 if (!*subnormal) { \
11183 if (vend) *v++ = ((nv) == 0.0) ? 0 : 1; else v++; \
11187 /* Most formats do. Those which don't should undef this.
11189 * But also note that IEEE 754 subnormals do not have it, or,
11190 * expressed alternatively, their implicit bit is zero. */
11191 #define HEXTRACT_HAS_IMPLICIT_BIT
11193 /* Many formats do. Those which don't should undef this. */
11194 #define HEXTRACT_HAS_TOP_NYBBLE
11196 /* HEXTRACTSIZE is the maximum number of xdigits. */
11197 #if defined(USE_LONG_DOUBLE) && defined(LONGDOUBLE_DOUBLEDOUBLE)
11198 # define HEXTRACTSIZE (2+DOUBLEDOUBLE_MAXBITS/4)
11200 # define HEXTRACTSIZE 2 * NVSIZE
11203 const U8* vmaxend = vhex + HEXTRACTSIZE;
11204 PERL_UNUSED_VAR(ix); /* might happen */
11205 (void)Perl_frexp(PERL_ABS(nv), exponent);
11206 *subnormal = FALSE;
11207 if (vend && (vend <= vhex || vend > vmaxend)) {
11208 /* diag_listed_as: Hexadecimal float: internal error (%s) */
11209 Perl_croak(aTHX_ "Hexadecimal float: internal error (entry)");
11212 /* First check if using long doubles. */
11213 #if defined(USE_LONG_DOUBLE) && (NVSIZE > DOUBLESIZE)
11214 # if LONG_DOUBLEKIND == LONG_DOUBLE_IS_IEEE_754_128_BIT_LITTLE_ENDIAN
11215 /* Used in e.g. VMS and HP-UX IA-64, e.g. -0.1L:
11216 * 9a 99 99 99 99 99 99 99 99 99 99 99 99 99 fb bf */
11217 /* The bytes 13..0 are the mantissa/fraction,
11218 * the 15,14 are the sign+exponent. */
11219 const U8* nvp = (const U8*)(&nv);
11220 HEXTRACT_GET_SUBNORMAL(nv);
11221 HEXTRACT_IMPLICIT_BIT(nv);
11222 # undef HEXTRACT_HAS_TOP_NYBBLE
11223 HEXTRACT_BYTES_LE(13, 0);
11224 # elif LONG_DOUBLEKIND == LONG_DOUBLE_IS_IEEE_754_128_BIT_BIG_ENDIAN
11225 /* Used in e.g. Solaris Sparc and HP-UX PA-RISC, e.g. -0.1L:
11226 * bf fb 99 99 99 99 99 99 99 99 99 99 99 99 99 9a */
11227 /* The bytes 2..15 are the mantissa/fraction,
11228 * the 0,1 are the sign+exponent. */
11229 const U8* nvp = (const U8*)(&nv);
11230 HEXTRACT_GET_SUBNORMAL(nv);
11231 HEXTRACT_IMPLICIT_BIT(nv);
11232 # undef HEXTRACT_HAS_TOP_NYBBLE
11233 HEXTRACT_BYTES_BE(2, 15);
11234 # elif LONG_DOUBLEKIND == LONG_DOUBLE_IS_X86_80_BIT_LITTLE_ENDIAN
11235 /* x86 80-bit "extended precision", 64 bits of mantissa / fraction /
11236 * significand, 15 bits of exponent, 1 bit of sign. No implicit bit.
11237 * NVSIZE can be either 12 (ILP32, Solaris x86) or 16 (LP64, Linux
11238 * and OS X), meaning that 2 or 6 bytes are empty padding. */
11239 /* The bytes 0..1 are the sign+exponent,
11240 * the bytes 2..9 are the mantissa/fraction. */
11241 const U8* nvp = (const U8*)(&nv);
11242 # undef HEXTRACT_HAS_IMPLICIT_BIT
11243 # undef HEXTRACT_HAS_TOP_NYBBLE
11244 HEXTRACT_GET_SUBNORMAL(nv);
11245 HEXTRACT_BYTES_LE(7, 0);
11246 # elif LONG_DOUBLEKIND == LONG_DOUBLE_IS_X86_80_BIT_BIG_ENDIAN
11247 /* Does this format ever happen? (Wikipedia says the Motorola
11248 * 6888x math coprocessors used format _like_ this but padded
11249 * to 96 bits with 16 unused bits between the exponent and the
11251 const U8* nvp = (const U8*)(&nv);
11252 # undef HEXTRACT_HAS_IMPLICIT_BIT
11253 # undef HEXTRACT_HAS_TOP_NYBBLE
11254 HEXTRACT_GET_SUBNORMAL(nv);
11255 HEXTRACT_BYTES_BE(0, 7);
11257 # define HEXTRACT_FALLBACK
11258 /* Double-double format: two doubles next to each other.
11259 * The first double is the high-order one, exactly like
11260 * it would be for a "lone" double. The second double
11261 * is shifted down using the exponent so that that there
11262 * are no common bits. The tricky part is that the value
11263 * of the double-double is the SUM of the two doubles and
11264 * the second one can be also NEGATIVE.
11266 * Because of this tricky construction the bytewise extraction we
11267 * use for the other long double formats doesn't work, we must
11268 * extract the values bit by bit.
11270 * The little-endian double-double is used .. somewhere?
11272 * The big endian double-double is used in e.g. PPC/Power (AIX)
11275 * The mantissa bits are in two separate stretches, e.g. for -0.1L:
11276 * 9a 99 99 99 99 99 59 bc 9a 99 99 99 99 99 b9 3f (LE)
11277 * 3f b9 99 99 99 99 99 9a bc 59 99 99 99 99 99 9a (BE)
11280 #else /* #if defined(USE_LONG_DOUBLE) && (NVSIZE > DOUBLESIZE) */
11281 /* Using normal doubles, not long doubles.
11283 * We generate 4-bit xdigits (nybble/nibble) instead of 8-bit
11284 * bytes, since we might need to handle printf precision, and
11285 * also need to insert the radix. */
11287 # ifdef HEXTRACT_LITTLE_ENDIAN
11288 /* 0 1 2 3 4 5 6 7 (MSB = 7, LSB = 0, 6+7 = exponent+sign) */
11289 const U8* nvp = (const U8*)(&nv);
11290 HEXTRACT_GET_SUBNORMAL(nv);
11291 HEXTRACT_IMPLICIT_BIT(nv);
11292 HEXTRACT_TOP_NYBBLE(6);
11293 HEXTRACT_BYTES_LE(5, 0);
11294 # elif defined(HEXTRACT_BIG_ENDIAN)
11295 /* 7 6 5 4 3 2 1 0 (MSB = 7, LSB = 0, 6+7 = exponent+sign) */
11296 const U8* nvp = (const U8*)(&nv);
11297 HEXTRACT_GET_SUBNORMAL(nv);
11298 HEXTRACT_IMPLICIT_BIT(nv);
11299 HEXTRACT_TOP_NYBBLE(1);
11300 HEXTRACT_BYTES_BE(2, 7);
11301 # elif DOUBLEKIND == DOUBLE_IS_IEEE_754_64_BIT_MIXED_ENDIAN_LE_BE
11302 /* 4 5 6 7 0 1 2 3 (MSB = 7, LSB = 0, 6:7 = nybble:exponent:sign) */
11303 const U8* nvp = (const U8*)(&nv);
11304 HEXTRACT_GET_SUBNORMAL(nv);
11305 HEXTRACT_IMPLICIT_BIT(nv);
11306 HEXTRACT_TOP_NYBBLE(2); /* 6 */
11307 HEXTRACT_BYTE(1); /* 5 */
11308 HEXTRACT_BYTE(0); /* 4 */
11309 HEXTRACT_BYTE(7); /* 3 */
11310 HEXTRACT_BYTE(6); /* 2 */
11311 HEXTRACT_BYTE(5); /* 1 */
11312 HEXTRACT_BYTE(4); /* 0 */
11313 # elif DOUBLEKIND == DOUBLE_IS_IEEE_754_64_BIT_MIXED_ENDIAN_BE_LE
11314 /* 3 2 1 0 7 6 5 4 (MSB = 7, LSB = 0, 7:6 = sign:exponent:nybble) */
11315 const U8* nvp = (const U8*)(&nv);
11316 HEXTRACT_GET_SUBNORMAL(nv);
11317 HEXTRACT_IMPLICIT_BIT(nv);
11318 HEXTRACT_TOP_NYBBLE(5); /* 6 */
11319 HEXTRACT_BYTE(6); /* 5 */
11320 HEXTRACT_BYTE(7); /* 4 */
11321 HEXTRACT_BYTE(0); /* 3 */
11322 HEXTRACT_BYTE(1); /* 2 */
11323 HEXTRACT_BYTE(2); /* 1 */
11324 HEXTRACT_BYTE(3); /* 0 */
11326 # define HEXTRACT_FALLBACK
11329 # define HEXTRACT_FALLBACK
11331 #endif /* #if defined(USE_LONG_DOUBLE) && (NVSIZE > DOUBLESIZE) #else */
11332 # ifdef HEXTRACT_FALLBACK
11333 HEXTRACT_GET_SUBNORMAL(nv);
11334 # undef HEXTRACT_HAS_TOP_NYBBLE /* Meaningless, but consistent. */
11335 /* The fallback is used for the double-double format, and
11336 * for unknown long double formats, and for unknown double
11337 * formats, or in general unknown NV formats. */
11338 if (nv == (NV)0.0) {
11346 NV d = nv < 0 ? -nv : nv;
11348 U8 ha = 0x0; /* hexvalue accumulator */
11349 U8 hd = 0x8; /* hexvalue digit */
11351 /* Shift d and e (and update exponent) so that e <= d < 2*e,
11352 * this is essentially manual frexp(). Multiplying by 0.5 and
11353 * doubling should be lossless in binary floating point. */
11363 while (d >= e + e) {
11367 /* Now e <= d < 2*e */
11369 /* First extract the leading hexdigit (the implicit bit). */
11385 /* Then extract the remaining hexdigits. */
11386 while (d > (NV)0.0) {
11392 /* Output or count in groups of four bits,
11393 * that is, when the hexdigit is down to one. */
11398 /* Reset the hexvalue. */
11407 /* Flush possible pending hexvalue. */
11417 /* Croak for various reasons: if the output pointer escaped the
11418 * output buffer, if the extraction index escaped the extraction
11419 * buffer, or if the ending output pointer didn't match the
11420 * previously computed value. */
11421 if (v <= vhex || v - vhex >= VHEX_SIZE ||
11422 /* For double-double the ixmin and ixmax stay at zero,
11423 * which is convenient since the HEXTRACTSIZE is tricky
11424 * for double-double. */
11425 ixmin < 0 || ixmax >= NVSIZE ||
11426 (vend && v != vend)) {
11427 /* diag_listed_as: Hexadecimal float: internal error (%s) */
11428 Perl_croak(aTHX_ "Hexadecimal float: internal error (overflow)");
11433 /* Helper for sv_vcatpvfn_flags(). */
11434 #define FETCH_VCATPVFN_ARGUMENT(var, in_range, expr) \
11439 (var) = &PL_sv_no; /* [perl #71000] */ \
11440 arg_missing = TRUE; \
11445 Perl_sv_vcatpvfn_flags(pTHX_ SV *const sv, const char *const pat, const STRLEN patlen,
11446 va_list *const args, SV **const svargs, const I32 svmax, bool *const maybe_tainted,
11451 const char *patend;
11454 static const char nullstr[] = "(null)";
11456 bool has_utf8 = DO_UTF8(sv); /* has the result utf8? */
11457 const bool pat_utf8 = has_utf8; /* the pattern is in utf8? */
11459 /* Times 4: a decimal digit takes more than 3 binary digits.
11460 * NV_DIG: mantissa takes than many decimal digits.
11461 * Plus 32: Playing safe. */
11462 char ebuf[IV_DIG * 4 + NV_DIG + 32];
11463 bool no_redundant_warning = FALSE; /* did we use any explicit format parameter index? */
11464 bool hexfp = FALSE; /* hexadecimal floating point? */
11466 DECLARATION_FOR_LC_NUMERIC_MANIPULATION;
11468 PERL_ARGS_ASSERT_SV_VCATPVFN_FLAGS;
11469 PERL_UNUSED_ARG(maybe_tainted);
11471 if (flags & SV_GMAGIC)
11474 /* no matter what, this is a string now */
11475 (void)SvPV_force_nomg(sv, origlen);
11477 /* special-case "", "%s", and "%-p" (SVf - see below) */
11479 if (svmax && ckWARN(WARN_REDUNDANT))
11480 Perl_warner(aTHX_ packWARN(WARN_REDUNDANT), "Redundant argument in %s",
11481 PL_op ? OP_DESC(PL_op) : "sv_vcatpvfn()");
11484 if (patlen == 2 && pat[0] == '%' && pat[1] == 's') {
11485 if (svmax > 1 && ckWARN(WARN_REDUNDANT))
11486 Perl_warner(aTHX_ packWARN(WARN_REDUNDANT), "Redundant argument in %s",
11487 PL_op ? OP_DESC(PL_op) : "sv_vcatpvfn()");
11490 const char * const s = va_arg(*args, char*);
11491 sv_catpv_nomg(sv, s ? s : nullstr);
11493 else if (svix < svmax) {
11494 /* we want get magic on the source but not the target. sv_catsv can't do that, though */
11495 SvGETMAGIC(*svargs);
11496 sv_catsv_nomg(sv, *svargs);
11499 S_warn_vcatpvfn_missing_argument(aTHX);
11502 if (args && patlen == 3 && pat[0] == '%' &&
11503 pat[1] == '-' && pat[2] == 'p') {
11504 if (svmax > 1 && ckWARN(WARN_REDUNDANT))
11505 Perl_warner(aTHX_ packWARN(WARN_REDUNDANT), "Redundant argument in %s",
11506 PL_op ? OP_DESC(PL_op) : "sv_vcatpvfn()");
11507 argsv = MUTABLE_SV(va_arg(*args, void*));
11508 sv_catsv_nomg(sv, argsv);
11512 #if !defined(USE_LONG_DOUBLE) && !defined(USE_QUADMATH)
11513 /* special-case "%.<number>[gf]" */
11514 if ( !args && patlen <= 5 && pat[0] == '%' && pat[1] == '.'
11515 && (pat[patlen-1] == 'g' || pat[patlen-1] == 'f') ) {
11516 unsigned digits = 0;
11520 while (*pp >= '0' && *pp <= '9')
11521 digits = 10 * digits + (*pp++ - '0');
11523 /* XXX: Why do this `svix < svmax` test? Couldn't we just
11524 format the first argument and WARN_REDUNDANT if svmax > 1?
11525 Munged by Nicholas Clark in v5.13.0-209-g95ea86d */
11526 if (pp - pat == (int)patlen - 1 && svix < svmax) {
11527 const NV nv = SvNV(*svargs);
11528 if (LIKELY(!Perl_isinfnan(nv))) {
11530 /* Add check for digits != 0 because it seems that some
11531 gconverts are buggy in this case, and we don't yet have
11532 a Configure test for this. */
11533 if (digits && digits < sizeof(ebuf) - NV_DIG - 10) {
11534 /* 0, point, slack */
11535 STORE_LC_NUMERIC_SET_TO_NEEDED();
11536 SNPRINTF_G(nv, ebuf, size, digits);
11537 sv_catpv_nomg(sv, ebuf);
11538 if (*ebuf) /* May return an empty string for digits==0 */
11541 } else if (!digits) {
11544 if ((p = F0convert(nv, ebuf + sizeof ebuf, &l))) {
11545 sv_catpvn_nomg(sv, p, l);
11552 #endif /* !USE_LONG_DOUBLE */
11554 if (!args && svix < svmax && DO_UTF8(*svargs))
11557 patend = (char*)pat + patlen;
11558 for (p = (char*)pat; p < patend; p = q) {
11561 bool vectorize = FALSE;
11562 bool vectorarg = FALSE;
11563 bool vec_utf8 = FALSE;
11569 bool has_precis = FALSE;
11571 const I32 osvix = svix;
11572 bool is_utf8 = FALSE; /* is this item utf8? */
11573 bool used_explicit_ix = FALSE;
11574 bool arg_missing = FALSE;
11575 #ifdef HAS_LDBL_SPRINTF_BUG
11576 /* This is to try to fix a bug with irix/nonstop-ux/powerux and
11577 with sfio - Allen <allens@cpan.org> */
11578 bool fix_ldbl_sprintf_bug = FALSE;
11582 U8 utf8buf[UTF8_MAXBYTES+1];
11583 STRLEN esignlen = 0;
11585 const char *eptr = NULL;
11586 const char *fmtstart;
11589 const U8 *vecstr = NULL;
11596 /* We need a long double target in case HAS_LONG_DOUBLE,
11597 * even without USE_LONG_DOUBLE, so that we can printf with
11598 * long double formats, even without NV being long double.
11599 * But we call the target 'fv' instead of 'nv', since most of
11600 * the time it is not (most compilers these days recognize
11601 * "long double", even if only as a synonym for "double").
11603 #if defined(HAS_LONG_DOUBLE) && LONG_DOUBLESIZE > DOUBLESIZE && \
11604 defined(PERL_PRIgldbl) && !defined(USE_QUADMATH)
11606 # ifdef Perl_isfinitel
11607 # define FV_ISFINITE(x) Perl_isfinitel(x)
11609 # define FV_GF PERL_PRIgldbl
11610 # if defined(__VMS) && defined(__ia64) && defined(__IEEE_FLOAT)
11611 /* Work around breakage in OTS$CVT_FLOAT_T_X */
11612 # define NV_TO_FV(nv,fv) STMT_START { \
11614 fv = Perl_isnan(_dv) ? LDBL_QNAN : _dv; \
11617 # define NV_TO_FV(nv,fv) (fv)=(nv)
11621 # define FV_GF NVgf
11622 # define NV_TO_FV(nv,fv) (fv)=(nv)
11624 #ifndef FV_ISFINITE
11625 # define FV_ISFINITE(x) Perl_isfinite((NV)(x))
11631 const char *dotstr = ".";
11632 STRLEN dotstrlen = 1;
11633 I32 efix = 0; /* explicit format parameter index */
11634 I32 ewix = 0; /* explicit width index */
11635 I32 epix = 0; /* explicit precision index */
11636 I32 evix = 0; /* explicit vector index */
11637 bool asterisk = FALSE;
11638 bool infnan = FALSE;
11640 /* echo everything up to the next format specification */
11641 for (q = p; q < patend && *q != '%'; ++q) ;
11643 if (has_utf8 && !pat_utf8)
11644 sv_catpvn_nomg_utf8_upgrade(sv, p, q - p, nsv);
11646 sv_catpvn_nomg(sv, p, q - p);
11655 We allow format specification elements in this order:
11656 \d+\$ explicit format parameter index
11658 v|\*(\d+\$)?v vector with optional (optionally specified) arg
11659 0 flag (as above): repeated to allow "v02"
11660 \d+|\*(\d+\$)? width using optional (optionally specified) arg
11661 \.(\d*|\*(\d+\$)?) precision using optional (optionally specified) arg
11663 [%bcdefginopsuxDFOUX] format (mandatory)
11668 As of perl5.9.3, printf format checking is on by default.
11669 Internally, perl uses %p formats to provide an escape to
11670 some extended formatting. This block deals with those
11671 extensions: if it does not match, (char*)q is reset and
11672 the normal format processing code is used.
11674 Currently defined extensions are:
11675 %p include pointer address (standard)
11676 %-p (SVf) include an SV (previously %_)
11677 %-<num>p include an SV with precision <num>
11679 %3p include a HEK with precision of 256
11680 %4p char* preceded by utf8 flag and length
11681 %<num>p (where num is 1 or > 4) reserved for future
11684 Robin Barker 2005-07-14 (but modified since)
11686 %1p (VDf) removed. RMB 2007-10-19
11693 else if (strnEQ(q, UTF8f, sizeof(UTF8f)-1)) { /* UTF8f */
11694 /* The argument has already gone through cBOOL, so the cast
11696 is_utf8 = (bool)va_arg(*args, int);
11697 elen = va_arg(*args, UV);
11698 /* if utf8 length is larger than 0x7ffff..., then it might
11699 * have been a signed value that wrapped */
11700 if (elen > ((~(STRLEN)0) >> 1)) {
11701 assert(0); /* in DEBUGGING build we want to crash */
11702 elen= 0; /* otherwise we want to treat this as an empty string */
11704 eptr = va_arg(*args, char *);
11705 q += sizeof(UTF8f)-1;
11708 n = expect_number(&q);
11710 if (sv) { /* SVf */
11715 argsv = MUTABLE_SV(va_arg(*args, void*));
11716 eptr = SvPV_const(argsv, elen);
11717 if (DO_UTF8(argsv))
11721 else if (n==2 || n==3) { /* HEKf */
11722 HEK * const hek = va_arg(*args, HEK *);
11723 eptr = HEK_KEY(hek);
11724 elen = HEK_LEN(hek);
11725 if (HEK_UTF8(hek)) is_utf8 = TRUE;
11726 if (n==3) precis = 256, has_precis = TRUE;
11730 Perl_ck_warner_d(aTHX_ packWARN(WARN_INTERNAL),
11731 "internal %%<num>p might conflict with future printf extensions");
11737 if ( (width = expect_number(&q)) ) {
11740 Perl_croak_nocontext(
11741 "Cannot yet reorder sv_catpvfn() arguments from va_list");
11744 used_explicit_ix = TRUE;
11756 if (plus == '+' && *q == ' ') /* '+' over ' ' */
11785 if ( (ewix = expect_number(&q)) ) {
11788 Perl_croak_nocontext(
11789 "Cannot yet reorder sv_catpvfn() arguments from va_list");
11790 used_explicit_ix = TRUE;
11800 if ((vectorarg = asterisk)) {
11813 width = expect_number(&q);
11816 if (vectorize && vectorarg) {
11817 /* vectorizing, but not with the default "." */
11819 vecsv = va_arg(*args, SV*);
11821 FETCH_VCATPVFN_ARGUMENT(
11822 vecsv, evix > 0 && evix <= svmax, svargs[evix-1]);
11824 FETCH_VCATPVFN_ARGUMENT(
11825 vecsv, svix < svmax, svargs[svix++]);
11827 dotstr = SvPV_const(vecsv, dotstrlen);
11828 /* Keep the DO_UTF8 test *after* the SvPV call, else things go
11829 bad with tied or overloaded values that return UTF8. */
11830 if (DO_UTF8(vecsv))
11832 else if (has_utf8) {
11833 vecsv = sv_mortalcopy(vecsv);
11834 sv_utf8_upgrade(vecsv);
11835 dotstr = SvPV_const(vecsv, dotstrlen);
11842 i = va_arg(*args, int);
11844 i = (ewix ? ewix <= svmax : svix < svmax) ?
11845 SvIVx(svargs[ewix ? ewix-1 : svix++]) : 0;
11847 width = (i < 0) ? -i : i;
11857 if ( (epix = expect_number(&q)) ) {
11860 Perl_croak_nocontext(
11861 "Cannot yet reorder sv_catpvfn() arguments from va_list");
11862 used_explicit_ix = TRUE;
11867 i = va_arg(*args, int);
11871 FETCH_VCATPVFN_ARGUMENT(
11872 precsv, epix > 0 && epix <= svmax, svargs[epix-1]);
11874 FETCH_VCATPVFN_ARGUMENT(
11875 precsv, svix < svmax, svargs[svix++]);
11876 i = precsv == &PL_sv_no ? 0 : SvIVx(precsv);
11879 has_precis = !(i < 0);
11883 while (isDIGIT(*q))
11884 precis = precis * 10 + (*q++ - '0');
11893 else if (efix ? (efix > 0 && efix <= svmax) : svix < svmax) {
11894 vecsv = svargs[efix ? efix-1 : svix++];
11895 vecstr = (U8*)SvPV_const(vecsv,veclen);
11896 vec_utf8 = DO_UTF8(vecsv);
11898 /* if this is a version object, we need to convert
11899 * back into v-string notation and then let the
11900 * vectorize happen normally
11902 if (sv_isobject(vecsv) && sv_derived_from(vecsv, "version")) {
11903 if ( hv_existss(MUTABLE_HV(SvRV(vecsv)), "alpha") ) {
11904 Perl_ck_warner_d(aTHX_ packWARN(WARN_PRINTF),
11905 "vector argument not supported with alpha versions");
11908 vecsv = sv_newmortal();
11909 scan_vstring((char *)vecstr, (char *)vecstr + veclen,
11911 vecstr = (U8*)SvPV_const(vecsv, veclen);
11912 vec_utf8 = DO_UTF8(vecsv);
11926 case 'I': /* Ix, I32x, and I64x */
11927 # ifdef USE_64_BIT_INT
11928 if (q[1] == '6' && q[2] == '4') {
11934 if (q[1] == '3' && q[2] == '2') {
11938 # ifdef USE_64_BIT_INT
11944 #if (IVSIZE >= 8 || defined(HAS_LONG_DOUBLE)) || \
11945 (IVSIZE == 4 && !defined(HAS_LONG_DOUBLE))
11948 # ifdef USE_QUADMATH
11961 #if (IVSIZE >= 8 || defined(HAS_LONG_DOUBLE)) || \
11962 (IVSIZE == 4 && !defined(HAS_LONG_DOUBLE))
11963 if (*q == 'l') { /* lld, llf */
11972 if (*++q == 'h') { /* hhd, hhu */
12001 if (!vectorize && !args) {
12003 const I32 i = efix-1;
12004 FETCH_VCATPVFN_ARGUMENT(argsv, i >= 0 && i < svmax, svargs[i]);
12006 FETCH_VCATPVFN_ARGUMENT(argsv, svix >= 0 && svix < svmax,
12011 if (argsv && strchr("BbcDdiOopuUXx",*q)) {
12012 /* XXX va_arg(*args) case? need peek, use va_copy? */
12014 if (UNLIKELY(SvAMAGIC(argsv)))
12015 argsv = sv_2num(argsv);
12016 infnan = UNLIKELY(isinfnansv(argsv));
12019 switch (c = *q++) {
12027 Perl_croak(aTHX_ "Cannot printf %" NVgf " with '%c'",
12028 /* no va_arg() case */
12029 SvNV_nomg(argsv), (int)c);
12030 uv = (args) ? va_arg(*args, int) : SvIV_nomg(argsv);
12032 (!UVCHR_IS_INVARIANT(uv) && SvUTF8(sv)))
12034 eptr = (char*)utf8buf;
12035 elen = uvchr_to_utf8((U8*)eptr, uv) - utf8buf;
12049 eptr = va_arg(*args, char*);
12051 elen = strlen(eptr);
12053 eptr = (char *)nullstr;
12054 elen = sizeof nullstr - 1;
12058 eptr = SvPV_const(argsv, elen);
12059 if (DO_UTF8(argsv)) {
12060 STRLEN old_precis = precis;
12061 if (has_precis && precis < elen) {
12062 STRLEN ulen = sv_or_pv_len_utf8(argsv, eptr, elen);
12063 STRLEN p = precis > ulen ? ulen : precis;
12064 precis = sv_or_pv_pos_u2b(argsv, eptr, p, 0);
12065 /* sticks at end */
12067 if (width) { /* fudge width (can't fudge elen) */
12068 if (has_precis && precis < elen)
12069 width += precis - old_precis;
12072 elen - sv_or_pv_len_utf8(argsv,eptr,elen);
12079 if (has_precis && precis < elen)
12087 goto floating_point;
12089 if (alt || vectorize)
12091 uv = PTR2UV(args ? va_arg(*args, void*) : argsv);
12105 goto floating_point;
12110 goto donevalidconversion;
12112 uv = utf8n_to_uvchr(vecstr, veclen, &ulen,
12121 esignbuf[esignlen++] = plus;
12125 case 'c': iv = (char)va_arg(*args, int); break;
12126 case 'h': iv = (short)va_arg(*args, int); break;
12127 case 'l': iv = va_arg(*args, long); break;
12128 case 'V': iv = va_arg(*args, IV); break;
12129 case 'z': iv = va_arg(*args, SSize_t); break;
12130 #ifdef HAS_PTRDIFF_T
12131 case 't': iv = va_arg(*args, ptrdiff_t); break;
12133 default: iv = va_arg(*args, int); break;
12135 case 'j': iv = va_arg(*args, intmax_t); break;
12139 iv = va_arg(*args, Quad_t); break;
12146 IV tiv = SvIV_nomg(argsv); /* work around GCC bug #13488 */
12148 case 'c': iv = (char)tiv; break;
12149 case 'h': iv = (short)tiv; break;
12150 case 'l': iv = (long)tiv; break;
12152 default: iv = tiv; break;
12155 iv = (Quad_t)tiv; break;
12161 if ( !vectorize ) /* we already set uv above */
12166 esignbuf[esignlen++] = plus;
12169 uv = (iv == IV_MIN) ? (UV)iv : (UV)(-iv);
12170 esignbuf[esignlen++] = '-';
12209 goto floating_point;
12215 goto donevalidconversion;
12217 uv = utf8n_to_uvchr(vecstr, veclen, &ulen,
12228 case 'c': uv = (unsigned char)va_arg(*args, unsigned); break;
12229 case 'h': uv = (unsigned short)va_arg(*args, unsigned); break;
12230 case 'l': uv = va_arg(*args, unsigned long); break;
12231 case 'V': uv = va_arg(*args, UV); break;
12232 case 'z': uv = va_arg(*args, Size_t); break;
12233 #ifdef HAS_PTRDIFF_T
12234 case 't': uv = va_arg(*args, ptrdiff_t); break; /* will sign extend, but there is no uptrdiff_t, so oh well */
12237 case 'j': uv = va_arg(*args, uintmax_t); break;
12239 default: uv = va_arg(*args, unsigned); break;
12242 uv = va_arg(*args, Uquad_t); break;
12249 UV tuv = SvUV_nomg(argsv); /* work around GCC bug #13488 */
12251 case 'c': uv = (unsigned char)tuv; break;
12252 case 'h': uv = (unsigned short)tuv; break;
12253 case 'l': uv = (unsigned long)tuv; break;
12255 default: uv = tuv; break;
12258 uv = (Uquad_t)tuv; break;
12267 char *ptr = ebuf + sizeof ebuf;
12268 bool tempalt = uv ? alt : FALSE; /* Vectors can't change alt */
12274 p = (char *)((c == 'X') ? PL_hexdigit + 16 : PL_hexdigit);
12278 } while (uv >>= 4);
12280 esignbuf[esignlen++] = '0';
12281 esignbuf[esignlen++] = c; /* 'x' or 'X' */
12287 *--ptr = '0' + dig;
12288 } while (uv >>= 3);
12289 if (alt && *ptr != '0')
12295 *--ptr = '0' + dig;
12296 } while (uv >>= 1);
12298 esignbuf[esignlen++] = '0';
12299 esignbuf[esignlen++] = c;
12302 default: /* it had better be ten or less */
12305 *--ptr = '0' + dig;
12306 } while (uv /= base);
12309 elen = (ebuf + sizeof ebuf) - ptr;
12313 zeros = precis - elen;
12314 else if (precis == 0 && elen == 1 && *eptr == '0'
12315 && !(base == 8 && alt)) /* "%#.0o" prints "0" */
12318 /* a precision nullifies the 0 flag. */
12325 /* FLOATING POINT */
12330 c = 'f'; /* maybe %F isn't supported here */
12332 case 'e': case 'E':
12334 case 'g': case 'G':
12335 case 'a': case 'A':
12339 /* This is evil, but floating point is even more evil */
12341 /* for SV-style calling, we can only get NV
12342 for C-style calling, we assume %f is double;
12343 for simplicity we allow any of %Lf, %llf, %qf for long double
12347 #if defined(USE_LONG_DOUBLE) || defined(USE_QUADMATH)
12351 /* [perl #20339] - we should accept and ignore %lf rather than die */
12355 #if defined(USE_LONG_DOUBLE) || defined(USE_QUADMATH)
12356 intsize = args ? 0 : 'q';
12360 #if defined(HAS_LONG_DOUBLE)
12373 /* Now we need (long double) if intsize == 'q', else (double). */
12375 /* Note: do not pull NVs off the va_list with va_arg()
12376 * (pull doubles instead) because if you have a build
12377 * with long doubles, you would always be pulling long
12378 * doubles, which would badly break anyone using only
12379 * doubles (i.e. the majority of builds). In other
12380 * words, you cannot mix doubles and long doubles.
12381 * The only case where you can pull off long doubles
12382 * is when the format specifier explicitly asks so with
12384 #ifdef USE_QUADMATH
12385 fv = intsize == 'q' ?
12386 va_arg(*args, NV) : va_arg(*args, double);
12388 #elif LONG_DOUBLESIZE > DOUBLESIZE
12389 if (intsize == 'q') {
12390 fv = va_arg(*args, long double);
12393 nv = va_arg(*args, double);
12397 nv = va_arg(*args, double);
12403 if (!infnan) SvGETMAGIC(argsv);
12404 nv = SvNV_nomg(argsv);
12409 /* frexp() (or frexpl) has some unspecified behaviour for
12410 * nan/inf/-inf, so let's avoid calling that on non-finites. */
12411 if (isALPHA_FOLD_NE(c, 'e') && FV_ISFINITE(fv)) {
12413 (void)Perl_frexp((NV)fv, &i);
12414 if (i == PERL_INT_MIN)
12415 Perl_die(aTHX_ "panic: frexp: %" FV_GF, fv);
12416 /* Do not set hexfp earlier since we want to printf
12417 * Inf/NaN for Inf/NaN, not their hexfp. */
12418 hexfp = isALPHA_FOLD_EQ(c, 'a');
12419 if (UNLIKELY(hexfp)) {
12420 /* This seriously overshoots in most cases, but
12421 * better the undershooting. Firstly, all bytes
12422 * of the NV are not mantissa, some of them are
12423 * exponent. Secondly, for the reasonably common
12424 * long doubles case, the "80-bit extended", two
12425 * or six bytes of the NV are unused. */
12427 (fv < 0) ? 1 : 0 + /* possible unary minus */
12429 1 + /* the very unlikely carry */
12432 2 * NVSIZE + /* 2 hexdigits for each byte */
12434 6 + /* exponent: sign, plus up to 16383 (quad fp) */
12436 #ifdef LONGDOUBLE_DOUBLEDOUBLE
12437 /* However, for the "double double", we need more.
12438 * Since each double has their own exponent, the
12439 * doubles may float (haha) rather far from each
12440 * other, and the number of required bits is much
12441 * larger, up to total of DOUBLEDOUBLE_MAXBITS bits.
12442 * See the definition of DOUBLEDOUBLE_MAXBITS.
12444 * Need 2 hexdigits for each byte. */
12445 need += (DOUBLEDOUBLE_MAXBITS/8 + 1) * 2;
12446 /* the size for the exponent already added */
12448 #ifdef USE_LOCALE_NUMERIC
12449 STORE_LC_NUMERIC_SET_TO_NEEDED();
12450 if (PL_numeric_radix_sv && IN_LC(LC_NUMERIC))
12451 need += SvLEN(PL_numeric_radix_sv);
12452 RESTORE_LC_NUMERIC();
12456 need = BIT_DIGITS(i);
12457 } /* if i < 0, the number of digits is hard to predict. */
12461 STRLEN pr = has_precis ? precis : 6; /* known default */
12462 if (need >= ((STRLEN)~0) - pr)
12463 croak_memory_wrap();
12470 #ifdef HAS_LDBL_SPRINTF_BUG
12471 /* This is to try to fix a bug with irix/nonstop-ux/powerux and
12472 with sfio - Allen <allens@cpan.org> */
12475 # define MY_DBL_MAX DBL_MAX
12476 # else /* XXX guessing! HUGE_VAL may be defined as infinity, so not using */
12477 # if DOUBLESIZE >= 8
12478 # define MY_DBL_MAX 1.7976931348623157E+308L
12480 # define MY_DBL_MAX 3.40282347E+38L
12484 # ifdef HAS_LDBL_SPRINTF_BUG_LESS1 /* only between -1L & 1L - Allen */
12485 # define MY_DBL_MAX_BUG 1L
12487 # define MY_DBL_MAX_BUG MY_DBL_MAX
12491 # define MY_DBL_MIN DBL_MIN
12492 # else /* XXX guessing! -Allen */
12493 # if DOUBLESIZE >= 8
12494 # define MY_DBL_MIN 2.2250738585072014E-308L
12496 # define MY_DBL_MIN 1.17549435E-38L
12500 if ((intsize == 'q') && (c == 'f') &&
12501 ((fv < MY_DBL_MAX_BUG) && (fv > -MY_DBL_MAX_BUG)) &&
12502 (need < DBL_DIG)) {
12503 /* it's going to be short enough that
12504 * long double precision is not needed */
12506 if ((fv <= 0L) && (fv >= -0L))
12507 fix_ldbl_sprintf_bug = TRUE; /* 0 is 0 - easiest */
12509 /* would use Perl_fp_class as a double-check but not
12510 * functional on IRIX - see perl.h comments */
12512 if ((fv >= MY_DBL_MIN) || (fv <= -MY_DBL_MIN)) {
12513 /* It's within the range that a double can represent */
12514 #if defined(DBL_MAX) && !defined(DBL_MIN)
12515 if ((fv >= ((long double)1/DBL_MAX)) ||
12516 (fv <= (-(long double)1/DBL_MAX)))
12518 fix_ldbl_sprintf_bug = TRUE;
12521 if (fix_ldbl_sprintf_bug == TRUE) {
12531 # undef MY_DBL_MAX_BUG
12534 #endif /* HAS_LDBL_SPRINTF_BUG */
12536 if (need >= ((STRLEN)~0) - 40)
12537 croak_memory_wrap();
12538 need += 40; /* fudge factor */
12539 if (PL_efloatsize < need) {
12540 Safefree(PL_efloatbuf);
12541 PL_efloatsize = need;
12542 Newx(PL_efloatbuf, PL_efloatsize, char);
12543 PL_efloatbuf[0] = '\0';
12546 if ( !(width || left || plus || alt) && fill != '0'
12547 && has_precis && intsize != 'q' /* Shortcuts */
12548 && LIKELY(!Perl_isinfnan((NV)fv)) ) {
12549 /* See earlier comment about buggy Gconvert when digits,
12551 if ( c == 'g' && precis ) {
12552 STORE_LC_NUMERIC_SET_TO_NEEDED();
12553 SNPRINTF_G(fv, PL_efloatbuf, PL_efloatsize, precis);
12554 /* May return an empty string for digits==0 */
12555 if (*PL_efloatbuf) {
12556 elen = strlen(PL_efloatbuf);
12557 goto float_converted;
12559 } else if ( c == 'f' && !precis ) {
12560 if ((eptr = F0convert(nv, ebuf + sizeof ebuf, &elen)))
12565 if (UNLIKELY(hexfp)) {
12566 /* Hexadecimal floating point. */
12567 char* p = PL_efloatbuf;
12568 U8 vhex[VHEX_SIZE];
12569 U8* v = vhex; /* working pointer to vhex */
12570 U8* vend; /* pointer to one beyond last digit of vhex */
12571 U8* vfnz = NULL; /* first non-zero */
12572 U8* vlnz = NULL; /* last non-zero */
12573 U8* v0 = NULL; /* first output */
12574 const bool lower = (c == 'a');
12575 /* At output the values of vhex (up to vend) will
12576 * be mapped through the xdig to get the actual
12577 * human-readable xdigits. */
12578 const char* xdig = PL_hexdigit;
12579 int zerotail = 0; /* how many extra zeros to append */
12580 int exponent = 0; /* exponent of the floating point input */
12581 bool hexradix = FALSE; /* should we output the radix */
12582 bool subnormal = FALSE; /* IEEE 754 subnormal/denormal */
12583 bool negative = FALSE;
12585 /* XXX: NaN, Inf -- though they are printed as "NaN" and "Inf".
12587 * For example with denormals, (assuming the vanilla
12588 * 64-bit double): the exponent is zero. 1xp-1074 is
12589 * the smallest denormal and the smallest double, it
12590 * could be output also as 0x0.0000000000001p-1022 to
12591 * match its internal structure. */
12593 vend = S_hextract(aTHX_ nv, &exponent, &subnormal, vhex, NULL);
12594 S_hextract(aTHX_ nv, &exponent, &subnormal, vhex, vend);
12596 #if NVSIZE > DOUBLESIZE
12597 # ifdef HEXTRACT_HAS_IMPLICIT_BIT
12598 /* In this case there is an implicit bit,
12599 * and therefore the exponent is shifted by one. */
12602 # ifdef NV_X86_80_BIT
12604 /* The subnormals of the x86-80 have a base exponent of -16382,
12605 * (while the physical exponent bits are zero) but the frexp()
12606 * returned the scientific-style floating exponent. We want
12607 * to map the last one as:
12608 * -16831..-16384 -> -16382 (the last normal is 0x1p-16382)
12609 * -16835..-16388 -> -16384
12610 * since we want to keep the first hexdigit
12611 * as one of the [8421]. */
12612 exponent = -4 * ( (exponent + 1) / -4) - 2;
12617 /* TBD: other non-implicit-bit platforms than the x86-80. */
12621 negative = fv < 0 || Perl_signbit(nv);
12632 xdig += 16; /* Use uppercase hex. */
12635 /* Find the first non-zero xdigit. */
12636 for (v = vhex; v < vend; v++) {
12644 /* Find the last non-zero xdigit. */
12645 for (v = vend - 1; v >= vhex; v--) {
12652 #if NVSIZE == DOUBLESIZE
12658 #ifndef NV_X86_80_BIT
12660 /* IEEE 754 subnormals (but not the x86 80-bit):
12661 * we want "normalize" the subnormal,
12662 * so we need to right shift the hex nybbles
12663 * so that the output of the subnormal starts
12664 * from the first true bit. (Another, equally
12665 * valid, policy would be to dump the subnormal
12666 * nybbles as-is, to display the "physical" layout.) */
12669 /* Find the ceil(log2(v[0])) of
12670 * the top non-zero nybble. */
12671 for (i = vfnz[0], n = 0; i > 1; i >>= 1, n++) { }
12674 for (vshr = vlnz; vshr >= vfnz; vshr--) {
12675 vshr[1] |= (vshr[0] & (0xF >> (4 - n))) << (4 - n);
12689 U8* ve = (subnormal ? vlnz + 1 : vend);
12690 SSize_t vn = ve - (subnormal ? vfnz : vhex);
12691 if ((SSize_t)(precis + 1) < vn) {
12692 bool overflow = FALSE;
12693 if (v0[precis + 1] < 0x8) {
12694 /* Round down, nothing to do. */
12695 } else if (v0[precis + 1] > 0x8) {
12698 overflow = v0[precis] > 0xF;
12700 } else { /* v0[precis] == 0x8 */
12701 /* Half-point: round towards the one
12702 * with the even least-significant digit:
12710 * 78 -> 8 f8 -> 10 */
12711 if ((v0[precis] & 0x1)) {
12714 overflow = v0[precis] > 0xF;
12719 for (v = v0 + precis - 1; v >= v0; v--) {
12721 overflow = *v > 0xF;
12727 if (v == v0 - 1 && overflow) {
12728 /* If the overflow goes all the
12729 * way to the front, we need to
12730 * insert 0x1 in front, and adjust
12732 Move(v0, v0 + 1, vn, char);
12738 /* The new effective "last non zero". */
12739 vlnz = v0 + precis;
12743 subnormal ? precis - vn + 1 :
12744 precis - (vlnz - vhex);
12751 /* If there are non-zero xdigits, the radix
12752 * is output after the first one. */
12763 /* The radix is always output if precis, or if alt. */
12764 if (precis > 0 || alt) {
12769 #ifndef USE_LOCALE_NUMERIC
12772 STORE_LC_NUMERIC_SET_TO_NEEDED();
12773 if (PL_numeric_radix_sv && IN_LC(LC_NUMERIC)) {
12775 const char* r = SvPV(PL_numeric_radix_sv, n);
12776 Copy(r, p, n, char);
12782 RESTORE_LC_NUMERIC();
12791 if (zerotail > 0) {
12792 while (zerotail--) {
12797 elen = p - PL_efloatbuf;
12798 elen += my_snprintf(p, PL_efloatsize - elen,
12799 "%c%+d", lower ? 'p' : 'P',
12802 if (elen < width) {
12804 /* Pad the back with spaces. */
12805 memset(PL_efloatbuf + elen, ' ', width - elen);
12807 else if (fill == '0') {
12808 /* Insert the zeros after the "0x" and the
12809 * the potential sign, but before the digits,
12810 * otherwise we end up with "0000xH.HHH...",
12811 * when we want "0x000H.HHH..." */
12812 STRLEN nzero = width - elen;
12813 char* zerox = PL_efloatbuf + 2;
12814 STRLEN nmove = elen - 2;
12815 if (negative || plus) {
12819 Move(zerox, zerox + nzero, nmove, char);
12820 memset(zerox, fill, nzero);
12823 /* Move it to the right. */
12824 Move(PL_efloatbuf, PL_efloatbuf + width - elen,
12826 /* Pad the front with spaces. */
12827 memset(PL_efloatbuf, ' ', width - elen);
12833 elen = S_infnan_2pv(nv, PL_efloatbuf, PL_efloatsize, plus);
12835 /* Not affecting infnan output: precision, alt, fill. */
12836 if (elen < width) {
12838 /* Pack the back with spaces. */
12839 memset(PL_efloatbuf + elen, ' ', width - elen);
12841 /* Move it to the right. */
12842 Move(PL_efloatbuf, PL_efloatbuf + width - elen,
12844 /* Pad the front with spaces. */
12845 memset(PL_efloatbuf, ' ', width - elen);
12853 char *ptr = ebuf + sizeof ebuf;
12856 #if defined(USE_QUADMATH)
12857 if (intsize == 'q') {
12861 /* FIXME: what to do if HAS_LONG_DOUBLE but not PERL_PRIfldbl? */
12862 #elif defined(HAS_LONG_DOUBLE) && defined(PERL_PRIfldbl)
12863 /* Note that this is HAS_LONG_DOUBLE and PERL_PRIfldbl,
12864 * not USE_LONG_DOUBLE and NVff. In other words,
12865 * this needs to work without USE_LONG_DOUBLE. */
12866 if (intsize == 'q') {
12867 /* Copy the one or more characters in a long double
12868 * format before the 'base' ([efgEFG]) character to
12869 * the format string. */
12870 static char const ldblf[] = PERL_PRIfldbl;
12871 char const *p = ldblf + sizeof(ldblf) - 3;
12872 while (p >= ldblf) { *--ptr = *p--; }
12877 do { *--ptr = '0' + (base % 10); } while (base /= 10);
12882 do { *--ptr = '0' + (base % 10); } while (base /= 10);
12894 /* No taint. Otherwise we are in the strange situation
12895 * where printf() taints but print($float) doesn't.
12898 STORE_LC_NUMERIC_SET_TO_NEEDED();
12900 /* hopefully the above makes ptr a very constrained format
12901 * that is safe to use, even though it's not literal */
12902 GCC_DIAG_IGNORE(-Wformat-nonliteral);
12903 #ifdef USE_QUADMATH
12905 const char* qfmt = quadmath_format_single(ptr);
12907 Perl_croak_nocontext("panic: quadmath invalid format \"%s\"", ptr);
12908 elen = quadmath_snprintf(PL_efloatbuf, PL_efloatsize,
12910 if ((IV)elen == -1) {
12913 Perl_croak_nocontext("panic: quadmath_snprintf failed, format \"%s\"", qfmt);
12918 #elif defined(HAS_LONG_DOUBLE)
12919 elen = ((intsize == 'q')
12920 ? my_snprintf(PL_efloatbuf, PL_efloatsize, ptr, fv)
12921 : my_snprintf(PL_efloatbuf, PL_efloatsize, ptr, (double)fv));
12923 elen = my_sprintf(PL_efloatbuf, ptr, fv);
12929 eptr = PL_efloatbuf;
12930 assert((IV)elen > 0); /* here zero elen is bad */
12932 #ifdef USE_LOCALE_NUMERIC
12933 /* If the decimal point character in the string is UTF-8, make the
12935 if (PL_numeric_radix_sv && SvUTF8(PL_numeric_radix_sv)
12936 && instr(eptr, SvPVX_const(PL_numeric_radix_sv)))
12949 i = SvCUR(sv) - origlen;
12952 case 'c': *(va_arg(*args, char*)) = i; break;
12953 case 'h': *(va_arg(*args, short*)) = i; break;
12954 default: *(va_arg(*args, int*)) = i; break;
12955 case 'l': *(va_arg(*args, long*)) = i; break;
12956 case 'V': *(va_arg(*args, IV*)) = i; break;
12957 case 'z': *(va_arg(*args, SSize_t*)) = i; break;
12958 #ifdef HAS_PTRDIFF_T
12959 case 't': *(va_arg(*args, ptrdiff_t*)) = i; break;
12962 case 'j': *(va_arg(*args, intmax_t*)) = i; break;
12966 *(va_arg(*args, Quad_t*)) = i; break;
12973 sv_setuv_mg(argsv, has_utf8 ? (UV)sv_len_utf8(sv) : (UV)i);
12974 goto donevalidconversion;
12981 && (PL_op->op_type == OP_PRTF || PL_op->op_type == OP_SPRINTF)
12982 && ckWARN(WARN_PRINTF))
12984 SV * const msg = sv_newmortal();
12985 Perl_sv_setpvf(aTHX_ msg, "Invalid conversion in %sprintf: ",
12986 (PL_op->op_type == OP_PRTF) ? "" : "s");
12987 if (fmtstart < patend) {
12988 const char * const fmtend = q < patend ? q : patend;
12990 sv_catpvs(msg, "\"%");
12991 for (f = fmtstart; f < fmtend; f++) {
12993 sv_catpvn_nomg(msg, f, 1);
12995 Perl_sv_catpvf(aTHX_ msg,
12996 "\\%03" UVof, (UV)*f & 0xFF);
12999 sv_catpvs(msg, "\"");
13001 sv_catpvs(msg, "end of string");
13003 Perl_warner(aTHX_ packWARN(WARN_PRINTF), "%" SVf, SVfARG(msg)); /* yes, this is reentrant */
13006 /* output mangled stuff ... */
13012 /* ... right here, because formatting flags should not apply */
13013 SvGROW(sv, SvCUR(sv) + elen + 1);
13015 Copy(eptr, p, elen, char);
13018 SvCUR_set(sv, p - SvPVX_const(sv));
13020 continue; /* not "break" */
13023 if (is_utf8 != has_utf8) {
13026 sv_utf8_upgrade(sv);
13029 const STRLEN old_elen = elen;
13030 SV * const nsv = newSVpvn_flags(eptr, elen, SVs_TEMP);
13031 sv_utf8_upgrade(nsv);
13032 eptr = SvPVX_const(nsv);
13035 if (width) { /* fudge width (can't fudge elen) */
13036 width += elen - old_elen;
13042 /* signed value that's wrapped? */
13043 assert(elen <= ((~(STRLEN)0) >> 1));
13044 have = esignlen + zeros + elen;
13046 croak_memory_wrap();
13048 need = (have > width ? have : width);
13051 if (need >= (((STRLEN)~0) - SvCUR(sv) - dotstrlen - 1))
13052 croak_memory_wrap();
13053 SvGROW(sv, SvCUR(sv) + need + dotstrlen + 1);
13055 if (esignlen && fill == '0') {
13057 for (i = 0; i < (int)esignlen; i++)
13058 *p++ = esignbuf[i];
13060 if (gap && !left) {
13061 memset(p, fill, gap);
13064 if (esignlen && fill != '0') {
13066 for (i = 0; i < (int)esignlen; i++)
13067 *p++ = esignbuf[i];
13071 for (i = zeros; i; i--)
13075 Copy(eptr, p, elen, char);
13079 memset(p, ' ', gap);
13084 Copy(dotstr, p, dotstrlen, char);
13088 vectorize = FALSE; /* done iterating over vecstr */
13095 SvCUR_set(sv, p - SvPVX_const(sv));
13101 donevalidconversion:
13102 if (used_explicit_ix)
13103 no_redundant_warning = TRUE;
13105 S_warn_vcatpvfn_missing_argument(aTHX);
13108 /* Now that we've consumed all our printf format arguments (svix)
13109 * do we have things left on the stack that we didn't use?
13111 if (!no_redundant_warning && svmax >= svix + 1 && ckWARN(WARN_REDUNDANT)) {
13112 Perl_warner(aTHX_ packWARN(WARN_REDUNDANT), "Redundant argument in %s",
13113 PL_op ? OP_DESC(PL_op) : "sv_vcatpvfn()");
13118 RESTORE_LC_NUMERIC(); /* Done outside loop, so don't have to save/restore
13122 /* =========================================================================
13124 =head1 Cloning an interpreter
13128 All the macros and functions in this section are for the private use of
13129 the main function, perl_clone().
13131 The foo_dup() functions make an exact copy of an existing foo thingy.
13132 During the course of a cloning, a hash table is used to map old addresses
13133 to new addresses. The table is created and manipulated with the
13134 ptr_table_* functions.
13136 * =========================================================================*/
13139 #if defined(USE_ITHREADS)
13141 /* XXX Remove this so it doesn't have to go thru the macro and return for nothing */
13142 #ifndef GpREFCNT_inc
13143 # define GpREFCNT_inc(gp) ((gp) ? (++(gp)->gp_refcnt, (gp)) : (GP*)NULL)
13147 /* Certain cases in Perl_ss_dup have been merged, by relying on the fact
13148 that currently av_dup, gv_dup and hv_dup are the same as sv_dup.
13149 If this changes, please unmerge ss_dup.
13150 Likewise, sv_dup_inc_multiple() relies on this fact. */
13151 #define sv_dup_inc_NN(s,t) SvREFCNT_inc_NN(sv_dup_inc(s,t))
13152 #define av_dup(s,t) MUTABLE_AV(sv_dup((const SV *)s,t))
13153 #define av_dup_inc(s,t) MUTABLE_AV(sv_dup_inc((const SV *)s,t))
13154 #define hv_dup(s,t) MUTABLE_HV(sv_dup((const SV *)s,t))
13155 #define hv_dup_inc(s,t) MUTABLE_HV(sv_dup_inc((const SV *)s,t))
13156 #define cv_dup(s,t) MUTABLE_CV(sv_dup((const SV *)s,t))
13157 #define cv_dup_inc(s,t) MUTABLE_CV(sv_dup_inc((const SV *)s,t))
13158 #define io_dup(s,t) MUTABLE_IO(sv_dup((const SV *)s,t))
13159 #define io_dup_inc(s,t) MUTABLE_IO(sv_dup_inc((const SV *)s,t))
13160 #define gv_dup(s,t) MUTABLE_GV(sv_dup((const SV *)s,t))
13161 #define gv_dup_inc(s,t) MUTABLE_GV(sv_dup_inc((const SV *)s,t))
13162 #define SAVEPV(p) ((p) ? savepv(p) : NULL)
13163 #define SAVEPVN(p,n) ((p) ? savepvn(p,n) : NULL)
13165 /* clone a parser */
13168 Perl_parser_dup(pTHX_ const yy_parser *const proto, CLONE_PARAMS *const param)
13172 PERL_ARGS_ASSERT_PARSER_DUP;
13177 /* look for it in the table first */
13178 parser = (yy_parser *)ptr_table_fetch(PL_ptr_table, proto);
13182 /* create anew and remember what it is */
13183 Newxz(parser, 1, yy_parser);
13184 ptr_table_store(PL_ptr_table, proto, parser);
13186 /* XXX these not yet duped */
13187 parser->old_parser = NULL;
13188 parser->stack = NULL;
13190 parser->stack_max1 = 0;
13191 /* XXX parser->stack->state = 0; */
13193 /* XXX eventually, just Copy() most of the parser struct ? */
13195 parser->lex_brackets = proto->lex_brackets;
13196 parser->lex_casemods = proto->lex_casemods;
13197 parser->lex_brackstack = savepvn(proto->lex_brackstack,
13198 (proto->lex_brackets < 120 ? 120 : proto->lex_brackets));
13199 parser->lex_casestack = savepvn(proto->lex_casestack,
13200 (proto->lex_casemods < 12 ? 12 : proto->lex_casemods));
13201 parser->lex_defer = proto->lex_defer;
13202 parser->lex_dojoin = proto->lex_dojoin;
13203 parser->lex_formbrack = proto->lex_formbrack;
13204 parser->lex_inpat = proto->lex_inpat;
13205 parser->lex_inwhat = proto->lex_inwhat;
13206 parser->lex_op = proto->lex_op;
13207 parser->lex_repl = sv_dup_inc(proto->lex_repl, param);
13208 parser->lex_starts = proto->lex_starts;
13209 parser->lex_stuff = sv_dup_inc(proto->lex_stuff, param);
13210 parser->multi_close = proto->multi_close;
13211 parser->multi_open = proto->multi_open;
13212 parser->multi_start = proto->multi_start;
13213 parser->multi_end = proto->multi_end;
13214 parser->preambled = proto->preambled;
13215 parser->lex_super_state = proto->lex_super_state;
13216 parser->lex_sub_inwhat = proto->lex_sub_inwhat;
13217 parser->lex_sub_op = proto->lex_sub_op;
13218 parser->lex_sub_repl= sv_dup_inc(proto->lex_sub_repl, param);
13219 parser->linestr = sv_dup_inc(proto->linestr, param);
13220 parser->expect = proto->expect;
13221 parser->copline = proto->copline;
13222 parser->last_lop_op = proto->last_lop_op;
13223 parser->lex_state = proto->lex_state;
13224 parser->rsfp = fp_dup(proto->rsfp, '<', param);
13225 /* rsfp_filters entries have fake IoDIRP() */
13226 parser->rsfp_filters= av_dup_inc(proto->rsfp_filters, param);
13227 parser->in_my = proto->in_my;
13228 parser->in_my_stash = hv_dup(proto->in_my_stash, param);
13229 parser->error_count = proto->error_count;
13230 parser->sig_elems = proto->sig_elems;
13231 parser->sig_optelems= proto->sig_optelems;
13232 parser->sig_slurpy = proto->sig_slurpy;
13233 parser->recheck_utf8_validity = proto->recheck_utf8_validity;
13234 parser->linestr = sv_dup_inc(proto->linestr, param);
13237 char * const ols = SvPVX(proto->linestr);
13238 char * const ls = SvPVX(parser->linestr);
13240 parser->bufptr = ls + (proto->bufptr >= ols ?
13241 proto->bufptr - ols : 0);
13242 parser->oldbufptr = ls + (proto->oldbufptr >= ols ?
13243 proto->oldbufptr - ols : 0);
13244 parser->oldoldbufptr= ls + (proto->oldoldbufptr >= ols ?
13245 proto->oldoldbufptr - ols : 0);
13246 parser->linestart = ls + (proto->linestart >= ols ?
13247 proto->linestart - ols : 0);
13248 parser->last_uni = ls + (proto->last_uni >= ols ?
13249 proto->last_uni - ols : 0);
13250 parser->last_lop = ls + (proto->last_lop >= ols ?
13251 proto->last_lop - ols : 0);
13253 parser->bufend = ls + SvCUR(parser->linestr);
13256 Copy(proto->tokenbuf, parser->tokenbuf, 256, char);
13259 Copy(proto->nextval, parser->nextval, 5, YYSTYPE);
13260 Copy(proto->nexttype, parser->nexttype, 5, I32);
13261 parser->nexttoke = proto->nexttoke;
13263 /* XXX should clone saved_curcop here, but we aren't passed
13264 * proto_perl; so do it in perl_clone_using instead */
13270 /* duplicate a file handle */
13273 Perl_fp_dup(pTHX_ PerlIO *const fp, const char type, CLONE_PARAMS *const param)
13277 PERL_ARGS_ASSERT_FP_DUP;
13278 PERL_UNUSED_ARG(type);
13281 return (PerlIO*)NULL;
13283 /* look for it in the table first */
13284 ret = (PerlIO*)ptr_table_fetch(PL_ptr_table, fp);
13288 /* create anew and remember what it is */
13289 #ifdef __amigaos4__
13290 ret = PerlIO_fdupopen(aTHX_ fp, param, PERLIO_DUP_CLONE|PERLIO_DUP_FD);
13292 ret = PerlIO_fdupopen(aTHX_ fp, param, PERLIO_DUP_CLONE);
13294 ptr_table_store(PL_ptr_table, fp, ret);
13298 /* duplicate a directory handle */
13301 Perl_dirp_dup(pTHX_ DIR *const dp, CLONE_PARAMS *const param)
13305 #if defined(HAS_FCHDIR) && defined(HAS_TELLDIR) && defined(HAS_SEEKDIR)
13307 const Direntry_t *dirent;
13308 char smallbuf[256]; /* XXX MAXPATHLEN, surely? */
13314 PERL_UNUSED_CONTEXT;
13315 PERL_ARGS_ASSERT_DIRP_DUP;
13320 /* look for it in the table first */
13321 ret = (DIR*)ptr_table_fetch(PL_ptr_table, dp);
13325 #if defined(HAS_FCHDIR) && defined(HAS_TELLDIR) && defined(HAS_SEEKDIR)
13327 PERL_UNUSED_ARG(param);
13331 /* open the current directory (so we can switch back) */
13332 if (!(pwd = PerlDir_open("."))) return (DIR *)NULL;
13334 /* chdir to our dir handle and open the present working directory */
13335 if (fchdir(my_dirfd(dp)) < 0 || !(ret = PerlDir_open("."))) {
13336 PerlDir_close(pwd);
13337 return (DIR *)NULL;
13339 /* Now we should have two dir handles pointing to the same dir. */
13341 /* Be nice to the calling code and chdir back to where we were. */
13342 /* XXX If this fails, then what? */
13343 PERL_UNUSED_RESULT(fchdir(my_dirfd(pwd)));
13345 /* We have no need of the pwd handle any more. */
13346 PerlDir_close(pwd);
13349 # define d_namlen(d) (d)->d_namlen
13351 # define d_namlen(d) strlen((d)->d_name)
13353 /* Iterate once through dp, to get the file name at the current posi-
13354 tion. Then step back. */
13355 pos = PerlDir_tell(dp);
13356 if ((dirent = PerlDir_read(dp))) {
13357 len = d_namlen(dirent);
13358 if (len > sizeof(dirent->d_name) && sizeof(dirent->d_name) > PTRSIZE) {
13359 /* If the len is somehow magically longer than the
13360 * maximum length of the directory entry, even though
13361 * we could fit it in a buffer, we could not copy it
13362 * from the dirent. Bail out. */
13363 PerlDir_close(ret);
13366 if (len <= sizeof smallbuf) name = smallbuf;
13367 else Newx(name, len, char);
13368 Move(dirent->d_name, name, len, char);
13370 PerlDir_seek(dp, pos);
13372 /* Iterate through the new dir handle, till we find a file with the
13374 if (!dirent) /* just before the end */
13376 pos = PerlDir_tell(ret);
13377 if (PerlDir_read(ret)) continue; /* not there yet */
13378 PerlDir_seek(ret, pos); /* step back */
13382 const long pos0 = PerlDir_tell(ret);
13384 pos = PerlDir_tell(ret);
13385 if ((dirent = PerlDir_read(ret))) {
13386 if (len == (STRLEN)d_namlen(dirent)
13387 && memEQ(name, dirent->d_name, len)) {
13389 PerlDir_seek(ret, pos); /* step back */
13392 /* else we are not there yet; keep iterating */
13394 else { /* This is not meant to happen. The best we can do is
13395 reset the iterator to the beginning. */
13396 PerlDir_seek(ret, pos0);
13403 if (name && name != smallbuf)
13408 ret = win32_dirp_dup(dp, param);
13411 /* pop it in the pointer table */
13413 ptr_table_store(PL_ptr_table, dp, ret);
13418 /* duplicate a typeglob */
13421 Perl_gp_dup(pTHX_ GP *const gp, CLONE_PARAMS *const param)
13425 PERL_ARGS_ASSERT_GP_DUP;
13429 /* look for it in the table first */
13430 ret = (GP*)ptr_table_fetch(PL_ptr_table, gp);
13434 /* create anew and remember what it is */
13436 ptr_table_store(PL_ptr_table, gp, ret);
13439 /* ret->gp_refcnt must be 0 before any other dups are called. We're relying
13440 on Newxz() to do this for us. */
13441 ret->gp_sv = sv_dup_inc(gp->gp_sv, param);
13442 ret->gp_io = io_dup_inc(gp->gp_io, param);
13443 ret->gp_form = cv_dup_inc(gp->gp_form, param);
13444 ret->gp_av = av_dup_inc(gp->gp_av, param);
13445 ret->gp_hv = hv_dup_inc(gp->gp_hv, param);
13446 ret->gp_egv = gv_dup(gp->gp_egv, param);/* GvEGV is not refcounted */
13447 ret->gp_cv = cv_dup_inc(gp->gp_cv, param);
13448 ret->gp_cvgen = gp->gp_cvgen;
13449 ret->gp_line = gp->gp_line;
13450 ret->gp_file_hek = hek_dup(gp->gp_file_hek, param);
13454 /* duplicate a chain of magic */
13457 Perl_mg_dup(pTHX_ MAGIC *mg, CLONE_PARAMS *const param)
13459 MAGIC *mgret = NULL;
13460 MAGIC **mgprev_p = &mgret;
13462 PERL_ARGS_ASSERT_MG_DUP;
13464 for (; mg; mg = mg->mg_moremagic) {
13467 if ((param->flags & CLONEf_JOIN_IN)
13468 && mg->mg_type == PERL_MAGIC_backref)
13469 /* when joining, we let the individual SVs add themselves to
13470 * backref as needed. */
13473 Newx(nmg, 1, MAGIC);
13475 mgprev_p = &(nmg->mg_moremagic);
13477 /* There was a comment "XXX copy dynamic vtable?" but as we don't have
13478 dynamic vtables, I'm not sure why Sarathy wrote it. The comment dates
13479 from the original commit adding Perl_mg_dup() - revision 4538.
13480 Similarly there is the annotation "XXX random ptr?" next to the
13481 assignment to nmg->mg_ptr. */
13484 /* FIXME for plugins
13485 if (nmg->mg_type == PERL_MAGIC_qr) {
13486 nmg->mg_obj = MUTABLE_SV(CALLREGDUPE((REGEXP*)nmg->mg_obj, param));
13490 nmg->mg_obj = (nmg->mg_flags & MGf_REFCOUNTED)
13491 ? nmg->mg_type == PERL_MAGIC_backref
13492 /* The backref AV has its reference
13493 * count deliberately bumped by 1 */
13494 ? SvREFCNT_inc(av_dup_inc((const AV *)
13495 nmg->mg_obj, param))
13496 : sv_dup_inc(nmg->mg_obj, param)
13497 : (nmg->mg_type == PERL_MAGIC_regdatum ||
13498 nmg->mg_type == PERL_MAGIC_regdata)
13500 : sv_dup(nmg->mg_obj, param);
13502 if (nmg->mg_ptr && nmg->mg_type != PERL_MAGIC_regex_global) {
13503 if (nmg->mg_len > 0) {
13504 nmg->mg_ptr = SAVEPVN(nmg->mg_ptr, nmg->mg_len);
13505 if (nmg->mg_type == PERL_MAGIC_overload_table &&
13506 AMT_AMAGIC((AMT*)nmg->mg_ptr))
13508 AMT * const namtp = (AMT*)nmg->mg_ptr;
13509 sv_dup_inc_multiple((SV**)(namtp->table),
13510 (SV**)(namtp->table), NofAMmeth, param);
13513 else if (nmg->mg_len == HEf_SVKEY)
13514 nmg->mg_ptr = (char*)sv_dup_inc((const SV *)nmg->mg_ptr, param);
13516 if ((nmg->mg_flags & MGf_DUP) && nmg->mg_virtual && nmg->mg_virtual->svt_dup) {
13517 nmg->mg_virtual->svt_dup(aTHX_ nmg, param);
13523 #endif /* USE_ITHREADS */
13525 struct ptr_tbl_arena {
13526 struct ptr_tbl_arena *next;
13527 struct ptr_tbl_ent array[1023/3]; /* as ptr_tbl_ent has 3 pointers. */
13530 /* create a new pointer-mapping table */
13533 Perl_ptr_table_new(pTHX)
13536 PERL_UNUSED_CONTEXT;
13538 Newx(tbl, 1, PTR_TBL_t);
13539 tbl->tbl_max = 511;
13540 tbl->tbl_items = 0;
13541 tbl->tbl_arena = NULL;
13542 tbl->tbl_arena_next = NULL;
13543 tbl->tbl_arena_end = NULL;
13544 Newxz(tbl->tbl_ary, tbl->tbl_max + 1, PTR_TBL_ENT_t*);
13548 #define PTR_TABLE_HASH(ptr) \
13549 ((PTR2UV(ptr) >> 3) ^ (PTR2UV(ptr) >> (3 + 7)) ^ (PTR2UV(ptr) >> (3 + 17)))
13551 /* map an existing pointer using a table */
13553 STATIC PTR_TBL_ENT_t *
13554 S_ptr_table_find(PTR_TBL_t *const tbl, const void *const sv)
13556 PTR_TBL_ENT_t *tblent;
13557 const UV hash = PTR_TABLE_HASH(sv);
13559 PERL_ARGS_ASSERT_PTR_TABLE_FIND;
13561 tblent = tbl->tbl_ary[hash & tbl->tbl_max];
13562 for (; tblent; tblent = tblent->next) {
13563 if (tblent->oldval == sv)
13570 Perl_ptr_table_fetch(pTHX_ PTR_TBL_t *const tbl, const void *const sv)
13572 PTR_TBL_ENT_t const *const tblent = ptr_table_find(tbl, sv);
13574 PERL_ARGS_ASSERT_PTR_TABLE_FETCH;
13575 PERL_UNUSED_CONTEXT;
13577 return tblent ? tblent->newval : NULL;
13580 /* add a new entry to a pointer-mapping table 'tbl'. In hash terms, 'oldsv' is
13581 * the key; 'newsv' is the value. The names "old" and "new" are specific to
13582 * the core's typical use of ptr_tables in thread cloning. */
13585 Perl_ptr_table_store(pTHX_ PTR_TBL_t *const tbl, const void *const oldsv, void *const newsv)
13587 PTR_TBL_ENT_t *tblent = ptr_table_find(tbl, oldsv);
13589 PERL_ARGS_ASSERT_PTR_TABLE_STORE;
13590 PERL_UNUSED_CONTEXT;
13593 tblent->newval = newsv;
13595 const UV entry = PTR_TABLE_HASH(oldsv) & tbl->tbl_max;
13597 if (tbl->tbl_arena_next == tbl->tbl_arena_end) {
13598 struct ptr_tbl_arena *new_arena;
13600 Newx(new_arena, 1, struct ptr_tbl_arena);
13601 new_arena->next = tbl->tbl_arena;
13602 tbl->tbl_arena = new_arena;
13603 tbl->tbl_arena_next = new_arena->array;
13604 tbl->tbl_arena_end = C_ARRAY_END(new_arena->array);
13607 tblent = tbl->tbl_arena_next++;
13609 tblent->oldval = oldsv;
13610 tblent->newval = newsv;
13611 tblent->next = tbl->tbl_ary[entry];
13612 tbl->tbl_ary[entry] = tblent;
13614 if (tblent->next && tbl->tbl_items > tbl->tbl_max)
13615 ptr_table_split(tbl);
13619 /* double the hash bucket size of an existing ptr table */
13622 Perl_ptr_table_split(pTHX_ PTR_TBL_t *const tbl)
13624 PTR_TBL_ENT_t **ary = tbl->tbl_ary;
13625 const UV oldsize = tbl->tbl_max + 1;
13626 UV newsize = oldsize * 2;
13629 PERL_ARGS_ASSERT_PTR_TABLE_SPLIT;
13630 PERL_UNUSED_CONTEXT;
13632 Renew(ary, newsize, PTR_TBL_ENT_t*);
13633 Zero(&ary[oldsize], newsize-oldsize, PTR_TBL_ENT_t*);
13634 tbl->tbl_max = --newsize;
13635 tbl->tbl_ary = ary;
13636 for (i=0; i < oldsize; i++, ary++) {
13637 PTR_TBL_ENT_t **entp = ary;
13638 PTR_TBL_ENT_t *ent = *ary;
13639 PTR_TBL_ENT_t **curentp;
13642 curentp = ary + oldsize;
13644 if ((newsize & PTR_TABLE_HASH(ent->oldval)) != i) {
13646 ent->next = *curentp;
13656 /* remove all the entries from a ptr table */
13657 /* Deprecated - will be removed post 5.14 */
13660 Perl_ptr_table_clear(pTHX_ PTR_TBL_t *const tbl)
13662 PERL_UNUSED_CONTEXT;
13663 if (tbl && tbl->tbl_items) {
13664 struct ptr_tbl_arena *arena = tbl->tbl_arena;
13666 Zero(tbl->tbl_ary, tbl->tbl_max + 1, struct ptr_tbl_ent *);
13669 struct ptr_tbl_arena *next = arena->next;
13675 tbl->tbl_items = 0;
13676 tbl->tbl_arena = NULL;
13677 tbl->tbl_arena_next = NULL;
13678 tbl->tbl_arena_end = NULL;
13682 /* clear and free a ptr table */
13685 Perl_ptr_table_free(pTHX_ PTR_TBL_t *const tbl)
13687 struct ptr_tbl_arena *arena;
13689 PERL_UNUSED_CONTEXT;
13695 arena = tbl->tbl_arena;
13698 struct ptr_tbl_arena *next = arena->next;
13704 Safefree(tbl->tbl_ary);
13708 #if defined(USE_ITHREADS)
13711 Perl_rvpv_dup(pTHX_ SV *const dstr, const SV *const sstr, CLONE_PARAMS *const param)
13713 PERL_ARGS_ASSERT_RVPV_DUP;
13715 assert(!isREGEXP(sstr));
13717 if (SvWEAKREF(sstr)) {
13718 SvRV_set(dstr, sv_dup(SvRV_const(sstr), param));
13719 if (param->flags & CLONEf_JOIN_IN) {
13720 /* if joining, we add any back references individually rather
13721 * than copying the whole backref array */
13722 Perl_sv_add_backref(aTHX_ SvRV(dstr), dstr);
13726 SvRV_set(dstr, sv_dup_inc(SvRV_const(sstr), param));
13728 else if (SvPVX_const(sstr)) {
13729 /* Has something there */
13731 /* Normal PV - clone whole allocated space */
13732 SvPV_set(dstr, SAVEPVN(SvPVX_const(sstr), SvLEN(sstr)-1));
13733 /* sstr may not be that normal, but actually copy on write.
13734 But we are a true, independent SV, so: */
13738 /* Special case - not normally malloced for some reason */
13739 if (isGV_with_GP(sstr)) {
13740 /* Don't need to do anything here. */
13742 else if ((SvIsCOW(sstr))) {
13743 /* A "shared" PV - clone it as "shared" PV */
13745 HEK_KEY(hek_dup(SvSHARED_HEK_FROM_PV(SvPVX_const(sstr)),
13749 /* Some other special case - random pointer */
13750 SvPV_set(dstr, (char *) SvPVX_const(sstr));
13755 /* Copy the NULL */
13756 SvPV_set(dstr, NULL);
13760 /* duplicate a list of SVs. source and dest may point to the same memory. */
13762 S_sv_dup_inc_multiple(pTHX_ SV *const *source, SV **dest,
13763 SSize_t items, CLONE_PARAMS *const param)
13765 PERL_ARGS_ASSERT_SV_DUP_INC_MULTIPLE;
13767 while (items-- > 0) {
13768 *dest++ = sv_dup_inc(*source++, param);
13774 /* duplicate an SV of any type (including AV, HV etc) */
13777 S_sv_dup_common(pTHX_ const SV *const sstr, CLONE_PARAMS *const param)
13782 PERL_ARGS_ASSERT_SV_DUP_COMMON;
13784 if (SvTYPE(sstr) == (svtype)SVTYPEMASK) {
13785 #ifdef DEBUG_LEAKING_SCALARS_ABORT
13790 /* look for it in the table first */
13791 dstr = MUTABLE_SV(ptr_table_fetch(PL_ptr_table, sstr));
13795 if(param->flags & CLONEf_JOIN_IN) {
13796 /** We are joining here so we don't want do clone
13797 something that is bad **/
13798 if (SvTYPE(sstr) == SVt_PVHV) {
13799 const HEK * const hvname = HvNAME_HEK(sstr);
13801 /** don't clone stashes if they already exist **/
13802 dstr = MUTABLE_SV(gv_stashpvn(HEK_KEY(hvname), HEK_LEN(hvname),
13803 HEK_UTF8(hvname) ? SVf_UTF8 : 0));
13804 ptr_table_store(PL_ptr_table, sstr, dstr);
13808 else if (SvTYPE(sstr) == SVt_PVGV && !SvFAKE(sstr)) {
13809 HV *stash = GvSTASH(sstr);
13810 const HEK * hvname;
13811 if (stash && (hvname = HvNAME_HEK(stash))) {
13812 /** don't clone GVs if they already exist **/
13814 stash = gv_stashpvn(HEK_KEY(hvname), HEK_LEN(hvname),
13815 HEK_UTF8(hvname) ? SVf_UTF8 : 0);
13817 stash, GvNAME(sstr),
13823 if (svp && *svp && SvTYPE(*svp) == SVt_PVGV) {
13824 ptr_table_store(PL_ptr_table, sstr, *svp);
13831 /* create anew and remember what it is */
13834 #ifdef DEBUG_LEAKING_SCALARS
13835 dstr->sv_debug_optype = sstr->sv_debug_optype;
13836 dstr->sv_debug_line = sstr->sv_debug_line;
13837 dstr->sv_debug_inpad = sstr->sv_debug_inpad;
13838 dstr->sv_debug_parent = (SV*)sstr;
13839 FREE_SV_DEBUG_FILE(dstr);
13840 dstr->sv_debug_file = savesharedpv(sstr->sv_debug_file);
13843 ptr_table_store(PL_ptr_table, sstr, dstr);
13846 SvFLAGS(dstr) = SvFLAGS(sstr);
13847 SvFLAGS(dstr) &= ~SVf_OOK; /* don't propagate OOK hack */
13848 SvREFCNT(dstr) = 0; /* must be before any other dups! */
13851 if (SvANY(sstr) && PL_watch_pvx && SvPVX_const(sstr) == PL_watch_pvx)
13852 PerlIO_printf(Perl_debug_log, "watch at %p hit, found string \"%s\"\n",
13853 (void*)PL_watch_pvx, SvPVX_const(sstr));
13856 /* don't clone objects whose class has asked us not to */
13858 && ! (SvFLAGS(SvSTASH(sstr)) & SVphv_CLONEABLE))
13864 switch (SvTYPE(sstr)) {
13866 SvANY(dstr) = NULL;
13869 SET_SVANY_FOR_BODYLESS_IV(dstr);
13871 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
13873 SvIV_set(dstr, SvIVX(sstr));
13877 #if NVSIZE <= IVSIZE
13878 SET_SVANY_FOR_BODYLESS_NV(dstr);
13880 SvANY(dstr) = new_XNV();
13882 SvNV_set(dstr, SvNVX(sstr));
13886 /* These are all the types that need complex bodies allocating. */
13888 const svtype sv_type = SvTYPE(sstr);
13889 const struct body_details *const sv_type_details
13890 = bodies_by_type + sv_type;
13894 Perl_croak(aTHX_ "Bizarre SvTYPE [%" IVdf "]", (IV)SvTYPE(sstr));
13895 NOT_REACHED; /* NOTREACHED */
13911 assert(sv_type_details->body_size);
13912 if (sv_type_details->arena) {
13913 new_body_inline(new_body, sv_type);
13915 = (void*)((char*)new_body - sv_type_details->offset);
13917 new_body = new_NOARENA(sv_type_details);
13921 SvANY(dstr) = new_body;
13924 Copy(((char*)SvANY(sstr)) + sv_type_details->offset,
13925 ((char*)SvANY(dstr)) + sv_type_details->offset,
13926 sv_type_details->copy, char);
13928 Copy(((char*)SvANY(sstr)),
13929 ((char*)SvANY(dstr)),
13930 sv_type_details->body_size + sv_type_details->offset, char);
13933 if (sv_type != SVt_PVAV && sv_type != SVt_PVHV
13934 && !isGV_with_GP(dstr)
13936 && !(sv_type == SVt_PVIO && !(IoFLAGS(dstr) & IOf_FAKE_DIRP)))
13937 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
13939 /* The Copy above means that all the source (unduplicated) pointers
13940 are now in the destination. We can check the flags and the
13941 pointers in either, but it's possible that there's less cache
13942 missing by always going for the destination.
13943 FIXME - instrument and check that assumption */
13944 if (sv_type >= SVt_PVMG) {
13946 SvMAGIC_set(dstr, mg_dup(SvMAGIC(dstr), param));
13947 if (SvOBJECT(dstr) && SvSTASH(dstr))
13948 SvSTASH_set(dstr, hv_dup_inc(SvSTASH(dstr), param));
13949 else SvSTASH_set(dstr, 0); /* don't copy DESTROY cache */
13952 /* The cast silences a GCC warning about unhandled types. */
13953 switch ((int)sv_type) {
13964 /* FIXME for plugins */
13965 dstr->sv_u.svu_rx = ((REGEXP *)dstr)->sv_any;
13966 re_dup_guts((REGEXP*) sstr, (REGEXP*) dstr, param);
13969 /* XXX LvTARGOFF sometimes holds PMOP* when DEBUGGING */
13970 if (LvTYPE(dstr) == 't') /* for tie: unrefcnted fake (SV**) */
13971 LvTARG(dstr) = dstr;
13972 else if (LvTYPE(dstr) == 'T') /* for tie: fake HE */
13973 LvTARG(dstr) = MUTABLE_SV(he_dup((HE*)LvTARG(dstr), 0, param));
13975 LvTARG(dstr) = sv_dup_inc(LvTARG(dstr), param);
13976 if (isREGEXP(sstr)) goto duprex;
13978 /* non-GP case already handled above */
13979 if(isGV_with_GP(sstr)) {
13980 GvNAME_HEK(dstr) = hek_dup(GvNAME_HEK(dstr), param);
13981 /* Don't call sv_add_backref here as it's going to be
13982 created as part of the magic cloning of the symbol
13983 table--unless this is during a join and the stash
13984 is not actually being cloned. */
13985 /* Danger Will Robinson - GvGP(dstr) isn't initialised
13986 at the point of this comment. */
13987 GvSTASH(dstr) = hv_dup(GvSTASH(dstr), param);
13988 if (param->flags & CLONEf_JOIN_IN)
13989 Perl_sv_add_backref(aTHX_ MUTABLE_SV(GvSTASH(dstr)), dstr);
13990 GvGP_set(dstr, gp_dup(GvGP(sstr), param));
13991 (void)GpREFCNT_inc(GvGP(dstr));
13995 /* PL_parser->rsfp_filters entries have fake IoDIRP() */
13996 if(IoFLAGS(dstr) & IOf_FAKE_DIRP) {
13997 /* I have no idea why fake dirp (rsfps)
13998 should be treated differently but otherwise
13999 we end up with leaks -- sky*/
14000 IoTOP_GV(dstr) = gv_dup_inc(IoTOP_GV(dstr), param);
14001 IoFMT_GV(dstr) = gv_dup_inc(IoFMT_GV(dstr), param);
14002 IoBOTTOM_GV(dstr) = gv_dup_inc(IoBOTTOM_GV(dstr), param);
14004 IoTOP_GV(dstr) = gv_dup(IoTOP_GV(dstr), param);
14005 IoFMT_GV(dstr) = gv_dup(IoFMT_GV(dstr), param);
14006 IoBOTTOM_GV(dstr) = gv_dup(IoBOTTOM_GV(dstr), param);
14007 if (IoDIRP(dstr)) {
14008 IoDIRP(dstr) = dirp_dup(IoDIRP(dstr), param);
14011 /* IoDIRP(dstr) is already a copy of IoDIRP(sstr) */
14013 IoIFP(dstr) = fp_dup(IoIFP(sstr), IoTYPE(dstr), param);
14015 if (IoOFP(dstr) == IoIFP(sstr))
14016 IoOFP(dstr) = IoIFP(dstr);
14018 IoOFP(dstr) = fp_dup(IoOFP(dstr), IoTYPE(dstr), param);
14019 IoTOP_NAME(dstr) = SAVEPV(IoTOP_NAME(dstr));
14020 IoFMT_NAME(dstr) = SAVEPV(IoFMT_NAME(dstr));
14021 IoBOTTOM_NAME(dstr) = SAVEPV(IoBOTTOM_NAME(dstr));
14024 /* avoid cloning an empty array */
14025 if (AvARRAY((const AV *)sstr) && AvFILLp((const AV *)sstr) >= 0) {
14026 SV **dst_ary, **src_ary;
14027 SSize_t items = AvFILLp((const AV *)sstr) + 1;
14029 src_ary = AvARRAY((const AV *)sstr);
14030 Newxz(dst_ary, AvMAX((const AV *)sstr)+1, SV*);
14031 ptr_table_store(PL_ptr_table, src_ary, dst_ary);
14032 AvARRAY(MUTABLE_AV(dstr)) = dst_ary;
14033 AvALLOC((const AV *)dstr) = dst_ary;
14034 if (AvREAL((const AV *)sstr)) {
14035 dst_ary = sv_dup_inc_multiple(src_ary, dst_ary, items,
14039 while (items-- > 0)
14040 *dst_ary++ = sv_dup(*src_ary++, param);
14042 items = AvMAX((const AV *)sstr) - AvFILLp((const AV *)sstr);
14043 while (items-- > 0) {
14048 AvARRAY(MUTABLE_AV(dstr)) = NULL;
14049 AvALLOC((const AV *)dstr) = (SV**)NULL;
14050 AvMAX( (const AV *)dstr) = -1;
14051 AvFILLp((const AV *)dstr) = -1;
14055 if (HvARRAY((const HV *)sstr)) {
14057 const bool sharekeys = !!HvSHAREKEYS(sstr);
14058 XPVHV * const dxhv = (XPVHV*)SvANY(dstr);
14059 XPVHV * const sxhv = (XPVHV*)SvANY(sstr);
14061 Newx(darray, PERL_HV_ARRAY_ALLOC_BYTES(dxhv->xhv_max+1)
14062 + (SvOOK(sstr) ? sizeof(struct xpvhv_aux) : 0),
14064 HvARRAY(dstr) = (HE**)darray;
14065 while (i <= sxhv->xhv_max) {
14066 const HE * const source = HvARRAY(sstr)[i];
14067 HvARRAY(dstr)[i] = source
14068 ? he_dup(source, sharekeys, param) : 0;
14072 const struct xpvhv_aux * const saux = HvAUX(sstr);
14073 struct xpvhv_aux * const daux = HvAUX(dstr);
14074 /* This flag isn't copied. */
14077 if (saux->xhv_name_count) {
14078 HEK ** const sname = saux->xhv_name_u.xhvnameu_names;
14080 = saux->xhv_name_count < 0
14081 ? -saux->xhv_name_count
14082 : saux->xhv_name_count;
14083 HEK **shekp = sname + count;
14085 Newx(daux->xhv_name_u.xhvnameu_names, count, HEK *);
14086 dhekp = daux->xhv_name_u.xhvnameu_names + count;
14087 while (shekp-- > sname) {
14089 *dhekp = hek_dup(*shekp, param);
14093 daux->xhv_name_u.xhvnameu_name
14094 = hek_dup(saux->xhv_name_u.xhvnameu_name,
14097 daux->xhv_name_count = saux->xhv_name_count;
14099 daux->xhv_aux_flags = saux->xhv_aux_flags;
14100 #ifdef PERL_HASH_RANDOMIZE_KEYS
14101 daux->xhv_rand = saux->xhv_rand;
14102 daux->xhv_last_rand = saux->xhv_last_rand;
14104 daux->xhv_riter = saux->xhv_riter;
14105 daux->xhv_eiter = saux->xhv_eiter
14106 ? he_dup(saux->xhv_eiter,
14107 cBOOL(HvSHAREKEYS(sstr)), param) : 0;
14108 /* backref array needs refcnt=2; see sv_add_backref */
14109 daux->xhv_backreferences =
14110 (param->flags & CLONEf_JOIN_IN)
14111 /* when joining, we let the individual GVs and
14112 * CVs add themselves to backref as
14113 * needed. This avoids pulling in stuff
14114 * that isn't required, and simplifies the
14115 * case where stashes aren't cloned back
14116 * if they already exist in the parent
14119 : saux->xhv_backreferences
14120 ? (SvTYPE(saux->xhv_backreferences) == SVt_PVAV)
14121 ? MUTABLE_AV(SvREFCNT_inc(
14122 sv_dup_inc((const SV *)
14123 saux->xhv_backreferences, param)))
14124 : MUTABLE_AV(sv_dup((const SV *)
14125 saux->xhv_backreferences, param))
14128 daux->xhv_mro_meta = saux->xhv_mro_meta
14129 ? mro_meta_dup(saux->xhv_mro_meta, param)
14132 /* Record stashes for possible cloning in Perl_clone(). */
14134 av_push(param->stashes, dstr);
14138 HvARRAY(MUTABLE_HV(dstr)) = NULL;
14141 if (!(param->flags & CLONEf_COPY_STACKS)) {
14146 /* NOTE: not refcounted */
14147 SvANY(MUTABLE_CV(dstr))->xcv_stash =
14148 hv_dup(CvSTASH(dstr), param);
14149 if ((param->flags & CLONEf_JOIN_IN) && CvSTASH(dstr))
14150 Perl_sv_add_backref(aTHX_ MUTABLE_SV(CvSTASH(dstr)), dstr);
14151 if (!CvISXSUB(dstr)) {
14153 CvROOT(dstr) = OpREFCNT_inc(CvROOT(dstr));
14155 CvSLABBED_off(dstr);
14156 } else if (CvCONST(dstr)) {
14157 CvXSUBANY(dstr).any_ptr =
14158 sv_dup_inc((const SV *)CvXSUBANY(dstr).any_ptr, param);
14160 assert(!CvSLABBED(dstr));
14161 if (CvDYNFILE(dstr)) CvFILE(dstr) = SAVEPV(CvFILE(dstr));
14163 SvANY((CV *)dstr)->xcv_gv_u.xcv_hek =
14164 hek_dup(CvNAME_HEK((CV *)sstr), param);
14165 /* don't dup if copying back - CvGV isn't refcounted, so the
14166 * duped GV may never be freed. A bit of a hack! DAPM */
14168 SvANY(MUTABLE_CV(dstr))->xcv_gv_u.xcv_gv =
14170 ? gv_dup_inc(CvGV(sstr), param)
14171 : (param->flags & CLONEf_JOIN_IN)
14173 : gv_dup(CvGV(sstr), param);
14175 if (!CvISXSUB(sstr)) {
14176 PADLIST * padlist = CvPADLIST(sstr);
14178 padlist = padlist_dup(padlist, param);
14179 CvPADLIST_set(dstr, padlist);
14181 /* unthreaded perl can't sv_dup so we dont support unthreaded's CvHSCXT */
14182 PoisonPADLIST(dstr);
14185 CvWEAKOUTSIDE(sstr)
14186 ? cv_dup( CvOUTSIDE(dstr), param)
14187 : cv_dup_inc(CvOUTSIDE(dstr), param);
14197 Perl_sv_dup_inc(pTHX_ const SV *const sstr, CLONE_PARAMS *const param)
14199 PERL_ARGS_ASSERT_SV_DUP_INC;
14200 return sstr ? SvREFCNT_inc(sv_dup_common(sstr, param)) : NULL;
14204 Perl_sv_dup(pTHX_ const SV *const sstr, CLONE_PARAMS *const param)
14206 SV *dstr = sstr ? sv_dup_common(sstr, param) : NULL;
14207 PERL_ARGS_ASSERT_SV_DUP;
14209 /* Track every SV that (at least initially) had a reference count of 0.
14210 We need to do this by holding an actual reference to it in this array.
14211 If we attempt to cheat, turn AvREAL_off(), and store only pointers
14212 (akin to the stashes hash, and the perl stack), we come unstuck if
14213 a weak reference (or other SV legitimately SvREFCNT() == 0 for this
14214 thread) is manipulated in a CLONE method, because CLONE runs before the
14215 unreferenced array is walked to find SVs still with SvREFCNT() == 0
14216 (and fix things up by giving each a reference via the temps stack).
14217 Instead, during CLONE, if the 0-referenced SV has SvREFCNT_inc() and
14218 then SvREFCNT_dec(), it will be cleaned up (and added to the free list)
14219 before the walk of unreferenced happens and a reference to that is SV
14220 added to the temps stack. At which point we have the same SV considered
14221 to be in use, and free to be re-used. Not good.
14223 if (dstr && !(param->flags & CLONEf_COPY_STACKS) && !SvREFCNT(dstr)) {
14224 assert(param->unreferenced);
14225 av_push(param->unreferenced, SvREFCNT_inc(dstr));
14231 /* duplicate a context */
14234 Perl_cx_dup(pTHX_ PERL_CONTEXT *cxs, I32 ix, I32 max, CLONE_PARAMS* param)
14236 PERL_CONTEXT *ncxs;
14238 PERL_ARGS_ASSERT_CX_DUP;
14241 return (PERL_CONTEXT*)NULL;
14243 /* look for it in the table first */
14244 ncxs = (PERL_CONTEXT*)ptr_table_fetch(PL_ptr_table, cxs);
14248 /* create anew and remember what it is */
14249 Newx(ncxs, max + 1, PERL_CONTEXT);
14250 ptr_table_store(PL_ptr_table, cxs, ncxs);
14251 Copy(cxs, ncxs, max + 1, PERL_CONTEXT);
14254 PERL_CONTEXT * const ncx = &ncxs[ix];
14255 if (CxTYPE(ncx) == CXt_SUBST) {
14256 Perl_croak(aTHX_ "Cloning substitution context is unimplemented");
14259 ncx->blk_oldcop = (COP*)any_dup(ncx->blk_oldcop, param->proto_perl);
14260 switch (CxTYPE(ncx)) {
14262 ncx->blk_sub.cv = cv_dup_inc(ncx->blk_sub.cv, param);
14263 if(CxHASARGS(ncx)){
14264 ncx->blk_sub.savearray = av_dup_inc(ncx->blk_sub.savearray,param);
14266 ncx->blk_sub.savearray = NULL;
14268 ncx->blk_sub.prevcomppad = (PAD*)ptr_table_fetch(PL_ptr_table,
14269 ncx->blk_sub.prevcomppad);
14272 ncx->blk_eval.old_namesv = sv_dup_inc(ncx->blk_eval.old_namesv,
14274 /* XXX should this sv_dup_inc? Or only if CxEVAL_TXT_REFCNTED ???? */
14275 ncx->blk_eval.cur_text = sv_dup(ncx->blk_eval.cur_text, param);
14276 ncx->blk_eval.cv = cv_dup(ncx->blk_eval.cv, param);
14277 /* XXX what do do with cur_top_env ???? */
14279 case CXt_LOOP_LAZYSV:
14280 ncx->blk_loop.state_u.lazysv.end
14281 = sv_dup_inc(ncx->blk_loop.state_u.lazysv.end, param);
14282 /* Fallthrough: duplicate lazysv.cur by using the ary.ary
14283 duplication code instead.
14284 We are taking advantage of (1) av_dup_inc and sv_dup_inc
14285 actually being the same function, and (2) order
14286 equivalence of the two unions.
14287 We can assert the later [but only at run time :-(] */
14288 assert ((void *) &ncx->blk_loop.state_u.ary.ary ==
14289 (void *) &ncx->blk_loop.state_u.lazysv.cur);
14292 ncx->blk_loop.state_u.ary.ary
14293 = av_dup_inc(ncx->blk_loop.state_u.ary.ary, param);
14295 case CXt_LOOP_LIST:
14296 case CXt_LOOP_LAZYIV:
14297 /* code common to all 'for' CXt_LOOP_* types */
14298 ncx->blk_loop.itersave =
14299 sv_dup_inc(ncx->blk_loop.itersave, param);
14300 if (CxPADLOOP(ncx)) {
14301 PADOFFSET off = ncx->blk_loop.itervar_u.svp
14302 - &CX_CURPAD_SV(ncx->blk_loop, 0);
14303 ncx->blk_loop.oldcomppad =
14304 (PAD*)ptr_table_fetch(PL_ptr_table,
14305 ncx->blk_loop.oldcomppad);
14306 ncx->blk_loop.itervar_u.svp =
14307 &CX_CURPAD_SV(ncx->blk_loop, off);
14310 /* this copies the GV if CXp_FOR_GV, or the SV for an
14311 * alias (for \$x (...)) - relies on gv_dup being the
14312 * same as sv_dup */
14313 ncx->blk_loop.itervar_u.gv
14314 = gv_dup((const GV *)ncx->blk_loop.itervar_u.gv,
14318 case CXt_LOOP_PLAIN:
14321 ncx->blk_format.prevcomppad =
14322 (PAD*)ptr_table_fetch(PL_ptr_table,
14323 ncx->blk_format.prevcomppad);
14324 ncx->blk_format.cv = cv_dup_inc(ncx->blk_format.cv, param);
14325 ncx->blk_format.gv = gv_dup(ncx->blk_format.gv, param);
14326 ncx->blk_format.dfoutgv = gv_dup_inc(ncx->blk_format.dfoutgv,
14330 ncx->blk_givwhen.defsv_save =
14331 sv_dup_inc(ncx->blk_givwhen.defsv_save, param);
14344 /* duplicate a stack info structure */
14347 Perl_si_dup(pTHX_ PERL_SI *si, CLONE_PARAMS* param)
14351 PERL_ARGS_ASSERT_SI_DUP;
14354 return (PERL_SI*)NULL;
14356 /* look for it in the table first */
14357 nsi = (PERL_SI*)ptr_table_fetch(PL_ptr_table, si);
14361 /* create anew and remember what it is */
14362 Newxz(nsi, 1, PERL_SI);
14363 ptr_table_store(PL_ptr_table, si, nsi);
14365 nsi->si_stack = av_dup_inc(si->si_stack, param);
14366 nsi->si_cxix = si->si_cxix;
14367 nsi->si_cxmax = si->si_cxmax;
14368 nsi->si_cxstack = cx_dup(si->si_cxstack, si->si_cxix, si->si_cxmax, param);
14369 nsi->si_type = si->si_type;
14370 nsi->si_prev = si_dup(si->si_prev, param);
14371 nsi->si_next = si_dup(si->si_next, param);
14372 nsi->si_markoff = si->si_markoff;
14377 #define POPINT(ss,ix) ((ss)[--(ix)].any_i32)
14378 #define TOPINT(ss,ix) ((ss)[ix].any_i32)
14379 #define POPLONG(ss,ix) ((ss)[--(ix)].any_long)
14380 #define TOPLONG(ss,ix) ((ss)[ix].any_long)
14381 #define POPIV(ss,ix) ((ss)[--(ix)].any_iv)
14382 #define TOPIV(ss,ix) ((ss)[ix].any_iv)
14383 #define POPUV(ss,ix) ((ss)[--(ix)].any_uv)
14384 #define TOPUV(ss,ix) ((ss)[ix].any_uv)
14385 #define POPBOOL(ss,ix) ((ss)[--(ix)].any_bool)
14386 #define TOPBOOL(ss,ix) ((ss)[ix].any_bool)
14387 #define POPPTR(ss,ix) ((ss)[--(ix)].any_ptr)
14388 #define TOPPTR(ss,ix) ((ss)[ix].any_ptr)
14389 #define POPDPTR(ss,ix) ((ss)[--(ix)].any_dptr)
14390 #define TOPDPTR(ss,ix) ((ss)[ix].any_dptr)
14391 #define POPDXPTR(ss,ix) ((ss)[--(ix)].any_dxptr)
14392 #define TOPDXPTR(ss,ix) ((ss)[ix].any_dxptr)
14395 #define pv_dup_inc(p) SAVEPV(p)
14396 #define pv_dup(p) SAVEPV(p)
14397 #define svp_dup_inc(p,pp) any_dup(p,pp)
14399 /* map any object to the new equivent - either something in the
14400 * ptr table, or something in the interpreter structure
14404 Perl_any_dup(pTHX_ void *v, const PerlInterpreter *proto_perl)
14408 PERL_ARGS_ASSERT_ANY_DUP;
14411 return (void*)NULL;
14413 /* look for it in the table first */
14414 ret = ptr_table_fetch(PL_ptr_table, v);
14418 /* see if it is part of the interpreter structure */
14419 if (v >= (void*)proto_perl && v < (void*)(proto_perl+1))
14420 ret = (void*)(((char*)aTHX) + (((char*)v) - (char*)proto_perl));
14428 /* duplicate the save stack */
14431 Perl_ss_dup(pTHX_ PerlInterpreter *proto_perl, CLONE_PARAMS* param)
14434 ANY * const ss = proto_perl->Isavestack;
14435 const I32 max = proto_perl->Isavestack_max + SS_MAXPUSH;
14436 I32 ix = proto_perl->Isavestack_ix;
14449 void (*dptr) (void*);
14450 void (*dxptr) (pTHX_ void*);
14452 PERL_ARGS_ASSERT_SS_DUP;
14454 Newxz(nss, max, ANY);
14457 const UV uv = POPUV(ss,ix);
14458 const U8 type = (U8)uv & SAVE_MASK;
14460 TOPUV(nss,ix) = uv;
14462 case SAVEt_CLEARSV:
14463 case SAVEt_CLEARPADRANGE:
14465 case SAVEt_HELEM: /* hash element */
14466 case SAVEt_SV: /* scalar reference */
14467 sv = (const SV *)POPPTR(ss,ix);
14468 TOPPTR(nss,ix) = SvREFCNT_inc(sv_dup_inc(sv, param));
14470 case SAVEt_ITEM: /* normal string */
14471 case SAVEt_GVSV: /* scalar slot in GV */
14472 sv = (const SV *)POPPTR(ss,ix);
14473 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
14474 if (type == SAVEt_SV)
14478 case SAVEt_MORTALIZESV:
14479 case SAVEt_READONLY_OFF:
14480 sv = (const SV *)POPPTR(ss,ix);
14481 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
14483 case SAVEt_FREEPADNAME:
14484 ptr = POPPTR(ss,ix);
14485 TOPPTR(nss,ix) = padname_dup((PADNAME *)ptr, param);
14486 PadnameREFCNT((PADNAME *)TOPPTR(nss,ix))++;
14488 case SAVEt_SHARED_PVREF: /* char* in shared space */
14489 c = (char*)POPPTR(ss,ix);
14490 TOPPTR(nss,ix) = savesharedpv(c);
14491 ptr = POPPTR(ss,ix);
14492 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
14494 case SAVEt_GENERIC_SVREF: /* generic sv */
14495 case SAVEt_SVREF: /* scalar reference */
14496 sv = (const SV *)POPPTR(ss,ix);
14497 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
14498 if (type == SAVEt_SVREF)
14499 SvREFCNT_inc_simple_void((SV *)TOPPTR(nss,ix));
14500 ptr = POPPTR(ss,ix);
14501 TOPPTR(nss,ix) = svp_dup_inc((SV**)ptr, proto_perl);/* XXXXX */
14503 case SAVEt_GVSLOT: /* any slot in GV */
14504 sv = (const SV *)POPPTR(ss,ix);
14505 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
14506 ptr = POPPTR(ss,ix);
14507 TOPPTR(nss,ix) = svp_dup_inc((SV**)ptr, proto_perl);/* XXXXX */
14508 sv = (const SV *)POPPTR(ss,ix);
14509 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
14511 case SAVEt_HV: /* hash reference */
14512 case SAVEt_AV: /* array reference */
14513 sv = (const SV *) POPPTR(ss,ix);
14514 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
14516 case SAVEt_COMPPAD:
14518 sv = (const SV *) POPPTR(ss,ix);
14519 TOPPTR(nss,ix) = sv_dup(sv, param);
14521 case SAVEt_INT: /* int reference */
14522 ptr = POPPTR(ss,ix);
14523 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
14524 intval = (int)POPINT(ss,ix);
14525 TOPINT(nss,ix) = intval;
14527 case SAVEt_LONG: /* long reference */
14528 ptr = POPPTR(ss,ix);
14529 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
14530 longval = (long)POPLONG(ss,ix);
14531 TOPLONG(nss,ix) = longval;
14533 case SAVEt_I32: /* I32 reference */
14534 ptr = POPPTR(ss,ix);
14535 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
14537 TOPINT(nss,ix) = i;
14539 case SAVEt_IV: /* IV reference */
14540 case SAVEt_STRLEN: /* STRLEN/size_t ref */
14541 ptr = POPPTR(ss,ix);
14542 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
14544 TOPIV(nss,ix) = iv;
14546 case SAVEt_TMPSFLOOR:
14548 TOPIV(nss,ix) = iv;
14550 case SAVEt_HPTR: /* HV* reference */
14551 case SAVEt_APTR: /* AV* reference */
14552 case SAVEt_SPTR: /* SV* reference */
14553 ptr = POPPTR(ss,ix);
14554 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
14555 sv = (const SV *)POPPTR(ss,ix);
14556 TOPPTR(nss,ix) = sv_dup(sv, param);
14558 case SAVEt_VPTR: /* random* reference */
14559 ptr = POPPTR(ss,ix);
14560 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
14562 case SAVEt_INT_SMALL:
14563 case SAVEt_I32_SMALL:
14564 case SAVEt_I16: /* I16 reference */
14565 case SAVEt_I8: /* I8 reference */
14567 ptr = POPPTR(ss,ix);
14568 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
14570 case SAVEt_GENERIC_PVREF: /* generic char* */
14571 case SAVEt_PPTR: /* char* reference */
14572 ptr = POPPTR(ss,ix);
14573 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
14574 c = (char*)POPPTR(ss,ix);
14575 TOPPTR(nss,ix) = pv_dup(c);
14577 case SAVEt_GP: /* scalar reference */
14578 gp = (GP*)POPPTR(ss,ix);
14579 TOPPTR(nss,ix) = gp = gp_dup(gp, param);
14580 (void)GpREFCNT_inc(gp);
14581 gv = (const GV *)POPPTR(ss,ix);
14582 TOPPTR(nss,ix) = gv_dup_inc(gv, param);
14585 ptr = POPPTR(ss,ix);
14586 if (ptr && (((OP*)ptr)->op_private & OPpREFCOUNTED)) {
14587 /* these are assumed to be refcounted properly */
14589 switch (((OP*)ptr)->op_type) {
14591 case OP_LEAVESUBLV:
14595 case OP_LEAVEWRITE:
14596 TOPPTR(nss,ix) = ptr;
14599 (void) OpREFCNT_inc(o);
14603 TOPPTR(nss,ix) = NULL;
14608 TOPPTR(nss,ix) = NULL;
14610 case SAVEt_FREECOPHH:
14611 ptr = POPPTR(ss,ix);
14612 TOPPTR(nss,ix) = cophh_copy((COPHH *)ptr);
14614 case SAVEt_ADELETE:
14615 av = (const AV *)POPPTR(ss,ix);
14616 TOPPTR(nss,ix) = av_dup_inc(av, param);
14618 TOPINT(nss,ix) = i;
14621 hv = (const HV *)POPPTR(ss,ix);
14622 TOPPTR(nss,ix) = hv_dup_inc(hv, param);
14624 TOPINT(nss,ix) = i;
14627 c = (char*)POPPTR(ss,ix);
14628 TOPPTR(nss,ix) = pv_dup_inc(c);
14630 case SAVEt_STACK_POS: /* Position on Perl stack */
14632 TOPINT(nss,ix) = i;
14634 case SAVEt_DESTRUCTOR:
14635 ptr = POPPTR(ss,ix);
14636 TOPPTR(nss,ix) = any_dup(ptr, proto_perl); /* XXX quite arbitrary */
14637 dptr = POPDPTR(ss,ix);
14638 TOPDPTR(nss,ix) = DPTR2FPTR(void (*)(void*),
14639 any_dup(FPTR2DPTR(void *, dptr),
14642 case SAVEt_DESTRUCTOR_X:
14643 ptr = POPPTR(ss,ix);
14644 TOPPTR(nss,ix) = any_dup(ptr, proto_perl); /* XXX quite arbitrary */
14645 dxptr = POPDXPTR(ss,ix);
14646 TOPDXPTR(nss,ix) = DPTR2FPTR(void (*)(pTHX_ void*),
14647 any_dup(FPTR2DPTR(void *, dxptr),
14650 case SAVEt_REGCONTEXT:
14652 ix -= uv >> SAVE_TIGHT_SHIFT;
14654 case SAVEt_AELEM: /* array element */
14655 sv = (const SV *)POPPTR(ss,ix);
14656 TOPPTR(nss,ix) = SvREFCNT_inc(sv_dup_inc(sv, param));
14658 TOPINT(nss,ix) = i;
14659 av = (const AV *)POPPTR(ss,ix);
14660 TOPPTR(nss,ix) = av_dup_inc(av, param);
14663 ptr = POPPTR(ss,ix);
14664 TOPPTR(nss,ix) = ptr;
14667 ptr = POPPTR(ss,ix);
14668 ptr = cophh_copy((COPHH*)ptr);
14669 TOPPTR(nss,ix) = ptr;
14671 TOPINT(nss,ix) = i;
14672 if (i & HINT_LOCALIZE_HH) {
14673 hv = (const HV *)POPPTR(ss,ix);
14674 TOPPTR(nss,ix) = hv_dup_inc(hv, param);
14677 case SAVEt_PADSV_AND_MORTALIZE:
14678 longval = (long)POPLONG(ss,ix);
14679 TOPLONG(nss,ix) = longval;
14680 ptr = POPPTR(ss,ix);
14681 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
14682 sv = (const SV *)POPPTR(ss,ix);
14683 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
14685 case SAVEt_SET_SVFLAGS:
14687 TOPINT(nss,ix) = i;
14689 TOPINT(nss,ix) = i;
14690 sv = (const SV *)POPPTR(ss,ix);
14691 TOPPTR(nss,ix) = sv_dup(sv, param);
14693 case SAVEt_COMPILE_WARNINGS:
14694 ptr = POPPTR(ss,ix);
14695 TOPPTR(nss,ix) = DUP_WARNINGS((STRLEN*)ptr);
14698 ptr = POPPTR(ss,ix);
14699 TOPPTR(nss,ix) = parser_dup((const yy_parser*)ptr, param);
14703 "panic: ss_dup inconsistency (%" IVdf ")", (IV) type);
14711 /* if sv is a stash, call $class->CLONE_SKIP(), and set the SVphv_CLONEABLE
14712 * flag to the result. This is done for each stash before cloning starts,
14713 * so we know which stashes want their objects cloned */
14716 do_mark_cloneable_stash(pTHX_ SV *const sv)
14718 const HEK * const hvname = HvNAME_HEK((const HV *)sv);
14720 GV* const cloner = gv_fetchmethod_autoload(MUTABLE_HV(sv), "CLONE_SKIP", 0);
14721 SvFLAGS(sv) |= SVphv_CLONEABLE; /* clone objects by default */
14722 if (cloner && GvCV(cloner)) {
14729 mXPUSHs(newSVhek(hvname));
14731 call_sv(MUTABLE_SV(GvCV(cloner)), G_SCALAR);
14738 SvFLAGS(sv) &= ~SVphv_CLONEABLE;
14746 =for apidoc perl_clone
14748 Create and return a new interpreter by cloning the current one.
14750 C<perl_clone> takes these flags as parameters:
14752 C<CLONEf_COPY_STACKS> - is used to, well, copy the stacks also,
14753 without it we only clone the data and zero the stacks,
14754 with it we copy the stacks and the new perl interpreter is
14755 ready to run at the exact same point as the previous one.
14756 The pseudo-fork code uses C<COPY_STACKS> while the
14757 threads->create doesn't.
14759 C<CLONEf_KEEP_PTR_TABLE> -
14760 C<perl_clone> keeps a ptr_table with the pointer of the old
14761 variable as a key and the new variable as a value,
14762 this allows it to check if something has been cloned and not
14763 clone it again but rather just use the value and increase the
14764 refcount. If C<KEEP_PTR_TABLE> is not set then C<perl_clone> will kill
14765 the ptr_table using the function
14766 C<ptr_table_free(PL_ptr_table); PL_ptr_table = NULL;>,
14767 reason to keep it around is if you want to dup some of your own
14768 variable who are outside the graph perl scans, an example of this
14769 code is in F<threads.xs> create.
14771 C<CLONEf_CLONE_HOST> -
14772 This is a win32 thing, it is ignored on unix, it tells perls
14773 win32host code (which is c++) to clone itself, this is needed on
14774 win32 if you want to run two threads at the same time,
14775 if you just want to do some stuff in a separate perl interpreter
14776 and then throw it away and return to the original one,
14777 you don't need to do anything.
14782 /* XXX the above needs expanding by someone who actually understands it ! */
14783 EXTERN_C PerlInterpreter *
14784 perl_clone_host(PerlInterpreter* proto_perl, UV flags);
14787 perl_clone(PerlInterpreter *proto_perl, UV flags)
14790 #ifdef PERL_IMPLICIT_SYS
14792 PERL_ARGS_ASSERT_PERL_CLONE;
14794 /* perlhost.h so we need to call into it
14795 to clone the host, CPerlHost should have a c interface, sky */
14797 #ifndef __amigaos4__
14798 if (flags & CLONEf_CLONE_HOST) {
14799 return perl_clone_host(proto_perl,flags);
14802 return perl_clone_using(proto_perl, flags,
14804 proto_perl->IMemShared,
14805 proto_perl->IMemParse,
14807 proto_perl->IStdIO,
14811 proto_perl->IProc);
14815 perl_clone_using(PerlInterpreter *proto_perl, UV flags,
14816 struct IPerlMem* ipM, struct IPerlMem* ipMS,
14817 struct IPerlMem* ipMP, struct IPerlEnv* ipE,
14818 struct IPerlStdIO* ipStd, struct IPerlLIO* ipLIO,
14819 struct IPerlDir* ipD, struct IPerlSock* ipS,
14820 struct IPerlProc* ipP)
14822 /* XXX many of the string copies here can be optimized if they're
14823 * constants; they need to be allocated as common memory and just
14824 * their pointers copied. */
14827 CLONE_PARAMS clone_params;
14828 CLONE_PARAMS* const param = &clone_params;
14830 PerlInterpreter * const my_perl = (PerlInterpreter*)(*ipM->pMalloc)(ipM, sizeof(PerlInterpreter));
14832 PERL_ARGS_ASSERT_PERL_CLONE_USING;
14833 #else /* !PERL_IMPLICIT_SYS */
14835 CLONE_PARAMS clone_params;
14836 CLONE_PARAMS* param = &clone_params;
14837 PerlInterpreter * const my_perl = (PerlInterpreter*)PerlMem_malloc(sizeof(PerlInterpreter));
14839 PERL_ARGS_ASSERT_PERL_CLONE;
14840 #endif /* PERL_IMPLICIT_SYS */
14842 /* for each stash, determine whether its objects should be cloned */
14843 S_visit(proto_perl, do_mark_cloneable_stash, SVt_PVHV, SVTYPEMASK);
14844 PERL_SET_THX(my_perl);
14847 PoisonNew(my_perl, 1, PerlInterpreter);
14850 PL_defstash = NULL; /* may be used by perl malloc() */
14853 PL_scopestack_name = 0;
14855 PL_savestack_ix = 0;
14856 PL_savestack_max = -1;
14857 PL_sig_pending = 0;
14859 Zero(&PL_debug_pad, 1, struct perl_debug_pad);
14860 Zero(&PL_padname_undef, 1, PADNAME);
14861 Zero(&PL_padname_const, 1, PADNAME);
14862 # ifdef DEBUG_LEAKING_SCALARS
14863 PL_sv_serial = (((UV)my_perl >> 2) & 0xfff) * 1000000;
14865 # ifdef PERL_TRACE_OPS
14866 Zero(PL_op_exec_cnt, OP_max+2, UV);
14868 #else /* !DEBUGGING */
14869 Zero(my_perl, 1, PerlInterpreter);
14870 #endif /* DEBUGGING */
14872 #ifdef PERL_IMPLICIT_SYS
14873 /* host pointers */
14875 PL_MemShared = ipMS;
14876 PL_MemParse = ipMP;
14883 #endif /* PERL_IMPLICIT_SYS */
14886 param->flags = flags;
14887 /* Nothing in the core code uses this, but we make it available to
14888 extensions (using mg_dup). */
14889 param->proto_perl = proto_perl;
14890 /* Likely nothing will use this, but it is initialised to be consistent
14891 with Perl_clone_params_new(). */
14892 param->new_perl = my_perl;
14893 param->unreferenced = NULL;
14896 INIT_TRACK_MEMPOOL(my_perl->Imemory_debug_header, my_perl);
14898 PL_body_arenas = NULL;
14899 Zero(&PL_body_roots, 1, PL_body_roots);
14903 PL_sv_arenaroot = NULL;
14905 PL_debug = proto_perl->Idebug;
14907 /* dbargs array probably holds garbage */
14910 PL_compiling = proto_perl->Icompiling;
14912 /* pseudo environmental stuff */
14913 PL_origargc = proto_perl->Iorigargc;
14914 PL_origargv = proto_perl->Iorigargv;
14916 #ifndef NO_TAINT_SUPPORT
14917 /* Set tainting stuff before PerlIO_debug can possibly get called */
14918 PL_tainting = proto_perl->Itainting;
14919 PL_taint_warn = proto_perl->Itaint_warn;
14921 PL_tainting = FALSE;
14922 PL_taint_warn = FALSE;
14925 PL_minus_c = proto_perl->Iminus_c;
14927 PL_localpatches = proto_perl->Ilocalpatches;
14928 PL_splitstr = proto_perl->Isplitstr;
14929 PL_minus_n = proto_perl->Iminus_n;
14930 PL_minus_p = proto_perl->Iminus_p;
14931 PL_minus_l = proto_perl->Iminus_l;
14932 PL_minus_a = proto_perl->Iminus_a;
14933 PL_minus_E = proto_perl->Iminus_E;
14934 PL_minus_F = proto_perl->Iminus_F;
14935 PL_doswitches = proto_perl->Idoswitches;
14936 PL_dowarn = proto_perl->Idowarn;
14937 #ifdef PERL_SAWAMPERSAND
14938 PL_sawampersand = proto_perl->Isawampersand;
14940 PL_unsafe = proto_perl->Iunsafe;
14941 PL_perldb = proto_perl->Iperldb;
14942 PL_perl_destruct_level = proto_perl->Iperl_destruct_level;
14943 PL_exit_flags = proto_perl->Iexit_flags;
14945 /* XXX time(&PL_basetime) when asked for? */
14946 PL_basetime = proto_perl->Ibasetime;
14948 PL_maxsysfd = proto_perl->Imaxsysfd;
14949 PL_statusvalue = proto_perl->Istatusvalue;
14951 PL_statusvalue_vms = proto_perl->Istatusvalue_vms;
14953 PL_statusvalue_posix = proto_perl->Istatusvalue_posix;
14956 /* RE engine related */
14957 PL_regmatch_slab = NULL;
14958 PL_reg_curpm = NULL;
14960 PL_sub_generation = proto_perl->Isub_generation;
14962 /* funky return mechanisms */
14963 PL_forkprocess = proto_perl->Iforkprocess;
14965 /* internal state */
14966 PL_main_start = proto_perl->Imain_start;
14967 PL_eval_root = proto_perl->Ieval_root;
14968 PL_eval_start = proto_perl->Ieval_start;
14970 PL_filemode = proto_perl->Ifilemode;
14971 PL_lastfd = proto_perl->Ilastfd;
14972 PL_oldname = proto_perl->Ioldname; /* XXX not quite right */
14975 PL_gensym = proto_perl->Igensym;
14977 PL_laststatval = proto_perl->Ilaststatval;
14978 PL_laststype = proto_perl->Ilaststype;
14981 PL_profiledata = NULL;
14983 PL_generation = proto_perl->Igeneration;
14985 PL_in_clean_objs = proto_perl->Iin_clean_objs;
14986 PL_in_clean_all = proto_perl->Iin_clean_all;
14988 PL_delaymagic_uid = proto_perl->Idelaymagic_uid;
14989 PL_delaymagic_euid = proto_perl->Idelaymagic_euid;
14990 PL_delaymagic_gid = proto_perl->Idelaymagic_gid;
14991 PL_delaymagic_egid = proto_perl->Idelaymagic_egid;
14992 PL_nomemok = proto_perl->Inomemok;
14993 PL_an = proto_perl->Ian;
14994 PL_evalseq = proto_perl->Ievalseq;
14995 PL_origenviron = proto_perl->Iorigenviron; /* XXX not quite right */
14996 PL_origalen = proto_perl->Iorigalen;
14998 PL_sighandlerp = proto_perl->Isighandlerp;
15000 PL_runops = proto_perl->Irunops;
15002 PL_subline = proto_perl->Isubline;
15004 PL_cv_has_eval = proto_perl->Icv_has_eval;
15007 PL_cryptseen = proto_perl->Icryptseen;
15010 #ifdef USE_LOCALE_COLLATE
15011 PL_collation_ix = proto_perl->Icollation_ix;
15012 PL_collation_standard = proto_perl->Icollation_standard;
15013 PL_collxfrm_base = proto_perl->Icollxfrm_base;
15014 PL_collxfrm_mult = proto_perl->Icollxfrm_mult;
15015 PL_strxfrm_max_cp = proto_perl->Istrxfrm_max_cp;
15016 #endif /* USE_LOCALE_COLLATE */
15018 #ifdef USE_LOCALE_NUMERIC
15019 PL_numeric_standard = proto_perl->Inumeric_standard;
15020 PL_numeric_local = proto_perl->Inumeric_local;
15021 #endif /* !USE_LOCALE_NUMERIC */
15023 /* Did the locale setup indicate UTF-8? */
15024 PL_utf8locale = proto_perl->Iutf8locale;
15025 PL_in_utf8_CTYPE_locale = proto_perl->Iin_utf8_CTYPE_locale;
15026 PL_in_utf8_COLLATE_locale = proto_perl->Iin_utf8_COLLATE_locale;
15027 /* Unicode features (see perlrun/-C) */
15028 PL_unicode = proto_perl->Iunicode;
15030 /* Pre-5.8 signals control */
15031 PL_signals = proto_perl->Isignals;
15033 /* times() ticks per second */
15034 PL_clocktick = proto_perl->Iclocktick;
15036 /* Recursion stopper for PerlIO_find_layer */
15037 PL_in_load_module = proto_perl->Iin_load_module;
15039 /* sort() routine */
15040 PL_sort_RealCmp = proto_perl->Isort_RealCmp;
15042 /* Not really needed/useful since the reenrant_retint is "volatile",
15043 * but do it for consistency's sake. */
15044 PL_reentrant_retint = proto_perl->Ireentrant_retint;
15046 /* Hooks to shared SVs and locks. */
15047 PL_sharehook = proto_perl->Isharehook;
15048 PL_lockhook = proto_perl->Ilockhook;
15049 PL_unlockhook = proto_perl->Iunlockhook;
15050 PL_threadhook = proto_perl->Ithreadhook;
15051 PL_destroyhook = proto_perl->Idestroyhook;
15052 PL_signalhook = proto_perl->Isignalhook;
15054 PL_globhook = proto_perl->Iglobhook;
15057 PL_last_swash_hv = NULL; /* reinits on demand */
15058 PL_last_swash_klen = 0;
15059 PL_last_swash_key[0]= '\0';
15060 PL_last_swash_tmps = (U8*)NULL;
15061 PL_last_swash_slen = 0;
15063 PL_srand_called = proto_perl->Isrand_called;
15064 Copy(&(proto_perl->Irandom_state), &PL_random_state, 1, PL_RANDOM_STATE_TYPE);
15066 if (flags & CLONEf_COPY_STACKS) {
15067 /* next allocation will be PL_tmps_stack[PL_tmps_ix+1] */
15068 PL_tmps_ix = proto_perl->Itmps_ix;
15069 PL_tmps_max = proto_perl->Itmps_max;
15070 PL_tmps_floor = proto_perl->Itmps_floor;
15072 /* next push_scope()/ENTER sets PL_scopestack[PL_scopestack_ix]
15073 * NOTE: unlike the others! */
15074 PL_scopestack_ix = proto_perl->Iscopestack_ix;
15075 PL_scopestack_max = proto_perl->Iscopestack_max;
15077 /* next SSPUSHFOO() sets PL_savestack[PL_savestack_ix]
15078 * NOTE: unlike the others! */
15079 PL_savestack_ix = proto_perl->Isavestack_ix;
15080 PL_savestack_max = proto_perl->Isavestack_max;
15083 PL_start_env = proto_perl->Istart_env; /* XXXXXX */
15084 PL_top_env = &PL_start_env;
15086 PL_op = proto_perl->Iop;
15089 PL_Xpv = (XPV*)NULL;
15090 my_perl->Ina = proto_perl->Ina;
15092 PL_statcache = proto_perl->Istatcache;
15094 #ifndef NO_TAINT_SUPPORT
15095 PL_tainted = proto_perl->Itainted;
15097 PL_tainted = FALSE;
15099 PL_curpm = proto_perl->Icurpm; /* XXX No PMOP ref count */
15101 PL_chopset = proto_perl->Ichopset; /* XXX never deallocated */
15103 PL_restartjmpenv = proto_perl->Irestartjmpenv;
15104 PL_restartop = proto_perl->Irestartop;
15105 PL_in_eval = proto_perl->Iin_eval;
15106 PL_delaymagic = proto_perl->Idelaymagic;
15107 PL_phase = proto_perl->Iphase;
15108 PL_localizing = proto_perl->Ilocalizing;
15110 PL_hv_fetch_ent_mh = NULL;
15111 PL_modcount = proto_perl->Imodcount;
15112 PL_lastgotoprobe = NULL;
15113 PL_dumpindent = proto_perl->Idumpindent;
15115 PL_efloatbuf = NULL; /* reinits on demand */
15116 PL_efloatsize = 0; /* reinits on demand */
15120 PL_colorset = 0; /* reinits PL_colors[] */
15121 /*PL_colors[6] = {0,0,0,0,0,0};*/
15123 /* Pluggable optimizer */
15124 PL_peepp = proto_perl->Ipeepp;
15125 PL_rpeepp = proto_perl->Irpeepp;
15126 /* op_free() hook */
15127 PL_opfreehook = proto_perl->Iopfreehook;
15129 #ifdef USE_REENTRANT_API
15130 /* XXX: things like -Dm will segfault here in perlio, but doing
15131 * PERL_SET_CONTEXT(proto_perl);
15132 * breaks too many other things
15134 Perl_reentrant_init(aTHX);
15137 /* create SV map for pointer relocation */
15138 PL_ptr_table = ptr_table_new();
15140 /* initialize these special pointers as early as possible */
15142 ptr_table_store(PL_ptr_table, &proto_perl->Isv_undef, &PL_sv_undef);
15143 ptr_table_store(PL_ptr_table, &proto_perl->Isv_no, &PL_sv_no);
15144 ptr_table_store(PL_ptr_table, &proto_perl->Isv_yes, &PL_sv_yes);
15145 ptr_table_store(PL_ptr_table, &proto_perl->Ipadname_const,
15146 &PL_padname_const);
15148 /* create (a non-shared!) shared string table */
15149 PL_strtab = newHV();
15150 HvSHAREKEYS_off(PL_strtab);
15151 hv_ksplit(PL_strtab, HvTOTALKEYS(proto_perl->Istrtab));
15152 ptr_table_store(PL_ptr_table, proto_perl->Istrtab, PL_strtab);
15154 Zero(PL_sv_consts, SV_CONSTS_COUNT, SV*);
15156 /* This PV will be free'd special way so must set it same way op.c does */
15157 PL_compiling.cop_file = savesharedpv(PL_compiling.cop_file);
15158 ptr_table_store(PL_ptr_table, proto_perl->Icompiling.cop_file, PL_compiling.cop_file);
15160 ptr_table_store(PL_ptr_table, &proto_perl->Icompiling, &PL_compiling);
15161 PL_compiling.cop_warnings = DUP_WARNINGS(PL_compiling.cop_warnings);
15162 CopHINTHASH_set(&PL_compiling, cophh_copy(CopHINTHASH_get(&PL_compiling)));
15163 PL_curcop = (COP*)any_dup(proto_perl->Icurcop, proto_perl);
15165 param->stashes = newAV(); /* Setup array of objects to call clone on */
15166 /* This makes no difference to the implementation, as it always pushes
15167 and shifts pointers to other SVs without changing their reference
15168 count, with the array becoming empty before it is freed. However, it
15169 makes it conceptually clear what is going on, and will avoid some
15170 work inside av.c, filling slots between AvFILL() and AvMAX() with
15171 &PL_sv_undef, and SvREFCNT_dec()ing those. */
15172 AvREAL_off(param->stashes);
15174 if (!(flags & CLONEf_COPY_STACKS)) {
15175 param->unreferenced = newAV();
15178 #ifdef PERLIO_LAYERS
15179 /* Clone PerlIO tables as soon as we can handle general xx_dup() */
15180 PerlIO_clone(aTHX_ proto_perl, param);
15183 PL_envgv = gv_dup_inc(proto_perl->Ienvgv, param);
15184 PL_incgv = gv_dup_inc(proto_perl->Iincgv, param);
15185 PL_hintgv = gv_dup_inc(proto_perl->Ihintgv, param);
15186 PL_origfilename = SAVEPV(proto_perl->Iorigfilename);
15187 PL_xsubfilename = proto_perl->Ixsubfilename;
15188 PL_diehook = sv_dup_inc(proto_perl->Idiehook, param);
15189 PL_warnhook = sv_dup_inc(proto_perl->Iwarnhook, param);
15192 PL_patchlevel = sv_dup_inc(proto_perl->Ipatchlevel, param);
15193 PL_inplace = SAVEPV(proto_perl->Iinplace);
15194 PL_e_script = sv_dup_inc(proto_perl->Ie_script, param);
15196 /* magical thingies */
15198 SvPVCLEAR(PERL_DEBUG_PAD(0)); /* For regex debugging. */
15199 SvPVCLEAR(PERL_DEBUG_PAD(1)); /* ext/re needs these */
15200 SvPVCLEAR(PERL_DEBUG_PAD(2)); /* even without DEBUGGING. */
15203 /* Clone the regex array */
15204 /* ORANGE FIXME for plugins, probably in the SV dup code.
15205 newSViv(PTR2IV(CALLREGDUPE(
15206 INT2PTR(REGEXP *, SvIVX(regex)), param))))
15208 PL_regex_padav = av_dup_inc(proto_perl->Iregex_padav, param);
15209 PL_regex_pad = AvARRAY(PL_regex_padav);
15211 PL_stashpadmax = proto_perl->Istashpadmax;
15212 PL_stashpadix = proto_perl->Istashpadix ;
15213 Newx(PL_stashpad, PL_stashpadmax, HV *);
15216 for (; o < PL_stashpadmax; ++o)
15217 PL_stashpad[o] = hv_dup(proto_perl->Istashpad[o], param);
15220 /* shortcuts to various I/O objects */
15221 PL_ofsgv = gv_dup_inc(proto_perl->Iofsgv, param);
15222 PL_stdingv = gv_dup(proto_perl->Istdingv, param);
15223 PL_stderrgv = gv_dup(proto_perl->Istderrgv, param);
15224 PL_defgv = gv_dup(proto_perl->Idefgv, param);
15225 PL_argvgv = gv_dup_inc(proto_perl->Iargvgv, param);
15226 PL_argvoutgv = gv_dup(proto_perl->Iargvoutgv, param);
15227 PL_argvout_stack = av_dup_inc(proto_perl->Iargvout_stack, param);
15229 /* shortcuts to regexp stuff */
15230 PL_replgv = gv_dup_inc(proto_perl->Ireplgv, param);
15232 /* shortcuts to misc objects */
15233 PL_errgv = gv_dup(proto_perl->Ierrgv, param);
15235 /* shortcuts to debugging objects */
15236 PL_DBgv = gv_dup_inc(proto_perl->IDBgv, param);
15237 PL_DBline = gv_dup_inc(proto_perl->IDBline, param);
15238 PL_DBsub = gv_dup_inc(proto_perl->IDBsub, param);
15239 PL_DBsingle = sv_dup(proto_perl->IDBsingle, param);
15240 PL_DBtrace = sv_dup(proto_perl->IDBtrace, param);
15241 PL_DBsignal = sv_dup(proto_perl->IDBsignal, param);
15242 Copy(proto_perl->IDBcontrol, PL_DBcontrol, DBVARMG_COUNT, IV);
15244 /* symbol tables */
15245 PL_defstash = hv_dup_inc(proto_perl->Idefstash, param);
15246 PL_curstash = hv_dup_inc(proto_perl->Icurstash, param);
15247 PL_debstash = hv_dup(proto_perl->Idebstash, param);
15248 PL_globalstash = hv_dup(proto_perl->Iglobalstash, param);
15249 PL_curstname = sv_dup_inc(proto_perl->Icurstname, param);
15251 PL_beginav = av_dup_inc(proto_perl->Ibeginav, param);
15252 PL_beginav_save = av_dup_inc(proto_perl->Ibeginav_save, param);
15253 PL_checkav_save = av_dup_inc(proto_perl->Icheckav_save, param);
15254 PL_unitcheckav = av_dup_inc(proto_perl->Iunitcheckav, param);
15255 PL_unitcheckav_save = av_dup_inc(proto_perl->Iunitcheckav_save, param);
15256 PL_endav = av_dup_inc(proto_perl->Iendav, param);
15257 PL_checkav = av_dup_inc(proto_perl->Icheckav, param);
15258 PL_initav = av_dup_inc(proto_perl->Iinitav, param);
15259 PL_savebegin = proto_perl->Isavebegin;
15261 PL_isarev = hv_dup_inc(proto_perl->Iisarev, param);
15263 /* subprocess state */
15264 PL_fdpid = av_dup_inc(proto_perl->Ifdpid, param);
15266 if (proto_perl->Iop_mask)
15267 PL_op_mask = SAVEPVN(proto_perl->Iop_mask, PL_maxo);
15270 /* PL_asserting = proto_perl->Iasserting; */
15272 /* current interpreter roots */
15273 PL_main_cv = cv_dup_inc(proto_perl->Imain_cv, param);
15275 PL_main_root = OpREFCNT_inc(proto_perl->Imain_root);
15278 /* runtime control stuff */
15279 PL_curcopdb = (COP*)any_dup(proto_perl->Icurcopdb, proto_perl);
15281 PL_preambleav = av_dup_inc(proto_perl->Ipreambleav, param);
15283 PL_ors_sv = sv_dup_inc(proto_perl->Iors_sv, param);
15285 /* interpreter atexit processing */
15286 PL_exitlistlen = proto_perl->Iexitlistlen;
15287 if (PL_exitlistlen) {
15288 Newx(PL_exitlist, PL_exitlistlen, PerlExitListEntry);
15289 Copy(proto_perl->Iexitlist, PL_exitlist, PL_exitlistlen, PerlExitListEntry);
15292 PL_exitlist = (PerlExitListEntry*)NULL;
15294 PL_my_cxt_size = proto_perl->Imy_cxt_size;
15295 if (PL_my_cxt_size) {
15296 Newx(PL_my_cxt_list, PL_my_cxt_size, void *);
15297 Copy(proto_perl->Imy_cxt_list, PL_my_cxt_list, PL_my_cxt_size, void *);
15298 #ifdef PERL_GLOBAL_STRUCT_PRIVATE
15299 Newx(PL_my_cxt_keys, PL_my_cxt_size, const char *);
15300 Copy(proto_perl->Imy_cxt_keys, PL_my_cxt_keys, PL_my_cxt_size, char *);
15304 PL_my_cxt_list = (void**)NULL;
15305 #ifdef PERL_GLOBAL_STRUCT_PRIVATE
15306 PL_my_cxt_keys = (const char**)NULL;
15309 PL_modglobal = hv_dup_inc(proto_perl->Imodglobal, param);
15310 PL_custom_op_names = hv_dup_inc(proto_perl->Icustom_op_names,param);
15311 PL_custom_op_descs = hv_dup_inc(proto_perl->Icustom_op_descs,param);
15312 PL_custom_ops = hv_dup_inc(proto_perl->Icustom_ops, param);
15314 PL_compcv = cv_dup(proto_perl->Icompcv, param);
15316 PAD_CLONE_VARS(proto_perl, param);
15318 #ifdef HAVE_INTERP_INTERN
15319 sys_intern_dup(&proto_perl->Isys_intern, &PL_sys_intern);
15322 PL_DBcv = cv_dup(proto_perl->IDBcv, param);
15324 #ifdef PERL_USES_PL_PIDSTATUS
15325 PL_pidstatus = newHV(); /* XXX flag for cloning? */
15327 PL_osname = SAVEPV(proto_perl->Iosname);
15328 PL_parser = parser_dup(proto_perl->Iparser, param);
15330 /* XXX this only works if the saved cop has already been cloned */
15331 if (proto_perl->Iparser) {
15332 PL_parser->saved_curcop = (COP*)any_dup(
15333 proto_perl->Iparser->saved_curcop,
15337 PL_subname = sv_dup_inc(proto_perl->Isubname, param);
15339 #ifdef USE_LOCALE_CTYPE
15340 /* Should we warn if uses locale? */
15341 PL_warn_locale = sv_dup_inc(proto_perl->Iwarn_locale, param);
15344 #ifdef USE_LOCALE_COLLATE
15345 PL_collation_name = SAVEPV(proto_perl->Icollation_name);
15346 #endif /* USE_LOCALE_COLLATE */
15348 #ifdef USE_LOCALE_NUMERIC
15349 PL_numeric_name = SAVEPV(proto_perl->Inumeric_name);
15350 PL_numeric_radix_sv = sv_dup_inc(proto_perl->Inumeric_radix_sv, param);
15351 #endif /* !USE_LOCALE_NUMERIC */
15353 /* Unicode inversion lists */
15354 PL_Latin1 = sv_dup_inc(proto_perl->ILatin1, param);
15355 PL_UpperLatin1 = sv_dup_inc(proto_perl->IUpperLatin1, param);
15356 PL_AboveLatin1 = sv_dup_inc(proto_perl->IAboveLatin1, param);
15357 PL_InBitmap = sv_dup_inc(proto_perl->IInBitmap, param);
15359 PL_NonL1NonFinalFold = sv_dup_inc(proto_perl->INonL1NonFinalFold, param);
15360 PL_HasMultiCharFold = sv_dup_inc(proto_perl->IHasMultiCharFold, param);
15362 /* utf8 character class swashes */
15363 for (i = 0; i < POSIX_SWASH_COUNT; i++) {
15364 PL_utf8_swash_ptrs[i] = sv_dup_inc(proto_perl->Iutf8_swash_ptrs[i], param);
15366 for (i = 0; i < POSIX_CC_COUNT; i++) {
15367 PL_XPosix_ptrs[i] = sv_dup_inc(proto_perl->IXPosix_ptrs[i], param);
15369 PL_GCB_invlist = sv_dup_inc(proto_perl->IGCB_invlist, param);
15370 PL_SB_invlist = sv_dup_inc(proto_perl->ISB_invlist, param);
15371 PL_WB_invlist = sv_dup_inc(proto_perl->IWB_invlist, param);
15372 PL_seen_deprecated_macro = hv_dup_inc(proto_perl->Iseen_deprecated_macro, param);
15373 PL_utf8_mark = sv_dup_inc(proto_perl->Iutf8_mark, param);
15374 PL_utf8_toupper = sv_dup_inc(proto_perl->Iutf8_toupper, param);
15375 PL_utf8_totitle = sv_dup_inc(proto_perl->Iutf8_totitle, param);
15376 PL_utf8_tolower = sv_dup_inc(proto_perl->Iutf8_tolower, param);
15377 PL_utf8_tofold = sv_dup_inc(proto_perl->Iutf8_tofold, param);
15378 PL_utf8_idstart = sv_dup_inc(proto_perl->Iutf8_idstart, param);
15379 PL_utf8_xidstart = sv_dup_inc(proto_perl->Iutf8_xidstart, param);
15380 PL_utf8_perl_idstart = sv_dup_inc(proto_perl->Iutf8_perl_idstart, param);
15381 PL_utf8_perl_idcont = sv_dup_inc(proto_perl->Iutf8_perl_idcont, param);
15382 PL_utf8_idcont = sv_dup_inc(proto_perl->Iutf8_idcont, param);
15383 PL_utf8_xidcont = sv_dup_inc(proto_perl->Iutf8_xidcont, param);
15384 PL_utf8_foldable = sv_dup_inc(proto_perl->Iutf8_foldable, param);
15385 PL_utf8_charname_begin = sv_dup_inc(proto_perl->Iutf8_charname_begin, param);
15386 PL_utf8_charname_continue = sv_dup_inc(proto_perl->Iutf8_charname_continue, param);
15388 if (proto_perl->Ipsig_pend) {
15389 Newxz(PL_psig_pend, SIG_SIZE, int);
15392 PL_psig_pend = (int*)NULL;
15395 if (proto_perl->Ipsig_name) {
15396 Newx(PL_psig_name, 2 * SIG_SIZE, SV*);
15397 sv_dup_inc_multiple(proto_perl->Ipsig_name, PL_psig_name, 2 * SIG_SIZE,
15399 PL_psig_ptr = PL_psig_name + SIG_SIZE;
15402 PL_psig_ptr = (SV**)NULL;
15403 PL_psig_name = (SV**)NULL;
15406 if (flags & CLONEf_COPY_STACKS) {
15407 Newx(PL_tmps_stack, PL_tmps_max, SV*);
15408 sv_dup_inc_multiple(proto_perl->Itmps_stack, PL_tmps_stack,
15409 PL_tmps_ix+1, param);
15411 /* next PUSHMARK() sets *(PL_markstack_ptr+1) */
15412 i = proto_perl->Imarkstack_max - proto_perl->Imarkstack;
15413 Newxz(PL_markstack, i, I32);
15414 PL_markstack_max = PL_markstack + (proto_perl->Imarkstack_max
15415 - proto_perl->Imarkstack);
15416 PL_markstack_ptr = PL_markstack + (proto_perl->Imarkstack_ptr
15417 - proto_perl->Imarkstack);
15418 Copy(proto_perl->Imarkstack, PL_markstack,
15419 PL_markstack_ptr - PL_markstack + 1, I32);
15421 /* next push_scope()/ENTER sets PL_scopestack[PL_scopestack_ix]
15422 * NOTE: unlike the others! */
15423 Newxz(PL_scopestack, PL_scopestack_max, I32);
15424 Copy(proto_perl->Iscopestack, PL_scopestack, PL_scopestack_ix, I32);
15427 Newxz(PL_scopestack_name, PL_scopestack_max, const char *);
15428 Copy(proto_perl->Iscopestack_name, PL_scopestack_name, PL_scopestack_ix, const char *);
15430 /* reset stack AV to correct length before its duped via
15431 * PL_curstackinfo */
15432 AvFILLp(proto_perl->Icurstack) =
15433 proto_perl->Istack_sp - proto_perl->Istack_base;
15435 /* NOTE: si_dup() looks at PL_markstack */
15436 PL_curstackinfo = si_dup(proto_perl->Icurstackinfo, param);
15438 /* PL_curstack = PL_curstackinfo->si_stack; */
15439 PL_curstack = av_dup(proto_perl->Icurstack, param);
15440 PL_mainstack = av_dup(proto_perl->Imainstack, param);
15442 /* next PUSHs() etc. set *(PL_stack_sp+1) */
15443 PL_stack_base = AvARRAY(PL_curstack);
15444 PL_stack_sp = PL_stack_base + (proto_perl->Istack_sp
15445 - proto_perl->Istack_base);
15446 PL_stack_max = PL_stack_base + AvMAX(PL_curstack);
15448 /*Newxz(PL_savestack, PL_savestack_max, ANY);*/
15449 PL_savestack = ss_dup(proto_perl, param);
15453 ENTER; /* perl_destruct() wants to LEAVE; */
15456 PL_statgv = gv_dup(proto_perl->Istatgv, param);
15457 PL_statname = sv_dup_inc(proto_perl->Istatname, param);
15459 PL_rs = sv_dup_inc(proto_perl->Irs, param);
15460 PL_last_in_gv = gv_dup(proto_perl->Ilast_in_gv, param);
15461 PL_defoutgv = gv_dup_inc(proto_perl->Idefoutgv, param);
15462 PL_toptarget = sv_dup_inc(proto_perl->Itoptarget, param);
15463 PL_bodytarget = sv_dup_inc(proto_perl->Ibodytarget, param);
15464 PL_formtarget = sv_dup(proto_perl->Iformtarget, param);
15466 PL_errors = sv_dup_inc(proto_perl->Ierrors, param);
15468 PL_sortcop = (OP*)any_dup(proto_perl->Isortcop, proto_perl);
15469 PL_firstgv = gv_dup_inc(proto_perl->Ifirstgv, param);
15470 PL_secondgv = gv_dup_inc(proto_perl->Isecondgv, param);
15472 PL_stashcache = newHV();
15474 PL_watchaddr = (char **) ptr_table_fetch(PL_ptr_table,
15475 proto_perl->Iwatchaddr);
15476 PL_watchok = PL_watchaddr ? * PL_watchaddr : NULL;
15477 if (PL_debug && PL_watchaddr) {
15478 PerlIO_printf(Perl_debug_log,
15479 "WATCHING: %" UVxf " cloned as %" UVxf " with value %" UVxf "\n",
15480 PTR2UV(proto_perl->Iwatchaddr), PTR2UV(PL_watchaddr),
15481 PTR2UV(PL_watchok));
15484 PL_registered_mros = hv_dup_inc(proto_perl->Iregistered_mros, param);
15485 PL_blockhooks = av_dup_inc(proto_perl->Iblockhooks, param);
15486 PL_utf8_foldclosures = hv_dup_inc(proto_perl->Iutf8_foldclosures, param);
15488 /* Call the ->CLONE method, if it exists, for each of the stashes
15489 identified by sv_dup() above.
15491 while(av_tindex(param->stashes) != -1) {
15492 HV* const stash = MUTABLE_HV(av_shift(param->stashes));
15493 GV* const cloner = gv_fetchmethod_autoload(stash, "CLONE", 0);
15494 if (cloner && GvCV(cloner)) {
15499 mXPUSHs(newSVhek(HvNAME_HEK(stash)));
15501 call_sv(MUTABLE_SV(GvCV(cloner)), G_DISCARD);
15507 if (!(flags & CLONEf_KEEP_PTR_TABLE)) {
15508 ptr_table_free(PL_ptr_table);
15509 PL_ptr_table = NULL;
15512 if (!(flags & CLONEf_COPY_STACKS)) {
15513 unreferenced_to_tmp_stack(param->unreferenced);
15516 SvREFCNT_dec(param->stashes);
15518 /* orphaned? eg threads->new inside BEGIN or use */
15519 if (PL_compcv && ! SvREFCNT(PL_compcv)) {
15520 SvREFCNT_inc_simple_void(PL_compcv);
15521 SAVEFREESV(PL_compcv);
15528 S_unreferenced_to_tmp_stack(pTHX_ AV *const unreferenced)
15530 PERL_ARGS_ASSERT_UNREFERENCED_TO_TMP_STACK;
15532 if (AvFILLp(unreferenced) > -1) {
15533 SV **svp = AvARRAY(unreferenced);
15534 SV **const last = svp + AvFILLp(unreferenced);
15538 if (SvREFCNT(*svp) == 1)
15540 } while (++svp <= last);
15542 EXTEND_MORTAL(count);
15543 svp = AvARRAY(unreferenced);
15546 if (SvREFCNT(*svp) == 1) {
15547 /* Our reference is the only one to this SV. This means that
15548 in this thread, the scalar effectively has a 0 reference.
15549 That doesn't work (cleanup never happens), so donate our
15550 reference to it onto the save stack. */
15551 PL_tmps_stack[++PL_tmps_ix] = *svp;
15553 /* As an optimisation, because we are already walking the
15554 entire array, instead of above doing either
15555 SvREFCNT_inc(*svp) or *svp = &PL_sv_undef, we can instead
15556 release our reference to the scalar, so that at the end of
15557 the array owns zero references to the scalars it happens to
15558 point to. We are effectively converting the array from
15559 AvREAL() on to AvREAL() off. This saves the av_clear()
15560 (triggered by the SvREFCNT_dec(unreferenced) below) from
15561 walking the array a second time. */
15562 SvREFCNT_dec(*svp);
15565 } while (++svp <= last);
15566 AvREAL_off(unreferenced);
15568 SvREFCNT_dec_NN(unreferenced);
15572 Perl_clone_params_del(CLONE_PARAMS *param)
15574 /* This seemingly funky ordering keeps the build with PERL_GLOBAL_STRUCT
15576 PerlInterpreter *const to = param->new_perl;
15578 PerlInterpreter *const was = PERL_GET_THX;
15580 PERL_ARGS_ASSERT_CLONE_PARAMS_DEL;
15586 SvREFCNT_dec(param->stashes);
15587 if (param->unreferenced)
15588 unreferenced_to_tmp_stack(param->unreferenced);
15598 Perl_clone_params_new(PerlInterpreter *const from, PerlInterpreter *const to)
15601 /* Need to play this game, as newAV() can call safesysmalloc(), and that
15602 does a dTHX; to get the context from thread local storage.
15603 FIXME - under PERL_CORE Newx(), Safefree() and friends should expand to
15604 a version that passes in my_perl. */
15605 PerlInterpreter *const was = PERL_GET_THX;
15606 CLONE_PARAMS *param;
15608 PERL_ARGS_ASSERT_CLONE_PARAMS_NEW;
15614 /* Given that we've set the context, we can do this unshared. */
15615 Newx(param, 1, CLONE_PARAMS);
15618 param->proto_perl = from;
15619 param->new_perl = to;
15620 param->stashes = (AV *)Perl_newSV_type(to, SVt_PVAV);
15621 AvREAL_off(param->stashes);
15622 param->unreferenced = (AV *)Perl_newSV_type(to, SVt_PVAV);
15630 #endif /* USE_ITHREADS */
15633 Perl_init_constants(pTHX)
15635 SvREFCNT(&PL_sv_undef) = SvREFCNT_IMMORTAL;
15636 SvFLAGS(&PL_sv_undef) = SVf_READONLY|SVf_PROTECT|SVt_NULL;
15637 SvANY(&PL_sv_undef) = NULL;
15639 SvANY(&PL_sv_no) = new_XPVNV();
15640 SvREFCNT(&PL_sv_no) = SvREFCNT_IMMORTAL;
15641 SvFLAGS(&PL_sv_no) = SVt_PVNV|SVf_READONLY|SVf_PROTECT
15642 |SVp_IOK|SVf_IOK|SVp_NOK|SVf_NOK
15645 SvANY(&PL_sv_yes) = new_XPVNV();
15646 SvREFCNT(&PL_sv_yes) = SvREFCNT_IMMORTAL;
15647 SvFLAGS(&PL_sv_yes) = SVt_PVNV|SVf_READONLY|SVf_PROTECT
15648 |SVp_IOK|SVf_IOK|SVp_NOK|SVf_NOK
15651 SvPV_set(&PL_sv_no, (char*)PL_No);
15652 SvCUR_set(&PL_sv_no, 0);
15653 SvLEN_set(&PL_sv_no, 0);
15654 SvIV_set(&PL_sv_no, 0);
15655 SvNV_set(&PL_sv_no, 0);
15657 SvPV_set(&PL_sv_yes, (char*)PL_Yes);
15658 SvCUR_set(&PL_sv_yes, 1);
15659 SvLEN_set(&PL_sv_yes, 0);
15660 SvIV_set(&PL_sv_yes, 1);
15661 SvNV_set(&PL_sv_yes, 1);
15663 PadnamePV(&PL_padname_const) = (char *)PL_No;
15667 =head1 Unicode Support
15669 =for apidoc sv_recode_to_utf8
15671 C<encoding> is assumed to be an C<Encode> object, on entry the PV
15672 of C<sv> is assumed to be octets in that encoding, and C<sv>
15673 will be converted into Unicode (and UTF-8).
15675 If C<sv> already is UTF-8 (or if it is not C<POK>), or if C<encoding>
15676 is not a reference, nothing is done to C<sv>. If C<encoding> is not
15677 an C<Encode::XS> Encoding object, bad things will happen.
15678 (See F<cpan/Encode/encoding.pm> and L<Encode>.)
15680 The PV of C<sv> is returned.
15685 Perl_sv_recode_to_utf8(pTHX_ SV *sv, SV *encoding)
15687 PERL_ARGS_ASSERT_SV_RECODE_TO_UTF8;
15689 if (SvPOK(sv) && !SvUTF8(sv) && !IN_BYTES && SvROK(encoding)) {
15698 if (SvPADTMP(nsv)) {
15699 nsv = sv_newmortal();
15700 SvSetSV_nosteal(nsv, sv);
15709 Passing sv_yes is wrong - it needs to be or'ed set of constants
15710 for Encode::XS, while UTf-8 decode (currently) assumes a true value means
15711 remove converted chars from source.
15713 Both will default the value - let them.
15715 XPUSHs(&PL_sv_yes);
15718 call_method("decode", G_SCALAR);
15722 s = SvPV_const(uni, len);
15723 if (s != SvPVX_const(sv)) {
15724 SvGROW(sv, len + 1);
15725 Move(s, SvPVX(sv), len + 1, char);
15726 SvCUR_set(sv, len);
15731 if (SvTYPE(sv) >= SVt_PVMG && SvMAGIC(sv)) {
15732 /* clear pos and any utf8 cache */
15733 MAGIC * mg = mg_find(sv, PERL_MAGIC_regex_global);
15736 if ((mg = mg_find(sv, PERL_MAGIC_utf8)))
15737 magic_setutf8(sv,mg); /* clear UTF8 cache */
15742 return SvPOKp(sv) ? SvPVX(sv) : NULL;
15746 =for apidoc sv_cat_decode
15748 C<encoding> is assumed to be an C<Encode> object, the PV of C<ssv> is
15749 assumed to be octets in that encoding and decoding the input starts
15750 from the position which S<C<(PV + *offset)>> pointed to. C<dsv> will be
15751 concatenated with the decoded UTF-8 string from C<ssv>. Decoding will terminate
15752 when the string C<tstr> appears in decoding output or the input ends on
15753 the PV of C<ssv>. The value which C<offset> points will be modified
15754 to the last input position on C<ssv>.
15756 Returns TRUE if the terminator was found, else returns FALSE.
15761 Perl_sv_cat_decode(pTHX_ SV *dsv, SV *encoding,
15762 SV *ssv, int *offset, char *tstr, int tlen)
15766 PERL_ARGS_ASSERT_SV_CAT_DECODE;
15768 if (SvPOK(ssv) && SvPOK(dsv) && SvROK(encoding)) {
15779 offsv = newSViv(*offset);
15781 mPUSHp(tstr, tlen);
15783 call_method("cat_decode", G_SCALAR);
15785 ret = SvTRUE(TOPs);
15786 *offset = SvIV(offsv);
15792 Perl_croak(aTHX_ "Invalid argument to sv_cat_decode");
15797 /* ---------------------------------------------------------------------
15799 * support functions for report_uninit()
15802 /* the maxiumum size of array or hash where we will scan looking
15803 * for the undefined element that triggered the warning */
15805 #define FUV_MAX_SEARCH_SIZE 1000
15807 /* Look for an entry in the hash whose value has the same SV as val;
15808 * If so, return a mortal copy of the key. */
15811 S_find_hash_subscript(pTHX_ const HV *const hv, const SV *const val)
15817 PERL_ARGS_ASSERT_FIND_HASH_SUBSCRIPT;
15819 if (!hv || SvMAGICAL(hv) || !HvARRAY(hv) ||
15820 (HvTOTALKEYS(hv) > FUV_MAX_SEARCH_SIZE))
15823 array = HvARRAY(hv);
15825 for (i=HvMAX(hv); i>=0; i--) {
15827 for (entry = array[i]; entry; entry = HeNEXT(entry)) {
15828 if (HeVAL(entry) != val)
15830 if ( HeVAL(entry) == &PL_sv_undef ||
15831 HeVAL(entry) == &PL_sv_placeholder)
15835 if (HeKLEN(entry) == HEf_SVKEY)
15836 return sv_mortalcopy(HeKEY_sv(entry));
15837 return sv_2mortal(newSVhek(HeKEY_hek(entry)));
15843 /* Look for an entry in the array whose value has the same SV as val;
15844 * If so, return the index, otherwise return -1. */
15847 S_find_array_subscript(pTHX_ const AV *const av, const SV *const val)
15849 PERL_ARGS_ASSERT_FIND_ARRAY_SUBSCRIPT;
15851 if (!av || SvMAGICAL(av) || !AvARRAY(av) ||
15852 (AvFILLp(av) > FUV_MAX_SEARCH_SIZE))
15855 if (val != &PL_sv_undef) {
15856 SV ** const svp = AvARRAY(av);
15859 for (i=AvFILLp(av); i>=0; i--)
15866 /* varname(): return the name of a variable, optionally with a subscript.
15867 * If gv is non-zero, use the name of that global, along with gvtype (one
15868 * of "$", "@", "%"); otherwise use the name of the lexical at pad offset
15869 * targ. Depending on the value of the subscript_type flag, return:
15872 #define FUV_SUBSCRIPT_NONE 1 /* "@foo" */
15873 #define FUV_SUBSCRIPT_ARRAY 2 /* "$foo[aindex]" */
15874 #define FUV_SUBSCRIPT_HASH 3 /* "$foo{keyname}" */
15875 #define FUV_SUBSCRIPT_WITHIN 4 /* "within @foo" */
15878 Perl_varname(pTHX_ const GV *const gv, const char gvtype, PADOFFSET targ,
15879 const SV *const keyname, SSize_t aindex, int subscript_type)
15882 SV * const name = sv_newmortal();
15883 if (gv && isGV(gv)) {
15885 buffer[0] = gvtype;
15888 /* as gv_fullname4(), but add literal '^' for $^FOO names */
15890 gv_fullname4(name, gv, buffer, 0);
15892 if ((unsigned int)SvPVX(name)[1] <= 26) {
15894 buffer[1] = SvPVX(name)[1] + 'A' - 1;
15896 /* Swap the 1 unprintable control character for the 2 byte pretty
15897 version - ie substr($name, 1, 1) = $buffer; */
15898 sv_insert(name, 1, 1, buffer, 2);
15902 CV * const cv = gv ? ((CV *)gv) : find_runcv(NULL);
15905 assert(!cv || SvTYPE(cv) == SVt_PVCV || SvTYPE(cv) == SVt_PVFM);
15907 if (!cv || !CvPADLIST(cv))
15909 sv = padnamelist_fetch(PadlistNAMES(CvPADLIST(cv)), targ);
15910 sv_setpvn(name, PadnamePV(sv), PadnameLEN(sv));
15914 if (subscript_type == FUV_SUBSCRIPT_HASH) {
15915 SV * const sv = newSV(0);
15917 const char * const pv = SvPV_nomg_const((SV*)keyname, len);
15919 *SvPVX(name) = '$';
15920 Perl_sv_catpvf(aTHX_ name, "{%s}",
15921 pv_pretty(sv, pv, len, 32, NULL, NULL,
15922 PERL_PV_PRETTY_DUMP | PERL_PV_ESCAPE_UNI_DETECT ));
15923 SvREFCNT_dec_NN(sv);
15925 else if (subscript_type == FUV_SUBSCRIPT_ARRAY) {
15926 *SvPVX(name) = '$';
15927 Perl_sv_catpvf(aTHX_ name, "[%" IVdf "]", (IV)aindex);
15929 else if (subscript_type == FUV_SUBSCRIPT_WITHIN) {
15930 /* We know that name has no magic, so can use 0 instead of SV_GMAGIC */
15931 Perl_sv_insert_flags(aTHX_ name, 0, 0, STR_WITH_LEN("within "), 0);
15939 =for apidoc find_uninit_var
15941 Find the name of the undefined variable (if any) that caused the operator
15942 to issue a "Use of uninitialized value" warning.
15943 If match is true, only return a name if its value matches C<uninit_sv>.
15944 So roughly speaking, if a unary operator (such as C<OP_COS>) generates a
15945 warning, then following the direct child of the op may yield an
15946 C<OP_PADSV> or C<OP_GV> that gives the name of the undefined variable. On the
15947 other hand, with C<OP_ADD> there are two branches to follow, so we only print
15948 the variable name if we get an exact match.
15949 C<desc_p> points to a string pointer holding the description of the op.
15950 This may be updated if needed.
15952 The name is returned as a mortal SV.
15954 Assumes that C<PL_op> is the OP that originally triggered the error, and that
15955 C<PL_comppad>/C<PL_curpad> points to the currently executing pad.
15961 S_find_uninit_var(pTHX_ const OP *const obase, const SV *const uninit_sv,
15962 bool match, const char **desc_p)
15967 const OP *o, *o2, *kid;
15969 PERL_ARGS_ASSERT_FIND_UNINIT_VAR;
15971 if (!obase || (match && (!uninit_sv || uninit_sv == &PL_sv_undef ||
15972 uninit_sv == &PL_sv_placeholder)))
15975 switch (obase->op_type) {
15978 /* undef should care if its args are undef - any warnings
15979 * will be from tied/magic vars */
15987 const bool pad = ( obase->op_type == OP_PADAV
15988 || obase->op_type == OP_PADHV
15989 || obase->op_type == OP_PADRANGE
15992 const bool hash = ( obase->op_type == OP_PADHV
15993 || obase->op_type == OP_RV2HV
15994 || (obase->op_type == OP_PADRANGE
15995 && SvTYPE(PAD_SVl(obase->op_targ)) == SVt_PVHV)
15999 int subscript_type = FUV_SUBSCRIPT_WITHIN;
16001 if (pad) { /* @lex, %lex */
16002 sv = PAD_SVl(obase->op_targ);
16006 if (cUNOPx(obase)->op_first->op_type == OP_GV) {
16007 /* @global, %global */
16008 gv = cGVOPx_gv(cUNOPx(obase)->op_first);
16011 sv = hash ? MUTABLE_SV(GvHV(gv)): MUTABLE_SV(GvAV(gv));
16013 else if (obase == PL_op) /* @{expr}, %{expr} */
16014 return find_uninit_var(cUNOPx(obase)->op_first,
16015 uninit_sv, match, desc_p);
16016 else /* @{expr}, %{expr} as a sub-expression */
16020 /* attempt to find a match within the aggregate */
16022 keysv = find_hash_subscript((const HV*)sv, uninit_sv);
16024 subscript_type = FUV_SUBSCRIPT_HASH;
16027 index = find_array_subscript((const AV *)sv, uninit_sv);
16029 subscript_type = FUV_SUBSCRIPT_ARRAY;
16032 if (match && subscript_type == FUV_SUBSCRIPT_WITHIN)
16035 return varname(gv, (char)(hash ? '%' : '@'), obase->op_targ,
16036 keysv, index, subscript_type);
16040 if (cUNOPx(obase)->op_first->op_type == OP_GV) {
16042 gv = cGVOPx_gv(cUNOPx(obase)->op_first);
16043 if (!gv || !GvSTASH(gv))
16045 if (match && (GvSV(gv) != uninit_sv))
16047 return varname(gv, '$', 0, NULL, 0, FUV_SUBSCRIPT_NONE);
16050 return find_uninit_var(cUNOPx(obase)->op_first, uninit_sv, 1, desc_p);
16053 if (match && PAD_SVl(obase->op_targ) != uninit_sv)
16055 return varname(NULL, '$', obase->op_targ,
16056 NULL, 0, FUV_SUBSCRIPT_NONE);
16059 gv = cGVOPx_gv(obase);
16060 if (!gv || (match && GvSV(gv) != uninit_sv) || !GvSTASH(gv))
16062 return varname(gv, '$', 0, NULL, 0, FUV_SUBSCRIPT_NONE);
16064 case OP_AELEMFAST_LEX:
16067 AV *av = MUTABLE_AV(PAD_SV(obase->op_targ));
16068 if (!av || SvRMAGICAL(av))
16070 svp = av_fetch(av, (I8)obase->op_private, FALSE);
16071 if (!svp || *svp != uninit_sv)
16074 return varname(NULL, '$', obase->op_targ,
16075 NULL, (I8)obase->op_private, FUV_SUBSCRIPT_ARRAY);
16078 gv = cGVOPx_gv(obase);
16083 AV *const av = GvAV(gv);
16084 if (!av || SvRMAGICAL(av))
16086 svp = av_fetch(av, (I8)obase->op_private, FALSE);
16087 if (!svp || *svp != uninit_sv)
16090 return varname(gv, '$', 0,
16091 NULL, (I8)obase->op_private, FUV_SUBSCRIPT_ARRAY);
16093 NOT_REACHED; /* NOTREACHED */
16096 o = cUNOPx(obase)->op_first;
16097 if (!o || o->op_type != OP_NULL ||
16098 ! (o->op_targ == OP_AELEM || o->op_targ == OP_HELEM))
16100 return find_uninit_var(cBINOPo->op_last, uninit_sv, match, desc_p);
16105 bool negate = FALSE;
16107 if (PL_op == obase)
16108 /* $a[uninit_expr] or $h{uninit_expr} */
16109 return find_uninit_var(cBINOPx(obase)->op_last,
16110 uninit_sv, match, desc_p);
16113 o = cBINOPx(obase)->op_first;
16114 kid = cBINOPx(obase)->op_last;
16116 /* get the av or hv, and optionally the gv */
16118 if (o->op_type == OP_PADAV || o->op_type == OP_PADHV) {
16119 sv = PAD_SV(o->op_targ);
16121 else if ((o->op_type == OP_RV2AV || o->op_type == OP_RV2HV)
16122 && cUNOPo->op_first->op_type == OP_GV)
16124 gv = cGVOPx_gv(cUNOPo->op_first);
16128 == OP_RV2HV ? MUTABLE_SV(GvHV(gv)) : MUTABLE_SV(GvAV(gv));
16133 if (kid && kid->op_type == OP_NEGATE) {
16135 kid = cUNOPx(kid)->op_first;
16138 if (kid && kid->op_type == OP_CONST && SvOK(cSVOPx_sv(kid))) {
16139 /* index is constant */
16142 kidsv = newSVpvs_flags("-", SVs_TEMP);
16143 sv_catsv(kidsv, cSVOPx_sv(kid));
16146 kidsv = cSVOPx_sv(kid);
16150 if (obase->op_type == OP_HELEM) {
16151 HE* he = hv_fetch_ent(MUTABLE_HV(sv), kidsv, 0, 0);
16152 if (!he || HeVAL(he) != uninit_sv)
16156 SV * const opsv = cSVOPx_sv(kid);
16157 const IV opsviv = SvIV(opsv);
16158 SV * const * const svp = av_fetch(MUTABLE_AV(sv),
16159 negate ? - opsviv : opsviv,
16161 if (!svp || *svp != uninit_sv)
16165 if (obase->op_type == OP_HELEM)
16166 return varname(gv, '%', o->op_targ,
16167 kidsv, 0, FUV_SUBSCRIPT_HASH);
16169 return varname(gv, '@', o->op_targ, NULL,
16170 negate ? - SvIV(cSVOPx_sv(kid)) : SvIV(cSVOPx_sv(kid)),
16171 FUV_SUBSCRIPT_ARRAY);
16174 /* index is an expression;
16175 * attempt to find a match within the aggregate */
16176 if (obase->op_type == OP_HELEM) {
16177 SV * const keysv = find_hash_subscript((const HV*)sv, uninit_sv);
16179 return varname(gv, '%', o->op_targ,
16180 keysv, 0, FUV_SUBSCRIPT_HASH);
16183 const SSize_t index
16184 = find_array_subscript((const AV *)sv, uninit_sv);
16186 return varname(gv, '@', o->op_targ,
16187 NULL, index, FUV_SUBSCRIPT_ARRAY);
16192 (char)((o->op_type == OP_PADAV || o->op_type == OP_RV2AV)
16194 o->op_targ, NULL, 0, FUV_SUBSCRIPT_WITHIN);
16196 NOT_REACHED; /* NOTREACHED */
16199 case OP_MULTIDEREF: {
16200 /* If we were executing OP_MULTIDEREF when the undef warning
16201 * triggered, then it must be one of the index values within
16202 * that triggered it. If not, then the only possibility is that
16203 * the value retrieved by the last aggregate index might be the
16204 * culprit. For the former, we set PL_multideref_pc each time before
16205 * using an index, so work though the item list until we reach
16206 * that point. For the latter, just work through the entire item
16207 * list; the last aggregate retrieved will be the candidate.
16208 * There is a third rare possibility: something triggered
16209 * magic while fetching an array/hash element. Just display
16210 * nothing in this case.
16213 /* the named aggregate, if any */
16214 PADOFFSET agg_targ = 0;
16216 /* the last-seen index */
16218 PADOFFSET index_targ;
16220 IV index_const_iv = 0; /* init for spurious compiler warn */
16221 SV *index_const_sv;
16222 int depth = 0; /* how many array/hash lookups we've done */
16224 UNOP_AUX_item *items = cUNOP_AUXx(obase)->op_aux;
16225 UNOP_AUX_item *last = NULL;
16226 UV actions = items->uv;
16229 if (PL_op == obase) {
16230 last = PL_multideref_pc;
16231 assert(last >= items && last <= items + items[-1].uv);
16238 switch (actions & MDEREF_ACTION_MASK) {
16240 case MDEREF_reload:
16241 actions = (++items)->uv;
16244 case MDEREF_HV_padhv_helem: /* $lex{...} */
16247 case MDEREF_AV_padav_aelem: /* $lex[...] */
16248 agg_targ = (++items)->pad_offset;
16252 case MDEREF_HV_gvhv_helem: /* $pkg{...} */
16255 case MDEREF_AV_gvav_aelem: /* $pkg[...] */
16257 agg_gv = (GV*)UNOP_AUX_item_sv(++items);
16258 assert(isGV_with_GP(agg_gv));
16261 case MDEREF_HV_gvsv_vivify_rv2hv_helem: /* $pkg->{...} */
16262 case MDEREF_HV_padsv_vivify_rv2hv_helem: /* $lex->{...} */
16265 case MDEREF_HV_pop_rv2hv_helem: /* expr->{...} */
16266 case MDEREF_HV_vivify_rv2hv_helem: /* vivify, ->{...} */
16272 case MDEREF_AV_gvsv_vivify_rv2av_aelem: /* $pkg->[...] */
16273 case MDEREF_AV_padsv_vivify_rv2av_aelem: /* $lex->[...] */
16276 case MDEREF_AV_pop_rv2av_aelem: /* expr->[...] */
16277 case MDEREF_AV_vivify_rv2av_aelem: /* vivify, ->[...] */
16284 index_const_sv = NULL;
16286 index_type = (actions & MDEREF_INDEX_MASK);
16287 switch (index_type) {
16288 case MDEREF_INDEX_none:
16290 case MDEREF_INDEX_const:
16292 index_const_sv = UNOP_AUX_item_sv(++items)
16294 index_const_iv = (++items)->iv;
16296 case MDEREF_INDEX_padsv:
16297 index_targ = (++items)->pad_offset;
16299 case MDEREF_INDEX_gvsv:
16300 index_gv = (GV*)UNOP_AUX_item_sv(++items);
16301 assert(isGV_with_GP(index_gv));
16305 if (index_type != MDEREF_INDEX_none)
16308 if ( index_type == MDEREF_INDEX_none
16309 || (actions & MDEREF_FLAG_last)
16310 || (last && items >= last)
16314 actions >>= MDEREF_SHIFT;
16317 if (PL_op == obase) {
16318 /* most likely index was undef */
16320 *desc_p = ( (actions & MDEREF_FLAG_last)
16321 && (obase->op_private
16322 & (OPpMULTIDEREF_EXISTS|OPpMULTIDEREF_DELETE)))
16324 (obase->op_private & OPpMULTIDEREF_EXISTS)
16327 : is_hv ? "hash element" : "array element";
16328 assert(index_type != MDEREF_INDEX_none);
16330 if (GvSV(index_gv) == uninit_sv)
16331 return varname(index_gv, '$', 0, NULL, 0,
16332 FUV_SUBSCRIPT_NONE);
16337 if (PL_curpad[index_targ] == uninit_sv)
16338 return varname(NULL, '$', index_targ,
16339 NULL, 0, FUV_SUBSCRIPT_NONE);
16343 /* If we got to this point it was undef on a const subscript,
16344 * so magic probably involved, e.g. $ISA[0]. Give up. */
16348 /* the SV returned by pp_multideref() was undef, if anything was */
16354 sv = PAD_SV(agg_targ);
16356 sv = is_hv ? MUTABLE_SV(GvHV(agg_gv)) : MUTABLE_SV(GvAV(agg_gv));
16360 if (index_type == MDEREF_INDEX_const) {
16365 HE* he = hv_fetch_ent(MUTABLE_HV(sv), index_const_sv, 0, 0);
16366 if (!he || HeVAL(he) != uninit_sv)
16370 SV * const * const svp =
16371 av_fetch(MUTABLE_AV(sv), index_const_iv, FALSE);
16372 if (!svp || *svp != uninit_sv)
16377 ? varname(agg_gv, '%', agg_targ,
16378 index_const_sv, 0, FUV_SUBSCRIPT_HASH)
16379 : varname(agg_gv, '@', agg_targ,
16380 NULL, index_const_iv, FUV_SUBSCRIPT_ARRAY);
16383 /* index is an var */
16385 SV * const keysv = find_hash_subscript((const HV*)sv, uninit_sv);
16387 return varname(agg_gv, '%', agg_targ,
16388 keysv, 0, FUV_SUBSCRIPT_HASH);
16391 const SSize_t index
16392 = find_array_subscript((const AV *)sv, uninit_sv);
16394 return varname(agg_gv, '@', agg_targ,
16395 NULL, index, FUV_SUBSCRIPT_ARRAY);
16399 return varname(agg_gv,
16401 agg_targ, NULL, 0, FUV_SUBSCRIPT_WITHIN);
16403 NOT_REACHED; /* NOTREACHED */
16407 /* only examine RHS */
16408 return find_uninit_var(cBINOPx(obase)->op_first, uninit_sv,
16412 o = cUNOPx(obase)->op_first;
16413 if ( o->op_type == OP_PUSHMARK
16414 || (o->op_type == OP_NULL && o->op_targ == OP_PUSHMARK)
16418 if (!OpHAS_SIBLING(o)) {
16419 /* one-arg version of open is highly magical */
16421 if (o->op_type == OP_GV) { /* open FOO; */
16423 if (match && GvSV(gv) != uninit_sv)
16425 return varname(gv, '$', 0,
16426 NULL, 0, FUV_SUBSCRIPT_NONE);
16428 /* other possibilities not handled are:
16429 * open $x; or open my $x; should return '${*$x}'
16430 * open expr; should return '$'.expr ideally
16437 /* ops where $_ may be an implicit arg */
16442 if ( !(obase->op_flags & OPf_STACKED)) {
16443 if (uninit_sv == DEFSV)
16444 return newSVpvs_flags("$_", SVs_TEMP);
16445 else if (obase->op_targ
16446 && uninit_sv == PAD_SVl(obase->op_targ))
16447 return varname(NULL, '$', obase->op_targ, NULL, 0,
16448 FUV_SUBSCRIPT_NONE);
16455 match = 1; /* print etc can return undef on defined args */
16456 /* skip filehandle as it can't produce 'undef' warning */
16457 o = cUNOPx(obase)->op_first;
16458 if ((obase->op_flags & OPf_STACKED)
16460 ( o->op_type == OP_PUSHMARK
16461 || (o->op_type == OP_NULL && o->op_targ == OP_PUSHMARK)))
16462 o = OpSIBLING(OpSIBLING(o));
16466 case OP_ENTEREVAL: /* could be eval $undef or $x='$undef'; eval $x */
16467 case OP_CUSTOM: /* XS or custom code could trigger random warnings */
16469 /* the following ops are capable of returning PL_sv_undef even for
16470 * defined arg(s) */
16489 case OP_GETPEERNAME:
16536 case OP_SMARTMATCH:
16545 /* XXX tmp hack: these two may call an XS sub, and currently
16546 XS subs don't have a SUB entry on the context stack, so CV and
16547 pad determination goes wrong, and BAD things happen. So, just
16548 don't try to determine the value under those circumstances.
16549 Need a better fix at dome point. DAPM 11/2007 */
16555 GV * const gv = gv_fetchpvs(".", GV_NOTQUAL, SVt_PV);
16556 if (gv && GvSV(gv) == uninit_sv)
16557 return newSVpvs_flags("$.", SVs_TEMP);
16562 /* def-ness of rval pos() is independent of the def-ness of its arg */
16563 if ( !(obase->op_flags & OPf_MOD))
16568 if (SvROK(PL_rs) && uninit_sv == SvRV(PL_rs))
16569 return newSVpvs_flags("${$/}", SVs_TEMP);
16574 if (!(obase->op_flags & OPf_KIDS))
16576 o = cUNOPx(obase)->op_first;
16582 /* This loop checks all the kid ops, skipping any that cannot pos-
16583 * sibly be responsible for the uninitialized value; i.e., defined
16584 * constants and ops that return nothing. If there is only one op
16585 * left that is not skipped, then we *know* it is responsible for
16586 * the uninitialized value. If there is more than one op left, we
16587 * have to look for an exact match in the while() loop below.
16588 * Note that we skip padrange, because the individual pad ops that
16589 * it replaced are still in the tree, so we work on them instead.
16592 for (kid=o; kid; kid = OpSIBLING(kid)) {
16593 const OPCODE type = kid->op_type;
16594 if ( (type == OP_CONST && SvOK(cSVOPx_sv(kid)))
16595 || (type == OP_NULL && ! (kid->op_flags & OPf_KIDS))
16596 || (type == OP_PUSHMARK)
16597 || (type == OP_PADRANGE)
16601 if (o2) { /* more than one found */
16608 return find_uninit_var(o2, uninit_sv, match, desc_p);
16610 /* scan all args */
16612 sv = find_uninit_var(o, uninit_sv, 1, desc_p);
16624 =for apidoc report_uninit
16626 Print appropriate "Use of uninitialized variable" warning.
16632 Perl_report_uninit(pTHX_ const SV *uninit_sv)
16634 const char *desc = NULL;
16635 SV* varname = NULL;
16638 desc = PL_op->op_type == OP_STRINGIFY && PL_op->op_folded
16641 if (uninit_sv && PL_curpad) {
16642 varname = find_uninit_var(PL_op, uninit_sv, 0, &desc);
16644 sv_insert(varname, 0, 0, " ", 1);
16647 else if (PL_curstackinfo->si_type == PERLSI_SORT && cxstack_ix == 0)
16648 /* we've reached the end of a sort block or sub,
16649 * and the uninit value is probably what that code returned */
16652 /* PL_warn_uninit_sv is constant */
16653 GCC_DIAG_IGNORE(-Wformat-nonliteral);
16655 /* diag_listed_as: Use of uninitialized value%s */
16656 Perl_warner(aTHX_ packWARN(WARN_UNINITIALIZED), PL_warn_uninit_sv,
16657 SVfARG(varname ? varname : &PL_sv_no),
16660 Perl_warner(aTHX_ packWARN(WARN_UNINITIALIZED), PL_warn_uninit,
16666 * ex: set ts=8 sts=4 sw=4 et: