This is a live mirror of the Perl 5 development currently hosted at https://github.com/perl/perl5
Replace references to PL_vtbl_{bm,fm} in the code with PL_vtbl_regexp.
[perl5.git] / sv.c
CommitLineData
a0d0e21e 1/* sv.c
79072805 2 *
1129b882 3 * Copyright (C) 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000,
83706693
RGS
4 * 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009 by Larry Wall
5 * and others
79072805
LW
6 *
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.
9 *
4ac71550
TC
10 */
11
12/*
13 * 'I wonder what the Entish is for "yes" and "no",' he thought.
14 * --Pippin
15 *
16 * [p.480 of _The Lord of the Rings_, III/iv: "Treebeard"]
17 */
18
19/*
645c22ef
DM
20 *
21 *
5e045b90
AMS
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
27 * in the pp*.c files.
79072805
LW
28 */
29
30#include "EXTERN.h"
864dbfa3 31#define PERL_IN_SV_C
79072805 32#include "perl.h"
d2f185dc 33#include "regcomp.h"
79072805 34
07208e09 35#ifndef HAS_C99
4b2d6671 36# if __STDC_VERSION__ >= 199901L && !defined(VMS)
07208e09
CS
37# define HAS_C99 1
38# endif
39#endif
40#if HAS_C99
41# include <stdint.h>
42#endif
43
51371543 44#define FCALL *f
2c5424a7 45
2f8ed50e
OS
46#ifdef __Lynx__
47/* Missing proto on LynxOS */
48 char *gconvert(double, int, int, char *);
49#endif
50
e23c8137 51#ifdef PERL_UTF8_CACHE_ASSERT
ab455f60 52/* if adding more checks watch out for the following tests:
e23c8137
JH
53 * t/op/index.t t/op/length.t t/op/pat.t t/op/substr.t
54 * lib/utf8.t lib/Unicode/Collate/t/index.t
55 * --jhi
56 */
6f207bd3 57# define ASSERT_UTF8_CACHE(cache) \
ab455f60
NC
58 STMT_START { if (cache) { assert((cache)[0] <= (cache)[1]); \
59 assert((cache)[2] <= (cache)[3]); \
60 assert((cache)[3] <= (cache)[1]);} \
61 } STMT_END
e23c8137 62#else
6f207bd3 63# define ASSERT_UTF8_CACHE(cache) NOOP
e23c8137
JH
64#endif
65
f8c7b90f 66#ifdef PERL_OLD_COPY_ON_WRITE
765f542d 67#define SV_COW_NEXT_SV(sv) INT2PTR(SV *,SvUVX(sv))
607fa7f2 68#define SV_COW_NEXT_SV_SET(current,next) SvUV_set(current, PTR2UV(next))
b5ccf5f2 69/* This is a pessimistic view. Scalar must be purely a read-write PV to copy-
765f542d 70 on-write. */
765f542d 71#endif
645c22ef
DM
72
73/* ============================================================================
74
75=head1 Allocation and deallocation of SVs.
76
d2a0f284
JC
77An SV (or AV, HV, etc.) is allocated in two parts: the head (struct
78sv, av, hv...) contains type and reference count information, and for
79many types, a pointer to the body (struct xrv, xpv, xpviv...), which
80contains fields specific to each type. Some types store all they need
81in the head, so don't have a body.
82
486ec47a 83In all but the most memory-paranoid configurations (ex: PURIFY), heads
d2a0f284
JC
84and bodies are allocated out of arenas, which by default are
85approximately 4K chunks of memory parcelled up into N heads or bodies.
93e68bfb
JC
86Sv-bodies are allocated by their sv-type, guaranteeing size
87consistency needed to allocate safely from arrays.
88
d2a0f284
JC
89For SV-heads, the first slot in each arena is reserved, and holds a
90link to the next arena, some flags, and a note of the number of slots.
91Snaked through each arena chain is a linked list of free items; when
92this becomes empty, an extra arena is allocated and divided up into N
93items which are threaded into the free list.
94
95SV-bodies are similar, but they use arena-sets by default, which
96separate the link and info from the arena itself, and reclaim the 1st
97slot in the arena. SV-bodies are further described later.
645c22ef
DM
98
99The following global variables are associated with arenas:
100
101 PL_sv_arenaroot pointer to list of SV arenas
102 PL_sv_root pointer to list of free SV structures
103
d2a0f284
JC
104 PL_body_arenas head of linked-list of body arenas
105 PL_body_roots[] array of pointers to list of free bodies of svtype
106 arrays are indexed by the svtype needed
93e68bfb 107
d2a0f284
JC
108A few special SV heads are not allocated from an arena, but are
109instead directly created in the interpreter structure, eg PL_sv_undef.
93e68bfb
JC
110The size of arenas can be changed from the default by setting
111PERL_ARENA_SIZE appropriately at compile time.
645c22ef
DM
112
113The SV arena serves the secondary purpose of allowing still-live SVs
114to be located and destroyed during final cleanup.
115
116At the lowest level, the macros new_SV() and del_SV() grab and free
117an SV head. (If debugging with -DD, del_SV() calls the function S_del_sv()
118to return the SV to the free list with error checking.) new_SV() calls
119more_sv() / sv_add_arena() to add an extra arena if the free list is empty.
120SVs in the free list have their SvTYPE field set to all ones.
121
ff276b08 122At the time of very final cleanup, sv_free_arenas() is called from
645c22ef 123perl_destruct() to physically free all the arenas allocated since the
6a93a7e5 124start of the interpreter.
645c22ef 125
645c22ef
DM
126The function visit() scans the SV arenas list, and calls a specified
127function for each SV it finds which is still live - ie which has an SvTYPE
128other than all 1's, and a non-zero SvREFCNT. visit() is used by the
129following functions (specified as [function that calls visit()] / [function
130called by visit() for each SV]):
131
132 sv_report_used() / do_report_used()
f2524eef 133 dump all remaining SVs (debugging aid)
645c22ef 134
e4487e9b
DM
135 sv_clean_objs() / do_clean_objs(),do_clean_named_objs(),
136 do_clean_named_io_objs()
645c22ef 137 Attempt to free all objects pointed to by RVs,
c3b19b5c 138 and try to do the same for all objects indirectly
645c22ef
DM
139 referenced by typeglobs too. Called once from
140 perl_destruct(), prior to calling sv_clean_all()
141 below.
142
143 sv_clean_all() / do_clean_all()
144 SvREFCNT_dec(sv) each remaining SV, possibly
145 triggering an sv_free(). It also sets the
146 SVf_BREAK flag on the SV to indicate that the
147 refcnt has been artificially lowered, and thus
148 stopping sv_free() from giving spurious warnings
149 about SVs which unexpectedly have a refcnt
150 of zero. called repeatedly from perl_destruct()
151 until there are no SVs left.
152
93e68bfb 153=head2 Arena allocator API Summary
645c22ef
DM
154
155Private API to rest of sv.c
156
157 new_SV(), del_SV(),
158
df0f0429 159 new_XPVNV(), del_XPVGV(),
645c22ef
DM
160 etc
161
162Public API:
163
8cf8f3d1 164 sv_report_used(), sv_clean_objs(), sv_clean_all(), sv_free_arenas()
645c22ef 165
645c22ef
DM
166=cut
167
3e8320cc 168 * ========================================================================= */
645c22ef 169
4561caa4
CS
170/*
171 * "A time to plant, and a time to uproot what was planted..."
172 */
173
d7a2c63c
MHM
174#ifdef PERL_MEM_LOG
175# define MEM_LOG_NEW_SV(sv, file, line, func) \
176 Perl_mem_log_new_sv(sv, file, line, func)
177# define MEM_LOG_DEL_SV(sv, file, line, func) \
178 Perl_mem_log_del_sv(sv, file, line, func)
179#else
180# define MEM_LOG_NEW_SV(sv, file, line, func) NOOP
181# define MEM_LOG_DEL_SV(sv, file, line, func) NOOP
182#endif
183
fd0854ff 184#ifdef DEBUG_LEAKING_SCALARS
22162ca8 185# define FREE_SV_DEBUG_FILE(sv) Safefree((sv)->sv_debug_file)
d7a2c63c
MHM
186# define DEBUG_SV_SERIAL(sv) \
187 DEBUG_m(PerlIO_printf(Perl_debug_log, "0x%"UVxf": (%05ld) del_SV\n", \
188 PTR2UV(sv), (long)(sv)->sv_debug_serial))
fd0854ff
DM
189#else
190# define FREE_SV_DEBUG_FILE(sv)
d7a2c63c 191# define DEBUG_SV_SERIAL(sv) NOOP
fd0854ff
DM
192#endif
193
48614a46
NC
194#ifdef PERL_POISON
195# define SvARENA_CHAIN(sv) ((sv)->sv_u.svu_rv)
daba3364 196# define SvARENA_CHAIN_SET(sv,val) (sv)->sv_u.svu_rv = MUTABLE_SV((val))
48614a46
NC
197/* Whilst I'd love to do this, it seems that things like to check on
198 unreferenced scalars
7e337ee0 199# define POSION_SV_HEAD(sv) PoisonNew(sv, 1, struct STRUCT_SV)
48614a46 200*/
7e337ee0
JH
201# define POSION_SV_HEAD(sv) PoisonNew(&SvANY(sv), 1, void *), \
202 PoisonNew(&SvREFCNT(sv), 1, U32)
48614a46
NC
203#else
204# define SvARENA_CHAIN(sv) SvANY(sv)
3eef1deb 205# define SvARENA_CHAIN_SET(sv,val) SvANY(sv) = (void *)(val)
48614a46
NC
206# define POSION_SV_HEAD(sv)
207#endif
208
990198f0
DM
209/* Mark an SV head as unused, and add to free list.
210 *
211 * If SVf_BREAK is set, skip adding it to the free list, as this SV had
212 * its refcount artificially decremented during global destruction, so
213 * there may be dangling pointers to it. The last thing we want in that
214 * case is for it to be reused. */
215
053fc874
GS
216#define plant_SV(p) \
217 STMT_START { \
990198f0 218 const U32 old_flags = SvFLAGS(p); \
d7a2c63c
MHM
219 MEM_LOG_DEL_SV(p, __FILE__, __LINE__, FUNCTION__); \
220 DEBUG_SV_SERIAL(p); \
fd0854ff 221 FREE_SV_DEBUG_FILE(p); \
48614a46 222 POSION_SV_HEAD(p); \
053fc874 223 SvFLAGS(p) = SVTYPEMASK; \
990198f0 224 if (!(old_flags & SVf_BREAK)) { \
3eef1deb 225 SvARENA_CHAIN_SET(p, PL_sv_root); \
990198f0
DM
226 PL_sv_root = (p); \
227 } \
053fc874
GS
228 --PL_sv_count; \
229 } STMT_END
a0d0e21e 230
053fc874
GS
231#define uproot_SV(p) \
232 STMT_START { \
233 (p) = PL_sv_root; \
daba3364 234 PL_sv_root = MUTABLE_SV(SvARENA_CHAIN(p)); \
053fc874
GS
235 ++PL_sv_count; \
236 } STMT_END
237
645c22ef 238
cac9b346
NC
239/* make some more SVs by adding another arena */
240
cac9b346
NC
241STATIC SV*
242S_more_sv(pTHX)
243{
97aff369 244 dVAR;
cac9b346 245 SV* sv;
9a87bd09
NC
246 char *chunk; /* must use New here to match call to */
247 Newx(chunk,PERL_ARENA_SIZE,char); /* Safefree() in sv_free_arenas() */
248 sv_add_arena(chunk, PERL_ARENA_SIZE, 0);
cac9b346
NC
249 uproot_SV(sv);
250 return sv;
251}
252
645c22ef
DM
253/* new_SV(): return a new, empty SV head */
254
eba0f806
DM
255#ifdef DEBUG_LEAKING_SCALARS
256/* provide a real function for a debugger to play with */
257STATIC SV*
d7a2c63c 258S_new_SV(pTHX_ const char *file, int line, const char *func)
eba0f806
DM
259{
260 SV* sv;
261
eba0f806
DM
262 if (PL_sv_root)
263 uproot_SV(sv);
264 else
cac9b346 265 sv = S_more_sv(aTHX);
eba0f806
DM
266 SvANY(sv) = 0;
267 SvREFCNT(sv) = 1;
268 SvFLAGS(sv) = 0;
fd0854ff 269 sv->sv_debug_optype = PL_op ? PL_op->op_type : 0;
e385c3bf
DM
270 sv->sv_debug_line = (U16) (PL_parser && PL_parser->copline != NOLINE
271 ? PL_parser->copline
272 : PL_curcop
f24aceb1
DM
273 ? CopLINE(PL_curcop)
274 : 0
e385c3bf 275 );
fd0854ff 276 sv->sv_debug_inpad = 0;
cd676548 277 sv->sv_debug_parent = NULL;
fd0854ff 278 sv->sv_debug_file = PL_curcop ? savepv(CopFILE(PL_curcop)): NULL;
d7a2c63c
MHM
279
280 sv->sv_debug_serial = PL_sv_serial++;
281
282 MEM_LOG_NEW_SV(sv, file, line, func);
283 DEBUG_m(PerlIO_printf(Perl_debug_log, "0x%"UVxf": (%05ld) new_SV (from %s:%d [%s])\n",
284 PTR2UV(sv), (long)sv->sv_debug_serial, file, line, func));
285
eba0f806
DM
286 return sv;
287}
d7a2c63c 288# define new_SV(p) (p)=S_new_SV(aTHX_ __FILE__, __LINE__, FUNCTION__)
eba0f806
DM
289
290#else
291# define new_SV(p) \
053fc874 292 STMT_START { \
053fc874
GS
293 if (PL_sv_root) \
294 uproot_SV(p); \
295 else \
cac9b346 296 (p) = S_more_sv(aTHX); \
053fc874
GS
297 SvANY(p) = 0; \
298 SvREFCNT(p) = 1; \
299 SvFLAGS(p) = 0; \
d7a2c63c 300 MEM_LOG_NEW_SV(p, __FILE__, __LINE__, FUNCTION__); \
053fc874 301 } STMT_END
eba0f806 302#endif
463ee0b2 303
645c22ef
DM
304
305/* del_SV(): return an empty SV head to the free list */
306
a0d0e21e 307#ifdef DEBUGGING
4561caa4 308
053fc874
GS
309#define del_SV(p) \
310 STMT_START { \
aea4f609 311 if (DEBUG_D_TEST) \
053fc874
GS
312 del_sv(p); \
313 else \
314 plant_SV(p); \
053fc874 315 } STMT_END
a0d0e21e 316
76e3520e 317STATIC void
cea2e8a9 318S_del_sv(pTHX_ SV *p)
463ee0b2 319{
97aff369 320 dVAR;
7918f24d
NC
321
322 PERL_ARGS_ASSERT_DEL_SV;
323
aea4f609 324 if (DEBUG_D_TEST) {
4633a7c4 325 SV* sva;
a3b680e6 326 bool ok = 0;
daba3364 327 for (sva = PL_sv_arenaroot; sva; sva = MUTABLE_SV(SvANY(sva))) {
53c1dcc0
AL
328 const SV * const sv = sva + 1;
329 const SV * const svend = &sva[SvREFCNT(sva)];
c0ff570e 330 if (p >= sv && p < svend) {
a0d0e21e 331 ok = 1;
c0ff570e
NC
332 break;
333 }
a0d0e21e
LW
334 }
335 if (!ok) {
9b387841
NC
336 Perl_ck_warner_d(aTHX_ packWARN(WARN_INTERNAL),
337 "Attempt to free non-arena SV: 0x%"UVxf
338 pTHX__FORMAT, PTR2UV(p) pTHX__VALUE);
a0d0e21e
LW
339 return;
340 }
341 }
4561caa4 342 plant_SV(p);
463ee0b2 343}
a0d0e21e 344
4561caa4
CS
345#else /* ! DEBUGGING */
346
347#define del_SV(p) plant_SV(p)
348
349#endif /* DEBUGGING */
463ee0b2 350
645c22ef
DM
351
352/*
ccfc67b7
JH
353=head1 SV Manipulation Functions
354
645c22ef
DM
355=for apidoc sv_add_arena
356
357Given a chunk of memory, link it to the head of the list of arenas,
358and split it into a list of free SVs.
359
360=cut
361*/
362
d2bd4e7f
NC
363static void
364S_sv_add_arena(pTHX_ char *const ptr, const U32 size, const U32 flags)
463ee0b2 365{
97aff369 366 dVAR;
daba3364 367 SV *const sva = MUTABLE_SV(ptr);
463ee0b2
LW
368 register SV* sv;
369 register SV* svend;
4633a7c4 370
7918f24d
NC
371 PERL_ARGS_ASSERT_SV_ADD_ARENA;
372
4633a7c4 373 /* The first SV in an arena isn't an SV. */
3280af22 374 SvANY(sva) = (void *) PL_sv_arenaroot; /* ptr to next arena */
4633a7c4
LW
375 SvREFCNT(sva) = size / sizeof(SV); /* number of SV slots */
376 SvFLAGS(sva) = flags; /* FAKE if not to be freed */
377
3280af22
NIS
378 PL_sv_arenaroot = sva;
379 PL_sv_root = sva + 1;
4633a7c4
LW
380
381 svend = &sva[SvREFCNT(sva) - 1];
382 sv = sva + 1;
463ee0b2 383 while (sv < svend) {
3eef1deb 384 SvARENA_CHAIN_SET(sv, (sv + 1));
03e36789 385#ifdef DEBUGGING
978b032e 386 SvREFCNT(sv) = 0;
03e36789 387#endif
4b69cbe3 388 /* Must always set typemask because it's always checked in on cleanup
03e36789 389 when the arenas are walked looking for objects. */
8990e307 390 SvFLAGS(sv) = SVTYPEMASK;
463ee0b2
LW
391 sv++;
392 }
3eef1deb 393 SvARENA_CHAIN_SET(sv, 0);
03e36789
NC
394#ifdef DEBUGGING
395 SvREFCNT(sv) = 0;
396#endif
4633a7c4
LW
397 SvFLAGS(sv) = SVTYPEMASK;
398}
399
055972dc
DM
400/* visit(): call the named function for each non-free SV in the arenas
401 * whose flags field matches the flags/mask args. */
645c22ef 402
5226ed68 403STATIC I32
de37a194 404S_visit(pTHX_ SVFUNC_t f, const U32 flags, const U32 mask)
8990e307 405{
97aff369 406 dVAR;
4633a7c4 407 SV* sva;
5226ed68 408 I32 visited = 0;
8990e307 409
7918f24d
NC
410 PERL_ARGS_ASSERT_VISIT;
411
daba3364 412 for (sva = PL_sv_arenaroot; sva; sva = MUTABLE_SV(SvANY(sva))) {
53c1dcc0 413 register const SV * const svend = &sva[SvREFCNT(sva)];
a3b680e6 414 register SV* sv;
4561caa4 415 for (sv = sva + 1; sv < svend; ++sv) {
055972dc
DM
416 if (SvTYPE(sv) != SVTYPEMASK
417 && (sv->sv_flags & mask) == flags
418 && SvREFCNT(sv))
419 {
acfe0abc 420 (FCALL)(aTHX_ sv);
5226ed68
JH
421 ++visited;
422 }
8990e307
LW
423 }
424 }
5226ed68 425 return visited;
8990e307
LW
426}
427
758a08c3
JH
428#ifdef DEBUGGING
429
645c22ef
DM
430/* called by sv_report_used() for each live SV */
431
432static void
5fa45a31 433do_report_used(pTHX_ SV *const sv)
645c22ef
DM
434{
435 if (SvTYPE(sv) != SVTYPEMASK) {
436 PerlIO_printf(Perl_debug_log, "****\n");
437 sv_dump(sv);
438 }
439}
758a08c3 440#endif
645c22ef
DM
441
442/*
443=for apidoc sv_report_used
444
445Dump the contents of all SVs not yet freed. (Debugging aid).
446
447=cut
448*/
449
8990e307 450void
864dbfa3 451Perl_sv_report_used(pTHX)
4561caa4 452{
ff270d3a 453#ifdef DEBUGGING
055972dc 454 visit(do_report_used, 0, 0);
96a5add6
AL
455#else
456 PERL_UNUSED_CONTEXT;
ff270d3a 457#endif
4561caa4
CS
458}
459
645c22ef
DM
460/* called by sv_clean_objs() for each live SV */
461
462static void
de37a194 463do_clean_objs(pTHX_ SV *const ref)
645c22ef 464{
97aff369 465 dVAR;
ea724faa
NC
466 assert (SvROK(ref));
467 {
823a54a3
AL
468 SV * const target = SvRV(ref);
469 if (SvOBJECT(target)) {
470 DEBUG_D((PerlIO_printf(Perl_debug_log, "Cleaning object ref:\n "), sv_dump(ref)));
471 if (SvWEAKREF(ref)) {
472 sv_del_backref(target, ref);
473 SvWEAKREF_off(ref);
474 SvRV_set(ref, NULL);
475 } else {
476 SvROK_off(ref);
477 SvRV_set(ref, NULL);
478 SvREFCNT_dec(target);
479 }
645c22ef
DM
480 }
481 }
482
483 /* XXX Might want to check arrays, etc. */
484}
485
645c22ef 486
e4487e9b
DM
487/* clear any slots in a GV which hold objects - except IO;
488 * called by sv_clean_objs() for each live GV */
489
645c22ef 490static void
f30de749 491do_clean_named_objs(pTHX_ SV *const sv)
645c22ef 492{
97aff369 493 dVAR;
57ef47cc 494 SV *obj;
ea724faa 495 assert(SvTYPE(sv) == SVt_PVGV);
d011219a 496 assert(isGV_with_GP(sv));
57ef47cc
DM
497 if (!GvGP(sv))
498 return;
499
500 /* freeing GP entries may indirectly free the current GV;
501 * hold onto it while we mess with the GP slots */
502 SvREFCNT_inc(sv);
503
504 if ( ((obj = GvSV(sv) )) && SvOBJECT(obj)) {
505 DEBUG_D((PerlIO_printf(Perl_debug_log,
506 "Cleaning named glob SV object:\n "), sv_dump(obj)));
507 GvSV(sv) = NULL;
508 SvREFCNT_dec(obj);
509 }
510 if ( ((obj = MUTABLE_SV(GvAV(sv)) )) && SvOBJECT(obj)) {
511 DEBUG_D((PerlIO_printf(Perl_debug_log,
512 "Cleaning named glob AV object:\n "), sv_dump(obj)));
513 GvAV(sv) = NULL;
514 SvREFCNT_dec(obj);
515 }
516 if ( ((obj = MUTABLE_SV(GvHV(sv)) )) && SvOBJECT(obj)) {
517 DEBUG_D((PerlIO_printf(Perl_debug_log,
518 "Cleaning named glob HV object:\n "), sv_dump(obj)));
519 GvHV(sv) = NULL;
520 SvREFCNT_dec(obj);
521 }
522 if ( ((obj = MUTABLE_SV(GvCV(sv)) )) && SvOBJECT(obj)) {
523 DEBUG_D((PerlIO_printf(Perl_debug_log,
524 "Cleaning named glob CV object:\n "), sv_dump(obj)));
c43ae56f 525 GvCV_set(sv, NULL);
57ef47cc
DM
526 SvREFCNT_dec(obj);
527 }
e4487e9b
DM
528 SvREFCNT_dec(sv); /* undo the inc above */
529}
530
68b590d9 531/* clear any IO slots in a GV which hold objects (except stderr, defout);
e4487e9b
DM
532 * called by sv_clean_objs() for each live GV */
533
534static void
535do_clean_named_io_objs(pTHX_ SV *const sv)
536{
537 dVAR;
538 SV *obj;
539 assert(SvTYPE(sv) == SVt_PVGV);
540 assert(isGV_with_GP(sv));
68b590d9 541 if (!GvGP(sv) || sv == (SV*)PL_stderrgv || sv == (SV*)PL_defoutgv)
e4487e9b
DM
542 return;
543
544 SvREFCNT_inc(sv);
57ef47cc
DM
545 if ( ((obj = MUTABLE_SV(GvIO(sv)) )) && SvOBJECT(obj)) {
546 DEBUG_D((PerlIO_printf(Perl_debug_log,
547 "Cleaning named glob IO object:\n "), sv_dump(obj)));
548 GvIOp(sv) = NULL;
549 SvREFCNT_dec(obj);
645c22ef 550 }
57ef47cc 551 SvREFCNT_dec(sv); /* undo the inc above */
645c22ef 552}
645c22ef 553
4155e4fe
FC
554/* Void wrapper to pass to visit() */
555static void
556do_curse(pTHX_ SV * const sv) {
c2910e6c
FC
557 if ((PL_stderrgv && GvGP(PL_stderrgv) && (SV*)GvIO(PL_stderrgv) == sv)
558 || (PL_defoutgv && GvGP(PL_defoutgv) && (SV*)GvIO(PL_defoutgv) == sv))
4155e4fe
FC
559 return;
560 (void)curse(sv, 0);
561}
562
645c22ef
DM
563/*
564=for apidoc sv_clean_objs
565
566Attempt to destroy all objects not yet freed
567
568=cut
569*/
570
4561caa4 571void
864dbfa3 572Perl_sv_clean_objs(pTHX)
4561caa4 573{
97aff369 574 dVAR;
68b590d9 575 GV *olddef, *olderr;
3280af22 576 PL_in_clean_objs = TRUE;
055972dc 577 visit(do_clean_objs, SVf_ROK, SVf_ROK);
e4487e9b
DM
578 /* Some barnacles may yet remain, clinging to typeglobs.
579 * Run the non-IO destructors first: they may want to output
580 * error messages, close files etc */
d011219a 581 visit(do_clean_named_objs, SVt_PVGV|SVpgv_GP, SVTYPEMASK|SVp_POK|SVpgv_GP);
e4487e9b 582 visit(do_clean_named_io_objs, SVt_PVGV|SVpgv_GP, SVTYPEMASK|SVp_POK|SVpgv_GP);
4155e4fe
FC
583 /* And if there are some very tenacious barnacles clinging to arrays,
584 closures, or what have you.... */
585 visit(do_curse, SVs_OBJECT, SVs_OBJECT);
68b590d9
DM
586 olddef = PL_defoutgv;
587 PL_defoutgv = NULL; /* disable skip of PL_defoutgv */
588 if (olddef && isGV_with_GP(olddef))
589 do_clean_named_io_objs(aTHX_ MUTABLE_SV(olddef));
590 olderr = PL_stderrgv;
591 PL_stderrgv = NULL; /* disable skip of PL_stderrgv */
592 if (olderr && isGV_with_GP(olderr))
593 do_clean_named_io_objs(aTHX_ MUTABLE_SV(olderr));
594 SvREFCNT_dec(olddef);
3280af22 595 PL_in_clean_objs = FALSE;
4561caa4
CS
596}
597
645c22ef
DM
598/* called by sv_clean_all() for each live SV */
599
600static void
de37a194 601do_clean_all(pTHX_ SV *const sv)
645c22ef 602{
97aff369 603 dVAR;
daba3364 604 if (sv == (const SV *) PL_fdpid || sv == (const SV *)PL_strtab) {
cddfcddc 605 /* don't clean pid table and strtab */
d17ea597 606 return;
cddfcddc 607 }
645c22ef
DM
608 DEBUG_D((PerlIO_printf(Perl_debug_log, "Cleaning loops: SV at 0x%"UVxf"\n", PTR2UV(sv)) ));
609 SvFLAGS(sv) |= SVf_BREAK;
610 SvREFCNT_dec(sv);
611}
612
613/*
614=for apidoc sv_clean_all
615
616Decrement the refcnt of each remaining SV, possibly triggering a
617cleanup. This function may have to be called multiple times to free
ff276b08 618SVs which are in complex self-referential hierarchies.
645c22ef
DM
619
620=cut
621*/
622
5226ed68 623I32
864dbfa3 624Perl_sv_clean_all(pTHX)
8990e307 625{
97aff369 626 dVAR;
5226ed68 627 I32 cleaned;
3280af22 628 PL_in_clean_all = TRUE;
055972dc 629 cleaned = visit(do_clean_all, 0,0);
5226ed68 630 return cleaned;
8990e307 631}
463ee0b2 632
5e258f8c
JC
633/*
634 ARENASETS: a meta-arena implementation which separates arena-info
635 into struct arena_set, which contains an array of struct
636 arena_descs, each holding info for a single arena. By separating
637 the meta-info from the arena, we recover the 1st slot, formerly
638 borrowed for list management. The arena_set is about the size of an
39244528 639 arena, avoiding the needless malloc overhead of a naive linked-list.
5e258f8c
JC
640
641 The cost is 1 arena-set malloc per ~320 arena-mallocs, + the unused
642 memory in the last arena-set (1/2 on average). In trade, we get
643 back the 1st slot in each arena (ie 1.7% of a CV-arena, less for
d2a0f284 644 smaller types). The recovery of the wasted space allows use of
e15dad31
JC
645 small arenas for large, rare body types, by changing array* fields
646 in body_details_by_type[] below.
5e258f8c 647*/
5e258f8c 648struct arena_desc {
398c677b
NC
649 char *arena; /* the raw storage, allocated aligned */
650 size_t size; /* its size ~4k typ */
e5973ed5 651 svtype utype; /* bodytype stored in arena */
5e258f8c
JC
652};
653
e6148039
NC
654struct arena_set;
655
656/* Get the maximum number of elements in set[] such that struct arena_set
e15dad31 657 will fit within PERL_ARENA_SIZE, which is probably just under 4K, and
e6148039
NC
658 therefore likely to be 1 aligned memory page. */
659
660#define ARENAS_PER_SET ((PERL_ARENA_SIZE - sizeof(struct arena_set*) \
661 - 2 * sizeof(int)) / sizeof (struct arena_desc))
5e258f8c
JC
662
663struct arena_set {
664 struct arena_set* next;
0a848332
NC
665 unsigned int set_size; /* ie ARENAS_PER_SET */
666 unsigned int curr; /* index of next available arena-desc */
5e258f8c
JC
667 struct arena_desc set[ARENAS_PER_SET];
668};
669
645c22ef
DM
670/*
671=for apidoc sv_free_arenas
672
673Deallocate the memory used by all arenas. Note that all the individual SV
674heads and bodies within the arenas must already have been freed.
675
676=cut
677*/
4633a7c4 678void
864dbfa3 679Perl_sv_free_arenas(pTHX)
4633a7c4 680{
97aff369 681 dVAR;
4633a7c4
LW
682 SV* sva;
683 SV* svanext;
0a848332 684 unsigned int i;
4633a7c4
LW
685
686 /* Free arenas here, but be careful about fake ones. (We assume
687 contiguity of the fake ones with the corresponding real ones.) */
688
3280af22 689 for (sva = PL_sv_arenaroot; sva; sva = svanext) {
daba3364 690 svanext = MUTABLE_SV(SvANY(sva));
4633a7c4 691 while (svanext && SvFAKE(svanext))
daba3364 692 svanext = MUTABLE_SV(SvANY(svanext));
4633a7c4
LW
693
694 if (!SvFAKE(sva))
1df70142 695 Safefree(sva);
4633a7c4 696 }
93e68bfb 697
5e258f8c 698 {
0a848332
NC
699 struct arena_set *aroot = (struct arena_set*) PL_body_arenas;
700
701 while (aroot) {
702 struct arena_set *current = aroot;
703 i = aroot->curr;
704 while (i--) {
5e258f8c
JC
705 assert(aroot->set[i].arena);
706 Safefree(aroot->set[i].arena);
707 }
0a848332
NC
708 aroot = aroot->next;
709 Safefree(current);
5e258f8c
JC
710 }
711 }
dc8220bf 712 PL_body_arenas = 0;
fdda85ca 713
0a848332
NC
714 i = PERL_ARENA_ROOTS_SIZE;
715 while (i--)
93e68bfb 716 PL_body_roots[i] = 0;
93e68bfb 717
3280af22
NIS
718 PL_sv_arenaroot = 0;
719 PL_sv_root = 0;
4633a7c4
LW
720}
721
bd81e77b
NC
722/*
723 Here are mid-level routines that manage the allocation of bodies out
724 of the various arenas. There are 5 kinds of arenas:
29489e7c 725
bd81e77b
NC
726 1. SV-head arenas, which are discussed and handled above
727 2. regular body arenas
728 3. arenas for reduced-size bodies
729 4. Hash-Entry arenas
29489e7c 730
bd81e77b
NC
731 Arena types 2 & 3 are chained by body-type off an array of
732 arena-root pointers, which is indexed by svtype. Some of the
733 larger/less used body types are malloced singly, since a large
734 unused block of them is wasteful. Also, several svtypes dont have
735 bodies; the data fits into the sv-head itself. The arena-root
736 pointer thus has a few unused root-pointers (which may be hijacked
737 later for arena types 4,5)
29489e7c 738
bd81e77b
NC
739 3 differs from 2 as an optimization; some body types have several
740 unused fields in the front of the structure (which are kept in-place
741 for consistency). These bodies can be allocated in smaller chunks,
742 because the leading fields arent accessed. Pointers to such bodies
743 are decremented to point at the unused 'ghost' memory, knowing that
744 the pointers are used with offsets to the real memory.
29489e7c 745
d2a0f284
JC
746
747=head1 SV-Body Allocation
748
749Allocation of SV-bodies is similar to SV-heads, differing as follows;
750the allocation mechanism is used for many body types, so is somewhat
751more complicated, it uses arena-sets, and has no need for still-live
752SV detection.
753
754At the outermost level, (new|del)_X*V macros return bodies of the
755appropriate type. These macros call either (new|del)_body_type or
756(new|del)_body_allocated macro pairs, depending on specifics of the
757type. Most body types use the former pair, the latter pair is used to
758allocate body types with "ghost fields".
759
760"ghost fields" are fields that are unused in certain types, and
69ba284b 761consequently don't need to actually exist. They are declared because
d2a0f284
JC
762they're part of a "base type", which allows use of functions as
763methods. The simplest examples are AVs and HVs, 2 aggregate types
764which don't use the fields which support SCALAR semantics.
765
69ba284b 766For these types, the arenas are carved up into appropriately sized
d2a0f284
JC
767chunks, we thus avoid wasted memory for those unaccessed members.
768When bodies are allocated, we adjust the pointer back in memory by the
69ba284b 769size of the part not allocated, so it's as if we allocated the full
d2a0f284
JC
770structure. (But things will all go boom if you write to the part that
771is "not there", because you'll be overwriting the last members of the
772preceding structure in memory.)
773
69ba284b
NC
774We calculate the correction using the STRUCT_OFFSET macro on the first
775member present. If the allocated structure is smaller (no initial NV
776actually allocated) then the net effect is to subtract the size of the NV
777from the pointer, to return a new pointer as if an initial NV were actually
778allocated. (We were using structures named *_allocated for this, but
779this turned out to be a subtle bug, because a structure without an NV
780could have a lower alignment constraint, but the compiler is allowed to
781optimised accesses based on the alignment constraint of the actual pointer
782to the full structure, for example, using a single 64 bit load instruction
783because it "knows" that two adjacent 32 bit members will be 8-byte aligned.)
d2a0f284
JC
784
785This is the same trick as was used for NV and IV bodies. Ironically it
786doesn't need to be used for NV bodies any more, because NV is now at
787the start of the structure. IV bodies don't need it either, because
788they are no longer allocated.
789
790In turn, the new_body_* allocators call S_new_body(), which invokes
791new_body_inline macro, which takes a lock, and takes a body off the
1e30fcd5 792linked list at PL_body_roots[sv_type], calling Perl_more_bodies() if
d2a0f284
JC
793necessary to refresh an empty list. Then the lock is released, and
794the body is returned.
795
99816f8d 796Perl_more_bodies allocates a new arena, and carves it up into an array of N
d2a0f284
JC
797bodies, which it strings into a linked list. It looks up arena-size
798and body-size from the body_details table described below, thus
799supporting the multiple body-types.
800
801If PURIFY is defined, or PERL_ARENA_SIZE=0, arenas are not used, and
802the (new|del)_X*V macros are mapped directly to malloc/free.
803
d2a0f284
JC
804For each sv-type, struct body_details bodies_by_type[] carries
805parameters which control these aspects of SV handling:
806
807Arena_size determines whether arenas are used for this body type, and if
808so, how big they are. PURIFY or PERL_ARENA_SIZE=0 set this field to
809zero, forcing individual mallocs and frees.
810
811Body_size determines how big a body is, and therefore how many fit into
812each arena. Offset carries the body-pointer adjustment needed for
69ba284b 813"ghost fields", and is used in *_allocated macros.
d2a0f284
JC
814
815But its main purpose is to parameterize info needed in
816Perl_sv_upgrade(). The info here dramatically simplifies the function
69ba284b 817vs the implementation in 5.8.8, making it table-driven. All fields
d2a0f284
JC
818are used for this, except for arena_size.
819
820For the sv-types that have no bodies, arenas are not used, so those
821PL_body_roots[sv_type] are unused, and can be overloaded. In
822something of a special case, SVt_NULL is borrowed for HE arenas;
c6f8b1d0 823PL_body_roots[HE_SVSLOT=SVt_NULL] is filled by S_more_he, but the
d2a0f284 824bodies_by_type[SVt_NULL] slot is not used, as the table is not
c6f8b1d0 825available in hv.c.
d2a0f284 826
29489e7c
DM
827*/
828
bd81e77b 829struct body_details {
0fb58b32 830 U8 body_size; /* Size to allocate */
10666ae3 831 U8 copy; /* Size of structure to copy (may be shorter) */
0fb58b32 832 U8 offset;
10666ae3
NC
833 unsigned int type : 4; /* We have space for a sanity check. */
834 unsigned int cant_upgrade : 1; /* Cannot upgrade this type */
835 unsigned int zero_nv : 1; /* zero the NV when upgrading from this */
836 unsigned int arena : 1; /* Allocated from an arena */
837 size_t arena_size; /* Size of arena to allocate */
bd81e77b 838};
29489e7c 839
bd81e77b
NC
840#define HADNV FALSE
841#define NONV TRUE
29489e7c 842
d2a0f284 843
bd81e77b
NC
844#ifdef PURIFY
845/* With -DPURFIY we allocate everything directly, and don't use arenas.
846 This seems a rather elegant way to simplify some of the code below. */
847#define HASARENA FALSE
848#else
849#define HASARENA TRUE
850#endif
851#define NOARENA FALSE
29489e7c 852
d2a0f284
JC
853/* Size the arenas to exactly fit a given number of bodies. A count
854 of 0 fits the max number bodies into a PERL_ARENA_SIZE.block,
855 simplifying the default. If count > 0, the arena is sized to fit
856 only that many bodies, allowing arenas to be used for large, rare
857 bodies (XPVFM, XPVIO) without undue waste. The arena size is
858 limited by PERL_ARENA_SIZE, so we can safely oversize the
859 declarations.
860 */
95db5f15
MB
861#define FIT_ARENA0(body_size) \
862 ((size_t)(PERL_ARENA_SIZE / body_size) * body_size)
863#define FIT_ARENAn(count,body_size) \
864 ( count * body_size <= PERL_ARENA_SIZE) \
865 ? count * body_size \
866 : FIT_ARENA0 (body_size)
867#define FIT_ARENA(count,body_size) \
868 count \
869 ? FIT_ARENAn (count, body_size) \
870 : FIT_ARENA0 (body_size)
d2a0f284 871
bd81e77b
NC
872/* Calculate the length to copy. Specifically work out the length less any
873 final padding the compiler needed to add. See the comment in sv_upgrade
874 for why copying the padding proved to be a bug. */
29489e7c 875
bd81e77b
NC
876#define copy_length(type, last_member) \
877 STRUCT_OFFSET(type, last_member) \
daba3364 878 + sizeof (((type*)SvANY((const SV *)0))->last_member)
29489e7c 879
bd81e77b 880static const struct body_details bodies_by_type[] = {
829cd18a
NC
881 /* HEs use this offset for their arena. */
882 { 0, 0, 0, SVt_NULL, FALSE, NONV, NOARENA, 0 },
d2a0f284 883
1cb9cd50 884 /* The bind placeholder pretends to be an RV for now.
c6f8b1d0 885 Also it's marked as "can't upgrade" to stop anyone using it before it's
1cb9cd50
NC
886 implemented. */
887 { 0, 0, 0, SVt_BIND, TRUE, NONV, NOARENA, 0 },
888
db93c0c4
NC
889 /* IVs are in the head, so the allocation size is 0. */
890 { 0,
d2a0f284 891 sizeof(IV), /* This is used to copy out the IV body. */
10666ae3 892 STRUCT_OFFSET(XPVIV, xiv_iv), SVt_IV, FALSE, NONV,
db93c0c4 893 NOARENA /* IVS don't need an arena */, 0
d2a0f284
JC
894 },
895
bd81e77b 896 /* 8 bytes on most ILP32 with IEEE doubles */
6e128786
NC
897 { sizeof(NV), sizeof(NV),
898 STRUCT_OFFSET(XPVNV, xnv_u),
899 SVt_NV, FALSE, HADNV, HASARENA, FIT_ARENA(0, sizeof(NV)) },
d2a0f284 900
bd81e77b 901 /* 8 bytes on most ILP32 with IEEE doubles */
bc337e5c 902 { sizeof(XPV) - STRUCT_OFFSET(XPV, xpv_cur),
889d28b2
NC
903 copy_length(XPV, xpv_len) - STRUCT_OFFSET(XPV, xpv_cur),
904 + STRUCT_OFFSET(XPV, xpv_cur),
69ba284b 905 SVt_PV, FALSE, NONV, HASARENA,
889d28b2 906 FIT_ARENA(0, sizeof(XPV) - STRUCT_OFFSET(XPV, xpv_cur)) },
d2a0f284 907
bd81e77b 908 /* 12 */
bc337e5c 909 { sizeof(XPVIV) - STRUCT_OFFSET(XPV, xpv_cur),
889d28b2
NC
910 copy_length(XPVIV, xiv_u) - STRUCT_OFFSET(XPV, xpv_cur),
911 + STRUCT_OFFSET(XPV, xpv_cur),
912 SVt_PVIV, FALSE, NONV, HASARENA,
913 FIT_ARENA(0, sizeof(XPVIV) - STRUCT_OFFSET(XPV, xpv_cur)) },
d2a0f284 914
889d28b2 915 /* 20 */
bc337e5c 916 { sizeof(XPVNV) - STRUCT_OFFSET(XPV, xpv_cur),
889d28b2
NC
917 copy_length(XPVNV, xnv_u) - STRUCT_OFFSET(XPV, xpv_cur),
918 + STRUCT_OFFSET(XPV, xpv_cur),
919 SVt_PVNV, FALSE, HADNV, HASARENA,
920 FIT_ARENA(0, sizeof(XPVNV) - STRUCT_OFFSET(XPV, xpv_cur)) },
d2a0f284 921
bd81e77b 922 /* 28 */
6e128786 923 { sizeof(XPVMG), copy_length(XPVMG, xnv_u), 0, SVt_PVMG, FALSE, HADNV,
d2a0f284 924 HASARENA, FIT_ARENA(0, sizeof(XPVMG)) },
4df7f6af 925
288b8c02 926 /* something big */
601dfd0a
NC
927 { sizeof(regexp),
928 sizeof(regexp),
929 0,
08e44740 930 SVt_REGEXP, FALSE, NONV, HASARENA,
eaeb1e7f 931 FIT_ARENA(0, sizeof(regexp))
5c35adbb 932 },
4df7f6af 933
bd81e77b 934 /* 48 */
10666ae3 935 { sizeof(XPVGV), sizeof(XPVGV), 0, SVt_PVGV, TRUE, HADNV,
d2a0f284
JC
936 HASARENA, FIT_ARENA(0, sizeof(XPVGV)) },
937
bd81e77b 938 /* 64 */
10666ae3 939 { sizeof(XPVLV), sizeof(XPVLV), 0, SVt_PVLV, TRUE, HADNV,
d2a0f284
JC
940 HASARENA, FIT_ARENA(0, sizeof(XPVLV)) },
941
601dfd0a 942 { sizeof(XPVAV),
4f7003f5 943 copy_length(XPVAV, xav_alloc),
601dfd0a 944 0,
69ba284b 945 SVt_PVAV, TRUE, NONV, HASARENA,
601dfd0a 946 FIT_ARENA(0, sizeof(XPVAV)) },
d2a0f284 947
601dfd0a 948 { sizeof(XPVHV),
359164a0 949 copy_length(XPVHV, xhv_max),
601dfd0a 950 0,
69ba284b 951 SVt_PVHV, TRUE, NONV, HASARENA,
601dfd0a 952 FIT_ARENA(0, sizeof(XPVHV)) },
d2a0f284 953
c84c4652 954 /* 56 */
601dfd0a
NC
955 { sizeof(XPVCV),
956 sizeof(XPVCV),
957 0,
69ba284b 958 SVt_PVCV, TRUE, NONV, HASARENA,
601dfd0a 959 FIT_ARENA(0, sizeof(XPVCV)) },
69ba284b 960
601dfd0a
NC
961 { sizeof(XPVFM),
962 sizeof(XPVFM),
963 0,
69ba284b 964 SVt_PVFM, TRUE, NONV, NOARENA,
601dfd0a 965 FIT_ARENA(20, sizeof(XPVFM)) },
d2a0f284
JC
966
967 /* XPVIO is 84 bytes, fits 48x */
601dfd0a
NC
968 { sizeof(XPVIO),
969 sizeof(XPVIO),
970 0,
b6f60916 971 SVt_PVIO, TRUE, NONV, HASARENA,
601dfd0a 972 FIT_ARENA(24, sizeof(XPVIO)) },
bd81e77b 973};
29489e7c 974
bd81e77b 975#define new_body_allocated(sv_type) \
d2a0f284 976 (void *)((char *)S_new_body(aTHX_ sv_type) \
bd81e77b 977 - bodies_by_type[sv_type].offset)
29489e7c 978
26359cfa
NC
979/* return a thing to the free list */
980
981#define del_body(thing, root) \
982 STMT_START { \
983 void ** const thing_copy = (void **)thing; \
984 *thing_copy = *root; \
985 *root = (void*)thing_copy; \
986 } STMT_END
29489e7c 987
bd81e77b 988#ifdef PURIFY
29489e7c 989
beeec492
NC
990#define new_XNV() safemalloc(sizeof(XPVNV))
991#define new_XPVNV() safemalloc(sizeof(XPVNV))
992#define new_XPVMG() safemalloc(sizeof(XPVMG))
29489e7c 993
beeec492 994#define del_XPVGV(p) safefree(p)
29489e7c 995
bd81e77b 996#else /* !PURIFY */
29489e7c 997
65ac1738 998#define new_XNV() new_body_allocated(SVt_NV)
65ac1738 999#define new_XPVNV() new_body_allocated(SVt_PVNV)
65ac1738 1000#define new_XPVMG() new_body_allocated(SVt_PVMG)
645c22ef 1001
26359cfa
NC
1002#define del_XPVGV(p) del_body(p + bodies_by_type[SVt_PVGV].offset, \
1003 &PL_body_roots[SVt_PVGV])
1d7c1841 1004
bd81e77b 1005#endif /* PURIFY */
93e68bfb 1006
bd81e77b 1007/* no arena for you! */
93e68bfb 1008
bd81e77b 1009#define new_NOARENA(details) \
beeec492 1010 safemalloc((details)->body_size + (details)->offset)
bd81e77b 1011#define new_NOARENAZ(details) \
beeec492 1012 safecalloc((details)->body_size + (details)->offset, 1)
d2a0f284 1013
1e30fcd5
NC
1014void *
1015Perl_more_bodies (pTHX_ const svtype sv_type, const size_t body_size,
1016 const size_t arena_size)
d2a0f284
JC
1017{
1018 dVAR;
1019 void ** const root = &PL_body_roots[sv_type];
99816f8d
NC
1020 struct arena_desc *adesc;
1021 struct arena_set *aroot = (struct arena_set *) PL_body_arenas;
1022 unsigned int curr;
d2a0f284
JC
1023 char *start;
1024 const char *end;
02982131 1025 const size_t good_arena_size = Perl_malloc_good_size(arena_size);
0b2d3faa 1026#if defined(DEBUGGING) && !defined(PERL_GLOBAL_STRUCT_PRIVATE)
23e9d66c
NC
1027 static bool done_sanity_check;
1028
0b2d3faa
JH
1029 /* PERL_GLOBAL_STRUCT_PRIVATE cannot coexist with global
1030 * variables like done_sanity_check. */
10666ae3 1031 if (!done_sanity_check) {
ea471437 1032 unsigned int i = SVt_LAST;
10666ae3
NC
1033
1034 done_sanity_check = TRUE;
1035
1036 while (i--)
1037 assert (bodies_by_type[i].type == i);
1038 }
1039#endif
1040
02982131 1041 assert(arena_size);
23e9d66c 1042
99816f8d
NC
1043 /* may need new arena-set to hold new arena */
1044 if (!aroot || aroot->curr >= aroot->set_size) {
1045 struct arena_set *newroot;
1046 Newxz(newroot, 1, struct arena_set);
1047 newroot->set_size = ARENAS_PER_SET;
1048 newroot->next = aroot;
1049 aroot = newroot;
1050 PL_body_arenas = (void *) newroot;
1051 DEBUG_m(PerlIO_printf(Perl_debug_log, "new arenaset %p\n", (void*)aroot));
1052 }
1053
1054 /* ok, now have arena-set with at least 1 empty/available arena-desc */
1055 curr = aroot->curr++;
1056 adesc = &(aroot->set[curr]);
1057 assert(!adesc->arena);
1058
1059 Newx(adesc->arena, good_arena_size, char);
1060 adesc->size = good_arena_size;
1061 adesc->utype = sv_type;
1062 DEBUG_m(PerlIO_printf(Perl_debug_log, "arena %d added: %p size %"UVuf"\n",
1063 curr, (void*)adesc->arena, (UV)good_arena_size));
1064
1065 start = (char *) adesc->arena;
d2a0f284 1066
29657bb6
NC
1067 /* Get the address of the byte after the end of the last body we can fit.
1068 Remember, this is integer division: */
02982131 1069 end = start + good_arena_size / body_size * body_size;
d2a0f284 1070
486ec47a 1071 /* computed count doesn't reflect the 1st slot reservation */
d8fca402
NC
1072#if defined(MYMALLOC) || defined(HAS_MALLOC_GOOD_SIZE)
1073 DEBUG_m(PerlIO_printf(Perl_debug_log,
1074 "arena %p end %p arena-size %d (from %d) type %d "
1075 "size %d ct %d\n",
02982131
NC
1076 (void*)start, (void*)end, (int)good_arena_size,
1077 (int)arena_size, sv_type, (int)body_size,
1078 (int)good_arena_size / (int)body_size));
d8fca402 1079#else
d2a0f284
JC
1080 DEBUG_m(PerlIO_printf(Perl_debug_log,
1081 "arena %p end %p arena-size %d type %d size %d ct %d\n",
6c9570dc 1082 (void*)start, (void*)end,
02982131
NC
1083 (int)arena_size, sv_type, (int)body_size,
1084 (int)good_arena_size / (int)body_size));
d8fca402 1085#endif
d2a0f284
JC
1086 *root = (void *)start;
1087
29657bb6
NC
1088 while (1) {
1089 /* Where the next body would start: */
d2a0f284 1090 char * const next = start + body_size;
29657bb6
NC
1091
1092 if (next >= end) {
1093 /* This is the last body: */
1094 assert(next == end);
1095
1096 *(void **)start = 0;
1097 return *root;
1098 }
1099
d2a0f284
JC
1100 *(void**) start = (void *)next;
1101 start = next;
1102 }
d2a0f284
JC
1103}
1104
1105/* grab a new thing from the free list, allocating more if necessary.
1106 The inline version is used for speed in hot routines, and the
1107 function using it serves the rest (unless PURIFY).
1108*/
1109#define new_body_inline(xpv, sv_type) \
1110 STMT_START { \
1111 void ** const r3wt = &PL_body_roots[sv_type]; \
11b79775 1112 xpv = (PTR_TBL_ENT_t*) (*((void **)(r3wt)) \
1e30fcd5 1113 ? *((void **)(r3wt)) : Perl_more_bodies(aTHX_ sv_type, \
02982131
NC
1114 bodies_by_type[sv_type].body_size,\
1115 bodies_by_type[sv_type].arena_size)); \
d2a0f284 1116 *(r3wt) = *(void**)(xpv); \
d2a0f284
JC
1117 } STMT_END
1118
1119#ifndef PURIFY
1120
1121STATIC void *
de37a194 1122S_new_body(pTHX_ const svtype sv_type)
d2a0f284
JC
1123{
1124 dVAR;
1125 void *xpv;
1126 new_body_inline(xpv, sv_type);
1127 return xpv;
1128}
1129
1130#endif
93e68bfb 1131
238b27b3
NC
1132static const struct body_details fake_rv =
1133 { 0, 0, 0, SVt_IV, FALSE, NONV, NOARENA, 0 };
1134
bd81e77b
NC
1135/*
1136=for apidoc sv_upgrade
93e68bfb 1137
bd81e77b
NC
1138Upgrade an SV to a more complex form. Generally adds a new body type to the
1139SV, then copies across as much information as possible from the old body.
1140You generally want to use the C<SvUPGRADE> macro wrapper. See also C<svtype>.
93e68bfb 1141
bd81e77b 1142=cut
93e68bfb 1143*/
93e68bfb 1144
bd81e77b 1145void
aad570aa 1146Perl_sv_upgrade(pTHX_ register SV *const sv, svtype new_type)
cac9b346 1147{
97aff369 1148 dVAR;
bd81e77b
NC
1149 void* old_body;
1150 void* new_body;
42d0e0b7 1151 const svtype old_type = SvTYPE(sv);
d2a0f284 1152 const struct body_details *new_type_details;
238b27b3 1153 const struct body_details *old_type_details
bd81e77b 1154 = bodies_by_type + old_type;
4df7f6af 1155 SV *referant = NULL;
cac9b346 1156
7918f24d
NC
1157 PERL_ARGS_ASSERT_SV_UPGRADE;
1158
1776cbe8
NC
1159 if (old_type == new_type)
1160 return;
1161
1162 /* This clause was purposefully added ahead of the early return above to
1163 the shared string hackery for (sort {$a <=> $b} keys %hash), with the
1164 inference by Nick I-S that it would fix other troublesome cases. See
1165 changes 7162, 7163 (f130fd4589cf5fbb24149cd4db4137c8326f49c1 and parent)
1166
1167 Given that shared hash key scalars are no longer PVIV, but PV, there is
1168 no longer need to unshare so as to free up the IVX slot for its proper
1169 purpose. So it's safe to move the early return earlier. */
1170
bd81e77b
NC
1171 if (new_type != SVt_PV && SvIsCOW(sv)) {
1172 sv_force_normal_flags(sv, 0);
1173 }
cac9b346 1174
bd81e77b 1175 old_body = SvANY(sv);
de042e1d 1176
bd81e77b
NC
1177 /* Copying structures onto other structures that have been neatly zeroed
1178 has a subtle gotcha. Consider XPVMG
cac9b346 1179
bd81e77b
NC
1180 +------+------+------+------+------+-------+-------+
1181 | NV | CUR | LEN | IV | MAGIC | STASH |
1182 +------+------+------+------+------+-------+-------+
1183 0 4 8 12 16 20 24 28
645c22ef 1184
bd81e77b
NC
1185 where NVs are aligned to 8 bytes, so that sizeof that structure is
1186 actually 32 bytes long, with 4 bytes of padding at the end:
08742458 1187
bd81e77b
NC
1188 +------+------+------+------+------+-------+-------+------+
1189 | NV | CUR | LEN | IV | MAGIC | STASH | ??? |
1190 +------+------+------+------+------+-------+-------+------+
1191 0 4 8 12 16 20 24 28 32
08742458 1192
bd81e77b 1193 so what happens if you allocate memory for this structure:
30f9da9e 1194
bd81e77b
NC
1195 +------+------+------+------+------+-------+-------+------+------+...
1196 | NV | CUR | LEN | IV | MAGIC | STASH | GP | NAME |
1197 +------+------+------+------+------+-------+-------+------+------+...
1198 0 4 8 12 16 20 24 28 32 36
bfc44f79 1199
bd81e77b
NC
1200 zero it, then copy sizeof(XPVMG) bytes on top of it? Not quite what you
1201 expect, because you copy the area marked ??? onto GP. Now, ??? may have
1202 started out as zero once, but it's quite possible that it isn't. So now,
1203 rather than a nicely zeroed GP, you have it pointing somewhere random.
1204 Bugs ensue.
bfc44f79 1205
bd81e77b
NC
1206 (In fact, GP ends up pointing at a previous GP structure, because the
1207 principle cause of the padding in XPVMG getting garbage is a copy of
6c9e42f7
NC
1208 sizeof(XPVMG) bytes from a XPVGV structure in sv_unglob. Right now
1209 this happens to be moot because XPVGV has been re-ordered, with GP
1210 no longer after STASH)
30f9da9e 1211
bd81e77b
NC
1212 So we are careful and work out the size of used parts of all the
1213 structures. */
bfc44f79 1214
bd81e77b
NC
1215 switch (old_type) {
1216 case SVt_NULL:
1217 break;
1218 case SVt_IV:
4df7f6af
NC
1219 if (SvROK(sv)) {
1220 referant = SvRV(sv);
238b27b3
NC
1221 old_type_details = &fake_rv;
1222 if (new_type == SVt_NV)
1223 new_type = SVt_PVNV;
4df7f6af
NC
1224 } else {
1225 if (new_type < SVt_PVIV) {
1226 new_type = (new_type == SVt_NV)
1227 ? SVt_PVNV : SVt_PVIV;
1228 }
bd81e77b
NC
1229 }
1230 break;
1231 case SVt_NV:
1232 if (new_type < SVt_PVNV) {
1233 new_type = SVt_PVNV;
bd81e77b
NC
1234 }
1235 break;
bd81e77b
NC
1236 case SVt_PV:
1237 assert(new_type > SVt_PV);
1238 assert(SVt_IV < SVt_PV);
1239 assert(SVt_NV < SVt_PV);
1240 break;
1241 case SVt_PVIV:
1242 break;
1243 case SVt_PVNV:
1244 break;
1245 case SVt_PVMG:
1246 /* Because the XPVMG of PL_mess_sv isn't allocated from the arena,
1247 there's no way that it can be safely upgraded, because perl.c
1248 expects to Safefree(SvANY(PL_mess_sv)) */
1249 assert(sv != PL_mess_sv);
1250 /* This flag bit is used to mean other things in other scalar types.
1251 Given that it only has meaning inside the pad, it shouldn't be set
1252 on anything that can get upgraded. */
00b1698f 1253 assert(!SvPAD_TYPED(sv));
bd81e77b
NC
1254 break;
1255 default:
1256 if (old_type_details->cant_upgrade)
c81225bc
NC
1257 Perl_croak(aTHX_ "Can't upgrade %s (%" UVuf ") to %" UVuf,
1258 sv_reftype(sv, 0), (UV) old_type, (UV) new_type);
bd81e77b 1259 }
3376de98
NC
1260
1261 if (old_type > new_type)
1262 Perl_croak(aTHX_ "sv_upgrade from type %d down to type %d",
1263 (int)old_type, (int)new_type);
1264
2fa1109b 1265 new_type_details = bodies_by_type + new_type;
645c22ef 1266
bd81e77b
NC
1267 SvFLAGS(sv) &= ~SVTYPEMASK;
1268 SvFLAGS(sv) |= new_type;
932e9ff9 1269
ab4416c0
NC
1270 /* This can't happen, as SVt_NULL is <= all values of new_type, so one of
1271 the return statements above will have triggered. */
1272 assert (new_type != SVt_NULL);
bd81e77b 1273 switch (new_type) {
bd81e77b
NC
1274 case SVt_IV:
1275 assert(old_type == SVt_NULL);
1276 SvANY(sv) = (XPVIV*)((char*)&(sv->sv_u.svu_iv) - STRUCT_OFFSET(XPVIV, xiv_iv));
1277 SvIV_set(sv, 0);
1278 return;
1279 case SVt_NV:
1280 assert(old_type == SVt_NULL);
1281 SvANY(sv) = new_XNV();
1282 SvNV_set(sv, 0);
1283 return;
bd81e77b 1284 case SVt_PVHV:
bd81e77b 1285 case SVt_PVAV:
d2a0f284 1286 assert(new_type_details->body_size);
c1ae03ae
NC
1287
1288#ifndef PURIFY
1289 assert(new_type_details->arena);
d2a0f284 1290 assert(new_type_details->arena_size);
c1ae03ae 1291 /* This points to the start of the allocated area. */
d2a0f284
JC
1292 new_body_inline(new_body, new_type);
1293 Zero(new_body, new_type_details->body_size, char);
c1ae03ae
NC
1294 new_body = ((char *)new_body) - new_type_details->offset;
1295#else
1296 /* We always allocated the full length item with PURIFY. To do this
1297 we fake things so that arena is false for all 16 types.. */
1298 new_body = new_NOARENAZ(new_type_details);
1299#endif
1300 SvANY(sv) = new_body;
1301 if (new_type == SVt_PVAV) {
1302 AvMAX(sv) = -1;
1303 AvFILLp(sv) = -1;
1304 AvREAL_only(sv);
64484faa 1305 if (old_type_details->body_size) {
ac572bf4
NC
1306 AvALLOC(sv) = 0;
1307 } else {
1308 /* It will have been zeroed when the new body was allocated.
1309 Lets not write to it, in case it confuses a write-back
1310 cache. */
1311 }
78ac7dd9
NC
1312 } else {
1313 assert(!SvOK(sv));
1314 SvOK_off(sv);
1315#ifndef NODEFAULT_SHAREKEYS
1316 HvSHAREKEYS_on(sv); /* key-sharing on by default */
1317#endif
1318 HvMAX(sv) = 7; /* (start with 8 buckets) */
c1ae03ae 1319 }
aeb18a1e 1320
bd81e77b
NC
1321 /* SVt_NULL isn't the only thing upgraded to AV or HV.
1322 The target created by newSVrv also is, and it can have magic.
1323 However, it never has SvPVX set.
1324 */
4df7f6af
NC
1325 if (old_type == SVt_IV) {
1326 assert(!SvROK(sv));
1327 } else if (old_type >= SVt_PV) {
bd81e77b
NC
1328 assert(SvPVX_const(sv) == 0);
1329 }
aeb18a1e 1330
bd81e77b 1331 if (old_type >= SVt_PVMG) {
e736a858 1332 SvMAGIC_set(sv, ((XPVMG*)old_body)->xmg_u.xmg_magic);
bd81e77b 1333 SvSTASH_set(sv, ((XPVMG*)old_body)->xmg_stash);
797c7171
NC
1334 } else {
1335 sv->sv_u.svu_array = NULL; /* or svu_hash */
bd81e77b
NC
1336 }
1337 break;
93e68bfb 1338
93e68bfb 1339
b9ad13ac
NC
1340 case SVt_REGEXP:
1341 /* This ensures that SvTHINKFIRST(sv) is true, and hence that
1342 sv_force_normal_flags(sv) is called. */
1343 SvFAKE_on(sv);
bd81e77b
NC
1344 case SVt_PVIV:
1345 /* XXX Is this still needed? Was it ever needed? Surely as there is
1346 no route from NV to PVIV, NOK can never be true */
1347 assert(!SvNOKp(sv));
1348 assert(!SvNOK(sv));
1349 case SVt_PVIO:
1350 case SVt_PVFM:
bd81e77b
NC
1351 case SVt_PVGV:
1352 case SVt_PVCV:
1353 case SVt_PVLV:
1354 case SVt_PVMG:
1355 case SVt_PVNV:
1356 case SVt_PV:
93e68bfb 1357
d2a0f284 1358 assert(new_type_details->body_size);
bd81e77b
NC
1359 /* We always allocated the full length item with PURIFY. To do this
1360 we fake things so that arena is false for all 16 types.. */
1361 if(new_type_details->arena) {
1362 /* This points to the start of the allocated area. */
d2a0f284
JC
1363 new_body_inline(new_body, new_type);
1364 Zero(new_body, new_type_details->body_size, char);
bd81e77b
NC
1365 new_body = ((char *)new_body) - new_type_details->offset;
1366 } else {
1367 new_body = new_NOARENAZ(new_type_details);
1368 }
1369 SvANY(sv) = new_body;
5e2fc214 1370
bd81e77b 1371 if (old_type_details->copy) {
f9ba3d20
NC
1372 /* There is now the potential for an upgrade from something without
1373 an offset (PVNV or PVMG) to something with one (PVCV, PVFM) */
1374 int offset = old_type_details->offset;
1375 int length = old_type_details->copy;
1376
1377 if (new_type_details->offset > old_type_details->offset) {
d4c19fe8 1378 const int difference
f9ba3d20
NC
1379 = new_type_details->offset - old_type_details->offset;
1380 offset += difference;
1381 length -= difference;
1382 }
1383 assert (length >= 0);
1384
1385 Copy((char *)old_body + offset, (char *)new_body + offset, length,
1386 char);
bd81e77b
NC
1387 }
1388
1389#ifndef NV_ZERO_IS_ALLBITS_ZERO
f2524eef 1390 /* If NV 0.0 is stores as all bits 0 then Zero() already creates a
e5ce394c
NC
1391 * correct 0.0 for us. Otherwise, if the old body didn't have an
1392 * NV slot, but the new one does, then we need to initialise the
1393 * freshly created NV slot with whatever the correct bit pattern is
1394 * for 0.0 */
e22a937e
NC
1395 if (old_type_details->zero_nv && !new_type_details->zero_nv
1396 && !isGV_with_GP(sv))
bd81e77b 1397 SvNV_set(sv, 0);
82048762 1398#endif
5e2fc214 1399
85dca89a
NC
1400 if (new_type == SVt_PVIO) {
1401 IO * const io = MUTABLE_IO(sv);
d963bf01 1402 GV *iogv = gv_fetchpvs("IO::File::", GV_ADD, SVt_PVHV);
85dca89a
NC
1403
1404 SvOBJECT_on(io);
1405 /* Clear the stashcache because a new IO could overrule a package
1406 name */
1407 hv_clear(PL_stashcache);
1408
85dca89a 1409 SvSTASH_set(io, MUTABLE_HV(SvREFCNT_inc(GvHV(iogv))));
f2524eef 1410 IoPAGE_LEN(sv) = 60;
85dca89a 1411 }
4df7f6af
NC
1412 if (old_type < SVt_PV) {
1413 /* referant will be NULL unless the old type was SVt_IV emulating
1414 SVt_RV */
1415 sv->sv_u.svu_rv = referant;
1416 }
bd81e77b
NC
1417 break;
1418 default:
afd78fd5
JH
1419 Perl_croak(aTHX_ "panic: sv_upgrade to unknown type %lu",
1420 (unsigned long)new_type);
bd81e77b 1421 }
73171d91 1422
db93c0c4 1423 if (old_type > SVt_IV) {
bd81e77b 1424#ifdef PURIFY
beeec492 1425 safefree(old_body);
bd81e77b 1426#else
bc786448
GG
1427 /* Note that there is an assumption that all bodies of types that
1428 can be upgraded came from arenas. Only the more complex non-
1429 upgradable types are allowed to be directly malloc()ed. */
1430 assert(old_type_details->arena);
bd81e77b
NC
1431 del_body((void*)((char*)old_body + old_type_details->offset),
1432 &PL_body_roots[old_type]);
1433#endif
1434 }
1435}
73171d91 1436
bd81e77b
NC
1437/*
1438=for apidoc sv_backoff
73171d91 1439
bd81e77b
NC
1440Remove any string offset. You should normally use the C<SvOOK_off> macro
1441wrapper instead.
73171d91 1442
bd81e77b 1443=cut
73171d91
NC
1444*/
1445
bd81e77b 1446int
aad570aa 1447Perl_sv_backoff(pTHX_ register SV *const sv)
bd81e77b 1448{
69240efd 1449 STRLEN delta;
7a4bba22 1450 const char * const s = SvPVX_const(sv);
7918f24d
NC
1451
1452 PERL_ARGS_ASSERT_SV_BACKOFF;
96a5add6 1453 PERL_UNUSED_CONTEXT;
7918f24d 1454
bd81e77b
NC
1455 assert(SvOOK(sv));
1456 assert(SvTYPE(sv) != SVt_PVHV);
1457 assert(SvTYPE(sv) != SVt_PVAV);
7a4bba22 1458
69240efd
NC
1459 SvOOK_offset(sv, delta);
1460
7a4bba22
NC
1461 SvLEN_set(sv, SvLEN(sv) + delta);
1462 SvPV_set(sv, SvPVX(sv) - delta);
1463 Move(s, SvPVX(sv), SvCUR(sv)+1, char);
bd81e77b
NC
1464 SvFLAGS(sv) &= ~SVf_OOK;
1465 return 0;
1466}
73171d91 1467
bd81e77b
NC
1468/*
1469=for apidoc sv_grow
73171d91 1470
bd81e77b
NC
1471Expands the character buffer in the SV. If necessary, uses C<sv_unref> and
1472upgrades the SV to C<SVt_PV>. Returns a pointer to the character buffer.
1473Use the C<SvGROW> wrapper instead.
93e68bfb 1474
bd81e77b
NC
1475=cut
1476*/
93e68bfb 1477
bd81e77b 1478char *
aad570aa 1479Perl_sv_grow(pTHX_ register SV *const sv, register STRLEN newlen)
bd81e77b
NC
1480{
1481 register char *s;
93e68bfb 1482
7918f24d
NC
1483 PERL_ARGS_ASSERT_SV_GROW;
1484
5db06880
NC
1485 if (PL_madskills && newlen >= 0x100000) {
1486 PerlIO_printf(Perl_debug_log,
1487 "Allocation too large: %"UVxf"\n", (UV)newlen);
1488 }
bd81e77b
NC
1489#ifdef HAS_64K_LIMIT
1490 if (newlen >= 0x10000) {
1491 PerlIO_printf(Perl_debug_log,
1492 "Allocation too large: %"UVxf"\n", (UV)newlen);
1493 my_exit(1);
1494 }
1495#endif /* HAS_64K_LIMIT */
1496 if (SvROK(sv))
1497 sv_unref(sv);
1498 if (SvTYPE(sv) < SVt_PV) {
1499 sv_upgrade(sv, SVt_PV);
1500 s = SvPVX_mutable(sv);
1501 }
1502 else if (SvOOK(sv)) { /* pv is offset? */
1503 sv_backoff(sv);
1504 s = SvPVX_mutable(sv);
1505 if (newlen > SvLEN(sv))
1506 newlen += 10 * (newlen - SvCUR(sv)); /* avoid copy each time */
1507#ifdef HAS_64K_LIMIT
1508 if (newlen >= 0x10000)
1509 newlen = 0xFFFF;
1510#endif
1511 }
1512 else
1513 s = SvPVX_mutable(sv);
aeb18a1e 1514
bd81e77b 1515 if (newlen > SvLEN(sv)) { /* need more room? */
f1200559
WH
1516 STRLEN minlen = SvCUR(sv);
1517 minlen += (minlen >> PERL_STRLEN_EXPAND_SHIFT) + 10;
1518 if (newlen < minlen)
1519 newlen = minlen;
aedff202 1520#ifndef Perl_safesysmalloc_size
bd81e77b 1521 newlen = PERL_STRLEN_ROUNDUP(newlen);
bd81e77b 1522#endif
98653f18 1523 if (SvLEN(sv) && s) {
10edeb5d 1524 s = (char*)saferealloc(s, newlen);
bd81e77b
NC
1525 }
1526 else {
10edeb5d 1527 s = (char*)safemalloc(newlen);
bd81e77b
NC
1528 if (SvPVX_const(sv) && SvCUR(sv)) {
1529 Move(SvPVX_const(sv), s, (newlen < SvCUR(sv)) ? newlen : SvCUR(sv), char);
1530 }
1531 }
1532 SvPV_set(sv, s);
ca7c1a29 1533#ifdef Perl_safesysmalloc_size
98653f18
NC
1534 /* Do this here, do it once, do it right, and then we will never get
1535 called back into sv_grow() unless there really is some growing
1536 needed. */
ca7c1a29 1537 SvLEN_set(sv, Perl_safesysmalloc_size(s));
98653f18 1538#else
bd81e77b 1539 SvLEN_set(sv, newlen);
98653f18 1540#endif
bd81e77b
NC
1541 }
1542 return s;
1543}
aeb18a1e 1544
bd81e77b
NC
1545/*
1546=for apidoc sv_setiv
932e9ff9 1547
bd81e77b
NC
1548Copies an integer into the given SV, upgrading first if necessary.
1549Does not handle 'set' magic. See also C<sv_setiv_mg>.
463ee0b2 1550
bd81e77b
NC
1551=cut
1552*/
463ee0b2 1553
bd81e77b 1554void
aad570aa 1555Perl_sv_setiv(pTHX_ register SV *const sv, const IV i)
bd81e77b 1556{
97aff369 1557 dVAR;
7918f24d
NC
1558
1559 PERL_ARGS_ASSERT_SV_SETIV;
1560
bd81e77b
NC
1561 SV_CHECK_THINKFIRST_COW_DROP(sv);
1562 switch (SvTYPE(sv)) {
1563 case SVt_NULL:
bd81e77b 1564 case SVt_NV:
3376de98 1565 sv_upgrade(sv, SVt_IV);
bd81e77b 1566 break;
bd81e77b
NC
1567 case SVt_PV:
1568 sv_upgrade(sv, SVt_PVIV);
1569 break;
463ee0b2 1570
bd81e77b 1571 case SVt_PVGV:
6e592b3a
BM
1572 if (!isGV_with_GP(sv))
1573 break;
bd81e77b
NC
1574 case SVt_PVAV:
1575 case SVt_PVHV:
1576 case SVt_PVCV:
1577 case SVt_PVFM:
1578 case SVt_PVIO:
22e74366 1579 /* diag_listed_as: Can't coerce %s to %s in %s */
bd81e77b
NC
1580 Perl_croak(aTHX_ "Can't coerce %s to integer in %s", sv_reftype(sv,0),
1581 OP_DESC(PL_op));
42d0e0b7 1582 default: NOOP;
bd81e77b
NC
1583 }
1584 (void)SvIOK_only(sv); /* validate number */
1585 SvIV_set(sv, i);
1586 SvTAINT(sv);
1587}
932e9ff9 1588
bd81e77b
NC
1589/*
1590=for apidoc sv_setiv_mg
d33b2eba 1591
bd81e77b 1592Like C<sv_setiv>, but also handles 'set' magic.
1c846c1f 1593
bd81e77b
NC
1594=cut
1595*/
d33b2eba 1596
bd81e77b 1597void
aad570aa 1598Perl_sv_setiv_mg(pTHX_ register SV *const sv, const IV i)
bd81e77b 1599{
7918f24d
NC
1600 PERL_ARGS_ASSERT_SV_SETIV_MG;
1601
bd81e77b
NC
1602 sv_setiv(sv,i);
1603 SvSETMAGIC(sv);
1604}
727879eb 1605
bd81e77b
NC
1606/*
1607=for apidoc sv_setuv
d33b2eba 1608
bd81e77b
NC
1609Copies an unsigned integer into the given SV, upgrading first if necessary.
1610Does not handle 'set' magic. See also C<sv_setuv_mg>.
9b94d1dd 1611
bd81e77b
NC
1612=cut
1613*/
d33b2eba 1614
bd81e77b 1615void
aad570aa 1616Perl_sv_setuv(pTHX_ register SV *const sv, const UV u)
bd81e77b 1617{
7918f24d
NC
1618 PERL_ARGS_ASSERT_SV_SETUV;
1619
bd81e77b
NC
1620 /* With these two if statements:
1621 u=1.49 s=0.52 cu=72.49 cs=10.64 scripts=270 tests=20865
d33b2eba 1622
bd81e77b
NC
1623 without
1624 u=1.35 s=0.47 cu=73.45 cs=11.43 scripts=270 tests=20865
1c846c1f 1625
bd81e77b
NC
1626 If you wish to remove them, please benchmark to see what the effect is
1627 */
1628 if (u <= (UV)IV_MAX) {
1629 sv_setiv(sv, (IV)u);
1630 return;
1631 }
1632 sv_setiv(sv, 0);
1633 SvIsUV_on(sv);
1634 SvUV_set(sv, u);
1635}
d33b2eba 1636
bd81e77b
NC
1637/*
1638=for apidoc sv_setuv_mg
727879eb 1639
bd81e77b 1640Like C<sv_setuv>, but also handles 'set' magic.
9b94d1dd 1641
bd81e77b
NC
1642=cut
1643*/
5e2fc214 1644
bd81e77b 1645void
aad570aa 1646Perl_sv_setuv_mg(pTHX_ register SV *const sv, const UV u)
bd81e77b 1647{
7918f24d
NC
1648 PERL_ARGS_ASSERT_SV_SETUV_MG;
1649
bd81e77b
NC
1650 sv_setuv(sv,u);
1651 SvSETMAGIC(sv);
1652}
5e2fc214 1653
954c1994 1654/*
bd81e77b 1655=for apidoc sv_setnv
954c1994 1656
bd81e77b
NC
1657Copies a double into the given SV, upgrading first if necessary.
1658Does not handle 'set' magic. See also C<sv_setnv_mg>.
954c1994
GS
1659
1660=cut
1661*/
1662
63f97190 1663void
aad570aa 1664Perl_sv_setnv(pTHX_ register SV *const sv, const NV num)
79072805 1665{
97aff369 1666 dVAR;
7918f24d
NC
1667
1668 PERL_ARGS_ASSERT_SV_SETNV;
1669
bd81e77b
NC
1670 SV_CHECK_THINKFIRST_COW_DROP(sv);
1671 switch (SvTYPE(sv)) {
79072805 1672 case SVt_NULL:
79072805 1673 case SVt_IV:
bd81e77b 1674 sv_upgrade(sv, SVt_NV);
79072805
LW
1675 break;
1676 case SVt_PV:
79072805 1677 case SVt_PVIV:
bd81e77b 1678 sv_upgrade(sv, SVt_PVNV);
79072805 1679 break;
bd4b1eb5 1680
bd4b1eb5 1681 case SVt_PVGV:
6e592b3a
BM
1682 if (!isGV_with_GP(sv))
1683 break;
bd81e77b
NC
1684 case SVt_PVAV:
1685 case SVt_PVHV:
79072805 1686 case SVt_PVCV:
bd81e77b
NC
1687 case SVt_PVFM:
1688 case SVt_PVIO:
22e74366 1689 /* diag_listed_as: Can't coerce %s to %s in %s */
bd81e77b 1690 Perl_croak(aTHX_ "Can't coerce %s to number in %s", sv_reftype(sv,0),
94bbb3f4 1691 OP_DESC(PL_op));
42d0e0b7 1692 default: NOOP;
2068cd4d 1693 }
bd81e77b
NC
1694 SvNV_set(sv, num);
1695 (void)SvNOK_only(sv); /* validate number */
1696 SvTAINT(sv);
79072805
LW
1697}
1698
645c22ef 1699/*
bd81e77b 1700=for apidoc sv_setnv_mg
645c22ef 1701
bd81e77b 1702Like C<sv_setnv>, but also handles 'set' magic.
645c22ef
DM
1703
1704=cut
1705*/
1706
bd81e77b 1707void
aad570aa 1708Perl_sv_setnv_mg(pTHX_ register SV *const sv, const NV num)
79072805 1709{
7918f24d
NC
1710 PERL_ARGS_ASSERT_SV_SETNV_MG;
1711
bd81e77b
NC
1712 sv_setnv(sv,num);
1713 SvSETMAGIC(sv);
79072805
LW
1714}
1715
bd81e77b
NC
1716/* Print an "isn't numeric" warning, using a cleaned-up,
1717 * printable version of the offending string
1718 */
954c1994 1719
bd81e77b 1720STATIC void
aad570aa 1721S_not_a_number(pTHX_ SV *const sv)
79072805 1722{
97aff369 1723 dVAR;
bd81e77b
NC
1724 SV *dsv;
1725 char tmpbuf[64];
1726 const char *pv;
94463019 1727
7918f24d
NC
1728 PERL_ARGS_ASSERT_NOT_A_NUMBER;
1729
94463019 1730 if (DO_UTF8(sv)) {
84bafc02 1731 dsv = newSVpvs_flags("", SVs_TEMP);
94463019
JH
1732 pv = sv_uni_display(dsv, sv, 10, 0);
1733 } else {
1734 char *d = tmpbuf;
551405c4 1735 const char * const limit = tmpbuf + sizeof(tmpbuf) - 8;
94463019
JH
1736 /* each *s can expand to 4 chars + "...\0",
1737 i.e. need room for 8 chars */
ecdeb87c 1738
00b6aa41
AL
1739 const char *s = SvPVX_const(sv);
1740 const char * const end = s + SvCUR(sv);
1741 for ( ; s < end && d < limit; s++ ) {
94463019
JH
1742 int ch = *s & 0xFF;
1743 if (ch & 128 && !isPRINT_LC(ch)) {
1744 *d++ = 'M';
1745 *d++ = '-';
1746 ch &= 127;
1747 }
1748 if (ch == '\n') {
1749 *d++ = '\\';
1750 *d++ = 'n';
1751 }
1752 else if (ch == '\r') {
1753 *d++ = '\\';
1754 *d++ = 'r';
1755 }
1756 else if (ch == '\f') {
1757 *d++ = '\\';
1758 *d++ = 'f';
1759 }
1760 else if (ch == '\\') {
1761 *d++ = '\\';
1762 *d++ = '\\';
1763 }
1764 else if (ch == '\0') {
1765 *d++ = '\\';
1766 *d++ = '0';
1767 }
1768 else if (isPRINT_LC(ch))
1769 *d++ = ch;
1770 else {
1771 *d++ = '^';
1772 *d++ = toCTRL(ch);
1773 }
1774 }
1775 if (s < end) {
1776 *d++ = '.';
1777 *d++ = '.';
1778 *d++ = '.';
1779 }
1780 *d = '\0';
1781 pv = tmpbuf;
a0d0e21e 1782 }
a0d0e21e 1783
533c011a 1784 if (PL_op)
9014280d 1785 Perl_warner(aTHX_ packWARN(WARN_NUMERIC),
94463019
JH
1786 "Argument \"%s\" isn't numeric in %s", pv,
1787 OP_DESC(PL_op));
a0d0e21e 1788 else
9014280d 1789 Perl_warner(aTHX_ packWARN(WARN_NUMERIC),
94463019 1790 "Argument \"%s\" isn't numeric", pv);
a0d0e21e
LW
1791}
1792
c2988b20
NC
1793/*
1794=for apidoc looks_like_number
1795
645c22ef
DM
1796Test if the content of an SV looks like a number (or is a number).
1797C<Inf> and C<Infinity> are treated as numbers (so will not issue a
1798non-numeric warning), even if your atof() doesn't grok them.
c2988b20
NC
1799
1800=cut
1801*/
1802
1803I32
aad570aa 1804Perl_looks_like_number(pTHX_ SV *const sv)
c2988b20 1805{
a3b680e6 1806 register const char *sbegin;
c2988b20
NC
1807 STRLEN len;
1808
7918f24d
NC
1809 PERL_ARGS_ASSERT_LOOKS_LIKE_NUMBER;
1810
c2988b20 1811 if (SvPOK(sv)) {
3f7c398e 1812 sbegin = SvPVX_const(sv);
c2988b20
NC
1813 len = SvCUR(sv);
1814 }
1815 else if (SvPOKp(sv))
83003860 1816 sbegin = SvPV_const(sv, len);
c2988b20 1817 else
e0ab1c0e 1818 return SvFLAGS(sv) & (SVf_NOK|SVp_NOK|SVf_IOK|SVp_IOK);
c2988b20
NC
1819 return grok_number(sbegin, len, NULL);
1820}
25da4f38 1821
19f6321d
NC
1822STATIC bool
1823S_glob_2number(pTHX_ GV * const gv)
180488f8
NC
1824{
1825 const U32 wasfake = SvFLAGS(gv) & SVf_FAKE;
1826 SV *const buffer = sv_newmortal();
1827
7918f24d
NC
1828 PERL_ARGS_ASSERT_GLOB_2NUMBER;
1829
180488f8
NC
1830 /* FAKE globs can get coerced, so need to turn this off temporarily if it
1831 is on. */
1832 SvFAKE_off(gv);
1833 gv_efullname3(buffer, gv, "*");
1834 SvFLAGS(gv) |= wasfake;
1835
675c862f
AL
1836 /* We know that all GVs stringify to something that is not-a-number,
1837 so no need to test that. */
1838 if (ckWARN(WARN_NUMERIC))
1839 not_a_number(buffer);
1840 /* We just want something true to return, so that S_sv_2iuv_common
1841 can tail call us and return true. */
19f6321d 1842 return TRUE;
675c862f
AL
1843}
1844
25da4f38
IZ
1845/* Actually, ISO C leaves conversion of UV to IV undefined, but
1846 until proven guilty, assume that things are not that bad... */
1847
645c22ef
DM
1848/*
1849 NV_PRESERVES_UV:
1850
1851 As 64 bit platforms often have an NV that doesn't preserve all bits of
28e5dec8
JH
1852 an IV (an assumption perl has been based on to date) it becomes necessary
1853 to remove the assumption that the NV always carries enough precision to
1854 recreate the IV whenever needed, and that the NV is the canonical form.
1855 Instead, IV/UV and NV need to be given equal rights. So as to not lose
645c22ef 1856 precision as a side effect of conversion (which would lead to insanity
28e5dec8
JH
1857 and the dragon(s) in t/op/numconvert.t getting very angry) the intent is
1858 1) to distinguish between IV/UV/NV slots that have cached a valid
1859 conversion where precision was lost and IV/UV/NV slots that have a
1860 valid conversion which has lost no precision
645c22ef 1861 2) to ensure that if a numeric conversion to one form is requested that
28e5dec8
JH
1862 would lose precision, the precise conversion (or differently
1863 imprecise conversion) is also performed and cached, to prevent
1864 requests for different numeric formats on the same SV causing
1865 lossy conversion chains. (lossless conversion chains are perfectly
1866 acceptable (still))
1867
1868
1869 flags are used:
1870 SvIOKp is true if the IV slot contains a valid value
1871 SvIOK is true only if the IV value is accurate (UV if SvIOK_UV true)
1872 SvNOKp is true if the NV slot contains a valid value
1873 SvNOK is true only if the NV value is accurate
1874
1875 so
645c22ef 1876 while converting from PV to NV, check to see if converting that NV to an
28e5dec8
JH
1877 IV(or UV) would lose accuracy over a direct conversion from PV to
1878 IV(or UV). If it would, cache both conversions, return NV, but mark
1879 SV as IOK NOKp (ie not NOK).
1880
645c22ef 1881 While converting from PV to IV, check to see if converting that IV to an
28e5dec8
JH
1882 NV would lose accuracy over a direct conversion from PV to NV. If it
1883 would, cache both conversions, flag similarly.
1884
1885 Before, the SV value "3.2" could become NV=3.2 IV=3 NOK, IOK quite
1886 correctly because if IV & NV were set NV *always* overruled.
645c22ef
DM
1887 Now, "3.2" will become NV=3.2 IV=3 NOK, IOKp, because the flag's meaning
1888 changes - now IV and NV together means that the two are interchangeable:
28e5dec8 1889 SvIVX == (IV) SvNVX && SvNVX == (NV) SvIVX;
d460ef45 1890
645c22ef
DM
1891 The benefit of this is that operations such as pp_add know that if
1892 SvIOK is true for both left and right operands, then integer addition
1893 can be used instead of floating point (for cases where the result won't
1894 overflow). Before, floating point was always used, which could lead to
28e5dec8
JH
1895 loss of precision compared with integer addition.
1896
1897 * making IV and NV equal status should make maths accurate on 64 bit
1898 platforms
1899 * may speed up maths somewhat if pp_add and friends start to use
645c22ef 1900 integers when possible instead of fp. (Hopefully the overhead in
28e5dec8
JH
1901 looking for SvIOK and checking for overflow will not outweigh the
1902 fp to integer speedup)
1903 * will slow down integer operations (callers of SvIV) on "inaccurate"
1904 values, as the change from SvIOK to SvIOKp will cause a call into
1905 sv_2iv each time rather than a macro access direct to the IV slot
1906 * should speed up number->string conversion on integers as IV is
645c22ef 1907 favoured when IV and NV are equally accurate
28e5dec8
JH
1908
1909 ####################################################################
645c22ef
DM
1910 You had better be using SvIOK_notUV if you want an IV for arithmetic:
1911 SvIOK is true if (IV or UV), so you might be getting (IV)SvUV.
1912 On the other hand, SvUOK is true iff UV.
28e5dec8
JH
1913 ####################################################################
1914
645c22ef 1915 Your mileage will vary depending your CPU's relative fp to integer
28e5dec8
JH
1916 performance ratio.
1917*/
1918
1919#ifndef NV_PRESERVES_UV
645c22ef
DM
1920# define IS_NUMBER_UNDERFLOW_IV 1
1921# define IS_NUMBER_UNDERFLOW_UV 2
1922# define IS_NUMBER_IV_AND_UV 2
1923# define IS_NUMBER_OVERFLOW_IV 4
1924# define IS_NUMBER_OVERFLOW_UV 5
1925
1926/* sv_2iuv_non_preserve(): private routine for use by sv_2iv() and sv_2uv() */
28e5dec8
JH
1927
1928/* For sv_2nv these three cases are "SvNOK and don't bother casting" */
1929STATIC int
5de3775c 1930S_sv_2iuv_non_preserve(pTHX_ register SV *const sv
47031da6
NC
1931# ifdef DEBUGGING
1932 , I32 numtype
1933# endif
1934 )
28e5dec8 1935{
97aff369 1936 dVAR;
7918f24d
NC
1937
1938 PERL_ARGS_ASSERT_SV_2IUV_NON_PRESERVE;
1939
3f7c398e 1940 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));
28e5dec8
JH
1941 if (SvNVX(sv) < (NV)IV_MIN) {
1942 (void)SvIOKp_on(sv);
1943 (void)SvNOK_on(sv);
45977657 1944 SvIV_set(sv, IV_MIN);
28e5dec8
JH
1945 return IS_NUMBER_UNDERFLOW_IV;
1946 }
1947 if (SvNVX(sv) > (NV)UV_MAX) {
1948 (void)SvIOKp_on(sv);
1949 (void)SvNOK_on(sv);
1950 SvIsUV_on(sv);
607fa7f2 1951 SvUV_set(sv, UV_MAX);
28e5dec8
JH
1952 return IS_NUMBER_OVERFLOW_UV;
1953 }
c2988b20
NC
1954 (void)SvIOKp_on(sv);
1955 (void)SvNOK_on(sv);
1956 /* Can't use strtol etc to convert this string. (See truth table in
1957 sv_2iv */
1958 if (SvNVX(sv) <= (UV)IV_MAX) {
45977657 1959 SvIV_set(sv, I_V(SvNVX(sv)));
c2988b20
NC
1960 if ((NV)(SvIVX(sv)) == SvNVX(sv)) {
1961 SvIOK_on(sv); /* Integer is precise. NOK, IOK */
1962 } else {
1963 /* Integer is imprecise. NOK, IOKp */
1964 }
1965 return SvNVX(sv) < 0 ? IS_NUMBER_UNDERFLOW_UV : IS_NUMBER_IV_AND_UV;
1966 }
1967 SvIsUV_on(sv);
607fa7f2 1968 SvUV_set(sv, U_V(SvNVX(sv)));
c2988b20
NC
1969 if ((NV)(SvUVX(sv)) == SvNVX(sv)) {
1970 if (SvUVX(sv) == UV_MAX) {
1971 /* As we know that NVs don't preserve UVs, UV_MAX cannot
1972 possibly be preserved by NV. Hence, it must be overflow.
1973 NOK, IOKp */
1974 return IS_NUMBER_OVERFLOW_UV;
1975 }
1976 SvIOK_on(sv); /* Integer is precise. NOK, UOK */
1977 } else {
1978 /* Integer is imprecise. NOK, IOKp */
28e5dec8 1979 }
c2988b20 1980 return IS_NUMBER_OVERFLOW_IV;
28e5dec8 1981}
645c22ef
DM
1982#endif /* !NV_PRESERVES_UV*/
1983
af359546 1984STATIC bool
7918f24d
NC
1985S_sv_2iuv_common(pTHX_ SV *const sv)
1986{
97aff369 1987 dVAR;
7918f24d
NC
1988
1989 PERL_ARGS_ASSERT_SV_2IUV_COMMON;
1990
af359546 1991 if (SvNOKp(sv)) {
28e5dec8
JH
1992 /* erm. not sure. *should* never get NOKp (without NOK) from sv_2nv
1993 * without also getting a cached IV/UV from it at the same time
1994 * (ie PV->NV conversion should detect loss of accuracy and cache
af359546
NC
1995 * IV or UV at same time to avoid this. */
1996 /* IV-over-UV optimisation - choose to cache IV if possible */
25da4f38
IZ
1997
1998 if (SvTYPE(sv) == SVt_NV)
1999 sv_upgrade(sv, SVt_PVNV);
2000
28e5dec8
JH
2001 (void)SvIOKp_on(sv); /* Must do this first, to clear any SvOOK */
2002 /* < not <= as for NV doesn't preserve UV, ((NV)IV_MAX+1) will almost
2003 certainly cast into the IV range at IV_MAX, whereas the correct
2004 answer is the UV IV_MAX +1. Hence < ensures that dodgy boundary
2005 cases go to UV */
cab190d4
JD
2006#if defined(NAN_COMPARE_BROKEN) && defined(Perl_isnan)
2007 if (Perl_isnan(SvNVX(sv))) {
2008 SvUV_set(sv, 0);
2009 SvIsUV_on(sv);
fdbe6d7c 2010 return FALSE;
cab190d4 2011 }
cab190d4 2012#endif
28e5dec8 2013 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
45977657 2014 SvIV_set(sv, I_V(SvNVX(sv)));
28e5dec8
JH
2015 if (SvNVX(sv) == (NV) SvIVX(sv)
2016#ifndef NV_PRESERVES_UV
2017 && (((UV)1 << NV_PRESERVES_UV_BITS) >
2018 (UV)(SvIVX(sv) > 0 ? SvIVX(sv) : -SvIVX(sv)))
2019 /* Don't flag it as "accurately an integer" if the number
2020 came from a (by definition imprecise) NV operation, and
2021 we're outside the range of NV integer precision */
2022#endif
2023 ) {
a43d94f2
NC
2024 if (SvNOK(sv))
2025 SvIOK_on(sv); /* Can this go wrong with rounding? NWC */
2026 else {
2027 /* scalar has trailing garbage, eg "42a" */
2028 }
28e5dec8 2029 DEBUG_c(PerlIO_printf(Perl_debug_log,
7234c960 2030 "0x%"UVxf" iv(%"NVgf" => %"IVdf") (precise)\n",
28e5dec8
JH
2031 PTR2UV(sv),
2032 SvNVX(sv),
2033 SvIVX(sv)));
2034
2035 } else {
2036 /* IV not precise. No need to convert from PV, as NV
2037 conversion would already have cached IV if it detected
2038 that PV->IV would be better than PV->NV->IV
2039 flags already correct - don't set public IOK. */
2040 DEBUG_c(PerlIO_printf(Perl_debug_log,
7234c960 2041 "0x%"UVxf" iv(%"NVgf" => %"IVdf") (imprecise)\n",
28e5dec8
JH
2042 PTR2UV(sv),
2043 SvNVX(sv),
2044 SvIVX(sv)));
2045 }
2046 /* Can the above go wrong if SvIVX == IV_MIN and SvNVX < IV_MIN,
2047 but the cast (NV)IV_MIN rounds to a the value less (more
2048 negative) than IV_MIN which happens to be equal to SvNVX ??
2049 Analogous to 0xFFFFFFFFFFFFFFFF rounding up to NV (2**64) and
2050 NV rounding back to 0xFFFFFFFFFFFFFFFF, so UVX == UV(NVX) and
2051 (NV)UVX == NVX are both true, but the values differ. :-(
2052 Hopefully for 2s complement IV_MIN is something like
2053 0x8000000000000000 which will be exact. NWC */
d460ef45 2054 }
25da4f38 2055 else {
607fa7f2 2056 SvUV_set(sv, U_V(SvNVX(sv)));
28e5dec8
JH
2057 if (
2058 (SvNVX(sv) == (NV) SvUVX(sv))
2059#ifndef NV_PRESERVES_UV
2060 /* Make sure it's not 0xFFFFFFFFFFFFFFFF */
2061 /*&& (SvUVX(sv) != UV_MAX) irrelevant with code below */
2062 && (((UV)1 << NV_PRESERVES_UV_BITS) > SvUVX(sv))
2063 /* Don't flag it as "accurately an integer" if the number
2064 came from a (by definition imprecise) NV operation, and
2065 we're outside the range of NV integer precision */
2066#endif
a43d94f2 2067 && SvNOK(sv)
28e5dec8
JH
2068 )
2069 SvIOK_on(sv);
25da4f38 2070 SvIsUV_on(sv);
1c846c1f 2071 DEBUG_c(PerlIO_printf(Perl_debug_log,
57def98f 2072 "0x%"UVxf" 2iv(%"UVuf" => %"IVdf") (as unsigned)\n",
56431972 2073 PTR2UV(sv),
57def98f
JH
2074 SvUVX(sv),
2075 SvUVX(sv)));
25da4f38 2076 }
748a9306
LW
2077 }
2078 else if (SvPOKp(sv) && SvLEN(sv)) {
c2988b20 2079 UV value;
504618e9 2080 const int numtype = grok_number(SvPVX_const(sv), SvCUR(sv), &value);
af359546 2081 /* We want to avoid a possible problem when we cache an IV/ a UV which
25da4f38 2082 may be later translated to an NV, and the resulting NV is not
c2988b20
NC
2083 the same as the direct translation of the initial string
2084 (eg 123.456 can shortcut to the IV 123 with atol(), but we must
2085 be careful to ensure that the value with the .456 is around if the
2086 NV value is requested in the future).
1c846c1f 2087
af359546 2088 This means that if we cache such an IV/a UV, we need to cache the
25da4f38 2089 NV as well. Moreover, we trade speed for space, and do not
28e5dec8 2090 cache the NV if we are sure it's not needed.
25da4f38 2091 */
16b7a9a4 2092
c2988b20
NC
2093 /* SVt_PVNV is one higher than SVt_PVIV, hence this order */
2094 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2095 == IS_NUMBER_IN_UV) {
5e045b90 2096 /* It's definitely an integer, only upgrade to PVIV */
28e5dec8
JH
2097 if (SvTYPE(sv) < SVt_PVIV)
2098 sv_upgrade(sv, SVt_PVIV);
f7bbb42a 2099 (void)SvIOK_on(sv);
c2988b20
NC
2100 } else if (SvTYPE(sv) < SVt_PVNV)
2101 sv_upgrade(sv, SVt_PVNV);
28e5dec8 2102
f2524eef 2103 /* If NVs preserve UVs then we only use the UV value if we know that
c2988b20
NC
2104 we aren't going to call atof() below. If NVs don't preserve UVs
2105 then the value returned may have more precision than atof() will
2106 return, even though value isn't perfectly accurate. */
2107 if ((numtype & (IS_NUMBER_IN_UV
2108#ifdef NV_PRESERVES_UV
2109 | IS_NUMBER_NOT_INT
2110#endif
2111 )) == IS_NUMBER_IN_UV) {
2112 /* This won't turn off the public IOK flag if it was set above */
2113 (void)SvIOKp_on(sv);
2114
2115 if (!(numtype & IS_NUMBER_NEG)) {
2116 /* positive */;
2117 if (value <= (UV)IV_MAX) {
45977657 2118 SvIV_set(sv, (IV)value);
c2988b20 2119 } else {
af359546 2120 /* it didn't overflow, and it was positive. */
607fa7f2 2121 SvUV_set(sv, value);
c2988b20
NC
2122 SvIsUV_on(sv);
2123 }
2124 } else {
2125 /* 2s complement assumption */
2126 if (value <= (UV)IV_MIN) {
45977657 2127 SvIV_set(sv, -(IV)value);
c2988b20
NC
2128 } else {
2129 /* Too negative for an IV. This is a double upgrade, but
d1be9408 2130 I'm assuming it will be rare. */
c2988b20
NC
2131 if (SvTYPE(sv) < SVt_PVNV)
2132 sv_upgrade(sv, SVt_PVNV);
2133 SvNOK_on(sv);
2134 SvIOK_off(sv);
2135 SvIOKp_on(sv);
9d6ce603 2136 SvNV_set(sv, -(NV)value);
45977657 2137 SvIV_set(sv, IV_MIN);
c2988b20
NC
2138 }
2139 }
2140 }
2141 /* For !NV_PRESERVES_UV and IS_NUMBER_IN_UV and IS_NUMBER_NOT_INT we
2142 will be in the previous block to set the IV slot, and the next
2143 block to set the NV slot. So no else here. */
2144
2145 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2146 != IS_NUMBER_IN_UV) {
2147 /* It wasn't an (integer that doesn't overflow the UV). */
3f7c398e 2148 SvNV_set(sv, Atof(SvPVX_const(sv)));
28e5dec8 2149
c2988b20
NC
2150 if (! numtype && ckWARN(WARN_NUMERIC))
2151 not_a_number(sv);
28e5dec8 2152
65202027 2153#if defined(USE_LONG_DOUBLE)
c2988b20
NC
2154 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2iv(%" PERL_PRIgldbl ")\n",
2155 PTR2UV(sv), SvNVX(sv)));
65202027 2156#else
1779d84d 2157 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2iv(%"NVgf")\n",
c2988b20 2158 PTR2UV(sv), SvNVX(sv)));
65202027 2159#endif
28e5dec8 2160
28e5dec8 2161#ifdef NV_PRESERVES_UV
af359546
NC
2162 (void)SvIOKp_on(sv);
2163 (void)SvNOK_on(sv);
2164 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2165 SvIV_set(sv, I_V(SvNVX(sv)));
2166 if ((NV)(SvIVX(sv)) == SvNVX(sv)) {
2167 SvIOK_on(sv);
2168 } else {
6f207bd3 2169 NOOP; /* Integer is imprecise. NOK, IOKp */
af359546
NC
2170 }
2171 /* UV will not work better than IV */
2172 } else {
2173 if (SvNVX(sv) > (NV)UV_MAX) {
2174 SvIsUV_on(sv);
2175 /* Integer is inaccurate. NOK, IOKp, is UV */
2176 SvUV_set(sv, UV_MAX);
af359546
NC
2177 } else {
2178 SvUV_set(sv, U_V(SvNVX(sv)));
2179 /* 0xFFFFFFFFFFFFFFFF not an issue in here, NVs
2180 NV preservse UV so can do correct comparison. */
2181 if ((NV)(SvUVX(sv)) == SvNVX(sv)) {
2182 SvIOK_on(sv);
af359546 2183 } else {
6f207bd3 2184 NOOP; /* Integer is imprecise. NOK, IOKp, is UV */
af359546
NC
2185 }
2186 }
4b0c9573 2187 SvIsUV_on(sv);
af359546 2188 }
28e5dec8 2189#else /* NV_PRESERVES_UV */
c2988b20
NC
2190 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2191 == (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT)) {
af359546 2192 /* The IV/UV slot will have been set from value returned by
c2988b20
NC
2193 grok_number above. The NV slot has just been set using
2194 Atof. */
560b0c46 2195 SvNOK_on(sv);
c2988b20
NC
2196 assert (SvIOKp(sv));
2197 } else {
2198 if (((UV)1 << NV_PRESERVES_UV_BITS) >
2199 U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))) {
2200 /* Small enough to preserve all bits. */
2201 (void)SvIOKp_on(sv);
2202 SvNOK_on(sv);
45977657 2203 SvIV_set(sv, I_V(SvNVX(sv)));
c2988b20
NC
2204 if ((NV)(SvIVX(sv)) == SvNVX(sv))
2205 SvIOK_on(sv);
2206 /* Assumption: first non-preserved integer is < IV_MAX,
2207 this NV is in the preserved range, therefore: */
2208 if (!(U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))
2209 < (UV)IV_MAX)) {
32fdb065 2210 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);
c2988b20
NC
2211 }
2212 } else {
2213 /* IN_UV NOT_INT
2214 0 0 already failed to read UV.
2215 0 1 already failed to read UV.
2216 1 0 you won't get here in this case. IV/UV
2217 slot set, public IOK, Atof() unneeded.
2218 1 1 already read UV.
2219 so there's no point in sv_2iuv_non_preserve() attempting
2220 to use atol, strtol, strtoul etc. */
47031da6 2221# ifdef DEBUGGING
40a17c4c 2222 sv_2iuv_non_preserve (sv, numtype);
47031da6
NC
2223# else
2224 sv_2iuv_non_preserve (sv);
2225# endif
c2988b20
NC
2226 }
2227 }
28e5dec8 2228#endif /* NV_PRESERVES_UV */
a43d94f2
NC
2229 /* It might be more code efficient to go through the entire logic above
2230 and conditionally set with SvIOKp_on() rather than SvIOK(), but it
2231 gets complex and potentially buggy, so more programmer efficient
2232 to do it this way, by turning off the public flags: */
2233 if (!numtype)
2234 SvFLAGS(sv) &= ~(SVf_IOK|SVf_NOK);
25da4f38 2235 }
af359546
NC
2236 }
2237 else {
675c862f 2238 if (isGV_with_GP(sv))
159b6efe 2239 return glob_2number(MUTABLE_GV(sv));
180488f8 2240
af359546
NC
2241 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
2242 if (!PL_localizing && ckWARN(WARN_UNINITIALIZED))
2243 report_uninit(sv);
2244 }
25da4f38
IZ
2245 if (SvTYPE(sv) < SVt_IV)
2246 /* Typically the caller expects that sv_any is not NULL now. */
2247 sv_upgrade(sv, SVt_IV);
af359546
NC
2248 /* Return 0 from the caller. */
2249 return TRUE;
2250 }
2251 return FALSE;
2252}
2253
2254/*
2255=for apidoc sv_2iv_flags
2256
2257Return the integer value of an SV, doing any necessary string
2258conversion. If flags includes SV_GMAGIC, does an mg_get() first.
2259Normally used via the C<SvIV(sv)> and C<SvIVx(sv)> macros.
2260
2261=cut
2262*/
2263
2264IV
5de3775c 2265Perl_sv_2iv_flags(pTHX_ register SV *const sv, const I32 flags)
af359546 2266{
97aff369 2267 dVAR;
af359546 2268 if (!sv)
a0d0e21e 2269 return 0;
a672f009 2270 if (SvGMAGICAL(sv) || SvVALID(sv)) {
2b2b6d6d
NC
2271 /* FBMs use the space for SvIVX and SvNVX for other purposes, and use
2272 the same flag bit as SVf_IVisUV, so must not let them cache IVs.
2273 In practice they are extremely unlikely to actually get anywhere
2274 accessible by user Perl code - the only way that I'm aware of is when
2275 a constant subroutine which is used as the second argument to index.
2276 */
af359546
NC
2277 if (flags & SV_GMAGIC)
2278 mg_get(sv);
2279 if (SvIOKp(sv))
2280 return SvIVX(sv);
2281 if (SvNOKp(sv)) {
2282 return I_V(SvNVX(sv));
2283 }
71c558c3
NC
2284 if (SvPOKp(sv) && SvLEN(sv)) {
2285 UV value;
2286 const int numtype
2287 = grok_number(SvPVX_const(sv), SvCUR(sv), &value);
2288
2289 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2290 == IS_NUMBER_IN_UV) {
2291 /* It's definitely an integer */
2292 if (numtype & IS_NUMBER_NEG) {
2293 if (value < (UV)IV_MIN)
2294 return -(IV)value;
2295 } else {
2296 if (value < (UV)IV_MAX)
2297 return (IV)value;
2298 }
2299 }
2300 if (!numtype) {
2301 if (ckWARN(WARN_NUMERIC))
2302 not_a_number(sv);
2303 }
2304 return I_V(Atof(SvPVX_const(sv)));
2305 }
1c7ff15e
NC
2306 if (SvROK(sv)) {
2307 goto return_rok;
af359546 2308 }
1c7ff15e
NC
2309 assert(SvTYPE(sv) >= SVt_PVMG);
2310 /* This falls through to the report_uninit inside S_sv_2iuv_common. */
4cb1ec55 2311 } else if (SvTHINKFIRST(sv)) {
af359546 2312 if (SvROK(sv)) {
1c7ff15e 2313 return_rok:
af359546 2314 if (SvAMAGIC(sv)) {
aee036bb
DM
2315 SV * tmpstr;
2316 if (flags & SV_SKIP_OVERLOAD)
2317 return 0;
31d632c3 2318 tmpstr = AMG_CALLunary(sv, numer_amg);
af359546
NC
2319 if (tmpstr && (!SvROK(tmpstr) || (SvRV(tmpstr) != SvRV(sv)))) {
2320 return SvIV(tmpstr);
2321 }
2322 }
2323 return PTR2IV(SvRV(sv));
2324 }
2325 if (SvIsCOW(sv)) {
2326 sv_force_normal_flags(sv, 0);
2327 }
2328 if (SvREADONLY(sv) && !SvOK(sv)) {
2329 if (ckWARN(WARN_UNINITIALIZED))
2330 report_uninit(sv);
2331 return 0;
2332 }
2333 }
2334 if (!SvIOKp(sv)) {
2335 if (S_sv_2iuv_common(aTHX_ sv))
2336 return 0;
79072805 2337 }
1d7c1841
GS
2338 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2iv(%"IVdf")\n",
2339 PTR2UV(sv),SvIVX(sv)));
25da4f38 2340 return SvIsUV(sv) ? (IV)SvUVX(sv) : SvIVX(sv);
79072805
LW
2341}
2342
645c22ef 2343/*
891f9566 2344=for apidoc sv_2uv_flags
645c22ef
DM
2345
2346Return the unsigned integer value of an SV, doing any necessary string
891f9566
YST
2347conversion. If flags includes SV_GMAGIC, does an mg_get() first.
2348Normally used via the C<SvUV(sv)> and C<SvUVx(sv)> macros.
645c22ef
DM
2349
2350=cut
2351*/
2352
ff68c719 2353UV
5de3775c 2354Perl_sv_2uv_flags(pTHX_ register SV *const sv, const I32 flags)
ff68c719 2355{
97aff369 2356 dVAR;
ff68c719
PP
2357 if (!sv)
2358 return 0;
a672f009 2359 if (SvGMAGICAL(sv) || SvVALID(sv)) {
2b2b6d6d
NC
2360 /* FBMs use the space for SvIVX and SvNVX for other purposes, and use
2361 the same flag bit as SVf_IVisUV, so must not let them cache IVs. */
891f9566
YST
2362 if (flags & SV_GMAGIC)
2363 mg_get(sv);
ff68c719
PP
2364 if (SvIOKp(sv))
2365 return SvUVX(sv);
2366 if (SvNOKp(sv))
2367 return U_V(SvNVX(sv));
71c558c3
NC
2368 if (SvPOKp(sv) && SvLEN(sv)) {
2369 UV value;
2370 const int numtype
2371 = grok_number(SvPVX_const(sv), SvCUR(sv), &value);
2372
2373 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2374 == IS_NUMBER_IN_UV) {
2375 /* It's definitely an integer */
2376 if (!(numtype & IS_NUMBER_NEG))
2377 return value;
2378 }
2379 if (!numtype) {
2380 if (ckWARN(WARN_NUMERIC))
2381 not_a_number(sv);
2382 }
2383 return U_V(Atof(SvPVX_const(sv)));
2384 }
1c7ff15e
NC
2385 if (SvROK(sv)) {
2386 goto return_rok;
3fe9a6f1 2387 }
1c7ff15e
NC
2388 assert(SvTYPE(sv) >= SVt_PVMG);
2389 /* This falls through to the report_uninit inside S_sv_2iuv_common. */
4cb1ec55 2390 } else if (SvTHINKFIRST(sv)) {
ff68c719 2391 if (SvROK(sv)) {
1c7ff15e 2392 return_rok:
deb46114 2393 if (SvAMAGIC(sv)) {
aee036bb
DM
2394 SV *tmpstr;
2395 if (flags & SV_SKIP_OVERLOAD)
2396 return 0;
31d632c3 2397 tmpstr = AMG_CALLunary(sv, numer_amg);
deb46114
NC
2398 if (tmpstr && (!SvROK(tmpstr) || (SvRV(tmpstr) != SvRV(sv)))) {
2399 return SvUV(tmpstr);
2400 }
2401 }
2402 return PTR2UV(SvRV(sv));
ff68c719 2403 }
765f542d
NC
2404 if (SvIsCOW(sv)) {
2405 sv_force_normal_flags(sv, 0);
8a818333 2406 }
0336b60e 2407 if (SvREADONLY(sv) && !SvOK(sv)) {
0336b60e 2408 if (ckWARN(WARN_UNINITIALIZED))
29489e7c 2409 report_uninit(sv);
ff68c719
PP
2410 return 0;
2411 }
2412 }
af359546
NC
2413 if (!SvIOKp(sv)) {
2414 if (S_sv_2iuv_common(aTHX_ sv))
2415 return 0;
ff68c719 2416 }
25da4f38 2417
1d7c1841
GS
2418 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2uv(%"UVuf")\n",
2419 PTR2UV(sv),SvUVX(sv)));
25da4f38 2420 return SvIsUV(sv) ? SvUVX(sv) : (UV)SvIVX(sv);
ff68c719
PP
2421}
2422
645c22ef 2423/*
196007d1 2424=for apidoc sv_2nv_flags
645c22ef
DM
2425
2426Return the num value of an SV, doing any necessary string or integer
39d5de13
DM
2427conversion. If flags includes SV_GMAGIC, does an mg_get() first.
2428Normally used via the C<SvNV(sv)> and C<SvNVx(sv)> macros.
645c22ef
DM
2429
2430=cut
2431*/
2432
65202027 2433NV
39d5de13 2434Perl_sv_2nv_flags(pTHX_ register SV *const sv, const I32 flags)
79072805 2435{
97aff369 2436 dVAR;
79072805
LW
2437 if (!sv)
2438 return 0.0;
a672f009 2439 if (SvGMAGICAL(sv) || SvVALID(sv)) {
2b2b6d6d
NC
2440 /* FBMs use the space for SvIVX and SvNVX for other purposes, and use
2441 the same flag bit as SVf_IVisUV, so must not let them cache NVs. */
39d5de13
DM
2442 if (flags & SV_GMAGIC)
2443 mg_get(sv);
463ee0b2
LW
2444 if (SvNOKp(sv))
2445 return SvNVX(sv);
0aa395f8 2446 if ((SvPOKp(sv) && SvLEN(sv)) && !SvIOKp(sv)) {
041457d9 2447 if (!SvIOKp(sv) && ckWARN(WARN_NUMERIC) &&
504618e9 2448 !grok_number(SvPVX_const(sv), SvCUR(sv), NULL))
a0d0e21e 2449 not_a_number(sv);
3f7c398e 2450 return Atof(SvPVX_const(sv));
a0d0e21e 2451 }
25da4f38 2452 if (SvIOKp(sv)) {
1c846c1f 2453 if (SvIsUV(sv))
65202027 2454 return (NV)SvUVX(sv);
25da4f38 2455 else
65202027 2456 return (NV)SvIVX(sv);
47a72cb8
NC
2457 }
2458 if (SvROK(sv)) {
2459 goto return_rok;
2460 }
2461 assert(SvTYPE(sv) >= SVt_PVMG);
2462 /* This falls through to the report_uninit near the end of the
2463 function. */
2464 } else if (SvTHINKFIRST(sv)) {
a0d0e21e 2465 if (SvROK(sv)) {
47a72cb8 2466 return_rok:
deb46114 2467 if (SvAMAGIC(sv)) {
aee036bb
DM
2468 SV *tmpstr;
2469 if (flags & SV_SKIP_OVERLOAD)
2470 return 0;
31d632c3 2471 tmpstr = AMG_CALLunary(sv, numer_amg);
deb46114
NC
2472 if (tmpstr && (!SvROK(tmpstr) || (SvRV(tmpstr) != SvRV(sv)))) {
2473 return SvNV(tmpstr);
2474 }
2475 }
2476 return PTR2NV(SvRV(sv));
a0d0e21e 2477 }
765f542d
NC
2478 if (SvIsCOW(sv)) {
2479 sv_force_normal_flags(sv, 0);
8a818333 2480 }
0336b60e 2481 if (SvREADONLY(sv) && !SvOK(sv)) {
599cee73 2482 if (ckWARN(WARN_UNINITIALIZED))
29489e7c 2483 report_uninit(sv);
ed6116ce
LW
2484 return 0.0;
2485 }
79072805
LW
2486 }
2487 if (SvTYPE(sv) < SVt_NV) {
7e25a7e9
NC
2488 /* The logic to use SVt_PVNV if necessary is in sv_upgrade. */
2489 sv_upgrade(sv, SVt_NV);
906f284f 2490#ifdef USE_LONG_DOUBLE
097ee67d 2491 DEBUG_c({
f93f4e46 2492 STORE_NUMERIC_LOCAL_SET_STANDARD();
1d7c1841
GS
2493 PerlIO_printf(Perl_debug_log,
2494 "0x%"UVxf" num(%" PERL_PRIgldbl ")\n",
2495 PTR2UV(sv), SvNVX(sv));
572bbb43
GS
2496 RESTORE_NUMERIC_LOCAL();
2497 });
65202027 2498#else
572bbb43 2499 DEBUG_c({
f93f4e46 2500 STORE_NUMERIC_LOCAL_SET_STANDARD();
1779d84d 2501 PerlIO_printf(Perl_debug_log, "0x%"UVxf" num(%"NVgf")\n",
1d7c1841 2502 PTR2UV(sv), SvNVX(sv));
097ee67d
JH
2503 RESTORE_NUMERIC_LOCAL();
2504 });
572bbb43 2505#endif
79072805
LW
2506 }
2507 else if (SvTYPE(sv) < SVt_PVNV)
2508 sv_upgrade(sv, SVt_PVNV);
59d8ce62
NC
2509 if (SvNOKp(sv)) {
2510 return SvNVX(sv);
61604483 2511 }
59d8ce62 2512 if (SvIOKp(sv)) {
9d6ce603 2513 SvNV_set(sv, SvIsUV(sv) ? (NV)SvUVX(sv) : (NV)SvIVX(sv));
28e5dec8 2514#ifdef NV_PRESERVES_UV
a43d94f2
NC
2515 if (SvIOK(sv))
2516 SvNOK_on(sv);
2517 else
2518 SvNOKp_on(sv);
28e5dec8
JH
2519#else
2520 /* Only set the public NV OK flag if this NV preserves the IV */
2521 /* Check it's not 0xFFFFFFFFFFFFFFFF */
a43d94f2
NC
2522 if (SvIOK(sv) &&
2523 SvIsUV(sv) ? ((SvUVX(sv) != UV_MAX)&&(SvUVX(sv) == U_V(SvNVX(sv))))
28e5dec8
JH
2524 : (SvIVX(sv) == I_V(SvNVX(sv))))
2525 SvNOK_on(sv);
2526 else
2527 SvNOKp_on(sv);
2528#endif
93a17b20 2529 }
748a9306 2530 else if (SvPOKp(sv) && SvLEN(sv)) {
c2988b20 2531 UV value;
3f7c398e 2532 const int numtype = grok_number(SvPVX_const(sv), SvCUR(sv), &value);
041457d9 2533 if (!SvIOKp(sv) && !numtype && ckWARN(WARN_NUMERIC))
a0d0e21e 2534 not_a_number(sv);
28e5dec8 2535#ifdef NV_PRESERVES_UV
c2988b20
NC
2536 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2537 == IS_NUMBER_IN_UV) {
5e045b90 2538 /* It's definitely an integer */
9d6ce603 2539 SvNV_set(sv, (numtype & IS_NUMBER_NEG) ? -(NV)value : (NV)value);
c2988b20 2540 } else
3f7c398e 2541 SvNV_set(sv, Atof(SvPVX_const(sv)));
a43d94f2
NC
2542 if (numtype)
2543 SvNOK_on(sv);
2544 else
2545 SvNOKp_on(sv);
28e5dec8 2546#else
3f7c398e 2547 SvNV_set(sv, Atof(SvPVX_const(sv)));
28e5dec8
JH
2548 /* Only set the public NV OK flag if this NV preserves the value in
2549 the PV at least as well as an IV/UV would.
2550 Not sure how to do this 100% reliably. */
2551 /* if that shift count is out of range then Configure's test is
2552 wonky. We shouldn't be in here with NV_PRESERVES_UV_BITS ==
2553 UV_BITS */
2554 if (((UV)1 << NV_PRESERVES_UV_BITS) >
c2988b20 2555 U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))) {
28e5dec8 2556 SvNOK_on(sv); /* Definitely small enough to preserve all bits */
c2988b20
NC
2557 } else if (!(numtype & IS_NUMBER_IN_UV)) {
2558 /* Can't use strtol etc to convert this string, so don't try.
2559 sv_2iv and sv_2uv will use the NV to convert, not the PV. */
2560 SvNOK_on(sv);
2561 } else {
2562 /* value has been set. It may not be precise. */
2563 if ((numtype & IS_NUMBER_NEG) && (value > (UV)IV_MIN)) {
2564 /* 2s complement assumption for (UV)IV_MIN */
2565 SvNOK_on(sv); /* Integer is too negative. */
2566 } else {
2567 SvNOKp_on(sv);
2568 SvIOKp_on(sv);
6fa402ec 2569
c2988b20 2570 if (numtype & IS_NUMBER_NEG) {
45977657 2571 SvIV_set(sv, -(IV)value);
c2988b20 2572 } else if (value <= (UV)IV_MAX) {
45977657 2573 SvIV_set(sv, (IV)value);
c2988b20 2574 } else {
607fa7f2 2575 SvUV_set(sv, value);
c2988b20
NC
2576 SvIsUV_on(sv);
2577 }
2578
2579 if (numtype & IS_NUMBER_NOT_INT) {
2580 /* I believe that even if the original PV had decimals,
2581 they are lost beyond the limit of the FP precision.
2582 However, neither is canonical, so both only get p
2583 flags. NWC, 2000/11/25 */
2584 /* Both already have p flags, so do nothing */
2585 } else {
66a1b24b 2586 const NV nv = SvNVX(sv);
c2988b20
NC
2587 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2588 if (SvIVX(sv) == I_V(nv)) {
2589 SvNOK_on(sv);
c2988b20 2590 } else {
c2988b20
NC
2591 /* It had no "." so it must be integer. */
2592 }
00b6aa41 2593 SvIOK_on(sv);
c2988b20
NC
2594 } else {
2595 /* between IV_MAX and NV(UV_MAX).
2596 Could be slightly > UV_MAX */
6fa402ec 2597
c2988b20
NC
2598 if (numtype & IS_NUMBER_NOT_INT) {
2599 /* UV and NV both imprecise. */
2600 } else {
66a1b24b 2601 const UV nv_as_uv = U_V(nv);
c2988b20
NC
2602
2603 if (value == nv_as_uv && SvUVX(sv) != UV_MAX) {
2604 SvNOK_on(sv);
c2988b20 2605 }
00b6aa41 2606 SvIOK_on(sv);
c2988b20
NC
2607 }
2608 }
2609 }
2610 }
2611 }
a43d94f2
NC
2612 /* It might be more code efficient to go through the entire logic above
2613 and conditionally set with SvNOKp_on() rather than SvNOK(), but it
2614 gets complex and potentially buggy, so more programmer efficient
2615 to do it this way, by turning off the public flags: */
2616 if (!numtype)
2617 SvFLAGS(sv) &= ~(SVf_IOK|SVf_NOK);
28e5dec8 2618#endif /* NV_PRESERVES_UV */
93a17b20 2619 }
79072805 2620 else {
f7877b28 2621 if (isGV_with_GP(sv)) {
159b6efe 2622 glob_2number(MUTABLE_GV(sv));
180488f8
NC
2623 return 0.0;
2624 }
2625
041457d9 2626 if (!PL_localizing && !(SvFLAGS(sv) & SVs_PADTMP) && ckWARN(WARN_UNINITIALIZED))
29489e7c 2627 report_uninit(sv);
7e25a7e9
NC
2628 assert (SvTYPE(sv) >= SVt_NV);
2629 /* Typically the caller expects that sv_any is not NULL now. */
2630 /* XXX Ilya implies that this is a bug in callers that assume this
2631 and ideally should be fixed. */
a0d0e21e 2632 return 0.0;
79072805 2633 }
572bbb43 2634#if defined(USE_LONG_DOUBLE)
097ee67d 2635 DEBUG_c({
f93f4e46 2636 STORE_NUMERIC_LOCAL_SET_STANDARD();
1d7c1841
GS
2637 PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2nv(%" PERL_PRIgldbl ")\n",
2638 PTR2UV(sv), SvNVX(sv));
572bbb43
GS
2639 RESTORE_NUMERIC_LOCAL();
2640 });
65202027 2641#else
572bbb43 2642 DEBUG_c({
f93f4e46 2643 STORE_NUMERIC_LOCAL_SET_STANDARD();
1779d84d 2644 PerlIO_printf(Perl_debug_log, "0x%"UVxf" 1nv(%"NVgf")\n",
1d7c1841 2645 PTR2UV(sv), SvNVX(sv));
097ee67d
JH
2646 RESTORE_NUMERIC_LOCAL();
2647 });
572bbb43 2648#endif
463ee0b2 2649 return SvNVX(sv);
79072805
LW
2650}
2651
800401ee
JH
2652/*
2653=for apidoc sv_2num
2654
2655Return an SV with the numeric value of the source SV, doing any necessary
a196a5fa
JH
2656reference or overload conversion. You must use the C<SvNUM(sv)> macro to
2657access this function.
800401ee
JH
2658
2659=cut
2660*/
2661
2662SV *
5de3775c 2663Perl_sv_2num(pTHX_ register SV *const sv)
800401ee 2664{
7918f24d
NC
2665 PERL_ARGS_ASSERT_SV_2NUM;
2666
b9ee0594
RGS
2667 if (!SvROK(sv))
2668 return sv;
800401ee 2669 if (SvAMAGIC(sv)) {
31d632c3 2670 SV * const tmpsv = AMG_CALLunary(sv, numer_amg);
a02ec77a 2671 TAINT_IF(tmpsv && SvTAINTED(tmpsv));
800401ee
JH
2672 if (tmpsv && (!SvROK(tmpsv) || (SvRV(tmpsv) != SvRV(sv))))
2673 return sv_2num(tmpsv);
2674 }
2675 return sv_2mortal(newSVuv(PTR2UV(SvRV(sv))));
2676}
2677
645c22ef
DM
2678/* uiv_2buf(): private routine for use by sv_2pv_flags(): print an IV or
2679 * UV as a string towards the end of buf, and return pointers to start and
2680 * end of it.
2681 *
2682 * We assume that buf is at least TYPE_CHARS(UV) long.
2683 */
2684
864dbfa3 2685static char *
5de3775c 2686S_uiv_2buf(char *const buf, const IV iv, UV uv, const int is_uv, char **const peob)
25da4f38 2687{
25da4f38 2688 char *ptr = buf + TYPE_CHARS(UV);
823a54a3 2689 char * const ebuf = ptr;
25da4f38 2690 int sign;
25da4f38 2691
7918f24d
NC
2692 PERL_ARGS_ASSERT_UIV_2BUF;
2693
25da4f38
IZ
2694 if (is_uv)
2695 sign = 0;
2696 else if (iv >= 0) {
2697 uv = iv;
2698 sign = 0;
2699 } else {
2700 uv = -iv;
2701 sign = 1;
2702 }
2703 do {
eb160463 2704 *--ptr = '0' + (char)(uv % 10);
25da4f38
IZ
2705 } while (uv /= 10);
2706 if (sign)
2707 *--ptr = '-';
2708 *peob = ebuf;
2709 return ptr;
2710}
2711
645c22ef
DM
2712/*
2713=for apidoc sv_2pv_flags
2714
ff276b08 2715Returns a pointer to the string value of an SV, and sets *lp to its length.
645c22ef
DM
2716If flags includes SV_GMAGIC, does an mg_get() first. Coerces sv to a string
2717if necessary.
2718Normally invoked via the C<SvPV_flags> macro. C<sv_2pv()> and C<sv_2pv_nomg>
2719usually end up here too.
2720
2721=cut
2722*/
2723
8d6d96c1 2724char *
5de3775c 2725Perl_sv_2pv_flags(pTHX_ register SV *const sv, STRLEN *const lp, const I32 flags)
8d6d96c1 2726{
97aff369 2727 dVAR;
79072805 2728 register char *s;
79072805 2729
463ee0b2 2730 if (!sv) {
cdb061a3
NC
2731 if (lp)
2732 *lp = 0;
73d840c0 2733 return (char *)"";
463ee0b2 2734 }
8990e307 2735 if (SvGMAGICAL(sv)) {
8d6d96c1
HS
2736 if (flags & SV_GMAGIC)
2737 mg_get(sv);
463ee0b2 2738 if (SvPOKp(sv)) {
cdb061a3
NC
2739 if (lp)
2740 *lp = SvCUR(sv);
10516c54
NC
2741 if (flags & SV_MUTABLE_RETURN)
2742 return SvPVX_mutable(sv);
4d84ee25
NC
2743 if (flags & SV_CONST_RETURN)
2744 return (char *)SvPVX_const(sv);
463ee0b2
LW
2745 return SvPVX(sv);
2746 }
75dfc8ec
NC
2747 if (SvIOKp(sv) || SvNOKp(sv)) {
2748 char tbuf[64]; /* Must fit sprintf/Gconvert of longest IV/NV */
75dfc8ec
NC
2749 STRLEN len;
2750
2751 if (SvIOKp(sv)) {
e80fed9d 2752 len = SvIsUV(sv)
d9fad198
JH
2753 ? my_snprintf(tbuf, sizeof(tbuf), "%"UVuf, (UV)SvUVX(sv))
2754 : my_snprintf(tbuf, sizeof(tbuf), "%"IVdf, (IV)SvIVX(sv));
29912d93
NC
2755 } else if(SvNVX(sv) == 0.0) {
2756 tbuf[0] = '0';
2757 tbuf[1] = 0;
2758 len = 1;
75dfc8ec 2759 } else {
e8ada2d0
NC
2760 Gconvert(SvNVX(sv), NV_DIG, 0, tbuf);
2761 len = strlen(tbuf);
75dfc8ec 2762 }
b5b886f0
NC
2763 assert(!SvROK(sv));
2764 {
75dfc8ec
NC
2765 dVAR;
2766
75dfc8ec
NC
2767 SvUPGRADE(sv, SVt_PV);
2768 if (lp)
2769 *lp = len;
2770 s = SvGROW_mutable(sv, len + 1);
2771 SvCUR_set(sv, len);
2772 SvPOKp_on(sv);
10edeb5d 2773 return (char*)memcpy(s, tbuf, len + 1);
75dfc8ec 2774 }
463ee0b2 2775 }
1c7ff15e
NC
2776 if (SvROK(sv)) {
2777 goto return_rok;
2778 }
2779 assert(SvTYPE(sv) >= SVt_PVMG);
2780 /* This falls through to the report_uninit near the end of the
2781 function. */
2782 } else if (SvTHINKFIRST(sv)) {
ed6116ce 2783 if (SvROK(sv)) {
1c7ff15e 2784 return_rok:
deb46114 2785 if (SvAMAGIC(sv)) {
aee036bb
DM
2786 SV *tmpstr;
2787 if (flags & SV_SKIP_OVERLOAD)
2788 return NULL;
31d632c3 2789 tmpstr = AMG_CALLunary(sv, string_amg);
a02ec77a 2790 TAINT_IF(tmpstr && SvTAINTED(tmpstr));
deb46114
NC
2791 if (tmpstr && (!SvROK(tmpstr) || (SvRV(tmpstr) != SvRV(sv)))) {
2792 /* Unwrap this: */
2793 /* char *pv = lp ? SvPV(tmpstr, *lp) : SvPV_nolen(tmpstr);
2794 */
2795
2796 char *pv;
2797 if ((SvFLAGS(tmpstr) & (SVf_POK)) == SVf_POK) {
2798 if (flags & SV_CONST_RETURN) {
2799 pv = (char *) SvPVX_const(tmpstr);
2800 } else {
2801 pv = (flags & SV_MUTABLE_RETURN)
2802 ? SvPVX_mutable(tmpstr) : SvPVX(tmpstr);
2803 }
2804 if (lp)
2805 *lp = SvCUR(tmpstr);
50adf7d2 2806 } else {
deb46114 2807 pv = sv_2pv_flags(tmpstr, lp, flags);
50adf7d2 2808 }
deb46114
NC
2809 if (SvUTF8(tmpstr))
2810 SvUTF8_on(sv);
2811 else
2812 SvUTF8_off(sv);
2813 return pv;
50adf7d2 2814 }
deb46114
NC
2815 }
2816 {
fafee734
NC
2817 STRLEN len;
2818 char *retval;
2819 char *buffer;
d2c6dc5e 2820 SV *const referent = SvRV(sv);
d8eae41e
NC
2821
2822 if (!referent) {
fafee734
NC
2823 len = 7;
2824 retval = buffer = savepvn("NULLREF", len);
5c35adbb 2825 } else if (SvTYPE(referent) == SVt_REGEXP) {
d2c6dc5e 2826 REGEXP * const re = (REGEXP *)MUTABLE_PTR(referent);
67d2d14d
AB
2827 I32 seen_evals = 0;
2828
2829 assert(re);
2830
2831 /* If the regex is UTF-8 we want the containing scalar to
2832 have an UTF-8 flag too */
2833 if (RX_UTF8(re))
2834 SvUTF8_on(sv);
2835 else
2836 SvUTF8_off(sv);
2837
2838 if ((seen_evals = RX_SEEN_EVALS(re)))
2839 PL_reginterp_cnt += seen_evals;
2840
2841 if (lp)
2842 *lp = RX_WRAPLEN(re);
2843
2844 return RX_WRAPPED(re);
d8eae41e
NC
2845 } else {
2846 const char *const typestr = sv_reftype(referent, 0);
fafee734
NC
2847 const STRLEN typelen = strlen(typestr);
2848 UV addr = PTR2UV(referent);
2849 const char *stashname = NULL;
2850 STRLEN stashnamelen = 0; /* hush, gcc */
2851 const char *buffer_end;
d8eae41e 2852
d8eae41e 2853 if (SvOBJECT(referent)) {
fafee734
NC
2854 const HEK *const name = HvNAME_HEK(SvSTASH(referent));
2855
2856 if (name) {
2857 stashname = HEK_KEY(name);
2858 stashnamelen = HEK_LEN(name);
2859
2860 if (HEK_UTF8(name)) {
2861 SvUTF8_on(sv);
2862 } else {
2863 SvUTF8_off(sv);
2864 }
2865 } else {
2866 stashname = "__ANON__";
2867 stashnamelen = 8;
2868 }
2869 len = stashnamelen + 1 /* = */ + typelen + 3 /* (0x */
2870 + 2 * sizeof(UV) + 2 /* )\0 */;
2871 } else {
2872 len = typelen + 3 /* (0x */
2873 + 2 * sizeof(UV) + 2 /* )\0 */;
d8eae41e 2874 }
fafee734
NC
2875
2876 Newx(buffer, len, char);
2877 buffer_end = retval = buffer + len;
2878
2879 /* Working backwards */
2880 *--retval = '\0';
2881 *--retval = ')';
2882 do {
2883 *--retval = PL_hexdigit[addr & 15];
2884 } while (addr >>= 4);
2885 *--retval = 'x';
2886 *--retval = '0';
2887 *--retval = '(';
2888
2889 retval -= typelen;
2890 memcpy(retval, typestr, typelen);
2891
2892 if (stashname) {
2893 *--retval = '=';
2894 retval -= stashnamelen;
2895 memcpy(retval, stashname, stashnamelen);
2896 }
486ec47a 2897 /* retval may not necessarily have reached the start of the
fafee734
NC
2898 buffer here. */
2899 assert (retval >= buffer);
2900
2901 len = buffer_end - retval - 1; /* -1 for that \0 */
c080367d 2902 }
042dae7a 2903 if (lp)
fafee734
NC
2904 *lp = len;
2905 SAVEFREEPV(buffer);
2906 return retval;
463ee0b2 2907 }
79072805 2908 }
0336b60e 2909 if (SvREADONLY(sv) && !SvOK(sv)) {
cdb061a3
NC
2910 if (lp)
2911 *lp = 0;
9f621bb0
NC
2912 if (flags & SV_UNDEF_RETURNS_NULL)
2913 return NULL;
2914 if (ckWARN(WARN_UNINITIALIZED))
2915 report_uninit(sv);
73d840c0 2916 return (char *)"";
79072805 2917 }
79072805 2918 }
28e5dec8
JH
2919 if (SvIOK(sv) || ((SvIOKp(sv) && !SvNOKp(sv)))) {
2920 /* I'm assuming that if both IV and NV are equally valid then
2921 converting the IV is going to be more efficient */
e1ec3a88 2922 const U32 isUIOK = SvIsUV(sv);
28e5dec8
JH
2923 char buf[TYPE_CHARS(UV)];
2924 char *ebuf, *ptr;
97a130b8 2925 STRLEN len;
28e5dec8
JH
2926
2927 if (SvTYPE(sv) < SVt_PVIV)
2928 sv_upgrade(sv, SVt_PVIV);
4ea1d550 2929 ptr = uiv_2buf(buf, SvIVX(sv), SvUVX(sv), isUIOK, &ebuf);
97a130b8 2930 len = ebuf - ptr;
5902b6a9 2931 /* inlined from sv_setpvn */
97a130b8
NC
2932 s = SvGROW_mutable(sv, len + 1);
2933 Move(ptr, s, len, char);
2934 s += len;
28e5dec8 2935 *s = '\0';
28e5dec8
JH
2936 }
2937 else if (SvNOKp(sv)) {
79072805
LW
2938 if (SvTYPE(sv) < SVt_PVNV)
2939 sv_upgrade(sv, SVt_PVNV);
29912d93
NC
2940 if (SvNVX(sv) == 0.0) {
2941 s = SvGROW_mutable(sv, 2);
2942 *s++ = '0';
2943 *s = '\0';
2944 } else {
2945 dSAVE_ERRNO;
2946 /* The +20 is pure guesswork. Configure test needed. --jhi */
2947 s = SvGROW_mutable(sv, NV_DIG + 20);
2948 /* some Xenix systems wipe out errno here */
2d4389e4 2949 Gconvert(SvNVX(sv), NV_DIG, 0, s);
29912d93
NC
2950 RESTORE_ERRNO;
2951 while (*s) s++;
bbce6d69 2952 }
79072805
LW
2953#ifdef hcx
2954 if (s[-1] == '.')
46fc3d4c 2955 *--s = '\0';
79072805
LW
2956#endif
2957 }
79072805 2958 else {
8d1c3e26
NC
2959 if (isGV_with_GP(sv)) {
2960 GV *const gv = MUTABLE_GV(sv);
2961 const U32 wasfake = SvFLAGS(gv) & SVf_FAKE;
2962 SV *const buffer = sv_newmortal();
2963
2964 /* FAKE globs can get coerced, so need to turn this off temporarily
2965 if it is on. */
2966 SvFAKE_off(gv);
2967 gv_efullname3(buffer, gv, "*");
2968 SvFLAGS(gv) |= wasfake;
2969
1809c940
DM
2970 if (SvPOK(buffer)) {
2971 if (lp) {
2972 *lp = SvCUR(buffer);
2973 }
2974 return SvPVX(buffer);
2975 }
2976 else {
2977 if (lp)
2978 *lp = 0;
2979 return (char *)"";
8d1c3e26 2980 }
8d1c3e26 2981 }
180488f8 2982
cdb061a3 2983 if (lp)
00b6aa41 2984 *lp = 0;
9f621bb0
NC
2985 if (flags & SV_UNDEF_RETURNS_NULL)
2986 return NULL;
2987 if (!PL_localizing && !(SvFLAGS(sv) & SVs_PADTMP) && ckWARN(WARN_UNINITIALIZED))
2988 report_uninit(sv);
25da4f38
IZ
2989 if (SvTYPE(sv) < SVt_PV)
2990 /* Typically the caller expects that sv_any is not NULL now. */
2991 sv_upgrade(sv, SVt_PV);
73d840c0 2992 return (char *)"";
79072805 2993 }
cdb061a3 2994 {
823a54a3 2995 const STRLEN len = s - SvPVX_const(sv);
cdb061a3
NC
2996 if (lp)
2997 *lp = len;
2998 SvCUR_set(sv, len);
2999 }
79072805 3000 SvPOK_on(sv);
1d7c1841 3001 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2pv(%s)\n",
3f7c398e 3002 PTR2UV(sv),SvPVX_const(sv)));
4d84ee25
NC
3003 if (flags & SV_CONST_RETURN)
3004 return (char *)SvPVX_const(sv);
10516c54
NC
3005 if (flags & SV_MUTABLE_RETURN)
3006 return SvPVX_mutable(sv);
463ee0b2
LW
3007 return SvPVX(sv);
3008}
3009
645c22ef 3010/*
6050d10e
JP
3011=for apidoc sv_copypv
3012
3013Copies a stringified representation of the source SV into the
3014destination SV. Automatically performs any necessary mg_get and
54f0641b 3015coercion of numeric values into strings. Guaranteed to preserve
2575c402 3016UTF8 flag even from overloaded objects. Similar in nature to
54f0641b
NIS
3017sv_2pv[_flags] but operates directly on an SV instead of just the
3018string. Mostly uses sv_2pv_flags to do its work, except when that
6050d10e
JP
3019would lose the UTF-8'ness of the PV.
3020
3021=cut
3022*/
3023
3024void
5de3775c 3025Perl_sv_copypv(pTHX_ SV *const dsv, register SV *const ssv)
6050d10e 3026{
446eaa42 3027 STRLEN len;
53c1dcc0 3028 const char * const s = SvPV_const(ssv,len);
7918f24d
NC
3029
3030 PERL_ARGS_ASSERT_SV_COPYPV;
3031
cb50f42d 3032 sv_setpvn(dsv,s,len);
446eaa42 3033 if (SvUTF8(ssv))
cb50f42d 3034 SvUTF8_on(dsv);
446eaa42 3035 else
cb50f42d 3036 SvUTF8_off(dsv);
6050d10e
JP
3037}
3038
3039/*
645c22ef
DM
3040=for apidoc sv_2pvbyte
3041
3042Return a pointer to the byte-encoded representation of the SV, and set *lp
1e54db1a 3043to its length. May cause the SV to be downgraded from UTF-8 as a
645c22ef
DM
3044side-effect.
3045
3046Usually accessed via the C<SvPVbyte> macro.
3047
3048=cut
3049*/
3050
7340a771 3051char *
5de3775c 3052Perl_sv_2pvbyte(pTHX_ register SV *const sv, STRLEN *const lp)
7340a771 3053{
7918f24d
NC
3054 PERL_ARGS_ASSERT_SV_2PVBYTE;
3055
71eb6d8c 3056 SvGETMAGIC(sv);
0875d2fe 3057 sv_utf8_downgrade(sv,0);
71eb6d8c 3058 return lp ? SvPV_nomg(sv,*lp) : SvPV_nomg_nolen(sv);
7340a771
GS
3059}
3060
645c22ef 3061/*
035cbb0e
RGS
3062=for apidoc sv_2pvutf8
3063
3064Return a pointer to the UTF-8-encoded representation of the SV, and set *lp
3065to its length. May cause the SV to be upgraded to UTF-8 as a side-effect.
3066
3067Usually accessed via the C<SvPVutf8> macro.
3068
3069=cut
3070*/
645c22ef 3071
7340a771 3072char *
7bc54cea 3073Perl_sv_2pvutf8(pTHX_ register SV *const sv, STRLEN *const lp)
7340a771 3074{
7918f24d
NC
3075 PERL_ARGS_ASSERT_SV_2PVUTF8;
3076
035cbb0e
RGS
3077 sv_utf8_upgrade(sv);
3078 return lp ? SvPV(sv,*lp) : SvPV_nolen(sv);
7340a771 3079}
1c846c1f 3080
7ee2227d 3081
645c22ef
DM
3082/*
3083=for apidoc sv_2bool
3084
06c841cf
FC
3085This macro is only used by sv_true() or its macro equivalent, and only if
3086the latter's argument is neither SvPOK, SvIOK nor SvNOK.
3087It calls sv_2bool_flags with the SV_GMAGIC flag.
3088
3089=for apidoc sv_2bool_flags
3090
3091This function is only used by sv_true() and friends, and only if
3092the latter's argument is neither SvPOK, SvIOK nor SvNOK. If the flags
3093contain SV_GMAGIC, then it does an mg_get() first.
3094
645c22ef
DM
3095
3096=cut
3097*/
3098
463ee0b2 3099bool
06c841cf 3100Perl_sv_2bool_flags(pTHX_ register SV *const sv, const I32 flags)
463ee0b2 3101{
97aff369 3102 dVAR;
7918f24d 3103
06c841cf 3104 PERL_ARGS_ASSERT_SV_2BOOL_FLAGS;
7918f24d 3105
06c841cf 3106 if(flags & SV_GMAGIC) SvGETMAGIC(sv);
463ee0b2 3107
a0d0e21e
LW
3108 if (!SvOK(sv))
3109 return 0;
3110 if (SvROK(sv)) {
fabdb6c0 3111 if (SvAMAGIC(sv)) {
31d632c3 3112 SV * const tmpsv = AMG_CALLunary(sv, bool__amg);
fabdb6c0 3113 if (tmpsv && (!SvROK(tmpsv) || (SvRV(tmpsv) != SvRV(sv))))
f2338a2e 3114 return cBOOL(SvTRUE(tmpsv));
fabdb6c0
AL
3115 }
3116 return SvRV(sv) != 0;
a0d0e21e 3117 }
463ee0b2 3118 if (SvPOKp(sv)) {
53c1dcc0
AL
3119 register XPV* const Xpvtmp = (XPV*)SvANY(sv);
3120 if (Xpvtmp &&
339049b0 3121 (*sv->sv_u.svu_pv > '0' ||
11343788 3122 Xpvtmp->xpv_cur > 1 ||
339049b0 3123 (Xpvtmp->xpv_cur && *sv->sv_u.svu_pv != '0')))
463ee0b2
LW
3124 return 1;
3125 else
3126 return 0;
3127 }
3128 else {
3129 if (SvIOKp(sv))
3130 return SvIVX(sv) != 0;
3131 else {
3132 if (SvNOKp(sv))
3133 return SvNVX(sv) != 0.0;
180488f8 3134 else {
f7877b28 3135 if (isGV_with_GP(sv))
180488f8
NC
3136 return TRUE;
3137 else
3138 return FALSE;
3139 }
463ee0b2
LW
3140 }
3141 }
79072805
LW
3142}
3143
c461cf8f
JH
3144/*
3145=for apidoc sv_utf8_upgrade
3146
78ea37eb 3147Converts the PV of an SV to its UTF-8-encoded form.
645c22ef 3148Forces the SV to string form if it is not already.
2bbc8d55 3149Will C<mg_get> on C<sv> if appropriate.
4411f3b6 3150Always sets the SvUTF8 flag to avoid future validity checks even
2bbc8d55
SP
3151if the whole string is the same in UTF-8 as not.
3152Returns the number of bytes in the converted string
c461cf8f 3153
13a6c0e0
JH
3154This is not as a general purpose byte encoding to Unicode interface:
3155use the Encode extension for that.
3156
fe749c9a
KW
3157=for apidoc sv_utf8_upgrade_nomg
3158
3159Like sv_utf8_upgrade, but doesn't do magic on C<sv>
3160
8d6d96c1
HS
3161=for apidoc sv_utf8_upgrade_flags
3162
78ea37eb 3163Converts the PV of an SV to its UTF-8-encoded form.
645c22ef 3164Forces the SV to string form if it is not already.
8d6d96c1 3165Always sets the SvUTF8 flag to avoid future validity checks even
2bbc8d55
SP
3166if all the bytes are invariant in UTF-8. If C<flags> has C<SV_GMAGIC> bit set,
3167will C<mg_get> on C<sv> if appropriate, else not.
3168Returns the number of bytes in the converted string
3169C<sv_utf8_upgrade> and
8d6d96c1
HS
3170C<sv_utf8_upgrade_nomg> are implemented in terms of this function.
3171
13a6c0e0
JH
3172This is not as a general purpose byte encoding to Unicode interface:
3173use the Encode extension for that.
3174
8d6d96c1 3175=cut
b3ab6785
KW
3176
3177The grow version is currently not externally documented. It adds a parameter,
3178extra, which is the number of unused bytes the string of 'sv' is guaranteed to
3179have free after it upon return. This allows the caller to reserve extra space
3180that it intends to fill, to avoid extra grows.
3181
3182Also externally undocumented for the moment is the flag SV_FORCE_UTF8_UPGRADE,
3183which can be used to tell this function to not first check to see if there are
3184any characters that are different in UTF-8 (variant characters) which would
3185force it to allocate a new string to sv, but to assume there are. Typically
3186this flag is used by a routine that has already parsed the string to find that
3187there are such characters, and passes this information on so that the work
3188doesn't have to be repeated.
3189
3190(One might think that the calling routine could pass in the position of the
3191first such variant, so it wouldn't have to be found again. But that is not the
3192case, because typically when the caller is likely to use this flag, it won't be
3193calling this routine unless it finds something that won't fit into a byte.
3194Otherwise it tries to not upgrade and just use bytes. But some things that
3195do fit into a byte are variants in utf8, and the caller may not have been
3196keeping track of these.)
3197
3198If the routine itself changes the string, it adds a trailing NUL. Such a NUL
3199isn't guaranteed due to having other routines do the work in some input cases,
3200or if the input is already flagged as being in utf8.
3201
3202The speed of this could perhaps be improved for many cases if someone wanted to
3203write a fast function that counts the number of variant characters in a string,
3204especially if it could return the position of the first one.
3205
8d6d96c1
HS
3206*/
3207
3208STRLEN
b3ab6785 3209Perl_sv_utf8_upgrade_flags_grow(pTHX_ register SV *const sv, const I32 flags, STRLEN extra)
8d6d96c1 3210{
97aff369 3211 dVAR;
7918f24d 3212
b3ab6785 3213 PERL_ARGS_ASSERT_SV_UTF8_UPGRADE_FLAGS_GROW;
7918f24d 3214
808c356f
RGS
3215 if (sv == &PL_sv_undef)
3216 return 0;
e0e62c2a
NIS
3217 if (!SvPOK(sv)) {
3218 STRLEN len = 0;
d52b7888
NC
3219 if (SvREADONLY(sv) && (SvPOKp(sv) || SvIOKp(sv) || SvNOKp(sv))) {
3220 (void) sv_2pv_flags(sv,&len, flags);
b3ab6785
KW
3221 if (SvUTF8(sv)) {
3222 if (extra) SvGROW(sv, SvCUR(sv) + extra);
d52b7888 3223 return len;
b3ab6785 3224 }
d52b7888 3225 } else {
33fb6f35 3226 (void) SvPV_force_flags(sv,len,flags & SV_GMAGIC);
d52b7888 3227 }
e0e62c2a 3228 }
4411f3b6 3229
f5cee72b 3230 if (SvUTF8(sv)) {
b3ab6785 3231 if (extra) SvGROW(sv, SvCUR(sv) + extra);
5fec3b1d 3232 return SvCUR(sv);
f5cee72b 3233 }
5fec3b1d 3234
765f542d
NC
3235 if (SvIsCOW(sv)) {
3236 sv_force_normal_flags(sv, 0);
db42d148
NIS
3237 }
3238
b3ab6785 3239 if (PL_encoding && !(flags & SV_UTF8_NO_ENCODING)) {
799ef3cb 3240 sv_recode_to_utf8(sv, PL_encoding);
b3ab6785
KW
3241 if (extra) SvGROW(sv, SvCUR(sv) + extra);
3242 return SvCUR(sv);
3243 }
3244
4e93345f
KW
3245 if (SvCUR(sv) == 0) {
3246 if (extra) SvGROW(sv, extra);
3247 } else { /* Assume Latin-1/EBCDIC */
c4e7c712 3248 /* This function could be much more efficient if we
2bbc8d55 3249 * had a FLAG in SVs to signal if there are any variant
c4e7c712 3250 * chars in the PV. Given that there isn't such a flag
b3ab6785
KW
3251 * make the loop as fast as possible (although there are certainly ways
3252 * to speed this up, eg. through vectorization) */
3253 U8 * s = (U8 *) SvPVX_const(sv);
3254 U8 * e = (U8 *) SvEND(sv);
3255 U8 *t = s;
3256 STRLEN two_byte_count = 0;
c4e7c712 3257
b3ab6785
KW
3258 if (flags & SV_FORCE_UTF8_UPGRADE) goto must_be_utf8;
3259
3260 /* See if really will need to convert to utf8. We mustn't rely on our
3261 * incoming SV being well formed and having a trailing '\0', as certain
3262 * code in pp_formline can send us partially built SVs. */
3263
c4e7c712 3264 while (t < e) {
53c1dcc0 3265 const U8 ch = *t++;
b3ab6785
KW
3266 if (NATIVE_IS_INVARIANT(ch)) continue;
3267
3268 t--; /* t already incremented; re-point to first variant */
3269 two_byte_count = 1;
3270 goto must_be_utf8;
c4e7c712 3271 }
b3ab6785
KW
3272
3273 /* utf8 conversion not needed because all are invariants. Mark as
3274 * UTF-8 even if no variant - saves scanning loop */
c4e7c712 3275 SvUTF8_on(sv);
b3ab6785
KW
3276 return SvCUR(sv);
3277
3278must_be_utf8:
3279
3280 /* Here, the string should be converted to utf8, either because of an
3281 * input flag (two_byte_count = 0), or because a character that
3282 * requires 2 bytes was found (two_byte_count = 1). t points either to
3283 * the beginning of the string (if we didn't examine anything), or to
3284 * the first variant. In either case, everything from s to t - 1 will
3285 * occupy only 1 byte each on output.
3286 *
3287 * There are two main ways to convert. One is to create a new string
3288 * and go through the input starting from the beginning, appending each
3289 * converted value onto the new string as we go along. It's probably
3290 * best to allocate enough space in the string for the worst possible
3291 * case rather than possibly running out of space and having to
3292 * reallocate and then copy what we've done so far. Since everything
3293 * from s to t - 1 is invariant, the destination can be initialized
3294 * with these using a fast memory copy
3295 *
3296 * The other way is to figure out exactly how big the string should be
3297 * by parsing the entire input. Then you don't have to make it big
3298 * enough to handle the worst possible case, and more importantly, if
3299 * the string you already have is large enough, you don't have to
3300 * allocate a new string, you can copy the last character in the input
3301 * string to the final position(s) that will be occupied by the
3302 * converted string and go backwards, stopping at t, since everything
3303 * before that is invariant.
3304 *
3305 * There are advantages and disadvantages to each method.
3306 *
3307 * In the first method, we can allocate a new string, do the memory
3308 * copy from the s to t - 1, and then proceed through the rest of the
3309 * string byte-by-byte.
3310 *
3311 * In the second method, we proceed through the rest of the input
3312 * string just calculating how big the converted string will be. Then
3313 * there are two cases:
3314 * 1) if the string has enough extra space to handle the converted
3315 * value. We go backwards through the string, converting until we
3316 * get to the position we are at now, and then stop. If this
3317 * position is far enough along in the string, this method is
3318 * faster than the other method. If the memory copy were the same
3319 * speed as the byte-by-byte loop, that position would be about
3320 * half-way, as at the half-way mark, parsing to the end and back
3321 * is one complete string's parse, the same amount as starting
3322 * over and going all the way through. Actually, it would be
3323 * somewhat less than half-way, as it's faster to just count bytes
3324 * than to also copy, and we don't have the overhead of allocating
3325 * a new string, changing the scalar to use it, and freeing the
3326 * existing one. But if the memory copy is fast, the break-even
3327 * point is somewhere after half way. The counting loop could be
3328 * sped up by vectorization, etc, to move the break-even point
3329 * further towards the beginning.
3330 * 2) if the string doesn't have enough space to handle the converted
3331 * value. A new string will have to be allocated, and one might
3332 * as well, given that, start from the beginning doing the first
3333 * method. We've spent extra time parsing the string and in
3334 * exchange all we've gotten is that we know precisely how big to
3335 * make the new one. Perl is more optimized for time than space,
3336 * so this case is a loser.
3337 * So what I've decided to do is not use the 2nd method unless it is
3338 * guaranteed that a new string won't have to be allocated, assuming
3339 * the worst case. I also decided not to put any more conditions on it
3340 * than this, for now. It seems likely that, since the worst case is
3341 * twice as big as the unknown portion of the string (plus 1), we won't
3342 * be guaranteed enough space, causing us to go to the first method,
3343 * unless the string is short, or the first variant character is near
3344 * the end of it. In either of these cases, it seems best to use the
3345 * 2nd method. The only circumstance I can think of where this would
3346 * be really slower is if the string had once had much more data in it
3347 * than it does now, but there is still a substantial amount in it */
3348
3349 {
3350 STRLEN invariant_head = t - s;
3351 STRLEN size = invariant_head + (e - t) * 2 + 1 + extra;
3352 if (SvLEN(sv) < size) {
3353
3354 /* Here, have decided to allocate a new string */
3355
3356 U8 *dst;
3357 U8 *d;
3358
3359 Newx(dst, size, U8);
3360
3361 /* If no known invariants at the beginning of the input string,
3362 * set so starts from there. Otherwise, can use memory copy to
3363 * get up to where we are now, and then start from here */
3364
3365 if (invariant_head <= 0) {
3366 d = dst;
3367 } else {
3368 Copy(s, dst, invariant_head, char);
3369 d = dst + invariant_head;
3370 }
3371
3372 while (t < e) {
3373 const UV uv = NATIVE8_TO_UNI(*t++);
3374 if (UNI_IS_INVARIANT(uv))
3375 *d++ = (U8)UNI_TO_NATIVE(uv);
3376 else {
3377 *d++ = (U8)UTF8_EIGHT_BIT_HI(uv);
3378 *d++ = (U8)UTF8_EIGHT_BIT_LO(uv);
3379 }
3380 }
3381 *d = '\0';
3382 SvPV_free(sv); /* No longer using pre-existing string */
3383 SvPV_set(sv, (char*)dst);
3384 SvCUR_set(sv, d - dst);
3385 SvLEN_set(sv, size);
3386 } else {
3387
3388 /* Here, have decided to get the exact size of the string.
3389 * Currently this happens only when we know that there is
3390 * guaranteed enough space to fit the converted string, so
3391 * don't have to worry about growing. If two_byte_count is 0,
3392 * then t points to the first byte of the string which hasn't
3393 * been examined yet. Otherwise two_byte_count is 1, and t
3394 * points to the first byte in the string that will expand to
3395 * two. Depending on this, start examining at t or 1 after t.
3396 * */
3397
3398 U8 *d = t + two_byte_count;
3399
3400
3401 /* Count up the remaining bytes that expand to two */
3402
3403 while (d < e) {
3404 const U8 chr = *d++;
3405 if (! NATIVE_IS_INVARIANT(chr)) two_byte_count++;
3406 }
3407
3408 /* The string will expand by just the number of bytes that
3409 * occupy two positions. But we are one afterwards because of
3410 * the increment just above. This is the place to put the
3411 * trailing NUL, and to set the length before we decrement */
3412
3413 d += two_byte_count;
3414 SvCUR_set(sv, d - s);
3415 *d-- = '\0';
3416
3417
3418 /* Having decremented d, it points to the position to put the
3419 * very last byte of the expanded string. Go backwards through
3420 * the string, copying and expanding as we go, stopping when we
3421 * get to the part that is invariant the rest of the way down */
3422
3423 e--;
3424 while (e >= t) {
3425 const U8 ch = NATIVE8_TO_UNI(*e--);
3426 if (UNI_IS_INVARIANT(ch)) {
3427 *d-- = UNI_TO_NATIVE(ch);
3428 } else {
3429 *d-- = (U8)UTF8_EIGHT_BIT_LO(ch);
3430 *d-- = (U8)UTF8_EIGHT_BIT_HI(ch);
3431 }
3432 }
3433 }
75da9d4c
DM
3434
3435 if (SvTYPE(sv) >= SVt_PVMG && SvMAGIC(sv)) {
3436 /* Update pos. We do it at the end rather than during
3437 * the upgrade, to avoid slowing down the common case
3438 * (upgrade without pos) */
3439 MAGIC * mg = mg_find(sv, PERL_MAGIC_regex_global);
3440 if (mg) {
3441 I32 pos = mg->mg_len;
3442 if (pos > 0 && (U32)pos > invariant_head) {
3443 U8 *d = (U8*) SvPVX(sv) + invariant_head;
3444 STRLEN n = (U32)pos - invariant_head;
3445 while (n > 0) {
3446 if (UTF8_IS_START(*d))
3447 d++;
3448 d++;
3449 n--;
3450 }
3451 mg->mg_len = d - (U8*)SvPVX(sv);
3452 }
3453 }
3454 if ((mg = mg_find(sv, PERL_MAGIC_utf8)))
3455 magic_setutf8(sv,mg); /* clear UTF8 cache */
3456 }
b3ab6785 3457 }
560a288e 3458 }
b3ab6785
KW
3459
3460 /* Mark as UTF-8 even if no variant - saves scanning loop */
3461 SvUTF8_on(sv);
4411f3b6 3462 return SvCUR(sv);
560a288e
GS
3463}
3464
c461cf8f
JH
3465/*
3466=for apidoc sv_utf8_downgrade
3467
78ea37eb 3468Attempts to convert the PV of an SV from characters to bytes.
2bbc8d55
SP
3469If the PV contains a character that cannot fit
3470in a byte, this conversion will fail;
78ea37eb 3471in this case, either returns false or, if C<fail_ok> is not
c461cf8f
JH
3472true, croaks.
3473
13a6c0e0
JH
3474This is not as a general purpose Unicode to byte encoding interface:
3475use the Encode extension for that.
3476
c461cf8f
JH
3477=cut
3478*/
3479
560a288e 3480bool
7bc54cea 3481Perl_sv_utf8_downgrade(pTHX_ register SV *const sv, const bool fail_ok)
560a288e 3482{
97aff369 3483 dVAR;
7918f24d
NC
3484
3485 PERL_ARGS_ASSERT_SV_UTF8_DOWNGRADE;
3486
78ea37eb 3487 if (SvPOKp(sv) && SvUTF8(sv)) {
fa301091 3488 if (SvCUR(sv)) {
03cfe0ae 3489 U8 *s;
652088fc 3490 STRLEN len;
75da9d4c 3491 int mg_flags = SV_GMAGIC;
fa301091 3492
765f542d
NC
3493 if (SvIsCOW(sv)) {
3494 sv_force_normal_flags(sv, 0);
3495 }
75da9d4c
DM
3496 if (SvTYPE(sv) >= SVt_PVMG && SvMAGIC(sv)) {
3497 /* update pos */
3498 MAGIC * mg = mg_find(sv, PERL_MAGIC_regex_global);
3499 if (mg) {
3500 I32 pos = mg->mg_len;
3501 if (pos > 0) {
3502 sv_pos_b2u(sv, &pos);
3503 mg_flags = 0; /* sv_pos_b2u does get magic */
3504 mg->mg_len = pos;
3505 }
3506 }
3507 if ((mg = mg_find(sv, PERL_MAGIC_utf8)))
3508 magic_setutf8(sv,mg); /* clear UTF8 cache */
3509
3510 }
3511 s = (U8 *) SvPV_flags(sv, len, mg_flags);
3512
03cfe0ae 3513 if (!utf8_to_bytes(s, &len)) {
fa301091
JH
3514 if (fail_ok)
3515 return FALSE;
3516 else {
3517 if (PL_op)
3518 Perl_croak(aTHX_ "Wide character in %s",
53e06cf0 3519 OP_DESC(PL_op));
fa301091
JH
3520 else
3521 Perl_croak(aTHX_ "Wide character");
3522 }
4b3603a4 3523 }
b162af07 3524 SvCUR_set(sv, len);
67e989fb 3525 }
560a288e 3526 }
ffebcc3e 3527 SvUTF8_off(sv);
560a288e
GS
3528 return TRUE;
3529}
3530
c461cf8f
JH
3531/*
3532=for apidoc sv_utf8_encode
3533
78ea37eb
ST
3534Converts the PV of an SV to UTF-8, but then turns the C<SvUTF8>
3535flag off so that it looks like octets again.
c461cf8f
JH
3536
3537=cut
3538*/
3539
560a288e 3540void
7bc54cea 3541Perl_sv_utf8_encode(pTHX_ register SV *const sv)
560a288e 3542{
7918f24d
NC
3543 PERL_ARGS_ASSERT_SV_UTF8_ENCODE;
3544
4c94c214
NC
3545 if (SvIsCOW(sv)) {
3546 sv_force_normal_flags(sv, 0);
3547 }
3548 if (SvREADONLY(sv)) {
6ad8f254 3549 Perl_croak_no_modify(aTHX);
4c94c214 3550 }
a5f5288a 3551 (void) sv_utf8_upgrade(sv);
560a288e
GS
3552 SvUTF8_off(sv);
3553}
3554
4411f3b6
NIS
3555/*
3556=for apidoc sv_utf8_decode
3557
78ea37eb
ST
3558If the PV of the SV is an octet sequence in UTF-8
3559and contains a multiple-byte character, the C<SvUTF8> flag is turned on
3560so that it looks like a character. If the PV contains only single-byte
694cf0d2 3561characters, the C<SvUTF8> flag stays off.
78ea37eb 3562Scans PV for validity and returns false if the PV is invalid UTF-8.
4411f3b6
NIS
3563
3564=cut
3565*/
3566
560a288e 3567bool
7bc54cea 3568Perl_sv_utf8_decode(pTHX_ register SV *const sv)
560a288e 3569{
7918f24d
NC
3570 PERL_ARGS_ASSERT_SV_UTF8_DECODE;
3571
78ea37eb 3572 if (SvPOKp(sv)) {
75da9d4c 3573 const U8 *start, *c;
93524f2b 3574 const U8 *e;
9cbac4c7 3575
645c22ef
DM
3576 /* The octets may have got themselves encoded - get them back as
3577 * bytes
3578 */
3579 if (!sv_utf8_downgrade(sv, TRUE))
560a288e
GS
3580 return FALSE;
3581
3582 /* it is actually just a matter of turning the utf8 flag on, but
3583 * we want to make sure everything inside is valid utf8 first.
3584 */
75da9d4c 3585 c = start = (const U8 *) SvPVX_const(sv);
63cd0674 3586 if (!is_utf8_string(c, SvCUR(sv)+1))
67e989fb 3587 return FALSE;
93524f2b 3588 e = (const U8 *) SvEND(sv);
511c2ff0 3589 while (c < e) {
b64e5050 3590 const U8 ch = *c++;
c4d5f83a 3591 if (!UTF8_IS_INVARIANT(ch)) {
67e989fb
JH
3592 SvUTF8_on(sv);
3593 break;
3594 }
560a288e 3595 }
75da9d4c
DM
3596 if (SvTYPE(sv) >= SVt_PVMG && SvMAGIC(sv)) {
3597 /* adjust pos to the start of a UTF8 char sequence */
3598 MAGIC * mg = mg_find(sv, PERL_MAGIC_regex_global);
3599 if (mg) {
3600 I32 pos = mg->mg_len;
3601 if (pos > 0) {
3602 for (c = start + pos; c > start; c--) {
3603 if (UTF8_IS_START(*c))
3604 break;
3605 }
3606 mg->mg_len = c - start;
3607 }
3608 }
3609 if ((mg = mg_find(sv, PERL_MAGIC_utf8)))
3610 magic_setutf8(sv,mg); /* clear UTF8 cache */
3611 }
560a288e
GS
3612 }
3613 return TRUE;
3614}
3615
954c1994
GS
3616/*
3617=for apidoc sv_setsv
3618
645c22ef
DM
3619Copies the contents of the source SV C<ssv> into the destination SV
3620C<dsv>. The source SV may be destroyed if it is mortal, so don't use this
3621function if the source SV needs to be reused. Does not handle 'set' magic.
3622Loosely speaking, it performs a copy-by-value, obliterating any previous
3623content of the destination.
3624
3625You probably want to use one of the assortment of wrappers, such as
3626C<SvSetSV>, C<SvSetSV_nosteal>, C<SvSetMagicSV> and
3627C<SvSetMagicSV_nosteal>.
3628
8d6d96c1
HS
3629=for apidoc sv_setsv_flags
3630
645c22ef
DM
3631Copies the contents of the source SV C<ssv> into the destination SV
3632C<dsv>. The source SV may be destroyed if it is mortal, so don't use this
3633function if the source SV needs to be reused. Does not handle 'set' magic.
3634Loosely speaking, it performs a copy-by-value, obliterating any previous
3635content of the destination.
3636If the C<flags> parameter has the C<SV_GMAGIC> bit set, will C<mg_get> on
5fcdf167
NC
3637C<ssv> if appropriate, else not. If the C<flags> parameter has the
3638C<NOSTEAL> bit set then the buffers of temps will not be stolen. <sv_setsv>
3639and C<sv_setsv_nomg> are implemented in terms of this function.
645c22ef
DM
3640
3641You probably want to use one of the assortment of wrappers, such as
3642C<SvSetSV>, C<SvSetSV_nosteal>, C<SvSetMagicSV> and
3643C<SvSetMagicSV_nosteal>.
3644
3645This is the primary function for copying scalars, and most other
3646copy-ish functions and macros use this underneath.
8d6d96c1
HS
3647
3648=cut
3649*/
3650
5d0301b7 3651static void
7bc54cea 3652S_glob_assign_glob(pTHX_ SV *const dstr, SV *const sstr, const int dtype)
5d0301b7 3653{
c8bbf675 3654 I32 mro_changes = 0; /* 1 = method, 2 = isa, 3 = recursive isa */
3e6edce2 3655 HV *old_stash = NULL;
dd69841b 3656
7918f24d
NC
3657 PERL_ARGS_ASSERT_GLOB_ASSIGN_GLOB;
3658
bec4f4b4 3659 if (dtype != SVt_PVGV && !isGV_with_GP(dstr)) {
5d0301b7
NC
3660 const char * const name = GvNAME(sstr);
3661 const STRLEN len = GvNAMELEN(sstr);
0d092c36 3662 {
f7877b28
NC
3663 if (dtype >= SVt_PV) {
3664 SvPV_free(dstr);