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