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