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